validate.py 0000644 00000134205 14751155147 0006726 0 ustar 00 # validate.py
# A Validator object
# Copyright (C) 2005-2014:
# (name) : (email)
# Michael Foord: fuzzyman AT voidspace DOT org DOT uk
# Mark Andrews: mark AT la-la DOT com
# Nicola Larosa: nico AT tekNico DOT net
# Rob Dennis: rdennis AT gmail DOT com
# Eli Courtwright: eli AT courtwright DOT org
# This software is licensed under the terms of the BSD license.
# http://opensource.org/licenses/BSD-3-Clause
# ConfigObj 5 - main repository for documentation and issue tracking:
# https://github.com/DiffSK/configobj
"""
The Validator object is used to check that supplied values
conform to a specification.
The value can be supplied as a string - e.g. from a config file.
In this case the check will also *convert* the value to
the required type. This allows you to add validation
as a transparent layer to access data stored as strings.
The validation checks that the data is correct *and*
converts it to the expected type.
Some standard checks are provided for basic data types.
Additional checks are easy to write. They can be
provided when the ``Validator`` is instantiated or
added afterwards.
The standard functions work with the following basic data types :
* integers
* floats
* booleans
* strings
* ip_addr
plus lists of these datatypes
Adding additional checks is done through coding simple functions.
The full set of standard checks are :
* 'integer': matches integer values (including negative)
Takes optional 'min' and 'max' arguments : ::
integer()
integer(3, 9) # any value from 3 to 9
integer(min=0) # any positive value
integer(max=9)
* 'float': matches float values
Has the same parameters as the integer check.
* 'boolean': matches boolean values - ``True`` or ``False``
Acceptable string values for True are :
true, on, yes, 1
Acceptable string values for False are :
false, off, no, 0
Any other value raises an error.
* 'ip_addr': matches an Internet Protocol address, v.4, represented
by a dotted-quad string, i.e. '1.2.3.4'.
* 'string': matches any string.
Takes optional keyword args 'min' and 'max'
to specify min and max lengths of the string.
* 'list': matches any list.
Takes optional keyword args 'min', and 'max' to specify min and
max sizes of the list. (Always returns a list.)
* 'tuple': matches any tuple.
Takes optional keyword args 'min', and 'max' to specify min and
max sizes of the tuple. (Always returns a tuple.)
* 'int_list': Matches a list of integers.
Takes the same arguments as list.
* 'float_list': Matches a list of floats.
Takes the same arguments as list.
* 'bool_list': Matches a list of boolean values.
Takes the same arguments as list.
* 'ip_addr_list': Matches a list of IP addresses.
Takes the same arguments as list.
* 'string_list': Matches a list of strings.
Takes the same arguments as list.
* 'mixed_list': Matches a list with different types in
specific positions. List size must match
the number of arguments.
Each position can be one of :
'integer', 'float', 'ip_addr', 'string', 'boolean'
So to specify a list with two strings followed
by two integers, you write the check as : ::
mixed_list('string', 'string', 'integer', 'integer')
* 'pass': This check matches everything ! It never fails
and the value is unchanged.
It is also the default if no check is specified.
* 'option': This check matches any from a list of options.
You specify this check with : ::
option('option 1', 'option 2', 'option 3')
You can supply a default value (returned if no value is supplied)
using the default keyword argument.
You specify a list argument for default using a list constructor syntax in
the check : ::
checkname(arg1, arg2, default=list('val 1', 'val 2', 'val 3'))
A badly formatted set of arguments will raise a ``VdtParamError``.
"""
__version__ = '1.0.1'
__all__ = (
'__version__',
'dottedQuadToNum',
'numToDottedQuad',
'ValidateError',
'VdtUnknownCheckError',
'VdtParamError',
'VdtTypeError',
'VdtValueError',
'VdtValueTooSmallError',
'VdtValueTooBigError',
'VdtValueTooShortError',
'VdtValueTooLongError',
'VdtMissingValue',
'Validator',
'is_integer',
'is_float',
'is_boolean',
'is_list',
'is_tuple',
'is_ip_addr',
'is_string',
'is_int_list',
'is_bool_list',
'is_float_list',
'is_string_list',
'is_ip_addr_list',
'is_mixed_list',
'is_option',
'__docformat__',
)
import re
import sys
from pprint import pprint
#TODO - #21 - six is part of the repo now, but we didn't switch over to it here
# this could be replaced if six is used for compatibility, or there are no
# more assertions about items being a string
if sys.version_info < (3,):
string_type = basestring
else:
string_type = str
# so tests that care about unicode on 2.x can specify unicode, and the same
# tests when run on 3.x won't complain about a undefined name "unicode"
# since all strings are unicode on 3.x we just want to pass it through
# unchanged
unicode = lambda x: x
# in python 3, all ints are equivalent to python 2 longs, and they'll
# never show "L" in the repr
long = int
_list_arg = re.compile(r'''
(?:
([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*list\(
(
(?:
\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)
\s*,\s*
)*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)? # last one
)
\)
)
''', re.VERBOSE | re.DOTALL) # two groups
_list_members = re.compile(r'''
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?) # unquoted
)
(?:
(?:\s*,\s*)|(?:\s*$) # comma
)
''', re.VERBOSE | re.DOTALL) # one group
_paramstring = r'''
(?:
(
(?:
[a-zA-Z_][a-zA-Z0-9_]*\s*=\s*list\(
(?:
\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)
\s*,\s*
)*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)? # last one
\)
)|
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?)| # unquoted
(?: # keyword argument
[a-zA-Z_][a-zA-Z0-9_]*\s*=\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?) # unquoted
)
)
)
)
(?:
(?:\s*,\s*)|(?:\s*$) # comma
)
)
'''
_matchstring = '^%s*' % _paramstring
# Python pre 2.2.1 doesn't have bool
try:
bool
except NameError:
def bool(val):
"""Simple boolean equivalent function. """
if val:
return 1
else:
return 0
def dottedQuadToNum(ip):
"""
Convert decimal dotted quad string to long integer
>>> int(dottedQuadToNum('1 '))
1
>>> int(dottedQuadToNum(' 1.2'))
16777218
>>> int(dottedQuadToNum(' 1.2.3 '))
16908291
>>> int(dottedQuadToNum('1.2.3.4'))
16909060
>>> dottedQuadToNum('255.255.255.255')
4294967295
>>> dottedQuadToNum('255.255.255.256')
Traceback (most recent call last):
ValueError: Not a good dotted-quad IP: 255.255.255.256
"""
# import here to avoid it when ip_addr values are not used
import socket, struct
try:
return struct.unpack('!L',
socket.inet_aton(ip.strip()))[0]
except socket.error:
raise ValueError('Not a good dotted-quad IP: %s' % ip)
return
def numToDottedQuad(num):
"""
Convert int or long int to dotted quad string
>>> numToDottedQuad(long(-1))
Traceback (most recent call last):
ValueError: Not a good numeric IP: -1
>>> numToDottedQuad(long(1))
'0.0.0.1'
>>> numToDottedQuad(long(16777218))
'1.0.0.2'
>>> numToDottedQuad(long(16908291))
'1.2.0.3'
>>> numToDottedQuad(long(16909060))
'1.2.3.4'
>>> numToDottedQuad(long(4294967295))
'255.255.255.255'
>>> numToDottedQuad(long(4294967296))
Traceback (most recent call last):
ValueError: Not a good numeric IP: 4294967296
>>> numToDottedQuad(-1)
Traceback (most recent call last):
ValueError: Not a good numeric IP: -1
>>> numToDottedQuad(1)
'0.0.0.1'
>>> numToDottedQuad(16777218)
'1.0.0.2'
>>> numToDottedQuad(16908291)
'1.2.0.3'
>>> numToDottedQuad(16909060)
'1.2.3.4'
>>> numToDottedQuad(4294967295)
'255.255.255.255'
>>> numToDottedQuad(4294967296)
Traceback (most recent call last):
ValueError: Not a good numeric IP: 4294967296
"""
# import here to avoid it when ip_addr values are not used
import socket, struct
# no need to intercept here, 4294967295L is fine
if num > long(4294967295) or num < 0:
raise ValueError('Not a good numeric IP: %s' % num)
try:
return socket.inet_ntoa(
struct.pack('!L', long(num)))
except (socket.error, struct.error, OverflowError):
raise ValueError('Not a good numeric IP: %s' % num)
class ValidateError(Exception):
"""
This error indicates that the check failed.
It can be the base class for more specific errors.
Any check function that fails ought to raise this error.
(or a subclass)
>>> raise ValidateError
Traceback (most recent call last):
ValidateError
"""
class VdtMissingValue(ValidateError):
"""No value was supplied to a check that needed one."""
class VdtUnknownCheckError(ValidateError):
"""An unknown check function was requested"""
def __init__(self, value):
"""
>>> raise VdtUnknownCheckError('yoda')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
"""
ValidateError.__init__(self, 'the check "%s" is unknown.' % (value,))
class VdtParamError(SyntaxError):
"""An incorrect parameter was passed"""
def __init__(self, name, value):
"""
>>> raise VdtParamError('yoda', 'jedi')
Traceback (most recent call last):
VdtParamError: passed an incorrect value "jedi" for parameter "yoda".
"""
SyntaxError.__init__(self, 'passed an incorrect value "%s" for parameter "%s".' % (value, name))
class VdtTypeError(ValidateError):
"""The value supplied was of the wrong type"""
def __init__(self, value):
"""
>>> raise VdtTypeError('jedi')
Traceback (most recent call last):
VdtTypeError: the value "jedi" is of the wrong type.
"""
ValidateError.__init__(self, 'the value "%s" is of the wrong type.' % (value,))
class VdtValueError(ValidateError):
"""The value supplied was of the correct type, but was not an allowed value."""
def __init__(self, value):
"""
>>> raise VdtValueError('jedi')
Traceback (most recent call last):
VdtValueError: the value "jedi" is unacceptable.
"""
ValidateError.__init__(self, 'the value "%s" is unacceptable.' % (value,))
class VdtValueTooSmallError(VdtValueError):
"""The value supplied was of the correct type, but was too small."""
def __init__(self, value):
"""
>>> raise VdtValueTooSmallError('0')
Traceback (most recent call last):
VdtValueTooSmallError: the value "0" is too small.
"""
ValidateError.__init__(self, 'the value "%s" is too small.' % (value,))
class VdtValueTooBigError(VdtValueError):
"""The value supplied was of the correct type, but was too big."""
def __init__(self, value):
"""
>>> raise VdtValueTooBigError('1')
Traceback (most recent call last):
VdtValueTooBigError: the value "1" is too big.
"""
ValidateError.__init__(self, 'the value "%s" is too big.' % (value,))
class VdtValueTooShortError(VdtValueError):
"""The value supplied was of the correct type, but was too short."""
def __init__(self, value):
"""
>>> raise VdtValueTooShortError('jed')
Traceback (most recent call last):
VdtValueTooShortError: the value "jed" is too short.
"""
ValidateError.__init__(
self,
'the value "%s" is too short.' % (value,))
class VdtValueTooLongError(VdtValueError):
"""The value supplied was of the correct type, but was too long."""
def __init__(self, value):
"""
>>> raise VdtValueTooLongError('jedie')
Traceback (most recent call last):
VdtValueTooLongError: the value "jedie" is too long.
"""
ValidateError.__init__(self, 'the value "%s" is too long.' % (value,))
class Validator(object):
"""
Validator is an object that allows you to register a set of 'checks'.
These checks take input and test that it conforms to the check.
This can also involve converting the value from a string into
the correct datatype.
The ``check`` method takes an input string which configures which
check is to be used and applies that check to a supplied value.
An example input string would be:
'int_range(param1, param2)'
You would then provide something like:
>>> def int_range_check(value, min, max):
... # turn min and max from strings to integers
... min = int(min)
... max = int(max)
... # check that value is of the correct type.
... # possible valid inputs are integers or strings
... # that represent integers
... if not isinstance(value, (int, long, string_type)):
... raise VdtTypeError(value)
... elif isinstance(value, string_type):
... # if we are given a string
... # attempt to convert to an integer
... try:
... value = int(value)
... except ValueError:
... raise VdtValueError(value)
... # check the value is between our constraints
... if not min <= value:
... raise VdtValueTooSmallError(value)
... if not value <= max:
... raise VdtValueTooBigError(value)
... return value
>>> fdict = {'int_range': int_range_check}
>>> vtr1 = Validator(fdict)
>>> vtr1.check('int_range(20, 40)', '30')
30
>>> vtr1.check('int_range(20, 40)', '60')
Traceback (most recent call last):
VdtValueTooBigError: the value "60" is too big.
New functions can be added with : ::
>>> vtr2 = Validator()
>>> vtr2.functions['int_range'] = int_range_check
Or by passing in a dictionary of functions when Validator
is instantiated.
Your functions *can* use keyword arguments,
but the first argument should always be 'value'.
If the function doesn't take additional arguments,
the parentheses are optional in the check.
It can be written with either of : ::
keyword = function_name
keyword = function_name()
The first program to utilise Validator() was Michael Foord's
ConfigObj, an alternative to ConfigParser which supports lists and
can validate a config file using a config schema.
For more details on using Validator with ConfigObj see:
https://configobj.readthedocs.org/en/latest/configobj.html
"""
# this regex does the initial parsing of the checks
_func_re = re.compile(r'(.+?)\((.*)\)', re.DOTALL)
# this regex takes apart keyword arguments
_key_arg = re.compile(r'^([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*(.*)$', re.DOTALL)
# this regex finds keyword=list(....) type values
_list_arg = _list_arg
# this regex takes individual values out of lists - in one pass
_list_members = _list_members
# These regexes check a set of arguments for validity
# and then pull the members out
_paramfinder = re.compile(_paramstring, re.VERBOSE | re.DOTALL)
_matchfinder = re.compile(_matchstring, re.VERBOSE | re.DOTALL)
def __init__(self, functions=None):
"""
>>> vtri = Validator()
"""
self.functions = {
'': self._pass,
'integer': is_integer,
'float': is_float,
'boolean': is_boolean,
'ip_addr': is_ip_addr,
'string': is_string,
'list': is_list,
'tuple': is_tuple,
'int_list': is_int_list,
'float_list': is_float_list,
'bool_list': is_bool_list,
'ip_addr_list': is_ip_addr_list,
'string_list': is_string_list,
'mixed_list': is_mixed_list,
'pass': self._pass,
'option': is_option,
'force_list': force_list,
}
if functions is not None:
self.functions.update(functions)
# tekNico: for use by ConfigObj
self.baseErrorClass = ValidateError
self._cache = {}
def check(self, check, value, missing=False):
"""
Usage: check(check, value)
Arguments:
check: string representing check to apply (including arguments)
value: object to be checked
Returns value, converted to correct type if necessary
If the check fails, raises a ``ValidateError`` subclass.
>>> vtor.check('yoda', '')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
>>> vtor.check('yoda()', '')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
>>> vtor.check('string(default="")', '', missing=True)
''
"""
fun_name, fun_args, fun_kwargs, default = self._parse_with_caching(check)
if missing:
if default is None:
# no information needed here - to be handled by caller
raise VdtMissingValue()
value = self._handle_none(default)
if value is None:
return None
return self._check_value(value, fun_name, fun_args, fun_kwargs)
def _handle_none(self, value):
if value == 'None':
return None
elif value in ("'None'", '"None"'):
# Special case a quoted None
value = self._unquote(value)
return value
def _parse_with_caching(self, check):
if check in self._cache:
fun_name, fun_args, fun_kwargs, default = self._cache[check]
# We call list and dict below to work with *copies* of the data
# rather than the original (which are mutable of course)
fun_args = list(fun_args)
fun_kwargs = dict(fun_kwargs)
else:
fun_name, fun_args, fun_kwargs, default = self._parse_check(check)
fun_kwargs = dict([(str(key), value) for (key, value) in list(fun_kwargs.items())])
self._cache[check] = fun_name, list(fun_args), dict(fun_kwargs), default
return fun_name, fun_args, fun_kwargs, default
def _check_value(self, value, fun_name, fun_args, fun_kwargs):
try:
fun = self.functions[fun_name]
except KeyError:
raise VdtUnknownCheckError(fun_name)
else:
return fun(value, *fun_args, **fun_kwargs)
def _parse_check(self, check):
fun_match = self._func_re.match(check)
if fun_match:
fun_name = fun_match.group(1)
arg_string = fun_match.group(2)
arg_match = self._matchfinder.match(arg_string)
if arg_match is None:
# Bad syntax
raise VdtParamError('Bad syntax in check "%s".' % check)
fun_args = []
fun_kwargs = {}
# pull out args of group 2
for arg in self._paramfinder.findall(arg_string):
# args may need whitespace removing (before removing quotes)
arg = arg.strip()
listmatch = self._list_arg.match(arg)
if listmatch:
key, val = self._list_handle(listmatch)
fun_kwargs[key] = val
continue
keymatch = self._key_arg.match(arg)
if keymatch:
val = keymatch.group(2)
if not val in ("'None'", '"None"'):
# Special case a quoted None
val = self._unquote(val)
fun_kwargs[keymatch.group(1)] = val
continue
fun_args.append(self._unquote(arg))
else:
# allows for function names without (args)
return check, (), {}, None
# Default must be deleted if the value is specified too,
# otherwise the check function will get a spurious "default" keyword arg
default = fun_kwargs.pop('default', None)
return fun_name, fun_args, fun_kwargs, default
def _unquote(self, val):
"""Unquote a value if necessary."""
if (len(val) >= 2) and (val[0] in ("'", '"')) and (val[0] == val[-1]):
val = val[1:-1]
return val
def _list_handle(self, listmatch):
"""Take apart a ``keyword=list('val, 'val')`` type string."""
out = []
name = listmatch.group(1)
args = listmatch.group(2)
for arg in self._list_members.findall(args):
out.append(self._unquote(arg))
return name, out
def _pass(self, value):
"""
Dummy check that always passes
>>> vtor.check('', 0)
0
>>> vtor.check('', '0')
'0'
"""
return value
def get_default_value(self, check):
"""
Given a check, return the default value for the check
(converted to the right type).
If the check doesn't specify a default value then a
``KeyError`` will be raised.
"""
fun_name, fun_args, fun_kwargs, default = self._parse_with_caching(check)
if default is None:
raise KeyError('Check "%s" has no default value.' % check)
value = self._handle_none(default)
if value is None:
return value
return self._check_value(value, fun_name, fun_args, fun_kwargs)
def _is_num_param(names, values, to_float=False):
"""
Return numbers from inputs or raise VdtParamError.
Lets ``None`` pass through.
Pass in keyword argument ``to_float=True`` to
use float for the conversion rather than int.
>>> _is_num_param(('', ''), (0, 1.0))
[0, 1]
>>> _is_num_param(('', ''), (0, 1.0), to_float=True)
[0.0, 1.0]
>>> _is_num_param(('a'), ('a'))
Traceback (most recent call last):
VdtParamError: passed an incorrect value "a" for parameter "a".
"""
fun = to_float and float or int
out_params = []
for (name, val) in zip(names, values):
if val is None:
out_params.append(val)
elif isinstance(val, (int, long, float, string_type)):
try:
out_params.append(fun(val))
except ValueError as e:
raise VdtParamError(name, val)
else:
raise VdtParamError(name, val)
return out_params
# built in checks
# you can override these by setting the appropriate name
# in Validator.functions
# note: if the params are specified wrongly in your input string,
# you will also raise errors.
def is_integer(value, min=None, max=None):
"""
A check that tests that a given value is an integer (int, or long)
and optionally, between bounds. A negative value is accepted, while
a float will fail.
If the value is a string, then the conversion is done - if possible.
Otherwise a VdtError is raised.
>>> vtor.check('integer', '-1')
-1
>>> vtor.check('integer', '0')
0
>>> vtor.check('integer', 9)
9
>>> vtor.check('integer', 'a')
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
>>> vtor.check('integer', '2.2')
Traceback (most recent call last):
VdtTypeError: the value "2.2" is of the wrong type.
>>> vtor.check('integer(10)', '20')
20
>>> vtor.check('integer(max=20)', '15')
15
>>> vtor.check('integer(10)', '9')
Traceback (most recent call last):
VdtValueTooSmallError: the value "9" is too small.
>>> vtor.check('integer(10)', 9)
Traceback (most recent call last):
VdtValueTooSmallError: the value "9" is too small.
>>> vtor.check('integer(max=20)', '35')
Traceback (most recent call last):
VdtValueTooBigError: the value "35" is too big.
>>> vtor.check('integer(max=20)', 35)
Traceback (most recent call last):
VdtValueTooBigError: the value "35" is too big.
>>> vtor.check('integer(0, 9)', False)
0
"""
(min_val, max_val) = _is_num_param(('min', 'max'), (min, max))
if not isinstance(value, (int, long, string_type)):
raise VdtTypeError(value)
if isinstance(value, string_type):
# if it's a string - does it represent an integer ?
try:
value = int(value)
except ValueError:
raise VdtTypeError(value)
if (min_val is not None) and (value < min_val):
raise VdtValueTooSmallError(value)
if (max_val is not None) and (value > max_val):
raise VdtValueTooBigError(value)
return value
def is_float(value, min=None, max=None):
"""
A check that tests that a given value is a float
(an integer will be accepted), and optionally - that it is between bounds.
If the value is a string, then the conversion is done - if possible.
Otherwise a VdtError is raised.
This can accept negative values.
>>> vtor.check('float', '2')
2.0
From now on we multiply the value to avoid comparing decimals
>>> vtor.check('float', '-6.8') * 10
-68.0
>>> vtor.check('float', '12.2') * 10
122.0
>>> vtor.check('float', 8.4) * 10
84.0
>>> vtor.check('float', 'a')
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
>>> vtor.check('float(10.1)', '10.2') * 10
102.0
>>> vtor.check('float(max=20.2)', '15.1') * 10
151.0
>>> vtor.check('float(10.0)', '9.0')
Traceback (most recent call last):
VdtValueTooSmallError: the value "9.0" is too small.
>>> vtor.check('float(max=20.0)', '35.0')
Traceback (most recent call last):
VdtValueTooBigError: the value "35.0" is too big.
"""
(min_val, max_val) = _is_num_param(
('min', 'max'), (min, max), to_float=True)
if not isinstance(value, (int, long, float, string_type)):
raise VdtTypeError(value)
if not isinstance(value, float):
# if it's a string - does it represent a float ?
try:
value = float(value)
except ValueError:
raise VdtTypeError(value)
if (min_val is not None) and (value < min_val):
raise VdtValueTooSmallError(value)
if (max_val is not None) and (value > max_val):
raise VdtValueTooBigError(value)
return value
bool_dict = {
True: True, 'on': True, '1': True, 'true': True, 'yes': True,
False: False, 'off': False, '0': False, 'false': False, 'no': False,
}
def is_boolean(value):
"""
Check if the value represents a boolean.
>>> vtor.check('boolean', 0)
0
>>> vtor.check('boolean', False)
0
>>> vtor.check('boolean', '0')
0
>>> vtor.check('boolean', 'off')
0
>>> vtor.check('boolean', 'false')
0
>>> vtor.check('boolean', 'no')
0
>>> vtor.check('boolean', 'nO')
0
>>> vtor.check('boolean', 'NO')
0
>>> vtor.check('boolean', 1)
1
>>> vtor.check('boolean', True)
1
>>> vtor.check('boolean', '1')
1
>>> vtor.check('boolean', 'on')
1
>>> vtor.check('boolean', 'true')
1
>>> vtor.check('boolean', 'yes')
1
>>> vtor.check('boolean', 'Yes')
1
>>> vtor.check('boolean', 'YES')
1
>>> vtor.check('boolean', '')
Traceback (most recent call last):
VdtTypeError: the value "" is of the wrong type.
>>> vtor.check('boolean', 'up')
Traceback (most recent call last):
VdtTypeError: the value "up" is of the wrong type.
"""
if isinstance(value, string_type):
try:
return bool_dict[value.lower()]
except KeyError:
raise VdtTypeError(value)
# we do an equality test rather than an identity test
# this ensures Python 2.2 compatibilty
# and allows 0 and 1 to represent True and False
if value == False:
return False
elif value == True:
return True
else:
raise VdtTypeError(value)
def is_ip_addr(value):
"""
Check that the supplied value is an Internet Protocol address, v.4,
represented by a dotted-quad string, i.e. '1.2.3.4'.
>>> vtor.check('ip_addr', '1 ')
'1'
>>> vtor.check('ip_addr', ' 1.2')
'1.2'
>>> vtor.check('ip_addr', ' 1.2.3 ')
'1.2.3'
>>> vtor.check('ip_addr', '1.2.3.4')
'1.2.3.4'
>>> vtor.check('ip_addr', '0.0.0.0')
'0.0.0.0'
>>> vtor.check('ip_addr', '255.255.255.255')
'255.255.255.255'
>>> vtor.check('ip_addr', '255.255.255.256')
Traceback (most recent call last):
VdtValueError: the value "255.255.255.256" is unacceptable.
>>> vtor.check('ip_addr', '1.2.3.4.5')
Traceback (most recent call last):
VdtValueError: the value "1.2.3.4.5" is unacceptable.
>>> vtor.check('ip_addr', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
"""
if not isinstance(value, string_type):
raise VdtTypeError(value)
value = value.strip()
try:
dottedQuadToNum(value)
except ValueError:
raise VdtValueError(value)
return value
def is_list(value, min=None, max=None):
"""
Check that the value is a list of values.
You can optionally specify the minimum and maximum number of members.
It does no check on list members.
>>> vtor.check('list', ())
[]
>>> vtor.check('list', [])
[]
>>> vtor.check('list', (1, 2))
[1, 2]
>>> vtor.check('list', [1, 2])
[1, 2]
>>> vtor.check('list(3)', (1, 2))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2)" is too short.
>>> vtor.check('list(max=5)', (1, 2, 3, 4, 5, 6))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2, 3, 4, 5, 6)" is too long.
>>> vtor.check('list(min=3, max=5)', (1, 2, 3, 4))
[1, 2, 3, 4]
>>> vtor.check('list', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('list', '12')
Traceback (most recent call last):
VdtTypeError: the value "12" is of the wrong type.
"""
(min_len, max_len) = _is_num_param(('min', 'max'), (min, max))
if isinstance(value, string_type):
raise VdtTypeError(value)
try:
num_members = len(value)
except TypeError:
raise VdtTypeError(value)
if min_len is not None and num_members < min_len:
raise VdtValueTooShortError(value)
if max_len is not None and num_members > max_len:
raise VdtValueTooLongError(value)
return list(value)
def is_tuple(value, min=None, max=None):
"""
Check that the value is a tuple of values.
You can optionally specify the minimum and maximum number of members.
It does no check on members.
>>> vtor.check('tuple', ())
()
>>> vtor.check('tuple', [])
()
>>> vtor.check('tuple', (1, 2))
(1, 2)
>>> vtor.check('tuple', [1, 2])
(1, 2)
>>> vtor.check('tuple(3)', (1, 2))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2)" is too short.
>>> vtor.check('tuple(max=5)', (1, 2, 3, 4, 5, 6))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2, 3, 4, 5, 6)" is too long.
>>> vtor.check('tuple(min=3, max=5)', (1, 2, 3, 4))
(1, 2, 3, 4)
>>> vtor.check('tuple', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('tuple', '12')
Traceback (most recent call last):
VdtTypeError: the value "12" is of the wrong type.
"""
return tuple(is_list(value, min, max))
def is_string(value, min=None, max=None):
"""
Check that the supplied value is a string.
You can optionally specify the minimum and maximum number of members.
>>> vtor.check('string', '0')
'0'
>>> vtor.check('string', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('string(2)', '12')
'12'
>>> vtor.check('string(2)', '1')
Traceback (most recent call last):
VdtValueTooShortError: the value "1" is too short.
>>> vtor.check('string(min=2, max=3)', '123')
'123'
>>> vtor.check('string(min=2, max=3)', '1234')
Traceback (most recent call last):
VdtValueTooLongError: the value "1234" is too long.
"""
if not isinstance(value, string_type):
raise VdtTypeError(value)
(min_len, max_len) = _is_num_param(('min', 'max'), (min, max))
try:
num_members = len(value)
except TypeError:
raise VdtTypeError(value)
if min_len is not None and num_members < min_len:
raise VdtValueTooShortError(value)
if max_len is not None and num_members > max_len:
raise VdtValueTooLongError(value)
return value
def is_int_list(value, min=None, max=None):
"""
Check that the value is a list of integers.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is an integer.
>>> vtor.check('int_list', ())
[]
>>> vtor.check('int_list', [])
[]
>>> vtor.check('int_list', (1, 2))
[1, 2]
>>> vtor.check('int_list', [1, 2])
[1, 2]
>>> vtor.check('int_list', [1, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
"""
return [is_integer(mem) for mem in is_list(value, min, max)]
def is_bool_list(value, min=None, max=None):
"""
Check that the value is a list of booleans.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a boolean.
>>> vtor.check('bool_list', ())
[]
>>> vtor.check('bool_list', [])
[]
>>> check_res = vtor.check('bool_list', (True, False))
>>> check_res == [True, False]
1
>>> check_res = vtor.check('bool_list', [True, False])
>>> check_res == [True, False]
1
>>> vtor.check('bool_list', [True, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
"""
return [is_boolean(mem) for mem in is_list(value, min, max)]
def is_float_list(value, min=None, max=None):
"""
Check that the value is a list of floats.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a float.
>>> vtor.check('float_list', ())
[]
>>> vtor.check('float_list', [])
[]
>>> vtor.check('float_list', (1, 2.0))
[1.0, 2.0]
>>> vtor.check('float_list', [1, 2.0])
[1.0, 2.0]
>>> vtor.check('float_list', [1, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
"""
return [is_float(mem) for mem in is_list(value, min, max)]
def is_string_list(value, min=None, max=None):
"""
Check that the value is a list of strings.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a string.
>>> vtor.check('string_list', ())
[]
>>> vtor.check('string_list', [])
[]
>>> vtor.check('string_list', ('a', 'b'))
['a', 'b']
>>> vtor.check('string_list', ['a', 1])
Traceback (most recent call last):
VdtTypeError: the value "1" is of the wrong type.
>>> vtor.check('string_list', 'hello')
Traceback (most recent call last):
VdtTypeError: the value "hello" is of the wrong type.
"""
if isinstance(value, string_type):
raise VdtTypeError(value)
return [is_string(mem) for mem in is_list(value, min, max)]
def is_ip_addr_list(value, min=None, max=None):
"""
Check that the value is a list of IP addresses.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is an IP address.
>>> vtor.check('ip_addr_list', ())
[]
>>> vtor.check('ip_addr_list', [])
[]
>>> vtor.check('ip_addr_list', ('1.2.3.4', '5.6.7.8'))
['1.2.3.4', '5.6.7.8']
>>> vtor.check('ip_addr_list', ['a'])
Traceback (most recent call last):
VdtValueError: the value "a" is unacceptable.
"""
return [is_ip_addr(mem) for mem in is_list(value, min, max)]
def force_list(value, min=None, max=None):
"""
Check that a value is a list, coercing strings into
a list with one member. Useful where users forget the
trailing comma that turns a single value into a list.
You can optionally specify the minimum and maximum number of members.
A minumum of greater than one will fail if the user only supplies a
string.
>>> vtor.check('force_list', ())
[]
>>> vtor.check('force_list', [])
[]
>>> vtor.check('force_list', 'hello')
['hello']
"""
if not isinstance(value, (list, tuple)):
value = [value]
return is_list(value, min, max)
fun_dict = {
'integer': is_integer,
'float': is_float,
'ip_addr': is_ip_addr,
'string': is_string,
'boolean': is_boolean,
}
def is_mixed_list(value, *args):
"""
Check that the value is a list.
Allow specifying the type of each member.
Work on lists of specific lengths.
You specify each member as a positional argument specifying type
Each type should be one of the following strings :
'integer', 'float', 'ip_addr', 'string', 'boolean'
So you can specify a list of two strings, followed by
two integers as :
mixed_list('string', 'string', 'integer', 'integer')
The length of the list must match the number of positional
arguments you supply.
>>> mix_str = "mixed_list('integer', 'float', 'ip_addr', 'string', 'boolean')"
>>> check_res = vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a', True))
>>> check_res == [1, 2.0, '1.2.3.4', 'a', True]
1
>>> check_res = vtor.check(mix_str, ('1', '2.0', '1.2.3.4', 'a', 'True'))
>>> check_res == [1, 2.0, '1.2.3.4', 'a', True]
1
>>> vtor.check(mix_str, ('b', 2.0, '1.2.3.4', 'a', True))
Traceback (most recent call last):
VdtTypeError: the value "b" is of the wrong type.
>>> vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a'))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2.0, '1.2.3.4', 'a')" is too short.
>>> vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a', 1, 'b'))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2.0, '1.2.3.4', 'a', 1, 'b')" is too long.
>>> vtor.check(mix_str, 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('mixed_list("yoda")', ('a'))
Traceback (most recent call last):
VdtParamError: passed an incorrect value "KeyError('yoda',)" for parameter "'mixed_list'"
"""
try:
length = len(value)
except TypeError:
raise VdtTypeError(value)
if length < len(args):
raise VdtValueTooShortError(value)
elif length > len(args):
raise VdtValueTooLongError(value)
try:
return [fun_dict[arg](val) for arg, val in zip(args, value)]
except KeyError as e:
raise VdtParamError('mixed_list', e)
def is_option(value, *options):
"""
This check matches the value to any of a set of options.
>>> vtor.check('option("yoda", "jedi")', 'yoda')
'yoda'
>>> vtor.check('option("yoda", "jedi")', 'jed')
Traceback (most recent call last):
VdtValueError: the value "jed" is unacceptable.
>>> vtor.check('option("yoda", "jedi")', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
"""
if not isinstance(value, string_type):
raise VdtTypeError(value)
if not value in options:
raise VdtValueError(value)
return value
def _test(value, *args, **keywargs):
"""
A function that exists for test purposes.
>>> checks = [
... '3, 6, min=1, max=3, test=list(a, b, c)',
... '3',
... '3, 6',
... '3,',
... 'min=1, test="a b c"',
... 'min=5, test="a, b, c"',
... 'min=1, max=3, test="a, b, c"',
... 'min=-100, test=-99',
... 'min=1, max=3',
... '3, 6, test="36"',
... '3, 6, test="a, b, c"',
... '3, max=3, test=list("a", "b", "c")',
... '''3, max=3, test=list("'a'", 'b', "x=(c)")''',
... "test='x=fish(3)'",
... ]
>>> v = Validator({'test': _test})
>>> for entry in checks:
... pprint(v.check(('test(%s)' % entry), 3))
(3, ('3', '6'), {'max': '3', 'min': '1', 'test': ['a', 'b', 'c']})
(3, ('3',), {})
(3, ('3', '6'), {})
(3, ('3',), {})
(3, (), {'min': '1', 'test': 'a b c'})
(3, (), {'min': '5', 'test': 'a, b, c'})
(3, (), {'max': '3', 'min': '1', 'test': 'a, b, c'})
(3, (), {'min': '-100', 'test': '-99'})
(3, (), {'max': '3', 'min': '1'})
(3, ('3', '6'), {'test': '36'})
(3, ('3', '6'), {'test': 'a, b, c'})
(3, ('3',), {'max': '3', 'test': ['a', 'b', 'c']})
(3, ('3',), {'max': '3', 'test': ["'a'", 'b', 'x=(c)']})
(3, (), {'test': 'x=fish(3)'})
>>> v = Validator()
>>> v.check('integer(default=6)', '3')
3
>>> v.check('integer(default=6)', None, True)
6
>>> v.get_default_value('integer(default=6)')
6
>>> v.get_default_value('float(default=6)')
6.0
>>> v.get_default_value('pass(default=None)')
>>> v.get_default_value("string(default='None')")
'None'
>>> v.get_default_value('pass')
Traceback (most recent call last):
KeyError: 'Check "pass" has no default value.'
>>> v.get_default_value('pass(default=list(1, 2, 3, 4))')
['1', '2', '3', '4']
>>> v = Validator()
>>> v.check("pass(default=None)", None, True)
>>> v.check("pass(default='None')", None, True)
'None'
>>> v.check('pass(default="None")', None, True)
'None'
>>> v.check('pass(default=list(1, 2, 3, 4))', None, True)
['1', '2', '3', '4']
Bug test for unicode arguments
>>> v = Validator()
>>> v.check(unicode('string(min=4)'), unicode('test')) == unicode('test')
True
>>> v = Validator()
>>> v.get_default_value(unicode('string(min=4, default="1234")')) == unicode('1234')
True
>>> v.check(unicode('string(min=4, default="1234")'), unicode('test')) == unicode('test')
True
>>> v = Validator()
>>> default = v.get_default_value('string(default=None)')
>>> default == None
1
"""
return (value, args, keywargs)
def _test2():
"""
>>>
>>> v = Validator()
>>> v.get_default_value('string(default="#ff00dd")')
'#ff00dd'
>>> v.get_default_value('integer(default=3) # comment')
3
"""
def _test3():
r"""
>>> vtor.check('string(default="")', '', missing=True)
''
>>> vtor.check('string(default="\n")', '', missing=True)
'\n'
>>> print(vtor.check('string(default="\n")', '', missing=True))
<BLANKLINE>
<BLANKLINE>
>>> vtor.check('string()', '\n')
'\n'
>>> vtor.check('string(default="\n\n\n")', '', missing=True)
'\n\n\n'
>>> vtor.check('string()', 'random \n text goes here\n\n')
'random \n text goes here\n\n'
>>> vtor.check('string(default=" \nrandom text\ngoes \n here\n\n ")',
... '', missing=True)
' \nrandom text\ngoes \n here\n\n '
>>> vtor.check("string(default='\n\n\n')", '', missing=True)
'\n\n\n'
>>> vtor.check("option('\n','a','b',default='\n')", '', missing=True)
'\n'
>>> vtor.check("string_list()", ['foo', '\n', 'bar'])
['foo', '\n', 'bar']
>>> vtor.check("string_list(default=list('\n'))", '', missing=True)
['\n']
"""
if __name__ == '__main__':
# run the code tests in doctest format
import sys
import doctest
m = sys.modules.get('__main__')
globs = m.__dict__.copy()
globs.update({
'vtor': Validator(),
})
failures, tests = doctest.testmod(
m, globs=globs,
optionflags=doctest.IGNORE_EXCEPTION_DETAIL | doctest.ELLIPSIS)
assert not failures, '{} failures out of {} tests'.format(failures, tests)
dateutil/__init__.py 0000644 00000000105 14751155147 0010476 0 ustar 00 # -*- coding: utf-8 -*-
from ._version import VERSION as __version__
dateutil/easter.py 0000644 00000005105 14751155147 0010227 0 ustar 00 # -*- coding: utf-8 -*-
"""
This module offers a generic easter computing method for any given year, using
Western, Orthodox or Julian algorithms.
"""
import datetime
__all__ = ["easter", "EASTER_JULIAN", "EASTER_ORTHODOX", "EASTER_WESTERN"]
EASTER_JULIAN = 1
EASTER_ORTHODOX = 2
EASTER_WESTERN = 3
def easter(year, method=EASTER_WESTERN):
"""
This method was ported from the work done by GM Arts,
on top of the algorithm by Claus Tondering, which was
based in part on the algorithm of Ouding (1940), as
quoted in "Explanatory Supplement to the Astronomical
Almanac", P. Kenneth Seidelmann, editor.
This algorithm implements three different easter
calculation methods:
1 - Original calculation in Julian calendar, valid in
dates after 326 AD
2 - Original method, with date converted to Gregorian
calendar, valid in years 1583 to 4099
3 - Revised method, in Gregorian calendar, valid in
years 1583 to 4099 as well
These methods are represented by the constants:
* ``EASTER_JULIAN = 1``
* ``EASTER_ORTHODOX = 2``
* ``EASTER_WESTERN = 3``
The default method is method 3.
More about the algorithm may be found at:
http://users.chariot.net.au/~gmarts/eastalg.htm
and
http://www.tondering.dk/claus/calendar.html
"""
if not (1 <= method <= 3):
raise ValueError("invalid method")
# g - Golden year - 1
# c - Century
# h - (23 - Epact) mod 30
# i - Number of days from March 21 to Paschal Full Moon
# j - Weekday for PFM (0=Sunday, etc)
# p - Number of days from March 21 to Sunday on or before PFM
# (-6 to 28 methods 1 & 3, to 56 for method 2)
# e - Extra days to add for method 2 (converting Julian
# date to Gregorian date)
y = year
g = y % 19
e = 0
if method < 3:
# Old method
i = (19*g + 15) % 30
j = (y + y//4 + i) % 7
if method == 2:
# Extra dates to convert Julian to Gregorian date
e = 10
if y > 1600:
e = e + y//100 - 16 - (y//100 - 16)//4
else:
# New method
c = y//100
h = (c - c//4 - (8*c + 13)//25 + 19*g + 15) % 30
i = h - (h//28)*(1 - (h//28)*(29//(h + 1))*((21 - g)//11))
j = (y + y//4 + i + 2 - c + c//4) % 7
# p can be from -6 to 56 corresponding to dates 22 March to 23 May
# (later dates apply to method 2, although 23 May never actually occurs)
p = i - j + e
d = 1 + (p + 27 + (p + 6)//40) % 31
m = 3 + (p + 26)//30
return datetime.date(int(y), int(m), int(d))
dateutil/tzwin.py 0000644 00000000073 14751155147 0010116 0 ustar 00 # tzwin has moved to dateutil.tz.win
from .tz.win import *
dateutil/tz/_common.py 0000644 00000027326 14751155147 0011041 0 ustar 00 from six import PY3
from functools import wraps
from datetime import datetime, timedelta, tzinfo
ZERO = timedelta(0)
__all__ = ['tzname_in_python2', 'enfold']
def tzname_in_python2(namefunc):
"""Change unicode output into bytestrings in Python 2
tzname() API changed in Python 3. It used to return bytes, but was changed
to unicode strings
"""
def adjust_encoding(*args, **kwargs):
name = namefunc(*args, **kwargs)
if name is not None and not PY3:
name = name.encode()
return name
return adjust_encoding
# The following is adapted from Alexander Belopolsky's tz library
# https://github.com/abalkin/tz
if hasattr(datetime, 'fold'):
# This is the pre-python 3.6 fold situation
def enfold(dt, fold=1):
"""
Provides a unified interface for assigning the ``fold`` attribute to
datetimes both before and after the implementation of PEP-495.
:param fold:
The value for the ``fold`` attribute in the returned datetime. This
should be either 0 or 1.
:return:
Returns an object for which ``getattr(dt, 'fold', 0)`` returns
``fold`` for all versions of Python. In versions prior to
Python 3.6, this is a ``_DatetimeWithFold`` object, which is a
subclass of :py:class:`datetime.datetime` with the ``fold``
attribute added, if ``fold`` is 1.
.. versionadded:: 2.6.0
"""
return dt.replace(fold=fold)
else:
class _DatetimeWithFold(datetime):
"""
This is a class designed to provide a PEP 495-compliant interface for
Python versions before 3.6. It is used only for dates in a fold, so
the ``fold`` attribute is fixed at ``1``.
.. versionadded:: 2.6.0
"""
__slots__ = ()
@property
def fold(self):
return 1
def enfold(dt, fold=1):
"""
Provides a unified interface for assigning the ``fold`` attribute to
datetimes both before and after the implementation of PEP-495.
:param fold:
The value for the ``fold`` attribute in the returned datetime. This
should be either 0 or 1.
:return:
Returns an object for which ``getattr(dt, 'fold', 0)`` returns
``fold`` for all versions of Python. In versions prior to
Python 3.6, this is a ``_DatetimeWithFold`` object, which is a
subclass of :py:class:`datetime.datetime` with the ``fold``
attribute added, if ``fold`` is 1.
.. versionadded:: 2.6.0
"""
if getattr(dt, 'fold', 0) == fold:
return dt
args = dt.timetuple()[:6]
args += (dt.microsecond, dt.tzinfo)
if fold:
return _DatetimeWithFold(*args)
else:
return datetime(*args)
def _validate_fromutc_inputs(f):
"""
The CPython version of ``fromutc`` checks that the input is a ``datetime``
object and that ``self`` is attached as its ``tzinfo``.
"""
@wraps(f)
def fromutc(self, dt):
if not isinstance(dt, datetime):
raise TypeError("fromutc() requires a datetime argument")
if dt.tzinfo is not self:
raise ValueError("dt.tzinfo is not self")
return f(self, dt)
return fromutc
class _tzinfo(tzinfo):
"""
Base class for all ``dateutil`` ``tzinfo`` objects.
"""
def is_ambiguous(self, dt):
"""
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
"""
dt = dt.replace(tzinfo=self)
wall_0 = enfold(dt, fold=0)
wall_1 = enfold(dt, fold=1)
same_offset = wall_0.utcoffset() == wall_1.utcoffset()
same_dt = wall_0.replace(tzinfo=None) == wall_1.replace(tzinfo=None)
return same_dt and not same_offset
def _fold_status(self, dt_utc, dt_wall):
"""
Determine the fold status of a "wall" datetime, given a representation
of the same datetime as a (naive) UTC datetime. This is calculated based
on the assumption that ``dt.utcoffset() - dt.dst()`` is constant for all
datetimes, and that this offset is the actual number of hours separating
``dt_utc`` and ``dt_wall``.
:param dt_utc:
Representation of the datetime as UTC
:param dt_wall:
Representation of the datetime as "wall time". This parameter must
either have a `fold` attribute or have a fold-naive
:class:`datetime.tzinfo` attached, otherwise the calculation may
fail.
"""
if self.is_ambiguous(dt_wall):
delta_wall = dt_wall - dt_utc
_fold = int(delta_wall == (dt_utc.utcoffset() - dt_utc.dst()))
else:
_fold = 0
return _fold
def _fold(self, dt):
return getattr(dt, 'fold', 0)
def _fromutc(self, dt):
"""
Given a timezone-aware datetime in a given timezone, calculates a
timezone-aware datetime in a new timezone.
Since this is the one time that we *know* we have an unambiguous
datetime object, we take this opportunity to determine whether the
datetime is ambiguous and in a "fold" state (e.g. if it's the first
occurence, chronologically, of the ambiguous datetime).
:param dt:
A timezone-aware :class:`datetime.datetime` object.
"""
# Re-implement the algorithm from Python's datetime.py
dtoff = dt.utcoffset()
if dtoff is None:
raise ValueError("fromutc() requires a non-None utcoffset() "
"result")
# The original datetime.py code assumes that `dst()` defaults to
# zero during ambiguous times. PEP 495 inverts this presumption, so
# for pre-PEP 495 versions of python, we need to tweak the algorithm.
dtdst = dt.dst()
if dtdst is None:
raise ValueError("fromutc() requires a non-None dst() result")
delta = dtoff - dtdst
dt += delta
# Set fold=1 so we can default to being in the fold for
# ambiguous dates.
dtdst = enfold(dt, fold=1).dst()
if dtdst is None:
raise ValueError("fromutc(): dt.dst gave inconsistent "
"results; cannot convert")
return dt + dtdst
@_validate_fromutc_inputs
def fromutc(self, dt):
"""
Given a timezone-aware datetime in a given timezone, calculates a
timezone-aware datetime in a new timezone.
Since this is the one time that we *know* we have an unambiguous
datetime object, we take this opportunity to determine whether the
datetime is ambiguous and in a "fold" state (e.g. if it's the first
occurance, chronologically, of the ambiguous datetime).
:param dt:
A timezone-aware :class:`datetime.datetime` object.
"""
dt_wall = self._fromutc(dt)
# Calculate the fold status given the two datetimes.
_fold = self._fold_status(dt, dt_wall)
# Set the default fold value for ambiguous dates
return enfold(dt_wall, fold=_fold)
class tzrangebase(_tzinfo):
"""
This is an abstract base class for time zones represented by an annual
transition into and out of DST. Child classes should implement the following
methods:
* ``__init__(self, *args, **kwargs)``
* ``transitions(self, year)`` - this is expected to return a tuple of
datetimes representing the DST on and off transitions in standard
time.
A fully initialized ``tzrangebase`` subclass should also provide the
following attributes:
* ``hasdst``: Boolean whether or not the zone uses DST.
* ``_dst_offset`` / ``_std_offset``: :class:`datetime.timedelta` objects
representing the respective UTC offsets.
* ``_dst_abbr`` / ``_std_abbr``: Strings representing the timezone short
abbreviations in DST and STD, respectively.
* ``_hasdst``: Whether or not the zone has DST.
.. versionadded:: 2.6.0
"""
def __init__(self):
raise NotImplementedError('tzrangebase is an abstract base class')
def utcoffset(self, dt):
isdst = self._isdst(dt)
if isdst is None:
return None
elif isdst:
return self._dst_offset
else:
return self._std_offset
def dst(self, dt):
isdst = self._isdst(dt)
if isdst is None:
return None
elif isdst:
return self._dst_base_offset
else:
return ZERO
@tzname_in_python2
def tzname(self, dt):
if self._isdst(dt):
return self._dst_abbr
else:
return self._std_abbr
def fromutc(self, dt):
""" Given a datetime in UTC, return local time """
if not isinstance(dt, datetime):
raise TypeError("fromutc() requires a datetime argument")
if dt.tzinfo is not self:
raise ValueError("dt.tzinfo is not self")
# Get transitions - if there are none, fixed offset
transitions = self.transitions(dt.year)
if transitions is None:
return dt + self.utcoffset(dt)
# Get the transition times in UTC
dston, dstoff = transitions
dston -= self._std_offset
dstoff -= self._std_offset
utc_transitions = (dston, dstoff)
dt_utc = dt.replace(tzinfo=None)
isdst = self._naive_isdst(dt_utc, utc_transitions)
if isdst:
dt_wall = dt + self._dst_offset
else:
dt_wall = dt + self._std_offset
_fold = int(not isdst and self.is_ambiguous(dt_wall))
return enfold(dt_wall, fold=_fold)
def is_ambiguous(self, dt):
"""
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
"""
if not self.hasdst:
return False
start, end = self.transitions(dt.year)
dt = dt.replace(tzinfo=None)
return (end <= dt < end + self._dst_base_offset)
def _isdst(self, dt):
if not self.hasdst:
return False
elif dt is None:
return None
transitions = self.transitions(dt.year)
if transitions is None:
return False
dt = dt.replace(tzinfo=None)
isdst = self._naive_isdst(dt, transitions)
# Handle ambiguous dates
if not isdst and self.is_ambiguous(dt):
return not self._fold(dt)
else:
return isdst
def _naive_isdst(self, dt, transitions):
dston, dstoff = transitions
dt = dt.replace(tzinfo=None)
if dston < dstoff:
isdst = dston <= dt < dstoff
else:
isdst = not dstoff <= dt < dston
return isdst
@property
def _dst_base_offset(self):
return self._dst_offset - self._std_offset
__hash__ = None
def __ne__(self, other):
return not (self == other)
def __repr__(self):
return "%s(...)" % self.__class__.__name__
__reduce__ = object.__reduce__
def _total_seconds(td):
# Python 2.6 doesn't have a total_seconds() method on timedelta objects
return ((td.seconds + td.days * 86400) * 1000000 +
td.microseconds) // 1000000
_total_seconds = getattr(timedelta, 'total_seconds', _total_seconds)
dateutil/tz/tz.py 0000644 00000142622 14751155147 0010044 0 ustar 00 # -*- coding: utf-8 -*-
"""
This module offers timezone implementations subclassing the abstract
:py:`datetime.tzinfo` type. There are classes to handle tzfile format files
(usually are in :file:`/etc/localtime`, :file:`/usr/share/zoneinfo`, etc), TZ
environment string (in all known formats), given ranges (with help from
relative deltas), local machine timezone, fixed offset timezone, and UTC
timezone.
"""
import datetime
import struct
import time
import sys
import os
import bisect
from six import string_types
from ._common import tzname_in_python2, _tzinfo, _total_seconds
from ._common import tzrangebase, enfold
from ._common import _validate_fromutc_inputs
try:
from .win import tzwin, tzwinlocal
except ImportError:
tzwin = tzwinlocal = None
ZERO = datetime.timedelta(0)
EPOCH = datetime.datetime.utcfromtimestamp(0)
EPOCHORDINAL = EPOCH.toordinal()
class tzutc(datetime.tzinfo):
"""
This is a tzinfo object that represents the UTC time zone.
"""
def utcoffset(self, dt):
return ZERO
def dst(self, dt):
return ZERO
@tzname_in_python2
def tzname(self, dt):
return "UTC"
def is_ambiguous(self, dt):
"""
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
"""
return False
@_validate_fromutc_inputs
def fromutc(self, dt):
"""
Fast track version of fromutc() returns the original ``dt`` object for
any valid :py:class:`datetime.datetime` object.
"""
return dt
def __eq__(self, other):
if not isinstance(other, (tzutc, tzoffset)):
return NotImplemented
return (isinstance(other, tzutc) or
(isinstance(other, tzoffset) and other._offset == ZERO))
__hash__ = None
def __ne__(self, other):
return not (self == other)
def __repr__(self):
return "%s()" % self.__class__.__name__
__reduce__ = object.__reduce__
class tzoffset(datetime.tzinfo):
"""
A simple class for representing a fixed offset from UTC.
:param name:
The timezone name, to be returned when ``tzname()`` is called.
:param offset:
The time zone offset in seconds, or (since version 2.6.0, represented
as a :py:class:`datetime.timedelta` object.
"""
def __init__(self, name, offset):
self._name = name
try:
# Allow a timedelta
offset = _total_seconds(offset)
except (TypeError, AttributeError):
pass
self._offset = datetime.timedelta(seconds=offset)
def utcoffset(self, dt):
return self._offset
def dst(self, dt):
return ZERO
@tzname_in_python2
def tzname(self, dt):
return self._name
@_validate_fromutc_inputs
def fromutc(self, dt):
return dt + self._offset
def is_ambiguous(self, dt):
"""
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
"""
return False
def __eq__(self, other):
if not isinstance(other, tzoffset):
return NotImplemented
return self._offset == other._offset
__hash__ = None
def __ne__(self, other):
return not (self == other)
def __repr__(self):
return "%s(%s, %s)" % (self.__class__.__name__,
repr(self._name),
int(_total_seconds(self._offset)))
__reduce__ = object.__reduce__
class tzlocal(_tzinfo):
"""
A :class:`tzinfo` subclass built around the ``time`` timezone functions.
"""
def __init__(self):
super(tzlocal, self).__init__()
self._std_offset = datetime.timedelta(seconds=-time.timezone)
if time.daylight:
self._dst_offset = datetime.timedelta(seconds=-time.altzone)
else:
self._dst_offset = self._std_offset
self._dst_saved = self._dst_offset - self._std_offset
self._hasdst = bool(self._dst_saved)
def utcoffset(self, dt):
if dt is None and self._hasdst:
return None
if self._isdst(dt):
return self._dst_offset
else:
return self._std_offset
def dst(self, dt):
if dt is None and self._hasdst:
return None
if self._isdst(dt):
return self._dst_offset - self._std_offset
else:
return ZERO
@tzname_in_python2
def tzname(self, dt):
return time.tzname[self._isdst(dt)]
def is_ambiguous(self, dt):
"""
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
"""
naive_dst = self._naive_is_dst(dt)
return (not naive_dst and
(naive_dst != self._naive_is_dst(dt - self._dst_saved)))
def _naive_is_dst(self, dt):
timestamp = _datetime_to_timestamp(dt)
return time.localtime(timestamp + time.timezone).tm_isdst
def _isdst(self, dt, fold_naive=True):
# We can't use mktime here. It is unstable when deciding if
# the hour near to a change is DST or not.
#
# timestamp = time.mktime((dt.year, dt.month, dt.day, dt.hour,
# dt.minute, dt.second, dt.weekday(), 0, -1))
# return time.localtime(timestamp).tm_isdst
#
# The code above yields the following result:
#
# >>> import tz, datetime
# >>> t = tz.tzlocal()
# >>> datetime.datetime(2003,2,15,23,tzinfo=t).tzname()
# 'BRDT'
# >>> datetime.datetime(2003,2,16,0,tzinfo=t).tzname()
# 'BRST'
# >>> datetime.datetime(2003,2,15,23,tzinfo=t).tzname()
# 'BRST'
# >>> datetime.datetime(2003,2,15,22,tzinfo=t).tzname()
# 'BRDT'
# >>> datetime.datetime(2003,2,15,23,tzinfo=t).tzname()
# 'BRDT'
#
# Here is a more stable implementation:
#
if not self._hasdst:
return False
# Check for ambiguous times:
dstval = self._naive_is_dst(dt)
fold = getattr(dt, 'fold', None)
if self.is_ambiguous(dt):
if fold is not None:
return not self._fold(dt)
else:
return True
return dstval
def __eq__(self, other):
if not isinstance(other, tzlocal):
return NotImplemented
return (self._std_offset == other._std_offset and
self._dst_offset == other._dst_offset)
__hash__ = None
def __ne__(self, other):
return not (self == other)
def __repr__(self):
return "%s()" % self.__class__.__name__
__reduce__ = object.__reduce__
class _ttinfo(object):
__slots__ = ["offset", "delta", "isdst", "abbr",
"isstd", "isgmt", "dstoffset"]
def __init__(self):
for attr in self.__slots__:
setattr(self, attr, None)
def __repr__(self):
l = []
for attr in self.__slots__:
value = getattr(self, attr)
if value is not None:
l.append("%s=%s" % (attr, repr(value)))
return "%s(%s)" % (self.__class__.__name__, ", ".join(l))
def __eq__(self, other):
if not isinstance(other, _ttinfo):
return NotImplemented
return (self.offset == other.offset and
self.delta == other.delta and
self.isdst == other.isdst and
self.abbr == other.abbr and
self.isstd == other.isstd and
self.isgmt == other.isgmt and
self.dstoffset == other.dstoffset)
__hash__ = None
def __ne__(self, other):
return not (self == other)
def __getstate__(self):
state = {}
for name in self.__slots__:
state[name] = getattr(self, name, None)
return state
def __setstate__(self, state):
for name in self.__slots__:
if name in state:
setattr(self, name, state[name])
class _tzfile(object):
"""
Lightweight class for holding the relevant transition and time zone
information read from binary tzfiles.
"""
attrs = ['trans_list', 'trans_list_utc', 'trans_idx', 'ttinfo_list',
'ttinfo_std', 'ttinfo_dst', 'ttinfo_before', 'ttinfo_first']
def __init__(self, **kwargs):
for attr in self.attrs:
setattr(self, attr, kwargs.get(attr, None))
class tzfile(_tzinfo):
"""
This is a ``tzinfo`` subclass thant allows one to use the ``tzfile(5)``
format timezone files to extract current and historical zone information.
:param fileobj:
This can be an opened file stream or a file name that the time zone
information can be read from.
:param filename:
This is an optional parameter specifying the source of the time zone
information in the event that ``fileobj`` is a file object. If omitted
and ``fileobj`` is a file stream, this parameter will be set either to
``fileobj``'s ``name`` attribute or to ``repr(fileobj)``.
See `Sources for Time Zone and Daylight Saving Time Data
<http://www.twinsun.com/tz/tz-link.htm>`_ for more information. Time zone
files can be compiled from the `IANA Time Zone database files
<https://www.iana.org/time-zones>`_ with the `zic time zone compiler
<https://www.freebsd.org/cgi/man.cgi?query=zic&sektion=8>`_
"""
def __init__(self, fileobj, filename=None):
super(tzfile, self).__init__()
file_opened_here = False
if isinstance(fileobj, string_types):
self._filename = fileobj
fileobj = open(fileobj, 'rb')
file_opened_here = True
elif filename is not None:
self._filename = filename
elif hasattr(fileobj, "name"):
self._filename = fileobj.name
else:
self._filename = repr(fileobj)
if fileobj is not None:
if not file_opened_here:
fileobj = _ContextWrapper(fileobj)
with fileobj as file_stream:
tzobj = self._read_tzfile(file_stream)
self._set_tzdata(tzobj)
def _set_tzdata(self, tzobj):
""" Set the time zone data of this object from a _tzfile object """
# Copy the relevant attributes over as private attributes
for attr in _tzfile.attrs:
setattr(self, '_' + attr, getattr(tzobj, attr))
def _read_tzfile(self, fileobj):
out = _tzfile()
# From tzfile(5):
#
# The time zone information files used by tzset(3)
# begin with the magic characters "TZif" to identify
# them as time zone information files, followed by
# sixteen bytes reserved for future use, followed by
# six four-byte values of type long, written in a
# ``standard'' byte order (the high-order byte
# of the value is written first).
if fileobj.read(4).decode() != "TZif":
raise ValueError("magic not found")
fileobj.read(16)
(
# The number of UTC/local indicators stored in the file.
ttisgmtcnt,
# The number of standard/wall indicators stored in the file.
ttisstdcnt,
# The number of leap seconds for which data is
# stored in the file.
leapcnt,
# The number of "transition times" for which data
# is stored in the file.
timecnt,
# The number of "local time types" for which data
# is stored in the file (must not be zero).
typecnt,
# The number of characters of "time zone
# abbreviation strings" stored in the file.
charcnt,
) = struct.unpack(">6l", fileobj.read(24))
# The above header is followed by tzh_timecnt four-byte
# values of type long, sorted in ascending order.
# These values are written in ``standard'' byte order.
# Each is used as a transition time (as returned by
# time(2)) at which the rules for computing local time
# change.
if timecnt:
out.trans_list_utc = list(struct.unpack(">%dl" % timecnt,
fileobj.read(timecnt*4)))
else:
out.trans_list_utc = []
# Next come tzh_timecnt one-byte values of type unsigned
# char; each one tells which of the different types of
# ``local time'' types described in the file is associated
# with the same-indexed transition time. These values
# serve as indices into an array of ttinfo structures that
# appears next in the file.
if timecnt:
out.trans_idx = struct.unpack(">%dB" % timecnt,
fileobj.read(timecnt))
else:
out.trans_idx = []
# Each ttinfo structure is written as a four-byte value
# for tt_gmtoff of type long, in a standard byte
# order, followed by a one-byte value for tt_isdst
# and a one-byte value for tt_abbrind. In each
# structure, tt_gmtoff gives the number of
# seconds to be added to UTC, tt_isdst tells whether
# tm_isdst should be set by localtime(3), and
# tt_abbrind serves as an index into the array of
# time zone abbreviation characters that follow the
# ttinfo structure(s) in the file.
ttinfo = []
for i in range(typecnt):
ttinfo.append(struct.unpack(">lbb", fileobj.read(6)))
abbr = fileobj.read(charcnt).decode()
# Then there are tzh_leapcnt pairs of four-byte
# values, written in standard byte order; the
# first value of each pair gives the time (as
# returned by time(2)) at which a leap second
# occurs; the second gives the total number of
# leap seconds to be applied after the given time.
# The pairs of values are sorted in ascending order
# by time.
# Not used, for now (but seek for correct file position)
if leapcnt:
fileobj.seek(leapcnt * 8, os.SEEK_CUR)
# Then there are tzh_ttisstdcnt standard/wall
# indicators, each stored as a one-byte value;
# they tell whether the transition times associated
# with local time types were specified as standard
# time or wall clock time, and are used when
# a time zone file is used in handling POSIX-style
# time zone environment variables.
if ttisstdcnt:
isstd = struct.unpack(">%db" % ttisstdcnt,
fileobj.read(ttisstdcnt))
# Finally, there are tzh_ttisgmtcnt UTC/local
# indicators, each stored as a one-byte value;
# they tell whether the transition times associated
# with local time types were specified as UTC or
# local time, and are used when a time zone file
# is used in handling POSIX-style time zone envi-
# ronment variables.
if ttisgmtcnt:
isgmt = struct.unpack(">%db" % ttisgmtcnt,
fileobj.read(ttisgmtcnt))
# Build ttinfo list
out.ttinfo_list = []
for i in range(typecnt):
gmtoff, isdst, abbrind = ttinfo[i]
# Round to full-minutes if that's not the case. Python's
# datetime doesn't accept sub-minute timezones. Check
# http://python.org/sf/1447945 for some information.
gmtoff = 60 * ((gmtoff + 30) // 60)
tti = _ttinfo()
tti.offset = gmtoff
tti.dstoffset = datetime.timedelta(0)
tti.delta = datetime.timedelta(seconds=gmtoff)
tti.isdst = isdst
tti.abbr = abbr[abbrind:abbr.find('\x00', abbrind)]
tti.isstd = (ttisstdcnt > i and isstd[i] != 0)
tti.isgmt = (ttisgmtcnt > i and isgmt[i] != 0)
out.ttinfo_list.append(tti)
# Replace ttinfo indexes for ttinfo objects.
out.trans_idx = [out.ttinfo_list[idx] for idx in out.trans_idx]
# Set standard, dst, and before ttinfos. before will be
# used when a given time is before any transitions,
# and will be set to the first non-dst ttinfo, or to
# the first dst, if all of them are dst.
out.ttinfo_std = None
out.ttinfo_dst = None
out.ttinfo_before = None
if out.ttinfo_list:
if not out.trans_list_utc:
out.ttinfo_std = out.ttinfo_first = out.ttinfo_list[0]
else:
for i in range(timecnt-1, -1, -1):
tti = out.trans_idx[i]
if not out.ttinfo_std and not tti.isdst:
out.ttinfo_std = tti
elif not out.ttinfo_dst and tti.isdst:
out.ttinfo_dst = tti
if out.ttinfo_std and out.ttinfo_dst:
break
else:
if out.ttinfo_dst and not out.ttinfo_std:
out.ttinfo_std = out.ttinfo_dst
for tti in out.ttinfo_list:
if not tti.isdst:
out.ttinfo_before = tti
break
else:
out.ttinfo_before = out.ttinfo_list[0]
# Now fix transition times to become relative to wall time.
#
# I'm not sure about this. In my tests, the tz source file
# is setup to wall time, and in the binary file isstd and
# isgmt are off, so it should be in wall time. OTOH, it's
# always in gmt time. Let me know if you have comments
# about this.
laststdoffset = None
out.trans_list = []
for i, tti in enumerate(out.trans_idx):
if not tti.isdst:
offset = tti.offset
laststdoffset = offset
else:
if laststdoffset is not None:
# Store the DST offset as well and update it in the list
tti.dstoffset = tti.offset - laststdoffset
out.trans_idx[i] = tti
offset = laststdoffset or 0
out.trans_list.append(out.trans_list_utc[i] + offset)
# In case we missed any DST offsets on the way in for some reason, make
# a second pass over the list, looking for the /next/ DST offset.
laststdoffset = None
for i in reversed(range(len(out.trans_idx))):
tti = out.trans_idx[i]
if tti.isdst:
if not (tti.dstoffset or laststdoffset is None):
tti.dstoffset = tti.offset - laststdoffset
else:
laststdoffset = tti.offset
if not isinstance(tti.dstoffset, datetime.timedelta):
tti.dstoffset = datetime.timedelta(seconds=tti.dstoffset)
out.trans_idx[i] = tti
out.trans_idx = tuple(out.trans_idx)
out.trans_list = tuple(out.trans_list)
out.trans_list_utc = tuple(out.trans_list_utc)
return out
def _find_last_transition(self, dt, in_utc=False):
# If there's no list, there are no transitions to find
if not self._trans_list:
return None
timestamp = _datetime_to_timestamp(dt)
# Find where the timestamp fits in the transition list - if the
# timestamp is a transition time, it's part of the "after" period.
trans_list = self._trans_list_utc if in_utc else self._trans_list
idx = bisect.bisect_right(trans_list, timestamp)
# We want to know when the previous transition was, so subtract off 1
return idx - 1
def _get_ttinfo(self, idx):
# For no list or after the last transition, default to _ttinfo_std
if idx is None or (idx + 1) >= len(self._trans_list):
return self._ttinfo_std
# If there is a list and the time is before it, return _ttinfo_before
if idx < 0:
return self._ttinfo_before
return self._trans_idx[idx]
def _find_ttinfo(self, dt):
idx = self._resolve_ambiguous_time(dt)
return self._get_ttinfo(idx)
def fromutc(self, dt):
"""
The ``tzfile`` implementation of :py:func:`datetime.tzinfo.fromutc`.
:param dt:
A :py:class:`datetime.datetime` object.
:raises TypeError:
Raised if ``dt`` is not a :py:class:`datetime.datetime` object.
:raises ValueError:
Raised if this is called with a ``dt`` which does not have this
``tzinfo`` attached.
:return:
Returns a :py:class:`datetime.datetime` object representing the
wall time in ``self``'s time zone.
"""
# These isinstance checks are in datetime.tzinfo, so we'll preserve
# them, even if we don't care about duck typing.
if not isinstance(dt, datetime.datetime):
raise TypeError("fromutc() requires a datetime argument")
if dt.tzinfo is not self:
raise ValueError("dt.tzinfo is not self")
# First treat UTC as wall time and get the transition we're in.
idx = self._find_last_transition(dt, in_utc=True)
tti = self._get_ttinfo(idx)
dt_out = dt + datetime.timedelta(seconds=tti.offset)
fold = self.is_ambiguous(dt_out, idx=idx)
return enfold(dt_out, fold=int(fold))
def is_ambiguous(self, dt, idx=None):
"""
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
"""
if idx is None:
idx = self._find_last_transition(dt)
# Calculate the difference in offsets from current to previous
timestamp = _datetime_to_timestamp(dt)
tti = self._get_ttinfo(idx)
if idx is None or idx <= 0:
return False
od = self._get_ttinfo(idx - 1).offset - tti.offset
tt = self._trans_list[idx] # Transition time
return timestamp < tt + od
def _resolve_ambiguous_time(self, dt):
idx = self._find_last_transition(dt)
# If we have no transitions, return the index
_fold = self._fold(dt)
if idx is None or idx == 0:
return idx
# If it's ambiguous and we're in a fold, shift to a different index.
idx_offset = int(not _fold and self.is_ambiguous(dt, idx))
return idx - idx_offset
def utcoffset(self, dt):
if dt is None:
return None
if not self._ttinfo_std:
return ZERO
return self._find_ttinfo(dt).delta
def dst(self, dt):
if dt is None:
return None
if not self._ttinfo_dst:
return ZERO
tti = self._find_ttinfo(dt)
if not tti.isdst:
return ZERO
# The documentation says that utcoffset()-dst() must
# be constant for every dt.
return tti.dstoffset
@tzname_in_python2
def tzname(self, dt):
if not self._ttinfo_std or dt is None:
return None
return self._find_ttinfo(dt).abbr
def __eq__(self, other):
if not isinstance(other, tzfile):
return NotImplemented
return (self._trans_list == other._trans_list and
self._trans_idx == other._trans_idx and
self._ttinfo_list == other._ttinfo_list)
__hash__ = None
def __ne__(self, other):
return not (self == other)
def __repr__(self):
return "%s(%s)" % (self.__class__.__name__, repr(self._filename))
def __reduce__(self):
return self.__reduce_ex__(None)
def __reduce_ex__(self, protocol):
return (self.__class__, (None, self._filename), self.__dict__)
class tzrange(tzrangebase):
"""
The ``tzrange`` object is a time zone specified by a set of offsets and
abbreviations, equivalent to the way the ``TZ`` variable can be specified
in POSIX-like systems, but using Python delta objects to specify DST
start, end and offsets.
:param stdabbr:
The abbreviation for standard time (e.g. ``'EST'``).
:param stdoffset:
An integer or :class:`datetime.timedelta` object or equivalent
specifying the base offset from UTC.
If unspecified, +00:00 is used.
:param dstabbr:
The abbreviation for DST / "Summer" time (e.g. ``'EDT'``).
If specified, with no other DST information, DST is assumed to occur
and the default behavior or ``dstoffset``, ``start`` and ``end`` is
used. If unspecified and no other DST information is specified, it
is assumed that this zone has no DST.
If this is unspecified and other DST information is *is* specified,
DST occurs in the zone but the time zone abbreviation is left
unchanged.
:param dstoffset:
A an integer or :class:`datetime.timedelta` object or equivalent
specifying the UTC offset during DST. If unspecified and any other DST
information is specified, it is assumed to be the STD offset +1 hour.
:param start:
A :class:`relativedelta.relativedelta` object or equivalent specifying
the time and time of year that daylight savings time starts. To specify,
for example, that DST starts at 2AM on the 2nd Sunday in March, pass:
``relativedelta(hours=2, month=3, day=1, weekday=SU(+2))``
If unspecified and any other DST information is specified, the default
value is 2 AM on the first Sunday in April.
:param end:
A :class:`relativedelta.relativedelta` object or equivalent representing
the time and time of year that daylight savings time ends, with the
same specification method as in ``start``. One note is that this should
point to the first time in the *standard* zone, so if a transition
occurs at 2AM in the DST zone and the clocks are set back 1 hour to 1AM,
set the `hours` parameter to +1.
**Examples:**
.. testsetup:: tzrange
from dateutil.tz import tzrange, tzstr
.. doctest:: tzrange
>>> tzstr('EST5EDT') == tzrange("EST", -18000, "EDT")
True
>>> from dateutil.relativedelta import *
>>> range1 = tzrange("EST", -18000, "EDT")
>>> range2 = tzrange("EST", -18000, "EDT", -14400,
... relativedelta(hours=+2, month=4, day=1,
... weekday=SU(+1)),
... relativedelta(hours=+1, month=10, day=31,
... weekday=SU(-1)))
>>> tzstr('EST5EDT') == range1 == range2
True
"""
def __init__(self, stdabbr, stdoffset=None,
dstabbr=None, dstoffset=None,
start=None, end=None):
global relativedelta
from dateutil import relativedelta
self._std_abbr = stdabbr
self._dst_abbr = dstabbr
try:
stdoffset = _total_seconds(stdoffset)
except (TypeError, AttributeError):
pass
try:
dstoffset = _total_seconds(dstoffset)
except (TypeError, AttributeError):
pass
if stdoffset is not None:
self._std_offset = datetime.timedelta(seconds=stdoffset)
else:
self._std_offset = ZERO
if dstoffset is not None:
self._dst_offset = datetime.timedelta(seconds=dstoffset)
elif dstabbr and stdoffset is not None:
self._dst_offset = self._std_offset + datetime.timedelta(hours=+1)
else:
self._dst_offset = ZERO
if dstabbr and start is None:
self._start_delta = relativedelta.relativedelta(
hours=+2, month=4, day=1, weekday=relativedelta.SU(+1))
else:
self._start_delta = start
if dstabbr and end is None:
self._end_delta = relativedelta.relativedelta(
hours=+1, month=10, day=31, weekday=relativedelta.SU(-1))
else:
self._end_delta = end
self._dst_base_offset_ = self._dst_offset - self._std_offset
self.hasdst = bool(self._start_delta)
def transitions(self, year):
"""
For a given year, get the DST on and off transition times, expressed
always on the standard time side. For zones with no transitions, this
function returns ``None``.
:param year:
The year whose transitions you would like to query.
:return:
Returns a :class:`tuple` of :class:`datetime.datetime` objects,
``(dston, dstoff)`` for zones with an annual DST transition, or
``None`` for fixed offset zones.
"""
if not self.hasdst:
return None
base_year = datetime.datetime(year, 1, 1)
start = base_year + self._start_delta
end = base_year + self._end_delta
return (start, end)
def __eq__(self, other):
if not isinstance(other, tzrange):
return NotImplemented
return (self._std_abbr == other._std_abbr and
self._dst_abbr == other._dst_abbr and
self._std_offset == other._std_offset and
self._dst_offset == other._dst_offset and
self._start_delta == other._start_delta and
self._end_delta == other._end_delta)
@property
def _dst_base_offset(self):
return self._dst_base_offset_
class tzstr(tzrange):
"""
``tzstr`` objects are time zone objects specified by a time-zone string as
it would be passed to a ``TZ`` variable on POSIX-style systems (see
the `GNU C Library: TZ Variable`_ for more details).
There is one notable exception, which is that POSIX-style time zones use an
inverted offset format, so normally ``GMT+3`` would be parsed as an offset
3 hours *behind* GMT. The ``tzstr`` time zone object will parse this as an
offset 3 hours *ahead* of GMT. If you would like to maintain the POSIX
behavior, pass a ``True`` value to ``posix_offset``.
The :class:`tzrange` object provides the same functionality, but is
specified using :class:`relativedelta.relativedelta` objects. rather than
strings.
:param s:
A time zone string in ``TZ`` variable format. This can be a
:class:`bytes` (2.x: :class:`str`), :class:`str` (2.x: :class:`unicode`)
or a stream emitting unicode characters (e.g. :class:`StringIO`).
:param posix_offset:
Optional. If set to ``True``, interpret strings such as ``GMT+3`` or
``UTC+3`` as being 3 hours *behind* UTC rather than ahead, per the
POSIX standard.
.. _`GNU C Library: TZ Variable`:
https://www.gnu.org/software/libc/manual/html_node/TZ-Variable.html
"""
def __init__(self, s, posix_offset=False):
global parser
from dateutil import parser
self._s = s
res = parser._parsetz(s)
if res is None:
raise ValueError("unknown string format")
# Here we break the compatibility with the TZ variable handling.
# GMT-3 actually *means* the timezone -3.
if res.stdabbr in ("GMT", "UTC") and not posix_offset:
res.stdoffset *= -1
# We must initialize it first, since _delta() needs
# _std_offset and _dst_offset set. Use False in start/end
# to avoid building it two times.
tzrange.__init__(self, res.stdabbr, res.stdoffset,
res.dstabbr, res.dstoffset,
start=False, end=False)
if not res.dstabbr:
self._start_delta = None
self._end_delta = None
else:
self._start_delta = self._delta(res.start)
if self._start_delta:
self._end_delta = self._delta(res.end, isend=1)
self.hasdst = bool(self._start_delta)
def _delta(self, x, isend=0):
from dateutil import relativedelta
kwargs = {}
if x.month is not None:
kwargs["month"] = x.month
if x.weekday is not None:
kwargs["weekday"] = relativedelta.weekday(x.weekday, x.week)
if x.week > 0:
kwargs["day"] = 1
else:
kwargs["day"] = 31
elif x.day:
kwargs["day"] = x.day
elif x.yday is not None:
kwargs["yearday"] = x.yday
elif x.jyday is not None:
kwargs["nlyearday"] = x.jyday
if not kwargs:
# Default is to start on first sunday of april, and end
# on last sunday of october.
if not isend:
kwargs["month"] = 4
kwargs["day"] = 1
kwargs["weekday"] = relativedelta.SU(+1)
else:
kwargs["month"] = 10
kwargs["day"] = 31
kwargs["weekday"] = relativedelta.SU(-1)
if x.time is not None:
kwargs["seconds"] = x.time
else:
# Default is 2AM.
kwargs["seconds"] = 7200
if isend:
# Convert to standard time, to follow the documented way
# of working with the extra hour. See the documentation
# of the tzinfo class.
delta = self._dst_offset - self._std_offset
kwargs["seconds"] -= delta.seconds + delta.days * 86400
return relativedelta.relativedelta(**kwargs)
def __repr__(self):
return "%s(%s)" % (self.__class__.__name__, repr(self._s))
class _tzicalvtzcomp(object):
def __init__(self, tzoffsetfrom, tzoffsetto, isdst,
tzname=None, rrule=None):
self.tzoffsetfrom = datetime.timedelta(seconds=tzoffsetfrom)
self.tzoffsetto = datetime.timedelta(seconds=tzoffsetto)
self.tzoffsetdiff = self.tzoffsetto - self.tzoffsetfrom
self.isdst = isdst
self.tzname = tzname
self.rrule = rrule
class _tzicalvtz(_tzinfo):
def __init__(self, tzid, comps=[]):
super(_tzicalvtz, self).__init__()
self._tzid = tzid
self._comps = comps
self._cachedate = []
self._cachecomp = []
def _find_comp(self, dt):
if len(self._comps) == 1:
return self._comps[0]
dt = dt.replace(tzinfo=None)
try:
return self._cachecomp[self._cachedate.index((dt, self._fold(dt)))]
except ValueError:
pass
lastcompdt = None
lastcomp = None
for comp in self._comps:
compdt = self._find_compdt(comp, dt)
if compdt and (not lastcompdt or lastcompdt < compdt):
lastcompdt = compdt
lastcomp = comp
if not lastcomp:
# RFC says nothing about what to do when a given
# time is before the first onset date. We'll look for the
# first standard component, or the first component, if
# none is found.
for comp in self._comps:
if not comp.isdst:
lastcomp = comp
break
else:
lastcomp = comp[0]
self._cachedate.insert(0, (dt, self._fold(dt)))
self._cachecomp.insert(0, lastcomp)
if len(self._cachedate) > 10:
self._cachedate.pop()
self._cachecomp.pop()
return lastcomp
def _find_compdt(self, comp, dt):
if comp.tzoffsetdiff < ZERO and self._fold(dt):
dt -= comp.tzoffsetdiff
compdt = comp.rrule.before(dt, inc=True)
return compdt
def utcoffset(self, dt):
if dt is None:
return None
return self._find_comp(dt).tzoffsetto
def dst(self, dt):
comp = self._find_comp(dt)
if comp.isdst:
return comp.tzoffsetdiff
else:
return ZERO
@tzname_in_python2
def tzname(self, dt):
return self._find_comp(dt).tzname
def __repr__(self):
return "<tzicalvtz %s>" % repr(self._tzid)
__reduce__ = object.__reduce__
class tzical(object):
"""
This object is designed to parse an iCalendar-style ``VTIMEZONE`` structure
as set out in `RFC 2445`_ Section 4.6.5 into one or more `tzinfo` objects.
:param `fileobj`:
A file or stream in iCalendar format, which should be UTF-8 encoded
with CRLF endings.
.. _`RFC 2445`: https://www.ietf.org/rfc/rfc2445.txt
"""
def __init__(self, fileobj):
global rrule
from dateutil import rrule
if isinstance(fileobj, string_types):
self._s = fileobj
# ical should be encoded in UTF-8 with CRLF
fileobj = open(fileobj, 'r')
else:
self._s = getattr(fileobj, 'name', repr(fileobj))
fileobj = _ContextWrapper(fileobj)
self._vtz = {}
with fileobj as fobj:
self._parse_rfc(fobj.read())
def keys(self):
"""
Retrieves the available time zones as a list.
"""
return list(self._vtz.keys())
def get(self, tzid=None):
"""
Retrieve a :py:class:`datetime.tzinfo` object by its ``tzid``.
:param tzid:
If there is exactly one time zone available, omitting ``tzid``
or passing :py:const:`None` value returns it. Otherwise a valid
key (which can be retrieved from :func:`keys`) is required.
:raises ValueError:
Raised if ``tzid`` is not specified but there are either more
or fewer than 1 zone defined.
:returns:
Returns either a :py:class:`datetime.tzinfo` object representing
the relevant time zone or :py:const:`None` if the ``tzid`` was
not found.
"""
if tzid is None:
if len(self._vtz) == 0:
raise ValueError("no timezones defined")
elif len(self._vtz) > 1:
raise ValueError("more than one timezone available")
tzid = next(iter(self._vtz))
return self._vtz.get(tzid)
def _parse_offset(self, s):
s = s.strip()
if not s:
raise ValueError("empty offset")
if s[0] in ('+', '-'):
signal = (-1, +1)[s[0] == '+']
s = s[1:]
else:
signal = +1
if len(s) == 4:
return (int(s[:2]) * 3600 + int(s[2:]) * 60) * signal
elif len(s) == 6:
return (int(s[:2]) * 3600 + int(s[2:4]) * 60 + int(s[4:])) * signal
else:
raise ValueError("invalid offset: " + s)
def _parse_rfc(self, s):
lines = s.splitlines()
if not lines:
raise ValueError("empty string")
# Unfold
i = 0
while i < len(lines):
line = lines[i].rstrip()
if not line:
del lines[i]
elif i > 0 and line[0] == " ":
lines[i-1] += line[1:]
del lines[i]
else:
i += 1
tzid = None
comps = []
invtz = False
comptype = None
for line in lines:
if not line:
continue
name, value = line.split(':', 1)
parms = name.split(';')
if not parms:
raise ValueError("empty property name")
name = parms[0].upper()
parms = parms[1:]
if invtz:
if name == "BEGIN":
if value in ("STANDARD", "DAYLIGHT"):
# Process component
pass
else:
raise ValueError("unknown component: "+value)
comptype = value
founddtstart = False
tzoffsetfrom = None
tzoffsetto = None
rrulelines = []
tzname = None
elif name == "END":
if value == "VTIMEZONE":
if comptype:
raise ValueError("component not closed: "+comptype)
if not tzid:
raise ValueError("mandatory TZID not found")
if not comps:
raise ValueError(
"at least one component is needed")
# Process vtimezone
self._vtz[tzid] = _tzicalvtz(tzid, comps)
invtz = False
elif value == comptype:
if not founddtstart:
raise ValueError("mandatory DTSTART not found")
if tzoffsetfrom is None:
raise ValueError(
"mandatory TZOFFSETFROM not found")
if tzoffsetto is None:
raise ValueError(
"mandatory TZOFFSETFROM not found")
# Process component
rr = None
if rrulelines:
rr = rrule.rrulestr("\n".join(rrulelines),
compatible=True,
ignoretz=True,
cache=True)
comp = _tzicalvtzcomp(tzoffsetfrom, tzoffsetto,
(comptype == "DAYLIGHT"),
tzname, rr)
comps.append(comp)
comptype = None
else:
raise ValueError("invalid component end: "+value)
elif comptype:
if name == "DTSTART":
rrulelines.append(line)
founddtstart = True
elif name in ("RRULE", "RDATE", "EXRULE", "EXDATE"):
rrulelines.append(line)
elif name == "TZOFFSETFROM":
if parms:
raise ValueError(
"unsupported %s parm: %s " % (name, parms[0]))
tzoffsetfrom = self._parse_offset(value)
elif name == "TZOFFSETTO":
if parms:
raise ValueError(
"unsupported TZOFFSETTO parm: "+parms[0])
tzoffsetto = self._parse_offset(value)
elif name == "TZNAME":
if parms:
raise ValueError(
"unsupported TZNAME parm: "+parms[0])
tzname = value
elif name == "COMMENT":
pass
else:
raise ValueError("unsupported property: "+name)
else:
if name == "TZID":
if parms:
raise ValueError(
"unsupported TZID parm: "+parms[0])
tzid = value
elif name in ("TZURL", "LAST-MODIFIED", "COMMENT"):
pass
else:
raise ValueError("unsupported property: "+name)
elif name == "BEGIN" and value == "VTIMEZONE":
tzid = None
comps = []
invtz = True
def __repr__(self):
return "%s(%s)" % (self.__class__.__name__, repr(self._s))
if sys.platform != "win32":
TZFILES = ["/etc/localtime", "localtime"]
TZPATHS = ["/usr/share/zoneinfo",
"/usr/lib/zoneinfo",
"/usr/share/lib/zoneinfo",
"/etc/zoneinfo"]
else:
TZFILES = []
TZPATHS = []
def gettz(name=None):
tz = None
if not name:
try:
name = os.environ["TZ"]
except KeyError:
pass
if name is None or name == ":":
for filepath in TZFILES:
if not os.path.isabs(filepath):
filename = filepath
for path in TZPATHS:
filepath = os.path.join(path, filename)
if os.path.isfile(filepath):
break
else:
continue
if os.path.isfile(filepath):
try:
tz = tzfile(filepath)
break
except (IOError, OSError, ValueError):
pass
else:
tz = tzlocal()
else:
if name.startswith(":"):
name = name[:-1]
if os.path.isabs(name):
if os.path.isfile(name):
tz = tzfile(name)
else:
tz = None
else:
for path in TZPATHS:
filepath = os.path.join(path, name)
if not os.path.isfile(filepath):
filepath = filepath.replace(' ', '_')
if not os.path.isfile(filepath):
continue
try:
tz = tzfile(filepath)
break
except (IOError, OSError, ValueError):
pass
else:
tz = None
if tzwin is not None:
try:
tz = tzwin(name)
except WindowsError:
tz = None
if not tz:
from dateutil.zoneinfo import get_zonefile_instance
tz = get_zonefile_instance().get(name)
if not tz:
for c in name:
# name must have at least one offset to be a tzstr
if c in "0123456789":
try:
tz = tzstr(name)
except ValueError:
pass
break
else:
if name in ("GMT", "UTC"):
tz = tzutc()
elif name in time.tzname:
tz = tzlocal()
return tz
def datetime_exists(dt, tz=None):
"""
Given a datetime and a time zone, determine whether or not a given datetime
would fall in a gap.
:param dt:
A :class:`datetime.datetime` (whose time zone will be ignored if ``tz``
is provided.)
:param tz:
A :class:`datetime.tzinfo` with support for the ``fold`` attribute. If
``None`` or not provided, the datetime's own time zone will be used.
:return:
Returns a boolean value whether or not the "wall time" exists in ``tz``.
"""
if tz is None:
if dt.tzinfo is None:
raise ValueError('Datetime is naive and no time zone provided.')
tz = dt.tzinfo
dt = dt.replace(tzinfo=None)
# This is essentially a test of whether or not the datetime can survive
# a round trip to UTC.
dt_rt = dt.replace(tzinfo=tz).astimezone(tzutc()).astimezone(tz)
dt_rt = dt_rt.replace(tzinfo=None)
return dt == dt_rt
def datetime_ambiguous(dt, tz=None):
"""
Given a datetime and a time zone, determine whether or not a given datetime
is ambiguous (i.e if there are two times differentiated only by their DST
status).
:param dt:
A :class:`datetime.datetime` (whose time zone will be ignored if ``tz``
is provided.)
:param tz:
A :class:`datetime.tzinfo` with support for the ``fold`` attribute. If
``None`` or not provided, the datetime's own time zone will be used.
:return:
Returns a boolean value whether or not the "wall time" is ambiguous in
``tz``.
.. versionadded:: 2.6.0
"""
if tz is None:
if dt.tzinfo is None:
raise ValueError('Datetime is naive and no time zone provided.')
tz = dt.tzinfo
# If a time zone defines its own "is_ambiguous" function, we'll use that.
is_ambiguous_fn = getattr(tz, 'is_ambiguous', None)
if is_ambiguous_fn is not None:
try:
return tz.is_ambiguous(dt)
except:
pass
# If it doesn't come out and tell us it's ambiguous, we'll just check if
# the fold attribute has any effect on this particular date and time.
dt = dt.replace(tzinfo=tz)
wall_0 = enfold(dt, fold=0)
wall_1 = enfold(dt, fold=1)
same_offset = wall_0.utcoffset() == wall_1.utcoffset()
same_dst = wall_0.dst() == wall_1.dst()
return not (same_offset and same_dst)
def _datetime_to_timestamp(dt):
"""
Convert a :class:`datetime.datetime` object to an epoch timestamp in seconds
since January 1, 1970, ignoring the time zone.
"""
return _total_seconds((dt.replace(tzinfo=None) - EPOCH))
class _ContextWrapper(object):
"""
Class for wrapping contexts so that they are passed through in a
with statement.
"""
def __init__(self, context):
self.context = context
def __enter__(self):
return self.context
def __exit__(*args, **kwargs):
pass
# vim:ts=4:sw=4:et
dateutil/tz/__pycache__/__init__.cpython-36.pyc 0000644 00000000462 14751155147 0015425 0 ustar 00 3
6�cY� �
@ s* d dl T dddddddd d
d d d
dg
ZdS )� )�*ZtzutcZtzoffsetZtzlocalZtzfileZtzrangeZtzstrZtzicalZtzwinZ
tzwinlocalZgettzZenfoldZdatetime_ambiguousZdatetime_existsN)Ztz�__all__� r r � /usr/lib/python3.6/__init__.py�<module> s
dateutil/tz/__pycache__/win.cpython-36.pyc 0000644 00000022344 14751155147 0014466 0 ustar 00 3
6�cY�, � @ s� d dl Z d dlZd dlmZ d dlmZ yd dlZd dlmZ W n ek
r\ e d��Y nX ddl
m Z dd d
gZ e j
d �Zd Zd
ZdZdd� Ze� ZG dd
� d
e�ZG dd� de �ZG dd� de�ZG dd � d e�Zdd� Zdd� ZdS )� N)�winreg)� text_type)�wintypesz#Running tzwin on non-Windows system� )� tzrangebase�tzwin�
tzwinlocal�tzres� z7SOFTWARE\Microsoft\Windows NT\CurrentVersion\Time Zonesz4SOFTWARE\Microsoft\Windows\CurrentVersion\Time Zonesz4SYSTEM\CurrentControlSet\Control\TimeZoneInformationc C sL t jd t j�} yt j| t�j� t}W n tk
r> t}Y nX | j� |S )N)r �ConnectRegistry�HKEY_LOCAL_MACHINE�OpenKey� TZKEYNAMENTZCloseZ WindowsError� TZKEYNAME9X)�handle� TZKEYNAME� r �/usr/lib/python3.6/win.py�
_settzkeyname s
r c @ s6 e Zd ZdZejej�Zd
dd�Z dd� Z
dd� Z d S ) r z{
Class for accessing `tzres.dll`, which contains timezone name related
resources.
.. versionadded:: 2.5.0
� tzres.dllc C s@ t jd�}tjtjtjt jf|j_|j| _t j|�| _ || _
d S )N�user32) �ctypesZWinDLLr Z HINSTANCEZUINT�LPWSTRZc_int� LoadStringWZargtypes�_tzres� tzres_loc)�selfr r r r r �__init__1 s
ztzres.__init__c C s< | j � }tjtj|�tj�}| j| jj||d�}|d|� S )a�
Load a timezone name from a DLL offset (integer).
>>> from dateutil.tzwin import tzres
>>> tzr = tzres()
>>> print(tzr.load_name(112))
'Eastern Standard Time'
:param offset:
A positive integer value referring to a string from the tzres dll.
..note:
Offsets found in the registry are generally of the form
`@tzres.dll,-114`. The offset in this case if 114, not -114.
r N) �p_wcharr �castZbyrefr r r r Z_handle)r �offsetZresourceZlpBufferZncharr r r � load_name? s ztzres.load_namec C sH |j d�s|S |jd�}yt|d �}W n td��Y nX | j|�S )a�
Parse strings as returned from the Windows registry into the time zone
name as defined in the registry.
>>> from dateutil.tzwin import tzres
>>> tzr = tzres()
>>> print(tzr.name_from_string('@tzres.dll,-251'))
'Dateline Daylight Time'
>>> print(tzr.name_from_string('Eastern Standard Time'))
'Eastern Standard Time'
:param tzname_str:
A timezone name string as returned from a Windows registry key.
:return:
Returns the localized timezone string from tzres.dll if the string
is of the form `@tzres.dll,-offset`, else returns the input string.
�@z,-r zMalformed timezone string.)�
startswith�split�int�
ValueErrorr! )r Z
tzname_strZ name_spltr r r r �name_from_stringU s
ztzres.name_from_stringN)r ) �__name__�
__module__� __qualname__�__doc__r ZPOINTERr ZWCHARr r r! r' r r r r r ( s
c @ sP e Zd ZdZdd� Zdd� Zedd� �Zdd � Zd
d � Z d d
� Z
e dd� �Z dS )� tzwinbasezBtzinfo class based on win32's timezones available in the registry.c C s t d��d S )Nz#tzwinbase is an abstract base class)�NotImplementedError)r r r r r v s ztzwinbase.__init__c C s� t |t�stS | j|jko�| j|jko�| j|jko�| j|jko�| j|jko�| j|jko�| j |j ko�| j
|j
ko�| j |j ko�| j |j ko�| j
|j
ko�| j|jkS )N)�
isinstancer, �NotImplemented� _std_offset� _dst_offset�
_stddayofweek�
_dstdayofweek�_stdweeknumber�_dstweeknumber�_stdhour�_dsthour�
_stdminute�
_dstminute� _std_abbr� _dst_abbr)r �otherr r r �__eq__y s
ztzwinbase.__eq__c sV t jdt j��>} t j| t��&� � fdd�tt j� �d �D �}W dQ R X W dQ R X |S )z4Return a list of all time zones known to the system.Nc s g | ]}t j� |��qS r )r ZEnumKey)�.0�i)�tzkeyr r �
<listcomp>� s z"tzwinbase.list.<locals>.<listcomp>r )r r r r
r �range� QueryInfoKey)r �resultr )r@ r �list� s
*ztzwinbase.listc C s | j S )N)�_display)r r r r �display� s ztzwinbase.displayc C sT | j s
dS t|| j| j| j| j| j�}t|| j| j| j | j
| j �}|| j 8 }||fS )a�
For a given year, get the DST on and off transition times, expressed
always on the standard time side. For zones with no transitions, this
function returns ``None``.
:param year:
The year whose transitions you would like to query.
:return:
Returns a :class:`tuple` of :class:`datetime.datetime` objects,
``(dston, dstoff)`` for zones with an annual DST transition, or
``None`` for fixed offset zones.
N)
�hasdst�picknthweekday� _dstmonthr3 r7 r9 r5 � _stdmonthr2 r6 r8 r4 �_dst_base_offset)r �yearZdstonZdstoffr r r � transitions� s
ztzwinbase.transitionsc C s
| j dkS )Nr )rJ )r r r r � _get_hasdst� s ztzwinbase._get_hasdstc C s | j S )N)�_dst_base_offset_)r r r r rL � s ztzwinbase._dst_base_offsetN)
r( r) r* r+ r r= � staticmethodrE rG rN rO �propertyrL r r r r r, t s r, c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )r c C s || _ tjd tj��8}td�jt|d�}tj||��}t|�}W d Q R X W d Q R X |d | _ |d | _
|d | _ t j
d|d �}|d |d }||d
}tj|d �| _tj|d �| _|d d
� \| _| _| _| _| _|dd� \| _| _| _| _| _| j| j | _ | j � | _ d S )Nz {kn}\{name})�kn�nameZStdZDlt�Displayz=3l16hZTZIr r � )�minutes� � � � ) �_namer r r r �formatr r
� valuestodictr: r; rF �struct�unpack�datetime� timedeltar0 r1 rK r2 r4 r6 r8 rJ r3 r5 r7 r9 rP rO rH ) r rT r � tzkeynamer@ �keydict�tup� stdoffset� dstoffsetr r r r � s"
ztzwin.__init__c C s dt | j� S )Nz tzwin(%s))�reprr\ )r r r r �__repr__� s ztzwin.__repr__c C s | j | jffS )N)� __class__r\ )r r r r �
__reduce__� s ztzwin.__reduce__N)r( r) r* r ri rk r r r r r � s &c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
r c
C sn t jd t j���}t j|t��}t|�}W d Q R X |d | _|d | _yBtd�j t
| jd�}t j||��}t|�}|d | _ W d Q R X W n t k
r� d | _ Y nX W d Q R X |d |d }||d }t
j|d �| _t
j|d �| _tjd
|d �} | d d
� \| _| _| _| _| d | _tjd
|d �} | d d
� \| _| _| _| _| d | _ | j| j | _ | j � | _ d S )NZ StandardNameZ DaylightNamez {kn}\{sn})rS ZsnrU ZBiasZ StandardBiasZ DaylightBias)rW z=8hZ
StandardStartr � r
Z
DaylightStart) r r r r
�TZLOCALKEYNAMEr^ r: r; r r] r rF �OSErrorra rb r0 r1 r_ r` rK r4 r6 r8 r2 rJ r5 r7 r9 r3 rP rO rH )
r r Z
tzlocalkeyrd rc r@ Z_keydictrf rg re r r r r � s2
ztzwinlocal.__init__c C s dS )Nz tzwinlocal()r )r r r r ri s ztzwinlocal.__repr__c C s dt | j� S )Nztzwinlocal(%s))rh r: )r r r r �__str__ s ztzwinlocal.__str__c C s
| j f fS )N)rj )r r r r rk # s ztzwinlocal.__reduce__N)r( r) r* r ri ro rk r r r r r � s .c C sT t j | |d||�}|j||j� d d d�}||d t }|j|krP|t8 }|S )z> dayofweek == 0 means Sunday, whichweek 5 means last instance r r
)Zday)ra �replaceZ
isoweekday�ONEWEEK�month) rM rr Z dayofweekZhourZminuteZ whichweek�firstZ
weekdayoneZwdr r r rI ' s
rI c C s� i }t j| �d }d}x�t|�D ]v}t j| |�\}}}|t jksJ|t jkr\|d@ r�|d }n2|t jkr�|jd�r�|pxt� }|j |�}|j
d�}|||< q W |S ) z0Convert a registry key's values to a dictionary.r N� � z@tzres� l l ) r rC rB Z EnumValueZ REG_DWORDZREG_DWORD_LITTLE_ENDIANZREG_SZr# r r' �rstrip)�keyZdout�sizeZtz_resr? Zkey_name�valueZdtyper r r r^ 5 s
r^ )ra r_ Z six.movesr Zsixr r r r& � ImportErrorZ_commonr �__all__rb rq r r rm r r �objectr r, r r rI r^ r r r r �<module> s,
LJ/: dateutil/tz/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000462 14751155147 0016364 0 ustar 00 3
6�cY� �
@ s* d dl T dddddddd d
d d d
dg
ZdS )� )�*ZtzutcZtzoffsetZtzlocalZtzfileZtzrangeZtzstrZtzicalZtzwinZ
tzwinlocalZgettzZenfoldZdatetime_ambiguousZdatetime_existsN)Ztz�__all__� r r � /usr/lib/python3.6/__init__.py�<module> s
dateutil/tz/__pycache__/tz.cpython-36.pyc 0000644 00000105541 14751155147 0014327 0 ustar 00 3
6�cY�� � @ s� d Z ddlZddlZddlZddlZddlZddlZddlmZ ddl m
Z
m Z m Z ddl m
Z
mZ ddl mZ yddlmZmZ W n ek
r� d ZZY nX ejd�Zejjd�Zej� ZG d d
� d
ej�ZG d d � d ej�Z G d
d� de �Z G dd� de �Z G dd� de �Z G dd� de �Z!G dd� de
�Z"G dd� de"�Z#G dd� de �Z$G dd � d e �Z%G d d � d e �Z&ej'd k�r�d d!gZ(d"d#d$d%gZ)ng Z(g Z)d0d&d'�Z*d1d(d)�Z+d2d*d+�Z,d,d-� Z-G d.d/� d/e �Z.dS )3a{
This module offers timezone implementations subclassing the abstract
:py:`datetime.tzinfo` type. There are classes to handle tzfile format files
(usually are in :file:`/etc/localtime`, :file:`/usr/share/zoneinfo`, etc), TZ
environment string (in all known formats), given ranges (with help from
relative deltas), local machine timezone, fixed offset timezone, and UTC
timezone.
� N)� string_types� )�tzname_in_python2�_tzinfo�_total_seconds)� tzrangebase�enfold)�_validate_fromutc_inputs)�tzwin�
tzwinlocalc @ sb e Zd ZdZdd� Zdd� Zedd� �Zdd � Ze d
d � �Z
d d
� Z dZ dd� Z
dd� ZejZdS )�tzutczD
This is a tzinfo object that represents the UTC time zone.
c C s t S )N)�ZERO)�self�dt� r �/usr/lib/python3.6/tz.py� utcoffset$ s ztzutc.utcoffsetc C s t S )N)r
)r r r r r �dst' s z tzutc.dstc C s dS )N�UTCr )r r r r r �tzname* s z tzutc.tznamec C s dS )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
Fr )r r r r r � is_ambiguous. s ztzutc.is_ambiguousc C s |S )z�
Fast track version of fromutc() returns the original ``dt`` object for
any valid :py:class:`datetime.datetime` object.
r )r r r r r �fromutc> s z
tzutc.fromutcc C s0 t |ttf�stS t |t�p.t |t�o.|jtkS )N)�
isinstancer �tzoffset�NotImplemented�_offsetr
)r �otherr r r �__eq__F s
z tzutc.__eq__Nc C s
| |k S )Nr )r r r r r �__ne__O s z tzutc.__ne__c C s d| j j S )Nz%s())� __class__�__name__)r r r r �__repr__R s ztzutc.__repr__)r �
__module__� __qualname__�__doc__r r r r r r r r �__hash__r r! �object�
__reduce__r r r r r s r c @ sj e Zd ZdZdd� Zdd� Zdd� Zedd � �Ze d
d � �Z
d d
� Z dd� Z dZ
dd� Zdd� ZejZdS )r a1
A simple class for representing a fixed offset from UTC.
:param name:
The timezone name, to be returned when ``tzname()`` is called.
:param offset:
The time zone offset in seconds, or (since version 2.6.0, represented
as a :py:class:`datetime.timedelta` object.
c C s> || _ y t|�}W n ttfk
r* Y nX tj|d�| _d S )N)�seconds)�_namer � TypeError�AttributeError�datetime� timedeltar )r �name�offsetr r r �__init__c s ztzoffset.__init__c C s | j S )N)r )r r r r r r m s ztzoffset.utcoffsetc C s t S )N)r
)r r r r r r p s z tzoffset.dstc C s | j S )N)r) )r r r r r r s s ztzoffset.tznamec C s
|| j S )N)r )r r r r r r w s ztzoffset.fromutcc C s dS )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
Fr )r r r r r r { s ztzoffset.is_ambiguousc C s t |t�stS | j|jkS )N)r r r r )r r r r r r � s
ztzoffset.__eq__Nc C s
| |k S )Nr )r r r r r r � s ztzoffset.__ne__c C s" d| j jt| j�tt| j��f S )Nz
%s(%s, %s))r r �reprr) �intr r )r r r r r! � s ztzoffset.__repr__)r r" r# r$ r0 r r r r r r r r r% r r! r& r' r r r r r X s
r c sx e Zd ZdZ� fdd�Zdd� Zdd� Zedd � �Zd
d � Z d d
� Z
ddd�Z dd� Z dZ
dd� Zdd� ZejZ� ZS )�tzlocalzR
A :class:`tzinfo` subclass built around the ``time`` timezone functions.
c s` t t| �j� tjtj d�| _tjr:tjtj d�| _
n| j| _
| j
| j | _ t | j �| _
d S )N)r( )�superr3 r0 r, r- �time�timezone� _std_offsetZdaylightZaltzone� _dst_offset�
_dst_saved�bool�_hasdst)r )r r r r0 � s ztzlocal.__init__c C s, |d kr| j rd S | j|�r"| jS | jS d S )N)r; �_isdstr8 r7 )r r r r r r � s
ztzlocal.utcoffsetc C s0 |d kr| j rd S | j|�r(| j| j S tS d S )N)r; r< r8 r7 r
)r r r r r r � s
z tzlocal.dstc C s t j| j|� S )N)r5 r r< )r r r r r r � s ztzlocal.tznamec C s$ | j |�}| o"|| j || j �kS )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
)�
_naive_is_dstr9 )r r Z naive_dstr r r r � s
ztzlocal.is_ambiguousc C s t |�}tj|tj �jS )N)�_datetime_to_timestampr5 � localtimer6 Ztm_isdst)r r � timestampr r r r= � s ztzlocal._naive_is_dstTc C sF | j s
dS | j|�}t|dd �}| j|�rB|d k r>| j|� S dS |S )NF�foldT)r; r= �getattrr �_fold)r r Z
fold_naiveZdstvalrA r r r r< � s
ztzlocal._isdstc C s& t |t�stS | j|jko$| j|jkS )N)r r3 r r7 r8 )r r r r r r s
ztzlocal.__eq__Nc C s
| |k S )Nr )r r r r r r s ztzlocal.__ne__c C s d| j j S )Nz%s())r r )r r r r r! s ztzlocal.__repr__)T)r r" r# r$ r0 r r r r r r= r< r r% r r! r& r' �
__classcell__r r )r r r3 � s
(r3 c @ sR e Zd ZdddddddgZdd � Zd
d � Zd d
� ZdZdd� Zdd� Z dd� Z
dS )�_ttinfor/ �delta�isdst�abbr�isstd�isgmt� dstoffsetc C s x| j D ]}t| |d � qW d S )N)� __slots__�setattr)r �attrr r r r0 s z_ttinfo.__init__c C sR g }x6| j D ],}t| |�}|d k r |jd|t|�f � q W d| jjdj|�f S )Nz%s=%sz%s(%s)z, )rL rB �appendr1 r r �join)r �lrN �valuer r r r! s
z_ttinfo.__repr__c C sb t |t�stS | j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j |j kS )N)
r rE r r/ rF rG rH rI rJ rK )r r r r r r $ s
z_ttinfo.__eq__Nc C s
| |k S )Nr )r r r r r r 2 s z_ttinfo.__ne__c C s( i }x | j D ]}t| |d �||< q W |S )N)rL rB )r �stater. r r r � __getstate__5 s z_ttinfo.__getstate__c C s, x&| j D ] }||krt| ||| � qW d S )N)rL rM )r rS r. r r r � __setstate__; s z_ttinfo.__setstate__) r r" r# rL r0 r! r r% r rT rU r r r r rE s
rE c @ s, e Zd ZdZdddddddd gZd
d � Zd S )
�_tzfilezw
Lightweight class for holding the relevant transition and time zone
information read from binary tzfiles.
�
trans_list�trans_list_utc� trans_idx� ttinfo_list�
ttinfo_std�
ttinfo_dst�
ttinfo_before� ttinfo_firstc K s( x"| j D ]}t| ||j|d �� qW d S )N)�attrsrM �get)r �kwargsrN r r r r0 I s z_tzfile.__init__N)r r" r# r$ r_ r0 r r r r rV A s rV c s� e Zd ZdZd&� fdd� Zdd� Zdd� Zd'd
d �Zd d
� Zdd� Z dd� Z
d(dd�Z dd� Z dd� Z
dd� Zedd� �Zd d � ZdZd d � Zd d!� Zd"d#� Zd$d%� Z� ZS ))�tzfilea�
This is a ``tzinfo`` subclass thant allows one to use the ``tzfile(5)``
format timezone files to extract current and historical zone information.
:param fileobj:
This can be an opened file stream or a file name that the time zone
information can be read from.
:param filename:
This is an optional parameter specifying the source of the time zone
information in the event that ``fileobj`` is a file object. If omitted
and ``fileobj`` is a file stream, this parameter will be set either to
``fileobj``'s ``name`` attribute or to ``repr(fileobj)``.
See `Sources for Time Zone and Daylight Saving Time Data
<http://www.twinsun.com/tz/tz-link.htm>`_ for more information. Time zone
files can be compiled from the `IANA Time Zone database files
<https://www.iana.org/time-zones>`_ with the `zic time zone compiler
<https://www.freebsd.org/cgi/man.cgi?query=zic&sektion=8>`_
Nc s� t t| �j� d}t|t�r2|| _t|d�}d}n.|d k rB|| _n t|d�rV|j| _n
t |�| _|d k r�|stt
|�}|�}| j |�}W d Q R X | j |� d S )NF�rbTr. )
r4 rb r0 r r � _filename�open�hasattrr. r1 �_ContextWrapper� _read_tzfile� _set_tzdata)r �fileobj�filenameZfile_opened_hereZ file_stream�tzobj)r r r r0 d s"
ztzfile.__init__c C s* x$t jD ]}t| d| t||�� qW dS )z= Set the time zone data of this object from a _tzfile object �_N)rV r_ rM rB )r rl rN r r r ri | s ztzfile._set_tzdatac s� t � � |jd�j� dkr td��|jd� tjd|jd��\}}}}}}|rnttjd| |j|d ���� _ng � _|r�tjd| |j|��� _ng � _g }x(t |�D ] } |j
tjd |jd
��� q�W |j|�j� }
|r�|j |d t j
� |�rtjd | |j|��} |�r"tjd | |j|��} g � _x�t |�D ]�} || \}
}}d
|
d d
}
t� }|
|_tjd�|_tj|
d�|_||_|
||
jd|�� |_|| k�o�| | dk|_|| k�o�| | dk|_� jj
|� �q2W � fdd�� jD �� _d � _d � _d � _ � j�r؈ j�s$� jd � _� _ n�x�t |d dd�D ]V} � j| }� j �r`|j �r`|� _n� j �rx|j�rx|� _� j�r6� j�r6P �q6W � j�r�� j �r�� j� _x,� jD ]}|j�s�|� _ P �q�W � jd � _ d }g � _ xlt � j�D ]^\} }|j�s
|j}|}n*|d k �r*|j| |_|� j| < |�p2d}� j j
� j| | � �q�W d }x~t t t!� j���D ]h} � j| }|j�r�|j�p�|d k�s�|j| |_n|j}t"|jtj��s�tj|jd�|_|� j| < �qhW t#� j�� _t#� j �� _ t#� j�� _� S )N� ZTZifzmagic not found� z>6l� z>%dlz>%dBz>lbb� � z>%db�< � r )r( � c s g | ]}� j | �qS r )rZ )�.0�idx)�outr r �
<listcomp> s z'tzfile._read_tzfile.<locals>.<listcomp>r ���rz )$rV �read�decode�
ValueError�struct�unpack�listrX rY �rangerO �seek�os�SEEK_CURrZ rE r/ r, r- rK rF rG �findrH rI rJ r[ r\ r] r^ rW � enumerate�reversed�lenr �tuple)r rj Z
ttisgmtcntZ
ttisstdcntZleapcntZtimecntZtypecntZcharcntZttinfo�irH rI rJ ZgmtoffrG Zabbrind�ttiZ
laststdoffsetr/ r )rx r rh � s�
ztzfile._read_tzfileFc C s6 | j s
d S t|�}|r | jn| j }tj||�}|d S )Nr )� _trans_listr> Z_trans_list_utc�bisectZ bisect_right)r r �in_utcr@ rW rw r r r �_find_last_transition^ s z tzfile._find_last_transitionc C s8 |d ks|d t | j�kr | jS |dk r.| jS | j| S )Nr r )r� r� � _ttinfo_stdZ_ttinfo_before�
_trans_idx)r rw r r r � _get_ttinfom s
ztzfile._get_ttinfoc C s | j |�}| j|�S )N)�_resolve_ambiguous_timer� )r r rw r r r � _find_ttinfox s
ztzfile._find_ttinfoc C sn t |tj�std��|j| k r&td��| j|dd�}| j|�}|tj|jd� }| j ||d�}t
|t |�d�S )a
The ``tzfile`` implementation of :py:func:`datetime.tzinfo.fromutc`.
:param dt:
A :py:class:`datetime.datetime` object.
:raises TypeError:
Raised if ``dt`` is not a :py:class:`datetime.datetime` object.
:raises ValueError:
Raised if this is called with a ``dt`` which does not have this
``tzinfo`` attached.
:return:
Returns a :py:class:`datetime.datetime` object representing the
wall time in ``self``'s time zone.
z&fromutc() requires a datetime argumentzdt.tzinfo is not selfT)r� )r( )rw )rA ) r r, r* �tzinfor} r� r� r- r/ r r r2 )r r rw r� Zdt_outrA r r r r } s
ztzfile.fromutcc C sd |dkr| j |�}t|�}| j|�}|dks4|dkr8dS | j|d �j|j }| j| }||| k S )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
Nr Fr )r� r> r� r/ r� )r r rw r@ r� ZodZttr r r r � s
ztzfile.is_ambiguousc C sF | j |�}| j|�}|d ks$|dkr(|S t| o:| j||��}|| S )Nr )r� rC r2 r )r r rw rC Z
idx_offsetr r r r� � s
z tzfile._resolve_ambiguous_timec C s" |d kr d S | j stS | j|�jS )N)r� r
r� rF )r r r r r r � s
ztzfile.utcoffsetc C s0 |d kr d S | j stS | j|�}|js*tS |jS )N)Z _ttinfo_dstr
r� rG rK )r r r� r r r r � s
z
tzfile.dstc C s | j s|d krd S | j|�jS )N)r� r� rH )r r r r r r � s z
tzfile.tznamec C s2 t |t�stS | j|jko0| j|jko0| j|jkS )N)r rb r r� r� Z _ttinfo_list)r r r r r r � s
z
tzfile.__eq__c C s
| |k S )Nr )r r r r r r � s z
tzfile.__ne__c C s d| j jt| j�f S )Nz%s(%s))r r r1 rd )r r r r r! � s ztzfile.__repr__c C s
| j d �S )N)�
__reduce_ex__)r r r r r' � s ztzfile.__reduce__c C s | j d | jf| jfS )N)r rd �__dict__)r Zprotocolr r r r� � s ztzfile.__reduce_ex__)N)F)N)r r" r# r$ r0 ri rh r� r� r� r r r� r r r r r r% r r! r' r� rD r r )r r rb N s( ]
$
rb c @ s6 e Zd ZdZd dd�Zdd� Zdd� Zed d
� �ZdS ) �tzrangeaQ
The ``tzrange`` object is a time zone specified by a set of offsets and
abbreviations, equivalent to the way the ``TZ`` variable can be specified
in POSIX-like systems, but using Python delta objects to specify DST
start, end and offsets.
:param stdabbr:
The abbreviation for standard time (e.g. ``'EST'``).
:param stdoffset:
An integer or :class:`datetime.timedelta` object or equivalent
specifying the base offset from UTC.
If unspecified, +00:00 is used.
:param dstabbr:
The abbreviation for DST / "Summer" time (e.g. ``'EDT'``).
If specified, with no other DST information, DST is assumed to occur
and the default behavior or ``dstoffset``, ``start`` and ``end`` is
used. If unspecified and no other DST information is specified, it
is assumed that this zone has no DST.
If this is unspecified and other DST information is *is* specified,
DST occurs in the zone but the time zone abbreviation is left
unchanged.
:param dstoffset:
A an integer or :class:`datetime.timedelta` object or equivalent
specifying the UTC offset during DST. If unspecified and any other DST
information is specified, it is assumed to be the STD offset +1 hour.
:param start:
A :class:`relativedelta.relativedelta` object or equivalent specifying
the time and time of year that daylight savings time starts. To specify,
for example, that DST starts at 2AM on the 2nd Sunday in March, pass:
``relativedelta(hours=2, month=3, day=1, weekday=SU(+2))``
If unspecified and any other DST information is specified, the default
value is 2 AM on the first Sunday in April.
:param end:
A :class:`relativedelta.relativedelta` object or equivalent representing
the time and time of year that daylight savings time ends, with the
same specification method as in ``start``. One note is that this should
point to the first time in the *standard* zone, so if a transition
occurs at 2AM in the DST zone and the clocks are set back 1 hour to 1AM,
set the `hours` parameter to +1.
**Examples:**
.. testsetup:: tzrange
from dateutil.tz import tzrange, tzstr
.. doctest:: tzrange
>>> tzstr('EST5EDT') == tzrange("EST", -18000, "EDT")
True
>>> from dateutil.relativedelta import *
>>> range1 = tzrange("EST", -18000, "EDT")
>>> range2 = tzrange("EST", -18000, "EDT", -14400,
... relativedelta(hours=+2, month=4, day=1,
... weekday=SU(+1)),
... relativedelta(hours=+1, month=10, day=31,
... weekday=SU(-1)))
>>> tzstr('EST5EDT') == range1 == range2
True
Nc C s@ ddl ma || _|| _y t|�}W n ttfk
r< Y nX y t|�}W n ttfk
rb Y nX |d k r|tj|d�| _ nt
| _ |d k r�tj|d�| _ n(|r�|d k r�| j tjd d� | _ nt
| _ |r�|d kr�tjd ddtj d
�d�| _
n|| _
|�r |d k�r tjdd d
tj d�d�| _n|| _| j | j | _t| j
�| _d S )Nr )�
relativedelta)r( r )�hours� rn )r� �month�day�weekday�
� r r� r r rz )�dateutilr� � _std_abbr� _dst_abbrr r* r+ r, r- r7 r
r8 �SU� _start_delta�
_end_delta�_dst_base_offset_r: �hasdst)r �stdabbr� stdoffset�dstabbrrK �start�endr r r r0 J s: ztzrange.__init__c C s4 | j s
dS tj|dd�}|| j }|| j }||fS )a�
For a given year, get the DST on and off transition times, expressed
always on the standard time side. For zones with no transitions, this
function returns ``None``.
:param year:
The year whose transitions you would like to query.
:return:
Returns a :class:`tuple` of :class:`datetime.datetime` objects,
``(dston, dstoff)`` for zones with an annual DST transition, or
``None`` for fixed offset zones.
Nr )r� r, r� r� )r ZyearZ base_yearr� r� r r r � transitionsy s
ztzrange.transitionsc C sV t |t�stS | j|jkoT| j|jkoT| j|jkoT| j|jkoT| j|jkoT| j|jkS )N) r r� r r� r� r7 r8 r� r� )r r r r r r � s
ztzrange.__eq__c C s | j S )N)r� )r r r r �_dst_base_offset� s ztzrange._dst_base_offset)NNNNN) r r" r# r$ r0 r� r �propertyr� r r r r r� s I
- r� c @ s, e Zd ZdZd dd�Zd dd�Zdd � Zd
S )
�tzstra
``tzstr`` objects are time zone objects specified by a time-zone string as
it would be passed to a ``TZ`` variable on POSIX-style systems (see
the `GNU C Library: TZ Variable`_ for more details).
There is one notable exception, which is that POSIX-style time zones use an
inverted offset format, so normally ``GMT+3`` would be parsed as an offset
3 hours *behind* GMT. The ``tzstr`` time zone object will parse this as an
offset 3 hours *ahead* of GMT. If you would like to maintain the POSIX
behavior, pass a ``True`` value to ``posix_offset``.
The :class:`tzrange` object provides the same functionality, but is
specified using :class:`relativedelta.relativedelta` objects. rather than
strings.
:param s:
A time zone string in ``TZ`` variable format. This can be a
:class:`bytes` (2.x: :class:`str`), :class:`str` (2.x: :class:`unicode`)
or a stream emitting unicode characters (e.g. :class:`StringIO`).
:param posix_offset:
Optional. If set to ``True``, interpret strings such as ``GMT+3`` or
``UTC+3`` as being 3 hours *behind* UTC rather than ahead, per the
POSIX standard.
.. _`GNU C Library: TZ Variable`:
https://www.gnu.org/software/libc/manual/html_node/TZ-Variable.html
Fc C s� ddl ma || _tj|�}|d kr,td��|jd
krJ| rJ| jd 9 _tj| |j|j|j |j
ddd� |j s~d | _ d | _ n&| j
|j�| _ | j r�| j
|jdd �| _ t| j �| _d S ) Nr )�parserzunknown string format�GMTr r F)r� r� )�isend)r� r rz )r� r� �_sZ_parsetzr} r� r� r� r0 r� rK r� r� �_deltar� r� r: r� )r �sZ posix_offset�resr r r r0 � s"
ztzstr.__init__r c C s< ddl m} i }|jd k rr|j|d< |jd k r`|j|j|j�|d< |jdkrVd|d< qpd|d< q�|jr�|j|d< n*|jd k r�|j|d< n|jd k r�|j|d < |s�|s�d
|d< d|d< |jd�|d< n d |d< d|d< |jd�|d< |j d k � r�|j |d < nd
|d < |�r0| j
| j }|d |j |j
d 8 < |jf |�S )Nr )r� r� r� r r� r� ZyeardayZ nlyeardayrn r� r( i i�Q r rz )r� r� r� r� Zweekr� ZydayZjydayr� r5 r8 r7 r( Zdays)r �xr� r� ra rF r r r r� � s<
z tzstr._deltac C s d| j jt| j�f S )Nz%s(%s))r r r1 r� )r r r r r! s ztzstr.__repr__N)F)r )r r" r# r$ r0 r� r! r r r r r� � s
)r� c @ s e Zd Zddd�ZdS )�_tzicalvtzcompNc C s@ t j|d�| _t j|d�| _| j| j | _|| _|| _|| _d S )N)r( )r, r- � tzoffsetfrom�
tzoffsetto� tzoffsetdiffrG r �rrule)r r� r� rG r r� r r r r0 s z_tzicalvtzcomp.__init__)NN)r r" r# r0 r r r r r� s r� c sZ e Zd Zg f� fdd� Zdd� Zdd� Zdd� Zd d
� Zed d � �Z d
d� Z
e j Z � Z
S )�
_tzicalvtzc s* t t| �j� || _|| _g | _g | _d S )N)r4 r� r0 �_tzid�_comps�
_cachedate�
_cachecomp)r �tzid�comps)r r r r0 s
z_tzicalvtz.__init__c
C s
t | j�dkr| jd S |jd d�}y | j| jj|| j|�f� S tk
rT Y nX d }d }x4| jD ]*}| j||�}|rf| s�||k rf|}|}qfW |s�x"| jD ]}|j s�|}P q�W |d }| jj
d|| j|�f� | jj
d|� t | j�dk�r| jj � | jj � |S )Nr r )r� r� ) r� r� �replacer� r� �indexrC r} � _find_compdtrG �insert�pop)r r Z
lastcompdtZlastcomp�comp�compdtr r r �
_find_comp s4
z_tzicalvtz._find_compc C s2 |j tk r | j|�r ||j 8 }|jj|dd�}|S )NT)Zinc)r� r
rC r� Zbefore)r r� r r� r r r r� I s
z_tzicalvtz._find_compdtc C s |d kr d S | j |�jS )N)r� r� )r r r r r r Q s z_tzicalvtz.utcoffsetc C s | j |�}|jr|jS tS d S )N)r� rG r� r
)r r r� r r r r W s
z_tzicalvtz.dstc C s | j |�jS )N)r� r )r r r r r r ^ s z_tzicalvtz.tznamec C s dt | j� S )Nz<tzicalvtz %s>)r1 r� )r r r r r! b s z_tzicalvtz.__repr__)r r" r# r0 r� r� r r r r r! r& r' rD r r )r r r� s * r� c @ sB e Zd ZdZdd� Zdd� Zddd�Zd d
� Zd d � Zd
d� Z dS )�tzicala\
This object is designed to parse an iCalendar-style ``VTIMEZONE`` structure
as set out in `RFC 2445`_ Section 4.6.5 into one or more `tzinfo` objects.
:param `fileobj`:
A file or stream in iCalendar format, which should be UTF-8 encoded
with CRLF endings.
.. _`RFC 2445`: https://www.ietf.org/rfc/rfc2445.txt
c C sj ddl ma t|t�r(|| _t|d�}nt|dt|��| _t|�}i | _ |�}| j
|j � � W d Q R X d S )Nr )r� �rr. ) r� r� r r r� re rB r1 rg �_vtz�
_parse_rfcr{ )r rj Zfobjr r r r0 s s
ztzical.__init__c C s t | jj� �S )z?
Retrieves the available time zones as a list.
)r� r� �keys)r r r r r� � s z tzical.keysNc C sP |dkrDt | j�dkr td��nt | j�dkr6td��tt| j��}| jj|�S )a�
Retrieve a :py:class:`datetime.tzinfo` object by its ``tzid``.
:param tzid:
If there is exactly one time zone available, omitting ``tzid``
or passing :py:const:`None` value returns it. Otherwise a valid
key (which can be retrieved from :func:`keys`) is required.
:raises ValueError:
Raised if ``tzid`` is not specified but there are either more
or fewer than 1 zone defined.
:returns:
Returns either a :py:class:`datetime.tzinfo` object representing
the relevant time zone or :py:const:`None` if the ``tzid`` was
not found.
Nr zno timezones definedr z more than one timezone available)r� r� r} �next�iterr` )r r� r r r r` � s
z
tzical.getc C s� |j � }|std��|d d kr>d|d dk }|dd � }nd}t|�dkrzt|d d� �d t|dd � �d | S t|�d
kr�t|d d� �d t|dd� �d t|dd � � | S td | ��d S )Nz empty offsetr �+�-r rn r� i rs rq zinvalid offset: )r� r� rz r )rz r r )�stripr} r� r2 )r r� �signalr r r �
_parse_offset� s , <ztzical._parse_offsetc C sH |j � }|std��d}xh|t|�k r�|| j� }|s>||= q|dkrv|d dkrv||d |dd � 7 < ||= q|d7 }qW d }g }d}d }�x�|D �]�}|s�q�|jdd�\} }
| jd�} | s�td��| d j� } | dd � } |�r$| d k�r(|
d)k�r n td |
��|
}d} d }
d }g }d }�q@| d
k�r|
dk�r�|�rNtd| ��|�s\td��|�sjtd��t||�| j|< d}n�|
|k�r| �s�td��|
d k�r�td��|d k�r�td��d }|�r�tj dj
|�dddd�}t |
||d k||�}|j |� d }n td|
���q@|�r�| dk�r2|j |� d} n�| d*k�rH|j |� n�| d k�rx| �rltd | | d f ��| j
|
�}
nj| d k�r�| �r�td | d ��| j
|
�}n>| d!k�r�| �r�td"| d ��|
}n| d#k�r�n td$| ��n>| d%k�r
| �rtd&| d ��|
}n| d+k�rn td$| ��q�| d kr�|
dkr�d }g }d}q�W d S ),Nz empty stringr � r F�:�;zempty property nameZBEGIN�STANDARD�DAYLIGHTzunknown component: ZENDZ VTIMEZONEzcomponent not closed: zmandatory TZID not foundz at least one component is neededzmandatory DTSTART not foundz mandatory TZOFFSETFROM not found�
T)Z
compatibleZignoretz�cachezinvalid component end: ZDTSTART�RRULE�RDATE�EXRULE�EXDATEZ TZOFFSETFROMzunsupported %s parm: %s Z
TZOFFSETTOz unsupported TZOFFSETTO parm: ZTZNAMEzunsupported TZNAME parm: �COMMENTzunsupported property: ZTZIDzunsupported TZID parm: �TZURL�
LAST-MODIFIED)r� r� )r� r� r� r� )r� r� r� )�
splitlinesr} r� �rstrip�split�upperr� r� r� ZrrulestrrP r� rO r� )r r� �linesr� �liner� r� ZinvtzZcomptyper. rR ZparmsZ founddtstartr� r� Z
rrulelinesr Zrrr� r r r r� � s�
ztzical._parse_rfcc C s d| j jt| j�f S )Nz%s(%s))r r r1 r� )r r r r r! + s ztzical.__repr__)N)
r r" r# r$ r0 r� r` r� r� r! r r r r r� h s
vr� Zwin32z/etc/localtimer? z/usr/share/zoneinfoz/usr/lib/zoneinfoz/usr/share/lib/zoneinfoz
/etc/zoneinfoc C sD d }| s,yt jd } W n tk
r* Y nX | d ks<| dkr�x�tD ]v}t jj|�s�|}x*tD ] }t jj||�}t jj|�r\P q\W qBt jj|�rByt |�}P W qB t
t t fk
r� Y qBX qBW t
� }�nz| jd�r�| d d � } t jj| ��r
t jj| ��rt | �}nd }�n6�x2tD ]l}t jj|| �}t jj|��sP|jdd�}t jj|��sP�qyt |�}P W n t
t t fk
�rz Y nX �qW d }td k �r�y t| �}W n tk
�r� d }Y nX |�s�ddlm} |� j| �}|�s@xb| D ]6}|dk�r�y t| �}W n t k
�r Y nX P �q�W | d k�r.t� }n| tjk�r@t
� }|S )
NZTZr� r r� rm r )�get_zonefile_instance�
0123456789r� r rz )r� r )r� �environ�KeyError�TZFILES�path�isabs�TZPATHSrP �isfilerb �IOError�OSErrorr} r3 �
startswithr� r
Z WindowsErrorZdateutil.zoneinfor� r` r� r r5 r )r. �tz�filepathrk r� r� �cr r r �gettz: sz
r� c C sZ |dkr | j dkrtd��| j }| jdd�} | j|d�jt� �j|�}|jdd�}| |kS )a�
Given a datetime and a time zone, determine whether or not a given datetime
would fall in a gap.
:param dt:
A :class:`datetime.datetime` (whose time zone will be ignored if ``tz``
is provided.)
:param tz:
A :class:`datetime.tzinfo` with support for the ``fold`` attribute. If
``None`` or not provided, the datetime's own time zone will be used.
:return:
Returns a boolean value whether or not the "wall time" exists in ``tz``.
Nz,Datetime is naive and no time zone provided.)r� )r� r} r� Z
astimezoner )r r� Zdt_rtr r r �datetime_exists� s
r� c
C s� |dkr | j dkrtd��| j }t|dd�}|dk rLy
|j| �S Y nX | j|d�} t| dd�}t| dd�}|j� |j� k}|j� |j� k}|o�| S )a\
Given a datetime and a time zone, determine whether or not a given datetime
is ambiguous (i.e if there are two times differentiated only by their DST
status).
:param dt:
A :class:`datetime.datetime` (whose time zone will be ignored if ``tz``
is provided.)
:param tz:
A :class:`datetime.tzinfo` with support for the ``fold`` attribute. If
``None`` or not provided, the datetime's own time zone will be used.
:return:
Returns a boolean value whether or not the "wall time" is ambiguous in
``tz``.
.. versionadded:: 2.6.0
Nz,Datetime is naive and no time zone provided.r )r� r )rA r )r� r} rB r r� r r r )r r� Zis_ambiguous_fnZwall_0Zwall_1Z same_offsetZsame_dstr r r �datetime_ambiguous� s
r� c C s t | jdd�t �S )z�
Convert a :class:`datetime.datetime` object to an epoch timestamp in seconds
since January 1, 1970, ignoring the time zone.
N)r� )r r� �EPOCH)r r r r r> � s r> c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) rg z^
Class for wrapping contexts so that they are passed through in a
with statement.
c C s
|| _ d S )N)�context)r r r r r r0 � s z_ContextWrapper.__init__c C s | j S )N)r )r r r r � __enter__� s z_ContextWrapper.__enter__c O s d S )Nr )�argsra r r r �__exit__� s z_ContextWrapper.__exit__N)r r" r# r$ r0 r r r r r r rg � s rg )N)N)N)/r$ r, r~ r5 �sysr� r� Zsixr Z_commonr r r r r r �winr
r � ImportErrorr- r
Zutcfromtimestampr Z toordinalZ EPOCHORDINALr� r r r3 r& rE rV rb r� r� r� r� r� �platformr� r� r� r� r� r> rg r r r r �<module> s\
8Fv-
5 "j R H
J
. dateutil/tz/__pycache__/win.cpython-36.opt-1.pyc 0000644 00000022344 14751155147 0015425 0 ustar 00 3
6�cY�, � @ s� d dl Z d dlZd dlmZ d dlmZ yd dlZd dlmZ W n ek
r\ e d��Y nX ddl
m Z dd d
gZ e j
d �Zd Zd
ZdZdd� Ze� ZG dd
� d
e�ZG dd� de �ZG dd� de�ZG dd � d e�Zdd� Zdd� ZdS )� N)�winreg)� text_type)�wintypesz#Running tzwin on non-Windows system� )� tzrangebase�tzwin�
tzwinlocal�tzres� z7SOFTWARE\Microsoft\Windows NT\CurrentVersion\Time Zonesz4SOFTWARE\Microsoft\Windows\CurrentVersion\Time Zonesz4SYSTEM\CurrentControlSet\Control\TimeZoneInformationc C sL t jd t j�} yt j| t�j� t}W n tk
r> t}Y nX | j� |S )N)r �ConnectRegistry�HKEY_LOCAL_MACHINE�OpenKey� TZKEYNAMENTZCloseZ WindowsError� TZKEYNAME9X)�handle� TZKEYNAME� r �/usr/lib/python3.6/win.py�
_settzkeyname s
r c @ s6 e Zd ZdZejej�Zd
dd�Z dd� Z
dd� Z d S ) r z{
Class for accessing `tzres.dll`, which contains timezone name related
resources.
.. versionadded:: 2.5.0
� tzres.dllc C s@ t jd�}tjtjtjt jf|j_|j| _t j|�| _ || _
d S )N�user32) �ctypesZWinDLLr Z HINSTANCEZUINT�LPWSTRZc_int� LoadStringWZargtypes�_tzres� tzres_loc)�selfr r r r r �__init__1 s
ztzres.__init__c C s< | j � }tjtj|�tj�}| j| jj||d�}|d|� S )a�
Load a timezone name from a DLL offset (integer).
>>> from dateutil.tzwin import tzres
>>> tzr = tzres()
>>> print(tzr.load_name(112))
'Eastern Standard Time'
:param offset:
A positive integer value referring to a string from the tzres dll.
..note:
Offsets found in the registry are generally of the form
`@tzres.dll,-114`. The offset in this case if 114, not -114.
r N) �p_wcharr �castZbyrefr r r r Z_handle)r �offsetZresourceZlpBufferZncharr r r � load_name? s ztzres.load_namec C sH |j d�s|S |jd�}yt|d �}W n td��Y nX | j|�S )a�
Parse strings as returned from the Windows registry into the time zone
name as defined in the registry.
>>> from dateutil.tzwin import tzres
>>> tzr = tzres()
>>> print(tzr.name_from_string('@tzres.dll,-251'))
'Dateline Daylight Time'
>>> print(tzr.name_from_string('Eastern Standard Time'))
'Eastern Standard Time'
:param tzname_str:
A timezone name string as returned from a Windows registry key.
:return:
Returns the localized timezone string from tzres.dll if the string
is of the form `@tzres.dll,-offset`, else returns the input string.
�@z,-r zMalformed timezone string.)�
startswith�split�int�
ValueErrorr! )r Z
tzname_strZ name_spltr r r r �name_from_stringU s
ztzres.name_from_stringN)r ) �__name__�
__module__� __qualname__�__doc__r ZPOINTERr ZWCHARr r r! r' r r r r r ( s
c @ sP e Zd ZdZdd� Zdd� Zedd� �Zdd � Zd
d � Z d d
� Z
e dd� �Z dS )� tzwinbasezBtzinfo class based on win32's timezones available in the registry.c C s t d��d S )Nz#tzwinbase is an abstract base class)�NotImplementedError)r r r r r v s ztzwinbase.__init__c C s� t |t�stS | j|jko�| j|jko�| j|jko�| j|jko�| j|jko�| j|jko�| j |j ko�| j
|j
ko�| j |j ko�| j |j ko�| j
|j
ko�| j|jkS )N)�
isinstancer, �NotImplemented� _std_offset� _dst_offset�
_stddayofweek�
_dstdayofweek�_stdweeknumber�_dstweeknumber�_stdhour�_dsthour�
_stdminute�
_dstminute� _std_abbr� _dst_abbr)r �otherr r r �__eq__y s
ztzwinbase.__eq__c sV t jdt j��>} t j| t��&� � fdd�tt j� �d �D �}W dQ R X W dQ R X |S )z4Return a list of all time zones known to the system.Nc s g | ]}t j� |��qS r )r ZEnumKey)�.0�i)�tzkeyr r �
<listcomp>� s z"tzwinbase.list.<locals>.<listcomp>r )r r r r
r �range� QueryInfoKey)r �resultr )r@ r �list� s
*ztzwinbase.listc C s | j S )N)�_display)r r r r �display� s ztzwinbase.displayc C sT | j s
dS t|| j| j| j| j| j�}t|| j| j| j | j
| j �}|| j 8 }||fS )a�
For a given year, get the DST on and off transition times, expressed
always on the standard time side. For zones with no transitions, this
function returns ``None``.
:param year:
The year whose transitions you would like to query.
:return:
Returns a :class:`tuple` of :class:`datetime.datetime` objects,
``(dston, dstoff)`` for zones with an annual DST transition, or
``None`` for fixed offset zones.
N)
�hasdst�picknthweekday� _dstmonthr3 r7 r9 r5 � _stdmonthr2 r6 r8 r4 �_dst_base_offset)r �yearZdstonZdstoffr r r � transitions� s
ztzwinbase.transitionsc C s
| j dkS )Nr )rJ )r r r r � _get_hasdst� s ztzwinbase._get_hasdstc C s | j S )N)�_dst_base_offset_)r r r r rL � s ztzwinbase._dst_base_offsetN)
r( r) r* r+ r r= � staticmethodrE rG rN rO �propertyrL r r r r r, t s r, c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )r c C s || _ tjd tj��8}td�jt|d�}tj||��}t|�}W d Q R X W d Q R X |d | _ |d | _
|d | _ t j
d|d �}|d |d }||d
}tj|d �| _tj|d �| _|d d
� \| _| _| _| _| _|dd� \| _| _| _| _| _| j| j | _ | j � | _ d S )Nz {kn}\{name})�kn�nameZStdZDlt�Displayz=3l16hZTZIr r � )�minutes� � � � ) �_namer r r r �formatr r
� valuestodictr: r; rF �struct�unpack�datetime� timedeltar0 r1 rK r2 r4 r6 r8 rJ r3 r5 r7 r9 rP rO rH ) r rT r � tzkeynamer@ �keydict�tup� stdoffset� dstoffsetr r r r � s"
ztzwin.__init__c C s dt | j� S )Nz tzwin(%s))�reprr\ )r r r r �__repr__� s ztzwin.__repr__c C s | j | jffS )N)� __class__r\ )r r r r �
__reduce__� s ztzwin.__reduce__N)r( r) r* r ri rk r r r r r � s &c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
r c
C sn t jd t j���}t j|t��}t|�}W d Q R X |d | _|d | _yBtd�j t
| jd�}t j||��}t|�}|d | _ W d Q R X W n t k
r� d | _ Y nX W d Q R X |d |d }||d }t
j|d �| _t
j|d �| _tjd
|d �} | d d
� \| _| _| _| _| d | _tjd
|d �} | d d
� \| _| _| _| _| d | _ | j| j | _ | j � | _ d S )NZ StandardNameZ DaylightNamez {kn}\{sn})rS ZsnrU ZBiasZ StandardBiasZ DaylightBias)rW z=8hZ
StandardStartr � r
Z
DaylightStart) r r r r
�TZLOCALKEYNAMEr^ r: r; r r] r rF �OSErrorra rb r0 r1 r_ r` rK r4 r6 r8 r2 rJ r5 r7 r9 r3 rP rO rH )
r r Z
tzlocalkeyrd rc r@ Z_keydictrf rg re r r r r � s2
ztzwinlocal.__init__c C s dS )Nz tzwinlocal()r )r r r r ri s ztzwinlocal.__repr__c C s dt | j� S )Nztzwinlocal(%s))rh r: )r r r r �__str__ s ztzwinlocal.__str__c C s
| j f fS )N)rj )r r r r rk # s ztzwinlocal.__reduce__N)r( r) r* r ri ro rk r r r r r � s .c C sT t j | |d||�}|j||j� d d d�}||d t }|j|krP|t8 }|S )z> dayofweek == 0 means Sunday, whichweek 5 means last instance r r
)Zday)ra �replaceZ
isoweekday�ONEWEEK�month) rM rr Z dayofweekZhourZminuteZ whichweek�firstZ
weekdayoneZwdr r r rI ' s
rI c C s� i }t j| �d }d}x�t|�D ]v}t j| |�\}}}|t jksJ|t jkr\|d@ r�|d }n2|t jkr�|jd�r�|pxt� }|j |�}|j
d�}|||< q W |S ) z0Convert a registry key's values to a dictionary.r N� � z@tzres� l l ) r rC rB Z EnumValueZ REG_DWORDZREG_DWORD_LITTLE_ENDIANZREG_SZr# r r' �rstrip)�keyZdout�sizeZtz_resr? Zkey_name�valueZdtyper r r r^ 5 s
r^ )ra r_ Z six.movesr Zsixr r r r& � ImportErrorZ_commonr �__all__rb rq r r rm r r �objectr r, r r rI r^ r r r r �<module> s,
LJ/: dateutil/tz/__pycache__/tz.cpython-36.opt-1.pyc 0000644 00000105541 14751155147 0015266 0 ustar 00 3
6�cY�� � @ s� d Z ddlZddlZddlZddlZddlZddlZddlmZ ddl m
Z
m Z m Z ddl m
Z
mZ ddl mZ yddlmZmZ W n ek
r� d ZZY nX ejd�Zejjd�Zej� ZG d d
� d
ej�ZG d d � d ej�Z G d
d� de �Z G dd� de �Z G dd� de �Z G dd� de �Z!G dd� de
�Z"G dd� de"�Z#G dd� de �Z$G dd � d e �Z%G d d � d e �Z&ej'd k�r�d d!gZ(d"d#d$d%gZ)ng Z(g Z)d0d&d'�Z*d1d(d)�Z+d2d*d+�Z,d,d-� Z-G d.d/� d/e �Z.dS )3a{
This module offers timezone implementations subclassing the abstract
:py:`datetime.tzinfo` type. There are classes to handle tzfile format files
(usually are in :file:`/etc/localtime`, :file:`/usr/share/zoneinfo`, etc), TZ
environment string (in all known formats), given ranges (with help from
relative deltas), local machine timezone, fixed offset timezone, and UTC
timezone.
� N)� string_types� )�tzname_in_python2�_tzinfo�_total_seconds)� tzrangebase�enfold)�_validate_fromutc_inputs)�tzwin�
tzwinlocalc @ sb e Zd ZdZdd� Zdd� Zedd� �Zdd � Ze d
d � �Z
d d
� Z dZ dd� Z
dd� ZejZdS )�tzutczD
This is a tzinfo object that represents the UTC time zone.
c C s t S )N)�ZERO)�self�dt� r �/usr/lib/python3.6/tz.py� utcoffset$ s ztzutc.utcoffsetc C s t S )N)r
)r r r r r �dst' s z tzutc.dstc C s dS )N�UTCr )r r r r r �tzname* s z tzutc.tznamec C s dS )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
Fr )r r r r r � is_ambiguous. s ztzutc.is_ambiguousc C s |S )z�
Fast track version of fromutc() returns the original ``dt`` object for
any valid :py:class:`datetime.datetime` object.
r )r r r r r �fromutc> s z
tzutc.fromutcc C s0 t |ttf�stS t |t�p.t |t�o.|jtkS )N)�
isinstancer �tzoffset�NotImplemented�_offsetr
)r �otherr r r �__eq__F s
z tzutc.__eq__Nc C s
| |k S )Nr )r r r r r �__ne__O s z tzutc.__ne__c C s d| j j S )Nz%s())� __class__�__name__)r r r r �__repr__R s ztzutc.__repr__)r �
__module__� __qualname__�__doc__r r r r r r r r �__hash__r r! �object�
__reduce__r r r r r s r c @ sj e Zd ZdZdd� Zdd� Zdd� Zedd � �Ze d
d � �Z
d d
� Z dd� Z dZ
dd� Zdd� ZejZdS )r a1
A simple class for representing a fixed offset from UTC.
:param name:
The timezone name, to be returned when ``tzname()`` is called.
:param offset:
The time zone offset in seconds, or (since version 2.6.0, represented
as a :py:class:`datetime.timedelta` object.
c C s> || _ y t|�}W n ttfk
r* Y nX tj|d�| _d S )N)�seconds)�_namer � TypeError�AttributeError�datetime� timedeltar )r �name�offsetr r r �__init__c s ztzoffset.__init__c C s | j S )N)r )r r r r r r m s ztzoffset.utcoffsetc C s t S )N)r
)r r r r r r p s z tzoffset.dstc C s | j S )N)r) )r r r r r r s s ztzoffset.tznamec C s
|| j S )N)r )r r r r r r w s ztzoffset.fromutcc C s dS )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
Fr )r r r r r r { s ztzoffset.is_ambiguousc C s t |t�stS | j|jkS )N)r r r r )r r r r r r � s
ztzoffset.__eq__Nc C s
| |k S )Nr )r r r r r r � s ztzoffset.__ne__c C s" d| j jt| j�tt| j��f S )Nz
%s(%s, %s))r r �reprr) �intr r )r r r r r! � s ztzoffset.__repr__)r r" r# r$ r0 r r r r r r r r r% r r! r& r' r r r r r X s
r c sx e Zd ZdZ� fdd�Zdd� Zdd� Zedd � �Zd
d � Z d d
� Z
ddd�Z dd� Z dZ
dd� Zdd� ZejZ� ZS )�tzlocalzR
A :class:`tzinfo` subclass built around the ``time`` timezone functions.
c s` t t| �j� tjtj d�| _tjr:tjtj d�| _
n| j| _
| j
| j | _ t | j �| _
d S )N)r( )�superr3 r0 r, r- �time�timezone� _std_offsetZdaylightZaltzone� _dst_offset�
_dst_saved�bool�_hasdst)r )r r r r0 � s ztzlocal.__init__c C s, |d kr| j rd S | j|�r"| jS | jS d S )N)r; �_isdstr8 r7 )r r r r r r � s
ztzlocal.utcoffsetc C s0 |d kr| j rd S | j|�r(| j| j S tS d S )N)r; r< r8 r7 r
)r r r r r r � s
z tzlocal.dstc C s t j| j|� S )N)r5 r r< )r r r r r r � s ztzlocal.tznamec C s$ | j |�}| o"|| j || j �kS )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
)�
_naive_is_dstr9 )r r Z naive_dstr r r r � s
ztzlocal.is_ambiguousc C s t |�}tj|tj �jS )N)�_datetime_to_timestampr5 � localtimer6 Ztm_isdst)r r � timestampr r r r= � s ztzlocal._naive_is_dstTc C sF | j s
dS | j|�}t|dd �}| j|�rB|d k r>| j|� S dS |S )NF�foldT)r; r= �getattrr �_fold)r r Z
fold_naiveZdstvalrA r r r r< � s
ztzlocal._isdstc C s& t |t�stS | j|jko$| j|jkS )N)r r3 r r7 r8 )r r r r r r s
ztzlocal.__eq__Nc C s
| |k S )Nr )r r r r r r s ztzlocal.__ne__c C s d| j j S )Nz%s())r r )r r r r r! s ztzlocal.__repr__)T)r r" r# r$ r0 r r r r r r= r< r r% r r! r& r' �
__classcell__r r )r r r3 � s
(r3 c @ sR e Zd ZdddddddgZdd � Zd
d � Zd d
� ZdZdd� Zdd� Z dd� Z
dS )�_ttinfor/ �delta�isdst�abbr�isstd�isgmt� dstoffsetc C s x| j D ]}t| |d � qW d S )N)� __slots__�setattr)r �attrr r r r0 s z_ttinfo.__init__c C sR g }x6| j D ],}t| |�}|d k r |jd|t|�f � q W d| jjdj|�f S )Nz%s=%sz%s(%s)z, )rL rB �appendr1 r r �join)r �lrN �valuer r r r! s
z_ttinfo.__repr__c C sb t |t�stS | j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j|jko`| j |j kS )N)
r rE r r/ rF rG rH rI rJ rK )r r r r r r $ s
z_ttinfo.__eq__Nc C s
| |k S )Nr )r r r r r r 2 s z_ttinfo.__ne__c C s( i }x | j D ]}t| |d �||< q W |S )N)rL rB )r �stater. r r r � __getstate__5 s z_ttinfo.__getstate__c C s, x&| j D ] }||krt| ||| � qW d S )N)rL rM )r rS r. r r r � __setstate__; s z_ttinfo.__setstate__) r r" r# rL r0 r! r r% r rT rU r r r r rE s
rE c @ s, e Zd ZdZdddddddd gZd
d � Zd S )
�_tzfilezw
Lightweight class for holding the relevant transition and time zone
information read from binary tzfiles.
�
trans_list�trans_list_utc� trans_idx� ttinfo_list�
ttinfo_std�
ttinfo_dst�
ttinfo_before� ttinfo_firstc K s( x"| j D ]}t| ||j|d �� qW d S )N)�attrsrM �get)r �kwargsrN r r r r0 I s z_tzfile.__init__N)r r" r# r$ r_ r0 r r r r rV A s rV c s� e Zd ZdZd&� fdd� Zdd� Zdd� Zd'd
d �Zd d
� Zdd� Z dd� Z
d(dd�Z dd� Z dd� Z
dd� Zedd� �Zd d � ZdZd d � Zd d!� Zd"d#� Zd$d%� Z� ZS ))�tzfilea�
This is a ``tzinfo`` subclass thant allows one to use the ``tzfile(5)``
format timezone files to extract current and historical zone information.
:param fileobj:
This can be an opened file stream or a file name that the time zone
information can be read from.
:param filename:
This is an optional parameter specifying the source of the time zone
information in the event that ``fileobj`` is a file object. If omitted
and ``fileobj`` is a file stream, this parameter will be set either to
``fileobj``'s ``name`` attribute or to ``repr(fileobj)``.
See `Sources for Time Zone and Daylight Saving Time Data
<http://www.twinsun.com/tz/tz-link.htm>`_ for more information. Time zone
files can be compiled from the `IANA Time Zone database files
<https://www.iana.org/time-zones>`_ with the `zic time zone compiler
<https://www.freebsd.org/cgi/man.cgi?query=zic&sektion=8>`_
Nc s� t t| �j� d}t|t�r2|| _t|d�}d}n.|d k rB|| _n t|d�rV|j| _n
t |�| _|d k r�|stt
|�}|�}| j |�}W d Q R X | j |� d S )NF�rbTr. )
r4 rb r0 r r � _filename�open�hasattrr. r1 �_ContextWrapper� _read_tzfile� _set_tzdata)r �fileobj�filenameZfile_opened_hereZ file_stream�tzobj)r r r r0 d s"
ztzfile.__init__c C s* x$t jD ]}t| d| t||�� qW dS )z= Set the time zone data of this object from a _tzfile object �_N)rV r_ rM rB )r rl rN r r r ri | s ztzfile._set_tzdatac s� t � � |jd�j� dkr td��|jd� tjd|jd��\}}}}}}|rnttjd| |j|d ���� _ng � _|r�tjd| |j|��� _ng � _g }x(t |�D ] } |j
tjd |jd
��� q�W |j|�j� }
|r�|j |d t j
� |�rtjd | |j|��} |�r"tjd | |j|��} g � _x�t |�D ]�} || \}
}}d
|
d d
}
t� }|
|_tjd�|_tj|
d�|_||_|
||
jd|�� |_|| k�o�| | dk|_|| k�o�| | dk|_� jj
|� �q2W � fdd�� jD �� _d � _d � _d � _ � j�r؈ j�s$� jd � _� _ n�x�t |d dd�D ]V} � j| }� j �r`|j �r`|� _n� j �rx|j�rx|� _� j�r6� j�r6P �q6W � j�r�� j �r�� j� _x,� jD ]}|j�s�|� _ P �q�W � jd � _ d }g � _ xlt � j�D ]^\} }|j�s
|j}|}n*|d k �r*|j| |_|� j| < |�p2d}� j j
� j| | � �q�W d }x~t t t!� j���D ]h} � j| }|j�r�|j�p�|d k�s�|j| |_n|j}t"|jtj��s�tj|jd�|_|� j| < �qhW t#� j�� _t#� j �� _ t#� j�� _� S )N� ZTZifzmagic not found� z>6l� z>%dlz>%dBz>lbb� � z>%db�< � r )r( � c s g | ]}� j | �qS r )rZ )�.0�idx)�outr r �
<listcomp> s z'tzfile._read_tzfile.<locals>.<listcomp>r ���rz )$rV �read�decode�
ValueError�struct�unpack�listrX rY �rangerO �seek�os�SEEK_CURrZ rE r/ r, r- rK rF rG �findrH rI rJ r[ r\ r] r^ rW � enumerate�reversed�lenr �tuple)r rj Z
ttisgmtcntZ
ttisstdcntZleapcntZtimecntZtypecntZcharcntZttinfo�irH rI rJ ZgmtoffrG Zabbrind�ttiZ
laststdoffsetr/ r )rx r rh � s�
ztzfile._read_tzfileFc C s6 | j s
d S t|�}|r | jn| j }tj||�}|d S )Nr )� _trans_listr> Z_trans_list_utc�bisectZ bisect_right)r r �in_utcr@ rW rw r r r �_find_last_transition^ s z tzfile._find_last_transitionc C s8 |d ks|d t | j�kr | jS |dk r.| jS | j| S )Nr r )r� r� � _ttinfo_stdZ_ttinfo_before�
_trans_idx)r rw r r r � _get_ttinfom s
ztzfile._get_ttinfoc C s | j |�}| j|�S )N)�_resolve_ambiguous_timer� )r r rw r r r � _find_ttinfox s
ztzfile._find_ttinfoc C sn t |tj�std��|j| k r&td��| j|dd�}| j|�}|tj|jd� }| j ||d�}t
|t |�d�S )a
The ``tzfile`` implementation of :py:func:`datetime.tzinfo.fromutc`.
:param dt:
A :py:class:`datetime.datetime` object.
:raises TypeError:
Raised if ``dt`` is not a :py:class:`datetime.datetime` object.
:raises ValueError:
Raised if this is called with a ``dt`` which does not have this
``tzinfo`` attached.
:return:
Returns a :py:class:`datetime.datetime` object representing the
wall time in ``self``'s time zone.
z&fromutc() requires a datetime argumentzdt.tzinfo is not selfT)r� )r( )rw )rA ) r r, r* �tzinfor} r� r� r- r/ r r r2 )r r rw r� Zdt_outrA r r r r } s
ztzfile.fromutcc C sd |dkr| j |�}t|�}| j|�}|dks4|dkr8dS | j|d �j|j }| j| }||| k S )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
Nr Fr )r� r> r� r/ r� )r r rw r@ r� ZodZttr r r r � s
ztzfile.is_ambiguousc C sF | j |�}| j|�}|d ks$|dkr(|S t| o:| j||��}|| S )Nr )r� rC r2 r )r r rw rC Z
idx_offsetr r r r� � s
z tzfile._resolve_ambiguous_timec C s" |d kr d S | j stS | j|�jS )N)r� r
r� rF )r r r r r r � s
ztzfile.utcoffsetc C s0 |d kr d S | j stS | j|�}|js*tS |jS )N)Z _ttinfo_dstr
r� rG rK )r r r� r r r r � s
z
tzfile.dstc C s | j s|d krd S | j|�jS )N)r� r� rH )r r r r r r � s z
tzfile.tznamec C s2 t |t�stS | j|jko0| j|jko0| j|jkS )N)r rb r r� r� Z _ttinfo_list)r r r r r r � s
z
tzfile.__eq__c C s
| |k S )Nr )r r r r r r � s z
tzfile.__ne__c C s d| j jt| j�f S )Nz%s(%s))r r r1 rd )r r r r r! � s ztzfile.__repr__c C s
| j d �S )N)�
__reduce_ex__)r r r r r' � s ztzfile.__reduce__c C s | j d | jf| jfS )N)r rd �__dict__)r Zprotocolr r r r� � s ztzfile.__reduce_ex__)N)F)N)r r" r# r$ r0 ri rh r� r� r� r r r� r r r r r r% r r! r' r� rD r r )r r rb N s( ]
$
rb c @ s6 e Zd ZdZd dd�Zdd� Zdd� Zed d
� �ZdS ) �tzrangeaQ
The ``tzrange`` object is a time zone specified by a set of offsets and
abbreviations, equivalent to the way the ``TZ`` variable can be specified
in POSIX-like systems, but using Python delta objects to specify DST
start, end and offsets.
:param stdabbr:
The abbreviation for standard time (e.g. ``'EST'``).
:param stdoffset:
An integer or :class:`datetime.timedelta` object or equivalent
specifying the base offset from UTC.
If unspecified, +00:00 is used.
:param dstabbr:
The abbreviation for DST / "Summer" time (e.g. ``'EDT'``).
If specified, with no other DST information, DST is assumed to occur
and the default behavior or ``dstoffset``, ``start`` and ``end`` is
used. If unspecified and no other DST information is specified, it
is assumed that this zone has no DST.
If this is unspecified and other DST information is *is* specified,
DST occurs in the zone but the time zone abbreviation is left
unchanged.
:param dstoffset:
A an integer or :class:`datetime.timedelta` object or equivalent
specifying the UTC offset during DST. If unspecified and any other DST
information is specified, it is assumed to be the STD offset +1 hour.
:param start:
A :class:`relativedelta.relativedelta` object or equivalent specifying
the time and time of year that daylight savings time starts. To specify,
for example, that DST starts at 2AM on the 2nd Sunday in March, pass:
``relativedelta(hours=2, month=3, day=1, weekday=SU(+2))``
If unspecified and any other DST information is specified, the default
value is 2 AM on the first Sunday in April.
:param end:
A :class:`relativedelta.relativedelta` object or equivalent representing
the time and time of year that daylight savings time ends, with the
same specification method as in ``start``. One note is that this should
point to the first time in the *standard* zone, so if a transition
occurs at 2AM in the DST zone and the clocks are set back 1 hour to 1AM,
set the `hours` parameter to +1.
**Examples:**
.. testsetup:: tzrange
from dateutil.tz import tzrange, tzstr
.. doctest:: tzrange
>>> tzstr('EST5EDT') == tzrange("EST", -18000, "EDT")
True
>>> from dateutil.relativedelta import *
>>> range1 = tzrange("EST", -18000, "EDT")
>>> range2 = tzrange("EST", -18000, "EDT", -14400,
... relativedelta(hours=+2, month=4, day=1,
... weekday=SU(+1)),
... relativedelta(hours=+1, month=10, day=31,
... weekday=SU(-1)))
>>> tzstr('EST5EDT') == range1 == range2
True
Nc C s@ ddl ma || _|| _y t|�}W n ttfk
r< Y nX y t|�}W n ttfk
rb Y nX |d k r|tj|d�| _ nt
| _ |d k r�tj|d�| _ n(|r�|d k r�| j tjd d� | _ nt
| _ |r�|d kr�tjd ddtj d
�d�| _
n|| _
|�r |d k�r tjdd d
tj d�d�| _n|| _| j | j | _t| j
�| _d S )Nr )�
relativedelta)r( r )�hours� rn )r� �month�day�weekday�
� r r� r r rz )�dateutilr� � _std_abbr� _dst_abbrr r* r+ r, r- r7 r
r8 �SU� _start_delta�
_end_delta�_dst_base_offset_r: �hasdst)r �stdabbr� stdoffset�dstabbrrK �start�endr r r r0 J s: ztzrange.__init__c C s4 | j s
dS tj|dd�}|| j }|| j }||fS )a�
For a given year, get the DST on and off transition times, expressed
always on the standard time side. For zones with no transitions, this
function returns ``None``.
:param year:
The year whose transitions you would like to query.
:return:
Returns a :class:`tuple` of :class:`datetime.datetime` objects,
``(dston, dstoff)`` for zones with an annual DST transition, or
``None`` for fixed offset zones.
Nr )r� r, r� r� )r ZyearZ base_yearr� r� r r r � transitionsy s
ztzrange.transitionsc C sV t |t�stS | j|jkoT| j|jkoT| j|jkoT| j|jkoT| j|jkoT| j|jkS )N) r r� r r� r� r7 r8 r� r� )r r r r r r � s
ztzrange.__eq__c C s | j S )N)r� )r r r r �_dst_base_offset� s ztzrange._dst_base_offset)NNNNN) r r" r# r$ r0 r� r �propertyr� r r r r r� s I
- r� c @ s, e Zd ZdZd dd�Zd dd�Zdd � Zd
S )
�tzstra
``tzstr`` objects are time zone objects specified by a time-zone string as
it would be passed to a ``TZ`` variable on POSIX-style systems (see
the `GNU C Library: TZ Variable`_ for more details).
There is one notable exception, which is that POSIX-style time zones use an
inverted offset format, so normally ``GMT+3`` would be parsed as an offset
3 hours *behind* GMT. The ``tzstr`` time zone object will parse this as an
offset 3 hours *ahead* of GMT. If you would like to maintain the POSIX
behavior, pass a ``True`` value to ``posix_offset``.
The :class:`tzrange` object provides the same functionality, but is
specified using :class:`relativedelta.relativedelta` objects. rather than
strings.
:param s:
A time zone string in ``TZ`` variable format. This can be a
:class:`bytes` (2.x: :class:`str`), :class:`str` (2.x: :class:`unicode`)
or a stream emitting unicode characters (e.g. :class:`StringIO`).
:param posix_offset:
Optional. If set to ``True``, interpret strings such as ``GMT+3`` or
``UTC+3`` as being 3 hours *behind* UTC rather than ahead, per the
POSIX standard.
.. _`GNU C Library: TZ Variable`:
https://www.gnu.org/software/libc/manual/html_node/TZ-Variable.html
Fc C s� ddl ma || _tj|�}|d kr,td��|jd
krJ| rJ| jd 9 _tj| |j|j|j |j
ddd� |j s~d | _ d | _ n&| j
|j�| _ | j r�| j
|jdd �| _ t| j �| _d S ) Nr )�parserzunknown string format�GMTr r F)r� r� )�isend)r� r rz )r� r� �_sZ_parsetzr} r� r� r� r0 r� rK r� r� �_deltar� r� r: r� )r �sZ posix_offset�resr r r r0 � s"
ztzstr.__init__r c C s< ddl m} i }|jd k rr|j|d< |jd k r`|j|j|j�|d< |jdkrVd|d< qpd|d< q�|jr�|j|d< n*|jd k r�|j|d< n|jd k r�|j|d < |s�|s�d
|d< d|d< |jd�|d< n d |d< d|d< |jd�|d< |j d k � r�|j |d < nd
|d < |�r0| j
| j }|d |j |j
d 8 < |jf |�S )Nr )r� r� r� r r� r� ZyeardayZ nlyeardayrn r� r( i i�Q r rz )r� r� r� r� Zweekr� ZydayZjydayr� r5 r8 r7 r( Zdays)r �xr� r� ra rF r r r r� � s<
z tzstr._deltac C s d| j jt| j�f S )Nz%s(%s))r r r1 r� )r r r r r! s ztzstr.__repr__N)F)r )r r" r# r$ r0 r� r! r r r r r� � s
)r� c @ s e Zd Zddd�ZdS )�_tzicalvtzcompNc C s@ t j|d�| _t j|d�| _| j| j | _|| _|| _|| _d S )N)r( )r, r- � tzoffsetfrom�
tzoffsetto� tzoffsetdiffrG r �rrule)r r� r� rG r r� r r r r0 s z_tzicalvtzcomp.__init__)NN)r r" r# r0 r r r r r� s r� c sZ e Zd Zg f� fdd� Zdd� Zdd� Zdd� Zd d
� Zed d � �Z d
d� Z
e j Z � Z
S )�
_tzicalvtzc s* t t| �j� || _|| _g | _g | _d S )N)r4 r� r0 �_tzid�_comps�
_cachedate�
_cachecomp)r �tzid�comps)r r r r0 s
z_tzicalvtz.__init__c
C s
t | j�dkr| jd S |jd d�}y | j| jj|| j|�f� S tk
rT Y nX d }d }x4| jD ]*}| j||�}|rf| s�||k rf|}|}qfW |s�x"| jD ]}|j s�|}P q�W |d }| jj
d|| j|�f� | jj
d|� t | j�dk�r| jj � | jj � |S )Nr r )r� r� ) r� r� �replacer� r� �indexrC r} � _find_compdtrG �insert�pop)r r Z
lastcompdtZlastcomp�comp�compdtr r r �
_find_comp s4
z_tzicalvtz._find_compc C s2 |j tk r | j|�r ||j 8 }|jj|dd�}|S )NT)Zinc)r� r
rC r� Zbefore)r r� r r� r r r r� I s
z_tzicalvtz._find_compdtc C s |d kr d S | j |�jS )N)r� r� )r r r r r r Q s z_tzicalvtz.utcoffsetc C s | j |�}|jr|jS tS d S )N)r� rG r� r
)r r r� r r r r W s
z_tzicalvtz.dstc C s | j |�jS )N)r� r )r r r r r r ^ s z_tzicalvtz.tznamec C s dt | j� S )Nz<tzicalvtz %s>)r1 r� )r r r r r! b s z_tzicalvtz.__repr__)r r" r# r0 r� r� r r r r r! r& r' rD r r )r r r� s * r� c @ sB e Zd ZdZdd� Zdd� Zddd�Zd d
� Zd d � Zd
d� Z dS )�tzicala\
This object is designed to parse an iCalendar-style ``VTIMEZONE`` structure
as set out in `RFC 2445`_ Section 4.6.5 into one or more `tzinfo` objects.
:param `fileobj`:
A file or stream in iCalendar format, which should be UTF-8 encoded
with CRLF endings.
.. _`RFC 2445`: https://www.ietf.org/rfc/rfc2445.txt
c C sj ddl ma t|t�r(|| _t|d�}nt|dt|��| _t|�}i | _ |�}| j
|j � � W d Q R X d S )Nr )r� �rr. ) r� r� r r r� re rB r1 rg �_vtz�
_parse_rfcr{ )r rj Zfobjr r r r0 s s
ztzical.__init__c C s t | jj� �S )z?
Retrieves the available time zones as a list.
)r� r� �keys)r r r r r� � s z tzical.keysNc C sP |dkrDt | j�dkr td��nt | j�dkr6td��tt| j��}| jj|�S )a�
Retrieve a :py:class:`datetime.tzinfo` object by its ``tzid``.
:param tzid:
If there is exactly one time zone available, omitting ``tzid``
or passing :py:const:`None` value returns it. Otherwise a valid
key (which can be retrieved from :func:`keys`) is required.
:raises ValueError:
Raised if ``tzid`` is not specified but there are either more
or fewer than 1 zone defined.
:returns:
Returns either a :py:class:`datetime.tzinfo` object representing
the relevant time zone or :py:const:`None` if the ``tzid`` was
not found.
Nr zno timezones definedr z more than one timezone available)r� r� r} �next�iterr` )r r� r r r r` � s
z
tzical.getc C s� |j � }|std��|d d kr>d|d dk }|dd � }nd}t|�dkrzt|d d� �d t|dd � �d | S t|�d
kr�t|d d� �d t|dd� �d t|dd � � | S td | ��d S )Nz empty offsetr �+�-r rn r� i rs rq zinvalid offset: )r� r� rz r )rz r r )�stripr} r� r2 )r r� �signalr r r �
_parse_offset� s , <ztzical._parse_offsetc C sH |j � }|std��d}xh|t|�k r�|| j� }|s>||= q|dkrv|d dkrv||d |dd � 7 < ||= q|d7 }qW d }g }d}d }�x�|D �]�}|s�q�|jdd�\} }
| jd�} | s�td��| d j� } | dd � } |�r$| d k�r(|
d)k�r n td |
��|
}d} d }
d }g }d }�q@| d
k�r|
dk�r�|�rNtd| ��|�s\td��|�sjtd��t||�| j|< d}n�|
|k�r| �s�td��|
d k�r�td��|d k�r�td��d }|�r�tj dj
|�dddd�}t |
||d k||�}|j |� d }n td|
���q@|�r�| dk�r2|j |� d} n�| d*k�rH|j |� n�| d k�rx| �rltd | | d f ��| j
|
�}
nj| d k�r�| �r�td | d ��| j
|
�}n>| d!k�r�| �r�td"| d ��|
}n| d#k�r�n td$| ��n>| d%k�r
| �rtd&| d ��|
}n| d+k�rn td$| ��q�| d kr�|
dkr�d }g }d}q�W d S ),Nz empty stringr � r F�:�;zempty property nameZBEGIN�STANDARD�DAYLIGHTzunknown component: ZENDZ VTIMEZONEzcomponent not closed: zmandatory TZID not foundz at least one component is neededzmandatory DTSTART not foundz mandatory TZOFFSETFROM not found�
T)Z
compatibleZignoretz�cachezinvalid component end: ZDTSTART�RRULE�RDATE�EXRULE�EXDATEZ TZOFFSETFROMzunsupported %s parm: %s Z
TZOFFSETTOz unsupported TZOFFSETTO parm: ZTZNAMEzunsupported TZNAME parm: �COMMENTzunsupported property: ZTZIDzunsupported TZID parm: �TZURL�
LAST-MODIFIED)r� r� )r� r� r� r� )r� r� r� )�
splitlinesr} r� �rstrip�split�upperr� r� r� ZrrulestrrP r� rO r� )r r� �linesr� �liner� r� ZinvtzZcomptyper. rR ZparmsZ founddtstartr� r� Z
rrulelinesr Zrrr� r r r r� � s�
ztzical._parse_rfcc C s d| j jt| j�f S )Nz%s(%s))r r r1 r� )r r r r r! + s ztzical.__repr__)N)
r r" r# r$ r0 r� r` r� r� r! r r r r r� h s
vr� Zwin32z/etc/localtimer? z/usr/share/zoneinfoz/usr/lib/zoneinfoz/usr/share/lib/zoneinfoz
/etc/zoneinfoc C sD d }| s,yt jd } W n tk
r* Y nX | d ks<| dkr�x�tD ]v}t jj|�s�|}x*tD ] }t jj||�}t jj|�r\P q\W qBt jj|�rByt |�}P W qB t
t t fk
r� Y qBX qBW t
� }�nz| jd�r�| d d � } t jj| ��r
t jj| ��rt | �}nd }�n6�x2tD ]l}t jj|| �}t jj|��sP|jdd�}t jj|��sP�qyt |�}P W n t
t t fk
�rz Y nX �qW d }td k �r�y t| �}W n tk
�r� d }Y nX |�s�ddlm} |� j| �}|�s@xb| D ]6}|dk�r�y t| �}W n t k
�r Y nX P �q�W | d k�r.t� }n| tjk�r@t
� }|S )
NZTZr� r r� rm r )�get_zonefile_instance�
0123456789r� r rz )r� r )r� �environ�KeyError�TZFILES�path�isabs�TZPATHSrP �isfilerb �IOError�OSErrorr} r3 �
startswithr� r
Z WindowsErrorZdateutil.zoneinfor� r` r� r r5 r )r. �tz�filepathrk r� r� �cr r r �gettz: sz
r� c C sZ |dkr | j dkrtd��| j }| jdd�} | j|d�jt� �j|�}|jdd�}| |kS )a�
Given a datetime and a time zone, determine whether or not a given datetime
would fall in a gap.
:param dt:
A :class:`datetime.datetime` (whose time zone will be ignored if ``tz``
is provided.)
:param tz:
A :class:`datetime.tzinfo` with support for the ``fold`` attribute. If
``None`` or not provided, the datetime's own time zone will be used.
:return:
Returns a boolean value whether or not the "wall time" exists in ``tz``.
Nz,Datetime is naive and no time zone provided.)r� )r� r} r� Z
astimezoner )r r� Zdt_rtr r r �datetime_exists� s
r� c
C s� |dkr | j dkrtd��| j }t|dd�}|dk rLy
|j| �S Y nX | j|d�} t| dd�}t| dd�}|j� |j� k}|j� |j� k}|o�| S )a\
Given a datetime and a time zone, determine whether or not a given datetime
is ambiguous (i.e if there are two times differentiated only by their DST
status).
:param dt:
A :class:`datetime.datetime` (whose time zone will be ignored if ``tz``
is provided.)
:param tz:
A :class:`datetime.tzinfo` with support for the ``fold`` attribute. If
``None`` or not provided, the datetime's own time zone will be used.
:return:
Returns a boolean value whether or not the "wall time" is ambiguous in
``tz``.
.. versionadded:: 2.6.0
Nz,Datetime is naive and no time zone provided.r )r� r )rA r )r� r} rB r r� r r r )r r� Zis_ambiguous_fnZwall_0Zwall_1Z same_offsetZsame_dstr r r �datetime_ambiguous� s
r� c C s t | jdd�t �S )z�
Convert a :class:`datetime.datetime` object to an epoch timestamp in seconds
since January 1, 1970, ignoring the time zone.
N)r� )r r� �EPOCH)r r r r r> � s r> c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) rg z^
Class for wrapping contexts so that they are passed through in a
with statement.
c C s
|| _ d S )N)�context)r r r r r r0 � s z_ContextWrapper.__init__c C s | j S )N)r )r r r r � __enter__� s z_ContextWrapper.__enter__c O s d S )Nr )�argsra r r r �__exit__� s z_ContextWrapper.__exit__N)r r" r# r$ r0 r r r r r r rg � s rg )N)N)N)/r$ r, r~ r5 �sysr� r� Zsixr Z_commonr r r r r r �winr
r � ImportErrorr- r
Zutcfromtimestampr Z toordinalZ EPOCHORDINALr� r r r3 r& rE rV rb r� r� r� r� r� �platformr� r� r� r� r� r> rg r r r r �<module> s\
8Fv-
5 "j R H
J
. dateutil/tz/__pycache__/_common.cpython-36.opt-1.pyc 0000644 00000026262 14751155147 0016262 0 ustar 00 3
6�cY�. � @ s� d dl mZ d dlmZ d dlmZmZmZ ed �ZddgZdd� Z e
ed�rZdd d�Z nG d
d � d e�Z dd d�Z d
d� Z
G dd� de�ZG dd� de�Zdd� Zeede�ZdS )� )�PY3)�wraps)�datetime� timedelta�tzinfo�tzname_in_python2�enfoldc s � fdd�}|S )z�Change unicode output into bytestrings in Python 2
tzname() API changed in Python 3. It used to return bytes, but was changed
to unicode strings
c s$ � | |�}|d k r t r |j� }|S )N)r �encode)�args�kwargs�name)�namefunc� � /usr/lib/python3.6/_common.py�adjust_encoding s
z*tzname_in_python2.<locals>.adjust_encodingr )r
r r )r
r r
s �fold� c C s | j |d�S )a�
Provides a unified interface for assigning the ``fold`` attribute to
datetimes both before and after the implementation of PEP-495.
:param fold:
The value for the ``fold`` attribute in the returned datetime. This
should be either 0 or 1.
:return:
Returns an object for which ``getattr(dt, 'fold', 0)`` returns
``fold`` for all versions of Python. In versions prior to
Python 3.6, this is a ``_DatetimeWithFold`` object, which is a
subclass of :py:class:`datetime.datetime` with the ``fold``
attribute added, if ``fold`` is 1.
.. versionadded:: 2.6.0
)r )�replace)�dtr r r r r ! s c @ s e Zd ZdZf Zedd� �ZdS )�_DatetimeWithFoldz�
This is a class designed to provide a PEP 495-compliant interface for
Python versions before 3.6. It is used only for dates in a fold, so
the ``fold`` attribute is fixed at ``1``.
.. versionadded:: 2.6.0
c C s dS )Nr r )�selfr r r r @ s z_DatetimeWithFold.foldN)�__name__�
__module__� __qualname__�__doc__� __slots__�propertyr r r r r r 6 s r c C sL t | dd�|kr| S | j� dd� }|| j| jf7 }|r@t|� S t|� S dS )a�
Provides a unified interface for assigning the ``fold`` attribute to
datetimes both before and after the implementation of PEP-495.
:param fold:
The value for the ``fold`` attribute in the returned datetime. This
should be either 0 or 1.
:return:
Returns an object for which ``getattr(dt, 'fold', 0)`` returns
``fold`` for all versions of Python. In versions prior to
Python 3.6, this is a ``_DatetimeWithFold`` object, which is a
subclass of :py:class:`datetime.datetime` with the ``fold``
attribute added, if ``fold`` is 1.
.. versionadded:: 2.6.0
r r N� )�getattrZ timetupleZ microsecondr r r )r r r
r r r r D s c s t � �� fdd��}|S )z�
The CPython version of ``fromutc`` checks that the input is a ``datetime``
object and that ``self`` is attached as its ``tzinfo``.
c s. t |t�std��|j| k r$td��� | |�S )Nz&fromutc() requires a datetime argumentzdt.tzinfo is not self)�
isinstancer � TypeErrorr �
ValueError)r r )�fr r �fromutcg s
z)_validate_fromutc_inputs.<locals>.fromutc)r )r" r# r )r" r �_validate_fromutc_inputsb s r$ c @ s< e Zd ZdZdd� Zdd� Zdd� Zdd � Zed
d � �Z d S )
�_tzinfoz=
Base class for all ``dateutil`` ``tzinfo`` objects.
c C sV |j | d�}t|dd�}t|dd�}|j� |j� k}|j dd�|j dd�k}|oT| S )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
)r r )r r N)r r � utcoffset)r r Zwall_0Zwall_1Z same_offsetZsame_dtr r r � is_ambiguousx s z_tzinfo.is_ambiguousc C s4 | j |�r,|| }t||j� |j� k�}nd}|S )a�
Determine the fold status of a "wall" datetime, given a representation
of the same datetime as a (naive) UTC datetime. This is calculated based
on the assumption that ``dt.utcoffset() - dt.dst()`` is constant for all
datetimes, and that this offset is the actual number of hours separating
``dt_utc`` and ``dt_wall``.
:param dt_utc:
Representation of the datetime as UTC
:param dt_wall:
Representation of the datetime as "wall time". This parameter must
either have a `fold` attribute or have a fold-naive
:class:`datetime.tzinfo` attached, otherwise the calculation may
fail.
r )r' �intr& �dst)r �dt_utc�dt_wallZ
delta_wall�_foldr r r � _fold_status� s
z_tzinfo._fold_statusc C s t |dd�S )Nr r )r )r r r r r r, � s z
_tzinfo._foldc C sh |j � }|dkrtd��|j� }|dkr0td��|| }||7 }t|dd�j� }|dkr`td��|| S )a�
Given a timezone-aware datetime in a given timezone, calculates a
timezone-aware datetime in a new timezone.
Since this is the one time that we *know* we have an unambiguous
datetime object, we take this opportunity to determine whether the
datetime is ambiguous and in a "fold" state (e.g. if it's the first
occurence, chronologically, of the ambiguous datetime).
:param dt:
A timezone-aware :class:`datetime.datetime` object.
Nz0fromutc() requires a non-None utcoffset() resultz*fromutc() requires a non-None dst() resultr )r z;fromutc(): dt.dst gave inconsistent results; cannot convert)r& r! r) r )r r ZdtoffZdtdstZdeltar r r �_fromutc� s z_tzinfo._fromutcc C s" | j |�}| j||�}t||d�S )a�
Given a timezone-aware datetime in a given timezone, calculates a
timezone-aware datetime in a new timezone.
Since this is the one time that we *know* we have an unambiguous
datetime object, we take this opportunity to determine whether the
datetime is ambiguous and in a "fold" state (e.g. if it's the first
occurance, chronologically, of the ambiguous datetime).
:param dt:
A timezone-aware :class:`datetime.datetime` object.
)r )r. r- r )r r r+ r, r r r r# � s
z_tzinfo.fromutcN)
r r r r r' r- r, r. r$ r# r r r r r% s s %r% c @ sz e Zd ZdZdd� Zdd� Zdd� Zedd � �Zd
d � Z d d
� Z
dd� Z dd� Z e
dd� �ZdZdd� Zdd� ZejZdS )� tzrangebasea�
This is an abstract base class for time zones represented by an annual
transition into and out of DST. Child classes should implement the following
methods:
* ``__init__(self, *args, **kwargs)``
* ``transitions(self, year)`` - this is expected to return a tuple of
datetimes representing the DST on and off transitions in standard
time.
A fully initialized ``tzrangebase`` subclass should also provide the
following attributes:
* ``hasdst``: Boolean whether or not the zone uses DST.
* ``_dst_offset`` / ``_std_offset``: :class:`datetime.timedelta` objects
representing the respective UTC offsets.
* ``_dst_abbr`` / ``_std_abbr``: Strings representing the timezone short
abbreviations in DST and STD, respectively.
* ``_hasdst``: Whether or not the zone has DST.
.. versionadded:: 2.6.0
c C s t d��d S )Nz%tzrangebase is an abstract base class)�NotImplementedError)r r r r �__init__� s ztzrangebase.__init__c C s* | j |�}|d krd S |r | jS | jS d S )N)�_isdst� _dst_offset� _std_offset)r r �isdstr r r r& s
ztzrangebase.utcoffsetc C s( | j |�}|d krd S |r | jS tS d S )N)r2 �_dst_base_offset�ZERO)r r r5 r r r r) s
ztzrangebase.dstc C s | j |�r| jS | jS d S )N)r2 Z _dst_abbrZ _std_abbr)r r r r r �tzname s
ztzrangebase.tznamec
C s� t |t�std��|j| k r$td��| j|j�}|dkrF|| j|� S |\}}|| j8 }|| j8 }||f}|j dd�}| j
||�}|r�|| j }n
|| j }t | o�| j
|��} t|| d�S )z, Given a datetime in UTC, return local time z&fromutc() requires a datetime argumentzdt.tzinfo is not selfN)r )r )r r r r r! � transitions�yearr& r4 r � _naive_isdstr3 r( r' r )
r r r9 �dston�dstoffZutc_transitionsr* r5 r+ r, r r r r# s$
ztzrangebase.fromutcc C sD | j s
dS | j|j�\}}|jdd�}|| ko>|| j k S S )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
FN)r )�hasdstr9 r: r r6 )r r �start�endr r r r' > s
ztzrangebase.is_ambiguousc C sj | j s
dS |d krd S | j|j�}|d kr.dS |jd d�}| j||�}| rb| j|�rb| j|� S |S d S )NF)r )r> r9 r: r r; r' r, )r r r9 r5 r r r r2 T s ztzrangebase._isdstc C sT |\}}|j d d�}||k r6|| ko.|k n }n|| koH|k n }|S )N)r )r )r r r9 r< r= r5 r r r r; i s ztzrangebase._naive_isdstc C s | j | j S )N)r3 r4 )r r r r r6 u s z tzrangebase._dst_base_offsetNc C s
| |k S )Nr )r �otherr r r �__ne__{ s ztzrangebase.__ne__c C s d| j j S )Nz%s(...))� __class__r )r r r r �__repr__~ s ztzrangebase.__repr__)r r r r r1 r& r) r r8 r# r' r2 r; r r6 �__hash__rB rD �object�
__reduce__r r r r r/ � s
! r/ c C s | j | jd d | j d S )Ni�Q i@B )ZsecondsZdaysZ microseconds)Ztdr r r �_total_seconds� s rH Z
total_secondsN)r )r )Zsixr � functoolsr r r r r7 �__all__r �hasattrr r r$ r% r/ rH r r r r r �<module> s
v dateutil/tz/__pycache__/_common.cpython-36.pyc 0000644 00000026262 14751155147 0015323 0 ustar 00 3
6�cY�. � @ s� d dl mZ d dlmZ d dlmZmZmZ ed �ZddgZdd� Z e
ed�rZdd d�Z nG d
d � d e�Z dd d�Z d
d� Z
G dd� de�ZG dd� de�Zdd� Zeede�ZdS )� )�PY3)�wraps)�datetime� timedelta�tzinfo�tzname_in_python2�enfoldc s � fdd�}|S )z�Change unicode output into bytestrings in Python 2
tzname() API changed in Python 3. It used to return bytes, but was changed
to unicode strings
c s$ � | |�}|d k r t r |j� }|S )N)r �encode)�args�kwargs�name)�namefunc� � /usr/lib/python3.6/_common.py�adjust_encoding s
z*tzname_in_python2.<locals>.adjust_encodingr )r
r r )r
r r
s �fold� c C s | j |d�S )a�
Provides a unified interface for assigning the ``fold`` attribute to
datetimes both before and after the implementation of PEP-495.
:param fold:
The value for the ``fold`` attribute in the returned datetime. This
should be either 0 or 1.
:return:
Returns an object for which ``getattr(dt, 'fold', 0)`` returns
``fold`` for all versions of Python. In versions prior to
Python 3.6, this is a ``_DatetimeWithFold`` object, which is a
subclass of :py:class:`datetime.datetime` with the ``fold``
attribute added, if ``fold`` is 1.
.. versionadded:: 2.6.0
)r )�replace)�dtr r r r r ! s c @ s e Zd ZdZf Zedd� �ZdS )�_DatetimeWithFoldz�
This is a class designed to provide a PEP 495-compliant interface for
Python versions before 3.6. It is used only for dates in a fold, so
the ``fold`` attribute is fixed at ``1``.
.. versionadded:: 2.6.0
c C s dS )Nr r )�selfr r r r @ s z_DatetimeWithFold.foldN)�__name__�
__module__� __qualname__�__doc__� __slots__�propertyr r r r r r 6 s r c C sL t | dd�|kr| S | j� dd� }|| j| jf7 }|r@t|� S t|� S dS )a�
Provides a unified interface for assigning the ``fold`` attribute to
datetimes both before and after the implementation of PEP-495.
:param fold:
The value for the ``fold`` attribute in the returned datetime. This
should be either 0 or 1.
:return:
Returns an object for which ``getattr(dt, 'fold', 0)`` returns
``fold`` for all versions of Python. In versions prior to
Python 3.6, this is a ``_DatetimeWithFold`` object, which is a
subclass of :py:class:`datetime.datetime` with the ``fold``
attribute added, if ``fold`` is 1.
.. versionadded:: 2.6.0
r r N� )�getattrZ timetupleZ microsecondr r r )r r r
r r r r D s c s t � �� fdd��}|S )z�
The CPython version of ``fromutc`` checks that the input is a ``datetime``
object and that ``self`` is attached as its ``tzinfo``.
c s. t |t�std��|j| k r$td��� | |�S )Nz&fromutc() requires a datetime argumentzdt.tzinfo is not self)�
isinstancer � TypeErrorr �
ValueError)r r )�fr r �fromutcg s
z)_validate_fromutc_inputs.<locals>.fromutc)r )r" r# r )r" r �_validate_fromutc_inputsb s r$ c @ s< e Zd ZdZdd� Zdd� Zdd� Zdd � Zed
d � �Z d S )
�_tzinfoz=
Base class for all ``dateutil`` ``tzinfo`` objects.
c C sV |j | d�}t|dd�}t|dd�}|j� |j� k}|j dd�|j dd�k}|oT| S )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
)r r )r r N)r r � utcoffset)r r Zwall_0Zwall_1Z same_offsetZsame_dtr r r � is_ambiguousx s z_tzinfo.is_ambiguousc C s4 | j |�r,|| }t||j� |j� k�}nd}|S )a�
Determine the fold status of a "wall" datetime, given a representation
of the same datetime as a (naive) UTC datetime. This is calculated based
on the assumption that ``dt.utcoffset() - dt.dst()`` is constant for all
datetimes, and that this offset is the actual number of hours separating
``dt_utc`` and ``dt_wall``.
:param dt_utc:
Representation of the datetime as UTC
:param dt_wall:
Representation of the datetime as "wall time". This parameter must
either have a `fold` attribute or have a fold-naive
:class:`datetime.tzinfo` attached, otherwise the calculation may
fail.
r )r' �intr& �dst)r �dt_utc�dt_wallZ
delta_wall�_foldr r r � _fold_status� s
z_tzinfo._fold_statusc C s t |dd�S )Nr r )r )r r r r r r, � s z
_tzinfo._foldc C sh |j � }|dkrtd��|j� }|dkr0td��|| }||7 }t|dd�j� }|dkr`td��|| S )a�
Given a timezone-aware datetime in a given timezone, calculates a
timezone-aware datetime in a new timezone.
Since this is the one time that we *know* we have an unambiguous
datetime object, we take this opportunity to determine whether the
datetime is ambiguous and in a "fold" state (e.g. if it's the first
occurence, chronologically, of the ambiguous datetime).
:param dt:
A timezone-aware :class:`datetime.datetime` object.
Nz0fromutc() requires a non-None utcoffset() resultz*fromutc() requires a non-None dst() resultr )r z;fromutc(): dt.dst gave inconsistent results; cannot convert)r& r! r) r )r r ZdtoffZdtdstZdeltar r r �_fromutc� s z_tzinfo._fromutcc C s" | j |�}| j||�}t||d�S )a�
Given a timezone-aware datetime in a given timezone, calculates a
timezone-aware datetime in a new timezone.
Since this is the one time that we *know* we have an unambiguous
datetime object, we take this opportunity to determine whether the
datetime is ambiguous and in a "fold" state (e.g. if it's the first
occurance, chronologically, of the ambiguous datetime).
:param dt:
A timezone-aware :class:`datetime.datetime` object.
)r )r. r- r )r r r+ r, r r r r# � s
z_tzinfo.fromutcN)
r r r r r' r- r, r. r$ r# r r r r r% s s %r% c @ sz e Zd ZdZdd� Zdd� Zdd� Zedd � �Zd
d � Z d d
� Z
dd� Z dd� Z e
dd� �ZdZdd� Zdd� ZejZdS )� tzrangebasea�
This is an abstract base class for time zones represented by an annual
transition into and out of DST. Child classes should implement the following
methods:
* ``__init__(self, *args, **kwargs)``
* ``transitions(self, year)`` - this is expected to return a tuple of
datetimes representing the DST on and off transitions in standard
time.
A fully initialized ``tzrangebase`` subclass should also provide the
following attributes:
* ``hasdst``: Boolean whether or not the zone uses DST.
* ``_dst_offset`` / ``_std_offset``: :class:`datetime.timedelta` objects
representing the respective UTC offsets.
* ``_dst_abbr`` / ``_std_abbr``: Strings representing the timezone short
abbreviations in DST and STD, respectively.
* ``_hasdst``: Whether or not the zone has DST.
.. versionadded:: 2.6.0
c C s t d��d S )Nz%tzrangebase is an abstract base class)�NotImplementedError)r r r r �__init__� s ztzrangebase.__init__c C s* | j |�}|d krd S |r | jS | jS d S )N)�_isdst� _dst_offset� _std_offset)r r �isdstr r r r& s
ztzrangebase.utcoffsetc C s( | j |�}|d krd S |r | jS tS d S )N)r2 �_dst_base_offset�ZERO)r r r5 r r r r) s
ztzrangebase.dstc C s | j |�r| jS | jS d S )N)r2 Z _dst_abbrZ _std_abbr)r r r r r �tzname s
ztzrangebase.tznamec
C s� t |t�std��|j| k r$td��| j|j�}|dkrF|| j|� S |\}}|| j8 }|| j8 }||f}|j dd�}| j
||�}|r�|| j }n
|| j }t | o�| j
|��} t|| d�S )z, Given a datetime in UTC, return local time z&fromutc() requires a datetime argumentzdt.tzinfo is not selfN)r )r )r r r r r! � transitions�yearr& r4 r � _naive_isdstr3 r( r' r )
r r r9 �dston�dstoffZutc_transitionsr* r5 r+ r, r r r r# s$
ztzrangebase.fromutcc C sD | j s
dS | j|j�\}}|jdd�}|| ko>|| j k S S )a6
Whether or not the "wall time" of a given datetime is ambiguous in this
zone.
:param dt:
A :py:class:`datetime.datetime`, naive or time zone aware.
:return:
Returns ``True`` if ambiguous, ``False`` otherwise.
.. versionadded:: 2.6.0
FN)r )�hasdstr9 r: r r6 )r r �start�endr r r r' > s
ztzrangebase.is_ambiguousc C sj | j s
dS |d krd S | j|j�}|d kr.dS |jd d�}| j||�}| rb| j|�rb| j|� S |S d S )NF)r )r> r9 r: r r; r' r, )r r r9 r5 r r r r2 T s ztzrangebase._isdstc C sT |\}}|j d d�}||k r6|| ko.|k n }n|| koH|k n }|S )N)r )r )r r r9 r< r= r5 r r r r; i s ztzrangebase._naive_isdstc C s | j | j S )N)r3 r4 )r r r r r6 u s z tzrangebase._dst_base_offsetNc C s
| |k S )Nr )r �otherr r r �__ne__{ s ztzrangebase.__ne__c C s d| j j S )Nz%s(...))� __class__r )r r r r �__repr__~ s ztzrangebase.__repr__)r r r r r1 r& r) r r8 r# r' r2 r; r r6 �__hash__rB rD �object�
__reduce__r r r r r/ � s
! r/ c C s | j | jd d | j d S )Ni�Q i@B )ZsecondsZdaysZ microseconds)Ztdr r r �_total_seconds� s rH Z
total_secondsN)r )r )Zsixr � functoolsr r r r r7 �__all__r �hasattrr r r$ r% r/ rH r r r r r �<module> s
v dateutil/tz/win.py 0000644 00000026205 14751155147 0010202 0 ustar 00 # This code was originally contributed by Jeffrey Harris.
import datetime
import struct
from six.moves import winreg
from six import text_type
try:
import ctypes
from ctypes import wintypes
except ValueError:
# ValueError is raised on non-Windows systems for some horrible reason.
raise ImportError("Running tzwin on non-Windows system")
from ._common import tzrangebase
__all__ = ["tzwin", "tzwinlocal", "tzres"]
ONEWEEK = datetime.timedelta(7)
TZKEYNAMENT = r"SOFTWARE\Microsoft\Windows NT\CurrentVersion\Time Zones"
TZKEYNAME9X = r"SOFTWARE\Microsoft\Windows\CurrentVersion\Time Zones"
TZLOCALKEYNAME = r"SYSTEM\CurrentControlSet\Control\TimeZoneInformation"
def _settzkeyname():
handle = winreg.ConnectRegistry(None, winreg.HKEY_LOCAL_MACHINE)
try:
winreg.OpenKey(handle, TZKEYNAMENT).Close()
TZKEYNAME = TZKEYNAMENT
except WindowsError:
TZKEYNAME = TZKEYNAME9X
handle.Close()
return TZKEYNAME
TZKEYNAME = _settzkeyname()
class tzres(object):
"""
Class for accessing `tzres.dll`, which contains timezone name related
resources.
.. versionadded:: 2.5.0
"""
p_wchar = ctypes.POINTER(wintypes.WCHAR) # Pointer to a wide char
def __init__(self, tzres_loc='tzres.dll'):
# Load the user32 DLL so we can load strings from tzres
user32 = ctypes.WinDLL('user32')
# Specify the LoadStringW function
user32.LoadStringW.argtypes = (wintypes.HINSTANCE,
wintypes.UINT,
wintypes.LPWSTR,
ctypes.c_int)
self.LoadStringW = user32.LoadStringW
self._tzres = ctypes.WinDLL(tzres_loc)
self.tzres_loc = tzres_loc
def load_name(self, offset):
"""
Load a timezone name from a DLL offset (integer).
>>> from dateutil.tzwin import tzres
>>> tzr = tzres()
>>> print(tzr.load_name(112))
'Eastern Standard Time'
:param offset:
A positive integer value referring to a string from the tzres dll.
..note:
Offsets found in the registry are generally of the form
`@tzres.dll,-114`. The offset in this case if 114, not -114.
"""
resource = self.p_wchar()
lpBuffer = ctypes.cast(ctypes.byref(resource), wintypes.LPWSTR)
nchar = self.LoadStringW(self._tzres._handle, offset, lpBuffer, 0)
return resource[:nchar]
def name_from_string(self, tzname_str):
"""
Parse strings as returned from the Windows registry into the time zone
name as defined in the registry.
>>> from dateutil.tzwin import tzres
>>> tzr = tzres()
>>> print(tzr.name_from_string('@tzres.dll,-251'))
'Dateline Daylight Time'
>>> print(tzr.name_from_string('Eastern Standard Time'))
'Eastern Standard Time'
:param tzname_str:
A timezone name string as returned from a Windows registry key.
:return:
Returns the localized timezone string from tzres.dll if the string
is of the form `@tzres.dll,-offset`, else returns the input string.
"""
if not tzname_str.startswith('@'):
return tzname_str
name_splt = tzname_str.split(',-')
try:
offset = int(name_splt[1])
except:
raise ValueError("Malformed timezone string.")
return self.load_name(offset)
class tzwinbase(tzrangebase):
"""tzinfo class based on win32's timezones available in the registry."""
def __init__(self):
raise NotImplementedError('tzwinbase is an abstract base class')
def __eq__(self, other):
# Compare on all relevant dimensions, including name.
if not isinstance(other, tzwinbase):
return NotImplemented
return (self._std_offset == other._std_offset and
self._dst_offset == other._dst_offset and
self._stddayofweek == other._stddayofweek and
self._dstdayofweek == other._dstdayofweek and
self._stdweeknumber == other._stdweeknumber and
self._dstweeknumber == other._dstweeknumber and
self._stdhour == other._stdhour and
self._dsthour == other._dsthour and
self._stdminute == other._stdminute and
self._dstminute == other._dstminute and
self._std_abbr == other._std_abbr and
self._dst_abbr == other._dst_abbr)
@staticmethod
def list():
"""Return a list of all time zones known to the system."""
with winreg.ConnectRegistry(None, winreg.HKEY_LOCAL_MACHINE) as handle:
with winreg.OpenKey(handle, TZKEYNAME) as tzkey:
result = [winreg.EnumKey(tzkey, i)
for i in range(winreg.QueryInfoKey(tzkey)[0])]
return result
def display(self):
return self._display
def transitions(self, year):
"""
For a given year, get the DST on and off transition times, expressed
always on the standard time side. For zones with no transitions, this
function returns ``None``.
:param year:
The year whose transitions you would like to query.
:return:
Returns a :class:`tuple` of :class:`datetime.datetime` objects,
``(dston, dstoff)`` for zones with an annual DST transition, or
``None`` for fixed offset zones.
"""
if not self.hasdst:
return None
dston = picknthweekday(year, self._dstmonth, self._dstdayofweek,
self._dsthour, self._dstminute,
self._dstweeknumber)
dstoff = picknthweekday(year, self._stdmonth, self._stddayofweek,
self._stdhour, self._stdminute,
self._stdweeknumber)
# Ambiguous dates default to the STD side
dstoff -= self._dst_base_offset
return dston, dstoff
def _get_hasdst(self):
return self._dstmonth != 0
@property
def _dst_base_offset(self):
return self._dst_base_offset_
class tzwin(tzwinbase):
def __init__(self, name):
self._name = name
# multiple contexts only possible in 2.7 and 3.1, we still support 2.6
with winreg.ConnectRegistry(None, winreg.HKEY_LOCAL_MACHINE) as handle:
tzkeyname = text_type("{kn}\\{name}").format(kn=TZKEYNAME, name=name)
with winreg.OpenKey(handle, tzkeyname) as tzkey:
keydict = valuestodict(tzkey)
self._std_abbr = keydict["Std"]
self._dst_abbr = keydict["Dlt"]
self._display = keydict["Display"]
# See http://ww_winreg.jsiinc.com/SUBA/tip0300/rh0398.htm
tup = struct.unpack("=3l16h", keydict["TZI"])
stdoffset = -tup[0]-tup[1] # Bias + StandardBias * -1
dstoffset = stdoffset-tup[2] # + DaylightBias * -1
self._std_offset = datetime.timedelta(minutes=stdoffset)
self._dst_offset = datetime.timedelta(minutes=dstoffset)
# for the meaning see the win32 TIME_ZONE_INFORMATION structure docs
# http://msdn.microsoft.com/en-us/library/windows/desktop/ms725481(v=vs.85).aspx
(self._stdmonth,
self._stddayofweek, # Sunday = 0
self._stdweeknumber, # Last = 5
self._stdhour,
self._stdminute) = tup[4:9]
(self._dstmonth,
self._dstdayofweek, # Sunday = 0
self._dstweeknumber, # Last = 5
self._dsthour,
self._dstminute) = tup[12:17]
self._dst_base_offset_ = self._dst_offset - self._std_offset
self.hasdst = self._get_hasdst()
def __repr__(self):
return "tzwin(%s)" % repr(self._name)
def __reduce__(self):
return (self.__class__, (self._name,))
class tzwinlocal(tzwinbase):
def __init__(self):
with winreg.ConnectRegistry(None, winreg.HKEY_LOCAL_MACHINE) as handle:
with winreg.OpenKey(handle, TZLOCALKEYNAME) as tzlocalkey:
keydict = valuestodict(tzlocalkey)
self._std_abbr = keydict["StandardName"]
self._dst_abbr = keydict["DaylightName"]
try:
tzkeyname = text_type('{kn}\\{sn}').format(kn=TZKEYNAME,
sn=self._std_abbr)
with winreg.OpenKey(handle, tzkeyname) as tzkey:
_keydict = valuestodict(tzkey)
self._display = _keydict["Display"]
except OSError:
self._display = None
stdoffset = -keydict["Bias"]-keydict["StandardBias"]
dstoffset = stdoffset-keydict["DaylightBias"]
self._std_offset = datetime.timedelta(minutes=stdoffset)
self._dst_offset = datetime.timedelta(minutes=dstoffset)
# For reasons unclear, in this particular key, the day of week has been
# moved to the END of the SYSTEMTIME structure.
tup = struct.unpack("=8h", keydict["StandardStart"])
(self._stdmonth,
self._stdweeknumber, # Last = 5
self._stdhour,
self._stdminute) = tup[1:5]
self._stddayofweek = tup[7]
tup = struct.unpack("=8h", keydict["DaylightStart"])
(self._dstmonth,
self._dstweeknumber, # Last = 5
self._dsthour,
self._dstminute) = tup[1:5]
self._dstdayofweek = tup[7]
self._dst_base_offset_ = self._dst_offset - self._std_offset
self.hasdst = self._get_hasdst()
def __repr__(self):
return "tzwinlocal()"
def __str__(self):
# str will return the standard name, not the daylight name.
return "tzwinlocal(%s)" % repr(self._std_abbr)
def __reduce__(self):
return (self.__class__, ())
def picknthweekday(year, month, dayofweek, hour, minute, whichweek):
""" dayofweek == 0 means Sunday, whichweek 5 means last instance """
first = datetime.datetime(year, month, 1, hour, minute)
# This will work if dayofweek is ISO weekday (1-7) or Microsoft-style (0-6),
# Because 7 % 7 = 0
weekdayone = first.replace(day=((dayofweek - first.isoweekday()) % 7) + 1)
wd = weekdayone + ((whichweek - 1) * ONEWEEK)
if (wd.month != month):
wd -= ONEWEEK
return wd
def valuestodict(key):
"""Convert a registry key's values to a dictionary."""
dout = {}
size = winreg.QueryInfoKey(key)[1]
tz_res = None
for i in range(size):
key_name, value, dtype = winreg.EnumValue(key, i)
if dtype == winreg.REG_DWORD or dtype == winreg.REG_DWORD_LITTLE_ENDIAN:
# If it's a DWORD (32-bit integer), it's stored as unsigned - convert
# that to a proper signed integer
if value & (1 << 31):
value = value - (1 << 32)
elif dtype == winreg.REG_SZ:
# If it's a reference to the tzres DLL, load the actual string
if value.startswith('@tzres'):
tz_res = tz_res or tzres()
value = tz_res.name_from_string(value)
value = value.rstrip('\x00') # Remove trailing nulls
dout[key_name] = value
return dout
dateutil/tz/__init__.py 0000644 00000000317 14751155147 0011140 0 ustar 00 from .tz import *
__all__ = ["tzutc", "tzoffset", "tzlocal", "tzfile", "tzrange",
"tzstr", "tzical", "tzwin", "tzwinlocal", "gettz",
"enfold", "datetime_ambiguous", "datetime_exists"]
dateutil/_version.py 0000644 00000000333 14751155147 0010566 0 ustar 00 """
Contains information about the dateutil version.
"""
VERSION_MAJOR = 2
VERSION_MINOR = 6
VERSION_PATCH = 1
VERSION_TUPLE = (VERSION_MAJOR, VERSION_MINOR, VERSION_PATCH)
VERSION = '.'.join(map(str, VERSION_TUPLE))
dateutil/rrule.py 0000644 00000170613 14751155147 0010104 0 ustar 00 # -*- coding: utf-8 -*-
"""
The rrule module offers a small, complete, and very fast, implementation of
the recurrence rules documented in the
`iCalendar RFC <http://www.ietf.org/rfc/rfc2445.txt>`_,
including support for caching of results.
"""
import itertools
import datetime
import calendar
import sys
try:
from math import gcd
except ImportError:
from fractions import gcd
from six import advance_iterator, integer_types
from six.moves import _thread, range
import heapq
from ._common import weekday as weekdaybase
# For warning about deprecation of until and count
from warnings import warn
__all__ = ["rrule", "rruleset", "rrulestr",
"YEARLY", "MONTHLY", "WEEKLY", "DAILY",
"HOURLY", "MINUTELY", "SECONDLY",
"MO", "TU", "WE", "TH", "FR", "SA", "SU"]
# Every mask is 7 days longer to handle cross-year weekly periods.
M366MASK = tuple([1]*31+[2]*29+[3]*31+[4]*30+[5]*31+[6]*30 +
[7]*31+[8]*31+[9]*30+[10]*31+[11]*30+[12]*31+[1]*7)
M365MASK = list(M366MASK)
M29, M30, M31 = list(range(1, 30)), list(range(1, 31)), list(range(1, 32))
MDAY366MASK = tuple(M31+M29+M31+M30+M31+M30+M31+M31+M30+M31+M30+M31+M31[:7])
MDAY365MASK = list(MDAY366MASK)
M29, M30, M31 = list(range(-29, 0)), list(range(-30, 0)), list(range(-31, 0))
NMDAY366MASK = tuple(M31+M29+M31+M30+M31+M30+M31+M31+M30+M31+M30+M31+M31[:7])
NMDAY365MASK = list(NMDAY366MASK)
M366RANGE = (0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366)
M365RANGE = (0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365)
WDAYMASK = [0, 1, 2, 3, 4, 5, 6]*55
del M29, M30, M31, M365MASK[59], MDAY365MASK[59], NMDAY365MASK[31]
MDAY365MASK = tuple(MDAY365MASK)
M365MASK = tuple(M365MASK)
FREQNAMES = ['YEARLY', 'MONTHLY', 'WEEKLY', 'DAILY', 'HOURLY', 'MINUTELY', 'SECONDLY']
(YEARLY,
MONTHLY,
WEEKLY,
DAILY,
HOURLY,
MINUTELY,
SECONDLY) = list(range(7))
# Imported on demand.
easter = None
parser = None
class weekday(weekdaybase):
"""
This version of weekday does not allow n = 0.
"""
def __init__(self, wkday, n=None):
if n == 0:
raise ValueError("Can't create weekday with n==0")
super(weekday, self).__init__(wkday, n)
MO, TU, WE, TH, FR, SA, SU = weekdays = tuple(weekday(x) for x in range(7))
def _invalidates_cache(f):
"""
Decorator for rruleset methods which may invalidate the
cached length.
"""
def inner_func(self, *args, **kwargs):
rv = f(self, *args, **kwargs)
self._invalidate_cache()
return rv
return inner_func
class rrulebase(object):
def __init__(self, cache=False):
if cache:
self._cache = []
self._cache_lock = _thread.allocate_lock()
self._invalidate_cache()
else:
self._cache = None
self._cache_complete = False
self._len = None
def __iter__(self):
if self._cache_complete:
return iter(self._cache)
elif self._cache is None:
return self._iter()
else:
return self._iter_cached()
def _invalidate_cache(self):
if self._cache is not None:
self._cache = []
self._cache_complete = False
self._cache_gen = self._iter()
if self._cache_lock.locked():
self._cache_lock.release()
self._len = None
def _iter_cached(self):
i = 0
gen = self._cache_gen
cache = self._cache
acquire = self._cache_lock.acquire
release = self._cache_lock.release
while gen:
if i == len(cache):
acquire()
if self._cache_complete:
break
try:
for j in range(10):
cache.append(advance_iterator(gen))
except StopIteration:
self._cache_gen = gen = None
self._cache_complete = True
break
release()
yield cache[i]
i += 1
while i < self._len:
yield cache[i]
i += 1
def __getitem__(self, item):
if self._cache_complete:
return self._cache[item]
elif isinstance(item, slice):
if item.step and item.step < 0:
return list(iter(self))[item]
else:
return list(itertools.islice(self,
item.start or 0,
item.stop or sys.maxsize,
item.step or 1))
elif item >= 0:
gen = iter(self)
try:
for i in range(item+1):
res = advance_iterator(gen)
except StopIteration:
raise IndexError
return res
else:
return list(iter(self))[item]
def __contains__(self, item):
if self._cache_complete:
return item in self._cache
else:
for i in self:
if i == item:
return True
elif i > item:
return False
return False
# __len__() introduces a large performance penality.
def count(self):
""" Returns the number of recurrences in this set. It will have go
trough the whole recurrence, if this hasn't been done before. """
if self._len is None:
for x in self:
pass
return self._len
def before(self, dt, inc=False):
""" Returns the last recurrence before the given datetime instance. The
inc keyword defines what happens if dt is an occurrence. With
inc=True, if dt itself is an occurrence, it will be returned. """
if self._cache_complete:
gen = self._cache
else:
gen = self
last = None
if inc:
for i in gen:
if i > dt:
break
last = i
else:
for i in gen:
if i >= dt:
break
last = i
return last
def after(self, dt, inc=False):
""" Returns the first recurrence after the given datetime instance. The
inc keyword defines what happens if dt is an occurrence. With
inc=True, if dt itself is an occurrence, it will be returned. """
if self._cache_complete:
gen = self._cache
else:
gen = self
if inc:
for i in gen:
if i >= dt:
return i
else:
for i in gen:
if i > dt:
return i
return None
def xafter(self, dt, count=None, inc=False):
"""
Generator which yields up to `count` recurrences after the given
datetime instance, equivalent to `after`.
:param dt:
The datetime at which to start generating recurrences.
:param count:
The maximum number of recurrences to generate. If `None` (default),
dates are generated until the recurrence rule is exhausted.
:param inc:
If `dt` is an instance of the rule and `inc` is `True`, it is
included in the output.
:yields: Yields a sequence of `datetime` objects.
"""
if self._cache_complete:
gen = self._cache
else:
gen = self
# Select the comparison function
if inc:
comp = lambda dc, dtc: dc >= dtc
else:
comp = lambda dc, dtc: dc > dtc
# Generate dates
n = 0
for d in gen:
if comp(d, dt):
if count is not None:
n += 1
if n > count:
break
yield d
def between(self, after, before, inc=False, count=1):
""" Returns all the occurrences of the rrule between after and before.
The inc keyword defines what happens if after and/or before are
themselves occurrences. With inc=True, they will be included in the
list, if they are found in the recurrence set. """
if self._cache_complete:
gen = self._cache
else:
gen = self
started = False
l = []
if inc:
for i in gen:
if i > before:
break
elif not started:
if i >= after:
started = True
l.append(i)
else:
l.append(i)
else:
for i in gen:
if i >= before:
break
elif not started:
if i > after:
started = True
l.append(i)
else:
l.append(i)
return l
class rrule(rrulebase):
"""
That's the base of the rrule operation. It accepts all the keywords
defined in the RFC as its constructor parameters (except byday,
which was renamed to byweekday) and more. The constructor prototype is::
rrule(freq)
Where freq must be one of YEARLY, MONTHLY, WEEKLY, DAILY, HOURLY, MINUTELY,
or SECONDLY.
.. note::
Per RFC section 3.3.10, recurrence instances falling on invalid dates
and times are ignored rather than coerced:
Recurrence rules may generate recurrence instances with an invalid
date (e.g., February 30) or nonexistent local time (e.g., 1:30 AM
on a day where the local time is moved forward by an hour at 1:00
AM). Such recurrence instances MUST be ignored and MUST NOT be
counted as part of the recurrence set.
This can lead to possibly surprising behavior when, for example, the
start date occurs at the end of the month:
>>> from dateutil.rrule import rrule, MONTHLY
>>> from datetime import datetime
>>> start_date = datetime(2014, 12, 31)
>>> list(rrule(freq=MONTHLY, count=4, dtstart=start_date))
... # doctest: +NORMALIZE_WHITESPACE
[datetime.datetime(2014, 12, 31, 0, 0),
datetime.datetime(2015, 1, 31, 0, 0),
datetime.datetime(2015, 3, 31, 0, 0),
datetime.datetime(2015, 5, 31, 0, 0)]
Additionally, it supports the following keyword arguments:
:param cache:
If given, it must be a boolean value specifying to enable or disable
caching of results. If you will use the same rrule instance multiple
times, enabling caching will improve the performance considerably.
:param dtstart:
The recurrence start. Besides being the base for the recurrence,
missing parameters in the final recurrence instances will also be
extracted from this date. If not given, datetime.now() will be used
instead.
:param interval:
The interval between each freq iteration. For example, when using
YEARLY, an interval of 2 means once every two years, but with HOURLY,
it means once every two hours. The default interval is 1.
:param wkst:
The week start day. Must be one of the MO, TU, WE constants, or an
integer, specifying the first day of the week. This will affect
recurrences based on weekly periods. The default week start is got
from calendar.firstweekday(), and may be modified by
calendar.setfirstweekday().
:param count:
How many occurrences will be generated.
.. note::
As of version 2.5.0, the use of the ``until`` keyword together
with the ``count`` keyword is deprecated per RFC-2445 Sec. 4.3.10.
:param until:
If given, this must be a datetime instance, that will specify the
limit of the recurrence. The last recurrence in the rule is the greatest
datetime that is less than or equal to the value specified in the
``until`` parameter.
.. note::
As of version 2.5.0, the use of the ``until`` keyword together
with the ``count`` keyword is deprecated per RFC-2445 Sec. 4.3.10.
:param bysetpos:
If given, it must be either an integer, or a sequence of integers,
positive or negative. Each given integer will specify an occurrence
number, corresponding to the nth occurrence of the rule inside the
frequency period. For example, a bysetpos of -1 if combined with a
MONTHLY frequency, and a byweekday of (MO, TU, WE, TH, FR), will
result in the last work day of every month.
:param bymonth:
If given, it must be either an integer, or a sequence of integers,
meaning the months to apply the recurrence to.
:param bymonthday:
If given, it must be either an integer, or a sequence of integers,
meaning the month days to apply the recurrence to.
:param byyearday:
If given, it must be either an integer, or a sequence of integers,
meaning the year days to apply the recurrence to.
:param byweekno:
If given, it must be either an integer, or a sequence of integers,
meaning the week numbers to apply the recurrence to. Week numbers
have the meaning described in ISO8601, that is, the first week of
the year is that containing at least four days of the new year.
:param byweekday:
If given, it must be either an integer (0 == MO), a sequence of
integers, one of the weekday constants (MO, TU, etc), or a sequence
of these constants. When given, these variables will define the
weekdays where the recurrence will be applied. It's also possible to
use an argument n for the weekday instances, which will mean the nth
occurrence of this weekday in the period. For example, with MONTHLY,
or with YEARLY and BYMONTH, using FR(+1) in byweekday will specify the
first friday of the month where the recurrence happens. Notice that in
the RFC documentation, this is specified as BYDAY, but was renamed to
avoid the ambiguity of that keyword.
:param byhour:
If given, it must be either an integer, or a sequence of integers,
meaning the hours to apply the recurrence to.
:param byminute:
If given, it must be either an integer, or a sequence of integers,
meaning the minutes to apply the recurrence to.
:param bysecond:
If given, it must be either an integer, or a sequence of integers,
meaning the seconds to apply the recurrence to.
:param byeaster:
If given, it must be either an integer, or a sequence of integers,
positive or negative. Each integer will define an offset from the
Easter Sunday. Passing the offset 0 to byeaster will yield the Easter
Sunday itself. This is an extension to the RFC specification.
"""
def __init__(self, freq, dtstart=None,
interval=1, wkst=None, count=None, until=None, bysetpos=None,
bymonth=None, bymonthday=None, byyearday=None, byeaster=None,
byweekno=None, byweekday=None,
byhour=None, byminute=None, bysecond=None,
cache=False):
super(rrule, self).__init__(cache)
global easter
if not dtstart:
dtstart = datetime.datetime.now().replace(microsecond=0)
elif not isinstance(dtstart, datetime.datetime):
dtstart = datetime.datetime.fromordinal(dtstart.toordinal())
else:
dtstart = dtstart.replace(microsecond=0)
self._dtstart = dtstart
self._tzinfo = dtstart.tzinfo
self._freq = freq
self._interval = interval
self._count = count
# Cache the original byxxx rules, if they are provided, as the _byxxx
# attributes do not necessarily map to the inputs, and this can be
# a problem in generating the strings. Only store things if they've
# been supplied (the string retrieval will just use .get())
self._original_rule = {}
if until and not isinstance(until, datetime.datetime):
until = datetime.datetime.fromordinal(until.toordinal())
self._until = until
if count is not None and until:
warn("Using both 'count' and 'until' is inconsistent with RFC 2445"
" and has been deprecated in dateutil. Future versions will "
"raise an error.", DeprecationWarning)
if wkst is None:
self._wkst = calendar.firstweekday()
elif isinstance(wkst, integer_types):
self._wkst = wkst
else:
self._wkst = wkst.weekday
if bysetpos is None:
self._bysetpos = None
elif isinstance(bysetpos, integer_types):
if bysetpos == 0 or not (-366 <= bysetpos <= 366):
raise ValueError("bysetpos must be between 1 and 366, "
"or between -366 and -1")
self._bysetpos = (bysetpos,)
else:
self._bysetpos = tuple(bysetpos)
for pos in self._bysetpos:
if pos == 0 or not (-366 <= pos <= 366):
raise ValueError("bysetpos must be between 1 and 366, "
"or between -366 and -1")
if self._bysetpos:
self._original_rule['bysetpos'] = self._bysetpos
if (byweekno is None and byyearday is None and bymonthday is None and
byweekday is None and byeaster is None):
if freq == YEARLY:
if bymonth is None:
bymonth = dtstart.month
self._original_rule['bymonth'] = None
bymonthday = dtstart.day
self._original_rule['bymonthday'] = None
elif freq == MONTHLY:
bymonthday = dtstart.day
self._original_rule['bymonthday'] = None
elif freq == WEEKLY:
byweekday = dtstart.weekday()
self._original_rule['byweekday'] = None
# bymonth
if bymonth is None:
self._bymonth = None
else:
if isinstance(bymonth, integer_types):
bymonth = (bymonth,)
self._bymonth = tuple(sorted(set(bymonth)))
if 'bymonth' not in self._original_rule:
self._original_rule['bymonth'] = self._bymonth
# byyearday
if byyearday is None:
self._byyearday = None
else:
if isinstance(byyearday, integer_types):
byyearday = (byyearday,)
self._byyearday = tuple(sorted(set(byyearday)))
self._original_rule['byyearday'] = self._byyearday
# byeaster
if byeaster is not None:
if not easter:
from dateutil import easter
if isinstance(byeaster, integer_types):
self._byeaster = (byeaster,)
else:
self._byeaster = tuple(sorted(byeaster))
self._original_rule['byeaster'] = self._byeaster
else:
self._byeaster = None
# bymonthday
if bymonthday is None:
self._bymonthday = ()
self._bynmonthday = ()
else:
if isinstance(bymonthday, integer_types):
bymonthday = (bymonthday,)
bymonthday = set(bymonthday) # Ensure it's unique
self._bymonthday = tuple(sorted(x for x in bymonthday if x > 0))
self._bynmonthday = tuple(sorted(x for x in bymonthday if x < 0))
# Storing positive numbers first, then negative numbers
if 'bymonthday' not in self._original_rule:
self._original_rule['bymonthday'] = tuple(
itertools.chain(self._bymonthday, self._bynmonthday))
# byweekno
if byweekno is None:
self._byweekno = None
else:
if isinstance(byweekno, integer_types):
byweekno = (byweekno,)
self._byweekno = tuple(sorted(set(byweekno)))
self._original_rule['byweekno'] = self._byweekno
# byweekday / bynweekday
if byweekday is None:
self._byweekday = None
self._bynweekday = None
else:
# If it's one of the valid non-sequence types, convert to a
# single-element sequence before the iterator that builds the
# byweekday set.
if isinstance(byweekday, integer_types) or hasattr(byweekday, "n"):
byweekday = (byweekday,)
self._byweekday = set()
self._bynweekday = set()
for wday in byweekday:
if isinstance(wday, integer_types):
self._byweekday.add(wday)
elif not wday.n or freq > MONTHLY:
self._byweekday.add(wday.weekday)
else:
self._bynweekday.add((wday.weekday, wday.n))
if not self._byweekday:
self._byweekday = None
elif not self._bynweekday:
self._bynweekday = None
if self._byweekday is not None:
self._byweekday = tuple(sorted(self._byweekday))
orig_byweekday = [weekday(x) for x in self._byweekday]
else:
orig_byweekday = tuple()
if self._bynweekday is not None:
self._bynweekday = tuple(sorted(self._bynweekday))
orig_bynweekday = [weekday(*x) for x in self._bynweekday]
else:
orig_bynweekday = tuple()
if 'byweekday' not in self._original_rule:
self._original_rule['byweekday'] = tuple(itertools.chain(
orig_byweekday, orig_bynweekday))
# byhour
if byhour is None:
if freq < HOURLY:
self._byhour = set((dtstart.hour,))
else:
self._byhour = None
else:
if isinstance(byhour, integer_types):
byhour = (byhour,)
if freq == HOURLY:
self._byhour = self.__construct_byset(start=dtstart.hour,
byxxx=byhour,
base=24)
else:
self._byhour = set(byhour)
self._byhour = tuple(sorted(self._byhour))
self._original_rule['byhour'] = self._byhour
# byminute
if byminute is None:
if freq < MINUTELY:
self._byminute = set((dtstart.minute,))
else:
self._byminute = None
else:
if isinstance(byminute, integer_types):
byminute = (byminute,)
if freq == MINUTELY:
self._byminute = self.__construct_byset(start=dtstart.minute,
byxxx=byminute,
base=60)
else:
self._byminute = set(byminute)
self._byminute = tuple(sorted(self._byminute))
self._original_rule['byminute'] = self._byminute
# bysecond
if bysecond is None:
if freq < SECONDLY:
self._bysecond = ((dtstart.second,))
else:
self._bysecond = None
else:
if isinstance(bysecond, integer_types):
bysecond = (bysecond,)
self._bysecond = set(bysecond)
if freq == SECONDLY:
self._bysecond = self.__construct_byset(start=dtstart.second,
byxxx=bysecond,
base=60)
else:
self._bysecond = set(bysecond)
self._bysecond = tuple(sorted(self._bysecond))
self._original_rule['bysecond'] = self._bysecond
if self._freq >= HOURLY:
self._timeset = None
else:
self._timeset = []
for hour in self._byhour:
for minute in self._byminute:
for second in self._bysecond:
self._timeset.append(
datetime.time(hour, minute, second,
tzinfo=self._tzinfo))
self._timeset.sort()
self._timeset = tuple(self._timeset)
def __str__(self):
"""
Output a string that would generate this RRULE if passed to rrulestr.
This is mostly compatible with RFC2445, except for the
dateutil-specific extension BYEASTER.
"""
output = []
h, m, s = [None] * 3
if self._dtstart:
output.append(self._dtstart.strftime('DTSTART:%Y%m%dT%H%M%S'))
h, m, s = self._dtstart.timetuple()[3:6]
parts = ['FREQ=' + FREQNAMES[self._freq]]
if self._interval != 1:
parts.append('INTERVAL=' + str(self._interval))
if self._wkst:
parts.append('WKST=' + repr(weekday(self._wkst))[0:2])
if self._count is not None:
parts.append('COUNT=' + str(self._count))
if self._until:
parts.append(self._until.strftime('UNTIL=%Y%m%dT%H%M%S'))
if self._original_rule.get('byweekday') is not None:
# The str() method on weekday objects doesn't generate
# RFC2445-compliant strings, so we should modify that.
original_rule = dict(self._original_rule)
wday_strings = []
for wday in original_rule['byweekday']:
if wday.n:
wday_strings.append('{n:+d}{wday}'.format(
n=wday.n,
wday=repr(wday)[0:2]))
else:
wday_strings.append(repr(wday))
original_rule['byweekday'] = wday_strings
else:
original_rule = self._original_rule
partfmt = '{name}={vals}'
for name, key in [('BYSETPOS', 'bysetpos'),
('BYMONTH', 'bymonth'),
('BYMONTHDAY', 'bymonthday'),
('BYYEARDAY', 'byyearday'),
('BYWEEKNO', 'byweekno'),
('BYDAY', 'byweekday'),
('BYHOUR', 'byhour'),
('BYMINUTE', 'byminute'),
('BYSECOND', 'bysecond'),
('BYEASTER', 'byeaster')]:
value = original_rule.get(key)
if value:
parts.append(partfmt.format(name=name, vals=(','.join(str(v)
for v in value))))
output.append(';'.join(parts))
return '\n'.join(output)
def replace(self, **kwargs):
"""Return new rrule with same attributes except for those attributes given new
values by whichever keyword arguments are specified."""
new_kwargs = {"interval": self._interval,
"count": self._count,
"dtstart": self._dtstart,
"freq": self._freq,
"until": self._until,
"wkst": self._wkst,
"cache": False if self._cache is None else True }
new_kwargs.update(self._original_rule)
new_kwargs.update(kwargs)
return rrule(**new_kwargs)
def _iter(self):
year, month, day, hour, minute, second, weekday, yearday, _ = \
self._dtstart.timetuple()
# Some local variables to speed things up a bit
freq = self._freq
interval = self._interval
wkst = self._wkst
until = self._until
bymonth = self._bymonth
byweekno = self._byweekno
byyearday = self._byyearday
byweekday = self._byweekday
byeaster = self._byeaster
bymonthday = self._bymonthday
bynmonthday = self._bynmonthday
bysetpos = self._bysetpos
byhour = self._byhour
byminute = self._byminute
bysecond = self._bysecond
ii = _iterinfo(self)
ii.rebuild(year, month)
getdayset = {YEARLY: ii.ydayset,
MONTHLY: ii.mdayset,
WEEKLY: ii.wdayset,
DAILY: ii.ddayset,
HOURLY: ii.ddayset,
MINUTELY: ii.ddayset,
SECONDLY: ii.ddayset}[freq]
if freq < HOURLY:
timeset = self._timeset
else:
gettimeset = {HOURLY: ii.htimeset,
MINUTELY: ii.mtimeset,
SECONDLY: ii.stimeset}[freq]
if ((freq >= HOURLY and
self._byhour and hour not in self._byhour) or
(freq >= MINUTELY and
self._byminute and minute not in self._byminute) or
(freq >= SECONDLY and
self._bysecond and second not in self._bysecond)):
timeset = ()
else:
timeset = gettimeset(hour, minute, second)
total = 0
count = self._count
while True:
# Get dayset with the right frequency
dayset, start, end = getdayset(year, month, day)
# Do the "hard" work ;-)
filtered = False
for i in dayset[start:end]:
if ((bymonth and ii.mmask[i] not in bymonth) or
(byweekno and not ii.wnomask[i]) or
(byweekday and ii.wdaymask[i] not in byweekday) or
(ii.nwdaymask and not ii.nwdaymask[i]) or
(byeaster and not ii.eastermask[i]) or
((bymonthday or bynmonthday) and
ii.mdaymask[i] not in bymonthday and
ii.nmdaymask[i] not in bynmonthday) or
(byyearday and
((i < ii.yearlen and i+1 not in byyearday and
-ii.yearlen+i not in byyearday) or
(i >= ii.yearlen and i+1-ii.yearlen not in byyearday and
-ii.nextyearlen+i-ii.yearlen not in byyearday)))):
dayset[i] = None
filtered = True
# Output results
if bysetpos and timeset:
poslist = []
for pos in bysetpos:
if pos < 0:
daypos, timepos = divmod(pos, len(timeset))
else:
daypos, timepos = divmod(pos-1, len(timeset))
try:
i = [x for x in dayset[start:end]
if x is not None][daypos]
time = timeset[timepos]
except IndexError:
pass
else:
date = datetime.date.fromordinal(ii.yearordinal+i)
res = datetime.datetime.combine(date, time)
if res not in poslist:
poslist.append(res)
poslist.sort()
for res in poslist:
if until and res > until:
self._len = total
return
elif res >= self._dtstart:
if count is not None:
count -= 1
if count < 0:
self._len = total
return
total += 1
yield res
else:
for i in dayset[start:end]:
if i is not None:
date = datetime.date.fromordinal(ii.yearordinal + i)
for time in timeset:
res = datetime.datetime.combine(date, time)
if until and res > until:
self._len = total
return
elif res >= self._dtstart:
if count is not None:
count -= 1
if count < 0:
self._len = total
return
total += 1
yield res
# Handle frequency and interval
fixday = False
if freq == YEARLY:
year += interval
if year > datetime.MAXYEAR:
self._len = total
return
ii.rebuild(year, month)
elif freq == MONTHLY:
month += interval
if month > 12:
div, mod = divmod(month, 12)
month = mod
year += div
if month == 0:
month = 12
year -= 1
if year > datetime.MAXYEAR:
self._len = total
return
ii.rebuild(year, month)
elif freq == WEEKLY:
if wkst > weekday:
day += -(weekday+1+(6-wkst))+self._interval*7
else:
day += -(weekday-wkst)+self._interval*7
weekday = wkst
fixday = True
elif freq == DAILY:
day += interval
fixday = True
elif freq == HOURLY:
if filtered:
# Jump to one iteration before next day
hour += ((23-hour)//interval)*interval
if byhour:
ndays, hour = self.__mod_distance(value=hour,
byxxx=self._byhour,
base=24)
else:
ndays, hour = divmod(hour+interval, 24)
if ndays:
day += ndays
fixday = True
timeset = gettimeset(hour, minute, second)
elif freq == MINUTELY:
if filtered:
# Jump to one iteration before next day
minute += ((1439-(hour*60+minute))//interval)*interval
valid = False
rep_rate = (24*60)
for j in range(rep_rate // gcd(interval, rep_rate)):
if byminute:
nhours, minute = \
self.__mod_distance(value=minute,
byxxx=self._byminute,
base=60)
else:
nhours, minute = divmod(minute+interval, 60)
div, hour = divmod(hour+nhours, 24)
if div:
day += div
fixday = True
filtered = False
if not byhour or hour in byhour:
valid = True
break
if not valid:
raise ValueError('Invalid combination of interval and ' +
'byhour resulting in empty rule.')
timeset = gettimeset(hour, minute, second)
elif freq == SECONDLY:
if filtered:
# Jump to one iteration before next day
second += (((86399 - (hour * 3600 + minute * 60 + second))
// interval) * interval)
rep_rate = (24 * 3600)
valid = False
for j in range(0, rep_rate // gcd(interval, rep_rate)):
if bysecond:
nminutes, second = \
self.__mod_distance(value=second,
byxxx=self._bysecond,
base=60)
else:
nminutes, second = divmod(second+interval, 60)
div, minute = divmod(minute+nminutes, 60)
if div:
hour += div
div, hour = divmod(hour, 24)
if div:
day += div
fixday = True
if ((not byhour or hour in byhour) and
(not byminute or minute in byminute) and
(not bysecond or second in bysecond)):
valid = True
break
if not valid:
raise ValueError('Invalid combination of interval, ' +
'byhour and byminute resulting in empty' +
' rule.')
timeset = gettimeset(hour, minute, second)
if fixday and day > 28:
daysinmonth = calendar.monthrange(year, month)[1]
if day > daysinmonth:
while day > daysinmonth:
day -= daysinmonth
month += 1
if month == 13:
month = 1
year += 1
if year > datetime.MAXYEAR:
self._len = total
return
daysinmonth = calendar.monthrange(year, month)[1]
ii.rebuild(year, month)
def __construct_byset(self, start, byxxx, base):
"""
If a `BYXXX` sequence is passed to the constructor at the same level as
`FREQ` (e.g. `FREQ=HOURLY,BYHOUR={2,4,7},INTERVAL=3`), there are some
specifications which cannot be reached given some starting conditions.
This occurs whenever the interval is not coprime with the base of a
given unit and the difference between the starting position and the
ending position is not coprime with the greatest common denominator
between the interval and the base. For example, with a FREQ of hourly
starting at 17:00 and an interval of 4, the only valid values for
BYHOUR would be {21, 1, 5, 9, 13, 17}, because 4 and 24 are not
coprime.
:param start:
Specifies the starting position.
:param byxxx:
An iterable containing the list of allowed values.
:param base:
The largest allowable value for the specified frequency (e.g.
24 hours, 60 minutes).
This does not preserve the type of the iterable, returning a set, since
the values should be unique and the order is irrelevant, this will
speed up later lookups.
In the event of an empty set, raises a :exception:`ValueError`, as this
results in an empty rrule.
"""
cset = set()
# Support a single byxxx value.
if isinstance(byxxx, integer_types):
byxxx = (byxxx, )
for num in byxxx:
i_gcd = gcd(self._interval, base)
# Use divmod rather than % because we need to wrap negative nums.
if i_gcd == 1 or divmod(num - start, i_gcd)[1] == 0:
cset.add(num)
if len(cset) == 0:
raise ValueError("Invalid rrule byxxx generates an empty set.")
return cset
def __mod_distance(self, value, byxxx, base):
"""
Calculates the next value in a sequence where the `FREQ` parameter is
specified along with a `BYXXX` parameter at the same "level"
(e.g. `HOURLY` specified with `BYHOUR`).
:param value:
The old value of the component.
:param byxxx:
The `BYXXX` set, which should have been generated by
`rrule._construct_byset`, or something else which checks that a
valid rule is present.
:param base:
The largest allowable value for the specified frequency (e.g.
24 hours, 60 minutes).
If a valid value is not found after `base` iterations (the maximum
number before the sequence would start to repeat), this raises a
:exception:`ValueError`, as no valid values were found.
This returns a tuple of `divmod(n*interval, base)`, where `n` is the
smallest number of `interval` repetitions until the next specified
value in `byxxx` is found.
"""
accumulator = 0
for ii in range(1, base + 1):
# Using divmod() over % to account for negative intervals
div, value = divmod(value + self._interval, base)
accumulator += div
if value in byxxx:
return (accumulator, value)
class _iterinfo(object):
__slots__ = ["rrule", "lastyear", "lastmonth",
"yearlen", "nextyearlen", "yearordinal", "yearweekday",
"mmask", "mrange", "mdaymask", "nmdaymask",
"wdaymask", "wnomask", "nwdaymask", "eastermask"]
def __init__(self, rrule):
for attr in self.__slots__:
setattr(self, attr, None)
self.rrule = rrule
def rebuild(self, year, month):
# Every mask is 7 days longer to handle cross-year weekly periods.
rr = self.rrule
if year != self.lastyear:
self.yearlen = 365 + calendar.isleap(year)
self.nextyearlen = 365 + calendar.isleap(year + 1)
firstyday = datetime.date(year, 1, 1)
self.yearordinal = firstyday.toordinal()
self.yearweekday = firstyday.weekday()
wday = datetime.date(year, 1, 1).weekday()
if self.yearlen == 365:
self.mmask = M365MASK
self.mdaymask = MDAY365MASK
self.nmdaymask = NMDAY365MASK
self.wdaymask = WDAYMASK[wday:]
self.mrange = M365RANGE
else:
self.mmask = M366MASK
self.mdaymask = MDAY366MASK
self.nmdaymask = NMDAY366MASK
self.wdaymask = WDAYMASK[wday:]
self.mrange = M366RANGE
if not rr._byweekno:
self.wnomask = None
else:
self.wnomask = [0]*(self.yearlen+7)
# no1wkst = firstwkst = self.wdaymask.index(rr._wkst)
no1wkst = firstwkst = (7-self.yearweekday+rr._wkst) % 7
if no1wkst >= 4:
no1wkst = 0
# Number of days in the year, plus the days we got
# from last year.
wyearlen = self.yearlen+(self.yearweekday-rr._wkst) % 7
else:
# Number of days in the year, minus the days we
# left in last year.
wyearlen = self.yearlen-no1wkst
div, mod = divmod(wyearlen, 7)
numweeks = div+mod//4
for n in rr._byweekno:
if n < 0:
n += numweeks+1
if not (0 < n <= numweeks):
continue
if n > 1:
i = no1wkst+(n-1)*7
if no1wkst != firstwkst:
i -= 7-firstwkst
else:
i = no1wkst
for j in range(7):
self.wnomask[i] = 1
i += 1
if self.wdaymask[i] == rr._wkst:
break
if 1 in rr._byweekno:
# Check week number 1 of next year as well
# TODO: Check -numweeks for next year.
i = no1wkst+numweeks*7
if no1wkst != firstwkst:
i -= 7-firstwkst
if i < self.yearlen:
# If week starts in next year, we
# don't care about it.
for j in range(7):
self.wnomask[i] = 1
i += 1
if self.wdaymask[i] == rr._wkst:
break
if no1wkst:
# Check last week number of last year as
# well. If no1wkst is 0, either the year
# started on week start, or week number 1
# got days from last year, so there are no
# days from last year's last week number in
# this year.
if -1 not in rr._byweekno:
lyearweekday = datetime.date(year-1, 1, 1).weekday()
lno1wkst = (7-lyearweekday+rr._wkst) % 7
lyearlen = 365+calendar.isleap(year-1)
if lno1wkst >= 4:
lno1wkst = 0
lnumweeks = 52+(lyearlen +
(lyearweekday-rr._wkst) % 7) % 7//4
else:
lnumweeks = 52+(self.yearlen-no1wkst) % 7//4
else:
lnumweeks = -1
if lnumweeks in rr._byweekno:
for i in range(no1wkst):
self.wnomask[i] = 1
if (rr._bynweekday and (month != self.lastmonth or
year != self.lastyear)):
ranges = []
if rr._freq == YEARLY:
if rr._bymonth:
for month in rr._bymonth:
ranges.append(self.mrange[month-1:month+1])
else:
ranges = [(0, self.yearlen)]
elif rr._freq == MONTHLY:
ranges = [self.mrange[month-1:month+1]]
if ranges:
# Weekly frequency won't get here, so we may not
# care about cross-year weekly periods.
self.nwdaymask = [0]*self.yearlen
for first, last in ranges:
last -= 1
for wday, n in rr._bynweekday:
if n < 0:
i = last+(n+1)*7
i -= (self.wdaymask[i]-wday) % 7
else:
i = first+(n-1)*7
i += (7-self.wdaymask[i]+wday) % 7
if first <= i <= last:
self.nwdaymask[i] = 1
if rr._byeaster:
self.eastermask = [0]*(self.yearlen+7)
eyday = easter.easter(year).toordinal()-self.yearordinal
for offset in rr._byeaster:
self.eastermask[eyday+offset] = 1
self.lastyear = year
self.lastmonth = month
def ydayset(self, year, month, day):
return list(range(self.yearlen)), 0, self.yearlen
def mdayset(self, year, month, day):
dset = [None]*self.yearlen
start, end = self.mrange[month-1:month+1]
for i in range(start, end):
dset[i] = i
return dset, start, end
def wdayset(self, year, month, day):
# We need to handle cross-year weeks here.
dset = [None]*(self.yearlen+7)
i = datetime.date(year, month, day).toordinal()-self.yearordinal
start = i
for j in range(7):
dset[i] = i
i += 1
# if (not (0 <= i < self.yearlen) or
# self.wdaymask[i] == self.rrule._wkst):
# This will cross the year boundary, if necessary.
if self.wdaymask[i] == self.rrule._wkst:
break
return dset, start, i
def ddayset(self, year, month, day):
dset = [None] * self.yearlen
i = datetime.date(year, month, day).toordinal() - self.yearordinal
dset[i] = i
return dset, i, i + 1
def htimeset(self, hour, minute, second):
tset = []
rr = self.rrule
for minute in rr._byminute:
for second in rr._bysecond:
tset.append(datetime.time(hour, minute, second,
tzinfo=rr._tzinfo))
tset.sort()
return tset
def mtimeset(self, hour, minute, second):
tset = []
rr = self.rrule
for second in rr._bysecond:
tset.append(datetime.time(hour, minute, second, tzinfo=rr._tzinfo))
tset.sort()
return tset
def stimeset(self, hour, minute, second):
return (datetime.time(hour, minute, second,
tzinfo=self.rrule._tzinfo),)
class rruleset(rrulebase):
""" The rruleset type allows more complex recurrence setups, mixing
multiple rules, dates, exclusion rules, and exclusion dates. The type
constructor takes the following keyword arguments:
:param cache: If True, caching of results will be enabled, improving
performance of multiple queries considerably. """
class _genitem(object):
def __init__(self, genlist, gen):
try:
self.dt = advance_iterator(gen)
genlist.append(self)
except StopIteration:
pass
self.genlist = genlist
self.gen = gen
def __next__(self):
try:
self.dt = advance_iterator(self.gen)
except StopIteration:
if self.genlist[0] is self:
heapq.heappop(self.genlist)
else:
self.genlist.remove(self)
heapq.heapify(self.genlist)
next = __next__
def __lt__(self, other):
return self.dt < other.dt
def __gt__(self, other):
return self.dt > other.dt
def __eq__(self, other):
return self.dt == other.dt
def __ne__(self, other):
return self.dt != other.dt
def __init__(self, cache=False):
super(rruleset, self).__init__(cache)
self._rrule = []
self._rdate = []
self._exrule = []
self._exdate = []
@_invalidates_cache
def rrule(self, rrule):
""" Include the given :py:class:`rrule` instance in the recurrence set
generation. """
self._rrule.append(rrule)
@_invalidates_cache
def rdate(self, rdate):
""" Include the given :py:class:`datetime` instance in the recurrence
set generation. """
self._rdate.append(rdate)
@_invalidates_cache
def exrule(self, exrule):
""" Include the given rrule instance in the recurrence set exclusion
list. Dates which are part of the given recurrence rules will not
be generated, even if some inclusive rrule or rdate matches them.
"""
self._exrule.append(exrule)
@_invalidates_cache
def exdate(self, exdate):
""" Include the given datetime instance in the recurrence set
exclusion list. Dates included that way will not be generated,
even if some inclusive rrule or rdate matches them. """
self._exdate.append(exdate)
def _iter(self):
rlist = []
self._rdate.sort()
self._genitem(rlist, iter(self._rdate))
for gen in [iter(x) for x in self._rrule]:
self._genitem(rlist, gen)
exlist = []
self._exdate.sort()
self._genitem(exlist, iter(self._exdate))
for gen in [iter(x) for x in self._exrule]:
self._genitem(exlist, gen)
lastdt = None
total = 0
heapq.heapify(rlist)
heapq.heapify(exlist)
while rlist:
ritem = rlist[0]
if not lastdt or lastdt != ritem.dt:
while exlist and exlist[0] < ritem:
exitem = exlist[0]
advance_iterator(exitem)
if exlist and exlist[0] is exitem:
heapq.heapreplace(exlist, exitem)
if not exlist or ritem != exlist[0]:
total += 1
yield ritem.dt
lastdt = ritem.dt
advance_iterator(ritem)
if rlist and rlist[0] is ritem:
heapq.heapreplace(rlist, ritem)
self._len = total
class _rrulestr(object):
_freq_map = {"YEARLY": YEARLY,
"MONTHLY": MONTHLY,
"WEEKLY": WEEKLY,
"DAILY": DAILY,
"HOURLY": HOURLY,
"MINUTELY": MINUTELY,
"SECONDLY": SECONDLY}
_weekday_map = {"MO": 0, "TU": 1, "WE": 2, "TH": 3,
"FR": 4, "SA": 5, "SU": 6}
def _handle_int(self, rrkwargs, name, value, **kwargs):
rrkwargs[name.lower()] = int(value)
def _handle_int_list(self, rrkwargs, name, value, **kwargs):
rrkwargs[name.lower()] = [int(x) for x in value.split(',')]
_handle_INTERVAL = _handle_int
_handle_COUNT = _handle_int
_handle_BYSETPOS = _handle_int_list
_handle_BYMONTH = _handle_int_list
_handle_BYMONTHDAY = _handle_int_list
_handle_BYYEARDAY = _handle_int_list
_handle_BYEASTER = _handle_int_list
_handle_BYWEEKNO = _handle_int_list
_handle_BYHOUR = _handle_int_list
_handle_BYMINUTE = _handle_int_list
_handle_BYSECOND = _handle_int_list
def _handle_FREQ(self, rrkwargs, name, value, **kwargs):
rrkwargs["freq"] = self._freq_map[value]
def _handle_UNTIL(self, rrkwargs, name, value, **kwargs):
global parser
if not parser:
from dateutil import parser
try:
rrkwargs["until"] = parser.parse(value,
ignoretz=kwargs.get("ignoretz"),
tzinfos=kwargs.get("tzinfos"))
except ValueError:
raise ValueError("invalid until date")
def _handle_WKST(self, rrkwargs, name, value, **kwargs):
rrkwargs["wkst"] = self._weekday_map[value]
def _handle_BYWEEKDAY(self, rrkwargs, name, value, **kwargs):
"""
Two ways to specify this: +1MO or MO(+1)
"""
l = []
for wday in value.split(','):
if '(' in wday:
# If it's of the form TH(+1), etc.
splt = wday.split('(')
w = splt[0]
n = int(splt[1][:-1])
elif len(wday):
# If it's of the form +1MO
for i in range(len(wday)):
if wday[i] not in '+-0123456789':
break
n = wday[:i] or None
w = wday[i:]
if n:
n = int(n)
else:
raise ValueError("Invalid (empty) BYDAY specification.")
l.append(weekdays[self._weekday_map[w]](n))
rrkwargs["byweekday"] = l
_handle_BYDAY = _handle_BYWEEKDAY
def _parse_rfc_rrule(self, line,
dtstart=None,
cache=False,
ignoretz=False,
tzinfos=None):
if line.find(':') != -1:
name, value = line.split(':')
if name != "RRULE":
raise ValueError("unknown parameter name")
else:
value = line
rrkwargs = {}
for pair in value.split(';'):
name, value = pair.split('=')
name = name.upper()
value = value.upper()
try:
getattr(self, "_handle_"+name)(rrkwargs, name, value,
ignoretz=ignoretz,
tzinfos=tzinfos)
except AttributeError:
raise ValueError("unknown parameter '%s'" % name)
except (KeyError, ValueError):
raise ValueError("invalid '%s': %s" % (name, value))
return rrule(dtstart=dtstart, cache=cache, **rrkwargs)
def _parse_rfc(self, s,
dtstart=None,
cache=False,
unfold=False,
forceset=False,
compatible=False,
ignoretz=False,
tzinfos=None):
global parser
if compatible:
forceset = True
unfold = True
s = s.upper()
if not s.strip():
raise ValueError("empty string")
if unfold:
lines = s.splitlines()
i = 0
while i < len(lines):
line = lines[i].rstrip()
if not line:
del lines[i]
elif i > 0 and line[0] == " ":
lines[i-1] += line[1:]
del lines[i]
else:
i += 1
else:
lines = s.split()
if (not forceset and len(lines) == 1 and (s.find(':') == -1 or
s.startswith('RRULE:'))):
return self._parse_rfc_rrule(lines[0], cache=cache,
dtstart=dtstart, ignoretz=ignoretz,
tzinfos=tzinfos)
else:
rrulevals = []
rdatevals = []
exrulevals = []
exdatevals = []
for line in lines:
if not line:
continue
if line.find(':') == -1:
name = "RRULE"
value = line
else:
name, value = line.split(':', 1)
parms = name.split(';')
if not parms:
raise ValueError("empty property name")
name = parms[0]
parms = parms[1:]
if name == "RRULE":
for parm in parms:
raise ValueError("unsupported RRULE parm: "+parm)
rrulevals.append(value)
elif name == "RDATE":
for parm in parms:
if parm != "VALUE=DATE-TIME":
raise ValueError("unsupported RDATE parm: "+parm)
rdatevals.append(value)
elif name == "EXRULE":
for parm in parms:
raise ValueError("unsupported EXRULE parm: "+parm)
exrulevals.append(value)
elif name == "EXDATE":
for parm in parms:
if parm != "VALUE=DATE-TIME":
raise ValueError("unsupported EXDATE parm: "+parm)
exdatevals.append(value)
elif name == "DTSTART":
for parm in parms:
raise ValueError("unsupported DTSTART parm: "+parm)
if not parser:
from dateutil import parser
dtstart = parser.parse(value, ignoretz=ignoretz,
tzinfos=tzinfos)
else:
raise ValueError("unsupported property: "+name)
if (forceset or len(rrulevals) > 1 or rdatevals
or exrulevals or exdatevals):
if not parser and (rdatevals or exdatevals):
from dateutil import parser
rset = rruleset(cache=cache)
for value in rrulevals:
rset.rrule(self._parse_rfc_rrule(value, dtstart=dtstart,
ignoretz=ignoretz,
tzinfos=tzinfos))
for value in rdatevals:
for datestr in value.split(','):
rset.rdate(parser.parse(datestr,
ignoretz=ignoretz,
tzinfos=tzinfos))
for value in exrulevals:
rset.exrule(self._parse_rfc_rrule(value, dtstart=dtstart,
ignoretz=ignoretz,
tzinfos=tzinfos))
for value in exdatevals:
for datestr in value.split(','):
rset.exdate(parser.parse(datestr,
ignoretz=ignoretz,
tzinfos=tzinfos))
if compatible and dtstart:
rset.rdate(dtstart)
return rset
else:
return self._parse_rfc_rrule(rrulevals[0],
dtstart=dtstart,
cache=cache,
ignoretz=ignoretz,
tzinfos=tzinfos)
def __call__(self, s, **kwargs):
return self._parse_rfc(s, **kwargs)
rrulestr = _rrulestr()
# vim:ts=4:sw=4:et
dateutil/__pycache__/rrule.cpython-36.pyc 0000644 00000117164 14751155147 0014372 0 ustar 00 3
6�cY�� � @ sJ d Z ddlZddlZddlZddlZyddlmZ W n ek
rT ddlmZ Y nX ddl m
Z
m Z ddl m
Z
mZ ddlZddlmZ ddlmZ d d
d d d
ddddddddddddgZedgd dgd d gd d gd d gd d!gd d"gd d#gd d$gd d%gd d&gd d'gd dgd" �Zee�Zeedd ��eedd��eedd(�� ZZZ ee e e e e e e e e e e e e dd"� �Z ee �Z eedNd��eedOd��eedPd�� ZZZ ee e e e e e e e e e e e e dd"� �Z ee �Z dQZ!dRZ"dddd d d d!gd? Z#[[[ ed4= e d4= e d= ee �Z ee�Zd d
dddddgZ$eed"��\Z%Z&Z'Z(Z)Z*Z+da,da-G d@dA� dAe�ZedBdC� ed"�D �� \Z.Z/Z0Z1Z2Z3Z4Z5dDdE� Z6G dFdG� dGe7�Z8G dHd � d e8�Z9G dIdJ� dJe7�Z:G dKd
� d
e8�Z;G dLdM� dMe7�Z<e<� Z=dS )Sz�
The rrule module offers a small, complete, and very fast, implementation of
the recurrence rules documented in the
`iCalendar RFC <http://www.ietf.org/rfc/rfc2445.txt>`_,
including support for caching of results.
� N)�gcd)�advance_iterator�
integer_types)�_thread�range� )�weekday)�warn�rrule�rruleset�rrulestr�YEARLY�MONTHLY�WEEKLY�DAILY�HOURLY�MINUTELY�SECONDLY�MO�TU�WE�TH�FR�SA�SU� � � � � � � � � � � �
� � � �< �[ �y � � �� �� � �1 �O �n �; �Z �x � � �� �� � �0 �N �m �7 c s" e Zd ZdZd� fdd� Z� ZS )r z7
This version of weekday does not allow n = 0.
Nc s& |dkrt d��tt| �j||� d S )Nr z Can't create weekday with n==0)�
ValueError�superr �__init__)�selfZwkday�n)� __class__� �/usr/lib/python3.6/rrule.pyrC D s zweekday.__init__)N)�__name__�
__module__� __qualname__�__doc__rC �
__classcell__rG rG )rF rH r @ s r c c s | ]}t |�V qd S )N)r )�.0�xrG rG rH � <genexpr>K s rP c s � fdd�}|S )zT
Decorator for rruleset methods which may invalidate the
cached length.
c s � | f|�|�}| j � |S )N)�_invalidate_cache)rD �args�kwargs�rv)�frG rH �
inner_funcS s z&_invalidates_cache.<locals>.inner_funcrG )rU rV rG )rU rH �_invalidates_cacheN s rW c @ sn e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z ddd�Z
d dd�Z d dd�Z d dd�Z
dS ) � rrulebaseFc C s4 |r g | _ tj� | _| j� nd | _ d| _d | _d S )NF)�_cacher �
allocate_lock� _cache_lockrQ �_cache_complete�_len)rD �cacherG rG rH rC \ s
zrrulebase.__init__c C s. | j rt| j�S | jd kr"| j� S | j� S d S )N)r\ �iterrY �_iter� _iter_cached)rD rG rG rH �__iter__f s
zrrulebase.__iter__c C s> | j d k r4g | _ d| _| j� | _| jj� r4| jj� d | _d S )NF)rY r\ r` �
_cache_genr[ �locked�releaser] )rD rG rG rH rQ n s
zrrulebase._invalidate_cachec c s� d}| j }| j}| jj}| jj}x�|r�|t|�kr�|� | jr@P y$x td�D ]}|jt |�� qLW W n& t
k
r� d | _ }d| _P Y nX |� || V |d7 }q"W x || j k r�|| V |d7 }q�W d S )Nr r& Tr ) rc rY r[ �acquirere �lenr\ r �appendr �
StopIterationr] )rD �i�genr^ rf re �jrG rG rH ra y s.
zrrulebase._iter_cachedc C s� | j r| j| S t|t�rd|jr:|jdk r:tt| ��| S ttj| |j pJd|j
pTt j |jp\d��S n`|dkr�t| �}y"x t
|d �D ] }t|�}q�W W n tk
r� t�Y nX |S tt| ��| S d S )Nr r )r\ rY �
isinstance�slice�step�listr_ � itertools�islice�start�stop�sys�maxsizer r ri �
IndexError)rD �itemrk rj �resrG rG rH � __getitem__� s$
zrrulebase.__getitem__c C s: | j r|| jkS x$| D ] }||kr&dS ||krdS qW dS )NTF)r\ rY )rD rx rj rG rG rH � __contains__� s
zrrulebase.__contains__c C s | j dkrx | D ]}qW | j S )z� Returns the number of recurrences in this set. It will have go
trough the whole recurrence, if this hasn't been done before. N)r] )rD rO rG rG rH �count� s
zrrulebase.countc C sX | j r| j}n| }d}|r8x8|D ]}||kr.P |}q W n x|D ]}||krLP |}q>W |S )z� Returns the last recurrence before the given datetime instance. The
inc keyword defines what happens if dt is an occurrence. With
inc=True, if dt itself is an occurrence, it will be returned. N)r\ rY )rD �dt�incrk �lastrj rG rG rH �before� s
zrrulebase.beforec C sP | j r| j}n| }|r2x4|D ]}||kr |S q W nx|D ]}||kr8|S q8W dS )z� Returns the first recurrence after the given datetime instance. The
inc keyword defines what happens if dt is an occurrence. With
inc=True, if dt itself is an occurrence, it will be returned. N)r\ rY )rD r} r~ rk rj rG rG rH �after� s
zrrulebase.afterNc c sh | j r| j}n| }|r dd� }ndd� }d}x6|D ].}|||�r2|dk rZ|d7 }||krZP |V q2W dS )aH
Generator which yields up to `count` recurrences after the given
datetime instance, equivalent to `after`.
:param dt:
The datetime at which to start generating recurrences.
:param count:
The maximum number of recurrences to generate. If `None` (default),
dates are generated until the recurrence rule is exhausted.
:param inc:
If `dt` is an instance of the rule and `inc` is `True`, it is
included in the output.
:yields: Yields a sequence of `datetime` objects.
c S s | |kS )NrG )�dc�dtcrG rG rH �<lambda>� s z"rrulebase.xafter.<locals>.<lambda>c S s | |kS )NrG )r� r� rG rG rH r� � s r Nr )r\ rY )rD r} r| r~ rk �comprE �drG rG rH �xafter� s
zrrulebase.xafterr c C s� | j r| j}n| }d}g }|r`x�|D ]6}||kr4P q$|sP||krZd}|j|� q$|j|� q$W n@x>|D ]6}||krvP qf|s�||kr�d}|j|� qf|j|� qfW |S )a Returns all the occurrences of the rrule between after and before.
The inc keyword defines what happens if after and/or before are
themselves occurrences. With inc=True, they will be included in the
list, if they are found in the recurrence set. FT)r\ rY rh ) rD r� r� r~ r| rk Zstarted�lrj rG rG rH �between s.
zrrulebase.between)F)F)F)NF)Fr )rI rJ rK rC rb rQ ra rz r{ r| r� r� r� r� rG rG rG rH rX [ s
)rX c sJ e Zd ZdZd� fdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z � Z
S )r
a|
That's the base of the rrule operation. It accepts all the keywords
defined in the RFC as its constructor parameters (except byday,
which was renamed to byweekday) and more. The constructor prototype is::
rrule(freq)
Where freq must be one of YEARLY, MONTHLY, WEEKLY, DAILY, HOURLY, MINUTELY,
or SECONDLY.
.. note::
Per RFC section 3.3.10, recurrence instances falling on invalid dates
and times are ignored rather than coerced:
Recurrence rules may generate recurrence instances with an invalid
date (e.g., February 30) or nonexistent local time (e.g., 1:30 AM
on a day where the local time is moved forward by an hour at 1:00
AM). Such recurrence instances MUST be ignored and MUST NOT be
counted as part of the recurrence set.
This can lead to possibly surprising behavior when, for example, the
start date occurs at the end of the month:
>>> from dateutil.rrule import rrule, MONTHLY
>>> from datetime import datetime
>>> start_date = datetime(2014, 12, 31)
>>> list(rrule(freq=MONTHLY, count=4, dtstart=start_date))
... # doctest: +NORMALIZE_WHITESPACE
[datetime.datetime(2014, 12, 31, 0, 0),
datetime.datetime(2015, 1, 31, 0, 0),
datetime.datetime(2015, 3, 31, 0, 0),
datetime.datetime(2015, 5, 31, 0, 0)]
Additionally, it supports the following keyword arguments:
:param cache:
If given, it must be a boolean value specifying to enable or disable
caching of results. If you will use the same rrule instance multiple
times, enabling caching will improve the performance considerably.
:param dtstart:
The recurrence start. Besides being the base for the recurrence,
missing parameters in the final recurrence instances will also be
extracted from this date. If not given, datetime.now() will be used
instead.
:param interval:
The interval between each freq iteration. For example, when using
YEARLY, an interval of 2 means once every two years, but with HOURLY,
it means once every two hours. The default interval is 1.
:param wkst:
The week start day. Must be one of the MO, TU, WE constants, or an
integer, specifying the first day of the week. This will affect
recurrences based on weekly periods. The default week start is got
from calendar.firstweekday(), and may be modified by
calendar.setfirstweekday().
:param count:
How many occurrences will be generated.
.. note::
As of version 2.5.0, the use of the ``until`` keyword together
with the ``count`` keyword is deprecated per RFC-2445 Sec. 4.3.10.
:param until:
If given, this must be a datetime instance, that will specify the
limit of the recurrence. The last recurrence in the rule is the greatest
datetime that is less than or equal to the value specified in the
``until`` parameter.
.. note::
As of version 2.5.0, the use of the ``until`` keyword together
with the ``count`` keyword is deprecated per RFC-2445 Sec. 4.3.10.
:param bysetpos:
If given, it must be either an integer, or a sequence of integers,
positive or negative. Each given integer will specify an occurrence
number, corresponding to the nth occurrence of the rule inside the
frequency period. For example, a bysetpos of -1 if combined with a
MONTHLY frequency, and a byweekday of (MO, TU, WE, TH, FR), will
result in the last work day of every month.
:param bymonth:
If given, it must be either an integer, or a sequence of integers,
meaning the months to apply the recurrence to.
:param bymonthday:
If given, it must be either an integer, or a sequence of integers,
meaning the month days to apply the recurrence to.
:param byyearday:
If given, it must be either an integer, or a sequence of integers,
meaning the year days to apply the recurrence to.
:param byweekno:
If given, it must be either an integer, or a sequence of integers,
meaning the week numbers to apply the recurrence to. Week numbers
have the meaning described in ISO8601, that is, the first week of
the year is that containing at least four days of the new year.
:param byweekday:
If given, it must be either an integer (0 == MO), a sequence of
integers, one of the weekday constants (MO, TU, etc), or a sequence
of these constants. When given, these variables will define the
weekdays where the recurrence will be applied. It's also possible to
use an argument n for the weekday instances, which will mean the nth
occurrence of this weekday in the period. For example, with MONTHLY,
or with YEARLY and BYMONTH, using FR(+1) in byweekday will specify the
first friday of the month where the recurrence happens. Notice that in
the RFC documentation, this is specified as BYDAY, but was renamed to
avoid the ambiguity of that keyword.
:param byhour:
If given, it must be either an integer, or a sequence of integers,
meaning the hours to apply the recurrence to.
:param byminute:
If given, it must be either an integer, or a sequence of integers,
meaning the minutes to apply the recurrence to.
:param bysecond:
If given, it must be either an integer, or a sequence of integers,
meaning the seconds to apply the recurrence to.
:param byeaster:
If given, it must be either an integer, or a sequence of integers,
positive or negative. Each integer will define an offset from the
Easter Sunday. Passing the offset 0 to byeaster will yield the Easter
Sunday itself. This is an extension to the RFC specification.
Nr Fc
sR t t| �j|� |s(tjj� jdd�}n*t|tj�sFtjj|j� �}n |jdd�}|| _ |j
| _ || _ || _
|| _i | _|r�t|tj� r�tjj|j� �}|| _|d k r�|r�tdt� |d kr�tj� | _nt|t�r�|| _n|j| _|d kr�d | _n�t|t��r:|dk�s(d | k�o dkn �r0td��|f| _nLt|�| _x@| jD ]6}|dk�sxd | k�ondkn �rLtd���qLW | j�r�| j| jd< | d k�r:|
d k�r:| d k�r:|
d k�r:| d k�r:|tk�r|d k�r�|j }d | jd< |j } d | jd< n8|t k�r |j } d | jd< n |t k�r:|j� }
d | jd < |d k�rLd | _ n<t|t��r^|f}tt!t"|���| _ d| jk�r�| j | jd< |
d k�r�d | _#n0t|
t��r�|
f}
tt!t"|
���| _#| j#| jd
< | d k �rt$�s�dd l%m$a$ t| t��r�| f| _&ntt!| ��| _&| j&| jd < nd | _&| d k�r6f | _'f | _(npt| t��rH| f} t"| �} tt!d
d� | D ���| _'tt!dd� | D ���| _(d| jk�r�tt)j*| j'| j(��| jd< | d k�r�d | _+n0t| t��r�| f} tt!t"| ���| _+| j+| jd< |
d k�rd | _,d | _-�n8t|
t��st.|
d��r |
f}
t"� | _,t"� | _-x`|
D ]X}t|t��rT| j,j/|� n8|j0 �sh|t k�rx| j,j/|j� n| j-j/|j|j0f� �q6W | j,�s�d | _,n| j-�s�d | _-| j,d k �r�tt!| j,��| _,dd� | j,D �}nt� }| j-d k �rtt!| j-��| _-dd� | j-D �}nt� }d | jk�r:tt)j*||��| jd < |d k�rf|t1k �r^t"|j2f�| _3nd | _3nXt|t��rx|f}|t1k�r�| j4|j2|dd�| _3n
t"|�| _3tt!| j3��| _3| j3| jd< |d k�r�|t5k �r�t"|j6f�| _7nd | _7nXt|t��r�|f}|t5k�r | j4|j6|dd�| _7n
t"|�| _7tt!| j7��| _7| j7| jd< |d k�rj|t8k �rb|j9f| _:nd | _:nbt|t��r||f}t"|�| _:|t8k�r�| j4|j9|dd�| _:n
t"|�| _:tt!| j:��| _:| j:| jd< | j t1k�r�d | _;nng | _;xP| j3D ]F}x>| j7D ]4}x,| j:D ]"}| j;j<tj=|||| j d�� �qW �q�W �q�W | j;j>� t| j;�| _;d S ) Nr )Z microsecondz�Using both 'count' and 'until' is inconsistent with RFC 2445 and has been deprecated in dateutil. Future versions will raise an error.in z:bysetpos must be between 1 and 366, or between -366 and -1�bysetpos�bymonth�
bymonthday� byweekday� byyearday)�easter�byeasterc s s | ]}|d kr|V qdS )r NrG )rN rO rG rG rH rP s z!rrule.__init__.<locals>.<genexpr>c s s | ]}|d k r|V qdS )r NrG )rN rO rG rG rH rP s �byweeknorE c S s g | ] }t |��qS rG )r )rN rO rG rG rH �
<listcomp>I s z"rrule.__init__.<locals>.<listcomp>c S s g | ] }t |� �qS rG )r )rN rO rG rG rH r� O s � )rs �byxxx�base�byhourr* �byminute�bysecond)�tzinfoi����i����)?rB r
rC �datetimeZnow�replacerm � fromordinal� toordinal�_dtstartr� �_tzinfo�_freq� _interval�_count�_original_rule�_untilr �DeprecationWarning�calendarZ firstweekday�_wkstr r � _bysetposrA �tupler
�month�dayr r �_bymonth�sorted�set�
_byyeardayr� �dateutil� _byeaster� _bymonthday� _bynmonthdayrq �chain� _byweekno�
_byweekday� _bynweekday�hasattr�addrE r �hour�_byhour�_rrule__construct_bysetr �minute� _byminuter �second� _bysecond�_timesetrh �time�sort)rD �freq�dtstart�interval�wkstr| �untilr� r� r� r� r� r� r� r� r� r� r^ �pos�wdayZorig_byweekdayZorig_bynweekdayr� r� r� )rF rG rH rC � sL
(
(
zrrule.__init__c
C s� g }dgd \}}}| j rD|j| j jd�� | j j� dd� \}}}dt| j g}| jdkrr|jdt| j� � | jr�|jdt t
| j��d d
� � | j dk r�|jd t| j � � | j r�|j| j jd �� | j
jd
�dk �rDt| j
�}g }xJ|d
D ]>}|j�r(|jdj|jt |�d d
� d�� q�|jt |�� q�W ||d
< n| j
}d} xFd4D ]>\}
} |j| �} | �rT|j| j|
d$jd%d&� | D ��d'�� �qTW |jd(j|�� d)j|�S )5z�
Output a string that would generate this RRULE if passed to rrulestr.
This is mostly compatible with RFC2445, except for the
dateutil-specific extension BYEASTER.
Nr zDTSTART:%Y%m%dT%H%M%Sr" zFREQ=r z INTERVAL=zWKST=r r zCOUNT=zUNTIL=%Y%m%dT%H%M%Sr� z {n:+d}{wday})rE r� z
{name}={vals}�BYSETPOSr� �BYMONTHr� �
BYMONTHDAYr� � BYYEARDAYr� �BYWEEKNOr� �BYDAY�BYHOURr� �BYMINUTEr� �BYSECONDr� �BYEASTERr� �,c s s | ]}t |�V qd S )N)�str)rN �vrG rG rH rP � s z rrule.__str__.<locals>.<genexpr>)�name�vals�;�
�r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� )
r� r� r� r� r� r� r� r� r� r� )r� rh Zstrftime� timetuple� FREQNAMESr� r� r� r� �reprr r� r� r� �get�dictrE �format�join)
rD �output�h�m�s�partsZ
original_ruleZ wday_stringsr� Zpartfmtr� �key�valuerG rG rH �__str__� sT
z
rrule.__str__c K sN | j | j| j| j| j| j| jdkr&dndd�}|j| j� |j|� t f |�S )z�Return new rrule with same attributes except for those attributes given new
values by whichever keyword arguments are specified.NFT)r� r| r� r� r� r� r^ )
r� r� r� r� r� r� rY �updater� r
)rD rS Z
new_kwargsrG rG rH r� � s
z
rrule.replacec 5 c s� | j j� \ }}}}}}}}} | j}
| j} | j} | j}
| j}| j}| j}| j }| j
}| j }| j }| j
}| j}| j}| j}t| �}|j||� t|jt|jt|jt|jt|jt |jt |ji|
}|
tk r�| j }n�t|j t |j t |j!i|
} |
tko�| jo�|| jk�s<|
t k�r | j�r || jk�s<|
t k�rB| j�rB|| jk�rBf }n | |||�}d} | j"} �xX||||�\} } }!d}"�x$| | |!� D �]}#|�r�|j#|# |k�s�|�r�|j$|# �s�|�r�|j%|# |k�s�|j&�r�|j&|# �s�|�r�|j'|# �s�|�s�|�r |j(|# |k�r |j)|# |k�s�|�r�|#|j*k �rP|#d |k�rP|j* |# |k�s�|#|j*k�r�|#d |j* |k�r�|j+ |# |j* |k�r�d | |#< d}"�q�W |�r�|�r�g }$x�|D ]�}%|%dk �r�t,|%t-|��\}&}'nt,|%d t-|��\}&}'y&dd� | | |!� D �|& }#||' }(W n t.k
�r$ Y n6X t/j0j1|j2|# �})t/j/j3|)|(�}*|*|$k�r�|$j4|*� �q�W |$j5� xh|$D ]`}*|
�r�|*|
k�r�| | _6d S |*| j k�rn| d k �r�| d8 } | dk �r�| | _6d S | d7 } |*V �qnW n�x�| | |!� D ]�}#|#d k �r�t/j0j1|j2|# �})xv|D ]n}(t/j/j3|)|(�}*|
�r4|*|
k�r4| | _6d S |*| j k�r| d k �rf| d8 } | dk �rf| | _6d S | d7 } |*V �qW �q�W d}+|
tk�r�|| 7 }|t/j7k�r�| | _6d S |j||� �n^|
tk�r.|| 7 }|dk�r t,|d�\},}-|-}||,7 }|dk�rd}|d8 }|t/j7k�r | | _6d S |j||� �n�|
tk�r�| |k�rd||d d| | jd 7 }n||| | jd 7 }| }d}+�n�|
tk�r�|| 7 }d}+�nx|
tk�r|"�r�|d
| | | 7 }|�r�| j8|| jd d �\}.}nt,|| d �\}.}|.�r||.7 }d}+| |||�}�n|
t k�r�|"�rD|d
|d | | | 7 }d}/d}0x�t9|0t:| |0� �D ]v}1|�r�| j8|| jdd �\}2}nt,|| d�\}2}t,||2 d �\},}|,�r�||,7 }d}+d}"| �s�||k�r`d}/P �q`W |/�s�t;d��| |||�}�n"|
t k�r|"�r,|d|d |d | | | 7 }d}0d}/x�t9d|0t:| |0� �D ]�}1|�rl| j8|| jdd �\}3}nt,|| d�\}3}t,||3 d�\},}|,�r�||,7 }t,|d �\},}|,�r�||,7 }d}+| �s�||k�rJ| �s�||k�rJ| �s�||k�rJd}/P �qJW |/�st;d ��| |||�}|+�r\|dk�r\t<j=||�d }4||4k�r\x\||4k�r�||48 }|d7 }|dk�r�d}|d7 }|t/j7k�r�| | _6d S t<j=||�d }4�qFW |j||� �q\W d S ) Nr Fr Tc S s g | ]}|d k r|�qS )NrG )rN rO rG rG rH r� @ s z rrule._iter.<locals>.<listcomp>r( r" r# � r� )r� r� r� i� r* z$Invalid combination of interval and z byhour resulting in empty rule.iQ i z!Invalid combination of interval, z&byhour and byminute resulting in emptyz rule.� �
i� zCInvalid combination of interval and byhour resulting in empty rule.i�Q zGInvalid combination of interval, byhour and byminute resulting in emptyzMInvalid combination of interval, byhour and byminute resulting in empty rule.)>r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� � _iterinfo�rebuildr
�ydaysetr �mdaysetr �wdaysetr �ddaysetr r r r� �htimeset�mtimeset�stimesetr� �mmask�wnomask�wdaymask� nwdaymask�
eastermask�mdaymask� nmdaymask�yearlen� nextyearlen�divmodrg rw r� �dater� � yearordinalZcombinerh r� r] ZMAXYEAR�_rrule__mod_distancer r rA r� Z
monthrange)5rD �yearr� r� r� r� r� r Zyearday�_r� r� r� r� r� r� r� r� r� r� Z bynmonthdayr� r� r� r� �iiZ getdaysetZtimesetZ
gettimeset�totalr| Zdaysetrs �endZfilteredrj Zposlistr� ZdayposZtimeposr� r ry Zfixday�div�modZndaysZvalidZrep_raterl ZnhoursZnminutesZ daysinmonthrG rG rH r` � s�
"
z rrule._iterc C sp t � }t|t�r|f}x@|D ]8}t| j|�}|dksJt|| |�d dkr |j|� q W t|�dkrltd��|S )a
If a `BYXXX` sequence is passed to the constructor at the same level as
`FREQ` (e.g. `FREQ=HOURLY,BYHOUR={2,4,7},INTERVAL=3`), there are some
specifications which cannot be reached given some starting conditions.
This occurs whenever the interval is not coprime with the base of a
given unit and the difference between the starting position and the
ending position is not coprime with the greatest common denominator
between the interval and the base. For example, with a FREQ of hourly
starting at 17:00 and an interval of 4, the only valid values for
BYHOUR would be {21, 1, 5, 9, 13, 17}, because 4 and 24 are not
coprime.
:param start:
Specifies the starting position.
:param byxxx:
An iterable containing the list of allowed values.
:param base:
The largest allowable value for the specified frequency (e.g.
24 hours, 60 minutes).
This does not preserve the type of the iterable, returning a set, since
the values should be unique and the order is irrelevant, this will
speed up later lookups.
In the event of an empty set, raises a :exception:`ValueError`, as this
results in an empty rrule.
r r z+Invalid rrule byxxx generates an empty set.) r� rm r r r� r r� rg rA )rD rs r� r� ZcsetZnumZi_gcdrG rG rH Z__construct_byset� s
zrrule.__construct_bysetc C sL d}xBt d|d �D ]0}t|| j |�\}}||7 }||kr||fS qW dS )a�
Calculates the next value in a sequence where the `FREQ` parameter is
specified along with a `BYXXX` parameter at the same "level"
(e.g. `HOURLY` specified with `BYHOUR`).
:param value:
The old value of the component.
:param byxxx:
The `BYXXX` set, which should have been generated by
`rrule._construct_byset`, or something else which checks that a
valid rule is present.
:param base:
The largest allowable value for the specified frequency (e.g.
24 hours, 60 minutes).
If a valid value is not found after `base` iterations (the maximum
number before the sequence would start to repeat), this raises a
:exception:`ValueError`, as no valid values were found.
This returns a tuple of `divmod(n*interval, base)`, where `n` is the
smallest number of `interval` repetitions until the next specified
value in `byxxx` is found.
r r N)r r r� )rD r� r� r� Z accumulatorr r rG rG rH Z__mod_distance s zrrule.__mod_distance)Nr NNNNNNNNNNNNNF) rI rJ rK rL rC r� r� r` r� r rM rG rG )rF rH r
. s t {> /c @ sv e Zd Zddddddddd d
d d d
ddgZdd� Zdd� Zdd� Zdd� Zdd� Zdd� Z d d � Z
d d � Z d d!� Z d"S )#r� r
�lastyear� lastmonthr r
r
� yearweekdayr �mranger r r r r r c C s& x| j D ]}t| |d � qW || _d S )N)� __slots__�setattrr
)rD r
�attrrG rG rH rC D s z_iterinfo.__init__c C s� | j }|| jk�r2dtj|� | _dtj|d � | _tj|dd�}|j� | _ |j
� | _ tj|dd�j
� }| jdkr�t | _
t| _t| _t|d � | _t| _n&t| _
t| _t| _t|d � | _t| _|js�d | _�n`dg| jd | _d| j |j d }}|dk�r"d}| j| j |j d }n
| j| }t |d�\} }
| |
d } x�|jD ]�} | dk �rh| | d 7 } d| k �o|| kn �s��qN| dk�r�|| d d }
||k�r�|
d| 8 }
n|}
x8t d�D ],}d| j|
< |
d7 }
| j|
|j k�r�P �q�W �qNW d|jk�rr|| d }
||k�r,|
d| 8 }
|
| jk �rrx8t d�D ],}d| j|
< |
d7 }
| j|
|j k�rBP �qBW |�r2d|jk�rtj|d dd�j
� }d| |j d }dtj|d � }|dk�r�d}d|||j d d d }nd| j| d d }nd}||jk�r2x t |�D ]}
d| j|
< �q W |j �r�|| j k�sR|| jk�r�g }|j!t"k�r�|j#�r�x:|j#D ]"}|j$| j|d |d � � �qrW n d| jfg}n$|j!t%k�r�| j|d |d � g}|�r�dg| j | _&x�|D ]�\}}|d8 }x�|j D ]�\}} | dk �r8|| d d }
|
| j|
| d 8 }
n*|| d d }
|
d| j|
| d 7 }
||
k�ov|kn �r�d| j&|
< �q�W �q�W |j'�r�dg| jd | _(t)j)|�j� | j }x |j'D ]}d| j(|| < �q�W || _|| _ d S ) Nim r r r# r �4 ���r )*r
r r� Zisleapr r
r� r r� r
r r �M365MASKr � MDAY365MASKr � NMDAY365MASKr �WDAYMASKr � M365RANGEr �M366MASK� MDAY366MASK� NMDAY366MASK� M366RANGEr� r r� r r r� r r� r
r� rh r r r� r r� )rD r r� �rrZ firstydayr� Zno1wkstZ firstwkstZwyearlenr r ZnumweeksrE rj rl Z lyearweekdayZlno1wkstZlyearlenZ lnumweeksZranges�firstr Zeyday�offsetrG rG rH r� I s�
$
z_iterinfo.rebuildc C s t t| j��d| jfS )Nr )rp r r )rD r r� r� rG rG rH r� � s z_iterinfo.ydaysetc C sL d g| j }| j|d |d � \}}xt||�D ] }|||< q2W |||fS )Nr )r r r )rD r r� r� �dsetrs r rj rG rG rH r� � s
z_iterinfo.mdaysetc C sl d g| j d }tj|||�j� | j }|}x4td�D ](}|||< |d7 }| j| | jjkr6P q6W |||fS )Nr# r ) r r� r r� r
r r r
r� )rD r r� r� r+ rj rs rl rG rG rH r� � s z_iterinfo.wdaysetc C s: d g| j }tj|||�j� | j }|||< |||d fS )Nr )r r� r r� r
)rD r r� r� r+ rj rG rG rH r� � s z_iterinfo.ddaysetc C sP g }| j }x8|jD ].}x(|jD ] }|jtj||||jd�� q W qW |j� |S )N)r� )r
r� r� rh r� r� r� r� )rD r� r� r� �tsetr( rG rG rH r� � s z_iterinfo.htimesetc C s@ g }| j }x(|jD ] }|jtj||||jd�� qW |j� |S )N)r� )r
r� rh r� r� r� r� )rD r� r� r� r, r( rG rG rH r � s z_iterinfo.mtimesetc C s t j|||| jjd�fS )N)r� )r� r� r
r� )rD r� r� r� rG rG rH r � s
z_iterinfo.stimesetN)
rI rJ rK r rC r� r� r� r� r� r� r r rG rG rG rH r� > s
r� c sj e Zd ZdZG dd� de�Zd� fdd� Zedd� �Zed d
� �Z ed d � �Z
ed
d� �Z dd� Z � Z
S )r aL The rruleset type allows more complex recurrence setups, mixing
multiple rules, dates, exclusion rules, and exclusion dates. The type
constructor takes the following keyword arguments:
:param cache: If True, caching of results will be enabled, improving
performance of multiple queries considerably. c @ s@ e Zd Zdd� Zdd� ZeZdd� Zdd� Zd d
� Zd d � Z d
S )zrruleset._genitemc C s> yt |�| _|j| � W n tk
r, Y nX || _|| _d S )N)r r} rh ri �genlistrk )rD r- rk rG rG rH rC
s
zrruleset._genitem.__init__c C s^ yt | j�| _W nH tk
rX | jd | kr<tj| j� n| jj| � tj| j� Y nX d S )Nr ) r rk r} ri r- �heapq�heappop�remove�heapify)rD rG rG rH �__next__ s zrruleset._genitem.__next__c C s | j |j k S )N)r} )rD �otherrG rG rH �__lt__ s zrruleset._genitem.__lt__c C s | j |j kS )N)r} )rD r3 rG rG rH �__gt__" s zrruleset._genitem.__gt__c C s | j |j kS )N)r} )rD r3 rG rG rH �__eq__% s zrruleset._genitem.__eq__c C s | j |j kS )N)r} )rD r3 rG rG rH �__ne__( s zrruleset._genitem.__ne__N)
rI rJ rK rC r2 �nextr4 r5 r6 r7 rG rG rG rH �_genitem s
r9 Fc s, t t| �j|� g | _g | _g | _g | _d S )N)rB r rC �_rrule�_rdate�_exrule�_exdate)rD r^ )rF rG rH rC + s
zrruleset.__init__c C s | j j|� dS )z\ Include the given :py:class:`rrule` instance in the recurrence set
generation. N)r: rh )rD r
rG rG rH r
2 s zrruleset.rrulec C s | j j|� dS )z_ Include the given :py:class:`datetime` instance in the recurrence
set generation. N)r; rh )rD �rdaterG rG rH r> 8 s zrruleset.rdatec C s | j j|� dS )z� Include the given rrule instance in the recurrence set exclusion
list. Dates which are part of the given recurrence rules will not
be generated, even if some inclusive rrule or rdate matches them.
N)r< rh )rD �exrulerG rG rH r? > s zrruleset.exrulec C s | j j|� dS )z� Include the given datetime instance in the recurrence set
exclusion list. Dates included that way will not be generated,
even if some inclusive rrule or rdate matches them. N)r= rh )rD �exdaterG rG rH r@ F s zrruleset.exdatec c sl g }| j j� | j|t| j �� x$dd� | jD �D ]}| j||� q2W g }| jj� | j|t| j�� x$dd� | jD �D ]}| j||� qxW d }d}tj|� tj|� x�|�r`|d }| s�||j k�r:xB|o�|d |k �r |d }t
|� |o�|d |kr�tj ||� q�W | �s$||d k�r4|d7 }|j V |j }t
|� |r�|d |kr�tj ||� q�W || _ d S )Nc S s g | ] }t |��qS rG )r_ )rN rO rG rG rH r� Q s z"rruleset._iter.<locals>.<listcomp>c S s g | ] }t |��qS rG )r_ )rN rO rG rG rH r� V s r r )
r; r� r9 r_ r: r= r< r. r1 r} r � heapreplacer] )rD Zrlistrk ZexlistZlastdtr ZritemZexitemrG rG rH r` M s<
zrruleset._iter)F)rI rJ rK rL �objectr9 rC rW r
r> r? r@ r` rM rG rG )rF rH r s " c @ s� e Zd Zeeeeeee d�Z
dddddddd �Z d
d � Z d d
� Z
e Ze Ze
Ze
Ze
Ze
Ze
Ze
Ze
Ze
Ze
Zdd� Zdd� Zdd� Zdd� Z e Z d dd�Z d dd�Z d d � Z dS ) � _rrulestr)r
r r r r r r r r r r r r! r" )r r r r r r r c K s t |�||j� < d S )N)�int�lower)rD �rrkwargsr� r� rS rG rG rH � _handle_int{ s z_rrulestr._handle_intc K s dd� |j d�D �||j� < d S )Nc S s g | ] }t |��qS rG )rD )rN rO rG rG rH r� s z._rrulestr._handle_int_list.<locals>.<listcomp>r� )�splitrE )rD rF r� r� rS rG rG rH �_handle_int_list~ s z_rrulestr._handle_int_listc K s | j | |d< d S )Nr� )� _freq_map)rD rF r� r� rS rG rG rH � _handle_FREQ� s z_rrulestr._handle_FREQc K sV t sddlm a y$t j||jd�|jd�d�|d< W n tk
rP td��Y nX d S )Nr )�parser�ignoretz�tzinfos)rM rN r� zinvalid until date)rL r� �parser� rA )rD rF r� r� rS rG rG rH �
_handle_UNTIL� s z_rrulestr._handle_UNTILc K s | j | |d< d S )Nr� )� _weekday_map)rD rF r� r� rS rG rG rH � _handle_WKST� s z_rrulestr._handle_WKSTc K s� g }x�|j d�D ]�}d|krD|j d�}|d }t|d dd � �} n^t|�r�x"tt|��D ]}
||
dkrZP qZW |d|
� p~d} ||
d� }| r�t| �} ntd��|jt| j| | �� qW ||d< dS )
z:
Two ways to specify this: +1MO or MO(+1)
r� �(r r Nz +-0123456789z$Invalid (empty) BYDAY specification.r� r )rH rD rg r rA rh �weekdaysrQ ) rD rF r� r� rS r� r� Zsplt�wrE rj rG rG rH �_handle_BYWEEKDAY� s"
z_rrulestr._handle_BYWEEKDAYNFc
C s� |j d�d kr.|jd�\}}|dkr2td��n|}i }x�|jd�D ]�} | jd�\}}|j� }|j� }y t| d| �|||||d� W qB tk
r� td | ��Y qB ttfk
r� td
||f ��Y qBX qBW tf ||d �|��S )
N�:r �RRULEzunknown parameter namer� �=Z_handle_)rM rN zunknown parameter '%s'zinvalid '%s': %s)r� r^ r )�findrH rA �upper�getattr�AttributeError�KeyErrorr
)
rD �liner� r^ rM rN r� r� rF ZpairrG rG rH �_parse_rfc_rrule� s&
z_rrulestr._parse_rfc_rrulec C s� |r d}d}|j � }|j� s$td��|r�|j� } d}
xr|
t| �k r�| |
j� } | sZ| |
= q6|
dkr�| d dkr�| |
d | dd � 7 < | |
= q6|
d7 }
q6W n|j� } | r�t| �dkr�|jd�d ks�|jd�r�| j | d ||||d�S g } g }
g }g }�x�| D �]�} | �s�q| jd�d k�r,d }| }n| jdd�\}}|jd
�}|�sTtd ��|d }|dd � }|d k�r�x|D ]}td | ���qxW | j
|� �q|d
k�r�x$|D ] }|dk�r�td| ���q�W |
j
|� n�|dk�r
x|D ]}td| ���q�W |j
|� n�|dk�rFx$|D ] }|dk�rtd| ���qW |j
|� nV|dk�r�x|D ]}td| ���qVW t �s~ddl m a t j
|||d�}n td| ���qW |�s�t| �dk�s�|
�s�|�s�|�r�t �r�|
�s�|�r�ddl m a t|d�}x&| D ] }|j| j ||||d�� �q�W x:|
D ]2}x*|jd�D ] }|jt j
|||d�� �q0W �q W x&|D ] }|j| j ||||d�� �q\W x:|D ]2}x*|jd�D ] }|jt j
|||d�� �q�W �q�W |�r�|�r�|j|� |S | j | d ||||d �S d S ) NTz empty stringr � r rW zRRULE:)r^ r� rM rN rX r� zempty property namezunsupported RRULE parm: ZRDATEzVALUE=DATE-TIMEzunsupported RDATE parm: ZEXRULEzunsupported EXRULE parm: ZEXDATEzunsupported EXDATE parm: ZDTSTARTzunsupported DTSTART parm: )rL )rM rN zunsupported property: )r^ )r� rM rN r� )r� r^ rM rN r r )r[ �striprA �
splitlinesrg �rstriprH rZ �
startswithr` rh rL r� rO r r
r> r? r@ )rD r� r� r^ ZunfoldZforcesetZ
compatiblerM rN �linesrj r_ Z rrulevalsZ rdatevalsZ
exrulevalsZ
exdatevalsr� r� ZparmsZparmZrsetZdatestrrG rG rH �
_parse_rfc� s�
z_rrulestr._parse_rfcc K s | j |f|�S )N)rg )rD r� rS rG rG rH �__call__D s z_rrulestr.__call__)NFFN)NFFFFFN)!rI rJ rK r
r r r r r r rJ rQ rG rI Z_handle_INTERVALZ
_handle_COUNTZ_handle_BYSETPOSZ_handle_BYMONTHZ_handle_BYMONTHDAYZ_handle_BYYEARDAYZ_handle_BYEASTERZ_handle_BYWEEKNOZ_handle_BYHOURZ_handle_BYMINUTEZ_handle_BYSECONDrK rP rR rV Z
_handle_BYDAYr` rg rh rG rG rG rH rC n sN
irC i��i��i��)
r r r* r+ r, r- r. r/ r0 r1 r2 r3 r4 )
r r r5 r6 r7 r8 r9 r: r; r< r= r> r? )>rL rq r� r� ru Zmathr � ImportErrorZ fractionsZsixr r Z six.movesr r r. Z_commonr Z weekdaybase�warningsr �__all__r� r$ rp r ZM29ZM30ZM31r% r r& r! r' r# r" r� r
r r r r r r r� rL r r r r r r r rT rW rB rX r
r� r rC r rG rG rG rH �<module> sl �.@.@ (
T Dm [ dateutil/__pycache__/__init__.cpython-36.pyc 0000644 00000000246 14751155147 0014770 0 ustar 00 3
6�cYE � @ s d dl mZ dS )� )�VERSIONN)Z_versionr � __version__� r r � /usr/lib/python3.6/__init__.py�<module> s dateutil/__pycache__/relativedelta.cpython-36.opt-1.pyc 0000644 00000033641 14751155147 0017022 0 ustar 00 3
6�cYiZ � @ s� d dl Z d dlZd dlZd dlmZ d dlmZ d dlmZ ddl m
Z
e dd� e d �D �� \Z
ZZZZZZZd
d d d
ddddgZG dd
� d
e�Zdd� ZdS )� N)�copysign)�
integer_types)�warn� )�weekdayc c s | ]}t |�V qd S )N)r )�.0�x� r �#/usr/lib/python3.6/relativedelta.py� <genexpr>
s r � �
relativedelta�MO�TU�WE�TH�FR�SA�SUc @ s� e Zd ZdZd%dd�Zdd� Zedd � �Zejd
d � �Zd d � Z d
d� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd� ZeZdd � ZeZd d � ZdZd d � Zd!d"� ZeZd#d$� ZdS )&r
a�
The relativedelta type is based on the specification of the excellent
work done by M.-A. Lemburg in his
`mx.DateTime <http://www.egenix.com/files/python/mxDateTime.html>`_ extension.
However, notice that this type does *NOT* implement the same algorithm as
his work. Do *NOT* expect it to behave like mx.DateTime's counterpart.
There are two different ways to build a relativedelta instance. The
first one is passing it two date/datetime classes::
relativedelta(datetime1, datetime2)
The second one is passing it any number of the following keyword arguments::
relativedelta(arg1=x,arg2=y,arg3=z...)
year, month, day, hour, minute, second, microsecond:
Absolute information (argument is singular); adding or subtracting a
relativedelta with absolute information does not perform an aritmetic
operation, but rather REPLACES the corresponding value in the
original datetime with the value(s) in relativedelta.
years, months, weeks, days, hours, minutes, seconds, microseconds:
Relative information, may be negative (argument is plural); adding
or subtracting a relativedelta with relative information performs
the corresponding aritmetic operation on the original datetime value
with the information in the relativedelta.
weekday:
One of the weekday instances (MO, TU, etc). These instances may
receive a parameter N, specifying the Nth weekday, which could
be positive or negative (like MO(+1) or MO(-2). Not specifying
it is the same as specifying +1. You can also use an integer,
where 0=MO.
leapdays:
Will add given days to the date found, if year is a leap
year, and the date found is post 28 of february.
yearday, nlyearday:
Set the yearday or the non-leap year day (jump leap days).
These are converted to day/month/leapdays information.
Here is the behavior of operations with relativedelta:
1. Calculate the absolute year, using the 'year' argument, or the
original datetime year, if the argument is not present.
2. Add the relative 'years' argument to the absolute year.
3. Do steps 1 and 2 for month/months.
4. Calculate the absolute day, using the 'day' argument, or the
original datetime day, if the argument is not present. Then,
subtract from the day until it fits in the year and month
found after their operations.
5. Add the relative 'days' argument to the absolute day. Notice
that the 'weeks' argument is multiplied by 7 and added to
'days'.
6. Do steps 1 and 2 for hour/hours, minute/minutes, second/seconds,
microsecond/microseconds.
7. If the 'weekday' argument is present, calculate the weekday,
with the given (wday, nth) tuple. wday is the index of the
weekday (0-6, 0=Mon), and nth is the number of weeks to add
forward or backward, depending on its signal. Notice that if
the calculated date is already Monday, for example, using
(0, 1) or (0, -1) won't change the day.
Nr c C s t dd� ||fD ��r td��|o$|�r�t|tj�o>t|tj�sHtd��t|tj�t|tj�kr�t|tj�s~tjj|j� �}n t|tj�s�tjj|j� �}d| _d| _ d| _
d| _ d| _ d| _
d| _d| _d | _d | _d | _d | _d | _d | _d | _d | _d| _|j|j d |j|j }| j|� | j|�}||k �rFtj }d}n
tj }d}x.|||��r~||7 }| j|� | j|�}�qRW || }|j|j
d | _|j| _�nV|| _|| _ ||d | _
|| _ || _ | | _
|
| _| | _| | _|
| _|| _|| _|| _|| _|| _t d
d� | |
|||||fD ���r4t d t � t|t ��rLt!| | _n|| _d}|�rb|}n|�r||}|dk�r|d | _ |�r�ddddddddddddg }x\t"|�D ]D\} } || k�r�| d | _| dk�r�|| _n||| d | _P �q�W td| ��| j#� d S ) Nc s s" | ]}|d k o|t |�kV qd S )N)�int)r r r r r
r c s z)relativedelta.__init__.<locals>.<genexpr>zGNon-integer years and months are ambiguous and not currently supported.z&relativedelta only diffs datetime/dater � r i�Q r c s s" | ]}|d k ot |�|kV qd S )N)r )r r r r r
r � s z2Non-integer value passed as absolute information. z4This is not a well-defined condition and will raise zerrors in future versions.�; � �Z �x � � �� �� i i0 iN in zinvalid year day (%d)���zfNon-integer value passed as absolute information. This is not a well-defined condition and will raise z�Non-integer value passed as absolute information. This is not a well-defined condition and will raise errors in future versions.r )$�any�
ValueError�
isinstance�datetime�date� TypeError� fromordinal� toordinal�years�months�days�leapdays�hours�minutes�seconds� microseconds�year�month�dayr �hour�minute�second� microsecond� _has_time� _set_months�__radd__�operator�gt�ltr �DeprecationWarningr �weekdays� enumerate�_fix) �selfZdt1Zdt2r( r) r* r+ �weeksr, r- r. r/ r0 r1 r2 r ZyeardayZ nlyeardayr3 r4 r5 r6 ZdtmZcompareZ incrementZdeltaZydayZydayidx�idxZydaysr r r
�__init__[ s�
zrelativedelta.__init__c C s� t | j�dkrHt| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dkr�t| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dkr�t| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dk�r"t| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dk�rlt| j�}t| j| d�\}}|| | _| j || 7 _ | j�s�| j�s�| j�s�| j�s�| j
d k �s�| j d k �s�| j d k �s�| j
d k �r�d | _nd
| _d S ) Ni?B i@B r �< � � � r r r )�absr/ �_sign�divmodr. r- r, r* r) r( r3 r4 r5 r6 r7 )rA �s�div�modr r r
r@ � s<
zrelativedelta._fixc C s
| j d S )Nr )r* )rA r r r
rB � s zrelativedelta.weeksc C s | j | jd |d | _ d S )Nr )r* rB )rA �valuer r r
rB � s c C sR || _ t| j �dkrHt| j �}t| j | d�\}}|| | _ || | _nd| _d S )NrH r r )r) rI rJ rK r( )rA r) rL rM rN r r r
r8 s
zrelativedelta._set_monthsc C s� t | j�}t| jd| j| d�}t |�}t| jd|| d�}t |�}t| jd|| d�}t |�}t| jd|| �}| j| j| j |||||| j
| j | j | j
| j| j| j| j| jd�S )aA
Return a version of this object represented entirely using integer
values for the relative attributes.
>>> relativedelta(days=1.5, hours=2).normalized()
relativedelta(days=1, hours=14)
:return:
Returns a :class:`dateutil.relativedelta.relativedelta` object.
rG rH rE �
� g ��.A)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )r r* �roundr, r- r. r/ � __class__r( r) r+ r0 r1 r2 r r3 r4 r5 r6 ) rA r* Zhours_fr, Z minutes_fr- Z seconds_fr. r/ r r r
�
normalized s
zrelativedelta.normalizedc
C sF t |t��r| j|j| j |j| j |j| j |j| j |j| j |j| j |j | j |j
p`| j
|j d k rp|j n| j |j d k r�|j n| j |j
d k r�|j
n| j
|jd k r�|jn| j|jd k r�|jn| j|jd k r�|jn| j|jd k r�|jn| j|jd k r�|jn| jd�S t |tj��rp| j| j| j| j|j | j| j| j|j | j |j | j
| j | j | j
| j| j| j| j| jd�S t |tj��s�tS | j�r�t |tj� �r�tjj|j� �}| j �p�|j | j }| j �p�|j }| j�r|| j7 }|dk�r�|d7 }|d8 }n|dk �r|d8 }|d7 }ttj ||�d | j
�p0|j
�}|||d�}x*dD ]"}t | |�}|d k �rF|||< �qFW | j}| j
�r�|d k�r�tj |��r�|| j
7 }|j f |�tj|| j| j| j| j d
� } | j�rB| jj| jj �p�d }
} t!| �d d } | d k�r| d | j� |
d 7 } n | | j� |
d 7 } | d9 } | tj| d
�7 } | S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 r r )r0 r1 r2 r3 r4 r5 r6 � )r* r, r- r. r/ r r )r* )r3 r4 r5 r6 r )"r" r
rS r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 r# Z timedeltar$ �NotImplementedr7 r& r' �min�calendarZ
monthrange�getattrZisleap�replace�nrI )
rA �otherr0 r1 r2 �repl�attrrO r* �retr ZnthZjumpdaysr r r
�__add__/ s�
zrelativedelta.__add__c C s
| j |�S )N)r` )rA r\ r r r
r9 � s zrelativedelta.__radd__c C s | j � j|�S )N)�__neg__r9 )rA r\ r r r
�__rsub__� s zrelativedelta.__rsub__c C s
t |t�stS | j| j|j | j|j | j|j | j|j | j|j | j |j | j
|j
| j pb|j | j d k rr| j n|j | j
d k r�| j
n|j
| jd k r�| jn|j| jd k r�| jn|j| jd k r�| jn|j| jd k r�| jn|j| jd k r�| jn|j| jd k �r | jn|jd�S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )r" r
rV rS r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r\ r r r
�__sub__� s6
zrelativedelta.__sub__c C sX | j | j | j | j | j | j | j | j | j| j | j
| j | j | j
| j| j| jd�S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rS r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r r r
ra � s
zrelativedelta.__neg__c C s� | j o�| j o�| j o�| j o�| j o�| j o�| j o�| j o�| jd ko�| j d ko�| j
d ko�| j d ko�| j d ko�| j
d ko�| jd ko�| jd k S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r r r
�__bool__� s
zrelativedelta.__bool__c C s� y t |�}W n tk
r tS X | jt| j| �t| j| �t| j| �t| j| �t| j | �t| j
| �t| j | �| j | j
| j| j| j| j| j| j| jd�S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )�floatr% rV rS r r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r\ �fr r r
�__mul__� s( zrelativedelta.__mul__c C sN t |t�stS | js|jr~| j s*|j r.dS | jj|jjkrBdS | jj|jj }}||kr~| sj|dkov| pv|dk r~dS | j|jk�oL| j|jk�oL| j|jk�oL| j|jk�oL| j |j k�oL| j
|j
k�oL| j |j k�oL| j |j k�oL| j
|j
k�oL| j|jk�oL| j|jk�oL| j|jk�oL| j|jk�oL| j|jk�oL| j|jkS )NFr )r" r
rV r r[ r( r) r* r, r- r. r/ r+ r0 r1 r2 r3 r4 r5 r6 )rA r\ Zn1Zn2r r r
�__eq__� s2
&zrelativedelta.__eq__c C s | j |� S )N)rh )rA r\ r r r
�__ne__ s zrelativedelta.__ne__c C s0 ydt |� }W n tk
r$ tS X | j|�S )Nr )re r% rV rg )rA r\ Z
reciprocalr r r
�__div__ s
zrelativedelta.__div__c C s� g }x.dD ]&}t | |�}|r
|jd j||d
�� q
W x6dD ].}t | |�}|d k r:|jdj|t|�d
�� q:W dj| jjdj|�d�S )Nr( r) r* r+ r, r- r. r/ z{attr}={value:+g})r^ rO r0 r1 r2 r r3 r4 r5 r6 z{attr}={value}z{classname}({attrs})z, )Z classnameZattrs)r( r) r* r+ r, r- r. r/ )r0 r1 r2 r r3 r4 r5 r6 )rY �append�format�reprrS �__name__�join)rA �lr^ rO r r r
�__repr__ s
zrelativedelta.__repr__)NNr r r r r r r r r NNNNNNNNNN)rn �
__module__� __qualname__�__doc__rD r@ �propertyrB �setterr8 rT r` r9 rb rc ra rd Z __nonzero__rg �__rmul__rh �__hash__ri rj � __truediv__rq r r r r
r
s6 G
y!
#W c C s t td| ��S )Nr )r r )r r r r
rJ " s rJ )r# rX r: Zmathr Zsixr �warningsr Z_commonr �tuple�ranger r r r r r r r> �__all__�objectr
rJ r r r r
�<module> s ( dateutil/__pycache__/rrule.cpython-36.opt-1.pyc 0000644 00000117164 14751155147 0015331 0 ustar 00 3
6�cY�� � @ sJ d Z ddlZddlZddlZddlZyddlmZ W n ek
rT ddlmZ Y nX ddl m
Z
m Z ddl m
Z
mZ ddlZddlmZ ddlmZ d d
d d d
ddddddddddddgZedgd dgd d gd d gd d gd d!gd d"gd d#gd d$gd d%gd d&gd d'gd dgd" �Zee�Zeedd ��eedd��eedd(�� ZZZ ee e e e e e e e e e e e e dd"� �Z ee �Z eedNd��eedOd��eedPd�� ZZZ ee e e e e e e e e e e e e dd"� �Z ee �Z dQZ!dRZ"dddd d d d!gd? Z#[[[ ed4= e d4= e d= ee �Z ee�Zd d
dddddgZ$eed"��\Z%Z&Z'Z(Z)Z*Z+da,da-G d@dA� dAe�ZedBdC� ed"�D �� \Z.Z/Z0Z1Z2Z3Z4Z5dDdE� Z6G dFdG� dGe7�Z8G dHd � d e8�Z9G dIdJ� dJe7�Z:G dKd
� d
e8�Z;G dLdM� dMe7�Z<e<� Z=dS )Sz�
The rrule module offers a small, complete, and very fast, implementation of
the recurrence rules documented in the
`iCalendar RFC <http://www.ietf.org/rfc/rfc2445.txt>`_,
including support for caching of results.
� N)�gcd)�advance_iterator�
integer_types)�_thread�range� )�weekday)�warn�rrule�rruleset�rrulestr�YEARLY�MONTHLY�WEEKLY�DAILY�HOURLY�MINUTELY�SECONDLY�MO�TU�WE�TH�FR�SA�SU� � � � � � � � � � � �
� � � �< �[ �y � � �� �� � �1 �O �n �; �Z �x � � �� �� � �0 �N �m �7 c s" e Zd ZdZd� fdd� Z� ZS )r z7
This version of weekday does not allow n = 0.
Nc s& |dkrt d��tt| �j||� d S )Nr z Can't create weekday with n==0)�
ValueError�superr �__init__)�selfZwkday�n)� __class__� �/usr/lib/python3.6/rrule.pyrC D s zweekday.__init__)N)�__name__�
__module__� __qualname__�__doc__rC �
__classcell__rG rG )rF rH r @ s r c c s | ]}t |�V qd S )N)r )�.0�xrG rG rH � <genexpr>K s rP c s � fdd�}|S )zT
Decorator for rruleset methods which may invalidate the
cached length.
c s � | f|�|�}| j � |S )N)�_invalidate_cache)rD �args�kwargs�rv)�frG rH �
inner_funcS s z&_invalidates_cache.<locals>.inner_funcrG )rU rV rG )rU rH �_invalidates_cacheN s rW c @ sn e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z ddd�Z
d dd�Z d dd�Z d dd�Z
dS ) � rrulebaseFc C s4 |r g | _ tj� | _| j� nd | _ d| _d | _d S )NF)�_cacher �
allocate_lock� _cache_lockrQ �_cache_complete�_len)rD �cacherG rG rH rC \ s
zrrulebase.__init__c C s. | j rt| j�S | jd kr"| j� S | j� S d S )N)r\ �iterrY �_iter� _iter_cached)rD rG rG rH �__iter__f s
zrrulebase.__iter__c C s> | j d k r4g | _ d| _| j� | _| jj� r4| jj� d | _d S )NF)rY r\ r` �
_cache_genr[ �locked�releaser] )rD rG rG rH rQ n s
zrrulebase._invalidate_cachec c s� d}| j }| j}| jj}| jj}x�|r�|t|�kr�|� | jr@P y$x td�D ]}|jt |�� qLW W n& t
k
r� d | _ }d| _P Y nX |� || V |d7 }q"W x || j k r�|| V |d7 }q�W d S )Nr r& Tr ) rc rY r[ �acquirere �lenr\ r �appendr �
StopIterationr] )rD �i�genr^ rf re �jrG rG rH ra y s.
zrrulebase._iter_cachedc C s� | j r| j| S t|t�rd|jr:|jdk r:tt| ��| S ttj| |j pJd|j
pTt j |jp\d��S n`|dkr�t| �}y"x t
|d �D ] }t|�}q�W W n tk
r� t�Y nX |S tt| ��| S d S )Nr r )r\ rY �
isinstance�slice�step�listr_ � itertools�islice�start�stop�sys�maxsizer r ri �
IndexError)rD �itemrk rj �resrG rG rH � __getitem__� s$
zrrulebase.__getitem__c C s: | j r|| jkS x$| D ] }||kr&dS ||krdS qW dS )NTF)r\ rY )rD rx rj rG rG rH � __contains__� s
zrrulebase.__contains__c C s | j dkrx | D ]}qW | j S )z� Returns the number of recurrences in this set. It will have go
trough the whole recurrence, if this hasn't been done before. N)r] )rD rO rG rG rH �count� s
zrrulebase.countc C sX | j r| j}n| }d}|r8x8|D ]}||kr.P |}q W n x|D ]}||krLP |}q>W |S )z� Returns the last recurrence before the given datetime instance. The
inc keyword defines what happens if dt is an occurrence. With
inc=True, if dt itself is an occurrence, it will be returned. N)r\ rY )rD �dt�incrk �lastrj rG rG rH �before� s
zrrulebase.beforec C sP | j r| j}n| }|r2x4|D ]}||kr |S q W nx|D ]}||kr8|S q8W dS )z� Returns the first recurrence after the given datetime instance. The
inc keyword defines what happens if dt is an occurrence. With
inc=True, if dt itself is an occurrence, it will be returned. N)r\ rY )rD r} r~ rk rj rG rG rH �after� s
zrrulebase.afterNc c sh | j r| j}n| }|r dd� }ndd� }d}x6|D ].}|||�r2|dk rZ|d7 }||krZP |V q2W dS )aH
Generator which yields up to `count` recurrences after the given
datetime instance, equivalent to `after`.
:param dt:
The datetime at which to start generating recurrences.
:param count:
The maximum number of recurrences to generate. If `None` (default),
dates are generated until the recurrence rule is exhausted.
:param inc:
If `dt` is an instance of the rule and `inc` is `True`, it is
included in the output.
:yields: Yields a sequence of `datetime` objects.
c S s | |kS )NrG )�dc�dtcrG rG rH �<lambda>� s z"rrulebase.xafter.<locals>.<lambda>c S s | |kS )NrG )r� r� rG rG rH r� � s r Nr )r\ rY )rD r} r| r~ rk �comprE �drG rG rH �xafter� s
zrrulebase.xafterr c C s� | j r| j}n| }d}g }|r`x�|D ]6}||kr4P q$|sP||krZd}|j|� q$|j|� q$W n@x>|D ]6}||krvP qf|s�||kr�d}|j|� qf|j|� qfW |S )a Returns all the occurrences of the rrule between after and before.
The inc keyword defines what happens if after and/or before are
themselves occurrences. With inc=True, they will be included in the
list, if they are found in the recurrence set. FT)r\ rY rh ) rD r� r� r~ r| rk Zstarted�lrj rG rG rH �between s.
zrrulebase.between)F)F)F)NF)Fr )rI rJ rK rC rb rQ ra rz r{ r| r� r� r� r� rG rG rG rH rX [ s
)rX c sJ e Zd ZdZd� fdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z � Z
S )r
a|
That's the base of the rrule operation. It accepts all the keywords
defined in the RFC as its constructor parameters (except byday,
which was renamed to byweekday) and more. The constructor prototype is::
rrule(freq)
Where freq must be one of YEARLY, MONTHLY, WEEKLY, DAILY, HOURLY, MINUTELY,
or SECONDLY.
.. note::
Per RFC section 3.3.10, recurrence instances falling on invalid dates
and times are ignored rather than coerced:
Recurrence rules may generate recurrence instances with an invalid
date (e.g., February 30) or nonexistent local time (e.g., 1:30 AM
on a day where the local time is moved forward by an hour at 1:00
AM). Such recurrence instances MUST be ignored and MUST NOT be
counted as part of the recurrence set.
This can lead to possibly surprising behavior when, for example, the
start date occurs at the end of the month:
>>> from dateutil.rrule import rrule, MONTHLY
>>> from datetime import datetime
>>> start_date = datetime(2014, 12, 31)
>>> list(rrule(freq=MONTHLY, count=4, dtstart=start_date))
... # doctest: +NORMALIZE_WHITESPACE
[datetime.datetime(2014, 12, 31, 0, 0),
datetime.datetime(2015, 1, 31, 0, 0),
datetime.datetime(2015, 3, 31, 0, 0),
datetime.datetime(2015, 5, 31, 0, 0)]
Additionally, it supports the following keyword arguments:
:param cache:
If given, it must be a boolean value specifying to enable or disable
caching of results. If you will use the same rrule instance multiple
times, enabling caching will improve the performance considerably.
:param dtstart:
The recurrence start. Besides being the base for the recurrence,
missing parameters in the final recurrence instances will also be
extracted from this date. If not given, datetime.now() will be used
instead.
:param interval:
The interval between each freq iteration. For example, when using
YEARLY, an interval of 2 means once every two years, but with HOURLY,
it means once every two hours. The default interval is 1.
:param wkst:
The week start day. Must be one of the MO, TU, WE constants, or an
integer, specifying the first day of the week. This will affect
recurrences based on weekly periods. The default week start is got
from calendar.firstweekday(), and may be modified by
calendar.setfirstweekday().
:param count:
How many occurrences will be generated.
.. note::
As of version 2.5.0, the use of the ``until`` keyword together
with the ``count`` keyword is deprecated per RFC-2445 Sec. 4.3.10.
:param until:
If given, this must be a datetime instance, that will specify the
limit of the recurrence. The last recurrence in the rule is the greatest
datetime that is less than or equal to the value specified in the
``until`` parameter.
.. note::
As of version 2.5.0, the use of the ``until`` keyword together
with the ``count`` keyword is deprecated per RFC-2445 Sec. 4.3.10.
:param bysetpos:
If given, it must be either an integer, or a sequence of integers,
positive or negative. Each given integer will specify an occurrence
number, corresponding to the nth occurrence of the rule inside the
frequency period. For example, a bysetpos of -1 if combined with a
MONTHLY frequency, and a byweekday of (MO, TU, WE, TH, FR), will
result in the last work day of every month.
:param bymonth:
If given, it must be either an integer, or a sequence of integers,
meaning the months to apply the recurrence to.
:param bymonthday:
If given, it must be either an integer, or a sequence of integers,
meaning the month days to apply the recurrence to.
:param byyearday:
If given, it must be either an integer, or a sequence of integers,
meaning the year days to apply the recurrence to.
:param byweekno:
If given, it must be either an integer, or a sequence of integers,
meaning the week numbers to apply the recurrence to. Week numbers
have the meaning described in ISO8601, that is, the first week of
the year is that containing at least four days of the new year.
:param byweekday:
If given, it must be either an integer (0 == MO), a sequence of
integers, one of the weekday constants (MO, TU, etc), or a sequence
of these constants. When given, these variables will define the
weekdays where the recurrence will be applied. It's also possible to
use an argument n for the weekday instances, which will mean the nth
occurrence of this weekday in the period. For example, with MONTHLY,
or with YEARLY and BYMONTH, using FR(+1) in byweekday will specify the
first friday of the month where the recurrence happens. Notice that in
the RFC documentation, this is specified as BYDAY, but was renamed to
avoid the ambiguity of that keyword.
:param byhour:
If given, it must be either an integer, or a sequence of integers,
meaning the hours to apply the recurrence to.
:param byminute:
If given, it must be either an integer, or a sequence of integers,
meaning the minutes to apply the recurrence to.
:param bysecond:
If given, it must be either an integer, or a sequence of integers,
meaning the seconds to apply the recurrence to.
:param byeaster:
If given, it must be either an integer, or a sequence of integers,
positive or negative. Each integer will define an offset from the
Easter Sunday. Passing the offset 0 to byeaster will yield the Easter
Sunday itself. This is an extension to the RFC specification.
Nr Fc
sR t t| �j|� |s(tjj� jdd�}n*t|tj�sFtjj|j� �}n |jdd�}|| _ |j
| _ || _ || _
|| _i | _|r�t|tj� r�tjj|j� �}|| _|d k r�|r�tdt� |d kr�tj� | _nt|t�r�|| _n|j| _|d kr�d | _n�t|t��r:|dk�s(d | k�o dkn �r0td��|f| _nLt|�| _x@| jD ]6}|dk�sxd | k�ondkn �rLtd���qLW | j�r�| j| jd< | d k�r:|
d k�r:| d k�r:|
d k�r:| d k�r:|tk�r|d k�r�|j }d | jd< |j } d | jd< n8|t k�r |j } d | jd< n |t k�r:|j� }
d | jd < |d k�rLd | _ n<t|t��r^|f}tt!t"|���| _ d| jk�r�| j | jd< |
d k�r�d | _#n0t|
t��r�|
f}
tt!t"|
���| _#| j#| jd
< | d k �rt$�s�dd l%m$a$ t| t��r�| f| _&ntt!| ��| _&| j&| jd < nd | _&| d k�r6f | _'f | _(npt| t��rH| f} t"| �} tt!d
d� | D ���| _'tt!dd� | D ���| _(d| jk�r�tt)j*| j'| j(��| jd< | d k�r�d | _+n0t| t��r�| f} tt!t"| ���| _+| j+| jd< |
d k�rd | _,d | _-�n8t|
t��st.|
d��r |
f}
t"� | _,t"� | _-x`|
D ]X}t|t��rT| j,j/|� n8|j0 �sh|t k�rx| j,j/|j� n| j-j/|j|j0f� �q6W | j,�s�d | _,n| j-�s�d | _-| j,d k �r�tt!| j,��| _,dd� | j,D �}nt� }| j-d k �rtt!| j-��| _-dd� | j-D �}nt� }d | jk�r:tt)j*||��| jd < |d k�rf|t1k �r^t"|j2f�| _3nd | _3nXt|t��rx|f}|t1k�r�| j4|j2|dd�| _3n
t"|�| _3tt!| j3��| _3| j3| jd< |d k�r�|t5k �r�t"|j6f�| _7nd | _7nXt|t��r�|f}|t5k�r | j4|j6|dd�| _7n
t"|�| _7tt!| j7��| _7| j7| jd< |d k�rj|t8k �rb|j9f| _:nd | _:nbt|t��r||f}t"|�| _:|t8k�r�| j4|j9|dd�| _:n
t"|�| _:tt!| j:��| _:| j:| jd< | j t1k�r�d | _;nng | _;xP| j3D ]F}x>| j7D ]4}x,| j:D ]"}| j;j<tj=|||| j d�� �qW �q�W �q�W | j;j>� t| j;�| _;d S ) Nr )Z microsecondz�Using both 'count' and 'until' is inconsistent with RFC 2445 and has been deprecated in dateutil. Future versions will raise an error.in z:bysetpos must be between 1 and 366, or between -366 and -1�bysetpos�bymonth�
bymonthday� byweekday� byyearday)�easter�byeasterc s s | ]}|d kr|V qdS )r NrG )rN rO rG rG rH rP s z!rrule.__init__.<locals>.<genexpr>c s s | ]}|d k r|V qdS )r NrG )rN rO rG rG rH rP s �byweeknorE c S s g | ] }t |��qS rG )r )rN rO rG rG rH �
<listcomp>I s z"rrule.__init__.<locals>.<listcomp>c S s g | ] }t |� �qS rG )r )rN rO rG rG rH r� O s � )rs �byxxx�base�byhourr* �byminute�bysecond)�tzinfoi����i����)?rB r
rC �datetimeZnow�replacerm � fromordinal� toordinal�_dtstartr� �_tzinfo�_freq� _interval�_count�_original_rule�_untilr �DeprecationWarning�calendarZ firstweekday�_wkstr r � _bysetposrA �tupler
�month�dayr r �_bymonth�sorted�set�
_byyeardayr� �dateutil� _byeaster� _bymonthday� _bynmonthdayrq �chain� _byweekno�
_byweekday� _bynweekday�hasattr�addrE r �hour�_byhour�_rrule__construct_bysetr �minute� _byminuter �second� _bysecond�_timesetrh �time�sort)rD �freq�dtstart�interval�wkstr| �untilr� r� r� r� r� r� r� r� r� r� r^ �pos�wdayZorig_byweekdayZorig_bynweekdayr� r� r� )rF rG rH rC � sL
(
(
zrrule.__init__c
C s� g }dgd \}}}| j rD|j| j jd�� | j j� dd� \}}}dt| j g}| jdkrr|jdt| j� � | jr�|jdt t
| j��d d
� � | j dk r�|jd t| j � � | j r�|j| j jd �� | j
jd
�dk �rDt| j
�}g }xJ|d
D ]>}|j�r(|jdj|jt |�d d
� d�� q�|jt |�� q�W ||d
< n| j
}d} xFd4D ]>\}
} |j| �} | �rT|j| j|
d$jd%d&� | D ��d'�� �qTW |jd(j|�� d)j|�S )5z�
Output a string that would generate this RRULE if passed to rrulestr.
This is mostly compatible with RFC2445, except for the
dateutil-specific extension BYEASTER.
Nr zDTSTART:%Y%m%dT%H%M%Sr" zFREQ=r z INTERVAL=zWKST=r r zCOUNT=zUNTIL=%Y%m%dT%H%M%Sr� z {n:+d}{wday})rE r� z
{name}={vals}�BYSETPOSr� �BYMONTHr� �
BYMONTHDAYr� � BYYEARDAYr� �BYWEEKNOr� �BYDAY�BYHOURr� �BYMINUTEr� �BYSECONDr� �BYEASTERr� �,c s s | ]}t |�V qd S )N)�str)rN �vrG rG rH rP � s z rrule.__str__.<locals>.<genexpr>)�name�vals�;�
�r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� �r� r� )
r� r� r� r� r� r� r� r� r� r� )r� rh Zstrftime� timetuple� FREQNAMESr� r� r� r� �reprr r� r� r� �get�dictrE �format�join)
rD �output�h�m�s�partsZ
original_ruleZ wday_stringsr� Zpartfmtr� �key�valuerG rG rH �__str__� sT
z
rrule.__str__c K sN | j | j| j| j| j| j| jdkr&dndd�}|j| j� |j|� t f |�S )z�Return new rrule with same attributes except for those attributes given new
values by whichever keyword arguments are specified.NFT)r� r| r� r� r� r� r^ )
r� r� r� r� r� r� rY �updater� r
)rD rS Z
new_kwargsrG rG rH r� � s
z
rrule.replacec 5 c s� | j j� \ }}}}}}}}} | j}
| j} | j} | j}
| j}| j}| j}| j }| j
}| j }| j }| j
}| j}| j}| j}t| �}|j||� t|jt|jt|jt|jt|jt |jt |ji|
}|
tk r�| j }n�t|j t |j t |j!i|
} |
tko�| jo�|| jk�s<|
t k�r | j�r || jk�s<|
t k�rB| j�rB|| jk�rBf }n | |||�}d} | j"} �xX||||�\} } }!d}"�x$| | |!� D �]}#|�r�|j#|# |k�s�|�r�|j$|# �s�|�r�|j%|# |k�s�|j&�r�|j&|# �s�|�r�|j'|# �s�|�s�|�r |j(|# |k�r |j)|# |k�s�|�r�|#|j*k �rP|#d |k�rP|j* |# |k�s�|#|j*k�r�|#d |j* |k�r�|j+ |# |j* |k�r�d | |#< d}"�q�W |�r�|�r�g }$x�|D ]�}%|%dk �r�t,|%t-|��\}&}'nt,|%d t-|��\}&}'y&dd� | | |!� D �|& }#||' }(W n t.k
�r$ Y n6X t/j0j1|j2|# �})t/j/j3|)|(�}*|*|$k�r�|$j4|*� �q�W |$j5� xh|$D ]`}*|
�r�|*|
k�r�| | _6d S |*| j k�rn| d k �r�| d8 } | dk �r�| | _6d S | d7 } |*V �qnW n�x�| | |!� D ]�}#|#d k �r�t/j0j1|j2|# �})xv|D ]n}(t/j/j3|)|(�}*|
�r4|*|
k�r4| | _6d S |*| j k�r| d k �rf| d8 } | dk �rf| | _6d S | d7 } |*V �qW �q�W d}+|
tk�r�|| 7 }|t/j7k�r�| | _6d S |j||� �n^|
tk�r.|| 7 }|dk�r t,|d�\},}-|-}||,7 }|dk�rd}|d8 }|t/j7k�r | | _6d S |j||� �n�|
tk�r�| |k�rd||d d| | jd 7 }n||| | jd 7 }| }d}+�n�|
tk�r�|| 7 }d}+�nx|
tk�r|"�r�|d
| | | 7 }|�r�| j8|| jd d �\}.}nt,|| d �\}.}|.�r||.7 }d}+| |||�}�n|
t k�r�|"�rD|d
|d | | | 7 }d}/d}0x�t9|0t:| |0� �D ]v}1|�r�| j8|| jdd �\}2}nt,|| d�\}2}t,||2 d �\},}|,�r�||,7 }d}+d}"| �s�||k�r`d}/P �q`W |/�s�t;d��| |||�}�n"|
t k�r|"�r,|d|d |d | | | 7 }d}0d}/x�t9d|0t:| |0� �D ]�}1|�rl| j8|| jdd �\}3}nt,|| d�\}3}t,||3 d�\},}|,�r�||,7 }t,|d �\},}|,�r�||,7 }d}+| �s�||k�rJ| �s�||k�rJ| �s�||k�rJd}/P �qJW |/�st;d ��| |||�}|+�r\|dk�r\t<j=||�d }4||4k�r\x\||4k�r�||48 }|d7 }|dk�r�d}|d7 }|t/j7k�r�| | _6d S t<j=||�d }4�qFW |j||� �q\W d S ) Nr Fr Tc S s g | ]}|d k r|�qS )NrG )rN rO rG rG rH r� @ s z rrule._iter.<locals>.<listcomp>r( r" r# � r� )r� r� r� i� r* z$Invalid combination of interval and z byhour resulting in empty rule.iQ i z!Invalid combination of interval, z&byhour and byminute resulting in emptyz rule.� �
i� zCInvalid combination of interval and byhour resulting in empty rule.i�Q zGInvalid combination of interval, byhour and byminute resulting in emptyzMInvalid combination of interval, byhour and byminute resulting in empty rule.)>r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� � _iterinfo�rebuildr
�ydaysetr �mdaysetr �wdaysetr �ddaysetr r r r� �htimeset�mtimeset�stimesetr� �mmask�wnomask�wdaymask� nwdaymask�
eastermask�mdaymask� nmdaymask�yearlen� nextyearlen�divmodrg rw r� �dater� � yearordinalZcombinerh r� r] ZMAXYEAR�_rrule__mod_distancer r rA r� Z
monthrange)5rD �yearr� r� r� r� r� r Zyearday�_r� r� r� r� r� r� r� r� r� r� Z bynmonthdayr� r� r� r� �iiZ getdaysetZtimesetZ
gettimeset�totalr| Zdaysetrs �endZfilteredrj Zposlistr� ZdayposZtimeposr� r ry Zfixday�div�modZndaysZvalidZrep_raterl ZnhoursZnminutesZ daysinmonthrG rG rH r` � s�
"
z rrule._iterc C sp t � }t|t�r|f}x@|D ]8}t| j|�}|dksJt|| |�d dkr |j|� q W t|�dkrltd��|S )a
If a `BYXXX` sequence is passed to the constructor at the same level as
`FREQ` (e.g. `FREQ=HOURLY,BYHOUR={2,4,7},INTERVAL=3`), there are some
specifications which cannot be reached given some starting conditions.
This occurs whenever the interval is not coprime with the base of a
given unit and the difference between the starting position and the
ending position is not coprime with the greatest common denominator
between the interval and the base. For example, with a FREQ of hourly
starting at 17:00 and an interval of 4, the only valid values for
BYHOUR would be {21, 1, 5, 9, 13, 17}, because 4 and 24 are not
coprime.
:param start:
Specifies the starting position.
:param byxxx:
An iterable containing the list of allowed values.
:param base:
The largest allowable value for the specified frequency (e.g.
24 hours, 60 minutes).
This does not preserve the type of the iterable, returning a set, since
the values should be unique and the order is irrelevant, this will
speed up later lookups.
In the event of an empty set, raises a :exception:`ValueError`, as this
results in an empty rrule.
r r z+Invalid rrule byxxx generates an empty set.) r� rm r r r� r r� rg rA )rD rs r� r� ZcsetZnumZi_gcdrG rG rH Z__construct_byset� s
zrrule.__construct_bysetc C sL d}xBt d|d �D ]0}t|| j |�\}}||7 }||kr||fS qW dS )a�
Calculates the next value in a sequence where the `FREQ` parameter is
specified along with a `BYXXX` parameter at the same "level"
(e.g. `HOURLY` specified with `BYHOUR`).
:param value:
The old value of the component.
:param byxxx:
The `BYXXX` set, which should have been generated by
`rrule._construct_byset`, or something else which checks that a
valid rule is present.
:param base:
The largest allowable value for the specified frequency (e.g.
24 hours, 60 minutes).
If a valid value is not found after `base` iterations (the maximum
number before the sequence would start to repeat), this raises a
:exception:`ValueError`, as no valid values were found.
This returns a tuple of `divmod(n*interval, base)`, where `n` is the
smallest number of `interval` repetitions until the next specified
value in `byxxx` is found.
r r N)r r r� )rD r� r� r� Z accumulatorr r rG rG rH Z__mod_distance s zrrule.__mod_distance)Nr NNNNNNNNNNNNNF) rI rJ rK rL rC r� r� r` r� r rM rG rG )rF rH r
. s t {> /c @ sv e Zd Zddddddddd d
d d d
ddgZdd� Zdd� Zdd� Zdd� Zdd� Zdd� Z d d � Z
d d � Z d d!� Z d"S )#r� r
�lastyear� lastmonthr r
r
� yearweekdayr �mranger r r r r r c C s& x| j D ]}t| |d � qW || _d S )N)� __slots__�setattrr
)rD r
�attrrG rG rH rC D s z_iterinfo.__init__c C s� | j }|| jk�r2dtj|� | _dtj|d � | _tj|dd�}|j� | _ |j
� | _ tj|dd�j
� }| jdkr�t | _
t| _t| _t|d � | _t| _n&t| _
t| _t| _t|d � | _t| _|js�d | _�n`dg| jd | _d| j |j d }}|dk�r"d}| j| j |j d }n
| j| }t |d�\} }
| |
d } x�|jD ]�} | dk �rh| | d 7 } d| k �o|| kn �s��qN| dk�r�|| d d }
||k�r�|
d| 8 }
n|}
x8t d�D ],}d| j|
< |
d7 }
| j|
|j k�r�P �q�W �qNW d|jk�rr|| d }
||k�r,|
d| 8 }
|
| jk �rrx8t d�D ],}d| j|
< |
d7 }
| j|
|j k�rBP �qBW |�r2d|jk�rtj|d dd�j
� }d| |j d }dtj|d � }|dk�r�d}d|||j d d d }nd| j| d d }nd}||jk�r2x t |�D ]}
d| j|
< �q W |j �r�|| j k�sR|| jk�r�g }|j!t"k�r�|j#�r�x:|j#D ]"}|j$| j|d |d � � �qrW n d| jfg}n$|j!t%k�r�| j|d |d � g}|�r�dg| j | _&x�|D ]�\}}|d8 }x�|j D ]�\}} | dk �r8|| d d }
|
| j|
| d 8 }
n*|| d d }
|
d| j|
| d 7 }
||
k�ov|kn �r�d| j&|
< �q�W �q�W |j'�r�dg| jd | _(t)j)|�j� | j }x |j'D ]}d| j(|| < �q�W || _|| _ d S ) Nim r r r# r �4 ���r )*r
r r� Zisleapr r
r� r r� r
r r �M365MASKr � MDAY365MASKr � NMDAY365MASKr �WDAYMASKr � M365RANGEr �M366MASK� MDAY366MASK� NMDAY366MASK� M366RANGEr� r r� r r r� r r� r
r� rh r r r� r r� )rD r r� �rrZ firstydayr� Zno1wkstZ firstwkstZwyearlenr r ZnumweeksrE rj rl Z lyearweekdayZlno1wkstZlyearlenZ lnumweeksZranges�firstr Zeyday�offsetrG rG rH r� I s�
$
z_iterinfo.rebuildc C s t t| j��d| jfS )Nr )rp r r )rD r r� r� rG rG rH r� � s z_iterinfo.ydaysetc C sL d g| j }| j|d |d � \}}xt||�D ] }|||< q2W |||fS )Nr )r r r )rD r r� r� �dsetrs r rj rG rG rH r� � s
z_iterinfo.mdaysetc C sl d g| j d }tj|||�j� | j }|}x4td�D ](}|||< |d7 }| j| | jjkr6P q6W |||fS )Nr# r ) r r� r r� r
r r r
r� )rD r r� r� r+ rj rs rl rG rG rH r� � s z_iterinfo.wdaysetc C s: d g| j }tj|||�j� | j }|||< |||d fS )Nr )r r� r r� r
)rD r r� r� r+ rj rG rG rH r� � s z_iterinfo.ddaysetc C sP g }| j }x8|jD ].}x(|jD ] }|jtj||||jd�� q W qW |j� |S )N)r� )r
r� r� rh r� r� r� r� )rD r� r� r� �tsetr( rG rG rH r� � s z_iterinfo.htimesetc C s@ g }| j }x(|jD ] }|jtj||||jd�� qW |j� |S )N)r� )r
r� rh r� r� r� r� )rD r� r� r� r, r( rG rG rH r � s z_iterinfo.mtimesetc C s t j|||| jjd�fS )N)r� )r� r� r
r� )rD r� r� r� rG rG rH r � s
z_iterinfo.stimesetN)
rI rJ rK r rC r� r� r� r� r� r� r r rG rG rG rH r� > s
r� c sj e Zd ZdZG dd� de�Zd� fdd� Zedd� �Zed d
� �Z ed d � �Z
ed
d� �Z dd� Z � Z
S )r aL The rruleset type allows more complex recurrence setups, mixing
multiple rules, dates, exclusion rules, and exclusion dates. The type
constructor takes the following keyword arguments:
:param cache: If True, caching of results will be enabled, improving
performance of multiple queries considerably. c @ s@ e Zd Zdd� Zdd� ZeZdd� Zdd� Zd d
� Zd d � Z d
S )zrruleset._genitemc C s> yt |�| _|j| � W n tk
r, Y nX || _|| _d S )N)r r} rh ri �genlistrk )rD r- rk rG rG rH rC
s
zrruleset._genitem.__init__c C s^ yt | j�| _W nH tk
rX | jd | kr<tj| j� n| jj| � tj| j� Y nX d S )Nr ) r rk r} ri r- �heapq�heappop�remove�heapify)rD rG rG rH �__next__ s zrruleset._genitem.__next__c C s | j |j k S )N)r} )rD �otherrG rG rH �__lt__ s zrruleset._genitem.__lt__c C s | j |j kS )N)r} )rD r3 rG rG rH �__gt__" s zrruleset._genitem.__gt__c C s | j |j kS )N)r} )rD r3 rG rG rH �__eq__% s zrruleset._genitem.__eq__c C s | j |j kS )N)r} )rD r3 rG rG rH �__ne__( s zrruleset._genitem.__ne__N)
rI rJ rK rC r2 �nextr4 r5 r6 r7 rG rG rG rH �_genitem s
r9 Fc s, t t| �j|� g | _g | _g | _g | _d S )N)rB r rC �_rrule�_rdate�_exrule�_exdate)rD r^ )rF rG rH rC + s
zrruleset.__init__c C s | j j|� dS )z\ Include the given :py:class:`rrule` instance in the recurrence set
generation. N)r: rh )rD r
rG rG rH r
2 s zrruleset.rrulec C s | j j|� dS )z_ Include the given :py:class:`datetime` instance in the recurrence
set generation. N)r; rh )rD �rdaterG rG rH r> 8 s zrruleset.rdatec C s | j j|� dS )z� Include the given rrule instance in the recurrence set exclusion
list. Dates which are part of the given recurrence rules will not
be generated, even if some inclusive rrule or rdate matches them.
N)r< rh )rD �exrulerG rG rH r? > s zrruleset.exrulec C s | j j|� dS )z� Include the given datetime instance in the recurrence set
exclusion list. Dates included that way will not be generated,
even if some inclusive rrule or rdate matches them. N)r= rh )rD �exdaterG rG rH r@ F s zrruleset.exdatec c sl g }| j j� | j|t| j �� x$dd� | jD �D ]}| j||� q2W g }| jj� | j|t| j�� x$dd� | jD �D ]}| j||� qxW d }d}tj|� tj|� x�|�r`|d }| s�||j k�r:xB|o�|d |k �r |d }t
|� |o�|d |kr�tj ||� q�W | �s$||d k�r4|d7 }|j V |j }t
|� |r�|d |kr�tj ||� q�W || _ d S )Nc S s g | ] }t |��qS rG )r_ )rN rO rG rG rH r� Q s z"rruleset._iter.<locals>.<listcomp>c S s g | ] }t |��qS rG )r_ )rN rO rG rG rH r� V s r r )
r; r� r9 r_ r: r= r< r. r1 r} r � heapreplacer] )rD Zrlistrk ZexlistZlastdtr ZritemZexitemrG rG rH r` M s<
zrruleset._iter)F)rI rJ rK rL �objectr9 rC rW r
r> r? r@ r` rM rG rG )rF rH r s " c @ s� e Zd Zeeeeeee d�Z
dddddddd �Z d
d � Z d d
� Z
e Ze Ze
Ze
Ze
Ze
Ze
Ze
Ze
Ze
Ze
Zdd� Zdd� Zdd� Zdd� Z e Z d dd�Z d dd�Z d d � Z dS ) � _rrulestr)r
r r r r r r r r r r r r! r" )r r r r r r r c K s t |�||j� < d S )N)�int�lower)rD �rrkwargsr� r� rS rG rG rH � _handle_int{ s z_rrulestr._handle_intc K s dd� |j d�D �||j� < d S )Nc S s g | ] }t |��qS rG )rD )rN rO rG rG rH r� s z._rrulestr._handle_int_list.<locals>.<listcomp>r� )�splitrE )rD rF r� r� rS rG rG rH �_handle_int_list~ s z_rrulestr._handle_int_listc K s | j | |d< d S )Nr� )� _freq_map)rD rF r� r� rS rG rG rH � _handle_FREQ� s z_rrulestr._handle_FREQc K sV t sddlm a y$t j||jd�|jd�d�|d< W n tk
rP td��Y nX d S )Nr )�parser�ignoretz�tzinfos)rM rN r� zinvalid until date)rL r� �parser� rA )rD rF r� r� rS rG rG rH �
_handle_UNTIL� s z_rrulestr._handle_UNTILc K s | j | |d< d S )Nr� )� _weekday_map)rD rF r� r� rS rG rG rH � _handle_WKST� s z_rrulestr._handle_WKSTc K s� g }x�|j d�D ]�}d|krD|j d�}|d }t|d dd � �} n^t|�r�x"tt|��D ]}
||
dkrZP qZW |d|
� p~d} ||
d� }| r�t| �} ntd��|jt| j| | �� qW ||d< dS )
z:
Two ways to specify this: +1MO or MO(+1)
r� �(r r Nz +-0123456789z$Invalid (empty) BYDAY specification.r� r )rH rD rg r rA rh �weekdaysrQ ) rD rF r� r� rS r� r� Zsplt�wrE rj rG rG rH �_handle_BYWEEKDAY� s"
z_rrulestr._handle_BYWEEKDAYNFc
C s� |j d�d kr.|jd�\}}|dkr2td��n|}i }x�|jd�D ]�} | jd�\}}|j� }|j� }y t| d| �|||||d� W qB tk
r� td | ��Y qB ttfk
r� td
||f ��Y qBX qBW tf ||d �|��S )
N�:r �RRULEzunknown parameter namer� �=Z_handle_)rM rN zunknown parameter '%s'zinvalid '%s': %s)r� r^ r )�findrH rA �upper�getattr�AttributeError�KeyErrorr
)
rD �liner� r^ rM rN r� r� rF ZpairrG rG rH �_parse_rfc_rrule� s&
z_rrulestr._parse_rfc_rrulec C s� |r d}d}|j � }|j� s$td��|r�|j� } d}
xr|
t| �k r�| |
j� } | sZ| |
= q6|
dkr�| d dkr�| |
d | dd � 7 < | |
= q6|
d7 }
q6W n|j� } | r�t| �dkr�|jd�d ks�|jd�r�| j | d ||||d�S g } g }
g }g }�x�| D �]�} | �s�q| jd�d k�r,d }| }n| jdd�\}}|jd
�}|�sTtd ��|d }|dd � }|d k�r�x|D ]}td | ���qxW | j
|� �q|d
k�r�x$|D ] }|dk�r�td| ���q�W |
j
|� n�|dk�r
x|D ]}td| ���q�W |j
|� n�|dk�rFx$|D ] }|dk�rtd| ���qW |j
|� nV|dk�r�x|D ]}td| ���qVW t �s~ddl m a t j
|||d�}n td| ���qW |�s�t| �dk�s�|
�s�|�s�|�r�t �r�|
�s�|�r�ddl m a t|d�}x&| D ] }|j| j ||||d�� �q�W x:|
D ]2}x*|jd�D ] }|jt j
|||d�� �q0W �q W x&|D ] }|j| j ||||d�� �q\W x:|D ]2}x*|jd�D ] }|jt j
|||d�� �q�W �q�W |�r�|�r�|j|� |S | j | d ||||d �S d S ) NTz empty stringr � r rW zRRULE:)r^ r� rM rN rX r� zempty property namezunsupported RRULE parm: ZRDATEzVALUE=DATE-TIMEzunsupported RDATE parm: ZEXRULEzunsupported EXRULE parm: ZEXDATEzunsupported EXDATE parm: ZDTSTARTzunsupported DTSTART parm: )rL )rM rN zunsupported property: )r^ )r� rM rN r� )r� r^ rM rN r r )r[ �striprA �
splitlinesrg �rstriprH rZ �
startswithr` rh rL r� rO r r
r> r? r@ )rD r� r� r^ ZunfoldZforcesetZ
compatiblerM rN �linesrj r_ Z rrulevalsZ rdatevalsZ
exrulevalsZ
exdatevalsr� r� ZparmsZparmZrsetZdatestrrG rG rH �
_parse_rfc� s�
z_rrulestr._parse_rfcc K s | j |f|�S )N)rg )rD r� rS rG rG rH �__call__D s z_rrulestr.__call__)NFFN)NFFFFFN)!rI rJ rK r
r r r r r r rJ rQ rG rI Z_handle_INTERVALZ
_handle_COUNTZ_handle_BYSETPOSZ_handle_BYMONTHZ_handle_BYMONTHDAYZ_handle_BYYEARDAYZ_handle_BYEASTERZ_handle_BYWEEKNOZ_handle_BYHOURZ_handle_BYMINUTEZ_handle_BYSECONDrK rP rR rV Z
_handle_BYDAYr` rg rh rG rG rG rH rC n sN
irC i��i��i��)
r r r* r+ r, r- r. r/ r0 r1 r2 r3 r4 )
r r r5 r6 r7 r8 r9 r: r; r< r= r> r? )>rL rq r� r� ru Zmathr � ImportErrorZ fractionsZsixr r Z six.movesr r r. Z_commonr Z weekdaybase�warningsr �__all__r� r$ rp r ZM29ZM30ZM31r% r r& r! r' r# r" r� r
r r r r r r r� rL r r r r r r r rT rW rB rX r
r� r rC r rG rG rG rH �<module> sl �.@.@ (
T Dm [ dateutil/__pycache__/_version.cpython-36.opt-1.pyc 0000644 00000000506 14751155147 0016013 0 ustar 00 3
6�cY� � @ s. d Z dZdZdZeeefZdjeee��ZdS )z2
Contains information about the dateutil version.
� � � �.N) �__doc__Z
VERSION_MAJORZ
VERSION_MINORZ
VERSION_PATCHZ
VERSION_TUPLE�join�map�str�VERSION� r
r
� /usr/lib/python3.6/_version.py�<module> s
dateutil/__pycache__/parser.cpython-36.pyc 0000644 00000102174 14751155147 0014530 0 ustar 00 3
6�cY�� � @ s d Z ddlmZ ddlZddlZddlZddlZddlZddlm Z ddl
m Z ddl m
Z
mZmZ ddlmZ dd lmZ d
d gZG d d
� d
e�ZG dd� de�ZG dd � d e�ZG dd� de�ZG dd� de�Ze� Zd dd
�Z G dd� de�Z e � Z dd� Z dd� Z dS ) a�
This module offers a generic date/time string parser which is able to parse
most known formats to represent a date and/or time.
This module attempts to be forgiving with regards to unlikely input formats,
returning a datetime object even for dates which are ambiguous. If an element
of a date/time stamp is omitted, the following rules are applied:
- If AM or PM is left unspecified, a 24-hour clock is assumed, however, an hour
on a 12-hour clock (``0 <= hour <= 12``) *must* be specified if AM or PM is
specified.
- If a time zone is omitted, a timezone-naive datetime is returned.
If any other elements are missing, they are taken from the
:class:`datetime.datetime` object passed to the parameter ``default``. If this
results in a day number exceeding the valid number of days per month, the
value falls back to the end of the month.
Additional resources about date/time string formats can be found below:
- `A summary of the international standard date and time notation
<http://www.cl.cam.ac.uk/~mgk25/iso-time.html>`_
- `W3C Date and Time Formats <http://www.w3.org/TR/NOTE-datetime>`_
- `Time Formats (Planetary Rings Node) <http://pds-rings.seti.org/tools/time_formats.html>`_
- `CPAN ParseDate module
<http://search.cpan.org/~muir/Time-modules-2013.0912/lib/Time/ParseDate.pm>`_
- `Java SimpleDateFormat Class
<https://docs.oracle.com/javase/6/docs/api/java/text/SimpleDateFormat.html>`_
� )�unicode_literalsN)�StringIO)�
monthrange)� text_type� binary_type�
integer_types� )�
relativedelta)�tz�parse�
parserinfoc @ sn e Zd Zejd�Zdd� Zdd� Zdd� Zdd � Z d
d � Z
e d d
� �Z e dd� �Z
e dd� �Ze dd� �ZdS )�_timelexz([.,])c C sd t |t�r|j� }t |t�r$t|�}t|dd �d krHtdj|jj d���|| _
g | _ g | _ d| _
d S )N�readz8Parser must be a string or character stream, not {itype})ZitypeF)�
isinstancer �decoder r �getattr� TypeError�format� __class__�__name__�instream� charstack�
tokenstack�eof)�selfr � r � /usr/lib/python3.6/parser.py�__init__4 s
z_timelex.__init__c C s� | j r| j jd�S d}d}d}�x�| j�s | jr>| jjd�}n&| jjd�}x|dkrb| jjd�}qLW |srd| _P q"|s�|}| j|�r�d}n$| j|�r�d}n| j|�r�d }P nP q"|dk� r�d}| j|�r�||7 }n$|d
kr�||7 }d }n| jj |� P q"|dk�rX| j|��r||7 }n>|d
k�s:|d k�rHt
|�d
k�rH||7 }d}n| jj |� P q"|d k�r�d}|d
k�s|| j|��r�||7 }n6| j|��r�|d d
k�r�||7 }d}n| jj |� P q"|dkr"|d
k�s�| j|��r�||7 }q"| j|��r|d d
k�r||7 }d }q"| jj |� P q"W |dk�r�|�sN|j d
�dk�sN|d dk�r�| j j
|�}|d }x(|dd� D ]}|�rp| j j |� �qpW |dk�r�|j d
�dk�r�|jd d
�}|S )a�
This function breaks the time string into lexical units (tokens), which
can be parsed by the parser. Lexical units are demarcated by changes in
the character set, so any continuous string of letters is considered
one unit, any continuous string of numbers is considered one unit.
The main complication arises from the fact that dots ('.') can be used
both as separators (e.g. "Sep.20.2009") or decimal points (e.g.
"4:30:21.447"). As such, it is necessary to read the full context of
any dot-separated strings before breaking it into tokens; as such, this
function maintains a "token stack", for when the ambiguous context
demands that multiple tokens be parsed at once.
r FNr � T�a�0� �.�a.�,� �0.z.,���r' )r# r& r' )r �popr r r r �isword�isnum�isspace�append�len�count�_split_decimal�split�replace)r Z seenletters�token�state�nextchar�l�tokr r r � get_tokenD s�
"
z_timelex.get_tokenc C s | S )Nr )r r r r �__iter__� s z_timelex.__iter__c C s | j � }|d krt�|S )N)r7 �
StopIteration)r r2 r r r �__next__� s z_timelex.__next__c C s | j � S )N)r: )r r r r �next� s z
_timelex.nextc C s t | |��S )N)�list)�cls�sr r r r0 � s z_timelex.splitc C s |j � S )z5 Whether or not the next character is part of a word )�isalpha)r= r4 r r r r) � s z_timelex.iswordc C s |j � S )z0 Whether the next character is part of a number )�isdigit)r= r4 r r r r* � s z_timelex.isnumc C s |j � S )z* Whether the next character is whitespace )r+ )r= r4 r r r r+ � s z_timelex.isspaceN)r �
__module__� __qualname__�re�compiler/ r r7 r8 r: r; � classmethodr0 r) r* r+ r r r r r
0 s
m r
c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� _resultbasec C s x| j D ]}t| |d � qW d S )N)� __slots__�setattr)r �attrr r r r � s z_resultbase.__init__c C sN g }x6| j D ],}t| |�}|d k r |jd|t|�f � q W d|dj|�f S )Nz%s=%sz%s(%s)z, )rG r r, �repr�join)r Z classnamer5 rI �valuer r r �_repr� s
z_resultbase._reprc s t � fdd�� jD ��S )Nc 3 s | ]}t � |�d k V qd S )N)r )�.0rI )r r r � <genexpr>� s z&_resultbase.__len__.<locals>.<genexpr>)�sumrG )r r )r r �__len__� s z_resultbase.__len__c C s | j | jj�S )N)rM r r )r r r r �__repr__� s z_resultbase.__repr__N)r rA rB r rM rQ rR r r r r rF � s rF c @ s� e Zd ZdZdddddddd d
d d d
ddddddgZdcdddedfdgdhdigZdjdkdldmdndodpdqdrdsdtdug ZdvdwdxgZdydzgZdFdGdHgZ dgZ
i Z d{dJdK�Z dLdM� Z
dNdO� ZdPdQ� ZdRdS� ZdTdU� ZdVdW� ZdXdY� ZdZd[� Zd\d]� Zd|d^d_�Zd`da� ZdbS )}r a�
Class which handles what inputs are accepted. Subclass this to customize
the language and acceptable values for each parameter.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM
and YMD. Default is ``False``.
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken
to be the year, otherwise the last number is taken to be the year.
Default is ``False``.
r! r" r$ �;�-�/�'ZatZon�andZad�m�tZof�stZndZrdZth�Mon�Monday�Tue�Tuesday�Wed� Wednesday�Thu�Thursday�Fri�Friday�Sat�Saturday�Sun�Sunday�Jan�January�Feb�February�Mar�March�Apr�April�May�Jun�June�Jul�July�Aug�August�Sep�Sept� September�Oct�October�Nov�November�Dec�December�h�hour�hours�minute�minutesr> �second�seconds�amr �pm�p�UTCZGMT�ZFc C s� | j | j�| _| j | j�| _| j | j�| _| j | j�| _| j | j �| _
| j | j �| _ | j | j
�| _|| _|| _tj� j| _| jd d | _d S )N�d )�_convert�JUMP�_jump�WEEKDAYS� _weekdays�MONTHS�_months�HMS�_hms�AMPM�_ampm�UTCZONE�_utczone�PERTAIN�_pertain�dayfirst� yearfirst�timeZ localtimeZtm_year�_year�_century)r r� r� r r r r s zparserinfo.__init__c C sP i }xFt |�D ]:\}}t|t�r<x&|D ]}|||j� < q&W q|||j� < qW |S )N)� enumerater �tuple�lower)r ZlstZdct�i�vr r r r� * s
zparserinfo._convertc C s |j � | jkS )N)r� r� )r �namer r r �jump4 s zparserinfo.jumpc C sH t |�tdd� | jj� D ��krDy| j|j� S tk
rB Y nX d S )Nc s s | ]}t |�V qd S )N)r- )rN �nr r r rO 8 s z%parserinfo.weekday.<locals>.<genexpr>)r- �minr� �keysr� �KeyError)r r� r r r �weekday7 s zparserinfo.weekdayc C sL t |�tdd� | jj� D ��krHy| j|j� d S tk
rF Y nX d S )Nc s s | ]}t |�V qd S )N)r- )rN r� r r r rO @ s z#parserinfo.month.<locals>.<genexpr>r )r- r� r� r� r� r� )r r� r r r �month? s zparserinfo.monthc C s( y| j |j� S tk
r" d S X d S )N)r� r� r� )r r� r r r �hmsG s zparserinfo.hmsc C s( y| j |j� S tk
r" d S X d S )N)r� r� r� )r r� r r r �ampmM s zparserinfo.ampmc C s |j � | jkS )N)r� r� )r r� r r r �pertainS s zparserinfo.pertainc C s |j � | jkS )N)r� r� )r r� r r r �utczoneV s zparserinfo.utczonec C s || j krdS | jj|�S )Nr )r� �TZOFFSET�get)r r� r r r �tzoffsetY s
zparserinfo.tzoffsetc C sJ |dk rF| rF|| j 7 }t|| j �dkrF|| jk r>|d7 }n|d8 }|S )Nr� �2 )r� �absr� )r �year�century_specifiedr r r � convertyear_ s
zparserinfo.convertyearc C sl |j d k r | j|j |j�|_ |jdkr.|j s8|jdkrFd|_d|_n"|jdkrh|jrh| j|j�rhd|_dS )Nr r� r� T)r� r� r� r� �tznamer� )r �resr r r �validatei s
zparserinfo.validateN)r[ r\ )r] r^ )r_ r` )ra rb )rc rd )re rf )rg rh )ri rj )rk rl )rm rn )ro rp )rq rq )rr rs )rt ru )rv rw )rx ry rz )r{ r| )r} r~ )r r� )r� r� r� )rX r� r� )r> r� r� )r� r )r� r� )FF)F)r rA rB �__doc__r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r r r r r � sV
c sP e Zd Z� fdd�Zedd� �Zedd� �Zdd� Z� fd d
�Zd d � Z � Z
S )
�_ymdc s$ t | j| �j||� d| _|| _d S )NF)�superr r r� �tzstr)r r� �args�kwargs)r r r r w s z
_ymd.__init__c C s& y t | �|kS tk
r dS X d S )NF)�int�
ValueError)r2 r� r r r �token_could_be_year| s z_ymd.token_could_be_yearc s � fdd�|D �S )Nc s g | ]}t j|� �r|�qS r )r� r� )rN r2 )r� r r �
<listcomp>� s z3_ymd.find_potential_year_tokens.<locals>.<listcomp>r )r� �tokensr )r� r �find_potential_year_tokens� s z _ymd.find_potential_year_tokensc C sF x@t | �D ]4\}}tj||�}t|�dkr
t|d �dkr
|S q
W dS )zk
attempt to deduce if a pre 100 year was lost
due to padded zeros being taken off
r r r% N)r� r� r� r- )r r� �indexr2 Zpotential_year_tokensr r r �find_probable_year_index� s z _ymd.find_probable_year_indexc sN t |d�r&|j� r4t|�dkr4d| _n|dkr4d| _t| j| �jt|�� d S )NrQ r% Tr� )�hasattrr@ r- r� r� r r, r� )r �val)r r r r, � s
z _ymd.appendc C s, t | �}d\}}}|dkr&td���n�|dks>|d kr�|dkr�|d
krT| | }| |= |dksd|d kr�| d dkrz| d }n| d }�n�|dkr�| d dkr�| \}}n8| d dkr�| \}}n"|r�| d dkr�| \}}n| \}}�nB|dk�r"|dk�r| \}}}�n |dk�rF| d dk�s.|�r:| d dk�r:| \}}}n
| \}}}n�|dk�rv| d dk�rj| \}}}n
| \}}}n�| d dk�s�| jtj| j��dk�s�|�r�| d dk�r�| d dk�r�|�r�| d dk�r�| \}}}n
| \}}}n8| d dk�s |�r| d dk�r| \}}}n
| \}}}|||fS ) N� zMore than three YMD valuesr r% r � � )NNNr' r' r' )r- r� r� r
r0 r� )r �mstridxr� r� Zlen_ymdr� r� �dayr r r � resolve_ymd� sR
"
" "
z_ymd.resolve_ymd) r rA rB r � staticmethodr� r� r� r, r� �
__classcell__r r )r r r� v s
r� c @ sF e Zd Zd
dd�Zddd�ZG dd� de�Zdd d
�Zed d � �Z dS )�parserNc C s |pt � | _d S )N)r �info)r r� r r r r � s zparser.__init__Fc K sV |dkr t j j� jddddd�}| j|f|�\}}|dkrBtd��t|�dkrVtd��i }x&dD ] } t|| �}
|
dk r`|
|| < q`W d|kr�|jdkr�|jn|j} |jdkr�|jn|j} |j dkr�|j n|j }
|
t
| | �d
kr�t
| | �d
|d< |jf |�}|j dk �r$|j �r$|t j |j d� }|�s8t
|tj��sJ|�r�|j|k�r�t
|tj��rh||j|j�}n |j|j�}t
|t j��r�|}n<t
|t��r�tj|�}n$t
|t��r�tj|j|�}ntd��|j|d�}nf|j�r�|jtjk�r�|jtj� d�}n>|jdk�r|jtj� d�}n |j�r8|jtj|j|j�d�}|jdd��rN||fS |S dS )aV
Parse the date/time string into a :class:`datetime.datetime` object.
:param timestr:
Any date/time string using the supported formats.
:param default:
The default datetime object, if this is a datetime object and not
``None``, elements specified in ``timestr`` replace elements in the
default object.
:param ignoretz:
If set ``True``, time zones in parsed strings are ignored and a
naive :class:`datetime.datetime` object is returned.
:param tzinfos:
Additional time zone names / aliases which may be present in the
string. This argument maps time zone names (and optionally offsets
from those time zones) to time zones. This parameter can be a
dictionary with timezone aliases mapping time zone names to time
zones or a function taking two parameters (``tzname`` and
``tzoffset``) and returning a time zone.
The timezones to which the names are mapped can be an integer
offset from UTC in minutes or a :class:`tzinfo` object.
.. doctest::
:options: +NORMALIZE_WHITESPACE
>>> from dateutil.parser import parse
>>> from dateutil.tz import gettz
>>> tzinfos = {"BRST": -10800, "CST": gettz("America/Chicago")}
>>> parse("2012-01-19 17:21:00 BRST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21, tzinfo=tzoffset(u'BRST', -10800))
>>> parse("2012-01-19 17:21:00 CST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21,
tzinfo=tzfile('/usr/share/zoneinfo/America/Chicago'))
This parameter is ignored if ``ignoretz`` is set.
:param **kwargs:
Keyword arguments as passed to ``_parse()``.
:return:
Returns a :class:`datetime.datetime` object or, if the
``fuzzy_with_tokens`` option is ``True``, returns a tuple, the
first element being a :class:`datetime.datetime` object, the second
a tuple containing the fuzzy tokens.
:raises ValueError:
Raised for invalid or unknown string format, if the provided
:class:`tzinfo` is not in a valid format, or if an invalid date
would be created.
:raises TypeError:
Raised for non-string or character stream input.
:raises OverflowError:
Raised if the parsed date exceeds the largest valid C integer on
your system.
Nr )r� r� r� � microsecondzUnknown string formatz String does not contain a date.r� r� r� r� r� r� r� r )r� z9Offset must be tzinfo subclass, tz string, or int offset.)�tzinfo�fuzzy_with_tokensF)r� r� r� r� r� r� r� )�datetimeZnowr1 �_parser� r- r r� r� r� r r� r r � collections�Callabler� r� r� r� r r
r� r r� ZtzlocalZtzutc)r �timestr�defaultZignoretzZtzinfosr� r� �skipped_tokens�replrI rL ZcyearZcmonthZcday�retZtzdatar� r r r r � s\ ?
z parser.parsec @ s& e Zd Zddddddddd d
d g Zd S )
zparser._resultr� r� r� r� r� r� r� r� r� r� r� N)r rA rB rG r r r r �_resulti s r� c C st
|rd}| j }|dkr |j}|dkr*|j}| j� }tj|�}d } t� }
� y�t|�} d!} t|�}
d}� xt||
k � r�y|| }t |�}W n t
k
r� d}Y nX |dk �r�t|| �}|d7 }t| �dk�rH|d"k�rH|j dk�rH||
k�s || dk�rH|j || �dk�rH||d }t
|dd� �|_ |dk�r�t
|dd� �|_qf|d k�st|d k�r||d jd
�d k�r||d }| �r�||d jd
�d#k�r�| j|dd� � | j|dd� � | j|dd� � n<t
|dd� �|_ t
|dd� �|_t|dd� �\|_|_qf|d$k�r�||d }| j|dd� � | j|dd � � | j|d d � � |d k�r�t
|d d� �|_ t
|dd � �|_|d k�r�t
|d d� �|_qf||
k �r�|j || �dk �s |d |
k �r0|| dk�r0|j ||d �dk �r0|| dk�r|d7 }|j || �}�x�|dk�rZt
|�|_ |d �r�t
d|d �|_nL|dk�r�t
|�|_|d �r�t
d|d �|_n|dk�r�t|�\|_|_|d7 }||
k�s�|dk�r�P y|| }t |�}W n t
k
�r� P Y n8X |d7 }|d7 }||
k �r(|j || �}|dk �r(|}�q(W qf||
k�r�||d dk�r�|j ||d �dk �r�|j ||d �}|dk�r�t
|�|_|d }|�r�t
d| �|_n|dk�r�t|�\|_|_qf|d |
k �rf|| dk�rft
|�|_ |d7 }t || �}t
|�|_|d �r$t
d|d �|_|d7 }||
k �r�|| dk�r�t||d �\|_|_|d7 }qf||
k �r�|| d%k�r�|| }| j|� |d7 }||
k �r�|j|| � �r�y| j|| � W nX t
k
�r |j|| �}|dk �r| j|� | d&k�st�t| �d } nd'S Y nX |d7 }||
k �r�|| |k�r�|d7 }|j|| �}|dk �r�| j|� t| �d } | d(k�s�t�n| j|| � |d7 }qf||
k�s�|j|| ��rd|d |
k �rP|j||d �dk �rPt
|�|_ |j d k �r |j||d �dk�r | j d 7 _ n*|j d k�rF|j||d �dk�rFd|_ |d7 }n
| j|� |d7 }qf|j|| �dk �r�t
|�|_ |j d k �r�|j|| �dk�r�| j d 7 _ n&|j d k�r�|j|| �dk�r�d|_ |d7 }qf|�s�d)S |d7 }qf|j|| �}|dk �r ||_|d7 }qf|j|| �}|dk � rd| j|� | d*k�sNt�t| �d } |d7 }||
k rf|| d+k�r�|| }|d7 }| j|| � |d7 }||
k � rb|| |k� rb|d7 }| j|| � |d7 }qf|d |
k rf|| ||d k� odkn rf|j||d �rfyt
||d �}W n t
k
� rD Y nX | jt|j|��� |d7 }qf|j|| �}|dk �
rZd}|� r�|jdk � r�d}|j dk� r�|� r�d}nt
d,��n2d|j k� o�d kn � s�|� r�d}nt
d-��|�
r:|dk�
r|j d k �
r| j d 7 _ n |dk�
r2|j d k�
r2d|_ ||_n|�
rP| j |
| ||�} |d7 }qf|j dk � rt|| �dk� r|j dk� r|j dk� rdd� || D � � r|| |_ |j |j �|_ |d7 }||
k rf|| d.krfd/|| dk ||< d|_ |j |j �rfd|_ qf|j dk � r�|| d0k� r�d2|| dk }|d7 }t|| �}|dk� r�t
|| dd� �d t
|| dd� �d |_ nz|d |
k � r�||d dk� r�t
|| �d t
||d �d |_ |d7 }n*|dk� r�t
|| dd� �d |_ nd3S |d7 }| j |9 _ |d |
k rf|j|| �rf||d d krf||d d krfdt||d � k� ondkn rfd d� ||d D � rf||d |_ |d7 }qf|j|| �� p�|� s�d4S | j |
| ||�} |d7 }qfW | j | ||�\}}}|dk �
r||_!| j"|_"|dk �
r||_|dk �
r&||_#W n t$t
tfk
�
rD d5S X |j%|��
sVd6S |�
rh|t&|
�fS |dfS dS )7a
Private method which performs the heavy lifting of parsing, called from
``parse()``, which passes on its ``kwargs`` to this function.
:param timestr:
The string to parse.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM
and YMD. If set to ``None``, this value is retrieved from the
current :class:`parserinfo` object (which itself defaults to
``False``).
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken
to be the year, otherwise the last number is taken to be the year.
If this is set to ``None``, the value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param fuzzy:
Whether to allow fuzzy parsing, allowing for string like "Today is
January 1, 2047 at 8:21:00AM".
:param fuzzy_with_tokens:
If ``True``, ``fuzzy`` is automatically set to True, and the parser
will return a tuple where the first element is the parsed
:class:`datetime.datetime` datetimestamp and the second element is
a tuple containing the portions of the string which were ignored:
.. doctest::
>>> from dateutil.parser import parse
>>> parse("Today is January 1, 2047 at 8:21:00AM", fuzzy_with_tokens=True)
(datetime.datetime(2047, 1, 1, 8, 21), (u'Today is ', u' ', u'at '))
TNr% r r r� � �:� r" � r� � �
r! �< rT rU FzNo hour specified with zAM or PM flag.zInvalid hour specified for z12-hour clock.� c S s g | ]}|t jkr|�qS r )�string�ascii_uppercase)rN �xr r r r� � s z!parser._parse.<locals>.<listcomp>�+i �(�)c S s g | ]}|t jkr|�qS r )r� r� )rN r� r r r r� s ���r' )r% r� r' )r� r� r� )rT rU r" r' )NNr' )NNr' )rT rU z%No hour specified with AM or PM flag.z)Invalid hour specified for 12-hour clock.)r� rT )r� rT )r� rT r' )r' r )NN)NN)NN)NN)'r� r� r� r� r
r0 r< r� r- �floatr� r� r� r� r� �findr, �_parsemsr� r� r� r� �AssertionErrorr� r� r� �strr� � _skip_tokenr� r� r� r� r� r� r� �
IndexErrorr� r� ) r r� r� r� Zfuzzyr� r� r� r5 �last_skipped_token_ir� Zymdr� �len_lr� Z
value_reprrL �len_lir> �idxZnewidxZ
sec_remainder�sepZ val_is_ampm�signalr� r� r� r r r r� n s )
$
,
&
$$
2
4 &
.&
z
parser._parsec C s8 ||d kr"| d || 7 < n| j || � |}|S )Nr r' )r, )r� r� r� r5 r r r r� - s
zparser._skip_token)N)NFN)NNFF)
r rA rB r r rF r� r� r� r� r r r r r� � s
Ar� c K s( |rt |�j| f|�S tj| f|�S dS )a)
Parse a string in one of the supported formats, using the
``parserinfo`` parameters.
:param timestr:
A string containing a date/time stamp.
:param parserinfo:
A :class:`parserinfo` object containing parameters for the parser.
If ``None``, the default arguments to the :class:`parserinfo`
constructor are used.
The ``**kwargs`` parameter takes the following keyword arguments:
:param default:
The default datetime object, if this is a datetime object and not
``None``, elements specified in ``timestr`` replace elements in the
default object.
:param ignoretz:
If set ``True``, time zones in parsed strings are ignored and a naive
:class:`datetime` object is returned.
:param tzinfos:
Additional time zone names / aliases which may be present in the
string. This argument maps time zone names (and optionally offsets
from those time zones) to time zones. This parameter can be a
dictionary with timezone aliases mapping time zone names to time
zones or a function taking two parameters (``tzname`` and
``tzoffset``) and returning a time zone.
The timezones to which the names are mapped can be an integer
offset from UTC in minutes or a :class:`tzinfo` object.
.. doctest::
:options: +NORMALIZE_WHITESPACE
>>> from dateutil.parser import parse
>>> from dateutil.tz import gettz
>>> tzinfos = {"BRST": -10800, "CST": gettz("America/Chicago")}
>>> parse("2012-01-19 17:21:00 BRST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21, tzinfo=tzoffset(u'BRST', -10800))
>>> parse("2012-01-19 17:21:00 CST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21,
tzinfo=tzfile('/usr/share/zoneinfo/America/Chicago'))
This parameter is ignored if ``ignoretz`` is set.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM and
YMD. If set to ``None``, this value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken to
be the year, otherwise the last number is taken to be the year. If
this is set to ``None``, the value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param fuzzy:
Whether to allow fuzzy parsing, allowing for string like "Today is
January 1, 2047 at 8:21:00AM".
:param fuzzy_with_tokens:
If ``True``, ``fuzzy`` is automatically set to True, and the parser
will return a tuple where the first element is the parsed
:class:`datetime.datetime` datetimestamp and the second element is
a tuple containing the portions of the string which were ignored:
.. doctest::
>>> from dateutil.parser import parse
>>> parse("Today is January 1, 2047 at 8:21:00AM", fuzzy_with_tokens=True)
(datetime.datetime(2047, 1, 1, 8, 21), (u'Today is ', u' ', u'at '))
:return:
Returns a :class:`datetime.datetime` object or, if the
``fuzzy_with_tokens`` option is ``True``, returns a tuple, the
first element being a :class:`datetime.datetime` object, the second
a tuple containing the fuzzy tokens.
:raises ValueError:
Raised for invalid or unknown string format, if the provided
:class:`tzinfo` is not in a valid format, or if an invalid date
would be created.
:raises OverflowError:
Raised if the parsed date exceeds the largest valid C integer on
your system.
N)r� r �
DEFAULTPARSER)r� r r� r r r r < s _c @ s$ e Zd ZG dd� de�Zdd� ZdS )� _tzparserc @ s< e Zd ZddddddgZG dd� de�Zd d
� Zd d � Zd
S )z_tzparser._result�stdabbr� stdoffset�dstabbr� dstoffset�start�endc @ s e Zd ZdddddddgZdS ) z_tzparser._result._attrr� �weekr� �yday�jydayr� r� N)r rA rB rG r r r r �_attr� s r c C s
| j d�S )N� )rM )r r r r rR � s z_tzparser._result.__repr__c C s" t j| � | j� | _| j� | _d S )N)rF r r r r )r r r r r � s
z_tzparser._result.__init__N)r rA rB rG rF r rR r r r r r r� � s
r� c C sZ | j � }tj|�}�y$t|�}d}�x�||k �r�|}x(||k r\dd� || D � r\|d7 }q6W ||k�r�|js�d}dj|||� �|_nd}dj|||� �|_|}||k o�|| d ks�|| d d
k�r�|| d k� r�d || dk }|d7 }nd }t|| �} | d k�rJt||t|| d d � �d
t|| d d � �d | � n�|d |k �r�||d dk�r�t||t|| �d
t||d �d | � |d 7 }n4| d k�r�t||t|| d d � �d
| � nd S |d7 }|j�r�P q&P q&W ||k �rBx*t ||�D ] }|| dk�rd||< �qW || dk�s:t
�|d7 }||k�rP�n�d|j d� k�ojdkn �r�dd� ||d � D � �r�x�|j |j
fD ]�}
t|| �|
_|d 7 }|| d k�r�t||d �d! } |d7 }n t|| �} |d 7 }| �r| |
_t|| �d d |
_nt|| �|
_|d 7 }t|| �|
_|d 7 }�q�W ||k �r6|| d"k�r|d$|| dk }|d7 }nd}|jt|| � | |_�n�|j d�d k�r6||d � j d�d k�r6dd� ||d � D � �r6�xF|j |j
fD �]4}
|| dk�r|d7 }t|| �|
_n�|| dk�r�|d7 }t|| �|
_|d7 }|| d%k�sXt
�|d7 }t|| �|
_|
jdk�r�d&|
_|d7 }|| d'k�s�t
�|d7 }t|| �d d |
_nt|| �d |
_|d7 }||k �r�|| dk�r�|d7 }t|| �} | d k�r>t|| d d � �d
t|| d d � �d |
_n�|d |k �r�||d dk�r�t|| �d
t||d �d |
_|d 7 }|d |k �r�||d dk�r�|d 7 }|
jt|| �7 _n*| d k�r�t|| d d � �d
|
_nd S |d7 }||k�s|| dk�st
�|d7 }�q�W ||k�s6t
�W n ttt
fk
�rT d S X |S )(Nr c S s g | ]}|d kr|�qS )z0123456789:,-+r )rN r� r r r r� � s z#_tzparser.parse.<locals>.<listcomp>r r r
r r� rT �
0123456789r� r% i r� r� rS r$ r� � c S s* g | ]"}|d kr|D ]}|dkr|�qqS )r$ r r )rN r� �yr r r r� � s
� rU c
S s* g | ]"}|dkr|D ]}|dkr|�qqS ) r$ rU �J�Mr" rT r� r )r$ rU r r r" rT r� r )rN r� r r r r r� s r r r" r� )r� rT )r� rT r' )r r' r' r' )rT r� r' )r' r )rT r" r' )rT r" )r� r
r0 r- r rK r rH r� �ranger� r. r r r� r r� r� r� r r r r
r� r� ) r r� r� r5 r� r� �jZoffattrr r� r� rL r r r r � s�
" *
"
(
4 &
z_tzparser.parseN)r rA rB rF r� r r r r r r � s r c C s
t j| �S )N)�DEFAULTTZPARSERr )r� r r r �_parsetzQ s r c C sF d| krt | �dfS | jd�\}}t |�t |jdd�dd� �fS dS )z9Parse a I[.F] seconds value into (seconds, microseconds).r" r r� r N)r� r0 �ljust)rL r� �fr r r r� U s r� )N)!r� Z
__future__r r� r� r� r� rC �ior Zcalendarr Zsixr r r r
r r
�__all__�objectr
rF r r< r� r� r r r r r r� r r r r �<module> s< # o X
e . dateutil/__pycache__/tzwin.cpython-36.pyc 0000644 00000000205 14751155147 0014377 0 ustar 00 3
6�cY; � @ s d dl T dS )� )�*N)Ztz.win� r r �/usr/lib/python3.6/tzwin.py�<module> s dateutil/__pycache__/easter.cpython-36.pyc 0000644 00000004036 14751155147 0014515 0 ustar 00 3
6�cYE
� @ s4 d Z ddlZddddgZdZdZd Zefd
d�ZdS ) zx
This module offers a generic easter computing method for any given year, using
Western, Orthodox or Julian algorithms.
� N�easter�
EASTER_JULIAN�EASTER_ORTHODOX�EASTER_WESTERN� � � c C sl d| kodkn s t d��| }|d }d}|dk r�d| d d }||d | d }|d
kr�d }|d kr�||d
d |d
d d }n�|d
}||d d| d d d| d d }||d d|d d|d d| d }||d | d
| |d d }|| | } d| d | d d d }
d| d d } tjt|�t| �t|
��S )a�
This method was ported from the work done by GM Arts,
on top of the algorithm by Claus Tondering, which was
based in part on the algorithm of Ouding (1940), as
quoted in "Explanatory Supplement to the Astronomical
Almanac", P. Kenneth Seidelmann, editor.
This algorithm implements three different easter
calculation methods:
1 - Original calculation in Julian calendar, valid in
dates after 326 AD
2 - Original method, with date converted to Gregorian
calendar, valid in years 1583 to 4099
3 - Revised method, in Gregorian calendar, valid in
years 1583 to 4099 as well
These methods are represented by the constants:
* ``EASTER_JULIAN = 1``
* ``EASTER_ORTHODOX = 2``
* ``EASTER_WESTERN = 3``
The default method is method 3.
More about the algorithm may be found at:
http://users.chariot.net.au/~gmarts/eastalg.htm
and
http://www.tondering.dk/claus/calendar.html
r r zinvalid method� r � � � � r �
i@ �d � � �
� � � � � � � �( � � )�
ValueError�datetimeZdate�int) Zyear�method�y�g�e�i�j�c�h�p�d�m� r+ � /usr/lib/python3.6/easter.pyr s( $ ",0$ )�__doc__r �__all__r r r r r+ r+ r+ r, �<module> s dateutil/__pycache__/parser.cpython-36.opt-1.pyc 0000644 00000101672 14751155147 0015471 0 ustar 00 3
6�cY�� � @ s d Z ddlmZ ddlZddlZddlZddlZddlZddlm Z ddl
m Z ddl m
Z
mZmZ ddlmZ dd lmZ d
d gZG d d
� d
e�ZG dd� de�ZG dd � d e�ZG dd� de�ZG dd� de�Ze� Zd dd
�Z G dd� de�Z e � Z dd� Z dd� Z dS ) a�
This module offers a generic date/time string parser which is able to parse
most known formats to represent a date and/or time.
This module attempts to be forgiving with regards to unlikely input formats,
returning a datetime object even for dates which are ambiguous. If an element
of a date/time stamp is omitted, the following rules are applied:
- If AM or PM is left unspecified, a 24-hour clock is assumed, however, an hour
on a 12-hour clock (``0 <= hour <= 12``) *must* be specified if AM or PM is
specified.
- If a time zone is omitted, a timezone-naive datetime is returned.
If any other elements are missing, they are taken from the
:class:`datetime.datetime` object passed to the parameter ``default``. If this
results in a day number exceeding the valid number of days per month, the
value falls back to the end of the month.
Additional resources about date/time string formats can be found below:
- `A summary of the international standard date and time notation
<http://www.cl.cam.ac.uk/~mgk25/iso-time.html>`_
- `W3C Date and Time Formats <http://www.w3.org/TR/NOTE-datetime>`_
- `Time Formats (Planetary Rings Node) <http://pds-rings.seti.org/tools/time_formats.html>`_
- `CPAN ParseDate module
<http://search.cpan.org/~muir/Time-modules-2013.0912/lib/Time/ParseDate.pm>`_
- `Java SimpleDateFormat Class
<https://docs.oracle.com/javase/6/docs/api/java/text/SimpleDateFormat.html>`_
� )�unicode_literalsN)�StringIO)�
monthrange)� text_type� binary_type�
integer_types� )�
relativedelta)�tz�parse�
parserinfoc @ sn e Zd Zejd�Zdd� Zdd� Zdd� Zdd � Z d
d � Z
e d d
� �Z e dd� �Z
e dd� �Ze dd� �ZdS )�_timelexz([.,])c C sd t |t�r|j� }t |t�r$t|�}t|dd �d krHtdj|jj d���|| _
g | _ g | _ d| _
d S )N�readz8Parser must be a string or character stream, not {itype})ZitypeF)�
isinstancer �decoder r �getattr� TypeError�format� __class__�__name__�instream� charstack�
tokenstack�eof)�selfr � r � /usr/lib/python3.6/parser.py�__init__4 s
z_timelex.__init__c C s� | j r| j jd�S d}d}d}�x�| j�s | jr>| jjd�}n&| jjd�}x|dkrb| jjd�}qLW |srd| _P q"|s�|}| j|�r�d}n$| j|�r�d}n| j|�r�d }P nP q"|dk� r�d}| j|�r�||7 }n$|d
kr�||7 }d }n| jj |� P q"|dk�rX| j|��r||7 }n>|d
k�s:|d k�rHt
|�d
k�rH||7 }d}n| jj |� P q"|d k�r�d}|d
k�s|| j|��r�||7 }n6| j|��r�|d d
k�r�||7 }d}n| jj |� P q"|dkr"|d
k�s�| j|��r�||7 }q"| j|��r|d d
k�r||7 }d }q"| jj |� P q"W |dk�r�|�sN|j d
�dk�sN|d dk�r�| j j
|�}|d }x(|dd� D ]}|�rp| j j |� �qpW |dk�r�|j d
�dk�r�|jd d
�}|S )a�
This function breaks the time string into lexical units (tokens), which
can be parsed by the parser. Lexical units are demarcated by changes in
the character set, so any continuous string of letters is considered
one unit, any continuous string of numbers is considered one unit.
The main complication arises from the fact that dots ('.') can be used
both as separators (e.g. "Sep.20.2009") or decimal points (e.g.
"4:30:21.447"). As such, it is necessary to read the full context of
any dot-separated strings before breaking it into tokens; as such, this
function maintains a "token stack", for when the ambiguous context
demands that multiple tokens be parsed at once.
r FNr � T�a�0� �.�a.�,� �0.z.,���r' )r# r& r' )r �popr r r r �isword�isnum�isspace�append�len�count�_split_decimal�split�replace)r Z seenletters�token�state�nextchar�l�tokr r r � get_tokenD s�
"
z_timelex.get_tokenc C s | S )Nr )r r r r �__iter__� s z_timelex.__iter__c C s | j � }|d krt�|S )N)r7 �
StopIteration)r r2 r r r �__next__� s z_timelex.__next__c C s | j � S )N)r: )r r r r �next� s z
_timelex.nextc C s t | |��S )N)�list)�cls�sr r r r0 � s z_timelex.splitc C s |j � S )z5 Whether or not the next character is part of a word )�isalpha)r= r4 r r r r) � s z_timelex.iswordc C s |j � S )z0 Whether the next character is part of a number )�isdigit)r= r4 r r r r* � s z_timelex.isnumc C s |j � S )z* Whether the next character is whitespace )r+ )r= r4 r r r r+ � s z_timelex.isspaceN)r �
__module__� __qualname__�re�compiler/ r r7 r8 r: r; � classmethodr0 r) r* r+ r r r r r
0 s
m r
c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
� _resultbasec C s x| j D ]}t| |d � qW d S )N)� __slots__�setattr)r �attrr r r r � s z_resultbase.__init__c C sN g }x6| j D ],}t| |�}|d k r |jd|t|�f � q W d|dj|�f S )Nz%s=%sz%s(%s)z, )rG r r, �repr�join)r Z classnamer5 rI �valuer r r �_repr� s
z_resultbase._reprc s t � fdd�� jD ��S )Nc 3 s | ]}t � |�d k V qd S )N)r )�.0rI )r r r � <genexpr>� s z&_resultbase.__len__.<locals>.<genexpr>)�sumrG )r r )r r �__len__� s z_resultbase.__len__c C s | j | jj�S )N)rM r r )r r r r �__repr__� s z_resultbase.__repr__N)r rA rB r rM rQ rR r r r r rF � s rF c @ s� e Zd ZdZdddddddd d
d d d
ddddddgZdcdddedfdgdhdigZdjdkdldmdndodpdqdrdsdtdug ZdvdwdxgZdydzgZdFdGdHgZ dgZ
i Z d{dJdK�Z dLdM� Z
dNdO� ZdPdQ� ZdRdS� ZdTdU� ZdVdW� ZdXdY� ZdZd[� Zd\d]� Zd|d^d_�Zd`da� ZdbS )}r a�
Class which handles what inputs are accepted. Subclass this to customize
the language and acceptable values for each parameter.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM
and YMD. Default is ``False``.
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken
to be the year, otherwise the last number is taken to be the year.
Default is ``False``.
r! r" r$ �;�-�/�'ZatZon�andZad�m�tZof�stZndZrdZth�Mon�Monday�Tue�Tuesday�Wed� Wednesday�Thu�Thursday�Fri�Friday�Sat�Saturday�Sun�Sunday�Jan�January�Feb�February�Mar�March�Apr�April�May�Jun�June�Jul�July�Aug�August�Sep�Sept� September�Oct�October�Nov�November�Dec�December�h�hour�hours�minute�minutesr> �second�seconds�amr �pm�p�UTCZGMT�ZFc C s� | j | j�| _| j | j�| _| j | j�| _| j | j�| _| j | j �| _
| j | j �| _ | j | j
�| _|| _|| _tj� j| _| jd d | _d S )N�d )�_convert�JUMP�_jump�WEEKDAYS� _weekdays�MONTHS�_months�HMS�_hms�AMPM�_ampm�UTCZONE�_utczone�PERTAIN�_pertain�dayfirst� yearfirst�timeZ localtimeZtm_year�_year�_century)r r� r� r r r r s zparserinfo.__init__c C sP i }xFt |�D ]:\}}t|t�r<x&|D ]}|||j� < q&W q|||j� < qW |S )N)� enumerater �tuple�lower)r ZlstZdct�i�vr r r r� * s
zparserinfo._convertc C s |j � | jkS )N)r� r� )r �namer r r �jump4 s zparserinfo.jumpc C sH t |�tdd� | jj� D ��krDy| j|j� S tk
rB Y nX d S )Nc s s | ]}t |�V qd S )N)r- )rN �nr r r rO 8 s z%parserinfo.weekday.<locals>.<genexpr>)r- �minr� �keysr� �KeyError)r r� r r r �weekday7 s zparserinfo.weekdayc C sL t |�tdd� | jj� D ��krHy| j|j� d S tk
rF Y nX d S )Nc s s | ]}t |�V qd S )N)r- )rN r� r r r rO @ s z#parserinfo.month.<locals>.<genexpr>r )r- r� r� r� r� r� )r r� r r r �month? s zparserinfo.monthc C s( y| j |j� S tk
r" d S X d S )N)r� r� r� )r r� r r r �hmsG s zparserinfo.hmsc C s( y| j |j� S tk
r" d S X d S )N)r� r� r� )r r� r r r �ampmM s zparserinfo.ampmc C s |j � | jkS )N)r� r� )r r� r r r �pertainS s zparserinfo.pertainc C s |j � | jkS )N)r� r� )r r� r r r �utczoneV s zparserinfo.utczonec C s || j krdS | jj|�S )Nr )r� �TZOFFSET�get)r r� r r r �tzoffsetY s
zparserinfo.tzoffsetc C sJ |dk rF| rF|| j 7 }t|| j �dkrF|| jk r>|d7 }n|d8 }|S )Nr� �2 )r� �absr� )r �year�century_specifiedr r r � convertyear_ s
zparserinfo.convertyearc C sl |j d k r | j|j |j�|_ |jdkr.|j s8|jdkrFd|_d|_n"|jdkrh|jrh| j|j�rhd|_dS )Nr r� r� T)r� r� r� r� �tznamer� )r �resr r r �validatei s
zparserinfo.validateN)r[ r\ )r] r^ )r_ r` )ra rb )rc rd )re rf )rg rh )ri rj )rk rl )rm rn )ro rp )rq rq )rr rs )rt ru )rv rw )rx ry rz )r{ r| )r} r~ )r r� )r� r� r� )rX r� r� )r> r� r� )r� r )r� r� )FF)F)r rA rB �__doc__r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r r r r r � sV
c sP e Zd Z� fdd�Zedd� �Zedd� �Zdd� Z� fd d
�Zd d � Z � Z
S )
�_ymdc s$ t | j| �j||� d| _|| _d S )NF)�superr r r� �tzstr)r r� �args�kwargs)r r r r w s z
_ymd.__init__c C s& y t | �|kS tk
r dS X d S )NF)�int�
ValueError)r2 r� r r r �token_could_be_year| s z_ymd.token_could_be_yearc s � fdd�|D �S )Nc s g | ]}t j|� �r|�qS r )r� r� )rN r2 )r� r r �
<listcomp>� s z3_ymd.find_potential_year_tokens.<locals>.<listcomp>r )r� �tokensr )r� r �find_potential_year_tokens� s z _ymd.find_potential_year_tokensc C sF x@t | �D ]4\}}tj||�}t|�dkr
t|d �dkr
|S q
W dS )zk
attempt to deduce if a pre 100 year was lost
due to padded zeros being taken off
r r r% N)r� r� r� r- )r r� �indexr2 Zpotential_year_tokensr r r �find_probable_year_index� s z _ymd.find_probable_year_indexc sN t |d�r&|j� r4t|�dkr4d| _n|dkr4d| _t| j| �jt|�� d S )NrQ r% Tr� )�hasattrr@ r- r� r� r r, r� )r �val)r r r r, � s
z _ymd.appendc C s, t | �}d\}}}|dkr&td���n�|dks>|d kr�|dkr�|d
krT| | }| |= |dksd|d kr�| d dkrz| d }n| d }�n�|dkr�| d dkr�| \}}n8| d dkr�| \}}n"|r�| d dkr�| \}}n| \}}�nB|dk�r"|dk�r| \}}}�n |dk�rF| d dk�s.|�r:| d dk�r:| \}}}n
| \}}}n�|dk�rv| d dk�rj| \}}}n
| \}}}n�| d dk�s�| jtj| j��dk�s�|�r�| d dk�r�| d dk�r�|�r�| d dk�r�| \}}}n
| \}}}n8| d dk�s |�r| d dk�r| \}}}n
| \}}}|||fS ) N� zMore than three YMD valuesr r% r � � )NNNr' r' r' )r- r� r� r
r0 r� )r �mstridxr� r� Zlen_ymdr� r� �dayr r r � resolve_ymd� sR
"
" "
z_ymd.resolve_ymd) r rA rB r � staticmethodr� r� r� r, r� �
__classcell__r r )r r r� v s
r� c @ sF e Zd Zd
dd�Zddd�ZG dd� de�Zdd d
�Zed d � �Z dS )�parserNc C s |pt � | _d S )N)r �info)r r� r r r r � s zparser.__init__Fc K sV |dkr t j j� jddddd�}| j|f|�\}}|dkrBtd��t|�dkrVtd��i }x&dD ] } t|| �}
|
dk r`|
|| < q`W d|kr�|jdkr�|jn|j} |jdkr�|jn|j} |j dkr�|j n|j }
|
t
| | �d
kr�t
| | �d
|d< |jf |�}|j dk �r$|j �r$|t j |j d� }|�s8t
|tj��sJ|�r�|j|k�r�t
|tj��rh||j|j�}n |j|j�}t
|t j��r�|}n<t
|t��r�tj|�}n$t
|t��r�tj|j|�}ntd��|j|d�}nf|j�r�|jtjk�r�|jtj� d�}n>|jdk�r|jtj� d�}n |j�r8|jtj|j|j�d�}|jdd��rN||fS |S dS )aV
Parse the date/time string into a :class:`datetime.datetime` object.
:param timestr:
Any date/time string using the supported formats.
:param default:
The default datetime object, if this is a datetime object and not
``None``, elements specified in ``timestr`` replace elements in the
default object.
:param ignoretz:
If set ``True``, time zones in parsed strings are ignored and a
naive :class:`datetime.datetime` object is returned.
:param tzinfos:
Additional time zone names / aliases which may be present in the
string. This argument maps time zone names (and optionally offsets
from those time zones) to time zones. This parameter can be a
dictionary with timezone aliases mapping time zone names to time
zones or a function taking two parameters (``tzname`` and
``tzoffset``) and returning a time zone.
The timezones to which the names are mapped can be an integer
offset from UTC in minutes or a :class:`tzinfo` object.
.. doctest::
:options: +NORMALIZE_WHITESPACE
>>> from dateutil.parser import parse
>>> from dateutil.tz import gettz
>>> tzinfos = {"BRST": -10800, "CST": gettz("America/Chicago")}
>>> parse("2012-01-19 17:21:00 BRST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21, tzinfo=tzoffset(u'BRST', -10800))
>>> parse("2012-01-19 17:21:00 CST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21,
tzinfo=tzfile('/usr/share/zoneinfo/America/Chicago'))
This parameter is ignored if ``ignoretz`` is set.
:param **kwargs:
Keyword arguments as passed to ``_parse()``.
:return:
Returns a :class:`datetime.datetime` object or, if the
``fuzzy_with_tokens`` option is ``True``, returns a tuple, the
first element being a :class:`datetime.datetime` object, the second
a tuple containing the fuzzy tokens.
:raises ValueError:
Raised for invalid or unknown string format, if the provided
:class:`tzinfo` is not in a valid format, or if an invalid date
would be created.
:raises TypeError:
Raised for non-string or character stream input.
:raises OverflowError:
Raised if the parsed date exceeds the largest valid C integer on
your system.
Nr )r� r� r� � microsecondzUnknown string formatz String does not contain a date.r� r� r� r� r� r� r� r )r� z9Offset must be tzinfo subclass, tz string, or int offset.)�tzinfo�fuzzy_with_tokensF)r� r� r� r� r� r� r� )�datetimeZnowr1 �_parser� r- r r� r� r� r r� r r � collections�Callabler� r� r� r� r r
r� r r� ZtzlocalZtzutc)r �timestr�defaultZignoretzZtzinfosr� r� �skipped_tokens�replrI rL ZcyearZcmonthZcday�retZtzdatar� r r r r � s\ ?
z parser.parsec @ s& e Zd Zddddddddd d
d g Zd S )
zparser._resultr� r� r� r� r� r� r� r� r� r� r� N)r rA rB rG r r r r �_resulti s r� c C sJ
|rd}| j }|dkr |j}|dkr*|j}| j� }tj|�}d } t� }
� y�t|�} d!} t|�}
d}� xJ||
k � r�y|| }t |�}W n t
k
r� d}Y nX |dk �r�t|| �}|d7 }t| �dk�rH|d"k�rH|j dk�rH||
k�s || dk�rH|j || �dk�rH||d }t
|dd� �|_ |dk�r�t
|dd� �|_qf|d k�st|d k�r||d jd
�d k�r||d }| �r�||d jd
�d#k�r�| j|dd� � | j|dd� � | j|dd� � n<t
|dd� �|_ t
|dd� �|_t|dd� �\|_|_qf|d$k�r�||d }| j|dd� � | j|dd � � | j|d d � � |d k�r�t
|d d� �|_ t
|dd � �|_|d k�r�t
|d d� �|_qf||
k �r�|j || �dk �s |d |
k �r0|| dk�r0|j ||d �dk �r0|| dk�r|d7 }|j || �}�x�|dk�rZt
|�|_ |d �r�t
d|d �|_nL|dk�r�t
|�|_|d �r�t
d|d �|_n|dk�r�t|�\|_|_|d7 }||
k�s�|dk�r�P y|| }t |�}W n t
k
�r� P Y n8X |d7 }|d7 }||
k �r(|j || �}|dk �r(|}�q(W qf||
k�r�||d dk�r�|j ||d �dk �r�|j ||d �}|dk�r�t
|�|_|d }|�r�t
d| �|_n|dk�r�t|�\|_|_qf|d |
k �rf|| dk�rft
|�|_ |d7 }t || �}t
|�|_|d �r$t
d|d �|_|d7 }||
k �r�|| dk�r�t||d �\|_|_|d7 }qf||
k �r�|| d%k�r�|| }| j|� |d7 }||
k �r�|j|| � �r�y| j|| � W nJ t
k
�r |j|| �}|dk �r| j|� t| �d } nd&S Y nX |d7 }||
k �r�|| |k�r�|d7 }|j|| �}|dk �rj| j|� t| �d } n| j|| � |d7 }qf||
k�s�|j|| ��rH|d |
k �r4|j||d �dk �r4t
|�|_ |j d k �r |j||d �dk�r | j d 7 _ n*|j d k�r*|j||d �dk�r*d|_ |d7 }n
| j|� |d7 }qf|j|| �dk �r�t
|�|_ |j d k �r�|j|| �dk�r�| j d 7 _ n&|j d k�r�|j|| �dk�r�d|_ |d7 }qf|�s�d'S |d7 }qf|j|| �}|dk �r||_|d7 }qf|j|| �}|dk � r:| j|� t| �d } |d7 }||
k rf|| d(k�r�|| }|d7 }| j|| � |d7 }||
k � r8|| |k� r8|d7 }| j|| � |d7 }qf|d |
k rf|| ||d k�o�dkn rf|j||d �rfyt
||d �}W n t
k
� r Y nX | jt|j|��� |d7 }qf|j|| �}|dk �
r0d}|� rl|jdk � rld}|j dk� r�|� r�d}nt
d)��n2d|j k� o�d kn � s�|� r�d}nt
d*��|�
r|dk� r�|j d k � r�| j d 7 _ n |dk�
r|j d k�
rd|_ ||_n|�
r&| j|
| ||�} |d7 }qf|j dk �
r�t|| �dk�
r�|j dk�
r�|j dk�
r�dd� || D � �
r�|| |_ |j |j �|_ |d7 }||
k rf|| d+krfd,|| dk ||< d|_ |j |j �rfd|_ qf|j dk � rz|| d-k� rzd/|| dk }|d7 }t|| �}|dk� rZt
|| dd� �d t
|| dd� �d |_ nz|d |
k � r�||d dk� r�t
|| �d t
||d �d |_ |d7 }n*|dk� r�t
|| dd� �d |_ nd0S |d7 }| j |9 _ |d |
k rf|j|| �rf||d d krf||d d krfdt||d � k� oDdkn rfd d� ||d D � rf||d |_ |d7 }qf|j|| �� p�|� s�d1S | j|
| ||�} |d7 }qfW | j | ||�\}}}|dk � r�||_ | j!|_!|dk � r�||_|dk � r�||_"W n t#t
t$fk
�
r d2S X |j%|��
s,d3S |�
r>|t&|
�fS |dfS dS )4a
Private method which performs the heavy lifting of parsing, called from
``parse()``, which passes on its ``kwargs`` to this function.
:param timestr:
The string to parse.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM
and YMD. If set to ``None``, this value is retrieved from the
current :class:`parserinfo` object (which itself defaults to
``False``).
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken
to be the year, otherwise the last number is taken to be the year.
If this is set to ``None``, the value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param fuzzy:
Whether to allow fuzzy parsing, allowing for string like "Today is
January 1, 2047 at 8:21:00AM".
:param fuzzy_with_tokens:
If ``True``, ``fuzzy`` is automatically set to True, and the parser
will return a tuple where the first element is the parsed
:class:`datetime.datetime` datetimestamp and the second element is
a tuple containing the portions of the string which were ignored:
.. doctest::
>>> from dateutil.parser import parse
>>> parse("Today is January 1, 2047 at 8:21:00AM", fuzzy_with_tokens=True)
(datetime.datetime(2047, 1, 1, 8, 21), (u'Today is ', u' ', u'at '))
TNr% r r r� � �:� r" � r� � �
r! �< rT rU FzNo hour specified with zAM or PM flag.zInvalid hour specified for z12-hour clock.� c S s g | ]}|t jkr|�qS r )�string�ascii_uppercase)rN �xr r r r� � s z!parser._parse.<locals>.<listcomp>�+i �(�)c S s g | ]}|t jkr|�qS r )r� r� )rN r� r r r r� s ���r' )r% r� r' )r� r� r� )rT rU r" )NN)NN)rT rU z%No hour specified with AM or PM flag.z)Invalid hour specified for 12-hour clock.)r� rT )r� rT )r� rT r' )r' r )NN)NN)NN)NN)'r� r� r� r� r
r0 r< r� r- �floatr� r� r� r� r� �findr, �_parsemsr� r� r� r� r� r� r� �strr� � _skip_tokenr� r� r� r� r� r� r� �
IndexError�AssertionErrorr� r� ) r r� r� r� Zfuzzyr� r� r� r5 �last_skipped_token_ir� Zymdr� �len_lr� Z
value_reprrL �len_lir> �idxZnewidxZ
sec_remainder�sepZ val_is_ampm�signalr� r� r� r r r r� n s� )
$
,
&
$$
2
4 &
.&
z
parser._parsec C s8 ||d kr"| d || 7 < n| j || � |}|S )Nr r' )r, )r� r� r� r5 r r r r� - s
zparser._skip_token)N)NFN)NNFF)
r rA rB r r rF r� r� r� r� r r r r r� � s
Ar� c K s( |rt |�j| f|�S tj| f|�S dS )a)
Parse a string in one of the supported formats, using the
``parserinfo`` parameters.
:param timestr:
A string containing a date/time stamp.
:param parserinfo:
A :class:`parserinfo` object containing parameters for the parser.
If ``None``, the default arguments to the :class:`parserinfo`
constructor are used.
The ``**kwargs`` parameter takes the following keyword arguments:
:param default:
The default datetime object, if this is a datetime object and not
``None``, elements specified in ``timestr`` replace elements in the
default object.
:param ignoretz:
If set ``True``, time zones in parsed strings are ignored and a naive
:class:`datetime` object is returned.
:param tzinfos:
Additional time zone names / aliases which may be present in the
string. This argument maps time zone names (and optionally offsets
from those time zones) to time zones. This parameter can be a
dictionary with timezone aliases mapping time zone names to time
zones or a function taking two parameters (``tzname`` and
``tzoffset``) and returning a time zone.
The timezones to which the names are mapped can be an integer
offset from UTC in minutes or a :class:`tzinfo` object.
.. doctest::
:options: +NORMALIZE_WHITESPACE
>>> from dateutil.parser import parse
>>> from dateutil.tz import gettz
>>> tzinfos = {"BRST": -10800, "CST": gettz("America/Chicago")}
>>> parse("2012-01-19 17:21:00 BRST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21, tzinfo=tzoffset(u'BRST', -10800))
>>> parse("2012-01-19 17:21:00 CST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21,
tzinfo=tzfile('/usr/share/zoneinfo/America/Chicago'))
This parameter is ignored if ``ignoretz`` is set.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM and
YMD. If set to ``None``, this value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken to
be the year, otherwise the last number is taken to be the year. If
this is set to ``None``, the value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param fuzzy:
Whether to allow fuzzy parsing, allowing for string like "Today is
January 1, 2047 at 8:21:00AM".
:param fuzzy_with_tokens:
If ``True``, ``fuzzy`` is automatically set to True, and the parser
will return a tuple where the first element is the parsed
:class:`datetime.datetime` datetimestamp and the second element is
a tuple containing the portions of the string which were ignored:
.. doctest::
>>> from dateutil.parser import parse
>>> parse("Today is January 1, 2047 at 8:21:00AM", fuzzy_with_tokens=True)
(datetime.datetime(2047, 1, 1, 8, 21), (u'Today is ', u' ', u'at '))
:return:
Returns a :class:`datetime.datetime` object or, if the
``fuzzy_with_tokens`` option is ``True``, returns a tuple, the
first element being a :class:`datetime.datetime` object, the second
a tuple containing the fuzzy tokens.
:raises ValueError:
Raised for invalid or unknown string format, if the provided
:class:`tzinfo` is not in a valid format, or if an invalid date
would be created.
:raises OverflowError:
Raised if the parsed date exceeds the largest valid C integer on
your system.
N)r� r �
DEFAULTPARSER)r� r r� r r r r < s _c @ s$ e Zd ZG dd� de�Zdd� ZdS )� _tzparserc @ s< e Zd ZddddddgZG dd� de�Zd d
� Zd d � Zd
S )z_tzparser._result�stdabbr� stdoffset�dstabbr� dstoffset�start�endc @ s e Zd ZdddddddgZdS ) z_tzparser._result._attrr� �weekr� �yday�jydayr� r� N)r rA rB rG r r r r �_attr� s r c C s
| j d�S )N� )rM )r r r r rR � s z_tzparser._result.__repr__c C s" t j| � | j� | _| j� | _d S )N)rF r r r r )r r r r r � s
z_tzparser._result.__init__N)r rA rB rG rF r rR r r r r r r� � s
r� c C s� | j � }tj|�}�y�t|�}d}�x�||k �r�|}x(||k r\dd� || D � r\|d7 }q6W ||k�r�|js�d}dj|||� �|_nd}dj|||� �|_|}||k o�|| dks�|| d d
k�r�|| d k� r�d || dk }|d7 }nd }t|| �} | d k�rJt||t|| d d � �d
t|| d d � �d | � n�|d |k �r�||d dk�r�t||t|| �d
t||d �d | � |d 7 }n4| d k�r�t||t|| d d � �d
| � nd S |d7 }|j�r�P q&P q&W ||k �r0x*t ||�D ] }|| dk�rd||< �qW |d7 }||k�r>�n�d|j
d� k�oXdkn �r�dd� ||d � D � �r�x�|j |j fD ]�}
t|| �|
_
|d 7 }|| d k�r�t||d �d } |d7 }n t|| �} |d 7 }| �r| |
_t|| �d d |
_nt|| �|
_|d 7 }t|| �|
_|d 7 }�q�W ||k �r�|| d!k�rjd#|| dk }|d7 }nd}|jt|| � | |_�nL|j
d�d k�r�||d � j
d�d k�r�dd� ||d � D � �rx|j |j fD �]�}
|| dk�r|d7 }t|| �|
_n�|| dk�r�|d7 }t|| �|
_
|d7 }|d7 }t|| �|
_|
jdk�r\d$|
_|d7 }|d7 }t|| �d d |
_nt|| �d |
_|d7 }||k �r�|| dk�r�|d7 }t|| �} | d k�rt|| d d � �d
t|| d d � �d |
_n�|d |k �r�||d dk�r�t|| �d
t||d �d |
_|d 7 }|d |k �r�||d dk�r�|d 7 }|
jt|| �7 _n*| d k�r�t|| d d � �d
|
_nd S |d7 }|d7 }�q�W W n tttfk
�r� d S X |S )%Nr c S s g | ]}|d kr|�qS )z0123456789:,-+r )rN r� r r r r� � s z#_tzparser.parse.<locals>.<listcomp>r r r
r r� rT �
0123456789r� r% i r� r� rS r$ r� � c S s* g | ]"}|d kr|D ]}|dkr|�qqS )r$ r r )rN r� �yr r r r� � s
� rU c
S s* g | ]"}|dkr|D ]}|dkr|�qqS ) r$ rU �J�Mr" rT r� r )r$ rU r r r" rT r� r )rN r� r r r r r� s r r r� )r� rT )r� rT r' )r r' r' r' )rT r� r' )r' r r' )r� r
r0 r- r rK r rH r� �ranger. r r r� r r� r� r� r r r r
r� r� r� ) r r� r� r5 r� r� �jZoffattrr r� r� rL r r r r � s�
" *
"
(
4 &
z_tzparser.parseN)r rA rB rF r� r r r r r r � s r c C s
t j| �S )N)�DEFAULTTZPARSERr )r� r r r �_parsetzQ s r c C sF d| krt | �dfS | jd�\}}t |�t |jdd�dd� �fS dS )z9Parse a I[.F] seconds value into (seconds, microseconds).r" r r� r N)r� r0 �ljust)rL r� �fr r r r� U s r� )N)!r� Z
__future__r r� r� r� r� rC �ior Zcalendarr Zsixr r r r
r r
�__all__�objectr
rF r r< r� r� r r r r r r� r r r r �<module> s< # o X
e . dateutil/__pycache__/relativedelta.cpython-36.pyc 0000644 00000033731 14751155147 0016063 0 ustar 00 3
6�cYiZ � @ s� d dl Z d dlZd dlZd dlmZ d dlmZ d dlmZ ddl m
Z
e dd� e d �D �� \Z
ZZZZZZZd
d d d
ddddgZG dd
� d
e�Zdd� ZdS )� N)�copysign)�
integer_types)�warn� )�weekdayc c s | ]}t |�V qd S )N)r )�.0�x� r �#/usr/lib/python3.6/relativedelta.py� <genexpr>
s r � �
relativedelta�MO�TU�WE�TH�FR�SA�SUc @ s� e Zd ZdZd%dd�Zdd� Zedd � �Zejd
d � �Zd d � Z d
d� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd� ZeZdd � ZeZd d � ZdZd d � Zd!d"� ZeZd#d$� ZdS )&r
a�
The relativedelta type is based on the specification of the excellent
work done by M.-A. Lemburg in his
`mx.DateTime <http://www.egenix.com/files/python/mxDateTime.html>`_ extension.
However, notice that this type does *NOT* implement the same algorithm as
his work. Do *NOT* expect it to behave like mx.DateTime's counterpart.
There are two different ways to build a relativedelta instance. The
first one is passing it two date/datetime classes::
relativedelta(datetime1, datetime2)
The second one is passing it any number of the following keyword arguments::
relativedelta(arg1=x,arg2=y,arg3=z...)
year, month, day, hour, minute, second, microsecond:
Absolute information (argument is singular); adding or subtracting a
relativedelta with absolute information does not perform an aritmetic
operation, but rather REPLACES the corresponding value in the
original datetime with the value(s) in relativedelta.
years, months, weeks, days, hours, minutes, seconds, microseconds:
Relative information, may be negative (argument is plural); adding
or subtracting a relativedelta with relative information performs
the corresponding aritmetic operation on the original datetime value
with the information in the relativedelta.
weekday:
One of the weekday instances (MO, TU, etc). These instances may
receive a parameter N, specifying the Nth weekday, which could
be positive or negative (like MO(+1) or MO(-2). Not specifying
it is the same as specifying +1. You can also use an integer,
where 0=MO.
leapdays:
Will add given days to the date found, if year is a leap
year, and the date found is post 28 of february.
yearday, nlyearday:
Set the yearday or the non-leap year day (jump leap days).
These are converted to day/month/leapdays information.
Here is the behavior of operations with relativedelta:
1. Calculate the absolute year, using the 'year' argument, or the
original datetime year, if the argument is not present.
2. Add the relative 'years' argument to the absolute year.
3. Do steps 1 and 2 for month/months.
4. Calculate the absolute day, using the 'day' argument, or the
original datetime day, if the argument is not present. Then,
subtract from the day until it fits in the year and month
found after their operations.
5. Add the relative 'days' argument to the absolute day. Notice
that the 'weeks' argument is multiplied by 7 and added to
'days'.
6. Do steps 1 and 2 for hour/hours, minute/minutes, second/seconds,
microsecond/microseconds.
7. If the 'weekday' argument is present, calculate the weekday,
with the given (wday, nth) tuple. wday is the index of the
weekday (0-6, 0=Mon), and nth is the number of weeks to add
forward or backward, depending on its signal. Notice that if
the calculated date is already Monday, for example, using
(0, 1) or (0, -1) won't change the day.
Nr c C s t dd� ||fD ��r td��|o$|�r�t|tj�o>t|tj�sHtd��t|tj�t|tj�kr�t|tj�s~tjj|j� �}n t|tj�s�tjj|j� �}d| _d| _ d| _
d| _ d| _ d| _
d| _d| _d | _d | _d | _d | _d | _d | _d | _d | _d| _|j|j d |j|j }| j|� | j|�}||k �rFtj }d}n
tj }d}x.|||��r~||7 }| j|� | j|�}�qRW || }|j|j
d | _|j| _�nV|| _|| _ ||d | _
|| _ || _ | | _
|
| _| | _| | _|
| _|| _|| _|| _|| _|| _t d
d� | |
|||||fD ���r4t d t � t|t ��rLt!| | _n|| _d}|�rb|}n|�r||}|dk�r|d | _ |�r�ddddddddddddg }x\t"|�D ]D\} } || k�r�| d | _| dk�r�|| _n||| d | _P �q�W td| ��| j#� d S ) Nc s s" | ]}|d k o|t |�kV qd S )N)�int)r r r r r
r c s z)relativedelta.__init__.<locals>.<genexpr>zGNon-integer years and months are ambiguous and not currently supported.z&relativedelta only diffs datetime/dater � r i�Q r c s s" | ]}|d k ot |�|kV qd S )N)r )r r r r r
r � s z2Non-integer value passed as absolute information. z4This is not a well-defined condition and will raise zerrors in future versions.�; � �Z �x � � �� �� i i0 iN in zinvalid year day (%d)���zfNon-integer value passed as absolute information. This is not a well-defined condition and will raise z�Non-integer value passed as absolute information. This is not a well-defined condition and will raise errors in future versions.r )$�any�
ValueError�
isinstance�datetime�date� TypeError� fromordinal� toordinal�years�months�days�leapdays�hours�minutes�seconds� microseconds�year�month�dayr �hour�minute�second� microsecond� _has_time� _set_months�__radd__�operator�gt�ltr �DeprecationWarningr �weekdays� enumerate�_fix) �selfZdt1Zdt2r( r) r* r+ �weeksr, r- r. r/ r0 r1 r2 r ZyeardayZ nlyeardayr3 r4 r5 r6 ZdtmZcompareZ incrementZdeltaZydayZydayidx�idxZydaysr r r
�__init__[ s�
zrelativedelta.__init__c C s� t | j�dkrHt| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dkr�t| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dkr�t| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dk�r"t| j�}t| j| d�\}}|| | _| j|| 7 _t | j�dk�rlt| j�}t| j| d�\}}|| | _| j || 7 _ | j�s�| j�s�| j�s�| j�s�| j
d k �s�| j d k �s�| j d k �s�| j
d k �r�d | _nd
| _d S ) Ni?B i@B r �< � � � r r r )�absr/ �_sign�divmodr. r- r, r* r) r( r3 r4 r5 r6 r7 )rA �s�div�modr r r
r@ � s<
zrelativedelta._fixc C s
| j d S )Nr )r* )rA r r r
rB � s zrelativedelta.weeksc C s | j | jd |d | _ d S )Nr )r* rB )rA �valuer r r
rB � s c C sR || _ t| j �dkrHt| j �}t| j | d�\}}|| | _ || | _nd| _d S )NrH r r )r) rI rJ rK r( )rA r) rL rM rN r r r
r8 s
zrelativedelta._set_monthsc C s� t | j�}t| jd| j| d�}t |�}t| jd|| d�}t |�}t| jd|| d�}t |�}t| jd|| �}| j| j| j |||||| j
| j | j | j
| j| j| j| j| jd�S )aA
Return a version of this object represented entirely using integer
values for the relative attributes.
>>> relativedelta(days=1.5, hours=2).normalized()
relativedelta(days=1, hours=14)
:return:
Returns a :class:`dateutil.relativedelta.relativedelta` object.
rG rH rE �
� g ��.A)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )r r* �roundr, r- r. r/ � __class__r( r) r+ r0 r1 r2 r r3 r4 r5 r6 ) rA r* Zhours_fr, Z minutes_fr- Z seconds_fr. r/ r r r
�
normalized s
zrelativedelta.normalizedc
C sl t |t��r| j|j| j |j| j |j| j |j| j |j| j |j| j |j | j |j
p`| j
|j d k rp|j n| j |j d k r�|j n| j |j
d k r�|j
n| j
|jd k r�|jn| j|jd k r�|jn| j|jd k r�|jn| j|jd k r�|jn| j|jd k r�|jn| jd�S t |tj��rp| j| j| j| j|j | j| j| j|j | j |j | j
| j | j | j
| j| j| j| j| jd�S t |tj��s�tS | j�r�t |tj� �r�tjj|j� �}| j �p�|j | j }| j �p�|j }| j�r:dt| j� k�o�dkn �s�t�|| j7 }|dk�r |d7 }|d8 }n|dk �r:|d8 }|d7 }t t j ||�d | j
�pV|j
�}|||d�}x*dD ]"}t | |�}|d k �rl|||< �qlW | j}| j
�r�|d k�r�t j |��r�|| j
7 }|j!f |�tj|| j| j| j| j d
� } | j�rh| jj| jj"�pd }
} t| �d d } | d k�r<| d | j� |
d 7 } n | | j� |
d 7 } | d9 } | tj| d
�7 } | S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 r r )r0 r1 r2 r3 r4 r5 r6 � )r* r, r- r. r/ r r )r* )r3 r4 r5 r6 r )#r" r
rS r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 r# Z timedeltar$ �NotImplementedr7 r& r' rI �AssertionError�min�calendarZ
monthrange�getattrZisleap�replace�n)
rA �otherr0 r1 r2 �repl�attrrO r* �retr ZnthZjumpdaysr r r
�__add__/ s�
&
zrelativedelta.__add__c C s
| j |�S )N)ra )rA r] r r r
r9 � s zrelativedelta.__radd__c C s | j � j|�S )N)�__neg__r9 )rA r] r r r
�__rsub__� s zrelativedelta.__rsub__c C s
t |t�stS | j| j|j | j|j | j|j | j|j | j|j | j |j | j
|j
| j pb|j | j d k rr| j n|j | j
d k r�| j
n|j
| jd k r�| jn|j| jd k r�| jn|j| jd k r�| jn|j| jd k r�| jn|j| jd k r�| jn|j| jd k �r | jn|jd�S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )r" r
rV rS r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r] r r r
�__sub__� s6
zrelativedelta.__sub__c C sX | j | j | j | j | j | j | j | j | j| j | j
| j | j | j
| j| j| jd�S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rS r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r r r
rb � s
zrelativedelta.__neg__c C s� | j o�| j o�| j o�| j o�| j o�| j o�| j o�| j o�| jd ko�| j d ko�| j
d ko�| j d ko�| j d ko�| j
d ko�| jd ko�| jd k S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r r r
�__bool__� s
zrelativedelta.__bool__c C s� y t |�}W n tk
r tS X | jt| j| �t| j| �t| j| �t| j| �t| j | �t| j
| �t| j | �| j | j
| j| j| j| j| j| j| jd�S )N)r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )�floatr% rV rS r r( r) r* r, r- r. r/ r+ r0 r1 r2 r r3 r4 r5 r6 )rA r] �fr r r
�__mul__� s( zrelativedelta.__mul__c C sN t |t�stS | js|jr~| j s*|j r.dS | jj|jjkrBdS | jj|jj }}||kr~| sj|dkov| pv|dk r~dS | j|jk�oL| j|jk�oL| j|jk�oL| j|jk�oL| j |j k�oL| j
|j
k�oL| j |j k�oL| j |j k�oL| j
|j
k�oL| j|jk�oL| j|jk�oL| j|jk�oL| j|jk�oL| j|jk�oL| j|jkS )NFr )r" r
rV r r\ r( r) r* r, r- r. r/ r+ r0 r1 r2 r3 r4 r5 r6 )rA r] Zn1Zn2r r r
�__eq__� s2
&zrelativedelta.__eq__c C s | j |� S )N)ri )rA r] r r r
�__ne__ s zrelativedelta.__ne__c C s0 ydt |� }W n tk
r$ tS X | j|�S )Nr )rf r% rV rh )rA r] Z
reciprocalr r r
�__div__ s
zrelativedelta.__div__c C s� g }x.dD ]&}t | |�}|r
|jd j||d
�� q
W x6dD ].}t | |�}|d k r:|jdj|t|�d
�� q:W dj| jjdj|�d�S )Nr( r) r* r+ r, r- r. r/ z{attr}={value:+g})r_ rO r0 r1 r2 r r3 r4 r5 r6 z{attr}={value}z{classname}({attrs})z, )Z classnameZattrs)r( r) r* r+ r, r- r. r/ )r0 r1 r2 r r3 r4 r5 r6 )rZ �append�format�reprrS �__name__�join)rA �lr_ rO r r r
�__repr__ s
zrelativedelta.__repr__)NNr r r r r r r r r NNNNNNNNNN)ro �
__module__� __qualname__�__doc__rD r@ �propertyrB �setterr8 rT ra r9 rc rd rb re Z __nonzero__rh �__rmul__ri �__hash__rj rk � __truediv__rr r r r r
r
s6 G
y!
#W c C s t td| ��S )Nr )r r )r r r r
rJ " s rJ )r# rY r: Zmathr Zsixr �warningsr Z_commonr �tuple�ranger r r r r r r r> �__all__�objectr
rJ r r r r
�<module> s ( dateutil/__pycache__/_common.cpython-36.pyc 0000644 00000002145 14751155147 0014660 0 ustar 00 3
6�cY � @ s d Z G dd� de�ZdS )z'
Common code used in multiple modules.
c @ s: e Zd Zd dgZd dd�Zdd� Zdd� ZdZd d
� ZdS ) �weekday�nNc C s || _ || _d S )N)r r )�selfr r � r � /usr/lib/python3.6/_common.py�__init__ s zweekday.__init__c C s || j kr| S | j| j|�S d S )N)r � __class__r )r r r r r �__call__
s
zweekday.__call__c C s: y | j |j ks| j|jkr dS W n tk
r4 dS X dS )NFT)r r �AttributeError)r �otherr r r �__eq__ s zweekday.__eq__c C s& d | j }| js|S d|| jf S d S )
N�MO�TU�WE�TH�FR�SA�SUz%s(%+d))r r
r r r r r )r r )r �sr r r �__repr__ s
zweekday.__repr__)N) �__name__�
__module__� __qualname__� __slots__r r r �__hash__r r r r r r s
r N)�__doc__�objectr r r r r �<module> s dateutil/__pycache__/_common.cpython-36.opt-1.pyc 0000644 00000002145 14751155147 0015617 0 ustar 00 3
6�cY � @ s d Z G dd� de�ZdS )z'
Common code used in multiple modules.
c @ s: e Zd Zd dgZd dd�Zdd� Zdd� ZdZd d
� ZdS ) �weekday�nNc C s || _ || _d S )N)r r )�selfr r � r � /usr/lib/python3.6/_common.py�__init__ s zweekday.__init__c C s || j kr| S | j| j|�S d S )N)r � __class__r )r r r r r �__call__
s
zweekday.__call__c C s: y | j |j ks| j|jkr dS W n tk
r4 dS X dS )NFT)r r �AttributeError)r �otherr r r �__eq__ s zweekday.__eq__c C s& d | j }| js|S d|| jf S d S )
N�MO�TU�WE�TH�FR�SA�SUz%s(%+d))r r
r r r r r )r r )r �sr r r �__repr__ s
zweekday.__repr__)N) �__name__�
__module__� __qualname__� __slots__r r r �__hash__r r r r r r s
r N)�__doc__�objectr r r r r �<module> s dateutil/__pycache__/_version.cpython-36.pyc 0000644 00000000506 14751155147 0015054 0 ustar 00 3
6�cY� � @ s. d Z dZdZdZeeefZdjeee��ZdS )z2
Contains information about the dateutil version.
� � � �.N) �__doc__Z
VERSION_MAJORZ
VERSION_MINORZ
VERSION_PATCHZ
VERSION_TUPLE�join�map�str�VERSION� r
r
� /usr/lib/python3.6/_version.py�<module> s
dateutil/__pycache__/tzwin.cpython-36.opt-1.pyc 0000644 00000000205 14751155147 0015336 0 ustar 00 3
6�cY; � @ s d dl T dS )� )�*N)Ztz.win� r r �/usr/lib/python3.6/tzwin.py�<module> s dateutil/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000246 14751155147 0015727 0 ustar 00 3
6�cYE � @ s d dl mZ dS )� )�VERSIONN)Z_versionr � __version__� r r � /usr/lib/python3.6/__init__.py�<module> s dateutil/__pycache__/easter.cpython-36.opt-1.pyc 0000644 00000004036 14751155147 0015454 0 ustar 00 3
6�cYE
� @ s4 d Z ddlZddddgZdZdZd Zefd
d�ZdS ) zx
This module offers a generic easter computing method for any given year, using
Western, Orthodox or Julian algorithms.
� N�easter�
EASTER_JULIAN�EASTER_ORTHODOX�EASTER_WESTERN� � � c C sl d| kodkn s t d��| }|d }d}|dk r�d| d d }||d | d }|d
kr�d }|d kr�||d
d |d
d d }n�|d
}||d d| d d d| d d }||d d|d d|d d| d }||d | d
| |d d }|| | } d| d | d d d }
d| d d } tjt|�t| �t|
��S )a�
This method was ported from the work done by GM Arts,
on top of the algorithm by Claus Tondering, which was
based in part on the algorithm of Ouding (1940), as
quoted in "Explanatory Supplement to the Astronomical
Almanac", P. Kenneth Seidelmann, editor.
This algorithm implements three different easter
calculation methods:
1 - Original calculation in Julian calendar, valid in
dates after 326 AD
2 - Original method, with date converted to Gregorian
calendar, valid in years 1583 to 4099
3 - Revised method, in Gregorian calendar, valid in
years 1583 to 4099 as well
These methods are represented by the constants:
* ``EASTER_JULIAN = 1``
* ``EASTER_ORTHODOX = 2``
* ``EASTER_WESTERN = 3``
The default method is method 3.
More about the algorithm may be found at:
http://users.chariot.net.au/~gmarts/eastalg.htm
and
http://www.tondering.dk/claus/calendar.html
r r zinvalid method� r � � � � r �
i@ �d � � �
� � � � � � � �( � � )�
ValueError�datetimeZdate�int) Zyear�method�y�g�e�i�j�c�h�p�d�m� r+ � /usr/lib/python3.6/easter.pyr s( $ ",0$ )�__doc__r �__all__r r r r r+ r+ r+ r, �<module> s dateutil/zoneinfo/__pycache__/rebuild.cpython-36.pyc 0000644 00000003405 14751155147 0016506 0 ustar 00 3
6�cY� � @ sf d dl Z d dlZd dlZd dlZd dlZd dlmZ d dlmZm Z m
Z
ddg dfdd�Z dd� Z dS ) � N)�
check_call)�tar_open� METADATA_FN� ZONEFILENAMEZgzc - sH t j� � tjj� d�}tjjt�}�zt| ��v}x|D ]}|j|� � q6W � fdd�|D �} yt dd|g| � W n, t
k
r� }
zt |
� � W Y dd}
~
X nX W dQ R X t tjj|t
�d��} tj|| dd d
� W dQ R X tjj|t�} t| d | ��6}x.tj|�D ] }
tjj||
�}|j||
� �qW W dQ R X W dtj� � X dS ) z�Rebuild the internal timezone info in dateutil/zoneinfo/zoneinfo*tar*
filename is the timezone tarball from ftp.iana.org/tz.
Zzoneinfoc s g | ]}t jj� |��qS � )�os�path�join)�.0�n)�tmpdirr � /usr/lib/python3.6/rebuild.py�
<listcomp> s zrebuild.<locals>.<listcomp>Zzicz-dN�w� T)�indentZ sort_keyszw:%s)�tempfileZmkdtempr r r �dirname�__file__r �extractr �OSError�_print_on_nosuchfile�openr �json�dumpr �listdir�add�shutilZrmtree)�filename�tag�formatZ
zonegroupsZmetadataZzonedirZ moduledirZtf�nameZ filepaths�e�f�target�entryZ entrypathr )r r
�rebuild s*
r& c C s | j dkrtjd� dS )zdPrint helpful troubleshooting message
e is an exception raised by subprocess.check_call()
� zzCould not find zic. Perhaps you need to install libc-bin or some other package that provides it, or it's not in your PATH?N)�errno�logging�error)r" r r r
r * s
r )
r) r r r r �
subprocessr Zdateutil.zoneinfor r r r& r r r r r
�<module> s dateutil/zoneinfo/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000013255 14751155147 0017562 0 ustar 00 3
6�cY[ � @ s� d dl Z d dlZd dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z ddd d
gZ d Z
d ZejZeed
�sxdd� ZG dd� de �Z dd� ZG dd� de�Ze� Zddd�Zdd� Zdd � ZdS )� N)�TarFile)�get_data)�BytesIO)�closing)�tzfile�get_zonefile_instance�gettz�gettz_db_metadataZrebuildzdateutil-zoneinfo.tar.gzZMETADATA�__exit__c O s t tj| |��S )N)r r �open)�args�kwargs� r � /usr/lib/python3.6/__init__.py�tar_open s r c @ s e Zd Zdd� ZdS )r c C s t | jffS )N)r Z _filename)�selfr r r �
__reduce__ s ztzfile.__reduce__N)�__name__�
__module__� __qualname__r r r r r r s r c C sJ yt ttt��S tk
rD } ztjdj| j| j �� d S d } ~ X nX d S )NzI/O error({0}): {1})
r r r � ZONEFILENAME�IOError�warnings�warn�format�errno�strerror)�er r r �getzoneinfofile_stream s
r c @ s e Zd Zddd�Zddd�ZdS )� ZoneInfoFileNc s� |d k r�t |dd����t�fdd��j� D ��� _t� fdd��j� D ��}� jj|� y.�j�jt��}|j� j d�}t
j |�� _ W n t
k
r� d � _ Y nX W d Q R X nt� � _d � _ d S )N�r)Zfileobj�modec 3 s: | ]2}|j � r|jtkr|jt� j|�|jd �fV qdS ))�filenameN)�isfile�name� METADATA_FNr � extractfile)�.0Zzf)�tfr r � <genexpr>/ s z(ZoneInfoFile.__init__.<locals>.<genexpr>c 3 s0 | ](}|j � s|j� r|j� j|j fV qd S )N)ZislnkZissymr$ �zonesZlinkname)r' Zzl)r r r r) 7 s zUTF-8)r �dictZ
getmembersr* �updater& Z getmemberr% �read�decode�json�loads�metadata�KeyError)r Zzonefile_streamZlinksZ
metadata_jsonZ metadata_strr )r r( r �__init__' s zZoneInfoFile.__init__c C s | j j||�S )ak
Wrapper for :func:`ZoneInfoFile.zones.get`. This is a convenience method
for retrieving zones from the zone dictionary.
:param name:
The name of the zone to retrieve. (Generally IANA zone names)
:param default:
The value to return in the event of a missing key.
.. versionadded:: 2.6.0
)r* �get)r r$ �defaultr r r r4 F s zZoneInfoFile.get)N)N)r r r r3 r4 r r r r r & s
r Fc C s2 | r
d}n t tdd�}|dkr.tt� �}|t_|S )a%
This is a convenience function which provides a :class:`ZoneInfoFile`
instance using the data provided by the ``dateutil`` package. By default, it
caches a single instance of the ZoneInfoFile object and returns that.
:param new_instance:
If ``True``, a new instance of :class:`ZoneInfoFile` is instantiated and
used as the cached instance for the next call. Otherwise, new instances
are created only as necessary.
:return:
Returns a :class:`ZoneInfoFile` object.
.. versionadded:: 2.6
N�_cached_instance)�getattrr r r r6 )Z new_instanceZzifr r r r ` s
c C s8 t jdt� tt�dkr(tjtt� �� td jj | �S )a+
This retrieves a time zone from the local zoneinfo tarball that is packaged
with dateutil.
:param name:
An IANA-style time zone name, as found in the zoneinfo file.
:return:
Returns a :class:`dateutil.tz.tzfile` time zone object.
.. warning::
It is generally inadvisable to use this function, and it is only
provided for API compatibility with earlier versions. This is *not*
equivalent to ``dateutil.tz.gettz()``, which selects an appropriate
time zone based on the inputs, favoring system zoneinfo. This is ONLY
for accessing the dateutil-specific zoneinfo (which may be out of
date compared to the system zoneinfo).
.. deprecated:: 2.6
If you need to use a specific zoneinfofile over the system zoneinfo,
instantiate a :class:`dateutil.zoneinfo.ZoneInfoFile` object and call
:func:`dateutil.zoneinfo.ZoneInfoFile.get(name)` instead.
Use :func:`get_zonefile_instance` to retrieve an instance of the
dateutil-provided zoneinfo.
z�zoneinfo.gettz() will be removed in future versions, to use the dateutil-provided zoneinfo files, instantiate a ZoneInfoFile object and use ZoneInfoFile.zones.get() instead. See the documentation for details.r )
r r �DeprecationWarning�len�_CLASS_ZONE_INSTANCE�appendr r r* r4 )r$ r r r r } s
c C s2 t jdt� tt�dkr(tjtt� �� td jS )a! Get the zonefile metadata
See `zonefile_metadata`_
:returns:
A dictionary with the database metadata
.. deprecated:: 2.6
See deprecation warning in :func:`zoneinfo.gettz`. To get metadata,
query the attribute ``zoneinfo.ZoneInfoFile.metadata``.
z�zoneinfo.gettz_db_metadata() will be removed in future versions, to use the dateutil-provided zoneinfo files, ZoneInfoFile object and query the 'metadata' attribute instead. See the documentation for details.r ) r r r8 r9 r: r; r r r1 r r r r r � s
)F)r r/ Ztarfiler Zpkgutilr �ior �
contextlibr Z dateutil.tzr �__all__r r% r r �hasattrr �objectr �listr: r r r r r r r �<module> s&
7
& dateutil/zoneinfo/__pycache__/rebuild.cpython-36.opt-1.pyc 0000644 00000003405 14751155147 0017445 0 ustar 00 3
6�cY� � @ sf d dl Z d dlZd dlZd dlZd dlZd dlmZ d dlmZm Z m
Z
ddg dfdd�Z dd� Z dS ) � N)�
check_call)�tar_open� METADATA_FN� ZONEFILENAMEZgzc - sH t j� � tjj� d�}tjjt�}�zt| ��v}x|D ]}|j|� � q6W � fdd�|D �} yt dd|g| � W n, t
k
r� }
zt |
� � W Y dd}
~
X nX W dQ R X t tjj|t
�d��} tj|| dd d
� W dQ R X tjj|t�} t| d | ��6}x.tj|�D ] }
tjj||
�}|j||
� �qW W dQ R X W dtj� � X dS ) z�Rebuild the internal timezone info in dateutil/zoneinfo/zoneinfo*tar*
filename is the timezone tarball from ftp.iana.org/tz.
Zzoneinfoc s g | ]}t jj� |��qS � )�os�path�join)�.0�n)�tmpdirr � /usr/lib/python3.6/rebuild.py�
<listcomp> s zrebuild.<locals>.<listcomp>Zzicz-dN�w� T)�indentZ sort_keyszw:%s)�tempfileZmkdtempr r r �dirname�__file__r �extractr �OSError�_print_on_nosuchfile�openr �json�dumpr �listdir�add�shutilZrmtree)�filename�tag�formatZ
zonegroupsZmetadataZzonedirZ moduledirZtf�nameZ filepaths�e�f�target�entryZ entrypathr )r r
�rebuild s*
r& c C s | j dkrtjd� dS )zdPrint helpful troubleshooting message
e is an exception raised by subprocess.check_call()
� zzCould not find zic. Perhaps you need to install libc-bin or some other package that provides it, or it's not in your PATH?N)�errno�logging�error)r" r r r
r * s
r )
r) r r r r �
subprocessr Zdateutil.zoneinfor r r r& r r r r r
�<module> s dateutil/zoneinfo/__pycache__/__init__.cpython-36.pyc 0000644 00000013255 14751155147 0016623 0 ustar 00 3
6�cY[ � @ s� d dl Z d dlZd dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z ddd d
gZ d Z
d ZejZeed
�sxdd� ZG dd� de �Z dd� ZG dd� de�Ze� Zddd�Zdd� Zdd � ZdS )� N)�TarFile)�get_data)�BytesIO)�closing)�tzfile�get_zonefile_instance�gettz�gettz_db_metadataZrebuildzdateutil-zoneinfo.tar.gzZMETADATA�__exit__c O s t tj| |��S )N)r r �open)�args�kwargs� r � /usr/lib/python3.6/__init__.py�tar_open s r c @ s e Zd Zdd� ZdS )r c C s t | jffS )N)r Z _filename)�selfr r r �
__reduce__ s ztzfile.__reduce__N)�__name__�
__module__� __qualname__r r r r r r s r c C sJ yt ttt��S tk
rD } ztjdj| j| j �� d S d } ~ X nX d S )NzI/O error({0}): {1})
r r r � ZONEFILENAME�IOError�warnings�warn�format�errno�strerror)�er r r �getzoneinfofile_stream s
r c @ s e Zd Zddd�Zddd�ZdS )� ZoneInfoFileNc s� |d k r�t |dd����t�fdd��j� D ��� _t� fdd��j� D ��}� jj|� y.�j�jt��}|j� j d�}t
j |�� _ W n t
k
r� d � _ Y nX W d Q R X nt� � _d � _ d S )N�r)Zfileobj�modec 3 s: | ]2}|j � r|jtkr|jt� j|�|jd �fV qdS ))�filenameN)�isfile�name� METADATA_FNr � extractfile)�.0Zzf)�tfr r � <genexpr>/ s z(ZoneInfoFile.__init__.<locals>.<genexpr>c 3 s0 | ](}|j � s|j� r|j� j|j fV qd S )N)ZislnkZissymr$ �zonesZlinkname)r' Zzl)r r r r) 7 s zUTF-8)r �dictZ
getmembersr* �updater& Z getmemberr% �read�decode�json�loads�metadata�KeyError)r Zzonefile_streamZlinksZ
metadata_jsonZ metadata_strr )r r( r �__init__' s zZoneInfoFile.__init__c C s | j j||�S )ak
Wrapper for :func:`ZoneInfoFile.zones.get`. This is a convenience method
for retrieving zones from the zone dictionary.
:param name:
The name of the zone to retrieve. (Generally IANA zone names)
:param default:
The value to return in the event of a missing key.
.. versionadded:: 2.6.0
)r* �get)r r$ �defaultr r r r4 F s zZoneInfoFile.get)N)N)r r r r3 r4 r r r r r & s
r Fc C s2 | r
d}n t tdd�}|dkr.tt� �}|t_|S )a%
This is a convenience function which provides a :class:`ZoneInfoFile`
instance using the data provided by the ``dateutil`` package. By default, it
caches a single instance of the ZoneInfoFile object and returns that.
:param new_instance:
If ``True``, a new instance of :class:`ZoneInfoFile` is instantiated and
used as the cached instance for the next call. Otherwise, new instances
are created only as necessary.
:return:
Returns a :class:`ZoneInfoFile` object.
.. versionadded:: 2.6
N�_cached_instance)�getattrr r r r6 )Z new_instanceZzifr r r r ` s
c C s8 t jdt� tt�dkr(tjtt� �� td jj | �S )a+
This retrieves a time zone from the local zoneinfo tarball that is packaged
with dateutil.
:param name:
An IANA-style time zone name, as found in the zoneinfo file.
:return:
Returns a :class:`dateutil.tz.tzfile` time zone object.
.. warning::
It is generally inadvisable to use this function, and it is only
provided for API compatibility with earlier versions. This is *not*
equivalent to ``dateutil.tz.gettz()``, which selects an appropriate
time zone based on the inputs, favoring system zoneinfo. This is ONLY
for accessing the dateutil-specific zoneinfo (which may be out of
date compared to the system zoneinfo).
.. deprecated:: 2.6
If you need to use a specific zoneinfofile over the system zoneinfo,
instantiate a :class:`dateutil.zoneinfo.ZoneInfoFile` object and call
:func:`dateutil.zoneinfo.ZoneInfoFile.get(name)` instead.
Use :func:`get_zonefile_instance` to retrieve an instance of the
dateutil-provided zoneinfo.
z�zoneinfo.gettz() will be removed in future versions, to use the dateutil-provided zoneinfo files, instantiate a ZoneInfoFile object and use ZoneInfoFile.zones.get() instead. See the documentation for details.r )
r r �DeprecationWarning�len�_CLASS_ZONE_INSTANCE�appendr r r* r4 )r$ r r r r } s
c C s2 t jdt� tt�dkr(tjtt� �� td jS )a! Get the zonefile metadata
See `zonefile_metadata`_
:returns:
A dictionary with the database metadata
.. deprecated:: 2.6
See deprecation warning in :func:`zoneinfo.gettz`. To get metadata,
query the attribute ``zoneinfo.ZoneInfoFile.metadata``.
z�zoneinfo.gettz_db_metadata() will be removed in future versions, to use the dateutil-provided zoneinfo files, ZoneInfoFile object and query the 'metadata' attribute instead. See the documentation for details.r ) r r r8 r9 r: r; r r r1 r r r r r � s
)F)r r/ Ztarfiler Zpkgutilr �ior �
contextlibr Z dateutil.tzr �__all__r r% r r �hasattrr �objectr �listr: r r r r r r r �<module> s&
7
& dateutil/zoneinfo/dateutil-zoneinfo.tar.gz 0000644 00000417201 14751155147 0015014 0 ustar 00 ��!8Y�dateutil-zoneinfo.tar �]`�֝jhHoCMB˦o� !$�.z�@B% !��GAE A�
Ei�)�A�ҋ+
D�" �{�4��f��3�IHv�;�{�ʹ
�hܴqDc��Lt ��c��7ᵷx�M �@����;��c
���}|�M�b���m�Є�xE���F���� ?�O>$�~�'�Qn
�*�N���L��H�2vp\床O S-���ёC���?���
��+�ԡu���G��%����oX�:���F�*��&��#�\'62.����.�G�ī2��G��?߫o�h��/}h ��CǭN���O~c���"��}��}�MA��ޑ�}�}������ �5��1��������? 2�wT@ ���k
�����l��6���� ��� ���MϽ�{�����sAf>�ёf?ST�)Ќo�� ���������/귿� [���� ?x�:��]�7>�Od�G��O��� ��k���v�jt�w��'� ��_3t�?|_���7�O\���߄>� ��#�&DJ|�G�I ?"�[�#� �����G�Ge��1R���8�Y��?�z�O�xg��Et������.�̯s���O�s��s�z�{��F`r�&`�:�n�!���k"��;����d�? �_$����5z�٫��
���S���97�b�N�t�82�yR�6��"�ByP��>� �Q�ԏ+�X�-,m+��D���y�[K�)�Z�|!{��2���l8�-��,?�g�)C�GG9�� ���7sVn�R��Y�Vig�rn���:�s���7J� gJj�I�i���Qk|uA����Zk�n����j� +U�C5EMU�{lv���p�6���k7��_^s�ts���4�MR�'�:��vU�n��w��ZQ��`S���jj���j�Gm<���I�Ojp�Φ�v�!�g�\���*_8C/�p��.t��Y�l��Dg�o:[�Z��zk�3�ey��kל9r�ʝ'o��r�w����
>��_� �dV ��BϤ�ޓ\��p�n4å�$�-.t�j��⏶�Y]JKR9E*���5L.� �o�d~_*U�Ԋ ��є��7�G ���_
������K.��O?��<_���C�u\�����#�9F w@{�<�y 2�8�Xd���1���Hc���'#�Q��<Ny�2�xҘe�q��c���/#�aF nj<�y<3�f�q��c���7�&�qF �<�y�3�Ҹg���� H `d 02��� F�#s�E�`d�02O�+��F� #�H�ad� �C��#F�#�9�ȼbdn12��c��3F�#�9�ȼcd�12���AF�!����|ddN22/����O�LP7��ھ�F� z�˕�ȁY���]z���+��#9���?��em����� �>���Gd���_�v����0b����7��O� �a��Gd)�������_��?ƃo�dl��DS��3 ���<��>?��c��W� [k����/����}���'�߷/�=ٱ�Kokڸ˶����w4�a�f�fݹs�mיϭ��\p� ��z`~���� փ- :y�� �y�q$_�� 3lGjd?ve������m'm���F۵�O�7��R�l��O .��sh� �-��h��ښ;�]5O�b-��aR�ҋ�|��:ܜy��=�G�Z . �Z4�ZxBY�<q��h���ZH/��L-^�V½{jI�ϴRy���<�Z�Ĵ�r����,n�ku�|�5�7�;�G�*�} G�\;��*�ɡ���ᮟ��{���?,�[��Dn��3���'�����m��d��z�N���F���[刖�z�����
�� o��N{�X9]���� �s�>ʱ���7��\�T�U�~ �(M4����u� ��sx��,���&?z�>�]�Re��ih2�M /c� adڠ�E�}�B�L#���J(O��R(S��Z@�#S��i��T��r�L;F� #ӏ�)��4dd*22 ���LKF�&#ӓ�)
$�22U���LYF�-#S�����f��FT�.':32��LmF�7#S��i�+�;�(�*ў��$�3�0� 0�0� 0�$0�,�eB�� I"P te8�
�I.�$( �l�,H��l˂�ԧ*���/�Y�DYp�.ʂ�ɢ,xVe�����Y�?�EY�3� K!z $��M�$2�,2�42�<2�D�2b(^�T2�\I2�f#ٔ����V���0���������D��㣳0����������xd�V8�M ��OcZ�n?ھYsƶsj����9KL���%�k�\�s呤� ���L*�[城Q���H� �$����TJ�TM*ǚҾKI ?|L����A�0���9ߣ�9��~#F� ��Y`���$�g�)�υ O�Mz^ ��ܰ��9)f�6-����m��}�����,���ƶ��3靳%n�vw�n��q��[g���w��kҹ"-�ӽԤ�s?�;_�]��]��t��~���H�<��~N�!I��^).F�<��^�u���rə��4 l ���ϴ��L�)�K&W 2"��Ѣi��d�U�?!#J� }RF������S3�'g�O��{ H{�����#�F�+��gy�0� BJ@{ )�)����<�=�F_� �m�I�vm�������f����j ��/;�k�#�h��}�d��`He�P�Ϝ��& ��W=Z��v���c�K��v�' ]���H�S��[�:F�*}?}��t���;� ^�Θ�l�!ҹ� ��9j�8��t�`������9/ݼ']~�+畣^�s�-5Ͻ�R�K���NN��lq9>O+qRu���TwI�Ο�<Z&�d��wX&�3d2�1�|� V��� V�8K1�DX�����HT�hg��F;7ک��юEōv.*m�����Qq� ���lT� ����;��w># F>kt �` ��Ax����F�� $F>Pot���!��ACx���F�� � DT��@½��s��`D��,*qtp�g~t�����_��up|°�g:����?�?����o`��� ��S�e��Q~f�A��۵Y�.��w�W猋W�~��i�P�q^���� n���J�Gm�;?�uE��緜�w|�\�q�J���<)�s����jeuM�k�ZkNu�OK5�p���p����'��
�-)��[�R?{�ug�N��I�_���sk�W�r�_�M�mu�;�w^�n?�����K�qUQ�9�۹s];� ���]'�;w����e ۞���=_�� V¹wY���n���<u_�-�)�>} �_ � �����uA��C�_(�K�Q��[� ���r�ʉ�]���'��3�{���x���}|�q�w��C�ƏM�g|
g+�7Ε�T��Q���W~:O9�r�S��O�*�>IU.�J��|�9�]�j� ʵ>+���
����
�W�_� 5n�2n�v0n]ofXZC*8��T�R� �����*M1��^,����� �x� z�b'����~�b�>`�e����ݼE.�l�\~�\��]�8�eY/W��G��2B�R?D�Z+@�V�]�^���+Xw��{���{ ,��:�^s�-����ӎ�u&�Խ6릨�w���O�Zٷ�&ٯ�tٿ�l9�'I�?N6����OF�Aw��[��z�;���l��7��Xo4��n�[Eo<!Hn�,� UVnZ� |_��>�[S�?�c��c��D �s�fr��E�.7<��ֻ t��E� k/�=�]�{M�#�z �#ǜ�{7� ��K���� �`��7�:=���Ǥ��ݏ�c�F�OF�w�n"z�� ���<�_E]��/i[_��[R �]AN�-+"ɉ^�D�i9��M=��<��Q}d�"yԞM����Ǭ��� �P ��8]�ŧ�������ϓ�|n���Ç7��'��|T�˼]Nq)��pYM<�;%2��N���!��#��-��E�2{8?toI �$��,�X�@b�� $�X�@��� $�X�@∮/ $��$��P��Kb��. &�D�����œ���E�����Ŕ���E������H��"��B��b�Ȃ�Ȣ�) /#�/# 0�,�0# 1#�1# 2#�2���hg�U�-Y�Qp%��X�;M�
<!� 7�ě� H"��B$1gdA����M�$q��&��*� =<8�=<8 ��zd�]�) ���D xn
���)(�sS`��� �M���<7
xn
�s�rЀצ����M���<7xn
&��P�)��sS`���.<t�)�0r�a�`��< t�)�0r�a��� �.���"P����³sP���*���K���
�t
R��~�Jt�w ����:.t�)x1r C������]�`&��,��/ˢ� /��z Yt�#d�]�Ew=@�uw <�]�Ew�O�j@�H�(��-]t�r@����o�Ew}�.��Ge�]_+��&Ytקˢ�>[�$�8Ew}�.�둲�'ꢻ ,��zg]t�{颻^W�ƺ讗�Ew��.��A�9��S��s��ߗ�+]u
���N����3w�9�)�3r0g���A��;#wF� �9У�C���>#}F�� �� 0� �`d3�Ȇ��M#F6�l�$0�Q@�Jf��
#�F6�l ����`d$#��fH���M# F6�l0�d0��`�6�l��7��'j���_���]������^��`d\T���}|��8��_���%�_��]�c��k���c�YGW����l��f�Ƈ�y�[�EcF��Oɻε�w/)�� ,�}�O�kKl� �J��{G��&ہ��o[T��\. �\+ �UF>�o�|4��џ���R�յ�O����7]���t��k�K�,�.��t�ۮ�s�p���ҵ�]���*H?'�SW��Ly�`��j�� �'sd7
�|}/j��[l���J^O�J�0O+}� �̗㵲�W��0�VL%K�
ى�d%��Ft�* ;��Γ_�<�xs�̛;�k�/�C�������:���N�
N��4��6 ߮a�y��R?z~�U�Va'8$�t�_'�=6�)X��� ��l�4^f��ӗ�!Qb@�K*�ė�@�ʟdE@�K���̤ ��L��� �:R
$r�H�H1��H�H9���z q#A�F*�č�D$nk��("q�.��ʟ�"qK�kV � +R$V�6H�HqDb�F��B�� �AbE
$��@V"$V�FH�H��X�*!�"eBbE�ĉ
H*�t ����Ȥ`"�ʘ�LJ&(1 �M$P����&��H�VJ"�B~� �+�H�D�c� �8Y �_v"��He'R�&��G�* ����-'z�yeO�_��_� ����,�\3 0 ��2�uw��;Ҿ9��Y�� �b�8U�O� �V��\���V
������ .U���鑧�䱿�3����$҇!�:WXTMʋ�M� ���#�>�# �� � �I4��p� �G��> �Χ�N��ݡ�C 6�>l��X�� 6�> l}H }P���@������m J��������~>O���>�� 3�oN�Ḱ9���s7�ь���y ��͏~�/��[Z����H�9��������R�M�D���4�v�����ҝ[��靥{G:���JR�䇋�I�ee�I� ��ˮC�h9#K빬��ܖ�z �)-ϛ�z>9U˷|��术�w�� �L*�:^/�q�Tx�!� ���L~E.:"Z*%��%T* �L.�)���KU�J�s���p��\���=�O+�?�^�� Z�U��vkJby���+�� �U��/Wk�B�^�Kٽ�.�?�N�t��<O}��8 !�ܺ@�u@�j�yU�����56F7��y�L�}���|C��~�ni��ar��1-0O
�\��d>W@�{T���\�&�~���`�l����F3�I��{��fjM�$�Qc��^��!M{i!�Ck��B|,��)���,7�d�Z�Hoy���j�$����Z�u�����Bo��Ck_�� ��G-�^a���6��Zr�
?H��.$wy��u�S�v�c����r�����Qk�^sH�Vv=r�$�w��z��X-��4=:��})Q�q�������)��.���?{U0��<�^H�$ǭtJ�;��շ�KC�����JC�''��.%<��'�Wk��N�I��iI[?�G�J�FΙ��:�Y=v�>&��6�g�>�rگ��� 1��Ç��q�Yj��m]ʋ�x�q����i�Dk�)��S�o�#�el=s�Y ����#Qo!V��B��� �53
��@b*��V�S��@b-��\4z����`Ff1����lfdF32��l�1����ȇ��|c�#�AQYb������ J����B* $%@�$5@!�!�aV�SRE>��z
)�) �����a�X�Ȋ�z
��)�" f�@ �S�ì"����0� ��R�SHYPO!u��X%�aV R R R R R R R �Oj࿁�~Bj$EB �]�L���:��B
�:
��(cŚV+�QH�PG!�B ��K�Qn�5+��� �kV2QG���NJ&�(G�M�Q6�5+�����kV:QG�x��2�?+�����kV@�QH������IQ?!U�2��B�:
)$�(�����R��Z��B��lh:9J�����z��B
�hI*
$%E���H��� �*��uRW�QHaQG!�E ��uR[�Q�D��UuR^�QH}QG!F �Tu���~�j �$�W��ݢ~�� \.�W�Ҩ��R��Bj�:J��_�j���Q��u�WVq�Q����9��+�:�XF���*�W���|e�G e��+�>�qOQ�b���w�ߍ��/s�U�:�Ϸ/ܺk���Y�M�O�M��_��r�6B�c�7�+uߑo�G�+ ��Ϲ�(p�sG��� �R8
�Lu���(�p��hR��X� ��:�;^z��Q�\�Q��x[�Ja�Rۣme\j��| j+�}[�I���mb��*v��쒭���Vٔ�Q%v��j� �ju\l�s4q����~������6�/r;j��Vsi[��m���e��� �W�s6ӠV6��;l> c �5��Z8���������Ka������W u� r������m
�8m
�z;��o�tomk�s��I}�-��t[�rEm!�l!w�5{��z�UGة����1��[+�Zlw��C>�����Ӷ6� :�} 8��j��5s8�[
�"���P�c��Ng'::���e[?G�Ϧٺ�|��}q����1������58�f��lS��;����WA[���]芭o�����;b�� ���W���^ǀ件�3V9�'mq��u V?���dې.� �wlC��8�۰�s �RG[�� � f[��>��el#7�8F- p����6fr)��W�����pə�5K� ��eM�Z�ywR�5-���Ϭ�5�}�����}�Y������G�=��n���d�0�D � F�� #Jt�%J��-`D�0�DQ��(�F��#Jt�%� �60�D �F�($����D'Q��(�
F��#J�%����`D�j0�D7Q� �(�F��#J�%
���taD��0�DIQ�%�(QF�� #J�%�B=��0�DWQ�,�(�F�� #J�%
��0�DeQ�3�(QF�h
#JԆ%zÈ�aD��0�DuQ�;�(Q F�h#Jԇ%�À� I��#)��)�+K��aq\Y`D7���#:C W�
Q� Q� Q�8�, 0�q\YB�Ы(�+K �8�,)0�߉���#J�#J#J2#JR#Jr#J�#J�#J�#J�#J#J2JR�� ��$ F�d
=�&�}�4�,Q0�$S0�$U0�$W0�$Y0�$[0�$]0�$_0�$a0�$c0�$e��$g0�$i@�5F�6Q�7Q�8Q�9Q�:Q�;Q�<Q�=Q�>�����;
k{���ojX�Uo�V�V~l?�|i;��ϸ���ǟ�}�~��
�^����?Oƃo�2����O^�:}U�I�W'��&��mm���U�n[o^�o��[J�7��\�ڱ�֠~��ر�H�~�HwlY�K��/�q|�֑��� ��}���� _����U ��u����Z�i�^Ȗ�Vk�-��~��}h��5����|��=���I���ce7q���ũ����R��9D�3���]����>��(8� �IZ.�*@�$V-�
���U���tfLQ\�h��TŪ@W1��) $�bU Q�G#�22��J�h�U�De�$:c� Q���X%H��*A�7V űJ�h�U�Du�$�cu Q �y�=��/r�-ٹVv���k�s�����W)!�/e�b�fa�%k��g��3��|Bt�� I�����F�E�?�� ��_�}|����O��?_��O���>Z�����X߷�mC�~[J� [��ίO%۶����pձ�I�� � {7t� ����x�x�wL��34���Y�kw^�w�+��R��eӝ�����8��ȩ�[�����{Z�Mo9�}Jk4SuZ�j�'��6i3_ ��6����4m�6+�W ��/��,�� ����pSm�*��]���}O����6I�%��ζ��Z������"Z�tvP.h k�qv�vk���vv�Ժ��vM��u;�S�d��c�E�9Y�z�WY���K�c:{�GH}z*�(� )�agߢ��?:c��i��os��/��?��9`�-mද�AS�iq�>V٬�'�C� ��P���$%4k�+3[J�u&�'%n�L:)��R�9��`i����� zicV\u� �X��������?�j�Ç
p�1[�rr7�;����MϢ��^�Y���NsXe�ixx� '4Đ��0C�BC
9
7
9�4�K����^~@�XHF�HCgˣሳ�ѐ_%1�%�*&�t��ė�RW_v�b⋘��CxVLh� L� x��,)c1��-���"&4�_Ą& �b⋘��C\L|� &��P�����KC xKLh�<"&41�SĄ&��}1��)�$�15�#ń&�<pc1����� MLx_ILhb� bBS �hLT�^"&41��'� ML-x�X1��) .FS
�S��f����z�kbBS x����T�^%&41%ၧ� MLMx`�'<0Q �����T��+&41eʈ ML]� 1��) $���?�-��� Ą&�6<0� �ŧ8OQf�
��"�� ��W�_�����g��3=Q��
0e_�-+�_泤�����o�!�#S�:yA�S��QT��~�S�oV8A��X �5U�YE ?2Tn�c.�EJ��������sRP+-[���`毷�FA�� ��
^�����P�:�w.�X��آw���5u����@����r�u�����Ƚ�3i�XM� ۊ�Po�OO/
>M��E(�����)�4��?HA����i����m�AS��E�C��Չ3�!]���}GhC���uӆ�Y*'z%Q�xSN*ܕ��`yĕ� �ʣ�V��0H ���A}�[���@��)�[��g�} x[�2&0��3Gk{1������(�z~�4jMظ���b 4�Nظ��e ��Ɖp�#Zظ*��qC�e���u�i� (ց/g%�/l�YI�8��u�i��q%3ց" w;c �Iظ���eԘ�ƽ� 77c �@Mظ�b�2�Eظ9b�2�F�8M�'��[��)*M�$a�H���2ց_���k����$l\Ռu��&l�Mظ�u��4a��X>C6�\�:���q;�eb��qK3ց' ;G�6N�Ǚ�����k+ց[��$�/��)����`�oӐ���?�� ��L.�g�?�~��}���(�oz�v)�~і�hC p�s}�(uCYYJq�F��M
�>?�T=\���������� {���x��gC��状���k���|��y
���/�u�Wݔ/m�/_�zT��Xi8�[.�:�(�q�\x�
E�`�\d�� 1T.��ԥ�\<<B)(�� PJUn���WJ)��_/s��({��^n ���
�n� וĚJ����;T��?&W���Tk�Y�^|��^c�����ɞ��5��kn]e�:0V�=�]����5v�az��� ��3�������ϭ��wT|��<f�\.�l>WF �{N���R��~r)����r÷��f�)[�0OX�7i���zCo�e!M��
�b�Vm��ޚ�����Ï��4����b���z������t nX������b�K����� ���� ���;���t�pU�u9�˃rׅ�n����'8� [g�=��Pz�!�Z�2"'�����j��G�oD�vѣ/M0b���1���y���Ì�g ��G+���A��J�������C �_� ��<��%%��B9�a>#ќ�'��`$���'m�m��5A 9g�1�H_}�ةƘ�0}lϡƸ�k�(s�-_��Ç�-�RL���\�gDV�� EV��V���N��X�#���5�Ȱǽ�/X��l y�Sxdq!f �1�Ox�7���rq���\T�H�|�X��3q�ab'N>L �ɇ��� m�9���@b,E�sq�ab/ΑE �9���8G�Tqn&f3�i�1M�X�i�lL� vc���3�1Mc���vL��"<0� �3��f�cz) #� �g� �� �4N ̪�i� ��i�f��4���f��4
R L� �4����z`zF
�YE0=�Mx`VL�8/<0�
�i��`�� �i� �U�]�YmDn#<0�r�������Fx`V!�4�D"�)���Fx`V%�6Džfu���R"� ��J�6Kt��l5Dn�.r����b"� ��L�6�m^VDnS �Yݐې����!�!�CnCj�܆�
� rR>�6�~�d��@RA�6��@RC�4��@RE�6���mH �ېB"�!�DnCJ�܆��
)&rRM�6���mH=�ې�"�!EnCJ
$5ENC�
$UENC�
$uEnC
�܆T�
)-rR[�6���mHu�ې�"�!�EnC
�܆T�
)1��9
)2�T9
)3���
)4r�9�����m�
��b#�!�Fn�?��n�E�5K�g>�[���#"����x>��3�g��ϙ�@ ��.�ϫ�ܴJ>Ue����� g��g��r\h��Y�&��yo�%��t�:_�Y�x/[�]+�e��h+�v���ܒ�
��W+�r٦���J�c ���U�4uuT���V-�Vݲ����ͷi�����a����6��.v��]�X�M��?2����UHg���t~����2�3����
\�.�$���*�;@�C�K�Ek���K^Ѫ�= C{
>�� ��.�(�� >�E�ړ�/�7�_^�y�⏦= �B{���0���h����
A{ ���:��y�]���tw��Qp��}�KN��bxd�ȁѱqY��&߀'�蛭�/���fl�'���JJL��Y���fu��5�J�:Do����A�+��Ѷ��Y�J�j5���8ѯ�����G^���2�ݚG��q�w�������A��/c�<ܰ�~�b ����ѝ���y��Ǘ �N�}(�|c���Y.��ܜS ��#ǹ.�7�^�H�\��p{�GdV��/��Q@����J�Ӽ� ��~�G���菅u�?X�[�[�K�7� �'2K� ��� �l�� �/�9��[x��<o�V�� m��Os�9'��;^U ��(���8�Qx�x��A_G���#� �bC�/u��( ��,T�Q�3��TeO[鼗�er䷹��*N� Ӝ�s�|D��lOuAxoA�b��_��J�����Te #2~�? d�>!�>%�>��g���z�XNȟZԳ�rB��-��^��0��g�:E=��CԳ=E>H{FԳ�;E=[,'�$��m�gW��gx =P�J����������s���N���]��?��ZZ�Վ]g>��^�@ڳ�g��:�KF�M�9���C=��};�a?�%���*� �Z� ���qLNw ���q|��tb��8�xS:�v�����4��� �H��6���g�q�M�L��� ����� J��m�yG���{?ٞ��6�E��r[o9�O�j��롭�����*[��u��=�8�(=�U��lդF��/9� :kw�����j�����ƒ����� �&��k� u����5��a
��� 6��S?�����W�ݿ�{6�����9�j�{]T�/���� u��z+���/0��j[�F�uX���� mMZ�-��Q��"�T��٬@{���>�Ћ�Rعj���R-�ޖZN��l�^q����j�����g'�^��~����5�/��:�*�v�y�ֹ����Z���]�kݾ���>�&�X���sL�״UN[��R�=j���>=�ըr�Rt�wԾ�sj1�Ԙ3g�~�;��_�i�O�� }�
�� ��-nQ�spt��N,� �
)>��sh�ARB� �Bm��:�����RR��jҞb҈�[ԑ�oH���UG�(��Y�:6�6�>�K&�ʙ�=I�����P��W�(�H$�lq��;�}�'� o�� ��;�#�<~U�/����%,x'>�jH�)\
�x��!��x�mq�Z���D<WA�!._K|�U��s���; qv��;L �"�!��[L|��U�y��&q��%~�2�o���2O�I&���L|E'�8�J'��d�.:��_�I~(��D<�}�\�i��O�k�ۨt�Q�$���I<�#���I|G��8�J'� �ήbA9� ��ba4� :���h�tjIЩ%]@����tjI#Щ%�@����Oz�N-i*�����v��J��N-i�t�Z� � :���١�+�Ԓ��SK��N-i :��Xh�Z�N�h��5�Z�p.�=�Ԓ��SK�N-�:��E@�#tj/���K��J� �� �B�(�H�Щ}!Ab�B��4 cҭ�*Ƥ_�Ԓ��7�c��e�В�I�С-. k:�7�#b�C��[�X�Щ%�C��4�Z�=tjI�Щ%�C����%� :����В 2�&�CK�$mdd}D��4�Z�ItjI+ѩ%�D��4�Z�MtjI;ѩ%�D��4�Z�QtjIKѡ%=�� ME��tHڊ-�+�4�Z�YtjIkѩ%�E�vZ4�.:����Ԓ�J���F�� Z�:~^>ٓW��-<�����t������{zg��2��|���r,& ���xѴB��N�m�߲��Ku-E:Ĥ
i�R,�b�K���x(�i �g�xVck唚��a��v4�~�5��69�kp`�)r����?ͧ�3���J�_�a)�/U Ƚ� p�cZ�)�C����u7���=s���5����pTbX�A�̖�K���JiҨNZ��ڔ��;���1��:���o�-����<)�&� k=���M��4k����-��kp=�}�ya��
~��Q���JްN߿e��Ͱ._3w]����f)��9��đ����z�,O�uZ���'���֧f_sT�bi�>H����ns��]a���̱[ ��_�j� �7l�;̓^�7�b��� �� a� ��Vo��P�Hʰ<Æ�)`NLߘ6�x����
�Fl�*e��Qsn�G��Q��f�ظ�a�"{�%� 9I�s=�;�n3Ƹ����̕�fV>Չ��W^j����Y�#��b�5ѳ?=���k�^f���!�.4Qv����
H
J�_h`��B���(�� ����
��
H&�-L
\�@�0�4�ai��@ƾ�� H&�5L
l�@�04�y�i���`� �H� &�>L
~�@" L � &�� Hd� $B�)`�0�D�<"L ����Gd��#��i`�80yD �<"L �&���Gd��#B��`�X0wD. ��I�GD��#����`�t0yD<�<" L &�H�GD��#2��!a�0yDL &"'�
�G$��#���Ya�0yDZ�<".L �&� �G$��#"���a��0yDj�<"6L �q�$������0yDx�<"=L &���G �G" �GB ���Y ���{���k���hX����e���'��+��=3��'z`d\TV�? ?�'�?�/+�_�VH�6�?o����V�f�{M��V�{�U6ڿ*�[ �/��-ܘ okUF��]�~�d��Ǝ/�+;sW3v.kb�:�[�=���g�Je�܆}�Te_�tc��ˍ5�1��~�8�O92�8\z�r�Z{���c�T������3%��('��)��3�[QBq�����[���A���)?6)k�i�Y9[�q.�����S�O����S�2˸��)�⡱ƥOR���mƕ��+��M���'(��R��7��{5Vn��b�Ҩ�r�X�q�b.��f���;<���ƽ�!�c�wt��� >� *_C檓�7�,�ĬW�M�Rh+щ�����A��`�2�S�e���0I����ˊ�ƔG:ȸ| h l�}�8��I H gᡃ��%*4�4P��'
<iP��IO (x� ��A��'
<i���4`p�w4(|�A���� ^� �@B��(|v�k T(|�B�
�4�P��A��'
4>i���I�Ot(|�C�
�4 qyy�@�XBC�SBi@b
Jq��T����� �e構���������Ӏ�e�i��2�4pq�y���
`\1�2.�F��s�-.��
|a��� ���-lp\� zdm�b�'mf�,���O��,c��Wc����|��o��]��E���eo�@�
�o�m��`�d�7.>ܰqʑ:U � �r�P��ǎ�M9~)}�)'w���2��u�p�|��� ��ĚH\��W �^��-\�|�ђ��n���T��? ��r���R
�\����K3��\N�qe����� W;�I������n��_Q��j�/�?{ܬ6�|�x���\6��� w�41�=�k�==S�om���
K��9UKoUNq�kq���)�=�-���lJ�М �]�y����3��9_�4�|�l7����#��%�ۦx�d.:x�b�g��;��P�_/ ���
�mVɰ��יh�f��|(Ź�:��j�tH��"�ҡE��ËhK�і3�- j1��1~����A)"��^,�mY��!�hK� і����e��@��a�hKCі��-
D[&��4Tmi� �ҐҰA�����hKCі��-
%D[N��4�miX!���B���hKC і��-
5D[n��4�mi�!���C����!�hK�і�"�-
G\<��$.���6��&���( ��<Ly�b�
W p��}4lQJ�� ��*
a�fݎ�<�1�鐨D�FŌ�5*fY?����r��-4>::nxl�~Y���'�f����"=Z���Y�£?��=��y�wC�A��1�OG!���p�w__�@I�~ ���? �ڦ���e ��t�k����'��?��ߤvHl|tV �@o�'���w������x��z�6�?3�/7f ʥ��k2f/�Ҙ3k�1wF�x�Se^�=c~�,e��4ca��Fw�E�l���۔�5j)�/�2>�� ,�,�ɩ,�>PY�c������Jc��<ɤ�z�n�V[k�Wk�u�u�]��&���h��fl,���x�[�ӟ$eӑ���㝔-)��� ���NI�YV�<i����ʗ�G(_�]h|m�l������!c��|�7%�������WA�5���{���u���u{\O}_| y�] y��@ O��p�r�B%�`����� ��˔C\�#u�R~�M]�(zS;�('��m�Z{^��2��3NHP~hW�1B7�0�6X��+멤�a��ͯ�t�r��%�����O�*���1.�J��r��;F�n�7ռ���T���7%]�)�>ћJ]#zS����oR]�mJN��J.�b%w��J ��J���)��J�������u��ݤ�z�(�\T)<�!P�(�6�(:B6�y�7^�|�(^�^¼M/�[/Uj�^ꇕz�[��e������c�ܲr��'���r�yde`�\��Vr�r�H/�j� �Z�z��d��u�~��[a��` ��OW��ko�v �kO;��Y�N�Jج�&��M�J�=��>�ke��d�v�e��� �$9�8�\v�n>)�M��n �� ��_�Ko����pbc���r��o�� �I�\zpTY�i�szH�}�Y� zh�����g�p����=ir� �-V|"�����)r�e��6qq�u�x�m��v��������z������<��7Mz����·��]nx�]��w;�&w7��=�^�{��.���G��:(G�9��n�A��c� U�9��
�o�uzLy]�I���� �Ǧ�����,��6D �Z=nQ{yp���:�_ Ҷ� ߷�<Ի��r[ VD������rR��z��+y����E�=��� |��Y1[ ;b�>�q�_��z���'s�~��\���=Ͽ���%Y�
��'L9v)���|�}~�T���W�4��� ���B;~��� �ez����Z
<$�r��hÒ���Gڊ6,�+ڰ��hÒ�2��2�ޢ K��3��2��2��2�I�Y���nj�Ɍ�ˌ�͌��8!i4.8I:� N�Vん��$i6.8I�� N�v㌅��8c!i8�XH:� M��I�q�I�tq�ɫ@�v\p�� �$��'I�q�I�z\p�� �$��'I�q�I�~\$�� mj�hOS m�|@�@� (����96�=M��i�hOS�@{�b��/�3P8����9��)~�pN1D����8���N��@�_9��aۚb�cmk�5(�S��u�?�B:� �)��Nq�t�E(�S<B!�b
������B:�(�)N��N�
�t�W(�S�B!��
��PH���B:Ű���� k[SL{�mM��5Ÿ���� k[S�C!��
��P ���9�@��3r,�$��1�&�ȱr��(�S�d�8 !�X���c&
�m�9v2r�d���q��c)#�SF��@��� [9�2r�e�8�ȱ���-#�\F��� {9�2r f�8�ȱ���1#�d �eF��@�ό �9N3r�f�x��1���6,1�n�9��c8#�qF�� �9�3r\Rlg����q��c=#�{F��� �9�3r�gd��>��� #�F��+C� ]3�ȑ� �#0�O �W`d��Ȟ��}#{F���!�G0��`d?�Ȟ��|#{ F�@���3���f���C�ɒ<#�F� ��?ك0�ad/��~��= #�F�&��O٣0�O���8K�8�%yF�-��]ٿ0��ad ��^��� #{F�5��m�� #���>H^����<#� F�>���1�B;��#�!)���5}�^��_��坽�ů�<�����>����?���?����� ���'�ށ>���,����x��l�K���f��C��<m��i����m�~��C��ȇky(ٵ��Z��Z V}=��~�+���M����}^�'��������ޝ�\?�S��iފ|� r��Q2��>�M.6o�ٿ6m%�%���J�f���6����)T��#U�\���턨쭙**{��<�� �jv���+|���+p����Jʟ]qˮ�eWܲ+n���\q˶-�mۂ�[�_���ČP�6��
x�>����?�Ys�el�?�ݵ��;��;�]q|�=ݾs�
ۮ�<�}�x�\�˭�}l�?�Ͽ�v���~�� ��u��K{�9/ϸ&]I^�:GTӮN=�ֵ�t}h��zS� 檿T(�� ��0D�]*�z��o�;���w����;��y��W����'���9՜.1?i9�uQ]��K9#O��jΗrq�)pP�[5D�{9��+�鶷����}g�U�kwx��!�$�)'xhE�x_-ڡ�T,���R�R�6Vg��/i%�w�%�I�����Gie~��,�U�� T��s��
�8+j1�2�Z)r�Tydw�JSE���]�V��V����{�I�G�_� �>�jH��5�i��~�Zk�P����u�,Ҽ�bӀv�q7 >�/�}{ v�հ�mt���z �^�k
ʛb :��Z7�C[�5�Z맍�5xw���➶FC;Y-SG:w jo2��#�~{Ӷ
!E�[�y+�f��ְ"9 a��Ý?:�����☋�e�{�ɝ -ޱ� fv�_6���f[D�W����u��3�=ZAT� ��[d �m����8�ד�?͘� ����ۘ-���|�4Ɓ4α@��:��x� � @�^���{�ӝ�s9��ɜ /��@�\>q.�x�O\��'���g��7p�� ����J��!�|�\>q .���O����[@�\>q .�x�O\��'�a�s�X/v q;���� D6@<Ď'." >" N" ^��D�^·�3G��Sd�Ud�Wd�Yd�� 2w)������:�D�2��3��4���(iJ�m� �I ϑ
ב
lŸ��������g�#
@6@:�l�� �@S$/�d� �H��>�5H:�AOZ$�@6@��l`�H� �H?�
�� $�� -A@z�,�4Y �
� ���F� � �?i
��Y i� � d�=�H��! B@Z�,��Y i� �%d�M�"�O�H���S��U@�+d�Y�H���v! ���I���Iˀ�g@�4���I؞�E����~֗�����������_��̧��%e:�ϲ�_h�L��N�aI��מv���za�o6J�U5ںkV��}_��w#���K�o� N�i�e��p��v����?�O�s�����-��^b�?���A�d���Ҍ�v�I_�����U=m�i�ޚ���ܖ/�yJ�Y�* Y�� ��&M��9�[�;b��NL-���Zhc��«�[�13-Eڞ��!���.�K�>H-��{��RK����#�t�f��g����a/�����q7{��
-F��V|[�(]����Tnk��GK�*��ju�Y���^�t����� 7��=OM��8��^s� k�
��紲֙�d��e5
�j��ia��T��Z��g�b�/��l
���j.��n>{� tw���u�z�u{����
6������hf��ҷ�=���5�{hՒ��K�᮷��k���? ���5��r�M{�W'�[���f��n}�k�Ŭ� ��/{���Sk���֎��� �n�\!�����.>�w]�����h{� �{l�i�5��k��nk��5rRk��#�}bY�
v�F�V�F_jh�qw���V����Xc��?��:`z���?�%J���_�w8mW��>�+{������� �'<�Қh~͚x�#kR��֤���#n����k u��u���1)�ul���q3�Y]��� ��|�_�?|�:�]��T���T����F�G�����#c]�_8e�l�N�;�'` �BO\D����J�/�Y��@�'<+qH<�7%�_1g�8��9� ��+����a �^�� �H|�W$N�+����hQ��F �~ ��+�E�^�8�H��!��+��I�����r� _gM�W$]�W$m�W$}�W$��W$�����r� �Y7�I;�������1�<"i ��^�4^�t^��^��^�4^�t^��^��^�4^�t^��8>��"i�"���^���c�$� �%xE�&xE�'xE�(xE�)xE�*�/�+xE�,xE�-xE�.xE�/Q1>h�d��e�b,�k��� �����d��x�f����w��I�P &����g ����q�IEE�&�gmDE��a�HT�I'Q&�DE��ސ4�$��v�L� $
E%�tHZ��0�)*¤�����"Lڊ�0�+*¤���"LZ���$q��\T�c�5 X{Q&����.�Y�Z�J0�1�4a�eT�I�Q&}FE�4���ը�^�"�/�Ⱥ��0i7*¤�����S���������|d}GEx��#�<*¤�(2��K�˂�Fo��z1q�_/'�坕�#�����z��?����C��?�?�� 94!:>|�9��>O���|�����?��Q�Ӱ����b������oy�Ν䇻v�J�'�]�YSsX];���Tj&�j�ƒ[*��'�fK��$�}P̒�}�n'oX�/�l*�尥�kvS��-���6�� �fB��hB�V�d�\%�&$��*��c2r�U�d�lS�$#gS�%#g�jB�tׄ���IS5��Z�g���n�� �g�U��[�k ^�Zs���Z^K�����uf�O���'٤M�x7 I���Z| 6�YZX��75L��>�l�
[�;�~��Z���z;
��}����+�
��05zm_���7ɍ��Im�,98�Ԧ��J�^m ��&��f ���v5��y����Ζ)Rr�Uu-���1�����f֊dk���mG���j�bi�=>9"�K����N+/�v)�f��Ԯ7?1u����S�6��g�啐j�a5E��j�
L�}k�%��:9�HK_�)�oJ���R4���-�N�?��e�w��F�L �v�g��:x�A�� O ��S��%uh�LC sS���2
۱�2�{F��%s,#��H 1Y����-yTlo��}
�DŽ7��]U1y�gu�˿��̳X���9|�đ��)r/58r��9f�祆�X�Nk=j��H�9���.S ���I^L�"� ="
!=b! �-�#�\Q
��
�Q �� �QL��$�!="�ab
�����(��h����(��h�XzD�|,="�fN�����#��c����h�XzDt~,="Z?� � K���H���@�;�$�<�#��H���k��H��5ˀH�^�k�� ��k��;I�#��G$bB�a�H�Z�5��"� ��I6��t I>� �� ="AzDR����I
�#��G$-H�H^PJ'�A)�da���t��M$9"}R�H�R:I�'�!�O$EH�H��>�W�`YB�D҄�� �I�'�)�O$UH�H�VH�Y��$]H�H��$aH�HƐ.��!]"9C�D��t�d
�I�%�7�K$qH�H�$uH�H�$y�@C�$����? I �%�A�K$�H�H�.�$"]"YD�D҈t���I$�%�IЖ���%�$��d�C��H�4�dHR�t���I*�%�U�K$�H�H^�.��J���V���0����je�l)��ǧV+�����d�u� <8.!6.:.!�Y\
�������7{�OV���簘��
���)����g�sG��6O���s��U�XV7��k:��k+�Y�-��w��o(s8uÏ3�)���nܮXw����x�~��۩ߖݑ|зC��w,�Dv>������G.=r�yA� n��� =g�{F]���]�G�>G�������ﯳ83/B�j���x�Q~#S�P��XlB��"�-yu�B"����X�j��X�AT�"�3y��ȣ�h
1���-rE����@�:ZJDw�Rځ\�i$�g�BٹPv.�� ���?/>p���Џ�}˓�~͓��*O
�����|�
�������<��O �.� �{����&�'�m��d��&s\�v%���L����a� $ϛ�_�9�#y����~�M�D���|�n�^r��x�. ���J��@��g�R�r{�t�RJ� �z�k~F��%�r�K�?��WXu˨8︮$�T*��E�ܱ�R��1����Z��r���sd�� O7M�<�רq��\s�*�ց�z�9�u��t��� ӻMt�w��Uu��ů}n�߽���1+�r�d�2J��sr�m��z�w��K
6-��}�h4�M�2���x��I��Fp�zS/�i:H�~@ ��� z`�^p� �f��Rk�Ŭ5F�C��V��3Z�o���>ܰN������h�(����3":\�#�7:��w<SW�\���rJ�� (�N���Op(=�ΐ{F}��3B��:eDNzO�];��3\�*8߈�G_�`ĸ��cv�5���+�����c�(nci��N��;��P���2 D�dDD-ӱ\�*�̥, K���Y�I�5ʬ����n�cZ� �ς�����3�Wp�`]��=�9�s�}�|j�Iˢ�a���s�n?��Hi�<19����4�Qae���
���g������FZ�KO�9e���>.s�1>w��D�
���!���/OeD��6&�k�煒��]����~���Hn��� ���"���*�c�*=����_���}�ӎ��
;|�ޡ`i��zky�]σ"{F���5��yA$ r�v�C~ق �=#�'��r�b [
b��Nk�ZG�C����� �#"�K�
�H��
�+"�[!��\@���<#r�F���� � �;"�{D. ��\@��<$R���ж�5�$�C;Cχ���о�k�Q^����1Wy �,�Ɯ�uhc�s�ס�DϏ9���R�s���3�C;Aט�D* �)B~�:��"�C�*�:����ס�+�:���C{��1��\ � �z X@��ש=�;��T 6P| R�����5b�S[E�?b� �
"� D. ?�\ ��:�~t�XB��ש��;�Wx��7�s�(�G����w�#��:5�q�����L�ש��ˀ?�Nm<�\�� ��E�N�w�#&�:5�q����Ԧ�N��\�"�X��Ԣ ^���;���l v�:�H�ש���e�1^�f��e�3^���w.��:�E���ש�x�2� �S{�w.��:�)�sp�ש
�ˀ�N-�w.R1,��`� a��Z��+ռ������^q��ǥ �06�O~�� ��',л��n����!�<��
дk���3V� �h��[ �Q�G � ��������������������uk�(RJY�N��z��6G�R�~i}��
3����_*�_ު~qr��uFY��Da����oz% �9,� ߅n��Law��ݦ!��ۨ�u=-��Y��;]�ɜ� ��ifz�~0i�vhb�pt�Ȁ �h�zڱ����� '��'~�+�:f��w��l�!�{ ��}% [�
�k
��#
�cv#
�k�yc `c hc yc�|�#w�p�w�;�:w�>�i�]�3��h�1� ����Lw�"�):� �E�ct&�5:� � ��w��\�;�g.���̥Y�x7�%�����*횆;K�.�@9ɻ��.턫|Z�s��]�� �y:� �>��� :� ��@�
tV�#�&xW�YM�Π����Ag5�;��j�w ���:� �-tV�c�&x��YM�Ρ����Cg5�;��j�w�ކwEx7ѮmxG���N}��Y��<���� 78iH����ݤ���z�.�a��̂ǕX�Yg,X[Y�:���X]OܙVA���S�}�K����w�;�l�Kqw���ns��'o��ץ��rV��~O�ɜm ��n��5&��������=�#ZG���" ��z�'��K'~O��I'wTO ˓N��$��bJg_�-�[qհF����1~��^���2.|S����Om�ꗚN1�W�\a�q���r�3ҕCī� ҵ�(1/#R�_�P�5��=[V�g\��Q���q�F� �zɶ�
��^J:e���}�m����˘+������\/�+��\_yQ�8C��?ګ}�����l������XM� 'VHK���<^�g�N����jH�[@�O��C��d@���ܛ��s.1���y�7j=��� \���s��&\��|HD��|>$� �~>�Q�k?�S�hõ6���õ,���õ������ε���hĵ��4*q�o��5:��-�P��`D+��Q�NpY��|"z� .�`|N�z�y�d|N�t����4N�Y5�bV
�h7.� E@:>�q]#��R @=ޕIׄ~�1��DAZj1��DCZj�H7 P��Ӷ�� :�L*���(IK,VW-i����
�&-�p����IK- Ai��(-� $����^5ԫ�z�P�VC����o���n c�$�G6����k�|�������t�'~�+x\��k_*���cW�3&>���]��ݷ0"�����s�ծ�R��_ ��uɀ����ui������]ߩ�wŧt}�ں}� �u���o{���&�s.��r���?���UӴ� <^���C��0�ˏ:u���k���������n�� Ou�����}��kfz̯̈K.�t��*�������-�0����/�4�Lj��V-�W1㳪��f�.d|~����������>� � ��l��o:����zٻ ��.�Tvv�Ϣv������Q{+�8���/'ձ��ǣr2c ft�2�# ��M��8 }ԑǮ:��1�Xd���U�:Q�r����N�ܗ}r��Y��ef�^�Q֙-F��O3�έX�Q�g.p�0�� ɓ �G��}��6��.5��ȭ?(��
��˥:d]�m�}�D����u��e��������d�0���bӿ̺g���{�+' %�[�Jھp��ˢJI�9J�3�|� �֨�2��(����r����k��*�=2[|�GV����gݟ�]�_��ѕ� ����`����ԮU^�j�~��v�GG���Q~ۿs�X�qT͕k ��%����C�����b�a�7�κX��r�^�1��;�Rj߇�4�IMmx��F����w։H�Hm��D|Ӊ�R嗎�&�] J�<>8��Ő��Ƈֻ|1,��.FT�Hı̋ͮ��H�-��{ ?�rź�Vk� i=sAj���GlɓS�N�߮����r|�� S;v�/�ㅱ#� ����bt9�H�;���H�� �]wU����<�ۇ墺��p�g���Ѳ����Q��_u��*��� Gl���#�� 5Wf96���7+�E�ُ���?��~,�oր����7�Rb8��F
���_n�#!�ZT���zW���;�J�D%-+�v�5|N��_��z<�'{�̬�>�g�3��Q�[�S���]yYvj���Լ/ i���r�s��28j\� �� ��HW Of�GM����TF騉B �枊��ZX�<�3��|�ȳ����U�}���c���qV������8.ſ�j�
�}7��ݠ�w���LHk�Haܴ��fQf r� !�eG�cW�)O|��2`*� \��#����J����8KN���xK�,���ň�K��� Lp�Α,&'�cr� L&'�e�$ �L� �i� `4m ��M��4u ���`6M �i� �M��or� �i�8E�r�: ���0�� �)��#�;9B Ɠ#�<M' �i:xO� �|�N ��t�����4��@S �4��Z@��=��PD���@
�R(�F�Bu�
��P@� �j)P7(B� e�E�!�P�:X�x<��X+ݣX��p�B�
E5+��5�R(�ְBQ%����Xw(B�!e�E�A�Pdf�B�Q+]cMb�b���$�(V(8X�x:���V(�X��`��S+ �P �b���
E�,V(�g�BQ/���٬P��b��'��
�چ P�(��ƑBu�
�u�P@�#�j )P�X�X�
�{V(fF�B��QQ�P�V(��b������,V(Ff�B�#�
{6+�Y�Pe�BQ9��Jt���
���PT���u�� �����B5�
���P| �
�+��5�YV(Q��
�V(f]d�B9�
��P�;�
�K��P<|���TV(J a�"6��:�PD��BQ"��jt����0z~�٬PT�k�ݤP@�f��x� �����S�z�
ſ��Ba\d��q���
E�#�P,He�"�+�SY���
��TV(�xV(:��Bq_<+c/�B��+�.�B! a��]co�
�#��
�P4Oe��\+t�g`��]c�@
��P��k�#X��M��O�B���/�W�B1+���lV(�d�Bad�B�7����Y�h��
�+�Q�PLv�B�
�`+բX��H�ؓ�B�O�؛�BQ�
�+�����Wa��'��L�ƾ�
���a���,V(�e�BO��ϰB19�
�W�mX��|� �
�W�uX��|Ş�����G�6?��������r7�������1#S������z�����`���!����|e^_�e�{Q7vL��� ��)%�Eþ��nԖ�:.�Uy��4�sqi�����.��@˖��L�_�'�����_�Jڮ�>r�VJگ�]����k���1�ew
}�3z�5 � 3D�g�{Z�o|�_�b�~��wu h�@x�A}�J�Z�Ҿb�{��j?�ӫ *���(��XJ���^k�6MJ�!>4y�V�O�Xgؗ�7 �v^��Fѿ�}���o
�G�'{C_��x���O՛��5���˳B���)b�����!bH�\-�?J ڣ��4#�_"���]�
}�Y��BK���j���ǜ��̟��Wz�)�vݝz����M_�;v�u��Y� � ��[bt�З�;��A?�Xﺫ�3a�����Z��I�}���h�E�v���/@����j=6t�{���yXpl./��� ��%>���;��2g@��80}8�
n=n�tmP�����$-���zBd-�L��� �%ns�I>��e�a��k���G��C�o&�\a ɱ�Eu����Ĕ��� S�ρ�~EO�x_K�ٯ���6.�S}|n��D�B��l�6a�3�S͵��I�4���K�� N�˳~ma� ����:�ݯ-���iH2�"�%�Ô$� ҒdHMbU��$@�R�4���y�\������!0]k&�@�O�qU���U�����X��tl��t̥1 c7Lu�cl�)�t�
�0���"ӱg�cO�L�����X��t�
�x`�n<0f7�
�c@� �ҙ��Ҙ���B�k �И�� @
ӱ����c �if���L�ֳ�I~� �0 S5�cS� ��X"�1 ��� ILdž��j<0�*0�ۣ�a���%��e ��v L����x`�[`����t�t���$���W��5�c�㿧4�c/� ���f �1 c�E�<�cl����tl��t���tl��t���t,I灱�1 c�E�F ��"B$��x��ƍyP ����"ӱ��1Kd:���tl��2 c�E�T�cn���t���:ӱ$��."�2 c�E�\�cl����t�
����y`\^`:Ɔ��<0f�E�f�cl���t�
���q�"d3 �|E�f:���t������+B:�16\�C�/|;<���| � ��;�XXh�/���@o��)���E��R||J1�7�Z��J�/�����mѴǬ��)K����*��\��!k�i�|��s��oc�w��������l�������$�Ή���z��'vVVMV?�l���_Y�п��Q�KjFIK�=%�v(k��hў�#�Y�V���Mk�Og�o�ͷ�'�ln�{��)~������3A��Bs3+`���YK�9�s�#�7���}�q��t}��;[���]y�{Op�mO�[�S�}93�o?��dẄW���`R'��Ħ���ʑգ
|�c����'�+X�?�y��y��Oߘ���N��<�e�u�ӝʹ;Tk�j��� &�U.$�Q/ ���}��S�G�KM Qs�5��R�\��y9�a]9�¼��ܺ�U�������7��yV���{ƚֽj�R\�����JI��Gޠ��֫��E����kMSʘSղ��0˹��k���~�_bV��`�7>ʼ?)Ҫԯ�Y9���@���
�XUj7P��:cU���R�_���3���j��_+5W~��Z�R���ɳ��}Yu��0 �d��Y��˿�h�?o����� g���d��(s��xgo% =Im�*Li:��*Ϫ�&&ZA)����h+��>%Կ�������"��1#����]��l�e��bo��r�Y��Z�l=ӭ��?ȴ%����2Ii�e�}|�ҡi�ڱC{�ㅥVd�@3r翬�rm��U#��g�]^��v�eSb& W�}X[��?F��)��h�T�9��˯�ڻO���56� %�h�Qs���t�ꗷ�|d�N�ќ����� � a��k
L�f*1 �qӇ+�樃c��r�ԄȦJG�D��JⶖjR� JҲ��c�*��4�F|}�|<���b���'�Rg�6G��VJ�\st�
Vj��fj�5-b����^ We�2.�Mu|�#��S�'�[*&&�Oe�T&�V'��?V��m�&��3W�B'��u��Q(����� ea'���� W��y����S�� ���� ��� ��0 p$ I, @�X %�& K� �4�Ф�I�Z O��Ұ@��� �4�0�a- *
kTiX �J�Z W��Ұ@��� �4���a- n�-b �4��-�E @��� �4�0�!- 2
i�iH �LCZ g�@Ӑ@��� �4���!- 6
i���p �^��G�a, 9��w��N�t�r��ܼ\|������kx^.�= =cg�<�}Z�a�p����
ccT �vRx�T�al}���WTy������ ����L^.^���@�0�<]c��a�N6�������l� ����;��
c?Py;W�a� 6������ql� ������<� k�0�����~&�y~B��als6��������a, ���'" ƚc� �^c�O(L���7(��)��T��OS��OU���a2�Od�O(`��a�O(d�,f�Q&��H��C��6���쿌�쿁���3��2
�_���g ƞf�O(���R���T���b "�6��������E����h��?�b�d��Xe� n2��Ά�P@��'���f�]Tf�Uf��c/+��-f��f��,f��
��r��=&c�Y�?1��o�����<�=�2��Lf�n�� ���*��I
���Uf�q
��4��{��R��@���,f�mMf�#,f�uLf�3Tf�6��p��m����쿸�쿩���c
���*��,���Tf��(�+X���<�=o1�_j2��i1�������������쿛����p�� �������쿩����E��K���f�5Uf��*��[<�=o2������4y��
��Wl4��o����7��s�b���f���؈0��|ņ��?�+6&��Uf��"x;�[�P|�ۡ �1���S�@�������@��)�8��{� ���F��ܑ�߅[� |��p����6�Y+��_�9���ڂ�V7-��ݧX[���x�[���P�^��m�o�]�6�Џ�la����+�n�Ek/<�ެ�־����u5's�v`F�j�?� L� ��J; � PK;ڠ�z,��p���M��X'�9�=�:u�pz�&�̖M��?�.$/�.�~��Y�\*M���(��jv�p-�����H�ռrк�A�zN�wT5�x\�g�g4�=���y�Ƴ�YϞ�h<{~I��s����X�g�Ϟ��`�j��Ϟ�h4{�~Y���>�g��=�x��S���j�g��5�=��x�<[���X�g�4�=� <{v<{n.��ُ:���=�4�i��Ƴ� �g�.�g�oh8�i�Q�١��c� j� A[����hǺ[ѫ��6,����\��nj̄�Z�e�{�G5���� -[i=�\T{���z�٥��ZL�
�Pc�քv�˱ۨ�G ��i���&h����/�v����l�⦏W,�'>�Ɨ��%D�R� ��k���:kI>�Ԥe��a����DCۓo=��ڝ�Vrl9hs6Z�B�A{��]y;�5ӭԼ3ZZ�"5-�km\�i�̕�ܡ�鳴'�;�&�ў�h�N �W�4��z�Ӊ������Xt��5�b� 9��e�����Zȫ�=� � |�p�[��O�_�?�|�Ξ/ƌ !����+'?E�`e`�Ō?O+:.m���oW,f��
��Y�?��� �вk�)�0㟫1��Uf��5f�)*3�G5f��Uf��4f�a*3�Z3�**3��3��M>$�7��낰Ō�����Ō���?���/��G8c��YcƞV0O
��☱7/��7
���� ���QD��y}���Vt^��Vt^�R+:����ъ��_���i�l�y}�Pt^ !��W���Z����t��z�ڢ�}Z�y}���Pt^�S(:�_-��o��WiE����Z�y}?��>M(:��ի��ͅ��z����� �zc^�B��+��ޘ��}�1��zc^���� K3�)<����#��C�`�
��T0sR`� h1s��1s�2s �1s�Uf�j���S���Ҙ�_T����y=����y=�f�5y^����ǒ�����}���}��� �����{������x���"����*3�i<����}(��T1s���z(Y��k����ܣf�3�F3����9o��1s�����};���1s��R�̝�K 3w�[,}��9o�2s��R�̽��̽�*xk"�D:V���d�s�k�:"nd� : ���a7��
�y��h�v�]��#9�����3�* >�o�mo�+�EO��W�%/�e��\��\�r�m��;~ l�lk.�{u��O_���Ͷ-.O^�IG�sR y���l�wQ��^�h����ꑊ���.�G���2J=�\��5�v�-�յv��:�1ۺ���?|`�T�#�v w� )ox��F{���qնY��-)-m���䬰����':�x��b����!���q� ������>�.i����W�la�{w� �ns�{_Γ��S�9��)f����6�����)���ُE�2��W�}¿�y�e�ɒ�͓��O �l�^��>?s��ä� ��*���}��S����]��I�+4Q.��⾜�ټr"�}5��y-��;/�����y�0�2�M��g��^ղW�)%�;�%m� �{)i�RZ�c�f+��8{s�Rv���r�~J�5i�
o�1�W �3����o�?��Y����rtu�<�����UjW�W-u��V욽��J���~�s����k�t)��i��`>4y��v�o�:�� �Ь�w���L�� n���J�Hw���JÓ
܍2�+�wv��?�4YU��tb+E��kL�g���G�0Cz~e��a�9��%�͈�_�#� 4�]Y�n�e��b��n��TZ�Mq���Ai3��ۖ�Hi;e��]�iJ��^�M�* ;��;^xՌ ���9��.�^5��|����kO*]w�c&<�t����{�6�}�O� - Rz�ɶ��W���c{�+G�����G����nǦ�f��Wݏ,�l>�3���[�c���g��mn%f�7�1���g���m���) ���tU��'nk�$�<jOZ&*Î}f >��9������ʛ#Wlv'��Lu�[�Q�;̔��ѕ?0S�w��mW�"����R�Uf �9[���D�X���&� �)Oe���Z(��`�p)� T���7)X��uc��̅� ��`�n �-T�P���Y��_��#�aD�# �� v�� v?1Z?�� Ҭ @�f� ���ڠ� ��"E F��/�kH��O�kJ��XҬ �g� ���f� �4� �Y?�(�Hi�`J�~ T���Ҭ ��f� �`yֿ��hi�`K �f� �4��Y?�/����� �Y?�1��i֟�no�4�p� M��)P�"pH)�� ��p���ݬd���t�"�Ɋ�,7+LVƸYxRa ��
�c
+ �vV �(� D�YxHa���-�73�b<�"�3��<�b�����3�<�_�� ����
���y�?L�~��g�]��'�Yh��"��͊@g�� 7+�MV*�Y(o� �
��-���nVv�<÷�<�?��"��Ί�v����RX�cgE`6���"0VaE�e7+�V�ܬ�1Yp�Y�k�"��͊@3�?7+���)P�X�ngE� ]c���g���(����"�RXx�����"0�Ί�7&+ ݬ|h�"��y<���NJ�j��H7+sV�Y��"��Ί��
+���RX�"����i;+-LV���"P�dE�I�X@Y��͊ ��bʊ�F��͊ ���ʊ ��"ˊ ��bˊ ����J�P��C�e%�U��Cf%`���0�d%�����'V��<��P��J@��b�J�C
+�vV���=o�� ��=qV��� �9������f%`��J�7+o�� p�0�d%��f%`��J�cvV�UX hcg%`�� `%�+��`%� ��)`%@TX ���J@c����nVʛ�lv� ���V8_�y`%���C�J �+6�p�bS�J �+6�p�b��J �+6���ko�q M�/|;��D�.% � �� �߄ѩw��G`�/�p`�W����Ͻ��<.��Ϝw&uȨ��ʸ��|;��9O�{">��9]ʶ��95��+ul9�O��/������s�Xb���+�v�|cgn����vʗ}M��K:���d���;k|���渣�ZF{����䱶�ev9�6��쐅�E��>)��]�B5�,T����0 �7�&����u7�O�N��@K�ᵠ�� xM(��Bt^��݀��N��kE�?�^��kF�?�n��kG^?j��5��#���ZR��'���R� �+�����?^_nw�����L�)��Ԟ��^��Z� ������n�px�� �]��)�?�(��|�Q!�̸f3֜�?�I��D,����,�zйoM?i���r� �We�w�t���%H?���K�k�=˹�m�.��p^^�k\9]R��琉�� � ��Q�uJ�_MN�k��2�8Dg�C�T7�g�o>�� � ��;l4��
^����d9g��AFc�j9`�&��1Wn�i�$k��1FP_�\r��[�]/�I�䰯��?mqFdL�� 8,7���h���l�\�h��E�u7�h�b�lk��h;-Wn��9�}�
r�Kۥ�1�� �3Fd�ir�G����o8�玕:����2�~<���1���� ��d&A�!53z��{ Ս��Ƚ���b딑c?�&9�9#;�^�� �Z~�� �ѭ���������� ��4��+�J`�7�E砊�1��h���뤄F}� ���J)r��N�Ћ��WKþ ��?�Q�A��G����.���KK�S8GU=%���u���MJm�Ǚ�{���3m�Vc��t�wOH�i�'��i<��uy Q�S�'��� M�' w�������a�η��E'��G�-�����"���h�����" "s�O���/�boz.��\�I\�+�\�s$.��\����� ��|��E�&�:@�p��,q��AϏ��E���E�)��� 2�� .�N.�l;���E>��1�(BR���E���,H0��d�eA�Q�dcM� ���t�4���i�D� H�$!a#$"iZ���iAB��II�$&EHNҴ A)B����J�$+iZ���iAҒ��K�$/iZ���iA���L�$3iZ��T� dLl�������6��!�1b�IO�$>iZ�8 �����iZ�l @��iZ �i8� ��l�@A�s�q@����m 8H�� M �4- Ҵ HH�0!M �4�@�q@`!M�"�8 �P�!- ��"�
iY 8t0"��C� iZ B�i��`D� iZ J�i0���D� E )Ҳ �(X���E@ #iZ ^�i��� F� iZ f�i����F��q>LNh���֠�����5�u�@�Ip���8&� ��b��!�[rJ�ȡqw���t�`P����~�/!>�B wƵ }�z��9C�=����ii_՝ƾ5]�W|���n��$�w]����Ə%��O�X�RyQ��QS��#��&��ғ��S���'�5>פ��>�k���^h�R�2 �u �u
� 1�~�F �)È�+6;���bz���F�dAnY�=���y ��y=�)����R��H�����[� �[�z��Ȅ���%n!v�Bt��p��B<'q Q���5��.r �~��r QS��#v��ך[���s ��[�k�-��|����Ox ��xT��c�[�{��8ĎFxo��X#r��0�d�僤�^Q���%���%��{�| ��z� �m�$�5�7(�f�����R�����gT"d\��Zs�n�8G��¾���}U����c�%О3����f��,��'�f�T��+�G�=����˾gݗ߮�r����_q�� {�q\�� n)���֛�9�R&�{N*�m����V(x�X�����/���t�!�|^F� ��:0�6�?`g����O�ub���'�z1���O�uc=���q� ���A�ud���3� �1Ο�� �2U�mg���8�/�יq���zY� �;Q x퉢ܡ� �:�u����GdL�;�3�����pA
�LIH96i�P/�ߩ�>���%����C�����{<9�n�0T�_�� �{
����q)�^,q�T1���qX�����@��z���g���T᮪O֑g1�O~����@o����� 78i� �u+� ���濧��.�2��ݘ��X��% �z⮼���2}O�F ���,�с='s����fz����&v��i�Ȁ ֏Ev�Y��c �O���I��1KD�3[v��~n�Y ���t��~!�} ����藚���s��N�肎��~����z����H�t�.��p����l����h��|{��K/�TBst/G�rt-G�rt+G�rt)G�rt'Ggrt%GGrt#G'rt!Grt G�qt G�qtG�qtG�qtGgqtGGqtG'qtGqtG�pt
G�pt G�pt G�ptGgptGGptG'ptGpt�F�ot�F�ot�F�ot�F�ot�Fgot�FGot�F'ot�Fot�F�nt�F�nt�F�nt�F�nt�Fgnt�FGnt�F'nt�Fnt�F�mt�F�mt�F�mt�F�mt�Fgmt�FGmt�F'mt�Fmt�F�lt�F�lt�F�lt�F�lt�Fglt�FGlt�F'lt�Flt�F�kt�F�kt�F�kt�F�kt�Fgkt�FG��˨��X�vͬo �
��Qj@�j�4 2�5Ee�� ��CQ/�l-Q�(z�G=�� Ԡ�:� |8�F�� �Qg��u��y��t�7꼠�F�$�7�:o���F��: ���Q !:o��,�Ɲ "o�i�����(��7�X"oܹ$�Q ;D>�c�ȇs���Ed�=n�7���yc�:o�yS�=/뼱g��{�X���=�7�La� P�7��� ь7�D���'R�>��эn�l�(G
FD;��=��Q#" E@?����ٲ���#""FDE��� 1"BbD�ĈH��#"&FDM���=1"�bDňHJ�#"*FDUR� YI�t%e ��-@YV���5�-M. q1"����#�/FD`�y� ��b/�@Dƈ���#�3FDh���� RcD�ƈ��Q#"7FDo���4I��E ����" Dt���4Qd��
�;FDx����1"�cDħ @w^�ȏ� #V �PH)�J@�F��*`�ʀ�F��J`�J��F��j���#V�L��P�*�+ E�&��P���+ F�.��`�*�+
F�6��`Ī�+F�>�a�*�+E�F�"Q���+E�N�Ba�*�+F�V�baĪ�+F�^��a�*�+�|�W�h��a��F�F�p��a�J�� F�x��a��'�3K�/|;��43�wG��nO�
��nqiqÒ������C���� �y�� ��M�_��?�+xL'�M]W��WZ�,�T�.t��-,4�����H|���"�{��J��?����eg/�W㦯���^E���ءP� _�H�fɘ71w~��s���X��9@N]�f� � +�1fk^+fk^+fk^+fkc+��!��e�ޏ������q�� ~'V��^� &��?��x7���|�Z�
�ӹ�ƴ���W�������ߓ�Z��}k�mi�y��5���O��V���`�z~����*�� m�y��,>� �1�����˪|�Y��w�>�k�����ބ��e��wZ|�K���j�y���� a�y��,>�?\��t��+*���_��?U����*������X|�d�� l1o������"d�?.���"��/~�a���p�^�k�- �?�z���ݛg�̭q���1+y�W������<���=> �����|@�ə�mTy&�����(z|~�U�FV��q|>w�7��/��L�����8>��yDfi��#�0K�n���N�Y���_���]?>?�b�v���X�Y���#,fiϯf1K�~|~��,��� �s|>�������W��]?>�S�Y�����Ү ���b�v��������Of�����[EY��Xyf1��c�p�'�C� 76.)���ߛ��ݴ������w��/^�y]��Ǵ�km��Qk ��:�U֎��o� �F���#�d�@�� YF+�d7
R!�C�?�S}����}O��f����[P�߄����&:�����?�k��7�YZ�?����2��Xxp�M�ü��W���������1MP��My#��3ߛ��-W���,��V�����y��w��z'g����z/3�\����<���bU��v�hU�6�hQ���hM���hI�v�k��Vц -��n�@A�q� G�q�G�q�G�q�Gkq�GKq�G+�ܾ��l��͔�sK�G �o�l�vI��g������3&ڄ�u%�h���h ���h�V�h��h�}�om����&�}��7�|��7�{��7�z��7�y��7�x��7�w�u7�v�e7�u�U7�t�E7�s�m�ђ��ъ{n���h����h���ۿ���^��坿����S�o�� �߮��-`���V>�k���TY�9��
#���l�k�H�� �$��J�� �d��/Hu@�$���"�'YC �R %��R�� <%��T�� \%��UlB��J��d8K��dxK��d�K���� �S f�� ��1"&�E�2YD 6�E�3YD F�E�4YD V��c]#f�E�6YD v�E�7YC �S 'k�r���5KG|g���&�^[,V�>��Y;�>�^Ϙ�z����`��5Ce��i�U��*�^�
�^1*�^�V����z�WX�������d�+�b�Kd���v���yV������b��C�U���^;V�v��z�VX��@��s^�>Gel��+�ǩ��Q�W�?��J�&�Do�j� V� ����5�X5�a�j�g��[`}bՌ��N�j���}�W�����m�:�]��]��]��X��m^n�y�� &
�@�"���������7,�{����<�����}kk_dGY�s��۩��z���_r^/���A����D�ߟ~ BU��� Ew��;����v�vdj��p|�258�Q�_�����H��
�K<=k��>adjJ܈�6� ����?!��=��;�[�?�ؚ*���%kQ� ���%�v oU��.
^+,�[e�s���;9��w/L�� k-�',O�g�X�^pNla�|m��~�C]5���Adsuu�:ڇ�~�G-Kh%��5Տkk����Ņ�[6�� 9&�[�cen�>��\���;[��<'l�>��?R��t��%�_�g����ZVn��E�nw�O���� x��O�~s������� �O�~j��^j:T˭?��Bg�r�D�ﲮ�A�*��ɎV���Z㝃Ԁ�Z�U Ԧ�i�zj`b�4�� �Bz�TC�� aA_��>~BD�Vı<�ٕ/���K����r�U�����3s�6�U˖���Ny^m�
�}|�ڡ�� ���we�B���� �P�}ss�"jT���R������]�-��?�2q�gB���G���`(τv <���Lh��3�U< \��l�gB�� ��x&'�L���3��τZX<��Lȡ�L���3��*τ�h<�k�c� ��,p�gB��+r� <ڠ�L�3� �gBYτ\t��M3!'��y&4���H�gBC,� �K�P��3�τ����/��[ ����Jh�+f%4� � -*�2kτ�T�
�x&4��Pg�gB��w%�筤��3��τfk<��Lh��3�*τ�i<���L(�� �0τ τN�<j.�L�K�gB~τN�lj4τ��x&ĺ�k� ]�x&��3� �gB��3!��3��U� ���L(Ye�c��])�O^)�mhn�������ڦ$=�<�� �{�CCn�B��ߞ���L�c�����>�1�O_����e�� <�̣�'W�;F�r�Q����8?�Y> ��u � �E܊܊̊�6���+=�����Ws�"�јz��L���x�@Y��_�"�����v��--�>��� ��� � cR���_!�7�?{�w3�K|�^�!��3:�Y?��.�����e�_��&��e/�l��q��{G�t���.�#�U�m��'����K����˾��Z{\e��/�ʹֺ˯�m��v�]|e��⌏��v�k�J�&�*GO�?�,�`�^��S����٫�3�U�Qm��vW�C�N� A�*;k�_�Uk�%��i{h�ng���:�~� +c��9[�W��Ϳ�Dz~iW���9�\
ON�ens5��3 }��ɪ Φ_tɳ8�ۂFۜ���-�Wmg��-,��3ܧ�-��!9�x����{��U���{Tn� q�Z���Z��f�۲-9��v�fg��{\���rvh���c�Ύ��"�ȑ;�ۢ�=+G�Ze�|f��嵯]]wMs�LX���Pg���\�9��=Z�q�Lk������;�����f��P�{4��UNvl����;'?����ќ�r�)Wm�e������ϖ��ˮ��+����'�rƗ�t%D�q&�1\��}��۞v%�4s&-�w
;^�9|�d�w��x�`�Hg599��M�yU �oKIΑG?Pږ��%���u�E�s� �q���� ���k|��|"}���짝&.s=��8`�kҼNN �b�K�֟��|��?��� �n,���xk7�;"=�D�Ū��OV�ՠ�U��w��mv;x��m��dŮ�Q��J2߂O�x���C�+Z�ϵ0>5��\�:���Zv6��Dd�e���HH[z�y&&�-��,��t����_��$�@��� �b��n[r],�|og�e��Ŗ�n[.�XlY�f�e��Ŗl;�-km,�|lg��u�-��Yl�dc�e��Ŗ8�-��Ŗ���a��2��Xt��5��. $� (������%���`�e7]#P���7�.�2�.gl,�|̾� ,��ƾ�9l��`¢�6�.�:YtY�b�e��E�],� p���Ƣ��}�pHt�a�%��|Xt� D�8�_#] �Xt9J�L,�|ƾ�:�_)]��"X���A�E�O\,��`_l 0]��/6 �.��,�����2Lf��k�.�� �E���
@ǢKg'�.c�A�E��t��ǢK3�.��E�X�y�,�D�Xt9Ǿ� �,�l�Yt�jc�e�̢K��E��2�.�],��d_l N]f9Yt�t��2�}�HYt��d��i�.͜,���5�+�.���!Ȳ�2��lYt�hc��*]#��C��,�����E�}�
�̢K&�b0��b�/6 4�.O;YtY�b�%�ɢ�L�.������2�ҥ��?���A��;�7л�o ��[j'�Ǎ ~'
�~��
����������?��;��H#/c�-i'Y���V���=�m����, ��U�G=gɶu]>���>�t�O:K/�k�t�1����^.�Z�*�f�\��/l�+��3�7~�|� �J�Fɕ�U��z�6�i�R;�Y�t���==��U����Y�P]�o���|���t�Z��!�5� ��ը []�3��p�5�n�/�z��
ߓ��8�� 5���lxR�e~�l��9# }��ɪ�FӉ�8�Yv#0ѐ�F��O�!�*���rX�OF�O'9��~)�x}�ٕ ���-�~'�t�s�Z�Fj��r��?_�%�t���Ѯ���� �.wv�����A92`��s� ]� )z�b��R���;��g�Lx����G��:�sZ=Z&:{��4z�E;{�
F鬒�����أQ��f����P�wPzdqY�ќ�R�)g��2K�����s�7�McP�W��S��rNgBd��p�%g����-ՙ���HZ� v��1|�hy����xZ y���� .�3�J�ª�)�nit�+rj�����i_i9?;�Uq�2�:��d<���dv�1a��S�������E���&{9<��D)�Z��#���U����j��:XB�B�h %����t���� t�jҥן���� �Ӏ�QL�\Ei@;�i@��4`��i@'ơy�N`~2
�v�i@{ӀzN��N`�2
�v�i�^Ӏ/�L���|f���5Ӏ/lL��L1
�)3
x��4`��4@�1
�%3
�ic��dbc���4���4���i@]�i��N�>Ӏ�N��L��L�L��LNH<{�&3
�Bbp�����^q2
xAb���4@��|�d�4`��i�H�i�3N�v�i�!3
2�<-3
�d0
��y����4��/b� ���IL|e��IL��"F1
�X�4��/b� ���]L�s��4� ���eL6r���4`��4���4`��i�8�i��N��L�:��4�$:��4�Ds��4�����L���Ld�PfpPbPVf�QbpVf�Xb�L���v2
x�`�i�T�i����R�/q���4 ���V��N�� ��e�
%�}d�e%��2Ӏ�Ӏ�2� �ij�+�3
x���d�����?`3Ӏ�N�/L�9��L8��L&;�D�H6�-� ��� �M3�o�t�g@���wg�w��KhPp� ���m��Ԥ�w������^���wM �8>!.e���u��ߴ�7$,��{7��u�/<.����aa�7O*Y �(_ �"n{�A��7ڋ_�"���+nOy@�1�G<�B�O/�*���J<�l�ܸZ�5T�;��?D� ^?,^�F����O��_jZR�d���j�uL�R�e�r�S���� �w���L���z՝�^m�z�O։~�-k��@���.֚0Y�F��� ,���[�Ӳ��p�0����X�lѿD{����Ѻz�o �n��}��7^� �� �ɔ�z��Ot9~� ��n1(�1��Z1�� 1���bX�81��$1���z�8�ٕ4����b���咁z�������m��!u�S���:����W;�=�wlM�T�s=��1��11��b�WYb��o�]��#v��S=���n�-Ի� )ڟ{F��_z� z��zﮑz��鱍豗d�Q����>�ߏ��G>��?����ߨ(>��iq�� ����ߊqO����H �ؗz|�WĄV�!�V�5t=��\}�=)k�>lo}��G�[F��?�J ����<���N G�h)� yP XSL�8�� �5���Y��q�/��ܛ��gw�O8��O~�V��������/�'�0��t�-�+�;{�� ��*;���*���_�;7�O �hE]G���`�[H���Ӧ0�O9����F!�h;�FL)��V1�h�
��Q�ÈiF� R���C��2pH9ZiG�!�h8� -��e�b1i8�#-���e�� \�
LjK�5�(Q��x_.�*QwHW�D�!m��C�R��%
)L Ҙ(;�2QvHg�)��D�!���Cje��&�)N� Ҝ(;�:QvHw���D�!퉲C�U���a�(;@Qv��� D���4ex �Ah0A� ��(;�Qv� �� D�:����BT `�"@ S�4�FHa��k����)"�0e���PÔ��9L٫�5BQu� �AD��(U8��D� `�(;@Qv�'�� QD����Te�"��E� `�(;@��/� aD��(�U8��F� `�(;@Qv�7�� qD�戲�e�#��G� `�(;@ Qv�?�� �D�1"U8���a�(;@#Qv�G�� �D�&��Te�$��I� `�(;@'Qv�O�� �D�F�� (%�pJ ��:�*E�V�� �D�b���e�%�pK� �(;���7�]_�V@ �%��P"�2Ʀ�ޕ̷��)npjr�;�~��ݼ�;$(�����X� ,�
��-�� �-�������ڻ��.tL����m�?�a��^�篺��1��;}����� $H��) #�&
�w��7�=���z�_x�<�{�_v����|;��0���#cF�� ���N�b�O���Ȥ4��ݱ#�n��q�����u�_`����n���{�{������&�V�-�������:0�+ yF�zX�{� =0�옾����7� �?�u`�7�=#�e�������+�~��x��u�w ���L����78Ȼ�������f���7� ��Z7�g�����7�=/�gj�����7� �?�u�7�=#��=-��� ����4@��������ý��� �i��������v��� 0��Z�y��3�?����{���'�o���'��m �����@���3�o���'��i ����`O����[7�o���'��n�ݵ�!� �i��{`� 61}���O�� �ڻ��C�?����;����?oa����7� �?��w��g���� /�� �:�Eht��_� |[Bl � �� �����'a��~��x���^�� �i��{`��y��n_�+�������g����w���?��5���_�'��i � zF��zZ�{�{`�w�c���~��x����@���a���^���v��� 0��Zx {F��{Z�{� ���TL����O�� �:���3�?������_�0}#n?�o<�D� �`��f������D ӷ���'��o�:�{ �g��=�+�&��;����G �F����@�ʭ��yH�zX�{� ���:1}���O���� =#��<,�����.L�?����`�A�{ zF�{X�{� �� �1}���O�� ��] �� �a��{`�o21}���O�� ��] x��O��w�g�q����`�ӿ�7����n�a�?X �������@����� a�pW�HpX�/� ���ݽ��x�'~�.x,�/�2���� _��o�Q��Q確#��x9��ʉ!����ZV���)�/m(
�HŞ-+�3��t�z�8�D_�d�҆�|Z�y��QZ�J/��S��r�e�F����r���kV��^.���(V��K�� -ޟ�"U��G� �[z�Y��`�0�J�^z��U�j����~1� zP���Qc��z͕�F��{u)�����uz��rR�a{ćC�Iu;"֫�]�o�.��1�jb�����'��2W�wN��gMV)zӉc yV;=0�%)h��zpd�ҫ� � +����}"��b��jR�+���[�J-�~.�tV1Z�}Wl=��f��-y��v��z��F��� �F��� /�"�%F�\-E�!F��+u>�M���*��az̄�F�����5�s��=Z�3z��z/�F�>?软�0bC��c�6� 5ϋ��~R����#��GsV�����c�s������E%&Lj�>[ �2'���˽a$D���L1�[�ۆI>5�eQưc���9 ����xZ�4rE�� �@Rg�⨰2RJ�qt�3Rj�Ebj~i#-¥��2�UyC ����;E"}��d�}����2��F��5ԁ!���b�G��sʋ�[ z^�}-�@ �)�§��H� I�|��DɄ
#&FL,��\!�0b�a�DÈɆ#% ~`��$ ����1 1b"�/Ɉ#&%FLL���1A)B�b�DňɊ#&-FL\���1�1bc�DƈɌ#&5FLl���1�1b�c�D�Ɏ #&=FL|��� 0"`D ��`�#�F� (H`D��`�#�F� @0"�P� ��`�#�
F�.`0"�`D��`�#�F �>�0"aD `� #�F&�N�$@Q�@E�
#E -�\�0"�aDÈ@���� 4�j�0"�Q��� ���"� F<�����#� F@��1"bD@Ĉ���#�#FH��()XbD������"�'FP��H1"�bD@ň���#�+FX��h)�s�"�R�ň�K�#0Fa���1" cDP��f߂��qLp��&r��&�M�KNn|��� ��w�����k}4c�����ﵭ3���W.���pW���ײ� y���~ЂT�M��{M�w��w%pQ����6f� �&�"�e !*:**.Ɍ0�(2W6��V���4m�Ѭl��KX��5[L�,+����e][M���� PM%��.�gʹs��<�9��J�em)�6����do���_�\ϠJ�^[k��VJ�]+��m+q��h�
�N����:�g�%��!�p�X�
w�w �p��E��e= C��R��;ʭ��'� �+��?�o�I�튽�1���{�H톻
�'}�����C��a���/�R�ɀ��M�t2R�sr������뺡R��T�_&��5�d6�Bc'��L�� �!�Kޝ ���������g��4��mH�>r������|��s �~$�����w�"G�̒�� �c����_vbgBJ}��p �����H���?+�Ϝ/��[<�.���!=�CsjH�|���H ��#L���v1$�}
���aT�.H��a̱!� 0ܳe�����e�!�����o�ɩv)��b�;@��ʑS��Խ��ݻ�d��<��ii��F�����h��Zą���� �����4d
^�e��s"ߐr� �s[,�r�l����Hӗ��g N�fξ_���]�=�&�y�W��4�ӋN+b��`���
P(A0�xH3��w��{K�}e�'��o ���-8��� �����9�� �}�]�|�"��� �����dy �?����1��?�l$(����+%�+d�[9���Wp��s��3���q�S �c9�w�p��4��������K�;���I����'��?)���+��oc ����F1 ��!G������� �� �;����� ���6��?%P
�D�����P���L�?L"�?�@���D�{��B����������Ph�S]��C��G���9�Tס �������?�u(H��Ca"���~(���P���|?���G��y���X���|��o���]&�o����א����#�ߘ|? ��.�A��72���ő�� �_�� 0��_���_o �?�#�_ ���/��C&�o��/&�BI�?�|?&��D� ����OK�G�7��w3���8��WV�M�WX�_���eXH|E�%��|?/���2�� ��?����?����M&���O��������%�Gy����x���"-�O�9����/��S(�����=�ʝ�>N;8��kOg�0�3�^�P�h��'�ƴ��v4kY�K��?�u�S�7_ z��_�gxC���s`+��]���)ZC5[j��1��K��}�Қ,��0Bkj v!Rk 6��v[@+�b˺��[��Bj}�����f�Q�o��튭�1�1��b��!ݿ�u0 �4�\��l��{5��R�O�pl���d��y��R����eӤ��Š٣$~QG185�u]146��I��� ��b��/���������vA~U�����G�� �Iw=-j�C�����w�J)*�!F͕b���1�� iu�{�IH����u3 �k�Y*
�d�?3O��� #���"��K���8̷��0�14/������Z�.L��ѫ���6v�NH{ӵq)/@��Y�K�y�URr�1��<��K���(���S�����^���.Ҥ_����qi��ڔ�ΐ��k�
!M�Ц�~����l?���ZV�))'r��sl���b���e��wf�8}�"i������Ҭ�.��q#�9O4=4�lR��Bv���� ����4�����L�I�`��X��=��*G�?N#� Ǒ���̑�oH��G��'���O ��"����� E��1���F����#��X$��H"��h�%�i� ��gi�8�#4�#8��چ �M��G�?�� ���K�� �~Hx�����H���s�W��Os���� ��/��o �A��D�?Y#��N"� ���\"�?^$�?M"� -�� %���(�������'r�O��s�?�S]�B���u(8�] ��W�k �h��C!"�Ou
���P���%�E��M� T�$��E�G�?X#��T"�?H$��'���E�c$��{��(l�ے��#��E� ���� �~<�D6>�_q������O������ ����.����������#�BI�"�~L���p���"���Z$� �����g���q��?����?����~� ���(�����%��V"�?Q$�O|E!&�O|EA&�?R"���O�����
K0�x����x������?�s '�xj��h"�s��g�s�p�?�]�kOWa���~���j^�jLsi5�BK-�_bm��RG�R��[���R�gXe���b�G�g��z@l��JWC5Ul�i���K�k�''��,�i��s5��j����j�5��u[@}�E� K˺��V5�[Z��#�>~���Ͷ}�� �mW��s8�{Y�
�Jk?i���i�vG�G] ����w�t��|���=/v:��e���`�%p�]�.�4{��/ja NM�B2�ZBc㴰�G,&��Zx�K�wC-����?i��mvu߽_���2W�5?��ޖ\��w==�%8��̝c�;x��b�D�1�Q��_Vk��I�jq
���֥i�O�w
xf�8��?s�8hc;���yI-ː�A����a�MĄ�{, �~G�^�������ە��6�p�k�ژc���ݠݳ%�5.e���l���^�Οl �DLN���4�m�A۩�b�K�ޞ���/�k~��,��t���vM����� t9�j��
��&���X��l�]����*�R̉\b�9�M�m�k���wf�e����{Zf�Ng�Yf���<�Y<4ͼ�z�i���SL3�
%&i&� �?����,�9���^ �M,�`�5�=\�k�۸���x��#��E���^#���,�$��$�O> J��F�����"���.�"���.�k�'���4�\�c5�\�4�
\��k�,�Oi��[����OY�� ���g!���H����?���_d!���F�����N����.�/��� ��C$�?�E��y������|������]$� n!�?@$���B�?���((��4�G,�;k�X�S]�BC���: �5��\��C"�Ou
���P��S]��D�?�|?����A��?H� ���F���������`!�?Y$���B�?^$�_�B�?H$��B�� �~8� r�_���oL�ߏ
=�]�j� t��ߠ��Os��_��� �"��^$�?�B��H�?�B�?�|?%����A0��$��I��O$��B���F�������F�� {��J����?����v� ���(�����%���H����?����?����H��&f�"{���+}�V�K������ �a&�W��������)�� }�'O��W���(�}���Y�8b���� ����� �p�� ���ESN�_��5�_�_}��2��֠����t=�?����7��� a�H��WS�g�t���p���j�E�%�ו�Ǣ��W� fw��*Wk`|ק�E\Ͽv�BRp���_��'�6A��a�b�#yru��B"p��A� �$���hkz�5).�:ޖV�� � o˵';��Z'Y92�lz�WZ�udZ3�õ��H0 Qf� }��j�u���W��[1��|l!�q�P��V�)�~ ���E���f�omxNy��Za�O�w>�Fݒ�l}����^�l{�Ya{� ����N�ߕ]�Z®�N��}"�w]k�=�.ޏ_����<��x7��rJ=`R>�JQ�U��u���o���C ��'�+g�F�g�=���4��p���z~�0��W�
�Ϙx��a��s��� ��7( ��wD��ܡ�8�oo�$:8��twvr �;?9��n%rk'%vZ=%�� c��+���V�W����]� 5�gM����Q��~��*���}�������ˀϹht��;">����m���
T�Re<
�����
�����!4$"6&"6("6*"6,"6."60"62"64"66"68"6:ChxDl|� �� !1 BP b` bp b�0� A�@A�`a��A���ͩ� bs* �
$6��U�_,�� �
�-""""C6D 8�t�x !�1 1111 BP"b`"bpr� �>=᷽�=|ox�o�Hꓜa��� ʃ��a�nO �������w�geجi�� �h�p<�-8ʚnM��X3�l�z�Wf���S ӭ �C#��?�W��o&��ݡ�y6U
P�)�\Dž��_P�*}F�V���uX�):��am�Y}���Z��� �ߒ�? :D <��Dž���L�!(��� ����I��@G�=3Ǟ�V���j���Ϥ��Uk��.�Ư7���b��t�U�p�7o"��p����R{B �b���z�ᇸ/�L�ȱ��їd�ؖ<���k��=A�jv/��p�qm�oZ�'b{r�E�i��q�w���w?��W�N|���N���[��?�qI��,�o��9��9�7�9��U�Y���2��uJ<J����۽�)�>��=��=��6��V��Kؗ��f+#��M��&�+f~Ic9�f��Z6�@e@Du`��!���mr���� ("�"*"�"* "� "*
"�
"* "� "* "� "*
"�
"*"�"*"�CP DT!DT"DT#DT$DT%DT��]�W�I��H�l}� ���Ez7�"==�!���q�7 ݑ�7�:�/� ��� �KO�[ӭ�àJ�\�@z�?k��ٓ��*�=��ϛ.=�34,B���)��=n���N#U���P���S����n��=U������� ��a�B���C�Q�9f�Ts,�}���W�DG�=���_��p�G`�����nGFV�Hk^�G����ۿ*�?&=ӆ��<����M����l�(GF�c|�����?\�U�S�/nkZR?k�xGvF��)4��8%P��=���.z�Z_������93�Rr� ��kb����zw�ԯ{�O��Z.�n�e�����'�2KN��^iБ��k��v���k�u�5#�Z����!a!:�=������ۧy�P�r���fXnO����k��=�7��? H����g�£S��I���f�� �I}��L�a�����+5���+g��+�� ����z���=1�S>���� �z��I������z���V4��'͖�e���r�?�H�SHp����ܜRo�-+i�==ٖ���&�����&:�X3=���z�Wq��N�{�x8���_��?�����)� ��U�_kF�D[�mJ^��D8������?��0���/$4To�*mk�=ՑU)�Q���"t�Wi��f[Sli�l�C���_��Qi�˷��^�Ui�G;����� S���_����,{j��� ��ۿ*�?5۞��1���*m��4[z�}��o�А�K����?��u��%5��K>o$��E~]����8�n��{p���_4�g ��/ �u}oP�H0x#6�z�L?)��� �f�H2g�`f���a%�_e������3��W���E��_�� e͛b���?C���c����E�`��W��7���7�(:�n�D���$�%�}~G"�wmo��%]�ϰ&W�쏫�?,� �#B���ZE�U��-��DK ;�1q� /�l�۽M@�n�F��E��,z������ ��x�:�o[Z Z T t�y�:�/� D�$��ׄs��z��ʇ�㿶 {��Q���~.�__�_���W��8U�����uG�K�+/5*�Q��; �m]���7oݠ����-˗*[���s�m�.�ܞ4F�1+7r�]��]����ݶ��n���{���k���~��-��`x���oo��Ǔ�?�@����S1��S|b��i������3�$(g�e�ڟ�/8���c���/�*��K����y�Mﭮ�x��u�]���?)�F���`�Qg�����a�e�<�iz�� |� ���W|�th��xG����|:+� ɾ�>�� �F�{� ��3jL��_f��uS bZ�~��ĭ��ӹ`�3I��
�g���`���yj��� ��Z'$��s� ^� 5j�G��%7�f�k�m���~�b�;@?��5(�y� u�k��-n���^��9jd<�H\��t2�C)���7��C�����:[�By���V !�1�1�1�1��
%7�B B��P��c+� ��
%?�B B�V(-a� �"[���V(AH��I���le�'[�!��a�B��P�pe{J@�"b�2��e�C�2�f�C3�PF�pf!�V&AX�IڥV&A���I�le�:[���_�a�ZB�%S�@D�k�"�)���@Dj "=�"�HD�
"�)��J+��B /]�tb)(���BDj!"��b �f,����r�H;D� "�)��4DD*"" ���HKD�&"ғ�7P�!Д��yzٵZ%�LrLH&Z+|�E���� ��k�}|�?0�!e��:�_���Y��h�G�t��.�[o ��b ��~�^ �D��p ��b�I��2�J1�
-�ۗ�x,�å�}��r�opI��%���S�m�'N����'���� C�s��p���}��;c�v�/��6P}�q��wݍU�;�~ ���G�Q��;�}]б�L5����X�=��7w"G�|��z������&��Y�è�f�z ���~�vf����@�?��#���>�����B�φ����^����9�2�����2d�]���2�ӓ��j���� ���T'�Kn/ro�s�?����ڝ?��k�Ͼ,����k�T��
�G+�,��$%J�e�b���{�[#[
����[To���vVZ�L�[~�Nm��|�-���뭕6��������r�(ާ�n=(�歴�N:������C��,]�U�}%Og8�S:�{G� ��W�@����cj�� >�!8|" 2���
%, ���LJ7�Y
?�?%���m{�n�lT��X���zP�f#�k���^�����1��3�G�o�JԐ!��#JL�B�/���#5��P��YE�[��1u�� ���j��6�������7��Ai�P�K�u��o�7��U?*#�yB�]�Q��o�1��c������u\��JR^?Ւt���ꤎ�� �ܭ���vok�js/�Sk�R���' ?%ط��'m�'L^=MI[�V��QJ����� �8i�:�_%���j��[�ꔩf7��s|��9Z!?�d��[����o�NW��3օ 3�U��E-���<~N�Y��B�[M��=
�~�ص�jdܻ�zڧĮ%��|�D�Df�� �-�^ �k "�zW�d�����zY� ,�fQ��z]��#a�4�H D$"�!����dBDB��d��X�H.Jd��ߑd���cG��^ ��ұ^ Kt@>Jt���HB�@Dċ'\�k
�d�<@LD$'K�@PD$)"��'� ���ED�""y��� �ȈHfD$4"�����FD�#"���HvD$<K�@z�+�g�R@~�z��F�^)���1�^���5��J���(�Wj�O �+BA�R��k �+��z�@8�W��^��P��v��ń!
�Qa]� ,�(.�(0�(2�(4�(6�(8�(:�(<�(>�(@�(B�(D�(F A�Q��0!�8!�@!�H!�P!�X!�`!�h!�p!�x!��!��!��!���<
�����P#���!��!��!��!��!��!��!��!��q7���q��K|0����xn^>��P�۾.��˫�6�>�+��ߡ�������9�{⳼���Z���9 ��(�
\D��sq��L��hp"�\�XҀ�;3 �wgƣ�W��q�GY�l����HH��_�l:����������,�V�lf�G�c�D?Vh9��R���6Żr^�[�[Q���oͳNͶ�U��K���B��� ��Y���U}[tn~�����?���p'2s�D*H�ء)�q����7����c"��ޟu+�50����s!UԿ~��l��]9Gl�g���}�OU�_G�#��꿲� j���L�"q�ةf���{��-e~��ݾ��� �X�Ϻ�����up�]�K�ߜ��eMꃻ U�� �&S�a�_u�n�7~e=g�,�c�~z���3�ڽ���*��^;���F �`]���of��m���fj���>U��is�_c�M�� �� �}Wp(t�z(�1�=����*���\��+۬�┚�C�Z��J�ރ�:\CŻ�f'/�-l*�ۺ_�9��P��|�w>���o��&���7xüCj�~��[&��6�3����'�fM S�w��6?����s��b��剻�Vk#���
���Rڬ�-��當 ��qNM�vG
�]�s|�A� Z ����;���w�����
��?v���Q:}���y�r�˛�Q�W�t�4>Y�Bp�%�bB{}ʇ S�h>�a�Q��5"?��w���j��O�=�k��|�C����ޓ^���~U���g�:��;�{\-5��d��S
��� !n���?Q��)�v�w{�����y]1��L 2SV�v�]66CI�Xq� ��51j��� z] \`STjשԇ���\��w�*^�ɪz6t�E����@�o@� ���T�������1\��hs c� ����1��q������1��q�j�}:j�S�w� : "� ��� ��
6� ��&�#G�<�/�
��D� �Iްdj� �� D�"�a�B �"r��D�"r ��� CD�!"��o��9D� "r��� DD 2."" '����MD�'"ry��\ED�""g����]D�/"ry����|f=�iD�5"r�y �7��qD�9"r ����g) x���GD�#� � � � �& �.0m@D}@D�@D�@D�@D�@D�@D�@D�`�}"M �0�
:�x�!�&4��5u��5u��5u��� �#D�$��K��M��"N �-ya�gkz�ݚZ) �q�� 5ўf �r����������ݑ�7Ú��� ���ӂ�$g�*�����?ƞ��nm��������_���+� �]�s6����H��'p��;m6�uL>�|����GZ�UpdS�p�\����g�/�n4� �>Ѻ��Ӆ�U�G���!��g�=.������K���~hg>�Гj��^6���u)0��O�������vQ��'��~�9�sj���yԬ�vo�JO�/ ;��t��%��#���])�����!�]bw
�C�c�x���!��C�;�8��H N��
�n���pG��a��t��q:��.C��l(�2[F��r���M� gn�:s�p癛���>4� s��
�N������UZ��]tU����tkv�l�S�����E��-3K�� ��&��gV��U�?_&����ՙ�KN�iǕ�����9���#���)�N��:v �y�f�� �
GZ�� ٔ� =�^8����GW ��>��O4��� �F]�3C� x �Y �z��:ʹ n�?���g��o���(�zT���iB����:��E|�/O ���r�l���5b������Iѥ�^�'/���(ߏ�(�R(�(���S��Ly � �T��<�� x���}�@c�k�4��G�� h w���x7)�סmC�R��z���R���z��.S�?J @�nS����
��7
�>�JUT ��0=h��MaK��r�.���!z��)��WZ���������lQZ�wy���^����u����l�u|��
�(�CM&}�����?cqU��D?��W�i �LJx�����V8���I����j�ɂ�E�!N8�wu>/ݽ�g�0ڌQ��:�|X�x���7
�rJ��vW�< ���k�r���B��:B���q�o� _�1�V5�u��_�� ��/}�g�����x�ʠ�F��㜼��La�1V�<\�( QB��͏h�R�ޝ|b�sB�K>����
���?�?ձ?��y� u\?�Oz� ���b��\ ��u%y��j��x[�dն?CI�UR�&( /؟��O�8Z�<}����0e��O_\Wpt��guP����ϸ�����|V��լ���s|�Ws��L;������|ޑG��=����0s� e��fx���C���ԇ�AZ$�{/��g,�7tH#�@%� �!�R�H+�@-D�C�"� �F �;�>����CD�1E,�D��� ���tdX���H;$ 5�� E�"^��ED�""uYj�""��W�#��� �҈�? �Yw�
~�8��@uD�;"R i���GD�#���r�D�� AQ�4 �<0�@D�@D�@D�@D�@D�@D�@D�@D ADAD)AD9a�����p?M�@ya��2��R��r��������҃����2��R��r�$ e�!H"�C�(D�)D�*D�+D�,D�-D�.D�/D�0��P��K�L��mHu�ڵ [�E���h?���T���N I���[���0���`}�7O������-���BW��=��`~�a8��/����N��s�HdD$�� ugxC8�k���
/�u$���i�1� �?C"J�����?*}��u���� �ˌ�����z���]�O��o ��Kpn: ƿu,�y���;� iy\9�i���f�����<��J5��ԭ�V{��w5������̐.��ww� Pή>�<�C ��C��m�{������iR������k�����l�hP�%�Y���w��l�w�vp����;�l�t� ��n�'�4vu.��~��Ky|p�xg�H�Zg�1,2�;��nlˇ��}�����ۗ_��vq���Vz:9{�|��=Hsz��28�1�?Kn�ߠ���*�wM�m���u�/�8���B�5�'Úe$�:Wh%2��2���dX��dX�ɰ>œa
e��ɰ�3�aM�ɰ�9ɰv�ɰk�eB�a�Óa��$�O��S'V�B�u�� ������'�J�Vb0�A�Vb4�a-:r�� +mZ��A��V�a��a�M+1ZȰҦ�5dXi�J� 2�F� �$#V:�� k[2�UdXwӊ.�.2�_�dX���c��am�$�(O�Us�a�MT�&�����xk��^9ۿ\u�Ohx��_=�{L��T:�O�Y��8�����~�o,���u�㱹��;]>7O���油�J�[�Ln�Ж��ܕ��O�55�jO�����e��>��S�?���g�����!�nN�\~�@Ad���g�,^��_}a|P�|�ň�� �m� �����?�/�y]�=D��,����խ��|��5v^��E�W~��5<5_��q��^�u���n��/�����Ȳ�٦[=B��B���� ���[x�����������-t���^�ki7]�˧����5�6�:�����z�u����r%�^���~U=���e�U�c�t�?�/=U� D�����#_2;�߿avh�n]�o��kK� ��ʳ�Ch�뿧��K��ʪj��
<\n�
�?de��n� �]]�o|� ��p�O�V��_n�g��8�;�V�W��f�?Кd�N���χ��ʌ����?�R��,z���ߒo�<�1+T_L
�R�G]�hK׆� ��ԥ���{�o���t�Na�ޛ!�?W� �7*�"��d��p�}kP��?�d�� �?&����Q�)���� k�5�b�]w�
-q�c�5�:Ś�l�ۿ��x��lk�����`(�/�9B?��:���o��U����C�7[���-�?��n�����9��3k��K>���uK������:z����g��=v�;f�;}WvYj �
;��P�u��ܻXx?~���ԏ��G�)�`�I�8*E��W]���S�q�A���r�L�(;?��u�p�`������<���աB�3&�p��\�n����
J�b';�r�l�XA"� S�;;�� Ic�[;)¦A�p��;��{d�ыN ��G�Z% 5k�k�{�4(;
�ݤx���VN7(6+��ai}�
Ի��J���g�� J�F������Z�^c�� hD�А�ؘ�ؠ�ب�ذ�ظ����Ȉ�Ј�؈���� ����B b b 0�`@Ā`A��������N @B���5�`aúN hJ��c�.���Y
;|�U�_,�� �
�-"""⅁P6� K� �/,M��C� D� D�0p
������!'W�ѩw��t� O������R �Օ���?���>��}�B�o��7R��OW^����/�ì�I��x�U�إ���|�^�Wg��.�.N/�7E���y��0������ꅜ��r�OM^`9�yg�
;[}]��g _���&��W�?����o�&���Zw�Vi3�f�n�� @�1В�?�@D���&����q��RI ��!D(��!R� ݞ��;���-=�1�
��/3�ÛK��T�%���>�v�� L�?������'e�U�{�c�WDx��ߊ�$������mM��/������zJ�o�w�� ;
W�.Y���F�n��U� |��7�u�uC䱺�#m�~ݝ�W� ��\�a��{7A�7К4��d�������j��x ���nK����t��M��+v0���T�7A�O�NΞR��5�������O ����n�_nኹ���j�~gW*q���� ��u��*0��M��t�3��Nջ���Y&��`0�* �p�< ^u7p����eU�@�U�2���az������ߔ��A�O�ɴ��*�=���?�s����ia_�����U��rd�8�W������?�:2��t:�>���mKwd&��g�2���CL|�?Iz�_������� W�ae�������o�X�E��,�i��s5��j����j�5��u[@}�E� K˺��V5�[Z��#�>~���Ͷ}�� �mW��s8�{Y�
�Jk?i���i�vG�G] ����w�t��|���=/v:��e���`�%p�]�.�4{��/ja NM�B2�ZBc㴰�G,&��Zx�K�wC-����?i��mvu߽_���2W�5?��ޖ\��w==�%8��̝c�;x��b�D�1�Q��_Vk��I�jq
���֥i�O�w
xf�8��?s�8hc;���yI-ː�A����a�MĄ�{, �~G�^�\�o����;f4r�^h�6) ��
� �:Z�� 3 ���>������m\z�-?f����w�������� ���� !>1F1N1V1^1f1n1v1~��bf ∙p�%D�'f�!�B\1��⋙q�1f�!�1�1�1�1��!�1�1111 1&�ɇ�d& b�!�'"�("�)+�!VY��1��!nY�<�.���e1��q������1��� !�Y�!�8C�sD�uD�w& �,H �1�1����D�"�� p�!���y
9|��xG� K,�S�mi���x���А�������5��ܓ�^�܀��э����'���o
���w���H�`Z]pG�l�c� �;�T� _4�tS�-0w:�Z�e���H!pY���VB�� 3��y!8u@AH�1!46� l�*�����"�.�l�E�<q���9��}��� _ܧ�\s�������滞�[ K�}�& }皣Rb����h!旇 b���q
�P�֙ ���V<3�<�B���A����͏/ ���<4�}aX��� �_�}j azD��/�~/��;�*|X ��͂1��ձs�,�g�Y �2� iY�j��l�?X 8ݜ�,�4 k��6l�z�S;�&��5��u>��0O:�I��į m�!uJW���M�1��q��T� � 5�� Y��Q�
w�s"� 9Ǟ7�+�n�o�;�[���n�q�(̜=�<+��0{\�y��o���տ}�� $���m ��XoR�a ez��'�J� 8f6 � ��#Ptj ��E*���d�U2� �� x�L&��J&`��L -��@%)� �7� h%� b�1x� ( pL X@&@�4. ����&�E%p��L�S%���L�}*��f2)*���f2w�d���$ dr�db2��d�2� �S � d�P�� �x�d���t� 6� �#� f��Dd�����^#���*� ��L&�� ��$cDCD�!"��t�H<D$ "I��DDD2""!���HLD$'C ("��!�#��!I���ED�""��ĈHdD$3"I���FDr3�#"���� ��HzD$>"� E � ѣŠ�K~��� �5�+�%>8�kpW^�f��gζed9��ړ+�����G�� ����W������@�_��S^5kx��۽K2߫�����}��= ./�}
�W�r6`���7!�#�50����s!�� ����)��¾ ��Cp����*vF��2�?�jv���|���F�?V����hb�J�y'��u��,�V�67r���c��i�箦뇘��;m`� u���O澉�+�.�9:!]�i;���תQ�9FD�{
ۀnM ��W��7)���&''�oP��q��0��N���o�]f��}~�="~ �?�gB���'�l ���3��l�s��>++�������@�ܬ ���ʰ�Ȯ�=`���2n��!�� �?#˞���U�0>��_��<���_ }nOt�t�ְ���vo�Ѕ�4�� �]� ���.�^%b�: �%��ܺ���0"�E��'��\W�;����Ϟ�)����?3W�E�/� ���d{�5M�Vy���������?�U�K��Y�+q�突��O q�>�is��[\�{�2G��+��=܅3#_�J ��E�%����o�4��φ��0 \�ka� p=�o�51���*�����GFV�5;МaOO�U)�C�Me��-�u�{F�7��9�ϤO=߲����~Z�����~�w��Ͷu���7�mW<. ]l���]4�k���w=�],4�k���w�Yh~� ���e��]�\4��� ��\:�{��W�;Ok�
W�F�:��9��k��
�=[�\�R�jI��,��E�ɖ�K���xKJ�\�d��-��7����)��b���'N:q�2yIw-m�iה _-}�A�cx�&.��jri����f۵��y���/Ŝ�%��c������-ωygF[�/{@�q��e��TqV��e��8q��ū�\��e ��q�7�v���{�cEeÒ�Q���x�S$�^^� #�C��SokF�P��a� b�0��A��A��A�B�0B�PbR�Ĥ���$��}mdxq�� /N��J��Ӿ����}���}�axq�W/��}��R�´� �u����iS ���fӴ0�1�1�1�1�1�1�1�1�1���HD�C�"R�!���聈AD� "U�.�HD�
"R郈BD!"���R �V�H-�@/D�"� ���tCD�!"��z��r�~a�?T������,�kZe[W���e��D��z���)�?{��W-�{���ki����� ]w�[�0��v��+qz�+ *��\%�W���j��tӅd���?\ "^!���PO�^��X�?&-i�5-ǚ�Ȩr��F�� ������S��� z�xi��1y���^�r\�w�j��W�o��ì�Y��h�{z���� Qv���P���R����F���e_�ٺ
ξ�Cp�x������k����s��5sͣ���6 0���7����ܼ��a����
8�j�Z �k�ƽ��[,�Ze5߫ ȹ
)<,��U��B�Kr\�g�����.X��e� �gc���c���^�)��Y�I�OSv�33����>;�2Ӕ]�̙�4e�"�� �~�p�yc�f������9�t����뿣��[u�W��G9�>��Okշ����a�������x ���s�7�o gi�f��i�Ζ�K�f��.˝� �m�l����D?��P�0��框�'c} ��1f�t9�����ό"\ �Yp� �2�R�岢.��p٬O.�!\>�������X��٧�*�=���2�B���d��[����}�,_���rxŜ6��]���v�jdN|��q��?�$��_hy�[_�vY^z�ė��nye�-�_}w�嵜_���<˚� V�O��
�?��8��S�כ'��>��F��k�O&�:���Hܤ5p����ķ? �l�sW�;��[�$ݞ���S�����r�Y����ĵ��u��\d��ׇ߽}���ww ~��Q�{/�x��㙮䝉 n��+���=� ���s �TK�W"J�]��V��Ɩ ������aZ�h �T��,� {�s�K� �}�-�����-�����`2-�FˡU�eB�0C -�Z [�!�"�"�"� "� "� "�""�$"�&"�("�*"�,Ch]�-�0Che� �4ChmDlq�ȡ�ٶd��l[2h}6k"�mKQ��%�H`ےA4�m� "ضdl[2� �-Dێ "�!D ێ "�!D "F C��-D[} у���QĜ=D�M4��ŰJ��<��[3�[S �ՠ��\������/6\l��Ky �� ��F�ϮF� .h��s�� ��|�%�\�4�m���m.e����@��V�@��V��9�}��K-�Kc"����Kd��V��"��2o��h�+^:�?��kZi1�Y33�����BMae�_������/)��(�
��k�叠��;���l�S<[w���D��=\�w����U�_t��������\ZM��R��X������햺�mb=�*����ͳ�w= 6�l����*6�4����5Ó\��S�Ԉok�~�]7���8����o�ЂR��M�^2Y��S���ض��$�]-� Ŷ�V��j�Y�#=��F��mk�'��Lc���!��nj���6d �X g����c]�R 2�z��;I=�� �̤ �U�
��6�R��]4�ي��e)X�R.0��\`/K��b�b\� �J��j�P�WqS�nXU���s7��}Rve
�c�Dxg ���ړ A}���� Y��=�����L�[��Z�Sl��*m�P�c�� ����Z�y}�$Y���o�^\�s�k��7�X��[�}pr����!;�Rp�\CHfs)4v�!l����� �����.��n�>�v��c�~���#�z�Yp'?�w==\�Gr��OK}+rT�,):�19&:I��q� ۡ�{�QC\��R��LC�ojK��m��?�
z�7mpn}�����44m�6�O=)a���p�]fi#��Rb���D�i�o3���ҘC�ı/��ݳA�-����ۉ{g��[ ��%�3j)ᜭw
m�-C��6�h�?�I�ڭ�4�& ]�M^{FJ۽K����R� /����%q�q��ϸ� ����osYwNj٭��r��Z��9\n�Z��V.�@m�[Q܌}����%I�^?�;��4�p0Eɯ�W��yԮQ���,;��Y��� %�|�'n>�I���h�� ���e�!���*Yad�1�.66 Ǝ.�(c�zi !�X_<D "E sMy��!�SO0��>#���g O��D����<� 4��I��3���yj�T�!Z�S?ˑ��A&O=�#O��L��i�<�"���%��~L&O��^cT3/
����yi�p���SC�3O
��<5D<����SC�3O�[��F0O
,`���<5���0Y��40��40�!��yj`
��橁1�Sk����]�>c��v�Q�Lb�:�"�<5��yi`"��yi`C`"2�y�Ԯ�8��R�"�~���<5��E�<�E���SO�ZYɼ��T� ;���2<K�Le�9�$d,��Z�Q-��e��u�E���S�pLf�IQ���?��滚t }S��x�tkV��:�����K��a��st�O�?mS ���4Gշ_f����T����_��_����g�._��/���{���6+�� #|�9��&�'f['fW�ϐ�˭���O�k�pjp����R���� T?�A�Ղ������ �vL�д=P��&' |��?�] ��� 9��j)��<����ry̡4i�K�
�l$�[�̐�8/Y�:; ����qAP�Dl��@Ub�S��H_y�_��
� O:�&7��:r��ҔG���_� 9��/��JSGgȘ�'evϐu�)��+���\�&�k�m<��!吏P= 1���U�y���s ���.N��U�����/� (
�(;X�Cv�S�%y��H^�$�l� ����o�Q1 �^cHS1��@� ��y�L�<[I����9*�����b� ����T�C�S1��D�r���4����*�IT�/3P1�KT�K*��4{F*�8*�
T�7ᨘ��T��Q1�W�b�G�|���7�k��%*濗��� Q1��L�R���� T��IT̿g�b~�D�+*�s���Q1?��z�!�=9*����㨘����I�`��y��(s�W�ދ��I�tkj���\&��F�?�o�3��?+�Ϝ/��[<�.���!=�CsjH�|���H ��#L���v1$�}�%�jdU���J3�9�"7v��=[p�R���M�,��u�|i|�rr�]Ji�X���l�r�T�@)uo�l�n,�_�.O:qZ��d�!��7%��!}��9F�6� pSM2 ��f_�/�
��9�oH9ǎʹ-K�[��ygr���V�3'J3g�/���.� g��<�+U��,����c��!�Y��pf� B��k��!�Y���f� B��s� � !�Y���ga��>�>C���,�
XcX�:���`� h��2:��?P��� �@���.,�emX��0���b4b� ���?Љ���@+���PՍ�b� (��?Ќ���@7��/�N}� �@=�@?���� ��,�Y�:���d� h��?P���'��Oы���f�\�e]�IQ��<�
��kK�eX��_�����,[F�-����]�o��T��+9�9�+1�����[�
?͵���e<_wH� �����"OB�}_�[-����Z�5�^o?��^xL��iQ ��g�ž�WJQ)1:h�=D���)�C�{�~H��ĸ�6�����c��<��~��+~�ly�V�ӞH�V^O �6t�[�9�~a\\�q�Αq�P$��K�
�!���52n�$2n4c���#�c7Q#�Jd�+�q[)�qs�d��Jd܆�d�&�a��#�v?Gƭ�Hƍf b R�M,��¸�gaT�<mN���,�GF�, .O���������Ri�'���yҠ��8x�ɼ�qH�^���_�a�m��ៈ 罤�|qķ~P�~�%�w�6z�WP�>����
��ڸ��� �Y�K�y�URr�1��<��K���(���S�����^���.Ҥ_����qi��ڔ��P� � #BA�C�j�
���f�� ��e��r"W�9�I�-批[�Jyg&�ӗ-�f �/Μ�-���"� 7R��D#��ti���
��� �#u�� �%u�� �'u��qJ 7m)�C�RǍ��[긡�_긡{�qL 7_Q/�3u��qM 7/P�������u���q�J���1"u�̣�{긙H� �:n�S�
�:n�P�>P�M {?�u�t���F 7
i��:n~��|���C�P��)��P��>� Q��Z�:n&��q�H����"u�dS�~Q��H��̳���3�&]�ɰ�T�!���PS���gu��E�ź��
����C��������� E:_R�J�&S?�����ظ�'�8A�X��>O��$�UU?��#�ӓ�ӫ%��].���=%�w.z~k��=pL;9�'��G��
��>�Z��~}�E���z�:}�E�˙"/ܾ�K��b=E^L�U��lW��n�[��G[�e:�G��x���o������E�� =� ��,�e���ʊ��ܩ h��x�f�#(G>s�J�7���Ԟa�u�pC��c�n��-�
�[�kalU�$��9����d�͝m��)��=�l�� ٘��x�����F44����'� �7:6�o����_x��#��sv:9��y�Zg����e��]�Y���N~Q_98�1cHf946�6��l� a �^��4F��6D~�����w���{|�����W ��u��
�㈳�ܗ侃�8�R ����Θ�)r�/���bn0�5L3ĭ[j�j�a�3�?�$��|�9h�@y��iN��Cs �0� ΄�?� ��8G�>�G|�ݘ�wڐ���8��a�B�c c續�lYj��ݘ�,�`�?��\ �:�S��)
W:m��d۩��T� r�� N�w�Z?�ny��1���0%'֘����`� S��3 �
��N��2d��9s"U9����-Vʹ[�:��̕�/[�qx�<s���Y�����2�s��$�T�Z5jר�]
�{�@�n�s�HK��F�O6!
�6/����y��Q ߣ@�G��o3���5T�"]/:k��5�@*�A�D>k�#��lgf�ۙ��vf���c�D�
C� �#ӎo+��5�"�9��<b��-@>��8���BDn1~!"��g��5D�"ry���c���?���� ����|DDN2^""7?���O����WD�,"���"Z ����Z �<f�h-@>���kf��� ��d�h� ��/h� �-@ޓ��2B/�d��8�=$�r:���f�@�>0�t�!�
?X��I2� <��2� Ls�AW��F�ר%4~��I�?�P�?��&�����i�
:C�
4~Ph��
?pi�`����i� �@�ǜ4~�L������4~��I��h(�� � ��S4~І&��^��[��{?�.?�5�A����4~�b�Q�h�`���Ni�`M }���&�����J�
zG�se?X�� 2� <��~2� d:i������b��4��� ����ȉ�,�DGFf%l�V�� p�'8ʚnM��ʞ\Y��>�����ҳs쓫�� -;�'4\?��c���7C�3H�#h�t���\����=�p�X�w�w _z��E��e= C��R��;ʭ��'� �+��?�o�I�튽�1���{�H톻
�'}�������a��_�� �>r���d����.E)p�r�uC��٩2�(�������o__vbg��{��p ������_wƜM5<�K�W�hj���c�\��4 F��-K|�}0�'�KVo�T�M��
[���MUX���0��(�*��-1ک
���
�1PFݖ�T�Q�%���0�C6PF#{�
��hd�AU؇ Ua�
T��� ���0�C�PF#{� ���n!��
��K�MT��� ���0٫��T���^E/�C�R6��*�E����ni`1UaGU������p��
�T*���([Z�c��t�[���K��
��u�W����B�E�["�tj�}���L}�-8:�M��7���Եv5<J�+����h�����l�HWs��^X�u�>���vIW�1N}�
��}���<��.Qw��K�`�x�XezƋ�ϰ��ڒ�Z����e�2�/u�W���~�7�W��;�\+~�+ݐ��x.b��3� �2<�w���U+��yK6��
��w{���ⴾ�I��=K>� R�4�H�8V�q�t�+�[7����>y����T�_��;Ԛ>ٞ���f˪��2���zN�on�s6������Z��`]"�fq�`YZi���!��{ ,JK���-���ω���Jm� �� �ڮ�*s�Y!�#�t,�r�c�
`5�� �K>�Z��uR��1Z�-�K]��M�����f���E �k^��V��k^�˛�ڧh����>X�[7Ry�v��?R���5=jլQQ��4Gg�B"�ǒZC�Κ�o0�EEG_�N��q�� �%=;4y�⣷ɛ��țGj��#9��4��8��le=y�"ysv^"�`� H@��H��D�|�H1G�|�H�*H���5��ȓaț�ț'k���I��c4��K��Nj�ͧI�ͣ�g�Z c8������A����I�G"" � �5K"B$#/Tʴ��Wk�z��J=�/��-���[�ʥJ�ui����� ��;�l$H�&+f�;gf���|�~��|����͛
�͟�bmܡ�:"��Oy%8-r�E5q^��p��M���*rr�� r�g��˳ T��� �KHOMδ��O��|��4���ԭ�D��i�/ �Vx�� h��i�O�������q��̤ �4�_PP��_������n�7�L�5�p$y�Hs��-�F�N��fIr�����gTs�V;w�v�ʪW��| j�r����� ����{ ���o��1� �,Fm���|�~?��GoT^4�S�t��4�\���HW|�����S�_�@hq%Hi�s���d,�zY��fS �vrA��W����v�A. jp�o��<�ҹeJ��ׄ��D�� Y�d����:u
ߥ�|!,��wm�%�w
��X�F� �D�����DmJV�_m��X:K�> ��d�z~ֈ�58F�T�{wh+�ɼ���&�;���C�o���������7u�ݵ�˫N��.�C<�Su��deh�Buز�
�Y0��o�@���{L"�� W_}��G;I���7F_>ŏY�^M��7el�������*�TgPԴԅJ�� 5��D%��wBV�>��na��~�Ε�ě/�,�&L:ӁϞ�(���?yh�0e�3� ��vTt)�O����-� +��'��ٓ�l
�����O�s��� ���� ��NE��:�mY#�A� ?qd��8d�I2��Yd YdsY���,���,�9�,�,�2�,�M@y�G�+ ���GyL@�1�,�Q�E��#��AE�QA�OE9WA��#q7d�{d��d� �"�d�3d��<��$Yd �,���,ҋGY��V��"=�=�-�E W�E.S�E^�E�
�HY@9\A���,r
�,r��,��#��B�H� Y$�.�G�d���E&��"+�"�u!��Hl]��,[< �l+ ���#�����2�E~�#��օ ���օ #�"O��"�� ��TE�� �\�"�� ��, � �#�\ ���EN@�H`Y��� � ������H�c��,�7Y���,�$��B���,RQ�E.T�Eb�2�-d��!{$�,r7�Gc�"W
�"_�EN�Ev�E&
�"��"�d�����e�qN+��)�)Ii�)�%�� �(M��nyS_�\7���T ��� x�W�m�!7�
ʩ��N�9�[�����
�+�nvG�jT���R��W���|��㼏_�����5�8�a�JN�����i\�~_+�G��_4|�4���s���"A���)��-Bn~a!��Js��Ή|��ݸ���m65��N��k � �(eO�:ҸVz��m��H�=��A��E���'�):B�Aʆ)��~HJ�1��e(�P@�Ю6� �x����.�oؒC�ZJ�$?I�*#Iԇ I ��$���$�[F�X�ރ Q�H| Ib=I�w� ��Z�[H��$^�$��$��HW�{�9$��8$�_+HW�H?S�$�!#I\��#��Oy$�2�ą<���2�ĉ<��n ��A<��f �Ď�F5��L�D
� �WY�� KKHϰS������^ ���i�
�7��[��oKN����C�;���&�sD�5��ԜM���z�o{�� ��`���6��W�w�Bv
� ��R�2��LH�G�����V��(�?s,״�aٖ ���<�ó�p
hS�T��t�uW�N��0Gس����*�o� 7�ˑ�o/l2�_��ta�;��f�%)�ƛ�O� &4]��#�g�K�K���q� ��f�i���w������ O���wu� �`� Pt��e�xۤ���6��)��?RsL� �R���}�:O�n��j�~�V i��u*���7t�~��>���s(���%B����,j�s��Ζ�PYW~\3�������M�Z�}�]u��*��$7��M5K���&��GY����*[7�U�mб���-���tV�y����0��A缼���d3@��i ]�&�%��K.�Ϝe
�}r�T����^˚�m�w��m���+G�� m��*%�b`�����w .G-q;��z`���� �7 �ܑ6�#. �,�&XpO��`�M�����y�`�e�%n \�Z�`�����W � \,�5Xpm���`�����W �!��&ku��`���% ` ,@X���W�4�'<[� DP.D`��`.��v��� `>0���F���X�� )`V���xkmH0�!#�=<V�i��1dT���e�5~��?�3,,-!aL �?�
���������wR�'�Iis"K�V�T8���he��d2�? �������SF�ff%��B����?� 6�p�I#�Fh� �x���;%������~~��LjfJ�1)E{��{�}�'��������Q���W_`���W��0��˖�O���kٖ���m.��@��rb��ʜ�w�=�����a?{��ɜ�\ÞUL�O>�؟kWe~�����O2W�`��=��[O�O��1 Bg��~,B^\�5�C �`!���V�ɕ��UX�Y�Wa����Uo��U�<�� |`�@�}�E��-�,{?�,{'�,{
�m�=!�mE��B���{�ސ�`�� f��^����Lj |�t�F
� �듐��b���x���/0��ט>Ƙ1bT�xc����y��RR���D�x��4�o}�a������ߎ�?4#iL��c�?�/���R�� iL����=��?�W��I�G�q�?�~����?��mwΛa������/�� � �yׂ+�����J�'����*+o��gͪGN�Xe�<��y �8C�6+��>����*[��@]8@r9/oM ț�fK�Wzm� ���8 �Lr6�Ʃ�0��
��0�ڌf(qM8�Xp\t7�Zq�.��ˀ� �C���O�����W �\
^�V`����V�`�u0�u0r�F�:^:V##���$!)�t������� �o ˿��?t3�;<S���\u��J�*ލY)�����4���GN�Pe�T��7Tv�H�ڬ���H��{F�����]��_���g�C �B���
�Ϭ�^�eJ�S�� �[@�� ��?�C��
��B��˔�m���2ep �L��?.SwB��������?AE� � ��zOQ���m~U��oW��km��km�����e /�� e��ǎ�L�OH���~�
A����51�dl��8I���»�ӌ�r���p�����9����h���C yy �b�S� Gϴ�ɺ �u� �Z���L!�ci�^o\�Qz \��&�N`����[�ע����� 4����X?�A|��Di��4X�Q��� �6�?� i��Mh�_���$SF��k ���@�{���4�� �����?��_��l{@�R���/3<�s��99�P�
(-�(�zw),�>�c;w �O�1�~�{X�]��5���ek>��LjʈR����_��c�����6�#��gŀm ��m����+�� ���myW��!9�.Ȼ��+d϶ y�����[ƛ!���A��!�"�]��e�����b������!_ɧ�mQN�>��mxW9ü-���V�*��7w��r��^�ğ_��]�9��nVNY֙�>)��arC�bT]�?C����.G���X�K���I����+/*W�w@���~%��Z��5ʵ]��_7����k�����2��#u&��ac��F�� �ភI�U��������]��Sk���VʝCU�[�(yk~�����4�\n� ���r�_yg����Wbpn�;��:�������Η=r�U�f�U�e*��8�ڬJ�����?$���ɭ�u�n��=����yג};�K���#^� ��d����@���A/��g�
���v�[�r� Xs��s� 6��n�9��;/ �
I�� :�_r�^���⃒�����Z'9��w��ֽ刓�J��� �i�����c�$>�� �=��YM����<���� �}2�p}����bo]��r�/9)q
��q�.*�+��j�2�B�<x�e�Ρ��Yʰe!2 ��7��
o=� �ؙ���'D4��F�>�ģm�������,?��An̂VJ�W�YU������~�"�Y#�3�P�Rg�鞛��^c䌻���\օM���܄���oFs�,�O:ӆ˞<�u �M �?e��S�{�9?�͉K������ƘzS�,J�T�-|>���"��\XLmh���/,�Qa ��ZO`��%0�
,�X�,� [`��|� 0� ,��H���X�6j �=j+ �;�T�@ .ݢ�Rяe\*���KEߖq�h��KE3elȲ�dž,dl�2�dž, 6d�cC�� 6d��cC�`�4�!K]���� �ؐ��xɸ4Չ���F,N�%��KU�+�Tu��KU��{�X\�����j�!�j ���!�L ���!�h ��p�wiM��!K ��!Kw����!K+�T��!KzO���\Uc�'e���P0�rs��ǘ� c��x��.�0��^ �c�u<�1�2�\�s͒1暩`�5NƘ� c��-����� �dc̵E2�\;gc��=c�
�=L9s�xc�r2�\_��1�O�1��tc���=LGs5�b�u�m����Ř��s��Ř�l����Ř��l���b�uf6�\�%c�ut6�\��1���1�:�s}c�dJØk6�Z�Ԇ1ס
�\=e��N�1���a�u�1ך �\;�{��0�ڐǘ�c��1�J�B��^�X+�1�ꄱV25b���1�we���W0�-c�u��1ס2�\g)s
�1溚ǘ�c�3y��v�0�:c�dJŘk4�Z�Ԋ1�6k%S,�\Y c�9���R0�zQƘkc��e�����1W�O��1�c�dJƘ�q����c��0Ec���j�����1W�W��1���)����B�p��C���3��#��#�R�Q�������oG���i�[PX Ъ��z�b�q�E�فuoa�ȹq����\�?�%%��1��S_ �3sA��zG����+�nm�� ث�tN�;lT�����Ns����!���Щ�.���a�}��mG��]
��{ ��0�ߎ�1D�fa!jp���� Th�)p,'Υ){nN�ơ"��"��P����"9ơ"���"1s�H��*���@E�WAE"ɨH��@� I����{ TP�`u� *�QX�A@FS$ϙ")+�I����䤑� S���_���lLɰSX���_jjz)�@����������*[��:b�n�� �g/��t��e1�9[|�wO�u�E5��<�v���mZ{�Xm�:�=�ǖ���ٗ�S[��a~�#��[P/^>trf�3_w/ yjT�3��_��w��3�F���r����"�Us�;wb��o/dĝ_76���q����, ��>�7��u�.FՈ�ϐ�q��]�� �u�������3?��ǡ+�=s�C�\�y&���]=`:sm���_7�S��"��<�)�G���Z���G^�5"���E�h w���C7����ޒ�o7|-)�Q�-�� �틆wo7鞘��3��O��\��������m~aRv�+ �%��|;��!7�$;ʣvnԦ.����c���ӵ�c�C��d���� ���>�pu)�Q�X?�dat��� ���oWA���!z}��ٝ�-�c� ��V��C�= ��IX`O�z�a�]��)�\��Z*iX�QwO����t6��_^4�K �f| �ь/2��%`F3��hƗ��`��^n`�h��� ������ь/>��%�G3� iƗ� � �_�4�K �Z�4�K��Z���͈Ì��H���Ìo�H�'�a<�73�u�0�[���b�z$f|��`Ʒ���RK@3���{ W��<�[p|~3��3����� q��5Eb�wy f|_�Č�kq��Č�8�v�Čox f|��> sid~�~���m��$%c�e�m�����.��ƸKb.�]�oc�%*�.��1��2�.��1��|d�'�Ƹ�!�.�m����ŸKz �]�ecܥV2�]B���˳� �f��?�kA �}3�uO ����@?��Oτ�#S3SⓍ)���IHI ����P
�C����^�\�� �^s,���V���izqŻ�� �'3�`��E��jw�/�D��6'��e��M � ����� ���m�U9;B�j����=�5q5���z���� L�H���m��8>j�R���
�\�a=��~���QQwQ'��z�.�!�W�1 ��{ �[�z�zO�z�zO�z�zO�z-c���0k}����wM�HKMʰ��(��3`��~}��$���hL����?��{$�dd�3������P�����J��ǤB�MBrrjI�@@��?~A�G��-�ޏ���D1w���?o���,�`�f����+S~��P�XYt� C��e;&���,j��R�Z�� yy�G�QhfF)�W�d��ޱ�X���wM'8 ��)�4��b
���8�U�'��)plT~��� �ր�ZJ "����x���tjfRzVRrrBI�B���
���'����Q)�I��=���M�%���'d=�5 ��?�����_[��(��wQ���;�w�x�yk� �/��y�6=5�C8O��'��x=,{��wk {V@(T�U��Ƶ���A&�0qlsU��? )�8�8�$���� ��Z��Q�1E�������bN뎪�6|Μa6�g=3g���7w?�夫�^X(�_' vN���&(���'�
���� }A�4��z9��cP�'��O��R���ŕ�7�_.���~��z��>�������y���N��~P|s*�w�q�W��@��@ ������X��؏�s��nT� �b���U� �"�cMWqu�BW�I�Λ(��4W�
qu^�`ˀ�
� � � �W�u�����6��� tU� ~�&�:�W�}���}� �W�)Eb\�Ճ�b��B���%ھB��=RR�z�'X�� ����jݗ��1 �����2���̴Ē���?�@-��(�?����?� �Kͽ�۫����
���#�>���U������.��s�p��(��诛�̭���z}Q~� kr4�po6/|��r�;��.��i� 㝒s2��s2��&9 ��{Dl�3V��:c���3���:#I����-?�Q�D}��E�u��&:�K��,������_lBr���~l�W_ ���X�����Ma�r]�o�xnqx��� �-S ㅏ��>�� ���+�6�+.�L1�rQ��8�:��}lD�^�� �|��8@qHߓGp��H�����4Jhk{�]���2"!%%!���_@A����q��_Bq���^a�7u��J!h7�$2��/�ӂg�m��aQA�2��1�%�$�>���_��O?m�G��E�ֺ�|u���?n����û�YG���|�M���+y����S����Q
Lp�=������sz��v���w�ȟv��b�w�V�h��Y� �� ��X!59)���_a��AX�nL�hm�Ki��~ϿKjRz��~�� ����;�_���G��o�L�[�V�{CZ�-Zwx�������f&{�8��C홻[ڱyk�fQ=�i�]Bf����+�H��m�b�-�EAt����#VZ�1릾/VVVH�gw1 9oHU��`��3���7�j�^g�OL`j$ų5F0�Q��Z�3��7c���u*��u��uo*����}�U������W�V uY�ن�m��c�>¼h��m�}��s/��Bb|�~'5wKc�_�-��˴ܹRjuR[/�&���Gl;9Qҿ �&Ne��k��#ـ>7E�O$��҂
�w� �ѝmw�,��5��sۘf7���Nsr��K�0!�ǤЩK�.��RX��b�����?���� [�Fy %�k�j!] Hѧ�1�3���u{
N��:�w� R��rb_��Rl������J�
��Z�q
.2q�����'�Ie]XC�� v��Y�$mf�-Cȑ,g����D��$�{̗"z� W��D��b��8)ɥ�����4��o��d�
!9�ؔ�*�ڿ +�9AH� 6-u3!3߱�sK�
�D̺p^��5_��s�4�f��ʲҤ3qb��7�W��'M��,������\ѡ������yO 3G �&�1����؛y G8 G�K �11������E��
usP�DR�n�z�� ��
z.Iuq��Nj�2�L�@�, �bh{�H;�@�-�z,�l'.�e�uE,�#� ����ҨG�'9�6��I.�z{���c�.�@ߐ� t�� �/� � �( p /�� �h � ,��*�\�� ��,�X�� #`J��� ,�
� Z��PK ,� �j�� ,�X� � ?`��C`,@X�#� I`��4�x `�ZU`���` ^ ]`��` ^ e�J8 �`
��< ��0��~�f6f$ԡ� �(�Po�0�7?�PoQoΐPovQo&I�7u"�� � `�fk ����@$��X�B���E�@!��zKP :Qo�aPo�`Qo�bPonfQo�aPo���"��O$ԛI"���� X�B��fk�@!���'U��@/���Dԛ��F�َE��U� ɨ7O0�7�_�Qo~Ǣ�\�(w�_�Qo��Po��
ݨ7�Dԛ� �7�_�Qo&H�7 cx�pݍ| ��S+��F�&�$9�� ?��iI���I�i�����7����x����g��� �IZ�{?���cJ�| |��~�Z�i�۲k�r�f�ó�ʨ����N�3��2��[�,��9� )7��� �'������; �b����[+��ͱr%�fN��?sn�79������! 9��*[φT]w�co �6� ���Bj$-�j��5����R�9�y5z5�N�.\�r�r궬������ML�'^4���bj�IE� +~6����v�Ԩ=}��?�^4��7����wz� �|��27w{K��ys�+����]�V'g�Z/[an�)��v�f�ۜ�7Ѥ�K�3�G���[�d�������M �]C�c3}�[�u���_:�o]sSs�m[u�$Ws�%Kt!�W̡S?7u�u� ��Ե�sx�I��?��G�^��8�W ��.j���W�z,�m�>=������M�O3s :�zwH4��j`�� e��Ϙbo�4�7�`�)R � O���~���u/� ta�n��k�!;?�
���Ö���1�f㌕��G$N3�{�� �����̉>Q�ģ�$������ͣ�0�Y��O�[��f�ӧ��u����k�q�u�i��.��>��'������c�� �'x�Mv�3O�9��ʲ �Ig2Lٓ��_���4y�k�)��MN��;Up~�Q�����6���v�M�a�[rv�������v��ݒ�v� ���v!�] ���mo{`���47�^�,�Mme�ko�}uF�(��e=Be=�F���#�|�E�D<��-�wR�N<�{� �����T�����x-���(�o�|�7<'^���F�m2��!(�q�j�n��a5x9�wܰ� �d�1�;ϡ|5�{�� � P�w1��obB�"�d�2����M(���Q� ���(�ҡ���G��e�wz�� �P��2��K�2��e��C�ˌ2~� e�
3��7�(�9�x� e�� e��� �e|� e��L(��{@"����(��{@%��֡�ojF���J��_�CŌ2�s�#f��M(�7�Q�O2���^�2~�e�^=�Wt(�?У� �C�ی2~� e�J3��M(㧙Q�w0��O4��o`B E�QƷ4�����2>R�2>O�2�� e��� �e�^ �kz�� �P��z��3t(�s�(�W�P� 3���fBo6��O4���gF eB�aF�҄2�?��E��G�B�2� ��E �G������u(�o�Q�B��Q� 3���ӌ2�lBΌ2~� e�3� ��f��M(�_3��61E��Rɵ��l,�]�f�r���O�ϔ�$�=��2bTj�1��.t�7_�U���5�o��?�8&3�X*�������q���u������Q���n��[�c�f�Օ�PG_~\����`v��e�Z�����fos%�[S��G�n�NSee���9�G�rs��;tU�m׳����Z��>�5]�$Q_s��g�p}�v��ͻ�Mu*5��-fҴ�3�� y�h��)' ��?rv�g���8�� �` ! Yصp���pgr���5�r� ��;=%^�.�x��%^�� q8*�u(�"��C�N���`Fi�eBi���]o3J�oM(��Q��4��C�Ί�)"8-J��z�v�u(��Qڽ�Ci'�QڍС��Gi�Ci�U���hBi�T��.̤I;M�iҮĤ�#��%x0̱� �@�SqNeR�= � ���l c$��~��@���Q������ �S��]��,����i�;[nBe]�qͤ
F �so7�bh%��>Wry3�T�=&UZ�K禚���F��٣�G�\S��٪�6���s�j�$]���l��4]́�XϨX]�vAl��:�F}�:��tu�����Y�2u5�� ��= ��陥�X��$�G�]�<r ֲPd�Yl�ڻp�z����_���צ,�� �W�@����+�` !m&!�1!�
4P�_�
�W�@���+�`�!=�"�kB���E��A��u.��U�!Mg���鐿�c���ꐿ��_u�_�J�_�t�_
��_ ����0��0����94���}�2�f}l��X`���O��Kq����9��F�2�k�2��KTd �)�{����C >��X�1��r��K�/ָ�}.���X�ƥK�KW,�*�kh��`��ʣ0�~x|��Vy<��w�LI0f��z0��/]�o[�=��W�]R� ��/���mI�~�v�QSʽ��㧔�S��-p|j��eS X�4-�iM <+Z�"ڒ��>9�j{�s���?:5}XhJbB�S�_$�_H�w��!�9㈤�I#4�o���5!%+!�T�_!�? ���i�2�N���=�ﴌQúǤf��� �Y�����M�����l Ub� ���A��5h�? ��k���_{i�6�4�[Z����S��A�W���� ��x�%"�w@i��ɉ*�[Dm5;�Q m�blZDY[篰+N������������\Dl��-a뿟E�j���Ak��h-��^�?m�I8* �M� 8/�Q�{&� �ט�0������5�_V��:�M�K��Ű�T�k۩���y�R�"
LW5��������!���
h��*�~m�y���]8/��?,!%�)&�$� ��5�_� ����B�e��6��
m'�o7|����*�Gđ��`�iOf�#B��7�aR�/�%3�j�
�Q?R;l�-v���i���A��S�vm��U��/����������������������?�A��* ��c��_���g�� ���st��2>W@)�
���#z����-�?>W@/��k��^����2��F�s�}j힠���`��H�1Y�� �
LM� �?(���� i)���� ��\J���� ���-M�_����r�S�q�m��(�.
�������Yn�s"��d7���A|�M��;��8�ā�_Z.� ���g������yJp�#r���v�6���U^:'� 6*|�mir�9{��Kb��U|��q\�^����\���.��w��ֽ刓�J��� �i�����c�$>�� �=��YM����<���� �}2�p}����bo]��r�/9)q
��q�.*�+��j�2�B�<x�e�Ρ��Yʰe!2 ��7��
o=� �ؙ���'D4��F�>�ģm�������,?��An̂VJ�W�YU������~�"�Y#�3�P�Rg�鞛��^c䌻���\օM���܄���oFs�,�O:ӆ˞<�u �M �?e�� c��
ˑ��k*P�S2P��9�+P�PX c�>�/�
�
UBd쀅�C�CT �q�Jh"�J��Jh�J��J�#�JȍC%4���0�P ���:ơ���2�{{���Ȩ��WP m�Q �UP I2*!�G%�&��ã��Q ��Q ��P M�Q �;0fQ �;0vQ �;0�Q �;0�Q yʨ�&�8TBCxTB59TB��=�sTB
yTB���yTB���}TB��� *�-�/�zWF%�_A%�-�Z��*����
�Q ��Q
�P ��Q u�P ��Q 5�P E��s����{�'TB,�J� �J���J袌J���Jh?�_C%�FF%tBA%4KF%�YA%4FF%t�G%4�C%��G%4�C%��J(�C%4�G%ԆC%4�G%�r��^����n�2 ���:�G��g�2/�����W��[P������� ;[��%,ז�S#&������V�o���J���)y]�(�9i���+�۾���h[�r��l�}!�5V���6 <�m �6�ξ�*�m���6u�b}��$��R�KM��jI-��H-7ߔZ��Yj=�����Rی�>~��;�,뗶��︍
賀5��
�ޙ�כ/�7��neI�w��/���:� &u��^�4=T��[
�X
�ڎ���Y
���vm� v���/)��wlĵ�lT��lԱCl��+� >d���bޚ��h��+%��f�!� ��Or��7(Y�������)�o�\�C/�yvc�]]x���g���rc���C6�C�����凝b��^��w�� 1���b6��i��Rb}IJ�i�4�N��th�4�|�4f� )��8v�̎R��l�$a�� �6�6��ۀ���ͬưYm=�,�vB��y ;��Y��jvұmR��=ҫޓ&O\%Myk��8U(W�ď�<�9z�J^<_T`=/��Z��؆���3Z�\�#�ƍ��qc2�iܘ�b7&#�Z2�i���h?&��ƍ�Ȧqc2�iܘ�p7&��ƍ�H�qc2�iܘ�x7&��ƍ�ȧqc2�iܘx �/�qc� �%o@� ![j��c�Ȗ\��l�x eK�S(["�B��
N�k(["��l �,B���Z�$dK��B��[��g![�-�Ð-���iȖp�r�8dK�Ԃ�![�-��-a�<���0�7�GR���,Ϥ,�x'��C)["^J��Tʖ���-}���\ʖfc�<���dܲ <��"�f��є%���x6eI��o �l�:���)[:���xʖ��S�D<��%�-�l�U�7 P�DЀ�%��%T �@YAj B���l� eK-(["�A�A
ʖrP�DЃ�%� �-�l� eKM(["�BYA: d�NFЅZ�0�%���
eKm(["�C�A ʖ�P�DЇ�%�@�-=S(�ց|�ɟ��:�2�ѷm�G�� /}�� �#R�҇OL�L�/q�P`�o���Q�?�,�,�h�1)!5^��l��I�e���+_��3����e �E0�71�����;����ۗiI]��� �pNX���F{!'L ����h��4N�qB�:'|�� x�o'��O��D�=��,�^� c�Xcژ�QƬ�������T�����M'&˵��E�z�O�cO��բs^GH;���n+�"bb�"������'QZ� l�<&7��{������w<>����+]�/gyS�f���j�T�u٪S�%6#P��#U���j�te�|PY������{������Rg��
U�0\� �, ]�0|q���j�!-� 1�pp�F.Z��GV]�O�<S\4��_ !}�_�^���*X��i���Ľ6���7�ҳ��V}*-�*I˧.�U' ��{t]m��a�W�X��&��Z쉞!����<�# � �UX�� ����T�O#;��%N ,8]�K �.�%N ,8Xp��$`�Q�������v��h,Vc��-[��g
��Mkߘ� � �ע�e��_��j�_���S\Lqa����5���G��[�0����� ����-��h� ���?����j�`B��h�Yc�Z��c�����)���g��g��
m�����������o >�ؤ4c���l�������A�/E��Z��z�r�T$�ec��n>ẵ� ��_��_|�&����C� [�Uv����kQ��3s��{�PeϨ^�e_���?��r�Y
�W����/ǿ���xO�5r-�oCj���j�U5��J�ι���Gޖ�m7�� �U�/}]m0;]}!;^�%�S�6�Rwh��ت����MmZ���4,Z�q6�>כ��.���?�Ϳ��[�k���j��\�f��Է���x}|&�;d��6I������!�g4!=��.��K��(��!8���{� ��;M�;/�"���C��d�����=y9+���JH�61��qBV������/Ay������|,Ƽ5����^)<!"�b��b��bߠ�blt;�_���zb���8�`B2*���%��8��ۄT�'��!���!$� !ߊ�;�#�a���? a0�#]��_�%��/& #�>�M �6FL>0����b��pB���t 2��!%2�d���d'����~M&��� �gdb?,�b^D&�b����戓'.��5Nt*�\�B��b%W��nx�{�?*�?u�c hgB�骢������X��B+:�uL5�?��2�4HV�zqj �4����X� �V)����@���h4��!�+y�`,a6kK�'��9V��]|��C7i*��)X�U���� ~ |,�/X�a���`����?�� ~
|,�7X�q���`��i*��;X�"�DP!�}� � #�@-�*�6P!F�>U�(�L*
��*
��Ub�*
�x�X?�X7�X��B���B���B̍Z�j �� 3�(�(<2�1T����`
foP� �Q�}��- ��0{�[ Ba���- �0�$�0[Ϡ0�ɠ0�à0�� 0
�v��Ba� ��P�a�y�.f�q 0 �Y����� ;���0Î�m(̰�<`
3�8X��lZ�y(��aP�-eP�a�y�@f�q ��v�LDa� �Q��Q���(��%X��,�AaVADaV�Aav��~�0�6���(�.1(��p�����[��:��N��?f&�����h �0�Q��Q�uQ�ň(�F0(�ڊ(��f�Df>
�6
3������-�Q���(̾fP��,�0��AavXDa��Aa�^Da�YDa6GDa�@Da6Nd4`/>�X:P�i �<Ҙ�Q*�B�_@�_ ����:<)-A��iƌ��dc���@���/U�g�=�-˵ �j�R�J�'�'V�bO����Q'�S�������˞���=�$�g���W�-�T6�It;��G9���� d S�L��
�Tz�5c��-E�6�} �6��7�$�u5[y� j �g�_]�i2�z���� �(#.�,�"XpG��`�-��k����g���j�3-��Ϟ��Yy���4:+_ѥ4+ �s
��n= v
��A(����J�T���ecbZ�p;����<���7� ��'��/����z�9 �W̦�=� W6���_�2�J��נZ���g�l��9��Y�n4�8Zn;�_���|�+wP#iv����,QOi6�� 7�4���\����(t����cR�ѥ��g!�@_�η$ȩ���ߘf ���(�?�iϿ�?���
�� � ��/�� =:sx�hc��<� �K�7�g�b���
�� ���+��펊�-���=���q���̑=}-G[fr��gi�{0Lſ ���R ��(��� -���/�WD�㾮8�F{�X���g�0�i�g�LjIL-��Ew (�YxӾ�����T�Ge(��P> ��{�?eX�1-)%���O P����_�����6��$�����e���{�3��Yw��&o�������p��2�.(٠�����Xs�_]<�к@�
}B=�����N7_���E����O�O�?��Sny�nmݬ�Y��x�z���潾I`��:
G(��e�|��B�iY�s˷Պ)o .�3U���/T�6���T�*�����z�GQ���Z�� �ͨ+T[��P��m�����VwX9��(_���T�Z|�pRZ�t�+o~������[U��B�;�lp���5��'Ǫ�#4
�N���ӪD��*�8>Xp~� `�ЪE��U 0�^��W�h�G �V1��W�H���?��b0��
X j ��p �� � h�E��~�p��� �CU3 �Q%@D #j �P�� X 'j @��(R4�D�
,�X ,� Z`��%�V����&` Z�X�
��r孥�W �K�F�#r~@��j��
��V�����3�FS��;��� �C�oߒ�Z�����LOJILHq�� �d�횜Ҟ?|��^ ��cSJ� ����.��m.%˚K��Ϫ��z�����\�=�k�8&�.�K���Y��$�hͷ���t`�6-8$�
��%�@.�_���m�`X/�� _X��M����L�~d8��Ҩ�ϋ������w�%C\S͚j�Ts)��g ���
b-�/*=9aX�H"�RJ���
�^�Rr�?"3!-%=a���?�/��ԞI=����NO���?��_�Ͽg҈��$c�<�������O���m�EƦ����
�T��Qq;?O��W��� 籪 _� ��U�����^r�w��}�FL ��� γ�n�V�U\��+��L�.N�� ��ݛ���>U���
��ґr�� � ّ�.9Bi8���(��Ҹ���b��J�z�䦕�*>Ε9��n|��\���7f���QRZ�ˆ�i�'����T�x���DBGR��NJ���3|� t�p��6J �a��\=�4#F=�Փ�Os�d�c��{���4WO ���3`�^�0G_G� � �
�y�6��ƶ�I0�0��h�4 �
�8�6$�m�*c��
�
#e�6$(m��1��`����ц�
F�e�6T���`4�@� �
�9�6���G�
O��-qL�6H� �
i�mТ
�mx���-�R�R_51��_���A� � ��R� �7� ��0O~Xg���Uu�/?�Q��tl�i�i�����#�\� ��|�]�A��W��#<\+� n���n����t2� 1n�wZdT� ղ��C��Y��z�� �. fK����"&4��; �p��ם�[�C���gL�zF� �� �S����Uf�c �[<�B�� < �����~�ᳳi���N6K{=a���+�� �/��/���߂4��h���B����xy�2�;��� M��sM�l��\�b���X��d]�;�X��N���a�I��O4���[vp�Ln�7�3~B�8O:�ձ��|����~����f=O��2����^�j�O��Z�;t��%\��h
|�*⏨ ��4�1����k�8���{$%d��w<���>X�����p�?�r��k�i��h���k�j���:��qG���;��Mw�%g�w��;ܫ��s_M��wu�j�v�o=ÿ �^��X{����Q����x �����'���?q G��+Ҁ�ukc��k��9 �?/��1��G�2<3�4�a�?�`���̴1v[�����̴��JG������Z��|�}3RG���<��!����4�_�����ߗ4�M���ze�5��T��ߡ�{�ƺ�G�����.���=�|>��~��i{K2���o��h�5a� s�Ǖ|�wh��R�j`����z�O@m?�U�V��c|ZR��~�����9 P�U�����
����z���}�_]njǘ�z�ג��>�1�Y��5�5~�FS/�<�&��W�O��)m����.�W��7n�/���ol=e� �`�A��o���_�3N=���tJ�jek^?��Q�?�/N���:d�p�A7��σTW����� t ��B�m�
��N�!�Q�N
�،@��/T�����zI_-[|�B��xN�
���Z�R�Q�G^����ma5 ya3w���t����k�W�|2 ���Z����C���7��z�-3� �)����ؽ �/��݉����vj�ǃ� �� , X@��`
�"�T � ЁZ�`%�RPKЂ�l#�ASj5hJ� M��vA���sܟ� m OЄ6�'�B�T �B-A�N a�%(C��u8A���{�a��E����
QK�,�X@$Mqh�CS �8�)��)Fk�^�]�ӌ�i�����
~��%���%O4��f��)���� X����V�Y�����d�r]�
����ʜ���Z^��]������u�ɩsΠ�{dZN����镡`O��
��
V��W]���z���{N�%6��/�ž_����Z�:*���Sh3u��6�$���
�C��~i U���Ԁ>UC}Q
����כ �襁����~GS��s ��Ä����7:/a���.B�To�K��B؈�j�&���0E��^�h�G���/5��*5����/NW{lxS�>�R�y+U�����QS���˽P!��Z���Tp!vk*Z�!�؍��~�遳��2���� �Z?��ĵ���m � X�K�n'ˋqz��m+�cM#v���O�
T��a@-
T���@�
T��a�Be��B�ڵ*CA�b�Z�_A���P VP�X�V�UP�X�V=�I��fq��E�s2�P�|+�`9*�`�)�`�(�`1 (X�
(X��(Xp�-�(X&�(XD
I�(X&(X��(Xp1�(X:(X�,
,M,����E@��M�=��a��尀�w�!��e����_*
�Uh�G�2]E�e���%UER�G���}��':��*�
��0�5�٩�������m�����%:�3\�q��5 �x\�Ǿ�o�g�,����3F���1J�X%��h>�|���V4�~���ҹ6|����6��4�6�����?�ЩU�.���ҵ�><���y9 �x�qm�U~�u�=��� J�
S�oYhۑ���K��d+��}�# �J���k'ׇ@ B��}� ���ߚ�C��O�� �y���+v�8�[W,��qַ��|��Y�ҳ� :��-=+���Y�ڳ2-�8��q�Tp֏�q�Rp�o��o�q�gy��kS ���d��_E�Y� ����ି��Y�����r g��
�����%g�
�S����8е9� � Ii�v[ ����O_`����W��Kq���2:�r��{��y�qu�C�O��� �����z T7VԳ"^q�]Y���O�x/�xw�� 3���Z��Q��1�^ ��� ��h����,o�4��t��{=;�� ֳ`����}��+^賰@�=tO��A:&(^�a� ��H�CfMǗ��?591*@ C����c��ݾ}^�!�b�%��V'"�`�^��xO���3Ԧ��M�;����C���i�1����2�k��� z�g<��G?G2�v
���J�'y��d �� �*� j0k����IcG&����R�����
�����_���a���^��ƶ�+�)?��W˃����Ka��[�9 ��:-�m�TN ��;�$���f��5Yv���CE�ZK?Q�B���~��1�y|�P�/Щ��i���4� �`R�~��;�i����=��Y6K\��� ë([���C���[��g2 md-�B��L吵$� k1��ZV���<�m�4� ��������ȿT쀊��Oj����v�c���3�7���Z���%��z��R�R�z,�3�i���? �����K�k��K�n��[���l�$-��P*t_�כ��_N��w��'���;q��S�u���n���A��T��FN��-��)��|El���z���� bی
�>~��;�0�4�;�'��L2A�!��h21�#��t1�|_2���0�I���auo��Vb��b�%UĐ��b�ԖD����=�wV ��Ll�Ĉ��Ʉv�Lf��D����!�R2y},Ƽ5�LB-�rd����sE�^R�z9�W��1jSޢs®t��_�+������xҟ�K?o��Ѷ- ����%����v�D{�WL}P$m�I��)'Xh`a��Ed��Ed�k�=2�%��"���"�Z28 �I֡�
t�D�5���2�Y�)"��""�<'"�<""��!"�� "�\."�<��2Jpd�3d�sd���0�$���$�2�$G��$1�N�L���L���L�_D&YED&�)"�l�` 솈L����!���A&�MD&y�A&y�A&� -q@d��0�$�
��IN�qJ��yn��tp{��%s�(cZBzF)� ?��@��W��(� ��\W���|�uk�?���.��M~�W����);����\�Oeעl%g�Xe���ʞQ���q!ʾH_ep#�@��A�
J����}�FLe����{6>/֪qL�]~�X���uq�X��<���7�z�7H58�K��u��B� |�#�ٍ�f��fL>N0e��sݍo��[|���/���{��z�LדN��ތO�����������|hI>Tty���'�I{�e}!m��x<�`�KL�}dͿ5�C,ں�?��b�n��Rh� �,��č��+�w .�
,�Xp/��b`��h#E�j�H1D�F���@�� Xp=�@�� ������W �HYqIʂ�[R�S �g�{�/��(eA�M) "��,h#�,�� �� z�A�
.�,>�2�� YP3�,h
�l7�l��z�8�CV������ߣ̺�7�CVd]�;I��1ZcB�j�^v�U�{�t��I��SS��;�d�/� F�˥�ed&��h�_x��i�F��I�?٘o�/@{��{�'���w<A�� �?y��i#2�F��NMI��`L>1!E{�vy��c�3�⍥���!P_0����-�O�^�Z�b��M�S�/=���U�ܗ�i�|a-w�:{E�M���ƳW���}�<���� ���g��C/�^�r��k/���� ������믎t߰&j��c�g�g�����
f"D�o���}3����i�?ӻ� ��}K�k�[C&�����k��mgrgo��� [���͙ٻ�g��2{��y���9<{ϷC���M�'��/ �o�����~���:�V�=�3D�hqG�X5B��Ϻ�u/m ���ʗx��B���YJG<�t���0�FoVA>�\�濮`����9�� �UXƋ�"���s8�4�ITY(-�%HLξ��=K�I���+�|fE۰X�꽓1��&�~�c�o�;&�vQ (C�~ip_���t%A ��:`y��� (�,�X@$j *�&��=����>'�p��(zh�����P �9��?����P ,
4 �FÀ�0 (�{@7j ��p A9 ���v4S ���y��QKÂ4� H�a���"�*i�2'�
�I��5�rRKГ ��4���~(�>(�>(Z�� 7jS�Ә" tߔ{��)��� <V���h�?�����1n���sy�ג� ���n�+���.�uWXnj�������~����W��U����6V71�k|��k�
�\^U�] >�q����ԏ���wdc��tV?�5F�Dh$�ޑ�O�ڪ���,|�-l�zHؒ�U����yuۙ�C��;��Uw. &�Z�5�]U�=!Y�3j��7�����3�z�@������T2}Y{������Ij-8�7ժ+ok��ޒ� |.j*�G{�q�뱫�k�l�T�����}��� ��zM&�j�O�u-:�ճ���{�v`N�2�GD���V��U~c�ӽ�O��#�B-�� �PH�*@�1�3e zXC �� �PHp�*@�=T�AhPQ.���**� �Ζ��=`*�P5�N���;]:����`#!�N�� �
��U��P BK0
����<�bA��**���֡���C��bA��Κ=qGM������ ��*?���L �H-�F���c�!���!�'��)CMjʰl�h�e�&KԀ�6*)=)Ř�0�� ���?�&���Ӛ@�Z�19�^�?=V������i��4����
�u�k��
�),9uDY������ ���[���z���A����dC~]-� �)C%���O�';�J_G�`Oտ!�n�P=��(������S�ϳ��[�'�[[7��oo�,^�$�y�o����N���-}Y(�e�PaZ����m�b]���E��v-��� �ҍ��� ���I�+~=>;#Uy�Xu�k�$V�Z*U}G�>����F��eC���ݮ"�N�,��rƪm��v�X��'�0�v}�튱��G�'��(>T}�z�V�U���TmoƼ�������&��_u{+�T7�t����S�M<���
�V��Z$H�O-D � �,�X@j J�� hA-A ���� �,Ex���� �& �P>��y��t P�~�i��PK,�X@ �~ �P�K��I�BT�$�ꗠU����%�D�/A&�~ :Q�KJS����ԯ���k�q���z*�/:sB��ᩙi�����/�%�O��u��߭��Z@I���~����̕5�{� � 0˕}�K&�'���,a�Cfm 'u�˻,�S��;���A�� � �9� �"�ۘ>�zY���5}�e�R�wӖ�����~m���?u����~�ݎ-'u;��2�Z�.gI=�� u{F��퍛���i� ݁��u�N� �q��^W ��j�W|rn�u��Z=�s� :G�f � .�� �!�Lk�ʹ{��ADʾ'���6T�n=�'�O�ӟ�9F�E���Bʜ���k�k�n���:
�˼�"�;x�)�"�K�~;&�:��T^V�-��5�yK�Vdjf�Jeei:�.�v�i����ˬ05���l�1P@Ʀ �a��Dv��=��>�����&�@+4%��V��P .�WQ� � �����t�^�> <��> �2}�%�^/v�Υ�4��Z�}:XθO�2��R�}:����'KpA���,8 | ��N���t�
N�*����%8 ���� ��t�n�3� N?+��`���Hp:�����Hp:�] Naq�����/���ӿ4�'J����a!�t��2k 2}�X;����� �}2����=�� ��|���(�z��kZwp��ڍKG���Ծy��=���ɤ� ��ҁ~S�S�r1[>/�kq +�@���bA���F�n�xx�h`�fMŁ�ŵ� n?�{E�.�U�� �B�LjiA�вWϱ,�̈́�]tt�/� ����z�NJA�.+�]��vy{VV�W��C8}Ƚ����4�!>E��W4y��h�QN|���$~V%1N|��d��)�"K�TE,7"X��[ )�f�HS���O�?c�^[�wk� �(��e*�G_��r����Z���KV�m1
[l9��߯��뷇^Kg?��QaM��1Χy@�~F~���J�G�]� s#U� �J�� (�G����7i
�ƃ�MT�n�@�e���$ �#��*��'�q!���Ɛ�䱷:~�%�1U��p������|: �6���S�(��Q$^F� ���l�x���U���tV�� ��A��� SC�B�P�Y�@��S��#ԙ�ϛ��+�_�/��e��X]��A��%�/<�%]�y�[�*�G�O�R����u�?�_���N�^��� r,�OH6�g�����Jς���v���ϴ/���K�e��b����z�}�(>�K �� ���ߴ�~��K�G��~Pt��Xp�S�=�RO0���=�})jFXw���ĕ��X�"��_C �0���|����ۯ���`��� o����x��^f��29�L:�D�<�F����C�ަ�^�_�x3���E��u�x7E�������������� ��}ϱLL��ĄebB��u$�Zj�C�G9�de�zi��-��B�K%S �߇�?��
_�;�é��;�o-:o{�� _J�}"ގ�>/'ۏn
� {Z�}w� �wok�o:�8�2��W��w^d�l�7]9�o�$�Ͼ&n����Ř��
{�
U��4�]2O����A�Ia����*p >��@�߀��NoN9����*�zV�k�_W�w��N?rU����5`�Wt��-�Ŀ�R'>Fg{���)����!� U��� ��(��� ?�H|�� � |��NW�� ��و�R�M|�{ZAa
[P�4�t�0GT��~�J�|��U1�
��
��O�?t\����/�$�I-�oy���-/>n�,�'�8�eS���Y���k�:�䥮�d[䇒�={I��\by������-%�w�.��Q�䕏OH^�6J�e��h�T�j�e'�lyð�RѾ��ZL�}���z��o�}� ����x��U7�'�N2 >��|d~�3��D�uǯ��'�K>K�a9�h�|���!�͟g1j�䋿�[��J�Օ��SM9ɩ��'9�Ck�ׇ�J�9x���Z�{��Ķ��a�����1=-�R͖ �!� �"�)���?��!߹��,���_���*���� �q�k4��C�'a:�=d�5=ř���CǺh�
�U����-�9ф�4'"\C��
�� ��� �S�S��)�`װ �"����-@8� ��E X �P�E z!���� WQ$|E� ��" 9,��*�_X`�� �y�2,�l�" ;-�) \�V�p�[ �}nE �D�" ��R ��"�LZ��&�E w�\��'�E �ެ� p*�="�Jg��p�
��� ��Hx�"�Z:�D��"�\:�Dx�"�^:�D��"�`:�Dx��8��Ƅ��������h:�Dx��>���O�����l:�Dx��:�r^!�r^_ ��G��|�s�W�!G�� �V�?�
���}��5r|��S����r�~;�h���3���y�91�_�����'N+ퟥE�� ��}�K>����|�������g�B}����堀@���cA@ŵb��`���&�{J�8�+)�G�:����J� W�Z�t-��'o���J����B����T��Hܔ"qU��fg
/\�u �:q]��}�}7�l��J"n�����^��d� p��]��tek���� zo-��B�g���
�L�>�M ���q�<�w��p�H�G�2��M8�� ^�T�� i��F���E��<뾞 ��� ��eI���0��lX:�4�'n�e�J���;�T�J ��q�
�(`�9
(�J�$�M�`!O��{qɡ3o'f�<�t�#2r��z_����I�e� ��CF�nN���y��Su99�\/M ���#�W���_��Ŏo���N���0)��s�o#�m��K>T��ɇ�z�+8�75�U�d�
��u͏�|��p`��A
B�n �G���ȣY��A�U���y%�JO(Ģ�M��m%�{J������q�⼆�T����w�j;�up�Y�ʥ4U�Z��*�V�s tzN���GhK<��i<�*��Ϣi�.���xX��1�u4M�3�&a�o` � �Y�$�CB:T�tH�̛P��W�_�<y���efx#���'¿��/�B���/���1����ٯ�� ���U���D���K�'#^1>�1��r���/�'��K�?� w�3����G�/����jh9����n�*�ˎ��rQ�~��hp����W�k�;�5xĥ�;�V�[d��(�� s'B�p��k ry8�6���I�乒�+38_�k��Q�KQ�{|A� ��Ϡ�,�V���Q����t�� �<o Q$���y��^; ��\�S.���\�=�n�_�u�
]$��.j[�d�/��5T��ֲ�/�V�s�C�Y[�Vć��ȷ�l5 ���|���!����O�c:��h Fc ������v�"f���E���؞�i�v e{my]�����im��լ4�P+���Mnx�*�x�v&,��� |x��?Ї7�IEdar��5�NJ�ds��u�+�)��H��UV��_c�7|=�w��9���ٰ��&�CW���q"���)p&����쭘 ����[���F ���<fo��`�fa0{{�����7d6p@���1��
c0{�a0{���tJ�8(fq�,�∣�,�8+N� �bw��,�u-fqE,fqOk1�[�bW��,�UfqX�,N������A���c�� �t2�� ���N�����b�5�Ö���W ���$=XR(�w7�C ���9��v�_r��b��K��*y�9���_74�.�+WQ
���H� ��os���`�� ��� �q� ~�� � � ���{ �,� �ǣࡑm$ �̔�� l`��)�6�7�y����+�N��j�����ѵ 㫮� ^[a�伆���~gH����.��]���ҥ�7|�w\�K���p��� �S��EW�:/�o�6�ީ�0�I�� V���mnu�ǹ�#\�V��p�M�t��G��*u�� ���ά�� �'��$ �, 6 \JQ�&Lf
i�]�� ԨU=�g:�Y?��� ΨI�K��yf��kȚK���\���,~zP��3��-V��l ��U2���R�����u�~��.���˱���a?��Y=r��zl�� �w}!_�{W�>��$��%�o ��X�~�H��x�~~�۽��e
~�sMyͬ���%Q̐�?���&$���O��H������I��Ĭ7H��Gb�Z�6��:��j1�=J_
��2iQeF#���+*T�
�2(�ŔbB�ϥk�C<�l��4��r�Sף�
�ul/��&1�i���T6�2�� ݸBL�J2���u~�q%��"ʹ0�\ oX�#1�9��[ƣ�ˠ���QΩ�s#y�s��(�z�(�<ʹ�<ʹ�<ʹ(����Q�a7������N���q� 5Z�(�1(��2(�60(�^�Q�-f�F @�=.��\�����:���<F�y��0����� �f�;�_:�m��ś�N�y-��j ����{_J�=Tae��Ի�ޯK1�z�}�E��������ԍd�{��*��3��6��S����YtT�ò��a�U�x`��}+;�ݥ�/��E�q��
�p�(�0
�e{�"�6ԅ� ���g0�|��
�� j�0��K� ���n����ӌ���5ہu� T�S�ʃ��"Li9�*� ������7�P�J R����dd�i�o��a��T�A���J�Z�9�+���/�o�㚎�>�2�М奵_>�{�,���.���ֹ���Gs!�F�MNdۛ���6+�Ɖ B���o�c/��q�\h��ؖ#��Zݷ�m-����Q[f
��� 6��kva���љL�m�]��0-��Մb�2�k a���,5W� n@a�+T4 nA�נH܃��H܄��'�B��w����e� nC�D�%�!�gp!�$�� ��p' � �%.���;���Z�{�AX�b8w>�Ź����`����}�Ң ��1�?�p������ ]"�%�
�n �� �r^nz� ��*&���!�^7�{����4�,}Z o��G�JU���+�$�W ����$ �������_!�
�� � p|��L$�J I�d��_=Ƿ��}ڦ�.�k����A��ߤKieҸh�TP�u��B_���U
�Y]�������������1r8�k�X�ޗ�e�����q��
�Z*��a�__�_v[�_���:�D��#��J㿌�����G�e��xg��_-W#�������{��S���u �F��`����R��9�o��*�2�� B�7����og �k���_�t6���|�3��t"i8,��r����O2��Se�ns�g>8�R!��[�7��|�*�5Q�0�Pe� ���q�̼|_���c�G-����]�4�q ��gK2�>�6�u�-j�e-=��ƍ �w�"r ���9<3Z�"����++��5�9 � Ś�D� �S�Z �R�O��d�E����$���g�s2 ������M��K�?"/7/�0��_�?�L��'�rr���d2!����b�����h;�� �� ����?y\�L.D溎��t�:�+FQ^�+�2��~���r\S�����v�9�5��S��fY�n�_��?�� y���_i%�ok:N٧��s�
�.Qi�F,�vk��t��j#��t?�����5=Ϗ�F���5� �� �y9��9[P��we!�p
�>
|"@�T���h�A> |B@����I���'�O
� >=E���
������"4���V��,JY���:���R�4�� ���A)����
su�
��J�B��K�?���큂�������f�
t\a��,FV���R�P��C�o�/����c���~���_�H�ϰW���Ƭ�Ll��u�B�u�����j�|�uj|�w �N� ��� +[�V�l�V��ڴYӵi�m�f �h3��}kf�N��[���Z}�r�� ~�f'�9��Y�D%Ys_=g� ��r�>�r�Gj
�ۭ����� ��j���M;�i���1�1��v���څS/X �2E�h���}����>�ls-� �W�ü2���p��=h h�z� 3��<+�7U9������Jgc��fý���t t tE���!��)��1I� BB'BGBgB�B�B�B�BR$� I�t& t(Eҩ�бI�BS$�
�
� �@� Eb �`�Q �aP$�B�
� � � RAP�+E&�-��3{+j�9�T��uy��|��)<�_�� ��'�?�\�F]�GQ@�7f��2�C�YV��m��r���fnj�����U�W����?�P���I���r�>�Sy��P�����W�ǁ���X �����O��o�4+��_V�{�sz�-���O2���}���;����
�Ɯ���bdQʳQ�Q~ώ���2z~�v�߶�ٞ�a6�XM���=۸��
���߰�~\f���Nv҇Y��ְS^[�N�^d��d&;ݴ�6#/�e�
l��Q���mi}����cmM/����cg�4�e��f}��M�
;��c�좫lγ��昿as�?m��� [�Νt�fЬf�c+���m^��cƳ�<l�o�e��N�-(g��`{�jۢM3� �-~d(�P�_��zP<��e��x���ܦ���h�l@0�0��[P��ʡdR�,-�4�_�N��$WZ w�z�*t t �t t �Z�Qr�� BgRr
�
�K�t0 t2 t4�x4 t8�;��jT��4�$�O�Nb 4�$F@�Nb4�$�@�Nb4�$FA�Mb�` 4�$FB�Mb(�`,��м�
�;��м��;�Ѽ��;�1Ѽ��;�Q�|� �7�����|��
bl4�$G� �;��Ѽ� �;�Ҽ�"�;�1Ҽ�$�;�QҼ�&�W�Y> �E�z�(!/�"� ���̼�����*�Z�S���/H��
>����<����6�CO
T
"�A�e!BLF!O�L0�����!���PS���4��b��f��?6.V85�!y��:}�<}NNF]��RQ����d�����+ڤG�8�fOD��S_���@|�1Z@v���,6ù>님&�GY�(i_��iU*8�q��t�1�tY�/[��3r#�3r3���9�z�V������ ���5�7� ��қ��ƚ��
f��2�g.�k�� �UIe����kZ������ݍ'��n�r��J�}��?�|R�
��/GW����{����� ������0Jc��S����P:�ev��п�Gi����+8z]���<ì��l���R]��o���}�r�yM�� \�7j�IV���8�ُY��~�y Hb�^X��ڡ 1Uܭ S��EE���YV��pf��t������Q$�����=ޕ�A��� }��G����M�_�q J�?^Ŋ >���x�]��妏`p I�;�KKg�d�y;�u���`j2�s���S�{ @~�V�����!� � Խ�ˠ�[���2���������wDto>hwX�K���lX�4I�a��&HZ�g�N:Kء�����[·OZ�}WK[S�u��khi��n]���-��7�u|�����mX���t� �u�'��v[Xd� �H�{aPѧ�Ǎ�c��s&�5���,\9 -�:笥}��|̶���C��c�G��M �@�4 4E�$��,I� B�P$MDۘ4� �T��\��d��l��t��|�Є�Ќ�Д�МI�B�R$M��r��J�љ;���tY�9>���B��Q���G N���?�0-�;�j�
%����l��pN����r�'F�Y�I��� ���Q��`A� �i���X��m��%ɮ�1��
fC�Dz%7�W���V��p��r� �� ᾨ`�+����=��}�m�@���+4�j�G�)�*!���Y����ST��]FX�h��+1�d�"�͍{ �D����c/+ O� -�5z[Ww���[ �۠n^�[��kN8�?)/ߠ��/
�J���?�K�eZ��L
�5�YGK��v=�d"��{��w�f`u[% �-�o�T��U�m^V.�����{�j�J�r��7��?�O�� ����R&��W���n�.'�+g���eR�oޔ�n����]h��WP�E-��R�UZ��,۵����Sxո��:�/�|U{+�l���ޠ/���y���x�!a���+���?-�]b�4xPB����ತ� sŰw�q�+q��u�x5�@��w1#(���� S�;��ԣe���r�����a�Yh�������
a����������>
VH���� �7Aޗ��1�=V&�O^�F[��_\� ����F�_!ej�B�����Π���
�b�����/�nA�o���/��⯚���(\��y8�0���,}��7�/�`�O*��%�W^�S;n/@��C��$�
t$[�kn�?o�W�����anaF���?�+���7�F�O �� �&�0�ᩥ������;�븾�xC�����{� �[��P�����#�O ^~�0W꧷�o�W��� E!����v���K�r�� ������Y�A���^/V�omS��E�ƾ�5�Լ�-��fl�{�eS �m�6 aG� �i y����mL�'�1�ZSSbS�Ͷ�W~̎_�l����ą�m��d����N�柶����wVئwn��x~����+�[�8���36mV���n6c�(6��2�I��o��
Z��쵶�?\f����r��ms�&�r_�d� ��r�Nڸ�YC� ��d?�`�:[���켘�켧�f���e��6v�� S�� �r
�h���� �.n[l{��lŧ�V��0ۊ�-�X�f�՛0/�
W�.�k���k �{(�.�n�H�
� � �
��R�>�� �)����K��"�R@�V��k�{)�.�n�����.�n���� 3�HĹ"1 @0 ��4 �<(3�HL�L�L�L̈"1%@0'�Ĥ ��(��HL ̌"15@07@09@0;@0=@0?@0A�:2��1X:]R GL _~�5��?�.G����g��T��UH!�W ���.7-o�>7W����S*����������.�t\��
�^ٲad���}�� M7 ys���m�Q�Bѱ坌�9�)�IgQ���)�A���@S�/:�5���hO}S��C��/JD!_� j�P=Qӽ ��M?'����y܇�����o�N�#
��qQ��Ѣ�!fSX�lS�G&Sx@�)|�lSę>��˓M��mnj�`��óo�$���:�:
�$ꬿ$��i��k�IQ��"{�E �Lԣ�:Q��v�z�_(�Zw����3�h���;��>ך��'�d�t&�a�I10ޤ �ޤj��DR��zCSlD;Ql�k_�~}����~����:#��?�����-�D4h�V�&c�h�$�ŧm6
�)!~�iX���Ι���S4���/W�F~�H��� Q�颔gG�F-Fϗ���T�l�i�6�4V�ǔ*���I��Ƌ����4��9���>7M:��i�7MS��M�~R4m���=��m"6k�H7�1�� Ei�٢��SEa)�Y͍�� �)��ɦ�3I&�����F��_oo����4�)Ɣ�j��7q����N�!2$�E�}ψ
z��y_4��.Ѽ+[E��?#2�{�h��F�·�v�1-ڴ����y�ŏd� 2L4�j���5|֯���d����^��zp��T�4�V���e�3xV;��sU�L���� hQ�G�H���h$E�8�oM � ����� �٨���H���q<�� �)'�2�8" 8# 8$ 8% 8& 8' 8( 8) 8* 8+ 8,Eⴀༀ���#S$�
N
�
�
N��N�O�8? EB�@ ! ) 1 9 A IP�'Dd����A�2B �� EB& � � � � � � ���
�t �x �| �� �� �� ��(��� ���D��7���h�,�/�� a�l�� � y�Q?"$DF�EBf ��Ѭ�;�_ 7�5��Y#!9�5n���Y� �H�f�Yؿ@~�@�4[$$DH�EB��@�4[$�H�W�_ G�5 ���Y��ؿ@�4k|
�H�f��8i�H��f��D�Hi�HȔ�6د@��`��Ҭ�,� �Ҭ�-� �Ҭq�+�.� �~�u�E A
j��� �� �d��J�c�v#ʿM)��]C�:8�� )� � �
�B�$O�b��'P �jU��������Jc��?K��/��>�uS���߰��p�1����G�4X>�6�ܨ�UK�=a���mYzt�j���'���$Â2%�;/� ��%��tK�� Kj�p)��f��x<��yMy`�Px[]�B� �U���� ���(F vL�:, �! u�83ꨫ�Qa�13ɇ�z�|p�X� �m���"���4Β�H���V ����pR���ק��q
���*��g�0��/����_ڰa��~8�
��G�#o��?�֗;j�g�-���s}��&mI:���7�s�o�E8ߨ�w|������_lCҍo�&���4���ߐ�bI-��b I)6�tbI% %i���O/�a ��� ��������3����v���l�;<�������א��9��LR�I�)ӭ� "�_#���O�|��|"�?�{�x��6��{��)�#�~,/�6��T�b� ^9�5�jמWˮ��� ъH����� �:E��"�I�>��/)����}����D~o���'�/�%�g��n"2�i"��y]H��,"�'I=���DJ�$2z ?;� ����j���6�8I0?��U~����.~�O��(?��~�"~�ޯ�$����)���"��"�"}��M'�w ��Èԝ�g��3 �g��돫���v�_o��l�s�W�\��| w��f7$ҵ����D��"r�0����L}�H��<}�HS��ҹD��$r� ~Ѧ����ŏ��C�����k7�_� 0�E��C�]�� �М�
3OVf�[-
�0�� 3;��7 38 3�y 3}9L��L�#8L�����7&���~,E�3L�i�~��"�9L���1�o�`��-E�AL����EL�71�� `0�_�b��&�����b�?��*����g1LC$���~w � �}:�Ȁ/c����t1����L�f0���t�S���x�։�~�a�U�}$s� L���1��c�?�"p��cyL�'��xL����1�oO��}��t��i���g�L���b0�?�`����4�}��%��i�V�ۄ_0�_�`���\�i>�p���4 ���|�W�!L�_��0��~^�4�'�!��i>�+���د�W��c�oa��? �oxL��� �1�/�1���4 �x
�|�W�7L�_��0��~��4 �i�0�|�W�?L�_�1��~>�4 �x���f�W�GL�O���( p%���L�_�71��~��4 �x�|��(�b�?��4� �|�W�WL�_�g���h���h��MH��0�O�����B�+��_&���������s#3���'�k;3�?��=�����?!��|��vL�A�1��Z� M�F�YSa~�Y� �G�J��{��{�\���}>j�B��+[��5S��O,�`� ���h�W��h�W�Ic}� ���=y� ���`���ӭ� ���������k�A��$�[e���eC�$p5r>�+e�� C��'<[�pTo�G��4O � ?��_�T�������7�<|�-�8��T9� �Pa��� �v�A���?h�qr ��Gh�A����Oh�A8���W�� �/ny��<CM�7+�3���?7�3 ��/�e�ey�'�<��[�A��-� ��g��<ϸ�� �7��ؼ,_�)�1j��?�B�����V?�t[�՛��p��m�ߊ�� AT���ڿ:^��K�8����.7��"�^\����%��7]�G���K� �-�#�P�K���~�R?�-�+=�10� ��p�
�r³�(Ϻ]SiϹ�OX�Ww�����|o�x�R�� ����_���q������C 2̓F�,�hQ�0��E�X�� ��|����Α����Qy��R�T� �|�E9�����ڶg�UnU�7v\�K�VO����L.���"��Nܕɝ-B\��/�G��*�
������!�U}�o��
�N\� ���O ��d��C���n������U�L5�N��?a��0//���:�
�}���G$�F�+T�����|�5%�пg�Z�jJZ��xVX�iư�r��÷�ʊ8���v�4�ݻ�����:<�r�d�u�?2v���Y��K�\{��J�^<m�챭$��;� � +��ڋ���K����z�0��/p�w�6���s���FٴdNn�mT ��)Lj��vbN-�dT_���F4-���$�w��~��p�O�(���}�]%qKw���D��}�o�$��ik�C{�����
��<�8�ϧ�#~ZQ��e�}�GsJ�ޜ`O�6�$�پ�Q�e%��Gص�(�l,7F+5�Մs���q �q�]6���-7��Ɖ�s���5N>�����d���O[��d��b�a\W�f=b�M\X2sD�=-vjIz�a�����Y�Ӹ̀)��_��3�����w;�_o��l 0�1����g�yܧ ��Q2w�y�!�LI~��� ��y�>��֒yW���?���� �K�5���e�E�8��Y�ŏ�� 2�4�L�Ճa�v{�Y��:L3Z��ϊ��ph��>˪g�N[u���f ��ZUS��ԏg�V�fD����Zu���,Ԫ ��U�Y�U�Q���P��\�Z��P�~dD��ҎZ�l j�\;j�JP����V�V�Z� ;j��JP��hG��]�Zu?�Z�dD���Zu��*ϡVM6�VM�P��6�V�͡VQ��9Ԫ����K�U1��B����� ��Ԫ'�Uw��V�eG��L j�g�U�0�V5�Q��5�V]ˡV�oD�:��Zu����vԪ+JP��Q��)A�:��Zut jվvԪ�ԪvԪ���Uc9ԪR#j�p�j �3�2j��FԪ�r�U�0�V-�P��5�V�ġV=Y�Z�_vԪ{JP�Z�Uו�V}ĎZua j�t;jթ%�U��Q�ƕ�VM�P�N1�VM�P�4�V��P�v0�VmġV
0�V��C�zֈZ�S�3�j��vԪgJP� ��V}���+vԪ[KP�>iG�����\;jU} jձvԪˌ�U� �wP���P��t x�sJ��W�<�� d�RVN�ߡ�/^�;3�`���_�� �`$����:�xp|�o�E��a���u����g�ț��� #������S�� M<Đ���;c�>'��/����'�߹�cAzn�7��I�W�����u�)93�
�~��r�����8��N�_h0�3|���˄���2���V� ��B}���0�le�@�Xס� �%�[���P�A�ˀc�B] S�08�.���1u���P3���H��ț�3x�|
�Tj�����?�zF�N���������x�8���!v}nzq�:��TV��7�2F��%�o���Ϟ�,[�� �V��l�� �N�5S���M'}�1��>o�>�6�Vv�
_w��b�����C��K�
w���B�w4qBaZ��+�q�*��o�Z��~���?�1��n�/_r8��� �����鶤�F�~
m��ihx����m��=�� ��ځ5 sw�4u��Ά���&�O
M<:%����\���B�z � v���K�*U�9V��^�w� %v?*�C�^)�|� ��`��b��
��C���R$ �6'"��MC9����3+� p(n*Eh
��9� i��Y�Zl�����~JU�-�_����e�����w4�P�a�>�?�?F&/���k�I��'�����F��_�a$*!��M��#�z�]A���/�/��P�ç�ϵ��qM�߲�.$7k��9�!�ͩk��#)|�~)�vG �݆\���\�$ٿ� �|�uJ����/�%�M�k�z�[��{�t-ƹuv���B;]��e����Xg�k1�%v�#e G�bDw��Z�&\��oX���a ��,2�-y�2��3k��,�Sǘ� ���T��vQX��/ �r�e|����"˄ �9��'U}0L��c&�g���!��b@���QӺ�Rhb��f����:�49 4; 4= 4? t t t t t t t
�"�]D��H7QtN���9�N��Q9��I��!*�:�F��)tҝ��S�[i#8��I��N��n�����.�n������F� L�L��rb�`�` �Z��L�L���Y���م��3���t]nf��?�R�1�/�
��'���%x��K��Z}n>ljǟ�8H=�P�g�g<�XD˨��k1~
5�Xj�S��\i��� k箂�g_9e]�j�~��B����B�Q�M�P
��C�w��輦���ز��.e; SC��S&���α(웕�k���
oDUKu� b�:.Z-LfU�3rf ����#����wYb�A��#�����N�����e�_u�/��%���m츦�ϴ2�jsT� �㓎r'���?��->�� �K�uL���h2Dr!�'� �&Q#*��P!� _ ז%G��jz��nn��ߐ[�ۦB��:�4��# �Ǡ��?
ħ���`��1$��� �2�Sx��
��K��n��_��×�� _�i�n1�;�y&�7%ˑd5�k�1� �T���Y���խ��y�+��ip���䎘ۻ%* �������]-�Oѥ�� ��W���<F.����= �tC�� �^�|�}���Nxc�%���o1�����c���2iLI��� 6������aH��ogl�vt������W5{o��y;���ހ�A����?��)��������
��Z�b58Խ� ���r��_�36�Õݛ�Y����͞�����7�מi�ן�oF?>tt;�l}� 3{|��� ���� �Z�r�)h)@h-@h1@h5@h9@h=@hA@hE@hI@hM@hQ@hU��e�u��Ϥ���Ϥ���Ϥ�������-_�������"=@��%_�Tg�� � �^�/���w(y� �^����� ����� zz���k�'��ȆXal����tst�酾���c�_�T
�m�O���%�ä8$7�Zِ��k�!9�RU��p ���M��ہ�S��7�M�� _����30>��JU��ja�ߗ�_���zM7@��/� `�1t{K*�y�#��k��~�*��{�G� 3���� �'� �j�� �_�?T���c|�*��#��
�?�e����-�'�� �vd�|�7�O���8i�Wfx����3?�X��ވ`kJI=F��G���9�paм��&rޚk0�/[� n��� �K��2 �6�.�: �>��#��������l�7�~Ռ��2�B�:��̹B�߳���I+,(����O����}�+��+ �O�XG�*�x�U�QsJV��=^&�M���7`*�|���b<�s��L~�V��3���geg�f��}�۫���T��/������ �t���6O ݽ���e䊢VaŒ֢��W~����T��t�$�����K�mwZ�m�em�r��âVIN_kǩ=���#���X�D]�v��`��;kdPcm��k��箲=��ٲMD��=4$ά���b5�
�V �n|v�� x ǒ������]��nW�� ��נU �e �u(��V����� � � � � � �" �$ �& �( �* �, �. �0E�ʀ�Ҁ�im:B - � �'̝Y譕�5�j����BC�w�$�ߵ�S
��t^{��Ȕ��/���?/�c;��(�rF'�W���O���B�P�E+�x�%� ���-�{��WU�_!S���\���������fg ����".��i"=ı���y ��/=��T�oY���ڬܼ93��~S�II�Y"� r�OR�|��J�~��>�P��E���:������*л".Z������\/�GM����^&'��u}�� :���)� ���JA������7^z^���b�̥Zg�NI[T6��$ ����VB���������}�*��?�P�ϗ�_�";���C+�v����� �FSvo�/�1�]�C�Vg����5��/W����+���c<������ ��D ס�/�i�a���-##���F[Z�F���4�Y�����#-5�;�mw�Ƕ�ȶ_�;�� YI��l�)��NIo�����v�z������A62p�-��?l� �Qc�q�[σ9��]�l����E�d�Dj�S��&Moa�M�c�6�b��U��U��Ǫe߰�k����+�د?d��u��o�v���wl� �
��-n�K�A� �i2L�����I�m�O�١]�m �3�aA�m�;e�_Hb�wc�F�#ϊؤW���G�'n`A� �j��h(r����5�y�.��^ s�S�{�0���
��:���Lj�uJ;29�&�G� �x�&�_�Y��/gh��3�,�נ�����)��N���� # C c � � � � #Cc��H���2)1 �Ā�@1"@0$@0&@0(@0*@0,��ĸ �� �� �� �� �� ��(ã� Eb��`��`��`��`��`��`��`��`�����������������R$ FL�2 3 4 5� c�$���q�2� �ku�W7'-KW���Q������4���|̸���6晃�7�����i6���hj�=�+Z-�ce�k ��.�#�t(��|v�4���#A� �(���ӑ�1 :c�z+� ���0֓b�] �ј�8_��\~A� �����1J��J�7_��7e �u �?�;ݛ? ab,�*,���h����5a�_ж9u�8�Hg-�ґ��@�sx � �������@Vpx �6{�s���&T�� �ɶ� )v<�� �I��HN1�7� ӈS�sj�Ϝ��%.6��=��\߿�����?u�>`� ��}����Z��]��}�;�! F{|�*nh���x�4�>��n��I\b}%�x�?7�l+.��v�3���sY���*
:�g�I�� �Q!�eà}9 ���LB�� ��_���� dB�b���J�K{�UH��. �k
U�.w��!]�J���X�B6*b
�^ԠRxA�J�D1*��ZT
�sK:r�����P)8�-��C��<��#���ܒr��疬�P)8�-�fG���A�0��*�%�vT
��KR����Rp�_�̡R�t�_қ"�"*1�J�gDb�T!�D�p�C�pގJa�J� �� ;*�W����.*�g�vp��vT
�8T
��8�� ;*�1 *�I *%�Q,���J� ���>��;�A[H��]�XCFznFv^9��>�� ��*��}�;�)�8� ���vo�nk���j���MA�"�wfZ��͉J����D.��y��71��:�NV �U�w�'�0�c�
�-��{'��YV]F"�L��5��)�L]��W��$�X�'���7�?�=��-�z�����mv���'X?�� �E�� _w�� j����.;K��
���R��G ��?�� �t��2��{OHw�'�����+��:��F�"��=��B����N�=C�u?!� ��@u+!�}����D7�C�� y.�%�d��2��C�ģ��ȳ]��W���#���UMx� ���*b���?�� ��]l�!�]H�u� ÝҚ�(�V���I��UҤ���_Q�o�c�w�QN̎"1=��������u�1�b0�a0��sj��_`0�oEz&f�19v1W���_�c~�1��1�g�� SƘ߅ǘ �c��C���K��� `�B��������M_���\���1B��a�o�\���s?��/��-����6v~ ���[��A\�ds� ��6�6�_��a��,� 0w�r��)鬹s���.Q ��F�1wk�� ��8��Aq�s�Kz�%=N�$�y�Yq�.��ז��5�Ž�L�)HK��eӲ�rC�Y1p�Y9��Yծ�Y-ohV_oj���"���n�{������# ���x�O�qK����! t� w;`Tn=mj��5H��E�\ �V|�e�,�JK@�!���|% �;�-q�S�|�u��s�2i�|hY�ĸO�V������� �m(��Q$�͢H�ǡH�`C�0�C��lF�0Ќ"��EB�`7T$�A�pɌ"�E�I3���(��Q$l3�H�L�" ��}�H�F$v�"�Y1��E�1���b S�(��(�Q$d�Q$ěQ$�4�H�jF�Ћ"�&���f ]�(��g�U '�(�#F�pQ�"�1���b ;� �R,� �h��}v���|/��9�t������l_�
��2a��_�o�4|���{H����
[`m-2�Z_yEv~���~D�F�����÷� �ۯl�wXT��d��w�r���9߹��|��7���n���G~@8z���� �i� '�N~���B��ل��N!�G����ɼܠ���kcf��eya1����Avs�fY�T.?����e��{ � ,F����^���#�#�͊^�b���1��1�Kx���y��x ������9��C #��<F��<F���Q���`��-�?
�$ �ք~!� �, #|
�>��XF��<Fx�~ � �1V.���?I�]X����u�������g��x�����_��x��C֊��^6�:_���<,h�xx�\�� ���Zs�� �g��W��������0�,��d�����8s �o��nj7�C/ ��3|�T�����1��l�?_����$1�\3�B3�-"�h��r3��f�����#�5��}e�j�^k�?>K_��?�
� �~����˽ ��qTr� ��3�l�[�X�.vW,���E ] pG���� �
��Uj���_����C �t�S�fvo�L�2RǷ
[ko-ZK��\�C|�S���GR����-mw$Y�m`i�2��aQ{�$����T��)�WK��[�D}f�q�ҭ�nKd�I�����K{H{��%�yp�$j�3�^[�K��%���%}
&K��Iٴy��~�b�D�r�¢j�Ϣ��������F�%�_�m�{5T�o���� �[�K�J��;ɠ��$��w%� ��2$a�$>m�ehץ�����aA���Y�_xԒX�%�h�e�Y�%����#�$)�zXR����}�_��� �{��<;5qa>���
�q:��������H�Rv�$I�ζ�P��X D�c!=�r �-X ʁ�(�%� ��C9p�G9p͎r �G90قr ɂr`��@��@{ ʁf�jP�jA9��g�-(v[P��� 8!A9p\�r`"�.�[%(��� X.A9`�� �KPL�� H�� �gA9p��D ���@? ʁ���*Q�%(��� �� �YP�!A9p]�r�+ ʁ�$(�IP�+A9��f ʁ��K%(�[PdJP,�� xԂr`:"�r� ʁ���$(zXP|)f�L�I +H����A����@g����s�_.�� �������g$-#�̭¶��,n}�K>��6���b�؟U�vǤ�vF�_ٿ�â^E��vE �6-�t��s{Q��3E]#Nuk�~Qd�Ei�e�����4=��5=N�'�y�
iԮ-�^[�J��,��^2_ڧ K*M�$�M[R$7�(R �U� 3�H�nD�ZH}�gQl�F�MHQ߫����_(�:P:��ҁ�~��-�E:h�!�&�t�犆$�.�O��hhק� �ۋ�J�w~�h������% �/yvTQҫ㊒�dKSV��&� ���� Mi�@���D��B���WB�~H��71R;*����?�e��K��1�o�Oz c��<�/迃`��b�X�U��~R��E�a��U���]��E�oa��a�?S���D���0�_�b��I1���X� �X�7��H1֯�b�_&�X?_��>K��~�c��"��3�0��*�X?�c��"����b��������c��3X%���21�(�X��c�!)�cR���0ֿ.�X�a����a�/�b��c�SE�s�Ec��B�`�볥�c�0��IV. �w��T��
���e�_EL���� ����}9LR|o���U ŵP2�����M��F �˟t���P�@��ޏ�Y��u�S��xo�*�2���!��2�� 3�q�����}'�G�
�wY��f�/4��o4� �T<$�&>�d�Ю5 �{��=��y]�� /'�_X�x���g�'��V�� �I�I'$�T�>E� ��� rs ejֿn# ��YPw� ���;Ey��7���Q Р<8Y��`��b��jP �+Fy�b1ʃ��ĮQ ��`� ��F��N�wA9�0�����j��#� ���6��nӥ.��ߣWo�D�Y��d��O�<�4=S#���Xn�S�XP� 3�X�n|�Z.+V_�-�����&���U���k�O�� x���V��Gn·��
n��|���/�?��9��]�جA �F�:`�u�<
�L
��Ũ��((F 0�u��b�2Db��FiP���jP\+F �B�:��Ư� b�B��A� �3��
s�'�W��*!��e����k���|��C� ��5�̇DU��QK�2��~����3!���;�ޅ�_��?ګ�5X�'W˄��������{C�g��Җ�ZZ����.i}�s�s�6�ۈÏ�-���ݑY�n���+�;,�W,ɉ*�8�mq��&ŝ��]�%�bq�[q��Nj#�k"/_�t?����q���I���w5Q�vj�1����QC?�,�u0���]���
0��w��o"� ˟�es������2F�����wb�'���3F�s��m������1�gc�X��?���b��Q���R+��w1F����m���c��A��-F���Ē0�����S#d�U��w��C�W�E���_�?)#[W�a���,4d� �� �Ʌ�_�
w�A�nF�ȍ-^'�Ầe䊢VaŒ֢��W~����T��t�$�����K�mwZ�m�em�r��âVIN_kǩ=���#���X�D]�v��`��;kdPcm��k��箲=��� '��<xL��X�k����5����<��S�D+M/�ʦY�r�V�G��1Ӭ�v�V�|�U}}�56b�6���־W�� ��?-�x)R;��zڸe���֟�j2~�^�X�$|��O��:��kڄ���aAOi�w~�:��+��&k��'�#�ζ&�:ך|d�6e�Xkjr��VvB���*Vø����|vB9)��@�ZJ�JGz�b*a�o�n�t=
�`( �QS@a����"��P,��0(��0�eEa0���`��A_+
��V�|P\��0�`Ea� E0'״( ��( 6#�BapL� X���u-
�MZOkQ,Ѣ0(Ԣ0�XQ<`Ea���4+
�t+
�A��,QLբ0�nEaG3Ea Ѣ0��&K�1[�( ~�&���S-
��( ^Ӣ08hEa���KV�XQ����0�� ��Q,ע0K��M T�*.Z%���?"oF|�~F�>7��?
���_-�)��q8�>3/W��^�T]~VvFn�o�d2�G�G�0��S�'r|Ә�v���h#������<�$|���:ee�cM>��ш�6���G괕����?V7Gg����� ���
��|�
�NlX�Kc�s�����_��@M��z$�5�H6H�������^I.�
T��Tv�Gu>�;�/��y���}K]y�ۭ+� �C g���{����e�3�K)�O���� ������+�WK���\v��t����Ct���y�������3r �� �����Y�ܙ����c<���e��M�� �k�?�<��tT�a4| ���d臿#�~�q� ���� ]~Za�o�_��K=�_)��%��w|��:�5=n�3nz��y���]s~k�C�K��m�u�v��?>h���1̥)����/�~ �
�G�T���3̟7�+MO1Wμm�����{�k�?e�o-�~��o,�fg^P2���ze���u�モ��7��0
C>�D]��_��-g�����'� y�
��ǃ��ٓ��^�g��Opa�? �;� �r$��%����L���$�2 kc�4������� ߵk�P>2(���c���Ofm��#؞���F�b{m�a�~n����E�>� `�s^��f0�\��*�g��,���AV��9kL����ߎic�`�E��߇c�o.�ض�6p���8�>vЂ VM� v��|�d�-~�6����BԶ�=�� �&6�kM<��m��i�v�f�?>�MYs� ���� N��Ƕk�O}� �\;V�"�:�%�Ї��r�u��4vb��։�<d�t)�:� �mʉ�֩��ۦ�[�?��6�h-;��M�@3���mi�զwk�f�L;+�?lf�nm�����ǭ�v��Ͼa���y�uΪ�m���[�rWڸG'Y�ʵ�[�{km���M�y��i�]�C�j�_��?��]��}��m�E��>��u�/ه�|ke���]* zJHtl+aA�KH O�5p$���ġhym�T��X��\��`��d�hN�h��l��p��t��x��|������C�SR$� �
N
�
H���a�8-��q�yi'Gg�c�ġ��"NM�86�Ax�%88 89|���������8>�]��� �� P�E���,BTgB�:k8
�@u� ��:���Y�(��"d�C���g
��qСVB �h� � � � � ��8B��H��H��o�� �H�� H � ȉ
BP�@R�@T�@V�@XT:��;� EBb�@d�@f�@h�@j�@l�@n�@p�@r�@t�@v����& =@ >��� � )"2BRbr���������HH���xd.* �* + �+ , �, - �- . �. /�+�|��)"��% � � � � �
$
x�u0����R�U�U}��RdR���<�-/'o��<_���e �?
���� �?��0�w˟����m� Ye9Q���^b���2����� &�5 n8�kJ��`4!e�cְ)!۬��̴�# M�_�ISpDA!u��T+�5��F�{u?�� �� �; �? |@� 4��BC.�<4đ��x�Cѡ�4.Z�O���� ��L �g��W0���!�/��} ���1��o�J�c:��
b���wƾFf�L��I� � E�D" Y�H�V�[����Rݕ���*S�]k�^۠���m]h��U5�9�I&bK��}�_�������4��s���ב�F_��7.�^s��������p~%u�����VsF�"��?ޜ��i�����%���(�|����1���oNJ��
Ֆ���/��|�ك�������Y���Ut�bS�.2W
( �1Wr�`
$��]7{3�]_Tr��� ��u�G�ݪ���o�(|�f�
#�&�7N�#x�T;�@=2�>������ ��9��IM�z��[�t%��U�?��'� s�7@���E>xv������{.;�<:Iv�4�yt� {h��x�]�h���0Q��r���o �,8��W��׳��G���/�O��,�3ۋ?/=����1ܥiM-�{- ���[�:��c����l\���W r��#�J�hS�9�U�ڝ�~�^Z�s6���⟝-���M��_Z|��f�J��j���X�О�c�P����sΎ? �;9*�:tA��R+g�wS�n�Xo'�%S��βz�n��|Y��_�F} �vB[���C�B���%9��Y���^p���'����$�בhg�(���v��Um�>�Vv��Q�#GO8/�D��_����� K���w+���c��^>)6��_��!�LC�U��,8�z=�,������z=3M# �Gu b�����>?^�?��Fa�;,� D�r�e�ka��,I+��4�yN�� 9�2q�INi�Ւ��'U��Ok^_N;�9?��or������������W!k�쵟
99,�o S� �XS����-�}��j/�L~Z��S�eF���#�,3/��g�e͟}��<穄��^i-ϝaȟ�D�p�Z����<*�� �C���C:�I�u�SO ��F���ͧ�n>y������E� �"� ���|c�l&=G�Q
����CD"" ����GB�$"�����DD�""O���f�R� 8��LM-�ʹDdm�U� 9��L�X� �L�%�3k3}ȱ6S�=r��9�oB�8 �s�uD�;"r��8�{j� �����6� j� �6�j�=�6�j�] �@m ���Am ��`+�����8`3��q�vP���!��Y� m Ֆ��P;l
�s��P;l �s�����v�j瀭!{Cm �9���Cm �=���Cm �A��;Dm �E��{��:�!D�Dm �M�m뀝"[Em �W�h���u�vQ[��u����:+�����!شbm �m��<`㊵y��Q�� �w���ݣ�N=�^A�Gm�K���v��<�Y{�!�y�&R��"�yV��
�Gj��a�������+h/����+h7��Ӝ�W�~"�
�6�Qj�e��������+hW�ͳ��WоR�l,Ş`g�����<`o��6�������K���;`� �S�l1�y� S�l2�y�.S�l3E�`���6����k[@���g�[- ��cͳ�^|�[�:õ� �^���7�R%��r��f ga��J����{٥�C1�GԿ�Q�]���������R]7��u��_��(��M���~� g��'�{��[��*�ӆ*���K�_�u���s�^{�q��r�>u�E��
C_VGl�gｪ�m@�M=�z�m�7�ԃ.�Vq@抮��'��D�ݓ ��_}:o2�s�}�s�8�).��o�3��7�~i_�� >"~�7�aȝ�"w
�� |0r{������� � x�:�sӳ��)y���à)�� ޜߛ�����d$�3���}!M���� U�?����;!���i����w�]����}b���� �ci����|ckK����K*ZZ�>'������g��&n��m�
B��/Y�7["t����c�厗_����Cr��wٕ)w�:%���!r��� �rHnH�:���?آ�t��[B�����P���uR��+ň��I���b�yR��dјb�����}c���b�v�~-b�؟6�l�mT��2��9��gc, ��ΣB`�#iJ"e �s5��%6ܧv�P�seH�kZM��F}��Ӎ� h�
�e���@D� �\({�P� ��dD�3ȉ��)�(�e�q�,�e� ;ʞA~,{~���r$��nCy��y1=G�R� ����K�3Ș�g�3e� k�ț�f�9e� wʚ{�[�P��5�P� z@�0�eà�A'�}�^P6 �A�0�eà#d�@O(]�l�a�ʆ[��5G�aY�3�Q�XV:����.�u����fsv��[�@���tj���7��m�ͱ*��[�r��x�5n�
]��O�O���J�/2��s�����������H����R�*��VR�9DUf���o�6qg��������7{Q�P��c���3v�y|�z�ˮ��#���N�0�� |�`^�� ]��lj�ރ���`Qߢ�d�Y[��{����"־m�|�-r���>�smƔ��Q �-�o�=&4�ַ]��_�$��/�G戣~}�>��0�h+��~��@���u�KW�K[ܽ������m̽�h�b���{o��w���{+z�b ��`����3s�{D��wK̽�(2�����;��E�� s��y��s̽/�{g;���{��{ �3� �1��.1� '2�>Hb�=Xd�=G13�����;6���f�9����g�̽ϵ1�~���w���{����hs�Qv�ޓṰ�hgn=Gdn�!;s��&��X��fbzFv���:,LW�Oe��������W �,���h���K�L;�ow|l3팔��o w�V�w?UŴ7 ��;��sߙ��{�;?�U ��d:�4�;6 +��*qXS&c'O��3~)��sW Lu�p��0 .�G����!�G$��Iw�G%���� �>6"~tB���x �2P�."^D�$tw\B�4T����)�)��o�4'
�˲�Y}��N{�:�2�ӗ����],����w҆H��o�_;+ X�T���_���8��FQwu|�L�4�i*�nA���6&�m�Z;�0�
#�e:\��|��U��k��,� ��C��Y���y���l\y}�r�q��b��a���-��Z�� +���F�����V� ���ԉ�����u}�:�(��q���Η��b���r�u� o,7]<2U���&����Y����O��� SQ�R�eS�vaBՋ��A���#uM��$�x�IS�m�Z�>t�~)P��M/w�� ]�l�q��b������V�+:UO�Z煙ڬ�&� ���.-Ih ���C��BǦmM�Z|+w�2�م˒� ������
�6Wp���
n���K��ޒ <ͩoa�
5G:
Wd6W� ����e6WP/����6W�O���B`s��\�U�+����
>'����d6W�,٘a� #��ę�����a�B��ڦ��� ���l�{e!�AMg�'�
c.�� �Ƈ�= u�[uN ��5�y���;��
���-��>K�㗛RZe˩���&U}XHk�hJ�6KH��Ӕ�o�0�TsӔ5B�pg֢zB���Μ�_�;��#[SO;��/ɹ� �<�cyz�S��o�3jm7�p>-��y�,�ly��9O?%ܷ)�4w�,a�#�&?� �� �\�p#�G��l�6�ޢ�܀!����6r��Fn���
C�kh#7`!�����n�v�� Y���M���.�vo �{d��i��6���q�f ֑���� ����D�����J*S 3��T� �RyXJ� `*�'��T� �RyXK� `.�'��T� SyXL� `2�'��T� FSYXMe `6!��� '����a��'ܣ �+O�G;.Xy�=�q���K]� %��'��F;����*�e@,��6B+�����v����vd��vd��vdk�F;��sE� �ڹ�ю����v|���vd��vd���AD ��V-"Z#D�Hē�l#4�LT6��6BC ��V���Z+D�X�h��r!��BD ��V -\`ͨ[҇��C����
�"Z8D�r�`���Q�� "Z>D�~�h�
"�%DDk���""ZFD��(��DD+I��%����C�����'"ZPD���hIњrw�9�v ��p�5���vk��1���N�i�V�V��u�6��/��?���ß��bٹ� 1[F ��}�pu��y�"̉!�-�"�F�
�P�� ��
⛠$=�5��������}��?�DjN^������t�PN�>4N�y�2p����h��� �A�����A�/Jx\�/sy��y���0u�]�T]�6Qw[��*x�u�������8�f�v�6>ͦ�D��Q��-��0h��Ɵo6r@���=��
�^���h2 b}����\��O��̩��_��/��G��W��n4%��Q������0|��R<�(�jtJi�R|6�\���M��� |��` �OT��?H�QX�A�Q)X� G�Q9X�fc���������}
=G�a�{� ��� �R��,u�R�:'X��d Kݻӂ=T(���,u?5����sT0��D�VѰ�`� 6(y�t�7�j�b�w�_Sr�e�o���?v��M�����x'v�&B�_��N�\:�X#t�贩ˮS��lX��y��h� ԣ�.��G3|�L=m��z4�֣,� Mw��hx��h~X���|�I�U����y@:�n�j^�����h�Í�F�,��pj2NP.4�e�Iq���Ir�k��g��N����?�� �M�+�� �N� dO�ga�)�x�P����P��?_(V� )V�])V��)^��,���W� �+��P����P���:�L�S�B� �;�j���k��?C�_����u�����������P�Kg�ꦎ��6��GL]�:Ll}�j[�����gZ�l��������)N����p���Ծ�<
�23�ŞV��,�K�e���������<]?�Ƿ.�MC3������.�M/C�3��nگ61��n�/01��n�ۜ���v5��w2�?�մOa�zP��;���O������E�k��/q������w��˯��j,����$�AX B6�w�$��I��B�ޡ��\fU_VU���~?O��K�n���Nr���V����0���Ww}�kMՋ�#�hh�;�?o� �F�����r�5� Ml�v5[����VW���\7R�|�9y�$[oQ�����s6��r)� I�t�S�[�*�NN�ܫx���)�W�v41��^�[�Ĝ�{�&��[ϔ:�R� 6s��� k��6�/��7�)��/�y�?n���K� X�v�X|�lv� �{�/����q��N�����)+�� ��eΝ�oX�_��R�
-^��}�k���h*�;�]�n1v[���|�����!�Ӎ�4�f�2�֚���u� �з�0h5��pGx�!��SM =���=����E]c�&���\6F>p���O���Sƨ��8n�$�J��� 7��f��̢s��e\�s�ߟ}�\� 2����ad~����5F������t#�iF�9���r0���`~����Q�5 Ag�� bd~����}5=G b~�����&��O�A������)Bկk�=��YYf��������Pe��/��mx�]��k>qV�μ� ��9�ݳ��+ -VUs�\vUhu�lRY�Z'`j3|��6]�6�}W��CX�б�jg����N_2u��}�ˁIlF��،��;C���u7��6�1!��r��s� Ƿ =?� �z�y!b�2��c���B���
Ɖ�������V9&b�ܷ[��/*D�_� Ƕ�#�ԛ�A���=�f��E�_��0䥏�j3�� l&�����Fi��G]}NN�;CN<5O ��Xy�{f��c��b��[Z��k/'=�K�W�ͳ[�� �) * �=�&~+�5�)���PȨ����{�0��yʺG�̝k�G6��k �s��Ȗ�i��!ٲu�@yZw��;x��WK+O�6@���PaF�.O5�� 5�Yo�f �Q��į�}��s�*�[~A����+�ۼ8�z�
K� ��Z�P4�p�K�k�$wٰҨ��{D��sT]�Ro~�9K�o���:��Ul� Tyr����6A��m&��HHr�q�
�6�����.��.��@r�@��& T��⃪f��XH �V@ r�� P��"z�����<Ζ�"��]�Ɩ�"��]>�z�H=r�O�M��䆲� %�""�)���$�X��j�����THSB�`��Y��p �~֫E�""}݃��ƈ����ΈHiD�5�U��қ��Li��TGD�#"����H}D�?"� D4�h
� �I@D������Y��� ��l � D4�h6�t ��@D��fM "�D4)�hV� �b���f��S���D49�hv�� ��AD�x���k7�
ц�v���]ӥ(�Kș23�g������ 2[��*�K��R�y�̙�Y�"��0��4�95S���� mNKO1�����0����Ze��/�?�͒
�s���TGȍ��F�v4��=S�/b�M>�l��>c�W��Z�ȕ[.I�[�%�2c�����6�;�m#���U����� ��w��'�r]>�#v}G-v{y�)\�%�Ő9O���9MRsQkJ�tF�Y&�[�
u�pa���.�)����z|2W�'G��.�5\�Ί��>��j���#F�[ ��\L�b���~����~�b�p1�p��R< �^K!�
�0]� �`�.St��Ct��P�#���+ ��L��W�҇��� H�$B�=�
���Ye�1
�QB,E�kb��\�U�Xʀc�=�2��Xe�ͶE R�Rd����R�$K��KH�R�2KQ�Pڔ���)E��@�)E
��hbeP�JQ@HMA#袁V�fP��A)
h�({�6��)����P�C)
h
�(�9������
b)ʣ��I���6Q�Ҋe��U���fq�Q-,��"�uA�i�Rӭ^ ���iq���V������<�lɳ�}$]���?>���Cj��u�̽�p�S�ķ�/��: ����y�a큧\���b��⼇N͍ �P�W��{�ʈ��4{��� ��PV<�?�<�<m�w��qe����?��M��NK2��S��A�b��!���� s�y�o�_r��ΠU�����AZ�u�
������;0sm�c�~�|���� �˯�����,�T!ҖI�J4�e�i*F]�ސ�g4CCm�\��b����o�w�~�m
�y�/ �����s �ga��E���g��_���[s����K�Z�2��_�_�uN�^��N����]�Z�Xh����+�X��D�Z ��M�%�%������3i MD���l�i6�>�-m��?�/���\N���_2��4zw�cΜ���w��搾�^|�[�0e�?�����n]���s�w xZ�_�{���Χ9�
��ۆ��"��\gɷ��Ҽ����$c
/�?��rni^ �="���F��d0 �2|��Z�-9�U�/��y���u� ����3�?�aj��i�搱�_���s�&_��M>�h�m��|�|�T�@��l5Kg�s�� ���� �s�� ��5ޓ�ã�l�[;[�oT���m�l�%5[�N���S�l㩽����}g �Pɵ��{�+T���b�b�jU�?S�W���L5� �&݄U����:����h������kSi%dpK��<�w؝����w(9Ģmb A��(ID�&"J����E�Z�н+(h]d��� �w��t��#��;���p������C�]xG@[z^tG���_� m�y� ��y� ��y� ��� �:���y��}��� �����P�u�{�s�9
�o��AV����|�=W��r��A���ޖݪ]�,�Z�W�\�=��k{� ��Y{A3���3�Pw�l��D����Ԡ��a���F��.-45>���x����4�������������B
'�p� ����^�!N� �}J1�U;�7\�LJ7[.��2�=�L�z���"Q�X�$�~���0J��ls�8���� �?P�Ii�m^�s�� �_�m�% ��9~`� ����Ag��q�6�n�� Y���44;�7-�/
��4<3U�)% ��F6"���Y��Z��,�T�k\�u �L�����u6�O�Yly3�ν���F5<T�Ł��U���U�U�U�U � U����� T-
`@�A�(�5�@�8[ ������@ƽ��;�qom�d�[������{kw ��ڠp{s�-���,�qoi����,��dz@f��3���� ՞2� d���
(�*P t`L�H D�"�)��4AD�]�2�@D�"�)��4BD*!"��R�H+D�"ҋLP iFJ
T#�!�1�J�p��dL��/��8��_�5ǒ�ݷ��q��D �{���z]a� ߜoNQ�oI0gXR3�H��P��g��%�/���NK��������|_S������?Қ�5՟����
�ř���ymm�"���n�NK7g���u�?�p����ǀ�s������o8�9�;E��hk^��?]��F��}Y��\��>����W ����X\�qSh�E� lCYD.h�NJ��2��g_���Ű~ �4�J���gdY��|����� �\r��/ʿo�y��{�Q��O(�����<q�ߜ"�a�����B���S�ݗ��s��~\��_ ���_ �e�������x�u+��oq�z�
_��[<���9�թ\x��b��\�+�b��\�/�뇉���&F.ԉ}��%'5�t��.Ƥ���L���?�]1��Q.�����q��
:�8�i7��b�#s�! �f �iI�8l� qx�hqD�1apqd#�8�[3�{|V�T�j5��n���ܸ������k�b�f�uV���3 �4B.����}��c�Lt]A����T��X��\��`��dx���ʆ* !( �x��|x�"�⁊��ʈ�
��J������IFTRDTT<PYI8��x��"�����
LJ�*2 ��x�B#�Rお��ʍ*8"*9"*:"*; PxDTzĻF��k�W�I��N��V�������4����o,�P ���֓�nkY���o�`�%$�fQ�,��X��fF��B���/�m���/��?p��v� ���O�?':3C��4O |�q!��<d�M {T�x�m}��+�,���g���<�"�"�"�"�Q����Pr�l3Z�M����?&3��6�E]e�]���9-�-s�lsZ�_� ��g���
��x�r�q��</n�Y���6,T�R���Y�w�����Ff i�T���&Cu�;,�g,|�f��kq��bd0tj0=uj�j�6��A�'�fL4�x��az}i����S�����G���'�r2S� �R�B5N�2V���?~b|�5%�;�/��j�"�r��ɜ���uv���Os��:�2�ϗ�_U�U�]�T���W��έ��Q/������?/�k��~e������Y�W, 5VY3�^�]���z��q���GGٛ���h�j��ّq��K��[l�4���mo��ʨ�WQ�:���M�+�C�1�krJ�>�s��s���/8:~����� �?x�������Wٻ���|��ݟ��I�hW�5��Z!è�:�g�W�6�|�V�c{8W�~����w] =7|��#⡃��/�䈜�I�g�Q�qć���� Ѻ����;��{��O����� [g�1��
�?O7ܖ� t4��g �jOc��*�!�� CWl���?s �#هw��8b�՞P��qt�9��� �1 � 7 U�X)�&��o�Q� @�up�
>vT-(8#�s���'��rU�AK�!�[�ֺk�X�� �QEAMQUA]QeQmQuQ}Q�I�� U¿��Do T��Q�VT��"������@ͨ,�Fe)P7*K��QY
Ԏ�R�zT����� ��@
�,�He)PG*K����%��@5�,�Ie)PQ*K��R�T��R��T�����-��@u�,�K�T��T��T�Uf�O��JSy
Ԛ�R�ڈ�ޔ'����Sy�;6�՝�S�٨FT{*O��F5��SyjՈ4 T��Ё�S@ *O-�<�a#� T���F4"M�*T��Py
(C�)�
���:T��Py
(D�)�u��Jԝ:Qw
(E��"�BDz���E�o"uA>����S����%���������S� �9���3��T���
��H�|���[�rW���n ^��q�����*���U��+�l��������UB��U>i*V���X�Š�v��W5�j�8�՜{������=��?������;cW���\��I\��s
�p�*��N��pM��M_�(6�����~b� Ab˴�b�'�p�1s���a�M�\ی �vm���<�u���u켙�x�
��ů�� =�u9�S�u��ub��q\��{P ɍ��Y�f�XQ;j!�1Ԑ��[�
q����[7.���b��{n�%���E�X��{U
1�\��?���u\����A.&r�ط��_��b��8.�ʫ\�� �~���7��{sG��J54�v �{��%4]�{@5�Oع��\-4]Qx�rT�� \W��U�/��s+�g�0'�!!*"*"*m� �E�(E�`��Qd���* ��(T:�X��Qu���-��JH�Ho�����j������x��⁊�*+ ��x��⁊�*/ ��x��"S�
��"Ph�`@� �Е&�&�H��"Pt�d@�)���H�I6��"P~�d� � (�"Pd����� bP$�`
���9��5�f�s$ k����H�`�d6�C� �" �d"�9��5�Z�s$k�q� �E� �" E2@4�d�l� �(�YE{rH<�d�|�Ѷ�9; !k�=Hϑ�� !)�R�F[ � �I�;�+��"�O�\��� a��E��"�5�3
=�����To �U�7{���o�2�˗������*r�f�`P(�)����ou��kx����U�F�3��Q9�rs�1��ח���
�����%.�� P`L�6������bk�lP �W��`����*�[��,Y�����/��9����b�蚱�7��KlПO���4��N��7.K�| ď����o��O�w�OZ~��>��}/%�y��8�����i>��&iR�ץ�����R�U���o�4�T�4��{��=S��E���#���V�e���:,��Nj�OӴ�s�������!
��_�3j�.�p��g���4˾��}�]i�� H�mzN�;s�4�yW1�>���*�Ray�cUîj-|�Y�������3�B�ޥ��N�^ �n �~P�
t�j
�'��+��/��3��7��;��?��C��G��K��O��S��W��[��_��c��g��k��o��s��w��{�����������dr@ Q' A/Q7 A?QGQOQWQ_QgQo}����Ցj��� �v��u�wW�h��k�t�D�>��#f��k����^��U+�?�2�?�j"W���n���t�M�j��?��yY9ٹ}GZ�gd�W� �r�w��ߠV+��'�?�6]< *�#*`� �Y�&�jԥ���� �>"�Y�[��Ց�e� �?�|�4��u�?t%���O���Ѡ��k�V �yv_FQ�o�r������� ��P�y�/�Q�>2X������i���C����Pe�����z�ί0r��~��2���:�ɿ�C^ڠ ��4�Ձ �7[�9�l�����J��2x ��� - ��� F}������jQe|hU�"}8���� c��:�7�-����K�����:'���� ��ʪ�G?� ��
�ИCRbP/�FqV,t�l�3v�V�9#Xx���4o���[a���"��[b�_�b�?���w��J,��W �S2��!^}����թC��?�Q���9���ޓ�M�N_b��^Y��/��}^ ��?~����q�]{�b�W aD��
-�d}��f��F�� M<��;���Y�6T_�7�i�� �A�7��_ySA�z���19Y9VoM�)�'-�Ԕ�qR�?^bL��a͘��� E��ȿ �?1g�#�kCK�
S��p �X�ye��'�ê+m�S�^oP��FvX�o�I� ��Jl; ������e#����5cZn��'�_m���B5�o��%��R���+=�5|��k��+��9 ��7W[�8��Lɘ�����? %��)��/������{1d�S؏�-�
��:(��xb�~G���1K�w>���K)��;���4�% �_�� �)�����s_�>w�Ň���DK3\�r� o�*�����z�/��%v��K���f�f����Y���+�}����ܜ�q�&�uM���k�t��_U�{9��^{���_�Q��O�/J9� ����[r�7����*� ���y���\���o��҃=�S3f����� ��5#7#�'�]X�?q�w��~��W.��� |�q�Ec�/�j6+�Q'�\�-���np�G� Z�W+V�W�s|eBxu����G�y�=):�r3�ٹ��� �?
�e�g���9;)�<��R����C���΄��9�i3S��do�;E�L��ͩ֜T��&�ׅ������r]�5�?��6�A� ���NJ�* �]z_j|f���Mj�s��l�{|�+V�-�H|�9��U�V����|�� |ۈ~|�n�}�|�����1R�_C�Ng�K�?n(u�]E�������K� �Br�I�W$�<p]�w���O���� �pu �l�~���2]�^ ��D)b}��ݞR��(�ϳ�%㤶RԂ ���k���
�QP��E:V�`{Q�7� ~�H�ܻ�F9=�ETR<GEEDeED�%��0����� � � �� � ��$@D" "��H
D$� �s͑(�HD$ "���C 7����$BD"!"��P�H*D$"� FNH��l8�l8�xW� ��Rbs�s�X���M�
`��]b��P����/���-�� �&�)6>��7��Ap���6�i�glj�5-�\��^��S�K������]��s�8� ��2=c�U2�����#���b�N��H��u_�sv�O������S������s�����I;��u�2TT��p�ipV����ނ ��?z��>c��D �w��Y`<d���I��M�o�7�y��نu��U- �n��=�V�
Fբ�փۤ�����݀ {�j'� 4-� �{�ة��t�sG��]�lstu�Rw[��l_��n !�"�zx�C3s�]�k�Q7f�=��٨�n�_�1�5d���1��n� �V1��������bM��n�#Ww6��_0�_���e!�|���QGL}����~���a�C�;���ovZ3T��p�s�|� P,頙=��U
��B��+yL�A�y��h1G��Թ& jK/�X�T�Y��lCD)#��Qڈ(qD�:�t�'�#� � �& �6 �F �VP�4�`�(O�*���P4�
0�-T��� h
`@s� �C� *�tf�?�&Q��
0�Q��UTx�"� h`@˨ �F�6*���Q��
0�yD~�>*��R��
0��T�m� h$!h%"j&!h'`@C� ZJ�T*���R4�
0��T�ͥ h/`@�ɪ�S4�
0��T��&�&j�f�v#����S4�
0��T��� h=�j�
*���N�f�b�o]���_z�_���s �?��lq���5���)�{\ʟa�.�+�l���c�P�����/��Ӊ�:�G�ug�t���!� ���``3�a�?�F��ʍ�435����4�� ;����i�Ŏ ���:�Vϯ1��~�[��S�� �m'?�l�Cn?h��C���]R� �y]� ��|�I����]ߟ)t;���� ��k�L!s{ �ǂL��1��z����%�?l�wl!�vSX�9��Ag���� W69{��)��BrFl����Z���~ �y6�i�Y+D-�j� �P�Ia��.��7��� <�{|�<���9� �
�q+f �?њ����Q�4t\ ��o�a���y'L#�WF�cJ�rV�_au6@Nl��3q�y�?�8Ǯ�-�sz�s܂���OpNHY,'�4:���������E�Ĵ>�������֦ԋ����Mi�� �Ϛ2^����<�M�<rƙ5����y�3gd�ly��T�1ٚ��9��V9w�g�?G���L�O�&�h<�4�Dž� 6�Zy�0�DwӜ�c����Ms'��=������w��Ȥg��� �p�a߄2h�g ���刨��\@� A�Q�Q�Q����Dd"����@DfP�
�A�*`5��%Ԥ�P�l� �b���9,V:MϑA+�(V&Q�l�X E���b%`�J�.���a#˨IL#�Q��#�Q�̣X �G�0�b%`!�J�D����d(��++Y��=Gv�f�az�,e�*;=G��f�Az=d-kVm���^֬��9��5��� �̚U � Y͚US��#�Y�j����Ԭ��)p��)F��)V @�X���P�
�5��"P�
�5��2P�
�5��BP�
��1X
B�Ԥ�AV��T`9w���hA�YV��U`I�Yք�U`Q�YV��U`Y�Yօ�U`a�YV��U`i�Yֆ�U`q��P�
,!X jR�"+D�*�DԬkD�*�HԬ�D�*�LԬ�D�*�PԬ+E�*�TԬkE�*�X�`��I���4�+Z0�_ђQ�j%�+Z4jV�e|E�F�*�nԬ�k,\<
��ذ�vWw��h�kJٮ*��bp�'��n��
%��P�6�����^�y ���W��Q��z����/IY ��Y ���7�,���9�+ !V���y�ώ�{��
�]W=�<�c�7�L�X<�� u��1e鐲t�S���ҡ��6�
+�
�xsJj���?�AS���S����j���8�:o��߲s+���->���ҊW��/W��Uvs��d�WG��d�'�mی[7�UnC�Uq���W���mzA�m�����^]<��bQ��Y����ojNJo�D|�`���Oo�����{�M�UY��� �p;f��>H��v&��v��'����鹎ۛ����������� ~=�;�;p�����'_�= � �9�r�j�?���x$�=wdc^�s��|���ёU��KF� ��� {`�x|�q���{|����S�i� �ն�O��F��w��'�NS�ڲ�~z�|���r������_'��� ���~V��~�Mu��fa�o�wR{���� ���~E�Ç��9�����g��zȮΟ������ԿL|�~i�&��U�_u�������^�j���D� ��5�m��z�W{A���v�4�&4���\� ��gS��/.�&�m{���|�֣Z�� ����((�� ����� x������>��&ſ��� ���<�䍻�G ���\28� �M7� <-�i���� &���,�$DkH�""ZFD���h!�J"��DDk���&"ZND���`Aъ"�%EDk���6������+յ��"��EDKK�-."Z]D���h}�#�FDK��֘�
�E��`�i� XfZ+ ֙���&+Mk�R����`�i� XmB�ܴf �7�Iv=Њ�%GDkN �:!XvD��`�����GDkO� �Z}� ��#��GD��^ =!xD����3�$K���!�K ���Qw�-�c ��@Dρ�ރ&^�AD/B�� "zD�*��Yh E�.��a�� ��ADo�� �"z D�>4i <"z!D�D��� �� 3��g��x'�����x)ʸ�S�.�~Ϧd�Jƭd��q+a���?+
�Q�r����`P��(��.�o�� �_,=��ۊ�I��_%�����j�qޖd��_RYZ ���&�aim�����
��K.�̿���#��6E�?؆u�"~�%RzͺV�jRIojӥ�j#�U��O{�m�>��{k7������^� ���w�X��>�ߙ8��է��;<����5~o�>i�gW��q��#���� x=�?p�� ӹ�'�� � ڙ& �n��B:���l\�9�?�9' ـ?�dwL;�;��*���� �?�q�I���O� 1���0���U�g߭6�|;�xj��qz�RǗ��w�Os|eMq|�<�qfx�7�a���N�sm�8�7�g�����핎��~hl���j� >��x� �7�4���!�O�o̟���d�� �Fls\�y��n�㷶�:~�':��8��ǥdG�g;� n��^�O�s
R���R݄�z}�I�C�����ְ��F��5�t���{��lMw��5�v@�|�6U���Z.Y�j5�Q�*ST� 7U�fp��m�U�n}U��U jtPu f�k���Y�����l]v7�)���%��Z��M ռ�!��GG|�.r�9 ��������)3�����st�\�x\����K�eH�O��I,�ɕ�/�X��F�?D����X��R��<K�-� �$K��X��R��<K����d���<K�w�,�7�,��"�Կ
�R�E<K�#%����XꯒX�.����d�Ɩ�� �,��ͳ���R��9`��/�Y�?�g������%����,��g��>���W$���1C�R�y<K�s��f�:Ó�z�g���R�� K���X��Y꿀c��� ���Կ�R�I K��3|��
>K���,��hd��i#K��Y��`������,��3����`��RK��w������)���t�Կ����a��wr�Կ������,�70'�R�Ƅ�LX����?Y���R�CF���od��f#K�mF�� p�������8X��R�G ,� ,�������K���,��'��� �Կ��R��£�"��b���6��oc�� �q�������l,�_ec��K����D����������X�/�X�?U�R�dK�G�X��W�R���� T,� fc�����:K���X�����Jꯤ�J�q��L�Dj"��E��;���h��x��)���3��{��� �aaZ��91�]�����������_Y�����9�"��oKjҨTkJj��_v� ��$\�������^��ܵ��% _�:�;����w#�)Q2����<ܞ��%�;��,� �z����)g�7��+ӛp�c�Fa.j�5c�9ī�Q�����e��r�BFVrޔ�<?�a:m������t��Q�QӲR����l�Fo���=�bfNnn����P^��k�q �k���?�a����u��o����V6�f��*��\�4g%a� ����Q���R�����j�g�N��ASu��\cW
S���ʵ�q�~)P�N3�Yt^����Y/}�PPWg�/
�&�u�?�q�e�&Us�&��������gj~4Kn��\g��O���ڊ �R�*�G�4Wq�a �I����J(ӵ� M��ׅ�=pm� �5�?�[�V�x��!�uC�kGQ*\?B����u�>\K*����;\S*��u��;\[*����;\c*���]��ZS�} �%�9��;�]���S��*�%e@ew���ATv?�v B�PY�Kr �'�ʮ>����ds���?��k����?�b�+�Ϋ!k��$��%⡕9�Ïd�G������>ɪ4�]Hn��sDԈR��*��4�Y���[�o�*�6� o����v�� o�+�{
�g������o���|���jV�-��x�M9�ܜ�!9�s| ����V�����7���a�L�tE���x�0��;���5N��b�7�?$Ü�͟�f��`
�W��b����4'�������Q�����)~T������O��������~!��P�V�9�?.#{Z�y��O� �S�_���?��"�r���<k��K� �7h������iy
��w�i�)������J�� ����}+u-��ܽ��;�����I�2λ�O��J6OK����c�
���W��b�Y��f�� ��c�?������fk� �_�Q�_��5'�Xs��c/���t���3�˛ �?�'�?_��?E��+��b��o��S+��<� ��fNɘ���'�C���<�s��k
��� �?)�/7����������/��k������֤�iI#���|/��P�F�9�?jZ�ٿ��*�/O��@�� �A�a���"�r��sNRBN���aZV�S�/'��3C��������bSX�9�HN�y��t0���C�"��`o�2��e���kjjnν��Y�G���S�V?�>T�ȿ � ��m�b��/��(���?ڜ=9/�� ��*�/7�g�����a����O���p���ZSb��V��S.�
VlWq}�1�u�P�o+?ɳ�z>[���e�l�/䳙�C-�3��|�T���j��O��S�U�d�W��W� �_s ��#�Xj &� �X����S�P�� *ܹ�=<6s�X�| W�{CU��U�ι�x�@@ vN��K`�c����p�
�?y*��Vz���^'D�\' �=GB�9M/� �<�r��HD$ !�_�C�AD�$BD"!"��P�H*D$ �(\e �2�,�p�M�/~ ��)?[8�F�_��p���1�[�q���u�k����>��+��(:p���K��==�{W
{�h#�u�|�����C/5�}А;t�� ^��, 坋��G�
�cC
5�~�_k�FK�
)�|nSK�5=��Ft�oI~��A� "vZ:v�D��̏������{ s���U�;I+h8���&3��F�悘�]V2�fw�캍���}Y<#�1��]F���&`.��̕)�%c/���^�p�h/S���p �R�ަp9ioS��4�.+M��KK�P��RD��"B��¥��.7�.9��:�H�I>��Q,��H���H(���EB� '���u��?.�l���������:�@���%�I7gg�NKγ��C�Gk�(�������r|�]���0e�������)���7��&�'���~Q� �:o�!�� *� ?���=�9 r�w�z�?�&-P�v�y]��bh��%}������RX�Ű�)���=^]-�ܓ#�Z�@�ؼ��=u��h6�g�|ޘc�z���C�\L�X�oH}��_����~�^�����8`gGiৗ�Ak�Iqo~"��)�ɷ�!ɇ���>#��7KÄ7��m�J#�Os �7�#U���?H�h�8�X�D�7��~��5w��~�K���S���B%!#@4�6���'�CJ�[L��4���ܤ�ۤ��wq��>�3���&�x����".s�s|���\��y|���%��O �.Z����zs�����ļ�Q��j���n+�,_��.P���1q���Ҝ�?q�eW��������S%o� /�j��\�ѐ� :�M�w=
�c�3u66w��'�=ƴܶBMp+T��q3n4݁2P6�%��Q-��jɠx�?P>�%�R-��jɠ�TKe�Z2($!(%"*&!('ՒAA�� JJ�dPT�%��R-y3e,��TK~�-�C�Zr��VPbʠ�����LTH}�I�RS�M�M(8"*9eR��TKe�Z2(<ՒA驖 �O�dP~�%�� $�Z2�j�@�%!HN@
�%1`=���w�HB�d
Ւ_f=$ Ւ f=$Y�)�G��Zr� ��� �zH(�%�c=$�%�#@� g=$Ւ�� �j�+X� �G��9�G��Z�8�#@"R-9����TKn�zHL�%� ��,� Q��TK�R-y � q����e�H`�%��� D�Z2�����̶��_v���]���P%�w��fK^����ч��*�?����e&E�3�|��[k0�X�c��O��}�{��y��6 _�~�.�h-π�s�w�X�m�
���-q' ���g-��.� ��f3U}�f�<�2��`6�~۰l�WچgN���e���m�����#m#����#�F�\�6�[�m��# ����FUb�U�*��eۘ��1�Tc߬`��
�=� �{>n�gk�w8�6��t���&�� ��m��JZ~R%$�Q �D�`�c3��-��v���?���]�J��6�Y�-��J[�ϲ*��h���m�d۔3l�{橲�ٲכU9�6����a�T�I�U�4�T�������RMik�����Q;�6�yL5���Y���ه���<�ݷn�j��-�y��*������
#��k����5 �/�L��ȣ��9j a)���Q� �D�D0h��U�`�.
�A�( -#M#m��4���c�<B�>
�A A A�z�6R� IZI����IJ4h)!h*Ҡ����t�@k As A{)�
&-�@4���n�hB�jB�l
�A�)
'-'M�� ��r�xB�zB�|
�A�)@P�,�� ���l�� A�y vݐ�;(@��>7��t`
�
Ё1�k(@�P�� D:��t`�&2�(
́U��,
́]��0
Ёe��(@�Q��� XG:0�t�b_<Q���:
��_�4sr�9{�����N�ӗ���U����/2 �s�O �sŞ����č���]�=��B����ǎ��Z��8'_��0V(9[��ӗK�((����| ��ܽy<gK�\�+�_B�3|@���dl��FZ;��F+ @�Q�A�vU K��ħa�?��"��b�'��a������X���<��� �����֜������k��?�P�����W�u^�[R把 ������o0f���2�����_�b����g48v�z��e�Ks�|� x�4�n�!� kN����N��Y��Θ6͜�F�:���/���Wt}y���_v����̸����產���b5�����{�}|J<n��3���8�� 4z���Ze����_�:�uP+Փ�� �-�9��i]��ܺ�C���Z|�O4�^�� �w��^ �̹����+���6�W���~�}�^�_}ô���E�e��Gn�l�[�o�^mz��[�?v���s�Ic��XS�����Q��v8�O� �~5������,�����C�8w��ݛ�2��_���;� o��>�p�`�C�����!=��J])8H���U b �@MKg�
�����+��W��("^UB���xu�
#�UF�+M���F�+��W�6!�+O��էM@� H�$A��4A"�(B� "J�$��RBDI!��Qb�(5���Qz�(AD�""J�IED��dQ�� a* ��� �FDi#����:�:�Z���� }ZH�5
��=Oa�� �������g����\����O�H�l�����:e����A�Y^������jJ���+���\�5Y�'�ԝ4�R��i�F����Z��nj�W���E�g�"��9|A�R�([��$��g�3�2n��^�t%�3����|���/<ڸΛ"�qc�gcg�?�i7ˊmK-�9�\��e��K�MX���X#u���kf
�_��O�ڷ*[�T��M|G�y5� �DZ=A�Y>��b9{�8wi�=� �c���<�)W땾��g���1|��1�z���Is�C�ؾEvCM����*xR�Re��p�:�W�h���{�I
�o�{Lx������m^�����iʦ�({n �א�#"^KD��� �5�-��R�-"^_D�Ɣ5�uF�kMכ-�a�ם�}�
D b�h�v��Q �(D� ]I�
�l�]D��`�"�
��l��l�"���S*;�(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�r(�]~�?t�W� �
dateutil/zoneinfo/rebuild.py 0000644 00000003231 14751155147 0012217 0 ustar 00 import logging
import os
import tempfile
import shutil
import json
from subprocess import check_call
from dateutil.zoneinfo import tar_open, METADATA_FN, ZONEFILENAME
def rebuild(filename, tag=None, format="gz", zonegroups=[], metadata=None):
"""Rebuild the internal timezone info in dateutil/zoneinfo/zoneinfo*tar*
filename is the timezone tarball from ftp.iana.org/tz.
"""
tmpdir = tempfile.mkdtemp()
zonedir = os.path.join(tmpdir, "zoneinfo")
moduledir = os.path.dirname(__file__)
try:
with tar_open(filename) as tf:
for name in zonegroups:
tf.extract(name, tmpdir)
filepaths = [os.path.join(tmpdir, n) for n in zonegroups]
try:
check_call(["zic", "-d", zonedir] + filepaths)
except OSError as e:
_print_on_nosuchfile(e)
raise
# write metadata file
with open(os.path.join(zonedir, METADATA_FN), 'w') as f:
json.dump(metadata, f, indent=4, sort_keys=True)
target = os.path.join(moduledir, ZONEFILENAME)
with tar_open(target, "w:%s" % format) as tf:
for entry in os.listdir(zonedir):
entrypath = os.path.join(zonedir, entry)
tf.add(entrypath, entry)
finally:
shutil.rmtree(tmpdir)
def _print_on_nosuchfile(e):
"""Print helpful troubleshooting message
e is an exception raised by subprocess.check_call()
"""
if e.errno == 2:
logging.error(
"Could not find zic. Perhaps you need to install "
"libc-bin or some other package that provides it, "
"or it's not in your PATH?")
dateutil/zoneinfo/__init__.py 0000644 00000015133 14751155147 0012334 0 ustar 00 # -*- coding: utf-8 -*-
import warnings
import json
from tarfile import TarFile
from pkgutil import get_data
from io import BytesIO
from contextlib import closing
from dateutil.tz import tzfile
__all__ = ["get_zonefile_instance", "gettz", "gettz_db_metadata", "rebuild"]
ZONEFILENAME = "dateutil-zoneinfo.tar.gz"
METADATA_FN = 'METADATA'
# python2.6 compatability. Note that TarFile.__exit__ != TarFile.close, but
# it's close enough for python2.6
tar_open = TarFile.open
if not hasattr(TarFile, '__exit__'):
def tar_open(*args, **kwargs):
return closing(TarFile.open(*args, **kwargs))
class tzfile(tzfile):
def __reduce__(self):
return (gettz, (self._filename,))
def getzoneinfofile_stream():
try:
return BytesIO(get_data(__name__, ZONEFILENAME))
except IOError as e: # TODO switch to FileNotFoundError?
warnings.warn("I/O error({0}): {1}".format(e.errno, e.strerror))
return None
class ZoneInfoFile(object):
def __init__(self, zonefile_stream=None):
if zonefile_stream is not None:
with tar_open(fileobj=zonefile_stream, mode='r') as tf:
# dict comprehension does not work on python2.6
# TODO: get back to the nicer syntax when we ditch python2.6
# self.zones = {zf.name: tzfile(tf.extractfile(zf),
# filename = zf.name)
# for zf in tf.getmembers() if zf.isfile()}
self.zones = dict((zf.name, tzfile(tf.extractfile(zf),
filename=zf.name))
for zf in tf.getmembers()
if zf.isfile() and zf.name != METADATA_FN)
# deal with links: They'll point to their parent object. Less
# waste of memory
# links = {zl.name: self.zones[zl.linkname]
# for zl in tf.getmembers() if zl.islnk() or zl.issym()}
links = dict((zl.name, self.zones[zl.linkname])
for zl in tf.getmembers() if
zl.islnk() or zl.issym())
self.zones.update(links)
try:
metadata_json = tf.extractfile(tf.getmember(METADATA_FN))
metadata_str = metadata_json.read().decode('UTF-8')
self.metadata = json.loads(metadata_str)
except KeyError:
# no metadata in tar file
self.metadata = None
else:
self.zones = dict()
self.metadata = None
def get(self, name, default=None):
"""
Wrapper for :func:`ZoneInfoFile.zones.get`. This is a convenience method
for retrieving zones from the zone dictionary.
:param name:
The name of the zone to retrieve. (Generally IANA zone names)
:param default:
The value to return in the event of a missing key.
.. versionadded:: 2.6.0
"""
return self.zones.get(name, default)
# The current API has gettz as a module function, although in fact it taps into
# a stateful class. So as a workaround for now, without changing the API, we
# will create a new "global" class instance the first time a user requests a
# timezone. Ugly, but adheres to the api.
#
# TODO: Remove after deprecation period.
_CLASS_ZONE_INSTANCE = list()
def get_zonefile_instance(new_instance=False):
"""
This is a convenience function which provides a :class:`ZoneInfoFile`
instance using the data provided by the ``dateutil`` package. By default, it
caches a single instance of the ZoneInfoFile object and returns that.
:param new_instance:
If ``True``, a new instance of :class:`ZoneInfoFile` is instantiated and
used as the cached instance for the next call. Otherwise, new instances
are created only as necessary.
:return:
Returns a :class:`ZoneInfoFile` object.
.. versionadded:: 2.6
"""
if new_instance:
zif = None
else:
zif = getattr(get_zonefile_instance, '_cached_instance', None)
if zif is None:
zif = ZoneInfoFile(getzoneinfofile_stream())
get_zonefile_instance._cached_instance = zif
return zif
def gettz(name):
"""
This retrieves a time zone from the local zoneinfo tarball that is packaged
with dateutil.
:param name:
An IANA-style time zone name, as found in the zoneinfo file.
:return:
Returns a :class:`dateutil.tz.tzfile` time zone object.
.. warning::
It is generally inadvisable to use this function, and it is only
provided for API compatibility with earlier versions. This is *not*
equivalent to ``dateutil.tz.gettz()``, which selects an appropriate
time zone based on the inputs, favoring system zoneinfo. This is ONLY
for accessing the dateutil-specific zoneinfo (which may be out of
date compared to the system zoneinfo).
.. deprecated:: 2.6
If you need to use a specific zoneinfofile over the system zoneinfo,
instantiate a :class:`dateutil.zoneinfo.ZoneInfoFile` object and call
:func:`dateutil.zoneinfo.ZoneInfoFile.get(name)` instead.
Use :func:`get_zonefile_instance` to retrieve an instance of the
dateutil-provided zoneinfo.
"""
warnings.warn("zoneinfo.gettz() will be removed in future versions, "
"to use the dateutil-provided zoneinfo files, instantiate a "
"ZoneInfoFile object and use ZoneInfoFile.zones.get() "
"instead. See the documentation for details.",
DeprecationWarning)
if len(_CLASS_ZONE_INSTANCE) == 0:
_CLASS_ZONE_INSTANCE.append(ZoneInfoFile(getzoneinfofile_stream()))
return _CLASS_ZONE_INSTANCE[0].zones.get(name)
def gettz_db_metadata():
""" Get the zonefile metadata
See `zonefile_metadata`_
:returns:
A dictionary with the database metadata
.. deprecated:: 2.6
See deprecation warning in :func:`zoneinfo.gettz`. To get metadata,
query the attribute ``zoneinfo.ZoneInfoFile.metadata``.
"""
warnings.warn("zoneinfo.gettz_db_metadata() will be removed in future "
"versions, to use the dateutil-provided zoneinfo files, "
"ZoneInfoFile object and query the 'metadata' attribute "
"instead. See the documentation for details.",
DeprecationWarning)
if len(_CLASS_ZONE_INSTANCE) == 0:
_CLASS_ZONE_INSTANCE.append(ZoneInfoFile(getzoneinfofile_stream()))
return _CLASS_ZONE_INSTANCE[0].metadata
dateutil/parser.py 0000644 00000143373 14751155147 0010252 0 ustar 00 # -*- coding: utf-8 -*-
"""
This module offers a generic date/time string parser which is able to parse
most known formats to represent a date and/or time.
This module attempts to be forgiving with regards to unlikely input formats,
returning a datetime object even for dates which are ambiguous. If an element
of a date/time stamp is omitted, the following rules are applied:
- If AM or PM is left unspecified, a 24-hour clock is assumed, however, an hour
on a 12-hour clock (``0 <= hour <= 12``) *must* be specified if AM or PM is
specified.
- If a time zone is omitted, a timezone-naive datetime is returned.
If any other elements are missing, they are taken from the
:class:`datetime.datetime` object passed to the parameter ``default``. If this
results in a day number exceeding the valid number of days per month, the
value falls back to the end of the month.
Additional resources about date/time string formats can be found below:
- `A summary of the international standard date and time notation
<http://www.cl.cam.ac.uk/~mgk25/iso-time.html>`_
- `W3C Date and Time Formats <http://www.w3.org/TR/NOTE-datetime>`_
- `Time Formats (Planetary Rings Node) <http://pds-rings.seti.org/tools/time_formats.html>`_
- `CPAN ParseDate module
<http://search.cpan.org/~muir/Time-modules-2013.0912/lib/Time/ParseDate.pm>`_
- `Java SimpleDateFormat Class
<https://docs.oracle.com/javase/6/docs/api/java/text/SimpleDateFormat.html>`_
"""
from __future__ import unicode_literals
import datetime
import string
import time
import collections
import re
from io import StringIO
from calendar import monthrange
from six import text_type, binary_type, integer_types
from . import relativedelta
from . import tz
__all__ = ["parse", "parserinfo"]
class _timelex(object):
# Fractional seconds are sometimes split by a comma
_split_decimal = re.compile("([.,])")
def __init__(self, instream):
if isinstance(instream, binary_type):
instream = instream.decode()
if isinstance(instream, text_type):
instream = StringIO(instream)
if getattr(instream, 'read', None) is None:
raise TypeError('Parser must be a string or character stream, not '
'{itype}'.format(itype=instream.__class__.__name__))
self.instream = instream
self.charstack = []
self.tokenstack = []
self.eof = False
def get_token(self):
"""
This function breaks the time string into lexical units (tokens), which
can be parsed by the parser. Lexical units are demarcated by changes in
the character set, so any continuous string of letters is considered
one unit, any continuous string of numbers is considered one unit.
The main complication arises from the fact that dots ('.') can be used
both as separators (e.g. "Sep.20.2009") or decimal points (e.g.
"4:30:21.447"). As such, it is necessary to read the full context of
any dot-separated strings before breaking it into tokens; as such, this
function maintains a "token stack", for when the ambiguous context
demands that multiple tokens be parsed at once.
"""
if self.tokenstack:
return self.tokenstack.pop(0)
seenletters = False
token = None
state = None
while not self.eof:
# We only realize that we've reached the end of a token when we
# find a character that's not part of the current token - since
# that character may be part of the next token, it's stored in the
# charstack.
if self.charstack:
nextchar = self.charstack.pop(0)
else:
nextchar = self.instream.read(1)
while nextchar == '\x00':
nextchar = self.instream.read(1)
if not nextchar:
self.eof = True
break
elif not state:
# First character of the token - determines if we're starting
# to parse a word, a number or something else.
token = nextchar
if self.isword(nextchar):
state = 'a'
elif self.isnum(nextchar):
state = '0'
elif self.isspace(nextchar):
token = ' '
break # emit token
else:
break # emit token
elif state == 'a':
# If we've already started reading a word, we keep reading
# letters until we find something that's not part of a word.
seenletters = True
if self.isword(nextchar):
token += nextchar
elif nextchar == '.':
token += nextchar
state = 'a.'
else:
self.charstack.append(nextchar)
break # emit token
elif state == '0':
# If we've already started reading a number, we keep reading
# numbers until we find something that doesn't fit.
if self.isnum(nextchar):
token += nextchar
elif nextchar == '.' or (nextchar == ',' and len(token) >= 2):
token += nextchar
state = '0.'
else:
self.charstack.append(nextchar)
break # emit token
elif state == 'a.':
# If we've seen some letters and a dot separator, continue
# parsing, and the tokens will be broken up later.
seenletters = True
if nextchar == '.' or self.isword(nextchar):
token += nextchar
elif self.isnum(nextchar) and token[-1] == '.':
token += nextchar
state = '0.'
else:
self.charstack.append(nextchar)
break # emit token
elif state == '0.':
# If we've seen at least one dot separator, keep going, we'll
# break up the tokens later.
if nextchar == '.' or self.isnum(nextchar):
token += nextchar
elif self.isword(nextchar) and token[-1] == '.':
token += nextchar
state = 'a.'
else:
self.charstack.append(nextchar)
break # emit token
if (state in ('a.', '0.') and (seenletters or token.count('.') > 1 or
token[-1] in '.,')):
l = self._split_decimal.split(token)
token = l[0]
for tok in l[1:]:
if tok:
self.tokenstack.append(tok)
if state == '0.' and token.count('.') == 0:
token = token.replace(',', '.')
return token
def __iter__(self):
return self
def __next__(self):
token = self.get_token()
if token is None:
raise StopIteration
return token
def next(self):
return self.__next__() # Python 2.x support
@classmethod
def split(cls, s):
return list(cls(s))
@classmethod
def isword(cls, nextchar):
""" Whether or not the next character is part of a word """
return nextchar.isalpha()
@classmethod
def isnum(cls, nextchar):
""" Whether the next character is part of a number """
return nextchar.isdigit()
@classmethod
def isspace(cls, nextchar):
""" Whether the next character is whitespace """
return nextchar.isspace()
class _resultbase(object):
def __init__(self):
for attr in self.__slots__:
setattr(self, attr, None)
def _repr(self, classname):
l = []
for attr in self.__slots__:
value = getattr(self, attr)
if value is not None:
l.append("%s=%s" % (attr, repr(value)))
return "%s(%s)" % (classname, ", ".join(l))
def __len__(self):
return (sum(getattr(self, attr) is not None
for attr in self.__slots__))
def __repr__(self):
return self._repr(self.__class__.__name__)
class parserinfo(object):
"""
Class which handles what inputs are accepted. Subclass this to customize
the language and acceptable values for each parameter.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM
and YMD. Default is ``False``.
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken
to be the year, otherwise the last number is taken to be the year.
Default is ``False``.
"""
# m from a.m/p.m, t from ISO T separator
JUMP = [" ", ".", ",", ";", "-", "/", "'",
"at", "on", "and", "ad", "m", "t", "of",
"st", "nd", "rd", "th"]
WEEKDAYS = [("Mon", "Monday"),
("Tue", "Tuesday"),
("Wed", "Wednesday"),
("Thu", "Thursday"),
("Fri", "Friday"),
("Sat", "Saturday"),
("Sun", "Sunday")]
MONTHS = [("Jan", "January"),
("Feb", "February"),
("Mar", "March"),
("Apr", "April"),
("May", "May"),
("Jun", "June"),
("Jul", "July"),
("Aug", "August"),
("Sep", "Sept", "September"),
("Oct", "October"),
("Nov", "November"),
("Dec", "December")]
HMS = [("h", "hour", "hours"),
("m", "minute", "minutes"),
("s", "second", "seconds")]
AMPM = [("am", "a"),
("pm", "p")]
UTCZONE = ["UTC", "GMT", "Z"]
PERTAIN = ["of"]
TZOFFSET = {}
def __init__(self, dayfirst=False, yearfirst=False):
self._jump = self._convert(self.JUMP)
self._weekdays = self._convert(self.WEEKDAYS)
self._months = self._convert(self.MONTHS)
self._hms = self._convert(self.HMS)
self._ampm = self._convert(self.AMPM)
self._utczone = self._convert(self.UTCZONE)
self._pertain = self._convert(self.PERTAIN)
self.dayfirst = dayfirst
self.yearfirst = yearfirst
self._year = time.localtime().tm_year
self._century = self._year // 100 * 100
def _convert(self, lst):
dct = {}
for i, v in enumerate(lst):
if isinstance(v, tuple):
for v in v:
dct[v.lower()] = i
else:
dct[v.lower()] = i
return dct
def jump(self, name):
return name.lower() in self._jump
def weekday(self, name):
if len(name) >= min(len(n) for n in self._weekdays.keys()):
try:
return self._weekdays[name.lower()]
except KeyError:
pass
return None
def month(self, name):
if len(name) >= min(len(n) for n in self._months.keys()):
try:
return self._months[name.lower()] + 1
except KeyError:
pass
return None
def hms(self, name):
try:
return self._hms[name.lower()]
except KeyError:
return None
def ampm(self, name):
try:
return self._ampm[name.lower()]
except KeyError:
return None
def pertain(self, name):
return name.lower() in self._pertain
def utczone(self, name):
return name.lower() in self._utczone
def tzoffset(self, name):
if name in self._utczone:
return 0
return self.TZOFFSET.get(name)
def convertyear(self, year, century_specified=False):
if year < 100 and not century_specified:
year += self._century
if abs(year - self._year) >= 50:
if year < self._year:
year += 100
else:
year -= 100
return year
def validate(self, res):
# move to info
if res.year is not None:
res.year = self.convertyear(res.year, res.century_specified)
if res.tzoffset == 0 and not res.tzname or res.tzname == 'Z':
res.tzname = "UTC"
res.tzoffset = 0
elif res.tzoffset != 0 and res.tzname and self.utczone(res.tzname):
res.tzoffset = 0
return True
class _ymd(list):
def __init__(self, tzstr, *args, **kwargs):
super(self.__class__, self).__init__(*args, **kwargs)
self.century_specified = False
self.tzstr = tzstr
@staticmethod
def token_could_be_year(token, year):
try:
return int(token) == year
except ValueError:
return False
@staticmethod
def find_potential_year_tokens(year, tokens):
return [token for token in tokens if _ymd.token_could_be_year(token, year)]
def find_probable_year_index(self, tokens):
"""
attempt to deduce if a pre 100 year was lost
due to padded zeros being taken off
"""
for index, token in enumerate(self):
potential_year_tokens = _ymd.find_potential_year_tokens(token, tokens)
if len(potential_year_tokens) == 1 and len(potential_year_tokens[0]) > 2:
return index
def append(self, val):
if hasattr(val, '__len__'):
if val.isdigit() and len(val) > 2:
self.century_specified = True
elif val > 100:
self.century_specified = True
super(self.__class__, self).append(int(val))
def resolve_ymd(self, mstridx, yearfirst, dayfirst):
len_ymd = len(self)
year, month, day = (None, None, None)
if len_ymd > 3:
raise ValueError("More than three YMD values")
elif len_ymd == 1 or (mstridx != -1 and len_ymd == 2):
# One member, or two members with a month string
if mstridx != -1:
month = self[mstridx]
del self[mstridx]
if len_ymd > 1 or mstridx == -1:
if self[0] > 31:
year = self[0]
else:
day = self[0]
elif len_ymd == 2:
# Two members with numbers
if self[0] > 31:
# 99-01
year, month = self
elif self[1] > 31:
# 01-99
month, year = self
elif dayfirst and self[1] <= 12:
# 13-01
day, month = self
else:
# 01-13
month, day = self
elif len_ymd == 3:
# Three members
if mstridx == 0:
month, day, year = self
elif mstridx == 1:
if self[0] > 31 or (yearfirst and self[2] <= 31):
# 99-Jan-01
year, month, day = self
else:
# 01-Jan-01
# Give precendence to day-first, since
# two-digit years is usually hand-written.
day, month, year = self
elif mstridx == 2:
# WTF!?
if self[1] > 31:
# 01-99-Jan
day, year, month = self
else:
# 99-01-Jan
year, day, month = self
else:
if self[0] > 31 or \
self.find_probable_year_index(_timelex.split(self.tzstr)) == 0 or \
(yearfirst and self[1] <= 12 and self[2] <= 31):
# 99-01-01
if dayfirst and self[2] <= 12:
year, day, month = self
else:
year, month, day = self
elif self[0] > 12 or (dayfirst and self[1] <= 12):
# 13-01-01
day, month, year = self
else:
# 01-13-01
month, day, year = self
return year, month, day
class parser(object):
def __init__(self, info=None):
self.info = info or parserinfo()
def parse(self, timestr, default=None, ignoretz=False, tzinfos=None, **kwargs):
"""
Parse the date/time string into a :class:`datetime.datetime` object.
:param timestr:
Any date/time string using the supported formats.
:param default:
The default datetime object, if this is a datetime object and not
``None``, elements specified in ``timestr`` replace elements in the
default object.
:param ignoretz:
If set ``True``, time zones in parsed strings are ignored and a
naive :class:`datetime.datetime` object is returned.
:param tzinfos:
Additional time zone names / aliases which may be present in the
string. This argument maps time zone names (and optionally offsets
from those time zones) to time zones. This parameter can be a
dictionary with timezone aliases mapping time zone names to time
zones or a function taking two parameters (``tzname`` and
``tzoffset``) and returning a time zone.
The timezones to which the names are mapped can be an integer
offset from UTC in minutes or a :class:`tzinfo` object.
.. doctest::
:options: +NORMALIZE_WHITESPACE
>>> from dateutil.parser import parse
>>> from dateutil.tz import gettz
>>> tzinfos = {"BRST": -10800, "CST": gettz("America/Chicago")}
>>> parse("2012-01-19 17:21:00 BRST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21, tzinfo=tzoffset(u'BRST', -10800))
>>> parse("2012-01-19 17:21:00 CST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21,
tzinfo=tzfile('/usr/share/zoneinfo/America/Chicago'))
This parameter is ignored if ``ignoretz`` is set.
:param **kwargs:
Keyword arguments as passed to ``_parse()``.
:return:
Returns a :class:`datetime.datetime` object or, if the
``fuzzy_with_tokens`` option is ``True``, returns a tuple, the
first element being a :class:`datetime.datetime` object, the second
a tuple containing the fuzzy tokens.
:raises ValueError:
Raised for invalid or unknown string format, if the provided
:class:`tzinfo` is not in a valid format, or if an invalid date
would be created.
:raises TypeError:
Raised for non-string or character stream input.
:raises OverflowError:
Raised if the parsed date exceeds the largest valid C integer on
your system.
"""
if default is None:
default = datetime.datetime.now().replace(hour=0, minute=0,
second=0, microsecond=0)
res, skipped_tokens = self._parse(timestr, **kwargs)
if res is None:
raise ValueError("Unknown string format")
if len(res) == 0:
raise ValueError("String does not contain a date.")
repl = {}
for attr in ("year", "month", "day", "hour",
"minute", "second", "microsecond"):
value = getattr(res, attr)
if value is not None:
repl[attr] = value
if 'day' not in repl:
# If the default day exceeds the last day of the month, fall back to
# the end of the month.
cyear = default.year if res.year is None else res.year
cmonth = default.month if res.month is None else res.month
cday = default.day if res.day is None else res.day
if cday > monthrange(cyear, cmonth)[1]:
repl['day'] = monthrange(cyear, cmonth)[1]
ret = default.replace(**repl)
if res.weekday is not None and not res.day:
ret = ret+relativedelta.relativedelta(weekday=res.weekday)
if not ignoretz:
if (isinstance(tzinfos, collections.Callable) or
tzinfos and res.tzname in tzinfos):
if isinstance(tzinfos, collections.Callable):
tzdata = tzinfos(res.tzname, res.tzoffset)
else:
tzdata = tzinfos.get(res.tzname)
if isinstance(tzdata, datetime.tzinfo):
tzinfo = tzdata
elif isinstance(tzdata, text_type):
tzinfo = tz.tzstr(tzdata)
elif isinstance(tzdata, integer_types):
tzinfo = tz.tzoffset(res.tzname, tzdata)
else:
raise ValueError("Offset must be tzinfo subclass, "
"tz string, or int offset.")
ret = ret.replace(tzinfo=tzinfo)
elif res.tzname and res.tzname in time.tzname:
ret = ret.replace(tzinfo=tz.tzlocal())
elif res.tzoffset == 0:
ret = ret.replace(tzinfo=tz.tzutc())
elif res.tzoffset:
ret = ret.replace(tzinfo=tz.tzoffset(res.tzname, res.tzoffset))
if kwargs.get('fuzzy_with_tokens', False):
return ret, skipped_tokens
else:
return ret
class _result(_resultbase):
__slots__ = ["year", "month", "day", "weekday",
"hour", "minute", "second", "microsecond",
"tzname", "tzoffset", "ampm"]
def _parse(self, timestr, dayfirst=None, yearfirst=None, fuzzy=False,
fuzzy_with_tokens=False):
"""
Private method which performs the heavy lifting of parsing, called from
``parse()``, which passes on its ``kwargs`` to this function.
:param timestr:
The string to parse.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM
and YMD. If set to ``None``, this value is retrieved from the
current :class:`parserinfo` object (which itself defaults to
``False``).
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken
to be the year, otherwise the last number is taken to be the year.
If this is set to ``None``, the value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param fuzzy:
Whether to allow fuzzy parsing, allowing for string like "Today is
January 1, 2047 at 8:21:00AM".
:param fuzzy_with_tokens:
If ``True``, ``fuzzy`` is automatically set to True, and the parser
will return a tuple where the first element is the parsed
:class:`datetime.datetime` datetimestamp and the second element is
a tuple containing the portions of the string which were ignored:
.. doctest::
>>> from dateutil.parser import parse
>>> parse("Today is January 1, 2047 at 8:21:00AM", fuzzy_with_tokens=True)
(datetime.datetime(2047, 1, 1, 8, 21), (u'Today is ', u' ', u'at '))
"""
if fuzzy_with_tokens:
fuzzy = True
info = self.info
if dayfirst is None:
dayfirst = info.dayfirst
if yearfirst is None:
yearfirst = info.yearfirst
res = self._result()
l = _timelex.split(timestr) # Splits the timestr into tokens
# keep up with the last token skipped so we can recombine
# consecutively skipped tokens (-2 for when i begins at 0).
last_skipped_token_i = -2
skipped_tokens = list()
try:
# year/month/day list
ymd = _ymd(timestr)
# Index of the month string in ymd
mstridx = -1
len_l = len(l)
i = 0
while i < len_l:
# Check if it's a number
try:
value_repr = l[i]
value = float(value_repr)
except ValueError:
value = None
if value is not None:
# Token is a number
len_li = len(l[i])
i += 1
if (len(ymd) == 3 and len_li in (2, 4)
and res.hour is None and (i >= len_l or (l[i] != ':' and
info.hms(l[i]) is None))):
# 19990101T23[59]
s = l[i-1]
res.hour = int(s[:2])
if len_li == 4:
res.minute = int(s[2:])
elif len_li == 6 or (len_li > 6 and l[i-1].find('.') == 6):
# YYMMDD or HHMMSS[.ss]
s = l[i-1]
if not ymd and l[i-1].find('.') == -1:
#ymd.append(info.convertyear(int(s[:2])))
ymd.append(s[:2])
ymd.append(s[2:4])
ymd.append(s[4:])
else:
# 19990101T235959[.59]
res.hour = int(s[:2])
res.minute = int(s[2:4])
res.second, res.microsecond = _parsems(s[4:])
elif len_li in (8, 12, 14):
# YYYYMMDD
s = l[i-1]
ymd.append(s[:4])
ymd.append(s[4:6])
ymd.append(s[6:8])
if len_li > 8:
res.hour = int(s[8:10])
res.minute = int(s[10:12])
if len_li > 12:
res.second = int(s[12:])
elif ((i < len_l and info.hms(l[i]) is not None) or
(i+1 < len_l and l[i] == ' ' and
info.hms(l[i+1]) is not None)):
# HH[ ]h or MM[ ]m or SS[.ss][ ]s
if l[i] == ' ':
i += 1
idx = info.hms(l[i])
while True:
if idx == 0:
res.hour = int(value)
if value % 1:
res.minute = int(60*(value % 1))
elif idx == 1:
res.minute = int(value)
if value % 1:
res.second = int(60*(value % 1))
elif idx == 2:
res.second, res.microsecond = \
_parsems(value_repr)
i += 1
if i >= len_l or idx == 2:
break
# 12h00
try:
value_repr = l[i]
value = float(value_repr)
except ValueError:
break
else:
i += 1
idx += 1
if i < len_l:
newidx = info.hms(l[i])
if newidx is not None:
idx = newidx
elif (i == len_l and l[i-2] == ' ' and
info.hms(l[i-3]) is not None):
# X h MM or X m SS
idx = info.hms(l[i-3])
if idx == 0: # h
res.minute = int(value)
sec_remainder = value % 1
if sec_remainder:
res.second = int(60 * sec_remainder)
elif idx == 1: # m
res.second, res.microsecond = \
_parsems(value_repr)
# We don't need to advance the tokens here because the
# i == len_l call indicates that we're looking at all
# the tokens already.
elif i+1 < len_l and l[i] == ':':
# HH:MM[:SS[.ss]]
res.hour = int(value)
i += 1
value = float(l[i])
res.minute = int(value)
if value % 1:
res.second = int(60*(value % 1))
i += 1
if i < len_l and l[i] == ':':
res.second, res.microsecond = _parsems(l[i+1])
i += 2
elif i < len_l and l[i] in ('-', '/', '.'):
sep = l[i]
ymd.append(value_repr)
i += 1
if i < len_l and not info.jump(l[i]):
try:
# 01-01[-01]
ymd.append(l[i])
except ValueError:
# 01-Jan[-01]
value = info.month(l[i])
if value is not None:
ymd.append(value)
assert mstridx == -1
mstridx = len(ymd)-1
else:
return None, None
i += 1
if i < len_l and l[i] == sep:
# We have three members
i += 1
value = info.month(l[i])
if value is not None:
ymd.append(value)
mstridx = len(ymd)-1
assert mstridx == -1
else:
ymd.append(l[i])
i += 1
elif i >= len_l or info.jump(l[i]):
if i+1 < len_l and info.ampm(l[i+1]) is not None:
# 12 am
res.hour = int(value)
if res.hour < 12 and info.ampm(l[i+1]) == 1:
res.hour += 12
elif res.hour == 12 and info.ampm(l[i+1]) == 0:
res.hour = 0
i += 1
else:
# Year, month or day
ymd.append(value)
i += 1
elif info.ampm(l[i]) is not None:
# 12am
res.hour = int(value)
if res.hour < 12 and info.ampm(l[i]) == 1:
res.hour += 12
elif res.hour == 12 and info.ampm(l[i]) == 0:
res.hour = 0
i += 1
elif not fuzzy:
return None, None
else:
i += 1
continue
# Check weekday
value = info.weekday(l[i])
if value is not None:
res.weekday = value
i += 1
continue
# Check month name
value = info.month(l[i])
if value is not None:
ymd.append(value)
assert mstridx == -1
mstridx = len(ymd)-1
i += 1
if i < len_l:
if l[i] in ('-', '/'):
# Jan-01[-99]
sep = l[i]
i += 1
ymd.append(l[i])
i += 1
if i < len_l and l[i] == sep:
# Jan-01-99
i += 1
ymd.append(l[i])
i += 1
elif (i+3 < len_l and l[i] == l[i+2] == ' '
and info.pertain(l[i+1])):
# Jan of 01
# In this case, 01 is clearly year
try:
value = int(l[i+3])
except ValueError:
# Wrong guess
pass
else:
# Convert it here to become unambiguous
ymd.append(str(info.convertyear(value)))
i += 4
continue
# Check am/pm
value = info.ampm(l[i])
if value is not None:
# For fuzzy parsing, 'a' or 'am' (both valid English words)
# may erroneously trigger the AM/PM flag. Deal with that
# here.
val_is_ampm = True
# If there's already an AM/PM flag, this one isn't one.
if fuzzy and res.ampm is not None:
val_is_ampm = False
# If AM/PM is found and hour is not, raise a ValueError
if res.hour is None:
if fuzzy:
val_is_ampm = False
else:
raise ValueError('No hour specified with ' +
'AM or PM flag.')
elif not 0 <= res.hour <= 12:
# If AM/PM is found, it's a 12 hour clock, so raise
# an error for invalid range
if fuzzy:
val_is_ampm = False
else:
raise ValueError('Invalid hour specified for ' +
'12-hour clock.')
if val_is_ampm:
if value == 1 and res.hour < 12:
res.hour += 12
elif value == 0 and res.hour == 12:
res.hour = 0
res.ampm = value
elif fuzzy:
last_skipped_token_i = self._skip_token(skipped_tokens,
last_skipped_token_i, i, l)
i += 1
continue
# Check for a timezone name
if (res.hour is not None and len(l[i]) <= 5 and
res.tzname is None and res.tzoffset is None and
not [x for x in l[i] if x not in
string.ascii_uppercase]):
res.tzname = l[i]
res.tzoffset = info.tzoffset(res.tzname)
i += 1
# Check for something like GMT+3, or BRST+3. Notice
# that it doesn't mean "I am 3 hours after GMT", but
# "my time +3 is GMT". If found, we reverse the
# logic so that timezone parsing code will get it
# right.
if i < len_l and l[i] in ('+', '-'):
l[i] = ('+', '-')[l[i] == '+']
res.tzoffset = None
if info.utczone(res.tzname):
# With something like GMT+3, the timezone
# is *not* GMT.
res.tzname = None
continue
# Check for a numbered timezone
if res.hour is not None and l[i] in ('+', '-'):
signal = (-1, 1)[l[i] == '+']
i += 1
len_li = len(l[i])
if len_li == 4:
# -0300
res.tzoffset = int(l[i][:2])*3600+int(l[i][2:])*60
elif i+1 < len_l and l[i+1] == ':':
# -03:00
res.tzoffset = int(l[i])*3600+int(l[i+2])*60
i += 2
elif len_li <= 2:
# -[0]3
res.tzoffset = int(l[i][:2])*3600
else:
return None, None
i += 1
res.tzoffset *= signal
# Look for a timezone name between parenthesis
if (i+3 < len_l and
info.jump(l[i]) and l[i+1] == '(' and l[i+3] == ')' and
3 <= len(l[i+2]) <= 5 and
not [x for x in l[i+2]
if x not in string.ascii_uppercase]):
# -0300 (BRST)
res.tzname = l[i+2]
i += 4
continue
# Check jumps
if not (info.jump(l[i]) or fuzzy):
return None, None
last_skipped_token_i = self._skip_token(skipped_tokens,
last_skipped_token_i, i, l)
i += 1
# Process year/month/day
year, month, day = ymd.resolve_ymd(mstridx, yearfirst, dayfirst)
if year is not None:
res.year = year
res.century_specified = ymd.century_specified
if month is not None:
res.month = month
if day is not None:
res.day = day
except (IndexError, ValueError, AssertionError):
return None, None
if not info.validate(res):
return None, None
if fuzzy_with_tokens:
return res, tuple(skipped_tokens)
else:
return res, None
@staticmethod
def _skip_token(skipped_tokens, last_skipped_token_i, i, l):
if last_skipped_token_i == i - 1:
# recombine the tokens
skipped_tokens[-1] += l[i]
else:
# just append
skipped_tokens.append(l[i])
last_skipped_token_i = i
return last_skipped_token_i
DEFAULTPARSER = parser()
def parse(timestr, parserinfo=None, **kwargs):
"""
Parse a string in one of the supported formats, using the
``parserinfo`` parameters.
:param timestr:
A string containing a date/time stamp.
:param parserinfo:
A :class:`parserinfo` object containing parameters for the parser.
If ``None``, the default arguments to the :class:`parserinfo`
constructor are used.
The ``**kwargs`` parameter takes the following keyword arguments:
:param default:
The default datetime object, if this is a datetime object and not
``None``, elements specified in ``timestr`` replace elements in the
default object.
:param ignoretz:
If set ``True``, time zones in parsed strings are ignored and a naive
:class:`datetime` object is returned.
:param tzinfos:
Additional time zone names / aliases which may be present in the
string. This argument maps time zone names (and optionally offsets
from those time zones) to time zones. This parameter can be a
dictionary with timezone aliases mapping time zone names to time
zones or a function taking two parameters (``tzname`` and
``tzoffset``) and returning a time zone.
The timezones to which the names are mapped can be an integer
offset from UTC in minutes or a :class:`tzinfo` object.
.. doctest::
:options: +NORMALIZE_WHITESPACE
>>> from dateutil.parser import parse
>>> from dateutil.tz import gettz
>>> tzinfos = {"BRST": -10800, "CST": gettz("America/Chicago")}
>>> parse("2012-01-19 17:21:00 BRST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21, tzinfo=tzoffset(u'BRST', -10800))
>>> parse("2012-01-19 17:21:00 CST", tzinfos=tzinfos)
datetime.datetime(2012, 1, 19, 17, 21,
tzinfo=tzfile('/usr/share/zoneinfo/America/Chicago'))
This parameter is ignored if ``ignoretz`` is set.
:param dayfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the day (``True``) or month (``False``). If
``yearfirst`` is set to ``True``, this distinguishes between YDM and
YMD. If set to ``None``, this value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param yearfirst:
Whether to interpret the first value in an ambiguous 3-integer date
(e.g. 01/05/09) as the year. If ``True``, the first number is taken to
be the year, otherwise the last number is taken to be the year. If
this is set to ``None``, the value is retrieved from the current
:class:`parserinfo` object (which itself defaults to ``False``).
:param fuzzy:
Whether to allow fuzzy parsing, allowing for string like "Today is
January 1, 2047 at 8:21:00AM".
:param fuzzy_with_tokens:
If ``True``, ``fuzzy`` is automatically set to True, and the parser
will return a tuple where the first element is the parsed
:class:`datetime.datetime` datetimestamp and the second element is
a tuple containing the portions of the string which were ignored:
.. doctest::
>>> from dateutil.parser import parse
>>> parse("Today is January 1, 2047 at 8:21:00AM", fuzzy_with_tokens=True)
(datetime.datetime(2047, 1, 1, 8, 21), (u'Today is ', u' ', u'at '))
:return:
Returns a :class:`datetime.datetime` object or, if the
``fuzzy_with_tokens`` option is ``True``, returns a tuple, the
first element being a :class:`datetime.datetime` object, the second
a tuple containing the fuzzy tokens.
:raises ValueError:
Raised for invalid or unknown string format, if the provided
:class:`tzinfo` is not in a valid format, or if an invalid date
would be created.
:raises OverflowError:
Raised if the parsed date exceeds the largest valid C integer on
your system.
"""
if parserinfo:
return parser(parserinfo).parse(timestr, **kwargs)
else:
return DEFAULTPARSER.parse(timestr, **kwargs)
class _tzparser(object):
class _result(_resultbase):
__slots__ = ["stdabbr", "stdoffset", "dstabbr", "dstoffset",
"start", "end"]
class _attr(_resultbase):
__slots__ = ["month", "week", "weekday",
"yday", "jyday", "day", "time"]
def __repr__(self):
return self._repr("")
def __init__(self):
_resultbase.__init__(self)
self.start = self._attr()
self.end = self._attr()
def parse(self, tzstr):
res = self._result()
l = _timelex.split(tzstr)
try:
len_l = len(l)
i = 0
while i < len_l:
# BRST+3[BRDT[+2]]
j = i
while j < len_l and not [x for x in l[j]
if x in "0123456789:,-+"]:
j += 1
if j != i:
if not res.stdabbr:
offattr = "stdoffset"
res.stdabbr = "".join(l[i:j])
else:
offattr = "dstoffset"
res.dstabbr = "".join(l[i:j])
i = j
if (i < len_l and (l[i] in ('+', '-') or l[i][0] in
"0123456789")):
if l[i] in ('+', '-'):
# Yes, that's right. See the TZ variable
# documentation.
signal = (1, -1)[l[i] == '+']
i += 1
else:
signal = -1
len_li = len(l[i])
if len_li == 4:
# -0300
setattr(res, offattr, (int(l[i][:2])*3600 +
int(l[i][2:])*60)*signal)
elif i+1 < len_l and l[i+1] == ':':
# -03:00
setattr(res, offattr,
(int(l[i])*3600+int(l[i+2])*60)*signal)
i += 2
elif len_li <= 2:
# -[0]3
setattr(res, offattr,
int(l[i][:2])*3600*signal)
else:
return None
i += 1
if res.dstabbr:
break
else:
break
if i < len_l:
for j in range(i, len_l):
if l[j] == ';':
l[j] = ','
assert l[i] == ','
i += 1
if i >= len_l:
pass
elif (8 <= l.count(',') <= 9 and
not [y for x in l[i:] if x != ','
for y in x if y not in "0123456789"]):
# GMT0BST,3,0,30,3600,10,0,26,7200[,3600]
for x in (res.start, res.end):
x.month = int(l[i])
i += 2
if l[i] == '-':
value = int(l[i+1])*-1
i += 1
else:
value = int(l[i])
i += 2
if value:
x.week = value
x.weekday = (int(l[i])-1) % 7
else:
x.day = int(l[i])
i += 2
x.time = int(l[i])
i += 2
if i < len_l:
if l[i] in ('-', '+'):
signal = (-1, 1)[l[i] == "+"]
i += 1
else:
signal = 1
res.dstoffset = (res.stdoffset+int(l[i]))*signal
elif (l.count(',') == 2 and l[i:].count('/') <= 2 and
not [y for x in l[i:] if x not in (',', '/', 'J', 'M',
'.', '-', ':')
for y in x if y not in "0123456789"]):
for x in (res.start, res.end):
if l[i] == 'J':
# non-leap year day (1 based)
i += 1
x.jyday = int(l[i])
elif l[i] == 'M':
# month[-.]week[-.]weekday
i += 1
x.month = int(l[i])
i += 1
assert l[i] in ('-', '.')
i += 1
x.week = int(l[i])
if x.week == 5:
x.week = -1
i += 1
assert l[i] in ('-', '.')
i += 1
x.weekday = (int(l[i])-1) % 7
else:
# year day (zero based)
x.yday = int(l[i])+1
i += 1
if i < len_l and l[i] == '/':
i += 1
# start time
len_li = len(l[i])
if len_li == 4:
# -0300
x.time = (int(l[i][:2])*3600+int(l[i][2:])*60)
elif i+1 < len_l and l[i+1] == ':':
# -03:00
x.time = int(l[i])*3600+int(l[i+2])*60
i += 2
if i+1 < len_l and l[i+1] == ':':
i += 2
x.time += int(l[i])
elif len_li <= 2:
# -[0]3
x.time = (int(l[i][:2])*3600)
else:
return None
i += 1
assert i == len_l or l[i] == ','
i += 1
assert i >= len_l
except (IndexError, ValueError, AssertionError):
return None
return res
DEFAULTTZPARSER = _tzparser()
def _parsetz(tzstr):
return DEFAULTTZPARSER.parse(tzstr)
def _parsems(value):
"""Parse a I[.F] seconds value into (seconds, microseconds)."""
if "." not in value:
return int(value), 0
else:
i, f = value.split(".")
return int(i), int(f.ljust(6, "0")[:6])
# vim:ts=4:sw=4:et
dateutil/_common.py 0000644 00000001400 14751155147 0010365 0 ustar 00 """
Common code used in multiple modules.
"""
class weekday(object):
__slots__ = ["weekday", "n"]
def __init__(self, weekday, n=None):
self.weekday = weekday
self.n = n
def __call__(self, n):
if n == self.n:
return self
else:
return self.__class__(self.weekday, n)
def __eq__(self, other):
try:
if self.weekday != other.weekday or self.n != other.n:
return False
except AttributeError:
return False
return True
__hash__ = None
def __repr__(self):
s = ("MO", "TU", "WE", "TH", "FR", "SA", "SU")[self.weekday]
if not self.n:
return s
else:
return "%s(%+d)" % (s, self.n)
dateutil/relativedelta.py 0000644 00000055151 14751155147 0011577 0 ustar 00 # -*- coding: utf-8 -*-
import datetime
import calendar
import operator
from math import copysign
from six import integer_types
from warnings import warn
from ._common import weekday
MO, TU, WE, TH, FR, SA, SU = weekdays = tuple(weekday(x) for x in range(7))
__all__ = ["relativedelta", "MO", "TU", "WE", "TH", "FR", "SA", "SU"]
class relativedelta(object):
"""
The relativedelta type is based on the specification of the excellent
work done by M.-A. Lemburg in his
`mx.DateTime <http://www.egenix.com/files/python/mxDateTime.html>`_ extension.
However, notice that this type does *NOT* implement the same algorithm as
his work. Do *NOT* expect it to behave like mx.DateTime's counterpart.
There are two different ways to build a relativedelta instance. The
first one is passing it two date/datetime classes::
relativedelta(datetime1, datetime2)
The second one is passing it any number of the following keyword arguments::
relativedelta(arg1=x,arg2=y,arg3=z...)
year, month, day, hour, minute, second, microsecond:
Absolute information (argument is singular); adding or subtracting a
relativedelta with absolute information does not perform an aritmetic
operation, but rather REPLACES the corresponding value in the
original datetime with the value(s) in relativedelta.
years, months, weeks, days, hours, minutes, seconds, microseconds:
Relative information, may be negative (argument is plural); adding
or subtracting a relativedelta with relative information performs
the corresponding aritmetic operation on the original datetime value
with the information in the relativedelta.
weekday:
One of the weekday instances (MO, TU, etc). These instances may
receive a parameter N, specifying the Nth weekday, which could
be positive or negative (like MO(+1) or MO(-2). Not specifying
it is the same as specifying +1. You can also use an integer,
where 0=MO.
leapdays:
Will add given days to the date found, if year is a leap
year, and the date found is post 28 of february.
yearday, nlyearday:
Set the yearday or the non-leap year day (jump leap days).
These are converted to day/month/leapdays information.
Here is the behavior of operations with relativedelta:
1. Calculate the absolute year, using the 'year' argument, or the
original datetime year, if the argument is not present.
2. Add the relative 'years' argument to the absolute year.
3. Do steps 1 and 2 for month/months.
4. Calculate the absolute day, using the 'day' argument, or the
original datetime day, if the argument is not present. Then,
subtract from the day until it fits in the year and month
found after their operations.
5. Add the relative 'days' argument to the absolute day. Notice
that the 'weeks' argument is multiplied by 7 and added to
'days'.
6. Do steps 1 and 2 for hour/hours, minute/minutes, second/seconds,
microsecond/microseconds.
7. If the 'weekday' argument is present, calculate the weekday,
with the given (wday, nth) tuple. wday is the index of the
weekday (0-6, 0=Mon), and nth is the number of weeks to add
forward or backward, depending on its signal. Notice that if
the calculated date is already Monday, for example, using
(0, 1) or (0, -1) won't change the day.
"""
def __init__(self, dt1=None, dt2=None,
years=0, months=0, days=0, leapdays=0, weeks=0,
hours=0, minutes=0, seconds=0, microseconds=0,
year=None, month=None, day=None, weekday=None,
yearday=None, nlyearday=None,
hour=None, minute=None, second=None, microsecond=None):
# Check for non-integer values in integer-only quantities
if any(x is not None and x != int(x) for x in (years, months)):
raise ValueError("Non-integer years and months are "
"ambiguous and not currently supported.")
if dt1 and dt2:
# datetime is a subclass of date. So both must be date
if not (isinstance(dt1, datetime.date) and
isinstance(dt2, datetime.date)):
raise TypeError("relativedelta only diffs datetime/date")
# We allow two dates, or two datetimes, so we coerce them to be
# of the same type
if (isinstance(dt1, datetime.datetime) !=
isinstance(dt2, datetime.datetime)):
if not isinstance(dt1, datetime.datetime):
dt1 = datetime.datetime.fromordinal(dt1.toordinal())
elif not isinstance(dt2, datetime.datetime):
dt2 = datetime.datetime.fromordinal(dt2.toordinal())
self.years = 0
self.months = 0
self.days = 0
self.leapdays = 0
self.hours = 0
self.minutes = 0
self.seconds = 0
self.microseconds = 0
self.year = None
self.month = None
self.day = None
self.weekday = None
self.hour = None
self.minute = None
self.second = None
self.microsecond = None
self._has_time = 0
# Get year / month delta between the two
months = (dt1.year - dt2.year) * 12 + (dt1.month - dt2.month)
self._set_months(months)
# Remove the year/month delta so the timedelta is just well-defined
# time units (seconds, days and microseconds)
dtm = self.__radd__(dt2)
# If we've overshot our target, make an adjustment
if dt1 < dt2:
compare = operator.gt
increment = 1
else:
compare = operator.lt
increment = -1
while compare(dt1, dtm):
months += increment
self._set_months(months)
dtm = self.__radd__(dt2)
# Get the timedelta between the "months-adjusted" date and dt1
delta = dt1 - dtm
self.seconds = delta.seconds + delta.days * 86400
self.microseconds = delta.microseconds
else:
# Relative information
self.years = years
self.months = months
self.days = days + weeks * 7
self.leapdays = leapdays
self.hours = hours
self.minutes = minutes
self.seconds = seconds
self.microseconds = microseconds
# Absolute information
self.year = year
self.month = month
self.day = day
self.hour = hour
self.minute = minute
self.second = second
self.microsecond = microsecond
if any(x is not None and int(x) != x
for x in (year, month, day, hour,
minute, second, microsecond)):
# For now we'll deprecate floats - later it'll be an error.
warn("Non-integer value passed as absolute information. " +
"This is not a well-defined condition and will raise " +
"errors in future versions.", DeprecationWarning)
if isinstance(weekday, integer_types):
self.weekday = weekdays[weekday]
else:
self.weekday = weekday
yday = 0
if nlyearday:
yday = nlyearday
elif yearday:
yday = yearday
if yearday > 59:
self.leapdays = -1
if yday:
ydayidx = [31, 59, 90, 120, 151, 181, 212,
243, 273, 304, 334, 366]
for idx, ydays in enumerate(ydayidx):
if yday <= ydays:
self.month = idx+1
if idx == 0:
self.day = yday
else:
self.day = yday-ydayidx[idx-1]
break
else:
raise ValueError("invalid year day (%d)" % yday)
self._fix()
def _fix(self):
if abs(self.microseconds) > 999999:
s = _sign(self.microseconds)
div, mod = divmod(self.microseconds * s, 1000000)
self.microseconds = mod * s
self.seconds += div * s
if abs(self.seconds) > 59:
s = _sign(self.seconds)
div, mod = divmod(self.seconds * s, 60)
self.seconds = mod * s
self.minutes += div * s
if abs(self.minutes) > 59:
s = _sign(self.minutes)
div, mod = divmod(self.minutes * s, 60)
self.minutes = mod * s
self.hours += div * s
if abs(self.hours) > 23:
s = _sign(self.hours)
div, mod = divmod(self.hours * s, 24)
self.hours = mod * s
self.days += div * s
if abs(self.months) > 11:
s = _sign(self.months)
div, mod = divmod(self.months * s, 12)
self.months = mod * s
self.years += div * s
if (self.hours or self.minutes or self.seconds or self.microseconds
or self.hour is not None or self.minute is not None or
self.second is not None or self.microsecond is not None):
self._has_time = 1
else:
self._has_time = 0
@property
def weeks(self):
return self.days // 7
@weeks.setter
def weeks(self, value):
self.days = self.days - (self.weeks * 7) + value * 7
def _set_months(self, months):
self.months = months
if abs(self.months) > 11:
s = _sign(self.months)
div, mod = divmod(self.months * s, 12)
self.months = mod * s
self.years = div * s
else:
self.years = 0
def normalized(self):
"""
Return a version of this object represented entirely using integer
values for the relative attributes.
>>> relativedelta(days=1.5, hours=2).normalized()
relativedelta(days=1, hours=14)
:return:
Returns a :class:`dateutil.relativedelta.relativedelta` object.
"""
# Cascade remainders down (rounding each to roughly nearest microsecond)
days = int(self.days)
hours_f = round(self.hours + 24 * (self.days - days), 11)
hours = int(hours_f)
minutes_f = round(self.minutes + 60 * (hours_f - hours), 10)
minutes = int(minutes_f)
seconds_f = round(self.seconds + 60 * (minutes_f - minutes), 8)
seconds = int(seconds_f)
microseconds = round(self.microseconds + 1e6 * (seconds_f - seconds))
# Constructor carries overflow back up with call to _fix()
return self.__class__(years=self.years, months=self.months,
days=days, hours=hours, minutes=minutes,
seconds=seconds, microseconds=microseconds,
leapdays=self.leapdays, year=self.year,
month=self.month, day=self.day,
weekday=self.weekday, hour=self.hour,
minute=self.minute, second=self.second,
microsecond=self.microsecond)
def __add__(self, other):
if isinstance(other, relativedelta):
return self.__class__(years=other.years + self.years,
months=other.months + self.months,
days=other.days + self.days,
hours=other.hours + self.hours,
minutes=other.minutes + self.minutes,
seconds=other.seconds + self.seconds,
microseconds=(other.microseconds +
self.microseconds),
leapdays=other.leapdays or self.leapdays,
year=(other.year if other.year is not None
else self.year),
month=(other.month if other.month is not None
else self.month),
day=(other.day if other.day is not None
else self.day),
weekday=(other.weekday if other.weekday is not None
else self.weekday),
hour=(other.hour if other.hour is not None
else self.hour),
minute=(other.minute if other.minute is not None
else self.minute),
second=(other.second if other.second is not None
else self.second),
microsecond=(other.microsecond if other.microsecond
is not None else
self.microsecond))
if isinstance(other, datetime.timedelta):
return self.__class__(years=self.years,
months=self.months,
days=self.days + other.days,
hours=self.hours,
minutes=self.minutes,
seconds=self.seconds + other.seconds,
microseconds=self.microseconds + other.microseconds,
leapdays=self.leapdays,
year=self.year,
month=self.month,
day=self.day,
weekday=self.weekday,
hour=self.hour,
minute=self.minute,
second=self.second,
microsecond=self.microsecond)
if not isinstance(other, datetime.date):
return NotImplemented
elif self._has_time and not isinstance(other, datetime.datetime):
other = datetime.datetime.fromordinal(other.toordinal())
year = (self.year or other.year)+self.years
month = self.month or other.month
if self.months:
assert 1 <= abs(self.months) <= 12
month += self.months
if month > 12:
year += 1
month -= 12
elif month < 1:
year -= 1
month += 12
day = min(calendar.monthrange(year, month)[1],
self.day or other.day)
repl = {"year": year, "month": month, "day": day}
for attr in ["hour", "minute", "second", "microsecond"]:
value = getattr(self, attr)
if value is not None:
repl[attr] = value
days = self.days
if self.leapdays and month > 2 and calendar.isleap(year):
days += self.leapdays
ret = (other.replace(**repl)
+ datetime.timedelta(days=days,
hours=self.hours,
minutes=self.minutes,
seconds=self.seconds,
microseconds=self.microseconds))
if self.weekday:
weekday, nth = self.weekday.weekday, self.weekday.n or 1
jumpdays = (abs(nth) - 1) * 7
if nth > 0:
jumpdays += (7 - ret.weekday() + weekday) % 7
else:
jumpdays += (ret.weekday() - weekday) % 7
jumpdays *= -1
ret += datetime.timedelta(days=jumpdays)
return ret
def __radd__(self, other):
return self.__add__(other)
def __rsub__(self, other):
return self.__neg__().__radd__(other)
def __sub__(self, other):
if not isinstance(other, relativedelta):
return NotImplemented # In case the other object defines __rsub__
return self.__class__(years=self.years - other.years,
months=self.months - other.months,
days=self.days - other.days,
hours=self.hours - other.hours,
minutes=self.minutes - other.minutes,
seconds=self.seconds - other.seconds,
microseconds=self.microseconds - other.microseconds,
leapdays=self.leapdays or other.leapdays,
year=(self.year if self.year is not None
else other.year),
month=(self.month if self.month is not None else
other.month),
day=(self.day if self.day is not None else
other.day),
weekday=(self.weekday if self.weekday is not None else
other.weekday),
hour=(self.hour if self.hour is not None else
other.hour),
minute=(self.minute if self.minute is not None else
other.minute),
second=(self.second if self.second is not None else
other.second),
microsecond=(self.microsecond if self.microsecond
is not None else
other.microsecond))
def __neg__(self):
return self.__class__(years=-self.years,
months=-self.months,
days=-self.days,
hours=-self.hours,
minutes=-self.minutes,
seconds=-self.seconds,
microseconds=-self.microseconds,
leapdays=self.leapdays,
year=self.year,
month=self.month,
day=self.day,
weekday=self.weekday,
hour=self.hour,
minute=self.minute,
second=self.second,
microsecond=self.microsecond)
def __bool__(self):
return not (not self.years and
not self.months and
not self.days and
not self.hours and
not self.minutes and
not self.seconds and
not self.microseconds and
not self.leapdays and
self.year is None and
self.month is None and
self.day is None and
self.weekday is None and
self.hour is None and
self.minute is None and
self.second is None and
self.microsecond is None)
# Compatibility with Python 2.x
__nonzero__ = __bool__
def __mul__(self, other):
try:
f = float(other)
except TypeError:
return NotImplemented
return self.__class__(years=int(self.years * f),
months=int(self.months * f),
days=int(self.days * f),
hours=int(self.hours * f),
minutes=int(self.minutes * f),
seconds=int(self.seconds * f),
microseconds=int(self.microseconds * f),
leapdays=self.leapdays,
year=self.year,
month=self.month,
day=self.day,
weekday=self.weekday,
hour=self.hour,
minute=self.minute,
second=self.second,
microsecond=self.microsecond)
__rmul__ = __mul__
def __eq__(self, other):
if not isinstance(other, relativedelta):
return NotImplemented
if self.weekday or other.weekday:
if not self.weekday or not other.weekday:
return False
if self.weekday.weekday != other.weekday.weekday:
return False
n1, n2 = self.weekday.n, other.weekday.n
if n1 != n2 and not ((not n1 or n1 == 1) and (not n2 or n2 == 1)):
return False
return (self.years == other.years and
self.months == other.months and
self.days == other.days and
self.hours == other.hours and
self.minutes == other.minutes and
self.seconds == other.seconds and
self.microseconds == other.microseconds and
self.leapdays == other.leapdays and
self.year == other.year and
self.month == other.month and
self.day == other.day and
self.hour == other.hour and
self.minute == other.minute and
self.second == other.second and
self.microsecond == other.microsecond)
__hash__ = None
def __ne__(self, other):
return not self.__eq__(other)
def __div__(self, other):
try:
reciprocal = 1 / float(other)
except TypeError:
return NotImplemented
return self.__mul__(reciprocal)
__truediv__ = __div__
def __repr__(self):
l = []
for attr in ["years", "months", "days", "leapdays",
"hours", "minutes", "seconds", "microseconds"]:
value = getattr(self, attr)
if value:
l.append("{attr}={value:+g}".format(attr=attr, value=value))
for attr in ["year", "month", "day", "weekday",
"hour", "minute", "second", "microsecond"]:
value = getattr(self, attr)
if value is not None:
l.append("{attr}={value}".format(attr=attr, value=repr(value)))
return "{classname}({attrs})".format(classname=self.__class__.__name__,
attrs=", ".join(l))
def _sign(x):
return int(copysign(1, x))
# vim:ts=4:sw=4:et
dnfpluginscore/__pycache__/__init__.cpython-36.pyc 0000644 00000000670 14751155147 0016200 0 ustar 00 3
�gt`� � @ sT d Z ddlmZ ddlmZ ddlZddlZejjd�\Z Z
ej d�Z ej d�Z
dS )z! Common code for dnf-plugins-core� )�absolute_import)�unicode_literalsNzdnf-plugins-corez
dnf.pluginzdnf.rpm)�__doc__Z
__future__r r Zdnf.exceptionsZdnfZloggingZi18nZ translation�_ZP_Z getLoggerZloggerZ
rpm_logger� r r � /usr/lib/python3.6/__init__.py�<module> s
dnfpluginscore/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000670 14751155147 0017137 0 ustar 00 3
�gt`� � @ sT d Z ddlmZ ddlmZ ddlZddlZejjd�\Z Z
ej d�Z ej d�Z
dS )z! Common code for dnf-plugins-core� )�absolute_import)�unicode_literalsNzdnf-plugins-corez
dnf.pluginzdnf.rpm)�__doc__Z
__future__r r Zdnf.exceptionsZdnfZloggingZi18nZ translation�_ZP_Z getLoggerZloggerZ
rpm_logger� r r � /usr/lib/python3.6/__init__.py�<module> s
dnfpluginscore/__init__.py 0000644 00000002340 14751155147 0011710 0 ustar 00 # Copyright (C) 2014 Red Hat, Inc.
#
# This copyrighted material is made available to anyone wishing to use,
# modify, copy, or redistribute it subject to the terms and conditions of
# the GNU General Public License v.2, or (at your option) any later version.
# This program is distributed in the hope that it will be useful, but WITHOUT
# ANY WARRANTY expressed or implied, including the implied warranties of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
# Public License for more details. You should have received a copy of the
# GNU General Public License along with this program; if not, write to the
# Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
# 02110-1301, USA. Any Red Hat trademarks that are incorporated in the
# source code or documentation are not subject to the GNU General Public
# License and may only be used or replicated with the express permission of
# Red Hat, Inc.
#
""" Common code for dnf-plugins-core"""
from __future__ import absolute_import
from __future__ import unicode_literals
import dnf.exceptions
import logging
_, P_ = dnf.i18n.translation('dnf-plugins-core')
logger = logging.getLogger('dnf.plugin')
rpm_logger = logging.getLogger('dnf.rpm')
pip-9.0.3.dist-info/top_level.txt 0000644 00000000004 14751155147 0012432 0 ustar 00 pip
pip-9.0.3.dist-info/INSTALLER 0000644 00000000004 14751155147 0011160 0 ustar 00 rpm
pip-9.0.3.dist-info/DESCRIPTION.rst 0000644 00000002407 14751155147 0012226 0 ustar 00 pip
===
The `PyPA recommended
<https://packaging.python.org/en/latest/current/>`_
tool for installing Python packages.
* `Installation <https://pip.pypa.io/en/stable/installing.html>`_
* `Documentation <https://pip.pypa.io/>`_
* `Changelog <https://pip.pypa.io/en/stable/news.html>`_
* `Github Page <https://github.com/pypa/pip>`_
* `Issue Tracking <https://github.com/pypa/pip/issues>`_
* `User mailing list <http://groups.google.com/group/python-virtualenv>`_
* `Dev mailing list <http://groups.google.com/group/pypa-dev>`_
* User IRC: #pypa on Freenode.
* Dev IRC: #pypa-dev on Freenode.
.. image:: https://img.shields.io/pypi/v/pip.svg
:target: https://pypi.python.org/pypi/pip
.. image:: https://img.shields.io/travis/pypa/pip/master.svg
:target: http://travis-ci.org/pypa/pip
.. image:: https://img.shields.io/appveyor/ci/pypa/pip.svg
:target: https://ci.appveyor.com/project/pypa/pip/history
.. image:: https://readthedocs.org/projects/pip/badge/?version=stable
:target: https://pip.pypa.io/en/stable
Code of Conduct
---------------
Everyone interacting in the pip project's codebases, issue trackers, chat
rooms, and mailing lists is expected to follow the `PyPA Code of Conduct`_.
.. _PyPA Code of Conduct: https://www.pypa.io/en/latest/code-of-conduct/
pip-9.0.3.dist-info/RECORD 0000644 00000117164 14751155147 0010621 0 ustar 00 pip/__init__.py,sha256=4lW9KYLzqHLnjA4LqDJpzrQvCoV1WcsiCpQv6UcaWhU,11934
pip/__main__.py,sha256=V6Kh-IEDEFpt1cahRE6MajUF_14qJR_Qsvn4MjWZXzE,584
pip/basecommand.py,sha256=TTlmZesQ4Vuxcto2KqwZGmgmN5ioHEl_DeFev9ie_SA,11910
pip/baseparser.py,sha256=AKMOeF3fTrRroiv0DmTQbdiLW0DQux2KqGC_dJJB9d0,10465
pip/cmdoptions.py,sha256=8JCcF2kKAF2cFnV77oW-3DsHJifr9jF2WuChzzwgcwg,16474
pip/download.py,sha256=qZIbS-XFZeHSy4Ub_4nRwS9eyEj6vfwm0K8fSLIdzAQ,32847
pip/exceptions.py,sha256=BvqH-Jw3tP2b-2IJ2kjrQemOAPMqKrQMLRIZHZQpJXk,8121
pip/index.py,sha256=n31FFa3urQ8xHpMXOnVUAsVao71UZiltOX7jVz31PhA,41559
pip/locations.py,sha256=9rJRlgonC6QC2zGDIn_7mXaoZ9_tF_IHM2BQhWVRgbo,5626
pip/pep425tags.py,sha256=q3kec4f6NHszuGYIhGIbVvs896D06uJAnKFgJ_wce44,10980
pip/status_codes.py,sha256=F6uDG6Gj7RNKQJUDnd87QKqI16Us-t-B0wPF_4QMpWc,156
pip/wheel.py,sha256=sYlucHaRqyQZJ-e6H-190HHnJQhL5mT0tlNQN3yQ0Ws,32287
pip/_vendor/__init__.py,sha256=WaaSJ3roSSJ_Uv4yKAxlGohKEH9YUA3aIh1Xg2IjfgU,4670
pip/_vendor/appdirs.py,sha256=-9UOIZy62ahCQVY9-b7Nn6_5_4Y6ooHnv72tM8iHi9Y,22368
pip/_vendor/distro.py,sha256=8yTxDnhLRpIS9EUcz1r_143-KeZFapXaxeoTivnlZig,38381
pip/_vendor/ipaddress.py,sha256=wimbqcE7rwwETlucn8A_4Qd_-NKXPOBcNxJHarUoXng,80176
pip/_vendor/pyparsing.py,sha256=7vAuUVbh6txUKQR2IzJ8_9DKmD5vtm5MDssWkI0ka8o,224171
pip/_vendor/re-vendor.py,sha256=PcdZ40d0ohMsdJmA4t0AeAWbPXi1tFsvAwA5KE5FGeY,773
pip/_vendor/retrying.py,sha256=k3fflf5_Mm0XcIJYhB7Tj34bqCCPhUDkYbx1NvW2FPE,9972
pip/_vendor/six.py,sha256=A6hdJZVjI3t_geebZ9BzUvwRrIXo0lfwzQlM2LcKyas,30098
pip/_vendor/cachecontrol/__init__.py,sha256=UPyFlz0dIjxusu5ITig9UDFJdSY5LTwijhldn0AfyzU,302
pip/_vendor/cachecontrol/_cmd.py,sha256=MPxZfZd2LKDzVrs55X3wA1rsI2YuP8evLZSwQj0dIk0,1320
pip/_vendor/cachecontrol/adapter.py,sha256=RaGYyRA-RA1J0AnE67GzEYFPBu4YH4EQUvQqTKa57iM,4608
pip/_vendor/cachecontrol/cache.py,sha256=xtl-V-pr9KSt9VvFDRCB9yrHPEvqvbk-5M1vAInZb5k,790
pip/_vendor/cachecontrol/compat.py,sha256=2MTOyI1JlG_gJpfuy3-UQQlKMRiJimR-XXB0sr44wj0,380
pip/_vendor/cachecontrol/controller.py,sha256=elDsLcaYA15ncodRmHnWQp6ekU_ocEGtDeGLbsnTjzo,13024
pip/_vendor/cachecontrol/filewrapper.py,sha256=_K8cStmXqD33m15PfsQ8rlpo6FfXjVbKmjvLXyICRgI,2531
pip/_vendor/cachecontrol/heuristics.py,sha256=WtJrVsyWjpP9WoUiDVdTZZRNBCz5ZVptaQpYnqofDQU,4141
pip/_vendor/cachecontrol/serialize.py,sha256=XM6elG9DSNexwaOCgMjUtfrHHW5NAB6TSbIf3x235xs,6536
pip/_vendor/cachecontrol/wrapper.py,sha256=Kqyu_3TW_54XDudha4-HF21vyEOAJ4ZnRXFysTiLmXA,498
pip/_vendor/cachecontrol/caches/__init__.py,sha256=uWnUtyMvHY_LULaL_4_IR1F_xPgK5zHfJyRnBq4DnPE,369
pip/_vendor/cachecontrol/caches/file_cache.py,sha256=FsDug3bwUAQ3okjjfGzxlDaBf2fwVSn1iBKMTL6SyGU,3532
pip/_vendor/cachecontrol/caches/redis_cache.py,sha256=XywqxkS9MkCaflTOY_wjrE02neKdywB9YwlOBbP7Ywc,973
pip/_vendor/certifi/__init__.py,sha256=QSRy1UztE-i09IuGIKKuc190k07lt6ktabbelPMIZoc,63
pip/_vendor/certifi/__main__.py,sha256=FiOYt1Fltst7wk9DRa6GCoBr8qBUxlNQu_MKJf04E6s,41
pip/_vendor/certifi/core.py,sha256=9MGV_bfdXHlJJ18qDuEEi_QvAbPUsgK8YggA2b70tqg,806
pip/_vendor/chardet/__init__.py,sha256=YsP5wQlsHJ2auF1RZJfypiSrCA7_bQiRm3ES_NI76-Y,1559
pip/_vendor/chardet/big5freq.py,sha256=D_zK5GyzoVsRes0HkLJziltFQX0bKCLOrFe9_xDvO_8,31254
pip/_vendor/chardet/big5prober.py,sha256=kBxHbdetBpPe7xrlb-e990iot64g_eGSLd32lB7_h3M,1757
pip/_vendor/chardet/chardistribution.py,sha256=3woWS62KrGooKyqz4zQSnjFbJpa6V7g02daAibTwcl8,9411
pip/_vendor/chardet/charsetgroupprober.py,sha256=6bDu8YIiRuScX4ca9Igb0U69TA2PGXXDej6Cc4_9kO4,3787
pip/_vendor/chardet/charsetprober.py,sha256=KSmwJErjypyj0bRZmC5F5eM7c8YQgLYIjZXintZNstg,5110
pip/_vendor/chardet/codingstatemachine.py,sha256=VYp_6cyyki5sHgXDSZnXW4q1oelHc3cu9AyQTX7uug8,3590
pip/_vendor/chardet/compat.py,sha256=PKTzHkSbtbHDqS9PyujMbX74q1a8mMpeQTDVsQhZMRw,1134
pip/_vendor/chardet/cp949prober.py,sha256=TZ434QX8zzBsnUvL_8wm4AQVTZ2ZkqEEQL_lNw9f9ow,1855
pip/_vendor/chardet/enums.py,sha256=Aimwdb9as1dJKZaFNUH2OhWIVBVd6ZkJJ_WK5sNY8cU,1661
pip/_vendor/chardet/escprober.py,sha256=kkyqVg1Yw3DIOAMJ2bdlyQgUFQhuHAW8dUGskToNWSc,3950
pip/_vendor/chardet/escsm.py,sha256=RuXlgNvTIDarndvllNCk5WZBIpdCxQ0kcd9EAuxUh84,10510
pip/_vendor/chardet/eucjpprober.py,sha256=iD8Jdp0ISRjgjiVN7f0e8xGeQJ5GM2oeZ1dA8nbSeUw,3749
pip/_vendor/chardet/euckrfreq.py,sha256=-7GdmvgWez4-eO4SuXpa7tBiDi5vRXQ8WvdFAzVaSfo,13546
pip/_vendor/chardet/euckrprober.py,sha256=MqFMTQXxW4HbzIpZ9lKDHB3GN8SP4yiHenTmf8g_PxY,1748
pip/_vendor/chardet/euctwfreq.py,sha256=No1WyduFOgB5VITUA7PLyC5oJRNzRyMbBxaKI1l16MA,31621
pip/_vendor/chardet/euctwprober.py,sha256=13p6EP4yRaxqnP4iHtxHOJ6R2zxHq1_m8hTRjzVZ95c,1747
pip/_vendor/chardet/gb2312freq.py,sha256=JX8lsweKLmnCwmk8UHEQsLgkr_rP_kEbvivC4qPOrlc,20715
pip/_vendor/chardet/gb2312prober.py,sha256=gGvIWi9WhDjE-xQXHvNIyrnLvEbMAYgyUSZ65HUfylw,1754
pip/_vendor/chardet/hebrewprober.py,sha256=c3SZ-K7hvyzGY6JRAZxJgwJ_sUS9k0WYkvMY00YBYFo,13838
pip/_vendor/chardet/jisfreq.py,sha256=vpmJv2Bu0J8gnMVRPHMFefTRvo_ha1mryLig8CBwgOg,25777
pip/_vendor/chardet/jpcntx.py,sha256=PYlNqRUQT8LM3cT5FmHGP0iiscFlTWED92MALvBungo,19643
pip/_vendor/chardet/langbulgarianmodel.py,sha256=1HqQS9Pbtnj1xQgxitJMvw8X6kKr5OockNCZWfEQrPE,12839
pip/_vendor/chardet/langcyrillicmodel.py,sha256=LODajvsetH87yYDDQKA2CULXUH87tI223dhfjh9Zx9c,17948
pip/_vendor/chardet/langgreekmodel.py,sha256=8YAW7bU8YwSJap0kIJSbPMw1BEqzGjWzqcqf0WgUKAA,12688
pip/_vendor/chardet/langhebrewmodel.py,sha256=JSnqmE5E62tDLTPTvLpQsg5gOMO4PbdWRvV7Avkc0HA,11345
pip/_vendor/chardet/langhungarianmodel.py,sha256=RhapYSG5l0ZaO-VV4Fan5sW0WRGQqhwBM61yx3yxyOA,12592
pip/_vendor/chardet/langthaimodel.py,sha256=8l0173Gu_W6G8mxmQOTEF4ls2YdE7FxWf3QkSxEGXJQ,11290
pip/_vendor/chardet/langturkishmodel.py,sha256=W22eRNJsqI6uWAfwXSKVWWnCerYqrI8dZQTm_M0lRFk,11102
pip/_vendor/chardet/latin1prober.py,sha256=S2IoORhFk39FEFOlSFWtgVybRiP6h7BlLldHVclNkU8,5370
pip/_vendor/chardet/mbcharsetprober.py,sha256=AR95eFH9vuqSfvLQZN-L5ijea25NOBCoXqw8s5O9xLQ,3413
pip/_vendor/chardet/mbcsgroupprober.py,sha256=h6TRnnYq2OxG1WdD5JOyxcdVpn7dG0q-vB8nWr5mbh4,2012
pip/_vendor/chardet/mbcssm.py,sha256=SY32wVIF3HzcjY3BaEspy9metbNSKxIIB0RKPn7tjpI,25481
pip/_vendor/chardet/sbcharsetprober.py,sha256=LDSpCldDCFlYwUkGkwD2oFxLlPWIWXT09akH_2PiY74,5657
pip/_vendor/chardet/sbcsgroupprober.py,sha256=1IprcCB_k1qfmnxGC6MBbxELlKqD3scW6S8YIwdeyXA,3546
pip/_vendor/chardet/sjisprober.py,sha256=IIt-lZj0WJqK4rmUZzKZP4GJlE8KUEtFYVuY96ek5MQ,3774
pip/_vendor/chardet/universaldetector.py,sha256=qL0174lSZE442eB21nnktT9_VcAye07laFWUeUrjttY,12485
pip/_vendor/chardet/utf8prober.py,sha256=IdD8v3zWOsB8OLiyPi-y_fqwipRFxV9Nc1eKBLSuIEw,2766
pip/_vendor/chardet/version.py,sha256=sp3B08mrDXB-pf3K9fqJ_zeDHOCLC8RrngQyDFap_7g,242
pip/_vendor/chardet/cli/__init__.py,sha256=AbpHGcgLb-kRsJGnwFEktk7uzpZOCcBY74-YBdrKVGs,1
pip/_vendor/chardet/cli/chardetect.py,sha256=YBO8L4mXo0WR6_-Fjh_8QxPBoEBNqB9oNxNrdc54AQs,2738
pip/_vendor/colorama/__init__.py,sha256=9xByrTvk9upkL5NGV5It2Eje4-kzNLwa_1lGPWpXoNU,240
pip/_vendor/colorama/ansi.py,sha256=Fi0un-QLqRm-v7o_nKiOqyC8PapBJK7DLV_q9LKtTO0,2524
pip/_vendor/colorama/ansitowin32.py,sha256=gJZB35Lbdjatykd2zrUUnokMzkvcFgscyn_tNxxMFHA,9668
pip/_vendor/colorama/initialise.py,sha256=cHqVJtb82OG7HUCxvQ2joG7N_CoxbIKbI_fgryZkj20,1917
pip/_vendor/colorama/win32.py,sha256=_SCEoTK_GA2tU1nhbayKKac-v9Jn98lCPIFOeFMGCHQ,5365
pip/_vendor/colorama/winterm.py,sha256=V7U7ojwG1q4n6PKripjEvW_htYQi5ueXSM3LUUoqqDY,6290
pip/_vendor/distlib/__init__.py,sha256=-aUeNNCfiIG_1Tqf19BH0xLNuBKGX1I7lNhcLYgFUEA,581
pip/_vendor/distlib/compat.py,sha256=FzKlP9dNUMH-j_1LCVnjgx6KgUbpnRjTjYkTkDYRPlI,40801
pip/_vendor/distlib/database.py,sha256=jniJmYk0Mj2t6gZYbnn68TvQwnVZ0kXyeuf_3AxFclk,49672
pip/_vendor/distlib/index.py,sha256=Cw8gxFq_7xXvdgExL3efjLAY3EAPDMSL3VA42RkbQBs,21085
pip/_vendor/distlib/locators.py,sha256=hD_Hm3aSL9DklY9Cxyct2n_74gZ0xNFFGB5L7M6ds14,51013
pip/_vendor/distlib/manifest.py,sha256=3qEuZhHlDbvyYZ1BZbdapDAivgMgUwWpZ00cmXqcn18,14810
pip/_vendor/distlib/markers.py,sha256=iRrVWwpyVwjkKJSX8NEQ92_MRMwpROcfNGKCD-Ch1QM,6282
pip/_vendor/distlib/metadata.py,sha256=hUsf7Qh2Ae4CCkL33qK8ppwC8ZTzT7ep6Hj9RKpijKU,38833
pip/_vendor/distlib/resources.py,sha256=VFBVbFqLVqDBSQDXcFQHrX1KEcuoDxTK699Ydi_beyc,10766
pip/_vendor/distlib/scripts.py,sha256=xpehNfISGPTNxQZu02K9Rw2QbNx_2Q4emePv3W5X0iw,15224
pip/_vendor/distlib/util.py,sha256=KNYa6VsljZ1EiMPsB1qpc_e0R3w6BfJXCd2_0pn7vKg,53609
pip/_vendor/distlib/version.py,sha256=CgghOUylxGD7dEA2S3MvWjx7mY_2bWsluF0Of3Yxl4Y,23711
pip/_vendor/distlib/wheel.py,sha256=UP53cKxOM5r7bHSS-n5prF6hwJEVsMW9ZNJutOuC26c,39115
pip/_vendor/distlib/_backport/__init__.py,sha256=bqS_dTOH6uW9iGgd0uzfpPjo6vZ4xpPZ7kyfZJ2vNaw,274
pip/_vendor/distlib/_backport/misc.py,sha256=KWecINdbFNOxSOP1fGF680CJnaC6S4fBRgEtaYTw0ig,971
pip/_vendor/distlib/_backport/sysconfig.cfg,sha256=swZKxq9RY5e9r3PXCrlvQPMsvOdiWZBTHLEbqS8LJLU,2617
pip/_vendor/distlib/_backport/sysconfig.py,sha256=eSEyJg7jxF_eHlHG8IOtl93kb07UoMIRp1wYsPeGi9k,26955
pip/_vendor/html5lib/__init__.py,sha256=JsIwmFldk-9raBadPSTS74JrfmJvozc-3aekMi7Hr9s,780
pip/_vendor/html5lib/_ihatexml.py,sha256=tzXygYmisUmiEUt2v7E1Ab50AKQsrD-SglPRnY75vME,16705
pip/_vendor/html5lib/_inputstream.py,sha256=C4lX5gUBwebOWy41hYP2ZBpkPVNvxk_hZBm3OVyPZM4,32532
pip/_vendor/html5lib/_tokenizer.py,sha256=YAaOEBD6qc5ISq9Xt9Nif1OFgcybTTfMdwqBkZhpAq4,76580
pip/_vendor/html5lib/_utils.py,sha256=bS6THVlL8ZyTcI6CIxiM6xxuHsE8i1j5Ogd3Ha1G84U,4096
pip/_vendor/html5lib/constants.py,sha256=Dfc1Fv3_9frktgWjg4tbj-CjMMp02Ko9qMe4il1BVdo,83387
pip/_vendor/html5lib/html5parser.py,sha256=Dmlu9hlq5w_id6mBZyY_sE5LukIACgvG4kpgIsded8Q,117170
pip/_vendor/html5lib/serializer.py,sha256=Urrsa0cPPLqNX-UbJWS2gUhs_06qVbNxZvUnrmGZK6E,14177
pip/_vendor/html5lib/_trie/__init__.py,sha256=8VR1bcgD2OpeS2XExpu5yBhP_Q1K-lwKbBKICBPf1kU,289
pip/_vendor/html5lib/_trie/_base.py,sha256=6P_AcIoGjtwB2qAlhV8H4VP-ztQxoXFGwt4NyMqG_Kw,979
pip/_vendor/html5lib/_trie/datrie.py,sha256=EQpqSfkZRuTbE-DuhW7xMdVDxdZNZ0CfmnYfHA_3zxM,1178
pip/_vendor/html5lib/_trie/py.py,sha256=wXmQLrZRf4MyWNyg0m3h81m9InhLR7GJ002mIIZh-8o,1775
pip/_vendor/html5lib/filters/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
pip/_vendor/html5lib/filters/alphabeticalattributes.py,sha256=DXv-P2vdQ5F3OTWM6QZ6KhyDlAWm90pbfrD1Bk9D_l0,621
pip/_vendor/html5lib/filters/base.py,sha256=z-IU9ZAYjpsVsqmVt7kuWC63jR11hDMr6CVrvuao8W0,286
pip/_vendor/html5lib/filters/inject_meta_charset.py,sha256=2Q_JnMscn_tNbV_qpgYN_5M3PnBGfmuvECMKDExHUcY,2742
pip/_vendor/html5lib/filters/lint.py,sha256=qf5cLrT6xXd8V7GH1R_3lKxIjuJSfpbWTpSwaglYdDw,3365
pip/_vendor/html5lib/filters/optionaltags.py,sha256=EHig4kM-QiLjuxVJ3FAAFNy-10k4aV6HJbQzHKZ_3u8,10534
pip/_vendor/html5lib/filters/sanitizer.py,sha256=7PqJrhm6mo3JvaHk2IQW7i74Or7Qtd-FV8UftJIyDys,25112
pip/_vendor/html5lib/filters/whitespace.py,sha256=KPt067nYTqqi8KLTClyynn4eVzNDC_-MApXNVHRXVX0,1139
pip/_vendor/html5lib/treeadapters/__init__.py,sha256=l3LcqMSEyoh99Jh_eWjGexHnIvKhLAXoP-LDz88whuM,208
pip/_vendor/html5lib/treeadapters/genshi.py,sha256=6VIuHDNoExv1JWv3ePj6V5CM-tcyiUSWe5_Hd2ejbwY,1555
pip/_vendor/html5lib/treeadapters/sax.py,sha256=3of4vvaUYIAic7pngebwJV24hpOS7Zg9ggJa_WQegy4,1661
pip/_vendor/html5lib/treebuilders/__init__.py,sha256=UlB4orkTgZhFIKQdXrtiWn9cpKSsuhnOQOIHeD0Fv4k,3406
pip/_vendor/html5lib/treebuilders/base.py,sha256=4vdjm_Z2f_GTQBwKnWlrzVcctTb-K5sfN8pXDaWODiA,13942
pip/_vendor/html5lib/treebuilders/dom.py,sha256=SY3MsijXyzdNPc8aK5IQsupBoM8J67y56DgNtGvsb9g,8835
pip/_vendor/html5lib/treebuilders/etree.py,sha256=aqIBOGj_dFYqBURIcTegGNBhAIJOw5iFDHb4jrkYH-8,12764
pip/_vendor/html5lib/treebuilders/etree_lxml.py,sha256=CEgwHMIQZvIDFAqct4kqPkVtyKIm9efHFq_VeExEPCA,14161
pip/_vendor/html5lib/treewalkers/__init__.py,sha256=CFpUOCfLuhAgVJ8NYk9wviCu1khYnv7XRStvyzU1Fws,5544
pip/_vendor/html5lib/treewalkers/base.py,sha256=ei-2cFbNFd0gRjyaFmxnxZGLNID4o0bHFCH9bMyZ5Bk,4939
pip/_vendor/html5lib/treewalkers/dom.py,sha256=EHyFR8D8lYNnyDU9lx_IKigVJRyecUGua0mOi7HBukc,1413
pip/_vendor/html5lib/treewalkers/etree.py,sha256=8jVLEY2FjgN4RFugwhAh44l9ScVYoDStQFCnlPwvafI,4684
pip/_vendor/html5lib/treewalkers/etree_lxml.py,sha256=sY6wfRshWTllu6n48TPWpKsQRPp-0CQrT0hj_AdzHSU,6309
pip/_vendor/html5lib/treewalkers/genshi.py,sha256=4D2PECZ5n3ZN3qu3jMl9yY7B81jnQApBQSVlfaIuYbA,2309
pip/_vendor/idna/__init__.py,sha256=9Nt7xpyet3DmOrPUGooDdAwmHZZu1qUAy2EaJ93kGiQ,58
pip/_vendor/idna/codec.py,sha256=lvYb7yu7PhAqFaAIAdWcwgaWI2UmgseUua-1c0AsG0A,3299
pip/_vendor/idna/compat.py,sha256=R-h29D-6mrnJzbXxymrWUW7iZUvy-26TQwZ0ij57i4U,232
pip/_vendor/idna/core.py,sha256=GafiWdYQIK5TSjWdRzCYCho704ALtMCrV_dnXXn57U0,11390
pip/_vendor/idna/idnadata.py,sha256=-Cg83lurKoA9p7lb0lMAsos0rFz1dnKrGeBE3o8UuCA,32999
pip/_vendor/idna/intranges.py,sha256=TY1lpxZIQWEP6tNqjZkFA5hgoMWOj1OBmnUG8ihT87E,1749
pip/_vendor/idna/package_data.py,sha256=KMSUTS_M7ZZ7Ugl_V_EOxV-D3o7v7yVkt45JK_bpW24,21
pip/_vendor/idna/uts46data.py,sha256=YylQYBfljAx_WVqR2D7HgcGGyVCWwPm6uF38aERuhyw,184944
pip/_vendor/lockfile/__init__.py,sha256=Tqpz90DwKYfhPsfzVOJl84TL87pdFE5ePNHdXAxs4Tk,9371
pip/_vendor/lockfile/linklockfile.py,sha256=C7OH3H4GdK68u4FQgp8fkP2kO4fyUTSyj3X6blgfobc,2652
pip/_vendor/lockfile/mkdirlockfile.py,sha256=e3qgIL-etZMLsS-3ft19iW_8IQ360HNkGOqE3yBKsUw,3096
pip/_vendor/lockfile/pidlockfile.py,sha256=ukH9uk6NFuxyVmG5QiWw4iKq3fT7MjqUguX95avYPIY,6090
pip/_vendor/lockfile/sqlitelockfile.py,sha256=o2TMkMRY0iwn-iL1XMRRIFStMUkS4i3ajceeYNntKFg,5506
pip/_vendor/lockfile/symlinklockfile.py,sha256=ABwXXmvTHvCl5viPblShL3PG-gGsLiT1roAMfDRwhi8,2616
pip/_vendor/packaging/__about__.py,sha256=zkcCPTN_6TcLW0Nrlg0176-R1QQ_WVPTm8sz1R4-HjM,720
pip/_vendor/packaging/__init__.py,sha256=_vNac5TrzwsrzbOFIbF-5cHqc_Y2aPT2D7zrIR06BOo,513
pip/_vendor/packaging/_compat.py,sha256=Vi_A0rAQeHbU-a9X0tt1yQm9RqkgQbDSxzRw8WlU9kA,860
pip/_vendor/packaging/_structures.py,sha256=RImECJ4c_wTlaTYYwZYLHEiebDMaAJmK1oPARhw1T5o,1416
pip/_vendor/packaging/markers.py,sha256=mtg2nphJE1oQO39g1DgsdPsMO-guBBClpR-AEYFrbMg,8230
pip/_vendor/packaging/requirements.py,sha256=SD7dVJGjdPUqtoHb47qwK6wWJTQd-ZXWjxpJg83UcBA,4327
pip/_vendor/packaging/specifiers.py,sha256=SAMRerzO3fK2IkFZCaZkuwZaL_EGqHNOz4pni4vhnN0,28025
pip/_vendor/packaging/utils.py,sha256=3m6WvPm6NNxE8rkTGmn0r75B_GZSGg7ikafxHsBN1WA,421
pip/_vendor/packaging/version.py,sha256=OwGnxYfr2ghNzYx59qWIBkrK3SnB6n-Zfd1XaLpnnM0,11556
pip/_vendor/pkg_resources/__init__.py,sha256=CcwuHtCBZn9OTkmgF9cFpadIAMhlrnZTVKTOo4V2p58,103230
pip/_vendor/progress/__init__.py,sha256=Wn1074LUDZovd4zfoVYojnPBgOc6ctHbQX7rp_p8lRA,3023
pip/_vendor/progress/bar.py,sha256=YNPJeRrwYVKFO2nyaEwsQjYByamMWTgJMvQO1NpD-AY,2685
pip/_vendor/progress/counter.py,sha256=kEqA8jWEdwrc6P_9VaRx7bjOHwk9gxl-Q9oVbQ08v5c,1502
pip/_vendor/progress/helpers.py,sha256=FehfwZTv-5cCfsbcMlvlUkm3xZ0cRhsev6XVpmeTF4c,2854
pip/_vendor/progress/spinner.py,sha256=iCVtUQbaJUFHTjn1ZLPQLPYeao4lC9aXAa_HxIeUK6k,1314
pip/_vendor/requests/__init__.py,sha256=JRFVBw6JyV98WQSqv8jshc5_g9xIbLhevI5LHaVi9I4,3575
pip/_vendor/requests/__version__.py,sha256=BQ279bjqQ_8PHhvD_FN36UuFqjbSUqsm7bMeyJV-kVo,436
pip/_vendor/requests/_internal_utils.py,sha256=Zx3PnEUccyfsB-ie11nZVAW8qClJy0gx1qNME7rgT18,1096
pip/_vendor/requests/adapters.py,sha256=LAay3OH0ZbvI6bDW_M5Of06tU5z2fnCflrp_Xm38KsY,21016
pip/_vendor/requests/api.py,sha256=BqVZnvsWu6Pwm0vQ3fw_Dj9_I-gcOR9CbScB2htPArA,6237
pip/_vendor/requests/auth.py,sha256=4KCFQHrL1Lcox3uMh4tjOh3OrJhw-F5zti91wY-ZyTY,9728
pip/_vendor/requests/certs.py,sha256=nXRVq9DtGmv_1AYbwjTu9UrgAcdJv05ZvkNeaoLOZxY,465
pip/_vendor/requests/compat.py,sha256=kcqhV7U43c4i8Ouk5e5YdJXMDEmWNLT97LYm6Uor-74,1626
pip/_vendor/requests/cookies.py,sha256=u7QC5hmloMwdT9-2taz5GpwAvzp2LTUS9cP4SWUKnfM,18208
pip/_vendor/requests/exceptions.py,sha256=oZwYwCm65Y0FMuFqojEgUlWUBQ4MkXRy5URHV1b98L4,3115
pip/_vendor/requests/help.py,sha256=UuBTtc7tEpnU_ivnpuk2hjgzuS6z7GnTEkSbENlc1XQ,3667
pip/_vendor/requests/hooks.py,sha256=HXAHoC1FNTFRZX6-lNdvPM7Tst4kvGwYTN-AOKRxoRU,767
pip/_vendor/requests/models.py,sha256=lcz2GEOe2eOu-GqAGdpA0vJUpI7EE4eDSlWI78R8Y64,34051
pip/_vendor/requests/packages.py,sha256=njJmVifY4aSctuW3PP5EFRCxjEwMRDO6J_feG2dKWsI,695
pip/_vendor/requests/sessions.py,sha256=Ug4EFuHIkqS3EPmD__hWy0JVCzoAGv_F342kzVLnHrg,28689
pip/_vendor/requests/status_codes.py,sha256=a9bwuU7lMr4HshsRZdzBbUsYVsIo4Fu9GYg1XFTFFPc,3323
pip/_vendor/requests/structures.py,sha256=yexCvWbX40M6E8mLQOpAGZZ-ZoAnyaT2dni-Bp-b42g,3012
pip/_vendor/requests/utils.py,sha256=YEGPbyXaf3hosTL0dI4JrCIDpGYaFgHtLhYj96py7AQ,27695
pip/_vendor/urllib3/__init__.py,sha256=EfUPF9RHveaF9g5dcK5kBsGDp5LrIB-396MpK2RQk1I,2853
pip/_vendor/urllib3/_collections.py,sha256=b0-x45LBArs96Rum5xGAbPsriwfB3MZVQbsv7lFiUwE,10204
pip/_vendor/urllib3/connection.py,sha256=4GKR8uXHz6IpztYhtuhKBqXj84HbbFUF3CvwymGfLD0,13003
pip/_vendor/urllib3/connectionpool.py,sha256=5ub8CXnKs1wc2X-MyuVVPo3_9scWLghSgbHOJTpQXuE,35358
pip/_vendor/urllib3/exceptions.py,sha256=dz1gBEgtROnLrW8V911KhVZWeAn3H2OhDGztWNXQpr0,6603
pip/_vendor/urllib3/fields.py,sha256=YrNRM8RBUmM8guXKUQFa3kwj6XvQZ78Z8inE6l-YK-E,5943
pip/_vendor/urllib3/filepost.py,sha256=NF6Rly66bilWU-sdULXjCdQgN1uRxfFRedeifcRLzkU,2321
pip/_vendor/urllib3/poolmanager.py,sha256=V843K_nTlkV8u3GIj6M-ProgIuUIkqpgOsLy_epC-q4,16820
pip/_vendor/urllib3/request.py,sha256=wrt2D0SWLLgTRKrRnaZophq2xXpCvNRd7RMT6F5o5hY,5946
pip/_vendor/urllib3/response.py,sha256=7mGUH35L2IPuZVOY7QvDQ1GSSKIf6V6geJXThdjmQD4,22903
pip/_vendor/urllib3/contrib/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
pip/_vendor/urllib3/contrib/appengine.py,sha256=41l3arTy-kBBpOdVpSPYVC64Qo7RLnXnDED6hcIthA0,10865
pip/_vendor/urllib3/contrib/ntlmpool.py,sha256=Q9-rO5Rh2-IqyEd4ZicpTDfMnOlf0IPPCkjhChBCjV4,4478
pip/_vendor/urllib3/contrib/pyopenssl.py,sha256=BxJ1yMPE62duuHJP6jlZxLz_FNTKbWI0b-nVRKlBDgI,15354
pip/_vendor/urllib3/contrib/securetransport.py,sha256=ZRPz6Q1tnsu9H1BOAQVUSHIyowWmfaBb7pGlbG5iOPk,30501
pip/_vendor/urllib3/contrib/socks.py,sha256=zPYUKMg_c0n9HFjZPG9nGN2kjpaH7qUCZxrD5B7G0_I,6195
pip/_vendor/urllib3/contrib/_securetransport/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
pip/_vendor/urllib3/contrib/_securetransport/bindings.py,sha256=x2kLSh-ASZKsun0FxtraBuLVe3oHuth4YW6yZ5Vof-w,17560
pip/_vendor/urllib3/contrib/_securetransport/low_level.py,sha256=UbhUykEH6HUIJud9_rn_6YWjionk5iq_rq6YrhVM6Co,12062
pip/_vendor/urllib3/packages/__init__.py,sha256=nlChrGzkjCkmhCX9HrF_qHPUgosfsPQkVIJxiiLhk9g,109
pip/_vendor/urllib3/packages/ordered_dict.py,sha256=VQaPONfhVMsb8B63Xg7ZOydJqIE_jzeMhVN3Pec6ogw,8935
pip/_vendor/urllib3/packages/six.py,sha256=A6hdJZVjI3t_geebZ9BzUvwRrIXo0lfwzQlM2LcKyas,30098
pip/_vendor/urllib3/packages/backports/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
pip/_vendor/urllib3/packages/backports/makefile.py,sha256=r1IADol_pBBq2Y1ub4CPyuS2hXuShK47nfFngZRcRhI,1461
pip/_vendor/urllib3/packages/ssl_match_hostname/__init__.py,sha256=WBVbxQBojNAxfZwNavkox3BgJiMA9BJmm-_fwd0jD_o,688
pip/_vendor/urllib3/packages/ssl_match_hostname/_implementation.py,sha256=lAj7qGCZLOldhn8gZDY6Tqp4mvgkbTfy4k4gDIDRo8g,5702
pip/_vendor/urllib3/util/__init__.py,sha256=6Ran4oAVIy40Cu_oEPWnNV9bwF5rXx6G1DUZ7oehjPY,1044
pip/_vendor/urllib3/util/connection.py,sha256=_6_5JZJF3HHRXR7HaxHg3mk7qMKK3N0nl3DL8gFAfo4,4237
pip/_vendor/urllib3/util/request.py,sha256=H5_lrHvtwl2U2BbT1UYN9HpruNc1gsNFlz2njQmhPrQ,3705
pip/_vendor/urllib3/util/response.py,sha256=SSNL888W-MQ8t3HAi44kNGgF682p6H__ytEXzBYxV_M,2343
pip/_vendor/urllib3/util/retry.py,sha256=ZfL_m5PNUz8XSNy4VJT77Z3EnykjPBLYYHF-3rF_jeM,15104
pip/_vendor/urllib3/util/selectors.py,sha256=PIINzwjiD5Z6IyTKA1tR5n1kCOXyThpDCE2fCVFzLeM,21147
pip/_vendor/urllib3/util/ssl_.py,sha256=4cgfqqgM5U_71CgpKG-aqcUDInWv5-YaPeguohjC97I,12214
pip/_vendor/urllib3/util/timeout.py,sha256=7lHNrgL5YH2cI1j-yZnzV_J8jBlRVdmFhQaNyM1_2b8,9757
pip/_vendor/urllib3/util/url.py,sha256=2hwSEH6nZjUTeE6o54BmZy_8irGtOZpGezXExDcsP1g,6798
pip/_vendor/urllib3/util/wait.py,sha256=Q_pd_bD6iaPgRKwEmcjTYDrSPj4Dd4ojykmqA398b8o,1451
pip/_vendor/webencodings/__init__.py,sha256=t7rAQQxXwalY-ak9hTl73qHjhia9UH-sL-e00qQrBpo,10576
pip/_vendor/webencodings/labels.py,sha256=4AO_KxTddqGtrL9ns7kAPjb0CcN6xsCIxbK37HY9r3E,8979
pip/_vendor/webencodings/mklabels.py,sha256=GYIeywnpaLnP0GSic8LFWgd0UVvO_l1Nc6YoF-87R_4,1305
pip/_vendor/webencodings/tests.py,sha256=7vTk7LgOJn_t1XtT_viofZlEJ7cJCzPe_hvVHOkcQl8,6562
pip/_vendor/webencodings/x_user_defined.py,sha256=72cfPRhbfkRCGkkA8ZnvVV7UnoiLb5uPMhXwhrXiLPk,4306
pip/commands/__init__.py,sha256=2Uq3HCdjchJD9FL1LB7rd5v6UySVAVizX0W3EX3hIoE,2244
pip/commands/check.py,sha256=-A7GI1-WZBh9a4P6UoH_aR-J7I8Lz8ly7m3wnCjmevs,1382
pip/commands/completion.py,sha256=kkPgVX7SUcJ_8Juw5GkgWaxHN9_45wmAr9mGs1zXEEs,2453
pip/commands/download.py,sha256=8RuuPmSYgAq3iEDTqZY_1PDXRqREdUULHNjWJeAv7Mo,7810
pip/commands/freeze.py,sha256=h6-yFMpjCjbNj8-gOm5UuoF6cg14N5rPV4TCi3_CeuI,2835
pip/commands/hash.py,sha256=MCt4jEFyfoce0lVeNEz1x49uaTY-VDkKiBvvxrVcHkw,1597
pip/commands/help.py,sha256=84HWkEdnGP_AEBHnn8gJP2Te0XTXRKFoXqXopbOZTNo,982
pip/commands/install.py,sha256=q45kfTQUKkUJLCdPs38FKYfrVeFz4i9WyeRLfcr4b-Y,18289
pip/commands/list.py,sha256=93bCiFyt2Qut_YHkYHJMZHpXladmxsjS-yOtZeb3uqI,11369
pip/commands/search.py,sha256=oTs9QNdefnrmCV_JeftG0PGiMuYVmiEDF1OUaYsmDao,4502
pip/commands/show.py,sha256=ZYM57_7U8KP9MQIIyHKQdZxmiEZByy-DRzB697VFoTY,5891
pip/commands/uninstall.py,sha256=tz8cXz4WdpUdnt3RvpdQwH6_SNMB50egBIZWa1dwfcc,2884
pip/commands/wheel.py,sha256=z5SEhws2YRMb0Ml1IEkg6jFZMLRpLl86bHCrQbYt5zo,7729
pip/compat/__init__.py,sha256=2Xs_IpsmdRgHbQgQO0c8_lPvHJnQXHyGWxPbLbYJL4c,4672
pip/compat/dictconfig.py,sha256=dRrelPDWrceDSzFT51RTEVY2GuM7UDyc5Igh_tn4Fvk,23096
pip/models/__init__.py,sha256=0Rs7_RA4DxeOkWT5Cq4CQzDrSEhvYcN3TH2cazr72PE,71
pip/models/index.py,sha256=pUfbO__v3mD9j-2n_ClwPS8pVyx4l2wIwyvWt8GMCRA,487
pip/operations/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
pip/operations/check.py,sha256=uwUN9cs1sPo7c0Sj6pRrSv7b22Pk29SXUImTelVchMQ,1590
pip/operations/freeze.py,sha256=k-7w7LsM-RpPv7ERBzHiPpYkH-GuYfHLyR-Cp_1VPL0,5194
pip/req/__init__.py,sha256=vFwZY8_Vc1WU1zFAespg1My_r_AT3n7cN0W9eX0EFqk,276
pip/req/req_file.py,sha256=fG9MDsXUNPhmGwxUiwrIXEynyD8Q7s3L47-hLZPDXq0,11926
pip/req/req_install.py,sha256=g0HClWrzqIqm5Lxiyd3wlaCFrdzQVqMJEAZIkv1XTtc,46741
pip/req/req_set.py,sha256=T6bbKdaL8XAdj6RfXxFUlinNUYEnbcMXlQ24kMvkq0s,34846
pip/req/req_uninstall.py,sha256=fdH2VgCjEC8NRYDS7fRu3ZJaBBUEy-N5muwxDX5MBNM,6897
pip/utils/__init__.py,sha256=zggUku3mu_75m-RCTdBD_mYJMg15wKMQ7UGjTZkRDJs,27757
pip/utils/appdirs.py,sha256=kj2LK-I2fC5QnEh_A_v-ev_IQMcXaWWF5DE39sNvCLQ,8811
pip/utils/build.py,sha256=4smLRrfSCmXmjEnVnMFh2tBEpNcSLRe6J0ejZJ-wWJE,1312
pip/utils/deprecation.py,sha256=X_FMjtDbMJqfqEkdRrki-mYyIdPB6I6DHUTCA_ChY6M,2232
pip/utils/encoding.py,sha256=NQxGiFS5GbeAveLZTnx92t5r0PYqvt0iRnP2u9SGG1w,971
pip/utils/filesystem.py,sha256=ZEVBuYM3fqr2_lgOESh4Y7fPFszGD474zVm_M3Mb5Tk,899
pip/utils/glibc.py,sha256=jcQYjt_oJLPKVZB28Kauy4Sw70zS-wawxoU1HHX36_0,2939
pip/utils/hashes.py,sha256=oMk7cd3PbJgzpSQyXq1MytMud5f6H5Oa2YY5hYuCq6I,2866
pip/utils/logging.py,sha256=7yWu4gZw-Qclj7X80QVdpGWkdTWGKT4LiUVKcE04pro,3327
pip/utils/outdated.py,sha256=9xLA0dbtgGBb07OTI1bHbrA5rVFtOv7XbBCdSosRe6s,5989
pip/utils/packaging.py,sha256=qhmli14odw6DIhWJgQYS2Q0RrSbr8nXNcG48f5yTRms,2080
pip/utils/setuptools_build.py,sha256=0blfscmNJW_iZ5DcswJeDB_PbtTEjfK9RL1R1WEDW2E,278
pip/utils/ui.py,sha256=pbDkSAeumZ6jdZcOJ2yAbx8iBgeP2zfpqNnLJK1gskQ,11597
pip/vcs/__init__.py,sha256=WafFliUTHMmsSISV8PHp1M5EXDNSWyJr78zKaQmPLdY,12374
pip/vcs/bazaar.py,sha256=tYTwc4b4off8mr0O2o8SiGejqBDJxcbDBMSMd9-ISYc,3803
pip/vcs/git.py,sha256=gjC_g3tv-DA4JXiYi8tlg6TRI1W2xZgHmATlf5TsR80,11564
pip/vcs/mercurial.py,sha256=xG6rDiwHCRytJEs23SIHBXl_SwQo2jkkdD_6rVVP5h4,3472
pip/vcs/subversion.py,sha256=GAuX2Sk7IZvJyEzENKcVld_wGBrQ3fpXDlXjapZEYdI,9350
pip-9.0.3.dist-info/DESCRIPTION.rst,sha256=Va8Wj1XBpTbVQ2Z41mZRJdALEeziiS_ZewWn1H2ecY4,1287
pip-9.0.3.dist-info/METADATA,sha256=kM2zXDoIPiZ2qojfkaDC7aKqTFwuwgMRVJ7FYUtAAVk,2553
pip-9.0.3.dist-info/RECORD,,
pip-9.0.3.dist-info/WHEEL,sha256=kdsN-5OJAZIiHN-iO4Rhl82KyS0bDWf4uBwMbkNafr8,110
pip-9.0.3.dist-info/entry_points.txt,sha256=Q-fR2tcp9DRdeXoGn1wR67Xecy32o5EyQEnzDghwqqk,68
pip-9.0.3.dist-info/metadata.json,sha256=4Lmrui3knL0bgoxl18scys1UztOfugUfCzARcpKW4zA,1565
pip-9.0.3.dist-info/top_level.txt,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
../../../bin/pip,sha256=a5Jycd6ha0m0MHdBHQlJybs8bw48knoS20snPPooX78,218
../../../bin/pip3,sha256=a5Jycd6ha0m0MHdBHQlJybs8bw48knoS20snPPooX78,218
../../../bin/pip3.6,sha256=a5Jycd6ha0m0MHdBHQlJybs8bw48knoS20snPPooX78,218
pip-9.0.3.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
pip/compat/__pycache__/dictconfig.cpython-36.pyc,,
pip/compat/__pycache__/__init__.cpython-36.pyc,,
pip/utils/__pycache__/build.cpython-36.pyc,,
pip/utils/__pycache__/appdirs.cpython-36.pyc,,
pip/utils/__pycache__/logging.cpython-36.pyc,,
pip/utils/__pycache__/hashes.cpython-36.pyc,,
pip/utils/__pycache__/encoding.cpython-36.pyc,,
pip/utils/__pycache__/packaging.cpython-36.pyc,,
pip/utils/__pycache__/deprecation.cpython-36.pyc,,
pip/utils/__pycache__/glibc.cpython-36.pyc,,
pip/utils/__pycache__/filesystem.cpython-36.pyc,,
pip/utils/__pycache__/setuptools_build.cpython-36.pyc,,
pip/utils/__pycache__/outdated.cpython-36.pyc,,
pip/utils/__pycache__/ui.cpython-36.pyc,,
pip/utils/__pycache__/__init__.cpython-36.pyc,,
pip/vcs/__pycache__/subversion.cpython-36.pyc,,
pip/vcs/__pycache__/mercurial.cpython-36.pyc,,
pip/vcs/__pycache__/bazaar.cpython-36.pyc,,
pip/vcs/__pycache__/git.cpython-36.pyc,,
pip/vcs/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/colorama/__pycache__/ansi.cpython-36.pyc,,
pip/_vendor/colorama/__pycache__/initialise.cpython-36.pyc,,
pip/_vendor/colorama/__pycache__/winterm.cpython-36.pyc,,
pip/_vendor/colorama/__pycache__/win32.cpython-36.pyc,,
pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.pyc,,
pip/_vendor/colorama/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.pyc,,
pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/selectors.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/request.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/response.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/url.cpython-36.pyc,,
pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/_collections.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/request.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/response.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/filepost.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/fields.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/connection.cpython-36.pyc,,
pip/_vendor/urllib3/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.pyc,,
pip/_vendor/urllib3/packages/__pycache__/ordered_dict.cpython-36.pyc,,
pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.pyc,,
pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.pyc,,
pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/util.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/database.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/markers.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/manifest.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/scripts.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/compat.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/metadata.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/resources.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/version.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/locators.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/index.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/wheel.cpython-36.pyc,,
pip/_vendor/distlib/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.pyc,,
pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.pyc,,
pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/__pycache__/re-vendor.cpython-36.pyc,,
pip/_vendor/__pycache__/appdirs.cpython-36.pyc,,
pip/_vendor/__pycache__/six.cpython-36.pyc,,
pip/_vendor/__pycache__/ipaddress.cpython-36.pyc,,
pip/_vendor/__pycache__/retrying.cpython-36.pyc,,
pip/_vendor/__pycache__/distro.cpython-36.pyc,,
pip/_vendor/__pycache__/pyparsing.cpython-36.pyc,,
pip/_vendor/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/cachecontrol/caches/__pycache__/redis_cache.cpython-36.pyc,,
pip/_vendor/cachecontrol/caches/__pycache__/file_cache.cpython-36.pyc,,
pip/_vendor/cachecontrol/caches/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/filewrapper.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/compat.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/heuristics.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/adapter.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/controller.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/wrapper.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/serialize.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/_cmd.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/cache.cpython-36.pyc,,
pip/_vendor/cachecontrol/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/enums.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/compat.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/escsm.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/big5freq.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/version.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/escprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/chardet/__pycache__/big5prober.cpython-36.pyc,,
pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.pyc,,
pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/webencodings/__pycache__/labels.cpython-36.pyc,,
pip/_vendor/webencodings/__pycache__/tests.cpython-36.pyc,,
pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.pyc,,
pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.pyc,,
pip/_vendor/webencodings/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/pkg_resources/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/__version__.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/packages.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/utils.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/adapters.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/_internal_utils.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/help.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/hooks.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/compat.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/auth.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/api.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/sessions.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/structures.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/status_codes.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/models.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/exceptions.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/cookies.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/certs.cpython-36.pyc,,
pip/_vendor/requests/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/requirements.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/utils.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/markers.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/_compat.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/__about__.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/_structures.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/version.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc,,
pip/_vendor/packaging/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/lockfile/__pycache__/sqlitelockfile.cpython-36.pyc,,
pip/_vendor/lockfile/__pycache__/symlinklockfile.cpython-36.pyc,,
pip/_vendor/lockfile/__pycache__/pidlockfile.cpython-36.pyc,,
pip/_vendor/lockfile/__pycache__/mkdirlockfile.cpython-36.pyc,,
pip/_vendor/lockfile/__pycache__/linklockfile.cpython-36.pyc,,
pip/_vendor/lockfile/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.pyc,,
pip/_vendor/html5lib/_trie/__pycache__/datrie.cpython-36.pyc,,
pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.pyc,,
pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/_utils.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/constants.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/serializer.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.pyc,,
pip/_vendor/html5lib/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.pyc,,
pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.pyc,,
pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.pyc,,
pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.pyc,,
pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.pyc,,
pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.pyc,,
pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.pyc,,
pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.pyc,,
pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.pyc,,
pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.pyc,,
pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.pyc,,
pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.pyc,,
pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/progress/__pycache__/spinner.cpython-36.pyc,,
pip/_vendor/progress/__pycache__/bar.cpython-36.pyc,,
pip/_vendor/progress/__pycache__/counter.cpython-36.pyc,,
pip/_vendor/progress/__pycache__/helpers.cpython-36.pyc,,
pip/_vendor/progress/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/certifi/__pycache__/__main__.cpython-36.pyc,,
pip/_vendor/certifi/__pycache__/core.cpython-36.pyc,,
pip/_vendor/certifi/__pycache__/__init__.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/compat.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/uts46data.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/codec.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/idnadata.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/package_data.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/core.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/intranges.cpython-36.pyc,,
pip/_vendor/idna/__pycache__/__init__.cpython-36.pyc,,
pip/__pycache__/cmdoptions.cpython-36.pyc,,
pip/__pycache__/download.cpython-36.pyc,,
pip/__pycache__/__main__.cpython-36.pyc,,
pip/__pycache__/basecommand.cpython-36.pyc,,
pip/__pycache__/baseparser.cpython-36.pyc,,
pip/__pycache__/locations.cpython-36.pyc,,
pip/__pycache__/pep425tags.cpython-36.pyc,,
pip/__pycache__/status_codes.cpython-36.pyc,,
pip/__pycache__/exceptions.cpython-36.pyc,,
pip/__pycache__/index.cpython-36.pyc,,
pip/__pycache__/wheel.cpython-36.pyc,,
pip/__pycache__/__init__.cpython-36.pyc,,
pip/operations/__pycache__/check.cpython-36.pyc,,
pip/operations/__pycache__/freeze.cpython-36.pyc,,
pip/operations/__pycache__/__init__.cpython-36.pyc,,
pip/commands/__pycache__/completion.cpython-36.pyc,,
pip/commands/__pycache__/download.cpython-36.pyc,,
pip/commands/__pycache__/uninstall.cpython-36.pyc,,
pip/commands/__pycache__/check.cpython-36.pyc,,
pip/commands/__pycache__/help.cpython-36.pyc,,
pip/commands/__pycache__/list.cpython-36.pyc,,
pip/commands/__pycache__/show.cpython-36.pyc,,
pip/commands/__pycache__/search.cpython-36.pyc,,
pip/commands/__pycache__/install.cpython-36.pyc,,
pip/commands/__pycache__/hash.cpython-36.pyc,,
pip/commands/__pycache__/freeze.cpython-36.pyc,,
pip/commands/__pycache__/wheel.cpython-36.pyc,,
pip/commands/__pycache__/__init__.cpython-36.pyc,,
pip/models/__pycache__/index.cpython-36.pyc,,
pip/models/__pycache__/__init__.cpython-36.pyc,,
pip/req/__pycache__/req_file.cpython-36.pyc,,
pip/req/__pycache__/req_uninstall.cpython-36.pyc,,
pip/req/__pycache__/req_set.cpython-36.pyc,,
pip/req/__pycache__/req_install.cpython-36.pyc,,
pip/req/__pycache__/__init__.cpython-36.pyc,,
pip-9.0.3.dist-info/metadata.json 0000644 00000003035 14751155147 0012362 0 ustar 00 {"classifiers": ["Development Status :: 5 - Production/Stable", "Intended Audience :: Developers", "License :: OSI Approved :: MIT License", "Topic :: Software Development :: Build Tools", "Programming Language :: Python :: 2", "Programming Language :: Python :: 2.6", "Programming Language :: Python :: 2.7", "Programming Language :: Python :: 3", "Programming Language :: Python :: 3.3", "Programming Language :: Python :: 3.4", "Programming Language :: Python :: 3.5", "Programming Language :: Python :: Implementation :: PyPy"], "extensions": {"python.commands": {"wrap_console": {"pip": "pip:main", "pip3": "pip:main", "pip3.6": "pip:main"}}, "python.details": {"contacts": [{"email": "python-virtualenv@groups.google.com", "name": "The pip developers", "role": "author"}], "document_names": {"description": "DESCRIPTION.rst"}, "project_urls": {"Home": "https://pip.pypa.io/"}}, "python.exports": {"console_scripts": {"pip": "pip:main", "pip3": "pip:main", "pip3.6": "pip:main"}}}, "extras": ["testing"], "generator": "bdist_wheel (0.30.0)", "keywords": ["easy_install", "distutils", "setuptools", "egg", "virtualenv"], "license": "MIT", "metadata_version": "2.0", "name": "pip", "requires_python": ">=2.6,!=3.0.*,!=3.1.*,!=3.2.*", "run_requires": [{"extra": "testing", "requires": ["mock", "pretend", "pytest", "scripttest (>=1.3)", "virtualenv (>=1.10)"]}], "summary": "The PyPA recommended tool for installing Python packages.", "test_requires": [{"requires": ["mock", "pretend", "pytest", "scripttest (>=1.3)", "virtualenv (>=1.10)"]}], "version": "9.0.3"} pip-9.0.3.dist-info/METADATA 0000644 00000004771 14751155147 0011022 0 ustar 00 Metadata-Version: 2.0
Name: pip
Version: 9.0.3
Summary: The PyPA recommended tool for installing Python packages.
Home-page: https://pip.pypa.io/
Author: The pip developers
Author-email: python-virtualenv@groups.google.com
License: MIT
Keywords: easy_install distutils setuptools egg virtualenv
Platform: UNKNOWN
Classifier: Development Status :: 5 - Production/Stable
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: MIT License
Classifier: Topic :: Software Development :: Build Tools
Classifier: Programming Language :: Python :: 2
Classifier: Programming Language :: Python :: 2.6
Classifier: Programming Language :: Python :: 2.7
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.3
Classifier: Programming Language :: Python :: 3.4
Classifier: Programming Language :: Python :: 3.5
Classifier: Programming Language :: Python :: Implementation :: PyPy
Requires-Python: >=2.6,!=3.0.*,!=3.1.*,!=3.2.*
Provides-Extra: testing
Provides-Extra: testing
Requires-Dist: pytest; extra == 'testing'
Requires-Dist: virtualenv (>=1.10); extra == 'testing'
Requires-Dist: scripttest (>=1.3); extra == 'testing'
Requires-Dist: mock; extra == 'testing'
Requires-Dist: pretend; extra == 'testing'
pip
===
The `PyPA recommended
<https://packaging.python.org/en/latest/current/>`_
tool for installing Python packages.
* `Installation <https://pip.pypa.io/en/stable/installing.html>`_
* `Documentation <https://pip.pypa.io/>`_
* `Changelog <https://pip.pypa.io/en/stable/news.html>`_
* `Github Page <https://github.com/pypa/pip>`_
* `Issue Tracking <https://github.com/pypa/pip/issues>`_
* `User mailing list <http://groups.google.com/group/python-virtualenv>`_
* `Dev mailing list <http://groups.google.com/group/pypa-dev>`_
* User IRC: #pypa on Freenode.
* Dev IRC: #pypa-dev on Freenode.
.. image:: https://img.shields.io/pypi/v/pip.svg
:target: https://pypi.python.org/pypi/pip
.. image:: https://img.shields.io/travis/pypa/pip/master.svg
:target: http://travis-ci.org/pypa/pip
.. image:: https://img.shields.io/appveyor/ci/pypa/pip.svg
:target: https://ci.appveyor.com/project/pypa/pip/history
.. image:: https://readthedocs.org/projects/pip/badge/?version=stable
:target: https://pip.pypa.io/en/stable
Code of Conduct
---------------
Everyone interacting in the pip project's codebases, issue trackers, chat
rooms, and mailing lists is expected to follow the `PyPA Code of Conduct`_.
.. _PyPA Code of Conduct: https://www.pypa.io/en/latest/code-of-conduct/
pip-9.0.3.dist-info/WHEEL 0000644 00000000156 14751155147 0010477 0 ustar 00 Wheel-Version: 1.0
Generator: bdist_wheel (0.30.0)
Root-Is-Purelib: true
Tag: py2-none-any
Tag: py3-none-any
pip-9.0.3.dist-info/entry_points.txt 0000644 00000000104 14751155147 0013177 0 ustar 00 [console_scripts]
pip = pip:main
pip3 = pip:main
pip3.6 = pip:main
syspurpose-1.28.36-py3.6.egg-info/dependency_links.txt 0000644 00000000001 14751155147 0016244 0 ustar 00
syspurpose-1.28.36-py3.6.egg-info/SOURCES.txt 0000644 00000000575 14751155147 0014071 0 ustar 00 README.md
setup.cfg
setup.py
man/syspurpose.8
src/syspurpose/__init__.py
src/syspurpose/cli.py
src/syspurpose/files.py
src/syspurpose/i18n.py
src/syspurpose/main.py
src/syspurpose/utils.py
src/syspurpose.egg-info/PKG-INFO
src/syspurpose.egg-info/SOURCES.txt
src/syspurpose.egg-info/dependency_links.txt
src/syspurpose.egg-info/entry_points.txt
src/syspurpose.egg-info/top_level.txt syspurpose-1.28.36-py3.6.egg-info/entry_points.txt 0000644 00000000065 14751155147 0015475 0 ustar 00 [console_scripts]
syspurpose = syspurpose.main:main
syspurpose-1.28.36-py3.6.egg-info/PKG-INFO 0000644 00000000367 14751155147 0013301 0 ustar 00 Metadata-Version: 1.0
Name: syspurpose
Version: 1.28.36
Summary: Manage Red Hat System Purpose
Home-page: http://www.candlepinproject.org
Author: Chris Snyder
Author-email: chainsaw@redhat.com
License: GPLv2
Description: UNKNOWN
Platform: UNKNOWN
syspurpose-1.28.36-py3.6.egg-info/top_level.txt 0000644 00000000013 14751155147 0014722 0 ustar 00 syspurpose
slip-0.6.4-py3.6.egg-info 0000644 00000000304 14751155147 0010457 0 ustar 00 Metadata-Version: 1.1
Name: slip
Version: 0.6.4
Summary: UNKNOWN
Home-page: UNKNOWN
Author: UNKNOWN
Author-email: UNKNOWN
License: UNKNOWN
Description: UNKNOWN
Platform: UNKNOWN
Requires: selinux
pyparsing.py 0000644 00000700753 14751155147 0007160 0 ustar 00 # module pyparsing.py
#
# Copyright (c) 2003-2016 Paul T. McGuire
#
# Permission is hereby granted, free of charge, to any person obtaining
# a copy of this software and associated documentation files (the
# "Software"), to deal in the Software without restriction, including
# without limitation the rights to use, copy, modify, merge, publish,
# distribute, sublicense, and/or sell copies of the Software, and to
# permit persons to whom the Software is furnished to do so, subject to
# the following conditions:
#
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#
__doc__ = \
"""
pyparsing module - Classes and methods to define and execute parsing grammars
The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you
don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.
Here is a program to parse "Hello, World!" (or any greeting of the form
C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
The program outputs the following::
Hello, World! -> ['Hello', ',', 'World', '!']
The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of '+', '|' and '^' operators.
The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
object with named attributes.
The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.)
- quoted strings
- embedded comments
"""
__version__ = "2.1.10"
__versionTime__ = "07 Oct 2016 01:31 UTC"
__author__ = "Paul McGuire <ptmcg@users.sourceforge.net>"
import string
from weakref import ref as wkref
import copy
import sys
import warnings
import re
import sre_constants
import collections
import pprint
import traceback
import types
from datetime import datetime
try:
from _thread import RLock
except ImportError:
from threading import RLock
try:
from collections import OrderedDict as _OrderedDict
except ImportError:
try:
from ordereddict import OrderedDict as _OrderedDict
except ImportError:
_OrderedDict = None
#~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) )
__all__ = [
'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty',
'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal',
'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or',
'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException',
'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException',
'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter',
'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore',
'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col',
'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString',
'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums',
'htmlComment', 'javaStyleComment', 'line', 'lineEnd', 'lineStart', 'lineno',
'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral',
'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables',
'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity',
'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd',
'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute',
'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation','locatedExpr', 'withClass',
'CloseMatch', 'tokenMap', 'pyparsing_common',
]
system_version = tuple(sys.version_info)[:3]
PY_3 = system_version[0] == 3
if PY_3:
_MAX_INT = sys.maxsize
basestring = str
unichr = chr
_ustr = str
# build list of single arg builtins, that can be used as parse actions
singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]
else:
_MAX_INT = sys.maxint
range = xrange
def _ustr(obj):
"""Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
then < returns the unicode object | encodes it with the default encoding | ... >.
"""
if isinstance(obj,unicode):
return obj
try:
# If this works, then _ustr(obj) has the same behaviour as str(obj), so
# it won't break any existing code.
return str(obj)
except UnicodeEncodeError:
# Else encode it
ret = unicode(obj).encode(sys.getdefaultencoding(), 'xmlcharrefreplace')
xmlcharref = Regex('&#\d+;')
xmlcharref.setParseAction(lambda t: '\\u' + hex(int(t[0][2:-1]))[2:])
return xmlcharref.transformString(ret)
# build list of single arg builtins, tolerant of Python version, that can be used as parse actions
singleArgBuiltins = []
import __builtin__
for fname in "sum len sorted reversed list tuple set any all min max".split():
try:
singleArgBuiltins.append(getattr(__builtin__,fname))
except AttributeError:
continue
_generatorType = type((y for y in range(1)))
def _xml_escape(data):
"""Escape &, <, >, ", ', etc. in a string of data."""
# ampersand must be replaced first
from_symbols = '&><"\''
to_symbols = ('&'+s+';' for s in "amp gt lt quot apos".split())
for from_,to_ in zip(from_symbols, to_symbols):
data = data.replace(from_, to_)
return data
class _Constants(object):
pass
alphas = string.ascii_uppercase + string.ascii_lowercase
nums = "0123456789"
hexnums = nums + "ABCDEFabcdef"
alphanums = alphas + nums
_bslash = chr(92)
printables = "".join(c for c in string.printable if c not in string.whitespace)
class ParseBaseException(Exception):
"""base exception class for all parsing runtime exceptions"""
# Performance tuning: we construct a *lot* of these, so keep this
# constructor as small and fast as possible
def __init__( self, pstr, loc=0, msg=None, elem=None ):
self.loc = loc
if msg is None:
self.msg = pstr
self.pstr = ""
else:
self.msg = msg
self.pstr = pstr
self.parserElement = elem
self.args = (pstr, loc, msg)
@classmethod
def _from_exception(cls, pe):
"""
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
"""
return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)
def __getattr__( self, aname ):
"""supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
"""
if( aname == "lineno" ):
return lineno( self.loc, self.pstr )
elif( aname in ("col", "column") ):
return col( self.loc, self.pstr )
elif( aname == "line" ):
return line( self.loc, self.pstr )
else:
raise AttributeError(aname)
def __str__( self ):
return "%s (at char %d), (line:%d, col:%d)" % \
( self.msg, self.loc, self.lineno, self.column )
def __repr__( self ):
return _ustr(self)
def markInputline( self, markerString = ">!<" ):
"""Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
"""
line_str = self.line
line_column = self.column - 1
if markerString:
line_str = "".join((line_str[:line_column],
markerString, line_str[line_column:]))
return line_str.strip()
def __dir__(self):
return "lineno col line".split() + dir(type(self))
class ParseException(ParseBaseException):
"""
Exception thrown when parse expressions don't match class;
supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
"""
pass
class ParseFatalException(ParseBaseException):
"""user-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediately"""
pass
class ParseSyntaxException(ParseFatalException):
"""just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been found"""
pass
#~ class ReparseException(ParseBaseException):
#~ """Experimental class - parse actions can raise this exception to cause
#~ pyparsing to reparse the input string:
#~ - with a modified input string, and/or
#~ - with a modified start location
#~ Set the values of the ReparseException in the constructor, and raise the
#~ exception in a parse action to cause pyparsing to use the new string/location.
#~ Setting the values as None causes no change to be made.
#~ """
#~ def __init_( self, newstring, restartLoc ):
#~ self.newParseText = newstring
#~ self.reparseLoc = restartLoc
class RecursiveGrammarException(Exception):
"""exception thrown by L{ParserElement.validate} if the grammar could be improperly recursive"""
def __init__( self, parseElementList ):
self.parseElementTrace = parseElementList
def __str__( self ):
return "RecursiveGrammarException: %s" % self.parseElementTrace
class _ParseResultsWithOffset(object):
def __init__(self,p1,p2):
self.tup = (p1,p2)
def __getitem__(self,i):
return self.tup[i]
def __repr__(self):
return repr(self.tup[0])
def setOffset(self,i):
self.tup = (self.tup[0],i)
class ParseResults(object):
"""
Structured parse results, to provide multiple means of access to the parsed data:
- as a list (C{len(results)})
- by list index (C{results[0], results[1]}, etc.)
- by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
"""
def __new__(cls, toklist=None, name=None, asList=True, modal=True ):
if isinstance(toklist, cls):
return toklist
retobj = object.__new__(cls)
retobj.__doinit = True
return retobj
# Performance tuning: we construct a *lot* of these, so keep this
# constructor as small and fast as possible
def __init__( self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance ):
if self.__doinit:
self.__doinit = False
self.__name = None
self.__parent = None
self.__accumNames = {}
self.__asList = asList
self.__modal = modal
if toklist is None:
toklist = []
if isinstance(toklist, list):
self.__toklist = toklist[:]
elif isinstance(toklist, _generatorType):
self.__toklist = list(toklist)
else:
self.__toklist = [toklist]
self.__tokdict = dict()
if name is not None and name:
if not modal:
self.__accumNames[name] = 0
if isinstance(name,int):
name = _ustr(name) # will always return a str, but use _ustr for consistency
self.__name = name
if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None,'',[])):
if isinstance(toklist,basestring):
toklist = [ toklist ]
if asList:
if isinstance(toklist,ParseResults):
self[name] = _ParseResultsWithOffset(toklist.copy(),0)
else:
self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]),0)
self[name].__name = name
else:
try:
self[name] = toklist[0]
except (KeyError,TypeError,IndexError):
self[name] = toklist
def __getitem__( self, i ):
if isinstance( i, (int,slice) ):
return self.__toklist[i]
else:
if i not in self.__accumNames:
return self.__tokdict[i][-1][0]
else:
return ParseResults([ v[0] for v in self.__tokdict[i] ])
def __setitem__( self, k, v, isinstance=isinstance ):
if isinstance(v,_ParseResultsWithOffset):
self.__tokdict[k] = self.__tokdict.get(k,list()) + [v]
sub = v[0]
elif isinstance(k,(int,slice)):
self.__toklist[k] = v
sub = v
else:
self.__tokdict[k] = self.__tokdict.get(k,list()) + [_ParseResultsWithOffset(v,0)]
sub = v
if isinstance(sub,ParseResults):
sub.__parent = wkref(self)
def __delitem__( self, i ):
if isinstance(i,(int,slice)):
mylen = len( self.__toklist )
del self.__toklist[i]
# convert int to slice
if isinstance(i, int):
if i < 0:
i += mylen
i = slice(i, i+1)
# get removed indices
removed = list(range(*i.indices(mylen)))
removed.reverse()
# fixup indices in token dictionary
for name,occurrences in self.__tokdict.items():
for j in removed:
for k, (value, position) in enumerate(occurrences):
occurrences[k] = _ParseResultsWithOffset(value, position - (position > j))
else:
del self.__tokdict[i]
def __contains__( self, k ):
return k in self.__tokdict
def __len__( self ): return len( self.__toklist )
def __bool__(self): return ( not not self.__toklist )
__nonzero__ = __bool__
def __iter__( self ): return iter( self.__toklist )
def __reversed__( self ): return iter( self.__toklist[::-1] )
def _iterkeys( self ):
if hasattr(self.__tokdict, "iterkeys"):
return self.__tokdict.iterkeys()
else:
return iter(self.__tokdict)
def _itervalues( self ):
return (self[k] for k in self._iterkeys())
def _iteritems( self ):
return ((k, self[k]) for k in self._iterkeys())
if PY_3:
keys = _iterkeys
"""Returns an iterator of all named result keys (Python 3.x only)."""
values = _itervalues
"""Returns an iterator of all named result values (Python 3.x only)."""
items = _iteritems
"""Returns an iterator of all named result key-value tuples (Python 3.x only)."""
else:
iterkeys = _iterkeys
"""Returns an iterator of all named result keys (Python 2.x only)."""
itervalues = _itervalues
"""Returns an iterator of all named result values (Python 2.x only)."""
iteritems = _iteritems
"""Returns an iterator of all named result key-value tuples (Python 2.x only)."""
def keys( self ):
"""Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x)."""
return list(self.iterkeys())
def values( self ):
"""Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x)."""
return list(self.itervalues())
def items( self ):
"""Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x)."""
return list(self.iteritems())
def haskeys( self ):
"""Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names."""
return bool(self.__tokdict)
def pop( self, *args, **kwargs):
"""
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
"""
if not args:
args = [-1]
for k,v in kwargs.items():
if k == 'default':
args = (args[0], v)
else:
raise TypeError("pop() got an unexpected keyword argument '%s'" % k)
if (isinstance(args[0], int) or
len(args) == 1 or
args[0] in self):
index = args[0]
ret = self[index]
del self[index]
return ret
else:
defaultvalue = args[1]
return defaultvalue
def get(self, key, defaultValue=None):
"""
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
"""
if key in self:
return self[key]
else:
return defaultValue
def insert( self, index, insStr ):
"""
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
"""
self.__toklist.insert(index, insStr)
# fixup indices in token dictionary
for name,occurrences in self.__tokdict.items():
for k, (value, position) in enumerate(occurrences):
occurrences[k] = _ParseResultsWithOffset(value, position + (position > index))
def append( self, item ):
"""
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
"""
self.__toklist.append(item)
def extend( self, itemseq ):
"""
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
"""
if isinstance(itemseq, ParseResults):
self += itemseq
else:
self.__toklist.extend(itemseq)
def clear( self ):
"""
Clear all elements and results names.
"""
del self.__toklist[:]
self.__tokdict.clear()
def __getattr__( self, name ):
try:
return self[name]
except KeyError:
return ""
if name in self.__tokdict:
if name not in self.__accumNames:
return self.__tokdict[name][-1][0]
else:
return ParseResults([ v[0] for v in self.__tokdict[name] ])
else:
return ""
def __add__( self, other ):
ret = self.copy()
ret += other
return ret
def __iadd__( self, other ):
if other.__tokdict:
offset = len(self.__toklist)
addoffset = lambda a: offset if a<0 else a+offset
otheritems = other.__tokdict.items()
otherdictitems = [(k, _ParseResultsWithOffset(v[0],addoffset(v[1])) )
for (k,vlist) in otheritems for v in vlist]
for k,v in otherdictitems:
self[k] = v
if isinstance(v[0],ParseResults):
v[0].__parent = wkref(self)
self.__toklist += other.__toklist
self.__accumNames.update( other.__accumNames )
return self
def __radd__(self, other):
if isinstance(other,int) and other == 0:
# useful for merging many ParseResults using sum() builtin
return self.copy()
else:
# this may raise a TypeError - so be it
return other + self
def __repr__( self ):
return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) )
def __str__( self ):
return '[' + ', '.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + ']'
def _asStringList( self, sep='' ):
out = []
for item in self.__toklist:
if out and sep:
out.append(sep)
if isinstance( item, ParseResults ):
out += item._asStringList()
else:
out.append( _ustr(item) )
return out
def asList( self ):
"""
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
"""
return [res.asList() if isinstance(res,ParseResults) else res for res in self.__toklist]
def asDict( self ):
"""
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
"""
if PY_3:
item_fn = self.items
else:
item_fn = self.iteritems
def toItem(obj):
if isinstance(obj, ParseResults):
if obj.haskeys():
return obj.asDict()
else:
return [toItem(v) for v in obj]
else:
return obj
return dict((k,toItem(v)) for k,v in item_fn())
def copy( self ):
"""
Returns a new copy of a C{ParseResults} object.
"""
ret = ParseResults( self.__toklist )
ret.__tokdict = self.__tokdict.copy()
ret.__parent = self.__parent
ret.__accumNames.update( self.__accumNames )
ret.__name = self.__name
return ret
def asXML( self, doctag=None, namedItemsOnly=False, indent="", formatted=True ):
"""
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
"""
nl = "\n"
out = []
namedItems = dict((v[1],k) for (k,vlist) in self.__tokdict.items()
for v in vlist)
nextLevelIndent = indent + " "
# collapse out indents if formatting is not desired
if not formatted:
indent = ""
nextLevelIndent = ""
nl = ""
selfTag = None
if doctag is not None:
selfTag = doctag
else:
if self.__name:
selfTag = self.__name
if not selfTag:
if namedItemsOnly:
return ""
else:
selfTag = "ITEM"
out += [ nl, indent, "<", selfTag, ">" ]
for i,res in enumerate(self.__toklist):
if isinstance(res,ParseResults):
if i in namedItems:
out += [ res.asXML(namedItems[i],
namedItemsOnly and doctag is None,
nextLevelIndent,
formatted)]
else:
out += [ res.asXML(None,
namedItemsOnly and doctag is None,
nextLevelIndent,
formatted)]
else:
# individual token, see if there is a name for it
resTag = None
if i in namedItems:
resTag = namedItems[i]
if not resTag:
if namedItemsOnly:
continue
else:
resTag = "ITEM"
xmlBodyText = _xml_escape(_ustr(res))
out += [ nl, nextLevelIndent, "<", resTag, ">",
xmlBodyText,
"</", resTag, ">" ]
out += [ nl, indent, "</", selfTag, ">" ]
return "".join(out)
def __lookup(self,sub):
for k,vlist in self.__tokdict.items():
for v,loc in vlist:
if sub is v:
return k
return None
def getName(self):
"""
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
"""
if self.__name:
return self.__name
elif self.__parent:
par = self.__parent()
if par:
return par.__lookup(self)
else:
return None
elif (len(self) == 1 and
len(self.__tokdict) == 1 and
next(iter(self.__tokdict.values()))[0][1] in (0,-1)):
return next(iter(self.__tokdict.keys()))
else:
return None
def dump(self, indent='', depth=0, full=True):
"""
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
"""
out = []
NL = '\n'
out.append( indent+_ustr(self.asList()) )
if full:
if self.haskeys():
items = sorted((str(k), v) for k,v in self.items())
for k,v in items:
if out:
out.append(NL)
out.append( "%s%s- %s: " % (indent,(' '*depth), k) )
if isinstance(v,ParseResults):
if v:
out.append( v.dump(indent,depth+1) )
else:
out.append(_ustr(v))
else:
out.append(repr(v))
elif any(isinstance(vv,ParseResults) for vv in self):
v = self
for i,vv in enumerate(v):
if isinstance(vv,ParseResults):
out.append("\n%s%s[%d]:\n%s%s%s" % (indent,(' '*(depth)),i,indent,(' '*(depth+1)),vv.dump(indent,depth+1) ))
else:
out.append("\n%s%s[%d]:\n%s%s%s" % (indent,(' '*(depth)),i,indent,(' '*(depth+1)),_ustr(vv)))
return "".join(out)
def pprint(self, *args, **kwargs):
"""
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
"""
pprint.pprint(self.asList(), *args, **kwargs)
# add support for pickle protocol
def __getstate__(self):
return ( self.__toklist,
( self.__tokdict.copy(),
self.__parent is not None and self.__parent() or None,
self.__accumNames,
self.__name ) )
def __setstate__(self,state):
self.__toklist = state[0]
(self.__tokdict,
par,
inAccumNames,
self.__name) = state[1]
self.__accumNames = {}
self.__accumNames.update(inAccumNames)
if par is not None:
self.__parent = wkref(par)
else:
self.__parent = None
def __getnewargs__(self):
return self.__toklist, self.__name, self.__asList, self.__modal
def __dir__(self):
return (dir(type(self)) + list(self.keys()))
collections.MutableMapping.register(ParseResults)
def col (loc,strg):
"""Returns current column within a string, counting newlines as line separators.
The first column is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
"""
s = strg
return 1 if 0<loc<len(s) and s[loc-1] == '\n' else loc - s.rfind("\n", 0, loc)
def lineno(loc,strg):
"""Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
"""
return strg.count("\n",0,loc) + 1
def line( loc, strg ):
"""Returns the line of text containing loc within a string, counting newlines as line separators.
"""
lastCR = strg.rfind("\n", 0, loc)
nextCR = strg.find("\n", loc)
if nextCR >= 0:
return strg[lastCR+1:nextCR]
else:
return strg[lastCR+1:]
def _defaultStartDebugAction( instring, loc, expr ):
print (("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )))
def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ):
print ("Matched " + _ustr(expr) + " -> " + str(toks.asList()))
def _defaultExceptionDebugAction( instring, loc, expr, exc ):
print ("Exception raised:" + _ustr(exc))
def nullDebugAction(*args):
"""'Do-nothing' debug action, to suppress debugging output during parsing."""
pass
# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
#~ 'decorator to trim function calls to match the arity of the target'
#~ def _trim_arity(func, maxargs=3):
#~ if func in singleArgBuiltins:
#~ return lambda s,l,t: func(t)
#~ limit = 0
#~ foundArity = False
#~ def wrapper(*args):
#~ nonlocal limit,foundArity
#~ while 1:
#~ try:
#~ ret = func(*args[limit:])
#~ foundArity = True
#~ return ret
#~ except TypeError:
#~ if limit == maxargs or foundArity:
#~ raise
#~ limit += 1
#~ continue
#~ return wrapper
# this version is Python 2.x-3.x cross-compatible
'decorator to trim function calls to match the arity of the target'
def _trim_arity(func, maxargs=2):
if func in singleArgBuiltins:
return lambda s,l,t: func(t)
limit = [0]
foundArity = [False]
# traceback return data structure changed in Py3.5 - normalize back to plain tuples
if system_version[:2] >= (3,5):
def extract_stack(limit=0):
# special handling for Python 3.5.0 - extra deep call stack by 1
offset = -3 if system_version == (3,5,0) else -2
frame_summary = traceback.extract_stack(limit=-offset+limit-1)[offset]
return [(frame_summary.filename, frame_summary.lineno)]
def extract_tb(tb, limit=0):
frames = traceback.extract_tb(tb, limit=limit)
frame_summary = frames[-1]
return [(frame_summary.filename, frame_summary.lineno)]
else:
extract_stack = traceback.extract_stack
extract_tb = traceback.extract_tb
# synthesize what would be returned by traceback.extract_stack at the call to
# user's parse action 'func', so that we don't incur call penalty at parse time
LINE_DIFF = 6
# IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND
# THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
this_line = extract_stack(limit=2)[-1]
pa_call_line_synth = (this_line[0], this_line[1]+LINE_DIFF)
def wrapper(*args):
while 1:
try:
ret = func(*args[limit[0]:])
foundArity[0] = True
return ret
except TypeError:
# re-raise TypeErrors if they did not come from our arity testing
if foundArity[0]:
raise
else:
try:
tb = sys.exc_info()[-1]
if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
raise
finally:
del tb
if limit[0] <= maxargs:
limit[0] += 1
continue
raise
# copy func name to wrapper for sensible debug output
func_name = "<parse action>"
try:
func_name = getattr(func, '__name__',
getattr(func, '__class__').__name__)
except Exception:
func_name = str(func)
wrapper.__name__ = func_name
return wrapper
class ParserElement(object):
"""Abstract base level parser element class."""
DEFAULT_WHITE_CHARS = " \n\t\r"
verbose_stacktrace = False
@staticmethod
def setDefaultWhitespaceChars( chars ):
r"""
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
"""
ParserElement.DEFAULT_WHITE_CHARS = chars
@staticmethod
def inlineLiteralsUsing(cls):
"""
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
"""
ParserElement._literalStringClass = cls
def __init__( self, savelist=False ):
self.parseAction = list()
self.failAction = None
#~ self.name = "<unknown>" # don't define self.name, let subclasses try/except upcall
self.strRepr = None
self.resultsName = None
self.saveAsList = savelist
self.skipWhitespace = True
self.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
self.copyDefaultWhiteChars = True
self.mayReturnEmpty = False # used when checking for left-recursion
self.keepTabs = False
self.ignoreExprs = list()
self.debug = False
self.streamlined = False
self.mayIndexError = True # used to optimize exception handling for subclasses that don't advance parse index
self.errmsg = ""
self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
self.debugActions = ( None, None, None ) #custom debug actions
self.re = None
self.callPreparse = True # used to avoid redundant calls to preParse
self.callDuringTry = False
def copy( self ):
"""
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
"""
cpy = copy.copy( self )
cpy.parseAction = self.parseAction[:]
cpy.ignoreExprs = self.ignoreExprs[:]
if self.copyDefaultWhiteChars:
cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
return cpy
def setName( self, name ):
"""
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
"""
self.name = name
self.errmsg = "Expected " + self.name
if hasattr(self,"exception"):
self.exception.msg = self.errmsg
return self
def setResultsName( self, name, listAllMatches=False ):
"""
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
NOTE: this returns a *copy* of the original C{ParserElement} object;
this is so that the client can define a basic element, such as an
integer, and reference it in multiple places with different names.
You can also set results names using the abbreviated syntax,
C{expr("name")} in place of C{expr.setResultsName("name")} -
see L{I{__call__}<__call__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
"""
newself = self.copy()
if name.endswith("*"):
name = name[:-1]
listAllMatches=True
newself.resultsName = name
newself.modalResults = not listAllMatches
return newself
def setBreak(self,breakFlag = True):
"""Method to invoke the Python pdb debugger when this element is
about to be parsed. Set C{breakFlag} to True to enable, False to
disable.
"""
if breakFlag:
_parseMethod = self._parse
def breaker(instring, loc, doActions=True, callPreParse=True):
import pdb
pdb.set_trace()
return _parseMethod( instring, loc, doActions, callPreParse )
breaker._originalParseMethod = _parseMethod
self._parse = breaker
else:
if hasattr(self._parse,"_originalParseMethod"):
self._parse = self._parse._originalParseMethod
return self
def setParseAction( self, *fns, **kwargs ):
"""
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
"""
self.parseAction = list(map(_trim_arity, list(fns)))
self.callDuringTry = kwargs.get("callDuringTry", False)
return self
def addParseAction( self, *fns, **kwargs ):
"""
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
"""
self.parseAction += list(map(_trim_arity, list(fns)))
self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
return self
def addCondition(self, *fns, **kwargs):
"""Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
"""
msg = kwargs.get("message", "failed user-defined condition")
exc_type = ParseFatalException if kwargs.get("fatal", False) else ParseException
for fn in fns:
def pa(s,l,t):
if not bool(_trim_arity(fn)(s,l,t)):
raise exc_type(s,l,msg)
self.parseAction.append(pa)
self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
return self
def setFailAction( self, fn ):
"""Define action to perform if parsing fails at this expression.
Fail acton fn is a callable function that takes the arguments
C{fn(s,loc,expr,err)} where:
- s = string being parsed
- loc = location where expression match was attempted and failed
- expr = the parse expression that failed
- err = the exception thrown
The function returns no value. It may throw C{L{ParseFatalException}}
if it is desired to stop parsing immediately."""
self.failAction = fn
return self
def _skipIgnorables( self, instring, loc ):
exprsFound = True
while exprsFound:
exprsFound = False
for e in self.ignoreExprs:
try:
while 1:
loc,dummy = e._parse( instring, loc )
exprsFound = True
except ParseException:
pass
return loc
def preParse( self, instring, loc ):
if self.ignoreExprs:
loc = self._skipIgnorables( instring, loc )
if self.skipWhitespace:
wt = self.whiteChars
instrlen = len(instring)
while loc < instrlen and instring[loc] in wt:
loc += 1
return loc
def parseImpl( self, instring, loc, doActions=True ):
return loc, []
def postParse( self, instring, loc, tokenlist ):
return tokenlist
#~ @profile
def _parseNoCache( self, instring, loc, doActions=True, callPreParse=True ):
debugging = ( self.debug ) #and doActions )
if debugging or self.failAction:
#~ print ("Match",self,"at loc",loc,"(%d,%d)" % ( lineno(loc,instring), col(loc,instring) ))
if (self.debugActions[0] ):
self.debugActions[0]( instring, loc, self )
if callPreParse and self.callPreparse:
preloc = self.preParse( instring, loc )
else:
preloc = loc
tokensStart = preloc
try:
try:
loc,tokens = self.parseImpl( instring, preloc, doActions )
except IndexError:
raise ParseException( instring, len(instring), self.errmsg, self )
except ParseBaseException as err:
#~ print ("Exception raised:", err)
if self.debugActions[2]:
self.debugActions[2]( instring, tokensStart, self, err )
if self.failAction:
self.failAction( instring, tokensStart, self, err )
raise
else:
if callPreParse and self.callPreparse:
preloc = self.preParse( instring, loc )
else:
preloc = loc
tokensStart = preloc
if self.mayIndexError or loc >= len(instring):
try:
loc,tokens = self.parseImpl( instring, preloc, doActions )
except IndexError:
raise ParseException( instring, len(instring), self.errmsg, self )
else:
loc,tokens = self.parseImpl( instring, preloc, doActions )
tokens = self.postParse( instring, loc, tokens )
retTokens = ParseResults( tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults )
if self.parseAction and (doActions or self.callDuringTry):
if debugging:
try:
for fn in self.parseAction:
tokens = fn( instring, tokensStart, retTokens )
if tokens is not None:
retTokens = ParseResults( tokens,
self.resultsName,
asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
modal=self.modalResults )
except ParseBaseException as err:
#~ print "Exception raised in user parse action:", err
if (self.debugActions[2] ):
self.debugActions[2]( instring, tokensStart, self, err )
raise
else:
for fn in self.parseAction:
tokens = fn( instring, tokensStart, retTokens )
if tokens is not None:
retTokens = ParseResults( tokens,
self.resultsName,
asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
modal=self.modalResults )
if debugging:
#~ print ("Matched",self,"->",retTokens.asList())
if (self.debugActions[1] ):
self.debugActions[1]( instring, tokensStart, loc, self, retTokens )
return loc, retTokens
def tryParse( self, instring, loc ):
try:
return self._parse( instring, loc, doActions=False )[0]
except ParseFatalException:
raise ParseException( instring, loc, self.errmsg, self)
def canParseNext(self, instring, loc):
try:
self.tryParse(instring, loc)
except (ParseException, IndexError):
return False
else:
return True
class _UnboundedCache(object):
def __init__(self):
cache = {}
self.not_in_cache = not_in_cache = object()
def get(self, key):
return cache.get(key, not_in_cache)
def set(self, key, value):
cache[key] = value
def clear(self):
cache.clear()
self.get = types.MethodType(get, self)
self.set = types.MethodType(set, self)
self.clear = types.MethodType(clear, self)
if _OrderedDict is not None:
class _FifoCache(object):
def __init__(self, size):
self.not_in_cache = not_in_cache = object()
cache = _OrderedDict()
def get(self, key):
return cache.get(key, not_in_cache)
def set(self, key, value):
cache[key] = value
if len(cache) > size:
cache.popitem(False)
def clear(self):
cache.clear()
self.get = types.MethodType(get, self)
self.set = types.MethodType(set, self)
self.clear = types.MethodType(clear, self)
else:
class _FifoCache(object):
def __init__(self, size):
self.not_in_cache = not_in_cache = object()
cache = {}
key_fifo = collections.deque([], size)
def get(self, key):
return cache.get(key, not_in_cache)
def set(self, key, value):
cache[key] = value
if len(cache) > size:
cache.pop(key_fifo.popleft(), None)
key_fifo.append(key)
def clear(self):
cache.clear()
key_fifo.clear()
self.get = types.MethodType(get, self)
self.set = types.MethodType(set, self)
self.clear = types.MethodType(clear, self)
# argument cache for optimizing repeated calls when backtracking through recursive expressions
packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn't fail
packrat_cache_lock = RLock()
packrat_cache_stats = [0, 0]
# this method gets repeatedly called during backtracking with the same arguments -
# we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
def _parseCache( self, instring, loc, doActions=True, callPreParse=True ):
HIT, MISS = 0, 1
lookup = (self, instring, loc, callPreParse, doActions)
with ParserElement.packrat_cache_lock:
cache = ParserElement.packrat_cache
value = cache.get(lookup)
if value is cache.not_in_cache:
ParserElement.packrat_cache_stats[MISS] += 1
try:
value = self._parseNoCache(instring, loc, doActions, callPreParse)
except ParseBaseException as pe:
# cache a copy of the exception, without the traceback
cache.set(lookup, pe.__class__(*pe.args))
raise
else:
cache.set(lookup, (value[0], value[1].copy()))
return value
else:
ParserElement.packrat_cache_stats[HIT] += 1
if isinstance(value, Exception):
raise value
return (value[0], value[1].copy())
_parse = _parseNoCache
@staticmethod
def resetCache():
ParserElement.packrat_cache.clear()
ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)
_packratEnabled = False
@staticmethod
def enablePackrat(cache_size_limit=128):
"""Enables "packrat" parsing, which adds memoizing to the parsing logic.
Repeated parse attempts at the same string location (which happens
often in many complex grammars) can immediately return a cached value,
instead of re-executing parsing/validating code. Memoizing is done of
both valid results and parsing exceptions.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "compile as you go", you must call
C{enablePackrat} before calling C{psyco.full()}. If you do not do this,
Python will crash. For best results, call C{enablePackrat()} immediately
after importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
"""
if not ParserElement._packratEnabled:
ParserElement._packratEnabled = True
if cache_size_limit is None:
ParserElement.packrat_cache = ParserElement._UnboundedCache()
else:
ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
ParserElement._parse = ParserElement._parseCache
def parseString( self, instring, parseAll=False ):
"""
Execute the parse expression with the given string.
This is the main interface to the client code, once the complete
expression has been built.
If you want the grammar to require that the entire input string be
successfully parsed, then set C{parseAll} to True (equivalent to ending
the grammar with C{L{StringEnd()}}).
Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
in order to report proper column numbers in parse actions.
If the input string contains tabs and
the grammar uses parse actions that use the C{loc} argument to index into the
string being parsed, you can ensure you have a consistent view of the input
string by:
- calling C{parseWithTabs} on your grammar before calling C{parseString}
(see L{I{parseWithTabs}<parseWithTabs>})
- define your parse action using the full C{(s,loc,toks)} signature, and
reference the input string using the parse action's C{s} argument
- explictly expand the tabs in your input string before calling
C{parseString}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
"""
ParserElement.resetCache()
if not self.streamlined:
self.streamline()
#~ self.saveAsList = True
for e in self.ignoreExprs:
e.streamline()
if not self.keepTabs:
instring = instring.expandtabs()
try:
loc, tokens = self._parse( instring, 0 )
if parseAll:
loc = self.preParse( instring, loc )
se = Empty() + StringEnd()
se._parse( instring, loc )
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
else:
return tokens
def scanString( self, instring, maxMatches=_MAX_INT, overlap=False ):
"""
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
C{maxMatches} argument, to clip scanning after 'n' matches are found. If
C{overlap} is specified, then overlapping matches will be reported.
Note that the start and end locations are reported relative to the string
being parsed. See L{I{parseString}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
"""
if not self.streamlined:
self.streamline()
for e in self.ignoreExprs:
e.streamline()
if not self.keepTabs:
instring = _ustr(instring).expandtabs()
instrlen = len(instring)
loc = 0
preparseFn = self.preParse
parseFn = self._parse
ParserElement.resetCache()
matches = 0
try:
while loc <= instrlen and matches < maxMatches:
try:
preloc = preparseFn( instring, loc )
nextLoc,tokens = parseFn( instring, preloc, callPreParse=False )
except ParseException:
loc = preloc+1
else:
if nextLoc > loc:
matches += 1
yield tokens, preloc, nextLoc
if overlap:
nextloc = preparseFn( instring, loc )
if nextloc > loc:
loc = nextLoc
else:
loc += 1
else:
loc = nextLoc
else:
loc = preloc+1
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def transformString( self, instring ):
"""
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
"""
out = []
lastE = 0
# force preservation of <TAB>s, to minimize unwanted transformation of string, and to
# keep string locs straight between transformString and scanString
self.keepTabs = True
try:
for t,s,e in self.scanString( instring ):
out.append( instring[lastE:s] )
if t:
if isinstance(t,ParseResults):
out += t.asList()
elif isinstance(t,list):
out += t
else:
out.append(t)
lastE = e
out.append(instring[lastE:])
out = [o for o in out if o]
return "".join(map(_ustr,_flatten(out)))
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def searchString( self, instring, maxMatches=_MAX_INT ):
"""
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
"""
try:
return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ])
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
"""
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
"""
splits = 0
last = 0
for t,s,e in self.scanString(instring, maxMatches=maxsplit):
yield instring[last:s]
if includeSeparators:
yield t[0]
last = e
yield instring[last:]
def __add__(self, other ):
"""
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return And( [ self, other ] )
def __radd__(self, other ):
"""
Implementation of + operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other + self
def __sub__(self, other):
"""
Implementation of - operator, returns C{L{And}} with error stop
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return And( [ self, And._ErrorStop(), other ] )
def __rsub__(self, other ):
"""
Implementation of - operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other - self
def __mul__(self,other):
"""
Implementation of * operator, allows use of C{expr * 3} in place of
C{expr + expr + expr}. Expressions may also me multiplied by a 2-integer
tuple, similar to C{{min,max}} multipliers in regular expressions. Tuples
may also include C{None} as in:
- C{expr*(n,None)} or C{expr*(n,)} is equivalent
to C{expr*n + L{ZeroOrMore}(expr)}
(read as "at least n instances of C{expr}")
- C{expr*(None,n)} is equivalent to C{expr*(0,n)}
(read as "0 to n instances of C{expr}")
- C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
- C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
Note that C{expr*(None,n)} does not raise an exception if
more than n exprs exist in the input stream; that is,
C{expr*(None,n)} does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
C{expr*(None,n) + ~expr}
"""
if isinstance(other,int):
minElements, optElements = other,0
elif isinstance(other,tuple):
other = (other + (None, None))[:2]
if other[0] is None:
other = (0, other[1])
if isinstance(other[0],int) and other[1] is None:
if other[0] == 0:
return ZeroOrMore(self)
if other[0] == 1:
return OneOrMore(self)
else:
return self*other[0] + ZeroOrMore(self)
elif isinstance(other[0],int) and isinstance(other[1],int):
minElements, optElements = other
optElements -= minElements
else:
raise TypeError("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1]))
else:
raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other))
if minElements < 0:
raise ValueError("cannot multiply ParserElement by negative value")
if optElements < 0:
raise ValueError("second tuple value must be greater or equal to first tuple value")
if minElements == optElements == 0:
raise ValueError("cannot multiply ParserElement by 0 or (0,0)")
if (optElements):
def makeOptionalList(n):
if n>1:
return Optional(self + makeOptionalList(n-1))
else:
return Optional(self)
if minElements:
if minElements == 1:
ret = self + makeOptionalList(optElements)
else:
ret = And([self]*minElements) + makeOptionalList(optElements)
else:
ret = makeOptionalList(optElements)
else:
if minElements == 1:
ret = self
else:
ret = And([self]*minElements)
return ret
def __rmul__(self, other):
return self.__mul__(other)
def __or__(self, other ):
"""
Implementation of | operator - returns C{L{MatchFirst}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return MatchFirst( [ self, other ] )
def __ror__(self, other ):
"""
Implementation of | operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other | self
def __xor__(self, other ):
"""
Implementation of ^ operator - returns C{L{Or}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return Or( [ self, other ] )
def __rxor__(self, other ):
"""
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other ^ self
def __and__(self, other ):
"""
Implementation of & operator - returns C{L{Each}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return Each( [ self, other ] )
def __rand__(self, other ):
"""
Implementation of & operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other & self
def __invert__( self ):
"""
Implementation of ~ operator - returns C{L{NotAny}}
"""
return NotAny( self )
def __call__(self, name=None):
"""
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
"""
if name is not None:
return self.setResultsName(name)
else:
return self.copy()
def suppress( self ):
"""
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
"""
return Suppress( self )
def leaveWhitespace( self ):
"""
Disables the skipping of whitespace before matching the characters in the
C{ParserElement}'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
"""
self.skipWhitespace = False
return self
def setWhitespaceChars( self, chars ):
"""
Overrides the default whitespace chars
"""
self.skipWhitespace = True
self.whiteChars = chars
self.copyDefaultWhiteChars = False
return self
def parseWithTabs( self ):
"""
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
"""
self.keepTabs = True
return self
def ignore( self, other ):
"""
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
"""
if isinstance(other, basestring):
other = Suppress(other)
if isinstance( other, Suppress ):
if other not in self.ignoreExprs:
self.ignoreExprs.append(other)
else:
self.ignoreExprs.append( Suppress( other.copy() ) )
return self
def setDebugActions( self, startAction, successAction, exceptionAction ):
"""
Enable display of debugging messages while doing pattern matching.
"""
self.debugActions = (startAction or _defaultStartDebugAction,
successAction or _defaultSuccessDebugAction,
exceptionAction or _defaultExceptionDebugAction)
self.debug = True
return self
def setDebug( self, flag=True ):
"""
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
"""
if flag:
self.setDebugActions( _defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction )
else:
self.debug = False
return self
def __str__( self ):
return self.name
def __repr__( self ):
return _ustr(self)
def streamline( self ):
self.streamlined = True
self.strRepr = None
return self
def checkRecursion( self, parseElementList ):
pass
def validate( self, validateTrace=[] ):
"""
Check defined expressions for valid structure, check for infinite recursive definitions.
"""
self.checkRecursion( [] )
def parseFile( self, file_or_filename, parseAll=False ):
"""
Execute the parse expression on the given file or filename.
If a filename is specified (instead of a file object),
the entire file is opened, read, and closed before parsing.
"""
try:
file_contents = file_or_filename.read()
except AttributeError:
with open(file_or_filename, "r") as f:
file_contents = f.read()
try:
return self.parseString(file_contents, parseAll)
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def __eq__(self,other):
if isinstance(other, ParserElement):
return self is other or vars(self) == vars(other)
elif isinstance(other, basestring):
return self.matches(other)
else:
return super(ParserElement,self)==other
def __ne__(self,other):
return not (self == other)
def __hash__(self):
return hash(id(self))
def __req__(self,other):
return self == other
def __rne__(self,other):
return not (self == other)
def matches(self, testString, parseAll=True):
"""
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
"""
try:
self.parseString(_ustr(testString), parseAll=parseAll)
return True
except ParseBaseException:
return False
def runTests(self, tests, parseAll=True, comment='#', fullDump=True, printResults=True, failureTests=False):
"""
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\\n of strings that spans \\n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
"""
if isinstance(tests, basestring):
tests = list(map(str.strip, tests.rstrip().splitlines()))
if isinstance(comment, basestring):
comment = Literal(comment)
allResults = []
comments = []
success = True
for t in tests:
if comment is not None and comment.matches(t, False) or comments and not t:
comments.append(t)
continue
if not t:
continue
out = ['\n'.join(comments), t]
comments = []
try:
t = t.replace(r'\n','\n')
result = self.parseString(t, parseAll=parseAll)
out.append(result.dump(full=fullDump))
success = success and not failureTests
except ParseBaseException as pe:
fatal = "(FATAL)" if isinstance(pe, ParseFatalException) else ""
if '\n' in t:
out.append(line(pe.loc, t))
out.append(' '*(col(pe.loc,t)-1) + '^' + fatal)
else:
out.append(' '*pe.loc + '^' + fatal)
out.append("FAIL: " + str(pe))
success = success and failureTests
result = pe
except Exception as exc:
out.append("FAIL-EXCEPTION: " + str(exc))
success = success and failureTests
result = exc
if printResults:
if fullDump:
out.append('')
print('\n'.join(out))
allResults.append((t, result))
return success, allResults
class Token(ParserElement):
"""
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
"""
def __init__( self ):
super(Token,self).__init__( savelist=False )
class Empty(Token):
"""
An empty token, will always match.
"""
def __init__( self ):
super(Empty,self).__init__()
self.name = "Empty"
self.mayReturnEmpty = True
self.mayIndexError = False
class NoMatch(Token):
"""
A token that will never match.
"""
def __init__( self ):
super(NoMatch,self).__init__()
self.name = "NoMatch"
self.mayReturnEmpty = True
self.mayIndexError = False
self.errmsg = "Unmatchable token"
def parseImpl( self, instring, loc, doActions=True ):
raise ParseException(instring, loc, self.errmsg, self)
class Literal(Token):
"""
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
"""
def __init__( self, matchString ):
super(Literal,self).__init__()
self.match = matchString
self.matchLen = len(matchString)
try:
self.firstMatchChar = matchString[0]
except IndexError:
warnings.warn("null string passed to Literal; use Empty() instead",
SyntaxWarning, stacklevel=2)
self.__class__ = Empty
self.name = '"%s"' % _ustr(self.match)
self.errmsg = "Expected " + self.name
self.mayReturnEmpty = False
self.mayIndexError = False
# Performance tuning: this routine gets called a *lot*
# if this is a single character match string and the first character matches,
# short-circuit as quickly as possible, and avoid calling startswith
#~ @profile
def parseImpl( self, instring, loc, doActions=True ):
if (instring[loc] == self.firstMatchChar and
(self.matchLen==1 or instring.startswith(self.match,loc)) ):
return loc+self.matchLen, self.match
raise ParseException(instring, loc, self.errmsg, self)
_L = Literal
ParserElement._literalStringClass = Literal
class Keyword(Token):
"""
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
Accepts two optional constructor arguments in addition to the keyword string:
- C{identChars} is a string of characters that would be valid identifier characters,
defaulting to all alphanumerics + "_" and "$"
- C{caseless} allows case-insensitive matching, default is C{False}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
"""
DEFAULT_KEYWORD_CHARS = alphanums+"_$"
def __init__( self, matchString, identChars=None, caseless=False ):
super(Keyword,self).__init__()
if identChars is None:
identChars = Keyword.DEFAULT_KEYWORD_CHARS
self.match = matchString
self.matchLen = len(matchString)
try:
self.firstMatchChar = matchString[0]
except IndexError:
warnings.warn("null string passed to Keyword; use Empty() instead",
SyntaxWarning, stacklevel=2)
self.name = '"%s"' % self.match
self.errmsg = "Expected " + self.name
self.mayReturnEmpty = False
self.mayIndexError = False
self.caseless = caseless
if caseless:
self.caselessmatch = matchString.upper()
identChars = identChars.upper()
self.identChars = set(identChars)
def parseImpl( self, instring, loc, doActions=True ):
if self.caseless:
if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
(loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) and
(loc == 0 or instring[loc-1].upper() not in self.identChars) ):
return loc+self.matchLen, self.match
else:
if (instring[loc] == self.firstMatchChar and
(self.matchLen==1 or instring.startswith(self.match,loc)) and
(loc >= len(instring)-self.matchLen or instring[loc+self.matchLen] not in self.identChars) and
(loc == 0 or instring[loc-1] not in self.identChars) ):
return loc+self.matchLen, self.match
raise ParseException(instring, loc, self.errmsg, self)
def copy(self):
c = super(Keyword,self).copy()
c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
return c
@staticmethod
def setDefaultKeywordChars( chars ):
"""Overrides the default Keyword chars
"""
Keyword.DEFAULT_KEYWORD_CHARS = chars
class CaselessLiteral(Literal):
"""
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
"""
def __init__( self, matchString ):
super(CaselessLiteral,self).__init__( matchString.upper() )
# Preserve the defining literal.
self.returnString = matchString
self.name = "'%s'" % self.returnString
self.errmsg = "Expected " + self.name
def parseImpl( self, instring, loc, doActions=True ):
if instring[ loc:loc+self.matchLen ].upper() == self.match:
return loc+self.matchLen, self.returnString
raise ParseException(instring, loc, self.errmsg, self)
class CaselessKeyword(Keyword):
"""
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
"""
def __init__( self, matchString, identChars=None ):
super(CaselessKeyword,self).__init__( matchString, identChars, caseless=True )
def parseImpl( self, instring, loc, doActions=True ):
if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
(loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) ):
return loc+self.matchLen, self.match
raise ParseException(instring, loc, self.errmsg, self)
class CloseMatch(Token):
"""
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
"""
def __init__(self, match_string, maxMismatches=1):
super(CloseMatch,self).__init__()
self.name = match_string
self.match_string = match_string
self.maxMismatches = maxMismatches
self.errmsg = "Expected %r (with up to %d mismatches)" % (self.match_string, self.maxMismatches)
self.mayIndexError = False
self.mayReturnEmpty = False
def parseImpl( self, instring, loc, doActions=True ):
start = loc
instrlen = len(instring)
maxloc = start + len(self.match_string)
if maxloc <= instrlen:
match_string = self.match_string
match_stringloc = 0
mismatches = []
maxMismatches = self.maxMismatches
for match_stringloc,s_m in enumerate(zip(instring[loc:maxloc], self.match_string)):
src,mat = s_m
if src != mat:
mismatches.append(match_stringloc)
if len(mismatches) > maxMismatches:
break
else:
loc = match_stringloc + 1
results = ParseResults([instring[start:loc]])
results['original'] = self.match_string
results['mismatches'] = mismatches
return loc, results
raise ParseException(instring, loc, self.errmsg, self)
class Word(Token):
"""
Token for matching words composed of allowed character sets.
Defined with string containing all allowed initial characters,
an optional string containing allowed body characters (if omitted,
defaults to the initial character set), and an optional minimum,
maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction. An optional
C{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
"""
def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ):
super(Word,self).__init__()
if excludeChars:
initChars = ''.join(c for c in initChars if c not in excludeChars)
if bodyChars:
bodyChars = ''.join(c for c in bodyChars if c not in excludeChars)
self.initCharsOrig = initChars
self.initChars = set(initChars)
if bodyChars :
self.bodyCharsOrig = bodyChars
self.bodyChars = set(bodyChars)
else:
self.bodyCharsOrig = initChars
self.bodyChars = set(initChars)
self.maxSpecified = max > 0
if min < 1:
raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted")
self.minLen = min
if max > 0:
self.maxLen = max
else:
self.maxLen = _MAX_INT
if exact > 0:
self.maxLen = exact
self.minLen = exact
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayIndexError = False
self.asKeyword = asKeyword
if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0):
if self.bodyCharsOrig == self.initCharsOrig:
self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig)
elif len(self.initCharsOrig) == 1:
self.reString = "%s[%s]*" % \
(re.escape(self.initCharsOrig),
_escapeRegexRangeChars(self.bodyCharsOrig),)
else:
self.reString = "[%s][%s]*" % \
(_escapeRegexRangeChars(self.initCharsOrig),
_escapeRegexRangeChars(self.bodyCharsOrig),)
if self.asKeyword:
self.reString = r"\b"+self.reString+r"\b"
try:
self.re = re.compile( self.reString )
except Exception:
self.re = None
def parseImpl( self, instring, loc, doActions=True ):
if self.re:
result = self.re.match(instring,loc)
if not result:
raise ParseException(instring, loc, self.errmsg, self)
loc = result.end()
return loc, result.group()
if not(instring[ loc ] in self.initChars):
raise ParseException(instring, loc, self.errmsg, self)
start = loc
loc += 1
instrlen = len(instring)
bodychars = self.bodyChars
maxloc = start + self.maxLen
maxloc = min( maxloc, instrlen )
while loc < maxloc and instring[loc] in bodychars:
loc += 1
throwException = False
if loc - start < self.minLen:
throwException = True
if self.maxSpecified and loc < instrlen and instring[loc] in bodychars:
throwException = True
if self.asKeyword:
if (start>0 and instring[start-1] in bodychars) or (loc<instrlen and instring[loc] in bodychars):
throwException = True
if throwException:
raise ParseException(instring, loc, self.errmsg, self)
return loc, instring[start:loc]
def __str__( self ):
try:
return super(Word,self).__str__()
except Exception:
pass
if self.strRepr is None:
def charsAsStr(s):
if len(s)>4:
return s[:4]+"..."
else:
return s
if ( self.initCharsOrig != self.bodyCharsOrig ):
self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) )
else:
self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig)
return self.strRepr
class Regex(Token):
"""
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
"""
compiledREtype = type(re.compile("[A-Z]"))
def __init__( self, pattern, flags=0):
"""The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags."""
super(Regex,self).__init__()
if isinstance(pattern, basestring):
if not pattern:
warnings.warn("null string passed to Regex; use Empty() instead",
SyntaxWarning, stacklevel=2)
self.pattern = pattern
self.flags = flags
try:
self.re = re.compile(self.pattern, self.flags)
self.reString = self.pattern
except sre_constants.error:
warnings.warn("invalid pattern (%s) passed to Regex" % pattern,
SyntaxWarning, stacklevel=2)
raise
elif isinstance(pattern, Regex.compiledREtype):
self.re = pattern
self.pattern = \
self.reString = str(pattern)
self.flags = flags
else:
raise ValueError("Regex may only be constructed with a string or a compiled RE object")
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayIndexError = False
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
result = self.re.match(instring,loc)
if not result:
raise ParseException(instring, loc, self.errmsg, self)
loc = result.end()
d = result.groupdict()
ret = ParseResults(result.group())
if d:
for k in d:
ret[k] = d[k]
return loc,ret
def __str__( self ):
try:
return super(Regex,self).__str__()
except Exception:
pass
if self.strRepr is None:
self.strRepr = "Re:(%s)" % repr(self.pattern)
return self.strRepr
class QuotedString(Token):
r"""
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
"""
def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
super(QuotedString,self).__init__()
# remove white space from quote chars - wont work anyway
quoteChar = quoteChar.strip()
if not quoteChar:
warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
raise SyntaxError()
if endQuoteChar is None:
endQuoteChar = quoteChar
else:
endQuoteChar = endQuoteChar.strip()
if not endQuoteChar:
warnings.warn("endQuoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
raise SyntaxError()
self.quoteChar = quoteChar
self.quoteCharLen = len(quoteChar)
self.firstQuoteChar = quoteChar[0]
self.endQuoteChar = endQuoteChar
self.endQuoteCharLen = len(endQuoteChar)
self.escChar = escChar
self.escQuote = escQuote
self.unquoteResults = unquoteResults
self.convertWhitespaceEscapes = convertWhitespaceEscapes
if multiline:
self.flags = re.MULTILINE | re.DOTALL
self.pattern = r'%s(?:[^%s%s]' % \
( re.escape(self.quoteChar),
_escapeRegexRangeChars(self.endQuoteChar[0]),
(escChar is not None and _escapeRegexRangeChars(escChar) or '') )
else:
self.flags = 0
self.pattern = r'%s(?:[^%s\n\r%s]' % \
( re.escape(self.quoteChar),
_escapeRegexRangeChars(self.endQuoteChar[0]),
(escChar is not None and _escapeRegexRangeChars(escChar) or '') )
if len(self.endQuoteChar) > 1:
self.pattern += (
'|(?:' + ')|(?:'.join("%s[^%s]" % (re.escape(self.endQuoteChar[:i]),
_escapeRegexRangeChars(self.endQuoteChar[i]))
for i in range(len(self.endQuoteChar)-1,0,-1)) + ')'
)
if escQuote:
self.pattern += (r'|(?:%s)' % re.escape(escQuote))
if escChar:
self.pattern += (r'|(?:%s.)' % re.escape(escChar))
self.escCharReplacePattern = re.escape(self.escChar)+"(.)"
self.pattern += (r')*%s' % re.escape(self.endQuoteChar))
try:
self.re = re.compile(self.pattern, self.flags)
self.reString = self.pattern
except sre_constants.error:
warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern,
SyntaxWarning, stacklevel=2)
raise
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayIndexError = False
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
result = instring[loc] == self.firstQuoteChar and self.re.match(instring,loc) or None
if not result:
raise ParseException(instring, loc, self.errmsg, self)
loc = result.end()
ret = result.group()
if self.unquoteResults:
# strip off quotes
ret = ret[self.quoteCharLen:-self.endQuoteCharLen]
if isinstance(ret,basestring):
# replace escaped whitespace
if '\\' in ret and self.convertWhitespaceEscapes:
ws_map = {
r'\t' : '\t',
r'\n' : '\n',
r'\f' : '\f',
r'\r' : '\r',
}
for wslit,wschar in ws_map.items():
ret = ret.replace(wslit, wschar)
# replace escaped characters
if self.escChar:
ret = re.sub(self.escCharReplacePattern,"\g<1>",ret)
# replace escaped quotes
if self.escQuote:
ret = ret.replace(self.escQuote, self.endQuoteChar)
return loc, ret
def __str__( self ):
try:
return super(QuotedString,self).__str__()
except Exception:
pass
if self.strRepr is None:
self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar)
return self.strRepr
class CharsNotIn(Token):
"""
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
"""
def __init__( self, notChars, min=1, max=0, exact=0 ):
super(CharsNotIn,self).__init__()
self.skipWhitespace = False
self.notChars = notChars
if min < 1:
raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted")
self.minLen = min
if max > 0:
self.maxLen = max
else:
self.maxLen = _MAX_INT
if exact > 0:
self.maxLen = exact
self.minLen = exact
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayReturnEmpty = ( self.minLen == 0 )
self.mayIndexError = False
def parseImpl( self, instring, loc, doActions=True ):
if instring[loc] in self.notChars:
raise ParseException(instring, loc, self.errmsg, self)
start = loc
loc += 1
notchars = self.notChars
maxlen = min( start+self.maxLen, len(instring) )
while loc < maxlen and \
(instring[loc] not in notchars):
loc += 1
if loc - start < self.minLen:
raise ParseException(instring, loc, self.errmsg, self)
return loc, instring[start:loc]
def __str__( self ):
try:
return super(CharsNotIn, self).__str__()
except Exception:
pass
if self.strRepr is None:
if len(self.notChars) > 4:
self.strRepr = "!W:(%s...)" % self.notChars[:4]
else:
self.strRepr = "!W:(%s)" % self.notChars
return self.strRepr
class White(Token):
"""
Special matching class for matching whitespace. Normally, whitespace is ignored
by pyparsing grammars. This class is included when some whitespace structures
are significant. Define with a string containing the whitespace characters to be
matched; default is C{" \\t\\r\\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments,
as defined for the C{L{Word}} class.
"""
whiteStrs = {
" " : "<SPC>",
"\t": "<TAB>",
"\n": "<LF>",
"\r": "<CR>",
"\f": "<FF>",
}
def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0):
super(White,self).__init__()
self.matchWhite = ws
self.setWhitespaceChars( "".join(c for c in self.whiteChars if c not in self.matchWhite) )
#~ self.leaveWhitespace()
self.name = ("".join(White.whiteStrs[c] for c in self.matchWhite))
self.mayReturnEmpty = True
self.errmsg = "Expected " + self.name
self.minLen = min
if max > 0:
self.maxLen = max
else:
self.maxLen = _MAX_INT
if exact > 0:
self.maxLen = exact
self.minLen = exact
def parseImpl( self, instring, loc, doActions=True ):
if not(instring[ loc ] in self.matchWhite):
raise ParseException(instring, loc, self.errmsg, self)
start = loc
loc += 1
maxloc = start + self.maxLen
maxloc = min( maxloc, len(instring) )
while loc < maxloc and instring[loc] in self.matchWhite:
loc += 1
if loc - start < self.minLen:
raise ParseException(instring, loc, self.errmsg, self)
return loc, instring[start:loc]
class _PositionToken(Token):
def __init__( self ):
super(_PositionToken,self).__init__()
self.name=self.__class__.__name__
self.mayReturnEmpty = True
self.mayIndexError = False
class GoToColumn(_PositionToken):
"""
Token to advance to a specific column of input text; useful for tabular report scraping.
"""
def __init__( self, colno ):
super(GoToColumn,self).__init__()
self.col = colno
def preParse( self, instring, loc ):
if col(loc,instring) != self.col:
instrlen = len(instring)
if self.ignoreExprs:
loc = self._skipIgnorables( instring, loc )
while loc < instrlen and instring[loc].isspace() and col( loc, instring ) != self.col :
loc += 1
return loc
def parseImpl( self, instring, loc, doActions=True ):
thiscol = col( loc, instring )
if thiscol > self.col:
raise ParseException( instring, loc, "Text not in expected column", self )
newloc = loc + self.col - thiscol
ret = instring[ loc: newloc ]
return newloc, ret
class LineStart(_PositionToken):
"""
Matches if current position is at the beginning of a line within the parse string
Example::
test = '''\
AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
"""
def __init__( self ):
super(LineStart,self).__init__()
self.errmsg = "Expected start of line"
def parseImpl( self, instring, loc, doActions=True ):
if col(loc, instring) == 1:
return loc, []
raise ParseException(instring, loc, self.errmsg, self)
class LineEnd(_PositionToken):
"""
Matches if current position is at the end of a line within the parse string
"""
def __init__( self ):
super(LineEnd,self).__init__()
self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") )
self.errmsg = "Expected end of line"
def parseImpl( self, instring, loc, doActions=True ):
if loc<len(instring):
if instring[loc] == "\n":
return loc+1, "\n"
else:
raise ParseException(instring, loc, self.errmsg, self)
elif loc == len(instring):
return loc+1, []
else:
raise ParseException(instring, loc, self.errmsg, self)
class StringStart(_PositionToken):
"""
Matches if current position is at the beginning of the parse string
"""
def __init__( self ):
super(StringStart,self).__init__()
self.errmsg = "Expected start of text"
def parseImpl( self, instring, loc, doActions=True ):
if loc != 0:
# see if entire string up to here is just whitespace and ignoreables
if loc != self.preParse( instring, 0 ):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
class StringEnd(_PositionToken):
"""
Matches if current position is at the end of the parse string
"""
def __init__( self ):
super(StringEnd,self).__init__()
self.errmsg = "Expected end of text"
def parseImpl( self, instring, loc, doActions=True ):
if loc < len(instring):
raise ParseException(instring, loc, self.errmsg, self)
elif loc == len(instring):
return loc+1, []
elif loc > len(instring):
return loc, []
else:
raise ParseException(instring, loc, self.errmsg, self)
class WordStart(_PositionToken):
"""
Matches if the current position is at the beginning of a Word, and
is not preceded by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{\b} behavior of regular expressions,
use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
the string being parsed, or at the beginning of a line.
"""
def __init__(self, wordChars = printables):
super(WordStart,self).__init__()
self.wordChars = set(wordChars)
self.errmsg = "Not at the start of a word"
def parseImpl(self, instring, loc, doActions=True ):
if loc != 0:
if (instring[loc-1] in self.wordChars or
instring[loc] not in self.wordChars):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
class WordEnd(_PositionToken):
"""
Matches if the current position is at the end of a Word, and
is not followed by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{\b} behavior of regular expressions,
use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
the string being parsed, or at the end of a line.
"""
def __init__(self, wordChars = printables):
super(WordEnd,self).__init__()
self.wordChars = set(wordChars)
self.skipWhitespace = False
self.errmsg = "Not at the end of a word"
def parseImpl(self, instring, loc, doActions=True ):
instrlen = len(instring)
if instrlen>0 and loc<instrlen:
if (instring[loc] in self.wordChars or
instring[loc-1] not in self.wordChars):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
class ParseExpression(ParserElement):
"""
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
"""
def __init__( self, exprs, savelist = False ):
super(ParseExpression,self).__init__(savelist)
if isinstance( exprs, _generatorType ):
exprs = list(exprs)
if isinstance( exprs, basestring ):
self.exprs = [ ParserElement._literalStringClass( exprs ) ]
elif isinstance( exprs, collections.Iterable ):
exprs = list(exprs)
# if sequence of strings provided, wrap with Literal
if all(isinstance(expr, basestring) for expr in exprs):
exprs = map(ParserElement._literalStringClass, exprs)
self.exprs = list(exprs)
else:
try:
self.exprs = list( exprs )
except TypeError:
self.exprs = [ exprs ]
self.callPreparse = False
def __getitem__( self, i ):
return self.exprs[i]
def append( self, other ):
self.exprs.append( other )
self.strRepr = None
return self
def leaveWhitespace( self ):
"""Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions."""
self.skipWhitespace = False
self.exprs = [ e.copy() for e in self.exprs ]
for e in self.exprs:
e.leaveWhitespace()
return self
def ignore( self, other ):
if isinstance( other, Suppress ):
if other not in self.ignoreExprs:
super( ParseExpression, self).ignore( other )
for e in self.exprs:
e.ignore( self.ignoreExprs[-1] )
else:
super( ParseExpression, self).ignore( other )
for e in self.exprs:
e.ignore( self.ignoreExprs[-1] )
return self
def __str__( self ):
try:
return super(ParseExpression,self).__str__()
except Exception:
pass
if self.strRepr is None:
self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.exprs) )
return self.strRepr
def streamline( self ):
super(ParseExpression,self).streamline()
for e in self.exprs:
e.streamline()
# collapse nested And's of the form And( And( And( a,b), c), d) to And( a,b,c,d )
# but only if there are no parse actions or resultsNames on the nested And's
# (likewise for Or's and MatchFirst's)
if ( len(self.exprs) == 2 ):
other = self.exprs[0]
if ( isinstance( other, self.__class__ ) and
not(other.parseAction) and
other.resultsName is None and
not other.debug ):
self.exprs = other.exprs[:] + [ self.exprs[1] ]
self.strRepr = None
self.mayReturnEmpty |= other.mayReturnEmpty
self.mayIndexError |= other.mayIndexError
other = self.exprs[-1]
if ( isinstance( other, self.__class__ ) and
not(other.parseAction) and
other.resultsName is None and
not other.debug ):
self.exprs = self.exprs[:-1] + other.exprs[:]
self.strRepr = None
self.mayReturnEmpty |= other.mayReturnEmpty
self.mayIndexError |= other.mayIndexError
self.errmsg = "Expected " + _ustr(self)
return self
def setResultsName( self, name, listAllMatches=False ):
ret = super(ParseExpression,self).setResultsName(name,listAllMatches)
return ret
def validate( self, validateTrace=[] ):
tmp = validateTrace[:]+[self]
for e in self.exprs:
e.validate(tmp)
self.checkRecursion( [] )
def copy(self):
ret = super(ParseExpression,self).copy()
ret.exprs = [e.copy() for e in self.exprs]
return ret
class And(ParseExpression):
"""
Requires all given C{ParseExpression}s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the C{'+'} operator.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
"""
class _ErrorStop(Empty):
def __init__(self, *args, **kwargs):
super(And._ErrorStop,self).__init__(*args, **kwargs)
self.name = '-'
self.leaveWhitespace()
def __init__( self, exprs, savelist = True ):
super(And,self).__init__(exprs, savelist)
self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
self.setWhitespaceChars( self.exprs[0].whiteChars )
self.skipWhitespace = self.exprs[0].skipWhitespace
self.callPreparse = True
def parseImpl( self, instring, loc, doActions=True ):
# pass False as last arg to _parse for first element, since we already
# pre-parsed the string as part of our And pre-parsing
loc, resultlist = self.exprs[0]._parse( instring, loc, doActions, callPreParse=False )
errorStop = False
for e in self.exprs[1:]:
if isinstance(e, And._ErrorStop):
errorStop = True
continue
if errorStop:
try:
loc, exprtokens = e._parse( instring, loc, doActions )
except ParseSyntaxException:
raise
except ParseBaseException as pe:
pe.__traceback__ = None
raise ParseSyntaxException._from_exception(pe)
except IndexError:
raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
else:
loc, exprtokens = e._parse( instring, loc, doActions )
if exprtokens or exprtokens.haskeys():
resultlist += exprtokens
return loc, resultlist
def __iadd__(self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
return self.append( other ) #And( [ self, other ] )
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
if not e.mayReturnEmpty:
break
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
class Or(ParseExpression):
"""
Requires that at least one C{ParseExpression} is found.
If two expressions match, the expression that matches the longest string will be used.
May be constructed using the C{'^'} operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
"""
def __init__( self, exprs, savelist = False ):
super(Or,self).__init__(exprs, savelist)
if self.exprs:
self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
else:
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
maxExcLoc = -1
maxException = None
matches = []
for e in self.exprs:
try:
loc2 = e.tryParse( instring, loc )
except ParseException as err:
err.__traceback__ = None
if err.loc > maxExcLoc:
maxException = err
maxExcLoc = err.loc
except IndexError:
if len(instring) > maxExcLoc:
maxException = ParseException(instring,len(instring),e.errmsg,self)
maxExcLoc = len(instring)
else:
# save match among all matches, to retry longest to shortest
matches.append((loc2, e))
if matches:
matches.sort(key=lambda x: -x[0])
for _,e in matches:
try:
return e._parse( instring, loc, doActions )
except ParseException as err:
err.__traceback__ = None
if err.loc > maxExcLoc:
maxException = err
maxExcLoc = err.loc
if maxException is not None:
maxException.msg = self.errmsg
raise maxException
else:
raise ParseException(instring, loc, "no defined alternatives to match", self)
def __ixor__(self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
return self.append( other ) #Or( [ self, other ] )
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " ^ ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
class MatchFirst(ParseExpression):
"""
Requires that at least one C{ParseExpression} is found.
If two expressions match, the first one listed is the one that will match.
May be constructed using the C{'|'} operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
"""
def __init__( self, exprs, savelist = False ):
super(MatchFirst,self).__init__(exprs, savelist)
if self.exprs:
self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
else:
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
maxExcLoc = -1
maxException = None
for e in self.exprs:
try:
ret = e._parse( instring, loc, doActions )
return ret
except ParseException as err:
if err.loc > maxExcLoc:
maxException = err
maxExcLoc = err.loc
except IndexError:
if len(instring) > maxExcLoc:
maxException = ParseException(instring,len(instring),e.errmsg,self)
maxExcLoc = len(instring)
# only got here if no expression matched, raise exception for match that made it the furthest
else:
if maxException is not None:
maxException.msg = self.errmsg
raise maxException
else:
raise ParseException(instring, loc, "no defined alternatives to match", self)
def __ior__(self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
return self.append( other ) #MatchFirst( [ self, other ] )
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " | ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
class Each(ParseExpression):
"""
Requires all given C{ParseExpression}s to be found, but in any order.
Expressions may be separated by whitespace.
May be constructed using the C{'&'} operator.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
"""
def __init__( self, exprs, savelist = True ):
super(Each,self).__init__(exprs, savelist)
self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
self.skipWhitespace = True
self.initExprGroups = True
def parseImpl( self, instring, loc, doActions=True ):
if self.initExprGroups:
self.opt1map = dict((id(e.expr),e) for e in self.exprs if isinstance(e,Optional))
opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ]
opt2 = [ e for e in self.exprs if e.mayReturnEmpty and not isinstance(e,Optional)]
self.optionals = opt1 + opt2
self.multioptionals = [ e.expr for e in self.exprs if isinstance(e,ZeroOrMore) ]
self.multirequired = [ e.expr for e in self.exprs if isinstance(e,OneOrMore) ]
self.required = [ e for e in self.exprs if not isinstance(e,(Optional,ZeroOrMore,OneOrMore)) ]
self.required += self.multirequired
self.initExprGroups = False
tmpLoc = loc
tmpReqd = self.required[:]
tmpOpt = self.optionals[:]
matchOrder = []
keepMatching = True
while keepMatching:
tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
failed = []
for e in tmpExprs:
try:
tmpLoc = e.tryParse( instring, tmpLoc )
except ParseException:
failed.append(e)
else:
matchOrder.append(self.opt1map.get(id(e),e))
if e in tmpReqd:
tmpReqd.remove(e)
elif e in tmpOpt:
tmpOpt.remove(e)
if len(failed) == len(tmpExprs):
keepMatching = False
if tmpReqd:
missing = ", ".join(_ustr(e) for e in tmpReqd)
raise ParseException(instring,loc,"Missing one or more required elements (%s)" % missing )
# add any unmatched Optionals, in case they have default values defined
matchOrder += [e for e in self.exprs if isinstance(e,Optional) and e.expr in tmpOpt]
resultlist = []
for e in matchOrder:
loc,results = e._parse(instring,loc,doActions)
resultlist.append(results)
finalResults = sum(resultlist, ParseResults([]))
return loc, finalResults
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " & ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
class ParseElementEnhance(ParserElement):
"""
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
"""
def __init__( self, expr, savelist=False ):
super(ParseElementEnhance,self).__init__(savelist)
if isinstance( expr, basestring ):
if issubclass(ParserElement._literalStringClass, Token):
expr = ParserElement._literalStringClass(expr)
else:
expr = ParserElement._literalStringClass(Literal(expr))
self.expr = expr
self.strRepr = None
if expr is not None:
self.mayIndexError = expr.mayIndexError
self.mayReturnEmpty = expr.mayReturnEmpty
self.setWhitespaceChars( expr.whiteChars )
self.skipWhitespace = expr.skipWhitespace
self.saveAsList = expr.saveAsList
self.callPreparse = expr.callPreparse
self.ignoreExprs.extend(expr.ignoreExprs)
def parseImpl( self, instring, loc, doActions=True ):
if self.expr is not None:
return self.expr._parse( instring, loc, doActions, callPreParse=False )
else:
raise ParseException("",loc,self.errmsg,self)
def leaveWhitespace( self ):
self.skipWhitespace = False
self.expr = self.expr.copy()
if self.expr is not None:
self.expr.leaveWhitespace()
return self
def ignore( self, other ):
if isinstance( other, Suppress ):
if other not in self.ignoreExprs:
super( ParseElementEnhance, self).ignore( other )
if self.expr is not None:
self.expr.ignore( self.ignoreExprs[-1] )
else:
super( ParseElementEnhance, self).ignore( other )
if self.expr is not None:
self.expr.ignore( self.ignoreExprs[-1] )
return self
def streamline( self ):
super(ParseElementEnhance,self).streamline()
if self.expr is not None:
self.expr.streamline()
return self
def checkRecursion( self, parseElementList ):
if self in parseElementList:
raise RecursiveGrammarException( parseElementList+[self] )
subRecCheckList = parseElementList[:] + [ self ]
if self.expr is not None:
self.expr.checkRecursion( subRecCheckList )
def validate( self, validateTrace=[] ):
tmp = validateTrace[:]+[self]
if self.expr is not None:
self.expr.validate(tmp)
self.checkRecursion( [] )
def __str__( self ):
try:
return super(ParseElementEnhance,self).__str__()
except Exception:
pass
if self.strRepr is None and self.expr is not None:
self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) )
return self.strRepr
class FollowedBy(ParseElementEnhance):
"""
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
"""
def __init__( self, expr ):
super(FollowedBy,self).__init__(expr)
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
self.expr.tryParse( instring, loc )
return loc, []
class NotAny(ParseElementEnhance):
"""
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
"""
def __init__( self, expr ):
super(NotAny,self).__init__(expr)
#~ self.leaveWhitespace()
self.skipWhitespace = False # do NOT use self.leaveWhitespace(), don't want to propagate to exprs
self.mayReturnEmpty = True
self.errmsg = "Found unwanted token, "+_ustr(self.expr)
def parseImpl( self, instring, loc, doActions=True ):
if self.expr.canParseNext(instring, loc):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "~{" + _ustr(self.expr) + "}"
return self.strRepr
class _MultipleMatch(ParseElementEnhance):
def __init__( self, expr, stopOn=None):
super(_MultipleMatch, self).__init__(expr)
self.saveAsList = True
ender = stopOn
if isinstance(ender, basestring):
ender = ParserElement._literalStringClass(ender)
self.not_ender = ~ender if ender is not None else None
def parseImpl( self, instring, loc, doActions=True ):
self_expr_parse = self.expr._parse
self_skip_ignorables = self._skipIgnorables
check_ender = self.not_ender is not None
if check_ender:
try_not_ender = self.not_ender.tryParse
# must be at least one (but first see if we are the stopOn sentinel;
# if so, fail)
if check_ender:
try_not_ender(instring, loc)
loc, tokens = self_expr_parse( instring, loc, doActions, callPreParse=False )
try:
hasIgnoreExprs = (not not self.ignoreExprs)
while 1:
if check_ender:
try_not_ender(instring, loc)
if hasIgnoreExprs:
preloc = self_skip_ignorables( instring, loc )
else:
preloc = loc
loc, tmptokens = self_expr_parse( instring, preloc, doActions )
if tmptokens or tmptokens.haskeys():
tokens += tmptokens
except (ParseException,IndexError):
pass
return loc, tokens
class OneOrMore(_MultipleMatch):
"""
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
"""
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + _ustr(self.expr) + "}..."
return self.strRepr
class ZeroOrMore(_MultipleMatch):
"""
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
"""
def __init__( self, expr, stopOn=None):
super(ZeroOrMore,self).__init__(expr, stopOn=stopOn)
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
try:
return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
except (ParseException,IndexError):
return loc, []
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "[" + _ustr(self.expr) + "]..."
return self.strRepr
class _NullToken(object):
def __bool__(self):
return False
__nonzero__ = __bool__
def __str__(self):
return ""
_optionalNotMatched = _NullToken()
class Optional(ParseElementEnhance):
"""
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
"""
def __init__( self, expr, default=_optionalNotMatched ):
super(Optional,self).__init__( expr, savelist=False )
self.saveAsList = self.expr.saveAsList
self.defaultValue = default
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
try:
loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False )
except (ParseException,IndexError):
if self.defaultValue is not _optionalNotMatched:
if self.expr.resultsName:
tokens = ParseResults([ self.defaultValue ])
tokens[self.expr.resultsName] = self.defaultValue
else:
tokens = [ self.defaultValue ]
else:
tokens = []
return loc, tokens
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "[" + _ustr(self.expr) + "]"
return self.strRepr
class SkipTo(ParseElementEnhance):
"""
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
"""
def __init__( self, other, include=False, ignore=None, failOn=None ):
super( SkipTo, self ).__init__( other )
self.ignoreExpr = ignore
self.mayReturnEmpty = True
self.mayIndexError = False
self.includeMatch = include
self.asList = False
if isinstance(failOn, basestring):
self.failOn = ParserElement._literalStringClass(failOn)
else:
self.failOn = failOn
self.errmsg = "No match found for "+_ustr(self.expr)
def parseImpl( self, instring, loc, doActions=True ):
startloc = loc
instrlen = len(instring)
expr = self.expr
expr_parse = self.expr._parse
self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
tmploc = loc
while tmploc <= instrlen:
if self_failOn_canParseNext is not None:
# break if failOn expression matches
if self_failOn_canParseNext(instring, tmploc):
break
if self_ignoreExpr_tryParse is not None:
# advance past ignore expressions
while 1:
try:
tmploc = self_ignoreExpr_tryParse(instring, tmploc)
except ParseBaseException:
break
try:
expr_parse(instring, tmploc, doActions=False, callPreParse=False)
except (ParseException, IndexError):
# no match, advance loc in string
tmploc += 1
else:
# matched skipto expr, done
break
else:
# ran off the end of the input string without matching skipto expr, fail
raise ParseException(instring, loc, self.errmsg, self)
# build up return values
loc = tmploc
skiptext = instring[startloc:loc]
skipresult = ParseResults(skiptext)
if self.includeMatch:
loc, mat = expr_parse(instring,loc,doActions,callPreParse=False)
skipresult += mat
return loc, skipresult
class Forward(ParseElementEnhance):
"""
Forward declaration of an expression to be defined later -
used for recursive grammars, such as algebraic infix notation.
When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
Note: take care when assigning to C{Forward} not to overlook precedence of operators.
Specifically, '|' has a lower precedence than '<<', so that::
fwdExpr << a | b | c
will actually be evaluated as::
(fwdExpr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the C{Forward}::
fwdExpr << (a | b | c)
Converting to use the '<<=' operator instead will avoid this problem.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
"""
def __init__( self, other=None ):
super(Forward,self).__init__( other, savelist=False )
def __lshift__( self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass(other)
self.expr = other
self.strRepr = None
self.mayIndexError = self.expr.mayIndexError
self.mayReturnEmpty = self.expr.mayReturnEmpty
self.setWhitespaceChars( self.expr.whiteChars )
self.skipWhitespace = self.expr.skipWhitespace
self.saveAsList = self.expr.saveAsList
self.ignoreExprs.extend(self.expr.ignoreExprs)
return self
def __ilshift__(self, other):
return self << other
def leaveWhitespace( self ):
self.skipWhitespace = False
return self
def streamline( self ):
if not self.streamlined:
self.streamlined = True
if self.expr is not None:
self.expr.streamline()
return self
def validate( self, validateTrace=[] ):
if self not in validateTrace:
tmp = validateTrace[:]+[self]
if self.expr is not None:
self.expr.validate(tmp)
self.checkRecursion([])
def __str__( self ):
if hasattr(self,"name"):
return self.name
return self.__class__.__name__ + ": ..."
# stubbed out for now - creates awful memory and perf issues
self._revertClass = self.__class__
self.__class__ = _ForwardNoRecurse
try:
if self.expr is not None:
retString = _ustr(self.expr)
else:
retString = "None"
finally:
self.__class__ = self._revertClass
return self.__class__.__name__ + ": " + retString
def copy(self):
if self.expr is not None:
return super(Forward,self).copy()
else:
ret = Forward()
ret <<= self
return ret
class _ForwardNoRecurse(Forward):
def __str__( self ):
return "..."
class TokenConverter(ParseElementEnhance):
"""
Abstract subclass of C{ParseExpression}, for converting parsed results.
"""
def __init__( self, expr, savelist=False ):
super(TokenConverter,self).__init__( expr )#, savelist )
self.saveAsList = False
class Combine(TokenConverter):
"""
Converter to concatenate all matching tokens to a single string.
By default, the matching patterns must also be contiguous in the input string;
this can be disabled by specifying C{'adjacent=False'} in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
"""
def __init__( self, expr, joinString="", adjacent=True ):
super(Combine,self).__init__( expr )
# suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
if adjacent:
self.leaveWhitespace()
self.adjacent = adjacent
self.skipWhitespace = True
self.joinString = joinString
self.callPreparse = True
def ignore( self, other ):
if self.adjacent:
ParserElement.ignore(self, other)
else:
super( Combine, self).ignore( other )
return self
def postParse( self, instring, loc, tokenlist ):
retToks = tokenlist.copy()
del retToks[:]
retToks += ParseResults([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults)
if self.resultsName and retToks.haskeys():
return [ retToks ]
else:
return retToks
class Group(TokenConverter):
"""
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
"""
def __init__( self, expr ):
super(Group,self).__init__( expr )
self.saveAsList = True
def postParse( self, instring, loc, tokenlist ):
return [ tokenlist ]
class Dict(TokenConverter):
"""
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
"""
def __init__( self, expr ):
super(Dict,self).__init__( expr )
self.saveAsList = True
def postParse( self, instring, loc, tokenlist ):
for i,tok in enumerate(tokenlist):
if len(tok) == 0:
continue
ikey = tok[0]
if isinstance(ikey,int):
ikey = _ustr(tok[0]).strip()
if len(tok)==1:
tokenlist[ikey] = _ParseResultsWithOffset("",i)
elif len(tok)==2 and not isinstance(tok[1],ParseResults):
tokenlist[ikey] = _ParseResultsWithOffset(tok[1],i)
else:
dictvalue = tok.copy() #ParseResults(i)
del dictvalue[0]
if len(dictvalue)!= 1 or (isinstance(dictvalue,ParseResults) and dictvalue.haskeys()):
tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i)
else:
tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i)
if self.resultsName:
return [ tokenlist ]
else:
return tokenlist
class Suppress(TokenConverter):
"""
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
"""
def postParse( self, instring, loc, tokenlist ):
return []
def suppress( self ):
return self
class OnlyOnce(object):
"""
Wrapper for parse actions, to ensure they are only called once.
"""
def __init__(self, methodCall):
self.callable = _trim_arity(methodCall)
self.called = False
def __call__(self,s,l,t):
if not self.called:
results = self.callable(s,l,t)
self.called = True
return results
raise ParseException(s,l,"")
def reset(self):
self.called = False
def traceParseAction(f):
"""
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
"""
f = _trim_arity(f)
def z(*paArgs):
thisFunc = f.__name__
s,l,t = paArgs[-3:]
if len(paArgs)>3:
thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc
sys.stderr.write( ">>entering %s(line: '%s', %d, %r)\n" % (thisFunc,line(l,s),l,t) )
try:
ret = f(*paArgs)
except Exception as exc:
sys.stderr.write( "<<leaving %s (exception: %s)\n" % (thisFunc,exc) )
raise
sys.stderr.write( "<<leaving %s (ret: %r)\n" % (thisFunc,ret) )
return ret
try:
z.__name__ = f.__name__
except AttributeError:
pass
return z
#
# global helpers
#
def delimitedList( expr, delim=",", combine=False ):
"""
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
"""
dlName = _ustr(expr)+" ["+_ustr(delim)+" "+_ustr(expr)+"]..."
if combine:
return Combine( expr + ZeroOrMore( delim + expr ) ).setName(dlName)
else:
return ( expr + ZeroOrMore( Suppress( delim ) + expr ) ).setName(dlName)
def countedArray( expr, intExpr=None ):
"""
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
"""
arrayExpr = Forward()
def countFieldParseAction(s,l,t):
n = t[0]
arrayExpr << (n and Group(And([expr]*n)) or Group(empty))
return []
if intExpr is None:
intExpr = Word(nums).setParseAction(lambda t:int(t[0]))
else:
intExpr = intExpr.copy()
intExpr.setName("arrayLen")
intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
return ( intExpr + arrayExpr ).setName('(len) ' + _ustr(expr) + '...')
def _flatten(L):
ret = []
for i in L:
if isinstance(i,list):
ret.extend(_flatten(i))
else:
ret.append(i)
return ret
def matchPreviousLiteral(expr):
"""
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
"""
rep = Forward()
def copyTokenToRepeater(s,l,t):
if t:
if len(t) == 1:
rep << t[0]
else:
# flatten t tokens
tflat = _flatten(t.asList())
rep << And(Literal(tt) for tt in tflat)
else:
rep << Empty()
expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
rep.setName('(prev) ' + _ustr(expr))
return rep
def matchPreviousExpr(expr):
"""
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
"""
rep = Forward()
e2 = expr.copy()
rep <<= e2
def copyTokenToRepeater(s,l,t):
matchTokens = _flatten(t.asList())
def mustMatchTheseTokens(s,l,t):
theseTokens = _flatten(t.asList())
if theseTokens != matchTokens:
raise ParseException("",0,"")
rep.setParseAction( mustMatchTheseTokens, callDuringTry=True )
expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
rep.setName('(prev) ' + _ustr(expr))
return rep
def _escapeRegexRangeChars(s):
#~ escape these chars: ^-]
for c in r"\^-]":
s = s.replace(c,_bslash+c)
s = s.replace("\n",r"\n")
s = s.replace("\t",r"\t")
return _ustr(s)
def oneOf( strs, caseless=False, useRegex=True ):
"""
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
"""
if caseless:
isequal = ( lambda a,b: a.upper() == b.upper() )
masks = ( lambda a,b: b.upper().startswith(a.upper()) )
parseElementClass = CaselessLiteral
else:
isequal = ( lambda a,b: a == b )
masks = ( lambda a,b: b.startswith(a) )
parseElementClass = Literal
symbols = []
if isinstance(strs,basestring):
symbols = strs.split()
elif isinstance(strs, collections.Iterable):
symbols = list(strs)
else:
warnings.warn("Invalid argument to oneOf, expected string or iterable",
SyntaxWarning, stacklevel=2)
if not symbols:
return NoMatch()
i = 0
while i < len(symbols)-1:
cur = symbols[i]
for j,other in enumerate(symbols[i+1:]):
if ( isequal(other, cur) ):
del symbols[i+j+1]
break
elif ( masks(cur, other) ):
del symbols[i+j+1]
symbols.insert(i,other)
cur = other
break
else:
i += 1
if not caseless and useRegex:
#~ print (strs,"->", "|".join( [ _escapeRegexChars(sym) for sym in symbols] ))
try:
if len(symbols)==len("".join(symbols)):
return Regex( "[%s]" % "".join(_escapeRegexRangeChars(sym) for sym in symbols) ).setName(' | '.join(symbols))
else:
return Regex( "|".join(re.escape(sym) for sym in symbols) ).setName(' | '.join(symbols))
except Exception:
warnings.warn("Exception creating Regex for oneOf, building MatchFirst",
SyntaxWarning, stacklevel=2)
# last resort, just use MatchFirst
return MatchFirst(parseElementClass(sym) for sym in symbols).setName(' | '.join(symbols))
def dictOf( key, value ):
"""
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
"""
return Dict( ZeroOrMore( Group ( key + value ) ) )
def originalTextFor(expr, asString=True):
"""
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
"""
locMarker = Empty().setParseAction(lambda s,loc,t: loc)
endlocMarker = locMarker.copy()
endlocMarker.callPreparse = False
matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end")
if asString:
extractText = lambda s,l,t: s[t._original_start:t._original_end]
else:
def extractText(s,l,t):
t[:] = [s[t.pop('_original_start'):t.pop('_original_end')]]
matchExpr.setParseAction(extractText)
matchExpr.ignoreExprs = expr.ignoreExprs
return matchExpr
def ungroup(expr):
"""
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
"""
return TokenConverter(expr).setParseAction(lambda t:t[0])
def locatedExpr(expr):
"""
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
"""
locator = Empty().setParseAction(lambda s,l,t: l)
return Group(locator("locn_start") + expr("value") + locator.copy().leaveWhitespace()("locn_end"))
# convenience constants for positional expressions
empty = Empty().setName("empty")
lineStart = LineStart().setName("lineStart")
lineEnd = LineEnd().setName("lineEnd")
stringStart = StringStart().setName("stringStart")
stringEnd = StringEnd().setName("stringEnd")
_escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1])
_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16)))
_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8)))
_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(printables, excludeChars=r'\]', exact=1) | Regex(r"\w", re.UNICODE)
_charRange = Group(_singleChar + Suppress("-") + _singleChar)
_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]"
def srange(s):
r"""
Helper to easily define string ranges for use in Word construction. Borrows
syntax from regexp '[]' string range definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string is the expanded
character set joined into a single string.
The values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
"""
_expanded = lambda p: p if not isinstance(p,ParseResults) else ''.join(unichr(c) for c in range(ord(p[0]),ord(p[1])+1))
try:
return "".join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
except Exception:
return ""
def matchOnlyAtCol(n):
"""
Helper method for defining parse actions that require matching at a specific
column in the input text.
"""
def verifyCol(strg,locn,toks):
if col(locn,strg) != n:
raise ParseException(strg,locn,"matched token not at column %d" % n)
return verifyCol
def replaceWith(replStr):
"""
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
"""
return lambda s,l,t: [replStr]
def removeQuotes(s,l,t):
"""
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
"""
return t[0][1:-1]
def tokenMap(func, *args):
"""
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
"""
def pa(s,l,t):
return [func(tokn, *args) for tokn in t]
try:
func_name = getattr(func, '__name__',
getattr(func, '__class__').__name__)
except Exception:
func_name = str(func)
pa.__name__ = func_name
return pa
upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
"""(Deprecated) Helper parse action to convert tokens to upper case. Deprecated in favor of L{pyparsing_common.upcaseTokens}"""
downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
"""(Deprecated) Helper parse action to convert tokens to lower case. Deprecated in favor of L{pyparsing_common.downcaseTokens}"""
def _makeTags(tagStr, xml):
"""Internal helper to construct opening and closing tag expressions, given a tag name"""
if isinstance(tagStr,basestring):
resname = tagStr
tagStr = Keyword(tagStr, caseless=not xml)
else:
resname = tagStr.name
tagAttrName = Word(alphas,alphanums+"_-:")
if (xml):
tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes )
openTag = Suppress("<") + tagStr("tag") + \
Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \
Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
else:
printablesLessRAbrack = "".join(c for c in printables if c not in ">")
tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack)
openTag = Suppress("<") + tagStr("tag") + \
Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \
Optional( Suppress("=") + tagAttrValue ) ))) + \
Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
closeTag = Combine(_L("</") + tagStr + ">")
openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % resname)
closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("</%s>" % resname)
openTag.tag = resname
closeTag.tag = resname
return openTag, closeTag
def makeHTMLTags(tagStr):
"""
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
"""
return _makeTags( tagStr, False )
def makeXMLTags(tagStr):
"""
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
"""
return _makeTags( tagStr, True )
def withAttribute(*args,**attrDict):
"""
Helper to create a validating parse action to be used with start tags created
with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
with a required attribute value, to avoid false matches on common tags such as
C{<TD>} or C{<DIV>}.
Call C{withAttribute} with a series of attribute names and values. Specify the list
of filter attributes names and values as:
- keyword arguments, as in C{(align="right")}, or
- as an explicit dict with C{**} operator, when an attribute name is also a Python
reserved word, as in C{**{"class":"Customer", "align":"right"}}
- a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
For attribute names with a namespace prefix, you must use the second form. Attribute
names are matched insensitive to upper/lower case.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
"""
if args:
attrs = args[:]
else:
attrs = attrDict.items()
attrs = [(k,v) for k,v in attrs]
def pa(s,l,tokens):
for attrName,attrValue in attrs:
if attrName not in tokens:
raise ParseException(s,l,"no matching attribute " + attrName)
if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" %
(attrName, tokens[attrName], attrValue))
return pa
withAttribute.ANY_VALUE = object()
def withClass(classname, namespace=''):
"""
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
"""
classattr = "%s:class" % namespace if namespace else "class"
return withAttribute(**{classattr : classname})
opAssoc = _Constants()
opAssoc.LEFT = object()
opAssoc.RIGHT = object()
def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ):
"""
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
"""
ret = Forward()
lastExpr = baseExpr | ( lpar + ret + rpar )
for i,operDef in enumerate(opList):
opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4]
termName = "%s term" % opExpr if arity < 3 else "%s%s term" % opExpr
if arity == 3:
if opExpr is None or len(opExpr) != 2:
raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions")
opExpr1, opExpr2 = opExpr
thisExpr = Forward().setName(termName)
if rightLeftAssoc == opAssoc.LEFT:
if arity == 1:
matchExpr = FollowedBy(lastExpr + opExpr) + Group( lastExpr + OneOrMore( opExpr ) )
elif arity == 2:
if opExpr is not None:
matchExpr = FollowedBy(lastExpr + opExpr + lastExpr) + Group( lastExpr + OneOrMore( opExpr + lastExpr ) )
else:
matchExpr = FollowedBy(lastExpr+lastExpr) + Group( lastExpr + OneOrMore(lastExpr) )
elif arity == 3:
matchExpr = FollowedBy(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr) + \
Group( lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr )
else:
raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
elif rightLeftAssoc == opAssoc.RIGHT:
if arity == 1:
# try to avoid LR with this extra test
if not isinstance(opExpr, Optional):
opExpr = Optional(opExpr)
matchExpr = FollowedBy(opExpr.expr + thisExpr) + Group( opExpr + thisExpr )
elif arity == 2:
if opExpr is not None:
matchExpr = FollowedBy(lastExpr + opExpr + thisExpr) + Group( lastExpr + OneOrMore( opExpr + thisExpr ) )
else:
matchExpr = FollowedBy(lastExpr + thisExpr) + Group( lastExpr + OneOrMore( thisExpr ) )
elif arity == 3:
matchExpr = FollowedBy(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr) + \
Group( lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr )
else:
raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
else:
raise ValueError("operator must indicate right or left associativity")
if pa:
matchExpr.setParseAction( pa )
thisExpr <<= ( matchExpr.setName(termName) | lastExpr )
lastExpr = thisExpr
ret <<= lastExpr
return ret
operatorPrecedence = infixNotation
"""(Deprecated) Former name of C{L{infixNotation}}, will be dropped in a future release."""
dblQuotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"').setName("string enclosed in double quotes")
sglQuotedString = Combine(Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("string enclosed in single quotes")
quotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"'|
Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("quotedString using single or double quotes")
unicodeString = Combine(_L('u') + quotedString.copy()).setName("unicode string literal")
def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()):
"""
Helper method for defining nested lists enclosed in opening and closing
delimiters ("(" and ")" are the default).
Parameters:
- opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
"""
if opener == closer:
raise ValueError("opening and closing strings cannot be the same")
if content is None:
if isinstance(opener,basestring) and isinstance(closer,basestring):
if len(opener) == 1 and len(closer)==1:
if ignoreExpr is not None:
content = (Combine(OneOrMore(~ignoreExpr +
CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS,exact=1))
).setParseAction(lambda t:t[0].strip()))
else:
content = (empty.copy()+CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS
).setParseAction(lambda t:t[0].strip()))
else:
if ignoreExpr is not None:
content = (Combine(OneOrMore(~ignoreExpr +
~Literal(opener) + ~Literal(closer) +
CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
).setParseAction(lambda t:t[0].strip()))
else:
content = (Combine(OneOrMore(~Literal(opener) + ~Literal(closer) +
CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
).setParseAction(lambda t:t[0].strip()))
else:
raise ValueError("opening and closing arguments must be strings if no content expression is given")
ret = Forward()
if ignoreExpr is not None:
ret <<= Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) )
else:
ret <<= Group( Suppress(opener) + ZeroOrMore( ret | content ) + Suppress(closer) )
ret.setName('nested %s%s expression' % (opener,closer))
return ret
def indentedBlock(blockStatementExpr, indentStack, indent=True):
"""
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
"""
def checkPeerIndent(s,l,t):
if l >= len(s): return
curCol = col(l,s)
if curCol != indentStack[-1]:
if curCol > indentStack[-1]:
raise ParseFatalException(s,l,"illegal nesting")
raise ParseException(s,l,"not a peer entry")
def checkSubIndent(s,l,t):
curCol = col(l,s)
if curCol > indentStack[-1]:
indentStack.append( curCol )
else:
raise ParseException(s,l,"not a subentry")
def checkUnindent(s,l,t):
if l >= len(s): return
curCol = col(l,s)
if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]):
raise ParseException(s,l,"not an unindent")
indentStack.pop()
NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress())
INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName('INDENT')
PEER = Empty().setParseAction(checkPeerIndent).setName('')
UNDENT = Empty().setParseAction(checkUnindent).setName('UNINDENT')
if indent:
smExpr = Group( Optional(NL) +
#~ FollowedBy(blockStatementExpr) +
INDENT + (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) + UNDENT)
else:
smExpr = Group( Optional(NL) +
(OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) )
blockStatementExpr.ignore(_bslash + LineEnd())
return smExpr.setName('indented block')
alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]")
punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]")
anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:").setName('any tag'))
_htmlEntityMap = dict(zip("gt lt amp nbsp quot apos".split(),'><& "\''))
commonHTMLEntity = Regex('&(?P<entity>' + '|'.join(_htmlEntityMap.keys()) +");").setName("common HTML entity")
def replaceHTMLEntity(t):
"""Helper parser action to replace common HTML entities with their special characters"""
return _htmlEntityMap.get(t.entity)
# it's easy to get these comment structures wrong - they're very common, so may as well make them available
cStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/').setName("C style comment")
"Comment of the form C{/* ... */}"
htmlComment = Regex(r"<!--[\s\S]*?-->").setName("HTML comment")
"Comment of the form C{<!-- ... -->}"
restOfLine = Regex(r".*").leaveWhitespace().setName("rest of line")
dblSlashComment = Regex(r"//(?:\\\n|[^\n])*").setName("// comment")
"Comment of the form C{// ... (to end of line)}"
cppStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/'| dblSlashComment).setName("C++ style comment")
"Comment of either form C{L{cStyleComment}} or C{L{dblSlashComment}}"
javaStyleComment = cppStyleComment
"Same as C{L{cppStyleComment}}"
pythonStyleComment = Regex(r"#.*").setName("Python style comment")
"Comment of the form C{# ... (to end of line)}"
_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=',') +
Optional( Word(" \t") +
~Literal(",") + ~LineEnd() ) ) ).streamline().setName("commaItem")
commaSeparatedList = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("commaSeparatedList")
"""(Deprecated) Predefined expression of 1 or more printable words or quoted strings, separated by commas.
This expression is deprecated in favor of L{pyparsing_common.comma_separated_list}."""
# some other useful expressions - using lower-case class name since we are really using this as a namespace
class pyparsing_common:
"""
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
"""
convertToInteger = tokenMap(int)
"""
Parse action for converting parsed integers to Python int
"""
convertToFloat = tokenMap(float)
"""
Parse action for converting parsed numbers to Python float
"""
integer = Word(nums).setName("integer").setParseAction(convertToInteger)
"""expression that parses an unsigned integer, returns an int"""
hex_integer = Word(hexnums).setName("hex integer").setParseAction(tokenMap(int,16))
"""expression that parses a hexadecimal integer, returns an int"""
signed_integer = Regex(r'[+-]?\d+').setName("signed integer").setParseAction(convertToInteger)
"""expression that parses an integer with optional leading sign, returns an int"""
fraction = (signed_integer().setParseAction(convertToFloat) + '/' + signed_integer().setParseAction(convertToFloat)).setName("fraction")
"""fractional expression of an integer divided by an integer, returns a float"""
fraction.addParseAction(lambda t: t[0]/t[-1])
mixed_integer = (fraction | signed_integer + Optional(Optional('-').suppress() + fraction)).setName("fraction or mixed integer-fraction")
"""mixed integer of the form 'integer - fraction', with optional leading integer, returns float"""
mixed_integer.addParseAction(sum)
real = Regex(r'[+-]?\d+\.\d*').setName("real number").setParseAction(convertToFloat)
"""expression that parses a floating point number and returns a float"""
sci_real = Regex(r'[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)').setName("real number with scientific notation").setParseAction(convertToFloat)
"""expression that parses a floating point number with optional scientific notation and returns a float"""
# streamlining this expression makes the docs nicer-looking
number = (sci_real | real | signed_integer).streamline()
"""any numeric expression, returns the corresponding Python type"""
fnumber = Regex(r'[+-]?\d+\.?\d*([eE][+-]?\d+)?').setName("fnumber").setParseAction(convertToFloat)
"""any int or real number, returned as float"""
identifier = Word(alphas+'_', alphanums+'_').setName("identifier")
"""typical code identifier (leading alpha or '_', followed by 0 or more alphas, nums, or '_')"""
ipv4_address = Regex(r'(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}').setName("IPv4 address")
"IPv4 address (C{0.0.0.0 - 255.255.255.255})"
_ipv6_part = Regex(r'[0-9a-fA-F]{1,4}').setName("hex_integer")
_full_ipv6_address = (_ipv6_part + (':' + _ipv6_part)*7).setName("full IPv6 address")
_short_ipv6_address = (Optional(_ipv6_part + (':' + _ipv6_part)*(0,6)) + "::" + Optional(_ipv6_part + (':' + _ipv6_part)*(0,6))).setName("short IPv6 address")
_short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) < 8)
_mixed_ipv6_address = ("::ffff:" + ipv4_address).setName("mixed IPv6 address")
ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName("IPv6 address")).setName("IPv6 address")
"IPv6 address (long, short, or mixed form)"
mac_address = Regex(r'[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}').setName("MAC address")
"MAC address xx:xx:xx:xx:xx (may also have '-' or '.' delimiters)"
@staticmethod
def convertToDate(fmt="%Y-%m-%d"):
"""
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
"""
def cvt_fn(s,l,t):
try:
return datetime.strptime(t[0], fmt).date()
except ValueError as ve:
raise ParseException(s, l, str(ve))
return cvt_fn
@staticmethod
def convertToDatetime(fmt="%Y-%m-%dT%H:%M:%S.%f"):
"""
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
"""
def cvt_fn(s,l,t):
try:
return datetime.strptime(t[0], fmt)
except ValueError as ve:
raise ParseException(s, l, str(ve))
return cvt_fn
iso8601_date = Regex(r'(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?').setName("ISO8601 date")
"ISO8601 date (C{yyyy-mm-dd})"
iso8601_datetime = Regex(r'(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?').setName("ISO8601 datetime")
"ISO8601 datetime (C{yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)}) - trailing seconds, milliseconds, and timezone optional; accepts separating C{'T'} or C{' '}"
uuid = Regex(r'[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}').setName("UUID")
"UUID (C{xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx})"
_html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
@staticmethod
def stripHTMLTags(s, l, tokens):
"""
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
"""
return pyparsing_common._html_stripper.transformString(tokens[0])
_commasepitem = Combine(OneOrMore(~Literal(",") + ~LineEnd() + Word(printables, excludeChars=',')
+ Optional( White(" \t") ) ) ).streamline().setName("commaItem")
comma_separated_list = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("comma separated list")
"""Predefined expression of 1 or more printable words or quoted strings, separated by commas."""
upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
"""Parse action to convert tokens to upper case."""
downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
"""Parse action to convert tokens to lower case."""
if __name__ == "__main__":
selectToken = CaselessLiteral("select")
fromToken = CaselessLiteral("from")
ident = Word(alphas, alphanums + "_$")
columnName = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
columnNameList = Group(delimitedList(columnName)).setName("columns")
columnSpec = ('*' | columnNameList)
tableName = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
tableNameList = Group(delimitedList(tableName)).setName("tables")
simpleSQL = selectToken("command") + columnSpec("columns") + fromToken + tableNameList("tables")
# demo runTests method, including embedded comments in test string
simpleSQL.runTests("""
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
""")
pyparsing_common.number.runTests("""
100
-100
+100
3.14159
6.02e23
1e-12
""")
# any int or real number, returned as float
pyparsing_common.fnumber.runTests("""
100
-100
+100
3.14159
6.02e23
1e-12
""")
pyparsing_common.hex_integer.runTests("""
100
FF
""")
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests("""
12345678-1234-5678-1234-567812345678
""")
six.py 0000644 00000074250 14751155147 0005743 0 ustar 00 # Copyright (c) 2010-2017 Benjamin Peterson
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
"""Utilities for writing code that runs on Python 2 and 3"""
from __future__ import absolute_import
import functools
import itertools
import operator
import sys
import types
__author__ = "Benjamin Peterson <benjamin@python.org>"
__version__ = "1.11.0"
# Useful for very coarse version differentiation.
PY2 = sys.version_info[0] == 2
PY3 = sys.version_info[0] == 3
PY34 = sys.version_info[0:2] >= (3, 4)
if PY3:
string_types = str,
integer_types = int,
class_types = type,
text_type = str
binary_type = bytes
MAXSIZE = sys.maxsize
else:
string_types = basestring,
integer_types = (int, long)
class_types = (type, types.ClassType)
text_type = unicode
binary_type = str
if sys.platform.startswith("java"):
# Jython always uses 32 bits.
MAXSIZE = int((1 << 31) - 1)
else:
# It's possible to have sizeof(long) != sizeof(Py_ssize_t).
class X(object):
def __len__(self):
return 1 << 31
try:
len(X())
except OverflowError:
# 32-bit
MAXSIZE = int((1 << 31) - 1)
else:
# 64-bit
MAXSIZE = int((1 << 63) - 1)
del X
def _add_doc(func, doc):
"""Add documentation to a function."""
func.__doc__ = doc
def _import_module(name):
"""Import module, returning the module after the last dot."""
__import__(name)
return sys.modules[name]
class _LazyDescr(object):
def __init__(self, name):
self.name = name
def __get__(self, obj, tp):
result = self._resolve()
setattr(obj, self.name, result) # Invokes __set__.
try:
# This is a bit ugly, but it avoids running this again by
# removing this descriptor.
delattr(obj.__class__, self.name)
except AttributeError:
pass
return result
class MovedModule(_LazyDescr):
def __init__(self, name, old, new=None):
super(MovedModule, self).__init__(name)
if PY3:
if new is None:
new = name
self.mod = new
else:
self.mod = old
def _resolve(self):
return _import_module(self.mod)
def __getattr__(self, attr):
_module = self._resolve()
value = getattr(_module, attr)
setattr(self, attr, value)
return value
class _LazyModule(types.ModuleType):
def __init__(self, name):
super(_LazyModule, self).__init__(name)
self.__doc__ = self.__class__.__doc__
def __dir__(self):
attrs = ["__doc__", "__name__"]
attrs += [attr.name for attr in self._moved_attributes]
return attrs
# Subclasses should override this
_moved_attributes = []
class MovedAttribute(_LazyDescr):
def __init__(self, name, old_mod, new_mod, old_attr=None, new_attr=None):
super(MovedAttribute, self).__init__(name)
if PY3:
if new_mod is None:
new_mod = name
self.mod = new_mod
if new_attr is None:
if old_attr is None:
new_attr = name
else:
new_attr = old_attr
self.attr = new_attr
else:
self.mod = old_mod
if old_attr is None:
old_attr = name
self.attr = old_attr
def _resolve(self):
module = _import_module(self.mod)
return getattr(module, self.attr)
class _SixMetaPathImporter(object):
"""
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
"""
def __init__(self, six_module_name):
self.name = six_module_name
self.known_modules = {}
def _add_module(self, mod, *fullnames):
for fullname in fullnames:
self.known_modules[self.name + "." + fullname] = mod
def _get_module(self, fullname):
return self.known_modules[self.name + "." + fullname]
def find_module(self, fullname, path=None):
if fullname in self.known_modules:
return self
return None
def __get_module(self, fullname):
try:
return self.known_modules[fullname]
except KeyError:
raise ImportError("This loader does not know module " + fullname)
def load_module(self, fullname):
try:
# in case of a reload
return sys.modules[fullname]
except KeyError:
pass
mod = self.__get_module(fullname)
if isinstance(mod, MovedModule):
mod = mod._resolve()
else:
mod.__loader__ = self
sys.modules[fullname] = mod
return mod
def is_package(self, fullname):
"""
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
"""
return hasattr(self.__get_module(fullname), "__path__")
def get_code(self, fullname):
"""Return None
Required, if is_package is implemented"""
self.__get_module(fullname) # eventually raises ImportError
return None
get_source = get_code # same as get_code
_importer = _SixMetaPathImporter(__name__)
class _MovedItems(_LazyModule):
"""Lazy loading of moved objects"""
__path__ = [] # mark as package
_moved_attributes = [
MovedAttribute("cStringIO", "cStringIO", "io", "StringIO"),
MovedAttribute("filter", "itertools", "builtins", "ifilter", "filter"),
MovedAttribute("filterfalse", "itertools", "itertools", "ifilterfalse", "filterfalse"),
MovedAttribute("input", "__builtin__", "builtins", "raw_input", "input"),
MovedAttribute("intern", "__builtin__", "sys"),
MovedAttribute("map", "itertools", "builtins", "imap", "map"),
MovedAttribute("getcwd", "os", "os", "getcwdu", "getcwd"),
MovedAttribute("getcwdb", "os", "os", "getcwd", "getcwdb"),
MovedAttribute("getoutput", "commands", "subprocess"),
MovedAttribute("range", "__builtin__", "builtins", "xrange", "range"),
MovedAttribute("reload_module", "__builtin__", "importlib" if PY34 else "imp", "reload"),
MovedAttribute("reduce", "__builtin__", "functools"),
MovedAttribute("shlex_quote", "pipes", "shlex", "quote"),
MovedAttribute("StringIO", "StringIO", "io"),
MovedAttribute("UserDict", "UserDict", "collections"),
MovedAttribute("UserList", "UserList", "collections"),
MovedAttribute("UserString", "UserString", "collections"),
MovedAttribute("xrange", "__builtin__", "builtins", "xrange", "range"),
MovedAttribute("zip", "itertools", "builtins", "izip", "zip"),
MovedAttribute("zip_longest", "itertools", "itertools", "izip_longest", "zip_longest"),
MovedModule("builtins", "__builtin__"),
MovedModule("configparser", "ConfigParser"),
MovedModule("copyreg", "copy_reg"),
MovedModule("dbm_gnu", "gdbm", "dbm.gnu"),
MovedModule("_dummy_thread", "dummy_thread", "_dummy_thread"),
MovedModule("http_cookiejar", "cookielib", "http.cookiejar"),
MovedModule("http_cookies", "Cookie", "http.cookies"),
MovedModule("html_entities", "htmlentitydefs", "html.entities"),
MovedModule("html_parser", "HTMLParser", "html.parser"),
MovedModule("http_client", "httplib", "http.client"),
MovedModule("email_mime_base", "email.MIMEBase", "email.mime.base"),
MovedModule("email_mime_image", "email.MIMEImage", "email.mime.image"),
MovedModule("email_mime_multipart", "email.MIMEMultipart", "email.mime.multipart"),
MovedModule("email_mime_nonmultipart", "email.MIMENonMultipart", "email.mime.nonmultipart"),
MovedModule("email_mime_text", "email.MIMEText", "email.mime.text"),
MovedModule("BaseHTTPServer", "BaseHTTPServer", "http.server"),
MovedModule("CGIHTTPServer", "CGIHTTPServer", "http.server"),
MovedModule("SimpleHTTPServer", "SimpleHTTPServer", "http.server"),
MovedModule("cPickle", "cPickle", "pickle"),
MovedModule("queue", "Queue"),
MovedModule("reprlib", "repr"),
MovedModule("socketserver", "SocketServer"),
MovedModule("_thread", "thread", "_thread"),
MovedModule("tkinter", "Tkinter"),
MovedModule("tkinter_dialog", "Dialog", "tkinter.dialog"),
MovedModule("tkinter_filedialog", "FileDialog", "tkinter.filedialog"),
MovedModule("tkinter_scrolledtext", "ScrolledText", "tkinter.scrolledtext"),
MovedModule("tkinter_simpledialog", "SimpleDialog", "tkinter.simpledialog"),
MovedModule("tkinter_tix", "Tix", "tkinter.tix"),
MovedModule("tkinter_ttk", "ttk", "tkinter.ttk"),
MovedModule("tkinter_constants", "Tkconstants", "tkinter.constants"),
MovedModule("tkinter_dnd", "Tkdnd", "tkinter.dnd"),
MovedModule("tkinter_colorchooser", "tkColorChooser",
"tkinter.colorchooser"),
MovedModule("tkinter_commondialog", "tkCommonDialog",
"tkinter.commondialog"),
MovedModule("tkinter_tkfiledialog", "tkFileDialog", "tkinter.filedialog"),
MovedModule("tkinter_font", "tkFont", "tkinter.font"),
MovedModule("tkinter_messagebox", "tkMessageBox", "tkinter.messagebox"),
MovedModule("tkinter_tksimpledialog", "tkSimpleDialog",
"tkinter.simpledialog"),
MovedModule("urllib_parse", __name__ + ".moves.urllib_parse", "urllib.parse"),
MovedModule("urllib_error", __name__ + ".moves.urllib_error", "urllib.error"),
MovedModule("urllib", __name__ + ".moves.urllib", __name__ + ".moves.urllib"),
MovedModule("urllib_robotparser", "robotparser", "urllib.robotparser"),
MovedModule("xmlrpc_client", "xmlrpclib", "xmlrpc.client"),
MovedModule("xmlrpc_server", "SimpleXMLRPCServer", "xmlrpc.server"),
]
# Add windows specific modules.
if sys.platform == "win32":
_moved_attributes += [
MovedModule("winreg", "_winreg"),
]
for attr in _moved_attributes:
setattr(_MovedItems, attr.name, attr)
if isinstance(attr, MovedModule):
_importer._add_module(attr, "moves." + attr.name)
del attr
_MovedItems._moved_attributes = _moved_attributes
moves = _MovedItems(__name__ + ".moves")
_importer._add_module(moves, "moves")
class Module_six_moves_urllib_parse(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_parse"""
_urllib_parse_moved_attributes = [
MovedAttribute("ParseResult", "urlparse", "urllib.parse"),
MovedAttribute("SplitResult", "urlparse", "urllib.parse"),
MovedAttribute("parse_qs", "urlparse", "urllib.parse"),
MovedAttribute("parse_qsl", "urlparse", "urllib.parse"),
MovedAttribute("urldefrag", "urlparse", "urllib.parse"),
MovedAttribute("urljoin", "urlparse", "urllib.parse"),
MovedAttribute("urlparse", "urlparse", "urllib.parse"),
MovedAttribute("urlsplit", "urlparse", "urllib.parse"),
MovedAttribute("urlunparse", "urlparse", "urllib.parse"),
MovedAttribute("urlunsplit", "urlparse", "urllib.parse"),
MovedAttribute("quote", "urllib", "urllib.parse"),
MovedAttribute("quote_plus", "urllib", "urllib.parse"),
MovedAttribute("unquote", "urllib", "urllib.parse"),
MovedAttribute("unquote_plus", "urllib", "urllib.parse"),
MovedAttribute("unquote_to_bytes", "urllib", "urllib.parse", "unquote", "unquote_to_bytes"),
MovedAttribute("urlencode", "urllib", "urllib.parse"),
MovedAttribute("splitquery", "urllib", "urllib.parse"),
MovedAttribute("splittag", "urllib", "urllib.parse"),
MovedAttribute("splituser", "urllib", "urllib.parse"),
MovedAttribute("splitvalue", "urllib", "urllib.parse"),
MovedAttribute("uses_fragment", "urlparse", "urllib.parse"),
MovedAttribute("uses_netloc", "urlparse", "urllib.parse"),
MovedAttribute("uses_params", "urlparse", "urllib.parse"),
MovedAttribute("uses_query", "urlparse", "urllib.parse"),
MovedAttribute("uses_relative", "urlparse", "urllib.parse"),
]
for attr in _urllib_parse_moved_attributes:
setattr(Module_six_moves_urllib_parse, attr.name, attr)
del attr
Module_six_moves_urllib_parse._moved_attributes = _urllib_parse_moved_attributes
_importer._add_module(Module_six_moves_urllib_parse(__name__ + ".moves.urllib_parse"),
"moves.urllib_parse", "moves.urllib.parse")
class Module_six_moves_urllib_error(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_error"""
_urllib_error_moved_attributes = [
MovedAttribute("URLError", "urllib2", "urllib.error"),
MovedAttribute("HTTPError", "urllib2", "urllib.error"),
MovedAttribute("ContentTooShortError", "urllib", "urllib.error"),
]
for attr in _urllib_error_moved_attributes:
setattr(Module_six_moves_urllib_error, attr.name, attr)
del attr
Module_six_moves_urllib_error._moved_attributes = _urllib_error_moved_attributes
_importer._add_module(Module_six_moves_urllib_error(__name__ + ".moves.urllib.error"),
"moves.urllib_error", "moves.urllib.error")
class Module_six_moves_urllib_request(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_request"""
_urllib_request_moved_attributes = [
MovedAttribute("urlopen", "urllib2", "urllib.request"),
MovedAttribute("install_opener", "urllib2", "urllib.request"),
MovedAttribute("build_opener", "urllib2", "urllib.request"),
MovedAttribute("pathname2url", "urllib", "urllib.request"),
MovedAttribute("url2pathname", "urllib", "urllib.request"),
MovedAttribute("getproxies", "urllib", "urllib.request"),
MovedAttribute("Request", "urllib2", "urllib.request"),
MovedAttribute("OpenerDirector", "urllib2", "urllib.request"),
MovedAttribute("HTTPDefaultErrorHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPRedirectHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPCookieProcessor", "urllib2", "urllib.request"),
MovedAttribute("ProxyHandler", "urllib2", "urllib.request"),
MovedAttribute("BaseHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPPasswordMgr", "urllib2", "urllib.request"),
MovedAttribute("HTTPPasswordMgrWithDefaultRealm", "urllib2", "urllib.request"),
MovedAttribute("AbstractBasicAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPBasicAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("ProxyBasicAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("AbstractDigestAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPDigestAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("ProxyDigestAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPSHandler", "urllib2", "urllib.request"),
MovedAttribute("FileHandler", "urllib2", "urllib.request"),
MovedAttribute("FTPHandler", "urllib2", "urllib.request"),
MovedAttribute("CacheFTPHandler", "urllib2", "urllib.request"),
MovedAttribute("UnknownHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPErrorProcessor", "urllib2", "urllib.request"),
MovedAttribute("urlretrieve", "urllib", "urllib.request"),
MovedAttribute("urlcleanup", "urllib", "urllib.request"),
MovedAttribute("URLopener", "urllib", "urllib.request"),
MovedAttribute("FancyURLopener", "urllib", "urllib.request"),
MovedAttribute("proxy_bypass", "urllib", "urllib.request"),
MovedAttribute("parse_http_list", "urllib2", "urllib.request"),
MovedAttribute("parse_keqv_list", "urllib2", "urllib.request"),
]
for attr in _urllib_request_moved_attributes:
setattr(Module_six_moves_urllib_request, attr.name, attr)
del attr
Module_six_moves_urllib_request._moved_attributes = _urllib_request_moved_attributes
_importer._add_module(Module_six_moves_urllib_request(__name__ + ".moves.urllib.request"),
"moves.urllib_request", "moves.urllib.request")
class Module_six_moves_urllib_response(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_response"""
_urllib_response_moved_attributes = [
MovedAttribute("addbase", "urllib", "urllib.response"),
MovedAttribute("addclosehook", "urllib", "urllib.response"),
MovedAttribute("addinfo", "urllib", "urllib.response"),
MovedAttribute("addinfourl", "urllib", "urllib.response"),
]
for attr in _urllib_response_moved_attributes:
setattr(Module_six_moves_urllib_response, attr.name, attr)
del attr
Module_six_moves_urllib_response._moved_attributes = _urllib_response_moved_attributes
_importer._add_module(Module_six_moves_urllib_response(__name__ + ".moves.urllib.response"),
"moves.urllib_response", "moves.urllib.response")
class Module_six_moves_urllib_robotparser(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_robotparser"""
_urllib_robotparser_moved_attributes = [
MovedAttribute("RobotFileParser", "robotparser", "urllib.robotparser"),
]
for attr in _urllib_robotparser_moved_attributes:
setattr(Module_six_moves_urllib_robotparser, attr.name, attr)
del attr
Module_six_moves_urllib_robotparser._moved_attributes = _urllib_robotparser_moved_attributes
_importer._add_module(Module_six_moves_urllib_robotparser(__name__ + ".moves.urllib.robotparser"),
"moves.urllib_robotparser", "moves.urllib.robotparser")
class Module_six_moves_urllib(types.ModuleType):
"""Create a six.moves.urllib namespace that resembles the Python 3 namespace"""
__path__ = [] # mark as package
parse = _importer._get_module("moves.urllib_parse")
error = _importer._get_module("moves.urllib_error")
request = _importer._get_module("moves.urllib_request")
response = _importer._get_module("moves.urllib_response")
robotparser = _importer._get_module("moves.urllib_robotparser")
def __dir__(self):
return ['parse', 'error', 'request', 'response', 'robotparser']
_importer._add_module(Module_six_moves_urllib(__name__ + ".moves.urllib"),
"moves.urllib")
def add_move(move):
"""Add an item to six.moves."""
setattr(_MovedItems, move.name, move)
def remove_move(name):
"""Remove item from six.moves."""
try:
delattr(_MovedItems, name)
except AttributeError:
try:
del moves.__dict__[name]
except KeyError:
raise AttributeError("no such move, %r" % (name,))
if PY3:
_meth_func = "__func__"
_meth_self = "__self__"
_func_closure = "__closure__"
_func_code = "__code__"
_func_defaults = "__defaults__"
_func_globals = "__globals__"
else:
_meth_func = "im_func"
_meth_self = "im_self"
_func_closure = "func_closure"
_func_code = "func_code"
_func_defaults = "func_defaults"
_func_globals = "func_globals"
try:
advance_iterator = next
except NameError:
def advance_iterator(it):
return it.next()
next = advance_iterator
try:
callable = callable
except NameError:
def callable(obj):
return any("__call__" in klass.__dict__ for klass in type(obj).__mro__)
if PY3:
def get_unbound_function(unbound):
return unbound
create_bound_method = types.MethodType
def create_unbound_method(func, cls):
return func
Iterator = object
else:
def get_unbound_function(unbound):
return unbound.im_func
def create_bound_method(func, obj):
return types.MethodType(func, obj, obj.__class__)
def create_unbound_method(func, cls):
return types.MethodType(func, None, cls)
class Iterator(object):
def next(self):
return type(self).__next__(self)
callable = callable
_add_doc(get_unbound_function,
"""Get the function out of a possibly unbound function""")
get_method_function = operator.attrgetter(_meth_func)
get_method_self = operator.attrgetter(_meth_self)
get_function_closure = operator.attrgetter(_func_closure)
get_function_code = operator.attrgetter(_func_code)
get_function_defaults = operator.attrgetter(_func_defaults)
get_function_globals = operator.attrgetter(_func_globals)
if PY3:
def iterkeys(d, **kw):
return iter(d.keys(**kw))
def itervalues(d, **kw):
return iter(d.values(**kw))
def iteritems(d, **kw):
return iter(d.items(**kw))
def iterlists(d, **kw):
return iter(d.lists(**kw))
viewkeys = operator.methodcaller("keys")
viewvalues = operator.methodcaller("values")
viewitems = operator.methodcaller("items")
else:
def iterkeys(d, **kw):
return d.iterkeys(**kw)
def itervalues(d, **kw):
return d.itervalues(**kw)
def iteritems(d, **kw):
return d.iteritems(**kw)
def iterlists(d, **kw):
return d.iterlists(**kw)
viewkeys = operator.methodcaller("viewkeys")
viewvalues = operator.methodcaller("viewvalues")
viewitems = operator.methodcaller("viewitems")
_add_doc(iterkeys, "Return an iterator over the keys of a dictionary.")
_add_doc(itervalues, "Return an iterator over the values of a dictionary.")
_add_doc(iteritems,
"Return an iterator over the (key, value) pairs of a dictionary.")
_add_doc(iterlists,
"Return an iterator over the (key, [values]) pairs of a dictionary.")
if PY3:
def b(s):
return s.encode("latin-1")
def u(s):
return s
unichr = chr
import struct
int2byte = struct.Struct(">B").pack
del struct
byte2int = operator.itemgetter(0)
indexbytes = operator.getitem
iterbytes = iter
import io
StringIO = io.StringIO
BytesIO = io.BytesIO
_assertCountEqual = "assertCountEqual"
if sys.version_info[1] <= 1:
_assertRaisesRegex = "assertRaisesRegexp"
_assertRegex = "assertRegexpMatches"
else:
_assertRaisesRegex = "assertRaisesRegex"
_assertRegex = "assertRegex"
else:
def b(s):
return s
# Workaround for standalone backslash
def u(s):
return unicode(s.replace(r'\\', r'\\\\'), "unicode_escape")
unichr = unichr
int2byte = chr
def byte2int(bs):
return ord(bs[0])
def indexbytes(buf, i):
return ord(buf[i])
iterbytes = functools.partial(itertools.imap, ord)
import StringIO
StringIO = BytesIO = StringIO.StringIO
_assertCountEqual = "assertItemsEqual"
_assertRaisesRegex = "assertRaisesRegexp"
_assertRegex = "assertRegexpMatches"
_add_doc(b, """Byte literal""")
_add_doc(u, """Text literal""")
def assertCountEqual(self, *args, **kwargs):
return getattr(self, _assertCountEqual)(*args, **kwargs)
def assertRaisesRegex(self, *args, **kwargs):
return getattr(self, _assertRaisesRegex)(*args, **kwargs)
def assertRegex(self, *args, **kwargs):
return getattr(self, _assertRegex)(*args, **kwargs)
if PY3:
exec_ = getattr(moves.builtins, "exec")
def reraise(tp, value, tb=None):
try:
if value is None:
value = tp()
if value.__traceback__ is not tb:
raise value.with_traceback(tb)
raise value
finally:
value = None
tb = None
else:
def exec_(_code_, _globs_=None, _locs_=None):
"""Execute code in a namespace."""
if _globs_ is None:
frame = sys._getframe(1)
_globs_ = frame.f_globals
if _locs_ is None:
_locs_ = frame.f_locals
del frame
elif _locs_ is None:
_locs_ = _globs_
exec("""exec _code_ in _globs_, _locs_""")
exec_("""def reraise(tp, value, tb=None):
try:
raise tp, value, tb
finally:
tb = None
""")
if sys.version_info[:2] == (3, 2):
exec_("""def raise_from(value, from_value):
try:
if from_value is None:
raise value
raise value from from_value
finally:
value = None
""")
elif sys.version_info[:2] > (3, 2):
exec_("""def raise_from(value, from_value):
try:
raise value from from_value
finally:
value = None
""")
else:
def raise_from(value, from_value):
raise value
print_ = getattr(moves.builtins, "print", None)
if print_ is None:
def print_(*args, **kwargs):
"""The new-style print function for Python 2.4 and 2.5."""
fp = kwargs.pop("file", sys.stdout)
if fp is None:
return
def write(data):
if not isinstance(data, basestring):
data = str(data)
# If the file has an encoding, encode unicode with it.
if (isinstance(fp, file) and
isinstance(data, unicode) and
fp.encoding is not None):
errors = getattr(fp, "errors", None)
if errors is None:
errors = "strict"
data = data.encode(fp.encoding, errors)
fp.write(data)
want_unicode = False
sep = kwargs.pop("sep", None)
if sep is not None:
if isinstance(sep, unicode):
want_unicode = True
elif not isinstance(sep, str):
raise TypeError("sep must be None or a string")
end = kwargs.pop("end", None)
if end is not None:
if isinstance(end, unicode):
want_unicode = True
elif not isinstance(end, str):
raise TypeError("end must be None or a string")
if kwargs:
raise TypeError("invalid keyword arguments to print()")
if not want_unicode:
for arg in args:
if isinstance(arg, unicode):
want_unicode = True
break
if want_unicode:
newline = unicode("\n")
space = unicode(" ")
else:
newline = "\n"
space = " "
if sep is None:
sep = space
if end is None:
end = newline
for i, arg in enumerate(args):
if i:
write(sep)
write(arg)
write(end)
if sys.version_info[:2] < (3, 3):
_print = print_
def print_(*args, **kwargs):
fp = kwargs.get("file", sys.stdout)
flush = kwargs.pop("flush", False)
_print(*args, **kwargs)
if flush and fp is not None:
fp.flush()
_add_doc(reraise, """Reraise an exception.""")
if sys.version_info[0:2] < (3, 4):
def wraps(wrapped, assigned=functools.WRAPPER_ASSIGNMENTS,
updated=functools.WRAPPER_UPDATES):
def wrapper(f):
f = functools.wraps(wrapped, assigned, updated)(f)
f.__wrapped__ = wrapped
return f
return wrapper
else:
wraps = functools.wraps
def with_metaclass(meta, *bases):
"""Create a base class with a metaclass."""
# This requires a bit of explanation: the basic idea is to make a dummy
# metaclass for one level of class instantiation that replaces itself with
# the actual metaclass.
class metaclass(type):
def __new__(cls, name, this_bases, d):
return meta(name, bases, d)
@classmethod
def __prepare__(cls, name, this_bases):
return meta.__prepare__(name, bases)
return type.__new__(metaclass, 'temporary_class', (), {})
def add_metaclass(metaclass):
"""Class decorator for creating a class with a metaclass."""
def wrapper(cls):
orig_vars = cls.__dict__.copy()
slots = orig_vars.get('__slots__')
if slots is not None:
if isinstance(slots, str):
slots = [slots]
for slots_var in slots:
orig_vars.pop(slots_var)
orig_vars.pop('__dict__', None)
orig_vars.pop('__weakref__', None)
return metaclass(cls.__name__, cls.__bases__, orig_vars)
return wrapper
def python_2_unicode_compatible(klass):
"""
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
"""
if PY2:
if '__str__' not in klass.__dict__:
raise ValueError("@python_2_unicode_compatible cannot be applied "
"to %s because it doesn't define __str__()." %
klass.__name__)
klass.__unicode__ = klass.__str__
klass.__str__ = lambda self: self.__unicode__().encode('utf-8')
return klass
# Complete the moves implementation.
# This code is at the end of this module to speed up module loading.
# Turn this module into a package.
__path__ = [] # required for PEP 302 and PEP 451
__package__ = __name__ # see PEP 366 @ReservedAssignment
if globals().get("__spec__") is not None:
__spec__.submodule_search_locations = [] # PEP 451 @UndefinedVariable
# Remove other six meta path importers, since they cause problems. This can
# happen if six is removed from sys.modules and then reloaded. (Setuptools does
# this for some reason.)
if sys.meta_path:
for i, importer in enumerate(sys.meta_path):
# Here's some real nastiness: Another "instance" of the six module might
# be floating around. Therefore, we can't use isinstance() to check for
# the six meta path importer, since the other six instance will have
# inserted an importer with different class.
if (type(importer).__name__ == "_SixMetaPathImporter" and
importer.name == __name__):
del sys.meta_path[i]
break
del i, importer
# Finally, add the importer to the meta path import hook.
sys.meta_path.append(_importer)
setuptools-39.2.0.dist-info/METADATA 0000644 00000005724 14751155147 0012534 0 ustar 00 Metadata-Version: 2.0
Name: setuptools
Version: 39.2.0
Summary: Easily download, build, install, upgrade, and uninstall Python packages
Home-page: https://github.com/pypa/setuptools
Author: Python Packaging Authority
Author-email: distutils-sig@python.org
License: UNKNOWN
Project-URL: Documentation, https://setuptools.readthedocs.io/
Keywords: CPAN PyPI distutils eggs package management
Platform: UNKNOWN
Classifier: Development Status :: 5 - Production/Stable
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 2
Classifier: Programming Language :: Python :: 2.7
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.3
Classifier: Programming Language :: Python :: 3.4
Classifier: Programming Language :: Python :: 3.5
Classifier: Programming Language :: Python :: 3.6
Classifier: Topic :: Software Development :: Libraries :: Python Modules
Classifier: Topic :: System :: Archiving :: Packaging
Classifier: Topic :: System :: Systems Administration
Classifier: Topic :: Utilities
Requires-Python: >=2.7,!=3.0.*,!=3.1.*,!=3.2.*
Description-Content-Type: text/x-rst; charset=UTF-8
Provides-Extra: ssl
Provides-Extra: certs
Provides-Extra: certs
Requires-Dist: certifi (==2016.9.26); extra == 'certs'
Provides-Extra: ssl
Requires-Dist: wincertstore (==0.2); sys_platform=='win32' and extra == 'ssl'
.. image:: https://img.shields.io/pypi/v/setuptools.svg
:target: https://pypi.org/project/setuptools
.. image:: https://readthedocs.org/projects/setuptools/badge/?version=latest
:target: https://setuptools.readthedocs.io
.. image:: https://img.shields.io/travis/pypa/setuptools/master.svg?label=Linux%20build%20%40%20Travis%20CI
:target: https://travis-ci.org/pypa/setuptools
.. image:: https://img.shields.io/appveyor/ci/pypa/setuptools/master.svg?label=Windows%20build%20%40%20Appveyor
:target: https://ci.appveyor.com/project/pypa/setuptools/branch/master
.. image:: https://img.shields.io/codecov/c/github/pypa/setuptools/master.svg
:target: https://codecov.io/gh/pypa/setuptools
.. image:: https://img.shields.io/pypi/pyversions/setuptools.svg
See the `Installation Instructions
<https://packaging.python.org/installing/>`_ in the Python Packaging
User's Guide for instructions on installing, upgrading, and uninstalling
Setuptools.
The project is `maintained at GitHub <https://github.com/pypa/setuptools>`_.
Questions and comments should be directed to the `distutils-sig
mailing list <http://mail.python.org/pipermail/distutils-sig/>`_.
Bug reports and especially tested patches may be
submitted directly to the `bug tracker
<https://github.com/pypa/setuptools/issues>`_.
Code of Conduct
---------------
Everyone interacting in the setuptools project's codebases, issue trackers,
chat rooms, and mailing lists is expected to follow the
`PyPA Code of Conduct <https://www.pypa.io/en/latest/code-of-conduct/>`_.
setuptools-39.2.0.dist-info/INSTALLER 0000644 00000000004 14751155147 0012673 0 ustar 00 pip
setuptools-39.2.0.dist-info/entry_points.txt 0000644 00000005656 14751155147 0014733 0 ustar 00 [console_scripts]
easy_install = setuptools.command.easy_install:main
easy_install-3.6 = setuptools.command.easy_install:main
[distutils.commands]
alias = setuptools.command.alias:alias
bdist_egg = setuptools.command.bdist_egg:bdist_egg
bdist_rpm = setuptools.command.bdist_rpm:bdist_rpm
bdist_wininst = setuptools.command.bdist_wininst:bdist_wininst
build_clib = setuptools.command.build_clib:build_clib
build_ext = setuptools.command.build_ext:build_ext
build_py = setuptools.command.build_py:build_py
develop = setuptools.command.develop:develop
dist_info = setuptools.command.dist_info:dist_info
easy_install = setuptools.command.easy_install:easy_install
egg_info = setuptools.command.egg_info:egg_info
install = setuptools.command.install:install
install_egg_info = setuptools.command.install_egg_info:install_egg_info
install_lib = setuptools.command.install_lib:install_lib
install_scripts = setuptools.command.install_scripts:install_scripts
register = setuptools.command.register:register
rotate = setuptools.command.rotate:rotate
saveopts = setuptools.command.saveopts:saveopts
sdist = setuptools.command.sdist:sdist
setopt = setuptools.command.setopt:setopt
test = setuptools.command.test:test
upload = setuptools.command.upload:upload
upload_docs = setuptools.command.upload_docs:upload_docs
[distutils.setup_keywords]
convert_2to3_doctests = setuptools.dist:assert_string_list
dependency_links = setuptools.dist:assert_string_list
eager_resources = setuptools.dist:assert_string_list
entry_points = setuptools.dist:check_entry_points
exclude_package_data = setuptools.dist:check_package_data
extras_require = setuptools.dist:check_extras
include_package_data = setuptools.dist:assert_bool
install_requires = setuptools.dist:check_requirements
namespace_packages = setuptools.dist:check_nsp
package_data = setuptools.dist:check_package_data
packages = setuptools.dist:check_packages
python_requires = setuptools.dist:check_specifier
setup_requires = setuptools.dist:check_requirements
test_loader = setuptools.dist:check_importable
test_runner = setuptools.dist:check_importable
test_suite = setuptools.dist:check_test_suite
tests_require = setuptools.dist:check_requirements
use_2to3 = setuptools.dist:assert_bool
use_2to3_exclude_fixers = setuptools.dist:assert_string_list
use_2to3_fixers = setuptools.dist:assert_string_list
zip_safe = setuptools.dist:assert_bool
[egg_info.writers]
PKG-INFO = setuptools.command.egg_info:write_pkg_info
dependency_links.txt = setuptools.command.egg_info:overwrite_arg
depends.txt = setuptools.command.egg_info:warn_depends_obsolete
eager_resources.txt = setuptools.command.egg_info:overwrite_arg
entry_points.txt = setuptools.command.egg_info:write_entries
namespace_packages.txt = setuptools.command.egg_info:overwrite_arg
requires.txt = setuptools.command.egg_info:write_requirements
top_level.txt = setuptools.command.egg_info:write_toplevel_names
[setuptools.installation]
eggsecutable = setuptools.command.easy_install:bootstrap
setuptools-39.2.0.dist-info/DESCRIPTION.rst 0000644 00000003013 14751155147 0013733 0 ustar 00 .. image:: https://img.shields.io/pypi/v/setuptools.svg
:target: https://pypi.org/project/setuptools
.. image:: https://readthedocs.org/projects/setuptools/badge/?version=latest
:target: https://setuptools.readthedocs.io
.. image:: https://img.shields.io/travis/pypa/setuptools/master.svg?label=Linux%20build%20%40%20Travis%20CI
:target: https://travis-ci.org/pypa/setuptools
.. image:: https://img.shields.io/appveyor/ci/pypa/setuptools/master.svg?label=Windows%20build%20%40%20Appveyor
:target: https://ci.appveyor.com/project/pypa/setuptools/branch/master
.. image:: https://img.shields.io/codecov/c/github/pypa/setuptools/master.svg
:target: https://codecov.io/gh/pypa/setuptools
.. image:: https://img.shields.io/pypi/pyversions/setuptools.svg
See the `Installation Instructions
<https://packaging.python.org/installing/>`_ in the Python Packaging
User's Guide for instructions on installing, upgrading, and uninstalling
Setuptools.
The project is `maintained at GitHub <https://github.com/pypa/setuptools>`_.
Questions and comments should be directed to the `distutils-sig
mailing list <http://mail.python.org/pipermail/distutils-sig/>`_.
Bug reports and especially tested patches may be
submitted directly to the `bug tracker
<https://github.com/pypa/setuptools/issues>`_.
Code of Conduct
---------------
Everyone interacting in the setuptools project's codebases, issue trackers,
chat rooms, and mailing lists is expected to follow the
`PyPA Code of Conduct <https://www.pypa.io/en/latest/code-of-conduct/>`_.
setuptools-39.2.0.dist-info/zip-safe 0000644 00000000001 14751155147 0013051 0 ustar 00
setuptools-39.2.0.dist-info/LICENSE.txt 0000644 00000002066 14751155147 0013250 0 ustar 00 Copyright (C) 2016 Jason R Coombs <jaraco@jaraco.com>
Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the "Software"), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
setuptools-39.2.0.dist-info/dependency_links.txt 0000644 00000000357 14751155147 0015505 0 ustar 00 https://files.pythonhosted.org/packages/source/c/certifi/certifi-2016.9.26.tar.gz#md5=baa81e951a29958563689d868ef1064d
https://files.pythonhosted.org/packages/source/w/wincertstore/wincertstore-0.2.zip#md5=ae728f2f007185648d0c7a8679b361e2
setuptools-39.2.0.dist-info/top_level.txt 0000644 00000000046 14751155147 0014153 0 ustar 00 easy_install
pkg_resources
setuptools
setuptools-39.2.0.dist-info/metadata.json 0000644 00000011551 14751155147 0014077 0 ustar 00 {"classifiers": ["Development Status :: 5 - Production/Stable", "Intended Audience :: Developers", "License :: OSI Approved :: MIT License", "Operating System :: OS Independent", "Programming Language :: Python :: 2", "Programming Language :: Python :: 2.7", "Programming Language :: Python :: 3", "Programming Language :: Python :: 3.3", "Programming Language :: Python :: 3.4", "Programming Language :: Python :: 3.5", "Programming Language :: Python :: 3.6", "Topic :: Software Development :: Libraries :: Python Modules", "Topic :: System :: Archiving :: Packaging", "Topic :: System :: Systems Administration", "Topic :: Utilities"], "description_content_type": "text/x-rst; charset=UTF-8", "extensions": {"python.commands": {"wrap_console": {"easy_install": "setuptools.command.easy_install:main", "easy_install-3.6": "setuptools.command.easy_install:main"}}, "python.details": {"contacts": [{"email": "distutils-sig@python.org", "name": "Python Packaging Authority", "role": "author"}], "document_names": {"description": "DESCRIPTION.rst", "license": "LICENSE.txt"}, "project_urls": {"Home": "https://github.com/pypa/setuptools"}}, "python.exports": {"console_scripts": {"easy_install": "setuptools.command.easy_install:main", "easy_install-3.6": "setuptools.command.easy_install:main"}, "distutils.commands": {"alias": "setuptools.command.alias:alias", "bdist_egg": "setuptools.command.bdist_egg:bdist_egg", "bdist_rpm": "setuptools.command.bdist_rpm:bdist_rpm", "bdist_wininst": "setuptools.command.bdist_wininst:bdist_wininst", "build_clib": "setuptools.command.build_clib:build_clib", "build_ext": "setuptools.command.build_ext:build_ext", "build_py": "setuptools.command.build_py:build_py", "develop": "setuptools.command.develop:develop", "dist_info": "setuptools.command.dist_info:dist_info", "easy_install": "setuptools.command.easy_install:easy_install", "egg_info": "setuptools.command.egg_info:egg_info", "install": "setuptools.command.install:install", "install_egg_info": "setuptools.command.install_egg_info:install_egg_info", "install_lib": "setuptools.command.install_lib:install_lib", "install_scripts": "setuptools.command.install_scripts:install_scripts", "register": "setuptools.command.register:register", "rotate": "setuptools.command.rotate:rotate", "saveopts": "setuptools.command.saveopts:saveopts", "sdist": "setuptools.command.sdist:sdist", "setopt": "setuptools.command.setopt:setopt", "test": "setuptools.command.test:test", "upload": "setuptools.command.upload:upload", "upload_docs": "setuptools.command.upload_docs:upload_docs"}, "distutils.setup_keywords": {"convert_2to3_doctests": "setuptools.dist:assert_string_list", "dependency_links": "setuptools.dist:assert_string_list", "eager_resources": "setuptools.dist:assert_string_list", "entry_points": "setuptools.dist:check_entry_points", "exclude_package_data": "setuptools.dist:check_package_data", "extras_require": "setuptools.dist:check_extras", "include_package_data": "setuptools.dist:assert_bool", "install_requires": "setuptools.dist:check_requirements", "namespace_packages": "setuptools.dist:check_nsp", "package_data": "setuptools.dist:check_package_data", "packages": "setuptools.dist:check_packages", "python_requires": "setuptools.dist:check_specifier", "setup_requires": "setuptools.dist:check_requirements", "test_loader": "setuptools.dist:check_importable", "test_runner": "setuptools.dist:check_importable", "test_suite": "setuptools.dist:check_test_suite", "tests_require": "setuptools.dist:check_requirements", "use_2to3": "setuptools.dist:assert_bool", "use_2to3_exclude_fixers": "setuptools.dist:assert_string_list", "use_2to3_fixers": "setuptools.dist:assert_string_list", "zip_safe": "setuptools.dist:assert_bool"}, "egg_info.writers": {"PKG-INFO": "setuptools.command.egg_info:write_pkg_info", "dependency_links.txt": "setuptools.command.egg_info:overwrite_arg", "depends.txt": "setuptools.command.egg_info:warn_depends_obsolete", "eager_resources.txt": "setuptools.command.egg_info:overwrite_arg", "entry_points.txt": "setuptools.command.egg_info:write_entries", "namespace_packages.txt": "setuptools.command.egg_info:overwrite_arg", "requires.txt": "setuptools.command.egg_info:write_requirements", "top_level.txt": "setuptools.command.egg_info:write_toplevel_names"}, "setuptools.installation": {"eggsecutable": "setuptools.command.easy_install:bootstrap"}}}, "extras": ["certs", "ssl"], "generator": "bdist_wheel (0.30.0)", "keywords": ["CPAN", "PyPI", "distutils", "eggs", "package", "management"], "metadata_version": "2.0", "name": "setuptools", "project_url": "Documentation, https://setuptools.readthedocs.io/", "requires_python": ">=2.7,!=3.0.*,!=3.1.*,!=3.2.*", "run_requires": [{"extra": "certs", "requires": ["certifi (==2016.9.26)"]}, {"environment": "sys_platform=='win32'", "extra": "ssl", "requires": ["wincertstore (==0.2)"]}], "summary": "Easily download, build, install, upgrade, and uninstall Python packages", "version": "39.2.0"} setuptools-39.2.0.dist-info/WHEEL 0000644 00000000156 14751155147 0012212 0 ustar 00 Wheel-Version: 1.0
Generator: bdist_wheel (0.30.0)
Root-Is-Purelib: true
Tag: py2-none-any
Tag: py3-none-any
setuptools-39.2.0.dist-info/RECORD 0000644 00000032375 14751155147 0012334 0 ustar 00 easy_install.py,sha256=MDC9vt5AxDsXX5qcKlBz2TnW6Tpuv_AobnfhCJ9X3PM,126
pkg_resources/__init__.py,sha256=D6DGFHIzVnG-ByUliqZuw3dkB3ccE6z5jdhDJFap12Y,103822
pkg_resources/py31compat.py,sha256=-ysVqoxLetAnL94uM0kHkomKQTC1JZLN2ZUjqUhMeKE,600
pkg_resources/_vendor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
pkg_resources/_vendor/appdirs.py,sha256=tgGaL0m4Jo2VeuGfoOOifLv7a7oUEJu2n1vRkqoPw-0,22374
pkg_resources/_vendor/pyparsing.py,sha256=PifeLY3-WhIcBVzLtv0U4T_pwDtPruBhBCkg5vLqa28,229867
pkg_resources/_vendor/six.py,sha256=A6hdJZVjI3t_geebZ9BzUvwRrIXo0lfwzQlM2LcKyas,30098
pkg_resources/_vendor/packaging/__about__.py,sha256=zkcCPTN_6TcLW0Nrlg0176-R1QQ_WVPTm8sz1R4-HjM,720
pkg_resources/_vendor/packaging/__init__.py,sha256=_vNac5TrzwsrzbOFIbF-5cHqc_Y2aPT2D7zrIR06BOo,513
pkg_resources/_vendor/packaging/_compat.py,sha256=Vi_A0rAQeHbU-a9X0tt1yQm9RqkgQbDSxzRw8WlU9kA,860
pkg_resources/_vendor/packaging/_structures.py,sha256=RImECJ4c_wTlaTYYwZYLHEiebDMaAJmK1oPARhw1T5o,1416
pkg_resources/_vendor/packaging/markers.py,sha256=uEcBBtGvzqltgnArqb9c4RrcInXezDLos14zbBHhWJo,8248
pkg_resources/_vendor/packaging/requirements.py,sha256=SikL2UynbsT0qtY9ltqngndha_sfo0w6XGFhAhoSoaQ,4355
pkg_resources/_vendor/packaging/specifiers.py,sha256=SAMRerzO3fK2IkFZCaZkuwZaL_EGqHNOz4pni4vhnN0,28025
pkg_resources/_vendor/packaging/utils.py,sha256=3m6WvPm6NNxE8rkTGmn0r75B_GZSGg7ikafxHsBN1WA,421
pkg_resources/_vendor/packaging/version.py,sha256=OwGnxYfr2ghNzYx59qWIBkrK3SnB6n-Zfd1XaLpnnM0,11556
pkg_resources/extern/__init__.py,sha256=JUtlHHvlxHSNuB4pWqNjcx7n6kG-fwXg7qmJ2zNJlIY,2487
setuptools/__init__.py,sha256=WWIdCbFJnZ9fZoaWDN_x1vDA_Rkm-Sc15iKvPtIYKFs,5700
setuptools/archive_util.py,sha256=kw8Ib_lKjCcnPKNbS7h8HztRVK0d5RacU3r_KRdVnmM,6592
setuptools/build_meta.py,sha256=FllaKTr1vSJyiUeRjVJEZmeEaRzhYueNlimtcwaJba8,5671
setuptools/config.py,sha256=3L9wwF1_uprsyHsUHXXsyLmJUA5HIczJYQ2BFzLWjc0,18006
setuptools/dep_util.py,sha256=fgixvC1R7sH3r13ktyf7N0FALoqEXL1cBarmNpSEoWg,935
setuptools/depends.py,sha256=hC8QIDcM3VDpRXvRVA6OfL9AaQfxvhxHcN_w6sAyNq8,5837
setuptools/dist.py,sha256=1j3kuNEGaaAzWz0iLWItxziNyJTZC8MgcTfMZ4U4Wes,42613
setuptools/extension.py,sha256=uc6nHI-MxwmNCNPbUiBnybSyqhpJqjbhvOQ-emdvt_E,1729
setuptools/glibc.py,sha256=X64VvGPL2AbURKwYRsWJOXXGAYOiF_v2qixeTkAULuU,3146
setuptools/glob.py,sha256=Y-fpv8wdHZzv9DPCaGACpMSBWJ6amq_1e0R_i8_el4w,5207
setuptools/launch.py,sha256=sd7ejwhBocCDx_wG9rIs0OaZ8HtmmFU8ZC6IR_S0Lvg,787
setuptools/lib2to3_ex.py,sha256=t5e12hbR2pi9V4ezWDTB4JM-AISUnGOkmcnYHek3xjg,2013
setuptools/monkey.py,sha256=H_yJ91EtDWu20v5JsEmFeDckiYVMhpE3nMcEdxxd-Ig,5261
setuptools/msvc.py,sha256=8EiV9ypb3EQJQssPcH1HZbdNsbRvqsFnJ7wPFEGwFIo,40877
setuptools/namespaces.py,sha256=F0Nrbv8KCT2OrO7rwa03om4N4GZKAlnce-rr-cgDQa8,3199
setuptools/package_index.py,sha256=6v4e6K62WmAhYAgLOBw1wbMDsnxAW8OIbAKcRVsWB9k,40133
setuptools/pep425tags.py,sha256=I7lxWpy9XKELBJ0CVYiT7OPW0hkBFe0kNpbEBwXV_XQ,10873
setuptools/py27compat.py,sha256=3mwxRMDk5Q5O1rSXOERbQDXhFqwDJhhUitfMW_qpUCo,536
setuptools/py31compat.py,sha256=XuU1HCsGE_3zGvBRIhYw2iB-IhCFK4-Pxw_jMiqdNVk,1192
setuptools/py33compat.py,sha256=NKS84nl4LjLIoad6OQfgmygZn4mMvrok_b1N1tzebew,1182
setuptools/py36compat.py,sha256=VUDWxmu5rt4QHlGTRtAFu6W5jvfL6WBjeDAzeoBy0OM,2891
setuptools/sandbox.py,sha256=9UbwfEL5QY436oMI1LtFWohhoZ-UzwHvGyZjUH_qhkw,14276
setuptools/script (dev).tmpl,sha256=f7MR17dTkzaqkCMSVseyOCMVrPVSMdmTQsaB8cZzfuI,201
setuptools/script.tmpl,sha256=WGTt5piezO27c-Dbx6l5Q4T3Ff20A5z7872hv3aAhYY,138
setuptools/site-patch.py,sha256=BVt6yIrDMXJoflA5J6DJIcsJUfW_XEeVhOzelTTFDP4,2307
setuptools/ssl_support.py,sha256=YBDJsCZjSp62CWjxmSkke9kn9rhHHj25Cus6zhJRW3c,8492
setuptools/unicode_utils.py,sha256=NOiZ_5hD72A6w-4wVj8awHFM3n51Kmw1Ic_vx15XFqw,996
setuptools/version.py,sha256=og_cuZQb0QI6ukKZFfZWPlr1HgJBPPn2vO2m_bI9ZTE,144
setuptools/wheel.py,sha256=2V7-XGD0jRFvEOo3btpl1I7kUwaZIUFmqnAVYeoMwPs,7778
setuptools/windows_support.py,sha256=5GrfqSP2-dLGJoZTq2g6dCKkyQxxa2n5IQiXlJCoYEE,714
setuptools/_vendor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
setuptools/_vendor/pyparsing.py,sha256=PifeLY3-WhIcBVzLtv0U4T_pwDtPruBhBCkg5vLqa28,229867
setuptools/_vendor/six.py,sha256=A6hdJZVjI3t_geebZ9BzUvwRrIXo0lfwzQlM2LcKyas,30098
setuptools/_vendor/packaging/__about__.py,sha256=zkcCPTN_6TcLW0Nrlg0176-R1QQ_WVPTm8sz1R4-HjM,720
setuptools/_vendor/packaging/__init__.py,sha256=_vNac5TrzwsrzbOFIbF-5cHqc_Y2aPT2D7zrIR06BOo,513
setuptools/_vendor/packaging/_compat.py,sha256=Vi_A0rAQeHbU-a9X0tt1yQm9RqkgQbDSxzRw8WlU9kA,860
setuptools/_vendor/packaging/_structures.py,sha256=RImECJ4c_wTlaTYYwZYLHEiebDMaAJmK1oPARhw1T5o,1416
setuptools/_vendor/packaging/markers.py,sha256=Gvpk9EY20yKaMTiKgQZ8yFEEpodqVgVYtfekoic1Yts,8239
setuptools/_vendor/packaging/requirements.py,sha256=t44M2HVWtr8phIz2OhnILzuGT3rTATaovctV1dpnVIg,4343
setuptools/_vendor/packaging/specifiers.py,sha256=SAMRerzO3fK2IkFZCaZkuwZaL_EGqHNOz4pni4vhnN0,28025
setuptools/_vendor/packaging/utils.py,sha256=3m6WvPm6NNxE8rkTGmn0r75B_GZSGg7ikafxHsBN1WA,421
setuptools/_vendor/packaging/version.py,sha256=OwGnxYfr2ghNzYx59qWIBkrK3SnB6n-Zfd1XaLpnnM0,11556
setuptools/command/__init__.py,sha256=NWzJ0A1BEengZpVeqUyWLNm2bk4P3F4iL5QUErHy7kA,594
setuptools/command/alias.py,sha256=KjpE0sz_SDIHv3fpZcIQK-sCkJz-SrC6Gmug6b9Nkc8,2426
setuptools/command/bdist_egg.py,sha256=RQ9h8BmSVpXKJQST3i_b_sm093Z-aCXbfMBEM2IrI-Q,18185
setuptools/command/bdist_rpm.py,sha256=B7l0TnzCGb-0nLlm6rS00jWLkojASwVmdhW2w5Qz_Ak,1508
setuptools/command/bdist_wininst.py,sha256=_6dz3lpB1tY200LxKPLM7qgwTCceOMgaWFF-jW2-pm0,637
setuptools/command/build_clib.py,sha256=bQ9aBr-5ZSO-9fGsGsDLz0mnnFteHUZnftVLkhvHDq0,4484
setuptools/command/build_ext.py,sha256=PCRAZ2xYnqyEof7EFNtpKYl0sZzT0qdKUNTH3sUdPqk,13173
setuptools/command/build_py.py,sha256=yWyYaaS9F3o9JbIczn064A5g1C5_UiKRDxGaTqYbtLE,9596
setuptools/command/develop.py,sha256=wKbOw2_qUvcDti2lZmtxbDmYb54yAAibExzXIvToz-A,8046
setuptools/command/dist_info.py,sha256=5t6kOfrdgALT-P3ogss6PF9k-Leyesueycuk3dUyZnI,960
setuptools/command/easy_install.py,sha256=y1tcBQpk5YkR4ASnmoIcVfP4FjLxPq_IYM9xfUBHnXQ,87204
setuptools/command/egg_info.py,sha256=3b5Y3t_bl_zZRCkmlGi3igvRze9oOaxd-dVf2w1FBOc,24800
setuptools/command/install.py,sha256=a0EZpL_A866KEdhicTGbuyD_TYl1sykfzdrri-zazT4,4683
setuptools/command/install_egg_info.py,sha256=bMgeIeRiXzQ4DAGPV1328kcjwQjHjOWU4FngAWLV78Q,2203
setuptools/command/install_lib.py,sha256=11mxf0Ch12NsuYwS8PHwXBRvyh671QAM4cTRh7epzG0,3840
setuptools/command/install_scripts.py,sha256=UD0rEZ6861mTYhIdzcsqKnUl8PozocXWl9VBQ1VTWnc,2439
setuptools/command/launcher manifest.xml,sha256=xlLbjWrB01tKC0-hlVkOKkiSPbzMml2eOPtJ_ucCnbE,628
setuptools/command/py36compat.py,sha256=SzjZcOxF7zdFUT47Zv2n7AM3H8koDys_0OpS-n9gIfc,4986
setuptools/command/register.py,sha256=bHlMm1qmBbSdahTOT8w6UhA-EgeQIz7p6cD-qOauaiI,270
setuptools/command/rotate.py,sha256=co5C1EkI7P0GGT6Tqz-T2SIj2LBJTZXYELpmao6d4KQ,2164
setuptools/command/saveopts.py,sha256=za7QCBcQimKKriWcoCcbhxPjUz30gSB74zuTL47xpP4,658
setuptools/command/sdist.py,sha256=obDTe2BmWt2PlnFPZZh7e0LWvemEsbCCO9MzhrTZjm8,6711
setuptools/command/setopt.py,sha256=NTWDyx-gjDF-txf4dO577s7LOzHVoKR0Mq33rFxaRr8,5085
setuptools/command/test.py,sha256=MeBAcXUePGjPKqjz4zvTrHatLvNsjlPFcagt3XnFYdk,9214
setuptools/command/upload.py,sha256=i1gfItZ3nQOn5FKXb8tLC2Kd7eKC8lWO4bdE6NqGpE4,1172
setuptools/command/upload_docs.py,sha256=oXiGplM_cUKLwE4CWWw98RzCufAu8tBhMC97GegFcms,7311
setuptools/extern/__init__.py,sha256=2eKMsBMwsZqolIcYBtLZU3t96s6xSTP4PTaNfM5P-I0,2499
setuptools-39.2.0.dist-info/DESCRIPTION.rst,sha256=mOsk4uH4ma3S7RjGk8m4kEMQssSAZxI8Dj1Z8EZHkxA,1547
setuptools-39.2.0.dist-info/LICENSE.txt,sha256=wyo6w5WvYyHv0ovnPQagDw22q4h9HCHU_sRhKNIFbVo,1078
setuptools-39.2.0.dist-info/METADATA,sha256=gHeHu4S3oYwMrgCuSC88ChBAIaZOkzUWzKpg9Xomdro,3028
setuptools-39.2.0.dist-info/RECORD,,
setuptools-39.2.0.dist-info/WHEEL,sha256=kdsN-5OJAZIiHN-iO4Rhl82KyS0bDWf4uBwMbkNafr8,110
setuptools-39.2.0.dist-info/dependency_links.txt,sha256=HlkCFkoK5TbZ5EMLbLKYhLcY_E31kBWD8TqW2EgmatQ,239
setuptools-39.2.0.dist-info/entry_points.txt,sha256=jBqCYDlVjl__sjYFGXo1JQGIMAYFJE-prYWUtnMZEew,2990
setuptools-39.2.0.dist-info/metadata.json,sha256=20034ySWEQzNtb_Cyg6EYzoZfpYjyHsKleWelH--ROo,4969
setuptools-39.2.0.dist-info/top_level.txt,sha256=2HUXVVwA4Pff1xgTFr3GsTXXKaPaO6vlG6oNJ_4u4Tg,38
setuptools-39.2.0.dist-info/zip-safe,sha256=AbpHGcgLb-kRsJGnwFEktk7uzpZOCcBY74-YBdrKVGs,1
../../../bin/easy_install,sha256=Gezk0fVCHeU4cjSAPY5QeEYRqYmWoPAKE8Edpwhp15U,246
../../../bin/easy_install-3.6,sha256=Gezk0fVCHeU4cjSAPY5QeEYRqYmWoPAKE8Edpwhp15U,246
setuptools-39.2.0.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
pkg_resources/extern/__pycache__/__init__.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/markers.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/_structures.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/__init__.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/__about__.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/utils.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/version.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/requirements.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/_compat.cpython-36.pyc,,
pkg_resources/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc,,
pkg_resources/_vendor/__pycache__/__init__.cpython-36.pyc,,
pkg_resources/_vendor/__pycache__/pyparsing.cpython-36.pyc,,
pkg_resources/_vendor/__pycache__/appdirs.cpython-36.pyc,,
pkg_resources/_vendor/__pycache__/six.cpython-36.pyc,,
pkg_resources/__pycache__/__init__.cpython-36.pyc,,
pkg_resources/__pycache__/py31compat.cpython-36.pyc,,
__pycache__/easy_install.cpython-36.pyc,,
setuptools/extern/__pycache__/__init__.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/markers.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/_structures.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/__init__.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/__about__.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/utils.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/version.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/requirements.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/_compat.cpython-36.pyc,,
setuptools/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc,,
setuptools/_vendor/__pycache__/__init__.cpython-36.pyc,,
setuptools/_vendor/__pycache__/pyparsing.cpython-36.pyc,,
setuptools/_vendor/__pycache__/six.cpython-36.pyc,,
setuptools/__pycache__/pep425tags.cpython-36.pyc,,
setuptools/__pycache__/dep_util.cpython-36.pyc,,
setuptools/__pycache__/py27compat.cpython-36.pyc,,
setuptools/__pycache__/build_meta.cpython-36.pyc,,
setuptools/__pycache__/monkey.cpython-36.pyc,,
setuptools/__pycache__/__init__.cpython-36.pyc,,
setuptools/__pycache__/extension.cpython-36.pyc,,
setuptools/__pycache__/package_index.cpython-36.pyc,,
setuptools/__pycache__/glibc.cpython-36.pyc,,
setuptools/__pycache__/depends.cpython-36.pyc,,
setuptools/__pycache__/lib2to3_ex.cpython-36.pyc,,
setuptools/__pycache__/namespaces.cpython-36.pyc,,
setuptools/__pycache__/dist.cpython-36.pyc,,
setuptools/__pycache__/unicode_utils.cpython-36.pyc,,
setuptools/__pycache__/py33compat.cpython-36.pyc,,
setuptools/__pycache__/msvc.cpython-36.pyc,,
setuptools/__pycache__/windows_support.cpython-36.pyc,,
setuptools/__pycache__/site-patch.cpython-36.pyc,,
setuptools/__pycache__/glob.cpython-36.pyc,,
setuptools/__pycache__/sandbox.cpython-36.pyc,,
setuptools/__pycache__/version.cpython-36.pyc,,
setuptools/__pycache__/py31compat.cpython-36.pyc,,
setuptools/__pycache__/archive_util.cpython-36.pyc,,
setuptools/__pycache__/ssl_support.cpython-36.pyc,,
setuptools/__pycache__/config.cpython-36.pyc,,
setuptools/__pycache__/wheel.cpython-36.pyc,,
setuptools/__pycache__/launch.cpython-36.pyc,,
setuptools/__pycache__/py36compat.cpython-36.pyc,,
setuptools/command/__pycache__/install_lib.cpython-36.pyc,,
setuptools/command/__pycache__/saveopts.cpython-36.pyc,,
setuptools/command/__pycache__/install_scripts.cpython-36.pyc,,
setuptools/command/__pycache__/setopt.cpython-36.pyc,,
setuptools/command/__pycache__/install.cpython-36.pyc,,
setuptools/command/__pycache__/bdist_wininst.cpython-36.pyc,,
setuptools/command/__pycache__/install_egg_info.cpython-36.pyc,,
setuptools/command/__pycache__/__init__.cpython-36.pyc,,
setuptools/command/__pycache__/build_py.cpython-36.pyc,,
setuptools/command/__pycache__/bdist_egg.cpython-36.pyc,,
setuptools/command/__pycache__/upload_docs.cpython-36.pyc,,
setuptools/command/__pycache__/bdist_rpm.cpython-36.pyc,,
setuptools/command/__pycache__/dist_info.cpython-36.pyc,,
setuptools/command/__pycache__/build_ext.cpython-36.pyc,,
setuptools/command/__pycache__/upload.cpython-36.pyc,,
setuptools/command/__pycache__/easy_install.cpython-36.pyc,,
setuptools/command/__pycache__/build_clib.cpython-36.pyc,,
setuptools/command/__pycache__/test.cpython-36.pyc,,
setuptools/command/__pycache__/rotate.cpython-36.pyc,,
setuptools/command/__pycache__/sdist.cpython-36.pyc,,
setuptools/command/__pycache__/alias.cpython-36.pyc,,
setuptools/command/__pycache__/register.cpython-36.pyc,,
setuptools/command/__pycache__/develop.cpython-36.pyc,,
setuptools/command/__pycache__/egg_info.cpython-36.pyc,,
setuptools/command/__pycache__/py36compat.cpython-36.pyc,,
procfs/__init__.py 0000755 00000000620 14751155147 0010164 0 ustar 00 #! /usr/bin/python3
# -*- python -*-
# -*- coding: utf-8 -*-
# SPDX-License-Identifier: GPL-2.0-only
#
# Copyright (C) 2008, 2009 Red Hat, Inc.
#
"""
Copyright (c) 2008, 2009 Red Hat Inc.
Abstractions to extract information from the Linux kernel /proc files.
"""
__author__ = "Arnaldo Carvalho de Melo <acme@redhat.com>"
__license__ = "GPLv2 License"
from .procfs import *
from .utilist import *
procfs/utilist.py 0000755 00000001567 14751155147 0010135 0 ustar 00 #! /usr/bin/python3
# -*- python -*-
# -*- coding: utf-8 -*-
# SPDX-License-Identifier: GPL-2.0-only
#
# Copyright (C) 2007 Red Hat, Inc.
#
from six.moves import range
def hexbitmask(l, nr_entries):
hexbitmask = []
bit = 0
mask = 0
for entry in range(nr_entries):
if entry in l:
mask |= (1 << bit)
bit += 1
if bit == 32:
bit = 0
hexbitmask.insert(0, mask)
mask = 0
if bit < 32 and mask != 0:
hexbitmask.insert(0, mask)
return hexbitmask
def bitmasklist(line, nr_entries):
hexmask = line.strip().replace(",", "")
bitmasklist = []
entry = 0
bitmask = bin(int(hexmask, 16))[2::]
for i in reversed(bitmask):
if int(i) & 1:
bitmasklist.append(entry)
entry += 1
if entry == nr_entries:
break
return bitmasklist
procfs/procfs.py 0000755 00000106712 14751155147 0007732 0 ustar 00 #!/usr/bin/python3
# -*- python -*-
# -*- coding: utf-8 -*-
# SPDX-License-Identifier: GPL-2.0-only
#
# Copyright (C) 2007-2015 Red Hat, Inc.
#
import os
import platform
import re
import time
from functools import reduce
from six.moves import range
from procfs.utilist import bitmasklist
VERSION = "0.7.3"
def is_s390():
""" Return True if running on s390 or s390x """
machine = platform.machine()
return bool(re.search('s390', machine))
def process_cmdline(pid_info):
"""
Returns the process command line, if available in the given `process' class,
if not available, falls back to using the comm (short process name) in its
pidstat key.
"""
if pid_info["cmdline"]:
return reduce(lambda a, b: a + " %s" % b, pid_info["cmdline"]).strip()
try:
""" If a pid disappears before we query it, return None """
return pid_info["stat"]["comm"]
except:
return None
class pidstat:
"""
Provides a dictionary to access the fields in the
per process /proc/PID/stat files.
One can obtain the available fields by asking for the keys of the
dictionary, e.g.:
>>> p = procfs.pidstat(1)
>>> print p.keys()
['majflt', 'rss', 'cnswap', 'cstime', 'pid', 'session', 'startstack', 'startcode', 'cmajflt', 'blocked', 'exit_signal', 'minflt', 'nswap', 'environ', 'priority', 'state', 'delayacct_blkio_ticks', 'policy', 'rt_priority', 'ppid', 'nice', 'cutime', 'endcode', 'wchan', 'num_threads', 'sigcatch', 'comm', 'stime', 'sigignore', 'tty_nr', 'kstkeip', 'utime', 'tpgid', 'itrealvalue', 'kstkesp', 'rlim', 'signal', 'pgrp', 'flags', 'starttime', 'cminflt', 'vsize', 'processor']
And then access the various process properties using it as a dictionary:
>>> print p['comm']
systemd
>>> print p['priority']
20
>>> print p['state']
S
Please refer to the 'procfs(5)' man page, by using:
$ man 5 procfs
To see information for each of the above fields, it is part of the
'man-pages' RPM package.
"""
# Entries with the same value, the one with a comment after it is the
# more recent, having replaced the other name in v4.1-rc kernel times.
PF_ALIGNWARN = 0x00000001
PF_STARTING = 0x00000002
PF_EXITING = 0x00000004
PF_EXITPIDONE = 0x00000008
PF_VCPU = 0x00000010
PF_WQ_WORKER = 0x00000020 # /* I'm a workqueue worker */
PF_FORKNOEXEC = 0x00000040
PF_MCE_PROCESS = 0x00000080 # /* process policy on mce errors */
PF_SUPERPRIV = 0x00000100
PF_DUMPCORE = 0x00000200
PF_SIGNALED = 0x00000400
PF_MEMALLOC = 0x00000800
# /* set_user noticed that RLIMIT_NPROC was exceeded */
PF_NPROC_EXCEEDED = 0x00001000
PF_FLUSHER = 0x00001000
PF_USED_MATH = 0x00002000
PF_USED_ASYNC = 0x00004000 # /* used async_schedule*(), used by module init */
PF_NOFREEZE = 0x00008000
PF_FROZEN = 0x00010000
PF_FSTRANS = 0x00020000
PF_KSWAPD = 0x00040000
PF_MEMALLOC_NOIO = 0x00080000 # /* Allocating memory without IO involved */
PF_SWAPOFF = 0x00080000
PF_LESS_THROTTLE = 0x00100000
PF_KTHREAD = 0x00200000
PF_RANDOMIZE = 0x00400000
PF_SWAPWRITE = 0x00800000
PF_SPREAD_PAGE = 0x01000000
PF_SPREAD_SLAB = 0x02000000
PF_THREAD_BOUND = 0x04000000
# /* Userland is not allowed to meddle with cpus_allowed */
PF_NO_SETAFFINITY = 0x04000000
PF_MCE_EARLY = 0x08000000 # /* Early kill for mce process policy */
PF_MEMPOLICY = 0x10000000
PF_MUTEX_TESTER = 0x20000000
PF_FREEZER_SKIP = 0x40000000
PF_FREEZER_NOSIG = 0x80000000
# /* this thread called freeze_processes and should not be frozen */
PF_SUSPEND_TASK = 0x80000000
proc_stat_fields = ["pid", "comm", "state", "ppid", "pgrp", "session",
"tty_nr", "tpgid", "flags", "minflt", "cminflt",
"majflt", "cmajflt", "utime", "stime", "cutime",
"cstime", "priority", "nice", "num_threads",
"itrealvalue", "starttime", "vsize", "rss",
"rlim", "startcode", "endcode", "startstack",
"kstkesp", "kstkeip", "signal", "blocked",
"sigignore", "sigcatch", "wchan", "nswap",
"cnswap", "exit_signal", "processor",
"rt_priority", "policy",
"delayacct_blkio_ticks", "environ"]
def __init__(self, pid, basedir="/proc"):
self.pid = pid
try:
self.load(basedir)
except FileNotFoundError:
# The file representing the pid has disappeared
# propagate the error to the user to handle
raise
def __getitem__(self, fieldname):
return self.fields[fieldname]
def keys(self):
return list(self.fields.keys())
def values(self):
return list(self.fields.values())
def has_key(self, fieldname):
return fieldname in self.fields
def items(self):
return self.fields
def __contains__(self, fieldname):
return fieldname in self.fields
def load(self, basedir="/proc"):
try:
f = open(f"{basedir}/{self.pid}/stat")
except FileNotFoundError:
# The pid has disappeared, propagate the error
raise
fields = f.readline().strip().split(') ')
f.close()
fields = fields[0].split(' (') + fields[1].split()
self.fields = {}
nr_fields = min(len(fields), len(self.proc_stat_fields))
for i in range(nr_fields):
attrname = self.proc_stat_fields[i]
value = fields[i]
if attrname == "comm":
self.fields["comm"] = value.strip('()')
else:
try:
self.fields[attrname] = int(value)
except:
self.fields[attrname] = value
def is_bound_to_cpu(self):
"""
Returns true if this process has a fixed smp affinity mask,
not allowing it to be moved to a different set of CPUs.
"""
return bool(self.fields["flags"] & self.PF_THREAD_BOUND)
def process_flags(self):
"""
Returns a list with all the process flags known, details depend
on kernel version, declared in the file include/linux/sched.h in
the kernel sources.
As of v4.2-rc7 these include (from include/linux/sched.h comments):
PF_EXITING Getting shut down
PF_EXITPIDONE Pi exit done on shut down
PF_VCPU I'm a virtual CPU
PF_WQ_WORKER I'm a workqueue worker
PF_FORKNOEXEC Forked but didn't exec
PF_MCE_PROCESS Process policy on mce errors
PF_SUPERPRIV Used super-user privileges
PF_DUMPCORE Dumped core
PF_SIGNALED Killed by a signal
PF_MEMALLOC Allocating memory
PF_NPROC_EXCEEDED Set_user noticed that RLIMIT_NPROC was exceeded
PF_USED_MATH If unset the fpu must be initialized before use
PF_USED_ASYNC Used async_schedule*(), used by module init
PF_NOFREEZE This thread should not be frozen
PF_FROZEN Frozen for system suspend
PF_FSTRANS Inside a filesystem transaction
PF_KSWAPD I am kswapd
PF_MEMALLOC_NOIO Allocating memory without IO involved
PF_LESS_THROTTLE Throttle me less: I clean memory
PF_KTHREAD I am a kernel thread
PF_RANDOMIZE Randomize virtual address space
PF_SWAPWRITE Allowed to write to swap
PF_NO_SETAFFINITY Userland is not allowed to meddle with cpus_allowed
PF_MCE_EARLY Early kill for mce process policy
PF_MUTEX_TESTER Thread belongs to the rt mutex tester
PF_FREEZER_SKIP Freezer should not count it as freezable
PF_SUSPEND_TASK This thread called freeze_processes and
should not be frozen
"""
sflags = []
for attr in dir(self):
if attr[:3] != "PF_":
continue
value = getattr(self, attr)
if value & self.fields["flags"]:
sflags.append(attr)
return sflags
def cannot_set_affinity(self, pid):
PF_NO_SETAFFINITY = 0x04000000
try:
return bool(int(self.processes[pid]["stat"]["flags"]) &
PF_NO_SETAFFINITY)
except:
return True
def cannot_set_thread_affinity(self, pid, tid):
PF_NO_SETAFFINITY = 0x04000000
try:
return bool(int(self.processes[pid].threads[tid]["stat"]["flags"]) &
PF_NO_SETAFFINITY)
except:
return True
class pidstatus:
"""
Provides a dictionary to access the fields
in the per process /proc/PID/status files.
This provides additional information about processes and threads to
what can be obtained with the procfs.pidstat() class.
One can obtain the available fields by asking for the keys of the
dictionary, e.g.:
>>> import procfs
>>> p = procfs.pidstatus(1)
>>> print p.keys()
['VmExe', 'CapBnd', 'NSpgid', 'Tgid', 'NSpid', 'VmSize', 'VmPMD', 'ShdPnd', 'State', 'Gid', 'nonvoluntary_ctxt_switches', 'SigIgn', 'VmStk', 'VmData', 'SigCgt', 'CapEff', 'VmPTE', 'Groups', 'NStgid', 'Threads', 'PPid', 'VmHWM', 'NSsid', 'VmSwap', 'Name', 'SigBlk', 'Mems_allowed_list', 'VmPeak', 'Ngid', 'VmLck', 'SigQ', 'VmPin', 'Mems_allowed', 'CapPrm', 'Seccomp', 'VmLib', 'Cpus_allowed', 'Uid', 'SigPnd', 'Pid', 'Cpus_allowed_list', 'TracerPid', 'CapInh', 'voluntary_ctxt_switches', 'VmRSS', 'FDSize']
>>> print p["Pid"]
1
>>> print p["Threads"]
1
>>> print p["VmExe"]
1248 kB
>>> print p["Cpus_allowed"]
f
>>> print p["SigQ"]
0/30698
>>> print p["VmPeak"]
320300 kB
>>>
Please refer to the 'procfs(5)' man page, by using:
$ man 5 procfs
To see information for each of the above fields, it is part of the
'man-pages' RPM package.
In the man page there will be references to further documentation, like
referring to the "getrlimit(2)" man page when explaining the "SigQ"
line/field.
"""
def __init__(self, pid, basedir="/proc"):
self.pid = pid
self.load(basedir)
def __getitem__(self, fieldname):
return self.fields[fieldname]
def keys(self):
return list(self.fields.keys())
def values(self):
return list(self.fields.values())
def has_key(self, fieldname):
return fieldname in self.fields
def items(self):
return self.fields
def __contains__(self, fieldname):
return fieldname in self.fields
def load(self, basedir="/proc"):
self.fields = {}
with open(f"{basedir}/{self.pid}/status") as f:
for line in f.readlines():
fields = line.split(":")
if len(fields) != 2:
continue
name = fields[0]
value = fields[1].strip()
try:
self.fields[name] = int(value)
except:
self.fields[name] = value
class process:
"""
Information about a process with a given pid, provides a dictionary with
two entries, instances of different wrappers for /proc/ process related
meta files: "stat" and "status", see the documentation for procfs.pidstat
and procfs.pidstatus for further info about those classes.
"""
def __init__(self, pid, basedir="/proc"):
self.pid = pid
self.basedir = basedir
def __getitem__(self, attr):
if not hasattr(self, attr):
if attr in ("stat", "status"):
if attr == "stat":
sclass = pidstat
else:
sclass = pidstatus
try:
setattr(self, attr, sclass(self.pid, self.basedir))
except FileNotFoundError:
# The pid has disappeared, progate the error
raise
elif attr == "cmdline":
self.load_cmdline()
elif attr == "threads":
self.load_threads()
elif attr == "cgroups":
self.load_cgroups()
elif attr == "environ":
self.load_environ()
return getattr(self, attr)
def has_key(self, attr):
return hasattr(self, attr)
def __contains__(self, attr):
return hasattr(self, attr)
def load_cmdline(self):
try:
with open(f"/proc/{self.pid}/cmdline") as f:
self.cmdline = f.readline().strip().split('\0')[:-1]
except FileNotFoundError:
""" This can happen when a pid disappears """
self.cmdline = None
except UnicodeDecodeError:
""" TODO - this shouldn't happen, needs to be investigated """
self.cmdline = None
def load_threads(self):
self.threads = pidstats(f"/proc/{self.pid}/task/")
# remove thread leader
del self.threads[self.pid]
def load_cgroups(self):
self.cgroups = ""
with open(f"/proc/{self.pid}/cgroup") as f:
for line in reversed(f.readlines()):
if len(self.cgroups) != 0:
self.cgroups = self.cgroups + "," + line[:-1]
else:
self.cgroups = line[:-1]
def load_environ(self):
"""
Loads the environment variables for this process. The entries then
become available via the 'environ' member, or via the 'environ'
dict key when accessing as p["environ"].
E.g.:
>>> all_processes = procfs.pidstats()
>>> firefox_pid = all_processes.find_by_name("firefox")
>>> firefox_process = all_processes[firefox_pid[0]]
>>> print firefox_process["environ"]["PWD"]
/home/acme
>>> print len(firefox_process.environ.keys())
66
>>> print firefox_process["environ"]["SHELL"]
/bin/bash
>>> print firefox_process["environ"]["USERNAME"]
acme
>>> print firefox_process["environ"]["HOME"]
/home/acme
>>> print firefox_process["environ"]["MAIL"]
/var/spool/mail/acme
>>>
"""
self.environ = {}
with open(f"/proc/{self.pid}/environ") as f:
for x in f.readline().split('\0'):
if len(x) > 0:
y = x.split('=')
self.environ[y[0]] = y[1]
class pidstats:
"""
Provides access to all the processes in the system, to get a picture of
how many processes there are at any given moment.
The entries can be accessed as a dictionary, keyed by pid. Also there are
methods to find processes that match a given COMM or regular expression.
"""
def __init__(self, basedir="/proc"):
self.basedir = basedir
self.processes = {}
self.reload()
def __getitem__(self, key):
return self.processes[key]
def __delitem__(self, key):
# not clear on why this can fail, but it can
try:
del self.processes[key]
except:
pass
def keys(self):
return list(self.processes.keys())
def values(self):
return list(self.processes.values())
def has_key(self, key):
return key in self.processes
def items(self):
return self.processes
def __contains__(self, key):
return key in self.processes
def reload(self):
"""
This operation will throw away the current dictionary contents,
if any, and read all the pid files from /proc/, instantiating a
'process' instance for each of them.
This is a high overhead operation, and should be avoided if the
perf python binding can be used to detect when new threads appear
and existing ones terminate.
In RHEL it is found in the python-perf rpm package.
More information about the perf facilities can be found in the
'perf_event_open' man page.
"""
del self.processes
self.processes = {}
pids = os.listdir(self.basedir)
for spid in pids:
try:
pid = int(spid)
except:
continue
self.processes[pid] = process(pid, self.basedir)
def reload_threads(self):
to_remove = []
for pid in list(self.processes.keys()):
try:
self.processes[pid].load_threads()
except OSError:
# process vanished, remove it
to_remove.append(pid)
for pid in to_remove:
del self.processes[pid]
def find_by_name(self, name):
name = name[:15]
pids = []
for pid in list(self.processes.keys()):
try:
if name == self.processes[pid]["stat"]["comm"]:
pids.append(pid)
except IOError:
# We're doing lazy loading of /proc files
# So if we get this exception is because the
# process vanished, remove it
del self.processes[pid]
return pids
def find_by_regex(self, regex):
pids = []
for pid in list(self.processes.keys()):
try:
if regex.match(self.processes[pid]["stat"]["comm"]):
pids.append(pid)
except IOError:
# We're doing lazy loading of /proc files
# So if we get this exception is because the
# process vanished, remove it
del self.processes[pid]
return pids
def find_by_cmdline_regex(self, regex):
pids = []
for pid in list(self.processes.keys()):
try:
if regex.match(process_cmdline(self.processes[pid])):
pids.append(pid)
except IOError:
# We're doing lazy loading of /proc files
# So if we get this exception is because the
# process vanished, remove it
del self.processes[pid]
return pids
def get_per_cpu_rtprios(self, basename):
cpu = 0
priorities = ""
processed_pids = []
while True:
name = f"{basename}/{cpu}"
pids = self.find_by_name(name)
if not pids or len([n for n in pids if n not in processed_pids]) == 0:
break
for pid in pids:
try:
priorities += f'{self.processes[pid]["stat"]["rt_priority"]}'
except IOError:
# We're doing lazy loading of /proc files
# So if we get this exception is because the
# process vanished, remove it
del self.processes[pid]
processed_pids += pids
cpu += 1
priorities = priorities.strip(',')
return priorities
def get_rtprios(self, name):
cpu = 0
priorities = ""
processed_pids = []
while True:
pids = self.find_by_name(name)
if not pids or len([n for n in pids if n not in processed_pids]) == 0:
break
for pid in pids:
try:
priorities += f'{self.processes[pid]["stat"]["rt_priority"]}'
except IOError:
# We're doing lazy loading of /proc files
# So if we get this exception is because the
# process vanished, remove it
del self.processes[pid]
processed_pids += pids
cpu += 1
priorities = priorities.strip(',')
return priorities
def is_bound_to_cpu(self, pid):
"""
Checks if a given pid can't have its SMP affinity mask changed.
"""
return self.processes[pid]["stat"].is_bound_to_cpu()
class interrupts:
"""
Information about IRQs in the system. A dictionary keyed by IRQ number
will have as its value another dictionary with "cpu", "type" and "users"
keys, with the SMP affinity mask, type of IRQ and the drivers associated
with each interrupt.
The information comes from the /proc/interrupts file, documented in
'man procfs(5)', for instance, the 'cpu' dict is an array with one entry
per CPU present in the sistem, each value being the number of interrupts
that took place per CPU.
E.g.:
>>> import procfs
>>> interrupts = procfs.interrupts()
>>> thunderbolt_irq = interrupts.find_by_user("thunderbolt")
>>> print thunderbolt_irq
34
>>> thunderbolt = interrupts[thunderbolt_irq]
>>> print thunderbolt
{'affinity': [0, 1, 2, 3], 'type': 'PCI-MSI', 'cpu': [3495, 0, 81, 0], 'users': ['thunderbolt']}
>>>
"""
def __init__(self):
self.interrupts = {}
self.reload()
def __getitem__(self, key):
return self.interrupts[str(key)]
def keys(self):
return list(self.interrupts.keys())
def values(self):
return list(self.interrupts.values())
def has_key(self, key):
return str(key) in self.interrupts
def items(self):
return self.interrupts
def __contains__(self, key):
return str(key) in self.interrupts
def reload(self):
del self.interrupts
self.interrupts = {}
with open("/proc/interrupts") as f:
for line in f.readlines():
line = line.strip()
fields = line.split()
if fields[0][:3] == "CPU":
self.nr_cpus = len(fields)
continue
irq = fields[0].strip(":")
self.interrupts[irq] = {}
self.interrupts[irq] = self.parse_entry(fields[1:], line)
try:
nirq = int(irq)
except:
continue
self.interrupts[irq]["affinity"] = self.parse_affinity(nirq)
def parse_entry(self, fields, line):
dict = {}
dict["cpu"] = []
dict["cpu"].append(int(fields[0]))
nr_fields = len(fields)
if nr_fields >= self.nr_cpus:
dict["cpu"] += [int(i) for i in fields[1:self.nr_cpus]]
if nr_fields > self.nr_cpus:
dict["type"] = fields[self.nr_cpus]
# look if there are users (interrupts 3 and 4 haven't)
if nr_fields > self.nr_cpus + 1:
dict["users"] = [a.strip()
for a in fields[nr_fields - 1].split(',')]
else:
dict["users"] = []
return dict
def parse_affinity(self, irq):
try:
with open(f"/proc/irq/{irq}/smp_affinity") as f:
line = f.readline()
return bitmasklist(line, self.nr_cpus)
except IOError:
return [0, ]
def find_by_user(self, user):
"""
Looks up a interrupt number by the name of one of its users"
E.g.:
>>> import procfs
>>> interrupts = procfs.interrupts()
>>> thunderbolt_irq = interrupts.find_by_user("thunderbolt")
>>> print thunderbolt_irq
34
>>> thunderbolt = interrupts[thunderbolt_irq]
>>> print thunderbolt
{'affinity': [0, 1, 2, 3], 'type': 'PCI-MSI', 'cpu': [3495, 0, 81, 0], 'users': ['thunderbolt']}
>>>
"""
for i in list(self.interrupts.keys()):
if "users" in self.interrupts[i] and \
user in self.interrupts[i]["users"]:
return i
return None
def find_by_user_regex(self, regex):
"""
Looks up a interrupt number by a regex that matches names of its users"
E.g.:
>>> import procfs
>>> import re
>>> interrupts = procfs.interrupts()
>>> usb_controllers = interrupts.find_by_user_regex(re.compile(".*hcd"))
>>> print usb_controllers
['22', '23', '31']
>>> print [ interrupts[irq]["users"] for irq in usb_controllers ]
[['ehci_hcd:usb4'], ['ehci_hcd:usb3'], ['xhci_hcd']]
>>>
"""
irqs = []
for i in list(self.interrupts.keys()):
if "users" not in self.interrupts[i]:
continue
for user in self.interrupts[i]["users"]:
if regex.match(user):
irqs.append(i)
break
return irqs
class cmdline:
"""
Parses the kernel command line (/proc/cmdline), turning it into a dictionary."
Useful to figure out if some kernel boolean knob has been turned on,
as well as to find the value associated to other kernel knobs.
It can also be used to find out about parameters passed to the
init process, such as 'BOOT_IMAGE', etc.
E.g.:
>>> import procfs
>>> kcmd = procfs.cmdline()
>>> print kcmd.keys()
['LANG', 'BOOT_IMAGE', 'quiet', 'rhgb', 'rd.lvm.lv', 'ro', 'root']
>>> print kcmd["BOOT_IMAGE"]
/vmlinuz-4.3.0-rc1+
>>>
"""
def __init__(self):
self.options = {}
self.parse()
def parse(self):
with open("/proc/cmdline") as f:
for option in f.readline().strip().split():
fields = option.split("=")
if len(fields) == 1:
self.options[fields[0]] = True
else:
self.options[fields[0]] = fields[1]
def __getitem__(self, key):
return self.options[key]
def keys(self):
return list(self.options.keys())
def values(self):
return list(self.options.values())
def items(self):
return self.options
class cpuinfo:
"""
Dictionary with information about CPUs in the system.
Please refer to 'man procfs(5)' for further information about the
'/proc/cpuinfo' file, that is the source of the information provided
by this class. The 'man lscpu(1)' also has information about a program that
uses the '/proc/cpuinfo' file.
Using this class one can obtain the number of CPUs in a system:
>>> cpus = procfs.cpuinfo()
>>> print cpus.nr_cpus
4
It is also possible to figure out aspects of the CPU topology, such as
how many CPU physical sockets exists, i.e. groups of CPUs sharing
components such as CPU memory caches:
>>> print len(cpus.sockets)
1
Additionally dictionary with information common to all CPUs in the system
is available:
>>> print cpus["model name"]
Intel(R) Core(TM) i7-3667U CPU @ 2.00GHz
>>> print cpus["cache size"]
4096 KB
>>>
"""
def __init__(self, filename="/proc/cpuinfo"):
self.tags = {}
self.nr_cpus = 0
self.sockets = []
self.parse(filename)
def __getitem__(self, key):
return self.tags[key.lower()]
def keys(self):
return list(self.tags.keys())
def values(self):
return list(self.tags.values())
def items(self):
return self.tags
def parse(self, filename):
with open(filename) as f:
for line in f.readlines():
line = line.strip()
if not line:
continue
fields = line.split(":")
tagname = fields[0].strip().lower()
if tagname == "processor":
self.nr_cpus += 1
continue
if is_s390() and tagname == "cpu number":
self.nr_cpus += 1
continue
if tagname == "core id":
continue
self.tags[tagname] = fields[1].strip()
if tagname == "physical id":
socket_id = self.tags[tagname]
if socket_id not in self.sockets:
self.sockets.append(socket_id)
self.nr_sockets = self.sockets and len(self.sockets) or \
(self.nr_cpus /
("siblings" in self.tags and int(self.tags["siblings"]) or 1))
self.nr_cores = ("cpu cores" in self.tags and int(
self.tags["cpu cores"]) or 1) * self.nr_sockets
class smaps_lib:
"""
Representation of an mmap in place for a process. Can be used to figure
out which processes have an library mapped, etc.
The 'perm' member can be used to figure out executable mmaps,
i.e. libraries.
The 'vm_start' and 'vm_end' in turn can be used when trying to resolve
processor instruction pointer addresses to a symbol name in a library.
"""
def __init__(self, lines):
fields = lines[0].split()
self.vm_start, self.vm_end = [int(a, 16) for a in fields[0].split("-")]
self.perms = fields[1]
self.offset = int(fields[2], 16)
self.major, self.minor = fields[3].split(":")
self.inode = int(fields[4])
if len(fields) > 5:
self.name = fields[5]
else:
self.name = None
self.tags = {}
for line in lines[1:]:
fields = line.split()
tag = fields[0][:-1].lower()
try:
self.tags[tag] = int(fields[1])
except:
# VmFlags are strings
self.tags[tag] = fields
def __getitem__(self, key):
return self.tags[key.lower()]
def keys(self):
return list(self.tags.keys())
def values(self):
return list(self.tags.values())
def items(self):
return self.tags
class smaps:
"""
List of libraries mapped by a process. Parses the lines in
the /proc/PID/smaps file, that is further documented in the
procfs(5) man page.
Example: Listing the executable maps for the 'sshd' process:
>>> import procfs
>>> processes = procfs.pidstats()
>>> sshd = processes.find_by_name("sshd")
>>> sshd_maps = procfs.smaps(sshd[0])
>>> for i in range(len(sshd_maps)):
... if 'x' in sshd_maps[i].perms:
... print "%s: %s" % (sshd_maps[i].name, sshd_maps[i].perms)
...
/usr/sbin/sshd: r-xp
/usr/lib64/libnss_files-2.20.so: r-xp
/usr/lib64/librt-2.20.so: r-xp
/usr/lib64/libkeyutils.so.1.5: r-xp
/usr/lib64/libkrb5support.so.0.1: r-xp
/usr/lib64/libfreebl3.so: r-xp
/usr/lib64/libpthread-2.20.so: r-xp
...
"""
def __init__(self, pid):
self.pid = pid
self.entries = []
self.reload()
def parse_entry(self, f, line):
lines = []
if not line:
line = f.readline().strip()
if not line:
return
lines.append(line)
while True:
line = f.readline()
if not line:
break
line = line.strip()
if line.split()[0][-1] == ':':
lines.append(line)
else:
break
self.entries.append(smaps_lib(lines))
return line
def __len__(self):
return len(self.entries)
def __getitem__(self, index):
return self.entries[index]
def reload(self):
line = None
with open(f"/proc/{self.pid}/smaps") as f:
while True:
line = self.parse_entry(f, line)
if not line:
break
self.nr_entries = len(self.entries)
def find_by_name_fragment(self, fragment):
result = []
for i in range(self.nr_entries):
if self.entries[i].name and \
self.entries[i].name.find(fragment) >= 0:
result.append(self.entries[i])
return result
class cpustat:
"""
CPU statistics, obtained from a line in the '/proc/stat' file, Please
refer to 'man procfs(5)' for further information about the '/proc/stat'
file, that is the source of the information provided by this class.
"""
def __init__(self, fields):
self.name = fields[0]
(self.user,
self.nice,
self.system,
self.idle,
self.iowait,
self.irq,
self.softirq) = [int(i) for i in fields[1:8]]
if len(fields) > 7:
self.steal = int(fields[7])
if len(fields) > 8:
self.guest = int(fields[8])
def __repr__(self):
s = f"< user: {self.user}, nice: {self.nice}, system: {self.system}, idle: {self.idle}, iowait: {self.iowait}, irq: {self.irq}, softirq: {self.softirq}"
if hasattr(self, 'steal'):
s += f", steal: {self.steal}"
if hasattr(self, 'guest'):
s += f", guest: {self.guest}"
return s + ">"
class cpusstats:
"""
Dictionary with information about CPUs in the system. First entry in the
dictionary gives an aggregate view of all CPUs, each other entry is about
separate CPUs. Please refer to 'man procfs(5)' for further information
about the '/proc/stat' file, that is the source of the information provided
by this class.
"""
def __init__(self, filename="/proc/stat"):
self.entries = {}
self.time = None
self.hertz = os.sysconf(2)
self.filename = filename
self.reload()
def __iter__(self):
return iter(self.entries)
def __getitem__(self, key):
return self.entries[key]
def __len__(self):
return len(list(self.entries.keys()))
def keys(self):
return list(self.entries.keys())
def values(self):
return list(self.entries.values())
def items(self):
return self.entries
def reload(self):
last_entries = self.entries
self.entries = {}
with open(self.filename) as f:
for line in f.readlines():
fields = line.strip().split()
if fields[0][:3].lower() != "cpu":
continue
c = cpustat(fields)
if c.name == "cpu":
idx = 0
else:
idx = int(c.name[3:]) + 1
self.entries[idx] = c
last_time = self.time
self.time = time.time()
if last_entries:
delta_sec = self.time - last_time
interval_hz = delta_sec * self.hertz
for cpu in list(self.entries.keys()):
if cpu not in last_entries:
curr.usage = 0
continue
curr = self.entries[cpu]
prev = last_entries[cpu]
delta = (curr.user - prev.user) + \
(curr.nice - prev.nice) + \
(curr.system - prev.system)
curr.usage = (delta / interval_hz) * 100
curr.usage = min(curr.usage, 100)
if __name__ == '__main__':
import sys
ints = interrupts()
for i in list(ints.interrupts.keys()):
print(f"{i}: {ints.interrupts[i]}")
options = cmdline()
for o in list(options.options.keys()):
print(f"{o}: {options.options[o]}")
cpu = cpuinfo()
print(f"\ncpuinfo data: {cpu.nr_cpus} processors")
for tag in list(cpu.keys()):
print(f"{tag}={cpu[tag]}")
print("smaps:\n" + ("-" * 40))
s = smaps(int(sys.argv[1]))
for i in range(s.nr_entries):
print(f"{s.entries[i].vm_start:#x} {s.entries[i].name}")
print("-" * 40)
for a in s.find_by_name_fragment(sys.argv[2]):
print(a["Size"])
ps = pidstats()
print(ps[1])
cs = cpusstats()
while True:
time.sleep(1)
cs.reload()
for cpu in cs:
print(f"{cpu}: {cs[cpu]}")
print("-" * 10)
procfs/__pycache__/__init__.cpython-36.pyc 0000755 00000000574 14751155147 0014460 0 ustar 00 3
�{Me� � @ s d Z dZdZddlT ddlT dS )zp
Copyright (c) 2008, 2009 Red Hat Inc.
Abstractions to extract information from the Linux kernel /proc files.
z*Arnaldo Carvalho de Melo <acme@redhat.com>z
GPLv2 License� )�*N)�__doc__�
__author__Z __license__ZprocfsZutilist� r r � /usr/lib/python3.6/__init__.py�<module> s procfs/__pycache__/utilist.cpython-36.opt-1.pyc 0000755 00000001417 14751155147 0015352 0 ustar 00 3
�{Mew � @ s d dl mZ dd� Zdd� ZdS )� )�rangec C sv g }d}d}xHt |�D ]<}|| kr.|d|> O }|d7 }|dkrd}|jd|� d}qW |dk rr|dkrr|jd|� |S )Nr � � )r �insert)�l�
nr_entries�
hexbitmask�bit�mask�entry� r � /usr/lib/python3.6/utilist.pyr s r c C sl | j � jdd�}g }d}tt|d��dd � }x8t|�D ],}t|�d@ rR|j|� |d7 }||kr8P q8W |S )N�,� r � � r )�strip�replace�bin�int�reversed�append)�liner Zhexmask� bitmasklistr Zbitmask�ir r r
r s
r N)Z six.movesr r r r r r r
�<module> s procfs/__pycache__/procfs.cpython-36.pyc 0000755 00000107105 14751155147 0014213 0 ustar 00 3
�{Meʍ � @ s� d dl Z d dlZd dlZd dlZd dlmZ d dlmZ d dlm Z dZ
dd� Z dd � Z G d
d � d �Z
d d
� Zdd� ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� d�ZG d d � d �ZG d d � d �ZG d d!� d!�ZG d"d#� d#�Zed$k�r�d dlZe� Z x0e e jj � �D ] Z e e � d%e je � �� �q*W e� Z!x0e e!j!j � �D ] Z"e e"� d%e!j!e" � �� �qbW e� Z#e d&e#j$� d'�� x,e e#j � �D ] Z%e e%� d(e#e% � �� �q�W e d)d*d+ � ee&ej'd, ��Z(x8ee(j)�D ]*Z e e(j*e j+d-�d.e(j*e j,� �� �q�W e d*d+ � x&e(j-ej'd/ �D ]Z.e e.d0 � �qDW e� Z/e e/d, � e� Z0xFej1d,� e0j2� x$e0D ] Z#e e#� d%e0e# � �� �q�W e d2� �qtW dS )3� N)�reduce)�range)� bitmasklistz0.7.3c C s t j� } ttjd| ��S )z) Return True if running on s390 or s390x Zs390)�platform�machine�bool�re�search)r � r
� /usr/lib/python3.6/procfs.py�is_s390 s r c C s: | d r t dd� | d �j� S y | d d S dS dS )z�
Returns the process command line, if available in the given `process' class,
if not available, falls back to using the comm (short process name) in its
pidstat key.
�cmdlinec S s | d| S )Nz %sr
)�a�br
r
r �<lambda>! s z!process_cmdline.<locals>.<lambda>�stat�commN)r �strip)Zpid_infor
r
r �process_cmdline s r c + @ sN e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZdZdZdZdZdZdZdZdZdZdZdZdZ dZ dZ dZ d Z d Z!d Z"d Z#d Z$d Z%d!Z&d!Z'd"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLg+Z(dcdNdO�Z)dPdQ� Z*dRdS� Z+dTdU� Z,dVdW� Z-dXdY� Z.dZd[� Z/ddd\d]�Z0d^d_� Z1d`da� Z2dbS )e�pidstatam
Provides a dictionary to access the fields in the
per process /proc/PID/stat files.
One can obtain the available fields by asking for the keys of the
dictionary, e.g.:
>>> p = procfs.pidstat(1)
>>> print p.keys()
['majflt', 'rss', 'cnswap', 'cstime', 'pid', 'session', 'startstack', 'startcode', 'cmajflt', 'blocked', 'exit_signal', 'minflt', 'nswap', 'environ', 'priority', 'state', 'delayacct_blkio_ticks', 'policy', 'rt_priority', 'ppid', 'nice', 'cutime', 'endcode', 'wchan', 'num_threads', 'sigcatch', 'comm', 'stime', 'sigignore', 'tty_nr', 'kstkeip', 'utime', 'tpgid', 'itrealvalue', 'kstkesp', 'rlim', 'signal', 'pgrp', 'flags', 'starttime', 'cminflt', 'vsize', 'processor']
And then access the various process properties using it as a dictionary:
>>> print p['comm']
systemd
>>> print p['priority']
20
>>> print p['state']
S
Please refer to the 'procfs(5)' man page, by using:
$ man 5 procfs
To see information for each of the above fields, it is part of the
'man-pages' RPM package.
� � � � � � �@ � � i i i i i i @ i � i i i i i i i @ i � i i i i i i i @l �pidr �stateZppidZpgrpZsessionZtty_nrZtpgid�flagsZminfltZcminfltZmajfltZcmajflt�utimeZstimeZcutimeZcstimeZpriority�niceZ num_threadsZ itrealvalueZ starttimeZvsizeZrssZrlimZ startcodeZendcodeZ
startstackZkstkespZkstkeip�signalZblockedZ sigignoreZsigcatchZwchanZnswapZcnswapZ exit_signal� processor� rt_priorityZpolicyZdelayacct_blkio_ticks�environ�/procc C s0 || _ y| j|� W n tk
r* � Y nX d S )N)r �load�FileNotFoundError)�selfr �basedirr
r
r �__init__~ s
zpidstat.__init__c C s
| j | S )N)�fields)r+ � fieldnamer
r
r � __getitem__� s zpidstat.__getitem__c C s t | jj� �S )N)�listr. �keys)r+ r
r
r r2 � s z pidstat.keysc C s t | jj� �S )N)r1 r. �values)r+ r
r
r r3 � s zpidstat.valuesc C s
|| j kS )N)r. )r+ r/ r
r
r �has_key� s zpidstat.has_keyc C s | j S )N)r. )r+ r
r
r �items� s z
pidstat.itemsc C s
|| j kS )N)r. )r+ r/ r
r
r � __contains__� s zpidstat.__contains__c C s� yt |� d| j� d��}W n tk
r0 � Y nX |j� j� jd�}|j� |d jd�|d j� }i | _tt |�t | j
��}xft |�D ]Z}| j
| }|| }|dkr�|jd�| jd< q�yt |�| j|< W q� || j|< Y q�X q�W d S ) N�/z/statz) r z (r r z())
�openr r* �readliner �split�closer. �min�len�proc_stat_fieldsr �int)r+ r, �fr. � nr_fields�iZattrname�valuer
r
r r) � s$
z pidstat.loadc C s t | jd | j@ �S )z�
Returns true if this process has a fixed smp affinity mask,
not allowing it to be moved to a different set of CPUs.
r! )r r. �PF_THREAD_BOUND)r+ r
r
r �is_bound_to_cpu� s zpidstat.is_bound_to_cpuc C sN g }xDt | �D ]8}|dd� dkr$qt| |�}|| jd @ r|j|� qW |S )a�
Returns a list with all the process flags known, details depend
on kernel version, declared in the file include/linux/sched.h in
the kernel sources.
As of v4.2-rc7 these include (from include/linux/sched.h comments):
PF_EXITING Getting shut down
PF_EXITPIDONE Pi exit done on shut down
PF_VCPU I'm a virtual CPU
PF_WQ_WORKER I'm a workqueue worker
PF_FORKNOEXEC Forked but didn't exec
PF_MCE_PROCESS Process policy on mce errors
PF_SUPERPRIV Used super-user privileges
PF_DUMPCORE Dumped core
PF_SIGNALED Killed by a signal
PF_MEMALLOC Allocating memory
PF_NPROC_EXCEEDED Set_user noticed that RLIMIT_NPROC was exceeded
PF_USED_MATH If unset the fpu must be initialized before use
PF_USED_ASYNC Used async_schedule*(), used by module init
PF_NOFREEZE This thread should not be frozen
PF_FROZEN Frozen for system suspend
PF_FSTRANS Inside a filesystem transaction
PF_KSWAPD I am kswapd
PF_MEMALLOC_NOIO Allocating memory without IO involved
PF_LESS_THROTTLE Throttle me less: I clean memory
PF_KTHREAD I am a kernel thread
PF_RANDOMIZE Randomize virtual address space
PF_SWAPWRITE Allowed to write to swap
PF_NO_SETAFFINITY Userland is not allowed to meddle with cpus_allowed
PF_MCE_EARLY Early kill for mce process policy
PF_MUTEX_TESTER Thread belongs to the rt mutex tester
PF_FREEZER_SKIP Freezer should not count it as freezable
PF_SUSPEND_TASK This thread called freeze_processes and
should not be frozen
N� ZPF_r! )�dir�getattrr. �append)r+ Zsflags�attrrC r
r
r �
process_flags� s &
zpidstat.process_flagsN)r( )r( )3�__name__�
__module__� __qualname__�__doc__Z PF_ALIGNWARNZ PF_STARTINGZ
PF_EXITINGZ
PF_EXITPIDONEZPF_VCPUZ PF_WQ_WORKERZ
PF_FORKNOEXECZPF_MCE_PROCESSZ PF_SUPERPRIVZ PF_DUMPCOREZ PF_SIGNALEDZ PF_MEMALLOCZPF_NPROC_EXCEEDEDZ
PF_FLUSHERZ PF_USED_MATHZ
PF_USED_ASYNCZ PF_NOFREEZEZ PF_FROZENZ
PF_FSTRANSZ PF_KSWAPDZPF_MEMALLOC_NOIOZ
PF_SWAPOFFZPF_LESS_THROTTLEZ
PF_KTHREADZ PF_RANDOMIZEZ PF_SWAPWRITEZPF_SPREAD_PAGEZPF_SPREAD_SLABrD �PF_NO_SETAFFINITYZ PF_MCE_EARLYZ PF_MEMPOLICYZPF_MUTEX_TESTERZPF_FREEZER_SKIPZPF_FREEZER_NOSIGZPF_SUSPEND_TASKr> r- r0 r2 r3 r4 r5 r6 r) rE rK r
r
r
r r * st
r c
C s2 d}y t t| j| d d �|@ �S dS d S )Ni r r! T)r r? � processes)r+ r rP r
r
r �cannot_set_affinity� s rR c
C s8 d}y$t t| j| j| d d �|@ �S dS d S )Ni r r! T)r r? rQ �threads)r+ r �tidrP r
r
r �cannot_set_thread_affinity� s rU c @ sT e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
ddd�Z dS )� pidstatusa
Provides a dictionary to access the fields
in the per process /proc/PID/status files.
This provides additional information about processes and threads to
what can be obtained with the procfs.pidstat() class.
One can obtain the available fields by asking for the keys of the
dictionary, e.g.:
>>> import procfs
>>> p = procfs.pidstatus(1)
>>> print p.keys()
['VmExe', 'CapBnd', 'NSpgid', 'Tgid', 'NSpid', 'VmSize', 'VmPMD', 'ShdPnd', 'State', 'Gid', 'nonvoluntary_ctxt_switches', 'SigIgn', 'VmStk', 'VmData', 'SigCgt', 'CapEff', 'VmPTE', 'Groups', 'NStgid', 'Threads', 'PPid', 'VmHWM', 'NSsid', 'VmSwap', 'Name', 'SigBlk', 'Mems_allowed_list', 'VmPeak', 'Ngid', 'VmLck', 'SigQ', 'VmPin', 'Mems_allowed', 'CapPrm', 'Seccomp', 'VmLib', 'Cpus_allowed', 'Uid', 'SigPnd', 'Pid', 'Cpus_allowed_list', 'TracerPid', 'CapInh', 'voluntary_ctxt_switches', 'VmRSS', 'FDSize']
>>> print p["Pid"]
1
>>> print p["Threads"]
1
>>> print p["VmExe"]
1248 kB
>>> print p["Cpus_allowed"]
f
>>> print p["SigQ"]
0/30698
>>> print p["VmPeak"]
320300 kB
>>>
Please refer to the 'procfs(5)' man page, by using:
$ man 5 procfs
To see information for each of the above fields, it is part of the
'man-pages' RPM package.
In the man page there will be references to further documentation, like
referring to the "getrlimit(2)" man page when explaining the "SigQ"
line/field.
�/procc C s || _ | j|� d S )N)r r) )r+ r r, r
r
r r- ! s zpidstatus.__init__c C s
| j | S )N)r. )r+ r/ r
r
r r0 % s zpidstatus.__getitem__c C s t | jj� �S )N)r1 r. r2 )r+ r
r
r r2 ( s zpidstatus.keysc C s t | jj� �S )N)r1 r. r3 )r+ r
r
r r3 + s zpidstatus.valuesc C s
|| j kS )N)r. )r+ r/ r
r
r r4 . s zpidstatus.has_keyc C s | j S )N)r. )r+ r
r
r r5 1 s zpidstatus.itemsc C s
|| j kS )N)r. )r+ r/ r
r
r r6 4 s zpidstatus.__contains__c C s� i | _ t|� d| j� d���n}xf|j� D ]Z}|jd�}t|�dkrDq(|d }|d j� }yt|�| j |< W q( || j |< Y q(X q(W W d Q R X d S )Nr7 z/status�:r r r )r. r8 r � readlinesr: r= r r? )r+ r, r@ �liner. �namerC r
r
r r) 7 s
zpidstatus.loadN)rW )rW ) rL rM rN rO r- r0 r2 r3 r4 r5 r6 r) r
r
r
r rV � s &
rV c @ sR e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )�processa+
Information about a process with a given pid, provides a dictionary with
two entries, instances of different wrappers for /proc/ process related
meta files: "stat" and "status", see the documentation for procfs.pidstat
and procfs.pidstatus for further info about those classes.
�/procc C s || _ || _d S )N)r r, )r+ r r, r
r
r r- N s zprocess.__init__c C s� t | |�s�|dkrX|dkr t}nt}yt| ||| j| j�� W q� tk
rT � Y q�X nF|dkrj| j� n4|dkr|| j� n"|dkr�| j � n|dkr�| j
� t | |�S )Nr �statusr
rS �cgroupsr' )r r^ ) �hasattrr rV �setattrr r, r* � load_cmdline� load_threads� load_cgroups� load_environrH )r+ rJ Zsclassr
r
r r0 R s$
zprocess.__getitem__c C s
t | |�S )N)r` )r+ rJ r
r
r r4 j s zprocess.has_keyc C s
t | |�S )N)r` )r+ rJ r
r
r r6 m s zprocess.__contains__c C sv y>t d| j� d���"}|j� j� jd�d d� | _W d Q R X W n2 tk
rX d | _Y n tk
rp d | _Y nX d S )Nz/proc/z/cmdline� r ���)r8 r r9 r r: r
r* �UnicodeDecodeError)r+ r@ r
r
r rb p s *
zprocess.load_cmdlinec C s" t d| j� d��| _| j| j= d S )Nz/proc/z/task/)�pidstatsr rS )r+ r
r
r rc { s zprocess.load_threadsc C st d| _ td| j� d���R}xJt|j� �D ]:}t| j �dkrT| j d |d d� | _ q(|d d� | _ q(W W d Q R X d S ) N� z/proc/z/cgroupr �,r rg rg )r_ r8 r �reversedrY r= )r+ r@ rZ r
r
r rd � s zprocess.load_cgroupsc C sh i | _ td| j� d���F}x>|j� jd�D ],}t|�dkr*|jd�}|d | j |d < q*W W dQ R X dS )aD
Loads the environment variables for this process. The entries then
become available via the 'environ' member, or via the 'environ'
dict key when accessing as p["environ"].
E.g.:
>>> all_processes = procfs.pidstats()
>>> firefox_pid = all_processes.find_by_name("firefox")
>>> firefox_process = all_processes[firefox_pid[0]]
>>> print firefox_process["environ"]["PWD"]
/home/acme
>>> print len(firefox_process.environ.keys())
66
>>> print firefox_process["environ"]["SHELL"]
/bin/bash
>>> print firefox_process["environ"]["USERNAME"]
acme
>>> print firefox_process["environ"]["HOME"]
/home/acme
>>> print firefox_process["environ"]["MAIL"]
/var/spool/mail/acme
>>>
z/proc/z/environrf r �=r N)r' r8 r r9 r: r= )r+ r@ �x�yr
r
r re � s
zprocess.load_environN)r] ) rL rM rN rO r- r0 r4 r6 rb rc rd re r
r
r
r r\ F s
r\ c @ s� e Zd ZdZd$dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#S )%ri a#
Provides access to all the processes in the system, to get a picture of
how many processes there are at any given moment.
The entries can be accessed as a dictionary, keyed by pid. Also there are
methods to find processes that match a given COMM or regular expression.
�/procc C s || _ i | _| j� d S )N)r, rQ �reload)r+ r, r
r
r r- � s zpidstats.__init__c C s
| j | S )N)rQ )r+ �keyr
r
r r0 � s zpidstats.__getitem__c C s y | j |= W n Y nX d S )N)rQ )r+ rr r
r
r � __delitem__� s zpidstats.__delitem__c C s t | jj� �S )N)r1 rQ r2 )r+ r
r
r r2 � s z
pidstats.keysc C s t | jj� �S )N)r1 rQ r3 )r+ r
r
r r3 � s zpidstats.valuesc C s
|| j kS )N)rQ )r+ rr r
r
r r4 � s zpidstats.has_keyc C s | j S )N)rQ )r+ r
r
r r5 � s zpidstats.itemsc C s
|| j kS )N)rQ )r+ rr r
r
r r6 � s zpidstats.__contains__c
C sV | ` i | _ tj| j�}x:|D ]2}y t|�}W n w Y nX t|| j�| j |< q W dS )a'
This operation will throw away the current dictionary contents,
if any, and read all the pid files from /proc/, instantiating a
'process' instance for each of them.
This is a high overhead operation, and should be avoided if the
perf python binding can be used to detect when new threads appear
and existing ones terminate.
In RHEL it is found in the python-perf rpm package.
More information about the perf facilities can be found in the
'perf_event_open' man page.
N)rQ �os�listdirr, r? r\ )r+ �pidsZspidr r
r
r rq � s
zpidstats.reloadc C sh g }xHt | jj� �D ]6}y| j| j� W q tk
rH |j|� Y qX qW x|D ] }| j|= qTW d S )N)r1 rQ r2 rc �OSErrorrI )r+ Z to_remover r
r
r �reload_threads� s
zpidstats.reload_threadsc C sn |d d� }g }xXt | jj� �D ]F}y$|| j| d d krF|j|� W q tk
rd | j|= Y q X q W |S )N� r r )r1 rQ r2 rI �IOError)r+ r[ rv r r
r
r � find_by_name� s zpidstats.find_by_namec C sd g }xZt | jj� �D ]H}y&|j| j| d d �r<|j|� W q tk
rZ | j|= Y qX qW |S )Nr r )r1 rQ r2 �matchrI rz )r+ �regexrv r r
r
r �
find_by_regex s zpidstats.find_by_regexc C s` g }xVt | jj� �D ]D}y"|jt| j| ��r8|j|� W q tk
rV | j|= Y qX qW |S )N)r1 rQ r2 r| r rI rz )r+ r} rv r r
r
r �find_by_cmdline_regex s z pidstats.find_by_cmdline_regexc s� d}d}g � x�|� d|� �}| j |�}| sFt� fdd�|D ��dkrHP xF|D ]>}y || j| d d � 7 }W qN tk
r� | j|= Y qNX qNW � |7 � |d7 }qW |jd �}|S )
Nr rj r7 c s g | ]}|� kr|�qS r
r
)�.0�n)�processed_pidsr
r �
<listcomp>' s z0pidstats.get_per_cpu_rtprios.<locals>.<listcomp>r r& r rk )r{ r= rQ rz r )r+ �basename�cpu�
prioritiesr[ rv r r
)r� r �get_per_cpu_rtprios s"
z pidstats.get_per_cpu_rtpriosc s� d}d}g � x�| j |�}| s8t� fdd�|D ��dkr:P xF|D ]>}y || j| d d � 7 }W q@ tk
r| | j|= Y q@X q@W � |7 � |d7 }qW |jd�}|S ) Nr rj c s g | ]}|� kr|�qS r
r
)r� r� )r� r
r r� = s z(pidstats.get_rtprios.<locals>.<listcomp>r r& r rk )r{ r= rQ rz r )r+ r[ r� r� rv r r
)r� r � get_rtprios7 s
zpidstats.get_rtpriosc C s | j | d j� S )zQ
Checks if a given pid can't have its SMP affinity mask changed.
r )rQ rE )r+ r r
r
r rE M s zpidstats.is_bound_to_cpuN)rp )rL rM rN rO r- r0 rs r2 r3 r4 r5 r6 rq rx r{ r~ r r� r� rE r
r
r
r ri � s"
ri c @ sp e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS )�
interruptsam
Information about IRQs in the system. A dictionary keyed by IRQ number
will have as its value another dictionary with "cpu", "type" and "users"
keys, with the SMP affinity mask, type of IRQ and the drivers associated
with each interrupt.
The information comes from the /proc/interrupts file, documented in
'man procfs(5)', for instance, the 'cpu' dict is an array with one entry
per CPU present in the sistem, each value being the number of interrupts
that took place per CPU.
E.g.:
>>> import procfs
>>> interrupts = procfs.interrupts()
>>> thunderbolt_irq = interrupts.find_by_user("thunderbolt")
>>> print thunderbolt_irq
34
>>> thunderbolt = interrupts[thunderbolt_irq]
>>> print thunderbolt
{'affinity': [0, 1, 2, 3], 'type': 'PCI-MSI', 'cpu': [3495, 0, 81, 0], 'users': ['thunderbolt']}
>>>
c C s i | _ | j� d S )N)r� rq )r+ r
r
r r- m s zinterrupts.__init__c C s | j t|� S )N)r� �str)r+ rr r
r
r r0 q s zinterrupts.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 t s zinterrupts.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 w s zinterrupts.valuesc C s t |�| jkS )N)r� r� )r+ rr r
r
r r4 z s zinterrupts.has_keyc C s | j S )N)r� )r+ r
r
r r5 } s zinterrupts.itemsc C s t |�| jkS )N)r� r� )r+ rr r
r
r r6 � s zinterrupts.__contains__c C s� | ` i | _ td���}x�|j� D ]�}|j� }|j� }|d d d� dkrRt|�| _q |d jd�}i | j |< | j|dd � |�| j |< y t|�}W n w Y nX | j |�| j | d< q W W d Q R X d S )Nz/proc/interruptsr rF ZCPUrX r Zaffinity)
r� r8 rY r r: r= �nr_cpus� parse_entryr? �parse_affinity)r+ r@ rZ r. �irqZnirqr
r
r rq � s"
zinterrupts.reloadc C s� i }g |d< |d j t|d �� t|�}|| jkr�|d dd� |d| j� D �7 < || jkr�|| j |d< || jd kr�dd� ||d jd�D �|d < ng |d < |S )
Nr� r c S s g | ] }t |��qS r
)r? )r� rB r
r
r r� � s z*interrupts.parse_entry.<locals>.<listcomp>r �typec S s g | ] }|j � �qS r
)r )r� r r
r
r r� � s rk �users)rI r? r= r� r: )r+ r. rZ �dictrA r
r
r r� � s
$
zinterrupts.parse_entryc C sL y0t d|� d���}|j� }W d Q R X t|| j�S tk
rF dgS X d S )Nz
/proc/irq/z
/smp_affinityr )r8 r9 r r� rz )r+ r� r@ rZ r
r
r r� � s zinterrupts.parse_affinityc C s@ x:t | jj� �D ](}d| j| kr|| j| d kr|S qW dS )a�
Looks up a interrupt number by the name of one of its users"
E.g.:
>>> import procfs
>>> interrupts = procfs.interrupts()
>>> thunderbolt_irq = interrupts.find_by_user("thunderbolt")
>>> print thunderbolt_irq
34
>>> thunderbolt = interrupts[thunderbolt_irq]
>>> print thunderbolt
{'affinity': [0, 1, 2, 3], 'type': 'PCI-MSI', 'cpu': [3495, 0, 81, 0], 'users': ['thunderbolt']}
>>>
r� N)r1 r� r2 )r+ �userrB r
r
r � find_by_user� s
zinterrupts.find_by_userc C s^ g }xTt | jj� �D ]B}d| j| kr(qx,| j| d D ]}|j|�r8|j|� P q8W qW |S )a�
Looks up a interrupt number by a regex that matches names of its users"
E.g.:
>>> import procfs
>>> import re
>>> interrupts = procfs.interrupts()
>>> usb_controllers = interrupts.find_by_user_regex(re.compile(".*hcd"))
>>> print usb_controllers
['22', '23', '31']
>>> print [ interrupts[irq]["users"] for irq in usb_controllers ]
[['ehci_hcd:usb4'], ['ehci_hcd:usb3'], ['xhci_hcd']]
>>>
r� )r1 r� r2 r| rI )r+ r} ZirqsrB r� r
r
r �find_by_user_regex� s
z interrupts.find_by_user_regexN)rL rM rN rO r- r0 r2 r3 r4 r5 r6 rq r� r� r� r� r
r
r
r r� T s r� c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )r
a9
Parses the kernel command line (/proc/cmdline), turning it into a dictionary."
Useful to figure out if some kernel boolean knob has been turned on,
as well as to find the value associated to other kernel knobs.
It can also be used to find out about parameters passed to the
init process, such as 'BOOT_IMAGE', etc.
E.g.:
>>> import procfs
>>> kcmd = procfs.cmdline()
>>> print kcmd.keys()
['LANG', 'BOOT_IMAGE', 'quiet', 'rhgb', 'rd.lvm.lv', 'ro', 'root']
>>> print kcmd["BOOT_IMAGE"]
/vmlinuz-4.3.0-rc1+
>>>
c C s i | _ | j� d S )N)�options�parse)r+ r
r
r r- � s zcmdline.__init__c C sj t d��X}xP|j� j� j� D ]<}|jd�}t|�dkrFd| j|d < q |d | j|d < q W W d Q R X d S )Nz
/proc/cmdlinerm r Tr )r8 r9 r r: r= r� )r+ r@ Zoptionr. r
r
r r� � s
z
cmdline.parsec C s
| j | S )N)r� )r+ rr r
r
r r0 s zcmdline.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 s z cmdline.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 s zcmdline.valuesc C s | j S )N)r� )r+ r
r
r r5
s z
cmdline.itemsN)
rL rM rN rO r- r� r0 r2 r3 r5 r
r
r
r r
� s r
c @ sB e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )�cpuinfoa�
Dictionary with information about CPUs in the system.
Please refer to 'man procfs(5)' for further information about the
'/proc/cpuinfo' file, that is the source of the information provided
by this class. The 'man lscpu(1)' also has information about a program that
uses the '/proc/cpuinfo' file.
Using this class one can obtain the number of CPUs in a system:
>>> cpus = procfs.cpuinfo()
>>> print cpus.nr_cpus
4
It is also possible to figure out aspects of the CPU topology, such as
how many CPU physical sockets exists, i.e. groups of CPUs sharing
components such as CPU memory caches:
>>> print len(cpus.sockets)
1
Additionally dictionary with information common to all CPUs in the system
is available:
>>> print cpus["model name"]
Intel(R) Core(TM) i7-3667U CPU @ 2.00GHz
>>> print cpus["cache size"]
4096 KB
>>>
�
/proc/cpuinfoc C s i | _ d| _g | _| j|� d S )Nr )�tagsr� �socketsr� )r+ �filenamer
r
r r- . s zcpuinfo.__init__c C s | j |j� S )N)r� �lower)r+ rr r
r
r r0 4 s zcpuinfo.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 7 s z cpuinfo.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 : s zcpuinfo.valuesc C s | j S )N)r� )r+ r
r
r r5 = s z
cpuinfo.itemsc C s( t |���}x�|j� D ]�}|j� }|s&q|jd�}|d j� j� }|dkrX| jd7 _qt� rv|dkrv| jd7 _q|dkr�q|d j� | j|< |dkr| j| }|| jkr| jj |� qW W d Q R X | jr�t
| j�p�| jd| jkr�t | jd �p�d | _ d | jk�rt | jd ��pd| j | _
d S )
NrX r r% r z
cpu numberzcore idz physical idZsiblingsz cpu cores)r8 rY r r: r� r� r r� r� rI r= r? Z
nr_socketsZnr_cores)r+ r� r@ rZ r. ZtagnameZ socket_idr
r
r r� @ s2
z
cpuinfo.parseN)r� )
rL rM rN rO r- r0 r2 r3 r5 r� r
r
r
r r� s
r� c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
� smaps_libat
Representation of an mmap in place for a process. Can be used to figure
out which processes have an library mapped, etc.
The 'perm' member can be used to figure out executable mmaps,
i.e. libraries.
The 'vm_start' and 'vm_end' in turn can be used when trying to resolve
processor instruction pointer addresses to a symbol name in a library.
c
C s� |d j � }dd� |d j d�D �\| _| _|d | _t|d d�| _|d j d �\| _| _t|d
�| _t |�d kr�|d | _
nd | _
i | _ x^|dd � D ]N}|j � }|d d d � j � }yt|d �| j |< W q� || j |< Y q�X q�W d S )
Nr c S s g | ]}t |d ��qS )r )r? )r� r r
r
r r� j s z&smaps_lib.__init__.<locals>.<listcomp>�-r r r rF rX r � rg )
r: �vm_startZvm_endZpermsr? �offset�major�minor�inoder= r[ r� r� )r+ �linesr. rZ �tagr
r
r r- h s"
zsmaps_lib.__init__c C s | j |j� S )N)r� r� )r+ rr r
r
r r0 } s zsmaps_lib.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 � s zsmaps_lib.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 � s zsmaps_lib.valuesc C s | j S )N)r� )r+ r
r
r r5 � s zsmaps_lib.itemsN) rL rM rN rO r- r0 r2 r3 r5 r
r
r
r r� \ s
r� c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�smapsa~
List of libraries mapped by a process. Parses the lines in
the /proc/PID/smaps file, that is further documented in the
procfs(5) man page.
Example: Listing the executable maps for the 'sshd' process:
>>> import procfs
>>> processes = procfs.pidstats()
>>> sshd = processes.find_by_name("sshd")
>>> sshd_maps = procfs.smaps(sshd[0])
>>> for i in range(len(sshd_maps)):
... if 'x' in sshd_maps[i].perms:
... print "%s: %s" % (sshd_maps[i].name, sshd_maps[i].perms)
...
/usr/sbin/sshd: r-xp
/usr/lib64/libnss_files-2.20.so: r-xp
/usr/lib64/librt-2.20.so: r-xp
/usr/lib64/libkeyutils.so.1.5: r-xp
/usr/lib64/libkrb5support.so.0.1: r-xp
/usr/lib64/libfreebl3.so: r-xp
/usr/lib64/libpthread-2.20.so: r-xp
...
c C s || _ g | _| j� d S )N)r �entriesrq )r+ r r
r
r r- � s zsmaps.__init__c C sx g }|s|j � j� }|s d S |j|� x<|j � }|s6P |j� }|j� d d dkr^|j|� q(P q(W | jjt|�� |S )Nr r rX rg )r9 r rI r: r� r� )r+ r@ rZ r� r
r
r r� � s
zsmaps.parse_entryc C s
t | j�S )N)r= r� )r+ r
r
r �__len__� s z
smaps.__len__c C s
| j | S )N)r� )r+ �indexr
r
r r0 � s zsmaps.__getitem__c
C sJ d }t d| j� d��� }x| j||�}|sP qW W d Q R X t| j�| _d S )Nz/proc/z/smaps)r8 r r� r= r� �
nr_entries)r+ rZ r@ r
r
r rq � s z smaps.reloadc C sN g }xDt | j�D ]6}| j| jr| j| jj|�dkr|j| j| � qW |S )Nr )r r� r� r[ �findrI )r+ Zfragment�resultrB r
r
r �find_by_name_fragment� s zsmaps.find_by_name_fragmentN)
rL rM rN rO r- r� r� r0 rq r� r
r
r
r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )�cpustatz�
CPU statistics, obtained from a line in the '/proc/stat' file, Please
refer to 'man procfs(5)' for further information about the '/proc/stat'
file, that is the source of the information provided by this class.
c C st |d | _ dd� |dd� D �\| _| _| _| _| _| _| _t|�dkrpt |d �| _
t|�dkrpt |d �| _ d S )Nr c S s g | ] }t |��qS r
)r? )r� rB r
r
r r� � s z$cpustat.__init__.<locals>.<listcomp>r r � ) r[ r� r# �system�idle�iowaitr� �softirqr= r? �steal�guest)r+ r. r
r
r r- � s
2 zcpustat.__init__c C sx d| j � d| j� d| j� d| j� d| j� d| j� d| j� �}t| d�rV|d | j� �7 }t| d
�rp|d | j � �7 }|d S )
Nz< user: z, nice: z
, system: z, idle: z
, iowait: z, irq: z , softirq: r� z , steal: r� z , guest: �>)
r� r# r� r� r� r� r� r` r� r� )r+ �sr
r
r �__repr__� s <
zcpustat.__repr__N)rL rM rN rO r- r� r
r
r
r r� � s r� c @ sR e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )� cpusstatsaN
Dictionary with information about CPUs in the system. First entry in the
dictionary gives an aggregate view of all CPUs, each other entry is about
separate CPUs. Please refer to 'man procfs(5)' for further information
about the '/proc/stat' file, that is the source of the information provided
by this class.
�
/proc/statc C s* i | _ d | _tjd�| _|| _| j� d S )Nr )r� �timert �sysconf�hertzr� rq )r+ r� r
r
r r- � s
zcpusstats.__init__c C s
t | j�S )N)�iterr� )r+ r
r
r �__iter__ s zcpusstats.__iter__c C s
| j | S )N)r� )r+ rr r
r
r r0 s zcpusstats.__getitem__c C s t t| jj� ��S )N)r= r1 r� r2 )r+ r
r
r r� s zcpusstats.__len__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 s zcpusstats.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 s zcpusstats.valuesc C s | j S )N)r� )r+ r
r
r r5 s zcpusstats.itemsc C s: | j }i | _ t| j��v}xn|j� D ]b}|j� j� }|d d d� j� dkrLq"t|�}|jdkrdd}nt |jdd � �d }|| j |< q"W W d Q R X | j
}t
j
� | _
|�r6| j
| }|| j } xxt | j j
� �D ]f}
|
|kr�d| _q�| j |
} ||
} | j| j | j| j | j| j }
|
| d | _t| jd�| _q�W d S )Nr rF r� r �d )r� r8 r� rY r r: r� r� r[ r? r� r� r1 r2 Zusager� r# r� r< )r+ Z last_entriesr@ rZ r. �c�idxZ last_timeZ delta_secZ interval_hzr� Zcurr�prevZdeltar
r
r rq s6
zcpusstats.reloadN)r� ) rL rM rN rO r- r� r0 r� r2 r3 r5 rq r
r
r
r r� � s
r� �__main__z: z
cpuinfo data: z processorsrm zsmaps:
r� �( r z#x� r ZSize�
z
----------)3rt r r r� � functoolsr Z six.movesr Zprocfs.utilistr �VERSIONr r r rR rU rV r\ ri r� r
r� r� r� r� r� rL �sysZintsr1 r2 rB �printr� �or� r� r� r? �argvr� r� r� r� r[ r� r ZpsZcsZsleeprq r
r
r
r �<module> sj > Me *
.N.K B
*
procfs/__pycache__/__init__.cpython-36.opt-1.pyc 0000755 00000000574 14751155147 0015417 0 ustar 00 3
�{Me� � @ s d Z dZdZddlT ddlT dS )zp
Copyright (c) 2008, 2009 Red Hat Inc.
Abstractions to extract information from the Linux kernel /proc files.
z*Arnaldo Carvalho de Melo <acme@redhat.com>z
GPLv2 License� )�*N)�__doc__�
__author__Z __license__ZprocfsZutilist� r r � /usr/lib/python3.6/__init__.py�<module> s procfs/__pycache__/procfs.cpython-36.opt-1.pyc 0000755 00000107105 14751155147 0015152 0 ustar 00 3
�{Meʍ � @ s� d dl Z d dlZd dlZd dlZd dlmZ d dlmZ d dlm Z dZ
dd� Z dd � Z G d
d � d �Z
d d
� Zdd� ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� d�ZG dd� d�ZG d d � d �ZG d d � d �ZG d d!� d!�ZG d"d#� d#�Zed$k�r�d dlZe� Z x0e e jj � �D ] Z e e � d%e je � �� �q*W e� Z!x0e e!j!j � �D ] Z"e e"� d%e!j!e" � �� �qbW e� Z#e d&e#j$� d'�� x,e e#j � �D ] Z%e e%� d(e#e% � �� �q�W e d)d*d+ � ee&ej'd, ��Z(x8ee(j)�D ]*Z e e(j*e j+d-�d.e(j*e j,� �� �q�W e d*d+ � x&e(j-ej'd/ �D ]Z.e e.d0 � �qDW e� Z/e e/d, � e� Z0xFej1d,� e0j2� x$e0D ] Z#e e#� d%e0e# � �� �q�W e d2� �qtW dS )3� N)�reduce)�range)� bitmasklistz0.7.3c C s t j� } ttjd| ��S )z) Return True if running on s390 or s390x Zs390)�platform�machine�bool�re�search)r � r
� /usr/lib/python3.6/procfs.py�is_s390 s r c C s: | d r t dd� | d �j� S y | d d S dS dS )z�
Returns the process command line, if available in the given `process' class,
if not available, falls back to using the comm (short process name) in its
pidstat key.
�cmdlinec S s | d| S )Nz %sr
)�a�br
r
r �<lambda>! s z!process_cmdline.<locals>.<lambda>�stat�commN)r �strip)Zpid_infor
r
r �process_cmdline s r c + @ sN e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZdZdZdZdZdZdZdZdZdZdZdZdZ dZ dZ dZ d Z d Z!d Z"d Z#d Z$d Z%d!Z&d!Z'd"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLg+Z(dcdNdO�Z)dPdQ� Z*dRdS� Z+dTdU� Z,dVdW� Z-dXdY� Z.dZd[� Z/ddd\d]�Z0d^d_� Z1d`da� Z2dbS )e�pidstatam
Provides a dictionary to access the fields in the
per process /proc/PID/stat files.
One can obtain the available fields by asking for the keys of the
dictionary, e.g.:
>>> p = procfs.pidstat(1)
>>> print p.keys()
['majflt', 'rss', 'cnswap', 'cstime', 'pid', 'session', 'startstack', 'startcode', 'cmajflt', 'blocked', 'exit_signal', 'minflt', 'nswap', 'environ', 'priority', 'state', 'delayacct_blkio_ticks', 'policy', 'rt_priority', 'ppid', 'nice', 'cutime', 'endcode', 'wchan', 'num_threads', 'sigcatch', 'comm', 'stime', 'sigignore', 'tty_nr', 'kstkeip', 'utime', 'tpgid', 'itrealvalue', 'kstkesp', 'rlim', 'signal', 'pgrp', 'flags', 'starttime', 'cminflt', 'vsize', 'processor']
And then access the various process properties using it as a dictionary:
>>> print p['comm']
systemd
>>> print p['priority']
20
>>> print p['state']
S
Please refer to the 'procfs(5)' man page, by using:
$ man 5 procfs
To see information for each of the above fields, it is part of the
'man-pages' RPM package.
� � � � � � �@ � � i i i i i i @ i � i i i i i i i @ i � i i i i i i i @l �pidr �stateZppidZpgrpZsessionZtty_nrZtpgid�flagsZminfltZcminfltZmajfltZcmajflt�utimeZstimeZcutimeZcstimeZpriority�niceZ num_threadsZ itrealvalueZ starttimeZvsizeZrssZrlimZ startcodeZendcodeZ
startstackZkstkespZkstkeip�signalZblockedZ sigignoreZsigcatchZwchanZnswapZcnswapZ exit_signal� processor� rt_priorityZpolicyZdelayacct_blkio_ticks�environ�/procc C s0 || _ y| j|� W n tk
r* � Y nX d S )N)r �load�FileNotFoundError)�selfr �basedirr
r
r �__init__~ s
zpidstat.__init__c C s
| j | S )N)�fields)r+ � fieldnamer
r
r � __getitem__� s zpidstat.__getitem__c C s t | jj� �S )N)�listr. �keys)r+ r
r
r r2 � s z pidstat.keysc C s t | jj� �S )N)r1 r. �values)r+ r
r
r r3 � s zpidstat.valuesc C s
|| j kS )N)r. )r+ r/ r
r
r �has_key� s zpidstat.has_keyc C s | j S )N)r. )r+ r
r
r �items� s z
pidstat.itemsc C s
|| j kS )N)r. )r+ r/ r
r
r � __contains__� s zpidstat.__contains__c C s� yt |� d| j� d��}W n tk
r0 � Y nX |j� j� jd�}|j� |d jd�|d j� }i | _tt |�t | j
��}xft |�D ]Z}| j
| }|| }|dkr�|jd�| jd< q�yt |�| j|< W q� || j|< Y q�X q�W d S ) N�/z/statz) r z (r r z())
�openr r* �readliner �split�closer. �min�len�proc_stat_fieldsr �int)r+ r, �fr. � nr_fields�iZattrname�valuer
r
r r) � s$
z pidstat.loadc C s t | jd | j@ �S )z�
Returns true if this process has a fixed smp affinity mask,
not allowing it to be moved to a different set of CPUs.
r! )r r. �PF_THREAD_BOUND)r+ r
r
r �is_bound_to_cpu� s zpidstat.is_bound_to_cpuc C sN g }xDt | �D ]8}|dd� dkr$qt| |�}|| jd @ r|j|� qW |S )a�
Returns a list with all the process flags known, details depend
on kernel version, declared in the file include/linux/sched.h in
the kernel sources.
As of v4.2-rc7 these include (from include/linux/sched.h comments):
PF_EXITING Getting shut down
PF_EXITPIDONE Pi exit done on shut down
PF_VCPU I'm a virtual CPU
PF_WQ_WORKER I'm a workqueue worker
PF_FORKNOEXEC Forked but didn't exec
PF_MCE_PROCESS Process policy on mce errors
PF_SUPERPRIV Used super-user privileges
PF_DUMPCORE Dumped core
PF_SIGNALED Killed by a signal
PF_MEMALLOC Allocating memory
PF_NPROC_EXCEEDED Set_user noticed that RLIMIT_NPROC was exceeded
PF_USED_MATH If unset the fpu must be initialized before use
PF_USED_ASYNC Used async_schedule*(), used by module init
PF_NOFREEZE This thread should not be frozen
PF_FROZEN Frozen for system suspend
PF_FSTRANS Inside a filesystem transaction
PF_KSWAPD I am kswapd
PF_MEMALLOC_NOIO Allocating memory without IO involved
PF_LESS_THROTTLE Throttle me less: I clean memory
PF_KTHREAD I am a kernel thread
PF_RANDOMIZE Randomize virtual address space
PF_SWAPWRITE Allowed to write to swap
PF_NO_SETAFFINITY Userland is not allowed to meddle with cpus_allowed
PF_MCE_EARLY Early kill for mce process policy
PF_MUTEX_TESTER Thread belongs to the rt mutex tester
PF_FREEZER_SKIP Freezer should not count it as freezable
PF_SUSPEND_TASK This thread called freeze_processes and
should not be frozen
N� ZPF_r! )�dir�getattrr. �append)r+ Zsflags�attrrC r
r
r �
process_flags� s &
zpidstat.process_flagsN)r( )r( )3�__name__�
__module__� __qualname__�__doc__Z PF_ALIGNWARNZ PF_STARTINGZ
PF_EXITINGZ
PF_EXITPIDONEZPF_VCPUZ PF_WQ_WORKERZ
PF_FORKNOEXECZPF_MCE_PROCESSZ PF_SUPERPRIVZ PF_DUMPCOREZ PF_SIGNALEDZ PF_MEMALLOCZPF_NPROC_EXCEEDEDZ
PF_FLUSHERZ PF_USED_MATHZ
PF_USED_ASYNCZ PF_NOFREEZEZ PF_FROZENZ
PF_FSTRANSZ PF_KSWAPDZPF_MEMALLOC_NOIOZ
PF_SWAPOFFZPF_LESS_THROTTLEZ
PF_KTHREADZ PF_RANDOMIZEZ PF_SWAPWRITEZPF_SPREAD_PAGEZPF_SPREAD_SLABrD �PF_NO_SETAFFINITYZ PF_MCE_EARLYZ PF_MEMPOLICYZPF_MUTEX_TESTERZPF_FREEZER_SKIPZPF_FREEZER_NOSIGZPF_SUSPEND_TASKr> r- r0 r2 r3 r4 r5 r6 r) rE rK r
r
r
r r * st
r c
C s2 d}y t t| j| d d �|@ �S dS d S )Ni r r! T)r r? � processes)r+ r rP r
r
r �cannot_set_affinity� s rR c
C s8 d}y$t t| j| j| d d �|@ �S dS d S )Ni r r! T)r r? rQ �threads)r+ r �tidrP r
r
r �cannot_set_thread_affinity� s rU c @ sT e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
ddd�Z dS )� pidstatusa
Provides a dictionary to access the fields
in the per process /proc/PID/status files.
This provides additional information about processes and threads to
what can be obtained with the procfs.pidstat() class.
One can obtain the available fields by asking for the keys of the
dictionary, e.g.:
>>> import procfs
>>> p = procfs.pidstatus(1)
>>> print p.keys()
['VmExe', 'CapBnd', 'NSpgid', 'Tgid', 'NSpid', 'VmSize', 'VmPMD', 'ShdPnd', 'State', 'Gid', 'nonvoluntary_ctxt_switches', 'SigIgn', 'VmStk', 'VmData', 'SigCgt', 'CapEff', 'VmPTE', 'Groups', 'NStgid', 'Threads', 'PPid', 'VmHWM', 'NSsid', 'VmSwap', 'Name', 'SigBlk', 'Mems_allowed_list', 'VmPeak', 'Ngid', 'VmLck', 'SigQ', 'VmPin', 'Mems_allowed', 'CapPrm', 'Seccomp', 'VmLib', 'Cpus_allowed', 'Uid', 'SigPnd', 'Pid', 'Cpus_allowed_list', 'TracerPid', 'CapInh', 'voluntary_ctxt_switches', 'VmRSS', 'FDSize']
>>> print p["Pid"]
1
>>> print p["Threads"]
1
>>> print p["VmExe"]
1248 kB
>>> print p["Cpus_allowed"]
f
>>> print p["SigQ"]
0/30698
>>> print p["VmPeak"]
320300 kB
>>>
Please refer to the 'procfs(5)' man page, by using:
$ man 5 procfs
To see information for each of the above fields, it is part of the
'man-pages' RPM package.
In the man page there will be references to further documentation, like
referring to the "getrlimit(2)" man page when explaining the "SigQ"
line/field.
�/procc C s || _ | j|� d S )N)r r) )r+ r r, r
r
r r- ! s zpidstatus.__init__c C s
| j | S )N)r. )r+ r/ r
r
r r0 % s zpidstatus.__getitem__c C s t | jj� �S )N)r1 r. r2 )r+ r
r
r r2 ( s zpidstatus.keysc C s t | jj� �S )N)r1 r. r3 )r+ r
r
r r3 + s zpidstatus.valuesc C s
|| j kS )N)r. )r+ r/ r
r
r r4 . s zpidstatus.has_keyc C s | j S )N)r. )r+ r
r
r r5 1 s zpidstatus.itemsc C s
|| j kS )N)r. )r+ r/ r
r
r r6 4 s zpidstatus.__contains__c C s� i | _ t|� d| j� d���n}xf|j� D ]Z}|jd�}t|�dkrDq(|d }|d j� }yt|�| j |< W q( || j |< Y q(X q(W W d Q R X d S )Nr7 z/status�:r r r )r. r8 r � readlinesr: r= r r? )r+ r, r@ �liner. �namerC r
r
r r) 7 s
zpidstatus.loadN)rW )rW ) rL rM rN rO r- r0 r2 r3 r4 r5 r6 r) r
r
r
r rV � s &
rV c @ sR e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )�processa+
Information about a process with a given pid, provides a dictionary with
two entries, instances of different wrappers for /proc/ process related
meta files: "stat" and "status", see the documentation for procfs.pidstat
and procfs.pidstatus for further info about those classes.
�/procc C s || _ || _d S )N)r r, )r+ r r, r
r
r r- N s zprocess.__init__c C s� t | |�s�|dkrX|dkr t}nt}yt| ||| j| j�� W q� tk
rT � Y q�X nF|dkrj| j� n4|dkr|| j� n"|dkr�| j � n|dkr�| j
� t | |�S )Nr �statusr
rS �cgroupsr' )r r^ ) �hasattrr rV �setattrr r, r* � load_cmdline� load_threads� load_cgroups� load_environrH )r+ rJ Zsclassr
r
r r0 R s$
zprocess.__getitem__c C s
t | |�S )N)r` )r+ rJ r
r
r r4 j s zprocess.has_keyc C s
t | |�S )N)r` )r+ rJ r
r
r r6 m s zprocess.__contains__c C sv y>t d| j� d���"}|j� j� jd�d d� | _W d Q R X W n2 tk
rX d | _Y n tk
rp d | _Y nX d S )Nz/proc/z/cmdline� r ���)r8 r r9 r r: r
r* �UnicodeDecodeError)r+ r@ r
r
r rb p s *
zprocess.load_cmdlinec C s" t d| j� d��| _| j| j= d S )Nz/proc/z/task/)�pidstatsr rS )r+ r
r
r rc { s zprocess.load_threadsc C st d| _ td| j� d���R}xJt|j� �D ]:}t| j �dkrT| j d |d d� | _ q(|d d� | _ q(W W d Q R X d S ) N� z/proc/z/cgroupr �,r rg rg )r_ r8 r �reversedrY r= )r+ r@ rZ r
r
r rd � s zprocess.load_cgroupsc C sh i | _ td| j� d���F}x>|j� jd�D ],}t|�dkr*|jd�}|d | j |d < q*W W dQ R X dS )aD
Loads the environment variables for this process. The entries then
become available via the 'environ' member, or via the 'environ'
dict key when accessing as p["environ"].
E.g.:
>>> all_processes = procfs.pidstats()
>>> firefox_pid = all_processes.find_by_name("firefox")
>>> firefox_process = all_processes[firefox_pid[0]]
>>> print firefox_process["environ"]["PWD"]
/home/acme
>>> print len(firefox_process.environ.keys())
66
>>> print firefox_process["environ"]["SHELL"]
/bin/bash
>>> print firefox_process["environ"]["USERNAME"]
acme
>>> print firefox_process["environ"]["HOME"]
/home/acme
>>> print firefox_process["environ"]["MAIL"]
/var/spool/mail/acme
>>>
z/proc/z/environrf r �=r N)r' r8 r r9 r: r= )r+ r@ �x�yr
r
r re � s
zprocess.load_environN)r] ) rL rM rN rO r- r0 r4 r6 rb rc rd re r
r
r
r r\ F s
r\ c @ s� e Zd ZdZd$dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#S )%ri a#
Provides access to all the processes in the system, to get a picture of
how many processes there are at any given moment.
The entries can be accessed as a dictionary, keyed by pid. Also there are
methods to find processes that match a given COMM or regular expression.
�/procc C s || _ i | _| j� d S )N)r, rQ �reload)r+ r, r
r
r r- � s zpidstats.__init__c C s
| j | S )N)rQ )r+ �keyr
r
r r0 � s zpidstats.__getitem__c C s y | j |= W n Y nX d S )N)rQ )r+ rr r
r
r � __delitem__� s zpidstats.__delitem__c C s t | jj� �S )N)r1 rQ r2 )r+ r
r
r r2 � s z
pidstats.keysc C s t | jj� �S )N)r1 rQ r3 )r+ r
r
r r3 � s zpidstats.valuesc C s
|| j kS )N)rQ )r+ rr r
r
r r4 � s zpidstats.has_keyc C s | j S )N)rQ )r+ r
r
r r5 � s zpidstats.itemsc C s
|| j kS )N)rQ )r+ rr r
r
r r6 � s zpidstats.__contains__c
C sV | ` i | _ tj| j�}x:|D ]2}y t|�}W n w Y nX t|| j�| j |< q W dS )a'
This operation will throw away the current dictionary contents,
if any, and read all the pid files from /proc/, instantiating a
'process' instance for each of them.
This is a high overhead operation, and should be avoided if the
perf python binding can be used to detect when new threads appear
and existing ones terminate.
In RHEL it is found in the python-perf rpm package.
More information about the perf facilities can be found in the
'perf_event_open' man page.
N)rQ �os�listdirr, r? r\ )r+ �pidsZspidr r
r
r rq � s
zpidstats.reloadc C sh g }xHt | jj� �D ]6}y| j| j� W q tk
rH |j|� Y qX qW x|D ] }| j|= qTW d S )N)r1 rQ r2 rc �OSErrorrI )r+ Z to_remover r
r
r �reload_threads� s
zpidstats.reload_threadsc C sn |d d� }g }xXt | jj� �D ]F}y$|| j| d d krF|j|� W q tk
rd | j|= Y q X q W |S )N� r r )r1 rQ r2 rI �IOError)r+ r[ rv r r
r
r � find_by_name� s zpidstats.find_by_namec C sd g }xZt | jj� �D ]H}y&|j| j| d d �r<|j|� W q tk
rZ | j|= Y qX qW |S )Nr r )r1 rQ r2 �matchrI rz )r+ �regexrv r r
r
r �
find_by_regex s zpidstats.find_by_regexc C s` g }xVt | jj� �D ]D}y"|jt| j| ��r8|j|� W q tk
rV | j|= Y qX qW |S )N)r1 rQ r2 r| r rI rz )r+ r} rv r r
r
r �find_by_cmdline_regex s z pidstats.find_by_cmdline_regexc s� d}d}g � x�|� d|� �}| j |�}| sFt� fdd�|D ��dkrHP xF|D ]>}y || j| d d � 7 }W qN tk
r� | j|= Y qNX qNW � |7 � |d7 }qW |jd �}|S )
Nr rj r7 c s g | ]}|� kr|�qS r
r
)�.0�n)�processed_pidsr
r �
<listcomp>' s z0pidstats.get_per_cpu_rtprios.<locals>.<listcomp>r r& r rk )r{ r= rQ rz r )r+ �basename�cpu�
prioritiesr[ rv r r
)r� r �get_per_cpu_rtprios s"
z pidstats.get_per_cpu_rtpriosc s� d}d}g � x�| j |�}| s8t� fdd�|D ��dkr:P xF|D ]>}y || j| d d � 7 }W q@ tk
r| | j|= Y q@X q@W � |7 � |d7 }qW |jd�}|S ) Nr rj c s g | ]}|� kr|�qS r
r
)r� r� )r� r
r r� = s z(pidstats.get_rtprios.<locals>.<listcomp>r r& r rk )r{ r= rQ rz r )r+ r[ r� r� rv r r
)r� r � get_rtprios7 s
zpidstats.get_rtpriosc C s | j | d j� S )zQ
Checks if a given pid can't have its SMP affinity mask changed.
r )rQ rE )r+ r r
r
r rE M s zpidstats.is_bound_to_cpuN)rp )rL rM rN rO r- r0 rs r2 r3 r4 r5 r6 rq rx r{ r~ r r� r� rE r
r
r
r ri � s"
ri c @ sp e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS )�
interruptsam
Information about IRQs in the system. A dictionary keyed by IRQ number
will have as its value another dictionary with "cpu", "type" and "users"
keys, with the SMP affinity mask, type of IRQ and the drivers associated
with each interrupt.
The information comes from the /proc/interrupts file, documented in
'man procfs(5)', for instance, the 'cpu' dict is an array with one entry
per CPU present in the sistem, each value being the number of interrupts
that took place per CPU.
E.g.:
>>> import procfs
>>> interrupts = procfs.interrupts()
>>> thunderbolt_irq = interrupts.find_by_user("thunderbolt")
>>> print thunderbolt_irq
34
>>> thunderbolt = interrupts[thunderbolt_irq]
>>> print thunderbolt
{'affinity': [0, 1, 2, 3], 'type': 'PCI-MSI', 'cpu': [3495, 0, 81, 0], 'users': ['thunderbolt']}
>>>
c C s i | _ | j� d S )N)r� rq )r+ r
r
r r- m s zinterrupts.__init__c C s | j t|� S )N)r� �str)r+ rr r
r
r r0 q s zinterrupts.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 t s zinterrupts.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 w s zinterrupts.valuesc C s t |�| jkS )N)r� r� )r+ rr r
r
r r4 z s zinterrupts.has_keyc C s | j S )N)r� )r+ r
r
r r5 } s zinterrupts.itemsc C s t |�| jkS )N)r� r� )r+ rr r
r
r r6 � s zinterrupts.__contains__c C s� | ` i | _ td���}x�|j� D ]�}|j� }|j� }|d d d� dkrRt|�| _q |d jd�}i | j |< | j|dd � |�| j |< y t|�}W n w Y nX | j |�| j | d< q W W d Q R X d S )Nz/proc/interruptsr rF ZCPUrX r Zaffinity)
r� r8 rY r r: r= �nr_cpus� parse_entryr? �parse_affinity)r+ r@ rZ r. �irqZnirqr
r
r rq � s"
zinterrupts.reloadc C s� i }g |d< |d j t|d �� t|�}|| jkr�|d dd� |d| j� D �7 < || jkr�|| j |d< || jd kr�dd� ||d jd�D �|d < ng |d < |S )
Nr� r c S s g | ] }t |��qS r
)r? )r� rB r
r
r r� � s z*interrupts.parse_entry.<locals>.<listcomp>r �typec S s g | ] }|j � �qS r
)r )r� r r
r
r r� � s rk �users)rI r? r= r� r: )r+ r. rZ �dictrA r
r
r r� � s
$
zinterrupts.parse_entryc C sL y0t d|� d���}|j� }W d Q R X t|| j�S tk
rF dgS X d S )Nz
/proc/irq/z
/smp_affinityr )r8 r9 r r� rz )r+ r� r@ rZ r
r
r r� � s zinterrupts.parse_affinityc C s@ x:t | jj� �D ](}d| j| kr|| j| d kr|S qW dS )a�
Looks up a interrupt number by the name of one of its users"
E.g.:
>>> import procfs
>>> interrupts = procfs.interrupts()
>>> thunderbolt_irq = interrupts.find_by_user("thunderbolt")
>>> print thunderbolt_irq
34
>>> thunderbolt = interrupts[thunderbolt_irq]
>>> print thunderbolt
{'affinity': [0, 1, 2, 3], 'type': 'PCI-MSI', 'cpu': [3495, 0, 81, 0], 'users': ['thunderbolt']}
>>>
r� N)r1 r� r2 )r+ �userrB r
r
r � find_by_user� s
zinterrupts.find_by_userc C s^ g }xTt | jj� �D ]B}d| j| kr(qx,| j| d D ]}|j|�r8|j|� P q8W qW |S )a�
Looks up a interrupt number by a regex that matches names of its users"
E.g.:
>>> import procfs
>>> import re
>>> interrupts = procfs.interrupts()
>>> usb_controllers = interrupts.find_by_user_regex(re.compile(".*hcd"))
>>> print usb_controllers
['22', '23', '31']
>>> print [ interrupts[irq]["users"] for irq in usb_controllers ]
[['ehci_hcd:usb4'], ['ehci_hcd:usb3'], ['xhci_hcd']]
>>>
r� )r1 r� r2 r| rI )r+ r} ZirqsrB r� r
r
r �find_by_user_regex� s
z interrupts.find_by_user_regexN)rL rM rN rO r- r0 r2 r3 r4 r5 r6 rq r� r� r� r� r
r
r
r r� T s r� c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )r
a9
Parses the kernel command line (/proc/cmdline), turning it into a dictionary."
Useful to figure out if some kernel boolean knob has been turned on,
as well as to find the value associated to other kernel knobs.
It can also be used to find out about parameters passed to the
init process, such as 'BOOT_IMAGE', etc.
E.g.:
>>> import procfs
>>> kcmd = procfs.cmdline()
>>> print kcmd.keys()
['LANG', 'BOOT_IMAGE', 'quiet', 'rhgb', 'rd.lvm.lv', 'ro', 'root']
>>> print kcmd["BOOT_IMAGE"]
/vmlinuz-4.3.0-rc1+
>>>
c C s i | _ | j� d S )N)�options�parse)r+ r
r
r r- � s zcmdline.__init__c C sj t d��X}xP|j� j� j� D ]<}|jd�}t|�dkrFd| j|d < q |d | j|d < q W W d Q R X d S )Nz
/proc/cmdlinerm r Tr )r8 r9 r r: r= r� )r+ r@ Zoptionr. r
r
r r� � s
z
cmdline.parsec C s
| j | S )N)r� )r+ rr r
r
r r0 s zcmdline.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 s z cmdline.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 s zcmdline.valuesc C s | j S )N)r� )r+ r
r
r r5
s z
cmdline.itemsN)
rL rM rN rO r- r� r0 r2 r3 r5 r
r
r
r r
� s r
c @ sB e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )�cpuinfoa�
Dictionary with information about CPUs in the system.
Please refer to 'man procfs(5)' for further information about the
'/proc/cpuinfo' file, that is the source of the information provided
by this class. The 'man lscpu(1)' also has information about a program that
uses the '/proc/cpuinfo' file.
Using this class one can obtain the number of CPUs in a system:
>>> cpus = procfs.cpuinfo()
>>> print cpus.nr_cpus
4
It is also possible to figure out aspects of the CPU topology, such as
how many CPU physical sockets exists, i.e. groups of CPUs sharing
components such as CPU memory caches:
>>> print len(cpus.sockets)
1
Additionally dictionary with information common to all CPUs in the system
is available:
>>> print cpus["model name"]
Intel(R) Core(TM) i7-3667U CPU @ 2.00GHz
>>> print cpus["cache size"]
4096 KB
>>>
�
/proc/cpuinfoc C s i | _ d| _g | _| j|� d S )Nr )�tagsr� �socketsr� )r+ �filenamer
r
r r- . s zcpuinfo.__init__c C s | j |j� S )N)r� �lower)r+ rr r
r
r r0 4 s zcpuinfo.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 7 s z cpuinfo.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 : s zcpuinfo.valuesc C s | j S )N)r� )r+ r
r
r r5 = s z
cpuinfo.itemsc C s( t |���}x�|j� D ]�}|j� }|s&q|jd�}|d j� j� }|dkrX| jd7 _qt� rv|dkrv| jd7 _q|dkr�q|d j� | j|< |dkr| j| }|| jkr| jj |� qW W d Q R X | jr�t
| j�p�| jd| jkr�t | jd �p�d | _ d | jk�rt | jd ��pd| j | _
d S )
NrX r r% r z
cpu numberzcore idz physical idZsiblingsz cpu cores)r8 rY r r: r� r� r r� r� rI r= r? Z
nr_socketsZnr_cores)r+ r� r@ rZ r. ZtagnameZ socket_idr
r
r r� @ s2
z
cpuinfo.parseN)r� )
rL rM rN rO r- r0 r2 r3 r5 r� r
r
r
r r� s
r� c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd S )
� smaps_libat
Representation of an mmap in place for a process. Can be used to figure
out which processes have an library mapped, etc.
The 'perm' member can be used to figure out executable mmaps,
i.e. libraries.
The 'vm_start' and 'vm_end' in turn can be used when trying to resolve
processor instruction pointer addresses to a symbol name in a library.
c
C s� |d j � }dd� |d j d�D �\| _| _|d | _t|d d�| _|d j d �\| _| _t|d
�| _t |�d kr�|d | _
nd | _
i | _ x^|dd � D ]N}|j � }|d d d � j � }yt|d �| j |< W q� || j |< Y q�X q�W d S )
Nr c S s g | ]}t |d ��qS )r )r? )r� r r
r
r r� j s z&smaps_lib.__init__.<locals>.<listcomp>�-r r r rF rX r � rg )
r: �vm_startZvm_endZpermsr? �offset�major�minor�inoder= r[ r� r� )r+ �linesr. rZ �tagr
r
r r- h s"
zsmaps_lib.__init__c C s | j |j� S )N)r� r� )r+ rr r
r
r r0 } s zsmaps_lib.__getitem__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 � s zsmaps_lib.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 � s zsmaps_lib.valuesc C s | j S )N)r� )r+ r
r
r r5 � s zsmaps_lib.itemsN) rL rM rN rO r- r0 r2 r3 r5 r
r
r
r r� \ s
r� c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )�smapsa~
List of libraries mapped by a process. Parses the lines in
the /proc/PID/smaps file, that is further documented in the
procfs(5) man page.
Example: Listing the executable maps for the 'sshd' process:
>>> import procfs
>>> processes = procfs.pidstats()
>>> sshd = processes.find_by_name("sshd")
>>> sshd_maps = procfs.smaps(sshd[0])
>>> for i in range(len(sshd_maps)):
... if 'x' in sshd_maps[i].perms:
... print "%s: %s" % (sshd_maps[i].name, sshd_maps[i].perms)
...
/usr/sbin/sshd: r-xp
/usr/lib64/libnss_files-2.20.so: r-xp
/usr/lib64/librt-2.20.so: r-xp
/usr/lib64/libkeyutils.so.1.5: r-xp
/usr/lib64/libkrb5support.so.0.1: r-xp
/usr/lib64/libfreebl3.so: r-xp
/usr/lib64/libpthread-2.20.so: r-xp
...
c C s || _ g | _| j� d S )N)r �entriesrq )r+ r r
r
r r- � s zsmaps.__init__c C sx g }|s|j � j� }|s d S |j|� x<|j � }|s6P |j� }|j� d d dkr^|j|� q(P q(W | jjt|�� |S )Nr r rX rg )r9 r rI r: r� r� )r+ r@ rZ r� r
r
r r� � s
zsmaps.parse_entryc C s
t | j�S )N)r= r� )r+ r
r
r �__len__� s z
smaps.__len__c C s
| j | S )N)r� )r+ �indexr
r
r r0 � s zsmaps.__getitem__c
C sJ d }t d| j� d��� }x| j||�}|sP qW W d Q R X t| j�| _d S )Nz/proc/z/smaps)r8 r r� r= r� �
nr_entries)r+ rZ r@ r
r
r rq � s z smaps.reloadc C sN g }xDt | j�D ]6}| j| jr| j| jj|�dkr|j| j| � qW |S )Nr )r r� r� r[ �findrI )r+ Zfragment�resultrB r
r
r �find_by_name_fragment� s zsmaps.find_by_name_fragmentN)
rL rM rN rO r- r� r� r0 rq r� r
r
r
r r� � s r� c @ s e Zd ZdZdd� Zdd� ZdS )�cpustatz�
CPU statistics, obtained from a line in the '/proc/stat' file, Please
refer to 'man procfs(5)' for further information about the '/proc/stat'
file, that is the source of the information provided by this class.
c C st |d | _ dd� |dd� D �\| _| _| _| _| _| _| _t|�dkrpt |d �| _
t|�dkrpt |d �| _ d S )Nr c S s g | ] }t |��qS r
)r? )r� rB r
r
r r� � s z$cpustat.__init__.<locals>.<listcomp>r r � ) r[ r� r# �system�idle�iowaitr� �softirqr= r? �steal�guest)r+ r. r
r
r r- � s
2 zcpustat.__init__c C sx d| j � d| j� d| j� d| j� d| j� d| j� d| j� �}t| d�rV|d | j� �7 }t| d
�rp|d | j � �7 }|d S )
Nz< user: z, nice: z
, system: z, idle: z
, iowait: z, irq: z , softirq: r� z , steal: r� z , guest: �>)
r� r# r� r� r� r� r� r` r� r� )r+ �sr
r
r �__repr__� s <
zcpustat.__repr__N)rL rM rN rO r- r� r
r
r
r r� � s r� c @ sR e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )� cpusstatsaN
Dictionary with information about CPUs in the system. First entry in the
dictionary gives an aggregate view of all CPUs, each other entry is about
separate CPUs. Please refer to 'man procfs(5)' for further information
about the '/proc/stat' file, that is the source of the information provided
by this class.
�
/proc/statc C s* i | _ d | _tjd�| _|| _| j� d S )Nr )r� �timert �sysconf�hertzr� rq )r+ r� r
r
r r- � s
zcpusstats.__init__c C s
t | j�S )N)�iterr� )r+ r
r
r �__iter__ s zcpusstats.__iter__c C s
| j | S )N)r� )r+ rr r
r
r r0 s zcpusstats.__getitem__c C s t t| jj� ��S )N)r= r1 r� r2 )r+ r
r
r r� s zcpusstats.__len__c C s t | jj� �S )N)r1 r� r2 )r+ r
r
r r2 s zcpusstats.keysc C s t | jj� �S )N)r1 r� r3 )r+ r
r
r r3 s zcpusstats.valuesc C s | j S )N)r� )r+ r
r
r r5 s zcpusstats.itemsc C s: | j }i | _ t| j��v}xn|j� D ]b}|j� j� }|d d d� j� dkrLq"t|�}|jdkrdd}nt |jdd � �d }|| j |< q"W W d Q R X | j
}t
j
� | _
|�r6| j
| }|| j } xxt | j j
� �D ]f}
|
|kr�d| _q�| j |
} ||
} | j| j | j| j | j| j }
|
| d | _t| jd�| _q�W d S )Nr rF r� r �d )r� r8 r� rY r r: r� r� r[ r? r� r� r1 r2 Zusager� r# r� r< )r+ Z last_entriesr@ rZ r. �c�idxZ last_timeZ delta_secZ interval_hzr� Zcurr�prevZdeltar
r
r rq s6
zcpusstats.reloadN)r� ) rL rM rN rO r- r� r0 r� r2 r3 r5 rq r
r
r
r r� � s
r� �__main__z: z
cpuinfo data: z processorsrm zsmaps:
r� �( r z#x� r ZSize�
z
----------)3rt r r r� � functoolsr Z six.movesr Zprocfs.utilistr �VERSIONr r r rR rU rV r\ ri r� r
r� r� r� r� r� rL �sysZintsr1 r2 rB �printr� �or� r� r� r? �argvr� r� r� r� r[ r� r ZpsZcsZsleeprq r
r
r
r �<module> sj > Me *
.N.K B
*
procfs/__pycache__/utilist.cpython-36.pyc 0000755 00000001417 14751155147 0014413 0 ustar 00 3
�{Mew � @ s d dl mZ dd� Zdd� ZdS )� )�rangec C sv g }d}d}xHt |�D ]<}|| kr.|d|> O }|d7 }|dkrd}|jd|� d}qW |dk rr|dkrr|jd|� |S )Nr � � )r �insert)�l�
nr_entries�
hexbitmask�bit�mask�entry� r � /usr/lib/python3.6/utilist.pyr s r c C sl | j � jdd�}g }d}tt|d��dd � }x8t|�D ],}t|�d@ rR|j|� |d7 }||kr8P q8W |S )N�,� r � � r )�strip�replace�bin�int�reversed�append)�liner Zhexmask� bitmasklistr Zbitmask�ir r r
r s
r N)Z six.movesr r r r r r r
�<module> s easy_install.py 0000644 00000000176 14751155147 0007623 0 ustar 00 """Run the EasyInstall command"""
if __name__ == '__main__':
from setuptools.command.easy_install import main
main()
python_linux_procfs-0.7.3-py3.6.egg-info/PKG-INFO 0000644 00000000536 14751155147 0015005 0 ustar 00 Metadata-Version: 1.0
Name: python-linux-procfs
Version: 0.7.3
Summary: Linux /proc abstraction classes
Home-page: http://userweb.kernel.org/python-linux-procfs
Author: Arnaldo Carvalho de Melo
Author-email: acme@redhat.com
License: GPLv2
Description: Abstractions to extract information from the Linux kernel /proc files.
Platform: UNKNOWN
python_linux_procfs-0.7.3-py3.6.egg-info/SOURCES.txt 0000644 00000000433 14751155147 0015570 0 ustar 00 pflags
setup.py
procfs/__init__.py
procfs/procfs.py
procfs/utilist.py
python_linux_procfs.egg-info/PKG-INFO
python_linux_procfs.egg-info/SOURCES.txt
python_linux_procfs.egg-info/dependency_links.txt
python_linux_procfs.egg-info/requires.txt
python_linux_procfs.egg-info/top_level.txt python_linux_procfs-0.7.3-py3.6.egg-info/top_level.txt 0000644 00000000007 14751155147 0016433 0 ustar 00 procfs
python_linux_procfs-0.7.3-py3.6.egg-info/dependency_links.txt 0000644 00000000001 14751155147 0017752 0 ustar 00
python_linux_procfs-0.7.3-py3.6.egg-info/requires.txt 0000644 00000000004 14751155147 0016276 0 ustar 00 six
syspurpose-1.28.40-py3.6.egg-info/SOURCES.txt 0000644 00000000575 14751155147 0014064 0 ustar 00 README.md
setup.cfg
setup.py
man/syspurpose.8
src/syspurpose/__init__.py
src/syspurpose/cli.py
src/syspurpose/files.py
src/syspurpose/i18n.py
src/syspurpose/main.py
src/syspurpose/utils.py
src/syspurpose.egg-info/PKG-INFO
src/syspurpose.egg-info/SOURCES.txt
src/syspurpose.egg-info/dependency_links.txt
src/syspurpose.egg-info/entry_points.txt
src/syspurpose.egg-info/top_level.txt syspurpose-1.28.40-py3.6.egg-info/PKG-INFO 0000644 00000000367 14751155147 0013274 0 ustar 00 Metadata-Version: 1.0
Name: syspurpose
Version: 1.28.40
Summary: Manage Red Hat System Purpose
Home-page: http://www.candlepinproject.org
Author: Chris Snyder
Author-email: chainsaw@redhat.com
License: GPLv2
Description: UNKNOWN
Platform: UNKNOWN
syspurpose-1.28.40-py3.6.egg-info/dependency_links.txt 0000644 00000000001 14751155147 0016237 0 ustar 00
syspurpose-1.28.40-py3.6.egg-info/entry_points.txt 0000644 00000000065 14751155147 0015470 0 ustar 00 [console_scripts]
syspurpose = syspurpose.main:main
syspurpose-1.28.40-py3.6.egg-info/top_level.txt 0000644 00000000013 14751155147 0014715 0 ustar 00 syspurpose
configobj-5.0.6-py3.6.egg-info 0000644 00000005722 14751155147 0011462 0 ustar 00 Metadata-Version: 1.1
Name: configobj
Version: 5.0.6
Summary: Config file reading, writing and validation.
Home-page: https://github.com/DiffSK/configobj
Author: Rob Dennis, Eli Courtwright (Michael Foord & Nicola Larosa original maintainers)
Author-email: rdennis+configobj@gmail.com, eli@courtwright.org, fuzzyman@voidspace.co.uk, nico@tekNico.net
License: UNKNOWN
Description: **ConfigObj** is a simple but powerful config file reader and writer: an *ini
file round tripper*. Its main feature is that it is very easy to use, with a
straightforward programmer's interface and a simple syntax for config files.
It has lots of other features though :
* Nested sections (subsections), to any level
* List values
* Multiple line values
* Full Unicode support
* String interpolation (substitution)
* Integrated with a powerful validation system
- including automatic type checking/conversion
- and allowing default values
- repeated sections
* All comments in the file are preserved
* The order of keys/sections is preserved
* Powerful ``unrepr`` mode for storing/retrieving Python data-types
| Release 5.0.6 improves error messages in certain edge cases
| Release 5.0.5 corrects a unicode-bug that still existed in writing files
| Release 5.0.4 corrects a unicode-bug that still existed in reading files after
| fixing lists of string in 5.0.3
| Release 5.0.3 corrects errors related to the incorrectly handling unicode
| encoding and writing out files
| Release 5.0.2 adds a specific error message when trying to install on
| Python versions older than 2.5
| Release 5.0.1 fixes a regression with unicode conversion not happening
| in certain cases PY2
| Release 5.0.0 updates the supported Python versions to 2.6, 2.7, 3.2, 3.3
| and is otherwise unchanged
| Release 4.7.2 fixes several bugs in 4.7.1
| Release 4.7.1 fixes a bug with the deprecated options keyword in
| 4.7.0.
| Release 4.7.0 improves performance adds features for validation and
| fixes some bugs.
Keywords: config,ini,dictionary,application,admin,sysadmin,configuration,validation
Platform: UNKNOWN
Classifier: Development Status :: 6 - Mature
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: BSD License
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 2
Classifier: Programming Language :: Python :: 2.6
Classifier: Programming Language :: Python :: 2.7
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.2
Classifier: Programming Language :: Python :: 3.3
Classifier: Operating System :: OS Independent
Classifier: Topic :: Software Development :: Libraries
Classifier: Topic :: Software Development :: Libraries :: Python Modules
appdirs-1.4.3.dist-info/RECORD 0000644 00000001261 14751155147 0011455 0 ustar 00 appdirs.py,sha256=MievUEuv3l_mQISH5SF0shDk_BNhHHzYiAPrT3ITN4I,24701
appdirs-1.4.3.dist-info/DESCRIPTION.rst,sha256=77Fe8OIOLSjDSNdLiL5xywMKO-AGE42rdXkqKo4Ee-k,7531
appdirs-1.4.3.dist-info/METADATA,sha256=0b4qJnCe47dSs3DnCEyiRjjem0za-TOoA6YmjOvxLg0,8831
appdirs-1.4.3.dist-info/RECORD,,
appdirs-1.4.3.dist-info/WHEEL,sha256=kdsN-5OJAZIiHN-iO4Rhl82KyS0bDWf4uBwMbkNafr8,110
appdirs-1.4.3.dist-info/metadata.json,sha256=pS8bByGso9wTgo8oC6prGmLOQ1fNH9QNW4Egsi9knSA,1434
appdirs-1.4.3.dist-info/top_level.txt,sha256=nKncE8CUqZERJ6VuQWL4_bkunSPDNfn7KZqb4Tr5YEM,8
appdirs-1.4.3.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
__pycache__/appdirs.cpython-36.pyc,,
appdirs-1.4.3.dist-info/DESCRIPTION.rst 0000644 00000016553 14751155147 0013103 0 ustar 00
.. image:: https://secure.travis-ci.org/ActiveState/appdirs.png
:target: http://travis-ci.org/ActiveState/appdirs
the problem
===========
What directory should your app use for storing user data? If running on Mac OS X, you
should use::
~/Library/Application Support/<AppName>
If on Windows (at least English Win XP) that should be::
C:\Documents and Settings\<User>\Application Data\Local Settings\<AppAuthor>\<AppName>
or possibly::
C:\Documents and Settings\<User>\Application Data\<AppAuthor>\<AppName>
for `roaming profiles <http://bit.ly/9yl3b6>`_ but that is another story.
On Linux (and other Unices) the dir, according to the `XDG
spec <http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html>`_, is::
~/.local/share/<AppName>
``appdirs`` to the rescue
=========================
This kind of thing is what the ``appdirs`` module is for. ``appdirs`` will
help you choose an appropriate:
- user data dir (``user_data_dir``)
- user config dir (``user_config_dir``)
- user cache dir (``user_cache_dir``)
- site data dir (``site_data_dir``)
- site config dir (``site_config_dir``)
- user log dir (``user_log_dir``)
and also:
- is a single module so other Python packages can include their own private copy
- is slightly opinionated on the directory names used. Look for "OPINION" in
documentation and code for when an opinion is being applied.
some example output
===================
On Mac OS X::
>>> from appdirs import *
>>> appname = "SuperApp"
>>> appauthor = "Acme"
>>> user_data_dir(appname, appauthor)
'/Users/trentm/Library/Application Support/SuperApp'
>>> site_data_dir(appname, appauthor)
'/Library/Application Support/SuperApp'
>>> user_cache_dir(appname, appauthor)
'/Users/trentm/Library/Caches/SuperApp'
>>> user_log_dir(appname, appauthor)
'/Users/trentm/Library/Logs/SuperApp'
On Windows 7::
>>> from appdirs import *
>>> appname = "SuperApp"
>>> appauthor = "Acme"
>>> user_data_dir(appname, appauthor)
'C:\\Users\\trentm\\AppData\\Local\\Acme\\SuperApp'
>>> user_data_dir(appname, appauthor, roaming=True)
'C:\\Users\\trentm\\AppData\\Roaming\\Acme\\SuperApp'
>>> user_cache_dir(appname, appauthor)
'C:\\Users\\trentm\\AppData\\Local\\Acme\\SuperApp\\Cache'
>>> user_log_dir(appname, appauthor)
'C:\\Users\\trentm\\AppData\\Local\\Acme\\SuperApp\\Logs'
On Linux::
>>> from appdirs import *
>>> appname = "SuperApp"
>>> appauthor = "Acme"
>>> user_data_dir(appname, appauthor)
'/home/trentm/.local/share/SuperApp
>>> site_data_dir(appname, appauthor)
'/usr/local/share/SuperApp'
>>> site_data_dir(appname, appauthor, multipath=True)
'/usr/local/share/SuperApp:/usr/share/SuperApp'
>>> user_cache_dir(appname, appauthor)
'/home/trentm/.cache/SuperApp'
>>> user_log_dir(appname, appauthor)
'/home/trentm/.cache/SuperApp/log'
>>> user_config_dir(appname)
'/home/trentm/.config/SuperApp'
>>> site_config_dir(appname)
'/etc/xdg/SuperApp'
>>> os.environ['XDG_CONFIG_DIRS'] = '/etc:/usr/local/etc'
>>> site_config_dir(appname, multipath=True)
'/etc/SuperApp:/usr/local/etc/SuperApp'
``AppDirs`` for convenience
===========================
::
>>> from appdirs import AppDirs
>>> dirs = AppDirs("SuperApp", "Acme")
>>> dirs.user_data_dir
'/Users/trentm/Library/Application Support/SuperApp'
>>> dirs.site_data_dir
'/Library/Application Support/SuperApp'
>>> dirs.user_cache_dir
'/Users/trentm/Library/Caches/SuperApp'
>>> dirs.user_log_dir
'/Users/trentm/Library/Logs/SuperApp'
Per-version isolation
=====================
If you have multiple versions of your app in use that you want to be
able to run side-by-side, then you may want version-isolation for these
dirs::
>>> from appdirs import AppDirs
>>> dirs = AppDirs("SuperApp", "Acme", version="1.0")
>>> dirs.user_data_dir
'/Users/trentm/Library/Application Support/SuperApp/1.0'
>>> dirs.site_data_dir
'/Library/Application Support/SuperApp/1.0'
>>> dirs.user_cache_dir
'/Users/trentm/Library/Caches/SuperApp/1.0'
>>> dirs.user_log_dir
'/Users/trentm/Library/Logs/SuperApp/1.0'
appdirs Changelog
=================
appdirs 1.4.3
-------------
- [PR #76] Python 3.6 invalid escape sequence deprecation fixes
- Fix for Python 3.6 support
appdirs 1.4.2
-------------
- [PR #84] Allow installing without setuptools
- [PR #86] Fix string delimiters in setup.py description
- Add Python 3.6 support
appdirs 1.4.1
-------------
- [issue #38] Fix _winreg import on Windows Py3
- [issue #55] Make appname optional
appdirs 1.4.0
-------------
- [PR #42] AppAuthor is now optional on Windows
- [issue 41] Support Jython on Windows, Mac, and Unix-like platforms. Windows
support requires `JNA <https://github.com/twall/jna>`_.
- [PR #44] Fix incorrect behaviour of the site_config_dir method
appdirs 1.3.0
-------------
- [Unix, issue 16] Conform to XDG standard, instead of breaking it for
everybody
- [Unix] Removes gratuitous case mangling of the case, since \*nix-es are
usually case sensitive, so mangling is not wise
- [Unix] Fixes the utterly wrong behaviour in ``site_data_dir``, return result
based on XDG_DATA_DIRS and make room for respecting the standard which
specifies XDG_DATA_DIRS is a multiple-value variable
- [Issue 6] Add ``*_config_dir`` which are distinct on nix-es, according to
XDG specs; on Windows and Mac return the corresponding ``*_data_dir``
appdirs 1.2.0
-------------
- [Unix] Put ``user_log_dir`` under the *cache* dir on Unix. Seems to be more
typical.
- [issue 9] Make ``unicode`` work on py3k.
appdirs 1.1.0
-------------
- [issue 4] Add ``AppDirs.user_log_dir``.
- [Unix, issue 2, issue 7] appdirs now conforms to `XDG base directory spec
<http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html>`_.
- [Mac, issue 5] Fix ``site_data_dir()`` on Mac.
- [Mac] Drop use of 'Carbon' module in favour of hardcoded paths; supports
Python3 now.
- [Windows] Append "Cache" to ``user_cache_dir`` on Windows by default. Use
``opinion=False`` option to disable this.
- Add ``appdirs.AppDirs`` convenience class. Usage:
>>> dirs = AppDirs("SuperApp", "Acme", version="1.0")
>>> dirs.user_data_dir
'/Users/trentm/Library/Application Support/SuperApp/1.0'
- [Windows] Cherry-pick Komodo's change to downgrade paths to the Windows short
paths if there are high bit chars.
- [Linux] Change default ``user_cache_dir()`` on Linux to be singular, e.g.
"~/.superapp/cache".
- [Windows] Add ``roaming`` option to ``user_data_dir()`` (for use on Windows only)
and change the default ``user_data_dir`` behaviour to use a *non*-roaming
profile dir (``CSIDL_LOCAL_APPDATA`` instead of ``CSIDL_APPDATA``). Why? Because
a large roaming profile can cause login speed issues. The "only syncs on
logout" behaviour can cause surprises in appdata info.
appdirs 1.0.1 (never released)
------------------------------
Started this changelog 27 July 2010. Before that this module originated in the
`Komodo <http://www.activestate.com/komodo>`_ product as ``applib.py`` and then
as `applib/location.py
<http://github.com/ActiveState/applib/blob/master/applib/location.py>`_ (used by
`PyPM <http://code.activestate.com/pypm/>`_ in `ActivePython
<http://www.activestate.com/activepython>`_). This is basically a fork of
applib.py 1.0.1 and applib/location.py 1.0.1.
appdirs-1.4.3.dist-info/METADATA 0000644 00000021177 14751155147 0011667 0 ustar 00 Metadata-Version: 2.0
Name: appdirs
Version: 1.4.3
Summary: A small Python module for determining appropriate platform-specific dirs, e.g. a "user data dir".
Home-page: http://github.com/ActiveState/appdirs
Author: Trent Mick
Author-email: trentm@gmail.com
Maintainer: Trent Mick; Sridhar Ratnakumar; Jeff Rouse
Maintainer-email: trentm@gmail.com; github@srid.name; jr@its.to
License: MIT
Keywords: application directory log cache user
Platform: UNKNOWN
Classifier: Development Status :: 4 - Beta
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 2
Classifier: Programming Language :: Python :: 2.6
Classifier: Programming Language :: Python :: 2.7
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.2
Classifier: Programming Language :: Python :: 3.3
Classifier: Programming Language :: Python :: 3.4
Classifier: Programming Language :: Python :: 3.5
Classifier: Programming Language :: Python :: 3.6
Classifier: Programming Language :: Python :: Implementation :: PyPy
Classifier: Programming Language :: Python :: Implementation :: CPython
Classifier: Topic :: Software Development :: Libraries :: Python Modules
.. image:: https://secure.travis-ci.org/ActiveState/appdirs.png
:target: http://travis-ci.org/ActiveState/appdirs
the problem
===========
What directory should your app use for storing user data? If running on Mac OS X, you
should use::
~/Library/Application Support/<AppName>
If on Windows (at least English Win XP) that should be::
C:\Documents and Settings\<User>\Application Data\Local Settings\<AppAuthor>\<AppName>
or possibly::
C:\Documents and Settings\<User>\Application Data\<AppAuthor>\<AppName>
for `roaming profiles <http://bit.ly/9yl3b6>`_ but that is another story.
On Linux (and other Unices) the dir, according to the `XDG
spec <http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html>`_, is::
~/.local/share/<AppName>
``appdirs`` to the rescue
=========================
This kind of thing is what the ``appdirs`` module is for. ``appdirs`` will
help you choose an appropriate:
- user data dir (``user_data_dir``)
- user config dir (``user_config_dir``)
- user cache dir (``user_cache_dir``)
- site data dir (``site_data_dir``)
- site config dir (``site_config_dir``)
- user log dir (``user_log_dir``)
and also:
- is a single module so other Python packages can include their own private copy
- is slightly opinionated on the directory names used. Look for "OPINION" in
documentation and code for when an opinion is being applied.
some example output
===================
On Mac OS X::
>>> from appdirs import *
>>> appname = "SuperApp"
>>> appauthor = "Acme"
>>> user_data_dir(appname, appauthor)
'/Users/trentm/Library/Application Support/SuperApp'
>>> site_data_dir(appname, appauthor)
'/Library/Application Support/SuperApp'
>>> user_cache_dir(appname, appauthor)
'/Users/trentm/Library/Caches/SuperApp'
>>> user_log_dir(appname, appauthor)
'/Users/trentm/Library/Logs/SuperApp'
On Windows 7::
>>> from appdirs import *
>>> appname = "SuperApp"
>>> appauthor = "Acme"
>>> user_data_dir(appname, appauthor)
'C:\\Users\\trentm\\AppData\\Local\\Acme\\SuperApp'
>>> user_data_dir(appname, appauthor, roaming=True)
'C:\\Users\\trentm\\AppData\\Roaming\\Acme\\SuperApp'
>>> user_cache_dir(appname, appauthor)
'C:\\Users\\trentm\\AppData\\Local\\Acme\\SuperApp\\Cache'
>>> user_log_dir(appname, appauthor)
'C:\\Users\\trentm\\AppData\\Local\\Acme\\SuperApp\\Logs'
On Linux::
>>> from appdirs import *
>>> appname = "SuperApp"
>>> appauthor = "Acme"
>>> user_data_dir(appname, appauthor)
'/home/trentm/.local/share/SuperApp
>>> site_data_dir(appname, appauthor)
'/usr/local/share/SuperApp'
>>> site_data_dir(appname, appauthor, multipath=True)
'/usr/local/share/SuperApp:/usr/share/SuperApp'
>>> user_cache_dir(appname, appauthor)
'/home/trentm/.cache/SuperApp'
>>> user_log_dir(appname, appauthor)
'/home/trentm/.cache/SuperApp/log'
>>> user_config_dir(appname)
'/home/trentm/.config/SuperApp'
>>> site_config_dir(appname)
'/etc/xdg/SuperApp'
>>> os.environ['XDG_CONFIG_DIRS'] = '/etc:/usr/local/etc'
>>> site_config_dir(appname, multipath=True)
'/etc/SuperApp:/usr/local/etc/SuperApp'
``AppDirs`` for convenience
===========================
::
>>> from appdirs import AppDirs
>>> dirs = AppDirs("SuperApp", "Acme")
>>> dirs.user_data_dir
'/Users/trentm/Library/Application Support/SuperApp'
>>> dirs.site_data_dir
'/Library/Application Support/SuperApp'
>>> dirs.user_cache_dir
'/Users/trentm/Library/Caches/SuperApp'
>>> dirs.user_log_dir
'/Users/trentm/Library/Logs/SuperApp'
Per-version isolation
=====================
If you have multiple versions of your app in use that you want to be
able to run side-by-side, then you may want version-isolation for these
dirs::
>>> from appdirs import AppDirs
>>> dirs = AppDirs("SuperApp", "Acme", version="1.0")
>>> dirs.user_data_dir
'/Users/trentm/Library/Application Support/SuperApp/1.0'
>>> dirs.site_data_dir
'/Library/Application Support/SuperApp/1.0'
>>> dirs.user_cache_dir
'/Users/trentm/Library/Caches/SuperApp/1.0'
>>> dirs.user_log_dir
'/Users/trentm/Library/Logs/SuperApp/1.0'
appdirs Changelog
=================
appdirs 1.4.3
-------------
- [PR #76] Python 3.6 invalid escape sequence deprecation fixes
- Fix for Python 3.6 support
appdirs 1.4.2
-------------
- [PR #84] Allow installing without setuptools
- [PR #86] Fix string delimiters in setup.py description
- Add Python 3.6 support
appdirs 1.4.1
-------------
- [issue #38] Fix _winreg import on Windows Py3
- [issue #55] Make appname optional
appdirs 1.4.0
-------------
- [PR #42] AppAuthor is now optional on Windows
- [issue 41] Support Jython on Windows, Mac, and Unix-like platforms. Windows
support requires `JNA <https://github.com/twall/jna>`_.
- [PR #44] Fix incorrect behaviour of the site_config_dir method
appdirs 1.3.0
-------------
- [Unix, issue 16] Conform to XDG standard, instead of breaking it for
everybody
- [Unix] Removes gratuitous case mangling of the case, since \*nix-es are
usually case sensitive, so mangling is not wise
- [Unix] Fixes the utterly wrong behaviour in ``site_data_dir``, return result
based on XDG_DATA_DIRS and make room for respecting the standard which
specifies XDG_DATA_DIRS is a multiple-value variable
- [Issue 6] Add ``*_config_dir`` which are distinct on nix-es, according to
XDG specs; on Windows and Mac return the corresponding ``*_data_dir``
appdirs 1.2.0
-------------
- [Unix] Put ``user_log_dir`` under the *cache* dir on Unix. Seems to be more
typical.
- [issue 9] Make ``unicode`` work on py3k.
appdirs 1.1.0
-------------
- [issue 4] Add ``AppDirs.user_log_dir``.
- [Unix, issue 2, issue 7] appdirs now conforms to `XDG base directory spec
<http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html>`_.
- [Mac, issue 5] Fix ``site_data_dir()`` on Mac.
- [Mac] Drop use of 'Carbon' module in favour of hardcoded paths; supports
Python3 now.
- [Windows] Append "Cache" to ``user_cache_dir`` on Windows by default. Use
``opinion=False`` option to disable this.
- Add ``appdirs.AppDirs`` convenience class. Usage:
>>> dirs = AppDirs("SuperApp", "Acme", version="1.0")
>>> dirs.user_data_dir
'/Users/trentm/Library/Application Support/SuperApp/1.0'
- [Windows] Cherry-pick Komodo's change to downgrade paths to the Windows short
paths if there are high bit chars.
- [Linux] Change default ``user_cache_dir()`` on Linux to be singular, e.g.
"~/.superapp/cache".
- [Windows] Add ``roaming`` option to ``user_data_dir()`` (for use on Windows only)
and change the default ``user_data_dir`` behaviour to use a *non*-roaming
profile dir (``CSIDL_LOCAL_APPDATA`` instead of ``CSIDL_APPDATA``). Why? Because
a large roaming profile can cause login speed issues. The "only syncs on
logout" behaviour can cause surprises in appdata info.
appdirs 1.0.1 (never released)
------------------------------
Started this changelog 27 July 2010. Before that this module originated in the
`Komodo <http://www.activestate.com/komodo>`_ product as ``applib.py`` and then
as `applib/location.py
<http://github.com/ActiveState/applib/blob/master/applib/location.py>`_ (used by
`PyPM <http://code.activestate.com/pypm/>`_ in `ActivePython
<http://www.activestate.com/activepython>`_). This is basically a fork of
applib.py 1.0.1 and applib/location.py 1.0.1.
appdirs-1.4.3.dist-info/WHEEL 0000644 00000000156 14751155147 0011345 0 ustar 00 Wheel-Version: 1.0
Generator: bdist_wheel (0.30.0)
Root-Is-Purelib: true
Tag: py2-none-any
Tag: py3-none-any
appdirs-1.4.3.dist-info/metadata.json 0000644 00000002632 14751155147 0013232 0 ustar 00 {"classifiers": ["Development Status :: 4 - Beta", "Intended Audience :: Developers", "License :: OSI Approved :: MIT License", "Operating System :: OS Independent", "Programming Language :: Python :: 2", "Programming Language :: Python :: 2.6", "Programming Language :: Python :: 2.7", "Programming Language :: Python :: 3", "Programming Language :: Python :: 3.2", "Programming Language :: Python :: 3.3", "Programming Language :: Python :: 3.4", "Programming Language :: Python :: 3.5", "Programming Language :: Python :: 3.6", "Programming Language :: Python :: Implementation :: PyPy", "Programming Language :: Python :: Implementation :: CPython", "Topic :: Software Development :: Libraries :: Python Modules"], "extensions": {"python.details": {"contacts": [{"email": "trentm@gmail.com", "name": "Trent Mick", "role": "author"}, {"email": "trentm@gmail.com; github@srid.name; jr@its.to", "name": "Trent Mick; Sridhar Ratnakumar; Jeff Rouse", "role": "maintainer"}], "document_names": {"description": "DESCRIPTION.rst"}, "project_urls": {"Home": "http://github.com/ActiveState/appdirs"}}}, "generator": "bdist_wheel (0.30.0)", "keywords": ["application", "directory", "log", "cache", "user"], "license": "MIT", "metadata_version": "2.0", "name": "appdirs", "summary": "A small Python module for determining appropriate platform-specific dirs, e.g. a \"user data dir\".", "test_requires": [{"requires": []}], "version": "1.4.3"} appdirs-1.4.3.dist-info/top_level.txt 0000644 00000000010 14751155147 0013275 0 ustar 00 appdirs
appdirs-1.4.3.dist-info/INSTALLER 0000644 00000000004 14751155147 0012026 0 ustar 00 pip
pyparsing-2.1.10.dist-info/METADATA 0000644 00000001617 14751155147 0012312 0 ustar 00 Metadata-Version: 2.1
Name: pyparsing
Version: 2.1.10
Summary: Python parsing module
Home-page: http://pyparsing.wikispaces.com/
Author: Paul McGuire
Author-email: ptmcg@users.sourceforge.net
License: MIT License
Download-URL: http://sourceforge.net/project/showfiles.php?group_id=97203
Platform: UNKNOWN
Classifier: Development Status :: 5 - Production/Stable
Classifier: Intended Audience :: Developers
Classifier: Intended Audience :: Information Technology
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python
Classifier: Programming Language :: Python :: 2.6
Classifier: Programming Language :: Python :: 2.7
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 3.3
Classifier: Programming Language :: Python :: 3.4
Classifier: Programming Language :: Python :: 3.5
UNKNOWN
pyparsing-2.1.10.dist-info/top_level.txt 0000644 00000000012 14751155147 0013725 0 ustar 00 pyparsing
pyparsing-2.1.10.dist-info/WHEEL 0000644 00000000156 14751155147 0011773 0 ustar 00 Wheel-Version: 1.0
Generator: bdist_wheel (0.31.1)
Root-Is-Purelib: true
Tag: py2-none-any
Tag: py3-none-any
pyparsing-2.1.10.dist-info/RECORD 0000644 00000001005 14751155147 0012077 0 ustar 00 pyparsing.py,sha256=PifeLY3-WhIcBVzLtv0U4T_pwDtPruBhBCkg5vLqa28,229867
pyparsing-2.1.10.dist-info/METADATA,sha256=9nn52Op3W0UI2og8TbACWXta1fMSoZ_jWFZEQqOd3S4,911
pyparsing-2.1.10.dist-info/RECORD,,
pyparsing-2.1.10.dist-info/WHEEL,sha256=gduuPyBvFJQSQ0zdyxF7k0zynDXbIbvg5ZBHoXum5uk,110
pyparsing-2.1.10.dist-info/top_level.txt,sha256=eUOjGzJVhlQ3WS2rFAy2mN3LX_7FKTM5GSJ04jfnLmU,10
pyparsing-2.1.10.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
__pycache__/pyparsing.cpython-36.pyc,,
pyparsing-2.1.10.dist-info/INSTALLER 0000644 00000000004 14751155147 0012454 0 ustar 00 pip
isc/__pycache__/checkds.cpython-36.pyc 0000644 00000010272 14751155147 0013600 0 ustar 00 3
��f& � @ sh d dl Z d dlZd dlZd dlmZmZ d dlmZmZ dZ G dd� d�Z
d
dd�Z d d
� Z d d � Z
dS )� N)�Popen�PIPE)�prefix�versionzdnssec-checkdsc @ sP e Zd Zddddd�ZdZdZdZdZdZdZ d Z
dd
d �Z d d
� Z dd� Z
dS )�SECRRzSHA-1zSHA-256ZGOSTzSHA-384)� � � � � �INNr c C s� |st �t|�tk r$|jd�j� }n|j� }t|�dk r<t �|r�d| _|j� | _|d j� j d�jd�}|j
� |jd�}|j
� xDt|�dkr�t|�dkr�|d |d kr�|dd � }|dd � }q�W |r�t �|j
� dj |�| _ | j d | j d | _
nd| _|d j� | _
|dd � }|d j� dk�rJ|d j� | _|dd � }n(t|d �| _|d j� | _|d d � }|d j� | jk�r�t d |d j� | jf ��tt|dd
� �\| _| _| _dj |d
d � �j� | _d S )N�ascii� �DLVr �.r �DSr �CH�HSr z%s does not match %sr
r )r r r )� Exception�type�str�decode�split�len�rrtype�lower�dlvname�strip�reverse�join�parent�rrname�upper�rrclass�int�ttl�map�keyid�keyalg�hashalg�digest)�selfZrrtextr Zfieldsr �dlv� r- � /usr/lib/python3.6/checkds.py�__init__$ sH
* zSECRR.__init__c C s$ d| j | j| j| j| j| j| jf S )Nz%s %s %s %d %d %d %s)r! r# r r' r( r) r* )r+ r- r- r. �__repr__S s zSECRR.__repr__c C s | j � |j � kS )N)r0 )r+ �otherr- r- r. �__eq__X s z SECRR.__eq__)N)�__name__�
__module__� __qualname__�hashalgsr! r# r' r( r) r* r% r/ r0 r2 r- r- r- r. r s
/r c
C s& g }|j ddd|rdndd|r*| d | n| g}t|td�j� \}}x6|j� D ]*}t|�tk rh|jd �}|jt ||�� qNW t
|d
d � d �}g } |r�|j d
|g}|r�|d|g7 }|j| � t|td�j� \}}ndt|j ddddd| gtd�j� \}
}|j d
dg}|�r|d|g7 }|j| � t|ttd�j|
�\}}x:|j� D ].}t|�tk �rZ|jd �}| jt ||�� �q>W t | �dk �r�t
d� dS d} xv| D ]n} | |k�r�t
d| j| jjd�| j| jt j| j f � d} n,t
d| j| jjd�| j| jt j| j f � �q�W | �s"t
d|�rdnd � | S )Nz+noallz+answerz-tr, Zdsz-qr )�stdoutr
c S s | j | j| jfS )N)r' r( r) )�rrr- r- r. �<lambda>m s zcheck.<locals>.<lambda>)�keyz-fz-lZdnskey�-)�stdinr7 r z$No DNSKEY records found in zone apexFz,%s for KSK %s/%03d/%05d (%s) found in parentTz0%s for KSK %s/%03d/%05d (%s) missing from parentz'No %s records were found for any DNSKEYr r )�digr r Z communicate�
splitlinesr r r �appendr �sorted� dsfromkeyr �printr r! r r( r' r6 r) )
�zone�args�
masterfile� lookasideZrrlist�cmd�fp�_�lineZklistZintods�foundr8 r- r- r. �checkc sV
rL c C s� t jtd d�} d}tjdkr"dnd}| jdtdd� | jd d
d td d
� | jdddtdd
� | jdddtjjt |�d�tdd� | jdddtjjt |�d�tdd� | jd d d t
d � | j � }|j j
d �|_ |jr�|jj
d �|_|S )!Nz: checks DS coverage)� description�bin�ntZsbinrC z
zone to check)r �helpz-fz--filerE zzone master file)�destr rP z-lz --lookasiderF zDLV lookaside zonez-dz--digr= z
path to 'dig')rQ �defaultr rP z-Dz --dsfromkeyrA zdnssec-dsfromkeyzpath to 'dnssec-dsfromkey'z-vz --versionr )�actionr r )�argparse�ArgumentParser�prog�os�name� add_argumentr �pathr r r �
parse_argsrC r rF )�parserZbindirZsbindirrD r- r- r. r[ � s,
r[ c C s. t � } t| j| | j| j�}t|r$dnd� d S )Nr r )r[ rL rC rE rF �exit)rD rK r- r- r. �main� s r^ )NN)rT rW �sys�
subprocessr r Z isc.utilsr r rV r rL r[ r^ r- r- r- r. �<module> s I
; isc/__pycache__/checkds.cpython-36.opt-1.pyc 0000644 00000010272 14751155147 0014537 0 ustar 00 3
��f& � @ sh d dl Z d dlZd dlZd dlmZmZ d dlmZmZ dZ G dd� d�Z
d
dd�Z d d
� Z d d � Z
dS )� N)�Popen�PIPE)�prefix�versionzdnssec-checkdsc @ sP e Zd Zddddd�ZdZdZdZdZdZdZ d Z
dd
d �Z d d
� Z dd� Z
dS )�SECRRzSHA-1zSHA-256ZGOSTzSHA-384)� � � � � �INNr c C s� |st �t|�tk r$|jd�j� }n|j� }t|�dk r<t �|r�d| _|j� | _|d j� j d�jd�}|j
� |jd�}|j
� xDt|�dkr�t|�dkr�|d |d kr�|dd � }|dd � }q�W |r�t �|j
� dj |�| _ | j d | j d | _
nd| _|d j� | _
|dd � }|d j� dk�rJ|d j� | _|dd � }n(t|d �| _|d j� | _|d d � }|d j� | jk�r�t d |d j� | jf ��tt|dd
� �\| _| _| _dj |d
d � �j� | _d S )N�ascii� �DLVr �.r �DSr �CH�HSr z%s does not match %sr
r )r r r )� Exception�type�str�decode�split�len�rrtype�lower�dlvname�strip�reverse�join�parent�rrname�upper�rrclass�int�ttl�map�keyid�keyalg�hashalg�digest)�selfZrrtextr Zfieldsr �dlv� r- � /usr/lib/python3.6/checkds.py�__init__$ sH
* zSECRR.__init__c C s$ d| j | j| j| j| j| j| jf S )Nz%s %s %s %d %d %d %s)r! r# r r' r( r) r* )r+ r- r- r. �__repr__S s zSECRR.__repr__c C s | j � |j � kS )N)r0 )r+ �otherr- r- r. �__eq__X s z SECRR.__eq__)N)�__name__�
__module__� __qualname__�hashalgsr! r# r' r( r) r* r% r/ r0 r2 r- r- r- r. r s
/r c
C s& g }|j ddd|rdndd|r*| d | n| g}t|td�j� \}}x6|j� D ]*}t|�tk rh|jd �}|jt ||�� qNW t
|d
d � d �}g } |r�|j d
|g}|r�|d|g7 }|j| � t|td�j� \}}ndt|j ddddd| gtd�j� \}
}|j d
dg}|�r|d|g7 }|j| � t|ttd�j|
�\}}x:|j� D ].}t|�tk �rZ|jd �}| jt ||�� �q>W t | �dk �r�t
d� dS d} xv| D ]n} | |k�r�t
d| j| jjd�| j| jt j| j f � d} n,t
d| j| jjd�| j| jt j| j f � �q�W | �s"t
d|�rdnd � | S )Nz+noallz+answerz-tr, Zdsz-qr )�stdoutr
c S s | j | j| jfS )N)r' r( r) )�rrr- r- r. �<lambda>m s zcheck.<locals>.<lambda>)�keyz-fz-lZdnskey�-)�stdinr7 r z$No DNSKEY records found in zone apexFz,%s for KSK %s/%03d/%05d (%s) found in parentTz0%s for KSK %s/%03d/%05d (%s) missing from parentz'No %s records were found for any DNSKEYr r )�digr r Z communicate�
splitlinesr r r �appendr �sorted� dsfromkeyr �printr r! r r( r' r6 r) )
�zone�args�
masterfile� lookasideZrrlist�cmd�fp�_�lineZklistZintods�foundr8 r- r- r. �checkc sV
rL c C s� t jtd d�} d}tjdkr"dnd}| jdtdd� | jd d
d td d
� | jdddtdd
� | jdddtjjt |�d�tdd� | jdddtjjt |�d�tdd� | jd d d t
d � | j � }|j j
d �|_ |jr�|jj
d �|_|S )!Nz: checks DS coverage)� description�bin�ntZsbinrC z
zone to check)r �helpz-fz--filerE zzone master file)�destr rP z-lz --lookasiderF zDLV lookaside zonez-dz--digr= z
path to 'dig')rQ �defaultr rP z-Dz --dsfromkeyrA zdnssec-dsfromkeyzpath to 'dnssec-dsfromkey'z-vz --versionr )�actionr r )�argparse�ArgumentParser�prog�os�name� add_argumentr �pathr r r �
parse_argsrC r rF )�parserZbindirZsbindirrD r- r- r. r[ � s,
r[ c C s. t � } t| j| | j| j�}t|r$dnd� d S )Nr r )r[ rL rC rE rF �exit)rD rK r- r- r. �main� s r^ )NN)rT rW �sys�
subprocessr r Z isc.utilsr r rV r rL r[ r^ r- r- r- r. �<module> s I
; isc/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000744 14751155147 0014675 0 ustar 00 3
��f� �
@ sj d ddddddddd d
d d g
Z d
dlT d
dlT d
dlT d
dlT d
dlT d
dlT d
dlT d
dlT d
dl T dS )ZcheckdsZcoverageZkeymgrZdnskeyZ eventlistZkeydictZkeyeventZ keyseriesZkeyzoneZpolicyZparsetabZrndcZutils� )�*N)
�__all__Z
isc.dnskeyZ
isc.eventlistZ isc.keydictZ isc.keyeventZ
isc.keyseriesZ isc.keyzoneZ
isc.policyZisc.rndcZ isc.utils� r r � /usr/lib/python3.6/__init__.py�<module> s
isc/__pycache__/keyevent.cpython-36.pyc 0000644 00000003500 14751155147 0014022 0 ustar 00 3
��f � @ s d dl Z G dd� d�ZdS )� Nc @ s4 e Zd ZdZd dd�Zdd� Zdd� Zd d d
�ZdS )
�keyeventz� A discrete key event, e.g., Publish, Activate, Inactive, Delete,
etc. Stores the date of the event, and identifying information
about the key to which the event will occur.Nc C s@ || _ |p|j|�| _|| _|j| _|j| _|j| _|j| _d S )N) �whatZgettime�when�key�sep�name�zone�alg�keyid)�selfr r r � r � /usr/lib/python3.6/keyevent.py�__init__ s zkeyevent.__init__c C s t | j| j| j| j| j| jf�S )N)�reprr r r
r r r )r r r r
�__repr__ s zkeyevent.__repr__c C s t jd| j�S )Nz%a %b %d %H:%M:%S UTC %Y)�timeZstrftimer )r r r r
�showtime$ s zkeyevent.showtimec C s� dd� }|s|}|st � }|s$t � }| jdkr<|j| j� n�| jdkrT|j| j� n�| jdkr�| j|kr||dt| j� � q�|j| j� nl| jdkr�| j|kr�|j| j� q�|dt| j� � n6| jd kr�| j|kr�|j| j� | j|kr�|j| j� ||fS )
Nc _ s d S )Nr )�args�kwargsr r r
�noop* s z keyevent.status.<locals>.noopZActivateZPublishZInactivez= WARNING: %s scheduled to become inactive before it is activeZDeletez@WARNING: key %s is scheduled for deletion before it is publishedZRevoke)�setr �addr
r r �remove)r ZactiveZ published�outputr r r r
�status) s6
zkeyevent.status)N)N)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
r s
r )r r r r r r
�<module> s isc/__pycache__/parsetab.cpython-36.pyc 0000644 00000015224 14751155147 0013777 0 ustar 00 3
��f} � ; @ s
d Z dZdZddddddd d
d d d
g d ddd d d d d d d d g fddddddd d
d d d
g d ddd d d d d d d d g fddddddd d
dd d dd
ddgd ddd d d d d dd d dd d d gfddddd d
d d d
g dd d d d d d d d g fddgd d gfdddgd d d gfdd gd!d"gfddd#d$d%d&d'dgdd(d)d*d+d,d-d(gfdddd.gdd/d/d0gfd d1d d!dddd d(d/d2ddg
d! d! d
d d1 d d! d d d d3ddg
fd d(d/d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLd.dMdNdOdPdQd"d d0dRdSdTdUdVg*d d d d d d
dWd= d> dX d# d$ d% dY dd4 d3 d5 d d6 d dZ d7 d8 d9 d: d[d d d( dC d2 dd& d' dD d/ d d? d@ dA dB g*fd3ddZddWdd[dgdXdXdXdXd; d d< d gfd3ddZddWdd[dgd#d#d#d#d; d d< d gfd3ddZddWdd[dgd$d$d$d$d; d d< d gfd3ddZddWdd[dgd%d%d%d%d; d d< d gfd3ddZddWdd[dgdYdYdYdYd; d d< d gfd3ddZddWdd[dgd&d&d&d&d; d d< d gfd3ddZddWdd[dgd'd'd'd'd; d d< d gfddddgd d d d gfddddgddd d gfdZddWdd[dgdJdOd; d d< d gfdXdYd)d*d+d,d-gd.d.d.d.d.dUdVgfdXdYd)d*d+gdMdMdMdMdMgfd\�Zi ZxXej� D ]L\ZZx@eed ed �D ]*\Z Z
e ek �r�i ee < e
ee e< �q�W �q�W [dgdgfdgdgfddgdd
gfddgddgfddgddgfddgd d gfdgd1gfddgddQgfd d1dgd2ddgfd2gd4gfddgd5d6gfd3gdZgfd3dZgd7dKgfd3ddZdgd8dBd8dBgfd3ddZdgd9dCd9dCgfd3ddZdgd:dDd:dDgfd3ddZdgd;dEd;dEgfd3ddZdgd<dHd<dHgfd3ddZdgd=dFd=dFgfd3ddZdgd>dId>dIgfdgdgfddgd?dPgfddgd@d@gfddgdAdAgfddgdGdGgfdXdYd)d*d+gdLdNdRdSdTgfd]�Z i Z xXe j� D ]L\ZZx@eed ed �D ]*\Z Z
e e k �r�i e e < e
e e e< �q�W �q�W [ d^d_dd`d`d`fdadbddcdddefdfdbddcdddgfdhdiddjdddkfdldmddndddofdpdmddndddqfdrdmddndddsfdtduddvdddwfdxduddvdddyfdzduddvddd{fd|d}dd~dddfd�d}dd~ddd�fd�d}dd~ddd�fd�d}dd~ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�d�d dd�dfg6Z
d`S ( z3.8ZLALRZ C2FE91AF256AF1CCEB499107DA2CFE7E� � � � � � � �
� �. �> � � � � � � �/ �M �X � �; � � �= � �P �
� �< � �O �( �) �* �, �- � �E �F �G �I �J �C � �R � � � � � � � � �! �" �# �$ �% �& �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �? �@ �B �D �H �K �L �N �S �T �U �V �W �A �' �+ � �Q )ZALGORITHM_POLICYZZONEZPOLICYz$endZALGNAMEZSTRZQSTRINGZKEYTYPEZ
DATESUFFIX�LBRACE�SEMIZCOVERAGEZ ROLL_PERIODZ PRE_PUBLISHZ POST_PUBLISHZKEYTTLZKEY_SIZEZSTANDBYZ DIRECTORYZ ALGORITHM�RBRACE�NUMBERZNONE)�
policylist�init�policy�
alg_policy� zone_policy� named_policy�domain�name�
new_policy�alg_option_group�policy_option_group�alg_option_list�
alg_option�coverage_option�rollperiod_option�prepublish_option�postpublish_option�
keyttl_option�keysize_option�standby_option�policy_option_list�
policy_option�
parent_option�directory_option�algorithm_option�durationzS' -> policylistzS'Nzpolicylist -> init policyr^ Z p_policylistz policy.pyi z policylist -> policylist policyi zinit -> <empty>r_ Zp_initi zpolicy -> alg_policyr` Zp_policyi zpolicy -> zone_policyi zpolicy -> named_policyi z name -> STRre Zp_namei zname -> KEYTYPEi zname -> DATESUFFIXi z
domain -> STRrd Zp_domaini! zdomain -> QSTRINGi" zdomain -> KEYTYPEi# zdomain -> DATESUFFIXi$ znew_policy -> <empty>rf Z p_new_policyi+ zGalg_policy -> ALGORITHM_POLICY ALGNAME new_policy alg_option_group SEMIra Z p_alg_policyi/ z>zone_policy -> ZONE domain new_policy policy_option_group SEMIrb Z
p_zone_policyi6 z?named_policy -> POLICY name new_policy policy_option_group SEMIrc Zp_named_policyi= zduration -> NUMBERrw Z p_duration_1iC zduration -> NONEZ p_duration_2iH z duration -> NUMBER DATESUFFIXZ p_duration_3iM z7policy_option_group -> LBRACE policy_option_list RBRACErh Zp_policy_option_groupi` z(policy_option_list -> policy_option SEMIrr Zp_policy_option_listid z;policy_option_list -> policy_option_list policy_option SEMIie z policy_option -> parent_optionrs Zp_policy_optionii z!policy_option -> directory_optionij z policy_option -> coverage_optionik z"policy_option -> rollperiod_optionil z"policy_option -> prepublish_optionim z#policy_option -> postpublish_optionin z policy_option -> keysize_optionio z!policy_option -> algorithm_optionip z policy_option -> keyttl_optioniq z policy_option -> standby_optionir z1alg_option_group -> LBRACE alg_option_list RBRACErg Zp_alg_option_groupiv z"alg_option_list -> alg_option SEMIri Zp_alg_option_listiz z2alg_option_list -> alg_option_list alg_option SEMIi{ z alg_option -> coverage_optionrj Z p_alg_optioni z alg_option -> rollperiod_optioni� z alg_option -> prepublish_optioni� z alg_option -> postpublish_optioni� zalg_option -> keyttl_optioni� z alg_option -> keysize_optioni� z alg_option -> standby_optioni� z parent_option -> POLICY namert Zp_parent_optioni� z%directory_option -> DIRECTORY QSTRINGru Zp_directory_optioni� z$coverage_option -> COVERAGE durationrk Zp_coverage_optioni� z1rollperiod_option -> ROLL_PERIOD KEYTYPE durationrl Zp_rollperiod_optioni� z1prepublish_option -> PRE_PUBLISH KEYTYPE durationrm Zp_prepublish_optioni� z3postpublish_option -> POST_PUBLISH KEYTYPE durationrn Zp_postpublish_optioni� z)keysize_option -> KEY_SIZE KEYTYPE NUMBERrp Zp_keysize_optioni� z(standby_option -> STANDBY KEYTYPE NUMBERrq Zp_standby_optioni� z keyttl_option -> KEYTTL durationro Zp_keyttl_optioni� z%algorithm_option -> ALGORITHM ALGNAMErv Zp_algorithm_optioni� )Z _tabversionZ
_lr_methodZ
_lr_signatureZ_lr_action_itemsZ
_lr_action�itemsZ_kZ_v�zipZ_xZ_yZ_lr_goto_itemsZ_lr_gotoZ_lr_productions� rz rz � /usr/lib/python3.6/parsetab.py�<module> s� � � � � � � � isc/__pycache__/keyzone.cpython-36.opt-1.pyc 0000644 00000002344 14751155147 0014620 0 ustar 00 3
��f� � @ sJ d dl Z d dlZd dlZd dlmZmZ G dd� de�ZG dd� d�ZdS )� N)�Popen�PIPEc @ s e Zd ZdS )�KeyZoneExceptionN)�__name__�
__module__� __qualname__� r r � /usr/lib/python3.6/keyzone.pyr s r c @ s e Zd ZdZdd� ZdS )�keyzonez/reads a zone file to find data relevant to keysc
C s� d | _ d | _|sd S | s8tjj|� s8tj|tj� rDtd��d S d }}t|dd||gt t d�j
� \}}xv|j � D ]j}t |�t
k r�|jd�}tjd|�r�qv|j� } | s�t| d �|kr�t| d �}| d d krvt| d �}qvW || _|| _ d S )
Nz "named-compilezone" not foundz-o�-)�stdout�stderr�asciiz ^[:space:]*;� � ZDNSKEY)�maxttl�keyttl�os�path�isfile�access�X_OKr r r Z communicate�
splitlines�type�str�decode�re�search�split�int)
�self�name�filenameZczpathr r �fp�_�lineZfieldsr r r �__init__ s.
zkeyzone.__init__N)r r r �__doc__r& r r r r r
s r
) r �sysr �
subprocessr r � Exceptionr r
r r r r �<module> s
isc/__pycache__/dnskey.cpython-36.opt-1.pyc 0000644 00000032530 14751155147 0014431 0 ustar 00 3
��f @ � @ sJ d dl Z d dlZd dlZd dlmZmZ G dd� de�ZG dd� d�ZdS )� N)�Popen�PIPEc s e Zd Z� fdd�Z� ZS )�TimePastc s t t| �jd|||f � d S )Nz'%s time for key %s (%d) is already past)�superr �__init__)�self�key�prop�value)� __class__� � /usr/lib/python3.6/dnskey.pyr s zTimePast.__init__)�__name__�
__module__� __qualname__r �
__classcell__r r )r r
r s r c @ s� e Zd ZdZdqZdrZdsZdtd!d"�Zd#d$� Zd%d&� Z e
dud'd(��Z d)d*� Z e
d+d,� �Ze
d-d.� �Zdvd/d0�Ze
d1d2� �Ze
d3d4� �Ze
d5d6� �Ze
d7d8� �Zd9d:� Zd;d<� Zd=d>� Zd?d@� ZdAdB� ZdCdD� Zej� fdEdF�Z dGdH� Z ej� fdIdJ�Z dKdL� Z ej� fdMdN�Z dOdP� Z!ej� fdQdR�Z"dSdT� Z#ej� fdUdV�Z$dWdX� Z%ej� fdYdZ�Z&d[d\� Z'ej� fd]d^�Z(d_d`� Z)dadb� Z*dcdd� Z+dedf� Z,dgdh� Z-didj� Z.dwdkdl�Z/dxdmdn�Z0e
dodp� �Z1d S )y�dnskeyztAn individual DNSSEC key. Identified by path, name, algorithm, keyid.
Contains a dictionary of metadata events.�Created�Publish�Activate�Inactive�Delete�Revoke� DSPublish� SyncPublish�
SyncDeleteN�-P�-A�-I�-D�-R�-Psync�-Dsync�RSAMD5�DH�DSA�ECC�RSASHA1�NSEC3DSA� NSEC3RSASHA1� RSASHA256� RSASHA512�ECCGOST�ECDSAP256SHA256�ECDSAP384SHA384�ED25519�ED448c C s� t |t�r:t|�dkr:|p d| _|\}}}| j||||� |pLtjj|�pLd| _tjj|�}|j d�\}}}|dd� }t
|�}t
|j d�d �}| j||||� d S )N� �.�+� r ���) �
isinstance�tuple�len�_dir� fromtuple�os�path�dirname�basename�split�int)r r Z directory�keyttl�name�alg�keyidr r r
r & s
zdnskey.__init__c s� |j d�r|}|jd�}n|d }d|||f }| j| jr@tjpBd | d }| j| jr^tjp`d | d }|| _|| _t|�| _t|�| _ || _
t |d�} x�| D ]z� � d dkr�q�� j � }
|
s�q�|
d j
� dkr�d
} || _nd} |s�t|
d �n|| _t|
| �d @ d k�rd| _q�d| _q�W | j� t |d�} t� | _t� | _t� | _t� | _t� | _t� | _t� | _d | _x�| D ]�� � j� � � �sv� d dk�r��qv� fdd�dD �t� �g }
tdd� |
D ��}� d |� j� }� |d � j d�j� }|| j|< �qvW x�t j D ]�}d| j|< || jk�rn| j | j| �}|| j|< | j |�| j|< | j!|�| j|< | j| | j|< n(d | j|< d | j|< d | j|< d | j|< �qW | j� d S )Nr2 z
K%s+%03d+%05d� z.keyz.private�rr �;r4 �in�ch�hsr1 � TFZrUz!#c s g | ]}� j |��qS r )�find)�.0�c)�liner r
�
<listcomp>l s z$dnskey.fromtuple.<locals>.<listcomp>z:= c S s g | ]}|dkr|�qS )r4 r5 r )rM �posr r r
rP m s )rH rI rJ )"�endswith�rstripr9 r; �sep�keystrrB r@ rC rD �fullname�openr? �lower�ttl�close�dictZmetadata�_changed�_delete�_times�_fmttime� _timestamps� _original�_origttl�stripr8 �min�lstripr �_PROPS� parsetime�
formattime�
epochfromtime)r rB rC rD rA rV rU Zkey_fileZ private_fileZkfp�tokensZseptokenZpfpZ punctuation�foundr
r �tr )rO r
r: 5 sv
zdnskey.fromtuplec K sr |j dd�}g }d}| jd k r0|dt| j�g7 }xlttjtj�D ]Z\}}| s@| j| r\q@d}|| j krx| j | rxd}|r�dn| j
| } ||| g7 }d}q@W |�rn|d| j g| | j g }
|s�t
ddj|
� � y0t|
ttd �} | j� \} }
|
�r tt|
���W n8 tk
�r: } ztd
|t|�f ��W Y d d }~X nX d | _x*tjD ] }| j| | j|< d| j|< �qJW d S ) N�quietFTz-LZnonez-Kz# � )�stdout�stderrzunable to run %s: %s)�getrb �strrY �zipr rf �_OPTSr\ r] r_ r9 rU �print�joinr r � communicate� Exceptionr` ra )r Z settime_bin�kwargsrm �cmd�firstr �opt�deleteZwhenZfullcmd�pro rp �er r r
�commit� s<
" z
dnskey.commitc K sL | j dd�} |dd|dt|�g}
|r0|
d|g7 }
|r>|
jd� |rN|
d|g7 }
|rb|
d t|�g7 }
| r�tj| �}|
d
tj|�g7 }
|
r�tj|
�}|
d tj|
�g7 }
|
j|� | s�td d
j|
� � t|
t t d�}|j
� \}}|r�t dt|� ��y"|j � d j
d�}t|||�}|S t k
�rF } zt dt|� ��W Y d d }~X nX d S )Nrm Fz-qz-Kz-Lz-rz-fkz-az-bz-Pz-Az# rn )ro rp zunable to generate key: r �asciiz!unable to parse generated key: %s)rq rr �appendr �
timefromepochrh ru rv r r rw rx �
splitlines�decode)�cls�
keygen_bin� randomdevZkeys_dirrB rC ZkeysizerT rY �publish�activatery rm �
keygen_cmdrl r~ ro rp rU �newkeyr r r r
�generate� s:
zdnskey.generatec
K s� |j dd�}| j� s td| ��|dd| jd| jg}| jrL|dt| j�g7 }|r\|d|g7 }|rp|d t|�g7 }|s�td
d j|� � t |t
t
d �}|j � \}} | r�td
| ��y&|j � d j
d�}
t|
| j| j�} | S td| ��Y nX d S )Nrm Fz'predecessor key %s has no inactive datez-qz-Kz-Sz-Lz-rz-iz# rn )ro rp zunable to generate key: r r� z'unable to generate successor for key %s)rq �inactiverx r9 rU rY rr ru rv r r rw r� r� r ) r r� r� Z
prepublishry rm r� r~ ro rp rU r� r r r
�generate_successor� s, zdnskey.generate_successorc C s0 d }| t ttj��kr tj| }|r(|S d| S )Nz%03d)�ranger8 r � _ALGNAMES)rC rB r r r
�algstr� s
z
dnskey.algstrc C s6 | sd S | j � } y tjj| �S tk
r0 d S X d S )N)�upperr r� �index�
ValueError)rC r r r
�algnum� s z
dnskey.algnumc C s | j |p | j�S )N)r� rC )r rC r r r
�algname s zdnskey.algnamec C s
t j| �S )N)�timeZgmtime)�secsr r r
r� s zdnskey.timefromepochc C s t j| d�S )Nz %Y%m%d%H%M%S)r� Zstrptime)�stringr r r
rg s zdnskey.parsetimec C s
t j| �S )N)�calendarZtimegm)rl r r r
ri s zdnskey.epochfromtimec C s t jd| �S )Nz %Y%m%d%H%M%S)r� Zstrftime)rl r r r
rh s zdnskey.formattimec K s� |j dd�}| j| |kr d S | j| d k rR| j| |k rR| rRt| || j| ��|d kr�| j| d krldnd| j|< d| j|< d | j|< d | j|< d | j|< d S | j|�}|| j|< || j|< | j |�| j|< | j| | j| kr�dnd| j|< d S )N�forceFT)
rq r` ra r r\ r] r^ r_ r� rh )r r r� �nowry r� rl r r r
�setmeta s$
zdnskey.setmetac C s
| j | S )N)r^ )r r r r r
�gettime2 s zdnskey.gettimec C s
| j | S )N)r_ )r r r r r
�
getfmttime5 s zdnskey.getfmttimec C s
| j | S )N)r` )r r r r r
� gettimestamp8 s zdnskey.gettimestampc C s
| j d S )Nr )r` )r r r r
�created; s zdnskey.createdc C s
| j d S )Nr )r` )r r r r
� syncpublish> s zdnskey.syncpublishc K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
�setsyncpublishA s zdnskey.setsyncpublishc C s
| j d S )Nr )r` )r r r r
r� D s zdnskey.publishc K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
�
setpublishG s zdnskey.setpublishc C s
| j d S )Nr )r` )r r r r
r� J s zdnskey.activatec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setactivateM s zdnskey.setactivatec C s
| j d S )Nr )r` )r r r r
�revokeP s z
dnskey.revokec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setrevokeS s zdnskey.setrevokec C s
| j d S )Nr )r` )r r r r
r� V s zdnskey.inactivec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setinactiveY s zdnskey.setinactivec C s
| j d S )Nr )r` )r r r r
r} \ s z
dnskey.deletec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setdelete_ s zdnskey.setdeletec C s
| j d S )Nr )r` )r r r r
�
syncdeleteb s zdnskey.syncdeletec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
�
setsyncdeletee s zdnskey.setsyncdeletec C sR |d ks| j |krd S | jd kr0| j | _|| _ n | j|krHd | _|| _ n|| _ d S )N)rY rb )r rY r r r
�setttlh s
z
dnskey.setttlc C s | j r
dS dS )N�KSK�ZSK)rT )r r r r
�keytypet s zdnskey.keytypec C s d| j | j� | jf S )Nz
%s/%s/%05d)rB r� rD )r r r r
�__str__w s zdnskey.__str__c C s" d| j | j� | j| jrdndf S )Nz%s/%s/%05d (%s)r� r� )rB r� rD rT )r r r r
�__repr__{ s zdnskey.__repr__c C s | j � p| j� p| j� S )N)r� r� r� )r r r r
�date� s z dnskey.datec C s@ | j |j kr| j |j k S | j|jkr0| j|jk S | j� |j� k S )N)rB rC r� )r �otherr r r
�__lt__� s
z
dnskey.__lt__c C s� dd� }|s|}t tj� �}| j� }| j� }|s4dS |sT||krP|dt| � � dS ||krh||krhdS ||kr�|dt| �tj| j�p�df � dS ||k r�|dt| � � dS | jd k r�|| | jk r�|d t| �tj| j�p�df � dS dS )
Nc _ s d S )Nr )�argsry r r r
�noop� s z!dnskey.check_prepub.<locals>.noopFzFWARNING: Key %s is scheduled for
activation but not for publication.Tz�WARNING: %s is scheduled to be
published and activated at the same time. This
could result in a coverage gap if the zone was
previously signed. Activation should be at least
%s after publication.zone DNSKEY TTLz0WARNING: Key %s is active before it is publishedz�WARNING: Key %s is activated too soon
after publication; this could result in coverage
gaps due to resolver caches containing old data.
Activation should be at least %s after
publication.)r@ r� r� r� �reprr �durationrY )r �outputr� r� �ar~ r r r
� check_prepub� s< zdnskey.check_prepubc C s� dd� }|d kr|}|d kr"| j }|d kr>|dt| � � d }tj� }| j� }| j� }|s^dS |s~||krz|dt| � � dS ||k r�||k r�dS ||k r�|d t| � � dS || |k r�|d
t| �tj|�f � dS dS )
Nc _ s d S )Nr )r� ry r r r
r� � s z"dnskey.check_postpub.<locals>.noopz"WARNING: Key %s using default TTL.�< � FzEWARNING: Key %s is scheduled for
deletion but not for inactivation.Tz@WARNING: Key %s is scheduled for
deletion before inactivation.z�WARNING: Key %s scheduled for
deletion too soon after deactivation; this may
result in coverage gaps due to resolver caches
containing old data. Deletion should be at least
%s after inactivation.i i�Q )rY r� r� r} r� r r� )r r� Ztimespanr� r� �d�ir r r
�
check_postpub� s: zdnskey.check_postpubc C sz | sd S dddd d d g}g }xR|D ]J}| |d | |d }} |d kr"|j d
||d |d krbdndf � q"W dj|�S ) N�yearr� r� im �month� �day�hour�minute�secondr4 r z%d %s%s�srE z, i i�Q �3�)r� r� i i�Q � �' )r� r� i �Q )r� r� � )r� r� )r� r� )r� r4 )r� rv )r� Zunitsr� Zunit�vr r r
r� � s
(zdnskey.duration) r r r r r r r r r ) Nr r r r r Nr! r" )Nr# r$ r% r& r' r( r) r* Nr+ Nr, r- r. r/ r0 )NN)NN)N)N)NN)2r r r �__doc__rf rt r� r r: r� � classmethodr� r� � staticmethodr� r� r� r� rg ri rh r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r� r� r� r� r� r� r� r� r� r� r� r� r r r r
r sb
M% *
1
-r ) r; r� r� �
subprocessr r rx r r r r r r
�<module> s
isc/__pycache__/keymgr.cpython-36.pyc 0000644 00000010165 14751155147 0013473 0 ustar 00 3
��fk � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dl Z d dl
m Z dZ d dl
mZmZmZmZmZmZ dd� Zddd �Zd
d � Zd d
� ZdS )� )�print_functionN)� defaultdictz
dnssec-keymgr)�dnskey�keydict� keyseries�policy�parsetab�utilsc O s t | |� tjd� d S )N� )�print�sys�exit)�args�kwargs� r � /usr/lib/python3.6/keymgr.py�fatal s
r c C s� |}| s(t jj|� s(t j|t j� r�t jd }|s>t jj}xB|jt j�D ]2}|t j | }t jj|�rzt j|t j�rzP d}qLW |S )a2 find the location of a specified command. If a default is supplied,
exists and it's an executable, we use it; otherwise we search PATH
for an alternative.
:param command: command to look for
:param default: default value to use
:return: PATH with the location of a suitable binary
�PATHN)
�os�path�isfile�access�X_OK�environ�defpath�split�pathsep�sep)Zcommand�defaultZfpathr Z directoryr r r �set_path s $
r c C s� t dtjjtjd�d��} t dtjjtjd�d��}tjtd d�}|j dt
ddd;d � |j d d
t
ddd� |j ddt
ddd� |j dd| t
dd
d� |j ddt
ddd
d � |j d d |t
d d
d� |j d d!d"d#d$d%� |j d&d'd"d#d(d%� |j d)d*d+d"d#d<d%� |j d.d/d0d"d#d1d%� |j d2d3d4tj d5� |j � }|j
�rJ|j�rJtd6� |jdk�r^td7� |jdk�rrtd8� |jdk �r�tjj|j��s�td9|j � n(tjjtjd:�|_tjj|j��s�d|_|S )=zc Read command line arguments, returns 'args' object
:return: args object properly prepared
z
dnssec-keygenZsbinzdnssec-settimezA: schedule DNSSEC key rollovers according to a pre-defined policy)� description�zone�*Nz.Zone(s) to which the policy should be applied z%(default: all zones in the directory))�type�nargsr �helpz-Kr zDirectory containing keys�dir)�destr# r% �metavarz-c�
policyfilezPolicy definition file�filez-g�keygenzPath to 'dnssec-keygen')r' r r# r% r( z-r� randomdevz@Path to a file containing random data to pass to 'dnssec-keygen')r' r# r r% r( z-s�settimezPath to 'dnssec-settime'z-k�no_zsk�
store_trueFz,Only apply policy to key-signing keys (KSKs))r' �actionr r% z-z�no_kskz-Only apply policy to zone-signing keys (ZSKs)z-fz--force�forcez Force updates to key events z even if they are in the pastz-qz--quiet�quietzUpdate keys silentlyz-vz --version�version)r0 r4 z)ERROR: -z and -k cannot be used together.z ERROR: dnssec-keygen not foundz ERROR: dnssec-settime not foundz!ERROR: Policy file "%s" not foundzdnssec-policy.confzSZone(s) to which the policy should be applied (default: all zones in the directory)z8Force updates to key events even if they are in the past)r r r �joinr �prefix�argparse�ArgumentParser�prog� add_argument�strr4 �
parse_argsr. r1 r r+ r- r) �existsZ
sysconfdir)r+ r- �parserr r r r r< 6 sb
r< c : C sH t � } | j| j| j| jd�}ytj| j�}W n2 tk
r^ } zt dt
|� � W Y d d }~X nX yt || j| j d�}W n2 tk
r� } zt dt
|� � W Y d d }~X nX yt
||d�}W n2 tk
r� } zt dt
|� � W Y d d }~X nX y |j|| j| j| j| jd� W n4 tk
�rB } zt dt
|� � W Y d d }~X nX d S ) N)Z keygen_pathZ settime_pathZ keys_pathr, z Unable to load DNSSEC policy: )r Zzonesz Unable to build key dictionary: )�contextz Unable to build key series: )ZkskZzskr2 r3 zUnable to apply policy: )r< r+ r- r r, r Z
dnssec_policyr) � Exceptionr r; r r! r Zenforce_policyr. r1 r2 r3 )r r? Zdp�eZkdZksr r r �main} s,
"""rB )N)Z
__future__r r r r7 Zglob�reZtimeZcalendar�pprint� collectionsr r9 Ziscr r r r r r r r r< rB r r r r �<module> s @
G isc/__pycache__/keydict.cpython-36.opt-1.pyc 0000644 00000005013 14751155147 0014564 0 ustar 00 3
��f! � @ s: d dl mZ ddlmZ d dlZd dlZG dd� d�ZdS )� )� defaultdict� )�dnskeyNc @ sn e Zd ZdZedd� �ZdZg Zddd�Zdd� Z d d
� Z
d d � Z d
d� Z dd� Z
dd� Zdd� Zdd� ZdS )�keydictz> A dictionary of keys, indexed by name, algorithm, and key id c C s t t�S )N)r �dict� r r � /usr/lib/python3.6/keydict.py�<lambda> s zkeydict.<lambda>Nc K s� |j dd �| _|j dd �}|s:|j dd �p,d}| j|� nXxV|D ]N}d|krb|d d k rb|d }n|rr|j|�jptd}| j||�s@| jj|� q@W d S )NZkeyttl�zones�path�.)�get�_defttl�readallZpolicyZ directory�readone�_missing�append)�selfZdp�kwargsr
r �zoner r r �__init__ s
zkeydict.__init__c C sL t j tjj|d��}x2|D ]*}t||| j�}|| j|j |j |j < qW d S )Nz *.private)
�glob�osr �joinr r �_keydict�name�alg�keyid)r r �files�infile�keyr r r r , s
zkeydict.readallc C s� |j d�s|d7 }d| d }tjtjj||��}d}xR|D ]J}t||| j�}|j|krZq<|dkrh|jnd}|| j | |j
|j < d}q<W |S )Nr �Kz
+*.privateFT) �endswithr r r r r r �fullnamer r r r ) r r r �matchr �foundr r Zkeynamer r r r 3 s
zkeydict.readonec c sJ xD| j j� D ]6\}}x,|j� D ] \}}x|j� D ]
}|V q0W q W q W d S )N)r �items�values)r r �
algorithmsr �keysr r r r �__iter__D s zkeydict.__iter__c C s
| j | S )N)r )r r r r r � __getitem__J s zkeydict.__getitem__c C s
| j j� S )N)r r) )r r r r r
M s z
keydict.zonesc C s | j | j� S )N)r r) )r r r r r r( P s zkeydict.algorithmsc C s | j | | j� S )N)r r) )r r r r r r r) S s z keydict.keysc C s | j S )N)r )r r r r �missingV s zkeydict.missing)N)�__name__�
__module__� __qualname__�__doc__r r r r r r r r* r+ r
r( r) r, r r r r r s
r )� collectionsr � r r r r r r r r �<module> s isc/__pycache__/rndc.cpython-36.pyc 0000644 00000012000 14751155147 0013111 0 ustar 00 3
��f+ � @ sX d dl mZ d dlZd dlZd dlZd dlZd dlZd dlZd dlZG dd� de �Z
dS )� )� OrderedDictNc @ sl e Zd ZdZddddddd�Zd d
� Zd d � Zd dd�Zdd� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
d S ) �rndcz RNDC protocol client library� � � � � � )�md5Zsha1Zsha224Zsha256Zsha384Zsha512c C sb || _ |j� }|jd�r$|dd� }|| _tt|�| _tj|�| _ t
j dd�| _ d| _
| j� dS )z�Creates a persistent connection to RNDC and logs in
host - (ip, port) tuple
algo - HMAC algorithm: one of md5, sha1, sha224, sha256, sha384, sha512
(with optional prefix 'hmac-')
secret - HMAC secret, base64 encodedzhmac-� Nr � � i )�host�lower�
startswith�algo�getattr�hashlib�hlalgo�base64� b64decode�secret�randomZrandint�ser�nonce�_rndc__connect_login)�selfr r r � r �/usr/lib/python3.6/rndc.py�__init__$ s
z
rndc.__init__c C s t | j|d�d �S )z�Call a RNDC command, all parsing is done on the server side
cmd - a complete string with a command (eg 'reload zone example.com')
)�type�_data)�dict�_rndc__command)r �cmdr r r �call5 s z rndc.callFc C s t � }�x |j� D ]�\}}|r(|dkr(q|tjdt|��|jd� 7 }t|�tkrt|tjddt|��|jd� 7 }qt|�tkr�|tjddt|��| 7 }qt|�t kr�|tjddt|��| 7 }qt|�t kr�| j
|�}|tjddt|��| 7 }qt dt|� ��qW |S )N�_auth�B�asciiz>BIr � z#Cannot serialize element of type %s) � bytearray�items�struct�pack�len�encoder �str�bytesr �_rndc__serialize_dict�NotImplementedError)r �data� ignore_auth�rv�k�vZsdr r r Z__serialize_dict; s" "
zrndc.__serialize_dictc O s, | j d7 _ ttj� �}t||�}t� }t� |d< t� |d< t| j �|d d< t|�|d d< t|d �|d d< | jd k r�| j|d d< ||d < | j|d
d �}tj| j || j
�j � }t j
|�}| jd kr�tjd
|�|d d< n"ttjd| j| j |��|d d< | j|�}tjdt|�d d�| }|S )Nr r& �_ctrlZ_serZ_tim�< Z_exp�_noncer! T)r5 r
Z22s�hmd5ZB88s�hshaz>II� )r �int�timer r0 r r2 �hmac�newr r �digestr Z b64encoder r, r- r* � _rndc__algosr. ) r �args�kwargsZnowr4 �d�msg�hash�bhashr r r Z__prep_messageO s,
zrndc.__prep_messagec C s� | j d k r |d d | j kr dS | jdkr8|d d }n|d d dd � }t|�tkrb|jd �}|d
d t|�d 7 }tj|�}| j|d d
�}t j
| j || j �j
� }||kS )Nr9 r; Fr
r& r< r= r r( �=r> T)r5 )r r r r1 �decoder. r r r2 rA rB r r rC )r rH rJ Z remote_hashZmy_msgZmy_hashr r r Z __verify_msgj s
zrndc.__verify_msgc O s� | j ||�}| jj|�}|t|�kr,td��| jjd�}t|�dkrLtd��tjd|�\}}|dkrptd| ��|d8 }| jj|tj �}t|�|kr�td��t
|�t kr�t |�}| j
|�}| j|�s�td ��|S )
NzCannot send the message� zCan't read response headerz>IIr zWrong message version %dr> zCan't read response datazAuthentication failure)�_rndc__prep_message�socket�sendr. �IOErrorZrecvr, �unpackr3 Z MSG_WAITALLr r0 r* �_rndc__parse_message�_rndc__verify_msg) r rE rF rH Zsent�headerZlength�versionr4 r r r Z __commandy s(
zrndc.__commandc C s2 t j| j�| _ d | _| jdd�}|d d | _d S )NZnull)r r9 r; )rO Zcreate_connectionr r r# )r rH r r r Z__connect_login� s zrndc.__connect_loginc C s� d}|| }|d7 }|||| � j d�}||7 }|| }|d7 }tjd|||d � �d }|d7 }|||| � }||7 }||d � }|dkr�|||fS |dkr�t� } x(t|�dkr�| j|�\}
} }| | |
< q�W || |fS td| ��d S )Nr r r( z>Ir> r) zUnknown element type %d)rL r, rR r r. �_rndc__parse_elementr3 ) r �input�posZlabellen�labelr Zdatalenr4 �restrG Zilabel�valuer r r Z__parse_element� s*
zrndc.__parse_elementc C s8 t � }d }x(t|�dkr2| j|�\}}}|||< q W |S )Nr )r r. rW )r rX r6 ZhdatarZ r\ r r r Z__parse_message� s zrndc.__parse_messageN)F)�__name__�
__module__� __qualname__�__doc__rD r r% r2 rN rT r# r rW rS r r r r r s
r ) � collectionsr r@ r, r rA r r rO �objectr r r r r �<module> s isc/__pycache__/coverage.cpython-36.pyc 0000644 00000014323 14751155147 0013770 0 ustar 00 3
��f�& � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dl Z d dl
m Z dZ d dl
mZmZmZmZmZmZ dd� Zdad d
� Zd d � Zd
d� Zddd�Zdd� Zdd� ZdS )� )�print_functionN)� defaultdictzdnssec-coverage)�dnskey� eventlist�keydict�keyevent�keyzone�utilsc O s t | |� tjd� d S )N� )�print�sys�exit)�args�kwargs� r � /usr/lib/python3.6/coverage.py�fatal s
r Tc O sJ d|kr |d }|j dd� nd}tr,dan |r8td� | rFt| |� dS )zuoutput text, adding a vertical space this is *not* the first
first section being printed since a call to vreset()�skipNTF� )�pop�
_firstliner )r r r r r r �output' s r c C s da dS )zreset vertical spacingTN)r r r r r �vreset8 s r c C s� | j � } yt| �S tk
r$ Y nX tjd�}|j| �}|sJtd| ��|j� \}}t|�}|j� }|jd�rx|d S |jd�r�|d S |jd�r�|d S |jd �r�|d
S |jd �r�|d S |jd
�r�|d S |jd�r�|S td| ��dS )z� convert a formatted time (e.g., 1y, 6mo, 15mi, etc) into seconds
:param s: String with some text representing a time interval
:return: Integer with the number of seconds in the time interval
z([0-9][0-9]*)\s*([A-Za-z]*)zCannot parse %s�yi�3��moi �' �wi�: �di�Q �hi Zmi�< �szInvalid suffix %sN) �strip�int�
ValueError�re�compile�match�groups�lower�
startswith)r �r�m�nZunitr r r �
parse_timeA s6
r, c C s� |}| s(t jj|� s(t j|t j� r�t jd }|s>t jj}xB|jt j�D ]2}t jj || �}t jj|�rzt j|t j�rzP d}qLW |S )a1 find the location of a specified command. if a default is supplied
and it works, we use it; otherwise we search PATH for a match.
:param command: string with a command to look for in the path
:param default: default location to use
:return: detected location for the desired command
�PATHN)
�os�path�isfile�access�X_OK�environ�defpath�split�pathsep�join)Zcommand�defaultZfpathr/ Z directoryr r r �set_pathk s $
r9 c 0 C sD t dtjjtjd�d��} tjtd d d�}|j dt
dddFd � |j d d
dt
ddd� |j ddt
ddd� |j ddt
ddd� |j dd t
d dd� |j d d d t
d!dd� |j d"d#| t
d$d
d� |j d%d&t
d'd(dd)� |j d*d+d,d-d.d/� |j d0d1d,d-d2d/� |j d3d4d5d,d-d6d/� |j d7d8d9tj d:� |j � }|j
�rJ|j�rJtd;� n*|j
�sZ|j�rn|j
�rfd<nd=|_nd|_|j�r�t|j�d>k�r�td?� d@dA� |jD �|_y |j�r�t|j�}||_W n tk
�r� Y nX y |j�r�t|j�}||_W n tk
�r Y nX y |j�r(t|j�}||_W n tk
�r@ Y nX y<|j�r||j}t|j�}|dBk�rnd|_ntj� | |_W n tk
�r� Y nX |j�r�|j�r�|S |j�r*|j�r*y:t|jdB |j|j �}|j�p�|j|_|j�p�|j|_W n4 t k
�r( } zt dC|j |� W Y dd}~X nX |j�s@t dD� dE|_|S )Gz8Read command line arguments, set global 'args' structureznamed-compilezoneZsbinz: checks future zDNSKEY coverage for a zone)� description�zone�*Nzzone(s) to checkz%(default: all zones in the directory))�type�nargsr8 �helpz-Kr/ �.z&a directory containing keys to process�dir)�destr8 r= r? �metavarz-f�filenamezzone master file�file)rB r= r? rC z-m�maxttlz the longest TTL in the zone(s)�timez-d�keyttlzthe DNSKEY TTLz-r�resignZ1944000z:the RRSIG refresh interval in seconds [default: 22.5 days]z-c� compilezonezpath to 'named-compilezone'z-l�
checklimit�0zDLength of time to check for DNSSEC coverage [default: 0 (unlimited)])rB r= r8 r? rC z-z�no_ksk�
store_trueFz#Only check zone-signing keys (ZSKs))rB �actionr8 r? z-k�no_zskz"Only check key-signing keys (KSKs)z-Dz--debugZ
debug_modezTurn on debugging outputz-vz --version�version)rO rQ z)ERROR: -z and -k cannot be used together.ZKSKZZSKr
z)ERROR: -f can only be used with one zone.c S s4 g | ],}t |�d kr,|d dkr,|dd� n|�qS )r
r@ N���rR )�len)�.0�xr r r �
<listcomp>� s z parse_args.<locals>.<listcomp>r z"Unable to load zone data from %s: z�WARNING: Maximum TTL value was not specified. Using 1 week
(604800 seconds); re-run with the -m option to get more
accurate results.i�: z5zone(s) to check(default: all zones in the directory)) r9 r. r/ r7 r �prefix�argparse�ArgumentParser�prog� add_argument�strrQ �
parse_argsrP rM r �keytyperD rS r; rF r, r" rH rI rK rG r rJ � Exceptionr r ) rJ �parserr r* �kr) Zlimr; �er r r r] � s�
"r] c ( C sp t � } td� yt| j| j| jd�}W n2 tk
rX } ztdt|� � W Y d d }~X nX x<|D ]4}|j t
� |j r�|j t
� q`|j t
| j
| j � q`W t
d� t� y t|�}W n2 tk
r� } ztdt|� � W Y d d }~X nX d}| j�s|jd | j| jt
��sXd}nJxH| jD ]>}y |j|| j| jt
��s6d}W n t
d| � Y nX �qW tj|�rfd nd
� d S ) Nz;PHASE 1--Loading keys to check for internal timing problems)r/ ZzonesrH z'ERROR: Unable to build key dictionary: z9PHASE 2--Scanning future key events for coverage failuresz#ERROR: Unable to build event list: FTz&ERROR: Coverage check failed for zone r
r )r] r r r/ r; rH r_ r r\ Z check_prepubr �sepZ
check_postpubrF rI r r Zcoverager^ rK r r
)r Zkdrb �keyZelist�errorsr; r r r �main� s: "
"
rf )N) Z
__future__r r. r rX Zglobr# rG Zcalendar�pprint� collectionsr rZ Ziscr r r r r r r r r r r, r9 r] rf r r r r �<module> s& *
x isc/__pycache__/keyevent.cpython-36.opt-1.pyc 0000644 00000003500 14751155147 0014761 0 ustar 00 3
��f � @ s d dl Z G dd� d�ZdS )� Nc @ s4 e Zd ZdZd dd�Zdd� Zdd� Zd d d
�ZdS )
�keyeventz� A discrete key event, e.g., Publish, Activate, Inactive, Delete,
etc. Stores the date of the event, and identifying information
about the key to which the event will occur.Nc C s@ || _ |p|j|�| _|| _|j| _|j| _|j| _|j| _d S )N) �whatZgettime�when�key�sep�name�zone�alg�keyid)�selfr r r � r � /usr/lib/python3.6/keyevent.py�__init__ s zkeyevent.__init__c C s t | j| j| j| j| j| jf�S )N)�reprr r r
r r r )r r r r
�__repr__ s zkeyevent.__repr__c C s t jd| j�S )Nz%a %b %d %H:%M:%S UTC %Y)�timeZstrftimer )r r r r
�showtime$ s zkeyevent.showtimec C s� dd� }|s|}|st � }|s$t � }| jdkr<|j| j� n�| jdkrT|j| j� n�| jdkr�| j|kr||dt| j� � q�|j| j� nl| jdkr�| j|kr�|j| j� q�|dt| j� � n6| jd kr�| j|kr�|j| j� | j|kr�|j| j� ||fS )
Nc _ s d S )Nr )�args�kwargsr r r
�noop* s z keyevent.status.<locals>.noopZActivateZPublishZInactivez= WARNING: %s scheduled to become inactive before it is activeZDeletez@WARNING: key %s is scheduled for deletion before it is publishedZRevoke)�setr �addr
r r �remove)r ZactiveZ published�outputr r r r
�status) s6
zkeyevent.status)N)N)�__name__�
__module__� __qualname__�__doc__r r r r r r r r
r s
r )r r r r r r
�<module> s isc/__pycache__/keymgr.cpython-36.opt-1.pyc 0000644 00000010165 14751155147 0014432 0 ustar 00 3
��fk � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dl Z d dl
m Z dZ d dl
mZmZmZmZmZmZ dd� Zddd �Zd
d � Zd d
� ZdS )� )�print_functionN)� defaultdictz
dnssec-keymgr)�dnskey�keydict� keyseries�policy�parsetab�utilsc O s t | |� tjd� d S )N� )�print�sys�exit)�args�kwargs� r � /usr/lib/python3.6/keymgr.py�fatal s
r c C s� |}| s(t jj|� s(t j|t j� r�t jd }|s>t jj}xB|jt j�D ]2}|t j | }t jj|�rzt j|t j�rzP d}qLW |S )a2 find the location of a specified command. If a default is supplied,
exists and it's an executable, we use it; otherwise we search PATH
for an alternative.
:param command: command to look for
:param default: default value to use
:return: PATH with the location of a suitable binary
�PATHN)
�os�path�isfile�access�X_OK�environ�defpath�split�pathsep�sep)Zcommand�defaultZfpathr Z directoryr r r �set_path s $
r c C s� t dtjjtjd�d��} t dtjjtjd�d��}tjtd d�}|j dt
ddd;d � |j d d
t
ddd� |j ddt
ddd� |j dd| t
dd
d� |j ddt
ddd
d � |j d d |t
d d
d� |j d d!d"d#d$d%� |j d&d'd"d#d(d%� |j d)d*d+d"d#d<d%� |j d.d/d0d"d#d1d%� |j d2d3d4tj d5� |j � }|j
�rJ|j�rJtd6� |jdk�r^td7� |jdk�rrtd8� |jdk �r�tjj|j��s�td9|j � n(tjjtjd:�|_tjj|j��s�d|_|S )=zc Read command line arguments, returns 'args' object
:return: args object properly prepared
z
dnssec-keygenZsbinzdnssec-settimezA: schedule DNSSEC key rollovers according to a pre-defined policy)� description�zone�*Nz.Zone(s) to which the policy should be applied z%(default: all zones in the directory))�type�nargsr �helpz-Kr zDirectory containing keys�dir)�destr# r% �metavarz-c�
policyfilezPolicy definition file�filez-g�keygenzPath to 'dnssec-keygen')r' r r# r% r( z-r� randomdevz@Path to a file containing random data to pass to 'dnssec-keygen')r' r# r r% r( z-s�settimezPath to 'dnssec-settime'z-k�no_zsk�
store_trueFz,Only apply policy to key-signing keys (KSKs))r' �actionr r% z-z�no_kskz-Only apply policy to zone-signing keys (ZSKs)z-fz--force�forcez Force updates to key events z even if they are in the pastz-qz--quiet�quietzUpdate keys silentlyz-vz --version�version)r0 r4 z)ERROR: -z and -k cannot be used together.z ERROR: dnssec-keygen not foundz ERROR: dnssec-settime not foundz!ERROR: Policy file "%s" not foundzdnssec-policy.confzSZone(s) to which the policy should be applied (default: all zones in the directory)z8Force updates to key events even if they are in the past)r r r �joinr �prefix�argparse�ArgumentParser�prog� add_argument�strr4 �
parse_argsr. r1 r r+ r- r) �existsZ
sysconfdir)r+ r- �parserr r r r r< 6 sb
r< c : C sH t � } | j| j| j| jd�}ytj| j�}W n2 tk
r^ } zt dt
|� � W Y d d }~X nX yt || j| j d�}W n2 tk
r� } zt dt
|� � W Y d d }~X nX yt
||d�}W n2 tk
r� } zt dt
|� � W Y d d }~X nX y |j|| j| j| j| jd� W n4 tk
�rB } zt dt
|� � W Y d d }~X nX d S ) N)Z keygen_pathZ settime_pathZ keys_pathr, z Unable to load DNSSEC policy: )r Zzonesz Unable to build key dictionary: )�contextz Unable to build key series: )ZkskZzskr2 r3 zUnable to apply policy: )r< r+ r- r r, r Z
dnssec_policyr) � Exceptionr r; r r! r Zenforce_policyr. r1 r2 r3 )r r? Zdp�eZkdZksr r r �main} s,
"""rB )N)Z
__future__r r r r7 Zglob�reZtimeZcalendar�pprint� collectionsr r9 Ziscr r r r r r r r r< rB r r r r �<module> s @
G isc/__pycache__/keydict.cpython-36.pyc 0000644 00000005013 14751155147 0013625 0 ustar 00 3
��f! � @ s: d dl mZ ddlmZ d dlZd dlZG dd� d�ZdS )� )� defaultdict� )�dnskeyNc @ sn e Zd ZdZedd� �ZdZg Zddd�Zdd� Z d d
� Z
d d � Z d
d� Z dd� Z
dd� Zdd� Zdd� ZdS )�keydictz> A dictionary of keys, indexed by name, algorithm, and key id c C s t t�S )N)r �dict� r r � /usr/lib/python3.6/keydict.py�<lambda> s zkeydict.<lambda>Nc K s� |j dd �| _|j dd �}|s:|j dd �p,d}| j|� nXxV|D ]N}d|krb|d d k rb|d }n|rr|j|�jptd}| j||�s@| jj|� q@W d S )NZkeyttl�zones�path�.)�get�_defttl�readallZpolicyZ directory�readone�_missing�append)�selfZdp�kwargsr
r �zoner r r �__init__ s
zkeydict.__init__c C sL t j tjj|d��}x2|D ]*}t||| j�}|| j|j |j |j < qW d S )Nz *.private)
�glob�osr �joinr r �_keydict�name�alg�keyid)r r �files�infile�keyr r r r , s
zkeydict.readallc C s� |j d�s|d7 }d| d }tjtjj||��}d}xR|D ]J}t||| j�}|j|krZq<|dkrh|jnd}|| j | |j
|j < d}q<W |S )Nr �Kz
+*.privateFT) �endswithr r r r r r �fullnamer r r r ) r r r �matchr �foundr r Zkeynamer r r r 3 s
zkeydict.readonec c sJ xD| j j� D ]6\}}x,|j� D ] \}}x|j� D ]
}|V q0W q W q W d S )N)r �items�values)r r �
algorithmsr �keysr r r r �__iter__D s zkeydict.__iter__c C s
| j | S )N)r )r r r r r � __getitem__J s zkeydict.__getitem__c C s
| j j� S )N)r r) )r r r r r
M s z
keydict.zonesc C s | j | j� S )N)r r) )r r r r r r( P s zkeydict.algorithmsc C s | j | | j� S )N)r r) )r r r r r r r) S s z keydict.keysc C s | j S )N)r )r r r r �missingV s zkeydict.missing)N)�__name__�
__module__� __qualname__�__doc__r r r r r r r r* r+ r
r( r) r, r r r r r s
r )� collectionsr � r r r r r r r r �<module> s isc/__pycache__/eventlist.cpython-36.pyc 0000644 00000007327 14751155147 0014220 0 ustar 00 3
��f� � @ s6 d dl mZ ddlT ddlT ddlT G dd� d�ZdS )� )� defaultdict� )�*c @ s` e Zd Zedd� �Zedd� �Ze� ZdZdd� Z ddd�Z
d d
� Z e d d � �Z
e d
d� �ZdS )� eventlistc C s t t�S )N)r �list� r r � /usr/lib/python3.6/eventlist.py�<lambda> s zeventlist.<lambda>c C s t t�S )N)r r r r r r r s Nc
C s ddddddg}|| _ x�|j� D ]�}| jj|� x�|| j� D ]�\}}xj|j� D ]^}xX|D ]P}|j|�}|snqZt|||�} |jr�| j | | j
| � qZ| j | | j
| � qZW qPW t | j | | dd� d �| j | |< t | j | | d
d� d �| j | |< q>W q W d S ) NZ SyncPublishZPublishZ
SyncDeleteZActivateZInactiveZDeletec S s | j S )N)�when)�eventr r r r + s z$eventlist.__init__.<locals>.<lambda>)�keyc S s | j S )N)r
)r r r r r - s )
�_kdictZzones�_zones�add�items�valuesZgettime�keyevent�sep�_K�append�_Z�sorted)
�selfZkdictZ
properties�zone�alg�keys�kZprop�t�er r r �__init__ s&
zeventlist.__init__c C s dd� }|s|}|r |dkr dnd}|r4|dkr4dnd}d }} d}
|rb|| j krb|d| � dS |r�d}
|s~| j|d||�}|s�| j|d||�} n`x^| j D ]T} | r�| | jj� kr�d}
| j| d||�}| r�| | jj� kr�d}
| j| d||�} q�W |
�s|d� dS |�o| S ) Nc _ s d S )Nr )�args�kwargsr r r �noop2 s z eventlist.coverage.<locals>.noop�KSKTFZZSKz!ERROR: No key events found for %szERROR: No key events found)r � checkzoner r r ) r r �keytype�until�outputr" Zno_zskZno_kskZkokZzok�found�zr r r �coverage1 s6 zeventlist.coveragec C sx d}|dkr| j | }n
| j| }xP|j� D ]D}|d||tj|�f � tj|| |||�}|rh|d� |on|}q,W |S )NTr# z9Checking scheduled %s events for zone %s, algorithm %s...zNo errors found)r r r �dnskeyZalgstrr �checkset) r r r% r& r' ZallokZkzr �okr r r r$ T s
zeventlist.checkzonec C sR | sd S |d| d j � d dd� x(| D ] }|d|jt|j�f dd� q*W d S )Nz r �:F)�skipz
%s: %s)ZshowtimeZwhat�reprr )�eventsetr' r r r r �showsetf s
zeventlist.showsetc
C sN t � }t � }d}xZ| D ]R}d}| s4|d j|jkr>|j|� |d j|jkr|j|� t � }|j|� qW |rz|j|� |s�|d| � dS d }} x�|D ]�}|r�tj|d j�|kr�|dtjdtj|�� � dS x |D ]}|j|| �\}} q�W t j
||� |�s|d| � dS | �s,|d| � dS | j |�s�|d | � dS q�W dS )
NFTr zERROR: No %s events foundzIgnoring events after %sz%a %b %d %H:%M:%S UTC %Yz*ERROR: No %s's are active after this eventz-ERROR: No %s's are published after this eventz=ERROR: No %s's are both active and published after this event) r r
r ZcalendarZtimegmZtimeZstrftimeZgmtimeZstatusr r2 � intersection)
r1 r% r& r' �groups�groupZ eventsfoundr ZactiveZ publishedr r r r, n sL
zeventlist.checkset)N)�__name__�
__module__� __qualname__r r r �setr r
r r* r$ � staticmethodr2 r, r r r r r s
# r N)� collectionsr r+ Zkeydictr r r r r r �<module> s isc/__pycache__/utils.cpython-36.opt-1.pyc 0000644 00000002303 14751155147 0014267 0 ustar 00 3
��f� � @ sT d dl Z e jdkr"d dlZd dlZd dd�Zdd� ZdZe jdkrHd Zned
�ZdS ) � N�nt� c
C s t jdkrt jjd| �S tj}d}tj}d }d}ytj||d|�}W n d}Y nX |s�d}|tj B }ytj||d|�}W n d}Y nX |s�d}|tj
B }ytj||d|�}W n d}Y nX |r�ytj |d�\}} W n d}Y nX tj |� |�rt jj|| �S t jjtj
� | �S )Nr z/usrzSoftware\ISC\BINDTr FZ
InstallDir)�os�name�path�join�win32con�HKEY_LOCAL_MACHINEZKEY_READ�win32apiZ RegOpenKeyExZKEY_WOW64_64KEYZKEY_WOW64_32KEYZRegQueryValueExZ RegCloseKeyZGetSystemDirectory)
ZbindirZhklmZ bind_subkeyZsamZh_keyZ key_foundZsam64Zsam32Z
named_base�_� r �/usr/lib/python3.6/utils.py�prefix sD
r c C s2 t jdkr d| jdd� d S d| jdd� d S )Nr �"z"\"�'z'\'')r r �replace)�sr r r
�
shellquote= s
r z"9.11.36-RedHat-9.11.36-16.el8_10.2z/etcZetc)r )r r r r
r r �versionZ
sysconfdirr r r r
�<module> s
)
isc/__pycache__/utils.cpython-36.pyc 0000644 00000002303 14751155147 0013330 0 ustar 00 3
��f� � @ sT d dl Z e jdkr"d dlZd dlZd dd�Zdd� ZdZe jdkrHd Zned
�ZdS ) � N�nt� c
C s t jdkrt jjd| �S tj}d}tj}d }d}ytj||d|�}W n d}Y nX |s�d}|tj B }ytj||d|�}W n d}Y nX |s�d}|tj
B }ytj||d|�}W n d}Y nX |r�ytj |d�\}} W n d}Y nX tj |� |�rt jj|| �S t jjtj
� | �S )Nr z/usrzSoftware\ISC\BINDTr FZ
InstallDir)�os�name�path�join�win32con�HKEY_LOCAL_MACHINEZKEY_READ�win32apiZ RegOpenKeyExZKEY_WOW64_64KEYZKEY_WOW64_32KEYZRegQueryValueExZ RegCloseKeyZGetSystemDirectory)
ZbindirZhklmZ bind_subkeyZsamZh_keyZ key_foundZsam64Zsam32Z
named_base�_� r �/usr/lib/python3.6/utils.py�prefix sD
r c C s2 t jdkr d| jdd� d S d| jdd� d S )Nr �"z"\"�'z'\'')r r �replace)�sr r r
�
shellquote= s
r z"9.11.36-RedHat-9.11.36-16.el8_10.2z/etcZetc)r )r r r r
r r �versionZ
sysconfdirr r r r
�<module> s
)
isc/__pycache__/keyzone.cpython-36.pyc 0000644 00000002344 14751155147 0013661 0 ustar 00 3
��f� � @ sJ d dl Z d dlZd dlZd dlmZmZ G dd� de�ZG dd� d�ZdS )� N)�Popen�PIPEc @ s e Zd ZdS )�KeyZoneExceptionN)�__name__�
__module__� __qualname__� r r � /usr/lib/python3.6/keyzone.pyr s r c @ s e Zd ZdZdd� ZdS )�keyzonez/reads a zone file to find data relevant to keysc
C s� d | _ d | _|sd S | s8tjj|� s8tj|tj� rDtd��d S d }}t|dd||gt t d�j
� \}}xv|j � D ]j}t |�t
k r�|jd�}tjd|�r�qv|j� } | s�t| d �|kr�t| d �}| d d krvt| d �}qvW || _|| _ d S )
Nz "named-compilezone" not foundz-o�-)�stdout�stderr�asciiz ^[:space:]*;� � ZDNSKEY)�maxttl�keyttl�os�path�isfile�access�X_OKr r r Z communicate�
splitlines�type�str�decode�re�search�split�int)
�self�name�filenameZczpathr r �fp�_�lineZfieldsr r r �__init__ s.
zkeyzone.__init__N)r r r �__doc__r& r r r r r
s r
) r �sysr �
subprocessr r � Exceptionr r
r r r r �<module> s
isc/__pycache__/rndc.cpython-36.opt-1.pyc 0000644 00000012000 14751155147 0014050 0 ustar 00 3
��f+ � @ sX d dl mZ d dlZd dlZd dlZd dlZd dlZd dlZd dlZG dd� de �Z
dS )� )� OrderedDictNc @ sl e Zd ZdZddddddd�Zd d
� Zd d � Zd dd�Zdd� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
d S ) �rndcz RNDC protocol client library� � � � � � )�md5Zsha1Zsha224Zsha256Zsha384Zsha512c C sb || _ |j� }|jd�r$|dd� }|| _tt|�| _tj|�| _ t
j dd�| _ d| _
| j� dS )z�Creates a persistent connection to RNDC and logs in
host - (ip, port) tuple
algo - HMAC algorithm: one of md5, sha1, sha224, sha256, sha384, sha512
(with optional prefix 'hmac-')
secret - HMAC secret, base64 encodedzhmac-� Nr � � i )�host�lower�
startswith�algo�getattr�hashlib�hlalgo�base64� b64decode�secret�randomZrandint�ser�nonce�_rndc__connect_login)�selfr r r � r �/usr/lib/python3.6/rndc.py�__init__$ s
z
rndc.__init__c C s t | j|d�d �S )z�Call a RNDC command, all parsing is done on the server side
cmd - a complete string with a command (eg 'reload zone example.com')
)�type�_data)�dict�_rndc__command)r �cmdr r r �call5 s z rndc.callFc C s t � }�x |j� D ]�\}}|r(|dkr(q|tjdt|��|jd� 7 }t|�tkrt|tjddt|��|jd� 7 }qt|�tkr�|tjddt|��| 7 }qt|�t kr�|tjddt|��| 7 }qt|�t kr�| j
|�}|tjddt|��| 7 }qt dt|� ��qW |S )N�_auth�B�asciiz>BIr � z#Cannot serialize element of type %s) � bytearray�items�struct�pack�len�encoder �str�bytesr �_rndc__serialize_dict�NotImplementedError)r �data� ignore_auth�rv�k�vZsdr r r Z__serialize_dict; s" "
zrndc.__serialize_dictc O s, | j d7 _ ttj� �}t||�}t� }t� |d< t� |d< t| j �|d d< t|�|d d< t|d �|d d< | jd k r�| j|d d< ||d < | j|d
d �}tj| j || j
�j � }t j
|�}| jd kr�tjd
|�|d d< n"ttjd| j| j |��|d d< | j|�}tjdt|�d d�| }|S )Nr r& �_ctrlZ_serZ_tim�< Z_exp�_noncer! T)r5 r
Z22s�hmd5ZB88s�hshaz>II� )r �int�timer r0 r r2 �hmac�newr r �digestr Z b64encoder r, r- r* � _rndc__algosr. ) r �args�kwargsZnowr4 �d�msg�hash�bhashr r r Z__prep_messageO s,
zrndc.__prep_messagec C s� | j d k r |d d | j kr dS | jdkr8|d d }n|d d dd � }t|�tkrb|jd �}|d
d t|�d 7 }tj|�}| j|d d
�}t j
| j || j �j
� }||kS )Nr9 r; Fr
r& r< r= r r( �=r> T)r5 )r r r r1 �decoder. r r r2 rA rB r r rC )r rH rJ Z remote_hashZmy_msgZmy_hashr r r Z __verify_msgj s
zrndc.__verify_msgc O s� | j ||�}| jj|�}|t|�kr,td��| jjd�}t|�dkrLtd��tjd|�\}}|dkrptd| ��|d8 }| jj|tj �}t|�|kr�td��t
|�t kr�t |�}| j
|�}| j|�s�td ��|S )
NzCannot send the message� zCan't read response headerz>IIr zWrong message version %dr> zCan't read response datazAuthentication failure)�_rndc__prep_message�socket�sendr. �IOErrorZrecvr, �unpackr3 Z MSG_WAITALLr r0 r* �_rndc__parse_message�_rndc__verify_msg) r rE rF rH Zsent�headerZlength�versionr4 r r r Z __commandy s(
zrndc.__commandc C s2 t j| j�| _ d | _| jdd�}|d d | _d S )NZnull)r r9 r; )rO Zcreate_connectionr r r# )r rH r r r Z__connect_login� s zrndc.__connect_loginc C s� d}|| }|d7 }|||| � j d�}||7 }|| }|d7 }tjd|||d � �d }|d7 }|||| � }||7 }||d � }|dkr�|||fS |dkr�t� } x(t|�dkr�| j|�\}
} }| | |
< q�W || |fS td| ��d S )Nr r r( z>Ir> r) zUnknown element type %d)rL r, rR r r. �_rndc__parse_elementr3 ) r �input�posZlabellen�labelr Zdatalenr4 �restrG Zilabel�valuer r r Z__parse_element� s*
zrndc.__parse_elementc C s8 t � }d }x(t|�dkr2| j|�\}}}|||< q W |S )Nr )r r. rW )r rX r6 ZhdatarZ r\ r r r Z__parse_message� s zrndc.__parse_messageN)F)�__name__�
__module__� __qualname__�__doc__rD r r% r2 rN rT r# r rW rS r r r r r s
r ) � collectionsr r@ r, r rA r r rO �objectr r r r r �<module> s isc/__pycache__/dnskey.cpython-36.pyc 0000644 00000032530 14751155147 0013472 0 ustar 00 3
��f @ � @ sJ d dl Z d dlZd dlZd dlmZmZ G dd� de�ZG dd� d�ZdS )� N)�Popen�PIPEc s e Zd Z� fdd�Z� ZS )�TimePastc s t t| �jd|||f � d S )Nz'%s time for key %s (%d) is already past)�superr �__init__)�self�key�prop�value)� __class__� � /usr/lib/python3.6/dnskey.pyr s zTimePast.__init__)�__name__�
__module__� __qualname__r �
__classcell__r r )r r
r s r c @ s� e Zd ZdZdqZdrZdsZdtd!d"�Zd#d$� Zd%d&� Z e
dud'd(��Z d)d*� Z e
d+d,� �Ze
d-d.� �Zdvd/d0�Ze
d1d2� �Ze
d3d4� �Ze
d5d6� �Ze
d7d8� �Zd9d:� Zd;d<� Zd=d>� Zd?d@� ZdAdB� ZdCdD� Zej� fdEdF�Z dGdH� Z ej� fdIdJ�Z dKdL� Z ej� fdMdN�Z dOdP� Z!ej� fdQdR�Z"dSdT� Z#ej� fdUdV�Z$dWdX� Z%ej� fdYdZ�Z&d[d\� Z'ej� fd]d^�Z(d_d`� Z)dadb� Z*dcdd� Z+dedf� Z,dgdh� Z-didj� Z.dwdkdl�Z/dxdmdn�Z0e
dodp� �Z1d S )y�dnskeyztAn individual DNSSEC key. Identified by path, name, algorithm, keyid.
Contains a dictionary of metadata events.�Created�Publish�Activate�Inactive�Delete�Revoke� DSPublish� SyncPublish�
SyncDeleteN�-P�-A�-I�-D�-R�-Psync�-Dsync�RSAMD5�DH�DSA�ECC�RSASHA1�NSEC3DSA� NSEC3RSASHA1� RSASHA256� RSASHA512�ECCGOST�ECDSAP256SHA256�ECDSAP384SHA384�ED25519�ED448c C s� t |t�r:t|�dkr:|p d| _|\}}}| j||||� |pLtjj|�pLd| _tjj|�}|j d�\}}}|dd� }t
|�}t
|j d�d �}| j||||� d S )N� �.�+� r ���) �
isinstance�tuple�len�_dir� fromtuple�os�path�dirname�basename�split�int)r r Z directory�keyttl�name�alg�keyidr r r
r & s
zdnskey.__init__c s� |j d�r|}|jd�}n|d }d|||f }| j| jr@tjpBd | d }| j| jr^tjp`d | d }|| _|| _t|�| _t|�| _ || _
t |d�} x�| D ]z� � d dkr�q�� j � }
|
s�q�|
d j
� dkr�d
} || _nd} |s�t|
d �n|| _t|
| �d @ d k�rd| _q�d| _q�W | j� t |d�} t� | _t� | _t� | _t� | _t� | _t� | _t� | _d | _x�| D ]�� � j� � � �sv� d dk�r��qv� fdd�dD �t� �g }
tdd� |
D ��}� d |� j� }� |d � j d�j� }|| j|< �qvW x�t j D ]�}d| j|< || jk�rn| j | j| �}|| j|< | j |�| j|< | j!|�| j|< | j| | j|< n(d | j|< d | j|< d | j|< d | j|< �qW | j� d S )Nr2 z
K%s+%03d+%05d� z.keyz.private�rr �;r4 �in�ch�hsr1 � TFZrUz!#c s g | ]}� j |��qS r )�find)�.0�c)�liner r
�
<listcomp>l s z$dnskey.fromtuple.<locals>.<listcomp>z:= c S s g | ]}|dkr|�qS )r4 r5 r )rM �posr r r
rP m s )rH rI rJ )"�endswith�rstripr9 r; �sep�keystrrB r@ rC rD �fullname�openr? �lower�ttl�close�dictZmetadata�_changed�_delete�_times�_fmttime� _timestamps� _original�_origttl�stripr8 �min�lstripr �_PROPS� parsetime�
formattime�
epochfromtime)r rB rC rD rA rV rU Zkey_fileZ private_fileZkfp�tokensZseptokenZpfpZ punctuation�foundr
r �tr )rO r
r: 5 sv
zdnskey.fromtuplec K sr |j dd�}g }d}| jd k r0|dt| j�g7 }xlttjtj�D ]Z\}}| s@| j| r\q@d}|| j krx| j | rxd}|r�dn| j
| } ||| g7 }d}q@W |�rn|d| j g| | j g }
|s�t
ddj|
� � y0t|
ttd �} | j� \} }
|
�r tt|
���W n8 tk
�r: } ztd
|t|�f ��W Y d d }~X nX d | _x*tjD ] }| j| | j|< d| j|< �qJW d S ) N�quietFTz-LZnonez-Kz# � )�stdout�stderrzunable to run %s: %s)�getrb �strrY �zipr rf �_OPTSr\ r] r_ r9 rU �print�joinr r � communicate� Exceptionr` ra )r Z settime_bin�kwargsrm �cmd�firstr �opt�deleteZwhenZfullcmd�pro rp �er r r
�commit� s<
" z
dnskey.commitc K sL | j dd�} |dd|dt|�g}
|r0|
d|g7 }
|r>|
jd� |rN|
d|g7 }
|rb|
d t|�g7 }
| r�tj| �}|
d
tj|�g7 }
|
r�tj|
�}|
d tj|
�g7 }
|
j|� | s�td d
j|
� � t|
t t d�}|j
� \}}|r�t dt|� ��y"|j � d j
d�}t|||�}|S t k
�rF } zt dt|� ��W Y d d }~X nX d S )Nrm Fz-qz-Kz-Lz-rz-fkz-az-bz-Pz-Az# rn )ro rp zunable to generate key: r �asciiz!unable to parse generated key: %s)rq rr �appendr �
timefromepochrh ru rv r r rw rx �
splitlines�decode)�cls�
keygen_bin� randomdevZkeys_dirrB rC ZkeysizerT rY �publish�activatery rm �
keygen_cmdrl r~ ro rp rU �newkeyr r r r
�generate� s:
zdnskey.generatec
K s� |j dd�}| j� s td| ��|dd| jd| jg}| jrL|dt| j�g7 }|r\|d|g7 }|rp|d t|�g7 }|s�td
d j|� � t |t
t
d �}|j � \}} | r�td
| ��y&|j � d j
d�}
t|
| j| j�} | S td| ��Y nX d S )Nrm Fz'predecessor key %s has no inactive datez-qz-Kz-Sz-Lz-rz-iz# rn )ro rp zunable to generate key: r r� z'unable to generate successor for key %s)rq �inactiverx r9 rU rY rr ru rv r r rw r� r� r ) r r� r� Z
prepublishry rm r� r~ ro rp rU r� r r r
�generate_successor� s, zdnskey.generate_successorc C s0 d }| t ttj��kr tj| }|r(|S d| S )Nz%03d)�ranger8 r � _ALGNAMES)rC rB r r r
�algstr� s
z
dnskey.algstrc C s6 | sd S | j � } y tjj| �S tk
r0 d S X d S )N)�upperr r� �index�
ValueError)rC r r r
�algnum� s z
dnskey.algnumc C s | j |p | j�S )N)r� rC )r rC r r r
�algname s zdnskey.algnamec C s
t j| �S )N)�timeZgmtime)�secsr r r
r� s zdnskey.timefromepochc C s t j| d�S )Nz %Y%m%d%H%M%S)r� Zstrptime)�stringr r r
rg s zdnskey.parsetimec C s
t j| �S )N)�calendarZtimegm)rl r r r
ri s zdnskey.epochfromtimec C s t jd| �S )Nz %Y%m%d%H%M%S)r� Zstrftime)rl r r r
rh s zdnskey.formattimec K s� |j dd�}| j| |kr d S | j| d k rR| j| |k rR| rRt| || j| ��|d kr�| j| d krldnd| j|< d| j|< d | j|< d | j|< d | j|< d S | j|�}|| j|< || j|< | j |�| j|< | j| | j| kr�dnd| j|< d S )N�forceFT)
rq r` ra r r\ r] r^ r_ r� rh )r r r� �nowry r� rl r r r
�setmeta s$
zdnskey.setmetac C s
| j | S )N)r^ )r r r r r
�gettime2 s zdnskey.gettimec C s
| j | S )N)r_ )r r r r r
�
getfmttime5 s zdnskey.getfmttimec C s
| j | S )N)r` )r r r r r
� gettimestamp8 s zdnskey.gettimestampc C s
| j d S )Nr )r` )r r r r
�created; s zdnskey.createdc C s
| j d S )Nr )r` )r r r r
� syncpublish> s zdnskey.syncpublishc K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
�setsyncpublishA s zdnskey.setsyncpublishc C s
| j d S )Nr )r` )r r r r
r� D s zdnskey.publishc K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
�
setpublishG s zdnskey.setpublishc C s
| j d S )Nr )r` )r r r r
r� J s zdnskey.activatec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setactivateM s zdnskey.setactivatec C s
| j d S )Nr )r` )r r r r
�revokeP s z
dnskey.revokec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setrevokeS s zdnskey.setrevokec C s
| j d S )Nr )r` )r r r r
r� V s zdnskey.inactivec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setinactiveY s zdnskey.setinactivec C s
| j d S )Nr )r` )r r r r
r} \ s z
dnskey.deletec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
� setdelete_ s zdnskey.setdeletec C s
| j d S )Nr )r` )r r r r
�
syncdeleteb s zdnskey.syncdeletec K s | j d||f|� d S )Nr )r� )r r� r� ry r r r
�
setsyncdeletee s zdnskey.setsyncdeletec C sR |d ks| j |krd S | jd kr0| j | _|| _ n | j|krHd | _|| _ n|| _ d S )N)rY rb )r rY r r r
�setttlh s
z
dnskey.setttlc C s | j r
dS dS )N�KSK�ZSK)rT )r r r r
�keytypet s zdnskey.keytypec C s d| j | j� | jf S )Nz
%s/%s/%05d)rB r� rD )r r r r
�__str__w s zdnskey.__str__c C s" d| j | j� | j| jrdndf S )Nz%s/%s/%05d (%s)r� r� )rB r� rD rT )r r r r
�__repr__{ s zdnskey.__repr__c C s | j � p| j� p| j� S )N)r� r� r� )r r r r
�date� s z dnskey.datec C s@ | j |j kr| j |j k S | j|jkr0| j|jk S | j� |j� k S )N)rB rC r� )r �otherr r r
�__lt__� s
z
dnskey.__lt__c C s� dd� }|s|}t tj� �}| j� }| j� }|s4dS |sT||krP|dt| � � dS ||krh||krhdS ||kr�|dt| �tj| j�p�df � dS ||k r�|dt| � � dS | jd k r�|| | jk r�|d t| �tj| j�p�df � dS dS )
Nc _ s d S )Nr )�argsry r r r
�noop� s z!dnskey.check_prepub.<locals>.noopFzFWARNING: Key %s is scheduled for
activation but not for publication.Tz�WARNING: %s is scheduled to be
published and activated at the same time. This
could result in a coverage gap if the zone was
previously signed. Activation should be at least
%s after publication.zone DNSKEY TTLz0WARNING: Key %s is active before it is publishedz�WARNING: Key %s is activated too soon
after publication; this could result in coverage
gaps due to resolver caches containing old data.
Activation should be at least %s after
publication.)r@ r� r� r� �reprr �durationrY )r �outputr� r� �ar~ r r r
� check_prepub� s< zdnskey.check_prepubc C s� dd� }|d kr|}|d kr"| j }|d kr>|dt| � � d }tj� }| j� }| j� }|s^dS |s~||krz|dt| � � dS ||k r�||k r�dS ||k r�|d t| � � dS || |k r�|d
t| �tj|�f � dS dS )
Nc _ s d S )Nr )r� ry r r r
r� � s z"dnskey.check_postpub.<locals>.noopz"WARNING: Key %s using default TTL.�< � FzEWARNING: Key %s is scheduled for
deletion but not for inactivation.Tz@WARNING: Key %s is scheduled for
deletion before inactivation.z�WARNING: Key %s scheduled for
deletion too soon after deactivation; this may
result in coverage gaps due to resolver caches
containing old data. Deletion should be at least
%s after inactivation.i i�Q )rY r� r� r} r� r r� )r r� Ztimespanr� r� �d�ir r r
�
check_postpub� s: zdnskey.check_postpubc C sz | sd S dddd d d g}g }xR|D ]J}| |d | |d }} |d kr"|j d
||d |d krbdndf � q"W dj|�S ) N�yearr� r� im �month� �day�hour�minute�secondr4 r z%d %s%s�srE z, i i�Q �3�)r� r� i i�Q � �' )r� r� i �Q )r� r� � )r� r� )r� r� )r� r4 )r� rv )r� Zunitsr� Zunit�vr r r
r� � s
(zdnskey.duration) r r r r r r r r r ) Nr r r r r Nr! r" )Nr# r$ r% r& r' r( r) r* Nr+ Nr, r- r. r/ r0 )NN)NN)N)N)NN)2r r r �__doc__rf rt r� r r: r� � classmethodr� r� � staticmethodr� r� r� r� rg ri rh r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r� r� r� r� r� r� r� r� r� r� r� r� r r r r
r sb
M% *
1
-r ) r; r� r� �
subprocessr r rx r r r r r r
�<module> s
isc/__pycache__/keyseries.cpython-36.pyc 0000644 00000010705 14751155147 0014200 0 ustar 00 3
��f" � @ sF d dl mZ ddlT ddlT ddlT ddlT d dlZG dd� d�ZdS )� )� defaultdict� )�*Nc @ sl e Zd Zedd� �Zedd� �Ze� ZdZdZ e
j
� dfdd�Z dd� Z d d
� Z
d d � Ze
j
� fd
d�ZdS )� keyseriesc C s t t�S )N)r �list� r r � /usr/lib/python3.6/keyseries.py�<lambda> s zkeyseries.<lambda>c C s t t�S )N)r r r r r r r s Nc C s� || _ || _t|j� �| _x�|j� D ]�}| jj|� x�|| j� D ]�\}}xh|j� D ]\}|j r�|j
� op|j
� |k s�| j | | j |� qT|j
� o�|j
� |k sT| j
| | j |� qTW | j | | j� | j
| | j� qBW q$W d S )N)�_kdict�_context�setZmissing�_zones�zones�add�items�values�sep�delete�_K�append�_Z�sort)�selfZkdict�now�context�zone�alg�keys�kr r r �__init__ s zkeyseries.__init__c c sb x\| j D ]R}xL| j| jgD ]<}||kr(qx,|| j� D ] \}}x|D ]
}|V qDW q6W qW qW d S )N)r
r r r )r r �
collectionr r �keyr r r �__iter__. s
zkeyseries.__iter__c C s" x | D ]}t dt|� � qW d S )Nz%s)�print�repr)r r r r r �dump7 s
zkeyseries.dumpc K s� |j dd�}|sd S |d }|jr>|j}|jp0d }|jp:d } n|j}|jpLd
}|jpVd} |j� }
|j � } |
sv|
|kr�|j
|� |}
| s�| |kr�|j |� |} |j � } d}
|s�|j
d|� |jd|� �n�| s�| | | k�r| �r(| | || |
k�r(|j
| | f|� |j| | | f|� n�| �s`|j
|| |
f|� |j|| | |
f|� n�| |k �rln�| | | k�r�|j
| | f|� |j| | | f|� np| | || |
k�r�|j
| | f|� |j| | | f|� n0|j
|| |
f|� |j|| | |
f|� n�|j� }| �s8| | ||
k�rL|j| | f|� nN|�sj|j|| |
f|� n0|||
k �rzn || | k �r�|j| | f|� |j|jk�r�|j|j� |}x�|dd � D ]�}|�s |j
d|� |j d|� |j
d|� |jd|� |j|jk�r�|j|j� �q�|j � } | | }
|j | f|� |j
|
f|� |j
| | f|� |j| | | f|� |j| | f|� |j|jk�r�|j|j� |}�q�W x�|�r>|j � �r>|j � ||j k �r>|j| jd f|� |j| jd | jd
|f|�}|j
|j � | f|� |j|j � | f|� |j|� |}�q�W |j
d|� |jd|� x"|D ]}|j| jd f|� �q^W d S )N�forceFr � i�Q i, r Z settime_path� keygen_path� randomdevi �' i �' i �' i �' )N)N)N)N)N)N)N)N)�getr Zksk_rollperiodZksk_prepublishZksk_postpublishZzsk_rollperiodZzsk_prepublishZzsk_postpublishZpublishZactivateZ
setpublishZ setactivateZinactiveZ setinactiveZ setdeleter �keyttlZttlZsetttlZcoverageZcommitr Zgenerate_successorr )r r �policyr �kwargsr& r! ZrpZprepubZpostpub�p�a�iZfudge�d�prevr r r � fixseries; s�
zkeyseries.fixseriesc K s� |j d| j�}|j d| jj dd ��}|j dd�}�x�|D �]�}g }|j|�} |pX| jpXd}| j}
tj|
�} d|ks||d r�t| j | | �dkr�tj
| jd | jd
|||
| j d| j p�d f|�} | j | | j
| � |j
| j | � d |ks�|d �rht| j| | �dk�rXtj
| jd | jd
|||
| jd
| j �p<d f|�} | j| | j
| � |j
| j| � x�|D ]�}
x||
j� D ]p\}}|| k�r��q|y| j|| |f|� W n@ tk
�r� } z"td|tj| �t|�f ��W Y d d }~X nX �q|W �qnW q8W d S )Nr �dirZ keys_pathr& F�.Zkskr r( r) i ZzskTz %s/%s: %s)r* r
r r, Z directory� algorithm�dnskey�algnum�lenr ZgenerateZ zsk_keysizer+ r r Z ksk_keysizer r3 � ExceptionZalgstr�str)r Zpoliciesr r- r Zkeys_dirr& r � collectionsr, r r8 r r r6 r �er r r �enforce_policy� sL
zkeyseries.enforce_policy)�__name__�
__module__� __qualname__r r r r r
r
r �timer r" r% r3 r> r r r r r s vr )r< r r7 ZkeydictZkeyeventr, rB r r r r r �<module> s isc/__pycache__/parsetab.cpython-36.opt-1.pyc 0000644 00000015224 14751155147 0014736 0 ustar 00 3
��f} � ; @ s
d Z dZdZddddddd d
d d d
g d ddd d d d d d d d g fddddddd d
d d d
g d ddd d d d d d d d g fddddddd d
dd d dd
ddgd ddd d d d d dd d dd d d gfddddd d
d d d
g dd d d d d d d d g fddgd d gfdddgd d d gfdd gd!d"gfddd#d$d%d&d'dgdd(d)d*d+d,d-d(gfdddd.gdd/d/d0gfd d1d d!dddd d(d/d2ddg
d! d! d
d d1 d d! d d d d3ddg
fd d(d/d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLd.dMdNdOdPdQd"d d0dRdSdTdUdVg*d d d d d d
dWd= d> dX d# d$ d% dY dd4 d3 d5 d d6 d dZ d7 d8 d9 d: d[d d d( dC d2 dd& d' dD d/ d d? d@ dA dB g*fd3ddZddWdd[dgdXdXdXdXd; d d< d gfd3ddZddWdd[dgd#d#d#d#d; d d< d gfd3ddZddWdd[dgd$d$d$d$d; d d< d gfd3ddZddWdd[dgd%d%d%d%d; d d< d gfd3ddZddWdd[dgdYdYdYdYd; d d< d gfd3ddZddWdd[dgd&d&d&d&d; d d< d gfd3ddZddWdd[dgd'd'd'd'd; d d< d gfddddgd d d d gfddddgddd d gfdZddWdd[dgdJdOd; d d< d gfdXdYd)d*d+d,d-gd.d.d.d.d.dUdVgfdXdYd)d*d+gdMdMdMdMdMgfd\�Zi ZxXej� D ]L\ZZx@eed ed �D ]*\Z Z
e ek �r�i ee < e
ee e< �q�W �q�W [dgdgfdgdgfddgdd
gfddgddgfddgddgfddgd d gfdgd1gfddgddQgfd d1dgd2ddgfd2gd4gfddgd5d6gfd3gdZgfd3dZgd7dKgfd3ddZdgd8dBd8dBgfd3ddZdgd9dCd9dCgfd3ddZdgd:dDd:dDgfd3ddZdgd;dEd;dEgfd3ddZdgd<dHd<dHgfd3ddZdgd=dFd=dFgfd3ddZdgd>dId>dIgfdgdgfddgd?dPgfddgd@d@gfddgdAdAgfddgdGdGgfdXdYd)d*d+gdLdNdRdSdTgfd]�Z i Z xXe j� D ]L\ZZx@eed ed �D ]*\Z Z
e e k �r�i e e < e
e e e< �q�W �q�W [ d^d_dd`d`d`fdadbddcdddefdfdbddcdddgfdhdiddjdddkfdldmddndddofdpdmddndddqfdrdmddndddsfdtduddvdddwfdxduddvdddyfdzduddvddd{fd|d}dd~dddfd�d}dd~ddd�fd�d}dd~ddd�fd�d}dd~ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�dd�ddd�fd�d�d�d dd�dfg6Z
d`S ( z3.8ZLALRZ C2FE91AF256AF1CCEB499107DA2CFE7E� � � � � � � �
� �. �> � � � � � � �/ �M �X � �; � � �= � �P �
� �< � �O �( �) �* �, �- � �E �F �G �I �J �C � �R � � � � � � � � �! �" �# �$ �% �& �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �? �@ �B �D �H �K �L �N �S �T �U �V �W �A �' �+ � �Q )ZALGORITHM_POLICYZZONEZPOLICYz$endZALGNAMEZSTRZQSTRINGZKEYTYPEZ
DATESUFFIX�LBRACE�SEMIZCOVERAGEZ ROLL_PERIODZ PRE_PUBLISHZ POST_PUBLISHZKEYTTLZKEY_SIZEZSTANDBYZ DIRECTORYZ ALGORITHM�RBRACE�NUMBERZNONE)�
policylist�init�policy�
alg_policy� zone_policy� named_policy�domain�name�
new_policy�alg_option_group�policy_option_group�alg_option_list�
alg_option�coverage_option�rollperiod_option�prepublish_option�postpublish_option�
keyttl_option�keysize_option�standby_option�policy_option_list�
policy_option�
parent_option�directory_option�algorithm_option�durationzS' -> policylistzS'Nzpolicylist -> init policyr^ Z p_policylistz policy.pyi z policylist -> policylist policyi zinit -> <empty>r_ Zp_initi zpolicy -> alg_policyr` Zp_policyi zpolicy -> zone_policyi zpolicy -> named_policyi z name -> STRre Zp_namei zname -> KEYTYPEi zname -> DATESUFFIXi z
domain -> STRrd Zp_domaini! zdomain -> QSTRINGi" zdomain -> KEYTYPEi# zdomain -> DATESUFFIXi$ znew_policy -> <empty>rf Z p_new_policyi+ zGalg_policy -> ALGORITHM_POLICY ALGNAME new_policy alg_option_group SEMIra Z p_alg_policyi/ z>zone_policy -> ZONE domain new_policy policy_option_group SEMIrb Z
p_zone_policyi6 z?named_policy -> POLICY name new_policy policy_option_group SEMIrc Zp_named_policyi= zduration -> NUMBERrw Z p_duration_1iC zduration -> NONEZ p_duration_2iH z duration -> NUMBER DATESUFFIXZ p_duration_3iM z7policy_option_group -> LBRACE policy_option_list RBRACErh Zp_policy_option_groupi` z(policy_option_list -> policy_option SEMIrr Zp_policy_option_listid z;policy_option_list -> policy_option_list policy_option SEMIie z policy_option -> parent_optionrs Zp_policy_optionii z!policy_option -> directory_optionij z policy_option -> coverage_optionik z"policy_option -> rollperiod_optionil z"policy_option -> prepublish_optionim z#policy_option -> postpublish_optionin z policy_option -> keysize_optionio z!policy_option -> algorithm_optionip z policy_option -> keyttl_optioniq z policy_option -> standby_optionir z1alg_option_group -> LBRACE alg_option_list RBRACErg Zp_alg_option_groupiv z"alg_option_list -> alg_option SEMIri Zp_alg_option_listiz z2alg_option_list -> alg_option_list alg_option SEMIi{ z alg_option -> coverage_optionrj Z p_alg_optioni z alg_option -> rollperiod_optioni� z alg_option -> prepublish_optioni� z alg_option -> postpublish_optioni� zalg_option -> keyttl_optioni� z alg_option -> keysize_optioni� z alg_option -> standby_optioni� z parent_option -> POLICY namert Zp_parent_optioni� z%directory_option -> DIRECTORY QSTRINGru Zp_directory_optioni� z$coverage_option -> COVERAGE durationrk Zp_coverage_optioni� z1rollperiod_option -> ROLL_PERIOD KEYTYPE durationrl Zp_rollperiod_optioni� z1prepublish_option -> PRE_PUBLISH KEYTYPE durationrm Zp_prepublish_optioni� z3postpublish_option -> POST_PUBLISH KEYTYPE durationrn Zp_postpublish_optioni� z)keysize_option -> KEY_SIZE KEYTYPE NUMBERrp Zp_keysize_optioni� z(standby_option -> STANDBY KEYTYPE NUMBERrq Zp_standby_optioni� z keyttl_option -> KEYTTL durationro Zp_keyttl_optioni� z%algorithm_option -> ALGORITHM ALGNAMErv Zp_algorithm_optioni� )Z _tabversionZ
_lr_methodZ
_lr_signatureZ_lr_action_itemsZ
_lr_action�itemsZ_kZ_v�zipZ_xZ_yZ_lr_goto_itemsZ_lr_gotoZ_lr_productions� rz rz � /usr/lib/python3.6/parsetab.py�<module> s� � � � � � � � isc/__pycache__/__init__.cpython-36.pyc 0000644 00000000744 14751155147 0013736 0 ustar 00 3
��f� �
@ sj d ddddddddd d
d d g
Z d
dlT d
dlT d
dlT d
dlT d
dlT d
dlT d
dlT d
dlT d
dl T dS )ZcheckdsZcoverageZkeymgrZdnskeyZ eventlistZkeydictZkeyeventZ keyseriesZkeyzoneZpolicyZparsetabZrndcZutils� )�*N)
�__all__Z
isc.dnskeyZ
isc.eventlistZ isc.keydictZ isc.keyeventZ
isc.keyseriesZ isc.keyzoneZ
isc.policyZisc.rndcZ isc.utils� r r � /usr/lib/python3.6/__init__.py�<module> s
isc/__pycache__/policy.cpython-36.pyc 0000644 00000046217 14751155147 0013503 0 ustar 00 3
��f2g � @ s: d dl Z d dljZd dljZd dlT d dlmZ G dd� d�ZG dd� d�ZG dd � d e �Z
G d
d � d �Z e d k�r6d dl
Z
e
jd
dkr�ee
jd �Zej� Zej� ed
d�Zeje� nxe
jd
dk�r6y4e e
jd ddd�Zeejd � eejd�� W n2 e k
�r4 Z zeejd � W Y ddZ[X nX dS )� N)�*)�copyc
@ s� e Zd Zd3Zed4 Zi ZdZdZdZdZ dZ
d d � Z d d � Z d d!� Z
d"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Zd2S )5� PolicyLex�POLICY�ALGORITHM_POLICY�ZONE� ALGORITHM� DIRECTORY�KEYTTL�KEY_SIZE� ROLL_PERIOD� PRE_PUBLISH� POST_PUBLISH�COVERAGE�STANDBY�NONE�
DATESUFFIX�KEYTYPE�ALGNAME�STR�QSTRING�NUMBER�LBRACE�RBRACE�SEMIz z (//|\#).*z\{z\}�;c C s |j j|jjd�7 _dS )z\n+�
N)�lexer�lineno�value�count)�self�t� r# � /usr/lib/python3.6/policy.py� t_newline7 s zPolicyLex.t_newlinec C s |j j|jjd�7 _dS )z/\*(.|\n)*?\*/r N)r r r r )r! r" r# r# r$ � t_comment; s zPolicyLex.t_commentc C s t jd|j�jd�j� |_|S )z�(?i)(?<=[0-9 \t])(y(?:ears|ear|ea|e)?|mo(?:nths|nth|nt|n)?|w(?:eeks|eek|ee|e)?|d(?:ays|ay|a)?|h(?:ours|our|ou|o)?|mi(?:nutes|nute|nut|nu|n)?|s(?:econds|econd|econ|eco|ec|e)?)\bz (?i)(y|mo|w|d|h|mi|s)([a-z]*)� )�re�matchr �group�lower)r! r" r# r# r$ � t_DATESUFFIX? s zPolicyLex.t_DATESUFFIXc C s |j j� |_ |S )z(?i)\b(KSK|ZSK)\b)r �upper)r! r" r# r# r$ � t_KEYTYPED s zPolicyLex.t_KEYTYPEc C s |j j� |_ |S )z�(?i)\b(RSAMD5|DH|DSA|NSEC3DSA|ECC|RSASHA1|NSEC3RSASHA1|RSASHA256|RSASHA512|ECCGOST|ECDSAP256SHA256|ECDSAP384SHA384|ED25519|ED448)\b)r r- )r! r" r# r# r$ � t_ALGNAMEI s zPolicyLex.t_ALGNAMEc C s | j j|jd�|_|S )z[A-Za-z._-][\w._-]*r )� reserved_map�getr �type)r! r" r# r# r$ �t_STRN s zPolicyLex.t_STRc C s& | j j|jd�|_|jdd� |_|S )z"([^"\n]|(\\"))*"r r' ���)r0 r1 r r2 )r! r" r# r# r$ � t_QSTRINGS s zPolicyLex.t_QSTRINGc C s t |j�|_|S )z\d+)�intr )r! r" r# r# r$ �t_NUMBERY s zPolicyLex.t_NUMBERc C s" t d|jd � |jjd� d S )NzIllegal character '%s'r r' )�printr r �skip)r! r" r# r# r$ �t_error^ s zPolicyLex.t_errorc K sb dt t�krtjdd�}n
tdd�}x"| jD ]}|| j|j� j|�< q,W tjf d| i|��| _d S )N� maketrans�_�-�object) �dir�strr; �reservedr0 r+ � translate�lexr )r! �kwargsZtrans�rr# r# r$ �__init__b s
zPolicyLex.__init__c C s. | j j|� x | j j� }|s P t|� qW d S )N)r �input�tokenr8 )r! �textr" r# r# r$ �testk s
zPolicyLex.testN)
r r r r r r
r r r
r r r r ) r r r r r r r r r )�__name__�
__module__� __qualname__rA �tokensr0 Zt_ignoreZt_ignore_olcommentZt_LBRACEZt_RBRACEZt_SEMIr% r& r, r. r/ r3 r5 r7 r: rF rJ r# r# r# r$ r sN r c
@ s� e Zd ZdZdZdZdZdZdZdZ dZ
dZ dZ dZ
dZdZdZdZdZddgddgddgddgddgddgddgdddddd� Zddd�Zd d
� Zd d � Zd
d� Zdd� Zdd� ZdS )�PolicyFNi i i ) �DSA�NSEC3DSA�RSAMD5�RSASHA1� NSEC3RSASHA1� RSASHA256� RSASHA512�ECCGOST�ECDSAP256SHA256�ECDSAP384SHA384�ED25519�ED448c C s || _ || _|| _d S )N)�name� algorithm�parent)r! r\ r] r^ r# r# r$ rF � s zPolicy.__init__c C sF d| j r dp"| jrdp"| jr dp"d| jp*d| jr8| jjp:d| jrRdt| j� d pTd| jp\d| jrlt| j�pnd| j r~t| j �p�d| j
r�t| j
�p�d| j r�t| j �p�d| j r�t| j �p�d| j
r�t| j
�p�d| jr�t| j�p�d| jr�t| j�p�d| jr�t| j�p�d| j�rt| j��pd| j�r(t| j��p*d| j�r>t| j��p@df S ) Na %spolicy %s:
inherits %s
directory %s
algorithm %s
coverage %s
ksk_keysize %s
zsk_keysize %s
ksk_rollperiod %s
zsk_rollperiod %s
ksk_prepublish %s
ksk_postpublish %s
zsk_prepublish %s
zsk_postpublish %s
ksk_standby %s
zsk_standby %s
keyttl %s
z constructed zzone z
algorithm � ZUNKNOWN�None�")�is_constructed�is_zone�is_algr\ r^ � directoryr@ r] �coverage� ksk_keysize� zsk_keysize�ksk_rollperiod�zsk_rollperiod�ksk_prepublish�ksk_postpublish�zsk_prepublish�zsk_postpublish� ksk_standby� zsk_standby�keyttl)r! r# r# r$ �__repr__� s(
zPolicy.__repr__c C s |d | ko|d kS S )Nr r' r# )r! Zkey_sizeZ
size_ranger# r# r$ Z
__verify_size� s zPolicy.__verify_sizec C s | j S )N)r\ )r! r# r# r$ �get_name� s zPolicy.get_namec C s | j S )N)rb )r! r# r# r$ � constructed� s zPolicy.constructedc C s$ | j r:| jdk r:| j| j kr:t| j � dd| j| j f fS | j rj| jdk rj| j| j krjdd| j| j f fS | jr�| jdk r�| j| jkr�dd| j| jf fS | jr�| jdk r�| j| jkr�dd| j| jf fS | j o�| jo�| jo�| j| j | j k�rdd| j| j| j f fS | j�rL| j�rL| j�rL| j| j | jk�rLdd| j| j| jf fS | jdk �r | jj | j�}|dk �r�| j
| j |��s�dd
| j |f fS | j
| j |��s�dd | j |f fS | jd k�r�| j d dk�r�dd | j fS | jd k�r| j d dk�rdd | j fS | jd k�r d| _ d| _ d!S )"zr Check if the values in the policy make sense
:return: True/False if the policy passes validation
NFz6KSK pre-publish period (%d) exceeds rollover period %dz7KSK post-publish period (%d) exceeds rollover period %dz6ZSK pre-publish period (%d) exceeds rollover period %dz7ZSK post-publish period (%d) exceeds rollover period %dz%KSK pre/post-publish periods (%d/%d) z"combined exceed rollover period %dz%ZSK pre/post-publish periods (%d/%d) z&KSK key size %d outside valid range %sz&ZSK key size %d outside valid range %srP rQ �@ r z$KSK key size %d not divisible by 64 zas required for DSAz$ZSK key size %d not divisible by 64 rW rX rY rZ r[ Tr_ zGKSK pre/post-publish periods (%d/%d) combined exceed rollover period %dzGZSK pre/post-publish periods (%d/%d) combined exceed rollover period %d)rP rQ z7KSK key size %d not divisible by 64 as required for DSA)rP rQ z7ZSK key size %d not divisible by 64 as required for DSA)rW rX rY rZ r[ )Tr_ )
ri rk r8 rl rj rm rn r] �valid_key_sz_per_algor1 �_Policy__verify_sizerg rh )r! Z key_sz_ranger# r# r$ �validate� s�
zPolicy.validate)NNN)rK rL rM rc rd rb ri rj rk rm rl rn rg rh ro rp rq rf re rv rF rr rw rs rt rx r# r# r# r$ rO v sD
&rO c @ s e Zd ZdS )�PolicyExceptionN)rK rL rM r# r# r# r$ ry ) s ry c @ s. e Zd Zi Zi Zi ZdZdZdZdEdd�Z dd� Z
dd� Z d d
� Z d d � Z
d
d� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z d1d2� Z d3d4� Z!d5d6� Z"d7d8� Z#d9d:� Z$d;d<� Z%d=d>� Z&d?d@� Z'dAdB� Z(dCdD� Z)dS )F�
dnssec_policyNTc K s� t � | _| jj| _d|kr"d|d< d|kr2d|d< tjf d| i|��| _| jd� t� }d |_d|_d|_ d|_
t |�| j d< d| j d _d| j d _
d | j d _ t |�| j d
< d
| j d
_d
| j d
_
d | j d
_ t |�| j d < d | j d _d | j d _
t |�| j d < d | j d _d | j d _
t |�| j d
< d
| j d
_d
| j d
_
t |�| j d< d| j d _d| j d _
t |�| j d< d| j d _d| j d _
t |�| j d< d| j d _d| j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
|�r�| j|� d S )N�debugF� write_tables�modulea policy global { algorithm rsasha256;
key-size ksk 2048;
key-size zsk 2048;
roll-period ksk 0;
roll-period zsk 1y;
pre-publish ksk 1mo;
pre-publish zsk 1mo;
post-publish ksk 1mo;
post-publish zsk 1mo;
standby ksk 0;
standby zsk 0;
keyttl 1h;
coverage 6mo; };
policy default { policy global; };Ti rP i rQ rR rS rT rU rV rW rX rY rZ r[ )r �plexrN �yacc�parser�setuprO r] rd rg rh r �
alg_policyr\ �load)r! �filenamerD �pr# r# r$ rF 4 s|
zdnssec_policy.__init__c C sH || _ d| _t|��$}|j� }d| jj_| jj|� W d Q R X d | _ d S )NTr ) r� �initial�open�readr~ r r r� �parse)r! r� �frI r# r# r$ r� � s
zdnssec_policy.loadc C s d| _ d| jj_| jj|� d S )NTr )r� r~ r r r� r� )r! rI r# r# r$ r� � s
zdnssec_policy.setupc K s` |j � }d }|| jkr | j| }|d krBt| jd �}||_d|_|jd kr�|jpZ| jd }x|rr|j rr|j}q^W |r~|jp�d |_|j| jkr�| j|j }nt d��|j
d kr�|jp�| jd }x|d k r�|j
r�|j}q�W |o�|j
|_
|j d k�r:|j�p| jd }x |�r"|j �r"|j}�qW |�r2|j �p6|j |_ |j d k�r�|j�pV| jd }x |j�rv|j �rv|j}�qZW |�r�|j �p�|j |_ |j
d k�r�|j�p�| jd }x |j�r�|j
�r�|j}�q�W |�r�|j
�p�|j
|_
|jd k�r6|j�p�| jd }x |j�r |j �r |j}�qW |�r.|j�p2|j|_|jd k�r�|j�pR| jd }x |j�rr|j �rr|j}�qVW |�r�|j�p�|j|_|jd k�r�|j�p�| jd }x |j�r�|j �r�|j}�q�W |�r�|j�p�|j|_|jd k�r2|j�p�| jd }x |j�r|j �r|j}�q�W |�r*|j�p.|j|_|jd k�r�|j�pN| jd }x |j�rn|j �rn|j}�qRW |�r~|j�p�|j|_|jd k�r�|j�p�| jd }x |j�r�|j �r�|j}�q�W |�r�|j�p�|j|_|jd k�r(|j�p�| jd }x |d k �r|j �r|j}�q�W |�o$|j|_d|k�s>|d �r\|j� \}}|�s\t |��d S |S )N�defaultTzalgorithm not foundZ
novalidate)r+ � zone_policyr � named_policyr\ rb r] r^ r� ry re rf rg rh ri rj rk rm rl rn rq rx ) r! ZzonerD �zr� r^ ZapZvalid�msgr# r# r$ �policy� s�
zdnssec_policy.policyc C s dS )zBpolicylist : init policy
| policylist policyNr# )r! r� r# r# r$ � p_policylist
s zdnssec_policy.p_policylistc C s
d| _ dS )zinit :FN)r� )r! r� r# r# r$ �p_init s zdnssec_policy.p_initc C s dS )zTpolicy : alg_policy
| zone_policy
| named_policyNr# )r! r� r# r# r$ �p_policy s zdnssec_policy.p_policyc C s |d |d< dS )zAname : STR
| KEYTYPE
| DATESUFFIXr' r Nr# )r! r� r# r# r$ �p_name s zdnssec_policy.p_namec C s, |d j � |d< tjd|d �s(td��dS )zcdomain : STR
| QSTRING
| KEYTYPE
| DATESUFFIXr' r z^[\w.-][\w.-]*$zinvalid domainN)�stripr( r) ry )r! r� r# r# r$ �p_domain s zdnssec_policy.p_domainc C s t � | _dS )z new_policy :N)rO �current)r! r� r# r# r$ � p_new_policy* s zdnssec_policy.p_new_policyc C s( |d | j _d| j _| j | j|d < dS )zFalg_policy : ALGORITHM_POLICY ALGNAME new_policy alg_option_group SEMI� TN)r� r\ rd r� )r! r� r# r# r$ � p_alg_policy. s zdnssec_policy.p_alg_policyc C s8 |d j d�| j_d| j_| j| j|d j d�j� < dS )z=zone_policy : ZONE domain new_policy policy_option_group SEMIr� �.TN)�rstripr� r\ rc r� r+ )r! r� r# r# r$ �
p_zone_policy5 s zdnssec_policy.p_zone_policyc C s$ |d | j _| j | j|d j� < dS )z>named_policy : POLICY name new_policy policy_option_group SEMIr� N)r� r\ r� r+ )r! r� r# r# r$ �p_named_policy< s z dnssec_policy.p_named_policyc C s |d |d< dS )zduration : NUMBERr' r Nr# )r! r� r# r# r$ � p_duration_1B s zdnssec_policy.p_duration_1c C s d|d< dS )zduration : NONENr r# )r! r� r# r# r$ � p_duration_2G s zdnssec_policy.p_duration_2c C s� |d dkr |d d |d< n�|d dkr<|d d |d< n�|d dkrZ|d d |d< n||d d
krx|d d |d< n^|d d kr�|d d
|d< n@|d dkr�|d d |d< n"|d dkr�|d |d< nt d��dS )z duration : NUMBER DATESUFFIXr� �yr' i�3�r �moi �' �wi�: �di�Q �hi Zmi�< �szinvalid durationN)ry )r! r� r# r# r$ � p_duration_3L s zdnssec_policy.p_duration_3c C s dS )z6policy_option_group : LBRACE policy_option_list RBRACENr# )r! r� r# r# r$ �p_policy_option_group_ s z#dnssec_policy.p_policy_option_groupc C s dS )zmpolicy_option_list : policy_option SEMI
| policy_option_list policy_option SEMINr# )r! r� r# r# r$ �p_policy_option_listc s z"dnssec_policy.p_policy_option_listc C s dS )a� policy_option : parent_option
| directory_option
| coverage_option
| rollperiod_option
| prepublish_option
| postpublish_option
| keysize_option
| algorithm_option
| keyttl_option
| standby_optionNr# )r! r� r# r# r$ �p_policy_optionh s z dnssec_policy.p_policy_optionc C s dS )z0alg_option_group : LBRACE alg_option_list RBRACENr# )r! r� r# r# r$ �p_alg_option_groupu s z dnssec_policy.p_alg_option_groupc C s dS )z^alg_option_list : alg_option SEMI
| alg_option_list alg_option SEMINr# )r! r� r# r# r$ �p_alg_option_listy s z dnssec_policy.p_alg_option_listc C s dS )a alg_option : coverage_option
| rollperiod_option
| prepublish_option
| postpublish_option
| keyttl_option
| keysize_option
| standby_optionNr# )r! r� r# r# r$ � p_alg_option~ s zdnssec_policy.p_alg_optionc C s | j |d j� | j_dS )zparent_option : POLICY namer� N)r� r+ r� r^ )r! r� r# r# r$ �p_parent_option� s z dnssec_policy.p_parent_optionc C s |d | j _dS )z$directory_option : DIRECTORY QSTRINGr� N)r� re )r! r� r# r# r$ �p_directory_option� s z dnssec_policy.p_directory_optionc C s |d | j _dS )z#coverage_option : COVERAGE durationr� N)r� rf )r! r� r# r# r$ �p_coverage_option� s z dnssec_policy.p_coverage_optionc C s* |d dkr|d | j _n |d | j _dS )z0rollperiod_option : ROLL_PERIOD KEYTYPE durationr� �KSK� N)r� ri rj )r! r� r# r# r$ �p_rollperiod_option� s z!dnssec_policy.p_rollperiod_optionc C s* |d dkr|d | j _n |d | j _dS )z0prepublish_option : PRE_PUBLISH KEYTYPE durationr� r� r� N)r� rk rm )r! r� r# r# r$ �p_prepublish_option� s z!dnssec_policy.p_prepublish_optionc C s* |d dkr|d | j _n |d | j _dS )z2postpublish_option : POST_PUBLISH KEYTYPE durationr� r� r� N)r� rl rn )r! r� r# r# r$ �p_postpublish_option� s z"dnssec_policy.p_postpublish_optionc C s* |d dkr|d | j _n |d | j _dS )z(keysize_option : KEY_SIZE KEYTYPE NUMBERr� r� r� N)r� rg rh )r! r� r# r# r$ �p_keysize_option� s z dnssec_policy.p_keysize_optionc C s* |d dkr|d | j _n |d | j _dS )z'standby_option : STANDBY KEYTYPE NUMBERr� r� r� N)r� ro rp )r! r� r# r# r$ �p_standby_option� s z dnssec_policy.p_standby_optionc C s |d | j _dS )z keyttl_option : KEYTTL durationr� N)r� rq )r! r� r# r# r$ �p_keyttl_option� s z dnssec_policy.p_keyttl_optionc C s |d | j _dS )z$algorithm_option : ALGORITHM ALGNAMEr� N)r� r] )r! r� r# r# r$ �p_algorithm_option� s z dnssec_policy.p_algorithm_optionc C sd |r.t d| jpd| jrdnd|j|jf � n2| js`td| jp@d| jrJdnd|rV|jpXdf ��d S )Nz %s%s%d:syntax error near '%s'r_ �:z %s%s%d:unexpected end of inputr )r8 r� r r r� ry )r! r� r# r# r$ �p_error� s zdnssec_policy.p_error)N)*rK rL rM r� r� r� r� r� r� rF r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r# r$ rz , sN
_
h
rz �__main__r' rC r� )r{ r� T)r| r{ r� znonexistent.zone) r( Zply.lexrC Zply.yaccr �stringr r rO � Exceptionry rz rK �sys�argvr� �filer� rI �closer~ rJ Zppr8 r� r� �e�argsr# r# r# r$ �<module> s6
` 4 !
isc/__pycache__/eventlist.cpython-36.opt-1.pyc 0000644 00000007327 14751155147 0015157 0 ustar 00 3
��f� � @ s6 d dl mZ ddlT ddlT ddlT G dd� d�ZdS )� )� defaultdict� )�*c @ s` e Zd Zedd� �Zedd� �Ze� ZdZdd� Z ddd�Z
d d
� Z e d d � �Z
e d
d� �ZdS )� eventlistc C s t t�S )N)r �list� r r � /usr/lib/python3.6/eventlist.py�<lambda> s zeventlist.<lambda>c C s t t�S )N)r r r r r r r s Nc
C s ddddddg}|| _ x�|j� D ]�}| jj|� x�|| j� D ]�\}}xj|j� D ]^}xX|D ]P}|j|�}|snqZt|||�} |jr�| j | | j
| � qZ| j | | j
| � qZW qPW t | j | | dd� d �| j | |< t | j | | d
d� d �| j | |< q>W q W d S ) NZ SyncPublishZPublishZ
SyncDeleteZActivateZInactiveZDeletec S s | j S )N)�when)�eventr r r r + s z$eventlist.__init__.<locals>.<lambda>)�keyc S s | j S )N)r
)r r r r r - s )
�_kdictZzones�_zones�add�items�valuesZgettime�keyevent�sep�_K�append�_Z�sorted)
�selfZkdictZ
properties�zone�alg�keys�kZprop�t�er r r �__init__ s&
zeventlist.__init__c C s dd� }|s|}|r |dkr dnd}|r4|dkr4dnd}d }} d}
|rb|| j krb|d| � dS |r�d}
|s~| j|d||�}|s�| j|d||�} n`x^| j D ]T} | r�| | jj� kr�d}
| j| d||�}| r�| | jj� kr�d}
| j| d||�} q�W |
�s|d� dS |�o| S ) Nc _ s d S )Nr )�args�kwargsr r r �noop2 s z eventlist.coverage.<locals>.noop�KSKTFZZSKz!ERROR: No key events found for %szERROR: No key events found)r � checkzoner r r ) r r �keytype�until�outputr" Zno_zskZno_kskZkokZzok�found�zr r r �coverage1 s6 zeventlist.coveragec C sx d}|dkr| j | }n
| j| }xP|j� D ]D}|d||tj|�f � tj|| |||�}|rh|d� |on|}q,W |S )NTr# z9Checking scheduled %s events for zone %s, algorithm %s...zNo errors found)r r r �dnskeyZalgstrr �checkset) r r r% r& r' ZallokZkzr �okr r r r$ T s
zeventlist.checkzonec C sR | sd S |d| d j � d dd� x(| D ] }|d|jt|j�f dd� q*W d S )Nz r �:F)�skipz
%s: %s)ZshowtimeZwhat�reprr )�eventsetr' r r r r �showsetf s
zeventlist.showsetc
C sN t � }t � }d}xZ| D ]R}d}| s4|d j|jkr>|j|� |d j|jkr|j|� t � }|j|� qW |rz|j|� |s�|d| � dS d }} x�|D ]�}|r�tj|d j�|kr�|dtjdtj|�� � dS x |D ]}|j|| �\}} q�W t j
||� |�s|d| � dS | �s,|d| � dS | j |�s�|d | � dS q�W dS )
NFTr zERROR: No %s events foundzIgnoring events after %sz%a %b %d %H:%M:%S UTC %Yz*ERROR: No %s's are active after this eventz-ERROR: No %s's are published after this eventz=ERROR: No %s's are both active and published after this event) r r
r ZcalendarZtimegmZtimeZstrftimeZgmtimeZstatusr r2 � intersection)
r1 r% r& r' �groups�groupZ eventsfoundr ZactiveZ publishedr r r r, n sL
zeventlist.checkset)N)�__name__�
__module__� __qualname__r r r �setr r
r r* r$ � staticmethodr2 r, r r r r r s
# r N)� collectionsr r+ Zkeydictr r r r r r �<module> s isc/__pycache__/keyseries.cpython-36.opt-1.pyc 0000644 00000010705 14751155147 0015137 0 ustar 00 3
��f" � @ sF d dl mZ ddlT ddlT ddlT ddlT d dlZG dd� d�ZdS )� )� defaultdict� )�*Nc @ sl e Zd Zedd� �Zedd� �Ze� ZdZdZ e
j
� dfdd�Z dd� Z d d
� Z
d d � Ze
j
� fd
d�ZdS )� keyseriesc C s t t�S )N)r �list� r r � /usr/lib/python3.6/keyseries.py�<lambda> s zkeyseries.<lambda>c C s t t�S )N)r r r r r r r s Nc C s� || _ || _t|j� �| _x�|j� D ]�}| jj|� x�|| j� D ]�\}}xh|j� D ]\}|j r�|j
� op|j
� |k s�| j | | j |� qT|j
� o�|j
� |k sT| j
| | j |� qTW | j | | j� | j
| | j� qBW q$W d S )N)�_kdict�_context�setZmissing�_zones�zones�add�items�values�sep�delete�_K�append�_Z�sort)�selfZkdict�now�context�zone�alg�keys�kr r r �__init__ s zkeyseries.__init__c c sb x\| j D ]R}xL| j| jgD ]<}||kr(qx,|| j� D ] \}}x|D ]
}|V qDW q6W qW qW d S )N)r
r r r )r r �
collectionr r �keyr r r �__iter__. s
zkeyseries.__iter__c C s" x | D ]}t dt|� � qW d S )Nz%s)�print�repr)r r r r r �dump7 s
zkeyseries.dumpc K s� |j dd�}|sd S |d }|jr>|j}|jp0d }|jp:d } n|j}|jpLd
}|jpVd} |j� }
|j � } |
sv|
|kr�|j
|� |}
| s�| |kr�|j |� |} |j � } d}
|s�|j
d|� |jd|� �n�| s�| | | k�r| �r(| | || |
k�r(|j
| | f|� |j| | | f|� n�| �s`|j
|| |
f|� |j|| | |
f|� n�| |k �rln�| | | k�r�|j
| | f|� |j| | | f|� np| | || |
k�r�|j
| | f|� |j| | | f|� n0|j
|| |
f|� |j|| | |
f|� n�|j� }| �s8| | ||
k�rL|j| | f|� nN|�sj|j|| |
f|� n0|||
k �rzn || | k �r�|j| | f|� |j|jk�r�|j|j� |}x�|dd � D ]�}|�s |j
d|� |j d|� |j
d|� |jd|� |j|jk�r�|j|j� �q�|j � } | | }
|j | f|� |j
|
f|� |j
| | f|� |j| | | f|� |j| | f|� |j|jk�r�|j|j� |}�q�W x�|�r>|j � �r>|j � ||j k �r>|j| jd f|� |j| jd | jd
|f|�}|j
|j � | f|� |j|j � | f|� |j|� |}�q�W |j
d|� |jd|� x"|D ]}|j| jd f|� �q^W d S )N�forceFr � i�Q i, r Z settime_path� keygen_path� randomdevi �' i �' i �' i �' )N)N)N)N)N)N)N)N)�getr Zksk_rollperiodZksk_prepublishZksk_postpublishZzsk_rollperiodZzsk_prepublishZzsk_postpublishZpublishZactivateZ
setpublishZ setactivateZinactiveZ setinactiveZ setdeleter �keyttlZttlZsetttlZcoverageZcommitr Zgenerate_successorr )r r �policyr �kwargsr& r! ZrpZprepubZpostpub�p�a�iZfudge�d�prevr r r � fixseries; s�
zkeyseries.fixseriesc K s� |j d| j�}|j d| jj dd ��}|j dd�}�x�|D �]�}g }|j|�} |pX| jpXd}| j}
tj|
�} d|ks||d r�t| j | | �dkr�tj
| jd | jd
|||
| j d| j p�d f|�} | j | | j
| � |j
| j | � d |ks�|d �rht| j| | �dk�rXtj
| jd | jd
|||
| jd
| j �p<d f|�} | j| | j
| � |j
| j| � x�|D ]�}
x||
j� D ]p\}}|| k�r��q|y| j|| |f|� W n@ tk
�r� } z"td|tj| �t|�f ��W Y d d }~X nX �q|W �qnW q8W d S )Nr �dirZ keys_pathr& F�.Zkskr r( r) i ZzskTz %s/%s: %s)r* r
r r, Z directory� algorithm�dnskey�algnum�lenr ZgenerateZ zsk_keysizer+ r r Z ksk_keysizer r3 � ExceptionZalgstr�str)r Zpoliciesr r- r Zkeys_dirr& r � collectionsr, r r8 r r r6 r �er r r �enforce_policy� sL
zkeyseries.enforce_policy)�__name__�
__module__� __qualname__r r r r r
r
r �timer r" r% r3 r> r r r r r s vr )r< r r7 ZkeydictZkeyeventr, rB r r r r r �<module> s isc/__pycache__/coverage.cpython-36.opt-1.pyc 0000644 00000014323 14751155147 0014727 0 ustar 00 3
��f�& � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dl Z d dl
m Z dZ d dl
mZmZmZmZmZmZ dd� Zdad d
� Zd d � Zd
d� Zddd�Zdd� Zdd� ZdS )� )�print_functionN)� defaultdictzdnssec-coverage)�dnskey� eventlist�keydict�keyevent�keyzone�utilsc O s t | |� tjd� d S )N� )�print�sys�exit)�args�kwargs� r � /usr/lib/python3.6/coverage.py�fatal s
r Tc O sJ d|kr |d }|j dd� nd}tr,dan |r8td� | rFt| |� dS )zuoutput text, adding a vertical space this is *not* the first
first section being printed since a call to vreset()�skipNTF� )�pop�
_firstliner )r r r r r r �output' s r c C s da dS )zreset vertical spacingTN)r r r r r �vreset8 s r c C s� | j � } yt| �S tk
r$ Y nX tjd�}|j| �}|sJtd| ��|j� \}}t|�}|j� }|jd�rx|d S |jd�r�|d S |jd�r�|d S |jd �r�|d
S |jd �r�|d S |jd
�r�|d S |jd�r�|S td| ��dS )z� convert a formatted time (e.g., 1y, 6mo, 15mi, etc) into seconds
:param s: String with some text representing a time interval
:return: Integer with the number of seconds in the time interval
z([0-9][0-9]*)\s*([A-Za-z]*)zCannot parse %s�yi�3��moi �' �wi�: �di�Q �hi Zmi�< �szInvalid suffix %sN) �strip�int�
ValueError�re�compile�match�groups�lower�
startswith)r �r�m�nZunitr r r �
parse_timeA s6
r, c C s� |}| s(t jj|� s(t j|t j� r�t jd }|s>t jj}xB|jt j�D ]2}t jj || �}t jj|�rzt j|t j�rzP d}qLW |S )a1 find the location of a specified command. if a default is supplied
and it works, we use it; otherwise we search PATH for a match.
:param command: string with a command to look for in the path
:param default: default location to use
:return: detected location for the desired command
�PATHN)
�os�path�isfile�access�X_OK�environ�defpath�split�pathsep�join)Zcommand�defaultZfpathr/ Z directoryr r r �set_pathk s $
r9 c 0 C sD t dtjjtjd�d��} tjtd d d�}|j dt
dddFd � |j d d
dt
ddd� |j ddt
ddd� |j ddt
ddd� |j dd t
d dd� |j d d d t
d!dd� |j d"d#| t
d$d
d� |j d%d&t
d'd(dd)� |j d*d+d,d-d.d/� |j d0d1d,d-d2d/� |j d3d4d5d,d-d6d/� |j d7d8d9tj d:� |j � }|j
�rJ|j�rJtd;� n*|j
�sZ|j�rn|j
�rfd<nd=|_nd|_|j�r�t|j�d>k�r�td?� d@dA� |jD �|_y |j�r�t|j�}||_W n tk
�r� Y nX y |j�r�t|j�}||_W n tk
�r Y nX y |j�r(t|j�}||_W n tk
�r@ Y nX y<|j�r||j}t|j�}|dBk�rnd|_ntj� | |_W n tk
�r� Y nX |j�r�|j�r�|S |j�r*|j�r*y:t|jdB |j|j �}|j�p�|j|_|j�p�|j|_W n4 t k
�r( } zt dC|j |� W Y dd}~X nX |j�s@t dD� dE|_|S )Gz8Read command line arguments, set global 'args' structureznamed-compilezoneZsbinz: checks future zDNSKEY coverage for a zone)� description�zone�*Nzzone(s) to checkz%(default: all zones in the directory))�type�nargsr8 �helpz-Kr/ �.z&a directory containing keys to process�dir)�destr8 r= r? �metavarz-f�filenamezzone master file�file)rB r= r? rC z-m�maxttlz the longest TTL in the zone(s)�timez-d�keyttlzthe DNSKEY TTLz-r�resignZ1944000z:the RRSIG refresh interval in seconds [default: 22.5 days]z-c� compilezonezpath to 'named-compilezone'z-l�
checklimit�0zDLength of time to check for DNSSEC coverage [default: 0 (unlimited)])rB r= r8 r? rC z-z�no_ksk�
store_trueFz#Only check zone-signing keys (ZSKs))rB �actionr8 r? z-k�no_zskz"Only check key-signing keys (KSKs)z-Dz--debugZ
debug_modezTurn on debugging outputz-vz --version�version)rO rQ z)ERROR: -z and -k cannot be used together.ZKSKZZSKr
z)ERROR: -f can only be used with one zone.c S s4 g | ],}t |�d kr,|d dkr,|dd� n|�qS )r
r@ N���rR )�len)�.0�xr r r �
<listcomp>� s z parse_args.<locals>.<listcomp>r z"Unable to load zone data from %s: z�WARNING: Maximum TTL value was not specified. Using 1 week
(604800 seconds); re-run with the -m option to get more
accurate results.i�: z5zone(s) to check(default: all zones in the directory)) r9 r. r/ r7 r �prefix�argparse�ArgumentParser�prog� add_argument�strrQ �
parse_argsrP rM r �keytyperD rS r; rF r, r" rH rI rK rG r rJ � Exceptionr r ) rJ �parserr r* �kr) Zlimr; �er r r r] � s�
"r] c ( C sp t � } td� yt| j| j| jd�}W n2 tk
rX } ztdt|� � W Y d d }~X nX x<|D ]4}|j t
� |j r�|j t
� q`|j t
| j
| j � q`W t
d� t� y t|�}W n2 tk
r� } ztdt|� � W Y d d }~X nX d}| j�s|jd | j| jt
��sXd}nJxH| jD ]>}y |j|| j| jt
��s6d}W n t
d| � Y nX �qW tj|�rfd nd
� d S ) Nz;PHASE 1--Loading keys to check for internal timing problems)r/ ZzonesrH z'ERROR: Unable to build key dictionary: z9PHASE 2--Scanning future key events for coverage failuresz#ERROR: Unable to build event list: FTz&ERROR: Coverage check failed for zone r
r )r] r r r/ r; rH r_ r r\ Z check_prepubr �sepZ
check_postpubrF rI r r Zcoverager^ rK r r
)r Zkdrb �keyZelist�errorsr; r r r �main� s: "
"
rf )N) Z
__future__r r. r rX Zglobr# rG Zcalendar�pprint� collectionsr rZ Ziscr r r r r r r r r r r, r9 r] rf r r r r �<module> s& *
x isc/__pycache__/policy.cpython-36.opt-1.pyc 0000644 00000046217 14751155147 0014442 0 ustar 00 3
��f2g � @ s: d dl Z d dljZd dljZd dlT d dlmZ G dd� d�ZG dd� d�ZG dd � d e �Z
G d
d � d �Z e d k�r6d dl
Z
e
jd
dkr�ee
jd �Zej� Zej� ed
d�Zeje� nxe
jd
dk�r6y4e e
jd ddd�Zeejd � eejd�� W n2 e k
�r4 Z zeejd � W Y ddZ[X nX dS )� N)�*)�copyc
@ s� e Zd Zd3Zed4 Zi ZdZdZdZdZ dZ
d d � Z d d � Z d d!� Z
d"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Zd2S )5� PolicyLex�POLICY�ALGORITHM_POLICY�ZONE� ALGORITHM� DIRECTORY�KEYTTL�KEY_SIZE� ROLL_PERIOD� PRE_PUBLISH� POST_PUBLISH�COVERAGE�STANDBY�NONE�
DATESUFFIX�KEYTYPE�ALGNAME�STR�QSTRING�NUMBER�LBRACE�RBRACE�SEMIz z (//|\#).*z\{z\}�;c C s |j j|jjd�7 _dS )z\n+�
N)�lexer�lineno�value�count)�self�t� r# � /usr/lib/python3.6/policy.py� t_newline7 s zPolicyLex.t_newlinec C s |j j|jjd�7 _dS )z/\*(.|\n)*?\*/r N)r r r r )r! r" r# r# r$ � t_comment; s zPolicyLex.t_commentc C s t jd|j�jd�j� |_|S )z�(?i)(?<=[0-9 \t])(y(?:ears|ear|ea|e)?|mo(?:nths|nth|nt|n)?|w(?:eeks|eek|ee|e)?|d(?:ays|ay|a)?|h(?:ours|our|ou|o)?|mi(?:nutes|nute|nut|nu|n)?|s(?:econds|econd|econ|eco|ec|e)?)\bz (?i)(y|mo|w|d|h|mi|s)([a-z]*)� )�re�matchr �group�lower)r! r" r# r# r$ � t_DATESUFFIX? s zPolicyLex.t_DATESUFFIXc C s |j j� |_ |S )z(?i)\b(KSK|ZSK)\b)r �upper)r! r" r# r# r$ � t_KEYTYPED s zPolicyLex.t_KEYTYPEc C s |j j� |_ |S )z�(?i)\b(RSAMD5|DH|DSA|NSEC3DSA|ECC|RSASHA1|NSEC3RSASHA1|RSASHA256|RSASHA512|ECCGOST|ECDSAP256SHA256|ECDSAP384SHA384|ED25519|ED448)\b)r r- )r! r" r# r# r$ � t_ALGNAMEI s zPolicyLex.t_ALGNAMEc C s | j j|jd�|_|S )z[A-Za-z._-][\w._-]*r )� reserved_map�getr �type)r! r" r# r# r$ �t_STRN s zPolicyLex.t_STRc C s& | j j|jd�|_|jdd� |_|S )z"([^"\n]|(\\"))*"r r' ���)r0 r1 r r2 )r! r" r# r# r$ � t_QSTRINGS s zPolicyLex.t_QSTRINGc C s t |j�|_|S )z\d+)�intr )r! r" r# r# r$ �t_NUMBERY s zPolicyLex.t_NUMBERc C s" t d|jd � |jjd� d S )NzIllegal character '%s'r r' )�printr r �skip)r! r" r# r# r$ �t_error^ s zPolicyLex.t_errorc K sb dt t�krtjdd�}n
tdd�}x"| jD ]}|| j|j� j|�< q,W tjf d| i|��| _d S )N� maketrans�_�-�object) �dir�strr; �reservedr0 r+ � translate�lexr )r! �kwargsZtrans�rr# r# r$ �__init__b s
zPolicyLex.__init__c C s. | j j|� x | j j� }|s P t|� qW d S )N)r �input�tokenr8 )r! �textr" r# r# r$ �testk s
zPolicyLex.testN)
r r r r r r
r r r
r r r r ) r r r r r r r r r )�__name__�
__module__� __qualname__rA �tokensr0 Zt_ignoreZt_ignore_olcommentZt_LBRACEZt_RBRACEZt_SEMIr% r& r, r. r/ r3 r5 r7 r: rF rJ r# r# r# r$ r sN r c
@ s� e Zd ZdZdZdZdZdZdZdZ dZ
dZ dZ dZ
dZdZdZdZdZddgddgddgddgddgddgddgdddddd� Zddd�Zd d
� Zd d � Zd
d� Zdd� Zdd� ZdS )�PolicyFNi i i ) �DSA�NSEC3DSA�RSAMD5�RSASHA1� NSEC3RSASHA1� RSASHA256� RSASHA512�ECCGOST�ECDSAP256SHA256�ECDSAP384SHA384�ED25519�ED448c C s || _ || _|| _d S )N)�name� algorithm�parent)r! r\ r] r^ r# r# r$ rF � s zPolicy.__init__c C sF d| j r dp"| jrdp"| jr dp"d| jp*d| jr8| jjp:d| jrRdt| j� d pTd| jp\d| jrlt| j�pnd| j r~t| j �p�d| j
r�t| j
�p�d| j r�t| j �p�d| j r�t| j �p�d| j
r�t| j
�p�d| jr�t| j�p�d| jr�t| j�p�d| jr�t| j�p�d| j�rt| j��pd| j�r(t| j��p*d| j�r>t| j��p@df S ) Na %spolicy %s:
inherits %s
directory %s
algorithm %s
coverage %s
ksk_keysize %s
zsk_keysize %s
ksk_rollperiod %s
zsk_rollperiod %s
ksk_prepublish %s
ksk_postpublish %s
zsk_prepublish %s
zsk_postpublish %s
ksk_standby %s
zsk_standby %s
keyttl %s
z constructed zzone z
algorithm � ZUNKNOWN�None�")�is_constructed�is_zone�is_algr\ r^ � directoryr@ r] �coverage� ksk_keysize� zsk_keysize�ksk_rollperiod�zsk_rollperiod�ksk_prepublish�ksk_postpublish�zsk_prepublish�zsk_postpublish� ksk_standby� zsk_standby�keyttl)r! r# r# r$ �__repr__� s(
zPolicy.__repr__c C s |d | ko|d kS S )Nr r' r# )r! Zkey_sizeZ
size_ranger# r# r$ Z
__verify_size� s zPolicy.__verify_sizec C s | j S )N)r\ )r! r# r# r$ �get_name� s zPolicy.get_namec C s | j S )N)rb )r! r# r# r$ � constructed� s zPolicy.constructedc C s$ | j r:| jdk r:| j| j kr:t| j � dd| j| j f fS | j rj| jdk rj| j| j krjdd| j| j f fS | jr�| jdk r�| j| jkr�dd| j| jf fS | jr�| jdk r�| j| jkr�dd| j| jf fS | j o�| jo�| jo�| j| j | j k�rdd| j| j| j f fS | j�rL| j�rL| j�rL| j| j | jk�rLdd| j| j| jf fS | jdk �r | jj | j�}|dk �r�| j
| j |��s�dd
| j |f fS | j
| j |��s�dd | j |f fS | jd k�r�| j d dk�r�dd | j fS | jd k�r| j d dk�rdd | j fS | jd k�r d| _ d| _ d!S )"zr Check if the values in the policy make sense
:return: True/False if the policy passes validation
NFz6KSK pre-publish period (%d) exceeds rollover period %dz7KSK post-publish period (%d) exceeds rollover period %dz6ZSK pre-publish period (%d) exceeds rollover period %dz7ZSK post-publish period (%d) exceeds rollover period %dz%KSK pre/post-publish periods (%d/%d) z"combined exceed rollover period %dz%ZSK pre/post-publish periods (%d/%d) z&KSK key size %d outside valid range %sz&ZSK key size %d outside valid range %srP rQ �@ r z$KSK key size %d not divisible by 64 zas required for DSAz$ZSK key size %d not divisible by 64 rW rX rY rZ r[ Tr_ zGKSK pre/post-publish periods (%d/%d) combined exceed rollover period %dzGZSK pre/post-publish periods (%d/%d) combined exceed rollover period %d)rP rQ z7KSK key size %d not divisible by 64 as required for DSA)rP rQ z7ZSK key size %d not divisible by 64 as required for DSA)rW rX rY rZ r[ )Tr_ )
ri rk r8 rl rj rm rn r] �valid_key_sz_per_algor1 �_Policy__verify_sizerg rh )r! Z key_sz_ranger# r# r$ �validate� s�
zPolicy.validate)NNN)rK rL rM rc rd rb ri rj rk rm rl rn rg rh ro rp rq rf re rv rF rr rw rs rt rx r# r# r# r$ rO v sD
&rO c @ s e Zd ZdS )�PolicyExceptionN)rK rL rM r# r# r# r$ ry ) s ry c @ s. e Zd Zi Zi Zi ZdZdZdZdEdd�Z dd� Z
dd� Z d d
� Z d d � Z
d
d� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Z d+d,� Z d-d.� Z d/d0� Z d1d2� Z d3d4� Z!d5d6� Z"d7d8� Z#d9d:� Z$d;d<� Z%d=d>� Z&d?d@� Z'dAdB� Z(dCdD� Z)dS )F�
dnssec_policyNTc K s� t � | _| jj| _d|kr"d|d< d|kr2d|d< tjf d| i|��| _| jd� t� }d |_d|_d|_ d|_
t |�| j d< d| j d _d| j d _
d | j d _ t |�| j d
< d
| j d
_d
| j d
_
d | j d
_ t |�| j d < d | j d _d | j d _
t |�| j d < d | j d _d | j d _
t |�| j d
< d
| j d
_d
| j d
_
t |�| j d< d| j d _d| j d _
t |�| j d< d| j d _d| j d _
t |�| j d< d| j d _d| j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
t |�| j d< d| j d _d| j d _
d | j d _ d | j d _
|�r�| j|� d S )N�debugF� write_tables�modulea policy global { algorithm rsasha256;
key-size ksk 2048;
key-size zsk 2048;
roll-period ksk 0;
roll-period zsk 1y;
pre-publish ksk 1mo;
pre-publish zsk 1mo;
post-publish ksk 1mo;
post-publish zsk 1mo;
standby ksk 0;
standby zsk 0;
keyttl 1h;
coverage 6mo; };
policy default { policy global; };Ti rP i rQ rR rS rT rU rV rW rX rY rZ r[ )r �plexrN �yacc�parser�setuprO r] rd rg rh r �
alg_policyr\ �load)r! �filenamerD �pr# r# r$ rF 4 s|
zdnssec_policy.__init__c C sH || _ d| _t|��$}|j� }d| jj_| jj|� W d Q R X d | _ d S )NTr ) r� �initial�open�readr~ r r r� �parse)r! r� �frI r# r# r$ r� � s
zdnssec_policy.loadc C s d| _ d| jj_| jj|� d S )NTr )r� r~ r r r� r� )r! rI r# r# r$ r� � s
zdnssec_policy.setupc K s` |j � }d }|| jkr | j| }|d krBt| jd �}||_d|_|jd kr�|jpZ| jd }x|rr|j rr|j}q^W |r~|jp�d |_|j| jkr�| j|j }nt d��|j
d kr�|jp�| jd }x|d k r�|j
r�|j}q�W |o�|j
|_
|j d k�r:|j�p| jd }x |�r"|j �r"|j}�qW |�r2|j �p6|j |_ |j d k�r�|j�pV| jd }x |j�rv|j �rv|j}�qZW |�r�|j �p�|j |_ |j
d k�r�|j�p�| jd }x |j�r�|j
�r�|j}�q�W |�r�|j
�p�|j
|_
|jd k�r6|j�p�| jd }x |j�r |j �r |j}�qW |�r.|j�p2|j|_|jd k�r�|j�pR| jd }x |j�rr|j �rr|j}�qVW |�r�|j�p�|j|_|jd k�r�|j�p�| jd }x |j�r�|j �r�|j}�q�W |�r�|j�p�|j|_|jd k�r2|j�p�| jd }x |j�r|j �r|j}�q�W |�r*|j�p.|j|_|jd k�r�|j�pN| jd }x |j�rn|j �rn|j}�qRW |�r~|j�p�|j|_|jd k�r�|j�p�| jd }x |j�r�|j �r�|j}�q�W |�r�|j�p�|j|_|jd k�r(|j�p�| jd }x |d k �r|j �r|j}�q�W |�o$|j|_d|k�s>|d �r\|j� \}}|�s\t |��d S |S )N�defaultTzalgorithm not foundZ
novalidate)r+ � zone_policyr � named_policyr\ rb r] r^ r� ry re rf rg rh ri rj rk rm rl rn rq rx ) r! ZzonerD �zr� r^ ZapZvalid�msgr# r# r$ �policy� s�
zdnssec_policy.policyc C s dS )zBpolicylist : init policy
| policylist policyNr# )r! r� r# r# r$ � p_policylist
s zdnssec_policy.p_policylistc C s
d| _ dS )zinit :FN)r� )r! r� r# r# r$ �p_init s zdnssec_policy.p_initc C s dS )zTpolicy : alg_policy
| zone_policy
| named_policyNr# )r! r� r# r# r$ �p_policy s zdnssec_policy.p_policyc C s |d |d< dS )zAname : STR
| KEYTYPE
| DATESUFFIXr' r Nr# )r! r� r# r# r$ �p_name s zdnssec_policy.p_namec C s, |d j � |d< tjd|d �s(td��dS )zcdomain : STR
| QSTRING
| KEYTYPE
| DATESUFFIXr' r z^[\w.-][\w.-]*$zinvalid domainN)�stripr( r) ry )r! r� r# r# r$ �p_domain s zdnssec_policy.p_domainc C s t � | _dS )z new_policy :N)rO �current)r! r� r# r# r$ � p_new_policy* s zdnssec_policy.p_new_policyc C s( |d | j _d| j _| j | j|d < dS )zFalg_policy : ALGORITHM_POLICY ALGNAME new_policy alg_option_group SEMI� TN)r� r\ rd r� )r! r� r# r# r$ � p_alg_policy. s zdnssec_policy.p_alg_policyc C s8 |d j d�| j_d| j_| j| j|d j d�j� < dS )z=zone_policy : ZONE domain new_policy policy_option_group SEMIr� �.TN)�rstripr� r\ rc r� r+ )r! r� r# r# r$ �
p_zone_policy5 s zdnssec_policy.p_zone_policyc C s$ |d | j _| j | j|d j� < dS )z>named_policy : POLICY name new_policy policy_option_group SEMIr� N)r� r\ r� r+ )r! r� r# r# r$ �p_named_policy< s z dnssec_policy.p_named_policyc C s |d |d< dS )zduration : NUMBERr' r Nr# )r! r� r# r# r$ � p_duration_1B s zdnssec_policy.p_duration_1c C s d|d< dS )zduration : NONENr r# )r! r� r# r# r$ � p_duration_2G s zdnssec_policy.p_duration_2c C s� |d dkr |d d |d< n�|d dkr<|d d |d< n�|d dkrZ|d d |d< n||d d
krx|d d |d< n^|d d kr�|d d
|d< n@|d dkr�|d d |d< n"|d dkr�|d |d< nt d��dS )z duration : NUMBER DATESUFFIXr� �yr' i�3�r �moi �' �wi�: �di�Q �hi Zmi�< �szinvalid durationN)ry )r! r� r# r# r$ � p_duration_3L s zdnssec_policy.p_duration_3c C s dS )z6policy_option_group : LBRACE policy_option_list RBRACENr# )r! r� r# r# r$ �p_policy_option_group_ s z#dnssec_policy.p_policy_option_groupc C s dS )zmpolicy_option_list : policy_option SEMI
| policy_option_list policy_option SEMINr# )r! r� r# r# r$ �p_policy_option_listc s z"dnssec_policy.p_policy_option_listc C s dS )a� policy_option : parent_option
| directory_option
| coverage_option
| rollperiod_option
| prepublish_option
| postpublish_option
| keysize_option
| algorithm_option
| keyttl_option
| standby_optionNr# )r! r� r# r# r$ �p_policy_optionh s z dnssec_policy.p_policy_optionc C s dS )z0alg_option_group : LBRACE alg_option_list RBRACENr# )r! r� r# r# r$ �p_alg_option_groupu s z dnssec_policy.p_alg_option_groupc C s dS )z^alg_option_list : alg_option SEMI
| alg_option_list alg_option SEMINr# )r! r� r# r# r$ �p_alg_option_listy s z dnssec_policy.p_alg_option_listc C s dS )a alg_option : coverage_option
| rollperiod_option
| prepublish_option
| postpublish_option
| keyttl_option
| keysize_option
| standby_optionNr# )r! r� r# r# r$ � p_alg_option~ s zdnssec_policy.p_alg_optionc C s | j |d j� | j_dS )zparent_option : POLICY namer� N)r� r+ r� r^ )r! r� r# r# r$ �p_parent_option� s z dnssec_policy.p_parent_optionc C s |d | j _dS )z$directory_option : DIRECTORY QSTRINGr� N)r� re )r! r� r# r# r$ �p_directory_option� s z dnssec_policy.p_directory_optionc C s |d | j _dS )z#coverage_option : COVERAGE durationr� N)r� rf )r! r� r# r# r$ �p_coverage_option� s z dnssec_policy.p_coverage_optionc C s* |d dkr|d | j _n |d | j _dS )z0rollperiod_option : ROLL_PERIOD KEYTYPE durationr� �KSK� N)r� ri rj )r! r� r# r# r$ �p_rollperiod_option� s z!dnssec_policy.p_rollperiod_optionc C s* |d dkr|d | j _n |d | j _dS )z0prepublish_option : PRE_PUBLISH KEYTYPE durationr� r� r� N)r� rk rm )r! r� r# r# r$ �p_prepublish_option� s z!dnssec_policy.p_prepublish_optionc C s* |d dkr|d | j _n |d | j _dS )z2postpublish_option : POST_PUBLISH KEYTYPE durationr� r� r� N)r� rl rn )r! r� r# r# r$ �p_postpublish_option� s z"dnssec_policy.p_postpublish_optionc C s* |d dkr|d | j _n |d | j _dS )z(keysize_option : KEY_SIZE KEYTYPE NUMBERr� r� r� N)r� rg rh )r! r� r# r# r$ �p_keysize_option� s z dnssec_policy.p_keysize_optionc C s* |d dkr|d | j _n |d | j _dS )z'standby_option : STANDBY KEYTYPE NUMBERr� r� r� N)r� ro rp )r! r� r# r# r$ �p_standby_option� s z dnssec_policy.p_standby_optionc C s |d | j _dS )z keyttl_option : KEYTTL durationr� N)r� rq )r! r� r# r# r$ �p_keyttl_option� s z dnssec_policy.p_keyttl_optionc C s |d | j _dS )z$algorithm_option : ALGORITHM ALGNAMEr� N)r� r] )r! r� r# r# r$ �p_algorithm_option� s z dnssec_policy.p_algorithm_optionc C sd |r.t d| jpd| jrdnd|j|jf � n2| js`td| jp@d| jrJdnd|rV|jpXdf ��d S )Nz %s%s%d:syntax error near '%s'r_ �:z %s%s%d:unexpected end of inputr )r8 r� r r r� ry )r! r� r# r# r$ �p_error� s zdnssec_policy.p_error)N)*rK rL rM r� r� r� r� r� r� rF r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r# r$ rz , sN
_
h
rz �__main__r' rC r� )r{ r� T)r| r{ r� znonexistent.zone) r( Zply.lexrC Zply.yaccr �stringr r rO � Exceptionry rz rK �sys�argvr� �filer� rI �closer~ rJ Zppr8 r� r� �e�argsr# r# r# r$ �<module> s6
` 4 !
isc/checkds.py 0000644 00000015446 14751155147 0007324 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
import argparse
import os
import sys
from subprocess import Popen, PIPE
from isc.utils import prefix,version
prog = 'dnssec-checkds'
############################################################################
# SECRR class:
# Class for DS/DLV resource record
############################################################################
class SECRR:
hashalgs = {1: 'SHA-1', 2: 'SHA-256', 3: 'GOST', 4: 'SHA-384'}
rrname = ''
rrclass = 'IN'
keyid = None
keyalg = None
hashalg = None
digest = ''
ttl = 0
def __init__(self, rrtext, dlvname = None):
if not rrtext:
raise Exception
# 'str' does not have decode method in python3
if type(rrtext) is not str:
fields = rrtext.decode('ascii').split()
else:
fields = rrtext.split()
if len(fields) < 7:
raise Exception
if dlvname:
self.rrtype = "DLV"
self.dlvname = dlvname.lower()
parent = fields[0].lower().strip('.').split('.')
parent.reverse()
dlv = dlvname.split('.')
dlv.reverse()
while len(dlv) != 0 and len(parent) != 0 and parent[0] == dlv[0]:
parent = parent[1:]
dlv = dlv[1:]
if dlv:
raise Exception
parent.reverse()
self.parent = '.'.join(parent)
self.rrname = self.parent + '.' + self.dlvname + '.'
else:
self.rrtype = "DS"
self.rrname = fields[0].lower()
fields = fields[1:]
if fields[0].upper() in ['IN', 'CH', 'HS']:
self.rrclass = fields[0].upper()
fields = fields[1:]
else:
self.ttl = int(fields[0])
self.rrclass = fields[1].upper()
fields = fields[2:]
if fields[0].upper() != self.rrtype:
raise Exception('%s does not match %s' %
(fields[0].upper(), self.rrtype))
self.keyid, self.keyalg, self.hashalg = map(int, fields[1:4])
self.digest = ''.join(fields[4:]).upper()
def __repr__(self):
return '%s %s %s %d %d %d %s' % \
(self.rrname, self.rrclass, self.rrtype,
self.keyid, self.keyalg, self.hashalg, self.digest)
def __eq__(self, other):
return self.__repr__() == other.__repr__()
############################################################################
# check:
# Fetch DS/DLV RRset for the given zone from the DNS; fetch DNSKEY
# RRset from the masterfile if specified, or from DNS if not.
# Generate a set of expected DS/DLV records from the DNSKEY RRset,
# and report on congruency.
############################################################################
def check(zone, args, masterfile=None, lookaside=None):
rrlist = []
cmd = [args.dig, "+noall", "+answer", "-t", "dlv" if lookaside else "ds",
"-q", zone + "." + lookaside if lookaside else zone]
fp, _ = Popen(cmd, stdout=PIPE).communicate()
for line in fp.splitlines():
if type(line) is not str:
line = line.decode('ascii')
rrlist.append(SECRR(line, lookaside))
rrlist = sorted(rrlist, key=lambda rr: (rr.keyid, rr.keyalg, rr.hashalg))
klist = []
if masterfile:
cmd = [args.dsfromkey, "-f", masterfile]
if lookaside:
cmd += ["-l", lookaside]
cmd.append(zone)
fp, _ = Popen(cmd, stdout=PIPE).communicate()
else:
intods, _ = Popen([args.dig, "+noall", "+answer", "-t", "dnskey",
"-q", zone], stdout=PIPE).communicate()
cmd = [args.dsfromkey, "-f", "-"]
if lookaside:
cmd += ["-l", lookaside]
cmd.append(zone)
fp, _ = Popen(cmd, stdin=PIPE, stdout=PIPE).communicate(intods)
for line in fp.splitlines():
if type(line) is not str:
line = line.decode('ascii')
klist.append(SECRR(line, lookaside))
if len(klist) < 1:
print("No DNSKEY records found in zone apex")
return False
found = False
for rr in klist:
if rr in rrlist:
print("%s for KSK %s/%03d/%05d (%s) found in parent" %
(rr.rrtype, rr.rrname.strip('.'), rr.keyalg,
rr.keyid, SECRR.hashalgs[rr.hashalg]))
found = True
else:
print("%s for KSK %s/%03d/%05d (%s) missing from parent" %
(rr.rrtype, rr.rrname.strip('.'), rr.keyalg,
rr.keyid, SECRR.hashalgs[rr.hashalg]))
if not found:
print("No %s records were found for any DNSKEY" % ("DLV" if lookaside else "DS"))
return found
############################################################################
# parse_args:
# Read command line arguments, set global 'args' structure
############################################################################
def parse_args():
parser = argparse.ArgumentParser(description=prog + ': checks DS coverage')
bindir = 'bin'
sbindir = 'bin' if os.name == 'nt' else 'sbin'
parser.add_argument('zone', type=str, help='zone to check')
parser.add_argument('-f', '--file', dest='masterfile', type=str,
help='zone master file')
parser.add_argument('-l', '--lookaside', dest='lookaside', type=str,
help='DLV lookaside zone')
parser.add_argument('-d', '--dig', dest='dig',
default=os.path.join(prefix(bindir), 'dig'),
type=str, help='path to \'dig\'')
parser.add_argument('-D', '--dsfromkey', dest='dsfromkey',
default=os.path.join(prefix(sbindir),
'dnssec-dsfromkey'),
type=str, help='path to \'dnssec-dsfromkey\'')
parser.add_argument('-v', '--version', action='version',
version=version)
args = parser.parse_args()
args.zone = args.zone.strip('.')
if args.lookaside:
args.lookaside = args.lookaside.strip('.')
return args
############################################################################
# Main
############################################################################
def main():
args = parse_args()
found = check(args.zone, args, args.masterfile, args.lookaside)
exit(0 if found else 1)
isc/dnskey.py 0000644 00000040040 14751155147 0007201 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
import os
import time
import calendar
from subprocess import Popen, PIPE
########################################################################
# Class dnskey
########################################################################
class TimePast(Exception):
def __init__(self, key, prop, value):
super(TimePast, self).__init__('%s time for key %s (%d) is already past'
% (prop, key, value))
class dnskey:
"""An individual DNSSEC key. Identified by path, name, algorithm, keyid.
Contains a dictionary of metadata events."""
_PROPS = ('Created', 'Publish', 'Activate', 'Inactive', 'Delete',
'Revoke', 'DSPublish', 'SyncPublish', 'SyncDelete')
_OPTS = (None, '-P', '-A', '-I', '-D', '-R', None, '-Psync', '-Dsync')
_ALGNAMES = (None, 'RSAMD5', 'DH', 'DSA', 'ECC', 'RSASHA1',
'NSEC3DSA', 'NSEC3RSASHA1', 'RSASHA256', None,
'RSASHA512', None, 'ECCGOST', 'ECDSAP256SHA256',
'ECDSAP384SHA384', 'ED25519', 'ED448')
def __init__(self, key, directory=None, keyttl=None):
# this makes it possible to use algname as a class or instance method
if isinstance(key, tuple) and len(key) == 3:
self._dir = directory or '.'
(name, alg, keyid) = key
self.fromtuple(name, alg, keyid, keyttl)
self._dir = directory or os.path.dirname(key) or '.'
key = os.path.basename(key)
(name, alg, keyid) = key.split('+')
name = name[1:-1]
alg = int(alg)
keyid = int(keyid.split('.')[0])
self.fromtuple(name, alg, keyid, keyttl)
def fromtuple(self, name, alg, keyid, keyttl):
if name.endswith('.'):
fullname = name
name = name.rstrip('.')
else:
fullname = name + '.'
keystr = "K%s+%03d+%05d" % (fullname, alg, keyid)
key_file = self._dir + (self._dir and os.sep or '') + keystr + ".key"
private_file = (self._dir + (self._dir and os.sep or '') +
keystr + ".private")
self.keystr = keystr
self.name = name
self.alg = int(alg)
self.keyid = int(keyid)
self.fullname = fullname
kfp = open(key_file, "r")
for line in kfp:
if line[0] == ';':
continue
tokens = line.split()
if not tokens:
continue
if tokens[1].lower() in ('in', 'ch', 'hs'):
septoken = 3
self.ttl = keyttl
else:
septoken = 4
self.ttl = int(tokens[1]) if not keyttl else keyttl
if (int(tokens[septoken]) & 0x1) == 1:
self.sep = True
else:
self.sep = False
kfp.close()
pfp = open(private_file, "rU")
self.metadata = dict()
self._changed = dict()
self._delete = dict()
self._times = dict()
self._fmttime = dict()
self._timestamps = dict()
self._original = dict()
self._origttl = None
for line in pfp:
line = line.strip()
if not line or line[0] in ('!#'):
continue
punctuation = [line.find(c) for c in ':= '] + [len(line)]
found = min([pos for pos in punctuation if pos != -1])
name = line[:found].rstrip()
value = line[found:].lstrip(":= ").rstrip()
self.metadata[name] = value
for prop in dnskey._PROPS:
self._changed[prop] = False
if prop in self.metadata:
t = self.parsetime(self.metadata[prop])
self._times[prop] = t
self._fmttime[prop] = self.formattime(t)
self._timestamps[prop] = self.epochfromtime(t)
self._original[prop] = self._timestamps[prop]
else:
self._times[prop] = None
self._fmttime[prop] = None
self._timestamps[prop] = None
self._original[prop] = None
pfp.close()
def commit(self, settime_bin, **kwargs):
quiet = kwargs.get('quiet', False)
cmd = []
first = True
if self._origttl is not None:
cmd += ["-L", str(self.ttl)]
for prop, opt in zip(dnskey._PROPS, dnskey._OPTS):
if not opt or not self._changed[prop]:
continue
delete = False
if prop in self._delete and self._delete[prop]:
delete = True
when = 'none' if delete else self._fmttime[prop]
cmd += [opt, when]
first = False
if cmd:
fullcmd = [settime_bin, "-K", self._dir] + cmd + [self.keystr,]
if not quiet:
print('# ' + ' '.join(fullcmd))
try:
p = Popen(fullcmd, stdout=PIPE, stderr=PIPE)
stdout, stderr = p.communicate()
if stderr:
raise Exception(str(stderr))
except Exception as e:
raise Exception('unable to run %s: %s' %
(settime_bin, str(e)))
self._origttl = None
for prop in dnskey._PROPS:
self._original[prop] = self._timestamps[prop]
self._changed[prop] = False
@classmethod
def generate(cls, keygen_bin, randomdev, keys_dir, name, alg, keysize, sep,
ttl, publish=None, activate=None, **kwargs):
quiet = kwargs.get('quiet', False)
keygen_cmd = [keygen_bin, "-q", "-K", keys_dir, "-L", str(ttl)]
if randomdev:
keygen_cmd += ["-r", randomdev]
if sep:
keygen_cmd.append("-fk")
if alg:
keygen_cmd += ["-a", alg]
if keysize:
keygen_cmd += ["-b", str(keysize)]
if publish:
t = dnskey.timefromepoch(publish)
keygen_cmd += ["-P", dnskey.formattime(t)]
if activate:
t = dnskey.timefromepoch(activate)
keygen_cmd += ["-A", dnskey.formattime(activate)]
keygen_cmd.append(name)
if not quiet:
print('# ' + ' '.join(keygen_cmd))
p = Popen(keygen_cmd, stdout=PIPE, stderr=PIPE)
stdout, stderr = p.communicate()
if stderr:
raise Exception('unable to generate key: ' + str(stderr))
try:
keystr = stdout.splitlines()[0].decode('ascii')
newkey = dnskey(keystr, keys_dir, ttl)
return newkey
except Exception as e:
raise Exception('unable to parse generated key: %s' % str(e))
def generate_successor(self, keygen_bin, randomdev, prepublish, **kwargs):
quiet = kwargs.get('quiet', False)
if not self.inactive():
raise Exception("predecessor key %s has no inactive date" % self)
keygen_cmd = [keygen_bin, "-q", "-K", self._dir, "-S", self.keystr]
if self.ttl:
keygen_cmd += ["-L", str(self.ttl)]
if randomdev:
keygen_cmd += ["-r", randomdev]
if prepublish:
keygen_cmd += ["-i", str(prepublish)]
if not quiet:
print('# ' + ' '.join(keygen_cmd))
p = Popen(keygen_cmd, stdout=PIPE, stderr=PIPE)
stdout, stderr = p.communicate()
if stderr:
raise Exception('unable to generate key: ' + stderr)
try:
keystr = stdout.splitlines()[0].decode('ascii')
newkey = dnskey(keystr, self._dir, self.ttl)
return newkey
except:
raise Exception('unable to generate successor for key %s' % self)
@staticmethod
def algstr(alg):
name = None
if alg in range(len(dnskey._ALGNAMES)):
name = dnskey._ALGNAMES[alg]
return name if name else ("%03d" % alg)
@staticmethod
def algnum(alg):
if not alg:
return None
alg = alg.upper()
try:
return dnskey._ALGNAMES.index(alg)
except ValueError:
return None
def algname(self, alg=None):
return self.algstr(alg or self.alg)
@staticmethod
def timefromepoch(secs):
return time.gmtime(secs)
@staticmethod
def parsetime(string):
return time.strptime(string, "%Y%m%d%H%M%S")
@staticmethod
def epochfromtime(t):
return calendar.timegm(t)
@staticmethod
def formattime(t):
return time.strftime("%Y%m%d%H%M%S", t)
def setmeta(self, prop, secs, now, **kwargs):
force = kwargs.get('force', False)
if self._timestamps[prop] == secs:
return
if self._original[prop] is not None and \
self._original[prop] < now and not force:
raise TimePast(self, prop, self._original[prop])
if secs is None:
self._changed[prop] = False \
if self._original[prop] is None else True
self._delete[prop] = True
self._timestamps[prop] = None
self._times[prop] = None
self._fmttime[prop] = None
return
t = self.timefromepoch(secs)
self._timestamps[prop] = secs
self._times[prop] = t
self._fmttime[prop] = self.formattime(t)
self._changed[prop] = False if \
self._original[prop] == self._timestamps[prop] else True
def gettime(self, prop):
return self._times[prop]
def getfmttime(self, prop):
return self._fmttime[prop]
def gettimestamp(self, prop):
return self._timestamps[prop]
def created(self):
return self._timestamps["Created"]
def syncpublish(self):
return self._timestamps["SyncPublish"]
def setsyncpublish(self, secs, now=time.time(), **kwargs):
self.setmeta("SyncPublish", secs, now, **kwargs)
def publish(self):
return self._timestamps["Publish"]
def setpublish(self, secs, now=time.time(), **kwargs):
self.setmeta("Publish", secs, now, **kwargs)
def activate(self):
return self._timestamps["Activate"]
def setactivate(self, secs, now=time.time(), **kwargs):
self.setmeta("Activate", secs, now, **kwargs)
def revoke(self):
return self._timestamps["Revoke"]
def setrevoke(self, secs, now=time.time(), **kwargs):
self.setmeta("Revoke", secs, now, **kwargs)
def inactive(self):
return self._timestamps["Inactive"]
def setinactive(self, secs, now=time.time(), **kwargs):
self.setmeta("Inactive", secs, now, **kwargs)
def delete(self):
return self._timestamps["Delete"]
def setdelete(self, secs, now=time.time(), **kwargs):
self.setmeta("Delete", secs, now, **kwargs)
def syncdelete(self):
return self._timestamps["SyncDelete"]
def setsyncdelete(self, secs, now=time.time(), **kwargs):
self.setmeta("SyncDelete", secs, now, **kwargs)
def setttl(self, ttl):
if ttl is None or self.ttl == ttl:
return
elif self._origttl is None:
self._origttl = self.ttl
self.ttl = ttl
elif self._origttl == ttl:
self._origttl = None
self.ttl = ttl
else:
self.ttl = ttl
def keytype(self):
return ("KSK" if self.sep else "ZSK")
def __str__(self):
return ("%s/%s/%05d"
% (self.name, self.algname(), self.keyid))
def __repr__(self):
return ("%s/%s/%05d (%s)"
% (self.name, self.algname(), self.keyid,
("KSK" if self.sep else "ZSK")))
def date(self):
return (self.activate() or self.publish() or self.created())
# keys are sorted first by zone name, then by algorithm. within
# the same name/algorithm, they are sorted according to their
# 'date' value: the activation date if set, OR the publication
# if set, OR the creation date.
def __lt__(self, other):
if self.name != other.name:
return self.name < other.name
if self.alg != other.alg:
return self.alg < other.alg
return self.date() < other.date()
def check_prepub(self, output=None):
def noop(*args, **kwargs): pass
if not output:
output = noop
now = int(time.time())
a = self.activate()
p = self.publish()
if not a:
return False
if not p:
if a > now:
output("WARNING: Key %s is scheduled for\n"
"\t activation but not for publication."
% repr(self))
return False
if p <= now and a <= now:
return True
if p == a:
output("WARNING: %s is scheduled to be\n"
"\t published and activated at the same time. This\n"
"\t could result in a coverage gap if the zone was\n"
"\t previously signed. Activation should be at least\n"
"\t %s after publication."
% (repr(self),
dnskey.duration(self.ttl) or 'one DNSKEY TTL'))
return True
if a < p:
output("WARNING: Key %s is active before it is published"
% repr(self))
return False
if self.ttl is not None and a - p < self.ttl:
output("WARNING: Key %s is activated too soon\n"
"\t after publication; this could result in coverage \n"
"\t gaps due to resolver caches containing old data.\n"
"\t Activation should be at least %s after\n"
"\t publication."
% (repr(self),
dnskey.duration(self.ttl) or 'one DNSKEY TTL'))
return False
return True
def check_postpub(self, output = None, timespan = None):
def noop(*args, **kwargs): pass
if output is None:
output = noop
if timespan is None:
timespan = self.ttl
if timespan is None:
output("WARNING: Key %s using default TTL." % repr(self))
timespan = (60*60*24)
now = time.time()
d = self.delete()
i = self.inactive()
if not d:
return False
if not i:
if d > now:
output("WARNING: Key %s is scheduled for\n"
"\t deletion but not for inactivation." % repr(self))
return False
if d < now and i < now:
return True
if d < i:
output("WARNING: Key %s is scheduled for\n"
"\t deletion before inactivation."
% repr(self))
return False
if d - i < timespan:
output("WARNING: Key %s scheduled for\n"
"\t deletion too soon after deactivation; this may \n"
"\t result in coverage gaps due to resolver caches\n"
"\t containing old data. Deletion should be at least\n"
"\t %s after inactivation."
% (repr(self), dnskey.duration(timespan)))
return False
return True
@staticmethod
def duration(secs):
if not secs:
return None
units = [("year", 60*60*24*365),
("month", 60*60*24*30),
("day", 60*60*24),
("hour", 60*60),
("minute", 60),
("second", 1)]
output = []
for unit in units:
v, secs = secs // unit[1], secs % unit[1]
if v > 0:
output.append("%d %s%s" % (v, unit[0], "s" if v > 1 else ""))
return ", ".join(output)
isc/keyevent.py 0000644 00000005413 14751155147 0007543 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
import time
########################################################################
# Class keyevent
########################################################################
class keyevent:
""" A discrete key event, e.g., Publish, Activate, Inactive, Delete,
etc. Stores the date of the event, and identifying information
about the key to which the event will occur."""
def __init__(self, what, key, when=None):
self.what = what
self.when = when or key.gettime(what)
self.key = key
self.sep = key.sep
self.zone = key.name
self.alg = key.alg
self.keyid = key.keyid
def __repr__(self):
return repr((self.when, self.what, self.keyid, self.sep,
self.zone, self.alg))
def showtime(self):
return time.strftime("%a %b %d %H:%M:%S UTC %Y", self.when)
# update sets of active and published keys, based on
# the contents of this keyevent
def status(self, active, published, output = None):
def noop(*args, **kwargs): pass
if not output:
output = noop
if not active:
active = set()
if not published:
published = set()
if self.what == "Activate":
active.add(self.keyid)
elif self.what == "Publish":
published.add(self.keyid)
elif self.what == "Inactive":
if self.keyid not in active:
output("\tWARNING: %s scheduled to become inactive "
"before it is active"
% repr(self.key))
else:
active.remove(self.keyid)
elif self.what == "Delete":
if self.keyid in published:
published.remove(self.keyid)
else:
output("WARNING: key %s is scheduled for deletion "
"before it is published" % repr(self.key))
elif self.what == "Revoke":
# We don't need to worry about the logic of this one;
# just stop counting this key as either active or published
if self.keyid in published:
published.remove(self.keyid)
if self.keyid in active:
active.remove(self.keyid)
return active, published
isc/keydict.py 0000644 00000005441 14751155147 0007346 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
from collections import defaultdict
from . import dnskey
import os
import glob
########################################################################
# Class keydict
########################################################################
class keydict:
""" A dictionary of keys, indexed by name, algorithm, and key id """
_keydict = defaultdict(lambda: defaultdict(dict))
_defttl = None
_missing = []
def __init__(self, dp=None, **kwargs):
self._defttl = kwargs.get('keyttl', None)
zones = kwargs.get('zones', None)
if not zones:
path = kwargs.get('path',None) or '.'
self.readall(path)
else:
for zone in zones:
if 'path' in kwargs and kwargs['path'] is not None:
path = kwargs['path']
else:
path = dp and dp.policy(zone).directory or '.'
if not self.readone(path, zone):
self._missing.append(zone)
def readall(self, path):
files = glob.glob(os.path.join(path, '*.private'))
for infile in files:
key = dnskey(infile, path, self._defttl)
self._keydict[key.name][key.alg][key.keyid] = key
def readone(self, path, zone):
if not zone.endswith('.'):
zone += '.'
match='K' + zone + '+*.private'
files = glob.glob(os.path.join(path, match))
found = False
for infile in files:
key = dnskey(infile, path, self._defttl)
if key.fullname != zone: # shouldn't ever happen
continue
keyname=key.name if zone != '.' else '.'
self._keydict[keyname][key.alg][key.keyid] = key
found = True
return found
def __iter__(self):
for zone, algorithms in self._keydict.items():
for alg, keys in algorithms.items():
for key in keys.values():
yield key
def __getitem__(self, name):
return self._keydict[name]
def zones(self):
return (self._keydict.keys())
def algorithms(self, zone):
return (self._keydict[zone].keys())
def keys(self, zone, alg):
return (self._keydict[zone][alg].keys())
def missing(self):
return (self._missing)
isc/__init__.py 0000644 00000001651 14751155147 0007450 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
__all__ = ['checkds', 'coverage', 'keymgr', 'dnskey', 'eventlist',
'keydict', 'keyevent', 'keyseries', 'keyzone', 'policy',
'parsetab', 'rndc', 'utils']
from isc.dnskey import *
from isc.eventlist import *
from isc.keydict import *
from isc.keyevent import *
from isc.keyseries import *
from isc.keyzone import *
from isc.policy import *
from isc.rndc import *
from isc.utils import *
isc/coverage.py 0000644 00000023375 14751155147 0007513 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
from __future__ import print_function
import os
import sys
import argparse
import glob
import re
import time
import calendar
import pprint
from collections import defaultdict
prog = 'dnssec-coverage'
from isc import dnskey, eventlist, keydict, keyevent, keyzone, utils
############################################################################
# print a fatal error and exit
############################################################################
def fatal(*args, **kwargs):
print(*args, **kwargs)
sys.exit(1)
############################################################################
# output:
############################################################################
_firstline = True
def output(*args, **kwargs):
"""output text, adding a vertical space this is *not* the first
first section being printed since a call to vreset()"""
global _firstline
if 'skip' in kwargs:
skip = kwargs['skip']
kwargs.pop('skip', None)
else:
skip = True
if _firstline:
_firstline = False
elif skip:
print('')
if args:
print(*args, **kwargs)
def vreset():
"""reset vertical spacing"""
global _firstline
_firstline = True
############################################################################
# parse_time
############################################################################
def parse_time(s):
""" convert a formatted time (e.g., 1y, 6mo, 15mi, etc) into seconds
:param s: String with some text representing a time interval
:return: Integer with the number of seconds in the time interval
"""
s = s.strip()
# if s is an integer, we're done already
try:
return int(s)
except ValueError:
pass
# try to parse as a number with a suffix indicating unit of time
r = re.compile(r'([0-9][0-9]*)\s*([A-Za-z]*)')
m = r.match(s)
if not m:
raise ValueError("Cannot parse %s" % s)
n, unit = m.groups()
n = int(n)
unit = unit.lower()
if unit.startswith('y'):
return n * 31536000
elif unit.startswith('mo'):
return n * 2592000
elif unit.startswith('w'):
return n * 604800
elif unit.startswith('d'):
return n * 86400
elif unit.startswith('h'):
return n * 3600
elif unit.startswith('mi'):
return n * 60
elif unit.startswith('s'):
return n
else:
raise ValueError("Invalid suffix %s" % unit)
############################################################################
# set_path:
############################################################################
def set_path(command, default=None):
""" find the location of a specified command. if a default is supplied
and it works, we use it; otherwise we search PATH for a match.
:param command: string with a command to look for in the path
:param default: default location to use
:return: detected location for the desired command
"""
fpath = default
if not fpath or not os.path.isfile(fpath) or not os.access(fpath, os.X_OK):
path = os.environ["PATH"]
if not path:
path = os.path.defpath
for directory in path.split(os.pathsep):
fpath = os.path.join(directory, command)
if os.path.isfile(fpath) and os.access(fpath, os.X_OK):
break
fpath = None
return fpath
############################################################################
# parse_args:
############################################################################
def parse_args():
"""Read command line arguments, set global 'args' structure"""
compilezone = set_path('named-compilezone',
os.path.join(utils.prefix('sbin'),
'named-compilezone'))
parser = argparse.ArgumentParser(description=prog + ': checks future ' +
'DNSKEY coverage for a zone')
parser.add_argument('zone', type=str, nargs='*', default=None,
help='zone(s) to check' +
'(default: all zones in the directory)')
parser.add_argument('-K', dest='path', default='.', type=str,
help='a directory containing keys to process',
metavar='dir')
parser.add_argument('-f', dest='filename', type=str,
help='zone master file', metavar='file')
parser.add_argument('-m', dest='maxttl', type=str,
help='the longest TTL in the zone(s)',
metavar='time')
parser.add_argument('-d', dest='keyttl', type=str,
help='the DNSKEY TTL', metavar='time')
parser.add_argument('-r', dest='resign', default='1944000',
type=str, help='the RRSIG refresh interval '
'in seconds [default: 22.5 days]',
metavar='time')
parser.add_argument('-c', dest='compilezone',
default=compilezone, type=str,
help='path to \'named-compilezone\'',
metavar='path')
parser.add_argument('-l', dest='checklimit',
type=str, default='0',
help='Length of time to check for '
'DNSSEC coverage [default: 0 (unlimited)]',
metavar='time')
parser.add_argument('-z', dest='no_ksk',
action='store_true', default=False,
help='Only check zone-signing keys (ZSKs)')
parser.add_argument('-k', dest='no_zsk',
action='store_true', default=False,
help='Only check key-signing keys (KSKs)')
parser.add_argument('-D', '--debug', dest='debug_mode',
action='store_true', default=False,
help='Turn on debugging output')
parser.add_argument('-v', '--version', action='version',
version=utils.version)
args = parser.parse_args()
if args.no_zsk and args.no_ksk:
fatal("ERROR: -z and -k cannot be used together.")
elif args.no_zsk or args.no_ksk:
args.keytype = "KSK" if args.no_zsk else "ZSK"
else:
args.keytype = None
if args.filename and len(args.zone) > 1:
fatal("ERROR: -f can only be used with one zone.")
# strip trailing dots if any
args.zone = [x[:-1] if (len(x) > 1 and x[-1] == '.') else x
for x in args.zone]
# convert from time arguments to seconds
try:
if args.maxttl:
m = parse_time(args.maxttl)
args.maxttl = m
except ValueError:
pass
try:
if args.keyttl:
k = parse_time(args.keyttl)
args.keyttl = k
except ValueError:
pass
try:
if args.resign:
r = parse_time(args.resign)
args.resign = r
except ValueError:
pass
try:
if args.checklimit:
lim = args.checklimit
r = parse_time(args.checklimit)
if r == 0:
args.checklimit = None
else:
args.checklimit = time.time() + r
except ValueError:
pass
# if we've got the values we need from the command line, stop now
if args.maxttl and args.keyttl:
return args
# load keyttl and maxttl data from zonefile
if args.zone and args.filename:
try:
zone = keyzone(args.zone[0], args.filename, args.compilezone)
args.maxttl = args.maxttl or zone.maxttl
args.keyttl = args.maxttl or zone.keyttl
except Exception as e:
print("Unable to load zone data from %s: " % args.filename, e)
if not args.maxttl:
output("WARNING: Maximum TTL value was not specified. Using 1 week\n"
"\t (604800 seconds); re-run with the -m option to get more\n"
"\t accurate results.")
args.maxttl = 604800
return args
############################################################################
# Main
############################################################################
def main():
args = parse_args()
print("PHASE 1--Loading keys to check for internal timing problems")
try:
kd = keydict(path=args.path, zones=args.zone, keyttl=args.keyttl)
except Exception as e:
fatal('ERROR: Unable to build key dictionary: ' + str(e))
for key in kd:
key.check_prepub(output)
if key.sep:
key.check_postpub(output)
else:
key.check_postpub(output, args.maxttl + args.resign)
output("PHASE 2--Scanning future key events for coverage failures")
vreset()
try:
elist = eventlist(kd)
except Exception as e:
fatal('ERROR: Unable to build event list: ' + str(e))
errors = False
if not args.zone:
if not elist.coverage(None, args.keytype, args.checklimit, output):
errors = True
else:
for zone in args.zone:
try:
if not elist.coverage(zone, args.keytype,
args.checklimit, output):
errors = True
except:
output('ERROR: Coverage check failed for zone ' + zone)
sys.exit(1 if errors else 0)
isc/policy.py 0000644 00000063462 14751155147 0007220 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
import re
import ply.lex as lex
import ply.yacc as yacc
from string import *
from copy import copy
############################################################################
# PolicyLex: a lexer for the policy file syntax.
############################################################################
class PolicyLex:
reserved = ('POLICY',
'ALGORITHM_POLICY',
'ZONE',
'ALGORITHM',
'DIRECTORY',
'KEYTTL',
'KEY_SIZE',
'ROLL_PERIOD',
'PRE_PUBLISH',
'POST_PUBLISH',
'COVERAGE',
'STANDBY',
'NONE')
tokens = reserved + ('DATESUFFIX',
'KEYTYPE',
'ALGNAME',
'STR',
'QSTRING',
'NUMBER',
'LBRACE',
'RBRACE',
'SEMI')
reserved_map = {}
t_ignore = ' \t'
t_ignore_olcomment = r'(//|\#).*'
t_LBRACE = r'\{'
t_RBRACE = r'\}'
t_SEMI = r';';
def t_newline(self, t):
r'\n+'
t.lexer.lineno += t.value.count("\n")
def t_comment(self, t):
r'/\*(.|\n)*?\*/'
t.lexer.lineno += t.value.count('\n')
def t_DATESUFFIX(self, t):
r'(?i)(?<=[0-9 \t])(y(?:ears|ear|ea|e)?|mo(?:nths|nth|nt|n)?|w(?:eeks|eek|ee|e)?|d(?:ays|ay|a)?|h(?:ours|our|ou|o)?|mi(?:nutes|nute|nut|nu|n)?|s(?:econds|econd|econ|eco|ec|e)?)\b'
t.value = re.match(r'(?i)(y|mo|w|d|h|mi|s)([a-z]*)', t.value).group(1).lower()
return t
def t_KEYTYPE(self, t):
r'(?i)\b(KSK|ZSK)\b'
t.value = t.value.upper()
return t
def t_ALGNAME(self, t):
r'(?i)\b(RSAMD5|DH|DSA|NSEC3DSA|ECC|RSASHA1|NSEC3RSASHA1|RSASHA256|RSASHA512|ECCGOST|ECDSAP256SHA256|ECDSAP384SHA384|ED25519|ED448)\b'
t.value = t.value.upper()
return t
def t_STR(self, t):
r'[A-Za-z._-][\w._-]*'
t.type = self.reserved_map.get(t.value, "STR")
return t
def t_QSTRING(self, t):
r'"([^"\n]|(\\"))*"'
t.type = self.reserved_map.get(t.value, "QSTRING")
t.value = t.value[1:-1]
return t
def t_NUMBER(self, t):
r'\d+'
t.value = int(t.value)
return t
def t_error(self, t):
print("Illegal character '%s'" % t.value[0])
t.lexer.skip(1)
def __init__(self, **kwargs):
if 'maketrans' in dir(str):
trans = str.maketrans('_', '-')
else:
trans = maketrans('_', '-')
for r in self.reserved:
self.reserved_map[r.lower().translate(trans)] = r
self.lexer = lex.lex(object=self, **kwargs)
def test(self, text):
self.lexer.input(text)
while True:
t = self.lexer.token()
if not t:
break
print(t)
############################################################################
# Policy: this object holds a set of DNSSEC policy settings.
############################################################################
class Policy:
is_zone = False
is_alg = False
is_constructed = False
ksk_rollperiod = None
zsk_rollperiod = None
ksk_prepublish = None
zsk_prepublish = None
ksk_postpublish = None
zsk_postpublish = None
ksk_keysize = None
zsk_keysize = None
ksk_standby = None
zsk_standby = None
keyttl = None
coverage = None
directory = None
valid_key_sz_per_algo = {'DSA': [512, 1024],
'NSEC3DSA': [512, 1024],
'RSAMD5': [512, 4096],
'RSASHA1': [512, 4096],
'NSEC3RSASHA1': [512, 4096],
'RSASHA256': [512, 4096],
'RSASHA512': [512, 4096],
'ECCGOST': None,
'ECDSAP256SHA256': None,
'ECDSAP384SHA384': None,
'ED25519': None,
'ED448': None}
def __init__(self, name=None, algorithm=None, parent=None):
self.name = name
self.algorithm = algorithm
self.parent = parent
pass
def __repr__(self):
return ("%spolicy %s:\n"
"\tinherits %s\n"
"\tdirectory %s\n"
"\talgorithm %s\n"
"\tcoverage %s\n"
"\tksk_keysize %s\n"
"\tzsk_keysize %s\n"
"\tksk_rollperiod %s\n"
"\tzsk_rollperiod %s\n"
"\tksk_prepublish %s\n"
"\tksk_postpublish %s\n"
"\tzsk_prepublish %s\n"
"\tzsk_postpublish %s\n"
"\tksk_standby %s\n"
"\tzsk_standby %s\n"
"\tkeyttl %s\n"
%
((self.is_constructed and 'constructed ' or \
self.is_zone and 'zone ' or \
self.is_alg and 'algorithm ' or ''),
self.name or 'UNKNOWN',
self.parent and self.parent.name or 'None',
self.directory and ('"' + str(self.directory) + '"') or 'None',
self.algorithm or 'None',
self.coverage and str(self.coverage) or 'None',
self.ksk_keysize and str(self.ksk_keysize) or 'None',
self.zsk_keysize and str(self.zsk_keysize) or 'None',
self.ksk_rollperiod and str(self.ksk_rollperiod) or 'None',
self.zsk_rollperiod and str(self.zsk_rollperiod) or 'None',
self.ksk_prepublish and str(self.ksk_prepublish) or 'None',
self.ksk_postpublish and str(self.ksk_postpublish) or 'None',
self.zsk_prepublish and str(self.zsk_prepublish) or 'None',
self.zsk_postpublish and str(self.zsk_postpublish) or 'None',
self.ksk_standby and str(self.ksk_standby) or 'None',
self.zsk_standby and str(self.zsk_standby) or 'None',
self.keyttl and str(self.keyttl) or 'None'))
def __verify_size(self, key_size, size_range):
return (size_range[0] <= key_size <= size_range[1])
def get_name(self):
return self.name
def constructed(self):
return self.is_constructed
def validate(self):
""" Check if the values in the policy make sense
:return: True/False if the policy passes validation
"""
if self.ksk_rollperiod and \
self.ksk_prepublish is not None and \
self.ksk_prepublish > self.ksk_rollperiod:
print(self.ksk_rollperiod)
return (False,
('KSK pre-publish period (%d) exceeds rollover period %d'
% (self.ksk_prepublish, self.ksk_rollperiod)))
if self.ksk_rollperiod and \
self.ksk_postpublish is not None and \
self.ksk_postpublish > self.ksk_rollperiod:
return (False,
('KSK post-publish period (%d) exceeds rollover period %d'
% (self.ksk_postpublish, self.ksk_rollperiod)))
if self.zsk_rollperiod and \
self.zsk_prepublish is not None and \
self.zsk_prepublish >= self.zsk_rollperiod:
return (False,
('ZSK pre-publish period (%d) exceeds rollover period %d'
% (self.zsk_prepublish, self.zsk_rollperiod)))
if self.zsk_rollperiod and \
self.zsk_postpublish is not None and \
self.zsk_postpublish >= self.zsk_rollperiod:
return (False,
('ZSK post-publish period (%d) exceeds rollover period %d'
% (self.zsk_postpublish, self.zsk_rollperiod)))
if self.ksk_rollperiod and \
self.ksk_prepublish and self.ksk_postpublish and \
self.ksk_prepublish + self.ksk_postpublish >= self.ksk_rollperiod:
return (False,
(('KSK pre/post-publish periods (%d/%d) ' +
'combined exceed rollover period %d') %
(self.ksk_prepublish,
self.ksk_postpublish,
self.ksk_rollperiod)))
if self.zsk_rollperiod and \
self.zsk_prepublish and self.zsk_postpublish and \
self.zsk_prepublish + self.zsk_postpublish >= self.zsk_rollperiod:
return (False,
(('ZSK pre/post-publish periods (%d/%d) ' +
'combined exceed rollover period %d') %
(self.zsk_prepublish,
self.zsk_postpublish,
self.zsk_rollperiod)))
if self.algorithm is not None:
# Validate the key size
key_sz_range = self.valid_key_sz_per_algo.get(self.algorithm)
if key_sz_range is not None:
# Verify KSK
if not self.__verify_size(self.ksk_keysize, key_sz_range):
return False, 'KSK key size %d outside valid range %s' \
% (self.ksk_keysize, key_sz_range)
# Verify ZSK
if not self.__verify_size(self.zsk_keysize, key_sz_range):
return False, 'ZSK key size %d outside valid range %s' \
% (self.zsk_keysize, key_sz_range)
# Specific check for DSA keys
if self.algorithm in ['DSA', 'NSEC3DSA'] and \
self.ksk_keysize % 64 != 0:
return False, \
('KSK key size %d not divisible by 64 ' +
'as required for DSA') % self.ksk_keysize
if self.algorithm in ['DSA', 'NSEC3DSA'] and \
self.zsk_keysize % 64 != 0:
return False, \
('ZSK key size %d not divisible by 64 ' +
'as required for DSA') % self.zsk_keysize
if self.algorithm in ['ECCGOST', \
'ECDSAP256SHA256', \
'ECDSAP384SHA384', \
'ED25519', \
'ED448']:
self.ksk_keysize = None
self.zsk_keysize = None
return True, ''
############################################################################
# dnssec_policy:
# This class reads a dnssec.policy file and creates a dictionary of
# DNSSEC policy rules from which a policy for a specific zone can
# be generated.
############################################################################
class PolicyException(Exception):
pass
class dnssec_policy:
alg_policy = {}
named_policy = {}
zone_policy = {}
current = None
filename = None
initial = True
def __init__(self, filename=None, **kwargs):
self.plex = PolicyLex()
self.tokens = self.plex.tokens
if 'debug' not in kwargs:
kwargs['debug'] = False
if 'write_tables' not in kwargs:
kwargs['write_tables'] = False
self.parser = yacc.yacc(module=self, **kwargs)
# set defaults
self.setup('''policy global { algorithm rsasha256;
key-size ksk 2048;
key-size zsk 2048;
roll-period ksk 0;
roll-period zsk 1y;
pre-publish ksk 1mo;
pre-publish zsk 1mo;
post-publish ksk 1mo;
post-publish zsk 1mo;
standby ksk 0;
standby zsk 0;
keyttl 1h;
coverage 6mo; };
policy default { policy global; };''')
p = Policy()
p.algorithm = None
p.is_alg = True
p.ksk_keysize = 2048;
p.zsk_keysize = 2048;
# set default algorithm policies
# these need a lower default key size:
self.alg_policy['DSA'] = copy(p)
self.alg_policy['DSA'].algorithm = "DSA"
self.alg_policy['DSA'].name = "DSA"
self.alg_policy['DSA'].ksk_keysize = 1024;
self.alg_policy['NSEC3DSA'] = copy(p)
self.alg_policy['NSEC3DSA'].algorithm = "NSEC3DSA"
self.alg_policy['NSEC3DSA'].name = "NSEC3DSA"
self.alg_policy['NSEC3DSA'].ksk_keysize = 1024;
# these can use default settings
self.alg_policy['RSAMD5'] = copy(p)
self.alg_policy['RSAMD5'].algorithm = "RSAMD5"
self.alg_policy['RSAMD5'].name = "RSAMD5"
self.alg_policy['RSASHA1'] = copy(p)
self.alg_policy['RSASHA1'].algorithm = "RSASHA1"
self.alg_policy['RSASHA1'].name = "RSASHA1"
self.alg_policy['NSEC3RSASHA1'] = copy(p)
self.alg_policy['NSEC3RSASHA1'].algorithm = "NSEC3RSASHA1"
self.alg_policy['NSEC3RSASHA1'].name = "NSEC3RSASHA1"
self.alg_policy['RSASHA256'] = copy(p)
self.alg_policy['RSASHA256'].algorithm = "RSASHA256"
self.alg_policy['RSASHA256'].name = "RSASHA256"
self.alg_policy['RSASHA512'] = copy(p)
self.alg_policy['RSASHA512'].algorithm = "RSASHA512"
self.alg_policy['RSASHA512'].name = "RSASHA512"
self.alg_policy['ECCGOST'] = copy(p)
self.alg_policy['ECCGOST'].algorithm = "ECCGOST"
self.alg_policy['ECCGOST'].name = "ECCGOST"
self.alg_policy['ECDSAP256SHA256'] = copy(p)
self.alg_policy['ECDSAP256SHA256'].algorithm = "ECDSAP256SHA256"
self.alg_policy['ECDSAP256SHA256'].name = "ECDSAP256SHA256"
self.alg_policy['ECDSAP256SHA256'].ksk_keysize = None;
self.alg_policy['ECDSAP256SHA256'].zsk_keysize = None;
self.alg_policy['ECDSAP384SHA384'] = copy(p)
self.alg_policy['ECDSAP384SHA384'].algorithm = "ECDSAP384SHA384"
self.alg_policy['ECDSAP384SHA384'].name = "ECDSAP384SHA384"
self.alg_policy['ECDSAP384SHA384'].ksk_keysize = None;
self.alg_policy['ECDSAP384SHA384'].zsk_keysize = None;
self.alg_policy['ED25519'] = copy(p)
self.alg_policy['ED25519'].algorithm = "ED25519"
self.alg_policy['ED25519'].name = "ED25519"
self.alg_policy['ED25519'].ksk_keysize = None;
self.alg_policy['ED25519'].zsk_keysize = None;
self.alg_policy['ED448'] = copy(p)
self.alg_policy['ED448'].algorithm = "ED448"
self.alg_policy['ED448'].name = "ED448"
self.alg_policy['ED448'].ksk_keysize = None;
self.alg_policy['ED448'].zsk_keysize = None;
if filename:
self.load(filename)
def load(self, filename):
self.filename = filename
self.initial = True
with open(filename) as f:
text = f.read()
self.plex.lexer.lineno = 0
self.parser.parse(text)
self.filename = None
def setup(self, text):
self.initial = True
self.plex.lexer.lineno = 0
self.parser.parse(text)
def policy(self, zone, **kwargs):
z = zone.lower()
p = None
if z in self.zone_policy:
p = self.zone_policy[z]
if p is None:
p = copy(self.named_policy['default'])
p.name = zone
p.is_constructed = True
if p.algorithm is None:
parent = p.parent or self.named_policy['default']
while parent and not parent.algorithm:
parent = parent.parent
p.algorithm = parent and parent.algorithm or None
if p.algorithm in self.alg_policy:
ap = self.alg_policy[p.algorithm]
else:
raise PolicyException('algorithm not found')
if p.directory is None:
parent = p.parent or self.named_policy['default']
while parent is not None and not parent.directory:
parent = parent.parent
p.directory = parent and parent.directory
if p.coverage is None:
parent = p.parent or self.named_policy['default']
while parent and not parent.coverage:
parent = parent.parent
p.coverage = parent and parent.coverage or ap.coverage
if p.ksk_keysize is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.ksk_keysize:
parent = parent.parent
p.ksk_keysize = parent and parent.ksk_keysize or ap.ksk_keysize
if p.zsk_keysize is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.zsk_keysize:
parent = parent.parent
p.zsk_keysize = parent and parent.zsk_keysize or ap.zsk_keysize
if p.ksk_rollperiod is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.ksk_rollperiod:
parent = parent.parent
p.ksk_rollperiod = parent and \
parent.ksk_rollperiod or ap.ksk_rollperiod
if p.zsk_rollperiod is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.zsk_rollperiod:
parent = parent.parent
p.zsk_rollperiod = parent and \
parent.zsk_rollperiod or ap.zsk_rollperiod
if p.ksk_prepublish is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.ksk_prepublish:
parent = parent.parent
p.ksk_prepublish = parent and \
parent.ksk_prepublish or ap.ksk_prepublish
if p.zsk_prepublish is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.zsk_prepublish:
parent = parent.parent
p.zsk_prepublish = parent and \
parent.zsk_prepublish or ap.zsk_prepublish
if p.ksk_postpublish is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.ksk_postpublish:
parent = parent.parent
p.ksk_postpublish = parent and \
parent.ksk_postpublish or ap.ksk_postpublish
if p.zsk_postpublish is None:
parent = p.parent or self.named_policy['default']
while parent.parent and not parent.zsk_postpublish:
parent = parent.parent
p.zsk_postpublish = parent and \
parent.zsk_postpublish or ap.zsk_postpublish
if p.keyttl is None:
parent = p.parent or self.named_policy['default']
while parent is not None and not parent.keyttl:
parent = parent.parent
p.keyttl = parent and parent.keyttl
if 'novalidate' not in kwargs or not kwargs['novalidate']:
(valid, msg) = p.validate()
if not valid:
raise PolicyException(msg)
return None
return p
def p_policylist(self, p):
'''policylist : init policy
| policylist policy'''
pass
def p_init(self, p):
"init :"
self.initial = False
def p_policy(self, p):
'''policy : alg_policy
| zone_policy
| named_policy'''
pass
def p_name(self, p):
'''name : STR
| KEYTYPE
| DATESUFFIX'''
p[0] = p[1]
pass
def p_domain(self, p):
'''domain : STR
| QSTRING
| KEYTYPE
| DATESUFFIX'''
p[0] = p[1].strip()
if not re.match(r'^[\w.-][\w.-]*$', p[0]):
raise PolicyException('invalid domain')
pass
def p_new_policy(self, p):
"new_policy :"
self.current = Policy()
def p_alg_policy(self, p):
"alg_policy : ALGORITHM_POLICY ALGNAME new_policy alg_option_group SEMI"
self.current.name = p[2]
self.current.is_alg = True
self.alg_policy[p[2]] = self.current
pass
def p_zone_policy(self, p):
"zone_policy : ZONE domain new_policy policy_option_group SEMI"
self.current.name = p[2].rstrip('.')
self.current.is_zone = True
self.zone_policy[p[2].rstrip('.').lower()] = self.current
pass
def p_named_policy(self, p):
"named_policy : POLICY name new_policy policy_option_group SEMI"
self.current.name = p[2]
self.named_policy[p[2].lower()] = self.current
pass
def p_duration_1(self, p):
"duration : NUMBER"
p[0] = p[1]
pass
def p_duration_2(self, p):
"duration : NONE"
p[0] = None
pass
def p_duration_3(self, p):
"duration : NUMBER DATESUFFIX"
if p[2] == "y":
p[0] = p[1] * 31536000 # year
elif p[2] == "mo":
p[0] = p[1] * 2592000 # month
elif p[2] == "w":
p[0] = p[1] * 604800 # week
elif p[2] == "d":
p[0] = p[1] * 86400 # day
elif p[2] == "h":
p[0] = p[1] * 3600 # hour
elif p[2] == "mi":
p[0] = p[1] * 60 # minute
elif p[2] == "s":
p[0] = p[1] # second
else:
raise PolicyException('invalid duration')
def p_policy_option_group(self, p):
"policy_option_group : LBRACE policy_option_list RBRACE"
pass
def p_policy_option_list(self, p):
'''policy_option_list : policy_option SEMI
| policy_option_list policy_option SEMI'''
pass
def p_policy_option(self, p):
'''policy_option : parent_option
| directory_option
| coverage_option
| rollperiod_option
| prepublish_option
| postpublish_option
| keysize_option
| algorithm_option
| keyttl_option
| standby_option'''
pass
def p_alg_option_group(self, p):
"alg_option_group : LBRACE alg_option_list RBRACE"
pass
def p_alg_option_list(self, p):
'''alg_option_list : alg_option SEMI
| alg_option_list alg_option SEMI'''
pass
def p_alg_option(self, p):
'''alg_option : coverage_option
| rollperiod_option
| prepublish_option
| postpublish_option
| keyttl_option
| keysize_option
| standby_option'''
pass
def p_parent_option(self, p):
"parent_option : POLICY name"
self.current.parent = self.named_policy[p[2].lower()]
def p_directory_option(self, p):
"directory_option : DIRECTORY QSTRING"
self.current.directory = p[2]
def p_coverage_option(self, p):
"coverage_option : COVERAGE duration"
self.current.coverage = p[2]
def p_rollperiod_option(self, p):
"rollperiod_option : ROLL_PERIOD KEYTYPE duration"
if p[2] == "KSK":
self.current.ksk_rollperiod = p[3]
else:
self.current.zsk_rollperiod = p[3]
def p_prepublish_option(self, p):
"prepublish_option : PRE_PUBLISH KEYTYPE duration"
if p[2] == "KSK":
self.current.ksk_prepublish = p[3]
else:
self.current.zsk_prepublish = p[3]
def p_postpublish_option(self, p):
"postpublish_option : POST_PUBLISH KEYTYPE duration"
if p[2] == "KSK":
self.current.ksk_postpublish = p[3]
else:
self.current.zsk_postpublish = p[3]
def p_keysize_option(self, p):
"keysize_option : KEY_SIZE KEYTYPE NUMBER"
if p[2] == "KSK":
self.current.ksk_keysize = p[3]
else:
self.current.zsk_keysize = p[3]
def p_standby_option(self, p):
"standby_option : STANDBY KEYTYPE NUMBER"
if p[2] == "KSK":
self.current.ksk_standby = p[3]
else:
self.current.zsk_standby = p[3]
def p_keyttl_option(self, p):
"keyttl_option : KEYTTL duration"
self.current.keyttl = p[2]
def p_algorithm_option(self, p):
"algorithm_option : ALGORITHM ALGNAME"
self.current.algorithm = p[2]
def p_error(self, p):
if p:
print("%s%s%d:syntax error near '%s'" %
(self.filename or "", ":" if self.filename else "",
p.lineno, p.value))
else:
if not self.initial:
raise PolicyException("%s%s%d:unexpected end of input" %
(self.filename or "", ":" if self.filename else "",
p and p.lineno or 0))
if __name__ == "__main__":
import sys
if sys.argv[1] == "lex":
file = open(sys.argv[2])
text = file.read()
file.close()
plex = PolicyLex(debug=1)
plex.test(text)
elif sys.argv[1] == "parse":
try:
pp = dnssec_policy(sys.argv[2], write_tables=True, debug=True)
print(pp.named_policy['default'])
print(pp.policy("nonexistent.zone"))
except Exception as e:
print(e.args[0])
isc/keymgr.py 0000644 00000014553 14751155147 0007214 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
from __future__ import print_function
import os, sys, argparse, glob, re, time, calendar, pprint
from collections import defaultdict
prog='dnssec-keymgr'
from isc import dnskey, keydict, keyseries, policy, parsetab, utils
############################################################################
# print a fatal error and exit
############################################################################
def fatal(*args, **kwargs):
print(*args, **kwargs)
sys.exit(1)
############################################################################
# find the location of an external command
############################################################################
def set_path(command, default=None):
""" find the location of a specified command. If a default is supplied,
exists and it's an executable, we use it; otherwise we search PATH
for an alternative.
:param command: command to look for
:param default: default value to use
:return: PATH with the location of a suitable binary
"""
fpath = default
if not fpath or not os.path.isfile(fpath) or not os.access(fpath, os.X_OK):
path = os.environ["PATH"]
if not path:
path = os.path.defpath
for directory in path.split(os.pathsep):
fpath = directory + os.sep + command
if os.path.isfile(fpath) and os.access(fpath, os.X_OK):
break
fpath = None
return fpath
############################################################################
# parse arguments
############################################################################
def parse_args():
""" Read command line arguments, returns 'args' object
:return: args object properly prepared
"""
keygen = set_path('dnssec-keygen',
os.path.join(utils.prefix('sbin'), 'dnssec-keygen'))
settime = set_path('dnssec-settime',
os.path.join(utils.prefix('sbin'), 'dnssec-settime'))
parser = argparse.ArgumentParser(description=prog + ': schedule '
'DNSSEC key rollovers according to a '
'pre-defined policy')
parser.add_argument('zone', type=str, nargs='*', default=None,
help='Zone(s) to which the policy should be applied ' +
'(default: all zones in the directory)')
parser.add_argument('-K', dest='path', type=str,
help='Directory containing keys', metavar='dir')
parser.add_argument('-c', dest='policyfile', type=str,
help='Policy definition file', metavar='file')
parser.add_argument('-g', dest='keygen', default=keygen, type=str,
help='Path to \'dnssec-keygen\'',
metavar='path')
parser.add_argument('-r', dest='randomdev', type=str, default=None,
help='Path to a file containing random data to pass to \'dnssec-keygen\'',
metavar='path')
parser.add_argument('-s', dest='settime', default=settime, type=str,
help='Path to \'dnssec-settime\'',
metavar='path')
parser.add_argument('-k', dest='no_zsk',
action='store_true', default=False,
help='Only apply policy to key-signing keys (KSKs)')
parser.add_argument('-z', dest='no_ksk',
action='store_true', default=False,
help='Only apply policy to zone-signing keys (ZSKs)')
parser.add_argument('-f', '--force', dest='force', action='store_true',
default=False, help='Force updates to key events '+
'even if they are in the past')
parser.add_argument('-q', '--quiet', dest='quiet', action='store_true',
default=False, help='Update keys silently')
parser.add_argument('-v', '--version', action='version',
version=utils.version)
args = parser.parse_args()
if args.no_zsk and args.no_ksk:
fatal("ERROR: -z and -k cannot be used together.")
if args.keygen is None:
fatal("ERROR: dnssec-keygen not found")
if args.settime is None:
fatal("ERROR: dnssec-settime not found")
# if a policy file was specified, check that it exists.
# if not, use the default file, unless it doesn't exist
if args.policyfile is not None:
if not os.path.exists(args.policyfile):
fatal('ERROR: Policy file "%s" not found' % args.policyfile)
else:
args.policyfile = os.path.join(utils.sysconfdir,
'dnssec-policy.conf')
if not os.path.exists(args.policyfile):
args.policyfile = None
return args
############################################################################
# main
############################################################################
def main():
args = parse_args()
# As we may have specific locations for the binaries, we put that info
# into a context object that can be passed around
context = {'keygen_path': args.keygen,
'settime_path': args.settime,
'keys_path': args.path,
'randomdev': args.randomdev}
try:
dp = policy.dnssec_policy(args.policyfile)
except Exception as e:
fatal('Unable to load DNSSEC policy: ' + str(e))
try:
kd = keydict(dp, path=args.path, zones=args.zone)
except Exception as e:
fatal('Unable to build key dictionary: ' + str(e))
try:
ks = keyseries(kd, context=context)
except Exception as e:
fatal('Unable to build key series: ' + str(e))
try:
ks.enforce_policy(dp, ksk=args.no_zsk, zsk=args.no_ksk,
force=args.force, quiet=args.quiet)
except Exception as e:
fatal('Unable to apply policy: ' + str(e))
isc/rndc.py 0000644 00000015053 14751155147 0006640 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
############################################################################
# rndc.py
# This module implements the RNDC control protocol.
############################################################################
from collections import OrderedDict
import time
import struct
import hashlib
import hmac
import base64
import random
import socket
class rndc(object):
"""RNDC protocol client library"""
__algos = {'md5': 157,
'sha1': 161,
'sha224': 162,
'sha256': 163,
'sha384': 164,
'sha512': 165}
def __init__(self, host, algo, secret):
"""Creates a persistent connection to RNDC and logs in
host - (ip, port) tuple
algo - HMAC algorithm: one of md5, sha1, sha224, sha256, sha384, sha512
(with optional prefix 'hmac-')
secret - HMAC secret, base64 encoded"""
self.host = host
algo = algo.lower()
if algo.startswith('hmac-'):
algo = algo[5:]
self.algo = algo
self.hlalgo = getattr(hashlib, algo)
self.secret = base64.b64decode(secret)
self.ser = random.randint(0, 1 << 24)
self.nonce = None
self.__connect_login()
def call(self, cmd):
"""Call a RNDC command, all parsing is done on the server side
cmd - a complete string with a command (eg 'reload zone example.com')
"""
return dict(self.__command(type=cmd)['_data'])
def __serialize_dict(self, data, ignore_auth=False):
rv = bytearray()
for k, v in data.items():
if ignore_auth and k == '_auth':
continue
rv += struct.pack('B', len(k)) + k.encode('ascii')
if type(v) == str:
rv += struct.pack('>BI', 1, len(v)) + v.encode('ascii')
elif type(v) == bytes:
rv += struct.pack('>BI', 1, len(v)) + v
elif type(v) == bytearray:
rv += struct.pack('>BI', 1, len(v)) + v
elif type(v) == OrderedDict:
sd = self.__serialize_dict(v)
rv += struct.pack('>BI', 2, len(sd)) + sd
else:
raise NotImplementedError('Cannot serialize element of type %s'
% type(v))
return rv
def __prep_message(self, *args, **kwargs):
self.ser += 1
now = int(time.time())
data = OrderedDict(*args, **kwargs)
d = OrderedDict()
d['_auth'] = OrderedDict()
d['_ctrl'] = OrderedDict()
d['_ctrl']['_ser'] = str(self.ser)
d['_ctrl']['_tim'] = str(now)
d['_ctrl']['_exp'] = str(now+60)
if self.nonce is not None:
d['_ctrl']['_nonce'] = self.nonce
d['_data'] = data
msg = self.__serialize_dict(d, ignore_auth=True)
hash = hmac.new(self.secret, msg, self.hlalgo).digest()
bhash = base64.b64encode(hash)
if self.algo == 'md5':
d['_auth']['hmd5'] = struct.pack('22s', bhash)
else:
d['_auth']['hsha'] = bytearray(struct.pack('B88s',
self.__algos[self.algo], bhash))
msg = self.__serialize_dict(d)
msg = struct.pack('>II', len(msg) + 4, 1) + msg
return msg
def __verify_msg(self, msg):
if self.nonce is not None and msg['_ctrl']['_nonce'] != self.nonce:
return False
if self.algo == 'md5':
bhash = msg['_auth']['hmd5']
else:
bhash = msg['_auth']['hsha'][1:]
if type(bhash) == bytes:
bhash = bhash.decode('ascii')
bhash += '=' * (4 - (len(bhash) % 4))
remote_hash = base64.b64decode(bhash)
my_msg = self.__serialize_dict(msg, ignore_auth=True)
my_hash = hmac.new(self.secret, my_msg, self.hlalgo).digest()
return (my_hash == remote_hash)
def __command(self, *args, **kwargs):
msg = self.__prep_message(*args, **kwargs)
sent = self.socket.send(msg)
if sent != len(msg):
raise IOError("Cannot send the message")
header = self.socket.recv(8)
if len(header) != 8:
# What should we throw here? Bad auth can cause this...
raise IOError("Can't read response header")
length, version = struct.unpack('>II', header)
if version != 1:
raise NotImplementedError('Wrong message version %d' % version)
# it includes the header
length -= 4
data = self.socket.recv(length, socket.MSG_WAITALL)
if len(data) != length:
raise IOError("Can't read response data")
if type(data) == str:
data = bytearray(data)
msg = self.__parse_message(data)
if not self.__verify_msg(msg):
raise IOError("Authentication failure")
return msg
def __connect_login(self):
self.socket = socket.create_connection(self.host)
self.nonce = None
msg = self.__command(type='null')
self.nonce = msg['_ctrl']['_nonce']
def __parse_element(self, input):
pos = 0
labellen = input[pos]
pos += 1
label = input[pos:pos+labellen].decode('ascii')
pos += labellen
type = input[pos]
pos += 1
datalen = struct.unpack('>I', input[pos:pos+4])[0]
pos += 4
data = input[pos:pos+datalen]
pos += datalen
rest = input[pos:]
if type == 1: # raw binary value
return label, data, rest
elif type == 2: # dictionary
d = OrderedDict()
while len(data) > 0:
ilabel, value, data = self.__parse_element(data)
d[ilabel] = value
return label, d, rest
# TODO type 3 - list
else:
raise NotImplementedError('Unknown element type %d' % type)
def __parse_message(self, input):
rv = OrderedDict()
hdata = None
while len(input) > 0:
label, value, input = self.__parse_element(input)
rv[label] = value
return rv
isc/eventlist.py 0000644 00000013330 14751155147 0007723 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
from collections import defaultdict
from .dnskey import *
from .keydict import *
from .keyevent import *
class eventlist:
_K = defaultdict(lambda: defaultdict(list))
_Z = defaultdict(lambda: defaultdict(list))
_zones = set()
_kdict = None
def __init__(self, kdict):
properties = ["SyncPublish", "Publish", "SyncDelete",
"Activate", "Inactive", "Delete"]
self._kdict = kdict
for zone in kdict.zones():
self._zones.add(zone)
for alg, keys in kdict[zone].items():
for k in keys.values():
for prop in properties:
t = k.gettime(prop)
if not t:
continue
e = keyevent(prop, k, t)
if k.sep:
self._K[zone][alg].append(e)
else:
self._Z[zone][alg].append(e)
self._K[zone][alg] = sorted(self._K[zone][alg],
key=lambda event: event.when)
self._Z[zone][alg] = sorted(self._Z[zone][alg],
key=lambda event: event.when)
# scan events per zone, algorithm, and key type, in order of
# occurrence, noting inconsistent states when found
def coverage(self, zone, keytype, until, output = None):
def noop(*args, **kwargs): pass
if not output:
output = noop
no_zsk = True if (keytype and keytype == "KSK") else False
no_ksk = True if (keytype and keytype == "ZSK") else False
kok = zok = True
found = False
if zone and not zone in self._zones:
output("ERROR: No key events found for %s" % zone)
return False
if zone:
found = True
if not no_ksk:
kok = self.checkzone(zone, "KSK", until, output)
if not no_zsk:
zok = self.checkzone(zone, "ZSK", until, output)
else:
for z in self._zones:
if not no_ksk and z in self._K.keys():
found = True
kok = self.checkzone(z, "KSK", until, output)
if not no_zsk and z in self._Z.keys():
found = True
zok = self.checkzone(z, "ZSK", until, output)
if not found:
output("ERROR: No key events found")
return False
return (kok and zok)
def checkzone(self, zone, keytype, until, output):
allok = True
if keytype == "KSK":
kz = self._K[zone]
else:
kz = self._Z[zone]
for alg in kz.keys():
output("Checking scheduled %s events for zone %s, "
"algorithm %s..." %
(keytype, zone, dnskey.algstr(alg)))
ok = eventlist.checkset(kz[alg], keytype, until, output)
if ok:
output("No errors found")
allok = allok and ok
return allok
@staticmethod
def showset(eventset, output):
if not eventset:
return
output(" " + eventset[0].showtime() + ":", skip=False)
for event in eventset:
output(" %s: %s" % (event.what, repr(event.key)), skip=False)
@staticmethod
def checkset(eventset, keytype, until, output):
groups = list()
group = list()
# collect up all events that have the same time
eventsfound = False
for event in eventset:
# we found an event
eventsfound = True
# add event to current group
if (not group or group[0].when == event.when):
group.append(event)
# if we're at the end of the list, we're done. if
# we've found an event with a later time, start a new group
if (group[0].when != event.when):
groups.append(group)
group = list()
group.append(event)
if group:
groups.append(group)
if not eventsfound:
output("ERROR: No %s events found" % keytype)
return False
active = published = None
for group in groups:
if (until and calendar.timegm(group[0].when) > until):
output("Ignoring events after %s" %
time.strftime("%a %b %d %H:%M:%S UTC %Y",
time.gmtime(until)))
return True
for event in group:
(active, published) = event.status(active, published)
eventlist.showset(group, output)
# and then check for inconsistencies:
if not active:
output("ERROR: No %s's are active after this event" % keytype)
return False
elif not published:
output("ERROR: No %s's are published after this event"
% keytype)
return False
elif not published.intersection(active):
output("ERROR: No %s's are both active and published "
"after this event" % keytype)
return False
return True
isc/parsetab.py 0000644 00000017575 14751155147 0007526 0 ustar 00
# parsetab.py
# This file is automatically generated. Do not edit.
_tabversion = '3.8'
_lr_method = 'LALR'
_lr_signature = 'C2FE91AF256AF1CCEB499107DA2CFE7E'
_lr_action_items = {'ALGORITHM_POLICY':([0,1,2,3,4,5,6,10,29,46,62,],[-3,7,7,-2,-4,-5,-6,-1,-15,-16,-17,]),'ZONE':([0,1,2,3,4,5,6,10,29,46,62,],[-3,8,8,-2,-4,-5,-6,-1,-15,-16,-17,]),'POLICY':([0,1,2,3,4,5,6,10,27,29,46,47,62,77,88,],[-3,9,9,-2,-4,-5,-6,-1,59,-15,-16,59,-17,-22,-23,]),'$end':([1,3,4,5,6,10,29,46,62,],[0,-2,-4,-5,-6,-1,-15,-16,-17,]),'ALGNAME':([7,61,],[11,80,]),'STR':([8,9,59,],[13,18,18,]),'QSTRING':([8,60,],[14,79,]),'KEYTYPE':([8,9,40,41,42,44,45,59,],[15,19,69,70,71,73,74,19,]),'DATESUFFIX':([8,9,59,67,],[16,20,20,82,]),'LBRACE':([11,12,13,14,15,16,17,18,19,20,21,22,23,],[-14,-14,-10,-11,-12,-13,-14,-7,-8,-9,25,27,27,]),'SEMI':([18,19,20,24,26,28,31,32,33,34,35,36,37,38,48,49,50,51,52,53,54,55,56,57,58,63,64,66,67,68,72,75,76,78,79,80,82,83,84,85,86,87,],[-7,-8,-9,29,46,62,65,-37,-38,-39,-40,-41,-42,-43,77,-24,-25,-26,-27,-28,-29,-30,-31,-32,-33,-34,81,-46,-18,-19,-52,-21,88,-44,-45,-53,-20,-47,-48,-49,-50,-51,]),'COVERAGE':([25,27,30,47,65,77,81,88,],[39,39,39,39,-35,-22,-36,-23,]),'ROLL_PERIOD':([25,27,30,47,65,77,81,88,],[40,40,40,40,-35,-22,-36,-23,]),'PRE_PUBLISH':([25,27,30,47,65,77,81,88,],[41,41,41,41,-35,-22,-36,-23,]),'POST_PUBLISH':([25,27,30,47,65,77,81,88,],[42,42,42,42,-35,-22,-36,-23,]),'KEYTTL':([25,27,30,47,65,77,81,88,],[43,43,43,43,-35,-22,-36,-23,]),'KEY_SIZE':([25,27,30,47,65,77,81,88,],[44,44,44,44,-35,-22,-36,-23,]),'STANDBY':([25,27,30,47,65,77,81,88,],[45,45,45,45,-35,-22,-36,-23,]),'DIRECTORY':([27,47,77,88,],[60,60,-22,-23,]),'ALGORITHM':([27,47,77,88,],[61,61,-22,-23,]),'RBRACE':([30,47,65,77,81,88,],[63,75,-35,-22,-36,-23,]),'NUMBER':([39,43,69,70,71,73,74,],[67,67,67,67,67,86,87,]),'NONE':([39,43,69,70,71,],[68,68,68,68,68,]),}
_lr_action = {}
for _k, _v in _lr_action_items.items():
for _x,_y in zip(_v[0],_v[1]):
if not _x in _lr_action: _lr_action[_x] = {}
_lr_action[_x][_k] = _y
del _lr_action_items
_lr_goto_items = {'policylist':([0,],[1,]),'init':([0,],[2,]),'policy':([1,2,],[3,10,]),'alg_policy':([1,2,],[4,4,]),'zone_policy':([1,2,],[5,5,]),'named_policy':([1,2,],[6,6,]),'domain':([8,],[12,]),'name':([9,59,],[17,78,]),'new_policy':([11,12,17,],[21,22,23,]),'alg_option_group':([21,],[24,]),'policy_option_group':([22,23,],[26,28,]),'alg_option_list':([25,],[30,]),'alg_option':([25,30,],[31,64,]),'coverage_option':([25,27,30,47,],[32,51,32,51,]),'rollperiod_option':([25,27,30,47,],[33,52,33,52,]),'prepublish_option':([25,27,30,47,],[34,53,34,53,]),'postpublish_option':([25,27,30,47,],[35,54,35,54,]),'keyttl_option':([25,27,30,47,],[36,57,36,57,]),'keysize_option':([25,27,30,47,],[37,55,37,55,]),'standby_option':([25,27,30,47,],[38,58,38,58,]),'policy_option_list':([27,],[47,]),'policy_option':([27,47,],[48,76,]),'parent_option':([27,47,],[49,49,]),'directory_option':([27,47,],[50,50,]),'algorithm_option':([27,47,],[56,56,]),'duration':([39,43,69,70,71,],[66,72,83,84,85,]),}
_lr_goto = {}
for _k, _v in _lr_goto_items.items():
for _x, _y in zip(_v[0], _v[1]):
if not _x in _lr_goto: _lr_goto[_x] = {}
_lr_goto[_x][_k] = _y
del _lr_goto_items
_lr_productions = [
("S' -> policylist","S'",1,None,None,None),
('policylist -> init policy','policylist',2,'p_policylist','policy.py',523),
('policylist -> policylist policy','policylist',2,'p_policylist','policy.py',524),
('init -> <empty>','init',0,'p_init','policy.py',528),
('policy -> alg_policy','policy',1,'p_policy','policy.py',532),
('policy -> zone_policy','policy',1,'p_policy','policy.py',533),
('policy -> named_policy','policy',1,'p_policy','policy.py',534),
('name -> STR','name',1,'p_name','policy.py',538),
('name -> KEYTYPE','name',1,'p_name','policy.py',539),
('name -> DATESUFFIX','name',1,'p_name','policy.py',540),
('domain -> STR','domain',1,'p_domain','policy.py',545),
('domain -> QSTRING','domain',1,'p_domain','policy.py',546),
('domain -> KEYTYPE','domain',1,'p_domain','policy.py',547),
('domain -> DATESUFFIX','domain',1,'p_domain','policy.py',548),
('new_policy -> <empty>','new_policy',0,'p_new_policy','policy.py',555),
('alg_policy -> ALGORITHM_POLICY ALGNAME new_policy alg_option_group SEMI','alg_policy',5,'p_alg_policy','policy.py',559),
('zone_policy -> ZONE domain new_policy policy_option_group SEMI','zone_policy',5,'p_zone_policy','policy.py',566),
('named_policy -> POLICY name new_policy policy_option_group SEMI','named_policy',5,'p_named_policy','policy.py',573),
('duration -> NUMBER','duration',1,'p_duration_1','policy.py',579),
('duration -> NONE','duration',1,'p_duration_2','policy.py',584),
('duration -> NUMBER DATESUFFIX','duration',2,'p_duration_3','policy.py',589),
('policy_option_group -> LBRACE policy_option_list RBRACE','policy_option_group',3,'p_policy_option_group','policy.py',608),
('policy_option_list -> policy_option SEMI','policy_option_list',2,'p_policy_option_list','policy.py',612),
('policy_option_list -> policy_option_list policy_option SEMI','policy_option_list',3,'p_policy_option_list','policy.py',613),
('policy_option -> parent_option','policy_option',1,'p_policy_option','policy.py',617),
('policy_option -> directory_option','policy_option',1,'p_policy_option','policy.py',618),
('policy_option -> coverage_option','policy_option',1,'p_policy_option','policy.py',619),
('policy_option -> rollperiod_option','policy_option',1,'p_policy_option','policy.py',620),
('policy_option -> prepublish_option','policy_option',1,'p_policy_option','policy.py',621),
('policy_option -> postpublish_option','policy_option',1,'p_policy_option','policy.py',622),
('policy_option -> keysize_option','policy_option',1,'p_policy_option','policy.py',623),
('policy_option -> algorithm_option','policy_option',1,'p_policy_option','policy.py',624),
('policy_option -> keyttl_option','policy_option',1,'p_policy_option','policy.py',625),
('policy_option -> standby_option','policy_option',1,'p_policy_option','policy.py',626),
('alg_option_group -> LBRACE alg_option_list RBRACE','alg_option_group',3,'p_alg_option_group','policy.py',630),
('alg_option_list -> alg_option SEMI','alg_option_list',2,'p_alg_option_list','policy.py',634),
('alg_option_list -> alg_option_list alg_option SEMI','alg_option_list',3,'p_alg_option_list','policy.py',635),
('alg_option -> coverage_option','alg_option',1,'p_alg_option','policy.py',639),
('alg_option -> rollperiod_option','alg_option',1,'p_alg_option','policy.py',640),
('alg_option -> prepublish_option','alg_option',1,'p_alg_option','policy.py',641),
('alg_option -> postpublish_option','alg_option',1,'p_alg_option','policy.py',642),
('alg_option -> keyttl_option','alg_option',1,'p_alg_option','policy.py',643),
('alg_option -> keysize_option','alg_option',1,'p_alg_option','policy.py',644),
('alg_option -> standby_option','alg_option',1,'p_alg_option','policy.py',645),
('parent_option -> POLICY name','parent_option',2,'p_parent_option','policy.py',649),
('directory_option -> DIRECTORY QSTRING','directory_option',2,'p_directory_option','policy.py',653),
('coverage_option -> COVERAGE duration','coverage_option',2,'p_coverage_option','policy.py',657),
('rollperiod_option -> ROLL_PERIOD KEYTYPE duration','rollperiod_option',3,'p_rollperiod_option','policy.py',661),
('prepublish_option -> PRE_PUBLISH KEYTYPE duration','prepublish_option',3,'p_prepublish_option','policy.py',668),
('postpublish_option -> POST_PUBLISH KEYTYPE duration','postpublish_option',3,'p_postpublish_option','policy.py',675),
('keysize_option -> KEY_SIZE KEYTYPE NUMBER','keysize_option',3,'p_keysize_option','policy.py',682),
('standby_option -> STANDBY KEYTYPE NUMBER','standby_option',3,'p_standby_option','policy.py',689),
('keyttl_option -> KEYTTL duration','keyttl_option',2,'p_keyttl_option','policy.py',696),
('algorithm_option -> ALGORITHM ALGNAME','algorithm_option',2,'p_algorithm_option','policy.py',700),
]
isc/keyseries.py 0000644 00000021022 14751155147 0007706 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
from collections import defaultdict
from .dnskey import *
from .keydict import *
from .keyevent import *
from .policy import *
import time
class keyseries:
_K = defaultdict(lambda: defaultdict(list))
_Z = defaultdict(lambda: defaultdict(list))
_zones = set()
_kdict = None
_context = None
def __init__(self, kdict, now=time.time(), context=None):
self._kdict = kdict
self._context = context
self._zones = set(kdict.missing())
for zone in kdict.zones():
self._zones.add(zone)
for alg, keys in kdict[zone].items():
for k in keys.values():
if k.sep:
if not (k.delete() and k.delete() < now):
self._K[zone][alg].append(k)
else:
if not (k.delete() and k.delete() < now):
self._Z[zone][alg].append(k)
self._K[zone][alg].sort()
self._Z[zone][alg].sort()
def __iter__(self):
for zone in self._zones:
for collection in [self._K, self._Z]:
if zone not in collection:
continue
for alg, keys in collection[zone].items():
for key in keys:
yield key
def dump(self):
for k in self:
print("%s" % repr(k))
def fixseries(self, keys, policy, now, **kwargs):
force = kwargs.get('force', False)
if not keys:
return
# handle the first key
key = keys[0]
if key.sep:
rp = policy.ksk_rollperiod
prepub = policy.ksk_prepublish or (30 * 86400)
postpub = policy.ksk_postpublish or (30 * 86400)
else:
rp = policy.zsk_rollperiod
prepub = policy.zsk_prepublish or (30 * 86400)
postpub = policy.zsk_postpublish or (30 * 86400)
# the first key should be published and active
p = key.publish()
a = key.activate()
if not p or p > now:
key.setpublish(now)
p = now
if not a or a > now:
key.setactivate(now)
a = now
i = key.inactive()
fudge = 300
if not rp:
key.setinactive(None, **kwargs)
key.setdelete(None, **kwargs)
elif not i or a + rp != i:
if not i and a + rp > now + prepub + fudge:
key.setinactive(a + rp, **kwargs)
key.setdelete(a + rp + postpub, **kwargs)
elif not i:
key.setinactive(now + prepub + fudge, **kwargs)
key.setdelete(now + prepub + postpub + fudge, **kwargs)
elif i < now:
pass
elif a + rp > i:
key.setinactive(a + rp, **kwargs)
key.setdelete(a + rp + postpub, **kwargs)
elif a + rp > now + prepub + fudge:
key.setinactive(a + rp, **kwargs)
key.setdelete(a + rp + postpub, **kwargs)
else:
key.setinactive(now + prepub + fudge, **kwargs)
key.setdelete(now + prepub + postpub + fudge, **kwargs)
else:
d = key.delete()
if not d or i + postpub > now + fudge:
key.setdelete(i + postpub, **kwargs)
elif not d:
key.setdelete(now + postpub + fudge, **kwargs)
elif d < now + fudge:
pass
elif d < i + postpub:
key.setdelete(i + postpub, **kwargs)
if policy.keyttl != key.ttl:
key.setttl(policy.keyttl)
# handle all the subsequent keys
prev = key
for key in keys[1:]:
# if no rollperiod, then all keys after the first in
# the series kept inactive.
# (XXX: we need to change this to allow standby keys)
if not rp:
key.setpublish(None, **kwargs)
key.setactivate(None, **kwargs)
key.setinactive(None, **kwargs)
key.setdelete(None, **kwargs)
if policy.keyttl != key.ttl:
key.setttl(policy.keyttl)
continue
# otherwise, ensure all dates are set correctly based on
# the initial key
a = prev.inactive()
p = a - prepub
key.setactivate(a, **kwargs)
key.setpublish(p, **kwargs)
key.setinactive(a + rp, **kwargs)
key.setdelete(a + rp + postpub, **kwargs)
prev.setdelete(a + postpub, **kwargs)
if policy.keyttl != key.ttl:
key.setttl(policy.keyttl)
prev = key
# if we haven't got sufficient coverage, create successor key(s)
while rp and prev.inactive() and \
prev.inactive() < now + policy.coverage:
# commit changes to predecessor: a successor can only be
# generated if Inactive has been set in the predecessor key
prev.commit(self._context['settime_path'], **kwargs)
key = prev.generate_successor(self._context['keygen_path'],
self._context['randomdev'],
prepub, **kwargs)
key.setinactive(key.activate() + rp, **kwargs)
key.setdelete(key.inactive() + postpub, **kwargs)
keys.append(key)
prev = key
# last key? we already know we have sufficient coverage now, so
# disable the inactivation of the final key (if it was set),
# ensuring that if dnssec-keymgr isn't run again, the last key
# in the series will at least remain usable.
prev.setinactive(None, **kwargs)
prev.setdelete(None, **kwargs)
# commit changes
for key in keys:
key.commit(self._context['settime_path'], **kwargs)
def enforce_policy(self, policies, now=time.time(), **kwargs):
# If zones is provided as a parameter, use that list.
# If not, use what we have in this object
zones = kwargs.get('zones', self._zones)
keys_dir = kwargs.get('dir', self._context.get('keys_path', None))
force = kwargs.get('force', False)
for zone in zones:
collections = []
policy = policies.policy(zone)
keys_dir = keys_dir or policy.directory or '.'
alg = policy.algorithm
algnum = dnskey.algnum(alg)
if 'ksk' not in kwargs or not kwargs['ksk']:
if len(self._Z[zone][algnum]) == 0:
k = dnskey.generate(self._context['keygen_path'],
self._context['randomdev'],
keys_dir, zone, alg,
policy.zsk_keysize, False,
policy.keyttl or 3600,
**kwargs)
self._Z[zone][algnum].append(k)
collections.append(self._Z[zone])
if 'zsk' not in kwargs or not kwargs['zsk']:
if len(self._K[zone][algnum]) == 0:
k = dnskey.generate(self._context['keygen_path'],
self._context['randomdev'],
keys_dir, zone, alg,
policy.ksk_keysize, True,
policy.keyttl or 3600,
**kwargs)
self._K[zone][algnum].append(k)
collections.append(self._K[zone])
for collection in collections:
for algorithm, keys in collection.items():
if algorithm != algnum:
continue
try:
self.fixseries(keys, policy, now, **kwargs)
except Exception as e:
raise Exception('%s/%s: %s' %
(zone, dnskey.algstr(algnum), str(e)))
isc/utils.py 0000644 00000004240 14751155147 0007046 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
import os
# These routines permit platform-independent location of BIND 9 tools
if os.name == 'nt':
import win32con
import win32api
def prefix(bindir=''):
if os.name != 'nt':
return os.path.join('/usr', bindir)
hklm = win32con.HKEY_LOCAL_MACHINE
bind_subkey = "Software\\ISC\\BIND"
sam = win32con.KEY_READ
h_key = None
key_found = True
# can fail if the registry redirected for 32/64 bits
try:
h_key = win32api.RegOpenKeyEx(hklm, bind_subkey, 0, sam)
except:
key_found = False
# retry for 32 bit python with 64 bit bind9
if not key_found:
key_found = True
sam64 = sam | win32con.KEY_WOW64_64KEY
try:
h_key = win32api.RegOpenKeyEx(hklm, bind_subkey, 0, sam64)
except:
key_found = False
# retry 64 bit python with 32 bit bind9
if not key_found:
key_found = True
sam32 = sam | win32con.KEY_WOW64_32KEY
try:
h_key = win32api.RegOpenKeyEx(hklm, bind_subkey, 0, sam32)
except:
key_found = False
if key_found:
try:
(named_base, _) = win32api.RegQueryValueEx(h_key, "InstallDir")
except:
key_found = False
win32api.RegCloseKey(h_key)
if key_found:
return os.path.join(named_base, bindir)
return os.path.join(win32api.GetSystemDirectory(), bindir)
def shellquote(s):
if os.name == 'nt':
return '"' + s.replace('"', '"\\"') + '"'
return "'" + s.replace("'", "'\\''") + "'"
version = '9.11.36-RedHat-9.11.36-16.el8_10.2'
if os.name != 'nt':
sysconfdir = '/etc'
else:
sysconfdir = prefix('etc')
isc/keyzone.py 0000644 00000003677 14751155147 0007407 0 ustar 00 ############################################################################
# Copyright (C) Internet Systems Consortium, Inc. ("ISC")
#
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, you can obtain one at https://mozilla.org/MPL/2.0/.
#
# See the COPYRIGHT file distributed with this work for additional
# information regarding copyright ownership.
############################################################################
import os
import sys
import re
from subprocess import Popen, PIPE
########################################################################
# Exceptions
########################################################################
class KeyZoneException(Exception):
pass
########################################################################
# class keyzone
########################################################################
class keyzone:
"""reads a zone file to find data relevant to keys"""
def __init__(self, name, filename, czpath):
self.maxttl = None
self.keyttl = None
if not name:
return
if not czpath or not os.path.isfile(czpath) \
or not os.access(czpath, os.X_OK):
raise KeyZoneException('"named-compilezone" not found')
return
maxttl = keyttl = None
fp, _ = Popen([czpath, "-o", "-", name, filename],
stdout=PIPE, stderr=PIPE).communicate()
for line in fp.splitlines():
if type(line) is not str:
line = line.decode('ascii')
if re.search('^[:space:]*;', line):
continue
fields = line.split()
if not maxttl or int(fields[1]) > maxttl:
maxttl = int(fields[1])
if fields[3] == "DNSKEY":
keyttl = int(fields[1])
self.keyttl = keyttl
self.maxttl = maxttl
decorator.py 0000644 00000040270 14751155147 0007115 0 ustar 00 # ######################### LICENSE ############################ #
# Copyright (c) 2005-2018, Michele Simionato
# All rights reserved.
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
# Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# Redistributions in bytecode form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in
# the documentation and/or other materials provided with the
# distribution.
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
# OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
# ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
# TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
# USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
# DAMAGE.
"""
Decorator module, see http://pypi.python.org/pypi/decorator
for the documentation.
"""
from __future__ import print_function
import re
import sys
import inspect
import operator
import itertools
import collections
__version__ = '4.2.1'
if sys.version >= '3':
from inspect import getfullargspec
def get_init(cls):
return cls.__init__
else:
FullArgSpec = collections.namedtuple(
'FullArgSpec', 'args varargs varkw defaults '
'kwonlyargs kwonlydefaults')
def getfullargspec(f):
"A quick and dirty replacement for getfullargspec for Python 2.X"
return FullArgSpec._make(inspect.getargspec(f) + ([], None))
def get_init(cls):
return cls.__init__.__func__
try:
iscoroutinefunction = inspect.iscoroutinefunction
except AttributeError:
# let's assume there are no coroutine functions in old Python
def iscoroutinefunction(f):
return False
# getargspec has been deprecated in Python 3.5
ArgSpec = collections.namedtuple(
'ArgSpec', 'args varargs varkw defaults')
def getargspec(f):
"""A replacement for inspect.getargspec"""
spec = getfullargspec(f)
return ArgSpec(spec.args, spec.varargs, spec.varkw, spec.defaults)
DEF = re.compile(r'\s*def\s*([_\w][_\w\d]*)\s*\(')
# basic functionality
class FunctionMaker(object):
"""
An object with the ability to create functions with a given signature.
It has attributes name, doc, module, signature, defaults, dict and
methods update and make.
"""
# Atomic get-and-increment provided by the GIL
_compile_count = itertools.count()
# make pylint happy
args = varargs = varkw = defaults = kwonlyargs = kwonlydefaults = ()
def __init__(self, func=None, name=None, signature=None,
defaults=None, doc=None, module=None, funcdict=None):
self.shortsignature = signature
if func:
# func can be a class or a callable, but not an instance method
self.name = func.__name__
if self.name == '<lambda>': # small hack for lambda functions
self.name = '_lambda_'
self.doc = func.__doc__
self.module = func.__module__
if inspect.isfunction(func):
argspec = getfullargspec(func)
self.annotations = getattr(func, '__annotations__', {})
for a in ('args', 'varargs', 'varkw', 'defaults', 'kwonlyargs',
'kwonlydefaults'):
setattr(self, a, getattr(argspec, a))
for i, arg in enumerate(self.args):
setattr(self, 'arg%d' % i, arg)
allargs = list(self.args)
allshortargs = list(self.args)
if self.varargs:
allargs.append('*' + self.varargs)
allshortargs.append('*' + self.varargs)
elif self.kwonlyargs:
allargs.append('*') # single star syntax
for a in self.kwonlyargs:
allargs.append('%s=None' % a)
allshortargs.append('%s=%s' % (a, a))
if self.varkw:
allargs.append('**' + self.varkw)
allshortargs.append('**' + self.varkw)
self.signature = ', '.join(allargs)
self.shortsignature = ', '.join(allshortargs)
self.dict = func.__dict__.copy()
# func=None happens when decorating a caller
if name:
self.name = name
if signature is not None:
self.signature = signature
if defaults:
self.defaults = defaults
if doc:
self.doc = doc
if module:
self.module = module
if funcdict:
self.dict = funcdict
# check existence required attributes
assert hasattr(self, 'name')
if not hasattr(self, 'signature'):
raise TypeError('You are decorating a non function: %s' % func)
def update(self, func, **kw):
"Update the signature of func with the data in self"
func.__name__ = self.name
func.__doc__ = getattr(self, 'doc', None)
func.__dict__ = getattr(self, 'dict', {})
func.__defaults__ = self.defaults
func.__kwdefaults__ = self.kwonlydefaults or None
func.__annotations__ = getattr(self, 'annotations', None)
try:
frame = sys._getframe(3)
except AttributeError: # for IronPython and similar implementations
callermodule = '?'
else:
callermodule = frame.f_globals.get('__name__', '?')
func.__module__ = getattr(self, 'module', callermodule)
func.__dict__.update(kw)
def make(self, src_templ, evaldict=None, addsource=False, **attrs):
"Make a new function from a given template and update the signature"
src = src_templ % vars(self) # expand name and signature
evaldict = evaldict or {}
mo = DEF.search(src)
if mo is None:
raise SyntaxError('not a valid function template\n%s' % src)
name = mo.group(1) # extract the function name
names = set([name] + [arg.strip(' *') for arg in
self.shortsignature.split(',')])
for n in names:
if n in ('_func_', '_call_'):
raise NameError('%s is overridden in\n%s' % (n, src))
if not src.endswith('\n'): # add a newline for old Pythons
src += '\n'
# Ensure each generated function has a unique filename for profilers
# (such as cProfile) that depend on the tuple of (<filename>,
# <definition line>, <function name>) being unique.
filename = '<decorator-gen-%d>' % (next(self._compile_count),)
try:
code = compile(src, filename, 'single')
exec(code, evaldict)
except:
print('Error in generated code:', file=sys.stderr)
print(src, file=sys.stderr)
raise
func = evaldict[name]
if addsource:
attrs['__source__'] = src
self.update(func, **attrs)
return func
@classmethod
def create(cls, obj, body, evaldict, defaults=None,
doc=None, module=None, addsource=True, **attrs):
"""
Create a function from the strings name, signature and body.
evaldict is the evaluation dictionary. If addsource is true an
attribute __source__ is added to the result. The attributes attrs
are added, if any.
"""
if isinstance(obj, str): # "name(signature)"
name, rest = obj.strip().split('(', 1)
signature = rest[:-1] # strip a right parens
func = None
else: # a function
name = None
signature = None
func = obj
self = cls(func, name, signature, defaults, doc, module)
ibody = '\n'.join(' ' + line for line in body.splitlines())
caller = evaldict.get('_call_') # when called from `decorate`
if caller and iscoroutinefunction(caller):
body = ('async def %(name)s(%(signature)s):\n' + ibody).replace(
'return', 'return await')
else:
body = 'def %(name)s(%(signature)s):\n' + ibody
return self.make(body, evaldict, addsource, **attrs)
def decorate(func, caller, extras=()):
"""
decorate(func, caller) decorates a function using a caller.
"""
evaldict = dict(_call_=caller, _func_=func)
es = ''
for i, extra in enumerate(extras):
ex = '_e%d_' % i
evaldict[ex] = extra
es += ex + ', '
fun = FunctionMaker.create(
func, "return _call_(_func_, %s%%(shortsignature)s)" % es,
evaldict, __wrapped__=func)
if hasattr(func, '__qualname__'):
fun.__qualname__ = func.__qualname__
return fun
def decorator(caller, _func=None):
"""decorator(caller) converts a caller function into a decorator"""
if _func is not None: # return a decorated function
# this is obsolete behavior; you should use decorate instead
return decorate(_func, caller)
# else return a decorator function
defaultargs, defaults = '', ()
if inspect.isclass(caller):
name = caller.__name__.lower()
doc = 'decorator(%s) converts functions/generators into ' \
'factories of %s objects' % (caller.__name__, caller.__name__)
elif inspect.isfunction(caller):
if caller.__name__ == '<lambda>':
name = '_lambda_'
else:
name = caller.__name__
doc = caller.__doc__
nargs = caller.__code__.co_argcount
ndefs = len(caller.__defaults__ or ())
defaultargs = ', '.join(caller.__code__.co_varnames[nargs-ndefs:nargs])
if defaultargs:
defaultargs += ','
defaults = caller.__defaults__
else: # assume caller is an object with a __call__ method
name = caller.__class__.__name__.lower()
doc = caller.__call__.__doc__
evaldict = dict(_call=caller, _decorate_=decorate)
dec = FunctionMaker.create(
'%s(func, %s)' % (name, defaultargs),
'if func is None: return lambda func: _decorate_(func, _call, (%s))\n'
'return _decorate_(func, _call, (%s))' % (defaultargs, defaultargs),
evaldict, doc=doc, module=caller.__module__, __wrapped__=caller)
if defaults:
dec.__defaults__ = (None,) + defaults
return dec
# ####################### contextmanager ####################### #
try: # Python >= 3.2
from contextlib import _GeneratorContextManager
except ImportError: # Python >= 2.5
from contextlib import GeneratorContextManager as _GeneratorContextManager
class ContextManager(_GeneratorContextManager):
def __call__(self, func):
"""Context manager decorator"""
return FunctionMaker.create(
func, "with _self_: return _func_(%(shortsignature)s)",
dict(_self_=self, _func_=func), __wrapped__=func)
init = getfullargspec(_GeneratorContextManager.__init__)
n_args = len(init.args)
if n_args == 2 and not init.varargs: # (self, genobj) Python 2.7
def __init__(self, g, *a, **k):
return _GeneratorContextManager.__init__(self, g(*a, **k))
ContextManager.__init__ = __init__
elif n_args == 2 and init.varargs: # (self, gen, *a, **k) Python 3.4
pass
elif n_args == 4: # (self, gen, args, kwds) Python 3.5
def __init__(self, g, *a, **k):
return _GeneratorContextManager.__init__(self, g, a, k)
ContextManager.__init__ = __init__
_contextmanager = decorator(ContextManager)
def contextmanager(func):
# Enable Pylint config: contextmanager-decorators=decorator.contextmanager
return _contextmanager(func)
# ############################ dispatch_on ############################ #
def append(a, vancestors):
"""
Append ``a`` to the list of the virtual ancestors, unless it is already
included.
"""
add = True
for j, va in enumerate(vancestors):
if issubclass(va, a):
add = False
break
if issubclass(a, va):
vancestors[j] = a
add = False
if add:
vancestors.append(a)
# inspired from simplegeneric by P.J. Eby and functools.singledispatch
def dispatch_on(*dispatch_args):
"""
Factory of decorators turning a function into a generic function
dispatching on the given arguments.
"""
assert dispatch_args, 'No dispatch args passed'
dispatch_str = '(%s,)' % ', '.join(dispatch_args)
def check(arguments, wrong=operator.ne, msg=''):
"""Make sure one passes the expected number of arguments"""
if wrong(len(arguments), len(dispatch_args)):
raise TypeError('Expected %d arguments, got %d%s' %
(len(dispatch_args), len(arguments), msg))
def gen_func_dec(func):
"""Decorator turning a function into a generic function"""
# first check the dispatch arguments
argset = set(getfullargspec(func).args)
if not set(dispatch_args) <= argset:
raise NameError('Unknown dispatch arguments %s' % dispatch_str)
typemap = {}
def vancestors(*types):
"""
Get a list of sets of virtual ancestors for the given types
"""
check(types)
ras = [[] for _ in range(len(dispatch_args))]
for types_ in typemap:
for t, type_, ra in zip(types, types_, ras):
if issubclass(t, type_) and type_ not in t.mro():
append(type_, ra)
return [set(ra) for ra in ras]
def ancestors(*types):
"""
Get a list of virtual MROs, one for each type
"""
check(types)
lists = []
for t, vas in zip(types, vancestors(*types)):
n_vas = len(vas)
if n_vas > 1:
raise RuntimeError(
'Ambiguous dispatch for %s: %s' % (t, vas))
elif n_vas == 1:
va, = vas
mro = type('t', (t, va), {}).mro()[1:]
else:
mro = t.mro()
lists.append(mro[:-1]) # discard t and object
return lists
def register(*types):
"""
Decorator to register an implementation for the given types
"""
check(types)
def dec(f):
check(getfullargspec(f).args, operator.lt, ' in ' + f.__name__)
typemap[types] = f
return f
return dec
def dispatch_info(*types):
"""
An utility to introspect the dispatch algorithm
"""
check(types)
lst = []
for anc in itertools.product(*ancestors(*types)):
lst.append(tuple(a.__name__ for a in anc))
return lst
def _dispatch(dispatch_args, *args, **kw):
types = tuple(type(arg) for arg in dispatch_args)
try: # fast path
f = typemap[types]
except KeyError:
pass
else:
return f(*args, **kw)
combinations = itertools.product(*ancestors(*types))
next(combinations) # the first one has been already tried
for types_ in combinations:
f = typemap.get(types_)
if f is not None:
return f(*args, **kw)
# else call the default implementation
return func(*args, **kw)
return FunctionMaker.create(
func, 'return _f_(%s, %%(shortsignature)s)' % dispatch_str,
dict(_f_=_dispatch), register=register, default=func,
typemap=typemap, vancestors=vancestors, ancestors=ancestors,
dispatch_info=dispatch_info, __wrapped__=func)
gen_func_dec.__name__ = 'dispatch_on' + dispatch_str
return gen_func_dec
ply-3.9-py3.6.egg-info/SOURCES.txt 0000644 00000007354 14751155147 0012135 0 ustar 00 ANNOUNCE
CHANGES
MANIFEST.in
README.md
TODO
setup.cfg
setup.py
doc/internal.html
doc/makedoc.py
doc/ply.html
example/README
example/cleanup.sh
example/BASIC/README
example/BASIC/basic.py
example/BASIC/basiclex.py
example/BASIC/basiclog.py
example/BASIC/basinterp.py
example/BASIC/basparse.py
example/BASIC/dim.bas
example/BASIC/func.bas
example/BASIC/gcd.bas
example/BASIC/gosub.bas
example/BASIC/hello.bas
example/BASIC/linear.bas
example/BASIC/maxsin.bas
example/BASIC/powers.bas
example/BASIC/rand.bas
example/BASIC/sales.bas
example/BASIC/sears.bas
example/BASIC/sqrt1.bas
example/BASIC/sqrt2.bas
example/GardenSnake/GardenSnake.py
example/GardenSnake/README
example/ansic/README
example/ansic/clex.py
example/ansic/cparse.py
example/calc/calc.py
example/calcdebug/calc.py
example/calceof/calc.py
example/classcalc/calc.py
example/closurecalc/calc.py
example/hedit/hedit.py
example/newclasscalc/calc.py
example/optcalc/README
example/optcalc/calc.py
example/unicalc/calc.py
example/yply/README
example/yply/ylex.py
example/yply/yparse.py
example/yply/yply.py
ply/__init__.py
ply/cpp.py
ply/ctokens.py
ply/lex.py
ply/yacc.py
ply/ygen.py
ply.egg-info/PKG-INFO
ply.egg-info/SOURCES.txt
ply.egg-info/dependency_links.txt
ply.egg-info/top_level.txt
test/README
test/calclex.py
test/cleanup.sh
test/lex_closure.py
test/lex_doc1.py
test/lex_dup1.py
test/lex_dup2.py
test/lex_dup3.py
test/lex_empty.py
test/lex_error1.py
test/lex_error2.py
test/lex_error3.py
test/lex_error4.py
test/lex_hedit.py
test/lex_ignore.py
test/lex_ignore2.py
test/lex_literal1.py
test/lex_literal2.py
test/lex_literal3.py
test/lex_many_tokens.py
test/lex_module.py
test/lex_module_import.py
test/lex_object.py
test/lex_opt_alias.py
test/lex_optimize.py
test/lex_optimize2.py
test/lex_optimize3.py
test/lex_re1.py
test/lex_re2.py
test/lex_re3.py
test/lex_rule1.py
test/lex_rule2.py
test/lex_rule3.py
test/lex_state1.py
test/lex_state2.py
test/lex_state3.py
test/lex_state4.py
test/lex_state5.py
test/lex_state_noerror.py
test/lex_state_norule.py
test/lex_state_try.py
test/lex_token1.py
test/lex_token2.py
test/lex_token3.py
test/lex_token4.py
test/lex_token5.py
test/lex_token_dup.py
test/testlex.py
test/testyacc.py
test/yacc_badargs.py
test/yacc_badid.py
test/yacc_badprec.py
test/yacc_badprec2.py
test/yacc_badprec3.py
test/yacc_badrule.py
test/yacc_badtok.py
test/yacc_dup.py
test/yacc_error1.py
test/yacc_error2.py
test/yacc_error3.py
test/yacc_error4.py
test/yacc_error5.py
test/yacc_error6.py
test/yacc_error7.py
test/yacc_inf.py
test/yacc_literal.py
test/yacc_misplaced.py
test/yacc_missing1.py
test/yacc_nested.py
test/yacc_nodoc.py
test/yacc_noerror.py
test/yacc_nop.py
test/yacc_notfunc.py
test/yacc_notok.py
test/yacc_prec1.py
test/yacc_rr.py
test/yacc_rr_unused.py
test/yacc_simple.py
test/yacc_sr.py
test/yacc_term1.py
test/yacc_unicode_literals.py
test/yacc_unused.py
test/yacc_unused_rule.py
test/yacc_uprec.py
test/yacc_uprec2.py
test/pkg_test1/__init__.py
test/pkg_test1/parsing/__init__.py
test/pkg_test1/parsing/calclex.py
test/pkg_test1/parsing/calcparse.py
test/pkg_test2/__init__.py
test/pkg_test2/parsing/__init__.py
test/pkg_test2/parsing/calclex.py
test/pkg_test2/parsing/calcparse.py
test/pkg_test3/__init__.py
test/pkg_test3/generated/__init__.py
test/pkg_test3/parsing/__init__.py
test/pkg_test3/parsing/calclex.py
test/pkg_test3/parsing/calcparse.py
test/pkg_test4/__init__.py
test/pkg_test4/parsing/__init__.py
test/pkg_test4/parsing/calclex.py
test/pkg_test4/parsing/calcparse.py
test/pkg_test5/__init__.py
test/pkg_test5/parsing/__init__.py
test/pkg_test5/parsing/calclex.py
test/pkg_test5/parsing/calcparse.py
test/pkg_test6/__init__.py
test/pkg_test6/parsing/__init__.py
test/pkg_test6/parsing/calclex.py
test/pkg_test6/parsing/calcparse.py
test/pkg_test6/parsing/expression.py
test/pkg_test6/parsing/statement.py ply-3.9-py3.6.egg-info/dependency_links.txt 0000644 00000000001 14751155147 0014306 0 ustar 00
ply-3.9-py3.6.egg-info/top_level.txt 0000644 00000000004 14751155147 0012764 0 ustar 00 ply
ply-3.9-py3.6.egg-info/PKG-INFO 0000644 00000001700 14751155147 0011333 0 ustar 00 Metadata-Version: 1.2
Name: ply
Version: 3.9
Summary: Python Lex & Yacc
Home-page: http://www.dabeaz.com/ply/
Author: David Beazley
Author-email: dave@dabeaz.com
Maintainer: David Beazley
Maintainer-email: dave@dabeaz.com
License: BSD
Description:
PLY is yet another implementation of lex and yacc for Python. Some notable
features include the fact that its implemented entirely in Python and it
uses LALR(1) parsing which is efficient and well suited for larger grammars.
PLY provides most of the standard lex/yacc features including support for empty
productions, precedence rules, error recovery, and support for ambiguous grammars.
PLY is extremely easy to use and provides very extensive error checking.
It is compatible with both Python 2 and Python 3.
Platform: UNKNOWN
Classifier: Programming Language :: Python :: 3
Classifier: Programming Language :: Python :: 2
__pycache__/_version.cpython-36.opt-1.pyc 0000644 00000000206 14751155147 0014175 0 ustar 00 3
��S � @ s d Z dS )z5.0.6N)� __version__� r r � /usr/lib/python3.6/_version.py�<module> s __pycache__/easy_install.cpython-36.pyc 0000644 00000000403 14751155147 0014100 0 ustar 00 3
��f~ � @ s" d Z edkr ddlmZ e� dS )zRun the EasyInstall command�__main__� )�mainN)�__doc__�__name__Z setuptools.command.easy_installr � r r �"/usr/lib/python3.6/easy_install.py�<module> s __pycache__/validate.cpython-36.pyc 0000644 00000126537 14751155147 0013223 0 ustar 00 3
��S�� � @ s� d Z dZdXZd d lZd d lZd d!lmZ ejdYk r8eZne Zd#d$� Z
e Z ej
d%ejejB �Zej
d&ejejB �Zd'Zd(e Zye W n ek
r� d)d*� ZY nX d+d� Zd,d� ZG d-d� de�ZG d.d� de�ZG d/d� de�ZG d0d� de �Z G d1d� de�Z G d2d � d e�Z G d3d
� d
e �Z G d4d � d e �Z!G d5d � d e �Z"G d6d
� d
e �Z#G d7d� de$�Z%dZd9d:�Z&d[d;d�Z'd\d<d�Z(d=d=d=d=d=d8d8d8d8d8d>�
Z)d?d� Z*d@d� Z+d]dAd�Z,d^dBd�Z-d_dCd�Z.d`dDd�Z/dadEd�Z0dbdFd�Z1dcdGd�Z2dddHd�Z3dedIdJ�Z4e'e(e+e.e*dK�Z5dLd � Z6dMd � Z7dNdO� Z8dPdQ� Z9dRdS� Z:e;dTk�r�d d lZd d l<Z<ej=j>dT�Z?e?j@jA� ZBeBjCdUe%� i� e<jDe?eBe<jEe<jFB dV�\ZGZHeG �s�tIdWjJeGeH���d S )fa
The Validator object is used to check that supplied values
conform to a specification.
The value can be supplied as a string - e.g. from a config file.
In this case the check will also *convert* the value to
the required type. This allows you to add validation
as a transparent layer to access data stored as strings.
The validation checks that the data is correct *and*
converts it to the expected type.
Some standard checks are provided for basic data types.
Additional checks are easy to write. They can be
provided when the ``Validator`` is instantiated or
added afterwards.
The standard functions work with the following basic data types :
* integers
* floats
* booleans
* strings
* ip_addr
plus lists of these datatypes
Adding additional checks is done through coding simple functions.
The full set of standard checks are :
* 'integer': matches integer values (including negative)
Takes optional 'min' and 'max' arguments : ::
integer()
integer(3, 9) # any value from 3 to 9
integer(min=0) # any positive value
integer(max=9)
* 'float': matches float values
Has the same parameters as the integer check.
* 'boolean': matches boolean values - ``True`` or ``False``
Acceptable string values for True are :
true, on, yes, 1
Acceptable string values for False are :
false, off, no, 0
Any other value raises an error.
* 'ip_addr': matches an Internet Protocol address, v.4, represented
by a dotted-quad string, i.e. '1.2.3.4'.
* 'string': matches any string.
Takes optional keyword args 'min' and 'max'
to specify min and max lengths of the string.
* 'list': matches any list.
Takes optional keyword args 'min', and 'max' to specify min and
max sizes of the list. (Always returns a list.)
* 'tuple': matches any tuple.
Takes optional keyword args 'min', and 'max' to specify min and
max sizes of the tuple. (Always returns a tuple.)
* 'int_list': Matches a list of integers.
Takes the same arguments as list.
* 'float_list': Matches a list of floats.
Takes the same arguments as list.
* 'bool_list': Matches a list of boolean values.
Takes the same arguments as list.
* 'ip_addr_list': Matches a list of IP addresses.
Takes the same arguments as list.
* 'string_list': Matches a list of strings.
Takes the same arguments as list.
* 'mixed_list': Matches a list with different types in
specific positions. List size must match
the number of arguments.
Each position can be one of :
'integer', 'float', 'ip_addr', 'string', 'boolean'
So to specify a list with two strings followed
by two integers, you write the check as : ::
mixed_list('string', 'string', 'integer', 'integer')
* 'pass': This check matches everything ! It never fails
and the value is unchanged.
It is also the default if no check is specified.
* 'option': This check matches any from a list of options.
You specify this check with : ::
option('option 1', 'option 2', 'option 3')
You can supply a default value (returned if no value is supplied)
using the default keyword argument.
You specify a list argument for default using a list constructor syntax in
the check : ::
checkname(arg1, arg2, default=list('val 1', 'val 2', 'val 3'))
A badly formatted set of arguments will raise a ``VdtParamError``.
z1.0.1� __version__�dottedQuadToNum�numToDottedQuad�
ValidateError�VdtUnknownCheckError�
VdtParamError� VdtTypeError�
VdtValueError�VdtValueTooSmallError�VdtValueTooBigError�VdtValueTooShortError�VdtValueTooLongError�VdtMissingValue� Validator�
is_integer�is_float�
is_boolean�is_list�is_tuple�
is_ip_addr� is_string� is_int_list� is_bool_list�
is_float_list�is_string_list�is_ip_addr_list�
is_mixed_list� is_option�
__docformat__� N)�pprint� c C s | S )N� )�xr! r! � /usr/lib/python3.6/validate.py�<lambda>� s r$ a�
(?:
([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*list\(
(
(?:
\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)
\s*,\s*
)*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)? # last one
)
\)
)
z�
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?) # unquoted
)
(?:
(?:\s*,\s*)|(?:\s*$) # comma
)
a�
(?:
(
(?:
[a-zA-Z_][a-zA-Z0-9_]*\s*=\s*list\(
(?:
\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)
\s*,\s*
)*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)? # last one
\)
)|
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?)| # unquoted
(?: # keyword argument
[a-zA-Z_][a-zA-Z0-9_]*\s*=\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?) # unquoted
)
)
)
)
(?:
(?:\s*,\s*)|(?:\s*$) # comma
)
)
z^%s*c C s | rdS dS dS )z$Simple boolean equivalent function. � r Nr! )�valr! r! r# �bool
s r' c C sR ddl }ddl}y|jd|j| j� ��d S |jk
rL td| ��Y nX dS )a�
Convert decimal dotted quad string to long integer
>>> int(dottedQuadToNum('1 '))
1
>>> int(dottedQuadToNum(' 1.2'))
16777218
>>> int(dottedQuadToNum(' 1.2.3 '))
16908291
>>> int(dottedQuadToNum('1.2.3.4'))
16909060
>>> dottedQuadToNum('255.255.255.255')
4294967295
>>> dottedQuadToNum('255.255.255.256')
Traceback (most recent call last):
ValueError: Not a good dotted-quad IP: 255.255.255.256
r Nz!Lz Not a good dotted-quad IP: %s)�socket�struct�unpackZ inet_aton�strip�error�
ValueError)Zipr( r) r! r! r# r s c
C sv ddl }ddl}| td�ks$| dk r0td| ��y|j|jdt| ���S |j|jtfk
rp td| ��Y nX dS )a!
Convert int or long int to dotted quad string
>>> numToDottedQuad(long(-1))
Traceback (most recent call last):
ValueError: Not a good numeric IP: -1
>>> numToDottedQuad(long(1))
'0.0.0.1'
>>> numToDottedQuad(long(16777218))
'1.0.0.2'
>>> numToDottedQuad(long(16908291))
'1.2.0.3'
>>> numToDottedQuad(long(16909060))
'1.2.3.4'
>>> numToDottedQuad(long(4294967295))
'255.255.255.255'
>>> numToDottedQuad(long(4294967296))
Traceback (most recent call last):
ValueError: Not a good numeric IP: 4294967296
>>> numToDottedQuad(-1)
Traceback (most recent call last):
ValueError: Not a good numeric IP: -1
>>> numToDottedQuad(1)
'0.0.0.1'
>>> numToDottedQuad(16777218)
'1.0.0.2'
>>> numToDottedQuad(16908291)
'1.2.0.3'
>>> numToDottedQuad(16909060)
'1.2.3.4'
>>> numToDottedQuad(4294967295)
'255.255.255.255'
>>> numToDottedQuad(4294967296)
Traceback (most recent call last):
ValueError: Not a good numeric IP: 4294967296
r Nl �� zNot a good numeric IP: %sz!L)r( r) �longr- Z inet_ntoa�packr, �
OverflowError)Znumr( r) r! r! r# r 0 s ( c @ s e Zd ZdZdS )r a
This error indicates that the check failed.
It can be the base class for more specific errors.
Any check function that fails ought to raise this error.
(or a subclass)
>>> raise ValidateError
Traceback (most recent call last):
ValidateError
N)�__name__�
__module__� __qualname__�__doc__r! r! r! r# r d s c @ s e Zd ZdZdS )r
z1No value was supplied to a check that needed one.N)r1 r2 r3 r4 r! r! r! r# r
r s c @ s e Zd ZdZdd� ZdS )r z'An unknown check function was requestedc C s t j| d|f � dS )z�
>>> raise VdtUnknownCheckError('yoda')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
zthe check "%s" is unknown.N)r �__init__)�self�valuer! r! r# r5 y s z VdtUnknownCheckError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r v s c @ s e Zd ZdZdd� ZdS )r z!An incorrect parameter was passedc C s t j| d||f � dS )z�
>>> raise VdtParamError('yoda', 'jedi')
Traceback (most recent call last):
VdtParamError: passed an incorrect value "jedi" for parameter "yoda".
z2passed an incorrect value "%s" for parameter "%s".N)� SyntaxErrorr5 )r6 �namer7 r! r! r# r5 � s zVdtParamError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r z(The value supplied was of the wrong typec C s t j| d|f � dS )z�
>>> raise VdtTypeError('jedi')
Traceback (most recent call last):
VdtTypeError: the value "jedi" is of the wrong type.
z$the value "%s" is of the wrong type.N)r r5 )r6 r7 r! r! r# r5 � s zVdtTypeError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r zIThe value supplied was of the correct type, but was not an allowed value.c C s t j| d|f � dS )z�
>>> raise VdtValueError('jedi')
Traceback (most recent call last):
VdtValueError: the value "jedi" is unacceptable.
z the value "%s" is unacceptable.N)r r5 )r6 r7 r! r! r# r5 � s zVdtValueError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r z>The value supplied was of the correct type, but was too small.c C s t j| d|f � dS )z�
>>> raise VdtValueTooSmallError('0')
Traceback (most recent call last):
VdtValueTooSmallError: the value "0" is too small.
z the value "%s" is too small.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooSmallError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r
z<The value supplied was of the correct type, but was too big.c C s t j| d|f � dS )z�
>>> raise VdtValueTooBigError('1')
Traceback (most recent call last):
VdtValueTooBigError: the value "1" is too big.
zthe value "%s" is too big.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooBigError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r
� s c @ s e Zd ZdZdd� ZdS )r z>The value supplied was of the correct type, but was too short.c C s t j| d|f � dS )z�
>>> raise VdtValueTooShortError('jed')
Traceback (most recent call last):
VdtValueTooShortError: the value "jed" is too short.
z the value "%s" is too short.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooShortError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r z=The value supplied was of the correct type, but was too long.c C s t j| d|f � dS )z�
>>> raise VdtValueTooLongError('jedie')
Traceback (most recent call last):
VdtValueTooLongError: the value "jedie" is too long.
zthe value "%s" is too long.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooLongError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s� e Zd ZdZejdej�Zejdej�Ze Z e
Z
eje ej ejB �Z
ejeej ejB �Zddd�Zddd �Zd
d � Zd d
� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� ZdS ) r a3
Validator is an object that allows you to register a set of 'checks'.
These checks take input and test that it conforms to the check.
This can also involve converting the value from a string into
the correct datatype.
The ``check`` method takes an input string which configures which
check is to be used and applies that check to a supplied value.
An example input string would be:
'int_range(param1, param2)'
You would then provide something like:
>>> def int_range_check(value, min, max):
... # turn min and max from strings to integers
... min = int(min)
... max = int(max)
... # check that value is of the correct type.
... # possible valid inputs are integers or strings
... # that represent integers
... if not isinstance(value, (int, long, string_type)):
... raise VdtTypeError(value)
... elif isinstance(value, string_type):
... # if we are given a string
... # attempt to convert to an integer
... try:
... value = int(value)
... except ValueError:
... raise VdtValueError(value)
... # check the value is between our constraints
... if not min <= value:
... raise VdtValueTooSmallError(value)
... if not value <= max:
... raise VdtValueTooBigError(value)
... return value
>>> fdict = {'int_range': int_range_check}
>>> vtr1 = Validator(fdict)
>>> vtr1.check('int_range(20, 40)', '30')
30
>>> vtr1.check('int_range(20, 40)', '60')
Traceback (most recent call last):
VdtValueTooBigError: the value "60" is too big.
New functions can be added with : ::
>>> vtr2 = Validator()
>>> vtr2.functions['int_range'] = int_range_check
Or by passing in a dictionary of functions when Validator
is instantiated.
Your functions *can* use keyword arguments,
but the first argument should always be 'value'.
If the function doesn't take additional arguments,
the parentheses are optional in the check.
It can be written with either of : ::
keyword = function_name
keyword = function_name()
The first program to utilise Validator() was Michael Foord's
ConfigObj, an alternative to ConfigParser which supports lists and
can validate a config file using a config schema.
For more details on using Validator with ConfigObj see:
https://configobj.readthedocs.org/en/latest/configobj.html
z
(.+?)\((.*)\)z%^([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*(.*)$Nc C sR | j ttttttttt t
t t t
| j ttd�| _|dk rB| jj|� t| _i | _dS )z(
>>> vtri = Validator()
)� �integer�float�boolean�ip_addr�string�list�tupleZint_listZ
float_listZ bool_listZ ip_addr_listZ string_list�
mixed_list�passZoption�
force_listN)�_passr r r r r r r r r r r r r r rD � functions�updater ZbaseErrorClass�_cache)r6 rF r! r! r# r5 3 s*
zValidator.__init__Fc C sJ | j |�\}}}}|r.|dkr$t� �| j|�}|dkr:dS | j||||�S )a�
Usage: check(check, value)
Arguments:
check: string representing check to apply (including arguments)
value: object to be checked
Returns value, converted to correct type if necessary
If the check fails, raises a ``ValidateError`` subclass.
>>> vtor.check('yoda', '')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
>>> vtor.check('yoda()', '')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
>>> vtor.check('string(default="")', '', missing=True)
''
N)�_parse_with_cachingr
� _handle_none� _check_value)r6 �checkr7 Zmissing�fun_name�fun_args�
fun_kwargs�defaultr! r! r# rL Q s
zValidator.checkc C s" |dkr d S |dkr | j |�}|S )N�None�'None'�"None")rR rS )�_unquote)r6 r7 r! r! r# rJ t s
zValidator._handle_nonec C s� || j kr.| j | \}}}}t|�}t|�}nF| j|�\}}}}tdd� t|j� �D ��}|t|�t|�|f| j |< ||||fS )Nc S s g | ]\}}t |�|f�qS r! )�str)�.0�keyr7 r! r! r# �
<listcomp>� s z1Validator._parse_with_caching.<locals>.<listcomp>)rH r@ �dict� _parse_check�items)r6 rL rM rN rO rP r! r! r# rI } s
z Validator._parse_with_cachingc C s@ y| j | }W n tk
r* t|��Y nX ||f|�|�S d S )N)rF �KeyErrorr )r6 r7 rM rN rO �funr! r! r# rK � s
zValidator._check_valuec C s | j j|�}|r�|jd�}|jd�}| jj|�}|d krDtd| ��g }i }x�| jj|�D ]�}|j� }| jj|�} | r�| j | �\}
} | ||
< qZ| j
j|�} | r�| jd�} | dkr�| j | �} | || jd�< qZ|j | j |�� qZW n |f i d fS |j
dd �}
||||
fS )Nr% � zBad syntax in check "%s".�'None'�"None"rP )r_ r` )�_func_re�match�group� _matchfinderr � _paramfinder�findallr+ � _list_arg� _list_handle�_key_argrT �append�pop)r6 rL Z fun_matchrM Z
arg_stringZ arg_matchrN rO �arg� listmatchrW r& ZkeymatchrP r! r! r# rZ � s6
zValidator._parse_checkc C s8 t |�dkr4|d dkr4|d |d kr4|dd� }|S ) z Unquote a value if necessary.r^ r �'�"r% )rn ro ���rp )�len)r6 r& r! r! r# rT � s ( zValidator._unquotec C sF g }|j d�}|j d�}x$| jj|�D ]}|j| j|�� q&W ||fS )z7Take apart a ``keyword=list('val, 'val')`` type string.r% r^ )rc �
_list_membersrf rj rT )r6 rm �outr9 �argsrl r! r! r# rh � s
zValidator._list_handlec C s |S )z�
Dummy check that always passes
>>> vtor.check('', 0)
0
>>> vtor.check('', '0')
'0'
r! )r6 r7 r! r! r# rE � s zValidator._passc C sL | j |�\}}}}|dkr&td| ��| j|�}|dkr<|S | j||||�S )z�
Given a check, return the default value for the check
(converted to the right type).
If the check doesn't specify a default value then a
``KeyError`` will be raised.
Nz Check "%s" has no default value.)rI r\ rJ rK )r6 rL rM rN rO rP r7 r! r! r# �get_default_value� s
zValidator.get_default_value)N)F)r1 r2 r3 r4 �re�compile�DOTALLra ri rg rr � _paramstring�VERBOSEre � _matchstringrd r5 rL rJ rI rK rZ rT rh rE ru r! r! r! r# r � s" F
# (
Fc C s� |rt p
t}g }x�t| |�D ]z\}}|dkr8|j|� q t|ttt tf�r�y|j||�� W q� tk
r� } zt||��W Y dd}~X q�X q t||��q W |S )a�
Return numbers from inputs or raise VdtParamError.
Lets ``None`` pass through.
Pass in keyword argument ``to_float=True`` to
use float for the conversion rather than int.
>>> _is_num_param(('', ''), (0, 1.0))
[0, 1]
>>> _is_num_param(('', ''), (0, 1.0), to_float=True)
[0.0, 1.0]
>>> _is_num_param(('a'), ('a'))
Traceback (most recent call last):
VdtParamError: passed an incorrect value "a" for parameter "a".
N) r< �int�ziprj �
isinstancer. � string_typer- r )�names�values�to_floatr] Z
out_paramsr9 r& �er! r! r# �
_is_num_param� s r� c C s� t d||f�\}}t| tttf�s*t| ��t| t�r^y t| �} W n tk
r\ t| ��Y nX |dk rv| |k rvt| ��|dk r�| |kr�t| ��| S )aH
A check that tests that a given value is an integer (int, or long)
and optionally, between bounds. A negative value is accepted, while
a float will fail.
If the value is a string, then the conversion is done - if possible.
Otherwise a VdtError is raised.
>>> vtor.check('integer', '-1')
-1
>>> vtor.check('integer', '0')
0
>>> vtor.check('integer', 9)
9
>>> vtor.check('integer', 'a')
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
>>> vtor.check('integer', '2.2')
Traceback (most recent call last):
VdtTypeError: the value "2.2" is of the wrong type.
>>> vtor.check('integer(10)', '20')
20
>>> vtor.check('integer(max=20)', '15')
15
>>> vtor.check('integer(10)', '9')
Traceback (most recent call last):
VdtValueTooSmallError: the value "9" is too small.
>>> vtor.check('integer(10)', 9)
Traceback (most recent call last):
VdtValueTooSmallError: the value "9" is too small.
>>> vtor.check('integer(max=20)', '35')
Traceback (most recent call last):
VdtValueTooBigError: the value "35" is too big.
>>> vtor.check('integer(max=20)', 35)
Traceback (most recent call last):
VdtValueTooBigError: the value "35" is too big.
>>> vtor.check('integer(0, 9)', False)
0
�min�maxN)r� r� ) r� r~ r| r. r r r- r r
)r7 r� r� �min_val�max_valr! r! r# r s (
c C s� t d||fdd�\}}t| ttttf�s0t| ��t| t�sdy t| �} W n tk
rb t| ��Y nX |dk r|| |k r|t| ��|dk r�| |kr�t | ��| S )a<
A check that tests that a given value is a float
(an integer will be accepted), and optionally - that it is between bounds.
If the value is a string, then the conversion is done - if possible.
Otherwise a VdtError is raised.
This can accept negative values.
>>> vtor.check('float', '2')
2.0
From now on we multiply the value to avoid comparing decimals
>>> vtor.check('float', '-6.8') * 10
-68.0
>>> vtor.check('float', '12.2') * 10
122.0
>>> vtor.check('float', 8.4) * 10
84.0
>>> vtor.check('float', 'a')
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
>>> vtor.check('float(10.1)', '10.2') * 10
102.0
>>> vtor.check('float(max=20.2)', '15.1') * 10
151.0
>>> vtor.check('float(10.0)', '9.0')
Traceback (most recent call last):
VdtValueTooSmallError: the value "9.0" is too small.
>>> vtor.check('float(max=20.0)', '35.0')
Traceback (most recent call last):
VdtValueTooBigError: the value "35.0" is too big.
r� r� T)r� N)r� r� )
r� r~ r| r. r< r r r- r r
)r7 r� r� r� r� r! r! r# r G s #
T)
TZon�1�true�yesFZoff�0Zfalse�noc C sX t | t�r4y t| j� S tk
r2 t| ��Y nX | dkr@dS | dkrLdS t| ��dS )a�
Check if the value represents a boolean.
>>> vtor.check('boolean', 0)
0
>>> vtor.check('boolean', False)
0
>>> vtor.check('boolean', '0')
0
>>> vtor.check('boolean', 'off')
0
>>> vtor.check('boolean', 'false')
0
>>> vtor.check('boolean', 'no')
0
>>> vtor.check('boolean', 'nO')
0
>>> vtor.check('boolean', 'NO')
0
>>> vtor.check('boolean', 1)
1
>>> vtor.check('boolean', True)
1
>>> vtor.check('boolean', '1')
1
>>> vtor.check('boolean', 'on')
1
>>> vtor.check('boolean', 'true')
1
>>> vtor.check('boolean', 'yes')
1
>>> vtor.check('boolean', 'Yes')
1
>>> vtor.check('boolean', 'YES')
1
>>> vtor.check('boolean', '')
Traceback (most recent call last):
VdtTypeError: the value "" is of the wrong type.
>>> vtor.check('boolean', 'up')
Traceback (most recent call last):
VdtTypeError: the value "up" is of the wrong type.
FTN)r~ r � bool_dict�lowerr\ r )r7 r! r! r# r � s ,
c C sH t | t�st| ��| j� } y t| � W n tk
rB t| ��Y nX | S )as
Check that the supplied value is an Internet Protocol address, v.4,
represented by a dotted-quad string, i.e. '1.2.3.4'.
>>> vtor.check('ip_addr', '1 ')
'1'
>>> vtor.check('ip_addr', ' 1.2')
'1.2'
>>> vtor.check('ip_addr', ' 1.2.3 ')
'1.2.3'
>>> vtor.check('ip_addr', '1.2.3.4')
'1.2.3.4'
>>> vtor.check('ip_addr', '0.0.0.0')
'0.0.0.0'
>>> vtor.check('ip_addr', '255.255.255.255')
'255.255.255.255'
>>> vtor.check('ip_addr', '255.255.255.256')
Traceback (most recent call last):
VdtValueError: the value "255.255.255.256" is unacceptable.
>>> vtor.check('ip_addr', '1.2.3.4.5')
Traceback (most recent call last):
VdtValueError: the value "1.2.3.4.5" is unacceptable.
>>> vtor.check('ip_addr', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
)r~ r r r+ r r- r )r7 r! r! r# r � s
c C s� t d||f�\}}t| t�r$t| ��y t| �}W n tk
rL t| ��Y nX |dk rf||k rft| ��|dk r~||kr~t| ��t| �S )a�
Check that the value is a list of values.
You can optionally specify the minimum and maximum number of members.
It does no check on list members.
>>> vtor.check('list', ())
[]
>>> vtor.check('list', [])
[]
>>> vtor.check('list', (1, 2))
[1, 2]
>>> vtor.check('list', [1, 2])
[1, 2]
>>> vtor.check('list(3)', (1, 2))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2)" is too short.
>>> vtor.check('list(max=5)', (1, 2, 3, 4, 5, 6))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2, 3, 4, 5, 6)" is too long.
>>> vtor.check('list(min=3, max=5)', (1, 2, 3, 4))
[1, 2, 3, 4]
>>> vtor.check('list', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('list', '12')
Traceback (most recent call last):
VdtTypeError: the value "12" is of the wrong type.
r� r� N)r� r� ) r� r~ r r rq � TypeErrorr r r@ )r7 r� r� �min_len�max_len� num_membersr! r! r# r � s
c C s t t| ||��S )a�
Check that the value is a tuple of values.
You can optionally specify the minimum and maximum number of members.
It does no check on members.
>>> vtor.check('tuple', ())
()
>>> vtor.check('tuple', [])
()
>>> vtor.check('tuple', (1, 2))
(1, 2)
>>> vtor.check('tuple', [1, 2])
(1, 2)
>>> vtor.check('tuple(3)', (1, 2))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2)" is too short.
>>> vtor.check('tuple(max=5)', (1, 2, 3, 4, 5, 6))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2, 3, 4, 5, 6)" is too long.
>>> vtor.check('tuple(min=3, max=5)', (1, 2, 3, 4))
(1, 2, 3, 4)
>>> vtor.check('tuple', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('tuple', '12')
Traceback (most recent call last):
VdtTypeError: the value "12" is of the wrong type.
)rA r )r7 r� r� r! r! r# r s c C s� t | t�st| ��td||f�\}}y t| �}W n tk
rL t| ��Y nX |dk rf||k rft| ��|dk r~||kr~t| ��| S )a�
Check that the supplied value is a string.
You can optionally specify the minimum and maximum number of members.
>>> vtor.check('string', '0')
'0'
>>> vtor.check('string', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('string(2)', '12')
'12'
>>> vtor.check('string(2)', '1')
Traceback (most recent call last):
VdtValueTooShortError: the value "1" is too short.
>>> vtor.check('string(min=2, max=3)', '123')
'123'
>>> vtor.check('string(min=2, max=3)', '1234')
Traceback (most recent call last):
VdtValueTooLongError: the value "1234" is too long.
r� r� N)r� r� )r~ r r r� rq r� r r )r7 r� r� r� r� r� r! r! r# r 1 s
c C s dd� t | ||�D �S )a
Check that the value is a list of integers.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is an integer.
>>> vtor.check('int_list', ())
[]
>>> vtor.check('int_list', [])
[]
>>> vtor.check('int_list', (1, 2))
[1, 2]
>>> vtor.check('int_list', [1, 2])
[1, 2]
>>> vtor.check('int_list', [1, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV �memr! r! r# rX i s z is_int_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r U s c C s dd� t | ||�D �S )al
Check that the value is a list of booleans.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a boolean.
>>> vtor.check('bool_list', ())
[]
>>> vtor.check('bool_list', [])
[]
>>> check_res = vtor.check('bool_list', (True, False))
>>> check_res == [True, False]
1
>>> check_res = vtor.check('bool_list', [True, False])
>>> check_res == [True, False]
1
>>> vtor.check('bool_list', [True, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z is_bool_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r l s c C s dd� t | ||�D �S )a
Check that the value is a list of floats.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a float.
>>> vtor.check('float_list', ())
[]
>>> vtor.check('float_list', [])
[]
>>> vtor.check('float_list', (1, 2.0))
[1.0, 2.0]
>>> vtor.check('float_list', [1, 2.0])
[1.0, 2.0]
>>> vtor.check('float_list', [1, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z!is_float_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r � s c C s( t | t�rt| ��dd� t| ||�D �S )an
Check that the value is a list of strings.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a string.
>>> vtor.check('string_list', ())
[]
>>> vtor.check('string_list', [])
[]
>>> vtor.check('string_list', ('a', 'b'))
['a', 'b']
>>> vtor.check('string_list', ['a', 1])
Traceback (most recent call last):
VdtTypeError: the value "1" is of the wrong type.
>>> vtor.check('string_list', 'hello')
Traceback (most recent call last):
VdtTypeError: the value "hello" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z"is_string_list.<locals>.<listcomp>)r~ r r r )r7 r� r� r! r! r# r � s
c C s dd� t | ||�D �S )a
Check that the value is a list of IP addresses.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is an IP address.
>>> vtor.check('ip_addr_list', ())
[]
>>> vtor.check('ip_addr_list', [])
[]
>>> vtor.check('ip_addr_list', ('1.2.3.4', '5.6.7.8'))
['1.2.3.4', '5.6.7.8']
>>> vtor.check('ip_addr_list', ['a'])
Traceback (most recent call last):
VdtValueError: the value "a" is unacceptable.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z#is_ip_addr_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r � s c C s t | ttf�s| g} t| ||�S )a�
Check that a value is a list, coercing strings into
a list with one member. Useful where users forget the
trailing comma that turns a single value into a list.
You can optionally specify the minimum and maximum number of members.
A minumum of greater than one will fail if the user only supplies a
string.
>>> vtor.check('force_list', ())
[]
>>> vtor.check('force_list', [])
[]
>>> vtor.check('force_list', 'hello')
['hello']
)r~ r@ rA r )r7 r� r� r! r! r# rD � s rD )r; r< r> r? r= c G s� y t | �}W n tk
r( t| ��Y nX |t |�k r@t| ��n|t |�krTt| ��ydd� t|| �D �S tk
r� } ztd|��W Y dd}~X nX dS )a�
Check that the value is a list.
Allow specifying the type of each member.
Work on lists of specific lengths.
You specify each member as a positional argument specifying type
Each type should be one of the following strings :
'integer', 'float', 'ip_addr', 'string', 'boolean'
So you can specify a list of two strings, followed by
two integers as :
mixed_list('string', 'string', 'integer', 'integer')
The length of the list must match the number of positional
arguments you supply.
>>> mix_str = "mixed_list('integer', 'float', 'ip_addr', 'string', 'boolean')"
>>> check_res = vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a', True))
>>> check_res == [1, 2.0, '1.2.3.4', 'a', True]
1
>>> check_res = vtor.check(mix_str, ('1', '2.0', '1.2.3.4', 'a', 'True'))
>>> check_res == [1, 2.0, '1.2.3.4', 'a', True]
1
>>> vtor.check(mix_str, ('b', 2.0, '1.2.3.4', 'a', True))
Traceback (most recent call last):
VdtTypeError: the value "b" is of the wrong type.
>>> vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a'))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2.0, '1.2.3.4', 'a')" is too short.
>>> vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a', 1, 'b'))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2.0, '1.2.3.4', 'a', 1, 'b')" is too long.
>>> vtor.check(mix_str, 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('mixed_list("yoda")', ('a'))
Traceback (most recent call last):
VdtParamError: passed an incorrect value "KeyError('yoda',)" for parameter "'mixed_list'"
c S s g | ]\}}t | |��qS r! )�fun_dict)rV rl r& r! r! r# rX s z!is_mixed_list.<locals>.<listcomp>rB N)rq r� r r r r} r\ r )r7 rt Zlengthr� r! r! r# r � s +
c G s& t | t�st| ��| |kr"t| ��| S )a�
This check matches the value to any of a set of options.
>>> vtor.check('option("yoda", "jedi")', 'yoda')
'yoda'
>>> vtor.check('option("yoda", "jedi")', 'jed')
Traceback (most recent call last):
VdtValueError: the value "jed" is unacceptable.
>>> vtor.check('option("yoda", "jedi")', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
)r~ r r r )r7 Zoptionsr! r! r# r $ s
c O s
| ||fS )ag
A function that exists for test purposes.
>>> checks = [
... '3, 6, min=1, max=3, test=list(a, b, c)',
... '3',
... '3, 6',
... '3,',
... 'min=1, test="a b c"',
... 'min=5, test="a, b, c"',
... 'min=1, max=3, test="a, b, c"',
... 'min=-100, test=-99',
... 'min=1, max=3',
... '3, 6, test="36"',
... '3, 6, test="a, b, c"',
... '3, max=3, test=list("a", "b", "c")',
... '''3, max=3, test=list("'a'", 'b', "x=(c)")''',
... "test='x=fish(3)'",
... ]
>>> v = Validator({'test': _test})
>>> for entry in checks:
... pprint(v.check(('test(%s)' % entry), 3))
(3, ('3', '6'), {'max': '3', 'min': '1', 'test': ['a', 'b', 'c']})
(3, ('3',), {})
(3, ('3', '6'), {})
(3, ('3',), {})
(3, (), {'min': '1', 'test': 'a b c'})
(3, (), {'min': '5', 'test': 'a, b, c'})
(3, (), {'max': '3', 'min': '1', 'test': 'a, b, c'})
(3, (), {'min': '-100', 'test': '-99'})
(3, (), {'max': '3', 'min': '1'})
(3, ('3', '6'), {'test': '36'})
(3, ('3', '6'), {'test': 'a, b, c'})
(3, ('3',), {'max': '3', 'test': ['a', 'b', 'c']})
(3, ('3',), {'max': '3', 'test': ["'a'", 'b', 'x=(c)']})
(3, (), {'test': 'x=fish(3)'})
>>> v = Validator()
>>> v.check('integer(default=6)', '3')
3
>>> v.check('integer(default=6)', None, True)
6
>>> v.get_default_value('integer(default=6)')
6
>>> v.get_default_value('float(default=6)')
6.0
>>> v.get_default_value('pass(default=None)')
>>> v.get_default_value("string(default='None')")
'None'
>>> v.get_default_value('pass')
Traceback (most recent call last):
KeyError: 'Check "pass" has no default value.'
>>> v.get_default_value('pass(default=list(1, 2, 3, 4))')
['1', '2', '3', '4']
>>> v = Validator()
>>> v.check("pass(default=None)", None, True)
>>> v.check("pass(default='None')", None, True)
'None'
>>> v.check('pass(default="None")', None, True)
'None'
>>> v.check('pass(default=list(1, 2, 3, 4))', None, True)
['1', '2', '3', '4']
Bug test for unicode arguments
>>> v = Validator()
>>> v.check(unicode('string(min=4)'), unicode('test')) == unicode('test')
True
>>> v = Validator()
>>> v.get_default_value(unicode('string(min=4, default="1234")')) == unicode('1234')
True
>>> v.check(unicode('string(min=4, default="1234")'), unicode('test')) == unicode('test')
True
>>> v = Validator()
>>> default = v.get_default_value('string(default=None)')
>>> default == None
1
r! )r7 rt Zkeywargsr! r! r# �_test8 s Qr� c C s dS )z�
>>>
>>> v = Validator()
>>> v.get_default_value('string(default="#ff00dd")')
'#ff00dd'
>>> v.get_default_value('integer(default=3) # comment')
3
Nr! r! r! r! r# �_test2� s r� c C s dS )a�
>>> vtor.check('string(default="")', '', missing=True)
''
>>> vtor.check('string(default="\n")', '', missing=True)
'\n'
>>> print(vtor.check('string(default="\n")', '', missing=True))
<BLANKLINE>
<BLANKLINE>
>>> vtor.check('string()', '\n')
'\n'
>>> vtor.check('string(default="\n\n\n")', '', missing=True)
'\n\n\n'
>>> vtor.check('string()', 'random \n text goes here\n\n')
'random \n text goes here\n\n'
>>> vtor.check('string(default=" \nrandom text\ngoes \n here\n\n ")',
... '', missing=True)
' \nrandom text\ngoes \n here\n\n '
>>> vtor.check("string(default='\n\n\n')", '', missing=True)
'\n\n\n'
>>> vtor.check("option('\n','a','b',default='\n')", '', missing=True)
'\n'
>>> vtor.check("string_list()", ['foo', '\n', 'bar'])
['foo', '\n', 'bar']
>>> vtor.check("string_list(default=list('\n'))", '', missing=True)
['\n']
Nr! r! r! r! r# �_test3� s r� �__main__Zvtor)�globsZ optionflagsz{} failures out of {} tests) r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r )r )F)NN)NN)NN)NN)NN)NN)NN)NN)NN)NN)NN)Kr4 r �__all__rv �sysr � version_infoZ
basestringr rU Zunicoder| r. rw rz rx rg rr ry r{ r' � NameErrorr r � Exceptionr r
r r8 r r r r r
r r �objectr r� r r r� r r r r r r r r r r rD r� r r r� r� r� r1 Zdoctest�modules�get�m�__dict__�copyr� rG ZtestmodZIGNORE_EXCEPTION_DETAIL�ELLIPSISZfailuresZtests�AssertionError�formatr! r! r! r# �<module> s�
) 4
%
8
5
<%
-
"
$
9T
__pycache__/decorator.cpython-36.pyc 0000644 00000030213 14751155147 0013375 0 ustar 00 3
5*[Z�@ � @ s� d Z ddlmZ ddlZddlZddlZddlZddlZddlZdZ ej
dkrdddlm Z dd� Z n ej
d d
�Zd d � Z d
d� Z y
ejZW n ek
r� dd� ZY nX ej
dd�Zdd� Zejd�ZG dd� de�Zf fdd�Zd*dd�ZyddlmZ W n" ek
�r dd lm Z Y nX G d d � d e�Z e ej �Z e e j!�Z"e"d k�rhe j# �rhd d!� Z e e _ n,e"d k�r|e j#�r|ne"d"k�r�d#d!� Z e e _ ee �Z$d$d%� Z%d&d'� Z&d(d)� Z'dS )+zT
Decorator module, see http://pypi.python.org/pypi/decorator
for the documentation.
� )�print_functionNz4.2.1�3)�getfullargspecc C s | j S )N)�__init__)�cls� r � /usr/lib/python3.6/decorator.py�get_init0 s r � FullArgSpecz5args varargs varkw defaults kwonlyargs kwonlydefaultsc C s t jtj| �g df �S )z?A quick and dirty replacement for getfullargspec for Python 2.XN)r
�_make�inspect�
getargspec)�fr r r r 7 s r c C s | j jS )N)r �__func__)r r r r r ; s c C s dS )NFr )r r r r �iscoroutinefunctionB s r �ArgSpeczargs varargs varkw defaultsc C s t | �}t|j|j|j|j�S )z$A replacement for inspect.getargspec)r r �args�varargs�varkw�defaults)r �specr r r r
J s r
z \s*def\s*([_\w][_\w\d]*)\s*\(c @ sZ e Zd ZdZej� Zf Z Z Z Z
Z Z d
dd�Z
dd� Zddd �Zedd d ��ZdS )�
FunctionMakerz�
An object with the ability to create functions with a given signature.
It has attributes name, doc, module, signature, defaults, dict and
methods update and make.
Nc C s� || _ |�rf|j| _| jdkr$d| _|j| _|j| _tj|��rft |�}t
|di �| _ x dD ]} t | | t
|| �� q\W x&t
| j�D ]\}
} t | d
|
| � q�W t| j�} t| j�}
| jr�| jd | j � |
jd | j � n| jr�| jd � x.| jD ]$} | jd | � |
jd
| | f � q�W | j�rB| jd| j � |
jd| j � dj| �| _dj|
�| _ |jj� | _|�rr|| _|d k �r�|| _|�r�|| _|�r�|| _|�r�|| _|�r�|| _t| d��s�t�t| d��s�t d| ��d S )Nz<lambda>�_lambda_�__annotations__r r r r �
kwonlyargs�kwonlydefaultszarg%d�*z%s=Nonez%s=%sz**z, �name� signaturez%You are decorating a non function: %s)r r r r r r ) �shortsignature�__name__r �__doc__�doc�
__module__�moduler �
isfunctionr �getattr� annotations�setattr� enumerater �listr �appendr r �joinr �__dict__�copy�dictr �hasattr�AssertionError� TypeError)�self�funcr r r r" r$ ZfuncdictZargspec�a�i�argZallargsZ allshortargsr r r r a s\
zFunctionMaker.__init__c K s� | j |_t| dd�|_t| di �|_| j|_| jp4d|_t| dd�|_ yt
j d�}W n t k
rl d}Y nX |j
jdd�}t| d|�|_|jj|� dS ) z2Update the signature of func with the data in selfr" Nr/ r' � �?r r$ )r r r& r! r- r � __defaults__r �__kwdefaults__r �sys� _getframe�AttributeError� f_globals�getr# �update)r3 r4 �kw�frameZ callermoduler r r rA � s
zFunctionMaker.updateFc
K s |t | � }|pi }tj|�}|dkr2td| ��|jd�}t|gdd� | jjd�D � �}x$|D ] } | dkrbtd | |f ��qbW |j d
�s�|d
7 }d t
| j �f }
yt ||
d �} t
| |� W n* td
tjd� t|tjd� � Y nX || } |�r ||d< | j| f|� | S )zBMake a new function from a given template and update the signatureNz not a valid function template
%s� c S s g | ]}|j d ��qS )z *)�strip)�.0r7 r r r �
<listcomp>� s z&FunctionMaker.make.<locals>.<listcomp>�,�_func_�_call_z%s is overridden in
%s�
z<decorator-gen-%d>ZsinglezError in generated code:)�fileZ
__source__)rI rJ )�vars�DEF�search� SyntaxError�group�setr �split� NameError�endswith�next�_compile_count�compile�exec�printr< �stderrrA )
r3 Z src_templ�evaldict� addsource�attrs�src�mor �names�n�filename�coder4 r r r �make� s4
zFunctionMaker.makeTc K s� t |t�r0|j� jdd�\} }
|
dd � } d} n d} d} |} | | | | |||�}
djdd� |j� D ��}|jd�}|r�t|�r�d| jd d
�}nd | }|
j |||f|�S )
z�
Create a function from the strings name, signature and body.
evaldict is the evaluation dictionary. If addsource is true an
attribute __source__ is added to the result. The attributes attrs
are added, if any.
�(rD NrK c s s | ]}d | V qdS )z Nr )rF �liner r r � <genexpr>� s z'FunctionMaker.create.<locals>.<genexpr>rJ z#async def %(name)s(%(signature)s):
�returnz return awaitz def %(name)s(%(signature)s):
���)
�
isinstance�strrE rS r, �
splitlinesr@ r �replacere )r �objZbodyr\ r r" r$ r] r^ r �restr r4 r3 Zibody�callerr r r �create� s
zFunctionMaker.create)NNNNNNN)NF)NNNT)r r# � __qualname__r! � itertools�countrW r r r r r r r rA re � classmethodrr r r r r r T s
3
" r c C sn t || d�}d}x0t|�D ]$\}}d| }|||< ||d 7 }qW tj| d| || d�}t| d�rj| j|_|S )zE
decorate(func, caller) decorates a function using a caller.
)rJ rI � z_e%d_z, z,return _call_(_func_, %s%%(shortsignature)s))� __wrapped__rs )r/ r) r rr r0 rs ) r4 rq Zextrasr\ Zesr6 ZextraZexZfunr r r �decorate� s
ry c
C s |dk rt || �S df }}tj| �rB| jj� }d| j| jf }n~tj| �r�| jdkr\d}n| j}| j}| jj}t | j
pzf �}dj | jj || |� �}|r�|d7 }| j
}n| j
jj� }| jj}t| t d�}tjd ||f d
||f ||| j| d �} |�rd | | _
| S )
z=decorator(caller) converts a caller function into a decoratorNrw zHdecorator(%s) converts functions/generators into factories of %s objectsz<lambda>r z, rH )Z_callZ
_decorate_z %s(func, %s)zhif func is None: return lambda func: _decorate_(func, _call, (%s))
return _decorate_(func, _call, (%s)))r" r$ rx )N)ry r Zisclassr �lowerr% r! �__code__� co_argcount�lenr: r, � co_varnames� __class__�__call__r/ r rr r# )
rq Z_funcZ defaultargsr r r" �nargsZndefsr\ �decr r r � decorator� s:
r� )�_GeneratorContextManager)�GeneratorContextManagerc @ s e Zd Zdd� ZdS )�ContextManagerc C s t j|dt| |d�|d�S )zContext manager decoratorz.with _self_: return _func_(%(shortsignature)s))Z_self_rI )rx )r rr r/ )r3 r4 r r r r� # s zContextManager.__call__N)r r# rs r� r r r r r� " s r� � c O s t j| |||��S )N)r� r )r3 �gr5 �kr r r r - s r � c O s t j| |||�S )N)r� r )r3 r� r5 r� r r r r 3 s c C s t | �S )N)�_contextmanager)r4 r r r �contextmanager: s r� c C sR d}x:t |�D ].\}}t|| �r&d}P t| |�r| ||< d}qW |rN|j| � dS )z_
Append ``a`` to the list of the virtual ancestors, unless it is already
included.
TFN)r) �
issubclassr+ )r5 �
vancestors�add�j�var r r r+ A s
r+ c sL �s t d��ddj�� �tjdf�fdd� � � ��fdd�}d � |_|S )
zr
Factory of decorators turning a function into a generic function
dispatching on the given arguments.
zNo dispatch args passedz(%s,)z, rw c s0 |t | �t � ��r,tdt � �t | �|f ��dS )z5Make sure one passes the expected number of argumentsz Expected %d arguments, got %d%sN)r} r2 )Z argumentsZwrong�msg)�
dispatch_argsr r �check[ s zdispatch_on.<locals>.checkc s� t t��j�}t ��|ks&td� ��i ����fdd����fdd�� ��fdd�}� �fdd �}� ��fd
d �}tj�d � t|d
�|���� |�d�
S )z4Decorator turning a function into a generic functionz Unknown dispatch arguments %sc sv � | � dd� t t���D �}xH�D ]@}x:t| ||�D ]*\}}}t||�r6||j� kr6t||� q6W q$W dd� |D �S )zU
Get a list of sets of virtual ancestors for the given types
c S s g | ]}g �qS r r )rF �_r r r rG p s zIdispatch_on.<locals>.gen_func_dec.<locals>.vancestors.<locals>.<listcomp>c S s g | ] }t |��qS r )rR )rF �rar r r rG u s )�ranger} �zipr� �mror+ )�typesZras�types_�tZtype_r� )r� r� �typemapr r r� k s
z5dispatch_on.<locals>.gen_func_dec.<locals>.vancestorsc s� � | � g }x�t | �| � �D ]p\}}t|�}|dkrFtd||f ��n4|dkrr|\}td||fi �j� dd� }n|j� }|j|dd� � q W |S )zG
Get a list of virtual MROs, one for each type
rD z Ambiguous dispatch for %s: %sr� Nrj )r� r} � RuntimeError�typer� r+ )r� Zlistsr� ZvasZn_vasr� r� )r� r� r r � ancestorsw s z4dispatch_on.<locals>.gen_func_dec.<locals>.ancestorsc s �� � ��� fdd�}|S )zU
Decorator to register an implementation for the given types
c s& � t | �jtjd| j � | ��< | S )Nz in )r r �operator�ltr )r )r� r� r� r r r� � s z@dispatch_on.<locals>.gen_func_dec.<locals>.register.<locals>.decr )r� r� )r� r� )r� r �register� s z3dispatch_on.<locals>.gen_func_dec.<locals>.registerc s@ �| � g }x.t j� | � � D ] }|jtdd� |D ��� q W |S )zI
An utility to introspect the dispatch algorithm
c s s | ] }|j V qd S )N)r )rF r5 r r r rh � s zKdispatch_on.<locals>.gen_func_dec.<locals>.dispatch_info.<locals>.<genexpr>)rt �productr+ �tuple)r� ZlstZanc)r� r� r r �
dispatch_info� s
z8dispatch_on.<locals>.gen_func_dec.<locals>.dispatch_infoc s� t dd� | D ��}y �| }W n tk
r2 Y n X |||�S tj� |� � }t|� x(|D ] }�j|�}|d k rZ|||�S qZW �||�S )Nc s s | ]}t |�V qd S )N)r� )rF r7 r r r rh � s zGdispatch_on.<locals>.gen_func_dec.<locals>._dispatch.<locals>.<genexpr>)r� �KeyErrorrt r� rV r@ )r� r rB r� r � combinationsr� )r� r4 r� r r � _dispatch� s
z4dispatch_on.<locals>.gen_func_dec.<locals>._dispatchz#return _f_(%s, %%(shortsignature)s))Z_f_)r� �defaultr� r� r� r� rx )rR r r rT r rr r/ )r4 Zargsetr� r� r� )r� r� � dispatch_str)r� r4 r� r� r � gen_func_deca s
z!dispatch_on.<locals>.gen_func_dec� dispatch_on)r1 r, r� �ner )r� r� r )r� r� r� r r� S s W
r� )N)(r! Z
__future__r �rer< r r� rt � collections� __version__�versionr r �
namedtupler
r r> r r
rX rN �objectr ry r� �
contextlibr� � ImportErrorr� r� r Zinitr} r Zn_argsr r� r� r+ r� r r r r �<module>! s\
&
__pycache__/easy_install.cpython-36.opt-1.pyc 0000644 00000000403 14751155147 0015037 0 ustar 00 3
��f~ � @ s" d Z edkr ddlmZ e� dS )zRun the EasyInstall command�__main__� )�mainN)�__doc__�__name__Z setuptools.command.easy_installr � r r �"/usr/lib/python3.6/easy_install.py�<module> s __pycache__/validate.cpython-36.opt-1.pyc 0000644 00000126422 14751155147 0014153 0 ustar 00 3
��S�� � @ s� d Z dZdWZd d lZd d lZd d!lmZ ejdXk r8eZne Zd#d$� Z
e Z ej
d%ejejB �Zej
d&ejejB �Zd'Zd(e Zye W n ek
r� d)d*� ZY nX d+d� Zd,d� ZG d-d� de�ZG d.d� de�ZG d/d� de�ZG d0d� de �Z G d1d� de�Z G d2d � d e�Z G d3d
� d
e �Z G d4d � d e �Z!G d5d � d e �Z"G d6d
� d
e �Z#G d7d� de$�Z%dYd9d:�Z&dZd;d�Z'd[d<d�Z(d=d=d=d=d=d8d8d8d8d8d>�
Z)d?d� Z*d@d� Z+d\dAd�Z,d]dBd�Z-d^dCd�Z.d_dDd�Z/d`dEd�Z0dadFd�Z1dbdGd�Z2dcdHd�Z3dddIdJ�Z4e'e(e+e.e*dK�Z5dLd � Z6dMd � Z7dNdO� Z8dPdQ� Z9dRdS� Z:e;dTk�r�d d lZd d l<Z<ej=j>dT�Z?e?j@jA� ZBeBjCdUe%� i� e<jDe?eBe<jEe<jFB dV�\ZGZHd S )ea
The Validator object is used to check that supplied values
conform to a specification.
The value can be supplied as a string - e.g. from a config file.
In this case the check will also *convert* the value to
the required type. This allows you to add validation
as a transparent layer to access data stored as strings.
The validation checks that the data is correct *and*
converts it to the expected type.
Some standard checks are provided for basic data types.
Additional checks are easy to write. They can be
provided when the ``Validator`` is instantiated or
added afterwards.
The standard functions work with the following basic data types :
* integers
* floats
* booleans
* strings
* ip_addr
plus lists of these datatypes
Adding additional checks is done through coding simple functions.
The full set of standard checks are :
* 'integer': matches integer values (including negative)
Takes optional 'min' and 'max' arguments : ::
integer()
integer(3, 9) # any value from 3 to 9
integer(min=0) # any positive value
integer(max=9)
* 'float': matches float values
Has the same parameters as the integer check.
* 'boolean': matches boolean values - ``True`` or ``False``
Acceptable string values for True are :
true, on, yes, 1
Acceptable string values for False are :
false, off, no, 0
Any other value raises an error.
* 'ip_addr': matches an Internet Protocol address, v.4, represented
by a dotted-quad string, i.e. '1.2.3.4'.
* 'string': matches any string.
Takes optional keyword args 'min' and 'max'
to specify min and max lengths of the string.
* 'list': matches any list.
Takes optional keyword args 'min', and 'max' to specify min and
max sizes of the list. (Always returns a list.)
* 'tuple': matches any tuple.
Takes optional keyword args 'min', and 'max' to specify min and
max sizes of the tuple. (Always returns a tuple.)
* 'int_list': Matches a list of integers.
Takes the same arguments as list.
* 'float_list': Matches a list of floats.
Takes the same arguments as list.
* 'bool_list': Matches a list of boolean values.
Takes the same arguments as list.
* 'ip_addr_list': Matches a list of IP addresses.
Takes the same arguments as list.
* 'string_list': Matches a list of strings.
Takes the same arguments as list.
* 'mixed_list': Matches a list with different types in
specific positions. List size must match
the number of arguments.
Each position can be one of :
'integer', 'float', 'ip_addr', 'string', 'boolean'
So to specify a list with two strings followed
by two integers, you write the check as : ::
mixed_list('string', 'string', 'integer', 'integer')
* 'pass': This check matches everything ! It never fails
and the value is unchanged.
It is also the default if no check is specified.
* 'option': This check matches any from a list of options.
You specify this check with : ::
option('option 1', 'option 2', 'option 3')
You can supply a default value (returned if no value is supplied)
using the default keyword argument.
You specify a list argument for default using a list constructor syntax in
the check : ::
checkname(arg1, arg2, default=list('val 1', 'val 2', 'val 3'))
A badly formatted set of arguments will raise a ``VdtParamError``.
z1.0.1� __version__�dottedQuadToNum�numToDottedQuad�
ValidateError�VdtUnknownCheckError�
VdtParamError� VdtTypeError�
VdtValueError�VdtValueTooSmallError�VdtValueTooBigError�VdtValueTooShortError�VdtValueTooLongError�VdtMissingValue� Validator�
is_integer�is_float�
is_boolean�is_list�is_tuple�
is_ip_addr� is_string� is_int_list� is_bool_list�
is_float_list�is_string_list�is_ip_addr_list�
is_mixed_list� is_option�
__docformat__� N)�pprint� c C s | S )N� )�xr! r! � /usr/lib/python3.6/validate.py�<lambda>� s r$ a�
(?:
([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*list\(
(
(?:
\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)
\s*,\s*
)*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)? # last one
)
\)
)
z�
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?) # unquoted
)
(?:
(?:\s*,\s*)|(?:\s*$) # comma
)
a�
(?:
(
(?:
[a-zA-Z_][a-zA-Z0-9_]*\s*=\s*list\(
(?:
\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)
\s*,\s*
)*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s\)][^,\)]*?) # unquoted
)? # last one
\)
)|
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?)| # unquoted
(?: # keyword argument
[a-zA-Z_][a-zA-Z0-9_]*\s*=\s*
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\s=][^,=]*?) # unquoted
)
)
)
)
(?:
(?:\s*,\s*)|(?:\s*$) # comma
)
)
z^%s*c C s | rdS dS dS )z$Simple boolean equivalent function. � r Nr! )�valr! r! r# �bool
s r' c C sR ddl }ddl}y|jd|j| j� ��d S |jk
rL td| ��Y nX dS )a�
Convert decimal dotted quad string to long integer
>>> int(dottedQuadToNum('1 '))
1
>>> int(dottedQuadToNum(' 1.2'))
16777218
>>> int(dottedQuadToNum(' 1.2.3 '))
16908291
>>> int(dottedQuadToNum('1.2.3.4'))
16909060
>>> dottedQuadToNum('255.255.255.255')
4294967295
>>> dottedQuadToNum('255.255.255.256')
Traceback (most recent call last):
ValueError: Not a good dotted-quad IP: 255.255.255.256
r Nz!Lz Not a good dotted-quad IP: %s)�socket�struct�unpackZ inet_aton�strip�error�
ValueError)Zipr( r) r! r! r# r s c
C sv ddl }ddl}| td�ks$| dk r0td| ��y|j|jdt| ���S |j|jtfk
rp td| ��Y nX dS )a!
Convert int or long int to dotted quad string
>>> numToDottedQuad(long(-1))
Traceback (most recent call last):
ValueError: Not a good numeric IP: -1
>>> numToDottedQuad(long(1))
'0.0.0.1'
>>> numToDottedQuad(long(16777218))
'1.0.0.2'
>>> numToDottedQuad(long(16908291))
'1.2.0.3'
>>> numToDottedQuad(long(16909060))
'1.2.3.4'
>>> numToDottedQuad(long(4294967295))
'255.255.255.255'
>>> numToDottedQuad(long(4294967296))
Traceback (most recent call last):
ValueError: Not a good numeric IP: 4294967296
>>> numToDottedQuad(-1)
Traceback (most recent call last):
ValueError: Not a good numeric IP: -1
>>> numToDottedQuad(1)
'0.0.0.1'
>>> numToDottedQuad(16777218)
'1.0.0.2'
>>> numToDottedQuad(16908291)
'1.2.0.3'
>>> numToDottedQuad(16909060)
'1.2.3.4'
>>> numToDottedQuad(4294967295)
'255.255.255.255'
>>> numToDottedQuad(4294967296)
Traceback (most recent call last):
ValueError: Not a good numeric IP: 4294967296
r Nl �� zNot a good numeric IP: %sz!L)r( r) �longr- Z inet_ntoa�packr, �
OverflowError)Znumr( r) r! r! r# r 0 s ( c @ s e Zd ZdZdS )r a
This error indicates that the check failed.
It can be the base class for more specific errors.
Any check function that fails ought to raise this error.
(or a subclass)
>>> raise ValidateError
Traceback (most recent call last):
ValidateError
N)�__name__�
__module__� __qualname__�__doc__r! r! r! r# r d s c @ s e Zd ZdZdS )r
z1No value was supplied to a check that needed one.N)r1 r2 r3 r4 r! r! r! r# r
r s c @ s e Zd ZdZdd� ZdS )r z'An unknown check function was requestedc C s t j| d|f � dS )z�
>>> raise VdtUnknownCheckError('yoda')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
zthe check "%s" is unknown.N)r �__init__)�self�valuer! r! r# r5 y s z VdtUnknownCheckError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r v s c @ s e Zd ZdZdd� ZdS )r z!An incorrect parameter was passedc C s t j| d||f � dS )z�
>>> raise VdtParamError('yoda', 'jedi')
Traceback (most recent call last):
VdtParamError: passed an incorrect value "jedi" for parameter "yoda".
z2passed an incorrect value "%s" for parameter "%s".N)� SyntaxErrorr5 )r6 �namer7 r! r! r# r5 � s zVdtParamError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r z(The value supplied was of the wrong typec C s t j| d|f � dS )z�
>>> raise VdtTypeError('jedi')
Traceback (most recent call last):
VdtTypeError: the value "jedi" is of the wrong type.
z$the value "%s" is of the wrong type.N)r r5 )r6 r7 r! r! r# r5 � s zVdtTypeError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r zIThe value supplied was of the correct type, but was not an allowed value.c C s t j| d|f � dS )z�
>>> raise VdtValueError('jedi')
Traceback (most recent call last):
VdtValueError: the value "jedi" is unacceptable.
z the value "%s" is unacceptable.N)r r5 )r6 r7 r! r! r# r5 � s zVdtValueError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r z>The value supplied was of the correct type, but was too small.c C s t j| d|f � dS )z�
>>> raise VdtValueTooSmallError('0')
Traceback (most recent call last):
VdtValueTooSmallError: the value "0" is too small.
z the value "%s" is too small.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooSmallError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r
z<The value supplied was of the correct type, but was too big.c C s t j| d|f � dS )z�
>>> raise VdtValueTooBigError('1')
Traceback (most recent call last):
VdtValueTooBigError: the value "1" is too big.
zthe value "%s" is too big.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooBigError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r
� s c @ s e Zd ZdZdd� ZdS )r z>The value supplied was of the correct type, but was too short.c C s t j| d|f � dS )z�
>>> raise VdtValueTooShortError('jed')
Traceback (most recent call last):
VdtValueTooShortError: the value "jed" is too short.
z the value "%s" is too short.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooShortError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s e Zd ZdZdd� ZdS )r z=The value supplied was of the correct type, but was too long.c C s t j| d|f � dS )z�
>>> raise VdtValueTooLongError('jedie')
Traceback (most recent call last):
VdtValueTooLongError: the value "jedie" is too long.
zthe value "%s" is too long.N)r r5 )r6 r7 r! r! r# r5 � s z VdtValueTooLongError.__init__N)r1 r2 r3 r4 r5 r! r! r! r# r � s c @ s� e Zd ZdZejdej�Zejdej�Ze Z e
Z
eje ej ejB �Z
ejeej ejB �Zddd�Zddd �Zd
d � Zd d
� Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� ZdS ) r a3
Validator is an object that allows you to register a set of 'checks'.
These checks take input and test that it conforms to the check.
This can also involve converting the value from a string into
the correct datatype.
The ``check`` method takes an input string which configures which
check is to be used and applies that check to a supplied value.
An example input string would be:
'int_range(param1, param2)'
You would then provide something like:
>>> def int_range_check(value, min, max):
... # turn min and max from strings to integers
... min = int(min)
... max = int(max)
... # check that value is of the correct type.
... # possible valid inputs are integers or strings
... # that represent integers
... if not isinstance(value, (int, long, string_type)):
... raise VdtTypeError(value)
... elif isinstance(value, string_type):
... # if we are given a string
... # attempt to convert to an integer
... try:
... value = int(value)
... except ValueError:
... raise VdtValueError(value)
... # check the value is between our constraints
... if not min <= value:
... raise VdtValueTooSmallError(value)
... if not value <= max:
... raise VdtValueTooBigError(value)
... return value
>>> fdict = {'int_range': int_range_check}
>>> vtr1 = Validator(fdict)
>>> vtr1.check('int_range(20, 40)', '30')
30
>>> vtr1.check('int_range(20, 40)', '60')
Traceback (most recent call last):
VdtValueTooBigError: the value "60" is too big.
New functions can be added with : ::
>>> vtr2 = Validator()
>>> vtr2.functions['int_range'] = int_range_check
Or by passing in a dictionary of functions when Validator
is instantiated.
Your functions *can* use keyword arguments,
but the first argument should always be 'value'.
If the function doesn't take additional arguments,
the parentheses are optional in the check.
It can be written with either of : ::
keyword = function_name
keyword = function_name()
The first program to utilise Validator() was Michael Foord's
ConfigObj, an alternative to ConfigParser which supports lists and
can validate a config file using a config schema.
For more details on using Validator with ConfigObj see:
https://configobj.readthedocs.org/en/latest/configobj.html
z
(.+?)\((.*)\)z%^([a-zA-Z_][a-zA-Z0-9_]*)\s*=\s*(.*)$Nc C sR | j ttttttttt t
t t t
| j ttd�| _|dk rB| jj|� t| _i | _dS )z(
>>> vtri = Validator()
)� �integer�float�boolean�ip_addr�string�list�tupleZint_listZ
float_listZ bool_listZ ip_addr_listZ string_list�
mixed_list�passZoption�
force_listN)�_passr r r r r r r r r r r r r r rD � functions�updater ZbaseErrorClass�_cache)r6 rF r! r! r# r5 3 s*
zValidator.__init__Fc C sJ | j |�\}}}}|r.|dkr$t� �| j|�}|dkr:dS | j||||�S )a�
Usage: check(check, value)
Arguments:
check: string representing check to apply (including arguments)
value: object to be checked
Returns value, converted to correct type if necessary
If the check fails, raises a ``ValidateError`` subclass.
>>> vtor.check('yoda', '')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
>>> vtor.check('yoda()', '')
Traceback (most recent call last):
VdtUnknownCheckError: the check "yoda" is unknown.
>>> vtor.check('string(default="")', '', missing=True)
''
N)�_parse_with_cachingr
� _handle_none� _check_value)r6 �checkr7 Zmissing�fun_name�fun_args�
fun_kwargs�defaultr! r! r# rL Q s
zValidator.checkc C s" |dkr d S |dkr | j |�}|S )N�None�'None'�"None")rR rS )�_unquote)r6 r7 r! r! r# rJ t s
zValidator._handle_nonec C s� || j kr.| j | \}}}}t|�}t|�}nF| j|�\}}}}tdd� t|j� �D ��}|t|�t|�|f| j |< ||||fS )Nc S s g | ]\}}t |�|f�qS r! )�str)�.0�keyr7 r! r! r# �
<listcomp>� s z1Validator._parse_with_caching.<locals>.<listcomp>)rH r@ �dict� _parse_check�items)r6 rL rM rN rO rP r! r! r# rI } s
z Validator._parse_with_cachingc C s@ y| j | }W n tk
r* t|��Y nX ||f|�|�S d S )N)rF �KeyErrorr )r6 r7 rM rN rO �funr! r! r# rK � s
zValidator._check_valuec C s | j j|�}|r�|jd�}|jd�}| jj|�}|d krDtd| ��g }i }x�| jj|�D ]�}|j� }| jj|�} | r�| j | �\}
} | ||
< qZ| j
j|�} | r�| jd�} | dkr�| j | �} | || jd�< qZ|j | j |�� qZW n |f i d fS |j
dd �}
||||
fS )Nr% � zBad syntax in check "%s".�'None'�"None"rP )r_ r` )�_func_re�match�group� _matchfinderr � _paramfinder�findallr+ � _list_arg� _list_handle�_key_argrT �append�pop)r6 rL Z fun_matchrM Z
arg_stringZ arg_matchrN rO �arg� listmatchrW r& ZkeymatchrP r! r! r# rZ � s6
zValidator._parse_checkc C s8 t |�dkr4|d dkr4|d |d kr4|dd� }|S ) z Unquote a value if necessary.r^ r �'�"r% )rn ro ���rp )�len)r6 r& r! r! r# rT � s ( zValidator._unquotec C sF g }|j d�}|j d�}x$| jj|�D ]}|j| j|�� q&W ||fS )z7Take apart a ``keyword=list('val, 'val')`` type string.r% r^ )rc �
_list_membersrf rj rT )r6 rm �outr9 �argsrl r! r! r# rh � s
zValidator._list_handlec C s |S )z�
Dummy check that always passes
>>> vtor.check('', 0)
0
>>> vtor.check('', '0')
'0'
r! )r6 r7 r! r! r# rE � s zValidator._passc C sL | j |�\}}}}|dkr&td| ��| j|�}|dkr<|S | j||||�S )z�
Given a check, return the default value for the check
(converted to the right type).
If the check doesn't specify a default value then a
``KeyError`` will be raised.
Nz Check "%s" has no default value.)rI r\ rJ rK )r6 rL rM rN rO rP r7 r! r! r# �get_default_value� s
zValidator.get_default_value)N)F)r1 r2 r3 r4 �re�compile�DOTALLra ri rg rr � _paramstring�VERBOSEre � _matchstringrd r5 rL rJ rI rK rZ rT rh rE ru r! r! r! r# r � s" F
# (
Fc C s� |rt p
t}g }x�t| |�D ]z\}}|dkr8|j|� q t|ttt tf�r�y|j||�� W q� tk
r� } zt||��W Y dd}~X q�X q t||��q W |S )a�
Return numbers from inputs or raise VdtParamError.
Lets ``None`` pass through.
Pass in keyword argument ``to_float=True`` to
use float for the conversion rather than int.
>>> _is_num_param(('', ''), (0, 1.0))
[0, 1]
>>> _is_num_param(('', ''), (0, 1.0), to_float=True)
[0.0, 1.0]
>>> _is_num_param(('a'), ('a'))
Traceback (most recent call last):
VdtParamError: passed an incorrect value "a" for parameter "a".
N) r< �int�ziprj �
isinstancer. � string_typer- r )�names�values�to_floatr] Z
out_paramsr9 r& �er! r! r# �
_is_num_param� s r� c C s� t d||f�\}}t| tttf�s*t| ��t| t�r^y t| �} W n tk
r\ t| ��Y nX |dk rv| |k rvt| ��|dk r�| |kr�t| ��| S )aH
A check that tests that a given value is an integer (int, or long)
and optionally, between bounds. A negative value is accepted, while
a float will fail.
If the value is a string, then the conversion is done - if possible.
Otherwise a VdtError is raised.
>>> vtor.check('integer', '-1')
-1
>>> vtor.check('integer', '0')
0
>>> vtor.check('integer', 9)
9
>>> vtor.check('integer', 'a')
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
>>> vtor.check('integer', '2.2')
Traceback (most recent call last):
VdtTypeError: the value "2.2" is of the wrong type.
>>> vtor.check('integer(10)', '20')
20
>>> vtor.check('integer(max=20)', '15')
15
>>> vtor.check('integer(10)', '9')
Traceback (most recent call last):
VdtValueTooSmallError: the value "9" is too small.
>>> vtor.check('integer(10)', 9)
Traceback (most recent call last):
VdtValueTooSmallError: the value "9" is too small.
>>> vtor.check('integer(max=20)', '35')
Traceback (most recent call last):
VdtValueTooBigError: the value "35" is too big.
>>> vtor.check('integer(max=20)', 35)
Traceback (most recent call last):
VdtValueTooBigError: the value "35" is too big.
>>> vtor.check('integer(0, 9)', False)
0
�min�maxN)r� r� ) r� r~ r| r. r r r- r r
)r7 r� r� �min_val�max_valr! r! r# r s (
c C s� t d||fdd�\}}t| ttttf�s0t| ��t| t�sdy t| �} W n tk
rb t| ��Y nX |dk r|| |k r|t| ��|dk r�| |kr�t | ��| S )a<
A check that tests that a given value is a float
(an integer will be accepted), and optionally - that it is between bounds.
If the value is a string, then the conversion is done - if possible.
Otherwise a VdtError is raised.
This can accept negative values.
>>> vtor.check('float', '2')
2.0
From now on we multiply the value to avoid comparing decimals
>>> vtor.check('float', '-6.8') * 10
-68.0
>>> vtor.check('float', '12.2') * 10
122.0
>>> vtor.check('float', 8.4) * 10
84.0
>>> vtor.check('float', 'a')
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
>>> vtor.check('float(10.1)', '10.2') * 10
102.0
>>> vtor.check('float(max=20.2)', '15.1') * 10
151.0
>>> vtor.check('float(10.0)', '9.0')
Traceback (most recent call last):
VdtValueTooSmallError: the value "9.0" is too small.
>>> vtor.check('float(max=20.0)', '35.0')
Traceback (most recent call last):
VdtValueTooBigError: the value "35.0" is too big.
r� r� T)r� N)r� r� )
r� r~ r| r. r< r r r- r r
)r7 r� r� r� r� r! r! r# r G s #
T)
TZon�1�true�yesFZoff�0Zfalse�noc C sX t | t�r4y t| j� S tk
r2 t| ��Y nX | dkr@dS | dkrLdS t| ��dS )a�
Check if the value represents a boolean.
>>> vtor.check('boolean', 0)
0
>>> vtor.check('boolean', False)
0
>>> vtor.check('boolean', '0')
0
>>> vtor.check('boolean', 'off')
0
>>> vtor.check('boolean', 'false')
0
>>> vtor.check('boolean', 'no')
0
>>> vtor.check('boolean', 'nO')
0
>>> vtor.check('boolean', 'NO')
0
>>> vtor.check('boolean', 1)
1
>>> vtor.check('boolean', True)
1
>>> vtor.check('boolean', '1')
1
>>> vtor.check('boolean', 'on')
1
>>> vtor.check('boolean', 'true')
1
>>> vtor.check('boolean', 'yes')
1
>>> vtor.check('boolean', 'Yes')
1
>>> vtor.check('boolean', 'YES')
1
>>> vtor.check('boolean', '')
Traceback (most recent call last):
VdtTypeError: the value "" is of the wrong type.
>>> vtor.check('boolean', 'up')
Traceback (most recent call last):
VdtTypeError: the value "up" is of the wrong type.
FTN)r~ r � bool_dict�lowerr\ r )r7 r! r! r# r � s ,
c C sH t | t�st| ��| j� } y t| � W n tk
rB t| ��Y nX | S )as
Check that the supplied value is an Internet Protocol address, v.4,
represented by a dotted-quad string, i.e. '1.2.3.4'.
>>> vtor.check('ip_addr', '1 ')
'1'
>>> vtor.check('ip_addr', ' 1.2')
'1.2'
>>> vtor.check('ip_addr', ' 1.2.3 ')
'1.2.3'
>>> vtor.check('ip_addr', '1.2.3.4')
'1.2.3.4'
>>> vtor.check('ip_addr', '0.0.0.0')
'0.0.0.0'
>>> vtor.check('ip_addr', '255.255.255.255')
'255.255.255.255'
>>> vtor.check('ip_addr', '255.255.255.256')
Traceback (most recent call last):
VdtValueError: the value "255.255.255.256" is unacceptable.
>>> vtor.check('ip_addr', '1.2.3.4.5')
Traceback (most recent call last):
VdtValueError: the value "1.2.3.4.5" is unacceptable.
>>> vtor.check('ip_addr', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
)r~ r r r+ r r- r )r7 r! r! r# r � s
c C s� t d||f�\}}t| t�r$t| ��y t| �}W n tk
rL t| ��Y nX |dk rf||k rft| ��|dk r~||kr~t| ��t| �S )a�
Check that the value is a list of values.
You can optionally specify the minimum and maximum number of members.
It does no check on list members.
>>> vtor.check('list', ())
[]
>>> vtor.check('list', [])
[]
>>> vtor.check('list', (1, 2))
[1, 2]
>>> vtor.check('list', [1, 2])
[1, 2]
>>> vtor.check('list(3)', (1, 2))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2)" is too short.
>>> vtor.check('list(max=5)', (1, 2, 3, 4, 5, 6))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2, 3, 4, 5, 6)" is too long.
>>> vtor.check('list(min=3, max=5)', (1, 2, 3, 4))
[1, 2, 3, 4]
>>> vtor.check('list', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('list', '12')
Traceback (most recent call last):
VdtTypeError: the value "12" is of the wrong type.
r� r� N)r� r� ) r� r~ r r rq � TypeErrorr r r@ )r7 r� r� �min_len�max_len� num_membersr! r! r# r � s
c C s t t| ||��S )a�
Check that the value is a tuple of values.
You can optionally specify the minimum and maximum number of members.
It does no check on members.
>>> vtor.check('tuple', ())
()
>>> vtor.check('tuple', [])
()
>>> vtor.check('tuple', (1, 2))
(1, 2)
>>> vtor.check('tuple', [1, 2])
(1, 2)
>>> vtor.check('tuple(3)', (1, 2))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2)" is too short.
>>> vtor.check('tuple(max=5)', (1, 2, 3, 4, 5, 6))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2, 3, 4, 5, 6)" is too long.
>>> vtor.check('tuple(min=3, max=5)', (1, 2, 3, 4))
(1, 2, 3, 4)
>>> vtor.check('tuple', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('tuple', '12')
Traceback (most recent call last):
VdtTypeError: the value "12" is of the wrong type.
)rA r )r7 r� r� r! r! r# r s c C s� t | t�st| ��td||f�\}}y t| �}W n tk
rL t| ��Y nX |dk rf||k rft| ��|dk r~||kr~t| ��| S )a�
Check that the supplied value is a string.
You can optionally specify the minimum and maximum number of members.
>>> vtor.check('string', '0')
'0'
>>> vtor.check('string', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('string(2)', '12')
'12'
>>> vtor.check('string(2)', '1')
Traceback (most recent call last):
VdtValueTooShortError: the value "1" is too short.
>>> vtor.check('string(min=2, max=3)', '123')
'123'
>>> vtor.check('string(min=2, max=3)', '1234')
Traceback (most recent call last):
VdtValueTooLongError: the value "1234" is too long.
r� r� N)r� r� )r~ r r r� rq r� r r )r7 r� r� r� r� r� r! r! r# r 1 s
c C s dd� t | ||�D �S )a
Check that the value is a list of integers.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is an integer.
>>> vtor.check('int_list', ())
[]
>>> vtor.check('int_list', [])
[]
>>> vtor.check('int_list', (1, 2))
[1, 2]
>>> vtor.check('int_list', [1, 2])
[1, 2]
>>> vtor.check('int_list', [1, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV �memr! r! r# rX i s z is_int_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r U s c C s dd� t | ||�D �S )al
Check that the value is a list of booleans.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a boolean.
>>> vtor.check('bool_list', ())
[]
>>> vtor.check('bool_list', [])
[]
>>> check_res = vtor.check('bool_list', (True, False))
>>> check_res == [True, False]
1
>>> check_res = vtor.check('bool_list', [True, False])
>>> check_res == [True, False]
1
>>> vtor.check('bool_list', [True, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z is_bool_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r l s c C s dd� t | ||�D �S )a
Check that the value is a list of floats.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a float.
>>> vtor.check('float_list', ())
[]
>>> vtor.check('float_list', [])
[]
>>> vtor.check('float_list', (1, 2.0))
[1.0, 2.0]
>>> vtor.check('float_list', [1, 2.0])
[1.0, 2.0]
>>> vtor.check('float_list', [1, 'a'])
Traceback (most recent call last):
VdtTypeError: the value "a" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z!is_float_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r � s c C s( t | t�rt| ��dd� t| ||�D �S )an
Check that the value is a list of strings.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is a string.
>>> vtor.check('string_list', ())
[]
>>> vtor.check('string_list', [])
[]
>>> vtor.check('string_list', ('a', 'b'))
['a', 'b']
>>> vtor.check('string_list', ['a', 1])
Traceback (most recent call last):
VdtTypeError: the value "1" is of the wrong type.
>>> vtor.check('string_list', 'hello')
Traceback (most recent call last):
VdtTypeError: the value "hello" is of the wrong type.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z"is_string_list.<locals>.<listcomp>)r~ r r r )r7 r� r� r! r! r# r � s
c C s dd� t | ||�D �S )a
Check that the value is a list of IP addresses.
You can optionally specify the minimum and maximum number of members.
Each list member is checked that it is an IP address.
>>> vtor.check('ip_addr_list', ())
[]
>>> vtor.check('ip_addr_list', [])
[]
>>> vtor.check('ip_addr_list', ('1.2.3.4', '5.6.7.8'))
['1.2.3.4', '5.6.7.8']
>>> vtor.check('ip_addr_list', ['a'])
Traceback (most recent call last):
VdtValueError: the value "a" is unacceptable.
c S s g | ] }t |��qS r! )r )rV r� r! r! r# rX � s z#is_ip_addr_list.<locals>.<listcomp>)r )r7 r� r� r! r! r# r � s c C s t | ttf�s| g} t| ||�S )a�
Check that a value is a list, coercing strings into
a list with one member. Useful where users forget the
trailing comma that turns a single value into a list.
You can optionally specify the minimum and maximum number of members.
A minumum of greater than one will fail if the user only supplies a
string.
>>> vtor.check('force_list', ())
[]
>>> vtor.check('force_list', [])
[]
>>> vtor.check('force_list', 'hello')
['hello']
)r~ r@ rA r )r7 r� r� r! r! r# rD � s rD )r; r< r> r? r= c G s� y t | �}W n tk
r( t| ��Y nX |t |�k r@t| ��n|t |�krTt| ��ydd� t|| �D �S tk
r� } ztd|��W Y dd}~X nX dS )a�
Check that the value is a list.
Allow specifying the type of each member.
Work on lists of specific lengths.
You specify each member as a positional argument specifying type
Each type should be one of the following strings :
'integer', 'float', 'ip_addr', 'string', 'boolean'
So you can specify a list of two strings, followed by
two integers as :
mixed_list('string', 'string', 'integer', 'integer')
The length of the list must match the number of positional
arguments you supply.
>>> mix_str = "mixed_list('integer', 'float', 'ip_addr', 'string', 'boolean')"
>>> check_res = vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a', True))
>>> check_res == [1, 2.0, '1.2.3.4', 'a', True]
1
>>> check_res = vtor.check(mix_str, ('1', '2.0', '1.2.3.4', 'a', 'True'))
>>> check_res == [1, 2.0, '1.2.3.4', 'a', True]
1
>>> vtor.check(mix_str, ('b', 2.0, '1.2.3.4', 'a', True))
Traceback (most recent call last):
VdtTypeError: the value "b" is of the wrong type.
>>> vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a'))
Traceback (most recent call last):
VdtValueTooShortError: the value "(1, 2.0, '1.2.3.4', 'a')" is too short.
>>> vtor.check(mix_str, (1, 2.0, '1.2.3.4', 'a', 1, 'b'))
Traceback (most recent call last):
VdtValueTooLongError: the value "(1, 2.0, '1.2.3.4', 'a', 1, 'b')" is too long.
>>> vtor.check(mix_str, 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
>>> vtor.check('mixed_list("yoda")', ('a'))
Traceback (most recent call last):
VdtParamError: passed an incorrect value "KeyError('yoda',)" for parameter "'mixed_list'"
c S s g | ]\}}t | |��qS r! )�fun_dict)rV rl r& r! r! r# rX s z!is_mixed_list.<locals>.<listcomp>rB N)rq r� r r r r} r\ r )r7 rt Zlengthr� r! r! r# r � s +
c G s& t | t�st| ��| |kr"t| ��| S )a�
This check matches the value to any of a set of options.
>>> vtor.check('option("yoda", "jedi")', 'yoda')
'yoda'
>>> vtor.check('option("yoda", "jedi")', 'jed')
Traceback (most recent call last):
VdtValueError: the value "jed" is unacceptable.
>>> vtor.check('option("yoda", "jedi")', 0)
Traceback (most recent call last):
VdtTypeError: the value "0" is of the wrong type.
)r~ r r r )r7 Zoptionsr! r! r# r $ s
c O s
| ||fS )ag
A function that exists for test purposes.
>>> checks = [
... '3, 6, min=1, max=3, test=list(a, b, c)',
... '3',
... '3, 6',
... '3,',
... 'min=1, test="a b c"',
... 'min=5, test="a, b, c"',
... 'min=1, max=3, test="a, b, c"',
... 'min=-100, test=-99',
... 'min=1, max=3',
... '3, 6, test="36"',
... '3, 6, test="a, b, c"',
... '3, max=3, test=list("a", "b", "c")',
... '''3, max=3, test=list("'a'", 'b', "x=(c)")''',
... "test='x=fish(3)'",
... ]
>>> v = Validator({'test': _test})
>>> for entry in checks:
... pprint(v.check(('test(%s)' % entry), 3))
(3, ('3', '6'), {'max': '3', 'min': '1', 'test': ['a', 'b', 'c']})
(3, ('3',), {})
(3, ('3', '6'), {})
(3, ('3',), {})
(3, (), {'min': '1', 'test': 'a b c'})
(3, (), {'min': '5', 'test': 'a, b, c'})
(3, (), {'max': '3', 'min': '1', 'test': 'a, b, c'})
(3, (), {'min': '-100', 'test': '-99'})
(3, (), {'max': '3', 'min': '1'})
(3, ('3', '6'), {'test': '36'})
(3, ('3', '6'), {'test': 'a, b, c'})
(3, ('3',), {'max': '3', 'test': ['a', 'b', 'c']})
(3, ('3',), {'max': '3', 'test': ["'a'", 'b', 'x=(c)']})
(3, (), {'test': 'x=fish(3)'})
>>> v = Validator()
>>> v.check('integer(default=6)', '3')
3
>>> v.check('integer(default=6)', None, True)
6
>>> v.get_default_value('integer(default=6)')
6
>>> v.get_default_value('float(default=6)')
6.0
>>> v.get_default_value('pass(default=None)')
>>> v.get_default_value("string(default='None')")
'None'
>>> v.get_default_value('pass')
Traceback (most recent call last):
KeyError: 'Check "pass" has no default value.'
>>> v.get_default_value('pass(default=list(1, 2, 3, 4))')
['1', '2', '3', '4']
>>> v = Validator()
>>> v.check("pass(default=None)", None, True)
>>> v.check("pass(default='None')", None, True)
'None'
>>> v.check('pass(default="None")', None, True)
'None'
>>> v.check('pass(default=list(1, 2, 3, 4))', None, True)
['1', '2', '3', '4']
Bug test for unicode arguments
>>> v = Validator()
>>> v.check(unicode('string(min=4)'), unicode('test')) == unicode('test')
True
>>> v = Validator()
>>> v.get_default_value(unicode('string(min=4, default="1234")')) == unicode('1234')
True
>>> v.check(unicode('string(min=4, default="1234")'), unicode('test')) == unicode('test')
True
>>> v = Validator()
>>> default = v.get_default_value('string(default=None)')
>>> default == None
1
r! )r7 rt Zkeywargsr! r! r# �_test8 s Qr� c C s dS )z�
>>>
>>> v = Validator()
>>> v.get_default_value('string(default="#ff00dd")')
'#ff00dd'
>>> v.get_default_value('integer(default=3) # comment')
3
Nr! r! r! r! r# �_test2� s r� c C s dS )a�
>>> vtor.check('string(default="")', '', missing=True)
''
>>> vtor.check('string(default="\n")', '', missing=True)
'\n'
>>> print(vtor.check('string(default="\n")', '', missing=True))
<BLANKLINE>
<BLANKLINE>
>>> vtor.check('string()', '\n')
'\n'
>>> vtor.check('string(default="\n\n\n")', '', missing=True)
'\n\n\n'
>>> vtor.check('string()', 'random \n text goes here\n\n')
'random \n text goes here\n\n'
>>> vtor.check('string(default=" \nrandom text\ngoes \n here\n\n ")',
... '', missing=True)
' \nrandom text\ngoes \n here\n\n '
>>> vtor.check("string(default='\n\n\n')", '', missing=True)
'\n\n\n'
>>> vtor.check("option('\n','a','b',default='\n')", '', missing=True)
'\n'
>>> vtor.check("string_list()", ['foo', '\n', 'bar'])
['foo', '\n', 'bar']
>>> vtor.check("string_list(default=list('\n'))", '', missing=True)
['\n']
Nr! r! r! r! r# �_test3� s r� �__main__Zvtor)�globsZ optionflags) r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r )r )F)NN)NN)NN)NN)NN)NN)NN)NN)NN)NN)NN)Ir4 r �__all__rv �sysr � version_infoZ
basestringr rU Zunicoder| r. rw rz rx rg rr ry r{ r' � NameErrorr r � Exceptionr r
r r8 r r r r r
r r �objectr r� r r r� r r r r r r r r r r rD r� r r r� r� r� r1 Zdoctest�modules�get�m�__dict__�copyr� rG ZtestmodZIGNORE_EXCEPTION_DETAIL�ELLIPSISZfailuresZtestsr! r! r! r# �<module> s�
) 4
%
8
5
<%
-
"
$
9T
__pycache__/appdirs.cpython-36.opt-1.pyc 0000644 00000050253 14751155147 0014022 0 ustar 00 3
I�5]g` � @ s� d Z d4Zdjeee��ZddlZddlZejd dkZ e r>eZ
ej j d�r�ddl Z e j
� d d Zej d�rrd Zq�ej d
�r�d Zq�d Znej Zd5dd�Zd6dd�Zd7dd�Zd8dd�Zd9dd�Zd:dd�Zd;dd �ZG d d � d e�Zd d � Zd!d"� Zd#d$� Zd%d&� Z ed k�r�yddl Z eZ W nn e k
�r� ydd'l!m"Z" eZ W nB e k
�r� yddl#Z$e Z W n e k
�r� eZ Y nX Y nX Y nX e%d(k�r�d)Z&d*Z'd<Z(e)d+e � e)d,� ee&e'd-d.�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �q�W e)d0� ee&e'�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �qW e)d1� ee&�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �q:W e)d2� ee&d
d3�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �qtW dS )=zyUtilities for determining application-specific dirs.
See <http://github.com/ActiveState/appdirs> for details and usage.
� � � �.� N�javaZWindows�win32ZMac�darwinZlinux2Fc C s� t dkr^|dkr| }|r dp d}tjjt|��}| r�|dk rNtjj||| �}q�tjj|| �}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
aJ Return full path to the user-specific data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
Mac OS X: ~/Library/Application Support/<AppName>
Unix: ~/.local/share/<AppName> # or in $XDG_DATA_HOME, if defined
Win XP (not roaming): C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
Win XP (roaming): C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
Win 7 (not roaming): C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
Win 7 (roaming): C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
That means, by default "~/.local/share/<AppName>".
r N�
CSIDL_APPDATA�CSIDL_LOCAL_APPDATAFr z ~/Library/Application Support/Z
XDG_DATA_HOMEz~/.local/share)�system�os�path�normpath�_get_win_folder�join�
expanduser�getenv)�appname� appauthor�version�roaming�constr
� r � /usr/lib/python3.6/appdirs.py�
user_data_dir, s& r c s
t dkrR|dkr� }tjjtd��}� r�|dk rBtjj||� �}q�tjj|� �}n�t dkrztjjd�}� r�tjj|� �}nttjdtjjdd g��}d
d � |j tj�D �}� r�|r�tjj� |�� � fd d �|D �}|r�tjj|�}n|d
}|S � o�|�rtjj||�}|S )ai Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of data dirs should be
returned. By default, the first item from XDG_DATA_DIRS is
returned, or '/usr/local/share/<AppName>',
if XDG_DATA_DIRS is not set
Typical site data directories are:
Mac OS X: /Library/Application Support/<AppName>
Unix: /usr/local/share/<AppName> or /usr/share/<AppName>
Win XP: C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
Win 7: C:\ProgramData\<AppAuthor>\<AppName> # Hidden, but writeable on Win 7.
For Unix, this is using the $XDG_DATA_DIRS[0] default.
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r N�CSIDL_COMMON_APPDATAFr z /Library/Application SupportZ
XDG_DATA_DIRSz/usr/local/sharez
/usr/sharec S s g | ]}t jj|jt j���qS r )r r
r �rstrip�sep)�.0�xr r r �
<listcomp>� s z!site_data_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )
r r r
r r r r r �pathsep�split)r r r � multipathr
�pathlistr )r r �
site_data_dirc s4
r% c C sX t dkrt| |d|�}n&tjdtjjd��}| r>tjj|| �}| rT|rTtjj||�}|S )a� Return full path to the user-specific config dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user config directories are:
Mac OS X: same as user_data_dir
Unix: ~/.config/<AppName> # or in $XDG_CONFIG_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
That means, by default "~/.config/<AppName>".
r r NZXDG_CONFIG_HOMEz ~/.config)r r )r r r r r
r r )r r r r r
r r r �user_config_dir� s r& c s� t d kr*t� |�}� r�|r�tjj||�}ndtjdd�}dd� |jtj�D �}� rt|rbtjj� |�� � fdd�|D �}|r�tjj|�}n|d }|S )
a Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of config dirs should be
returned. By default, the first item from XDG_CONFIG_DIRS is
returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
Typical site config directories are:
Mac OS X: same as site_data_dir
Unix: /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
$XDG_CONFIG_DIRS
Win *: same as site_data_dir
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r r ZXDG_CONFIG_DIRSz/etc/xdgc S s g | ]}t jj|jt j���qS r )r r
r r r )r r r r r r � s z#site_config_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )r r )r r% r r
r r r" r! )r r r r# r
r$ r )r r �site_config_dir� s
r' Tc C s� t dkrd|dkr| }tjjtd��}| r�|dk rBtjj||| �}ntjj|| �}|r�tjj|d�}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
a Return full path to the user-specific cache dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Cache" to the base app data dir for Windows. See
discussion below.
Typical user cache directories are:
Mac OS X: ~/Library/Caches/<AppName>
Unix: ~/.cache/<AppName> (XDG default)
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
On Windows the only suggestion in the MSDN docs is that local settings go in
the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
app data dir (the default returned by `user_data_dir` above). Apps typically
put cache data somewhere *under* the given dir here. Some examples:
...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
...\Acme\SuperApp\Cache\1.0
OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
This can be disabled with the `opinion=False` option.
r Nr
FZCacher z~/Library/CachesZXDG_CACHE_HOMEz~/.cache)r r r
r r r r r )r r r �opinionr
r r r �user_cache_dir s( ! r) c C sX t dkrt| |d|�}n&tjdtjjd��}| r>tjj|| �}| rT|rTtjj||�}|S )a Return full path to the user-specific state dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user state directories are:
Mac OS X: same as user_data_dir
Unix: ~/.local/state/<AppName> # or in $XDG_STATE_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow this Debian proposal <https://wiki.debian.org/XDGBaseDirectorySpecification#state>
to extend the XDG spec and support $XDG_STATE_HOME.
That means, by default "~/.local/state/<AppName>".
r r NZXDG_STATE_HOMEz~/.local/state)r r )r r r r r
r r )r r r r r
r r r �user_state_dir9 s r* c C s� t dkr tjjtjjd�| �}nNt dkrLt| ||�}d}|rntjj|d�}n"t| ||�}d}|rntjj|d�}| r�|r�tjj||�}|S )a� Return full path to the user-specific log dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Logs" to the base app data dir for Windows, and "log" to the
base cache dir for Unix. See discussion below.
Typical user log directories are:
Mac OS X: ~/Library/Logs/<AppName>
Unix: ~/.cache/<AppName>/log # or under $XDG_CACHE_HOME if defined
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
On Windows the only suggestion in the MSDN docs is that local settings
go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
examples of what some windows apps use for a logs dir.)
OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
value for Windows and appends "log" to the user cache dir for Unix.
This can be disabled with the `opinion=False` option.
r z~/Library/Logsr FZLogs�log)r r r
r r r r) )r r r r( r
r r r � user_log_dirc s
r, c @ sn e Zd ZdZddd�Zedd� �Zedd � �Zed
d � �Zed d
� �Z edd� �Z
edd� �Z edd� �Z dS )�AppDirsz1Convenience wrapper for getting application dirs.NFc C s" || _ || _|| _|| _|| _d S )N)r r r r r# )�selfr r r r r# r r r �__init__� s
zAppDirs.__init__c C s t | j| j| j| jd�S )N)r r )r r r r r )r. r r r r � s
zAppDirs.user_data_dirc C s t | j| j| j| jd�S )N)r r# )r% r r r r# )r. r r r r% � s
zAppDirs.site_data_dirc C s t | j| j| j| jd�S )N)r r )r& r r r r )r. r r r r& � s
zAppDirs.user_config_dirc C s t | j| j| j| jd�S )N)r r# )r' r r r r# )r. r r r r' � s
zAppDirs.site_config_dirc C s t | j| j| jd�S )N)r )r) r r r )r. r r r r) � s
zAppDirs.user_cache_dirc C s t | j| j| jd�S )N)r )r* r r r )r. r r r r* � s
zAppDirs.user_state_dirc C s t | j| j| jd�S )N)r )r, r r r )r. r r r r, � s
zAppDirs.user_log_dir)NNNFF)
�__name__�
__module__� __qualname__�__doc__r/ �propertyr r% r& r' r) r* r, r r r r r- � s
r- c C sH t rddl}nddl}dddd�| }|j|jd�}|j||�\}}|S )z�This is a fallback technique at best. I'm not sure if using the
registry for this guarantees us the correct answer for all CSIDL_*
names.
r NZAppDatazCommon AppDataz
Local AppData)r r r
z@Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders)�PY3�winreg�_winreg�OpenKey�HKEY_CURRENT_USERZ QueryValueEx)�
csidl_namer7 Zshell_folder_name�key�dir�typer r r � _get_win_folder_from_registry� s
r> c C s� ddl m}m} |jdt|| �dd�}y`t|�}d}x |D ]}t|�dkr:d}P q:W |r�ydd l}|j|�}W n t k
r� Y nX W n t
k
r� Y nX |S )Nr )�shellcon�shellF� T) �win32com.shellr? r@ �SHGetFolderPath�getattr�unicode�ord�win32api�GetShortPathName� ImportError� UnicodeError)r: r? r@ r< �
has_high_char�crG r r r � _get_win_folder_with_pywin32� s$
rM c C s� dd l }dddd�| }|jd�}|jjjd |d d|� d}x |D ]}t|�dkrBd }P qBW |r�|jd�}|jjj|j|d�r�|}|jS )
Nr � �# � )r r r
i FrA T) �ctypesZcreate_unicode_buffer�windllZshell32ZSHGetFolderPathWrF Zkernel32ZGetShortPathNameW�value)r: rQ Z csidl_const�bufrK rL Zbuf2r r r �_get_win_folder_with_ctypes� s"
rU c C s� dd l }ddlm} ddlm} |jjd }|jd|�}|jj }|j
d t |j | �d |j j
|� |jj|j� �jd�}d}x |D ]} t| �dkr~d }P q~W |r�|jd|�}|jj }
|
j|||�r�|jj|j� �jd�}|S )
Nr )�jna)r � rL � FrA T)�arrayZcom.sunrV Zcom.sun.jna.platformr ZWinDefZMAX_PATHZzerosZShell32ZINSTANCErC rD ZShlObjZSHGFP_TYPE_CURRENTZNativeZtoStringZtostringr rF ZKernel32rH ) r: rY rV r Zbuf_sizerT r@ r< rK rL Zkernelr r r �_get_win_folder_with_jna s&
rZ )rR �__main__ZMyAppZ MyCompanyz-- app dirs %s --z%-- app dirs (with optional 'version')z1.0)r z%s: %sz)
-- app dirs (without optional 'version')z+
-- app dirs (without optional 'appauthor')z(
-- app dirs (with disabled 'appauthor'))r )r r r )NNNF)NNNF)NNNF)NNNF)NNNT)NNNF)NNNT)r r& r) r* r, r% r' )-r3 Z__version_info__r �map�str� __version__�sysr � version_infor5 rE �platform�
startswithZjava_verZos_namer r r% r& r' r) r* r, �objectr- r> rM rU rZ rB Zwin32comr rI rQ rR Z com.sun.jnaZcomr0 r r Zprops�print�dirsZproprD r r r r �<module> s�
7
B
(
3
9
*
30
__pycache__/six.cpython-36.opt-1.pyc 0000644 00000060674 14751155147 0013173 0 ustar 00 3
��s`�x � K @ s� d Z ddlmZ ddlZddlZddlZddlZddlZdZdZ ej
d dkZ ej
d dkZ ej
dd� �d�kZ
e r�efZefZefZeZeZejZn�efZeefZeejfZe ZeZej j d �r�e�d��ZnLG d d
� d
e �Z ye!e � � W n e"k
�r e�d��ZY n X e�d��Z[ dd� Z#dd� Z$G dd� de �Z%G dd� de%�Z&G dd� dej'�Z(G dd� de%�Z)G dd � d e �Z*e*e+�Z,G d d � d e(�Z-e)d d d d!�e)d"d#d$d%d"�e)d&d#d#d'd&�e)d(d)d$d*d(�e)d+d)d,�e)d-d#d$d.d-�e)d/d0d0d1d/�e)d2d0d0d/d2�e)d3d4d5�e)d6d)d$d7d6�e)d8d)e
�r&d9nd:d;�e)d<d)d=�e)d>d?d@dA�e)d!d!d �e)dBdBdC�e)dDdDdC�e)dEdEdC�e)d7d)d$d7d6�e)dFd#d$dGdF�e)dHd#d#dIdH�e&d$d)�e&dJdK�e&dLdM�e&dNdOdP�e&dQdRdQ�e&dSdTdU�e&dVdWdX�e&dYdZd[�e&d\d]d^�e&d_d`da�e&dbdcdd�e&dedfdg�e&dhdidj�e&dkdldm�e&dndodp�e&dqdqdr�e&dsdsdr�e&dtdtdr�e&dududv�e&dwdx�e&dydz�e&d{d|�e&d}d~d}�e&dd��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�e+d� d��e&d�e+d� d��e&d�e+d� e+d� �e&d�d�d��e&d�d�d��e&d�d�d��g@Z.ej d�k�rne.e&d�d��g7 Z.x:e.D ]2Z/e0e-e/j1e/� e2e/e&��rte,j3e/d�e/j1 � �qtW [/e.e-_.e-e+d� �Z4e,j3e4d�� G d�d�� d�e(�Z5e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)dAd�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d�d�dσe)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��gZ6x e6D ]Z/e0e5e/j1e/� �q�W [/e6e5_.e,j3e5e+d� �d�dۃ G d�d݄ d�e(�Z7e)d�d�d��e)d�d�d��e)d�d�d��gZ8x e8D ]Z/e0e7e/j1e/� �qPW [/e8e7_.e,j3e7e+d� �d�d� G d�d� d�e(�Z9e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)�d d�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�d d�d�e)�d
d�d�g#Z:x e:D ]Z/e0e9e/j1e/� �qW [/e:e9_.e,j3e9e+�d ��d �d
� G �d�d� �de(�Z;e)�dd��d�e)�dd��d�e)�dd��d�e)�dd��d�gZ<x e<D ]Z/e0e;e/j1e/� �q�W [/e<e;_.e,j3e;e+�d ��d�d� G �d�d� �de(�Z=e)�dd�d��gZ>x e>D ]Z/e0e=e/j1e/� � qW [/e>e=_.e,j3e=e+�d ��d �d � G �d �d � �d ej'�Z?e,j3e?e+d� ��d � �d!�d"� Z@�d#�d$� ZAe � r��d%ZB�d&ZC�d'ZD�d(ZE�d)ZF�d*ZGn$�d+ZB�d,ZC�d-ZD�d.ZE�d/ZF�d0ZGyeHZIW n" eJk
�
r �d1�d2� ZIY nX eIZHyeKZKW n" eJk
�
r< �d3�d4� ZKY nX e �
rh�d5�d6� ZLejMZN�d7�d8� ZOe ZPn>�d9�d6� ZL�d:�d;� ZN�d<�d8� ZOG �d=�d>� �d>e �ZPeKZKe#eL�d?� ejQeB�ZRejQeC�ZSejQeD�ZTejQeE�ZUejQeF�ZVejQeG�ZWe � rJ�d@�dA� ZX�dB�dC� ZY�dD�dE� ZZ�dF�dG� Z[ej\�dH�Z]ej\�dI�Z^ej\�dJ�Z_nT�dK�dA� ZX�dL�dC� ZY�dM�dE� ZZ�dN�dG� Z[ej\�dO�Z]ej\�dP�Z^ej\�dQ�Z_e#eX�dR� e#eY�dS� e#eZ�dT� e#e[�dU� e � rb�dV�dW� Z`�dX�dY� ZaebZcddldZdedje�dZ�jfZg[dejhd�ZiejjZkelZmddlnZnenjoZoenjpZp�d[Zqej
d
d
k� rT�d\Zr�d]Zsn �d^Zr�d_Zsnj�d`�dW� Z`�da�dY� ZaecZcebZg�db�dc� Zi�dd�de� Zkejtejuev�ZmddloZoeojo ZoZp�dfZq�d\Zr�d]Zse#e`�dg� e#ea�dh� �di�d[� Zw�dj�d^� Zx�dk�d_� Zye �
r.eze4j{�dl�Z|�d��dm�dn�Z}n�d��do�dp�Z|e|�dq� ej
dd� �d�k�
rje|�dr� n.ej
dd� �d�k�
r�e|�ds� n �dt�du� Z~eze4j{�dvd�Zedk�
r��dw�dx� Zej
dd� �d�k �
r�eZ��dy�dx� Ze#e}�dz� ej
dd� �d�k �r ej�ej�f�d{�d|�Z�nej�Z��d}�d~� Z��d�d�� Z��d��d�� Z�g Z�e+Z�e�� j��d��dk �rjg e�_�ej��r�x>e�ej��D ]0\Z�Z�ee��j+d k�r~e�j1e+k�r~ej�e�= P �q~W [�[�ej�j�e,� dS (� z6Utilities for writing code that runs on Python 2 and 3� )�absolute_importNz'Benjamin Peterson <benjamin@python.org>z1.11.0� � � �java� � c @ s e Zd Zdd� ZdS )�Xc C s dS )Nr r l � )�selfr
r
�/usr/lib/python3.6/six.py�__len__> s z X.__len__N)�__name__�
__module__� __qualname__r
r
r
r
r r < s r �? c C s
|| _ dS )z Add documentation to a function.N)�__doc__)�func�docr
r
r �_add_docK s r c C s t | � tj| S )z7Import module, returning the module after the last dot.)�
__import__�sys�modules)�namer
r
r �_import_moduleP s r c @ s e Zd Zdd� Zdd� ZdS )�
_LazyDescrc C s
|| _ d S )N)r )r r r
r
r �__init__X s z_LazyDescr.__init__c C sB | j � }t|| j|� yt|j| j� W n tk
r< Y nX |S )N)�_resolve�setattrr �delattr� __class__�AttributeError)r �obj�tp�resultr
r
r �__get__[ s z_LazyDescr.__get__N)r r r r r% r
r
r
r r V s r c s. e Zd Zd� fdd� Zdd� Zdd� Z� ZS ) � MovedModuleNc s2 t t| �j|� tr(|d kr |}|| _n|| _d S )N)�superr& r �PY3�mod)r r �old�new)r r
r r i s zMovedModule.__init__c C s
t | j�S )N)r r) )r r
r
r r r s zMovedModule._resolvec C s" | j � }t||�}t| ||� |S )N)r �getattrr )r �attr�_module�valuer
r
r � __getattr__u s
zMovedModule.__getattr__)N)r r r r r r0 �
__classcell__r
r
)r r r& g s r& c s( e Zd Z� fdd�Zdd� Zg Z� ZS )� _LazyModulec s t t| �j|� | jj| _d S )N)r' r2 r r r )r r )r r
r r ~ s z_LazyModule.__init__c C s ddg}|dd� | j D �7 }|S )Nr r c S s g | ]
}|j �qS r
)r )�.0r- r
r
r �
<listcomp>� s z'_LazyModule.__dir__.<locals>.<listcomp>)�_moved_attributes)r Zattrsr
r
r �__dir__� s z_LazyModule.__dir__)r r r r r6 r5 r1 r
r
)r r r2 | s r2 c s& e Zd Zd� fdd� Zdd� Z� ZS )�MovedAttributeNc sd t t| �j|� trH|d kr |}|| _|d kr@|d kr<|}n|}|| _n|| _|d krZ|}|| _d S )N)r' r7 r r( r) r- )r r Zold_modZnew_modZold_attrZnew_attr)r r
r r � s zMovedAttribute.__init__c C s t | j�}t|| j�S )N)r r) r, r- )r �moduler
r
r r � s
zMovedAttribute._resolve)NN)r r r r r r1 r
r
)r r r7 � s r7 c @ sV e Zd ZdZdd� Zdd� Zdd� Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z e Z dS )�_SixMetaPathImporterz�
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
c C s || _ i | _d S )N)r �
known_modules)r Zsix_module_namer
r
r r � s z _SixMetaPathImporter.__init__c G s& x |D ]}|| j | jd | < qW d S )N�.)r: r )r r) Z fullnames�fullnamer
r
r � _add_module� s
z _SixMetaPathImporter._add_modulec C s | j | jd | S )Nr; )r: r )r r< r
r
r � _get_module� s z _SixMetaPathImporter._get_moduleNc C s || j kr| S d S )N)r: )r r< �pathr
r
r � find_module� s
z _SixMetaPathImporter.find_modulec C s0 y
| j | S tk
r* td| ��Y nX d S )Nz!This loader does not know module )r: �KeyError� ImportError)r r< r
r
r Z __get_module� s
z!_SixMetaPathImporter.__get_modulec C sR y
t j| S tk
r Y nX | j|�}t|t�r>|j� }n| |_|t j|< |S )N)r r rA � _SixMetaPathImporter__get_module�
isinstancer& r �
__loader__)r r< r) r
r
r � load_module� s
z _SixMetaPathImporter.load_modulec C s t | j|�d�S )z�
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
�__path__)�hasattrrC )r r< r
r
r �
is_package� s z _SixMetaPathImporter.is_packagec C s | j |� dS )z;Return None
Required, if is_package is implementedN)rC )r r< r
r
r �get_code� s
z _SixMetaPathImporter.get_code)N)
r r r r r r= r> r@ rC rF rI rJ �
get_sourcer
r
r
r r9 � s
r9 c @ s e Zd ZdZg ZdS )� _MovedItemsz Lazy loading of moved objectsN)r r r r rG r
r
r
r rL � s rL Z cStringIO�io�StringIO�filter� itertools�builtinsZifilter� filterfalseZ ifilterfalse�inputZ __builtin__Z raw_input�internr �map�imap�getcwd�osZgetcwdu�getcwdbZ getoutputZcommands�
subprocess�rangeZxrangeZ
reload_module� importlibZimp�reload�reduce� functoolsZ shlex_quoteZpipesZshlexZquote�UserDict� collections�UserList�
UserString�zipZizip� zip_longestZ izip_longestZ configparserZ ConfigParser�copyregZcopy_regZdbm_gnuZgdbmzdbm.gnuZ
_dummy_threadZ dummy_threadZhttp_cookiejarZ cookielibzhttp.cookiejarZ http_cookiesZCookiez http.cookiesZ
html_entitiesZhtmlentitydefsz
html.entitiesZ html_parserZ
HTMLParserz html.parserZ http_clientZhttplibz http.clientZemail_mime_basezemail.MIMEBasezemail.mime.baseZemail_mime_imagezemail.MIMEImagezemail.mime.imageZemail_mime_multipartzemail.MIMEMultipartzemail.mime.multipartZemail_mime_nonmultipartzemail.MIMENonMultipartzemail.mime.nonmultipartZemail_mime_textzemail.MIMETextzemail.mime.textZBaseHTTPServerz http.serverZ
CGIHTTPServerZSimpleHTTPServerZcPickle�pickleZqueueZQueue�reprlib�reprZ socketserverZ SocketServer�_threadZthreadZtkinterZTkinterZtkinter_dialogZDialogztkinter.dialogZtkinter_filedialogZ
FileDialogztkinter.filedialogZtkinter_scrolledtextZ ScrolledTextztkinter.scrolledtextZtkinter_simpledialogZ SimpleDialogztkinter.simpledialogZ tkinter_tixZTixz tkinter.tixZ tkinter_ttkZttkz tkinter.ttkZtkinter_constantsZ Tkconstantsztkinter.constantsZ tkinter_dndZTkdndz tkinter.dndZtkinter_colorchooserZtkColorChooserztkinter.colorchooserZtkinter_commondialogZtkCommonDialogztkinter.commondialogZtkinter_tkfiledialogZ tkFileDialogZ tkinter_fontZtkFontz tkinter.fontZtkinter_messageboxZ tkMessageBoxztkinter.messageboxZtkinter_tksimpledialogZtkSimpleDialogZ urllib_parsez.moves.urllib_parsez urllib.parseZ urllib_errorz.moves.urllib_errorz urllib.errorZurllibz
.moves.urllibZurllib_robotparser� robotparserzurllib.robotparserZ
xmlrpc_clientZ xmlrpclibz
xmlrpc.clientZ
xmlrpc_serverZSimpleXMLRPCServerz
xmlrpc.serverZwin32�winreg�_winregzmoves.z.moves�movesc @ s e Zd ZdZdS )� Module_six_moves_urllib_parsez7Lazy loading of moved objects in six.moves.urllib_parseN)r r r r r
r
r
r ro B s ro Z ParseResultZurlparseZ SplitResultZparse_qsZ parse_qslZ urldefragZurljoinZurlsplitZ
urlunparseZ
urlunsplitZ
quote_plusZunquoteZ unquote_plusZunquote_to_bytesZ urlencodeZ
splitqueryZsplittagZ splituserZ
splitvalueZ
uses_fragmentZ uses_netlocZ uses_paramsZ
uses_queryZ
uses_relativezmoves.urllib_parsezmoves.urllib.parsec @ s e Zd ZdZdS )� Module_six_moves_urllib_errorz7Lazy loading of moved objects in six.moves.urllib_errorN)r r r r r
r
r
r rp l s rp ZURLErrorZurllib2Z HTTPErrorZContentTooShortErrorz.moves.urllib.errorzmoves.urllib_errorzmoves.urllib.errorc @ s e Zd ZdZdS )� Module_six_moves_urllib_requestz9Lazy loading of moved objects in six.moves.urllib_requestN)r r r r r
r
r
r rq � s rq Zurlopenzurllib.requestZinstall_openerZ build_openerZ pathname2urlZ url2pathnameZ
getproxiesZRequestZOpenerDirectorZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZ BaseHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZHTTPErrorProcessorZ urlretrieveZ
urlcleanupZ URLopenerZFancyURLopenerZ proxy_bypassZparse_http_listZparse_keqv_listz.moves.urllib.requestzmoves.urllib_requestzmoves.urllib.requestc @ s e Zd ZdZdS )� Module_six_moves_urllib_responsez:Lazy loading of moved objects in six.moves.urllib_responseN)r r r r r
r
r
r rr � s rr Zaddbasezurllib.responseZ addclosehookZaddinfoZ
addinfourlz.moves.urllib.responsezmoves.urllib_responsezmoves.urllib.responsec @ s e Zd ZdZdS )�#Module_six_moves_urllib_robotparserz=Lazy loading of moved objects in six.moves.urllib_robotparserN)r r r r r
r
r
r rs � s rs ZRobotFileParserz.moves.urllib.robotparserzmoves.urllib_robotparserzmoves.urllib.robotparserc @ sN e Zd ZdZg Zejd�Zejd�Zejd�Z ejd�Z
ejd�Z dd� Z d S )
�Module_six_moves_urllibzICreate a six.moves.urllib namespace that resembles the Python 3 namespacezmoves.urllib_parsezmoves.urllib_errorzmoves.urllib_requestzmoves.urllib_responsezmoves.urllib_robotparserc C s dddddgS )N�parse�error�request�responserk r
)r r
r
r r6 � s z Module_six_moves_urllib.__dir__N)
r r r r rG � _importerr> ru rv rw rx rk r6 r
r
r
r rt � s
rt z moves.urllibc C s t t| j| � dS )zAdd an item to six.moves.N)r rL r )Zmover
r
r �add_move� s rz c C sX yt t| � W nD tk
rR y tj| = W n" tk
rL td| f ��Y nX Y nX dS )zRemove item from six.moves.zno such move, %rN)r rL r! rn �__dict__rA )r r
r
r � remove_move� s r| �__func__�__self__� __closure__�__code__� __defaults__� __globals__�im_funcZim_selfZ func_closureZ func_codeZ
func_defaultsZ func_globalsc C s | j � S )N)�next)�itr
r
r �advance_iterator s r� c C s t dd� t| �jD ��S )Nc s s | ]}d |j kV qdS )�__call__N)r{ )r3 �klassr
r
r � <genexpr> s zcallable.<locals>.<genexpr>)�any�type�__mro__)r" r
r
r �callable s r� c C s | S )Nr
)�unboundr
r
r �get_unbound_function s r� c C s | S )Nr
)r �clsr
r
r �create_unbound_method# s r� c C s | j S )N)r� )r� r
r
r r� ( s c C s t j| ||j�S )N)�types�
MethodTyper )r r" r
r
r �create_bound_method+ s r� c C s t j| d |�S )N)r� r� )r r� r
r
r r� . s c @ s e Zd Zdd� ZdS )�Iteratorc C s t | �j| �S )N)r� �__next__)r r
r
r r� 3 s z
Iterator.nextN)r r r r� r
r
r
r r� 1 s r� z3Get the function out of a possibly unbound functionc K s t | jf |��S )N)�iter�keys)�d�kwr
r
r �iterkeysD s r� c K s t | jf |��S )N)r� �values)r� r� r
r
r �
itervaluesG s r� c K s t | jf |��S )N)r� �items)r� r� r
r
r � iteritemsJ s r� c K s t | jf |��S )N)r� Zlists)r� r� r
r
r � iterlistsM s r� r� r� r� c K s | j f |�S )N)r� )r� r� r
r
r r� V s c K s | j f |�S )N)r� )r� r� r
r
r r� Y s c K s | j f |�S )N)r� )r� r� r
r
r r� \ s c K s | j f |�S )N)r� )r� r� r
r
r r� _ s �viewkeys�
viewvalues� viewitemsz1Return an iterator over the keys of a dictionary.z3Return an iterator over the values of a dictionary.z?Return an iterator over the (key, value) pairs of a dictionary.zBReturn an iterator over the (key, [values]) pairs of a dictionary.c C s
| j d�S )Nzlatin-1)�encode)�sr
r
r �bq s r� c C s | S )Nr
)r� r
r
r �ut s r� z>B�assertCountEqualZassertRaisesRegexpZassertRegexpMatches�assertRaisesRegex� assertRegexc C s | S )Nr
)r� r
r
r r� � s c C s t | jdd�d�S )Nz\\z\\\\Zunicode_escape)�unicode�replace)r� r
r
r r� � s c C s t | d �S )Nr )�ord)Zbsr
r
r �byte2int� s r� c C s t | | �S )N)r� )Zbuf�ir
r
r �
indexbytes� s r� ZassertItemsEqualz Byte literalz Text literalc O s t | t�||�S )N)r, �_assertCountEqual)r �args�kwargsr
r
r r� � s c O s t | t�||�S )N)r, �_assertRaisesRegex)r r� r� r
r
r r� � s c O s t | t�||�S )N)r, � _assertRegex)r r� r� r
r
r r� � s �execc
C s: z*|d kr| � }|j |k r$|j|��|�W d d }d }X d S )N)�
__traceback__�with_traceback)r# r/ �tbr
r
r �reraise� s
r� c C sB |dkr*t jd�}|j}|dkr&|j}~n |dkr6|}td� dS )z Execute code in a namespace.Nr z exec _code_ in _globs_, _locs_)r � _getframe� f_globals�f_localsr� )Z_code_Z_globs_Z_locs_�framer
r
r �exec_� s
r� zedef reraise(tp, value, tb=None):
try:
raise tp, value, tb
finally:
tb = None
z�def raise_from(value, from_value):
try:
if from_value is None:
raise value
raise value from from_value
finally:
value = None
zrdef raise_from(value, from_value):
try:
raise value from from_value
finally:
value = None
c C s | �d S )Nr
)r/ Z
from_valuer
r
r �
raise_from� s r� �printc
s6 |j dtj�� � dkrdS � fdd�}d}|j dd�}|dk r`t|t�rNd}nt|t�s`td��|j d d�}|dk r�t|t�r�d}nt|t�s�td
��|r�td ��|s�x | D ]}t|t�r�d}P q�W |r�td �}td
�}nd }d
}|dkr�|}|dk� r�|}x,t| �D ] \} }| �r ||� ||� �qW ||� dS )z4The new-style print function for Python 2.4 and 2.5.�fileNc sd t | t�st| �} t � t�rVt | t�rV� jd k rVt� dd �}|d krHd}| j� j|�} � j| � d S )N�errors�strict) rD �
basestring�strr� r� �encodingr, r� �write)�datar� )�fpr
r r� � s
zprint_.<locals>.writeF�sepTz sep must be None or a string�endz end must be None or a stringz$invalid keyword arguments to print()�
� )�popr �stdoutrD r� r� � TypeError� enumerate)
r� r� r� Z want_unicoder� r� �arg�newlineZspacer� r
)r� r �print_� sL
r� c O s< |j dtj�}|jdd�}t| |� |r8|d k r8|j� d S )Nr� �flushF)�getr r� r� �_printr� )r� r� r� r� r
r
r r� s
zReraise an exception.c s � ��fdd�}|S )Nc s t j�� ��| �} �| _| S )N)r_ �wraps� __wrapped__)�f)�assigned�updated�wrappedr
r �wrapper* s zwraps.<locals>.wrapperr
)r� r� r� r� r
)r� r� r� r r� ( s r� c s& G � �fdd�dt �}t j|df i �S )z%Create a base class with a metaclass.c s, e Zd Z� �fdd�Ze� �fdd��ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )Nr
)r� r �
this_basesr� )�bases�metar
r �__new__: s z)with_metaclass.<locals>.metaclass.__new__c s �j |� �S )N)� __prepare__)r� r r� )r� r� r
r r� = s z-with_metaclass.<locals>.metaclass.__prepare__N)r r r r� � classmethodr� r
)r� r� r
r � metaclass8 s r� Ztemporary_class)r� r� )r� r� r� r
)r� r� r �with_metaclass3 s r� c s � fdd�}|S )z6Class decorator for creating a class with a metaclass.c sl | j j� }|jd�}|d k rDt|t�r,|g}x|D ]}|j|� q2W |jdd � |jdd � � | j| j|�S )N� __slots__r{ � __weakref__)r{ �copyr� rD r� r� r � __bases__)r� Z orig_vars�slotsZ slots_var)r� r
r r� E s
z add_metaclass.<locals>.wrapperr
)r� r� r
)r� r �
add_metaclassC s r� c C s2 t r.d| jkr td| j ��| j| _dd� | _| S )a
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
�__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().c S s | j � jd�S )Nzutf-8)� __unicode__r� )r r
r
r �<lambda>a s z-python_2_unicode_compatible.<locals>.<lambda>)�PY2r{ �
ValueErrorr r� r� )r� r
r
r �python_2_unicode_compatibleS s
r� �__spec__)r r l i���l i���l l ���� )N)NN)r r )r r )r r )r r )�r Z
__future__r r_ rP �operatorr r� �
__author__� __version__� version_infor� r( ZPY34r� Z string_types�intZ
integer_typesr� Z class_typesZ text_type�bytesZ binary_type�maxsizeZMAXSIZEr� ZlongZ ClassTyper� �platform�
startswith�objectr �len�
OverflowErrorr r r r& �
ModuleTyper2 r7 r9 r ry rL r5 r- r r rD r= rn ro Z _urllib_parse_moved_attributesrp Z _urllib_error_moved_attributesrq Z _urllib_request_moved_attributesrr Z!_urllib_response_moved_attributesrs Z$_urllib_robotparser_moved_attributesrt rz r| Z
_meth_funcZ
_meth_selfZ
_func_closureZ
_func_codeZ_func_defaultsZ
_func_globalsr� r� � NameErrorr� r� r� r� r� r� �
attrgetterZget_method_functionZget_method_selfZget_function_closureZget_function_codeZget_function_defaultsZget_function_globalsr� r� r� r� � methodcallerr� r� r� r� r� �chrZunichr�struct�Struct�packZint2byte�
itemgetterr� �getitemr� r� Z iterbytesrM rN �BytesIOr� r� r� �partialrV r� r� r� r� r, rQ r� r� r� r� r� �WRAPPER_ASSIGNMENTS�WRAPPER_UPDATESr� r� r� r� rG � __package__�globalsr� r� �submodule_search_locations� meta_pathr� r� Zimporter�appendr
r
r
r �<module> s�
>
5 __pycache__/appdirs.cpython-36.pyc 0000644 00000050253 14751155147 0013063 0 ustar 00 3
I�5]g` � @ s� d Z d4Zdjeee��ZddlZddlZejd dkZ e r>eZ
ej j d�r�ddl Z e j
� d d Zej d�rrd Zq�ej d
�r�d Zq�d Znej Zd5dd�Zd6dd�Zd7dd�Zd8dd�Zd9dd�Zd:dd�Zd;dd �ZG d d � d e�Zd d � Zd!d"� Zd#d$� Zd%d&� Z ed k�r�yddl Z eZ W nn e k
�r� ydd'l!m"Z" eZ W nB e k
�r� yddl#Z$e Z W n e k
�r� eZ Y nX Y nX Y nX e%d(k�r�d)Z&d*Z'd<Z(e)d+e � e)d,� ee&e'd-d.�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �q�W e)d0� ee&e'�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �qW e)d1� ee&�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �q:W e)d2� ee&d
d3�Z*x$e(D ] Z+e)d/e+e,e*e+�f � �qtW dS )=zyUtilities for determining application-specific dirs.
See <http://github.com/ActiveState/appdirs> for details and usage.
� � � �.� N�javaZWindows�win32ZMac�darwinZlinux2Fc C s� t dkr^|dkr| }|r dp d}tjjt|��}| r�|dk rNtjj||| �}q�tjj|| �}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
aJ Return full path to the user-specific data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
Mac OS X: ~/Library/Application Support/<AppName>
Unix: ~/.local/share/<AppName> # or in $XDG_DATA_HOME, if defined
Win XP (not roaming): C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
Win XP (roaming): C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
Win 7 (not roaming): C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
Win 7 (roaming): C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
That means, by default "~/.local/share/<AppName>".
r N�
CSIDL_APPDATA�CSIDL_LOCAL_APPDATAFr z ~/Library/Application Support/Z
XDG_DATA_HOMEz~/.local/share)�system�os�path�normpath�_get_win_folder�join�
expanduser�getenv)�appname� appauthor�version�roaming�constr
� r � /usr/lib/python3.6/appdirs.py�
user_data_dir, s& r c s
t dkrR|dkr� }tjjtd��}� r�|dk rBtjj||� �}q�tjj|� �}n�t dkrztjjd�}� r�tjj|� �}nttjdtjjdd g��}d
d � |j tj�D �}� r�|r�tjj� |�� � fd d �|D �}|r�tjj|�}n|d
}|S � o�|�rtjj||�}|S )ai Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of data dirs should be
returned. By default, the first item from XDG_DATA_DIRS is
returned, or '/usr/local/share/<AppName>',
if XDG_DATA_DIRS is not set
Typical site data directories are:
Mac OS X: /Library/Application Support/<AppName>
Unix: /usr/local/share/<AppName> or /usr/share/<AppName>
Win XP: C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
Win 7: C:\ProgramData\<AppAuthor>\<AppName> # Hidden, but writeable on Win 7.
For Unix, this is using the $XDG_DATA_DIRS[0] default.
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r N�CSIDL_COMMON_APPDATAFr z /Library/Application SupportZ
XDG_DATA_DIRSz/usr/local/sharez
/usr/sharec S s g | ]}t jj|jt j���qS r )r r
r �rstrip�sep)�.0�xr r r �
<listcomp>� s z!site_data_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )
r r r
r r r r r �pathsep�split)r r r � multipathr
�pathlistr )r r �
site_data_dirc s4
r% c C sX t dkrt| |d|�}n&tjdtjjd��}| r>tjj|| �}| rT|rTtjj||�}|S )a� Return full path to the user-specific config dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user config directories are:
Mac OS X: same as user_data_dir
Unix: ~/.config/<AppName> # or in $XDG_CONFIG_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
That means, by default "~/.config/<AppName>".
r r NZXDG_CONFIG_HOMEz ~/.config)r r )r r r r r
r r )r r r r r
r r r �user_config_dir� s r& c s� t d kr*t� |�}� r�|r�tjj||�}ndtjdd�}dd� |jtj�D �}� rt|rbtjj� |�� � fdd�|D �}|r�tjj|�}n|d }|S )
a Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of config dirs should be
returned. By default, the first item from XDG_CONFIG_DIRS is
returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
Typical site config directories are:
Mac OS X: same as site_data_dir
Unix: /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
$XDG_CONFIG_DIRS
Win *: same as site_data_dir
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r r ZXDG_CONFIG_DIRSz/etc/xdgc S s g | ]}t jj|jt j���qS r )r r
r r r )r r r r r r � s z#site_config_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )r r )r r% r r
r r r" r! )r r r r# r
r$ r )r r �site_config_dir� s
r' Tc C s� t dkrd|dkr| }tjjtd��}| r�|dk rBtjj||| �}ntjj|| �}|r�tjj|d�}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
a Return full path to the user-specific cache dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Cache" to the base app data dir for Windows. See
discussion below.
Typical user cache directories are:
Mac OS X: ~/Library/Caches/<AppName>
Unix: ~/.cache/<AppName> (XDG default)
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
On Windows the only suggestion in the MSDN docs is that local settings go in
the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
app data dir (the default returned by `user_data_dir` above). Apps typically
put cache data somewhere *under* the given dir here. Some examples:
...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
...\Acme\SuperApp\Cache\1.0
OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
This can be disabled with the `opinion=False` option.
r Nr
FZCacher z~/Library/CachesZXDG_CACHE_HOMEz~/.cache)r r r
r r r r r )r r r �opinionr
r r r �user_cache_dir s( ! r) c C sX t dkrt| |d|�}n&tjdtjjd��}| r>tjj|| �}| rT|rTtjj||�}|S )a Return full path to the user-specific state dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user state directories are:
Mac OS X: same as user_data_dir
Unix: ~/.local/state/<AppName> # or in $XDG_STATE_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow this Debian proposal <https://wiki.debian.org/XDGBaseDirectorySpecification#state>
to extend the XDG spec and support $XDG_STATE_HOME.
That means, by default "~/.local/state/<AppName>".
r r NZXDG_STATE_HOMEz~/.local/state)r r )r r r r r
r r )r r r r r
r r r �user_state_dir9 s r* c C s� t dkr tjjtjjd�| �}nNt dkrLt| ||�}d}|rntjj|d�}n"t| ||�}d}|rntjj|d�}| r�|r�tjj||�}|S )a� Return full path to the user-specific log dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Logs" to the base app data dir for Windows, and "log" to the
base cache dir for Unix. See discussion below.
Typical user log directories are:
Mac OS X: ~/Library/Logs/<AppName>
Unix: ~/.cache/<AppName>/log # or under $XDG_CACHE_HOME if defined
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
On Windows the only suggestion in the MSDN docs is that local settings
go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
examples of what some windows apps use for a logs dir.)
OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
value for Windows and appends "log" to the user cache dir for Unix.
This can be disabled with the `opinion=False` option.
r z~/Library/Logsr FZLogs�log)r r r
r r r r) )r r r r( r
r r r � user_log_dirc s
r, c @ sn e Zd ZdZddd�Zedd� �Zedd � �Zed
d � �Zed d
� �Z edd� �Z
edd� �Z edd� �Z dS )�AppDirsz1Convenience wrapper for getting application dirs.NFc C s" || _ || _|| _|| _|| _d S )N)r r r r r# )�selfr r r r r# r r r �__init__� s
zAppDirs.__init__c C s t | j| j| j| jd�S )N)r r )r r r r r )r. r r r r � s
zAppDirs.user_data_dirc C s t | j| j| j| jd�S )N)r r# )r% r r r r# )r. r r r r% � s
zAppDirs.site_data_dirc C s t | j| j| j| jd�S )N)r r )r& r r r r )r. r r r r& � s
zAppDirs.user_config_dirc C s t | j| j| j| jd�S )N)r r# )r' r r r r# )r. r r r r' � s
zAppDirs.site_config_dirc C s t | j| j| jd�S )N)r )r) r r r )r. r r r r) � s
zAppDirs.user_cache_dirc C s t | j| j| jd�S )N)r )r* r r r )r. r r r r* � s
zAppDirs.user_state_dirc C s t | j| j| jd�S )N)r )r, r r r )r. r r r r, � s
zAppDirs.user_log_dir)NNNFF)
�__name__�
__module__� __qualname__�__doc__r/ �propertyr r% r& r' r) r* r, r r r r r- � s
r- c C sH t rddl}nddl}dddd�| }|j|jd�}|j||�\}}|S )z�This is a fallback technique at best. I'm not sure if using the
registry for this guarantees us the correct answer for all CSIDL_*
names.
r NZAppDatazCommon AppDataz
Local AppData)r r r
z@Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders)�PY3�winreg�_winreg�OpenKey�HKEY_CURRENT_USERZ QueryValueEx)�
csidl_namer7 Zshell_folder_name�key�dir�typer r r � _get_win_folder_from_registry� s
r> c C s� ddl m}m} |jdt|| �dd�}y`t|�}d}x |D ]}t|�dkr:d}P q:W |r�ydd l}|j|�}W n t k
r� Y nX W n t
k
r� Y nX |S )Nr )�shellcon�shellF� T) �win32com.shellr? r@ �SHGetFolderPath�getattr�unicode�ord�win32api�GetShortPathName� ImportError� UnicodeError)r: r? r@ r< �
has_high_char�crG r r r � _get_win_folder_with_pywin32� s$
rM c C s� dd l }dddd�| }|jd�}|jjjd |d d|� d}x |D ]}t|�dkrBd }P qBW |r�|jd�}|jjj|j|d�r�|}|jS )
Nr � �# � )r r r
i FrA T) �ctypesZcreate_unicode_buffer�windllZshell32ZSHGetFolderPathWrF Zkernel32ZGetShortPathNameW�value)r: rQ Z csidl_const�bufrK rL Zbuf2r r r �_get_win_folder_with_ctypes� s"
rU c C s� dd l }ddlm} ddlm} |jjd }|jd|�}|jj }|j
d t |j | �d |j j
|� |jj|j� �jd�}d}x |D ]} t| �dkr~d }P q~W |r�|jd|�}|jj }
|
j|||�r�|jj|j� �jd�}|S )
Nr )�jna)r � rL � FrA T)�arrayZcom.sunrV Zcom.sun.jna.platformr ZWinDefZMAX_PATHZzerosZShell32ZINSTANCErC rD ZShlObjZSHGFP_TYPE_CURRENTZNativeZtoStringZtostringr rF ZKernel32rH ) r: rY rV r Zbuf_sizerT r@ r< rK rL Zkernelr r r �_get_win_folder_with_jna s&
rZ )rR �__main__ZMyAppZ MyCompanyz-- app dirs %s --z%-- app dirs (with optional 'version')z1.0)r z%s: %sz)
-- app dirs (without optional 'version')z+
-- app dirs (without optional 'appauthor')z(
-- app dirs (with disabled 'appauthor'))r )r r r )NNNF)NNNF)NNNF)NNNF)NNNT)NNNF)NNNT)r r& r) r* r, r% r' )-r3 Z__version_info__r �map�str� __version__�sysr � version_infor5 rE �platform�
startswithZjava_verZos_namer r r% r& r' r) r* r, �objectr- r> rM rU rZ rB Zwin32comr rI rQ rR Z com.sun.jnaZcomr0 r r Zprops�print�dirsZproprD r r r r �<module> s�
7
B
(
3
9
*
30
__pycache__/seobject.cpython-36.opt-1.pyc 0000644 00000251644 14751155147 0014165 0 ustar 00 3
�� f�� � @ s2 d dl Z d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dlT dZ d dl
Z
d dl Z d dl Z y:d dl
Z
i ZejdRk r�ded< e
je fddd �e�� W nJ yd dlZeejd
< W n& ek
r� d dlZeejd
< Y nX Y nX d dlZi Zeed < eed < eed
< eed< eed< eed< eed< eed< eed< e ed< e ed< e ed< e ed< e ed< e ed< e ed< e ed< e ed < e ed < e ed < e ed < e ed < e ed!< e ed"< d
ddddd d d d#�Z!d$d$d%d&d'd(d)d*dd+� Z"y(d dl#Z#e#j$e#j%� � G d,d-� d-�Z&W n( e'efk
�r4 G d.d-� d-�Z&Y nX G d/d0� d0�Z(d1d2� Z)dSd4d5�Z*dTd6d7�Z+G d8d9� d9�Z,G d:d;� d;e,�Z-G d<d=� d=e,�Z.G d>d?� d?e,�Z/G d@dA� dAe,�Z0G dBdC� dCe,�Z1G dDdE� dEe,�Z2G dFdG� dGe,�Z3G dHdI� dIe,�Z4G dJdK� dKe,�Z5G dLdM� dMe,�Z6G dNdO� dOe,�Z7G dPdQ� dQe,�Z8dS )U� N)�*zselinux-python� T�unicodez/usr/share/localezutf-8)Z localedirZcodeset�_� z all files�az regular filez--�fz-d� directory�dz-czcharacter device�cz-bz block device�bz-s�socket�sz-l�lz
symbolic link�pz-pz
named pipe)z all filesz regular filer zcharacter devicez block devicer
z
symbolic linkz
named pipe�any�block�char�dir�file�symlink�pipe) r r r r r
r r r r c @ s8 e Zd Zdd� Zd
dd�Zddd�Zdd � Zd
d � Zd S )�loggerc C s t j� | _g | _g | _d S )N)�audit�
audit_open�audit_fd�log_list�log_change_list)�self� r � /usr/lib/python3.6/seobject.py�__init__l s
zlogger.__init__r c
C s� d} ||kr || d 7 }d} ||kr4|| d 7 }d} ||krL|| d 7 }d} | j j| jtjtjd t|�|d||||||dddg� d S )N�-�sename�,�role�ranger r )r �appendr r ZAUDIT_ROLE_ASSIGN�sys�argv�str)
r �msg�namer# �serole�serange� oldsename� oldserole�
oldserange�sepr r r �logq s z
logger.logc C s< | j j| jtjtjd t|�|d||||||dddg� d S )Nr r )r r' r r ZAUDIT_ROLE_REMOVEr( r) r* ) r r+ r, r# r- r. r/ r0 r1 r r r �
log_remove� s zlogger.log_removec C s& | j j| jtjt|�ddddg� d S )N�semanager )r r' r r Z AUDIT_USER_MAC_CONFIG_CHANGEr* )r r+ r r r �
log_change� s zlogger.log_changec C sP x | j D ]}tj||g � qW x | jD ]}tj||g � q(W g | _ g | _d S )N)r r Zaudit_log_semanage_messager Zaudit_log_user_comm_message)r �successr r r r �commit� s z
logger.commitN)r r r r r r r )r r r r r r r )�__name__�
__module__� __qualname__r! r3 r4 r6 r8 r r r r r j s
r c @ s8 e Zd Zdd� Zd
dd�Zddd�Zdd � Zd
d � Zd S )r c C s
g | _ d S )N)r )r r r r r! � s zlogger.__init__r c
C s� d||f } |dkr | d| 7 } |dkr4| d| 7 } |dkrH| d| 7 } |dkr\| d| 7 } |dkrx|d k rx| d| 7 } |dkr�|d k r�| d| 7 } | j j| � d S ) Nz %s name=%sr z sename=z oldsename=z role=z
old_role=z
MLSRange=z old_MLSRange=)r r' )
r r+ r, r# r- r. r/ r0 r1 �messager r r r3 � s z
logger.logc C s | j ||||||||� d S )N)r3 ) r r+ r, r# r- r. r/ r0 r1 r r r r4 � s zlogger.log_removec C s | j jd| � d S )Nz %s)r r' )r r+ r r r r6 � s zlogger.log_changec C s8 |dkrd}nd}x | j D ]}tjtj|| � qW d S )N� z Successful: zFailed: )r �syslogZLOG_INFO)r r7 r< r r r r r8 � s
z
logger.commitN)r r r r r r r )r r r r r r r )r9 r: r; r! r3 r4 r6 r8 r r r r r � s
c @ s0 e Zd Zd dd�Zd dd�Zdd� Zdd � Zd
S )
�
nullloggerr c C s d S )Nr ) r r+ r, r# r- r. r/ r0 r1 r r r r3 � s znulllogger.logc C s d S )Nr ) r r+ r, r# r- r. r/ r0 r1 r r r r4 � s znulllogger.log_removec C s d S )Nr )r r+ r r r r6 � s znulllogger.log_changec C s d S )Nr )r r7 r r r r8 � s znulllogger.commitN)r r r r r r r )r r r r r r r )r9 r: r; r3 r4 r6 r8 r r r r r? � s
r? c C sX d}d}|d | d }|d | d }|d | d d | d }t jd | d
| �S ) Nzs[0-9]*zc[0-9]*z(\.z)?z(\,z)*z(-z(:�^�$)�re�search)�rawZ sensitivity�categoryZ cat_rangeZ
categoriesZregr r r �validate_level� s rF r= c C s` d}|dkrd|| f }n| }t j|�\}}|dkr8| S |rL|t|�d � }|dkrX| S |S d S )Nza:b:c:r= z%s%sr r )�selinuxZ selinux_raw_to_trans_context�len)rD �prepend�filler�context�rc�transr r r � translate� s rN c C s` d}|dkrd|| f }n| }t j|�\}}|dkr8| S |rL|t|�d � }|dkrX| S |S d S )Nza:b:c:r= z%s%sr r )rG Z selinux_trans_to_raw_contextrH )rM rI rJ rK rL rD r r r � untranslate� s rO c @ sf e Zd ZdZdZdZdZddd�Zdd� Zdd� Z d d
� Z
d d � Z d
d� Z dd� Z
dd� Zdd� ZdS )�semanageRecordsFNc C s� |r t |�tkr|| _n|| _t|dd�| _| js@t|dd�| _| j| j�| _tj � \}}| jdksn| j|krxt
� | _ n,t j
| j� tjdtj� | jf � t� | _ d S )N�noreloadF�storer z%s%s)�typer* rR �args�getattrrQ �
get_handle�shrG �selinux_getpolicytyper �mylog�sepolicyZload_store_policyZselinux_set_policy_rootZ selinux_pathr? )r rT rL Z
localstorer r r r! � s
zsemanageRecords.__init__c C s | | _ d S )N)rQ )r �loadr r r �
set_reload
s zsemanageRecords.set_reloadc C s� t jr t jS t� }|s"ttd���t j rD|dkrDt||t� |t _t |�s`t
|� ttd���t |�}|t k r�t
|� ttd���t
|�}|dk r�t
|� ttd���t|�atdk r�t
|� ttd���|t _t jS )Nz Could not create semanage handler z:SELinux policy is not managed or store cannot be accessed.zCannot read policy store.r z'Could not establish semanage connectionz!Could not test MLS enabled status)rP �handleZsemanage_handle_create�
ValueErrorr � transactionZsemanage_select_storeZSEMANAGE_CON_DIRECTrR Zsemanage_is_managedZsemanage_handle_destroyZsemanage_access_checkZSEMANAGE_CAN_READZsemanage_connectZsemanage_mls_enabled�is_mls_enabled)r rR r] rL r r r rV
s2 zsemanageRecords.get_handlec C s t td���d S )NzNot yet implemented)r^ r )r r r r � deleteall1 s zsemanageRecords.deleteallc C s$ t jrttd���| j� dt _d S )Nz(Semanage transaction already in progressT)rP r_ r^ r �begin)r r r r �start4 s zsemanageRecords.startc C s, t jr
d S t| j�}|dk r(ttd���d S )Nr z$Could not start semanage transaction)rP r_ Zsemanage_begin_transactionrW r^ r )r rL r r r rb : s
zsemanageRecords.beginc C s t td���d S )NzNot yet implemented)r^ r )r r r r �
customizedA s zsemanageRecords.customizedc C sV t jr
d S | jr t| jd� t| j�}|dk rF| jjd� tt d���| jjd� d S )Nr z%Could not commit semanage transactionr= )
rP r_ rQ Zsemanage_set_reloadrW Zsemanage_commitrY r8 r^ r )r rL r r r r8 D s
zsemanageRecords.commitc C s$ t jsttd���dt _| j� d S )Nz$Semanage transaction not in progressF)rP r_ r^ r r8 )r r r r �finishP s zsemanageRecords.finish)N)r9 r: r; r_ r] rR rT r! r\ rV ra rc rb rd r8 re r r r r rP � s
$ rP c @ sP e Zd Zddd�Zdd� Zdd� Zdd
d �Zd d
� Zdd� Zdd� Z dd� Z
dS )�
moduleRecordsNc C s t j| |� d S )N)rP r! )r rT r r r r! Y s zmoduleRecords.__init__c C s g }t | j�\}}}|dk r(ttd���x�t|�D ]�}t||�}t| j|�\}}|dk rdttd���t| j|�\}}|dk r�ttd���t| j|�\}} |dk r�ttd���t | j|�\}}
|dk r�ttd���|j
||| |
f� q2W |j dd� d d
� |j d d� d � |S )
Nr z Could not list SELinux moduleszCould not get module namez Could not get module enabledz Could not get module priorityz Could not get module lang_extc S s | d S )Nr r )�tr r r �<lambda>x s z'moduleRecords.get_all.<locals>.<lambda>T)�key�reversec S s | d S )Nr r )rg r r r rh y s )ri ) Zsemanage_module_list_allrW r^ r r& �semanage_module_list_nthZ semanage_module_info_get_nameZ semanage_module_info_get_enabledZ!semanage_module_info_get_priorityZ!semanage_module_info_get_lang_extr' �sort) r r rL �mlist�number�i�modr, Zenabled�priorityZlang_extr r r �get_all\ s,
zmoduleRecords.get_allc C s0 | j � }t|�dkrg S dd� dd� |D �D �S )Nr c S s g | ]}d |d �qS )z-d %sr r )�.0�xr r r �
<listcomp>� s z,moduleRecords.customized.<locals>.<listcomp>c S s g | ]}|d dkr|�qS )r= r r )rs rg r r r ru � s )rr rH )r �allr r r rd | s zmoduleRecords.customizedr= r c C s� | j � }t|�dkrd S |r:tdtd�td�td�f � xL|D ]D}|d dkrZtd�}n
|r`q@d}td |d |d
|d |f � q@W d S ) Nr z
%-25s %-9s %s
z Module NameZPriorityZLanguager= ZDisabledr z%-25s %-9s %-5s %s� r )rr rH �printr )r �heading� locallistrv rg Zdisabledr r r �list� s
zmoduleRecords.listc C s` t jj|�s ttd�| ��t| j|�}|dk r@ttd�| ��t| j|�}|dkr\| j� d S )NzModule does not exist: %s r z3Invalid priority %d (needs to be between 1 and 999)) �os�path�existsr^ r � semanage_set_default_priorityrW Z semanage_module_install_filer8 )r r rq rL r r r �add� s zmoduleRecords.addc C s� x�|j � D ]�}t| j�\}}|dk r0ttd���t| j||�}|dk rRttd���t| j||�}|dk r
|r~ttd�| ��q
ttd�| ��q
W | j� d S )Nr zCould not create module keyz Could not set module key namezCould not enable module %szCould not disable module %s)�splitZsemanage_module_key_createrW r^ r Z semanage_module_key_set_nameZsemanage_module_set_enabledr8 )r �module�enable�mrL ri r r r � set_enabled� s zmoduleRecords.set_enabledc C sn t | j|�}|dk r$ttd�| ��x<|j� D ]0}t| j|�}|dk r.|dkr.ttd�| ��q.W | j� d S )Nr z3Invalid priority %d (needs to be between 1 and 999)rw z*Could not remove module %s (remove failed)���)r rW r^ r r� �semanage_module_remover8 )r r� rq rL r� r r r �delete� s zmoduleRecords.deletec C s: dd� dd� | j � D �D �}x|D ]}| j|d� q"W d S )Nc S s g | ] }|d �qS )r r )rs rt r r r ru � s z+moduleRecords.deleteall.<locals>.<listcomp>c S s g | ]}|d dkr|�qS )r= r r )rs rg r r r ru � s T)rr r� )r r r� r r r ra � s
zmoduleRecords.deleteall)N)r= r ) r9 r: r; r! rr rd r{ r� r� r� ra r r r r rf W s
rf c @ s e Zd Zddd�Zdd� ZdS )�dontauditClassNc C s t j| |� d S )N)rP r! )r rT r r r r! � s zdontauditClass.__init__c C s8 |dkrt td���| j� t| j|dk� | j� d S )N�on�offz'dontaudit requires either 'on' or 'off')r� r� )r^ r rb Z semanage_set_disable_dontauditrW r8 )r Z dontauditr r r �toggle� s
zdontauditClass.toggle)N)r9 r: r; r! r� r r r r r� � s
r� c @ sH e Zd Zddd�Zdd� Zdd� Zdd
d �Zd d
� Zdd� Zdd� Z dS )�permissiveRecordsNc C s t j| |� d S )N)rP r! )r rT r r r r! � s zpermissiveRecords.__init__c C sr g }t | j�\}}}|dk r(ttd���xDt|�D ]8}t||�}t|�}|r2|jd�r2|j|j d�d � q2W |S )Nr z Could not list SELinux modulesZ permissive_r= )
Zsemanage_module_listrW r^ r r& rk Zsemanage_module_get_name�
startswithr' r� )r r rL rm rn ro rp r, r r r rr � s
zpermissiveRecords.get_allc C s dd� t | j� �D �S )Nc S s g | ] }d | �qS )z-a %sr )rs rt r r r ru � s z0permissiveRecords.customized.<locals>.<listcomp>)�sortedrr )r r r r rd � s z permissiveRecords.customizedr= r c C s� dd� dd� t jt j�D �D �}t|�dkr0d S |rDtdtd� � | j� }x |D ]}||krRt|� qRW t|�dkrzd S |r�tdtd� � x|D ] }t|� q�W d S )Nc S s g | ] }|d �qS )r, r )rs �yr r r ru � s z*permissiveRecords.list.<locals>.<listcomp>c S s g | ]}|d r|�qS )Z
permissiver )rs rt r r r ru � s r z
%-25s
zBuiltin Permissive TypeszCustomized Permissive Types)rZ �infoZTYPErH rx r rr )r ry rz rv rd rg r r r r{ � s
zpermissiveRecords.listc C s� ydd l j}W n tk
r. ttd���Y nX d| }d| }t| j|t|�|d�}|dkrf| j� |dk r~ttd�| ��d S )Nr z�The sepolgen python module is required to setup permissive domains.
In some distributions it is included in the policycoreutils-devel package.
# yum install policycoreutils-devel
Or similar for your distro.z
permissive_%sz(typepermissive %s)Zcilz?Could not set permissive domain %s (module installation failed)) Zsepolgen.moduler� � ImportErrorr^ r Zsemanage_module_installrW rH r8 )r rS r� r, ZmodtxtrL r r r r� � s zpermissiveRecords.addc C sF x8|j � D ],}t| jd| �}|dk r
ttd�| ��q
W | j� d S )Nz
permissive_%sr z5Could not remove permissive domain %s (remove failed))r� r� rW r^ r r8 )r r, �nrL r r r r� s
zpermissiveRecords.deletec C s, | j � }t|�dkr(dj|�}| j|� d S )Nr � )rr rH �joinr� )r r rv r r r ra s
zpermissiveRecords.deleteall)N)r= r )
r9 r: r; r! rr rd r{ r� r� ra r r r r r� � s
r� c @ s~ e Zd Zd dd�Zdd� Zdd� Zdd � Zd d d �Zd!d
d�Zdd� Z dd� Z
dd� Z dd� Z d"dd�Z
dd� Zd#d d �ZdS )$� loginRecordsNc C s( t j| |� d | _d | _d | _d | _d S )N)rP r! r/ r1 r# r. )r rT r r r r! s
zloginRecords.__init__c C s� t j|�\}| _| _|dkr d}t| j�}|j| j�\}\}}|j|�\}\}} tdkrn|dkrjt|�}n|}t | j
|�\}}
|dk r�t t d�| ��|d dkr�yt
j|dd � � W n$ t t d�|dd � ��Y nX n,ytj|� W n t t d�| ��Y nX t| j
�\}} |dk �r4t t d �| ��t| j
| |�}|dk �r\t t d
�| ��tdk�r�|dk�r�t| j
| |�}|dk �r�t t d �| ��t| j
| |�}|dk �r�t t d �| ��t| j
|
| �}|dk �r�t t d
�| ��t|
� t| � d S )Nr Zuser_ur= r z Could not create a key for %s�%z Linux Group %s does not existz Linux User %s does not existz%Could not create login mapping for %szCould not set name for %sz Could not set MLS range for %sz!Could not set SELinux user for %sz"Could not add login mapping for %s)rG �getseuserbynamer/ r1 �seluserRecordsrT �getr` rO �semanage_seuser_key_createrW r^ r �grpZgetgrnam�pwd�getpwnamZsemanage_seuser_createZsemanage_seuser_set_name� semanage_seuser_set_mlsrange�semanage_seuser_set_sename� semanage_seuser_modify_local�semanage_seuser_key_free�semanage_seuser_free) r r, r# r. �rec�userrecr& rL r0 r- �k�ur r r �__add sP
zloginRecords.__addc C sx yL| j � | j|�r4ttd�| � | j|||� n| j|||� | j� W n& tk
rr } z
|�W Y d d }~X nX d S )Nz:Login mapping for %s is already defined, modifying instead)rb �_loginRecords__existsrx r �_loginRecords__modify�_loginRecords__addr8 r^ )r r, r# r. �errorr r r r� V s
zloginRecords.addc C s\ t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t|� |S )Nr z Could not create a key for %sz2Could not check if login mapping for %s is defined)r� rW r^ r �semanage_seuser_existsr� )r r, rL r� r~ r r r �__existsd s zloginRecords.__existsr c
C s� t j|�\}| _| _|dkr0|dkr0ttd���t| j�}|j| j�\}\}}|dkrj|j|�\}\}} n|} |dkr~|| _ n|| _ t
| j |�\}}
|dk r�ttd�| ��t | j |
�\}} |dk r�ttd�| ��| s�ttd�| ��t
| j |
�\}} |dk �rttd�| ��t| �| _t| �| _tdk�rL|dk�rLt| j | t|�� |dk�rlt| j | |� || _n| j| _t| j |
| �}|dk �r�ttd �| ��t|
� t| � d S )
Nr zRequires seuser or seranger z Could not create a key for %sz2Could not check if login mapping for %s is definedz#Login mapping for %s is not definedz Could not query seuser for %sr= z%Could not modify login mapping for %s)rG r� r/ r1 r^ r r� rT r� r. r� rW r� Zsemanage_seuser_query� semanage_seuser_get_mlsrange�semanage_seuser_get_senamer` r� rO r� r# r� r� r� )
r r, r# r. r� r� r& rL r0 r- r� r~ r� r r r �__modifyp sF
zloginRecords.__modifyc C sN y"| j � | j|||� | j� W n& tk
rH } z
|�W Y d d }~X nX d S )N)rb r� r8 r^ )r r, r# r. r� r r r �modify� s zloginRecords.modifyc
C s* t j|�\}| _| _t| j�}|j| j�\}\}}t| j|�\}}|dk rZt t
d�| ��t | j|�\}}|dk r�t t
d�| ��|s�t t
d�| ��t | j|�\}}|dk r�t t
d�| ��|s�t t
d�| ��t
| j|�}|dk r�t t
d�| ��t|� t jd�\}| _| _|j| j�\}\}} d S )Nr z Could not create a key for %sz2Could not check if login mapping for %s is definedz#Login mapping for %s is not definedz<Login mapping for %s is defined in policy, cannot be deletedz%Could not delete login mapping for %sZ __default__)rG r� r/ r1 r� rT r� r� rW r^ r r� Z semanage_seuser_exists_localZsemanage_seuser_del_localr� r# r. )
r r, r� r� r& rL r0 r� r~ r- r r r �__delete� s,
zloginRecords.__deletec C sJ y | j � | j|� | j� W n& tk
rD } z
|�W Y d d }~X nX d S )N)rb �_loginRecords__deleter8 r^ )r r, r� r r r r� � s
zloginRecords.deletec C s~ t | j�\}}|dk r"ttd���y0| j� x|D ]}| jt|�� q2W | j� W n& tk
rx } z
|�W Y d d }~X nX d S )Nr z Could not list login mappings)�semanage_seuser_list_localrW r^ r rb r� �semanage_seuser_get_namer8 )r rL �ulistr� r� r r r ra � s
zloginRecords.deleteallc
C s� i }t j� d | _x�tj| j�D ]�\}}}|| jkr xj|D ]b}yHt|d | �}|j� j� jd�}|j � |d |d |d f||< W q: t
k
r� Y q:X q:W q W |S )Nz/logins�/�:r= rw r ) rG Zselinux_policy_root� logins_pathr| �walk�open�read�rstripr� �close�
IndexError)r �ddictr} �dirs�filesr, �fdr� r r r �get_all_logins� s
zloginRecords.get_all_loginsr c C sp i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x,| jD ]"}t|�}t|�t|�df||< qFW |S )Nr z Could not list login mappingsr ) r� rW r� Zsemanage_seuser_listr^ r r� r� r� )r rz r� rL r� r, r r r rr � s zloginRecords.get_allc C st g }| j d�}x`t|j� �D ]P}|| d rR|jd|| d || d |f � q |jd|| d |f � q W |S )NTr= z-a -s %s -r '%s' %sr z -a -s %s %s)rr r� �keysr' )r r r� r� r r r rd � s
& zloginRecords.customizedr= c C sN | j |�}| j� }t|j� �}t|j� �}t|�dkrFt|�dkrFd S tdk�r|rxtdtd�td�td�td�f � x8|D ]0}|| }td||d t|d �|d f � q~W t|�r�td
| j � x�|D ]0}|| }td||d t|d �|d f � q�W nF|�r"td td�td�f � x&|D ] }td ||| d f � �q(W d S )
Nr r= z
%-20s %-20s %-20s %s
z
Login Namez SELinux Userz
MLS/MCS RangeZServicez%-20s %-20s %-20s %srw z
Local customization in %sz
%-25s %-25s
z %-25s %-25s)
rr r� r� r� rH r` rx r rN r� ) r ry rz r� ZldictZlkeysr� r� r� r r r r{ s*
$
(
*
zloginRecords.list)N)r r )r r )r )r= r )r9 r: r; r! r� r� r� r� r� r� r� ra r� rr rd r{ r r r r r� s
6
2
r� c @ s� e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � Zg d d d fd
d�Zg d d d fdd�Z dd� Z
dd� Z dd� Z d dd�Z
dd� Zd!d d �ZdS )"r� Nc C s t j| |� d S )N)rP r! )r rT r r r r! " s zseluserRecords.__init__c C s� t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t| j|�\}}|dk rxttd�| ��t|�}t| j|�}t|� t |� ||fS )Nr z Could not create a key for %sz-Could not check if SELinux user %s is definedzCould not query user for %s)
�semanage_user_key_createrW r^ r �semanage_user_exists�semanage_user_query�semanage_user_get_mlsrange�semanage_user_get_roles�semanage_user_key_free�semanage_user_free)r r, rL r� r~ r� r. r- r r r r� % s zseluserRecords.getc C s t dkr4|dkrd}nt|�}|dkr,d}nt|�}t|�dk rPttd�| ��t| j|�\}}|dk rxttd�| ��t| j�\}}|dk r�ttd�| ��t| j||�}|dk r�ttd�| ��x6|D ].} t | j|| �}|dk r�ttd �| |f ��q�W t dk�rVt
| j||�}|dk �r.ttd
�| ��t | j||�}|dk �rVttd �| ��t | j||�}|dk �r�ttd �| |f ��t
| j|�\}}
|dk �r�ttd
�| ��t| j||�}|dk �r�ttd�| ��t|� t|� | jjd|dj|�|d� d S )Nr= r �s0z%You must add at least one role for %sr z Could not create a key for %sz$Could not create SELinux user for %szCould not set name for %sz Could not add role %s for %sz Could not set MLS range for %sz Could not set MLS level for %sz Could not add prefix %s for %sz Could not extract key for %sz Could not add SELinux user %s�seuserr$ )r# r- r. )r` rO rH r^ r r� rW Zsemanage_user_createZsemanage_user_set_name�semanage_user_add_role�semanage_user_set_mlsrange�semanage_user_set_mlslevel�semanage_user_set_prefixZsemanage_user_key_extract�semanage_user_modify_localr� r� rY r3 r� ) r r, �roles�selevelr. �prefixrL r� r� �rri r r r r� 5 sR
zseluserRecords.__addc C s� yT| j � | j|�r8ttd�| � | j|||||� n| j|||||� | j� W n2 tk
r� } z| jjd� |�W Y d d }~X nX d S )Nz5SELinux user %s is already defined, modifying insteadr ) rb �_seluserRecords__existsrx r �_seluserRecords__modify�_seluserRecords__addr8 r^ rY )r r, r� r� r. r� r� r r r r� l s
zseluserRecords.addc C s\ t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t|� |S )Nr z Could not create a key for %sz-Could not check if SELinux user %s is defined)r� rW r^ r r� r� )r r, rL r� r~ r r r r� y s zseluserRecords.__existsr c C s@ d}d}dj |�}|dkrXt|�dkrX|dkrX|dkrXtdkrLttd���n ttd���t| j|�\} }
| dk r�ttd�| ��t| j|
�\} } | dk r�ttd�| ��| s�ttd �| ��t| j|
�\} } | dk r�ttd
�| ��t | �}t
| j| �\} }
| dk�rdj |
�}tdk�r6|dk�r6t | j| t |�� tdk�r\|dk�r\t
| j| t |�� |dk�rtt| j| |� t|�dk�r�x"|
D ]}||k�r�t| |� �q�W x&|D ] }||
k�r�t| j| |� �q�W t| j|
| �} | dk �r�ttd �| ��t|
� t| � d j |j� �}d j |j� �}| jjd
||||||d� d S )Nr r� r r= z&Requires prefix, roles, level or rangezRequires prefix or rolesz Could not create a key for %sz-Could not check if SELinux user %s is definedz SELinux user %s is not definedzCould not query user for %sz Could not modify SELinux user %sr$ r� )r# r/ r- r. r0 r1 )r� rH r` r^ r r� rW r� r� r� r� r� rO r� r� Zsemanage_user_del_roler� r� r� r� r� rY r3 )r r, r� r� r. r� r0 r1 ZnewrolesrL r� r~ r� �rlistr� r% r r r r� � sV
$
zseluserRecords.__modifyc C s^ y&| j � | j|||||� | j� W n2 tk
rX } z| jjd� |�W Y d d }~X nX d S )Nr )rb r� r8 r^ rY )r r, r� r� r. r� r� r r r r� � s zseluserRecords.modifyc C s8 t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��|sdttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�\}}|dk r�ttd�| ��t|�}t| j|�\}}dj |�}t
| j|�}|dk �rttd�| ��t |� t |� | j
jd |||d
� d S ) Nr z Could not create a key for %sz-Could not check if SELinux user %s is definedz SELinux user %s is not definedz7SELinux user %s is defined in policy, cannot be deletedzCould not query user for %sr$ z Could not delete SELinux user %sr� )r/ r1 r0 )r� rW r^ r r� Zsemanage_user_exists_localr� r� r� r� Zsemanage_user_del_localr� r� rY r4 ) r r, rL r� r~ r� r1 r� r0 r r r r� � s2
zseluserRecords.__deletec C sV y | j � | j|� | j� W n2 tk
rP } z| jjd� |�W Y d d }~X nX d S )Nr )rb �_seluserRecords__deleter8 r^ rY )r r, r� r r r r� � s
zseluserRecords.deletec C s� t | j�\}}|dk r"ttd���y0| j� x|D ]}| jt|�� q2W | j� W n2 tk
r� } z| jjd� |�W Y d d }~X nX d S )Nr z Could not list login mappings) �semanage_user_list_localrW r^ r rb r� �semanage_user_get_namer8 rY )r rL r� r� r� r r r ra � s
zseluserRecords.deleteallr c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xh| jD ]^}t|�}t| j|�\}}|dk rzttd�| ��dj|�}t |�t
|�t |�|f|t|�< qFW |S )Nr z Could not list SELinux usersz Could not list roles for user %sr� ) r� rW r� Zsemanage_user_listr^ r r� r� r� Zsemanage_user_get_prefixZsemanage_user_get_mlslevelr� )r rz r� rL r� r, r� r� r r r rr � s
$zseluserRecords.get_allc C s� g }| j d�}xvt|j� �D ]f}|| d s8|| d rh|jd|| d || d || d |f � q |jd|| d |f � q W |S )NTr= rw z-a -L %s -r %s -R '%s' %sr z
-a -R '%s' %s)rr r� r� r' )r r r� r� r r r rd s
0 zseluserRecords.customizedr= c C s | j |�}t|�dkrd S t|j� �}tdkr�|r|tddtd�td�td�f � tdtd�td �td
�td �td �f � x�|D ]B}td
||| d t|| d �t|| d �|| d f � q�W nB|r�tdtd�td �f � x$|D ] }td||| d f � q�W d S )Nr r= z
%-15s %-10s %-10s %-30sr ZLabelingzMLS/z%-15s %-10s %-10s %-30s %s
z SELinux UserZPrefixz MCS Levelz MCS Rangez
SELinux Rolesz%-15s %-10s %-10s %-30s %srw r z %-15s %s
z%-15s %s)rr rH r� r� r` rx r rN )r ry rz r� r� r� r r r r{ s
*
D
zseluserRecords.list)N)r )r= r )r9 r: r; r! r� r� r� r� r� r� r� r� ra rr rd r{ r r r r r� s
7
8 !
r� c @ s� e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d!dd�Zd"dd�Zdd � Zd#d d �ZdS )$� portRecordsNc C sJ t j| |� y$tttjtjd��d d �| _W n tk
rD Y nX d S )NZ port_typer �types)rP r! r{ rZ r� � ATTRIBUTE� valid_types� RuntimeError)r rT r r r r! 4 s
$zportRecords.__init__c
C s� t tttd�}||j� kr$|| }n ttd���|dkrDttd���|jd�}t|�dkrlt |d � }}nt |d �}t |d �}|dkr�ttd ���t
| j |||�\}} |dk r�ttd
�||f ��| |||fS ) N)ZtcpZudpZsctpZdccpz0Protocol has to be one of udp, tcp, dccp or sctpr zPort is requiredr" r= r i�� z Invalid Portz Could not create a key for %s/%s) ZSEMANAGE_PROTO_TCPZSEMANAGE_PROTO_UDPZSEMANAGE_PROTO_SCTPZSEMANAGE_PROTO_DCCPr� r^ r r� rH �intZsemanage_port_key_createrW )
r �port�protoZ protocols�proto_dZports�high�lowrL r� r r r �__genkey; s(
zportRecords.__genkeyc C s, t dkr |dkrd}nt|�}|dkr2ttd���tj|�}|| jkrVttd�| ��| j||�\}}}}t| j �\} }
| dk r�ttd�||f ��t
|
|� t |
||� t | j �\} } | dk r�ttd�||f ��t
| j | d �} | dk r�ttd
�||f ��t| j | d �} | dk �r*ttd �||f ��t| j | |�} | dk �rVttd
�||f ��t dk�r�|dk�r�t| j | |�} | dk �r�ttd�||f ��t| j |
| �} | dk �r�ttd�||f ��t| j ||
�} | dk �r�ttd�||f ��t| � t|� t|
� | jjd|tj|�d d ||f � d S )Nr= r r� zType is requiredz'Type %s is invalid, must be a port typer z Could not create port for %s/%sz"Could not create context for %s/%s�system_uz,Could not set user in port context for %s/%s�object_rz,Could not set role in port context for %s/%sz,Could not set type in port context for %s/%sz2Could not set mls fields in port context for %s/%sz$Could not set port context for %s/%szCould not add port %s/%sz8resrc=port op=add lport=%s proto=%s tcontext=%s:%s:%s:%s)r` rO r^ r rZ �get_real_type_namer� �_portRecords__genkeyZsemanage_port_createrW Zsemanage_port_set_protoZsemanage_port_set_range�semanage_context_create�semanage_context_set_user�semanage_context_set_role�semanage_context_set_type�semanage_context_set_mlsZsemanage_port_set_con�semanage_port_modify_local�semanage_context_free�semanage_port_key_free�semanage_port_freerY r6 r
�getprotobyname) r r� r� r. rS r� r� r� r� rL r �conr r r r� W sR
zportRecords.__addc C sX | j � | j||�r<ttd�j||d�� | j||||� n| j||||� | j� d S )Nz6Port {proto}/{port} already defined, modifying instead)r� r� )rb �_portRecords__existsrx r �format�_portRecords__modify�_portRecords__addr8 )r r� r� r. rS r r r r� � s zportRecords.addc C sN | j ||�\}}}}t| j|�\}}|dk rBttd�j||d���t|� |S )Nr z1Could not check if port {proto}/{port} is defined)r� r� )r� �semanage_port_existsrW r^ r r� r� ) r r� r� r� r� r� r� rL r~ r r r r� � s zportRecords.__existsc
C s� |dkr2|dkr2t dkr&ttd���n ttd���tj|�}|rZ|| jkrZttd�| ��| j||�\}}}}t| j|�\} }
| dk r�ttd�||f ��|
s�ttd�||f ��t | j|�\} } | dk r�ttd �||f ��t
| �} t dk�r|dk�r d
}nt | j| t |�� |dk�r*t
| j| |� t| j|| �} | dk �rVttd �||f ��t|� t| � | jjd |tj|�d
d||f � d S )Nr r= zRequires setype or serangezRequires setypez'Type %s is invalid, must be a port typer z(Could not check if port %s/%s is definedzPort %s/%s is not definedzCould not query port %s/%sr� zCould not modify port %s/%sz;resrc=port op=modify lport=%s proto=%s tcontext=%s:%s:%s:%sr� r� )r` r^ r rZ r� r� r� r� rW Zsemanage_port_query�semanage_port_get_conr� rO r� r� r� r� rY r6 r
r� )
r r� r� r. �setyper� r� r� r� rL r~ r r� r r r r� � s:
zportRecords.__modifyc C s$ | j � | j||||� | j� d S )N)rb r� r8 )r r� r� r. r r r r r� � s zportRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]�}t|�}t|�}t|�}t|�}d||f }| j ||�\} }
}}|dk r�ttd�| ��t
| j| �}|dk r�ttd�| ��t | � ||kr�|}| j j
d|tj|�f � q0W | j� d S )Nr zCould not list the portsz%s-%sz Could not create a key for %sz Could not delete the port %sz&resrc=port op=delete lport=%s proto=%s)�semanage_port_list_localrW r^ r rb �semanage_port_get_proto�semanage_port_get_proto_str�semanage_port_get_low�semanage_port_get_highr� �semanage_port_del_localr� rY r6 r
r� r8 ) r rL �plistr� r� � proto_strr� r� Zport_strr� r� r r r ra � s*
zportRecords.deleteallc C s� | j ||�\}}}}t| j|�\}}|dk r@ttd�||f ��|sXttd�||f ��t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t| j|�}|dk r�ttd�||f ��t|� | jj d|t
j |�f � d S )Nr z(Could not check if port %s/%s is definedzPort %s/%s is not definedz2Port %s/%s is defined in policy, cannot be deletedzCould not delete port %s/%sz&resrc=port op=delete lport=%s proto=%s) r� r� rW r^ r Zsemanage_port_exists_localr r� rY r6 r
r� ) r r� r� r� r� r� r� rL r~ r r r r� � s zportRecords.__deletec C s | j � | j||� | j� d S )N)rb �_portRecords__deleter8 )r r� r� r r r r� s zportRecords.deleter c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xX| jD ]N}t|�}t|�}t|�}t |�}t
|�} t |�}
t |�} ||f||
| | f< qFW |S )Nr zCould not list ports)
r rW r �semanage_port_listr^ r r �semanage_context_get_type�semanage_context_get_mlsr r r r ) r rz r� rL r� r� �ctype�levelr� r r� r� r r r rr s zportRecords.get_allc C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x�| jD ]�}t|�}t|�}t|�}t |�}t
|�} t |�}
||f|j � kr�g |||f< | |
kr�|||f j
d| � qF|||f j
d| |
f � qFW |S )Nr zCould not list portsz%dz%d-%d)r rW r r r^ r r r r r r r r� r' ) r rz r� rL r� r� r r� r r� r� r r r �get_all_by_type s& zportRecords.get_all_by_typec C s� g }| j d�}x�t|j� �D ]�}|d |d kr8|d nd|d |d f }|| d r�|jd|| d || d |d |f � q |jd|| d |d |f � q W |S )NTr r= z%s-%sz-a -t %s -r '%s' -p %s %srw z-a -t %s -p %s %s)rr r� r� r' )r r r� r� r� r r r rd 8 s
, ,$zportRecords.customizedr= c C s� | j |�}t|�dkrd S t|j� �}|rHtdtd�td�td�f � xV|D ]N}d| }|d|| d 7 }x$|| dd � D ]}|d | 7 }q�W t|� qNW d S )
Nr z%-30s %-8s %s
zSELinux Port TypeZProtoz Port Numberz %-30s %-8s z%sr= z, %s)r rH r� r� rx r )r ry rz r� r� ro r� r r r r r{ C s
zportRecords.list)N)r )r )r= r )r9 r: r; r� r! r� r� r� r� r� r� ra r
r� rr r rd r{ r r r r r� 0 s
:
*
r� c @ s� e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d!dd�Zd"dd�Zdd � Zd#d d �ZdS )$�
ibpkeyRecordsNc
C sX t j| |� y:tjtjtj| j��dgd�}tdd� |j � D ��| _
W n Y nX d S )NZ ibpkey_type)�attrsc s s | ]}t |�V qd S )N)r* )rs rg r r r � <genexpr>Z s z)ibpkeyRecords.__init__.<locals>.<genexpr>) rP r! �setools� TypeQuery�
SELinuxPolicyrZ �get_store_policyrR r� �resultsr� )r rT �qr r r r! V s zibpkeyRecords.__init__c C s� |dkrt td���|jd�}t|�dkr>t|d d� }}n t|d d�}t|d d�}|dkrnt td���t| j|||�\}}|dk r�t td�||f ��||||fS ) Nr zSubnet Prefix is requiredr" r= r i�� z Invalid Pkeyz Could not create a key for %s/%s)r^ r r� rH r� Zsemanage_ibpkey_key_createrW )r �pkey�
subnet_prefixZpkeysr� r� rL r� r r r r� ^ s
zibpkeyRecords.__genkeyc C s t dkr |dkrd}nt|�}|dkr2ttd���tj|�}|| jkrVttd�| ��| j||�\}}}}t| j �\}} |dk r�ttd�||f ��t
| j | |� t | ||� t | j �\}}
|dk r�ttd�||f ��t
| j |
d �}|dk �rttd
�||f ��t| j |
d �}|dk �r0ttd �||f ��t| j |
|�}|dk �r\ttd
�||f ��t dk�r�|dk�r�t| j |
|�}|dk �r�ttd�||f ��t| j | |
�}|dk �r�ttd�||f ��t| j || �}|dk �r�ttd�||f ��t|
� t|� t| � d S )Nr= r r� zType is requiredz)Type %s is invalid, must be a ibpkey typer z!Could not create ibpkey for %s/%sz"Could not create context for %s/%sr� z.Could not set user in ibpkey context for %s/%sr� z.Could not set role in ibpkey context for %s/%sz.Could not set type in ibpkey context for %s/%sz4Could not set mls fields in ibpkey context for %s/%sz&Could not set ibpkey context for %s/%szCould not add ibpkey %s/%s)r` rO r^ r rZ r� r� �_ibpkeyRecords__genkeyZsemanage_ibpkey_createrW Z!semanage_ibpkey_set_subnet_prefixZsemanage_ibpkey_set_ranger� r� r� r� r� Zsemanage_ibpkey_set_con� semanage_ibpkey_modify_localr� �semanage_ibpkey_key_free�semanage_ibpkey_free) r r r r. rS r� r� r� rL r r� r r r r� q sP
zibpkeyRecords.__addc C sX | j � | j||�r<ttd�j||d�� | j||||� n| j||||� | j� d S )Nz@ibpkey {subnet_prefix}/{pkey} already defined, modifying instead)r r )rb �_ibpkeyRecords__existsrx r r� �_ibpkeyRecords__modify�_ibpkeyRecords__addr8 )r r r r. rS r r r r� � s zibpkeyRecords.addc C sN | j ||�\}}}}t| j|�\}}|dk rBttd�j||d���t|� |S )Nr z;Could not check if ibpkey {subnet_prefix}/{pkey} is defined)r r )r �semanage_ibpkey_existsrW r^ r Zformnatr )r r r r� r� r� rL r~ r r r r� � s zibpkeyRecords.__existsc C sb |dkr2|dkr2t dkr&ttd���n ttd���tj|�}|rZ|| jkrZttd�| ��| j||�\}}}}t| j|�\}} |dk r�ttd�||f ��| s�ttd�||f ��t | j|�\}}
|dk r�ttd �||f ��t
|
�} t dko�|dk�r
t | j| t |�� |dk�r"t
| j| |� t| j||
�}|dk �rNttd
�||f ��t|� t|
� d S ) Nr r= zRequires setype or serangezRequires setypez)Type %s is invalid, must be a ibpkey typer z*Could not check if ibpkey %s/%s is definedzibpkey %s/%s is not definedz Could not query ibpkey %s/%sz Could not modify ibpkey %s/%s)r` r^ r rZ r� r� r r# rW Zsemanage_ibpkey_query�semanage_ibpkey_get_conr� rO r� r r r ) r r r r. r r� r� r� rL r~ r r� r r r r� � s4
zibpkeyRecords.__modifyc C s$ | j � | j||||� | j� d S )N)rb r! r8 )r r r r. r r r r r� � s zibpkeyRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]�}t| j|�\}}t|�}t|�}d||f }| j||�\}}}}|dk r�ttd�| ��t | j|�}|dk r�ttd�| ��t
|� q0W | j � d S )Nr zCould not list the ibpkeysz%s-%sz Could not create a key for %sz Could not delete the ibpkey %s) �semanage_ibpkey_list_localrW r^ r rb �!semanage_ibpkey_get_subnet_prefix�semanage_ibpkey_get_low�semanage_ibpkey_get_highr �semanage_ibpkey_del_localr r8 ) r rL r �ibpkeyr r� r� Zpkey_strr� r r r ra � s"
zibpkeyRecords.deleteallc C s� | j ||�\}}}}t| j|�\}}|dk r@ttd�||f ��|sXttd�||f ��t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t| j|�}|dk r�ttd�||f ��t|� d S )Nr z*Could not check if ibpkey %s/%s is definedzibpkey %s/%s is not definedz4ibpkey %s/%s is defined in policy, cannot be deletedz Could not delete ibpkey %s/%s)r r# rW r^ r Z semanage_ibpkey_exists_localr) r )r r r r� r� r� rL r~ r r r r� � s zibpkeyRecords.__deletec C s | j � | j||� | j� d S )N)rb �_ibpkeyRecords__deleter8 )r r r r r r r� s zibpkeyRecords.deleter c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xb| jD ]X}t|�}t|�}|dkrdqFt|�}t | j|�\}}t
|�} t |�}
||f|| |
|f< qFW |S )Nr zCould not list ibpkeysZreserved_ibpkey_t) r% rW r �semanage_ibpkey_listr^ r r$ r r
r& r' r( ) r rz r� rL r* r� r r r r� r� r r r rr s" zibpkeyRecords.get_allc
C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x�| jD ]�}t|�}t|�}t| j|�\}}t |�}t
|�} ||f|j � kr�g |||f< || kr�|||f j d| � qF|||f j d|| f � qFW |S )Nr zCould not list ibpkeysz0x%xz 0x%x-0x%x)
r% rW r r, r^ r r$ r r& r' r( r� r' )
r rz r� rL r* r� r r r� r� r r r r , s$ z ibpkeyRecords.get_all_by_typec C s� g }| j d�}x�t|j� �D ]�}|d |d kr8|d nd|d |d f }|| d r�|jd|| d || d |d |f � q |jd|| d |d |f � q W |S )NTr r= z%s-%sz-a -t %s -r '%s' -x %s %srw z-a -t %s -x %s %s)rr r� r� r' )r r r� r� r� r r r rd C s
, ,$zibpkeyRecords.customizedr= c C s� | j |�}|j� }t|�dkr"d S |rDtdtd�td�td�f � xZt|�D ]N}d| }|d|| d 7 }x$|| dd � D ]}|d | 7 }q�W t|� qNW d S )
Nr z%-30s %-18s %s
zSELinux IB Pkey TypeZ
Subnet_Prefixz Pkey Numberz %-30s %-18s z%sr= z, %s)r r� rH rx r r� )r ry rz r� r� ro r� r r r r r{ O s
zibpkeyRecords.list)N)r )r )r= r )r9 r: r; r� r! r r" r� r r! r� ra r+ r� rr r rd r{ r r r r r R s
8
&
r c @ s� e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d!dd�Zd"dd�Zdd � Zd#d d �ZdS )$�ibendportRecordsNc
C sX t j| |� y:tjtjtj| j��dgd�}tdd� |j � D ��| _
W n Y nX d S )NZibendport_type)r c s s | ]}t |�V qd S )N)r* )rs rg r r r r f s z,ibendportRecords.__init__.<locals>.<genexpr>) rP r! r r r rZ r rR �setr r� )r rT r r r r r! b s zibendportRecords.__init__c C sp |dkrt td���t|�}|dks,|dk r8t td���t| j||�\}}|dk rft td�||f ��|||fS )Nr zIB device name is required� r= zInvalid Port Numberr z*Could not create a key for ibendport %s/%s)r^ r r� Z semanage_ibendport_key_createrW )r � ibendport�
ibdev_namer� rL r� r r r r� j s zibendportRecords.__genkeyc
C s
t dkr |dkrd}nt|�}|dkr2ttd���tj|�}|| jkrVttd�| ��| j||�\}}}t| j �\}}|dk r�ttd�||f ��t
| j ||� t ||� t | j �\}} |dk r�ttd�||f ��t
| j | d �}|dk r�ttd
�||f ��t| j | d �}|dk �r*ttd �||f ��t| j | |�}|dk �rVttd
�||f ��t dk�r�|dk�r�t| j | |�}|dk �r�ttd�||f ��t| j || �}|dk �r�ttd�||f ��t| j ||�}|dk �r�ttd�||f ��t| � t|� t|� d S )Nr= r r� zType is requiredz-Type %s is invalid, must be an ibendport typer z$Could not create ibendport for %s/%sz"Could not create context for %s/%sr� z1Could not set user in ibendport context for %s/%sr� z1Could not set role in ibendport context for %s/%sz1Could not set type in ibendport context for %s/%sz7Could not set mls fields in ibendport context for %s/%sz)Could not set ibendport context for %s/%sz Could not add ibendport %s/%s)r` rO r^ r rZ r� r� �_ibendportRecords__genkeyZsemanage_ibendport_createrW Z!semanage_ibendport_set_ibdev_nameZsemanage_ibendport_set_portr� r� r� r� r� Zsemanage_ibendport_set_con� semanage_ibendport_modify_localr� �semanage_ibendport_key_free�semanage_ibendport_free)
r r0 r1 r. rS r� r� rL r r� r r r r� x sP
zibendportRecords.__addc C sX | j � | j||�r<ttd�j|td�� | j||||� n| j||||� | j� d S )Nz@ibendport {ibdev_name}/{port} already defined, modifying instead)r1 r� ) rb �_ibendportRecords__existsrx r r� r� �_ibendportRecords__modify�_ibendportRecords__addr8 )r r0 r1 r. rS r r r r� � s zibendportRecords.addc C sL | j ||�\}}}t| j|�\}}|dk r@ttd�j||d���t|� |S )Nr z;Could not check if ibendport {ibdev_name}/{port} is defined)r1 r� )r2 �semanage_ibendport_existsrW r^ r r� r4 )r r0 r1 r� r� rL r~ r r r r� � s zibendportRecords.__existsc C s` |dkr2|dkr2t dkr&ttd���n ttd���tj|�}|rZ|| jkrZttd�| ��| j||�\}}}t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t | j|�\}} |dk r�ttd �||f ��t
| �}
t dko�|dk�rt | j|
t |�� |dk�r t
| j|
|� t| j|| �}|dk �rLttd
�||f ��t|� t| � d S ) Nr r= zRequires setype or serangezRequires setypez-Type %s is invalid, must be an ibendport typer z-Could not check if ibendport %s/%s is definedz ibendport %s/%s is not definedz Could not query ibendport %s/%sz Could not modify ibendport %s/%s)r` r^ r rZ r� r� r2 r9 rW Zsemanage_ibendport_query�semanage_ibendport_get_conr� rO r� r3 r4 r5 ) r r0 r1 r. r r� r� rL r~ r r� r r r r� � s4
zibendportRecords.__modifyc C s$ | j � | j||||� | j� d S )N)rb r7 r8 )r r0 r1 r. r r r r r� � s zibendportRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]~}t| j|�\}}t|�}| jt|�|�\}}}|dk r~ttd�t |f ��t
| j|�}|dk r�ttd�||f ��t |� q0W | j � d S )Nr z Could not list the ibendportsz Could not create a key for %s/%dz$Could not delete the ibendport %s/%d)
� semanage_ibendport_list_localrW r^ r rb �!semanage_ibendport_get_ibdev_name�semanage_ibendport_get_portr2 r* Z ibdevname� semanage_ibendport_del_localr4 r8 )r rL r r0 r1 r� r� r r r ra � s
zibendportRecords.deleteallc C s� | j ||�\}}}t| j|�\}}|dk r>ttd�||f ��|sVttd�||f ��t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t| j|�}|dk r�ttd�||f ��t|� d S )Nr z-Could not check if ibendport %s/%s is definedz ibendport %s/%s is not definedz7ibendport %s/%s is defined in policy, cannot be deletedz Could not delete ibendport %s/%s)r2 r9 rW r^ r Z semanage_ibendport_exists_localr> r4 )r r0 r1 r� r� rL r~ r r r r� s zibendportRecords.__deletec C s | j � | j||� | j� d S )N)rb �_ibendportRecords__deleter8 )r r0 r1 r r r r� s zibendportRecords.deleter c
C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xX| jD ]N}t|�}t|�}|dkrdqFt|�}t | j|�\}}t
|�} ||f|| |f< qFW |S )Nr zCould not list ibendportsZreserved_ibendport_t) r; rW r �semanage_ibendport_listr^ r r: r r
r< r= )
r rz r� rL r0 r� r r r1 r� r r r rr s zibendportRecords.get_allc C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xh| jD ]^}t|�}t|�}t| j|�\}}t |�}||f|j
� kr�g |||f< |||f j d| � qFW |S )Nr zCould not list ibendportsz0x%x) r; rW r r@ r^ r r: r r< r= r� r' ) r rz r� rL r0 r� r r1 r� r r r r / s z ibendportRecords.get_all_by_typec C s� g }| j d�}xtt|j� �D ]d}|| d r\|jd|| d || d |d |d f � q |jd|| d |d |d f � q W |S )NTr= z-a -t %s -r '%s' -z %s %sr z-a -t %s -z %s %s)rr r� r� r' )r r r� r� r r r rd B s
0(zibendportRecords.customizedr= c C s� | j |�}|j� }t|�dkr"d S |rDtdtd�td�td�f � xZt|�D ]N}d| }|d|| d 7 }x$|| dd � D ]}|d | 7 }q�W t|� qNW d S )
Nr z%-30s %-18s %s
zSELinux IB End Port TypezIB Device Namez Port Numberz %-30s %-18s z%sr= z, %s)r r� rH rx r r� )r ry rz r� r� ro r� r r r r r{ M s
zibendportRecords.list)N)r )r )r= r )r9 r: r; r� r! r2 r8 r� r6 r7 r� ra r? r� rr r rd r{ r r r r r- ^ s
7
&
r- c @ s~ e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d dd�Zdd� Zd d d �ZdS )!� nodeRecordsNc C sT t j| |� ddg| _y$tttjtjd��d d �| _W n tk
rN Y nX d S )NZipv4Zipv6Z node_typer r� ) rP r! �protocolr{ rZ r� r� r� r� )r rT r r r r! ` s
$znodeRecords.__init__c C s� |}|}d}|dkr t td���t|�dks8|d dkrztj|| �}t|j�}t|j�}|dkrp|jdkrpd}d|j }y| j j
|�}W n t td ���Y nX |||fS )
Nr zNode Address is requiredr r� z0.0.0.0� z::zipv%dzUnknown or missing protocol) r^ r rH � ipaddressZ
ip_networkr* Znetwork_addressZnetmask�versionrB �index)r �addr�maskrB ZnewaddrZnewmaskZ newprotocolro r r r �validateh s"
znodeRecords.validatec
C sp | j |||�\}}}tdkr2|dkr*d}nt|�}|dkrFttd���tj|�}|| jkrjttd�| ��t| j |||�\}}|dk r�ttd�| ��t
| j �\}}|dk r�ttd�| ��t ||� t | j |||�}t
| j �\}} |dk r�ttd �| ��t| j |||�}|dk �r&ttd
�| ��t| j | d �}|dk �rNttd �| ��t| j | d
�}|dk �rvttd�| ��t| j | |�}|dk �r�ttd�| ��tdk�r�|dk�r�t| j | |�}|dk �r�ttd�| ��t| j || �}|dk �rttd�| ��t| j ||�}|dk �r*ttd�| ��t| � t|� t|� | jjd||tj| j | �d d
||f � d S )Nr= r r� z SELinux node type is requiredz'Type %s is invalid, must be a node typer zCould not create key for %sz Could not create addr for %sz Could not create context for %szCould not set mask for %sr� z)Could not set user in addr context for %sr� z)Could not set role in addr context for %sz)Could not set type in addr context for %sz/Could not set mls fields in addr context for %sz!Could not set addr context for %szCould not add addr %szCresrc=node op=add laddr=%s netmask=%s proto=%s tcontext=%s:%s:%s:%s) rI r` rO r^ r rZ r� r� �semanage_node_key_createrW Zsemanage_node_createZsemanage_node_set_protoZsemanage_node_set_addrr� Zsemanage_node_set_maskr� r� r� r� Zsemanage_node_set_con�semanage_node_modify_localr� �semanage_node_key_free�semanage_node_freerY r6 r
r� rB )
r rG rH r� r. r rL r� �noder� r r r r� � s^
znodeRecords.__addc C sX | j � | j|||�r:ttd�| � | j|||||� n| j|||||� | j� d S )Nz*Addr %s already defined, modifying instead)rb �_nodeRecords__existsrx r �_nodeRecords__modify�_nodeRecords__addr8 )r rG rH r� r. r r r r r� � s znodeRecords.addc C st | j |||�\}}}t| j|||�\}}|dk r@ttd�| ��t| j|�\}}|dk rhttd�| ��t|� |S )Nr zCould not create key for %sz%Could not check if addr %s is defined)rI rJ rW r^ r �semanage_node_existsrL )r rG rH r� rL r� r~ r r r r� � s znodeRecords.__existsc C s� | j |||�\}}}|dkr0|dkr0ttd���tj|�}|rX|| jkrXttd�| ��t| j|||�\}}|dk r�ttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t | j|�\}} |dk r�ttd�| ��t
| �}
t d k�r|dk�rt | j|
t
|�� |dk�r.t| j|
|� t| j|| �}|dk �rVttd
�| ��t|� t| � | jjd ||tj| j| �d d
||f � d S )Nr zRequires setype or serangez'Type %s is invalid, must be a node typer zCould not create key for %sz%Could not check if addr %s is definedzAddr %s is not definedzCould not query addr %sr= zCould not modify addr %szFresrc=node op=modify laddr=%s netmask=%s proto=%s tcontext=%s:%s:%s:%sr� r� )rI r^ r rZ r� r� rJ rW rR Zsemanage_node_query�semanage_node_get_conr` r� rO r� rK rL rM rY r6 r
r� rB ) r rG rH r� r. r rL r� r~ rN r� r r r r� � s8
znodeRecords.__modifyc C s& | j � | j|||||� | j� d S )N)rb rP r8 )r rG rH r� r. r r r r r� s znodeRecords.modifyc C s
| j |||�\}}}t| j|||�\}}|dk r@ttd�| ��t| j|�\}}|dk rhttd�| ��|s|ttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�}|dk r�ttd�| ��t|� | j j
d||t j | j
| �f � d S )Nr zCould not create key for %sz%Could not check if addr %s is definedzAddr %s is not definedz/Addr %s is defined in policy, cannot be deletedzCould not delete addr %sz1resrc=node op=delete laddr=%s netmask=%s proto=%s)rI rJ rW r^ r rR Zsemanage_node_exists_localZsemanage_node_del_localrL rY r6 r
r� rB )r rG rH r� rL r� r~ r r r r� s& znodeRecords.__deletec C s" | j � | j|||� | j� d S )N)rb �_nodeRecords__deleter8 )r rG rH r� r r r r� # s znodeRecords.deletec C st t | j�\}}|dk r"ttd���| j� x<|D ]4}| jt| j|�d t| j|�d | jt |� � q0W | j
� d S )Nr z!Could not deleteall node mappingsr= ) �semanage_node_list_localrW r^ r rb rT �semanage_node_get_addr�semanage_node_get_maskrB �semanage_node_get_protor8 )r rL ZnlistrN r r r ra ( s
4znodeRecords.deleteallr c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xj| jD ]`}t|�}t| j|�}t| j|�}| j t
|� }t |�t |�t
|�t|�f||d |d |f< qFW |S )Nr zCould not list addrsr= )rU rW �ilistZsemanage_node_listr^ r rS rV rW rB rX �semanage_context_get_user�semanage_context_get_roler r
) r rz r� rL rN r� rG rH r� r r r rr 2 s 2znodeRecords.get_allc C s� g }| j d�}x�t|j� �D ]p}|| d rb|jd|d |d || d || d |d f � q |jd|d |d || d |d f � q W |S )NTr z -a -M %s -p %s -t %s -r '%s' %sr= rw r z-a -M %s -p %s -t %s %s)rr r� r� r' )r r r� r� r r r rd D s
6.znodeRecords.customizedr= c C s | j |�}t|�dkrd S t|j� �}|r6tdd � tr�x�|D ]r}d}x |D ]}|d t|� }qNW td |d |d
|d || d || d
|| d t|| d d
�f � q@W nJxH|D ]@}td|d |d
|d || d || d
|| d f � q�W d S )Nr z%-18s %-18s %-5s %-5s
�
IP Address�Netmask�Protocol�Contextr � z %-18s %-18s %-5s %s:%s:%s:%s r= rw r Fz%-18s %-18s %-5s %s:%s:%s )r\ r] r^ r_ )rr rH r� r� rx r` r* rN )r ry rz r� r� r� �valZfieldsr r r r{ N s
R
znodeRecords.list)N)r )r= r )r9 r: r; r� r! rI rQ r� rO rP r� rT r� ra rr rd r{ r r r r rA \ s
B (
rA c @ sr e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z d dd�Z dd� Z
d dd�ZdS ) �interfaceRecordsNc C s t j| |� d S )N)rP r! )r rT r r r r! c s zinterfaceRecords.__init__c C s t dkr |dkrd}nt|�}|dkr2ttd���t| j|�\}}|dk rZttd�| ��t| j�\}}|dk r�ttd�| ��t| j||�}t| j�\}}|dk r�ttd�| ��t | j|d �}|dk r�ttd
�| ��t
| j|d �}|dk �rttd �| ��t | j||�}|dk �r*ttd
�| ��t dk�rf|dk�rft | j||�}|dk �rfttd�| ��t
| j||�}|dk �r�ttd�| ��t| j||�}|dk �r�ttd�| ��t| j||�}|dk �r�ttd�| ��t|� t|� t|� | jjd|d d ||f � d S )Nr= r r� zSELinux Type is requiredr zCould not create key for %sz!Could not create interface for %sz Could not create context for %sr� z.Could not set user in interface context for %sr� z.Could not set role in interface context for %sz.Could not set type in interface context for %sz4Could not set mls fields in interface context for %sz&Could not set interface context for %sz$Could not set message context for %szCould not add interface %sz4resrc=interface op=add netif=%s tcontext=%s:%s:%s:%s)r` rO r^ r �semanage_iface_key_createrW Zsemanage_iface_createZsemanage_iface_set_namer� r� r� r� r� Zsemanage_iface_set_ifconZsemanage_iface_set_msgcon�semanage_iface_modify_localr� �semanage_iface_key_free�semanage_iface_freerY r6 )r � interfacer. r rL r� �ifacer� r r r r� f sT
zinterfaceRecords.__addc C sL | j � | j|�r2ttd�| � | j|||� n| j|||� | j� d S )Nz/Interface %s already defined, modifying instead)rb �_interfaceRecords__existsrx r �_interfaceRecords__modify�_interfaceRecords__addr8 )r rg r. r r r r r� � s
zinterfaceRecords.addc C s\ t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t|� |S )Nr zCould not create key for %sz*Could not check if interface %s is defined)rc rW r^ r �semanage_iface_existsre )r rg rL r� r~ r r r r� � s zinterfaceRecords.__existsc C s> |dkr |dkr t td���t| j|�\}}|dk rDt td�| ��t| j|�\}}|dk rlt td�| ��|s�t td�| ��t| j|�\}}|dk r�t td�| ��t|�}tdkr�|dkr�t| j|t |�� |dkr�t
| j||� t | j||�}|dk �rt td �| ��t |� t
|� | jjd
|d d ||f � d S )
Nr zRequires setype or seranger zCould not create key for %sz*Could not check if interface %s is definedzInterface %s is not definedz Could not query interface %sr= z Could not modify interface %sz7resrc=interface op=modify netif=%s tcontext=%s:%s:%s:%sr� r� )r^ r rc rW rl Zsemanage_iface_query�semanage_iface_get_ifconr` r� rO r� rd re rf rY r6 ) r rg r. r rL r� r~ rh r� r r r r� � s0
zinterfaceRecords.__modifyc C s" | j � | j|||� | j� d S )N)rb rj r8 )r rg r. r r r r r� � s zinterfaceRecords.modifyc C s� t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��|sdttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�}|dk r�ttd�| ��t|� | jj d| � d S )Nr zCould not create key for %sz*Could not check if interface %s is definedzInterface %s is not definedz4Interface %s is defined in policy, cannot be deletedz Could not delete interface %sz"resrc=interface op=delete netif=%s)
rc rW r^ r rl Zsemanage_iface_exists_localZsemanage_iface_del_localre rY r6 )r rg rL r� r~ r r r r� � s$ zinterfaceRecords.__deletec C s | j � | j|� | j� d S )N)rb �_interfaceRecords__deleter8 )r rg r r r r� � s
zinterfaceRecords.deletec C sR t | j�\}}|dk r"ttd���| j� x|D ]}| jt|�� q0W | j� d S )Nr z(Could not delete all interface mappings)�semanage_iface_list_localrW r^ r rb rn �semanage_iface_get_namer8 )r rL r� ro r r r ra � s
zinterfaceRecords.deleteallr c C s~ i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x:| jD ]0}t|�}t|�t|�t |�t
|�f|t |�< qFW |S )Nr zCould not list interfaces) ro rW rY Zsemanage_iface_listr^ r rm rZ r[ r r
rp )r rz r� rL rg r� r r r rr s (zinterfaceRecords.get_allc C st g }| j d�}x`t|j� �D ]P}|| d rR|jd|| d || d |f � q |jd|| d |f � q W |S )NTr z-a -t %s -r '%s' %srw z -a -t %s %s)rr r� r� r' )r r r� r� r r r rd s
& zinterfaceRecords.customizedr= c
C s� | j |�}t|�dkrd S t|j� �}|rBtdtd�td�f � tr�x�|D ]@}td||| d || d || d t|| d d �f � qLW n:x8|D ]0}td
||| d || d || d f � q�W d S ) Nr z %-30s %s
zSELinux Interfacer_ z%-30s %s:%s:%s:%s r= rw r Fz%-30s %s:%s:%s )rr rH r� r� rx r r` rN )r ry rz r� r� r� r r r r{ s
B
zinterfaceRecords.list)N)r )r= r )r9 r: r; r! rk r� ri rj r� rn r� ra rr rd r{ r r r r rb a s
: "
rb c @ s� e Zd Zg Zd(dd�Zdd� Zdd� Zdd � Zd)d d �Zd
d� Z d*dd�Z
d+dd�Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd,d!d"�Zd#d$� Zd-d&d'�ZdS ).�fcontextRecordsNc C s� t j| |� yLtttjtjd��d d �| _| jtttjtjd��d d �7 _W n tk
rl Y nX i | _i | _ d| _
ydt t j
� d�}xH|j� D ]<}|j� }t|�dkr�q�|jd�r�q�|j� \}}|| j|< q�W |j� W n tk
r� Y nX ynt t j� d�}xR|j� D ]F}|j� }t|�dk�r2�q|jd��rB�q|j� \}}|| j |< �qW |j� W n tk
�r~ Y nX d S )NZ file_typer r� Z device_nodeFr� �#)rP r! r{ rZ r� r� r� r� �equiv�
equiv_dist� equal_indr� rG � selinux_file_context_subs_path� readlines�striprH r� r� r� �IOErrorZ#selinux_file_context_subs_dist_path)r rT r� ro �target�
substituter r r r! 1 sF ,
zfcontextRecords.__init__c
C s� | j r�tj� }d| }t|d�}x*| jj� D ] }|jd|| j| f � q,W |j� y tj |tj
|�t
j � W n Y nX tj ||� d| _ t
j| � d S )Nz%s.tmp�wz%s %s
F)ru rG rv r� rs r� �writer� r| �chmod�stat�ST_MODE�renamerP r8 )r Z subs_fileZtmpfiler� rz r r r r8 W s
zfcontextRecords.commitc C sL | j � |dkr,|d
dkr,ttd�| ��|dkrP|d dkrPttd�| ��|| jj� kr�ttd�| � || j|< d| _| jjdt j
d|d �t j
d
|d �f � | j � d S | j |� xJ| j| j
fD ]:}x4|D ],}|j|d �r�ttd �|||| f ��q�W q�W | jjd t j
d|d �t j
d
|d �f � || j|< d| _| j � d S )Nr� r= z=Target %s is not valid. Target is not allowed to end with '/'zESubstitute %s is not valid. Substitute is not allowed to end with '/'z:Equivalence class for %s already exists, modifying insteadTz$resrc=fcontext op=modify-equal %s %s�sglobr �tglobz4File spec %s conflicts with equivalency rule '%s %s'z!resrc=fcontext op=add-equal %s %s���r� )rb r^ r rs r� rx ru rY r6 r �audit_encode_nv_stringr8 rI rt r� )r rz r{ �fdictro r r r � add_equalg s*
(
"(
zfcontextRecords.add_equalc C sj | j � || jj� kr&ttd�| ��|| j|< d| _| jjdtj d|d�tj d|d�f � | j
� d S )Nz'Equivalence class for %s does not existTz$resrc=fcontext op=modify-equal %s %sr� r r� ) rb rs r� r^ r ru rY r6 r r� r8 )r rz r{ r r r � modify_equal� s
(z fcontextRecords.modify_equalr� c C s� t | j�\}}|dk r&ttd�| ��|dkr2d}t| j||�}|dk rXttd�| ��t| j|d�}|dk r~ttd�| ��tdkr�t| j|d �}|dk r�ttd
�| ��|S ) Nr z Could not create context for %sr r� z)Could not set user in file context for %sr� z)Could not set role in file context for %sr= r� z/Could not set mls fields in file context for %s)r� rW r^ r r� r� r` r� )r rz r� rL r� r r r � createcon� s zfcontextRecords.createconc C s� |dks|j d�dkr"ttd���|j d�d
kr<ttd���x^| j| jfD ]N}xH|D ]@}|j|d �rTtj||| |�}ttd �|||| |f ��qTW qJW d S ) Nr �
r zInvalid file specificationr� r= z)File specification can not include spacesr� zMFile spec %s conflicts with equivalency rule '%s %s'; Try adding '%s' insteadr� )�findr^ r rs rt r� rB �sub)r rz r� ro rg r r r rI � s
zfcontextRecords.validater c
C s� | j |� tdkrt|�}|dkr.ttd���|dkrZtj|�}|| jkrZttd�| ��t| j |t
| �\}}|dk r�ttd�| ��t | j �\}}|dk r�ttd�| ��t | j ||�}|dk�r\| j
||�} t| j | |�}|dk r�ttd �| ��tdk�r4|dk�r4t| j | |�}|dk �r4ttd
�| ��t| j || �}|dk �r\ttd �| ��t|t
| � t| j ||�}|dk �r�ttd �| ��|dk�r�t| � t|� t|� |�s�d
}| jjdtjd|d�t| |d||f � d S )Nr= r zSELinux Type is requiredz<<none>>z1Type %s is invalid, must be a file or device typer zCould not create key for %sz$Could not create file context for %sz)Could not set type in file context for %sz/Could not set mls fields in file context for %sz!Could not set file context for %sz!Could not add file context for %sr� z6resrc=fcontext op=add %s ftype=%s tcontext=%s:%s:%s:%sr� r� )rI r` rO r^ r rZ r� r� � semanage_fcontext_key_createrW �
file_typesZsemanage_fcontext_createZsemanage_fcontext_set_exprr� r� r� �semanage_fcontext_set_conZsemanage_fcontext_set_type� semanage_fcontext_modify_localr� �semanage_fcontext_key_free�semanage_fcontext_freerY r6 r r� �ftype_to_audit)
r rz rS �ftyper. r� rL r� �fcontextr� r r r r� � sN
zfcontextRecords.__addc C sV | j � | j||�r8ttd�| � | j|||||� n| j|||||� | j� d S )Nz6File context for %s already defined, modifying instead)rb �_fcontextRecords__existsrx r �_fcontextRecords__modify�_fcontextRecords__addr8 )r rz rS r� r. r� r r r r� � s zfcontextRecords.addc C s� t | j|t| �\}}|dk r.ttd�| ��t| j|�\}}|dk rVttd�| ��|s�t| j|�\}}|dk r�ttd�| ��t|� |S )Nr zCould not create key for %sz1Could not check if file context for %s is defined)r� rW r� r^ r �semanage_fcontext_exists� semanage_fcontext_exists_localr� )r rz r� rL r� r~ r r r r� � s zfcontextRecords.__existsc C s� |dkr$|dkr$|dkr$t td���|dkrPtj|�}|| jkrPt td�| ��| j|� t| j|t| �\}}|dk r�t td�| ��t | j|�\}}|dk r�t td�| ��|r�yt
| j|�\}} W n$ t k
r� t td�| ��Y nX n|t | j|�\}}|dk �rt td�| ��|�s0t td �| ��yt
| j|�\}} W n& t k
�rj t td�| ��Y nX |dk�rt| �}
|
d k�r�| j|�}
td
k�r�|dk�r�t| j|
t|�� |dk�r�t| j|
|� |dk�r�t| j|
|� t| j| |
�}|dk �r:t td �| ��n(t| j| d �}|dk �r:t td �| ��t| j|| �}|dk �rbt td �| ��t|� t| � |�s|d
}| jjdtj d|d�t | |d||f � d S )Nr z"Requires setype, serange or seuser�<<none>>z1Type %s is invalid, must be a file or device typer z Could not create a key for %sz1Could not check if file context for %s is definedz#Could not query file context for %sz"File context for %s is not definedr= z!Could not set file context for %sz$Could not modify file context for %sr� z9resrc=fcontext op=modify %s ftype=%s tcontext=%s:%s:%s:%sr� r� )r r� ) r^ r rZ r� r� rI r� rW r� r� Zsemanage_fcontext_query�OSErrorr� Z semanage_fcontext_query_local�semanage_fcontext_get_conr� r` r� rO r� r� r� r� r� r� rY r6 r r� r� ) r rz r r� r. r� rL r� r~ r� r� r r r r�
sf
zfcontextRecords.__modifyc C s& | j � | j|||||� | j� d S )N)rb r� r8 )r rz r r� r. r� r r r r� C
s zfcontextRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]�}t|�}t|�}t|�}t| j|t | �\}}|dk rzttd�| ��t
| j|�}|dk r�ttd�| ��t |� | j j
dtjd|d�tt| f � q0W i | _d| _| j� d S )Nr z Could not list the file contextsz Could not create a key for %sz$Could not delete the file context %sz$resrc=fcontext op=delete %s ftype=%sr� T)� semanage_fcontext_list_localrW r^ r rb �semanage_fcontext_get_expr�semanage_fcontext_get_type� semanage_fcontext_get_type_strr� r� �semanage_fcontext_del_localr� rY r6 r r� r� �file_type_str_to_optionrs ru r8 )r rL �flistr� rz r� � ftype_strr� r r r ra H
s&
*zfcontextRecords.deleteallc C s: || j j� kr>| j j|� d| _| jjdtjd|d� � d S t| j |t
| �\}}|dk rlt t d�| ��t
| j |�\}}|dk r�t t d�| ��|s�t| j |�\}}|dk r�t t d�| ��|r�t t d�| ��nt t d�| ��t| j |�}|dk �r t t d �| ��t|� | jjd
tjd|d�t| f � d S ) NTz!resrc=fcontext op=delete-equal %sr� r z Could not create a key for %sz1Could not check if file context for %s is definedz;File context for %s is defined in policy, cannot be deletedz"File context for %s is not definedz$Could not delete file context for %sz$resrc=fcontext op=delete %s ftype=%s)rs r� �popru rY r6 r r� r� rW r� r^ r r� r� r� r� r� )r rz r� rL r� r~ r r r r� b
s.
zfcontextRecords.__deletec C s | j � | j||� | j� d S )N)rb �_fcontextRecords__deleter8 )r rz r� r r r r� �
s zfcontextRecords.deleter c C s |rt | j�\}| _n�t| j�\}| _|dk r:ttd���t| j�\}}|dk r\ttd���t | j�\}}|dk r~ttd���| j|7 _| j|7 _i }xd| jD ]Z}t|�}t|�}t |�} t
|�}
|
r�t |
�t |
�t
|
�t|
�f||| f< q�|
||| f< q�W |S )Nr z Could not list file contextsz1Could not list file contexts for home directoriesz"Could not list local file contexts)r� rW r� Zsemanage_fcontext_listr^ r Z semanage_fcontext_list_homedirsr� r� r� r� rZ r[ r r
) r rz rL Z
fchomedirsZfclocalr� r� �exprr� r� r� r r r rr �
s. &zfcontextRecords.get_allc C s� g }| j d�}x�|j� D ]t}|| r|| d rd|jdt|d || d || d |d f � q|jdt|d || d |d f � qW t| j�r�x*| jj� D ] }|jd| j| |f � q�W |S ) NTr z-a -f %s -t %s -r '%s' '%s'r= rw r z-a -f %s -t %s '%s'z -a -e %s %s)rr r� r' r� rH rs )r r � fcon_dictr� rz r r r rd �
s
4,
zfcontextRecords.customizedr= c C s� | j |�}t|�dk�r|r:tdtd�td�td�f � |rH|j� }n t|j� �}x�|D ]�}|| r�tr�td|d |d || d || d || d t|| d d
�f � n6td |d |d || d || d || d f � qZtd |d |d f � qZW t| j��rV|�sV|�r*ttd
�� x*| jj� D ] }td|| j| f � �q6W t| j ��r�|�rtttd�� x*| j j� D ] }td|| j | f � �q�W d S )Nr z%-50s %-18s %s
zSELinux fcontextrS r_ z%-50s %-18s %s:%s:%s:%s r= rw r Fz%-50s %-18s %s:%s:%s z%-50s %-18s <<None>>z,
SELinux Distribution fcontext Equivalence
z%s = %sz%
SELinux Local fcontext Equivalence
)
rr rH rx r r� r� r` rN rt rs )r ry rz r� Zfkeysr� rz r r r r{ �
s0
H8 zfcontextRecords.list)N)r� )r r r� )r r r� )r )r= r )r9 r: r; r� r! r8 r� r� r� rI r� r� r� r� r� ra r� r� rr rd r{ r r r r rq - s$
&
6
C!
rq c @ sl e Zd Zddd�Zdd� Zd dd�Zd d
� Zd d � Zd
d� Zd dd�Z dd� Z
dd� Z dd� Z d dd�Z
dS ) �booleanRecordsNc C s� t j| |� i | _d| jd< d| jd< d| jd< d| jd< d| jd< d| jd< y tj� \}| _tj� \}}W n g | _d }Y nX | jd ks�| j|kr�d
| _nd | _d S ) Nr= ZTRUEr ZFALSEZONZOFF�1�0r TF) rP r! �dictrG Zsecurity_get_boolean_names�current_booleansrX rR � modify_local)r rT rL Zptyper r r r! �
s"
zbooleanRecords.__init__c C sL t j|�}t| j|�\}}|dk r2ttd�| ��t| j|�\}}|dk rZttd�| ��|snttd�| ��t| j|�\}}|dk r�ttd�| ��|j� | j kr�t
|| j |j� � n ttd�dj | j j � � ��| j
o�|| jk�rt| j||�}|dk �rttd�| ��t| j||�}|dk �r8ttd �| ��t|� t|� d S )
Nr z Could not create a key for %sz(Could not check if boolean %s is definedzBoolean %s is not definedz Could not query file context %sz0You must specify one of the following values: %sz, z(Could not set active value of boolean %szCould not modify boolean %s)rG �selinux_boolean_sub�semanage_bool_key_createrW r^ r �semanage_bool_existsZsemanage_bool_query�upperr� Zsemanage_bool_set_valuer� r� r� r� Zsemanage_bool_set_activeZsemanage_bool_modify_local�semanage_bool_key_freeZsemanage_bool_free)r r, �valuerL r� r~ r r r r Z__mod�
s0
zbooleanRecords.__modFc C s� | j � |r�t|�}x||j� jd�D ]j}|j� }t|�dkr>q$y|jd�\}}W n( tk
rx ttd||f ���Y nX | j|j� |j� � q$W |j � n | j||� | j
� d S )Nr� r �=zBad format %s: Record %s) rb r� r� r� rx rH r^ r �_booleanRecords__modr� r8 )r r, r� �use_filer� r Zboolnamera r r r r� s
zbooleanRecords.modifyc C s� t j|�}t| j|�\}}|dk r2ttd�| ��t| j|�\}}|dk rZttd�| ��|snttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�}|dk r�ttd�| ��t |� d S )Nr z Could not create a key for %sz(Could not check if boolean %s is definedzBoolean %s is not definedz2Boolean %s is defined in policy, cannot be deletedzCould not delete boolean %s)
rG r� r� rW r^ r r� Zsemanage_bool_exists_localZsemanage_bool_del_localr� )r r, rL r� r~ r r r r� # s$
zbooleanRecords.__deletec C s | j � | j|� | j� d S )N)rb �_booleanRecords__deleter8 )r r, r r r r� ; s
zbooleanRecords.deletec C sZ t | j�\}| _|dk r$ttd���| j� x | jD ]}t|�}| j|� q4W | j� d S )Nr zCould not list booleans) �semanage_bool_list_localrW �blistr^ r rb �semanage_bool_get_namer� r8 )r rL �booleanr, r r r ra @ s zbooleanRecords.deleteallr c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x~| jD ]t}g }t|�}|jt|�� | j r�|| j
kr�|jt j |�� |jt j
|�� n |j|d � |j|d � |||< qFW |S )Nr zCould not list booleans)r� rW r� Zsemanage_bool_listr^ r r� r' Zsemanage_bool_get_valuer� r� rG Z security_get_boolean_pendingZsecurity_get_boolean_active)r rz r� rL r� r� r, r r r rr M s" zbooleanRecords.get_allc C s t j|�}tj|�S )N)rG r� rZ Z boolean_desc)r r, r r r �get_descd s
zbooleanRecords.get_descc C s t j|�}tj|�S )N)rG r� rZ Zboolean_category)r r, r r r � get_categoryh s
zbooleanRecords.get_categoryc C sJ g }| j d�}x6t|j� �D ]&}|| r |jd|| d |f � q W |S )NTz -m -%s %srw )rr r� r� r' )r r r� r� r r r rd l s
zbooleanRecords.customizedTc C s� t d�t d�f}|rX| j|�}x4t|j� �D ]$}|| r,td||| d f � q,W d S | j|�}t|�dkrrd S |r�tdt d�t d�t d �t d
�f � xNt|j� �D ]>}|| r�td |||| d ||| d | j|�f � q�W d S ) Nr� r� z%s=%srw r z%-30s %s %s %s
zSELinux booleanZStateZDefaultZ Descriptionz%-30s (%-5s,%5s) %s)r rr r� r� rx rH r� )r ry rz r� Zon_offr� r� r r r r{ t s
$zbooleanRecords.list)N)NF)r )TFF)r9 r: r; r! r� r� r� r� ra rr r� r� rd r{ r r r r r� �
s
r� )r )r= )r= )9r� r� rG r| rB r( r r
r5 ZPROGNAMErZ r rD �gettext�kwargs� version_infoZinstall�builtinsr* �__dict__r� Z __builtin__r r> r� ZSEMANAGE_FCONTEXT_ALLZSEMANAGE_FCONTEXT_REGZSEMANAGE_FCONTEXT_DIRZSEMANAGE_FCONTEXT_CHARZSEMANAGE_FCONTEXT_BLOCKZSEMANAGE_FCONTEXT_SOCKZSEMANAGE_FCONTEXT_LINKZSEMANAGE_FCONTEXT_PIPEr� r� r Z audit_closer r r� r? rF rN rO rP rf r� r� r� r� r� r r- rA rb rq r� r r r r �<module> s�
$$
ik
H $ M . __pycache__/seobject.cpython-36.pyc 0000644 00000251644 14751155147 0013226 0 ustar 00 3
�� f�� � @ s2 d dl Z d dlZd dlZd dlZd dlZd dlZd dlZd dlZd dlT dZ d dl
Z
d dl Z d dl Z y:d dl
Z
i ZejdRk r�ded< e
je fddd �e�� W nJ yd dlZeejd
< W n& ek
r� d dlZeejd
< Y nX Y nX d dlZi Zeed < eed < eed
< eed< eed< eed< eed< eed< eed< e ed< e ed< e ed< e ed< e ed< e ed< e ed< e ed< e ed < e ed < e ed < e ed < e ed < e ed!< e ed"< d
ddddd d d d#�Z!d$d$d%d&d'd(d)d*dd+� Z"y(d dl#Z#e#j$e#j%� � G d,d-� d-�Z&W n( e'efk
�r4 G d.d-� d-�Z&Y nX G d/d0� d0�Z(d1d2� Z)dSd4d5�Z*dTd6d7�Z+G d8d9� d9�Z,G d:d;� d;e,�Z-G d<d=� d=e,�Z.G d>d?� d?e,�Z/G d@dA� dAe,�Z0G dBdC� dCe,�Z1G dDdE� dEe,�Z2G dFdG� dGe,�Z3G dHdI� dIe,�Z4G dJdK� dKe,�Z5G dLdM� dMe,�Z6G dNdO� dOe,�Z7G dPdQ� dQe,�Z8dS )U� N)�*zselinux-python� T�unicodez/usr/share/localezutf-8)Z localedirZcodeset�_� z all files�az regular filez--�fz-d� directory�dz-czcharacter device�cz-bz block device�bz-s�socket�sz-l�lz
symbolic link�pz-pz
named pipe)z all filesz regular filer zcharacter devicez block devicer
z
symbolic linkz
named pipe�any�block�char�dir�file�symlink�pipe) r r r r r
r r r r c @ s8 e Zd Zdd� Zd
dd�Zddd�Zdd � Zd
d � Zd S )�loggerc C s t j� | _g | _g | _d S )N)�audit�
audit_open�audit_fd�log_list�log_change_list)�self� r � /usr/lib/python3.6/seobject.py�__init__l s
zlogger.__init__r c
C s� d} ||kr || d 7 }d} ||kr4|| d 7 }d} ||krL|| d 7 }d} | j j| jtjtjd t|�|d||||||dddg� d S )N�-�sename�,�role�ranger r )r �appendr r ZAUDIT_ROLE_ASSIGN�sys�argv�str)
r �msg�namer# �serole�serange� oldsename� oldserole�
oldserange�sepr r r �logq s z
logger.logc C s< | j j| jtjtjd t|�|d||||||dddg� d S )Nr r )r r' r r ZAUDIT_ROLE_REMOVEr( r) r* ) r r+ r, r# r- r. r/ r0 r1 r r r �
log_remove� s zlogger.log_removec C s& | j j| jtjt|�ddddg� d S )N�semanager )r r' r r Z AUDIT_USER_MAC_CONFIG_CHANGEr* )r r+ r r r �
log_change� s zlogger.log_changec C sP x | j D ]}tj||g � qW x | jD ]}tj||g � q(W g | _ g | _d S )N)r r Zaudit_log_semanage_messager Zaudit_log_user_comm_message)r �successr r r r �commit� s z
logger.commitN)r r r r r r r )r r r r r r r )�__name__�
__module__� __qualname__r! r3 r4 r6 r8 r r r r r j s
r c @ s8 e Zd Zdd� Zd
dd�Zddd�Zdd � Zd
d � Zd S )r c C s
g | _ d S )N)r )r r r r r! � s zlogger.__init__r c
C s� d||f } |dkr | d| 7 } |dkr4| d| 7 } |dkrH| d| 7 } |dkr\| d| 7 } |dkrx|d k rx| d| 7 } |dkr�|d k r�| d| 7 } | j j| � d S ) Nz %s name=%sr z sename=z oldsename=z role=z
old_role=z
MLSRange=z old_MLSRange=)r r' )
r r+ r, r# r- r. r/ r0 r1 �messager r r r3 � s z
logger.logc C s | j ||||||||� d S )N)r3 ) r r+ r, r# r- r. r/ r0 r1 r r r r4 � s zlogger.log_removec C s | j jd| � d S )Nz %s)r r' )r r+ r r r r6 � s zlogger.log_changec C s8 |dkrd}nd}x | j D ]}tjtj|| � qW d S )N� z Successful: zFailed: )r �syslogZLOG_INFO)r r7 r< r r r r r8 � s
z
logger.commitN)r r r r r r r )r r r r r r r )r9 r: r; r! r3 r4 r6 r8 r r r r r � s
c @ s0 e Zd Zd dd�Zd dd�Zdd� Zdd � Zd
S )
�
nullloggerr c C s d S )Nr ) r r+ r, r# r- r. r/ r0 r1 r r r r3 � s znulllogger.logc C s d S )Nr ) r r+ r, r# r- r. r/ r0 r1 r r r r4 � s znulllogger.log_removec C s d S )Nr )r r+ r r r r6 � s znulllogger.log_changec C s d S )Nr )r r7 r r r r8 � s znulllogger.commitN)r r r r r r r )r r r r r r r )r9 r: r; r3 r4 r6 r8 r r r r r? � s
r? c C sX d}d}|d | d }|d | d }|d | d d | d }t jd | d
| �S ) Nzs[0-9]*zc[0-9]*z(\.z)?z(\,z)*z(-z(:�^�$)�re�search)�rawZ sensitivity�categoryZ cat_rangeZ
categoriesZregr r r �validate_level� s rF r= c C s` d}|dkrd|| f }n| }t j|�\}}|dkr8| S |rL|t|�d � }|dkrX| S |S d S )Nza:b:c:r= z%s%sr r )�selinuxZ selinux_raw_to_trans_context�len)rD �prepend�filler�context�rc�transr r r � translate� s rN c C s` d}|dkrd|| f }n| }t j|�\}}|dkr8| S |rL|t|�d � }|dkrX| S |S d S )Nza:b:c:r= z%s%sr r )rG Z selinux_trans_to_raw_contextrH )rM rI rJ rK rL rD r r r � untranslate� s rO c @ sf e Zd ZdZdZdZdZddd�Zdd� Zdd� Z d d
� Z
d d � Z d
d� Z dd� Z
dd� Zdd� ZdS )�semanageRecordsFNc C s� |r t |�tkr|| _n|| _t|dd�| _| js@t|dd�| _| j| j�| _tj � \}}| jdksn| j|krxt
� | _ n,t j
| j� tjdtj� | jf � t� | _ d S )N�noreloadF�storer z%s%s)�typer* rR �args�getattrrQ �
get_handle�shrG �selinux_getpolicytyper �mylog�sepolicyZload_store_policyZselinux_set_policy_rootZ selinux_pathr? )r rT rL Z
localstorer r r r! � s
zsemanageRecords.__init__c C s | | _ d S )N)rQ )r �loadr r r �
set_reload
s zsemanageRecords.set_reloadc C s� t jr t jS t� }|s"ttd���t j rD|dkrDt||t� |t _t |�s`t
|� ttd���t |�}|t k r�t
|� ttd���t
|�}|dk r�t
|� ttd���t|�atdk r�t
|� ttd���|t _t jS )Nz Could not create semanage handler z:SELinux policy is not managed or store cannot be accessed.zCannot read policy store.r z'Could not establish semanage connectionz!Could not test MLS enabled status)rP �handleZsemanage_handle_create�
ValueErrorr � transactionZsemanage_select_storeZSEMANAGE_CON_DIRECTrR Zsemanage_is_managedZsemanage_handle_destroyZsemanage_access_checkZSEMANAGE_CAN_READZsemanage_connectZsemanage_mls_enabled�is_mls_enabled)r rR r] rL r r r rV
s2 zsemanageRecords.get_handlec C s t td���d S )NzNot yet implemented)r^ r )r r r r � deleteall1 s zsemanageRecords.deleteallc C s$ t jrttd���| j� dt _d S )Nz(Semanage transaction already in progressT)rP r_ r^ r �begin)r r r r �start4 s zsemanageRecords.startc C s, t jr
d S t| j�}|dk r(ttd���d S )Nr z$Could not start semanage transaction)rP r_ Zsemanage_begin_transactionrW r^ r )r rL r r r rb : s
zsemanageRecords.beginc C s t td���d S )NzNot yet implemented)r^ r )r r r r �
customizedA s zsemanageRecords.customizedc C sV t jr
d S | jr t| jd� t| j�}|dk rF| jjd� tt d���| jjd� d S )Nr z%Could not commit semanage transactionr= )
rP r_ rQ Zsemanage_set_reloadrW Zsemanage_commitrY r8 r^ r )r rL r r r r8 D s
zsemanageRecords.commitc C s$ t jsttd���dt _| j� d S )Nz$Semanage transaction not in progressF)rP r_ r^ r r8 )r r r r �finishP s zsemanageRecords.finish)N)r9 r: r; r_ r] rR rT r! r\ rV ra rc rb rd r8 re r r r r rP � s
$ rP c @ sP e Zd Zddd�Zdd� Zdd� Zdd
d �Zd d
� Zdd� Zdd� Z dd� Z
dS )�
moduleRecordsNc C s t j| |� d S )N)rP r! )r rT r r r r! Y s zmoduleRecords.__init__c C s g }t | j�\}}}|dk r(ttd���x�t|�D ]�}t||�}t| j|�\}}|dk rdttd���t| j|�\}}|dk r�ttd���t| j|�\}} |dk r�ttd���t | j|�\}}
|dk r�ttd���|j
||| |
f� q2W |j dd� d d
� |j d d� d � |S )
Nr z Could not list SELinux moduleszCould not get module namez Could not get module enabledz Could not get module priorityz Could not get module lang_extc S s | d S )Nr r )�tr r r �<lambda>x s z'moduleRecords.get_all.<locals>.<lambda>T)�key�reversec S s | d S )Nr r )rg r r r rh y s )ri ) Zsemanage_module_list_allrW r^ r r& �semanage_module_list_nthZ semanage_module_info_get_nameZ semanage_module_info_get_enabledZ!semanage_module_info_get_priorityZ!semanage_module_info_get_lang_extr' �sort) r r rL �mlist�number�i�modr, Zenabled�priorityZlang_extr r r �get_all\ s,
zmoduleRecords.get_allc C s0 | j � }t|�dkrg S dd� dd� |D �D �S )Nr c S s g | ]}d |d �qS )z-d %sr r )�.0�xr r r �
<listcomp>� s z,moduleRecords.customized.<locals>.<listcomp>c S s g | ]}|d dkr|�qS )r= r r )rs rg r r r ru � s )rr rH )r �allr r r rd | s zmoduleRecords.customizedr= r c C s� | j � }t|�dkrd S |r:tdtd�td�td�f � xL|D ]D}|d dkrZtd�}n
|r`q@d}td |d |d
|d |f � q@W d S ) Nr z
%-25s %-9s %s
z Module NameZPriorityZLanguager= ZDisabledr z%-25s %-9s %-5s %s� r )rr rH �printr )r �heading� locallistrv rg Zdisabledr r r �list� s
zmoduleRecords.listc C s` t jj|�s ttd�| ��t| j|�}|dk r@ttd�| ��t| j|�}|dkr\| j� d S )NzModule does not exist: %s r z3Invalid priority %d (needs to be between 1 and 999)) �os�path�existsr^ r � semanage_set_default_priorityrW Z semanage_module_install_filer8 )r r rq rL r r r �add� s zmoduleRecords.addc C s� x�|j � D ]�}t| j�\}}|dk r0ttd���t| j||�}|dk rRttd���t| j||�}|dk r
|r~ttd�| ��q
ttd�| ��q
W | j� d S )Nr zCould not create module keyz Could not set module key namezCould not enable module %szCould not disable module %s)�splitZsemanage_module_key_createrW r^ r Z semanage_module_key_set_nameZsemanage_module_set_enabledr8 )r �module�enable�mrL ri r r r � set_enabled� s zmoduleRecords.set_enabledc C sn t | j|�}|dk r$ttd�| ��x<|j� D ]0}t| j|�}|dk r.|dkr.ttd�| ��q.W | j� d S )Nr z3Invalid priority %d (needs to be between 1 and 999)rw z*Could not remove module %s (remove failed)���)r rW r^ r r� �semanage_module_remover8 )r r� rq rL r� r r r �delete� s zmoduleRecords.deletec C s: dd� dd� | j � D �D �}x|D ]}| j|d� q"W d S )Nc S s g | ] }|d �qS )r r )rs rt r r r ru � s z+moduleRecords.deleteall.<locals>.<listcomp>c S s g | ]}|d dkr|�qS )r= r r )rs rg r r r ru � s T)rr r� )r r r� r r r ra � s
zmoduleRecords.deleteall)N)r= r ) r9 r: r; r! rr rd r{ r� r� r� ra r r r r rf W s
rf c @ s e Zd Zddd�Zdd� ZdS )�dontauditClassNc C s t j| |� d S )N)rP r! )r rT r r r r! � s zdontauditClass.__init__c C s8 |dkrt td���| j� t| j|dk� | j� d S )N�on�offz'dontaudit requires either 'on' or 'off')r� r� )r^ r rb Z semanage_set_disable_dontauditrW r8 )r Z dontauditr r r �toggle� s
zdontauditClass.toggle)N)r9 r: r; r! r� r r r r r� � s
r� c @ sH e Zd Zddd�Zdd� Zdd� Zdd
d �Zd d
� Zdd� Zdd� Z dS )�permissiveRecordsNc C s t j| |� d S )N)rP r! )r rT r r r r! � s zpermissiveRecords.__init__c C sr g }t | j�\}}}|dk r(ttd���xDt|�D ]8}t||�}t|�}|r2|jd�r2|j|j d�d � q2W |S )Nr z Could not list SELinux modulesZ permissive_r= )
Zsemanage_module_listrW r^ r r& rk Zsemanage_module_get_name�
startswithr' r� )r r rL rm rn ro rp r, r r r rr � s
zpermissiveRecords.get_allc C s dd� t | j� �D �S )Nc S s g | ] }d | �qS )z-a %sr )rs rt r r r ru � s z0permissiveRecords.customized.<locals>.<listcomp>)�sortedrr )r r r r rd � s z permissiveRecords.customizedr= r c C s� dd� dd� t jt j�D �D �}t|�dkr0d S |rDtdtd� � | j� }x |D ]}||krRt|� qRW t|�dkrzd S |r�tdtd� � x|D ] }t|� q�W d S )Nc S s g | ] }|d �qS )r, r )rs �yr r r ru � s z*permissiveRecords.list.<locals>.<listcomp>c S s g | ]}|d r|�qS )Z
permissiver )rs rt r r r ru � s r z
%-25s
zBuiltin Permissive TypeszCustomized Permissive Types)rZ �infoZTYPErH rx r rr )r ry rz rv rd rg r r r r{ � s
zpermissiveRecords.listc C s� ydd l j}W n tk
r. ttd���Y nX d| }d| }t| j|t|�|d�}|dkrf| j� |dk r~ttd�| ��d S )Nr z�The sepolgen python module is required to setup permissive domains.
In some distributions it is included in the policycoreutils-devel package.
# yum install policycoreutils-devel
Or similar for your distro.z
permissive_%sz(typepermissive %s)Zcilz?Could not set permissive domain %s (module installation failed)) Zsepolgen.moduler� � ImportErrorr^ r Zsemanage_module_installrW rH r8 )r rS r� r, ZmodtxtrL r r r r� � s zpermissiveRecords.addc C sF x8|j � D ],}t| jd| �}|dk r
ttd�| ��q
W | j� d S )Nz
permissive_%sr z5Could not remove permissive domain %s (remove failed))r� r� rW r^ r r8 )r r, �nrL r r r r� s
zpermissiveRecords.deletec C s, | j � }t|�dkr(dj|�}| j|� d S )Nr � )rr rH �joinr� )r r rv r r r ra s
zpermissiveRecords.deleteall)N)r= r )
r9 r: r; r! rr rd r{ r� r� ra r r r r r� � s
r� c @ s~ e Zd Zd dd�Zdd� Zdd� Zdd � Zd d d �Zd!d
d�Zdd� Z dd� Z
dd� Z dd� Z d"dd�Z
dd� Zd#d d �ZdS )$� loginRecordsNc C s( t j| |� d | _d | _d | _d | _d S )N)rP r! r/ r1 r# r. )r rT r r r r! s
zloginRecords.__init__c C s� t j|�\}| _| _|dkr d}t| j�}|j| j�\}\}}|j|�\}\}} tdkrn|dkrjt|�}n|}t | j
|�\}}
|dk r�t t d�| ��|d dkr�yt
j|dd � � W n$ t t d�|dd � ��Y nX n,ytj|� W n t t d�| ��Y nX t| j
�\}} |dk �r4t t d �| ��t| j
| |�}|dk �r\t t d
�| ��tdk�r�|dk�r�t| j
| |�}|dk �r�t t d �| ��t| j
| |�}|dk �r�t t d �| ��t| j
|
| �}|dk �r�t t d
�| ��t|
� t| � d S )Nr Zuser_ur= r z Could not create a key for %s�%z Linux Group %s does not existz Linux User %s does not existz%Could not create login mapping for %szCould not set name for %sz Could not set MLS range for %sz!Could not set SELinux user for %sz"Could not add login mapping for %s)rG �getseuserbynamer/ r1 �seluserRecordsrT �getr` rO �semanage_seuser_key_createrW r^ r �grpZgetgrnam�pwd�getpwnamZsemanage_seuser_createZsemanage_seuser_set_name� semanage_seuser_set_mlsrange�semanage_seuser_set_sename� semanage_seuser_modify_local�semanage_seuser_key_free�semanage_seuser_free) r r, r# r. �rec�userrecr& rL r0 r- �k�ur r r �__add sP
zloginRecords.__addc C sx yL| j � | j|�r4ttd�| � | j|||� n| j|||� | j� W n& tk
rr } z
|�W Y d d }~X nX d S )Nz:Login mapping for %s is already defined, modifying instead)rb �_loginRecords__existsrx r �_loginRecords__modify�_loginRecords__addr8 r^ )r r, r# r. �errorr r r r� V s
zloginRecords.addc C s\ t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t|� |S )Nr z Could not create a key for %sz2Could not check if login mapping for %s is defined)r� rW r^ r �semanage_seuser_existsr� )r r, rL r� r~ r r r �__existsd s zloginRecords.__existsr c
C s� t j|�\}| _| _|dkr0|dkr0ttd���t| j�}|j| j�\}\}}|dkrj|j|�\}\}} n|} |dkr~|| _ n|| _ t
| j |�\}}
|dk r�ttd�| ��t | j |
�\}} |dk r�ttd�| ��| s�ttd�| ��t
| j |
�\}} |dk �rttd�| ��t| �| _t| �| _tdk�rL|dk�rLt| j | t|�� |dk�rlt| j | |� || _n| j| _t| j |
| �}|dk �r�ttd �| ��t|
� t| � d S )
Nr zRequires seuser or seranger z Could not create a key for %sz2Could not check if login mapping for %s is definedz#Login mapping for %s is not definedz Could not query seuser for %sr= z%Could not modify login mapping for %s)rG r� r/ r1 r^ r r� rT r� r. r� rW r� Zsemanage_seuser_query� semanage_seuser_get_mlsrange�semanage_seuser_get_senamer` r� rO r� r# r� r� r� )
r r, r# r. r� r� r& rL r0 r- r� r~ r� r r r �__modifyp sF
zloginRecords.__modifyc C sN y"| j � | j|||� | j� W n& tk
rH } z
|�W Y d d }~X nX d S )N)rb r� r8 r^ )r r, r# r. r� r r r �modify� s zloginRecords.modifyc
C s* t j|�\}| _| _t| j�}|j| j�\}\}}t| j|�\}}|dk rZt t
d�| ��t | j|�\}}|dk r�t t
d�| ��|s�t t
d�| ��t | j|�\}}|dk r�t t
d�| ��|s�t t
d�| ��t
| j|�}|dk r�t t
d�| ��t|� t jd�\}| _| _|j| j�\}\}} d S )Nr z Could not create a key for %sz2Could not check if login mapping for %s is definedz#Login mapping for %s is not definedz<Login mapping for %s is defined in policy, cannot be deletedz%Could not delete login mapping for %sZ __default__)rG r� r/ r1 r� rT r� r� rW r^ r r� Z semanage_seuser_exists_localZsemanage_seuser_del_localr� r# r. )
r r, r� r� r& rL r0 r� r~ r- r r r �__delete� s,
zloginRecords.__deletec C sJ y | j � | j|� | j� W n& tk
rD } z
|�W Y d d }~X nX d S )N)rb �_loginRecords__deleter8 r^ )r r, r� r r r r� � s
zloginRecords.deletec C s~ t | j�\}}|dk r"ttd���y0| j� x|D ]}| jt|�� q2W | j� W n& tk
rx } z
|�W Y d d }~X nX d S )Nr z Could not list login mappings)�semanage_seuser_list_localrW r^ r rb r� �semanage_seuser_get_namer8 )r rL �ulistr� r� r r r ra � s
zloginRecords.deleteallc
C s� i }t j� d | _x�tj| j�D ]�\}}}|| jkr xj|D ]b}yHt|d | �}|j� j� jd�}|j � |d |d |d f||< W q: t
k
r� Y q:X q:W q W |S )Nz/logins�/�:r= rw r ) rG Zselinux_policy_root� logins_pathr| �walk�open�read�rstripr� �close�
IndexError)r �ddictr} �dirs�filesr, �fdr� r r r �get_all_logins� s
zloginRecords.get_all_loginsr c C sp i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x,| jD ]"}t|�}t|�t|�df||< qFW |S )Nr z Could not list login mappingsr ) r� rW r� Zsemanage_seuser_listr^ r r� r� r� )r rz r� rL r� r, r r r rr � s zloginRecords.get_allc C st g }| j d�}x`t|j� �D ]P}|| d rR|jd|| d || d |f � q |jd|| d |f � q W |S )NTr= z-a -s %s -r '%s' %sr z -a -s %s %s)rr r� �keysr' )r r r� r� r r r rd � s
& zloginRecords.customizedr= c C sN | j |�}| j� }t|j� �}t|j� �}t|�dkrFt|�dkrFd S tdk�r|rxtdtd�td�td�td�f � x8|D ]0}|| }td||d t|d �|d f � q~W t|�r�td
| j � x�|D ]0}|| }td||d t|d �|d f � q�W nF|�r"td td�td�f � x&|D ] }td ||| d f � �q(W d S )
Nr r= z
%-20s %-20s %-20s %s
z
Login Namez SELinux Userz
MLS/MCS RangeZServicez%-20s %-20s %-20s %srw z
Local customization in %sz
%-25s %-25s
z %-25s %-25s)
rr r� r� r� rH r` rx r rN r� ) r ry rz r� ZldictZlkeysr� r� r� r r r r{ s*
$
(
*
zloginRecords.list)N)r r )r r )r )r= r )r9 r: r; r! r� r� r� r� r� r� r� ra r� rr rd r{ r r r r r� s
6
2
r� c @ s� e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � Zg d d d fd
d�Zg d d d fdd�Z dd� Z
dd� Z dd� Z d dd�Z
dd� Zd!d d �ZdS )"r� Nc C s t j| |� d S )N)rP r! )r rT r r r r! " s zseluserRecords.__init__c C s� t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t| j|�\}}|dk rxttd�| ��t|�}t| j|�}t|� t |� ||fS )Nr z Could not create a key for %sz-Could not check if SELinux user %s is definedzCould not query user for %s)
�semanage_user_key_createrW r^ r �semanage_user_exists�semanage_user_query�semanage_user_get_mlsrange�semanage_user_get_roles�semanage_user_key_free�semanage_user_free)r r, rL r� r~ r� r. r- r r r r� % s zseluserRecords.getc C s t dkr4|dkrd}nt|�}|dkr,d}nt|�}t|�dk rPttd�| ��t| j|�\}}|dk rxttd�| ��t| j�\}}|dk r�ttd�| ��t| j||�}|dk r�ttd�| ��x6|D ].} t | j|| �}|dk r�ttd �| |f ��q�W t dk�rVt
| j||�}|dk �r.ttd
�| ��t | j||�}|dk �rVttd �| ��t | j||�}|dk �r�ttd �| |f ��t
| j|�\}}
|dk �r�ttd
�| ��t| j||�}|dk �r�ttd�| ��t|� t|� | jjd|dj|�|d� d S )Nr= r �s0z%You must add at least one role for %sr z Could not create a key for %sz$Could not create SELinux user for %szCould not set name for %sz Could not add role %s for %sz Could not set MLS range for %sz Could not set MLS level for %sz Could not add prefix %s for %sz Could not extract key for %sz Could not add SELinux user %s�seuserr$ )r# r- r. )r` rO rH r^ r r� rW Zsemanage_user_createZsemanage_user_set_name�semanage_user_add_role�semanage_user_set_mlsrange�semanage_user_set_mlslevel�semanage_user_set_prefixZsemanage_user_key_extract�semanage_user_modify_localr� r� rY r3 r� ) r r, �roles�selevelr. �prefixrL r� r� �rri r r r r� 5 sR
zseluserRecords.__addc C s� yT| j � | j|�r8ttd�| � | j|||||� n| j|||||� | j� W n2 tk
r� } z| jjd� |�W Y d d }~X nX d S )Nz5SELinux user %s is already defined, modifying insteadr ) rb �_seluserRecords__existsrx r �_seluserRecords__modify�_seluserRecords__addr8 r^ rY )r r, r� r� r. r� r� r r r r� l s
zseluserRecords.addc C s\ t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t|� |S )Nr z Could not create a key for %sz-Could not check if SELinux user %s is defined)r� rW r^ r r� r� )r r, rL r� r~ r r r r� y s zseluserRecords.__existsr c C s@ d}d}dj |�}|dkrXt|�dkrX|dkrX|dkrXtdkrLttd���n ttd���t| j|�\} }
| dk r�ttd�| ��t| j|
�\} } | dk r�ttd�| ��| s�ttd �| ��t| j|
�\} } | dk r�ttd
�| ��t | �}t
| j| �\} }
| dk�rdj |
�}tdk�r6|dk�r6t | j| t |�� tdk�r\|dk�r\t
| j| t |�� |dk�rtt| j| |� t|�dk�r�x"|
D ]}||k�r�t| |� �q�W x&|D ] }||
k�r�t| j| |� �q�W t| j|
| �} | dk �r�ttd �| ��t|
� t| � d j |j� �}d j |j� �}| jjd
||||||d� d S )Nr r� r r= z&Requires prefix, roles, level or rangezRequires prefix or rolesz Could not create a key for %sz-Could not check if SELinux user %s is definedz SELinux user %s is not definedzCould not query user for %sz Could not modify SELinux user %sr$ r� )r# r/ r- r. r0 r1 )r� rH r` r^ r r� rW r� r� r� r� r� rO r� r� Zsemanage_user_del_roler� r� r� r� r� rY r3 )r r, r� r� r. r� r0 r1 ZnewrolesrL r� r~ r� �rlistr� r% r r r r� � sV
$
zseluserRecords.__modifyc C s^ y&| j � | j|||||� | j� W n2 tk
rX } z| jjd� |�W Y d d }~X nX d S )Nr )rb r� r8 r^ rY )r r, r� r� r. r� r� r r r r� � s zseluserRecords.modifyc C s8 t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��|sdttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�\}}|dk r�ttd�| ��t|�}t| j|�\}}dj |�}t
| j|�}|dk �rttd�| ��t |� t |� | j
jd |||d
� d S ) Nr z Could not create a key for %sz-Could not check if SELinux user %s is definedz SELinux user %s is not definedz7SELinux user %s is defined in policy, cannot be deletedzCould not query user for %sr$ z Could not delete SELinux user %sr� )r/ r1 r0 )r� rW r^ r r� Zsemanage_user_exists_localr� r� r� r� Zsemanage_user_del_localr� r� rY r4 ) r r, rL r� r~ r� r1 r� r0 r r r r� � s2
zseluserRecords.__deletec C sV y | j � | j|� | j� W n2 tk
rP } z| jjd� |�W Y d d }~X nX d S )Nr )rb �_seluserRecords__deleter8 r^ rY )r r, r� r r r r� � s
zseluserRecords.deletec C s� t | j�\}}|dk r"ttd���y0| j� x|D ]}| jt|�� q2W | j� W n2 tk
r� } z| jjd� |�W Y d d }~X nX d S )Nr z Could not list login mappings) �semanage_user_list_localrW r^ r rb r� �semanage_user_get_namer8 rY )r rL r� r� r� r r r ra � s
zseluserRecords.deleteallr c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xh| jD ]^}t|�}t| j|�\}}|dk rzttd�| ��dj|�}t |�t
|�t |�|f|t|�< qFW |S )Nr z Could not list SELinux usersz Could not list roles for user %sr� ) r� rW r� Zsemanage_user_listr^ r r� r� r� Zsemanage_user_get_prefixZsemanage_user_get_mlslevelr� )r rz r� rL r� r, r� r� r r r rr � s
$zseluserRecords.get_allc C s� g }| j d�}xvt|j� �D ]f}|| d s8|| d rh|jd|| d || d || d |f � q |jd|| d |f � q W |S )NTr= rw z-a -L %s -r %s -R '%s' %sr z
-a -R '%s' %s)rr r� r� r' )r r r� r� r r r rd s
0 zseluserRecords.customizedr= c C s | j |�}t|�dkrd S t|j� �}tdkr�|r|tddtd�td�td�f � tdtd�td �td
�td �td �f � x�|D ]B}td
||| d t|| d �t|| d �|| d f � q�W nB|r�tdtd�td �f � x$|D ] }td||| d f � q�W d S )Nr r= z
%-15s %-10s %-10s %-30sr ZLabelingzMLS/z%-15s %-10s %-10s %-30s %s
z SELinux UserZPrefixz MCS Levelz MCS Rangez
SELinux Rolesz%-15s %-10s %-10s %-30s %srw r z %-15s %s
z%-15s %s)rr rH r� r� r` rx r rN )r ry rz r� r� r� r r r r{ s
*
D
zseluserRecords.list)N)r )r= r )r9 r: r; r! r� r� r� r� r� r� r� r� ra rr rd r{ r r r r r� s
7
8 !
r� c @ s� e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d!dd�Zd"dd�Zdd � Zd#d d �ZdS )$� portRecordsNc C sJ t j| |� y$tttjtjd��d d �| _W n tk
rD Y nX d S )NZ port_typer �types)rP r! r{ rZ r� � ATTRIBUTE� valid_types� RuntimeError)r rT r r r r! 4 s
$zportRecords.__init__c
C s� t tttd�}||j� kr$|| }n ttd���|dkrDttd���|jd�}t|�dkrlt |d � }}nt |d �}t |d �}|dkr�ttd ���t
| j |||�\}} |dk r�ttd
�||f ��| |||fS ) N)ZtcpZudpZsctpZdccpz0Protocol has to be one of udp, tcp, dccp or sctpr zPort is requiredr" r= r i�� z Invalid Portz Could not create a key for %s/%s) ZSEMANAGE_PROTO_TCPZSEMANAGE_PROTO_UDPZSEMANAGE_PROTO_SCTPZSEMANAGE_PROTO_DCCPr� r^ r r� rH �intZsemanage_port_key_createrW )
r �port�protoZ protocols�proto_dZports�high�lowrL r� r r r �__genkey; s(
zportRecords.__genkeyc C s, t dkr |dkrd}nt|�}|dkr2ttd���tj|�}|| jkrVttd�| ��| j||�\}}}}t| j �\} }
| dk r�ttd�||f ��t
|
|� t |
||� t | j �\} } | dk r�ttd�||f ��t
| j | d �} | dk r�ttd
�||f ��t| j | d �} | dk �r*ttd �||f ��t| j | |�} | dk �rVttd
�||f ��t dk�r�|dk�r�t| j | |�} | dk �r�ttd�||f ��t| j |
| �} | dk �r�ttd�||f ��t| j ||
�} | dk �r�ttd�||f ��t| � t|� t|
� | jjd|tj|�d d ||f � d S )Nr= r r� zType is requiredz'Type %s is invalid, must be a port typer z Could not create port for %s/%sz"Could not create context for %s/%s�system_uz,Could not set user in port context for %s/%s�object_rz,Could not set role in port context for %s/%sz,Could not set type in port context for %s/%sz2Could not set mls fields in port context for %s/%sz$Could not set port context for %s/%szCould not add port %s/%sz8resrc=port op=add lport=%s proto=%s tcontext=%s:%s:%s:%s)r` rO r^ r rZ �get_real_type_namer� �_portRecords__genkeyZsemanage_port_createrW Zsemanage_port_set_protoZsemanage_port_set_range�semanage_context_create�semanage_context_set_user�semanage_context_set_role�semanage_context_set_type�semanage_context_set_mlsZsemanage_port_set_con�semanage_port_modify_local�semanage_context_free�semanage_port_key_free�semanage_port_freerY r6 r
�getprotobyname) r r� r� r. rS r� r� r� r� rL r �conr r r r� W sR
zportRecords.__addc C sX | j � | j||�r<ttd�j||d�� | j||||� n| j||||� | j� d S )Nz6Port {proto}/{port} already defined, modifying instead)r� r� )rb �_portRecords__existsrx r �format�_portRecords__modify�_portRecords__addr8 )r r� r� r. rS r r r r� � s zportRecords.addc C sN | j ||�\}}}}t| j|�\}}|dk rBttd�j||d���t|� |S )Nr z1Could not check if port {proto}/{port} is defined)r� r� )r� �semanage_port_existsrW r^ r r� r� ) r r� r� r� r� r� r� rL r~ r r r r� � s zportRecords.__existsc
C s� |dkr2|dkr2t dkr&ttd���n ttd���tj|�}|rZ|| jkrZttd�| ��| j||�\}}}}t| j|�\} }
| dk r�ttd�||f ��|
s�ttd�||f ��t | j|�\} } | dk r�ttd �||f ��t
| �} t dk�r|dk�r d
}nt | j| t |�� |dk�r*t
| j| |� t| j|| �} | dk �rVttd �||f ��t|� t| � | jjd |tj|�d
d||f � d S )Nr r= zRequires setype or serangezRequires setypez'Type %s is invalid, must be a port typer z(Could not check if port %s/%s is definedzPort %s/%s is not definedzCould not query port %s/%sr� zCould not modify port %s/%sz;resrc=port op=modify lport=%s proto=%s tcontext=%s:%s:%s:%sr� r� )r` r^ r rZ r� r� r� r� rW Zsemanage_port_query�semanage_port_get_conr� rO r� r� r� r� rY r6 r
r� )
r r� r� r. �setyper� r� r� r� rL r~ r r� r r r r� � s:
zportRecords.__modifyc C s$ | j � | j||||� | j� d S )N)rb r� r8 )r r� r� r. r r r r r� � s zportRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]�}t|�}t|�}t|�}t|�}d||f }| j ||�\} }
}}|dk r�ttd�| ��t
| j| �}|dk r�ttd�| ��t | � ||kr�|}| j j
d|tj|�f � q0W | j� d S )Nr zCould not list the portsz%s-%sz Could not create a key for %sz Could not delete the port %sz&resrc=port op=delete lport=%s proto=%s)�semanage_port_list_localrW r^ r rb �semanage_port_get_proto�semanage_port_get_proto_str�semanage_port_get_low�semanage_port_get_highr� �semanage_port_del_localr� rY r6 r
r� r8 ) r rL �plistr� r� � proto_strr� r� Zport_strr� r� r r r ra � s*
zportRecords.deleteallc C s� | j ||�\}}}}t| j|�\}}|dk r@ttd�||f ��|sXttd�||f ��t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t| j|�}|dk r�ttd�||f ��t|� | jj d|t
j |�f � d S )Nr z(Could not check if port %s/%s is definedzPort %s/%s is not definedz2Port %s/%s is defined in policy, cannot be deletedzCould not delete port %s/%sz&resrc=port op=delete lport=%s proto=%s) r� r� rW r^ r Zsemanage_port_exists_localr r� rY r6 r
r� ) r r� r� r� r� r� r� rL r~ r r r r� � s zportRecords.__deletec C s | j � | j||� | j� d S )N)rb �_portRecords__deleter8 )r r� r� r r r r� s zportRecords.deleter c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xX| jD ]N}t|�}t|�}t|�}t |�}t
|�} t |�}
t |�} ||f||
| | f< qFW |S )Nr zCould not list ports)
r rW r �semanage_port_listr^ r r �semanage_context_get_type�semanage_context_get_mlsr r r r ) r rz r� rL r� r� �ctype�levelr� r r� r� r r r rr s zportRecords.get_allc C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x�| jD ]�}t|�}t|�}t|�}t |�}t
|�} t |�}
||f|j � kr�g |||f< | |
kr�|||f j
d| � qF|||f j
d| |
f � qFW |S )Nr zCould not list portsz%dz%d-%d)r rW r r r^ r r r r r r r r� r' ) r rz r� rL r� r� r r� r r� r� r r r �get_all_by_type s& zportRecords.get_all_by_typec C s� g }| j d�}x�t|j� �D ]�}|d |d kr8|d nd|d |d f }|| d r�|jd|| d || d |d |f � q |jd|| d |d |f � q W |S )NTr r= z%s-%sz-a -t %s -r '%s' -p %s %srw z-a -t %s -p %s %s)rr r� r� r' )r r r� r� r� r r r rd 8 s
, ,$zportRecords.customizedr= c C s� | j |�}t|�dkrd S t|j� �}|rHtdtd�td�td�f � xV|D ]N}d| }|d|| d 7 }x$|| dd � D ]}|d | 7 }q�W t|� qNW d S )
Nr z%-30s %-8s %s
zSELinux Port TypeZProtoz Port Numberz %-30s %-8s z%sr= z, %s)r rH r� r� rx r )r ry rz r� r� ro r� r r r r r{ C s
zportRecords.list)N)r )r )r= r )r9 r: r; r� r! r� r� r� r� r� r� ra r
r� rr r rd r{ r r r r r� 0 s
:
*
r� c @ s� e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d!dd�Zd"dd�Zdd � Zd#d d �ZdS )$�
ibpkeyRecordsNc
C sX t j| |� y:tjtjtj| j��dgd�}tdd� |j � D ��| _
W n Y nX d S )NZ ibpkey_type)�attrsc s s | ]}t |�V qd S )N)r* )rs rg r r r � <genexpr>Z s z)ibpkeyRecords.__init__.<locals>.<genexpr>) rP r! �setools� TypeQuery�
SELinuxPolicyrZ �get_store_policyrR r� �resultsr� )r rT �qr r r r! V s zibpkeyRecords.__init__c C s� |dkrt td���|jd�}t|�dkr>t|d d� }}n t|d d�}t|d d�}|dkrnt td���t| j|||�\}}|dk r�t td�||f ��||||fS ) Nr zSubnet Prefix is requiredr" r= r i�� z Invalid Pkeyz Could not create a key for %s/%s)r^ r r� rH r� Zsemanage_ibpkey_key_createrW )r �pkey�
subnet_prefixZpkeysr� r� rL r� r r r r� ^ s
zibpkeyRecords.__genkeyc C s t dkr |dkrd}nt|�}|dkr2ttd���tj|�}|| jkrVttd�| ��| j||�\}}}}t| j �\}} |dk r�ttd�||f ��t
| j | |� t | ||� t | j �\}}
|dk r�ttd�||f ��t
| j |
d �}|dk �rttd
�||f ��t| j |
d �}|dk �r0ttd �||f ��t| j |
|�}|dk �r\ttd
�||f ��t dk�r�|dk�r�t| j |
|�}|dk �r�ttd�||f ��t| j | |
�}|dk �r�ttd�||f ��t| j || �}|dk �r�ttd�||f ��t|
� t|� t| � d S )Nr= r r� zType is requiredz)Type %s is invalid, must be a ibpkey typer z!Could not create ibpkey for %s/%sz"Could not create context for %s/%sr� z.Could not set user in ibpkey context for %s/%sr� z.Could not set role in ibpkey context for %s/%sz.Could not set type in ibpkey context for %s/%sz4Could not set mls fields in ibpkey context for %s/%sz&Could not set ibpkey context for %s/%szCould not add ibpkey %s/%s)r` rO r^ r rZ r� r� �_ibpkeyRecords__genkeyZsemanage_ibpkey_createrW Z!semanage_ibpkey_set_subnet_prefixZsemanage_ibpkey_set_ranger� r� r� r� r� Zsemanage_ibpkey_set_con� semanage_ibpkey_modify_localr� �semanage_ibpkey_key_free�semanage_ibpkey_free) r r r r. rS r� r� r� rL r r� r r r r� q sP
zibpkeyRecords.__addc C sX | j � | j||�r<ttd�j||d�� | j||||� n| j||||� | j� d S )Nz@ibpkey {subnet_prefix}/{pkey} already defined, modifying instead)r r )rb �_ibpkeyRecords__existsrx r r� �_ibpkeyRecords__modify�_ibpkeyRecords__addr8 )r r r r. rS r r r r� � s zibpkeyRecords.addc C sN | j ||�\}}}}t| j|�\}}|dk rBttd�j||d���t|� |S )Nr z;Could not check if ibpkey {subnet_prefix}/{pkey} is defined)r r )r �semanage_ibpkey_existsrW r^ r Zformnatr )r r r r� r� r� rL r~ r r r r� � s zibpkeyRecords.__existsc C sb |dkr2|dkr2t dkr&ttd���n ttd���tj|�}|rZ|| jkrZttd�| ��| j||�\}}}}t| j|�\}} |dk r�ttd�||f ��| s�ttd�||f ��t | j|�\}}
|dk r�ttd �||f ��t
|
�} t dko�|dk�r
t | j| t |�� |dk�r"t
| j| |� t| j||
�}|dk �rNttd
�||f ��t|� t|
� d S ) Nr r= zRequires setype or serangezRequires setypez)Type %s is invalid, must be a ibpkey typer z*Could not check if ibpkey %s/%s is definedzibpkey %s/%s is not definedz Could not query ibpkey %s/%sz Could not modify ibpkey %s/%s)r` r^ r rZ r� r� r r# rW Zsemanage_ibpkey_query�semanage_ibpkey_get_conr� rO r� r r r ) r r r r. r r� r� r� rL r~ r r� r r r r� � s4
zibpkeyRecords.__modifyc C s$ | j � | j||||� | j� d S )N)rb r! r8 )r r r r. r r r r r� � s zibpkeyRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]�}t| j|�\}}t|�}t|�}d||f }| j||�\}}}}|dk r�ttd�| ��t | j|�}|dk r�ttd�| ��t
|� q0W | j � d S )Nr zCould not list the ibpkeysz%s-%sz Could not create a key for %sz Could not delete the ibpkey %s) �semanage_ibpkey_list_localrW r^ r rb �!semanage_ibpkey_get_subnet_prefix�semanage_ibpkey_get_low�semanage_ibpkey_get_highr �semanage_ibpkey_del_localr r8 ) r rL r �ibpkeyr r� r� Zpkey_strr� r r r ra � s"
zibpkeyRecords.deleteallc C s� | j ||�\}}}}t| j|�\}}|dk r@ttd�||f ��|sXttd�||f ��t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t| j|�}|dk r�ttd�||f ��t|� d S )Nr z*Could not check if ibpkey %s/%s is definedzibpkey %s/%s is not definedz4ibpkey %s/%s is defined in policy, cannot be deletedz Could not delete ibpkey %s/%s)r r# rW r^ r Z semanage_ibpkey_exists_localr) r )r r r r� r� r� rL r~ r r r r� � s zibpkeyRecords.__deletec C s | j � | j||� | j� d S )N)rb �_ibpkeyRecords__deleter8 )r r r r r r r� s zibpkeyRecords.deleter c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xb| jD ]X}t|�}t|�}|dkrdqFt|�}t | j|�\}}t
|�} t |�}
||f|| |
|f< qFW |S )Nr zCould not list ibpkeysZreserved_ibpkey_t) r% rW r �semanage_ibpkey_listr^ r r$ r r
r& r' r( ) r rz r� rL r* r� r r r r� r� r r r rr s" zibpkeyRecords.get_allc
C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x�| jD ]�}t|�}t|�}t| j|�\}}t |�}t
|�} ||f|j � kr�g |||f< || kr�|||f j d| � qF|||f j d|| f � qFW |S )Nr zCould not list ibpkeysz0x%xz 0x%x-0x%x)
r% rW r r, r^ r r$ r r& r' r( r� r' )
r rz r� rL r* r� r r r� r� r r r r , s$ z ibpkeyRecords.get_all_by_typec C s� g }| j d�}x�t|j� �D ]�}|d |d kr8|d nd|d |d f }|| d r�|jd|| d || d |d |f � q |jd|| d |d |f � q W |S )NTr r= z%s-%sz-a -t %s -r '%s' -x %s %srw z-a -t %s -x %s %s)rr r� r� r' )r r r� r� r� r r r rd C s
, ,$zibpkeyRecords.customizedr= c C s� | j |�}|j� }t|�dkr"d S |rDtdtd�td�td�f � xZt|�D ]N}d| }|d|| d 7 }x$|| dd � D ]}|d | 7 }q�W t|� qNW d S )
Nr z%-30s %-18s %s
zSELinux IB Pkey TypeZ
Subnet_Prefixz Pkey Numberz %-30s %-18s z%sr= z, %s)r r� rH rx r r� )r ry rz r� r� ro r� r r r r r{ O s
zibpkeyRecords.list)N)r )r )r= r )r9 r: r; r� r! r r" r� r r! r� ra r+ r� rr r rd r{ r r r r r R s
8
&
r c @ s� e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d!dd�Zd"dd�Zdd � Zd#d d �ZdS )$�ibendportRecordsNc
C sX t j| |� y:tjtjtj| j��dgd�}tdd� |j � D ��| _
W n Y nX d S )NZibendport_type)r c s s | ]}t |�V qd S )N)r* )rs rg r r r r f s z,ibendportRecords.__init__.<locals>.<genexpr>) rP r! r r r rZ r rR �setr r� )r rT r r r r r! b s zibendportRecords.__init__c C sp |dkrt td���t|�}|dks,|dk r8t td���t| j||�\}}|dk rft td�||f ��|||fS )Nr zIB device name is required� r= zInvalid Port Numberr z*Could not create a key for ibendport %s/%s)r^ r r� Z semanage_ibendport_key_createrW )r � ibendport�
ibdev_namer� rL r� r r r r� j s zibendportRecords.__genkeyc
C s
t dkr |dkrd}nt|�}|dkr2ttd���tj|�}|| jkrVttd�| ��| j||�\}}}t| j �\}}|dk r�ttd�||f ��t
| j ||� t ||� t | j �\}} |dk r�ttd�||f ��t
| j | d �}|dk r�ttd
�||f ��t| j | d �}|dk �r*ttd �||f ��t| j | |�}|dk �rVttd
�||f ��t dk�r�|dk�r�t| j | |�}|dk �r�ttd�||f ��t| j || �}|dk �r�ttd�||f ��t| j ||�}|dk �r�ttd�||f ��t| � t|� t|� d S )Nr= r r� zType is requiredz-Type %s is invalid, must be an ibendport typer z$Could not create ibendport for %s/%sz"Could not create context for %s/%sr� z1Could not set user in ibendport context for %s/%sr� z1Could not set role in ibendport context for %s/%sz1Could not set type in ibendport context for %s/%sz7Could not set mls fields in ibendport context for %s/%sz)Could not set ibendport context for %s/%sz Could not add ibendport %s/%s)r` rO r^ r rZ r� r� �_ibendportRecords__genkeyZsemanage_ibendport_createrW Z!semanage_ibendport_set_ibdev_nameZsemanage_ibendport_set_portr� r� r� r� r� Zsemanage_ibendport_set_con� semanage_ibendport_modify_localr� �semanage_ibendport_key_free�semanage_ibendport_free)
r r0 r1 r. rS r� r� rL r r� r r r r� x sP
zibendportRecords.__addc C sX | j � | j||�r<ttd�j|td�� | j||||� n| j||||� | j� d S )Nz@ibendport {ibdev_name}/{port} already defined, modifying instead)r1 r� ) rb �_ibendportRecords__existsrx r r� r� �_ibendportRecords__modify�_ibendportRecords__addr8 )r r0 r1 r. rS r r r r� � s zibendportRecords.addc C sL | j ||�\}}}t| j|�\}}|dk r@ttd�j||d���t|� |S )Nr z;Could not check if ibendport {ibdev_name}/{port} is defined)r1 r� )r2 �semanage_ibendport_existsrW r^ r r� r4 )r r0 r1 r� r� rL r~ r r r r� � s zibendportRecords.__existsc C s` |dkr2|dkr2t dkr&ttd���n ttd���tj|�}|rZ|| jkrZttd�| ��| j||�\}}}t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t | j|�\}} |dk r�ttd �||f ��t
| �}
t dko�|dk�rt | j|
t |�� |dk�r t
| j|
|� t| j|| �}|dk �rLttd
�||f ��t|� t| � d S ) Nr r= zRequires setype or serangezRequires setypez-Type %s is invalid, must be an ibendport typer z-Could not check if ibendport %s/%s is definedz ibendport %s/%s is not definedz Could not query ibendport %s/%sz Could not modify ibendport %s/%s)r` r^ r rZ r� r� r2 r9 rW Zsemanage_ibendport_query�semanage_ibendport_get_conr� rO r� r3 r4 r5 ) r r0 r1 r. r r� r� rL r~ r r� r r r r� � s4
zibendportRecords.__modifyc C s$ | j � | j||||� | j� d S )N)rb r7 r8 )r r0 r1 r. r r r r r� � s zibendportRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]~}t| j|�\}}t|�}| jt|�|�\}}}|dk r~ttd�t |f ��t
| j|�}|dk r�ttd�||f ��t |� q0W | j � d S )Nr z Could not list the ibendportsz Could not create a key for %s/%dz$Could not delete the ibendport %s/%d)
� semanage_ibendport_list_localrW r^ r rb �!semanage_ibendport_get_ibdev_name�semanage_ibendport_get_portr2 r* Z ibdevname� semanage_ibendport_del_localr4 r8 )r rL r r0 r1 r� r� r r r ra � s
zibendportRecords.deleteallc C s� | j ||�\}}}t| j|�\}}|dk r>ttd�||f ��|sVttd�||f ��t| j|�\}}|dk r�ttd�||f ��|s�ttd�||f ��t| j|�}|dk r�ttd�||f ��t|� d S )Nr z-Could not check if ibendport %s/%s is definedz ibendport %s/%s is not definedz7ibendport %s/%s is defined in policy, cannot be deletedz Could not delete ibendport %s/%s)r2 r9 rW r^ r Z semanage_ibendport_exists_localr> r4 )r r0 r1 r� r� rL r~ r r r r� s zibendportRecords.__deletec C s | j � | j||� | j� d S )N)rb �_ibendportRecords__deleter8 )r r0 r1 r r r r� s zibendportRecords.deleter c
C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xX| jD ]N}t|�}t|�}|dkrdqFt|�}t | j|�\}}t
|�} ||f|| |f< qFW |S )Nr zCould not list ibendportsZreserved_ibendport_t) r; rW r �semanage_ibendport_listr^ r r: r r
r< r= )
r rz r� rL r0 r� r r r1 r� r r r rr s zibendportRecords.get_allc C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xh| jD ]^}t|�}t|�}t| j|�\}}t |�}||f|j
� kr�g |||f< |||f j d| � qFW |S )Nr zCould not list ibendportsz0x%x) r; rW r r@ r^ r r: r r< r= r� r' ) r rz r� rL r0 r� r r1 r� r r r r / s z ibendportRecords.get_all_by_typec C s� g }| j d�}xtt|j� �D ]d}|| d r\|jd|| d || d |d |d f � q |jd|| d |d |d f � q W |S )NTr= z-a -t %s -r '%s' -z %s %sr z-a -t %s -z %s %s)rr r� r� r' )r r r� r� r r r rd B s
0(zibendportRecords.customizedr= c C s� | j |�}|j� }t|�dkr"d S |rDtdtd�td�td�f � xZt|�D ]N}d| }|d|| d 7 }x$|| dd � D ]}|d | 7 }q�W t|� qNW d S )
Nr z%-30s %-18s %s
zSELinux IB End Port TypezIB Device Namez Port Numberz %-30s %-18s z%sr= z, %s)r r� rH rx r r� )r ry rz r� r� ro r� r r r r r{ M s
zibendportRecords.list)N)r )r )r= r )r9 r: r; r� r! r2 r8 r� r6 r7 r� ra r? r� rr r rd r{ r r r r r- ^ s
7
&
r- c @ s~ e Zd Zg Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
d dd�Zdd� Zd d d �ZdS )!� nodeRecordsNc C sT t j| |� ddg| _y$tttjtjd��d d �| _W n tk
rN Y nX d S )NZipv4Zipv6Z node_typer r� ) rP r! �protocolr{ rZ r� r� r� r� )r rT r r r r! ` s
$znodeRecords.__init__c C s� |}|}d}|dkr t td���t|�dks8|d dkrztj|| �}t|j�}t|j�}|dkrp|jdkrpd}d|j }y| j j
|�}W n t td ���Y nX |||fS )
Nr zNode Address is requiredr r� z0.0.0.0� z::zipv%dzUnknown or missing protocol) r^ r rH � ipaddressZ
ip_networkr* Znetwork_addressZnetmask�versionrB �index)r �addr�maskrB ZnewaddrZnewmaskZ newprotocolro r r r �validateh s"
znodeRecords.validatec
C sp | j |||�\}}}tdkr2|dkr*d}nt|�}|dkrFttd���tj|�}|| jkrjttd�| ��t| j |||�\}}|dk r�ttd�| ��t
| j �\}}|dk r�ttd�| ��t ||� t | j |||�}t
| j �\}} |dk r�ttd �| ��t| j |||�}|dk �r&ttd
�| ��t| j | d �}|dk �rNttd �| ��t| j | d
�}|dk �rvttd�| ��t| j | |�}|dk �r�ttd�| ��tdk�r�|dk�r�t| j | |�}|dk �r�ttd�| ��t| j || �}|dk �rttd�| ��t| j ||�}|dk �r*ttd�| ��t| � t|� t|� | jjd||tj| j | �d d
||f � d S )Nr= r r� z SELinux node type is requiredz'Type %s is invalid, must be a node typer zCould not create key for %sz Could not create addr for %sz Could not create context for %szCould not set mask for %sr� z)Could not set user in addr context for %sr� z)Could not set role in addr context for %sz)Could not set type in addr context for %sz/Could not set mls fields in addr context for %sz!Could not set addr context for %szCould not add addr %szCresrc=node op=add laddr=%s netmask=%s proto=%s tcontext=%s:%s:%s:%s) rI r` rO r^ r rZ r� r� �semanage_node_key_createrW Zsemanage_node_createZsemanage_node_set_protoZsemanage_node_set_addrr� Zsemanage_node_set_maskr� r� r� r� Zsemanage_node_set_con�semanage_node_modify_localr� �semanage_node_key_free�semanage_node_freerY r6 r
r� rB )
r rG rH r� r. r rL r� �noder� r r r r� � s^
znodeRecords.__addc C sX | j � | j|||�r:ttd�| � | j|||||� n| j|||||� | j� d S )Nz*Addr %s already defined, modifying instead)rb �_nodeRecords__existsrx r �_nodeRecords__modify�_nodeRecords__addr8 )r rG rH r� r. r r r r r� � s znodeRecords.addc C st | j |||�\}}}t| j|||�\}}|dk r@ttd�| ��t| j|�\}}|dk rhttd�| ��t|� |S )Nr zCould not create key for %sz%Could not check if addr %s is defined)rI rJ rW r^ r �semanage_node_existsrL )r rG rH r� rL r� r~ r r r r� � s znodeRecords.__existsc C s� | j |||�\}}}|dkr0|dkr0ttd���tj|�}|rX|| jkrXttd�| ��t| j|||�\}}|dk r�ttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t | j|�\}} |dk r�ttd�| ��t
| �}
t d k�r|dk�rt | j|
t
|�� |dk�r.t| j|
|� t| j|| �}|dk �rVttd
�| ��t|� t| � | jjd ||tj| j| �d d
||f � d S )Nr zRequires setype or serangez'Type %s is invalid, must be a node typer zCould not create key for %sz%Could not check if addr %s is definedzAddr %s is not definedzCould not query addr %sr= zCould not modify addr %szFresrc=node op=modify laddr=%s netmask=%s proto=%s tcontext=%s:%s:%s:%sr� r� )rI r^ r rZ r� r� rJ rW rR Zsemanage_node_query�semanage_node_get_conr` r� rO r� rK rL rM rY r6 r
r� rB ) r rG rH r� r. r rL r� r~ rN r� r r r r� � s8
znodeRecords.__modifyc C s& | j � | j|||||� | j� d S )N)rb rP r8 )r rG rH r� r. r r r r r� s znodeRecords.modifyc C s
| j |||�\}}}t| j|||�\}}|dk r@ttd�| ��t| j|�\}}|dk rhttd�| ��|s|ttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�}|dk r�ttd�| ��t|� | j j
d||t j | j
| �f � d S )Nr zCould not create key for %sz%Could not check if addr %s is definedzAddr %s is not definedz/Addr %s is defined in policy, cannot be deletedzCould not delete addr %sz1resrc=node op=delete laddr=%s netmask=%s proto=%s)rI rJ rW r^ r rR Zsemanage_node_exists_localZsemanage_node_del_localrL rY r6 r
r� rB )r rG rH r� rL r� r~ r r r r� s& znodeRecords.__deletec C s" | j � | j|||� | j� d S )N)rb �_nodeRecords__deleter8 )r rG rH r� r r r r� # s znodeRecords.deletec C st t | j�\}}|dk r"ttd���| j� x<|D ]4}| jt| j|�d t| j|�d | jt |� � q0W | j
� d S )Nr z!Could not deleteall node mappingsr= ) �semanage_node_list_localrW r^ r rb rT �semanage_node_get_addr�semanage_node_get_maskrB �semanage_node_get_protor8 )r rL ZnlistrN r r r ra ( s
4znodeRecords.deleteallr c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���xj| jD ]`}t|�}t| j|�}t| j|�}| j t
|� }t |�t |�t
|�t|�f||d |d |f< qFW |S )Nr zCould not list addrsr= )rU rW �ilistZsemanage_node_listr^ r rS rV rW rB rX �semanage_context_get_user�semanage_context_get_roler r
) r rz r� rL rN r� rG rH r� r r r rr 2 s 2znodeRecords.get_allc C s� g }| j d�}x�t|j� �D ]p}|| d rb|jd|d |d || d || d |d f � q |jd|d |d || d |d f � q W |S )NTr z -a -M %s -p %s -t %s -r '%s' %sr= rw r z-a -M %s -p %s -t %s %s)rr r� r� r' )r r r� r� r r r rd D s
6.znodeRecords.customizedr= c C s | j |�}t|�dkrd S t|j� �}|r6tdd � tr�x�|D ]r}d}x |D ]}|d t|� }qNW td |d |d
|d || d || d
|| d t|| d d
�f � q@W nJxH|D ]@}td|d |d
|d || d || d
|| d f � q�W d S )Nr z%-18s %-18s %-5s %-5s
�
IP Address�Netmask�Protocol�Contextr � z %-18s %-18s %-5s %s:%s:%s:%s r= rw r Fz%-18s %-18s %-5s %s:%s:%s )r\ r] r^ r_ )rr rH r� r� rx r` r* rN )r ry rz r� r� r� �valZfieldsr r r r{ N s
R
znodeRecords.list)N)r )r= r )r9 r: r; r� r! rI rQ r� rO rP r� rT r� ra rr rd r{ r r r r rA \ s
B (
rA c @ sr e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z d dd�Z dd� Z
d dd�ZdS ) �interfaceRecordsNc C s t j| |� d S )N)rP r! )r rT r r r r! c s zinterfaceRecords.__init__c C s t dkr |dkrd}nt|�}|dkr2ttd���t| j|�\}}|dk rZttd�| ��t| j�\}}|dk r�ttd�| ��t| j||�}t| j�\}}|dk r�ttd�| ��t | j|d �}|dk r�ttd
�| ��t
| j|d �}|dk �rttd �| ��t | j||�}|dk �r*ttd
�| ��t dk�rf|dk�rft | j||�}|dk �rfttd�| ��t
| j||�}|dk �r�ttd�| ��t| j||�}|dk �r�ttd�| ��t| j||�}|dk �r�ttd�| ��t|� t|� t|� | jjd|d d ||f � d S )Nr= r r� zSELinux Type is requiredr zCould not create key for %sz!Could not create interface for %sz Could not create context for %sr� z.Could not set user in interface context for %sr� z.Could not set role in interface context for %sz.Could not set type in interface context for %sz4Could not set mls fields in interface context for %sz&Could not set interface context for %sz$Could not set message context for %szCould not add interface %sz4resrc=interface op=add netif=%s tcontext=%s:%s:%s:%s)r` rO r^ r �semanage_iface_key_createrW Zsemanage_iface_createZsemanage_iface_set_namer� r� r� r� r� Zsemanage_iface_set_ifconZsemanage_iface_set_msgcon�semanage_iface_modify_localr� �semanage_iface_key_free�semanage_iface_freerY r6 )r � interfacer. r rL r� �ifacer� r r r r� f sT
zinterfaceRecords.__addc C sL | j � | j|�r2ttd�| � | j|||� n| j|||� | j� d S )Nz/Interface %s already defined, modifying instead)rb �_interfaceRecords__existsrx r �_interfaceRecords__modify�_interfaceRecords__addr8 )r rg r. r r r r r� � s
zinterfaceRecords.addc C s\ t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��t|� |S )Nr zCould not create key for %sz*Could not check if interface %s is defined)rc rW r^ r �semanage_iface_existsre )r rg rL r� r~ r r r r� � s zinterfaceRecords.__existsc C s> |dkr |dkr t td���t| j|�\}}|dk rDt td�| ��t| j|�\}}|dk rlt td�| ��|s�t td�| ��t| j|�\}}|dk r�t td�| ��t|�}tdkr�|dkr�t| j|t |�� |dkr�t
| j||� t | j||�}|dk �rt td �| ��t |� t
|� | jjd
|d d ||f � d S )
Nr zRequires setype or seranger zCould not create key for %sz*Could not check if interface %s is definedzInterface %s is not definedz Could not query interface %sr= z Could not modify interface %sz7resrc=interface op=modify netif=%s tcontext=%s:%s:%s:%sr� r� )r^ r rc rW rl Zsemanage_iface_query�semanage_iface_get_ifconr` r� rO r� rd re rf rY r6 ) r rg r. r rL r� r~ rh r� r r r r� � s0
zinterfaceRecords.__modifyc C s" | j � | j|||� | j� d S )N)rb rj r8 )r rg r. r r r r r� � s zinterfaceRecords.modifyc C s� t | j|�\}}|dk r(ttd�| ��t| j|�\}}|dk rPttd�| ��|sdttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�}|dk r�ttd�| ��t|� | jj d| � d S )Nr zCould not create key for %sz*Could not check if interface %s is definedzInterface %s is not definedz4Interface %s is defined in policy, cannot be deletedz Could not delete interface %sz"resrc=interface op=delete netif=%s)
rc rW r^ r rl Zsemanage_iface_exists_localZsemanage_iface_del_localre rY r6 )r rg rL r� r~ r r r r� � s$ zinterfaceRecords.__deletec C s | j � | j|� | j� d S )N)rb �_interfaceRecords__deleter8 )r rg r r r r� � s
zinterfaceRecords.deletec C sR t | j�\}}|dk r"ttd���| j� x|D ]}| jt|�� q0W | j� d S )Nr z(Could not delete all interface mappings)�semanage_iface_list_localrW r^ r rb rn �semanage_iface_get_namer8 )r rL r� ro r r r ra � s
zinterfaceRecords.deleteallr c C s~ i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x:| jD ]0}t|�}t|�t|�t |�t
|�f|t |�< qFW |S )Nr zCould not list interfaces) ro rW rY Zsemanage_iface_listr^ r rm rZ r[ r r
rp )r rz r� rL rg r� r r r rr s (zinterfaceRecords.get_allc C st g }| j d�}x`t|j� �D ]P}|| d rR|jd|| d || d |f � q |jd|| d |f � q W |S )NTr z-a -t %s -r '%s' %srw z -a -t %s %s)rr r� r� r' )r r r� r� r r r rd s
& zinterfaceRecords.customizedr= c
C s� | j |�}t|�dkrd S t|j� �}|rBtdtd�td�f � tr�x�|D ]@}td||| d || d || d t|| d d �f � qLW n:x8|D ]0}td
||| d || d || d f � q�W d S ) Nr z %-30s %s
zSELinux Interfacer_ z%-30s %s:%s:%s:%s r= rw r Fz%-30s %s:%s:%s )rr rH r� r� rx r r` rN )r ry rz r� r� r� r r r r{ s
B
zinterfaceRecords.list)N)r )r= r )r9 r: r; r! rk r� ri rj r� rn r� ra rr rd r{ r r r r rb a s
: "
rb c @ s� e Zd Zg Zd(dd�Zdd� Zdd� Zdd � Zd)d d �Zd
d� Z d*dd�Z
d+dd�Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd,d!d"�Zd#d$� Zd-d&d'�ZdS ).�fcontextRecordsNc C s� t j| |� yLtttjtjd��d d �| _| jtttjtjd��d d �7 _W n tk
rl Y nX i | _i | _ d| _
ydt t j
� d�}xH|j� D ]<}|j� }t|�dkr�q�|jd�r�q�|j� \}}|| j|< q�W |j� W n tk
r� Y nX ynt t j� d�}xR|j� D ]F}|j� }t|�dk�r2�q|jd��rB�q|j� \}}|| j |< �qW |j� W n tk
�r~ Y nX d S )NZ file_typer r� Z device_nodeFr� �#)rP r! r{ rZ r� r� r� r� �equiv�
equiv_dist� equal_indr� rG � selinux_file_context_subs_path� readlines�striprH r� r� r� �IOErrorZ#selinux_file_context_subs_dist_path)r rT r� ro �target�
substituter r r r! 1 sF ,
zfcontextRecords.__init__c
C s� | j r�tj� }d| }t|d�}x*| jj� D ] }|jd|| j| f � q,W |j� y tj |tj
|�t
j � W n Y nX tj ||� d| _ t
j| � d S )Nz%s.tmp�wz%s %s
F)ru rG rv r� rs r� �writer� r| �chmod�stat�ST_MODE�renamerP r8 )r Z subs_fileZtmpfiler� rz r r r r8 W s
zfcontextRecords.commitc C sL | j � |dkr,|d
dkr,ttd�| ��|dkrP|d dkrPttd�| ��|| jj� kr�ttd�| � || j|< d| _| jjdt j
d|d �t j
d
|d �f � | j � d S | j |� xJ| j| j
fD ]:}x4|D ],}|j|d �r�ttd �|||| f ��q�W q�W | jjd t j
d|d �t j
d
|d �f � || j|< d| _| j � d S )Nr� r= z=Target %s is not valid. Target is not allowed to end with '/'zESubstitute %s is not valid. Substitute is not allowed to end with '/'z:Equivalence class for %s already exists, modifying insteadTz$resrc=fcontext op=modify-equal %s %s�sglobr �tglobz4File spec %s conflicts with equivalency rule '%s %s'z!resrc=fcontext op=add-equal %s %s���r� )rb r^ r rs r� rx ru rY r6 r �audit_encode_nv_stringr8 rI rt r� )r rz r{ �fdictro r r r � add_equalg s*
(
"(
zfcontextRecords.add_equalc C sj | j � || jj� kr&ttd�| ��|| j|< d| _| jjdtj d|d�tj d|d�f � | j
� d S )Nz'Equivalence class for %s does not existTz$resrc=fcontext op=modify-equal %s %sr� r r� ) rb rs r� r^ r ru rY r6 r r� r8 )r rz r{ r r r � modify_equal� s
(z fcontextRecords.modify_equalr� c C s� t | j�\}}|dk r&ttd�| ��|dkr2d}t| j||�}|dk rXttd�| ��t| j|d�}|dk r~ttd�| ��tdkr�t| j|d �}|dk r�ttd
�| ��|S ) Nr z Could not create context for %sr r� z)Could not set user in file context for %sr� z)Could not set role in file context for %sr= r� z/Could not set mls fields in file context for %s)r� rW r^ r r� r� r` r� )r rz r� rL r� r r r � createcon� s zfcontextRecords.createconc C s� |dks|j d�dkr"ttd���|j d�d
kr<ttd���x^| j| jfD ]N}xH|D ]@}|j|d �rTtj||| |�}ttd �|||| |f ��qTW qJW d S ) Nr �
r zInvalid file specificationr� r= z)File specification can not include spacesr� zMFile spec %s conflicts with equivalency rule '%s %s'; Try adding '%s' insteadr� )�findr^ r rs rt r� rB �sub)r rz r� ro rg r r r rI � s
zfcontextRecords.validater c
C s� | j |� tdkrt|�}|dkr.ttd���|dkrZtj|�}|| jkrZttd�| ��t| j |t
| �\}}|dk r�ttd�| ��t | j �\}}|dk r�ttd�| ��t | j ||�}|dk�r\| j
||�} t| j | |�}|dk r�ttd �| ��tdk�r4|dk�r4t| j | |�}|dk �r4ttd
�| ��t| j || �}|dk �r\ttd �| ��t|t
| � t| j ||�}|dk �r�ttd �| ��|dk�r�t| � t|� t|� |�s�d
}| jjdtjd|d�t| |d||f � d S )Nr= r zSELinux Type is requiredz<<none>>z1Type %s is invalid, must be a file or device typer zCould not create key for %sz$Could not create file context for %sz)Could not set type in file context for %sz/Could not set mls fields in file context for %sz!Could not set file context for %sz!Could not add file context for %sr� z6resrc=fcontext op=add %s ftype=%s tcontext=%s:%s:%s:%sr� r� )rI r` rO r^ r rZ r� r� � semanage_fcontext_key_createrW �
file_typesZsemanage_fcontext_createZsemanage_fcontext_set_exprr� r� r� �semanage_fcontext_set_conZsemanage_fcontext_set_type� semanage_fcontext_modify_localr� �semanage_fcontext_key_free�semanage_fcontext_freerY r6 r r� �ftype_to_audit)
r rz rS �ftyper. r� rL r� �fcontextr� r r r r� � sN
zfcontextRecords.__addc C sV | j � | j||�r8ttd�| � | j|||||� n| j|||||� | j� d S )Nz6File context for %s already defined, modifying instead)rb �_fcontextRecords__existsrx r �_fcontextRecords__modify�_fcontextRecords__addr8 )r rz rS r� r. r� r r r r� � s zfcontextRecords.addc C s� t | j|t| �\}}|dk r.ttd�| ��t| j|�\}}|dk rVttd�| ��|s�t| j|�\}}|dk r�ttd�| ��t|� |S )Nr zCould not create key for %sz1Could not check if file context for %s is defined)r� rW r� r^ r �semanage_fcontext_exists� semanage_fcontext_exists_localr� )r rz r� rL r� r~ r r r r� � s zfcontextRecords.__existsc C s� |dkr$|dkr$|dkr$t td���|dkrPtj|�}|| jkrPt td�| ��| j|� t| j|t| �\}}|dk r�t td�| ��t | j|�\}}|dk r�t td�| ��|r�yt
| j|�\}} W n$ t k
r� t td�| ��Y nX n|t | j|�\}}|dk �rt td�| ��|�s0t td �| ��yt
| j|�\}} W n& t k
�rj t td�| ��Y nX |dk�rt| �}
|
d k�r�| j|�}
td
k�r�|dk�r�t| j|
t|�� |dk�r�t| j|
|� |dk�r�t| j|
|� t| j| |
�}|dk �r:t td �| ��n(t| j| d �}|dk �r:t td �| ��t| j|| �}|dk �rbt td �| ��t|� t| � |�s|d
}| jjdtj d|d�t | |d||f � d S )Nr z"Requires setype, serange or seuser�<<none>>z1Type %s is invalid, must be a file or device typer z Could not create a key for %sz1Could not check if file context for %s is definedz#Could not query file context for %sz"File context for %s is not definedr= z!Could not set file context for %sz$Could not modify file context for %sr� z9resrc=fcontext op=modify %s ftype=%s tcontext=%s:%s:%s:%sr� r� )r r� ) r^ r rZ r� r� rI r� rW r� r� Zsemanage_fcontext_query�OSErrorr� Z semanage_fcontext_query_local�semanage_fcontext_get_conr� r` r� rO r� r� r� r� r� r� rY r6 r r� r� ) r rz r r� r. r� rL r� r~ r� r� r r r r�
sf
zfcontextRecords.__modifyc C s& | j � | j|||||� | j� d S )N)rb r� r8 )r rz r r� r. r� r r r r� C
s zfcontextRecords.modifyc C s� t | j�\}}|dk r"ttd���| j� x�|D ]�}t|�}t|�}t|�}t| j|t | �\}}|dk rzttd�| ��t
| j|�}|dk r�ttd�| ��t |� | j j
dtjd|d�tt| f � q0W i | _d| _| j� d S )Nr z Could not list the file contextsz Could not create a key for %sz$Could not delete the file context %sz$resrc=fcontext op=delete %s ftype=%sr� T)� semanage_fcontext_list_localrW r^ r rb �semanage_fcontext_get_expr�semanage_fcontext_get_type� semanage_fcontext_get_type_strr� r� �semanage_fcontext_del_localr� rY r6 r r� r� �file_type_str_to_optionrs ru r8 )r rL �flistr� rz r� � ftype_strr� r r r ra H
s&
*zfcontextRecords.deleteallc C s: || j j� kr>| j j|� d| _| jjdtjd|d� � d S t| j |t
| �\}}|dk rlt t d�| ��t
| j |�\}}|dk r�t t d�| ��|s�t| j |�\}}|dk r�t t d�| ��|r�t t d�| ��nt t d�| ��t| j |�}|dk �r t t d �| ��t|� | jjd
tjd|d�t| f � d S ) NTz!resrc=fcontext op=delete-equal %sr� r z Could not create a key for %sz1Could not check if file context for %s is definedz;File context for %s is defined in policy, cannot be deletedz"File context for %s is not definedz$Could not delete file context for %sz$resrc=fcontext op=delete %s ftype=%s)rs r� �popru rY r6 r r� r� rW r� r^ r r� r� r� r� r� )r rz r� rL r� r~ r r r r� b
s.
zfcontextRecords.__deletec C s | j � | j||� | j� d S )N)rb �_fcontextRecords__deleter8 )r rz r� r r r r� �
s zfcontextRecords.deleter c C s |rt | j�\}| _n�t| j�\}| _|dk r:ttd���t| j�\}}|dk r\ttd���t | j�\}}|dk r~ttd���| j|7 _| j|7 _i }xd| jD ]Z}t|�}t|�}t |�} t
|�}
|
r�t |
�t |
�t
|
�t|
�f||| f< q�|
||| f< q�W |S )Nr z Could not list file contextsz1Could not list file contexts for home directoriesz"Could not list local file contexts)r� rW r� Zsemanage_fcontext_listr^ r Z semanage_fcontext_list_homedirsr� r� r� r� rZ r[ r r
) r rz rL Z
fchomedirsZfclocalr� r� �exprr� r� r� r r r rr �
s. &zfcontextRecords.get_allc C s� g }| j d�}x�|j� D ]t}|| r|| d rd|jdt|d || d || d |d f � q|jdt|d || d |d f � qW t| j�r�x*| jj� D ] }|jd| j| |f � q�W |S ) NTr z-a -f %s -t %s -r '%s' '%s'r= rw r z-a -f %s -t %s '%s'z -a -e %s %s)rr r� r' r� rH rs )r r � fcon_dictr� rz r r r rd �
s
4,
zfcontextRecords.customizedr= c C s� | j |�}t|�dk�r|r:tdtd�td�td�f � |rH|j� }n t|j� �}x�|D ]�}|| r�tr�td|d |d || d || d || d t|| d d
�f � n6td |d |d || d || d || d f � qZtd |d |d f � qZW t| j��rV|�sV|�r*ttd
�� x*| jj� D ] }td|| j| f � �q6W t| j ��r�|�rtttd�� x*| j j� D ] }td|| j | f � �q�W d S )Nr z%-50s %-18s %s
zSELinux fcontextrS r_ z%-50s %-18s %s:%s:%s:%s r= rw r Fz%-50s %-18s %s:%s:%s z%-50s %-18s <<None>>z,
SELinux Distribution fcontext Equivalence
z%s = %sz%
SELinux Local fcontext Equivalence
)
rr rH rx r r� r� r` rN rt rs )r ry rz r� Zfkeysr� rz r r r r{ �
s0
H8 zfcontextRecords.list)N)r� )r r r� )r r r� )r )r= r )r9 r: r; r� r! r8 r� r� r� rI r� r� r� r� r� ra r� r� rr rd r{ r r r r rq - s$
&
6
C!
rq c @ sl e Zd Zddd�Zdd� Zd dd�Zd d
� Zd d � Zd
d� Zd dd�Z dd� Z
dd� Z dd� Z d dd�Z
dS ) �booleanRecordsNc C s� t j| |� i | _d| jd< d| jd< d| jd< d| jd< d| jd< d| jd< y tj� \}| _tj� \}}W n g | _d }Y nX | jd ks�| j|kr�d
| _nd | _d S ) Nr= ZTRUEr ZFALSEZONZOFF�1�0r TF) rP r! �dictrG Zsecurity_get_boolean_names�current_booleansrX rR � modify_local)r rT rL Zptyper r r r! �
s"
zbooleanRecords.__init__c C sL t j|�}t| j|�\}}|dk r2ttd�| ��t| j|�\}}|dk rZttd�| ��|snttd�| ��t| j|�\}}|dk r�ttd�| ��|j� | j kr�t
|| j |j� � n ttd�dj | j j � � ��| j
o�|| jk�rt| j||�}|dk �rttd�| ��t| j||�}|dk �r8ttd �| ��t|� t|� d S )
Nr z Could not create a key for %sz(Could not check if boolean %s is definedzBoolean %s is not definedz Could not query file context %sz0You must specify one of the following values: %sz, z(Could not set active value of boolean %szCould not modify boolean %s)rG �selinux_boolean_sub�semanage_bool_key_createrW r^ r �semanage_bool_existsZsemanage_bool_query�upperr� Zsemanage_bool_set_valuer� r� r� r� Zsemanage_bool_set_activeZsemanage_bool_modify_local�semanage_bool_key_freeZsemanage_bool_free)r r, �valuerL r� r~ r r r r Z__mod�
s0
zbooleanRecords.__modFc C s� | j � |r�t|�}x||j� jd�D ]j}|j� }t|�dkr>q$y|jd�\}}W n( tk
rx ttd||f ���Y nX | j|j� |j� � q$W |j � n | j||� | j
� d S )Nr� r �=zBad format %s: Record %s) rb r� r� r� rx rH r^ r �_booleanRecords__modr� r8 )r r, r� �use_filer� r Zboolnamera r r r r� s
zbooleanRecords.modifyc C s� t j|�}t| j|�\}}|dk r2ttd�| ��t| j|�\}}|dk rZttd�| ��|snttd�| ��t| j|�\}}|dk r�ttd�| ��|s�ttd�| ��t| j|�}|dk r�ttd�| ��t |� d S )Nr z Could not create a key for %sz(Could not check if boolean %s is definedzBoolean %s is not definedz2Boolean %s is defined in policy, cannot be deletedzCould not delete boolean %s)
rG r� r� rW r^ r r� Zsemanage_bool_exists_localZsemanage_bool_del_localr� )r r, rL r� r~ r r r r� # s$
zbooleanRecords.__deletec C s | j � | j|� | j� d S )N)rb �_booleanRecords__deleter8 )r r, r r r r� ; s
zbooleanRecords.deletec C sZ t | j�\}| _|dk r$ttd���| j� x | jD ]}t|�}| j|� q4W | j� d S )Nr zCould not list booleans) �semanage_bool_list_localrW �blistr^ r rb �semanage_bool_get_namer� r8 )r rL �booleanr, r r r ra @ s zbooleanRecords.deleteallr c C s� i }|rt | j�\}| _nt| j�\}| _|dk r>ttd���x~| jD ]t}g }t|�}|jt|�� | j r�|| j
kr�|jt j |�� |jt j
|�� n |j|d � |j|d � |||< qFW |S )Nr zCould not list booleans)r� rW r� Zsemanage_bool_listr^ r r� r' Zsemanage_bool_get_valuer� r� rG Z security_get_boolean_pendingZsecurity_get_boolean_active)r rz r� rL r� r� r, r r r rr M s" zbooleanRecords.get_allc C s t j|�}tj|�S )N)rG r� rZ Z boolean_desc)r r, r r r �get_descd s
zbooleanRecords.get_descc C s t j|�}tj|�S )N)rG r� rZ Zboolean_category)r r, r r r � get_categoryh s
zbooleanRecords.get_categoryc C sJ g }| j d�}x6t|j� �D ]&}|| r |jd|| d |f � q W |S )NTz -m -%s %srw )rr r� r� r' )r r r� r� r r r rd l s
zbooleanRecords.customizedTc C s� t d�t d�f}|rX| j|�}x4t|j� �D ]$}|| r,td||| d f � q,W d S | j|�}t|�dkrrd S |r�tdt d�t d�t d �t d
�f � xNt|j� �D ]>}|| r�td |||| d ||| d | j|�f � q�W d S ) Nr� r� z%s=%srw r z%-30s %s %s %s
zSELinux booleanZStateZDefaultZ Descriptionz%-30s (%-5s,%5s) %s)r rr r� r� rx rH r� )r ry rz r� Zon_offr� r� r r r r{ t s
$zbooleanRecords.list)N)NF)r )TFF)r9 r: r; r! r� r� r� r� ra rr r� r� rd r{ r r r r r� �
s
r� )r )r= )r= )9r� r� rG r| rB r( r r
r5 ZPROGNAMErZ r rD �gettext�kwargs� version_infoZinstall�builtinsr* �__dict__r� Z __builtin__r r> r� ZSEMANAGE_FCONTEXT_ALLZSEMANAGE_FCONTEXT_REGZSEMANAGE_FCONTEXT_DIRZSEMANAGE_FCONTEXT_CHARZSEMANAGE_FCONTEXT_BLOCKZSEMANAGE_FCONTEXT_SOCKZSEMANAGE_FCONTEXT_LINKZSEMANAGE_FCONTEXT_PIPEr� r� r Z audit_closer r r� r? rF rN rO rP rf r� r� r� r� r� r r- rA rb rq r� r r r r �<module> s�
$$
ik
H $ M . __pycache__/six.cpython-36.pyc 0000644 00000060674 14751155147 0012234 0 ustar 00 3
��s`�x � K @ s� d Z ddlmZ ddlZddlZddlZddlZddlZdZdZ ej
d dkZ ej
d dkZ ej
dd� �d�kZ
e r�efZefZefZeZeZejZn�efZeefZeejfZe ZeZej j d �r�e�d��ZnLG d d
� d
e �Z ye!e � � W n e"k
�r e�d��ZY n X e�d��Z[ dd� Z#dd� Z$G dd� de �Z%G dd� de%�Z&G dd� dej'�Z(G dd� de%�Z)G dd � d e �Z*e*e+�Z,G d d � d e(�Z-e)d d d d!�e)d"d#d$d%d"�e)d&d#d#d'd&�e)d(d)d$d*d(�e)d+d)d,�e)d-d#d$d.d-�e)d/d0d0d1d/�e)d2d0d0d/d2�e)d3d4d5�e)d6d)d$d7d6�e)d8d)e
�r&d9nd:d;�e)d<d)d=�e)d>d?d@dA�e)d!d!d �e)dBdBdC�e)dDdDdC�e)dEdEdC�e)d7d)d$d7d6�e)dFd#d$dGdF�e)dHd#d#dIdH�e&d$d)�e&dJdK�e&dLdM�e&dNdOdP�e&dQdRdQ�e&dSdTdU�e&dVdWdX�e&dYdZd[�e&d\d]d^�e&d_d`da�e&dbdcdd�e&dedfdg�e&dhdidj�e&dkdldm�e&dndodp�e&dqdqdr�e&dsdsdr�e&dtdtdr�e&dududv�e&dwdx�e&dydz�e&d{d|�e&d}d~d}�e&dd��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�e+d� d��e&d�e+d� d��e&d�e+d� e+d� �e&d�d�d��e&d�d�d��e&d�d�d��g@Z.ej d�k�rne.e&d�d��g7 Z.x:e.D ]2Z/e0e-e/j1e/� e2e/e&��rte,j3e/d�e/j1 � �qtW [/e.e-_.e-e+d� �Z4e,j3e4d�� G d�d�� d�e(�Z5e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)dAd�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d�d�dσe)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��gZ6x e6D ]Z/e0e5e/j1e/� �q�W [/e6e5_.e,j3e5e+d� �d�dۃ G d�d݄ d�e(�Z7e)d�d�d��e)d�d�d��e)d�d�d��gZ8x e8D ]Z/e0e7e/j1e/� �qPW [/e8e7_.e,j3e7e+d� �d�d� G d�d� d�e(�Z9e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)�d d�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�dd�d�e)�d d�d�e)�d
d�d�g#Z:x e:D ]Z/e0e9e/j1e/� �qW [/e:e9_.e,j3e9e+�d ��d �d
� G �d�d� �de(�Z;e)�dd��d�e)�dd��d�e)�dd��d�e)�dd��d�gZ<x e<D ]Z/e0e;e/j1e/� �q�W [/e<e;_.e,j3e;e+�d ��d�d� G �d�d� �de(�Z=e)�dd�d��gZ>x e>D ]Z/e0e=e/j1e/� � qW [/e>e=_.e,j3e=e+�d ��d �d � G �d �d � �d ej'�Z?e,j3e?e+d� ��d � �d!�d"� Z@�d#�d$� ZAe � r��d%ZB�d&ZC�d'ZD�d(ZE�d)ZF�d*ZGn$�d+ZB�d,ZC�d-ZD�d.ZE�d/ZF�d0ZGyeHZIW n" eJk
�
r �d1�d2� ZIY nX eIZHyeKZKW n" eJk
�
r< �d3�d4� ZKY nX e �
rh�d5�d6� ZLejMZN�d7�d8� ZOe ZPn>�d9�d6� ZL�d:�d;� ZN�d<�d8� ZOG �d=�d>� �d>e �ZPeKZKe#eL�d?� ejQeB�ZRejQeC�ZSejQeD�ZTejQeE�ZUejQeF�ZVejQeG�ZWe � rJ�d@�dA� ZX�dB�dC� ZY�dD�dE� ZZ�dF�dG� Z[ej\�dH�Z]ej\�dI�Z^ej\�dJ�Z_nT�dK�dA� ZX�dL�dC� ZY�dM�dE� ZZ�dN�dG� Z[ej\�dO�Z]ej\�dP�Z^ej\�dQ�Z_e#eX�dR� e#eY�dS� e#eZ�dT� e#e[�dU� e � rb�dV�dW� Z`�dX�dY� ZaebZcddldZdedje�dZ�jfZg[dejhd�ZiejjZkelZmddlnZnenjoZoenjpZp�d[Zqej
d
d
k� rT�d\Zr�d]Zsn �d^Zr�d_Zsnj�d`�dW� Z`�da�dY� ZaecZcebZg�db�dc� Zi�dd�de� Zkejtejuev�ZmddloZoeojo ZoZp�dfZq�d\Zr�d]Zse#e`�dg� e#ea�dh� �di�d[� Zw�dj�d^� Zx�dk�d_� Zye �
r.eze4j{�dl�Z|�d��dm�dn�Z}n�d��do�dp�Z|e|�dq� ej
dd� �d�k�
rje|�dr� n.ej
dd� �d�k�
r�e|�ds� n �dt�du� Z~eze4j{�dvd�Zedk�
r��dw�dx� Zej
dd� �d�k �
r�eZ��dy�dx� Ze#e}�dz� ej
dd� �d�k �r ej�ej�f�d{�d|�Z�nej�Z��d}�d~� Z��d�d�� Z��d��d�� Z�g Z�e+Z�e�� j��d��dk �rjg e�_�ej��r�x>e�ej��D ]0\Z�Z�ee��j+d k�r~e�j1e+k�r~ej�e�= P �q~W [�[�ej�j�e,� dS (� z6Utilities for writing code that runs on Python 2 and 3� )�absolute_importNz'Benjamin Peterson <benjamin@python.org>z1.11.0� � � �java� � c @ s e Zd Zdd� ZdS )�Xc C s dS )Nr r l � )�selfr
r
�/usr/lib/python3.6/six.py�__len__> s z X.__len__N)�__name__�
__module__� __qualname__r
r
r
r
r r < s r �? c C s
|| _ dS )z Add documentation to a function.N)�__doc__)�func�docr
r
r �_add_docK s r c C s t | � tj| S )z7Import module, returning the module after the last dot.)�
__import__�sys�modules)�namer
r
r �_import_moduleP s r c @ s e Zd Zdd� Zdd� ZdS )�
_LazyDescrc C s
|| _ d S )N)r )r r r
r
r �__init__X s z_LazyDescr.__init__c C sB | j � }t|| j|� yt|j| j� W n tk
r< Y nX |S )N)�_resolve�setattrr �delattr� __class__�AttributeError)r �obj�tp�resultr
r
r �__get__[ s z_LazyDescr.__get__N)r r r r r% r
r
r
r r V s r c s. e Zd Zd� fdd� Zdd� Zdd� Z� ZS ) � MovedModuleNc s2 t t| �j|� tr(|d kr |}|| _n|| _d S )N)�superr& r �PY3�mod)r r �old�new)r r
r r i s zMovedModule.__init__c C s
t | j�S )N)r r) )r r
r
r r r s zMovedModule._resolvec C s" | j � }t||�}t| ||� |S )N)r �getattrr )r �attr�_module�valuer
r
r � __getattr__u s
zMovedModule.__getattr__)N)r r r r r r0 �
__classcell__r
r
)r r r& g s r& c s( e Zd Z� fdd�Zdd� Zg Z� ZS )� _LazyModulec s t t| �j|� | jj| _d S )N)r' r2 r r r )r r )r r
r r ~ s z_LazyModule.__init__c C s ddg}|dd� | j D �7 }|S )Nr r c S s g | ]
}|j �qS r
)r )�.0r- r
r
r �
<listcomp>� s z'_LazyModule.__dir__.<locals>.<listcomp>)�_moved_attributes)r Zattrsr
r
r �__dir__� s z_LazyModule.__dir__)r r r r r6 r5 r1 r
r
)r r r2 | s r2 c s& e Zd Zd� fdd� Zdd� Z� ZS )�MovedAttributeNc sd t t| �j|� trH|d kr |}|| _|d kr@|d kr<|}n|}|| _n|| _|d krZ|}|| _d S )N)r' r7 r r( r) r- )r r Zold_modZnew_modZold_attrZnew_attr)r r
r r � s zMovedAttribute.__init__c C s t | j�}t|| j�S )N)r r) r, r- )r �moduler
r
r r � s
zMovedAttribute._resolve)NN)r r r r r r1 r
r
)r r r7 � s r7 c @ sV e Zd ZdZdd� Zdd� Zdd� Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z e Z dS )�_SixMetaPathImporterz�
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
c C s || _ i | _d S )N)r �
known_modules)r Zsix_module_namer
r
r r � s z _SixMetaPathImporter.__init__c G s& x |D ]}|| j | jd | < qW d S )N�.)r: r )r r) Z fullnames�fullnamer
r
r � _add_module� s
z _SixMetaPathImporter._add_modulec C s | j | jd | S )Nr; )r: r )r r< r
r
r � _get_module� s z _SixMetaPathImporter._get_moduleNc C s || j kr| S d S )N)r: )r r< �pathr
r
r � find_module� s
z _SixMetaPathImporter.find_modulec C s0 y
| j | S tk
r* td| ��Y nX d S )Nz!This loader does not know module )r: �KeyError� ImportError)r r< r
r
r Z __get_module� s
z!_SixMetaPathImporter.__get_modulec C sR y
t j| S tk
r Y nX | j|�}t|t�r>|j� }n| |_|t j|< |S )N)r r rA � _SixMetaPathImporter__get_module�
isinstancer& r �
__loader__)r r< r) r
r
r � load_module� s
z _SixMetaPathImporter.load_modulec C s t | j|�d�S )z�
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
�__path__)�hasattrrC )r r< r
r
r �
is_package� s z _SixMetaPathImporter.is_packagec C s | j |� dS )z;Return None
Required, if is_package is implementedN)rC )r r< r
r
r �get_code� s
z _SixMetaPathImporter.get_code)N)
r r r r r r= r> r@ rC rF rI rJ �
get_sourcer
r
r
r r9 � s
r9 c @ s e Zd ZdZg ZdS )� _MovedItemsz Lazy loading of moved objectsN)r r r r rG r
r
r
r rL � s rL Z cStringIO�io�StringIO�filter� itertools�builtinsZifilter� filterfalseZ ifilterfalse�inputZ __builtin__Z raw_input�internr �map�imap�getcwd�osZgetcwdu�getcwdbZ getoutputZcommands�
subprocess�rangeZxrangeZ
reload_module� importlibZimp�reload�reduce� functoolsZ shlex_quoteZpipesZshlexZquote�UserDict� collections�UserList�
UserString�zipZizip� zip_longestZ izip_longestZ configparserZ ConfigParser�copyregZcopy_regZdbm_gnuZgdbmzdbm.gnuZ
_dummy_threadZ dummy_threadZhttp_cookiejarZ cookielibzhttp.cookiejarZ http_cookiesZCookiez http.cookiesZ
html_entitiesZhtmlentitydefsz
html.entitiesZ html_parserZ
HTMLParserz html.parserZ http_clientZhttplibz http.clientZemail_mime_basezemail.MIMEBasezemail.mime.baseZemail_mime_imagezemail.MIMEImagezemail.mime.imageZemail_mime_multipartzemail.MIMEMultipartzemail.mime.multipartZemail_mime_nonmultipartzemail.MIMENonMultipartzemail.mime.nonmultipartZemail_mime_textzemail.MIMETextzemail.mime.textZBaseHTTPServerz http.serverZ
CGIHTTPServerZSimpleHTTPServerZcPickle�pickleZqueueZQueue�reprlib�reprZ socketserverZ SocketServer�_threadZthreadZtkinterZTkinterZtkinter_dialogZDialogztkinter.dialogZtkinter_filedialogZ
FileDialogztkinter.filedialogZtkinter_scrolledtextZ ScrolledTextztkinter.scrolledtextZtkinter_simpledialogZ SimpleDialogztkinter.simpledialogZ tkinter_tixZTixz tkinter.tixZ tkinter_ttkZttkz tkinter.ttkZtkinter_constantsZ Tkconstantsztkinter.constantsZ tkinter_dndZTkdndz tkinter.dndZtkinter_colorchooserZtkColorChooserztkinter.colorchooserZtkinter_commondialogZtkCommonDialogztkinter.commondialogZtkinter_tkfiledialogZ tkFileDialogZ tkinter_fontZtkFontz tkinter.fontZtkinter_messageboxZ tkMessageBoxztkinter.messageboxZtkinter_tksimpledialogZtkSimpleDialogZ urllib_parsez.moves.urllib_parsez urllib.parseZ urllib_errorz.moves.urllib_errorz urllib.errorZurllibz
.moves.urllibZurllib_robotparser� robotparserzurllib.robotparserZ
xmlrpc_clientZ xmlrpclibz
xmlrpc.clientZ
xmlrpc_serverZSimpleXMLRPCServerz
xmlrpc.serverZwin32�winreg�_winregzmoves.z.moves�movesc @ s e Zd ZdZdS )� Module_six_moves_urllib_parsez7Lazy loading of moved objects in six.moves.urllib_parseN)r r r r r
r
r
r ro B s ro Z ParseResultZurlparseZ SplitResultZparse_qsZ parse_qslZ urldefragZurljoinZurlsplitZ
urlunparseZ
urlunsplitZ
quote_plusZunquoteZ unquote_plusZunquote_to_bytesZ urlencodeZ
splitqueryZsplittagZ splituserZ
splitvalueZ
uses_fragmentZ uses_netlocZ uses_paramsZ
uses_queryZ
uses_relativezmoves.urllib_parsezmoves.urllib.parsec @ s e Zd ZdZdS )� Module_six_moves_urllib_errorz7Lazy loading of moved objects in six.moves.urllib_errorN)r r r r r
r
r
r rp l s rp ZURLErrorZurllib2Z HTTPErrorZContentTooShortErrorz.moves.urllib.errorzmoves.urllib_errorzmoves.urllib.errorc @ s e Zd ZdZdS )� Module_six_moves_urllib_requestz9Lazy loading of moved objects in six.moves.urllib_requestN)r r r r r
r
r
r rq � s rq Zurlopenzurllib.requestZinstall_openerZ build_openerZ pathname2urlZ url2pathnameZ
getproxiesZRequestZOpenerDirectorZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZ BaseHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZHTTPErrorProcessorZ urlretrieveZ
urlcleanupZ URLopenerZFancyURLopenerZ proxy_bypassZparse_http_listZparse_keqv_listz.moves.urllib.requestzmoves.urllib_requestzmoves.urllib.requestc @ s e Zd ZdZdS )� Module_six_moves_urllib_responsez:Lazy loading of moved objects in six.moves.urllib_responseN)r r r r r
r
r
r rr � s rr Zaddbasezurllib.responseZ addclosehookZaddinfoZ
addinfourlz.moves.urllib.responsezmoves.urllib_responsezmoves.urllib.responsec @ s e Zd ZdZdS )�#Module_six_moves_urllib_robotparserz=Lazy loading of moved objects in six.moves.urllib_robotparserN)r r r r r
r
r
r rs � s rs ZRobotFileParserz.moves.urllib.robotparserzmoves.urllib_robotparserzmoves.urllib.robotparserc @ sN e Zd ZdZg Zejd�Zejd�Zejd�Z ejd�Z
ejd�Z dd� Z d S )
�Module_six_moves_urllibzICreate a six.moves.urllib namespace that resembles the Python 3 namespacezmoves.urllib_parsezmoves.urllib_errorzmoves.urllib_requestzmoves.urllib_responsezmoves.urllib_robotparserc C s dddddgS )N�parse�error�request�responserk r
)r r
r
r r6 � s z Module_six_moves_urllib.__dir__N)
r r r r rG � _importerr> ru rv rw rx rk r6 r
r
r
r rt � s
rt z moves.urllibc C s t t| j| � dS )zAdd an item to six.moves.N)r rL r )Zmover
r
r �add_move� s rz c C sX yt t| � W nD tk
rR y tj| = W n" tk
rL td| f ��Y nX Y nX dS )zRemove item from six.moves.zno such move, %rN)r rL r! rn �__dict__rA )r r
r
r � remove_move� s r| �__func__�__self__� __closure__�__code__� __defaults__� __globals__�im_funcZim_selfZ func_closureZ func_codeZ
func_defaultsZ func_globalsc C s | j � S )N)�next)�itr
r
r �advance_iterator s r� c C s t dd� t| �jD ��S )Nc s s | ]}d |j kV qdS )�__call__N)r{ )r3 �klassr
r
r � <genexpr> s zcallable.<locals>.<genexpr>)�any�type�__mro__)r" r
r
r �callable s r� c C s | S )Nr
)�unboundr
r
r �get_unbound_function s r� c C s | S )Nr
)r �clsr
r
r �create_unbound_method# s r� c C s | j S )N)r� )r� r
r
r r� ( s c C s t j| ||j�S )N)�types�
MethodTyper )r r" r
r
r �create_bound_method+ s r� c C s t j| d |�S )N)r� r� )r r� r
r
r r� . s c @ s e Zd Zdd� ZdS )�Iteratorc C s t | �j| �S )N)r� �__next__)r r
r
r r� 3 s z
Iterator.nextN)r r r r� r
r
r
r r� 1 s r� z3Get the function out of a possibly unbound functionc K s t | jf |��S )N)�iter�keys)�d�kwr
r
r �iterkeysD s r� c K s t | jf |��S )N)r� �values)r� r� r
r
r �
itervaluesG s r� c K s t | jf |��S )N)r� �items)r� r� r
r
r � iteritemsJ s r� c K s t | jf |��S )N)r� Zlists)r� r� r
r
r � iterlistsM s r� r� r� r� c K s | j f |�S )N)r� )r� r� r
r
r r� V s c K s | j f |�S )N)r� )r� r� r
r
r r� Y s c K s | j f |�S )N)r� )r� r� r
r
r r� \ s c K s | j f |�S )N)r� )r� r� r
r
r r� _ s �viewkeys�
viewvalues� viewitemsz1Return an iterator over the keys of a dictionary.z3Return an iterator over the values of a dictionary.z?Return an iterator over the (key, value) pairs of a dictionary.zBReturn an iterator over the (key, [values]) pairs of a dictionary.c C s
| j d�S )Nzlatin-1)�encode)�sr
r
r �bq s r� c C s | S )Nr
)r� r
r
r �ut s r� z>B�assertCountEqualZassertRaisesRegexpZassertRegexpMatches�assertRaisesRegex� assertRegexc C s | S )Nr
)r� r
r
r r� � s c C s t | jdd�d�S )Nz\\z\\\\Zunicode_escape)�unicode�replace)r� r
r
r r� � s c C s t | d �S )Nr )�ord)Zbsr
r
r �byte2int� s r� c C s t | | �S )N)r� )Zbuf�ir
r
r �
indexbytes� s r� ZassertItemsEqualz Byte literalz Text literalc O s t | t�||�S )N)r, �_assertCountEqual)r �args�kwargsr
r
r r� � s c O s t | t�||�S )N)r, �_assertRaisesRegex)r r� r� r
r
r r� � s c O s t | t�||�S )N)r, � _assertRegex)r r� r� r
r
r r� � s �execc
C s: z*|d kr| � }|j |k r$|j|��|�W d d }d }X d S )N)�
__traceback__�with_traceback)r# r/ �tbr
r
r �reraise� s
r� c C sB |dkr*t jd�}|j}|dkr&|j}~n |dkr6|}td� dS )z Execute code in a namespace.Nr z exec _code_ in _globs_, _locs_)r � _getframe� f_globals�f_localsr� )Z_code_Z_globs_Z_locs_�framer
r
r �exec_� s
r� zedef reraise(tp, value, tb=None):
try:
raise tp, value, tb
finally:
tb = None
z�def raise_from(value, from_value):
try:
if from_value is None:
raise value
raise value from from_value
finally:
value = None
zrdef raise_from(value, from_value):
try:
raise value from from_value
finally:
value = None
c C s | �d S )Nr
)r/ Z
from_valuer
r
r �
raise_from� s r� �printc
s6 |j dtj�� � dkrdS � fdd�}d}|j dd�}|dk r`t|t�rNd}nt|t�s`td��|j d d�}|dk r�t|t�r�d}nt|t�s�td
��|r�td ��|s�x | D ]}t|t�r�d}P q�W |r�td �}td
�}nd }d
}|dkr�|}|dk� r�|}x,t| �D ] \} }| �r ||� ||� �qW ||� dS )z4The new-style print function for Python 2.4 and 2.5.�fileNc sd t | t�st| �} t � t�rVt | t�rV� jd k rVt� dd �}|d krHd}| j� j|�} � j| � d S )N�errors�strict) rD �
basestring�strr� r� �encodingr, r� �write)�datar� )�fpr
r r� � s
zprint_.<locals>.writeF�sepTz sep must be None or a string�endz end must be None or a stringz$invalid keyword arguments to print()�
� )�popr �stdoutrD r� r� � TypeError� enumerate)
r� r� r� Z want_unicoder� r� �arg�newlineZspacer� r
)r� r �print_� sL
r� c O s< |j dtj�}|jdd�}t| |� |r8|d k r8|j� d S )Nr� �flushF)�getr r� r� �_printr� )r� r� r� r� r
r
r r� s
zReraise an exception.c s � ��fdd�}|S )Nc s t j�� ��| �} �| _| S )N)r_ �wraps� __wrapped__)�f)�assigned�updated�wrappedr
r �wrapper* s zwraps.<locals>.wrapperr
)r� r� r� r� r
)r� r� r� r r� ( s r� c s& G � �fdd�dt �}t j|df i �S )z%Create a base class with a metaclass.c s, e Zd Z� �fdd�Ze� �fdd��ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )Nr
)r� r �
this_basesr� )�bases�metar
r �__new__: s z)with_metaclass.<locals>.metaclass.__new__c s �j |� �S )N)� __prepare__)r� r r� )r� r� r
r r� = s z-with_metaclass.<locals>.metaclass.__prepare__N)r r r r� � classmethodr� r
)r� r� r
r � metaclass8 s r� Ztemporary_class)r� r� )r� r� r� r
)r� r� r �with_metaclass3 s r� c s � fdd�}|S )z6Class decorator for creating a class with a metaclass.c sl | j j� }|jd�}|d k rDt|t�r,|g}x|D ]}|j|� q2W |jdd � |jdd � � | j| j|�S )N� __slots__r{ � __weakref__)r{ �copyr� rD r� r� r � __bases__)r� Z orig_vars�slotsZ slots_var)r� r
r r� E s
z add_metaclass.<locals>.wrapperr
)r� r� r
)r� r �
add_metaclassC s r� c C s2 t r.d| jkr td| j ��| j| _dd� | _| S )a
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
�__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().c S s | j � jd�S )Nzutf-8)� __unicode__r� )r r
r
r �<lambda>a s z-python_2_unicode_compatible.<locals>.<lambda>)�PY2r{ �
ValueErrorr r� r� )r� r
r
r �python_2_unicode_compatibleS s
r� �__spec__)r r l i���l i���l l ���� )N)NN)r r )r r )r r )r r )�r Z
__future__r r_ rP �operatorr r� �
__author__� __version__� version_infor� r( ZPY34r� Z string_types�intZ
integer_typesr� Z class_typesZ text_type�bytesZ binary_type�maxsizeZMAXSIZEr� ZlongZ ClassTyper� �platform�
startswith�objectr �len�
OverflowErrorr r r r& �
ModuleTyper2 r7 r9 r ry rL r5 r- r r rD r= rn ro Z _urllib_parse_moved_attributesrp Z _urllib_error_moved_attributesrq Z _urllib_request_moved_attributesrr Z!_urllib_response_moved_attributesrs Z$_urllib_robotparser_moved_attributesrt rz r| Z
_meth_funcZ
_meth_selfZ
_func_closureZ
_func_codeZ_func_defaultsZ
_func_globalsr� r� � NameErrorr� r� r� r� r� r� �
attrgetterZget_method_functionZget_method_selfZget_function_closureZget_function_codeZget_function_defaultsZget_function_globalsr� r� r� r� � methodcallerr� r� r� r� r� �chrZunichr�struct�Struct�packZint2byte�
itemgetterr� �getitemr� r� Z iterbytesrM rN �BytesIOr� r� r� �partialrV r� r� r� r� r, rQ r� r� r� r� r� �WRAPPER_ASSIGNMENTS�WRAPPER_UPDATESr� r� r� r� rG � __package__�globalsr� r� �submodule_search_locations� meta_pathr� r� Zimporter�appendr
r
r
r �<module> s�
>
5 __pycache__/pyparsing.cpython-36.pyc 0000644 00000610513 14751155147 0013436 0 ustar 00 3
��s`� � @ s� d Z dZdZdZddlZddlmZ ddlZddl Z ddl
Z
ddl Z ddl Z ddl
Z
ddlZddlZddlZddlmZ yddlmZ W n ek
r� ddlmZ Y nX ydd l
mZ W n> ek
r� ydd lmZ W n ek
r� dZY nX Y nX d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrgiZee j�dds� Z e d dskZ e �r"e j Z e Z!e"Z#e Z$e%e&e'e(e)ee*e+e,e-e.g Z/nbe j0Z e1Z2dtdu� Z$g Z/ddl3Z3xBdvj4� D ]6Z5ye/j6e7e3e5�� W n e8k
�r| �wJY nX �qJW e9dwdx� e2dy�D ��Z:dzd{� Z;G d|d}� d}e<�Z=ej>ej? Z@d~ZAeAd ZBe@eA ZCe"d��ZDd�jEd�dx� ejFD ��ZGG d�d!� d!eH�ZIG d�d#� d#eI�ZJG d�d%� d%eI�ZKG d�d'� d'eK�ZLG d�d*� d*eH�ZMG d�d�� d�e<�ZNG d�d&� d&e<�ZOe
jPjQeO� d�d=� ZRd�dN� ZSd�dK� ZTd�d�� ZUd�d�� ZVd�d�� ZWd�dU� ZX�d/d�d��ZYG d�d(� d(e<�ZZG d�d0� d0eZ�Z[G d�d� de[�Z\G d�d� de[�Z]G d�d� de[�Z^e^Z_e^eZ_`G d�d� de[�ZaG d�d � d e^�ZbG d�d � d ea�ZcG d�dp� dpe[�ZdG d�d3� d3e[�ZeG d�d+� d+e[�ZfG d�d)� d)e[�ZgG d�d
� d
e[�ZhG d�d2� d2e[�ZiG d�d�� d�e[�ZjG d�d� dej�ZkG d�d� dej�ZlG d�d� dej�ZmG d�d.� d.ej�ZnG d�d-� d-ej�ZoG d�d5� d5ej�ZpG d�d4� d4ej�ZqG d�d$� d$eZ�ZrG d�d
� d
er�ZsG d�d � d er�ZtG d�d� der�ZuG d�d� der�ZvG d�d"� d"eZ�ZwG d�d� dew�ZxG d�d � d ew�ZyG d�d�� d�ew�ZzG d�d � d ez�Z{G d�d6� d6ez�Z|G d�d�� d�e<�Z}e}� Z~G d�d � d ew�ZG d�d,� d,ew�Z�G d�d� dew�Z�G d�d�� d�e��Z�G d�d1� d1ew�Z�G d�d� de��Z�G d�d� de��Z�G d�d� de��Z�G d�d/� d/e��Z�G d�d � d e<�Z�d�df� Z��d0d�dD�Z��d1d�d@�Z�d�d΄ Z�d�dS� Z�d�dR� Z�d�d҄ Z��d2d�dW�Z�d�dE� Z��d3d�dk�Z�d�dl� Z�d�dn� Z�e\� j�dG�Z�el� j�dM�Z�em� j�dL�Z�en� j�de�Z�eo� j�dd�Z�eeeDd�d�dڍj�d�d܄ �Z�efd݃j�d�d܄ �Z�efd߃j�d�d܄ �Z�e�e�B e�B eeeGd�dyd�B efd�e j��B Z�e�e�e�d� e� �Z�e^d�ed�j�d� e�e{e�e�B ��j�d� d� Z�d�dc� Z�d�dQ� Z�d�d`� Z�d�d^� Z�d�dq� Z�e�d�d܄ �Z�e�d�d܄ �Z�d�d� Z�d�dO� Z�d�dP� Z�d�di� Z�e<� e�_��d4d�do�Z�e=� Z�e<� e�_�e<� e�_�e�d��e�d��fd�dm�Z�e�Z�e�efd��d� �j�d��Z�e�efd��d� �j�d��Z�e�efd��d� efd��d� B �j��d �Z�e�e_�d�e�j� �j��d�Z�d�d�de�j� f�ddT�Z��d5�ddj�Z�e��d�Z�e��d�Z�e�eee@eC�d �j��d��\Z�Z�e�e��d j4� �d
��Z�ef�d �d jEe�jà � �d
�j��d�ZĐdd_� Z�e�ef�d��d �j��d�Z�ef�d�j��d�Z�ef�d�jȃ j��d�Z�ef�d�j��d�Z�e�ef�d��d e�B �j��d�Z�e�Z�ef�d�j��d�Z�e�e{eeeGdɐd �eee�d �e^dɃ em� � ��j j��d �Z�e�ee�j� e�B d��d ��j�d>�Z�G �d dr� dr�Z�eҐd!k� r�eb�d"�Z�eb�d#�Z�eee@eC�d$ �Z�e�eՐd%dӐd&�j�e��Z�e�e�eփ�j��d'�Zאd(e�B Z�e�eՐd%dӐd&�j�e��Z�e�e�eك�j��d)�Z�eӐd*�eؐd'� e� eڐd)� Z�e�jܐd+� e�j�jܐd,� e�j�jܐd,� e�j�jܐd-� ddl�Z�e�j�j�e�e�j�� e�j�jܐd.� dS (6 aS
pyparsing module - Classes and methods to define and execute parsing grammars
The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you
don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.
Here is a program to parse "Hello, World!" (or any greeting of the form
C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
The program outputs the following::
Hello, World! -> ['Hello', ',', 'World', '!']
The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of '+', '|' and '^' operators.
The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
object with named attributes.
The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.)
- quoted strings
- embedded comments
z2.1.10z07 Oct 2016 01:31 UTCz*Paul McGuire <ptmcg@users.sourceforge.net>� N)�ref)�datetime)�RLock)� OrderedDict�And�CaselessKeyword�CaselessLiteral�
CharsNotIn�Combine�Dict�Each�Empty�
FollowedBy�Forward�
GoToColumn�Group�Keyword�LineEnd� LineStart�Literal�
MatchFirst�NoMatch�NotAny� OneOrMore�OnlyOnce�Optional�Or�ParseBaseException�ParseElementEnhance�ParseException�ParseExpression�ParseFatalException� ParseResults�ParseSyntaxException�
ParserElement� QuotedString�RecursiveGrammarException�Regex�SkipTo� StringEnd� StringStart�Suppress�Token�TokenConverter�White�Word�WordEnd� WordStart�
ZeroOrMore� alphanums�alphas�
alphas8bit� anyCloseTag�
anyOpenTag�
cStyleComment�col�commaSeparatedList�commonHTMLEntity� countedArray�cppStyleComment�dblQuotedString�dblSlashComment�
delimitedList�dictOf�downcaseTokens�empty�hexnums� htmlComment�javaStyleComment�line�lineEnd� lineStart�lineno� makeHTMLTags� makeXMLTags�matchOnlyAtCol�matchPreviousExpr�matchPreviousLiteral�
nestedExpr�nullDebugAction�nums�oneOf�opAssoc�operatorPrecedence�
printables�punc8bit�pythonStyleComment� quotedString� removeQuotes�replaceHTMLEntity� replaceWith�
restOfLine�sglQuotedString�srange� stringEnd� stringStart�traceParseAction�
unicodeString� upcaseTokens�
withAttribute�
indentedBlock�originalTextFor�ungroup�
infixNotation� locatedExpr� withClass�
CloseMatch�tokenMap�pyparsing_common� c C s` t | t�r| S yt| �S tk
rZ t| �jtj� d�}td�}|jdd� � |j |�S X dS )a Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
then < returns the unicode object | encodes it with the default encoding | ... >.
�xmlcharrefreplacez&#\d+;c S s$ dt t| d dd� ��dd � S )Nz\ur � � ���)�hex�int)�t� rw � /usr/lib/python3.6/pyparsing.py�<lambda>� s z_ustr.<locals>.<lambda>N)
�
isinstanceZunicode�str�UnicodeEncodeError�encode�sys�getdefaultencodingr' �setParseAction�transformString)�obj�retZ
xmlcharrefrw rw rx �_ustr� s
r� z6sum len sorted reversed list tuple set any all min maxc c s | ]
}|V qd S )Nrw )�.0�yrw rw rx � <genexpr>� s r� rr c C s> d}dd� dj � D �}x"t||�D ]\}}| j||�} q"W | S )z/Escape &, <, >, ", ', etc. in a string of data.z&><"'c s s | ]}d | d V qdS )�&�;Nrw )r� �srw rw rx r� � s z _xml_escape.<locals>.<genexpr>zamp gt lt quot apos)�split�zip�replace)�dataZ from_symbolsZ
to_symbolsZfrom_Zto_rw rw rx � _xml_escape� s
r� c @ s e Zd ZdS )�
_ConstantsN)�__name__�
__module__� __qualname__rw rw rw rx r� � s r� �
0123456789Z ABCDEFabcdef�\ � c c s | ]}|t jkr|V qd S )N)�stringZ
whitespace)r� �crw rw rx r� � s c @ sP e Zd ZdZddd�Zedd� �Zdd � Zd
d � Zd d
� Z ddd�Z
dd� Z dS )r z7base exception class for all parsing runtime exceptionsr Nc C s> || _ |d kr || _d| _n || _|| _|| _|||f| _d S )Nr� )�loc�msg�pstr�
parserElement�args)�selfr� r� r� �elemrw rw rx �__init__� s zParseBaseException.__init__c C s | |j |j|j|j�S )z�
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
)r� r� r� r� )�cls�perw rw rx �_from_exception� s z"ParseBaseException._from_exceptionc C sN |dkrt | j| j�S |dkr,t| j| j�S |dkrBt| j| j�S t|��dS )z�supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
rJ r9 �columnrG N)r9 r� )rJ r� r� r9 rG �AttributeError)r� Zanamerw rw rx � __getattr__� s z ParseBaseException.__getattr__c C s d| j | j| j| jf S )Nz"%s (at char %d), (line:%d, col:%d))r� r� rJ r� )r� rw rw rx �__str__� s zParseBaseException.__str__c C s t | �S )N)r� )r� rw rw rx �__repr__� s zParseBaseException.__repr__�>!<c C s< | j }| jd }|r4dj|d|� |||d� f�}|j� S )z�Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
rr r� N)rG r� �join�strip)r� Z markerStringZline_strZ line_columnrw rw rx �
markInputline� s
z ParseBaseException.markInputlinec C s dj � tt| �� S )Nzlineno col line)r� �dir�type)r� rw rw rx �__dir__� s zParseBaseException.__dir__)r NN)r� ) r� r� r� �__doc__r� � classmethodr� r� r� r� r� r� rw rw rw rx r � s
c @ s e Zd ZdZdS )r aN
Exception thrown when parse expressions don't match class;
supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
N)r� r� r� r� rw rw rw rx r � s c @ s e Zd ZdZdS )r! znuser-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediatelyN)r� r� r� r� rw rw rw rx r! s c @ s e Zd ZdZdS )r# z�just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been foundN)r� r� r� r� rw rw rw rx r# s c @ s e Zd ZdZdd� Zdd� ZdS )r& zZexception thrown by L{ParserElement.validate} if the grammar could be improperly recursivec C s
|| _ d S )N)�parseElementTrace)r� �parseElementListrw rw rx r� s z"RecursiveGrammarException.__init__c C s
d| j S )Nz RecursiveGrammarException: %s)r� )r� rw rw rx r� s z!RecursiveGrammarException.__str__N)r� r� r� r� r� r� rw rw rw rx r& s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�_ParseResultsWithOffsetc C s ||f| _ d S )N)�tup)r� Zp1Zp2rw rw rx r� $ s z _ParseResultsWithOffset.__init__c C s
| j | S )N)r� )r� �irw rw rx � __getitem__& s z#_ParseResultsWithOffset.__getitem__c C s t | jd �S )Nr )�reprr� )r� rw rw rx r� ( s z _ParseResultsWithOffset.__repr__c C s | j d |f| _ d S )Nr )r� )r� r� rw rw rx � setOffset* s z!_ParseResultsWithOffset.setOffsetN)r� r� r� r� r� r� r� rw rw rw rx r� # s r� c @ s� e Zd ZdZd[dd�Zddddefdd�Zdd � Zefd
d �Zd d
� Z dd� Z
dd� Z dd� Z e Z
dd� Zdd� Zdd� Zdd� Zd d � Zer�eZeZeZn$eZeZeZd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd\d(d)�Z d*d+� Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z!d4d5� Z"d6d7� Z#d8d9� Z$d:d;� Z%d<d=� Z&d]d?d@�Z'dAdB� Z(dCdD� Z)dEdF� Z*d^dHdI�Z+dJdK� Z,dLdM� Z-d_dOdP�Z.dQdR� Z/dSdT� Z0dUdV� Z1dWdX� Z2dYdZ� Z3dS )`r" aI
Structured parse results, to provide multiple means of access to the parsed data:
- as a list (C{len(results)})
- by list index (C{results[0], results[1]}, etc.)
- by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
NTc C s" t || �r|S tj| �}d|_|S )NT)rz �object�__new__�_ParseResults__doinit)r� �toklist�name�asList�modalZretobjrw rw rx r� T s
zParseResults.__new__c
C s` | j rvd| _ d | _d | _i | _|| _|| _|d kr6g }||t�rP|d d � | _n ||t�rft|�| _n|g| _t � | _
|d k o�|�r\|s�d| j|< ||t �r�t |�}|| _||t
d �ttf�o�|d dg fk�s\||t�r�|g}|�r&||t��rt|j� d�| |< ntt|d �d�| |< || | _n6y|d | |< W n$ tttfk
�rZ || |< Y nX d S )NFr r� )r� �_ParseResults__name�_ParseResults__parent�_ParseResults__accumNames�_ParseResults__asList�_ParseResults__modal�list�_ParseResults__toklist�_generatorType�dict�_ParseResults__tokdictru r� r� �
basestringr" r� �copy�KeyError� TypeError�
IndexError)r� r� r� r� r� rz rw rw rx r� ] sB
$
zParseResults.__init__c C sP t |ttf�r| j| S || jkr4| j| d d S tdd� | j| D ��S d S )Nrr r c S s g | ] }|d �qS )r rw )r� �vrw rw rx �
<listcomp>� s z,ParseResults.__getitem__.<locals>.<listcomp>rs )rz ru �slicer� r� r� r" )r� r� rw rw rx r� � s
zParseResults.__getitem__c C s� ||t �r0| jj|t� �|g | j|< |d }nD||ttf�rN|| j|< |}n&| jj|t� �t |d�g | j|< |}||t�r�t| �|_ d S )Nr )
r� r� �getr� ru r� r� r" �wkrefr� )r� �kr� rz �subrw rw rx � __setitem__� s
"
zParseResults.__setitem__c
C s� t |ttf�r�t| j�}| j|= t |t�rH|dk r:||7 }t||d �}tt|j|�� �}|j� x^| j j
� D ]F\}}x<|D ]4}x.t |�D ]"\}\}} t || | |k �||< q�W q|W qnW n| j |= d S )Nr rr )
rz ru r� �lenr� r� �range�indices�reverser� �items� enumerater� )
r� r� ZmylenZremovedr� � occurrences�jr� �value�positionrw rw rx � __delitem__� s
$zParseResults.__delitem__c C s
|| j kS )N)r� )r� r� rw rw rx � __contains__� s zParseResults.__contains__c C s
t | j�S )N)r� r� )r� rw rw rx �__len__� s zParseResults.__len__c C s
| j S )N)r� )r� rw rw rx �__bool__� s zParseResults.__bool__c C s
t | j�S )N)�iterr� )r� rw rw rx �__iter__� s zParseResults.__iter__c C s t | jd d d� �S )Nrr rs )r� r� )r� rw rw rx � __reversed__� s zParseResults.__reversed__c C s$ t | jd�r| jj� S t| j�S d S )N�iterkeys)�hasattrr� r� r� )r� rw rw rx � _iterkeys� s
zParseResults._iterkeysc s � fdd�� j � D �S )Nc 3 s | ]}� | V qd S )Nrw )r� r� )r� rw rx r� � s z+ParseResults._itervalues.<locals>.<genexpr>)r� )r� rw )r� rx � _itervalues� s zParseResults._itervaluesc s � fdd�� j � D �S )Nc 3 s | ]}|� | fV qd S )Nrw )r� r� )r� rw rx r� � s z*ParseResults._iteritems.<locals>.<genexpr>)r� )r� rw )r� rx �
_iteritems� s zParseResults._iteritemsc C s t | j� �S )zVReturns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).)r� r� )r� rw rw rx �keys� s zParseResults.keysc C s t | j� �S )zXReturns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).)r� �
itervalues)r� rw rw rx �values� s zParseResults.valuesc C s t | j� �S )zfReturns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).)r� � iteritems)r� rw rw rx r� � s zParseResults.itemsc C s
t | j�S )z�Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names.)�boolr� )r� rw rw rx �haskeys� s zParseResults.haskeysc O s� |s
dg}x6|j � D ]*\}}|dkr2|d |f}qtd| ��qW t|d t�sht|�dksh|d | kr�|d }| | }| |= |S |d }|S dS )a�
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
rr �defaultr z-pop() got an unexpected keyword argument '%s'Nrs )r� r� rz ru r� )r� r� �kwargsr� r� �indexr� Z defaultvaluerw rw rx �pop� s " zParseResults.popc C s || kr| | S |S dS )ai
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
Nrw )r� �key� defaultValuerw rw rx r� s zParseResults.getc C sZ | j j||� xF| jj� D ]8\}}x.t|�D ]"\}\}}t||||k �||< q,W qW dS )a
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
N)r� �insertr� r� r� r� )r� r� ZinsStrr� r� r� r� r� rw rw rx r� 2 s zParseResults.insertc C s | j j|� dS )a�
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
N)r� �append)r� �itemrw rw rx r� F s zParseResults.appendc C s$ t |t�r| |7 } n | jj|� dS )a
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
N)rz r" r� �extend)r� Zitemseqrw rw rx r� T s
zParseResults.extendc C s | j dd�= | jj� dS )z7
Clear all elements and results names.
N)r� r� �clear)r� rw rw rx r� f s zParseResults.clearc C sf y| | S t k
r dS X || jkr^|| jkrD| j| d d S tdd� | j| D ��S ndS d S )Nr� rr r c S s g | ] }|d �qS )r rw )r� r� rw rw rx r� w s z,ParseResults.__getattr__.<locals>.<listcomp>rs )r� r� r� r" )r� r� rw rw rx r� m s
zParseResults.__getattr__c C s | j � }||7 }|S )N)r� )r� �otherr� rw rw rx �__add__{ s zParseResults.__add__c s� |j rnt| j���fdd�� |j j� }� fdd�|D �}x4|D ],\}}|| |< t|d t�r>t| �|d _q>W | j|j7 _| jj |j� | S )Nc s | dk r � S | � S )Nr rw )�a)�offsetrw rx ry � s z'ParseResults.__iadd__.<locals>.<lambda>c s4 g | ],\}}|D ] }|t |d � |d ��f�qqS )r rr )r� )r� r� �vlistr� )� addoffsetrw rx r� � s z)ParseResults.__iadd__.<locals>.<listcomp>r )
r� r� r� r� rz r" r� r� r� �update)r� r� Z
otheritemsZotherdictitemsr� r� rw )r r rx �__iadd__� s
zParseResults.__iadd__c C s& t |t�r|dkr| j� S || S d S )Nr )rz ru r� )r� r� rw rw rx �__radd__� s zParseResults.__radd__c C s dt | j�t | j�f S )Nz(%s, %s))r� r� r� )r� rw rw rx r� � s zParseResults.__repr__c C s ddj dd� | jD �� d S )N�[z, c s s( | ] }t |t�rt|�nt|�V qd S )N)rz r" r� r� )r� r� rw rw rx r� � s z'ParseResults.__str__.<locals>.<genexpr>�])r� r� )r� rw rw rx r� � s zParseResults.__str__r� c C sP g }xF| j D ]<}|r"|r"|j|� t|t�r:||j� 7 }q |jt|�� q W |S )N)r� r� rz r" �
_asStringListr� )r� �sep�outr� rw rw rx r
� s
zParseResults._asStringListc C s dd� | j D �S )a�
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
c S s" g | ]}t |t�r|j� n|�qS rw )rz r" r� )r� �resrw rw rx r� � s z'ParseResults.asList.<locals>.<listcomp>)r� )r� rw rw rx r� � s zParseResults.asListc s6 t r | j}n| j}� fdd�� t� fdd�|� D ��S )a�
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
c s6 t | t�r.| j� r| j� S � fdd�| D �S n| S d S )Nc s g | ] }� |��qS rw rw )r� r� )�toItemrw rx r� � s z7ParseResults.asDict.<locals>.toItem.<locals>.<listcomp>)rz r" r� �asDict)r� )r rw rx r � s
z#ParseResults.asDict.<locals>.toItemc 3 s | ]\}}|� |�fV qd S )Nrw )r� r� r� )r rw rx r� � s z&ParseResults.asDict.<locals>.<genexpr>)�PY_3r� r� r� )r� Zitem_fnrw )r rx r � s
zParseResults.asDictc C s8 t | j�}| jj� |_| j|_|jj| j� | j|_|S )zA
Returns a new copy of a C{ParseResults} object.
)r" r� r� r� r� r� r r� )r� r� rw rw rx r� � s
zParseResults.copyFc C sP d}g }t dd� | jj� D ��}|d }|s8d}d}d}d} |dk rJ|} n | jrV| j} | sf|rbdS d} |||d| d g7 }x�t| j�D ]�\}
} t| t�r�|
|kr�|| j||
|o�|dk||�g7 }n || jd|o�|dk||�g7 }q�d} |
|kr�||
} | �s
|�rq�nd} t t
| ��}
|||d| d |
d
| d g 7 }q�W |||d
| d g7 }dj |�S ) z�
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
�
c s s( | ] \}}|D ]}|d |fV qqdS )rr Nrw )r� r� r r� rw rw rx r� � s z%ParseResults.asXML.<locals>.<genexpr>z r� NZITEM�<�>z</) r� r� r� r� r� r� rz r" �asXMLr� r� r� )r� ZdoctagZnamedItemsOnly�indentZ formatted�nlr Z
namedItemsZnextLevelIndentZselfTagr� r
ZresTagZ xmlBodyTextrw rw rx r � sT
zParseResults.asXMLc C s: x4| j j� D ]&\}}x |D ]\}}||kr|S qW q W d S )N)r� r� )r� r� r� r r� r� rw rw rx Z__lookup$ s
zParseResults.__lookupc C s� | j r | j S | jr.| j� }|r(|j| �S dS nNt| �dkrxt| j�dkrxtt| jj� ��d d dkrxtt| jj� ��S dS dS )a(
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
Nrr r rs )r rs ) r� r� �_ParseResults__lookupr� r� �nextr� r� r� )r� �parrw rw rx �getName+ s
zParseResults.getNamer c C sb g }d}|j |t| j� � � |�rX| j� r�tdd� | j� D ��}xz|D ]r\}}|r^|j |� |j d|d| |f � t|t�r�|r�|j |j||d �� q�|j t|�� qH|j t |�� qHW n�t
dd� | D ���rX| }x~t |�D ]r\} }
t|
t��r*|j d|d| | |d|d |
j||d �f � q�|j d|d| | |d|d t|
�f � q�W d j |�S )
aH
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
r c s s | ]\}}t |�|fV qd S )N)r{ )r� r� r� rw rw rx r� g s z$ParseResults.dump.<locals>.<genexpr>z
%s%s- %s: z rr c s s | ]}t |t�V qd S )N)rz r" )r� �vvrw rw rx r� s s z
%s%s[%d]:
%s%s%sr� )
r� r� r� r� �sortedr� rz r" �dumpr� �anyr� r� ) r� r �depth�fullr �NLr� r� r� r� r rw rw rx r P s,
4.zParseResults.dumpc O s t j | j� f|�|� dS )a�
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
N)�pprintr� )r� r� r� rw rw rx r" } s zParseResults.pprintc C s. | j | jj� | jd k r | j� p d | j| jffS )N)r� r� r� r� r� r� )r� rw rw rx � __getstate__� s
zParseResults.__getstate__c C sN |d | _ |d \| _}}| _i | _| jj|� |d k rDt|�| _nd | _d S )Nr rr )r� r� r� r� r r� r� )r� �stater Z inAccumNamesrw rw rx � __setstate__� s
zParseResults.__setstate__c C s | j | j| j| jfS )N)r� r� r� r� )r� rw rw rx �__getnewargs__� s zParseResults.__getnewargs__c C s t t| ��t| j� � S )N)r� r� r� r� )r� rw rw rx r� � s zParseResults.__dir__)NNTT)N)r� )NFr� T)r� r T)4r� r� r� r� r� rz r� r� r� r� r� r� r� � __nonzero__r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r� r
r� r r� r r r r r" r# r% r& r� rw rw rw rx r" - sh &
'
4
#
=%
-
c C sF |}d| k ot |�k n r4|| d dkr4dS | |jdd| � S )a Returns current column within a string, counting newlines as line separators.
The first column is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r rr r )r� �rfind)r� �strgr� rw rw rx r9 � s
c C s |j dd| �d S )a Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r r rr )�count)r� r) rw rw rx rJ � s
c C sF |j dd| �}|jd| �}|dkr2||d |� S ||d d� S dS )zfReturns the line of text containing loc within a string, counting newlines as line separators.
r r rr N)r( �find)r� r) ZlastCRZnextCRrw rw rx rG � s
c C s8 t dt|� d t|� dt|| �t|| �f � d S )NzMatch z at loc z(%d,%d))�printr� rJ r9 )�instringr� �exprrw rw rx �_defaultStartDebugAction� s r/ c C s$ t dt|� d t|j� � � d S )NzMatched z -> )r, r� r{ r� )r- �startlocZendlocr. �toksrw rw rx �_defaultSuccessDebugAction� s r2 c C s t dt|� � d S )NzException raised:)r, r� )r- r� r. �excrw rw rx � _defaultExceptionDebugAction� s r4 c G s dS )zG'Do-nothing' debug action, to suppress debugging output during parsing.Nrw )r� rw rw rx rQ � s rq c s� �t kr�fdd�S dg�dg�td d� dkrFddd �}dd
d �� n tj}tj� d }|dd
�d }|d |d | f�� �����fdd�}d}yt�dt�d�j�}W n tk
r� t��}Y nX ||_|S )Nc s � |�S )Nrw )r� �lrv )�funcrw rx ry � s z _trim_arity.<locals>.<lambda>r Frq ro � c S s8 t dkr dnd }tj| | d d�| }|j|jfgS )
Nro r7 r rq rr )�limit)ro r7 r ������)�system_version� traceback�
extract_stack�filenamerJ )r8 r �
frame_summaryrw rw rx r= s z"_trim_arity.<locals>.extract_stackc S s$ t j| |d�}|d }|j|jfgS )N)r8 rr rs )r< �
extract_tbr> rJ )�tbr8 Zframesr? rw rw rx r@ s z _trim_arity.<locals>.extract_tb� )r8 rr c s� x�y �| �d d � � }d�d< |S t k
r� �d r>� n4z.tj� d }� |dd�d d d� �ksj� W d ~X �d �kr��d d7 < w� Y qX qW d S )Nr Trr rq )r8 rs rs )r� r~ �exc_info)r� r� rA )r@ �
foundArityr6 r8 �maxargs�pa_call_line_synthrw rx �wrapper s" z _trim_arity.<locals>.wrapperz<parse action>r� � __class__)ro r7 )r )r rs ) �singleArgBuiltinsr; r< r= r@ �getattrr� � Exceptionr{ )r6 rE r= Z LINE_DIFFZ this_linerG � func_namerw )r@ rD r6 r8 rE rF rx � _trim_arity� s*
rM c s� e Zd ZdZdZdZedd� �Zedd� �Zd�dd �Z d
d � Z
d d
� Z d�dd�Z d�dd�Z
dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd�d d �Zd!d"� Zd�d#d$�Zd%d&� Zd'd(� ZG d)d*� d*e�Zed+k r�G d,d-� d-e�Z nG d.d-� d-e�Z i Z e � Z d/d/gZ d�d0d1�Z!eZ"ed2d3� �Z#dZ$ed�d5d6��Z%d�d7d8�Z&e'dfd9d:�Z(d;d<� Z)e'fd=d>�Z*e'dfd?d@�Z+dAdB� Z,dCdD� Z-dEdF� Z.dGdH� Z/dIdJ� Z0dKdL� Z1dMdN� Z2dOdP� Z3dQdR� Z4dSdT� Z5dUdV� Z6dWdX� Z7dYdZ� Z8d�d[d\�Z9d]d^� Z:d_d`� Z;dadb� Z<dcdd� Z=dedf� Z>dgdh� Z?d�didj�Z@dkdl� ZAdmdn� ZBdodp� ZCdqdr� ZDg fdsdt�ZEd�dudv�ZF� fdwdx�ZGdydz� ZHd{d|� ZId}d~� ZJdd�� ZKd�d�d��ZLd�d�d��ZM� ZNS )�r$ z)Abstract base level parser element class.z
Fc C s
| t _dS )a�
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
N)r$ �DEFAULT_WHITE_CHARS)�charsrw rw rx �setDefaultWhitespaceChars= s
z'ParserElement.setDefaultWhitespaceCharsc C s
| t _dS )a�
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
N)r$ �_literalStringClass)r� rw rw rx �inlineLiteralsUsingL s z!ParserElement.inlineLiteralsUsingc C s� t � | _d | _d | _d | _|| _d| _tj| _ d| _
d| _ d| _ t � | _
d| _d| _d| _d| _d| _d| _d | _d| _d| _d S )NTFr� )NNN)r� � parseAction�
failAction�strRepr� resultsName�
saveAsList�skipWhitespacer$ rN �
whiteChars�copyDefaultWhiteChars�mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined�
mayIndexError�errmsg� modalResults� debugActions�re� callPreparse�
callDuringTry)r� �savelistrw rw rx r� a s( zParserElement.__init__c C s< t j | �}| jdd� |_| jdd� |_| jr8tj|_|S )a$
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
N)r� rS r] rZ r$ rN rY )r� Zcpyrw rw rx r� x s
zParserElement.copyc C s* || _ d| j | _t| d�r&| j| j_| S )af
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
z Expected � exception)r� ra r� rh r� )r� r� rw rw rx �setName� s
zParserElement.setNamec C s4 | j � }|jd�r"|dd� }d}||_| |_|S )aP
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
NOTE: this returns a *copy* of the original C{ParserElement} object;
this is so that the client can define a basic element, such as an
integer, and reference it in multiple places with different names.
You can also set results names using the abbreviated syntax,
C{expr("name")} in place of C{expr.setResultsName("name")} -
see L{I{__call__}<__call__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
�*Nrr Trs )r� �endswithrV rb )r� r� �listAllMatchesZnewselfrw rw rx �setResultsName� s
z ParserElement.setResultsNameTc s@ |r&| j � d� fdd� }� |_|| _ nt| j d�r<| j j| _ | S )z�Method to invoke the Python pdb debugger when this element is
about to be parsed. Set C{breakFlag} to True to enable, False to
disable.
Tc s dd l }|j� � | |||�S )Nr )�pdbZ set_trace)r- r� � doActions� callPreParsern )� _parseMethodrw rx �breaker� s z'ParserElement.setBreak.<locals>.breaker�_originalParseMethod)TT)�_parsers r� )r� Z breakFlagrr rw )rq rx �setBreak� s
zParserElement.setBreakc O s& t ttt |���| _|jdd�| _| S )a
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
rf F)r� �maprM rS r� rf )r� �fnsr� rw rw rx r� � s "z ParserElement.setParseActionc O s4 | j tttt|���7 _ | jp,|jdd�| _| S )z�
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
rf F)rS r� rv rM rf r� )r� rw r� rw rw rx �addParseAction� s z ParserElement.addParseActionc sb |j dd��|j dd�r tnt� x(|D ] �� ��fdd�}| jj|� q&W | jpZ|j dd�| _| S )a� Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
�messagez failed user-defined condition�fatalFc s$ t t��| ||��s � | |���d S )N)r� rM )r� r5 rv )�exc_type�fnr� rw rx �pa s z&ParserElement.addCondition.<locals>.parf )r� r! r rS r� rf )r� rw r� r} rw )r{ r| r� rx � addCondition� s
zParserElement.addConditionc C s
|| _ | S )a Define action to perform if parsing fails at this expression.
Fail acton fn is a callable function that takes the arguments
C{fn(s,loc,expr,err)} where:
- s = string being parsed
- loc = location where expression match was attempted and failed
- expr = the parse expression that failed
- err = the exception thrown
The function returns no value. It may throw C{L{ParseFatalException}}
if it is desired to stop parsing immediately.)rT )r� r| rw rw rx �
setFailAction s
zParserElement.setFailActionc C sZ d}xP|rTd}xB| j D ]8}y x|j||�\}}d}q W W q tk
rL Y qX qW qW |S )NTF)r] rt r )r� r- r� Z
exprsFound�eZdummyrw rw rx �_skipIgnorables# s z ParserElement._skipIgnorablesc C sL | j r| j||�}| jrH| j}t|�}x ||k rF|| |krF|d7 }q(W |S )Nrr )r] r� rX rY r� )r� r- r� Zwt�instrlenrw rw rx �preParse0 s zParserElement.preParsec C s |g fS )Nrw )r� r- r� ro rw rw rx � parseImpl< s zParserElement.parseImplc C s |S )Nrw )r� r- r� � tokenlistrw rw rx � postParse? s zParserElement.postParsec " C s� | j }|s| jr�| jd r,| jd ||| � |rD| jrD| j||�}n|}|}yDy| j|||�\}}W n( tk
r� t|t|�| j | ��Y nX W nX t
k
r� } z<| jd r�| jd ||| | � | jr�| j||| | � � W Y d d } ~ X nX n�|o�| j�r| j||�}n|}|}| j �s$|t|�k�rhy| j|||�\}}W n* tk
�rd t|t|�| j | ��Y nX n| j|||�\}}| j |||�}t
|| j| j| jd�}
| j�r�|�s�| j�r�|�rVyRxL| jD ]B} | |||
�}|d k �r�t
|| j| j�o�t|t
tf�| jd�}
�q�W W nF t
k
�rR } z(| jd �r@| jd ||| | � � W Y d d } ~ X nX nNxL| jD ]B} | |||
�}|d k �r^t
|| j| j�o�t|t
tf�| jd�}
�q^W |�r�| jd �r�| jd |||| |
� ||
fS )Nr rq )r� r� rr )r^ rT rc re r� r� r� r r� ra r r` r� r" rV rW rb rS rf rz r� ) r� r- r� ro rp Z debugging�prelocZ tokensStart�tokens�errZ retTokensr| rw rw rx �
_parseNoCacheC sp
zParserElement._parseNoCachec C s> y| j ||dd�d S tk
r8 t||| j| ��Y nX d S )NF)ro r )rt r! r ra )r� r- r� rw rw rx �tryParse� s zParserElement.tryParsec C s2 y| j ||� W n ttfk
r( dS X dS d S )NFT)r� r r� )r� r- r� rw rw rx � canParseNext� s
zParserElement.canParseNextc @ s e Zd Zdd� ZdS )z ParserElement._UnboundedCachec sd i � t � | _�� �fdd�}� fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )�cache� not_in_cacherw rx r� � s z3ParserElement._UnboundedCache.__init__.<locals>.getc s |� |< d S )Nrw )r� r� r� )r� rw rx �set� s z3ParserElement._UnboundedCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z5ParserElement._UnboundedCache.__init__.<locals>.clear)r� r� �types�
MethodTyper� r� r� )r� r� r� r� rw )r� r� rx r� � s z&ParserElement._UnboundedCache.__init__N)r� r� r� r� rw rw rw rx �_UnboundedCache� s r� Nc @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sh t � | _�t� � � �fdd�}� �fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s" |� |< t � ��kr � jd� d S )NF)r� �popitem)r� r� r� )r� �sizerw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear)r� r� � _OrderedDictr� r� r� r� r� )r� r� r� r� r� rw )r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx �
_FifoCache� s r� c @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sv t � | _�i � tjg ���� �fdd�}� ��fdd�}� �fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s2 |� |< t � ��kr$� j�j� d � �j|� d S )N)r� r� �popleftr� )r� r� r� )r� �key_fifor� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � �j � d S )N)r� )r� )r� r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear) r� r� � collections�dequer� r� r� r� r� )r� r� r� r� r� rw )r� r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx r� � s r c C s� d\}}| ||||f}t j�� t j}|j|�} | |jkr�t j| d7 < y| j||||�} W n8 tk
r� }
z |j||
j |
j
� � � W Y d d }
~
X q�X |j|| d | d j � f� | S n4t j| d7 < t | t
�r�| �| d | d j � fS W d Q R X d S )Nr rr )r rr )r$ �packrat_cache_lock�
packrat_cacher� r� �packrat_cache_statsr� r r� rH r� r� rz rK ) r� r- r� ro rp ZHITZMISS�lookupr� r� r� rw rw rx � _parseCache� s$
zParserElement._parseCachec C s( t jj� dgtt j� t jd d �< d S )Nr )r$ r� r� r� r� rw rw rw rx �
resetCache� s
zParserElement.resetCache� c C s8 t js4dt _| dkr t j� t _n t j| �t _t jt _dS )a� Enables "packrat" parsing, which adds memoizing to the parsing logic.
Repeated parse attempts at the same string location (which happens
often in many complex grammars) can immediately return a cached value,
instead of re-executing parsing/validating code. Memoizing is done of
both valid results and parsing exceptions.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "compile as you go", you must call
C{enablePackrat} before calling C{psyco.full()}. If you do not do this,
Python will crash. For best results, call C{enablePackrat()} immediately
after importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
TN)r$ �_packratEnabledr� r� r� r� rt )Zcache_size_limitrw rw rx �
enablePackrat s zParserElement.enablePackratc C s� t j� | js| j� x| jD ] }|j� q W | js<|j� }y<| j|d�\}}|rv| j||�}t � t
� }|j||� W n0 t k
r� } zt j r�� n|�W Y dd}~X nX |S dS )aB
Execute the parse expression with the given string.
This is the main interface to the client code, once the complete
expression has been built.
If you want the grammar to require that the entire input string be
successfully parsed, then set C{parseAll} to True (equivalent to ending
the grammar with C{L{StringEnd()}}).
Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
in order to report proper column numbers in parse actions.
If the input string contains tabs and
the grammar uses parse actions that use the C{loc} argument to index into the
string being parsed, you can ensure you have a consistent view of the input
string by:
- calling C{parseWithTabs} on your grammar before calling C{parseString}
(see L{I{parseWithTabs}<parseWithTabs>})
- define your parse action using the full C{(s,loc,toks)} signature, and
reference the input string using the parse action's C{s} argument
- explictly expand the tabs in your input string before calling
C{parseString}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
r N)
r$ r� r_ �
streamliner] r\ �
expandtabsrt r� r
r) r �verbose_stacktrace)r� r- �parseAllr� r� r� Zser3 rw rw rx � parseString# s$ zParserElement.parseStringc c s@ | j s| j� x| jD ] }|j� qW | js8t|�j� }t|�}d}| j}| j}t j
� d} y�x�||kon| |k �ry |||�}
|||
dd�\} } W n t k
r� |
d }Y q`X | |kr�| d7 } | |
| fV |r�|||�}
|
|kr�| }q�|d7 }n| }q`|
d }q`W W n4 t k
�r: } zt j
�r&� n|�W Y dd}~X nX dS )a�
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
C{maxMatches} argument, to clip scanning after 'n' matches are found. If
C{overlap} is specified, then overlapping matches will be reported.
Note that the start and end locations are reported relative to the string
being parsed. See L{I{parseString}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
r F)rp rr N)r_ r� r] r\ r� r� r� r� rt r$ r� r r r� )r� r- �
maxMatchesZoverlapr� r� r� Z
preparseFnZparseFn�matchesr� ZnextLocr� Znextlocr3 rw rw rx �
scanStringU sB
zParserElement.scanStringc C s� g }d}d| _ y�xh| j|�D ]Z\}}}|j|||� � |rrt|t�rT||j� 7 }n t|t�rh||7 }n
|j|� |}q W |j||d� � dd� |D �}djtt t
|���S t k
r� } zt j
rȂ n|�W Y dd}~X nX dS )af
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
r TNc S s g | ] }|r|�qS rw rw )r� �orw rw rx r� � s z1ParserElement.transformString.<locals>.<listcomp>r� )r\ r� r� rz r" r� r� r� rv r� �_flattenr r$ r� )r� r- r ZlastErv r� r� r3 rw rw rx r� � s(
z ParserElement.transformStringc C sP yt dd� | j||�D ��S tk
rJ } ztjr6� n|�W Y dd}~X nX dS )a~
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
c S s g | ]\}}}|�qS rw rw )r� rv r� r� rw rw rx r� � s z.ParserElement.searchString.<locals>.<listcomp>N)r" r� r r$ r� )r� r- r� r3 rw rw rx � searchString� s zParserElement.searchStringc c sX d}d}x<| j ||d�D ]*\}}}|||� V |r>|d V |}qW ||d� V dS )a[
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
r )r� N)r� ) r� r- �maxsplitZincludeSeparatorsZsplitsZlastrv r� r� rw rw rx r� � s
zParserElement.splitc C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )a�
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
z4Cannot combine element of type %s with ParserElementrq )�
stacklevelN) rz r� r$ rQ �warnings�warnr� �
SyntaxWarningr )r� r� rw rw rx r � s
zParserElement.__add__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of + operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx r s
zParserElement.__radd__c C sL t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| tj � |g�S )zQ
Implementation of - operator, returns C{L{And}} with error stop
z4Cannot combine element of type %s with ParserElementrq )r� N)
rz r� r$ rQ r� r� r� r� r �
_ErrorStop)r� r� rw rw rx �__sub__ s
zParserElement.__sub__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of - operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rsub__ s
zParserElement.__rsub__c s� t |t�r|d }}n�t |t�r�|d dd� }|d dkrHd|d f}t |d t�r�|d dkr�|d dkrvt��S |d dkr�t��S �|d t�� S nJt |d t�r�t |d t�r�|\}}||8 }n tdt|d �t|d ���ntdt|���|dk �r td��|dk �r td��|| k�o2dkn �rBtd ��|�r�� �fd
d �� |�r�|dk�rt�� |� }nt�g| �� |� }n� |�}n |dk�r��}nt�g| �}|S )
a�
Implementation of * operator, allows use of C{expr * 3} in place of
C{expr + expr + expr}. Expressions may also me multiplied by a 2-integer
tuple, similar to C{{min,max}} multipliers in regular expressions. Tuples
may also include C{None} as in:
- C{expr*(n,None)} or C{expr*(n,)} is equivalent
to C{expr*n + L{ZeroOrMore}(expr)}
(read as "at least n instances of C{expr}")
- C{expr*(None,n)} is equivalent to C{expr*(0,n)}
(read as "0 to n instances of C{expr}")
- C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
- C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
Note that C{expr*(None,n)} does not raise an exception if
more than n exprs exist in the input stream; that is,
C{expr*(None,n)} does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
C{expr*(None,n) + ~expr}
r Nrq rr z7cannot multiply 'ParserElement' and ('%s','%s') objectsz0cannot multiply 'ParserElement' and '%s' objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuez+cannot multiply ParserElement by 0 or (0,0)c s( | dkr t �� | d � �S t ��S d S )Nrr )r )�n)�makeOptionalListr� rw rx r� ] s z/ParserElement.__mul__.<locals>.makeOptionalList)NN) rz ru �tupler2 r r� r� �
ValueErrorr )r� r� Z minElementsZ optElementsr� rw )r� r� rx �__mul__, sD
zParserElement.__mul__c C s
| j |�S )N)r� )r� r� rw rw rx �__rmul__p s zParserElement.__rmul__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zI
Implementation of | operator - returns C{L{MatchFirst}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__or__s s
zParserElement.__or__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || B S )z]
Implementation of | operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__ror__ s
zParserElement.__ror__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zA
Implementation of ^ operator - returns C{L{Or}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__xor__� s
zParserElement.__xor__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || A S )z]
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rxor__� s
zParserElement.__rxor__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zC
Implementation of & operator - returns C{L{Each}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__and__� s
zParserElement.__and__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || @ S )z]
Implementation of & operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rand__� s
zParserElement.__rand__c C s t | �S )zE
Implementation of ~ operator - returns C{L{NotAny}}
)r )r� rw rw rx �
__invert__� s zParserElement.__invert__c C s |dk r| j |�S | j� S dS )a
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
N)rm r� )r� r� rw rw rx �__call__� s
zParserElement.__call__c C s t | �S )z�
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
)r+ )r� rw rw rx �suppress� s zParserElement.suppressc C s
d| _ | S )a
Disables the skipping of whitespace before matching the characters in the
C{ParserElement}'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
F)rX )r� rw rw rx �leaveWhitespace� s z ParserElement.leaveWhitespacec C s d| _ || _d| _| S )z8
Overrides the default whitespace chars
TF)rX rY rZ )r� rO rw rw rx �setWhitespaceChars� s z ParserElement.setWhitespaceCharsc C s
d| _ | S )z�
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
T)r\ )r� rw rw rx �
parseWithTabs� s zParserElement.parseWithTabsc C sL t |t�rt|�}t |t�r4|| jkrH| jj|� n| jjt|j� �� | S )a�
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
)rz r� r+ r] r� r� )r� r� rw rw rx �ignore� s
zParserElement.ignorec C s" |pt |p t|ptf| _d| _| S )zT
Enable display of debugging messages while doing pattern matching.
T)r/ r2 r4 rc r^ )r� Z startActionZ
successActionZexceptionActionrw rw rx �setDebugActions
s
z ParserElement.setDebugActionsc C s |r| j ttt� nd| _| S )a�
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
F)r� r/ r2 r4 r^ )r� �flagrw rw rx �setDebug s #zParserElement.setDebugc C s | j S )N)r� )r� rw rw rx r� @ s zParserElement.__str__c C s t | �S )N)r� )r� rw rw rx r� C s zParserElement.__repr__c C s d| _ d | _| S )NT)r_ rU )r� rw rw rx r� F s zParserElement.streamlinec C s d S )Nrw )r� r� rw rw rx �checkRecursionK s z ParserElement.checkRecursionc C s | j g � dS )zj
Check defined expressions for valid structure, check for infinite recursive definitions.
N)r� )r� �
validateTracerw rw rx �validateN s zParserElement.validatec C s� y |j � }W n2 tk
r> t|d��}|j � }W dQ R X Y nX y | j||�S tk
r| } ztjrh� n|�W Y dd}~X nX dS )z�
Execute the parse expression on the given file or filename.
If a filename is specified (instead of a file object),
the entire file is opened, read, and closed before parsing.
�rN)�readr� �openr� r r$ r� )r� Zfile_or_filenamer� Z
file_contents�fr3 rw rw rx � parseFileT s zParserElement.parseFilec sH t |t�r"| |kp t| �t|�kS t |t�r6| j|�S tt| �|kS d S )N)rz r$ �varsr� r� �super)r� r� )rH rw rx �__eq__h s
zParserElement.__eq__c C s
| |k S )Nrw )r� r� rw rw rx �__ne__p s zParserElement.__ne__c C s t t| ��S )N)�hash�id)r� rw rw rx �__hash__s s zParserElement.__hash__c C s | |kS )Nrw )r� r� rw rw rx �__req__v s zParserElement.__req__c C s
| |k S )Nrw )r� r� rw rw rx �__rne__y s zParserElement.__rne__c C s0 y| j t|�|d� dS tk
r* dS X dS )a�
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
)r� TFN)r� r� r )r� Z
testStringr� rw rw rx r� | s
zParserElement.matches�#c C s� t |t�r"tttj|j� j� ��}t |t�r4t|�}g }g }d} �x�|D �]�}
|dk rb|j |
d�sl|rx|
rx|j
|
� qH|
s~qHdj |�|
g} g }y:|
j dd�}
| j
|
|d�} | j
| j|d�� | o�| } W n� tk
�rx }
z�t |
t�r�dnd }d|
k�r0| j
t|
j|
�� | j
d
t|
j|
�d d | � n| j
d
|
j d | � | j
d
t|
� � | �ob|} |
} W Y dd}
~
X nD tk
�r� } z&| j
dt|� � | �o�|} |} W Y dd}~X nX |�r�|�r�| j
d � tdj | �� |j
|
| f� qHW | |fS )a3
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\n of strings that spans \n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
TNFr z\n)r� )r z(FATAL)r� � rr �^zFAIL: zFAIL-EXCEPTION: )rz r� r� rv r{ r� �rstrip�
splitlinesr r� r� r� r� r� r r r! rG r� r9 rK r, )r� Ztestsr� ZcommentZfullDumpZ printResultsZ failureTestsZ
allResultsZcomments�successrv r �resultr� rz r3 rw rw rx �runTests� sN W
$
zParserElement.runTests)F)F)T)T)TT)TT)r� )F)N)T)F)T)Tr� TTF)Or� r� r� r� rN r� � staticmethodrP rR r� r� ri rm ru r� rx r~ r r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� rt r� r� r� r� �_MAX_INTr� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__rw rw )rH rx r$ 8 s�
&
H
"
2G+ D
)
c s e Zd ZdZ� fdd�Z� ZS )r, zT
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
c s t t| �jdd� d S )NF)rg )r� r, r� )r� )rH rw rx r� s zToken.__init__)r� r� r� r� r� r� rw rw )rH rx r, s c s e Zd ZdZ� fdd�Z� ZS )r
z,
An empty token, will always match.
c s$ t t| �j� d| _d| _d| _d S )Nr
TF)r� r
r� r� r[ r` )r� )rH rw rx r� s zEmpty.__init__)r� r� r� r� r� r� rw rw )rH rx r
s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r z(
A token that will never match.
c s* t t| �j� d| _d| _d| _d| _d S )Nr TFzUnmatchable token)r� r r� r� r[ r` ra )r� )rH rw rx r� * s
zNoMatch.__init__Tc C s t ||| j| ��d S )N)r ra )r� r- r� ro rw rw rx r� 1 s zNoMatch.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r & s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
c s� t t| �j� || _t|�| _y|d | _W n* tk
rV tj dt
dd� t | _ Y nX dt
| j� | _d| j | _d| _d| _d S )Nr z2null string passed to Literal; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �matchr� �matchLen�firstMatchCharr� r� r� r� r
rH r� r� ra r[ r` )r� � matchString)rH rw rx r� C s
zLiteral.__init__Tc C sJ || | j kr6| jdks&|j| j|�r6|| j | jfS t||| j| ��d S )Nrr )r� r� �
startswithr� r ra )r� r- r� ro rw rw rx r� V s zLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r 5 s
c sL e Zd ZdZed Zd� fdd� Zddd �Z� fd
d �Ze d d
� �Z
� Z S )r a\
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
Accepts two optional constructor arguments in addition to the keyword string:
- C{identChars} is a string of characters that would be valid identifier characters,
defaulting to all alphanumerics + "_" and "$"
- C{caseless} allows case-insensitive matching, default is C{False}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
z_$NFc s� t t| �j� |d kr tj}|| _t|�| _y|d | _W n$ tk
r^ t j
dt dd� Y nX d| j | _ d| j | _
d| _d| _|| _|r�|j� | _|j� }t|�| _d S )Nr z2null string passed to Keyword; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �DEFAULT_KEYWORD_CHARSr� r� r� r� r� r� r� r� r� ra r[ r` �caseless�upper�
caselessmatchr� �
identChars)r� r� r� r� )rH rw rx r� q s&
zKeyword.__init__Tc C s | j r||||| j � j� | jkr�|t|�| j ksL||| j j� | jkr�|dksj||d j� | jkr�|| j | jfS nv|| | jkr�| jdks�|j| j|�r�|t|�| j ks�||| j | jkr�|dks�||d | jkr�|| j | jfS t ||| j
| ��d S )Nr rr ) r� r� r� r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s * &zKeyword.parseImplc s t t| �j� }tj|_|S )N)r� r r� r� r� )r� r� )rH rw rx r� � s z Keyword.copyc C s
| t _dS )z,Overrides the default Keyword chars
N)r r� )rO rw rw rx �setDefaultKeywordChars� s z Keyword.setDefaultKeywordChars)NF)T) r� r� r� r� r3 r� r� r� r� r� r� r� rw rw )rH rx r ^ s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r al
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
c s6 t t| �j|j� � || _d| j | _d| j | _d S )Nz'%s'z Expected )r� r r� r� � returnStringr� ra )r� r� )rH rw rx r� � s zCaselessLiteral.__init__Tc C s@ |||| j � j� | jkr,|| j | jfS t||| j| ��d S )N)r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s zCaselessLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
r z�
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
Nc s t t| �j||dd� d S )NT)r� )r� r r� )r� r� r� )rH rw rx r� � s zCaselessKeyword.__init__Tc C sj |||| j � j� | jkrV|t|�| j ksF||| j j� | jkrV|| j | jfS t||| j| ��d S )N)r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s *zCaselessKeyword.parseImpl)N)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
rl ax
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
rr c sB t t| �j� || _|| _|| _d| j| jf | _d| _d| _d S )Nz&Expected %r (with up to %d mismatches)F) r� rl r� r� � match_string�
maxMismatchesra r` r[ )r� r� r� )rH rw rx r� � s zCloseMatch.__init__Tc C s� |}t |�}|t | j� }||kr�| j}d}g } | j}
x�tt|||� | j��D ]0\}} | \} }
| |
krP| j|� t | �|
krPP qPW |d }t|||� g�}| j|d< | |d< ||fS t||| j| ��d S )Nr rr Zoriginal�
mismatches) r� r� r� r� r� r� r" r ra )r� r- r� ro �startr� �maxlocr� Zmatch_stringlocr� r� Zs_m�src�mat�resultsrw rw rx r� � s( "
zCloseMatch.parseImpl)rr )T)r� r� r� r� r� r� r� rw rw )rH rx rl � s c s8 e Zd ZdZd
� fdd� Zdd d
�Z� fd d �Z� ZS )r/ a
Token for matching words composed of allowed character sets.
Defined with string containing all allowed initial characters,
an optional string containing allowed body characters (if omitted,
defaults to the initial character set), and an optional minimum,
maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction. An optional
C{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
Nrr r Fc s� t t| �j� � rFdj� fdd�|D ��}|rFdj� fdd�|D ��}|| _t|�| _|rl|| _t|�| _n|| _t|�| _|dk| _ |dk r�t
d��|| _ |dkr�|| _ nt
| _ |dkr�|| _ || _ t| �| _d| j | _d | _|| _d
| j| j k�r�|dk�r�|dk�r�|dk�r�| j| jk�r8d t| j� | _nHt| j�dk�rfd tj| j�t| j�f | _nd
t| j�t| j�f | _| j�r�d| j d | _ytj| j�| _W n tk
�r� d | _Y nX d S )Nr� c 3 s | ]}|� kr|V qd S )Nrw )r� r� )� excludeCharsrw rx r� 7
s z Word.__init__.<locals>.<genexpr>c 3 s | ]}|� kr|V qd S )Nrw )r� r� )r� rw rx r� 9
s r rr zZcannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permittedz Expected Fr� z[%s]+z%s[%s]*z [%s][%s]*z\b)r� r/ r� r� �
initCharsOrigr� � initChars�
bodyCharsOrig� bodyChars� maxSpecifiedr� �minLen�maxLenr� r� r� ra r` � asKeyword�_escapeRegexRangeChars�reStringr� rd �escape�compilerK )r� r� r �min�max�exactr r� )rH )r� rx r� 4
sT
0
z
Word.__init__Tc
C sD | j r<| j j||�}|s(t||| j| ��|j� }||j� fS || | jkrZt||| j| ��|}|d7 }t|�}| j}|| j }t
||�}x ||k r�|| |kr�|d7 }q�W d} || | j k r�d} | j r�||k r�|| |kr�d} | j
�r |dk�r||d |k�s||k �r || |k�r d} | �r4t||| j| ��||||� fS )Nrr FTr )rd r� r ra �end�groupr� r� r r r
r r r )
r� r- r� ro r� r� r� Z bodycharsr� ZthrowExceptionrw rw rx r� j
s6
4zWord.parseImplc st yt t| �j� S tk
r" Y nX | jd krndd� }| j| jkr^d|| j�|| j�f | _nd|| j� | _| jS )Nc S s$ t | �dkr | d d� d S | S d S )N� z...)r� )r� rw rw rx �
charsAsStr�
s z Word.__str__.<locals>.charsAsStrz W:(%s,%s)zW:(%s))r� r/ r� rK rU r� r )r� r )rH rw rx r� �
s
z Word.__str__)Nrr r r FN)T)r� r� r� r� r� r� r� r� rw rw )rH rx r/
s .6
#c sF e Zd ZdZeejd��Zd � fdd� Zd dd�Z � fd d
�Z
� Z S )
r' a�
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
z[A-Z]r c s� t t| �j� t|t�r�|s,tjdtdd� || _|| _ y t
j | j| j �| _
| j| _ W q� t
jk
r� tjd| tdd� � Y q�X n2t|tj�r�|| _
t|� | _| _ || _ ntd��t| �| _d| j | _d| _d| _d S )
z�The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags.z0null string passed to Regex; use Empty() insteadrq )r� z$invalid pattern (%s) passed to RegexzCRegex may only be constructed with a string or a compiled RE objectz Expected FTN)r� r' r� rz r� r� r� r� �pattern�flagsrd r r �
sre_constants�error�compiledREtyper{ r� r� r� ra r` r[ )r� r r )rH rw rx r� �
s.
zRegex.__init__Tc C sd | j j||�}|s"t||| j| ��|j� }|j� }t|j� �}|r\x|D ]}|| ||< qHW ||fS )N)rd r� r ra r
� groupdictr" r )r� r- r� ro r� �dr� r� rw rw rx r� �
s
zRegex.parseImplc sD yt t| �j� S tk
r" Y nX | jd kr>dt| j� | _| jS )NzRe:(%s))r� r' r� rK rU r� r )r� )rH rw rx r� �
s
z
Regex.__str__)r )T) r� r� r� r� r� rd r r r� r� r� r� rw rw )rH rx r' �
s
"
c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r% a�
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
NFTc sN t t� �j� |j� }|s0tjdtdd� t� �|d kr>|}n"|j� }|s`tjdtdd� t� �|� _t |�� _
|d � _ |� _ t |�� _
|� _|� _|� _|� _|r�tjtjB � _dtj� j�t� j d �|d k r�t|�p�df � _n<d� _dtj� j�t� j d �|d k �rt|��p df � _t � j �d k�rp� jd
d j� fd d
�tt � j �d dd�D �� d 7 _|�r�� jdtj|� 7 _|�r�� jdtj|� 7 _tj� j�d � _� jdtj� j � 7 _y tj � j� j�� _� j� _ W n0 t j k
�r& tjd� j tdd� � Y nX t � �� _!d� j! � _"d� _#d� _$d S )Nz$quoteChar cannot be the empty stringrq )r� z'endQuoteChar cannot be the empty stringr z %s(?:[^%s%s]r� z%s(?:[^%s\n\r%s]rr z|(?:z)|(?:c 3 s4 | ],}d t j� jd|� �t� j| �f V qdS )z%s[^%s]N)rd r � endQuoteCharr )r� r� )r� rw rx r� / s z(QuotedString.__init__.<locals>.<genexpr>�)z|(?:%s)z|(?:%s.)z(.)z)*%sz$invalid pattern (%s) passed to Regexz Expected FTrs )%r� r% r� r� r� r� r� � SyntaxError� quoteCharr� � quoteCharLen�firstQuoteCharr �endQuoteCharLen�escChar�escQuote�unquoteResults�convertWhitespaceEscapesrd � MULTILINE�DOTALLr r r r r� r� �escCharReplacePatternr r r r r� r� ra r` r[ )r� r r r Z multiliner! r r" )rH )r� rx r� sf
6
zQuotedString.__init__c C s� || | j kr | jj||�p d }|s4t||| j| ��|j� }|j� }| jr�|| j| j � }t
|t �r�d|kr�| j r�ddddd�}x |j
� D ]\}}|j||�}q�W | jr�tj| jd|�}| jr�|j| j| j�}||fS )N�\� r � �
)z\tz\nz\fz\rz\g<1>)r rd r� r ra r
r r! r r rz r� r" r� r� r r� r% r r ) r� r- r� ro r� r� Zws_mapZwslitZwscharrw rw rx r� G s(
zQuotedString.parseImplc sF yt t| �j� S tk
r" Y nX | jd kr@d| j| jf | _| jS )Nz.quoted string, starting with %s ending with %s)r� r% r� rK rU r r )r� )rH rw rx r� j s
zQuotedString.__str__)NNFTNT)T)r� r� r� r� r� r� r� r� rw rw )rH rx r% �
s A
#c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r a�
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
rr r c s� t t| �j� d| _|| _|dk r*td��|| _|dkr@|| _nt| _|dkrZ|| _|| _t | �| _
d| j
| _ | jdk| _ d| _
d S )NFrr zfcannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permittedr z Expected )r� r r� rX �notCharsr� r r r� r� r� ra r[ r` )r� r* r
r r )rH rw rx r� � s
zCharsNotIn.__init__Tc C s� || | j kr t||| j| ��|}|d7 }| j }t|| j t|��}x ||k rd|| |krd|d7 }qFW || | jk r�t||| j| ��||||� fS )Nrr )r* r ra r
r r� r )r� r- r� ro r� Znotchars�maxlenrw rw rx r� � s
zCharsNotIn.parseImplc sd yt t| �j� S tk
r" Y nX | jd kr^t| j�dkrRd| jd d� | _n d| j | _| jS )Nr z
!W:(%s...)z!W:(%s))r� r r� rK rU r� r* )r� )rH rw rx r� � s
zCharsNotIn.__str__)rr r r )T)r� r� r� r� r� r� r� r� rw rw )rH rx r v s
c s< e Zd ZdZdddddd�Zd� fd d � Zddd�Z� ZS )r. a�
Special matching class for matching whitespace. Normally, whitespace is ignored
by pyparsing grammars. This class is included when some whitespace structures
are significant. Define with a string containing the whitespace characters to be
matched; default is C{" \t\r\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments,
as defined for the C{L{Word}} class.
z<SPC>z<TAB>z<LF>z<CR>z<FF>)r� r' r r) r( �
rr r c s� t t� �j� |� _� jdj� fdd�� jD ��� djdd� � jD ��� _d� _d� j � _ |� _
|dkrt|� _ nt � _ |dkr�|� _ |� _
d S )Nr� c 3 s | ]}|� j kr|V qd S )N)�
matchWhite)r� r� )r� rw rx r� � s z!White.__init__.<locals>.<genexpr>c s s | ]}t j| V qd S )N)r. � whiteStrs)r� r� rw rw rx r� � s Tz Expected r )
r� r. r� r- r� r� rY r� r[ ra r r r� )r� Zwsr
r r )rH )r� rx r� � s zWhite.__init__Tc C s� || | j kr t||| j| ��|}|d7 }|| j }t|t|��}x"||k rd|| | j krd|d7 }qDW || | jk r�t||| j| ��||||� fS )Nrr )r- r ra r r
r� r )r� r- r� ro r� r� rw rw rx r� � s
zWhite.parseImpl)r, rr r r )T)r� r� r� r� r. r� r� r� rw rw )rH rx r. � s c s e Zd Z� fdd�Z� ZS )�_PositionTokenc s( t t| �j� | jj| _d| _d| _d S )NTF)r� r/ r� rH r� r� r[ r` )r� )rH rw rx r� � s
z_PositionToken.__init__)r� r� r� r� r� rw rw )rH rx r/ � s r/ c s2 e Zd ZdZ� fdd�Zdd� Zd dd�Z� ZS )
r zb
Token to advance to a specific column of input text; useful for tabular report scraping.
c s t t| �j� || _d S )N)r� r r� r9 )r� �colno)rH rw rx r� � s zGoToColumn.__init__c C s` t ||�| j kr\t|�}| jr*| j||�}x0||k rZ|| j� rZt ||�| j krZ|d7 }q,W |S )Nrr )r9 r� r] r� �isspace)r� r- r� r� rw rw rx r� � s & zGoToColumn.preParseTc C sD t ||�}|| j kr"t||d| ��|| j | }|||� }||fS )NzText not in expected column)r9 r )r� r- r� ro ZthiscolZnewlocr� rw rw rx r� s
zGoToColumn.parseImpl)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Matches if current position is at the beginning of a line within the parse string
Example::
test = ''' AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
c s t t| �j� d| _d S )NzExpected start of line)r� r r� ra )r� )rH rw rx r� & s zLineStart.__init__Tc C s* t ||�dkr|g fS t||| j| ��d S )Nrr )r9 r ra )r� r- r� ro rw rw rx r� * s zLineStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r zU
Matches if current position is at the end of a line within the parse string
c s, t t| �j� | jtjjdd�� d| _d S )Nr r� zExpected end of line)r� r r� r� r$ rN r� ra )r� )rH rw rx r� 3 s zLineEnd.__init__Tc C sb |t |�k r6|| dkr$|d dfS t||| j| ��n(|t |�krN|d g fS t||| j| ��d S )Nr rr )r� r ra )r� r- r� ro rw rw rx r� 8 s zLineEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r / s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r* zM
Matches if current position is at the beginning of the parse string
c s t t| �j� d| _d S )NzExpected start of text)r� r* r� ra )r� )rH rw rx r� G s zStringStart.__init__Tc C s0 |dkr(|| j |d�kr(t||| j| ��|g fS )Nr )r� r ra )r� r- r� ro rw rw rx r� K s zStringStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r* C s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r) zG
Matches if current position is at the end of the parse string
c s t t| �j� d| _d S )NzExpected end of text)r� r) r� ra )r� )rH rw rx r� V s zStringEnd.__init__Tc C s^ |t |�k r t||| j| ��n<|t |�kr6|d g fS |t |�krJ|g fS t||| j| ��d S )Nrr )r� r ra )r� r- r� ro rw rw rx r� Z s zStringEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r) R s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r1 ap
Matches if the current position is at the beginning of a Word, and
is not preceded by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
the string being parsed, or at the beginning of a line.
c s" t t| �j� t|�| _d| _d S )NzNot at the start of a word)r� r1 r� r� � wordCharsra )r� r2 )rH rw rx r� l s
zWordStart.__init__Tc C s@ |dkr8||d | j ks(|| | j kr8t||| j| ��|g fS )Nr rr )r2 r ra )r� r- r� ro rw rw rx r� q s
zWordStart.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r1 d s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r0 aZ
Matches if the current position is at the end of a Word, and
is not followed by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
the string being parsed, or at the end of a line.
c s( t t| �j� t|�| _d| _d| _d S )NFzNot at the end of a word)r� r0 r� r� r2 rX ra )r� r2 )rH rw rx r� � s
zWordEnd.__init__Tc C sP t |�}|dkrH||k rH|| | jks8||d | jkrHt||| j| ��|g fS )Nr rr )r� r2 r ra )r� r- r� ro r� rw rw rx r� � s zWordEnd.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r0 x s c s� e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Z� fd d �Z� fd
d�Z � fdd�Z
d� fdd� Z g fdd�Z � fdd�Z
� ZS )r z^
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r"t|�}t|t�r<tj|�g| _ njt|t
j �rzt|�}t dd� |D ��rnt
tj|�}t|�| _ n,yt|�| _ W n tk
r� |g| _ Y nX d| _d S )Nc s s | ]}t |t�V qd S )N)rz r� )r� r. rw rw rx r� � s z+ParseExpression.__init__.<locals>.<genexpr>F)r� r r� rz r� r� r� r$ rQ �exprsr� �Iterable�allrv r� re )r� r3 rg )rH rw rx r� � s
zParseExpression.__init__c C s
| j | S )N)r3 )r� r� rw rw rx r� � s zParseExpression.__getitem__c C s | j j|� d | _| S )N)r3 r� rU )r� r� rw rw rx r� � s zParseExpression.appendc C s4 d| _ dd� | jD �| _x| jD ] }|j� q W | S )z~Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions.Fc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z3ParseExpression.leaveWhitespace.<locals>.<listcomp>)rX r3 r� )r� r� rw rw rx r� � s
z ParseExpression.leaveWhitespacec sz t |t�rF|| jkrvtt| �j|� xP| jD ]}|j| jd � q,W n0tt| �j|� x | jD ]}|j| jd � q^W | S )Nrr rs rs )rz r+ r] r� r r� r3 )r� r� r� )rH rw rx r� � s
zParseExpression.ignorec sL yt t| �j� S tk
r" Y nX | jd krFd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU rH r� r� r3 )r� )rH rw rx r� � s
zParseExpression.__str__c s0 t t| �j� x| jD ] }|j� qW t| j�dk�r | jd }t|| j�r�|j r�|jd kr�|j r�|jd d � | jd g | _d | _
| j |j O _ | j |j O _ | jd }t|| j�o�|j o�|jd ko�|j �r | jd d� |jd d � | _d | _
| j |j O _ | j |j O _ dt
| � | _| S )Nrq r rr z Expected rs rs )r� r r� r3 r� rz rH rS rV r^ rU r[ r` r� ra )r� r� r� )rH rw rx r� � s0
zParseExpression.streamlinec s t t| �j||�}|S )N)r� r rm )r� r� rl r� )rH rw rx rm � s z ParseExpression.setResultsNamec C s: |d d � | g }x| j D ]}|j|� qW | jg � d S )N)r3 r� r� )r� r� �tmpr� rw rw rx r� � s zParseExpression.validatec s$ t t| �j� }dd� | jD �|_|S )Nc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z(ParseExpression.copy.<locals>.<listcomp>)r� r r� r3 )r� r� )rH rw rx r� � s zParseExpression.copy)F)F)r� r� r� r� r� r� r� r� r� r� r� rm r� r� r� rw rw )rH rx r � s
" c sT e Zd ZdZG dd� de�Zd� fdd� Zddd�Zd d
� Zd d � Z d
d� Z
� Z S )r a
Requires all given C{ParseExpression}s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the C{'+'} operator.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
c s e Zd Z� fdd�Z� ZS )zAnd._ErrorStopc s& t tj| �j||� d| _| j� d S )N�-)r� r r� r� r� r� )r� r� r� )rH rw rx r�
s zAnd._ErrorStop.__init__)r� r� r� r� r� rw rw )rH rx r�
s r� Tc sR t t| �j||� tdd� | jD ��| _| j| jd j� | jd j| _d| _ d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r�
s z And.__init__.<locals>.<genexpr>r T)
r� r r� r5 r3 r[ r� rY rX re )r� r3 rg )rH rw rx r�
s
z And.__init__c C s | j d j|||dd�\}}d}x�| j dd � D ]�}t|tj�rFd}q0|r�y|j|||�\}}W q� tk
rv � Y q� tk
r� } zd |_tj|��W Y d d }~X q� t k
r� t|t
|�| j | ��Y q�X n|j|||�\}}|s�|j � r0||7 }q0W ||fS )Nr F)rp rr T)
r3 rt rz r r� r# r �
__traceback__r� r� r� ra r� ) r� r- r� ro �
resultlistZ errorStopr� Z
exprtokensr� rw rw rx r�
s( z
And.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx r 5
s
z And.__iadd__c C s8 |d d � | g }x | j D ]}|j|� |jsP qW d S )N)r3 r� r[ )r� r� �subRecCheckListr� rw rw rx r� :
s
zAnd.checkRecursionc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� �{r� c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� F
s z And.__str__.<locals>.<genexpr>�})r� r� rU r� r3 )r� rw rw rx r� A
s
z And.__str__)T)T) r� r� r� r� r
r� r� r� r r� r� r� rw rw )rH rx r � s
c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the expression that matches the longest string will be used.
May be constructed using the C{'^'} operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� \
s z Or.__init__.<locals>.<genexpr>T)r� r r� r3 r r[ )r� r3 rg )rH rw rx r� Y
s z Or.__init__Tc C sT d}d }g }x�| j D ]�}y|j||�}W nv tk
rd } z d | _| j|krT| }| j}W Y d d } ~ X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX |j||f� qW |�r*|j dd� d� x`|D ]X\}
}y|j
|||�S tk
�r$ } z"d | _| j|k�r| }| j}W Y d d } ~ X q�X q�W |d k �rB| j|_ |�nt||d| ��d S )Nrr c S s
| d S )Nr rw )�xrw rw rx ry u
s z Or.parseImpl.<locals>.<lambda>)r� z no defined alternatives to matchrs ) r3 r� r r8 r� r� r� ra r� �sortrt r� ) r� r- r� ro � maxExcLoc� maxExceptionr� r� Zloc2r� �_rw rw rx r� `
s<
z Or.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ixor__�
s
z Or.__ixor__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r; z ^ c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z Or.__str__.<locals>.<genexpr>r< )r� r� rU r� r3 )r� rw rw rx r� �
s
z
Or.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r3 r� )r� r� r: r� rw rw rx r� �
s zOr.checkRecursion)F)T)
r� r� r� r� r� r� rB r� r� r� rw rw )rH rx r K
s
& c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the first one listed is the one that will match.
May be constructed using the C{'|'} operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� �
s z&MatchFirst.__init__.<locals>.<genexpr>T)r� r r� r3 r r[ )r� r3 rg )rH rw rx r� �
s zMatchFirst.__init__Tc C s� d}d }x�| j D ]�}y|j|||�}|S tk
r\ } z|j|krL|}|j}W Y d d }~X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX qW |d k r�| j|_|�nt||d| ��d S )Nrr z no defined alternatives to matchrs )r3 rt r r� r� r� ra r� ) r� r- r� ro r? r@ r� r� r� rw rw rx r� �
s$
zMatchFirst.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ior__�
s
zMatchFirst.__ior__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r; z | c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z%MatchFirst.__str__.<locals>.<genexpr>r< )r� r� rU r� r3 )r� rw rw rx r� �
s
zMatchFirst.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r3 r� )r� r� r: r� rw rw rx r� �
s zMatchFirst.checkRecursion)F)T)
r� r� r� r� r� r� rC r� r� r� rw rw )rH rx r �
s
c s< e Zd ZdZd � fdd� Zd dd�Zdd� Zd d
� Z� ZS )
r am
Requires all given C{ParseExpression}s to be found, but in any order.
Expressions may be separated by whitespace.
May be constructed using the C{'&'} operator.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
Tc s8 t t| �j||� tdd� | jD ��| _d| _d| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� s z Each.__init__.<locals>.<genexpr>T)r� r r� r5 r3 r[ rX �initExprGroups)r� r3 rg )rH rw rx r� s z
Each.__init__c
s� | j r�tdd� | jD ��| _dd� | jD �}dd� | jD �}|| | _dd� | jD �| _dd� | jD �| _dd� | jD �| _| j| j7 _d | _ |}| jd d � }| jd d � � g }d
} x�| �rp|� | j | j }
g } x~|
D ]v} y| j||�}W n t k
�r | j
| � Y q�X |j
| jj t | �| �� | |k�rD|j
| � q�| � kr� j
| � q�W t| �t|
�kr�d } q�W |�r�d jd d� |D ��}
t ||d
|
��|� fdd�| jD �7 }g }x*|D ]"} | j|||�\}}|j
|� �q�W t|tg ��}||fS )Nc s s& | ] }t |t�rt|j�|fV qd S )N)rz r r� r. )r� r� rw rw rx r� s z!Each.parseImpl.<locals>.<genexpr>c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� s z"Each.parseImpl.<locals>.<listcomp>c S s" g | ]}|j rt|t� r|�qS rw )r[ rz r )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r2 r. )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� ! s c S s g | ]}t |tttf�s|�qS rw )rz r r2 r )r� r� rw rw rx r� " s FTz, c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� = s z*Missing one or more required elements (%s)c s$ g | ] }t |t�r|j� kr|�qS rw )rz r r. )r� r� )�tmpOptrw rx r� A s )rD r� r3 Zopt1mapZ optionalsZmultioptionalsZ
multirequiredZrequiredr� r r� r� r� �remover� r� rt �sumr" )r� r- r� ro Zopt1Zopt2ZtmpLocZtmpReqdZ
matchOrderZ keepMatchingZtmpExprsZfailedr� Zmissingr9 r� Z finalResultsrw )rE rx r� sP
zEach.parseImplc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r; z & c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� P s z Each.__str__.<locals>.<genexpr>r< )r� r� rU r� r3 )r� rw rw rx r� K s
z Each.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r3 r� )r� r� r: r� rw rw rx r� T s zEach.checkRecursion)T)T) r� r� r� r� r� r� r� r� r� rw rw )rH rx r �
s
5
1 c sl e Zd ZdZd� fdd� Zddd�Zdd � Z� fd
d �Z� fd d
�Zdd� Z g fdd�Z
� fdd�Z � Z S )r za
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r@ttjt�r2tj|�}ntjt |��}|| _
d | _ |d k r�|j | _ |j
| _
| j|j� |j| _|j| _|j| _| jj|j� d S )N)r� r r� rz r� �
issubclassr$ rQ r, r r. rU r` r[ r� rY rX rW re r] r� )r� r. rg )rH rw rx r� ^ s
z ParseElementEnhance.__init__Tc C s2 | j d k r | j j|||dd�S td|| j| ��d S )NF)rp r� )r. rt r ra )r� r- r� ro rw rw rx r� p s
z ParseElementEnhance.parseImplc C s* d| _ | jj� | _| jd k r&| jj� | S )NF)rX r. r� r� )r� rw rw rx r� v s
z#ParseElementEnhance.leaveWhitespacec sr t |t�rB|| jkrntt| �j|� | jd k rn| jj| jd � n,tt| �j|� | jd k rn| jj| jd � | S )Nrr rs rs )rz r+ r] r� r r� r. )r� r� )rH rw rx r� } s
zParseElementEnhance.ignorec s& t t| �j� | jd k r"| jj� | S )N)r� r r� r. )r� )rH rw rx r� � s
z ParseElementEnhance.streamlinec C sB | |krt || g ��|d d � | g }| jd k r>| jj|� d S )N)r& r. r� )r� r� r: rw rw rx r� � s
z"ParseElementEnhance.checkRecursionc C s6 |d d � | g }| j d k r(| j j|� | jg � d S )N)r. r� r� )r� r� r6 rw rw rx r� � s
z ParseElementEnhance.validatec sV yt t| �j� S tk
r" Y nX | jd krP| jd k rPd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU r. rH r� r� )r� )rH rw rx r� � s zParseElementEnhance.__str__)F)T)
r� r� r� r� r� r� r� r� r� r� r� r� r� rw rw )rH rx r Z s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
c s t t| �j|� d| _d S )NT)r� r r� r[ )r� r. )rH rw rx r� � s zFollowedBy.__init__Tc C s | j j||� |g fS )N)r. r� )r� r- r� ro rw rw rx r� � s zFollowedBy.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s2 e Zd ZdZ� fdd�Zd dd�Zdd� Z� ZS )
r a�
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
c s0 t t| �j|� d| _d| _dt| j� | _d S )NFTzFound unwanted token, )r� r r� rX r[ r� r. ra )r� r. )rH rw rx r� � s zNotAny.__init__Tc C s& | j j||�r t||| j| ��|g fS )N)r. r� r ra )r� r- r� ro rw rw rx r� � s zNotAny.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� z~{r< )r� r� rU r� r. )r� rw rw rx r� � s
zNotAny.__str__)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd Zd� fdd� Zddd�Z� ZS ) �_MultipleMatchNc sF t t| �j|� d| _|}t|t�r.tj|�}|d k r<| nd | _d S )NT) r� rI r� rW rz r� r$ rQ � not_ender)r� r. �stopOnZender)rH rw rx r� � s
z_MultipleMatch.__init__Tc C s� | j j}| j}| jd k }|r$| jj}|r2|||� ||||dd�\}}yZ| j } xJ|rb|||� | rr|||�}
n|}
|||
|�\}} | s�| j� rT|| 7 }qTW W n ttfk
r� Y nX ||fS )NF)rp ) r. rt r� rJ r� r] r� r r� ) r� r- r� ro Zself_expr_parseZself_skip_ignorablesZ check_enderZ
try_not_enderr� ZhasIgnoreExprsr� Z tmptokensrw rw rx r� � s,
z_MultipleMatch.parseImpl)N)T)r� r� r� r� r� r� rw rw )rH rx rI � s rI c @ s e Zd ZdZdd� ZdS )r a�
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
c C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r; z}...)r� r� rU r� r. )r� rw rw rx r� ! s
zOneOrMore.__str__N)r� r� r� r� r� rw rw rw rx r s c s8 e Zd ZdZd
� fdd� Zd � fdd� Zdd � Z� ZS ) r2 aw
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
Nc s t t| �j||d� d| _d S )N)rK T)r� r2 r� r[ )r� r. rK )rH rw rx r� 6 s zZeroOrMore.__init__Tc s6 yt t| �j|||�S ttfk
r0 |g fS X d S )N)r� r2 r� r r� )r� r- r� ro )rH rw rx r� : s zZeroOrMore.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r z]...)r� r� rU r� r. )r� rw rw rx r� @ s
zZeroOrMore.__str__)N)T)r� r� r� r� r� r� r� r� rw rw )rH rx r2 * s c @ s e Zd Zdd� ZeZdd� ZdS )�
_NullTokenc C s dS )NFrw )r� rw rw rx r� J s z_NullToken.__bool__c C s dS )Nr� rw )r� rw rw rx r� M s z_NullToken.__str__N)r� r� r� r� r' r� rw rw rw rx rL I s rL c s6 e Zd ZdZef� fdd� Zd dd�Zdd� Z� ZS )
r aa
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
c s. t t| �j|dd� | jj| _|| _d| _d S )NF)rg T)r� r r� r. rW r� r[ )r� r. r� )rH rw rx r� t s
zOptional.__init__Tc C sz y | j j|||dd�\}}W nT ttfk
rp | jtk rh| j jr^t| jg�}| j|| j j< ql| jg}ng }Y nX ||fS )NF)rp )r. rt r r� r� �_optionalNotMatchedrV r" )r� r- r� ro r� rw rw rx r� z s
zOptional.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r r )r� r� rU r� r. )r� rw rw rx r� � s
zOptional.__str__)T) r� r� r� r� rM r� r� r� r� rw rw )rH rx r Q s "
c s, e Zd ZdZd � fdd� Zd
dd�Z� ZS ) r( a�
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
FNc s` t t| �j|� || _d| _d| _|| _d| _t|t �rFt
j |�| _ n|| _ dt
| j� | _d S )NTFzNo match found for )r� r( r� �
ignoreExprr[ r` � includeMatchr� rz r� r$ rQ �failOnr� r. ra )r� r� �includer� rP )rH rw rx r� � s
zSkipTo.__init__Tc C s, |}t |�}| j}| jj}| jd k r,| jjnd }| jd k rB| jjnd } |}
x�|
|kr�|d k rh|||
�rhP | d k r�x*y| ||
�}
W qr tk
r� P Y qrX qrW y|||
ddd� W n tt fk
r� |
d7 }
Y qLX P qLW t||| j
| ��|
}|||� } t | �} | j �r$||||dd�\}}
| |
7 } || fS )NF)ro rp rr )rp )
r� r. rt rP r� rN r� r r r� ra r" rO )r� r- r� ro r0 r� r. Z
expr_parseZself_failOn_canParseNextZself_ignoreExpr_tryParseZtmplocZskiptextZ
skipresultr� rw rw rx r� � s<
zSkipTo.parseImpl)FNN)T)r� r� r� r� r� r� r� rw rw )rH rx r( � s 6
c sb e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Zd d � Zg fd
d�Z dd� Z
� fdd�Z � Z S )r aK
Forward declaration of an expression to be defined later -
used for recursive grammars, such as algebraic infix notation.
When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
Note: take care when assigning to C{Forward} not to overlook precedence of operators.
Specifically, '|' has a lower precedence than '<<', so that::
fwdExpr << a | b | c
will actually be evaluated as::
(fwdExpr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the C{Forward}::
fwdExpr << (a | b | c)
Converting to use the '<<=' operator instead will avoid this problem.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
Nc s t t| �j|dd� d S )NF)rg )r� r r� )r� r� )rH rw rx r� s zForward.__init__c C sj t |t�rtj|�}|| _d | _| jj| _| jj| _| j| jj � | jj
| _
| jj | _ | j j
| jj � | S )N)rz r� r$ rQ r. rU r` r[ r� rY rX rW r] r� )r� r� rw rw rx �
__lshift__ s
zForward.__lshift__c C s | |> S )Nrw )r� r� rw rw rx � __ilshift__' s zForward.__ilshift__c C s
d| _ | S )NF)rX )r� rw rw rx r� * s zForward.leaveWhitespacec C s$ | j s d| _ | jd k r | jj� | S )NT)r_ r. r� )r� rw rw rx r� . s
zForward.streamlinec C s> | |kr0|d d � | g }| j d k r0| j j|� | jg � d S )N)r. r� r� )r� r� r6 rw rw rx r� 5 s
zForward.validatec C s> t | d�r| jS | jjd S d}W d | j| _X | jjd | S )Nr� z: ...�Nonez: )r� r� rH r� Z _revertClass�_ForwardNoRecurser. r� )r� Z retStringrw rw rx r� < s
zForward.__str__c s. | j d k rtt| �j� S t� }|| K }|S d S )N)r. r� r r� )r� r� )rH rw rx r� M s
z Forward.copy)N)
r� r� r� r� r� rR rS r� r� r� r� r� r� rw rw )rH rx r s
c @ s e Zd Zdd� ZdS )rU c C s dS )Nz...rw )r� rw rw rx r� V s z_ForwardNoRecurse.__str__N)r� r� r� r� rw rw rw rx rU U s rU c s" e Zd ZdZd� fdd� Z� ZS )r- zQ
Abstract subclass of C{ParseExpression}, for converting parsed results.
Fc s t t| �j|� d| _d S )NF)r� r- r� rW )r� r. rg )rH rw rx r� ] s zTokenConverter.__init__)F)r� r� r� r� r� r� rw rw )rH rx r- Y s c s6 e Zd ZdZd
� fdd� Z� fdd�Zdd � Z� ZS ) r
a�
Converter to concatenate all matching tokens to a single string.
By default, the matching patterns must also be contiguous in the input string;
this can be disabled by specifying C{'adjacent=False'} in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
r� Tc s8 t t| �j|� |r | j� || _d| _|| _d| _d S )NT)r� r
r� r� �adjacentrX �
joinStringre )r� r. rW rV )rH rw rx r� r s zCombine.__init__c s( | j rtj| |� ntt| �j|� | S )N)rV r$ r� r� r
)r� r� )rH rw rx r� | s zCombine.ignorec C sP |j � }|d d �= |tdj|j| j��g| jd�7 }| jrH|j� rH|gS |S d S )Nr� )r� )r� r" r� r
rW rb rV r� )r� r- r� r� ZretToksrw rw rx r� � s
"zCombine.postParse)r� T)r� r� r� r� r� r� r� r� rw rw )rH rx r
a s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r a�
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s zGroup.__init__c C s |gS )Nrw )r� r- r� r� rw rw rx r� � s zGroup.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r aW
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s z
Dict.__init__c C s� x�t |�D ]�\}}t|�dkr q
|d }t|t�rBt|d �j� }t|�dkr^td|�||< q
t|�dkr�t|d t� r�t|d |�||< q
|j� }|d= t|�dks�t|t�r�|j � r�t||�||< q
t|d |�||< q
W | j
r�|gS |S d S )Nr rr r� rq ) r� r� rz ru r� r� r� r" r� r� rV )r� r- r� r� r� �tokZikeyZ dictvaluerw rw rx r� � s$
zDict.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s # c @ s e Zd ZdZdd� Zdd� ZdS )r+ aV
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
c C s g S )Nrw )r� r- r� r� rw rw rx r� � s zSuppress.postParsec C s | S )Nrw )r� rw rw rx r� � s zSuppress.suppressN)r� r� r� r� r� r� rw rw rw rx r+ � s c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) r zI
Wrapper for parse actions, to ensure they are only called once.
c C s t |�| _d| _d S )NF)rM �callable�called)r� Z
methodCallrw rw rx r� s
zOnlyOnce.__init__c C s. | j s | j|||�}d| _ |S t||d��d S )NTr� )rZ rY r )r� r� r5 rv r� rw rw rx r� s
zOnlyOnce.__call__c C s
d| _ d S )NF)rZ )r� rw rw rx �reset
s zOnlyOnce.resetN)r� r� r� r� r� r� r[ rw rw rw rx r � s c s: t � �� � fdd�}y � j|_W n tk
r4 Y nX |S )as
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
c s� � j }| dd � \}}}t| �dkr8| d jj d | }tjjd|t||�||f � y � | � }W n8 tk
r� } z tjjd||f � � W Y d d }~X nX tjjd||f � |S )Nro r �.z">>entering %s(line: '%s', %d, %r)
z <<leaving %s (exception: %s)
z<<leaving %s (ret: %r)
r9 )r� r� rH r~ �stderr�writerG rK )ZpaArgsZthisFuncr� r5 rv r� r3 )r� rw rx �z# s ztraceParseAction.<locals>.z)rM r� r� )r� r_ rw )r� rx rb
s
�,Fc C s` t | �d t |� d t | � d }|rBt| t|| � �j|�S | tt|�| � j|�S dS )a�
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
z [r� z]...N)r� r
r2 ri r+ )r. Zdelim�combineZdlNamerw rw rx r@ 9 s
$c sj t � � � �fdd�}|dkr0tt�jdd� �}n|j� }|jd� |j|dd� |� jd t�� d
�S ) a:
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
c s. |d }� |r t t�g| ��p&t t�> g S )Nr )r r rC )r� r5 rv r� )� arrayExprr. rw rx �countFieldParseAction_ s "z+countedArray.<locals>.countFieldParseActionNc S s t | d �S )Nr )ru )rv rw rw rx ry d s z countedArray.<locals>.<lambda>ZarrayLenT)rf z(len) z...)r r/ rR r� r� ri rx r� )r. ZintExprrc rw )rb r. rx r< L s
c C s: g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W |S )N)rz r� r� r� r� )�Lr� r� rw rw rx r� k s
r� c s6 t � � � fdd�}| j|dd� � jdt| � � � S )a*
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
c sP |rBt |�dkr � |d > qLt|j� �}� tdd� |D ��> n
� t� > d S )Nrr r c s s | ]}t |�V qd S )N)r )r� �ttrw rw rx r� � s zDmatchPreviousLiteral.<locals>.copyTokenToRepeater.<locals>.<genexpr>)r� r� r� r r
)r� r5 rv Ztflat)�reprw rx �copyTokenToRepeater� s z1matchPreviousLiteral.<locals>.copyTokenToRepeaterT)rf z(prev) )r rx ri r� )r. rg rw )rf rx rO t s
c sF t � � | j� }� |K � � fdd�}| j|dd� � jdt| � � � S )aS
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
c s* t |j� �� � fdd�}�j|dd� d S )Nc s$ t |j� �}|� kr tddd��d S )Nr� r )r� r� r )r� r5 rv Z theseTokens)� matchTokensrw rx �mustMatchTheseTokens� s zLmatchPreviousExpr.<locals>.copyTokenToRepeater.<locals>.mustMatchTheseTokensT)rf )r� r� r� )r� r5 rv ri )rf )rh rx rg � s z.matchPreviousExpr.<locals>.copyTokenToRepeaterT)rf z(prev) )r r� rx ri r� )r. Ze2rg rw )rf rx rN � s c C s> x dD ]}| j |t| �} qW | j dd�} | j dd�} t| �S )Nz\^-]r z\nr' z\t)r� �_bslashr� )r� r� rw rw rx r � s
r Tc
s� |rdd� }dd� }t � ndd� }dd� }t� g }t| t�rF| j� }n&t| tj�r\t| �}ntj dt
dd� |svt � S d }x�|t |�d
k �r|| }xnt
||d
d � �D ]N\}} || |�r�||| d
= P q�||| �r�||| d
= |j|| � | }P q�W |d
7 }q|W | �r�|�r�yht |�t d j|��k�rZtd
d jdd� |D �� �jdj|��S tdjdd� |D ���jdj|��S W n& tk
�r� tj dt
dd� Y nX t� fdd�|D ��jdj|��S )a�
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
c S s | j � |j � kS )N)r� )r �brw rw rx ry � s zoneOf.<locals>.<lambda>c S s |j � j| j � �S )N)r� r� )r rk rw rw rx ry � s c S s | |kS )Nrw )r rk rw rw rx ry � s c S s
|j | �S )N)r� )r rk rw rw rx ry � s z6Invalid argument to oneOf, expected string or iterablerq )r� r rr Nr� z[%s]c s s | ]}t |�V qd S )N)r )r� �symrw rw rx r� � s zoneOf.<locals>.<genexpr>z | �|c s s | ]}t j|�V qd S )N)rd r )r� rl rw rw rx r� � s z7Exception creating Regex for oneOf, building MatchFirstc 3 s | ]}� |�V qd S )Nrw )r� rl )�parseElementClassrw rx r� � s )r r rz r� r� r� r4 r� r� r� r� r r� r� r� r� r' ri rK r )
Zstrsr� ZuseRegexZisequalZmasksZsymbolsr� Zcurr� r� rw )rn rx rS � sL
((c C s t tt| | ���S )a�
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
)r r2 r )r� r� rw rw rx rA � s !c C s^ t � jdd� �}|j� }d|_|d�| |d� }|r@dd� }ndd� }|j|� | j|_|S ) a�
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
c S s |S )Nrw )r� r� rv rw rw rx ry 8 s z!originalTextFor.<locals>.<lambda>F�_original_start�
_original_endc S s | |j |j� S )N)ro rp )r� r5 rv rw rw rx ry = s c S s& | |j d�|j d�� g|d d �< d S )Nro rp )r� )r� r5 rv rw rw rx � extractText? s z$originalTextFor.<locals>.extractText)r
r� r� re r] )r. ZasStringZ locMarkerZ endlocMarker� matchExprrq rw rw rx rg s
c C s t | �jdd� �S )zp
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
c S s | d S )Nr rw )rv rw rw rx ry J s zungroup.<locals>.<lambda>)r- r� )r. rw rw rx rh E s c C s4 t � jdd� �}t|d�| d� |j� j� d� �S )a�
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
c S s |S )Nrw )r� r5 rv rw rw rx ry ` s z locatedExpr.<locals>.<lambda>Z
locn_startr� Zlocn_end)r
r� r r� r� )r. Zlocatorrw rw rx rj L s z\[]-*.$+^?()~ )r c C s |d d S )Nr rr rw )r� r5 rv rw rw rx ry k s ry z\\0?[xX][0-9a-fA-F]+c C s t t|d jd�d��S )Nr z\0x� )�unichrru �lstrip)r� r5 rv rw rw rx ry l s z \\0[0-7]+c C s t t|d dd � d��S )Nr rr � )rt ru )r� r5 rv rw rw rx ry m s z\])r� r z\wr7 r r� Znegate�bodyr c sB dd� � y dj � fdd�tj| �jD ��S tk
r< dS X dS )a�
Helper to easily define string ranges for use in Word construction. Borrows
syntax from regexp '[]' string range definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string is the expanded
character set joined into a single string.
The values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
c S s< t | t�s| S djdd� tt| d �t| d �d �D ��S )Nr� c s s | ]}t |�V qd S )N)rt )r� r� rw rw rx r� � s z+srange.<locals>.<lambda>.<locals>.<genexpr>r rr )rz r" r� r� �ord)�prw rw rx ry � s zsrange.<locals>.<lambda>r� c 3 s | ]}� |�V qd S )Nrw )r� �part)� _expandedrw rx r� � s zsrange.<locals>.<genexpr>N)r� �_reBracketExprr� rw rK )r� rw )r{ rx r_ r s
c s � fdd�}|S )zt
Helper method for defining parse actions that require matching at a specific
column in the input text.
c s" t || �� kr t| |d� ��d S )Nz matched token not at column %d)r9 r )r) Zlocnr1 )r� rw rx � verifyCol� s z!matchOnlyAtCol.<locals>.verifyColrw )r� r} rw )r� rx rM � s c s � fdd�S )a�
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
c s � gS )Nrw )r� r5 rv )�replStrrw rx ry � s z replaceWith.<locals>.<lambda>rw )r~ rw )r~ rx r\ � s c C s |d dd� S )a
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
r rr rs rw )r� r5 rv rw rw rx rZ � s c sN � �fdd�}yt �dt �d�j�}W n tk
rB t��}Y nX ||_|S )aG
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
c s � �fdd�|D �S )Nc s g | ]}�|f� �� �qS rw rw )r� Ztokn)r� r6 rw rx r� � s z(tokenMap.<locals>.pa.<locals>.<listcomp>rw )r� r5 rv )r� r6 rw rx r} � s ztokenMap.<locals>.par� rH )rJ r� rK r{ )r6 r� r} rL rw )r� r6 rx rm � s c C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� �lower)rv rw rw rx ry � s c C s� t | t�r | }t| | d�} n| j}tttd �}|r�tj� j t
�}t d�| d� t t
t|t d� | ��� tddgd�jd �j d
d � � t d � }n�d
jdd� tD ��}tj� j t
�t|�B }t d�| d� t t
t|j t�tt d�| � ��� tddgd�jd �j dd � � t d � }ttd�| d �}|jdd
j|jdd�j� j� � �jd| �}|jdd
j|jdd�j� j� � �jd| �}||_||_||fS )zRInternal helper to construct opening and closing tag expressions, given a tag name)r� z_-:r �tag�=�/F)r� rC c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z_makeTags.<locals>.<lambda>r r� c s s | ]}|d kr|V qdS )r Nrw )r� r� rw rw rx r� � s z _makeTags.<locals>.<genexpr>c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z</r� �:r� z<%s>r
z</%s>) rz r� r r� r/ r4 r3 r> r� r� rZ r+ r r2 r r rm r� rV rY rB r
�_Lr� �titler� ri r� )�tagStrZxmlZresnameZ tagAttrNameZ tagAttrValueZopenTagZprintablesLessRAbrackZcloseTagrw rw rx � _makeTags� s"
T\..r� c C s
t | d�S )a
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
F)r� )r� rw rw rx rK � s c C s
t | d�S )z�
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
T)r� )r� rw rw rx rL s c s8 | r| dd� � n|j � � dd� � D �� � fdd�}|S )a<
Helper to create a validating parse action to be used with start tags created
with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
with a required attribute value, to avoid false matches on common tags such as
C{<TD>} or C{<DIV>}.
Call C{withAttribute} with a series of attribute names and values. Specify the list
of filter attributes names and values as:
- keyword arguments, as in C{(align="right")}, or
- as an explicit dict with C{**} operator, when an attribute name is also a Python
reserved word, as in C{**{"class":"Customer", "align":"right"}}
- a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
For attribute names with a namespace prefix, you must use the second form. Attribute
names are matched insensitive to upper/lower case.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
Nc S s g | ]\}}||f�qS rw rw )r� r� r� rw rw rx r� Q s z!withAttribute.<locals>.<listcomp>c s^ xX� D ]P\}}||kr&t | |d| ��|tjkr|| |krt | |d||| |f ��qW d S )Nzno matching attribute z+attribute '%s' has value '%s', must be '%s')r re � ANY_VALUE)r� r5 r� ZattrNameZ attrValue)�attrsrw rx r} R s zwithAttribute.<locals>.pa)r� )r� ZattrDictr} rw )r� rx re s 2 c C s |r d| nd}t f || i�S )a�
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
z%s:class�class)re )Z classname� namespaceZ classattrrw rw rx rk \ s �(r c C s� t � }| || | B }�x`t|�D �]R\}}|d dd� \}} }
} | dk rTd| nd| } | dkr�|dksxt|�dkr�td��|\}
}t � j| �}|
tjk�rd| dkr�t|| �t|t |� � }n�| dk�r |dk �r t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�rZt||
| | | �t||
| | | � }ntd ��n�|
tj
k�rH| dk�r�t |t ��s�t |�}t|j
| �t|| � }n�| dk�r|dk �r�t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�r>t||
| | | �t||
| | | � }ntd ��ntd
��| �r`|j| � ||j| �|B K }|}q"W ||K }|S ) a�
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
Nr ro z%s termz %s%s termrq z@if numterms=3, opExpr must be a tuple or list of two expressionsrr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)N)r r� r� r� ri rT �LEFTr r r �RIGHTrz r r. r� )ZbaseExprZopListZlparZrparr� ZlastExprr� ZoperDefZopExprZarityZrightLeftAssocr} ZtermNameZopExpr1ZopExpr2ZthisExprrr rw rw rx ri � sR ;
&
&
z4"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�"z string enclosed in double quotesz4'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�'z string enclosed in single quotesz*quotedString using single or double quotes�uzunicode string literalc C s� | |krt d��|dk�r(t| t�o,t|t��r t| �dkr�t|�dkr�|dk r�tt| t| | tj dd� ��j dd� �}n$t
j � t| | tj �j dd� � }nx|dk r�tt| t | � t |� ttjdd� ��j dd� �}n4ttt | � t |� ttjdd� ��j d d� �}nt d
��t
� }|dk �rb|tt| �t||B |B � t|� �K }n$|tt| �t||B � t|� �K }|jd | |f � |S ) a~
Helper method for defining nested lists enclosed in opening and closing
delimiters ("(" and ")" are the default).
Parameters:
- opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
z.opening and closing strings cannot be the sameNrr )r c S s | d j � S )Nr )r� )rv rw rw rx ry 9 s z nestedExpr.<locals>.<lambda>c S s | d j � S )Nr )r� )rv rw rw rx ry < s c S s | d j � S )Nr )r� )rv rw rw rx ry B s c S s | d j � S )Nr )r� )rv rw rw rx ry F s zOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)r� rz r� r� r
r r r$ rN r� rC r� r r r r+ r2 ri )�openerZcloserZcontentrN r� rw rw rx rP � s4 :
*$c s� � fdd�}� fdd�}� fdd�}t t� jd�j� �}t� t� j|� jd�}t� j|�jd �}t� j|�jd
�} |r�tt|�| t |t| � t|� � | �}
n$tt|�t |t| � t|� � �}
| j t
t� � |
jd �S ) a
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
c sN |t | �krd S t|| �}|� d krJ|� d kr>t| |d��t| |d��d S )Nrr zillegal nestingznot a peer entryrs rs )r� r9 r! r )r� r5 rv �curCol)� indentStackrw rx �checkPeerIndent� s
z&indentedBlock.<locals>.checkPeerIndentc s2 t || �}|� d kr"� j|� n t| |d��d S )Nrr znot a subentryrs )r9 r� r )r� r5 rv r� )r� rw rx �checkSubIndent� s
z%indentedBlock.<locals>.checkSubIndentc sN |t | �krd S t|| �}� o4|� d k o4|� d ksBt| |d��� j� d S )Nrr rq znot an unindentrs r: )r� r9 r r� )r� r5 rv r� )r� rw rx �
checkUnindent� s
z$indentedBlock.<locals>.checkUnindentz �INDENTr� ZUNINDENTzindented block) r r r� r� r
r� ri r r r� rj ) ZblockStatementExprr� r r� r� r� r! r� ZPEERZUNDENTZsmExprrw )r� rx rf Q s N , z#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]z_:zany tagzgt lt amp nbsp quot aposz><& "'z &(?P<entity>rm z);zcommon HTML entityc C s t j| j�S )zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMapr� Zentity)rv rw rw rx r[ � s z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style comment)r� z � commaItem)r� c @ s� e Zd ZdZee�Zee�Ze e
�j d�j e�Z
e e�j d�j eed��Zed�j d�j e�Ze� j e�d e� j e� j d�Zejd d
� � eeeed �j� e � B j d �Zeje� ed
�j d�j e�Zed�j d�j e�ZeeB eB j� Zed�j d�j e�Z e e d e d �j d�Z ed�j d�Z ed�j d�Z!e!de! d j d�Z"ee!de! d> �d ee!de! d? � j d �Z#e#j$d d
� � d!e j d"�Z%e&e"e%B e#B j d#��j d#�Z'ed$�j d%�Z(e)d@d'd(��Z*e)dAd*d+��Z+ed,�j d-�Z,ed.�j d/�Z-ed0�j d1�Z.e/j� e0j� B Z1e)d2d3� �Z2e&e3e4d4� e5� e e6d4d5� ee7d6�� ��j� j d7�Z8e9ee:j;� e8B d8d9��j d:�Z<e)ed;d
� ��Z=e)ed<d
� ��Z>d=S )Brn a�
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
�integerz hex integerrs z[+-]?\d+zsigned integerr� �fractionc C s | d | d S )Nr rr rs rw )rv rw rw rx ry � s zpyparsing_common.<lambda>r7 z"fraction or mixed integer-fractionz
[+-]?\d+\.\d*z real numberz+[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)z$real number with scientific notationz [+-]?\d+\.?\d*([eE][+-]?\d+)?�fnumberrA �
identifierzK(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}z IPv4 addressz[0-9a-fA-F]{1,4}� hex_integerr� � zfull IPv6 addressr rB z::zshort IPv6 addressc C s t dd� | D ��dk S )Nc s s | ]}t jj|�rd V qdS )rr N)rn �
_ipv6_partr� )r� re rw rw rx r� � s z,pyparsing_common.<lambda>.<locals>.<genexpr>rv )rG )rv rw rw rx ry � s z::ffff:zmixed IPv6 addressz IPv6 addressz:[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}z MAC address�%Y-%m-%dc s � fdd�}|S )a�
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
c sL yt j|d � �j� S tk
rF } zt| |t|���W Y d d }~X nX d S )Nr )r �strptimeZdater� r r{ )r� r5 rv �ve)�fmtrw rx �cvt_fn� s z.pyparsing_common.convertToDate.<locals>.cvt_fnrw )r� r� rw )r� rx �
convertToDate� s z pyparsing_common.convertToDate�%Y-%m-%dT%H:%M:%S.%fc s � fdd�}|S )a
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
c sH yt j|d � �S tk
rB } zt| |t|���W Y d d }~X nX d S )Nr )r r� r� r r{ )r� r5 rv r� )r� rw rx r� � s z2pyparsing_common.convertToDatetime.<locals>.cvt_fnrw )r� r� rw )r� rx �convertToDatetime� s z"pyparsing_common.convertToDatetimez7(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?z ISO8601 datez�(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?zISO8601 datetimez2[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}�UUIDc C s t jj|d �S )a
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
r )rn �_html_stripperr� )r� r5 r� rw rw rx �
stripHTMLTags� s
z pyparsing_common.stripHTMLTagsr` )r� z r� r� )r� zcomma separated listc C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� r )rv rw rw rx ry � s N)r rB )r rB )r� )r� )?r� r� r� r� rm ru ZconvertToInteger�floatZconvertToFloatr/ rR ri r� r� rD r� r' Zsigned_integerr� rx r r� Z
mixed_integerrG �realZsci_realr� �numberr� r4 r3 r� Z ipv4_addressr� Z_full_ipv6_addressZ_short_ipv6_addressr~ Z_mixed_ipv6_addressr
Z ipv6_addressZ mac_addressr� r� r� Z iso8601_dateZiso8601_datetime�uuidr7 r6 r� r� r r r rV r. �
_commasepitemr@ rY r� Zcomma_separated_listrd rB rw rw rw rx rn � sN ""
2 8 �__main__Zselect�fromz_$r\ )ra �columnsrj ZtablesZcommandaK
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
z]
100
-100
+100
3.14159
6.02e23
1e-12
z
100
FF
z6
12345678-1234-5678-1234-567812345678
)rq )r` F)N)FT)T)r� )T)�r� � __version__Z__versionTime__�
__author__r� �weakrefr r� r� r~ r� rd r r� r" r< r� r �_threadr � ImportErrorZ threadingr r� Z ordereddict�__all__r� � version_infor; r �maxsizer� r{ r� �chrrt r� rG r� r �reversedr� r� r r5 r
r rI ZmaxintZxranger� Z __builtin__r� Zfnamer� rJ r� r� r� r� r� r� Zascii_uppercaseZascii_lowercaser4 rR rD r3 rj r� Z printablerV rK r r r! r# r& r� r" �MutableMapping�registerr9 rJ rG r/ r2 r4 rQ rM r$ r, r
r r r� rQ r r r rl r/ r' r% r r. r/ r r r r* r) r1 r0 r r r r r r r r rI r r2 rL rM r r( r rU r- r
r r r+ r rb r@ r< r� rO rN r rS rA rg rh rj ri rC rI rH ra r` r� Z _escapedPuncZ_escapedHexCharZ_escapedOctChar�UNICODEZ _singleCharZ
_charRangerm r| r_ rM r\ rZ rm rd rB r� rK rL re r� rk rT r� r� ri rU r> r^ rY rc rP rf r5 rW r7 r6 r� r� r� r� r; r[ r8 rE r� r] r? r= rF rX r� r� r: rn r� Z selectTokenZ fromTokenZidentZ
columnNameZcolumnNameListZ
columnSpecZ tableNameZ
tableNameListZ simpleSQLr� r� r� r� r� r� rw rw rw rx �<module>= s�
8
@ d &A= I
G3 pLOD|M &# @sQ,A, I# % &0
, ? #k Zr
(
0
" __pycache__/configobj.cpython-36.pyc 0000644 00000163466 14751155147 0013374 0 ustar 00 3
��S^ � @ sV d dl Z d dlZd dlZd dlmZmZmZmZ d dlZd dl m
Z
da edKedLedMedNiZ dddddddddddddddd�Z
eeeeed �Zd
d � Zd Zd
ZdZdZdZdZe� ZdOZd$Zd%Zd&Zd'd(d'd(d(dd'dddd(d(d)� Z d*d+� Z G d,d!� d!e �Z G d-d.� d.e�Z e � Z!d/d0� Z"G d1d� de#�Z$G d2d� de$�Z%G d3d� de$�Z&G d4d � d e'�Z(G d5d� de$�Z)G d6d� de$�Z*G d7d� de$�Z+G d8d � d e+�Z,G d9d � d e$�Z-G d:d � d e+�Z.G d;d � d e$�Z/G d<d=� d=e�Z0G d>d?� d?e0�Z1G d@dA� dAe0�Z2e1e2dB�Z3dCdD� Z4G dEdF� dFe5�Z6G dGd� de6�Z7G dHd� de�Z8dPdId"�Z9f fdJd#�Z:dS )Q� N)�BOM_UTF8� BOM_UTF16� BOM_UTF16_BE� BOM_UTF16_LE)� __version__�utf_8�utf16_be�utf_16�utf16_le)r �u16�utf16zutf-16r � utf_16_bezutf-16ber
� utf_16_lezutf-16ler �u8�utf�utf8zutf-8)r r r r
Nc C s t j| j� �dkS )Nr )�BOM_LIST�get�lower)�encoding� r � /usr/lib/python3.6/configobj.py�
match_utf8D s r z'%s'z"%s"z%sz
'"z"""%s"""z'''%s'''�DEFAULT_INDENT_TYPE�DEFAULT_INTERPOLATION�ConfigObjError� NestingError�
ParseError�DuplicateError�ConfigspecError� ConfigObj� SimpleVal�InterpolationError�InterpolationLoopError�MissingInterpolationOption�RepeatSectionError� ReloadError� UnreprError� UnknownType�flatten_errors�get_extra_values� configparserz �
TF) �
interpolation� raise_errors� list_values� create_empty�
file_error�
configspec� stringify� indent_typer �default_encoding�unrepr�write_empty_valuesc C s> t d krdd l a d| } t j| �}|j� d j� d j� d S )Nr za=� )�compiler�parse� getChildren)�s�pr r r �getObj� s
r> c @ s e Zd ZdS )r( N)�__name__�
__module__� __qualname__r r r r r( � s c @ s\ e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dS )�Builderc C s t d krt|jj��t |�S )N)�mr( � __class__r? )�self�or r r �build� s z
Builder.buildc C s t t| j|j� ��S )N)�list�maprG r; )rE rF r r r �
build_List� s zBuilder.build_Listc C s |j S )N)�value)rE rF r r r � build_Const� s zBuilder.build_Constc C s6 i }t t| j|j� ��}x|D ]}t|�||< q W |S )N)�iterrI rG r; �next)rE rF �d�iZelr r r �
build_Dict� s
zBuilder.build_Dictc C s t | j|��S )N)�tuplerJ )rE rF r r r � build_Tuple� s zBuilder.build_Tuplec C s6 |j dkrd S |j dkr dS |j dkr*dS td��d S )N�None�TrueT�FalseFzUndefined Name)�namer( )rE rF r r r �
build_Name� s
zBuilder.build_Namec C sh t t| j|j� ��\}}y t|�}W n tk
r@ td��Y nX t|t� sX|j dkr`td��|| S )NZAddg )
rH rI rL r; �float� TypeErrorr( �
isinstance�complex�real)rE rF r] �imagr r r � build_Add� s zBuilder.build_Addc C s | j |j�}t||j�S )N)rG �expr�getattrZattrname)rE rF �parentr r r �
build_Getattr� s zBuilder.build_Getattrc C s | j |j� d � S )Nr )rL r; )rE rF r r r �build_UnarySub� s zBuilder.build_UnarySubc C s | j |j� d �S )Nr )rL r; )rE rF r r r �build_UnaryAdd� s zBuilder.build_UnaryAddN)
r? r@ rA rG rJ rL rQ rS rX r_ rc rd re r r r r rB � s
rB c C s | s| S dd l }|j| �S )Nr )�astZ literal_eval)r< rf r r r r6 � s r6 c @ s e Zd ZdZddd�ZdS )r zk
This is the base class for all errors that ConfigObj raises.
It is a subclass of SyntaxError.
� Nc C s || _ || _tj| |� d S )N)�line� line_number� SyntaxError�__init__)rE �messageri rh r r r rk � s zConfigObjError.__init__)rg Nrg )r? r@ rA �__doc__rk r r r r r � s c @ s e Zd ZdZdS )r zE
This error indicates a level of nesting that doesn't match.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdS )r z�
This error indicates that a line is badly written.
It is neither a valid ``key = value`` line,
nor a valid section marker line.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdd� ZdS )r& zW
A 'reload' operation failed.
This exception is a subclass of ``IOError``.
c C s t j| d� d S )Nz#reload failed, filename is not set.)�IOErrorrk )rE r r r rk � s zReloadError.__init__N)r? r@ rA rm rk r r r r r& � s c @ s e Zd ZdZdS )r z:
The keyword or section specified already exists.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdS )r z7
An error occured whilst parsing a configspec.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdS )r" z,Base class for the two interpolation errors.N)r? r@ rA rm r r r r r" � s c @ s e Zd ZdZdd� ZdS )r# z=Maximum interpolation depth exceeded in string interpolation.c C s t j| d| � d S )Nz*interpolation loop detected in value "%s".)r" rk )rE �optionr r r rk s z InterpolationLoopError.__init__N)r? r@ rA rm rk r r r r r# s c @ s e Zd ZdZdS )r% zk
This error indicates additional sections in a section with a
``__many__`` (repeated) section.
N)r? r@ rA rm r r r r r% s c @ s e Zd ZdZdd� ZdS )r$ z0A value specified for interpolation was missing.c C s d| }t j| |� d S )Nz%missing option "%s" in interpolation.)r" rk )rE ro �msgr r r rk s z#MissingInterpolationOption.__init__N)r? r@ rA rm rk r r r r r$ s c @ s e Zd ZdZdS )r' z An error parsing in unrepr mode.N)r? r@ rA rm r r r r r' s c @ s> e Zd ZdZejd�ZdZdd� Zdd� Z dd � Z
d
d � Z d S )
�InterpolationEnginez�
A helper class to help perform string interpolation.
This class is an abstract base class; its descendants perform
the actual work.
z
%\(([^)]*)\)s�%c C s
|| _ d S )N)�section)rE rs r r r rk * s z InterpolationEngine.__init__c s0 �j |kr|S � �fdd�� � ||�ji �}|S )Nc s� | |j f|krt| ��d|| |j f< �jj|�}xz|r��j|�\}}}|dkrT|}n� ||||�}|j� \} }
dj|d| � |||
d� f�}| t|� } �jj|| �}q2W || |j f= |S )ax The function that does the actual work.
``value``: the string we're trying to interpolate.
``section``: the section in which that string was found
``backtrail``: a dict to keep track of where we've been,
to detect and prevent infinite recursion loops
This is similar to a depth-first-search algorithm.
r8 Nrg )rW r# �_KEYCRE�search� _parse_match�span�join�len) �keyrK rs Z backtrail�match�k�vr< Z replacement�start�endZnew_search_start)�recursive_interpolaterE r r r� 4 s z>InterpolationEngine.interpolate.<locals>.recursive_interpolate)�_cookiers )rE rz rK r )r� rE r � interpolate/ s
,z InterpolationEngine.interpolatec C s� | j jj}d| j j_| j }x^|j|�}|dk r<t|t� r<P |jdi �j|�}|dk rdt|t� rdP |j|krpP |j}q W || j j_|dkr�t|��||fS )z�Helper function to fetch values from owning section.
Returns a 2-tuple: the value, and the section where it was found.
FN�DEFAULT)rs �mainr- r r[ �Sectionrb r$ )rE rz Z save_interpZcurrent_section�valr r r �_fetchd s"
zInterpolationEngine._fetchc C s
t � �dS )a� Implementation-dependent helper function.
Will be passed a match object corresponding to the interpolation
key we just found (e.g., "%(foo)s" or "$foo"). Should look up that
key in the appropriate config file section (using the ``_fetch()``
helper function) and return a 3-tuple: (key, value, section)
``key`` is the name of the key we're looking for
``value`` is the value found for that key
``section`` is a reference to the section where it was found
``key`` and ``section`` should be None if no further
interpolation should be performed on the resulting value
(e.g., if we interpolated "$$" and returned "$").
N)�NotImplementedError)rE r{ r r r rv � s z InterpolationEngine._parse_matchN) r? r@ rA rm �re�compilert r� rk r� r� rv r r r r rq s
5"rq c @ s& e Zd ZdZdZejd�Zdd� ZdS )�ConfigParserInterpolationzBehaves like ConfigParser.rr z
%\(([^)]*)\)sc C s" |j d�}| j|�\}}|||fS )Nr8 )�groupr� )rE r{ rz rK rs r r r rv � s
z&ConfigParserInterpolation._parse_matchN) r? r@ rA rm r� r� r� rt rv r r r r r� � s
r� c @ s4 e Zd ZdZdZdZejdejej B �Z
dd� Z dS )�TemplateInterpolationz Behaves like string.Template.�$z�
\$(?:
(?P<escaped>\$) | # Two $ signs
(?P<named>[_a-z][_a-z0-9]*) | # $name format
{(?P<braced>[^}]*)} # ${name} format
)
c C s\ |j d�p|j d�}|d k r4| j|�\}}|||fS |j d�d k rNd | jd fS d |j � d fS )NZnamedZbracedZescaped)r� r� �
_delimiter)rE r{ rz rK rs r r r rv � s
z"TemplateInterpolation._parse_matchN) r? r@ rA rm r� r� r� r� �
IGNORECASE�VERBOSErt rv r r r r r� � s r� )r+ �templatec G s | j | f|�� S )N)�__new__)�cls�argsr r r �
__newobj__� s r� c @ s$ e Zd ZdZdd� Zdd� ZdDdd�Zd d
� Zd d � Zd
d� Z dEdd�Z
dd� Z dFdd�Z dd� Z
efdd�Zdd� Zd d � ZdGd d �Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� ZeZd*d+� Zd,d-� ZeZd.e_d/d0� Z d1d2� Z d3d4� Z dHd6d7�Z d8d9� Z d:d;� Z!d<d=� Z"d>d?� Z#d@dA� Z$dBdC� Z%dS )Ir� a�
A dictionary-like object that represents a section in a config file.
It does string interpolation if the 'interpolation' attribute
of the 'main' object is set to True.
Interpolation is tried first from this object, then from the 'DEFAULT'
section of this object, next from the parent and its 'DEFAULT' section,
and so on until the main object is reached.
A Section will behave like an ordered dictionary - following the
order of the ``scalars`` and ``sections`` attributes.
You can use this to change the order of members.
Iteration follows the order: scalars, then sections.
c C s$ t j| |d � | jj|d � d S )Nr r8 )�dict�update�__dict__)rE �stater r r � __setstate__� s zSection.__setstate__c C s t | �| jf}t| jf|fS )N)r� r� r� rD )rE r� r r r �
__reduce__� s zSection.__reduce__Nc C sX |dkr i }t j| � || _|| _|| _|| _| j� x |j� D ]\}}|| |< q@W dS )z�
* parent is the section above
* depth is the depth level of this section
* main is the main ConfigObj
* indict is a dictionary to initialise the section with
N)r� rk rb r� �depthrW � _initialise�items)rE rb r� r� �indictrW �entryrK r r r rk � s
zSection.__init__c C s: g | _ g | _i | _i | _d | _g | _i | _g | _d| _d S )NF) �scalars�sections�comments�inline_commentsr2 �defaults�default_values� extra_values�_created)rE r r r r� s zSection._initialisec C sv y
| j }W n^ tk
rh | jj}|dkr.t}|j� }tj|d �}|d krVd| j_|S || � }| _ Y nX |j||�S )NTF) Z_interpolation_engine�AttributeErrorr� r- r r �interpolation_enginesr r� )rE rz rK ZenginerW Zclass_r r r � _interpolate s
zSection._interpolatec sf t j���}�jjrbt|tj�r,�j�|�S t|t�rb��fdd�� � fdd�|D �}||krb|S |S )z+Fetch the item and do string interpolation.c s t | tj�r�j� | �S | S )N)r[ �six� string_typesr� )r� )rz rE r r �_check/ s z#Section.__getitem__.<locals>._checkc s g | ] }� |��qS r r )�.0r� )r� r r �
<listcomp>3 s z'Section.__getitem__.<locals>.<listcomp>) r� � __getitem__r� r- r[ r� r� r� rH )rE rz r� �newr )r� rz rE r r� ( s
zSection.__getitem__Fc
C sN t |tj�std| ��|| jkr6g | j|< d| j|< || jkrL| jj|� t |t�rz|| krj| j j
|� t j | ||� n�t |t �r�| r�|| kr�| j j
|� | j
d }t j | |t| || j||d�� n�|| kr�| jj
|� | jj�s<t |tj�r�nHt |ttf��r0x6|D ] }t |tj��s
td| ���q
W n td| ��t j | ||� dS )a�
Correctly set a value.
Making dictionary values Section instances.
(We have to special case 'Section' instances - which are also dicts)
Keys must be strings.
Values need only be strings (or lists of strings) if
``main.stringify`` is set.
``unrepr`` must be set when setting a value to a dictionary, without
creating a new sub-section.
z The key "%s" is not a string.rg r8 )r� rW zValue is not a string "%s".N)r[ r� r� �
ValueErrorr� r� r� �remover� r� �appendr� � __setitem__r� r� r� r3 rH rR rZ )rE rz rK r6 Z new_depthr� r r r r� 9 sF
zSection.__setitem__c C sD t j| |� || jkr$| jj|� n | jj|� | j|= | j|= dS )z-Remove items from the sequence when deleting.N)r� � __delitem__r� r� r� r� r� )rE rz r r r r� t s
zSection.__delitem__c C s" y| | S t k
r |S X dS )z>A version of ``get`` that doesn't bypass string interpolation.N)�KeyError)rE rz �defaultr r r r s z Section.getc C s x|D ]}|| | |< qW dS )zD
A version of update that uses our ``__setitem__``.
Nr )rE r� r� r r r r� � s
zSection.updatec C s: y | | }W n" t k
r. |tkr&� |}Y nX | |= |S )z�
'D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised'
)r� �MISSING)rE rz r� r� r r r �pop� s
z Section.popc C s6 | j | j }|std��|d }| | }| |= ||fS )zPops the first (key,val)z": 'popitem(): dictionary is empty'r )r� r� r� )rE Zsequencerz r� r r r �popitem� s zSection.popitemc C s8 t j| � g | _g | _i | _i | _d| _g | _g | _dS )z�
A version of clear that also affects scalars/sections
Also clears comments and configspec.
Leaves other attributes alone :
depth/main/parent are not affected
N) r� �clearr� r� r� r� r2 r� r� )rE r r r r� � s
z
Section.clearc C s. y| | S t k
r( || |< | | S X dS )z:A version of setdefault that sets sequence if appropriate.N)r� )rE rz r� r r r �
setdefault� s
zSection.setdefaultc C s t t| j| j t | j� ���S )z8D.items() -> list of D's (key, value) pairs, as 2-tuples)rH �zipr� r� �values)rE r r r r� � s z
Section.itemsc C s | j | j S )z D.keys() -> list of D's keys)r� r� )rE r r r �keys� s z Section.keysc s � fdd�� j � j D �S )z D.values() -> list of D's valuesc s g | ] }� | �qS r r )r� rz )rE r r r� � s z"Section.values.<locals>.<listcomp>)r� r� )rE r )rE r r� � s zSection.valuesc C s t t| j� ��S )z=D.iteritems() -> an iterator over the (key, value) items of D)rM rH r� )rE r r r � iteritems� s zSection.iteritemsc C s t | j| j �S )z.D.iterkeys() -> an iterator over the keys of D)rM r� r� )rE r r r �iterkeys� s zSection.iterkeysc C s t t| j� ��S )z2D.itervalues() -> an iterator over the values of D)rM rH r� )rE r r r �
itervalues� s zSection.itervaluesc s0 �fdd�� ddj � fdd��j�j D �� S )zx.__repr__() <==> repr(x)c s* y� | S t k
r$ tj� | �S X d S )N)r$ r� r� )rz )rE r r �_getval� s z!Section.__repr__.<locals>._getvalz{%s}z, c s$ g | ] }d t |�t � |��f �qS )z%s: %s)�repr)r� rz )r� r r r� � s z$Section.__repr__.<locals>.<listcomp>)rx r� r� )rE r )r� rE r �__repr__� s zSection.__repr__zx.__str__() <==> str(x)c C s` i }xV| D ]N}| | }t |t�r*|j� }n&t |t�r>t|�}nt |t�rPt|�}|||< q
W |S )a0
Return a deepcopy of self as a dictionary.
All members that are ``Section`` instances are recursively turned to
ordinary dictionaries - by calling their ``dict`` method.
>>> n = a.dict()
>>> n == a
1
>>> n is a
0
)r[ r� r� rH rR )rE Znewdictr� �
this_entryr r r r� � s
z Section.dictc C sV xPt |j� �D ]@\}}|| krFt| | t�rFt|t�rF| | j|� q|| |< qW dS )aQ
A recursive update - useful for merging config files.
>>> a = '''[section1]
... option1 = True
... [[subsection]]
... more_options = False
... # end of file'''.splitlines()
>>> b = '''# File is user.ini
... [section1]
... option1 = False
... # end of file'''.splitlines()
>>> c1 = ConfigObj(b)
>>> c2 = ConfigObj(a)
>>> c2.merge(c1)
>>> c2
ConfigObj({'section1': {'option1': 'False', 'subsection': {'more_options': 'False'}}})
N)rH r� r[ r� �merge)rE r� rz r� r r r r� s
z
Section.mergec C s� || j kr| j }n || jkr$| j}n td| ��|j|�}| | }tj| |� tj| ||� |j|� |j||� | j | }| j
| }| j |= | j
|= || j |< || j
|< dS )a
Change a keyname to another, without changing position in sequence.
Implemented so that transformations can be made on keys,
as well as on values. (used by encode and decode)
Also renames comments.
zKey "%s" not found.N) r� r� r� �indexr� r� r� r� �insertr� r� )rE ZoldkeyZnewkey�the_list�posr� ZcommZinline_commentr r r �rename, s"
zSection.renameTc K s i }xtt t| j��D ]b}| j| }y$|| |f|�}| j| }|||< W q tk
rt |r^� n| j| }d||< Y qX qW x�t t| j��D ]~}| j| }|r�y|| |f|� W n. tk
r� |rƂ n| j| }d||< Y nX | j| }| | j|f||d�|��||< q�W |S )a�
Walk every member and call a function on the keyword and value.
Return a dictionary of the return values
If the function raises an exception, raise the errror
unless ``raise_errors=False``, in which case set the return value to
``False``.
Any unrecognised keyword arguments you pass to walk, will be pased on
to the function you pass in.
Note: if ``call_on_sections`` is ``True`` then - on encountering a
subsection, *first* the function is called for the *whole* subsection,
and then recurses into it's members. This means your function must be
able to handle strings, dictionaries and lists. This allows you
to change the key of subsections as well as for ordinary members. The
return value when called on the whole subsection has to be discarded.
See the encode and decode methods for examples, including functions.
.. admonition:: caution
You can use ``walk`` to transform the names of members of a section
but you mustn't add or delete members.
>>> config = '''[XXXXsection]
... XXXXkey = XXXXvalue'''.splitlines()
>>> cfg = ConfigObj(config)
>>> cfg
ConfigObj({'XXXXsection': {'XXXXkey': 'XXXXvalue'}})
>>> def transform(section, key):
... val = section[key]
... newkey = key.replace('XXXX', 'CLIENT1')
... section.rename(key, newkey)
... if isinstance(val, (tuple, list, dict)):
... pass
... else:
... val = val.replace('XXXX', 'CLIENT1')
... section[newkey] = val
>>> cfg.walk(transform, call_on_sections=True)
{'CLIENT1section': {'CLIENT1key': None}}
>>> cfg
ConfigObj({'CLIENT1section': {'CLIENT1key': 'CLIENT1value'}})
F)r. �call_on_sections)�rangery r� � Exceptionr� �walk) rE Zfunctionr. r� Zkeywargs�outrP r� r� r r r r� J s: /
z Section.walkc C sn | | }|dkrdS |dkr dS y(t |tj�s6t� �n| jj|j� S W n tk
rh td| ��Y nX dS )a_
Accepts a key as input. The corresponding value must be a string or
the objects (``True`` or 1) or (``False`` or 0). We allow 0 and 1 to
retain compatibility with Python 2.2.
If the string is one of ``True``, ``On``, ``Yes``, or ``1`` it returns
``True``.
If the string is one of ``False``, ``Off``, ``No``, or ``0`` it returns
``False``.
``as_bool`` is not case sensitive.
Any other input will raise a ``ValueError``.
>>> a = ConfigObj()
>>> a['a'] = 'fish'
>>> a.as_bool('a')
Traceback (most recent call last):
ValueError: Value "fish" is neither True nor False
>>> a['b'] = 'True'
>>> a.as_bool('b')
1
>>> a['b'] = 'off'
>>> a.as_bool('b')
0
TFz$Value "%s" is neither True nor FalseN)r[ r� r� r� r� �_boolsr r� )rE rz r� r r r �as_bool� s zSection.as_boolc C s t | | �S )ai
A convenience method which coerces the specified value to an integer.
If the value is an invalid literal for ``int``, a ``ValueError`` will
be raised.
>>> a = ConfigObj()
>>> a['a'] = 'fish'
>>> a.as_int('a')
Traceback (most recent call last):
ValueError: invalid literal for int() with base 10: 'fish'
>>> a['b'] = '1'
>>> a.as_int('b')
1
>>> a['b'] = '3.2'
>>> a.as_int('b')
Traceback (most recent call last):
ValueError: invalid literal for int() with base 10: '3.2'
)�int)rE rz r r r �as_int� s zSection.as_intc C s t | | �S )a>
A convenience method which coerces the specified value to a float.
If the value is an invalid literal for ``float``, a ``ValueError`` will
be raised.
>>> a = ConfigObj()
>>> a['a'] = 'fish'
>>> a.as_float('a') #doctest: +IGNORE_EXCEPTION_DETAIL
Traceback (most recent call last):
ValueError: invalid literal for float(): fish
>>> a['b'] = '1'
>>> a.as_float('b')
1.0
>>> a['b'] = '3.2'
>>> a.as_float('b') #doctest: +ELLIPSIS
3.2...
)rY )rE rz r r r �as_float� s zSection.as_floatc C s$ | | }t |ttf�r t|�S |gS )aU
A convenience method which fetches the specified value, guaranteeing
that it is a list.
>>> a = ConfigObj()
>>> a['a'] = 1
>>> a.as_list('a')
[1]
>>> a['a'] = (1,)
>>> a.as_list('a')
[1]
>>> a['a'] = [1]
>>> a.as_list('a')
[1]
)r[ rR rH )rE rz �resultr r r �as_list� s zSection.as_listc C s2 | j | }tj| ||� || jkr.| jj|� |S )a
Restore (and return) default value for the specified key.
This method will only work for a ConfigObj that was created
with a configspec and has been validated.
If there is no default value for this key, ``KeyError`` is raised.
)r� r� r� r� r� )rE rz r� r r r �restore_default s
zSection.restore_defaultc C s: x| j D ]}| j|� qW x| jD ]}| | j� q"W dS )a'
Recursively restore default values to all members
that have them.
This method will only work for a ConfigObj that was created
with a configspec and has been validated.
It doesn't delete or modify entries without default values.
N)r� r� r� �restore_defaults)rE rz rs r r r r� s
zSection.restore_defaults)NN)F)N)N)TF)&r? r@ rA rm r� r� rk r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� �__iter__r� r� �__str__r� r� r� r� r� r� r� r� r� r� r r r r r� � sH
;
T,r� c @ s� e Zd ZdZejdej�Zejdej�Zejdej�Z ejdej�Z
ejdej�Z ejd�Z ejd�Z
ejd �Zejd
�Ze efe
efd �Zd d
d d
d d
d d
d�ZdFdd�Zdd� ZdGdd�Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Z d&d'� Z d(d)� Z dHd*d+�Z d,d-� Z d.d/� Z!d0d1� Z"d2d3� Z#d4d5� Z$d6d7� Z%d8d9� Z&d:d;� Z'd<d=� Z(dId>d?�Z)dJd@dA�Z*dBdC� Z+dDdE� Z,dS )Kr z2An object to read, create, and write config files.a� ^ # line start
(\s*) # indentation
( # keyword
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'"=].*?) # no quotes
)
\s*=\s* # divider
(.*) # value (including list values and comments)
$ # line end
a= ^
(\s*) # 1: indentation
((?:\[\s*)+) # 2: section marker open
( # 3: section name open
(?:"\s*\S.*?\s*")| # at least one non-space with double quotes
(?:'\s*\S.*?\s*')| # at least one non-space with single quotes
(?:[^'"\s].*?) # at least one non-space unquoted
) # section name close
((?:\s*\])+) # 4: section marker close
\s*(\#.*)? # 5: optional comment
$a� ^
(?:
(?:
(
(?:
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\#][^,\#]*?) # unquoted
)
\s*,\s* # comma
)* # match all list items ending in a comma (if any)
)
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\#\s][^,]*?)| # unquoted
(?:(?<!,)) # Empty value
)? # last item in a list - or string value
)|
(,) # alternatively a single comma - empty list
)
\s*(\#.*)? # optional comment
$z�
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\#]?.*?) # unquoted
)
\s*,\s* # comma
a ^
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'"\#].*?)| # unquoted
(?:) # Empty value
)
\s*(\#.*)? # optional comment
$z^'''(.*?)'''\s*(#.*)?$z^"""(.*?)"""\s*(#.*)?$z^(.*?)'''\s*(#.*)?$z^(.*?)"""\s*(#.*)?$)z'''z"""TF)�yes�noZonZoff�1�0�trueZfalseNc
C s� || _ tj| | d| � |p g }||||||| |
| | |
|d� }|dkrJ|}n|ddl}|jdtdd� x |D ]}|tkrhtd| ��qhW x@ttj � �D ]0\}}||kr�|||< || }||kr�|||< q�W |r�d|d < | j
|� |d
}|| _ | j ||� dS ) a�
Parse a config file or create a config file object.
``ConfigObj(infile=None, configspec=None, encoding=None,
interpolation=True, raise_errors=False, list_values=True,
create_empty=False, file_error=False, stringify=True,
indent_type=None, default_encoding=None, unrepr=False,
write_empty_values=False, _inspec=False)``
r ) r2 r r- r. r/ r0 r1 r3 r4 r5 r6 r7 NzUPassing in an options dictionary to ConfigObj() is deprecated. Use **options instead.� )�
stacklevelzUnrecognised option "%s".Fr/ r2 )
�_inspecr� rk �warnings�warn�DeprecationWarning�OPTION_DEFAULTSrZ rH r� r� �_original_configspec�_load)rE �infile�optionsr2 r r- r. r/ r0 r1 r3 r4 r5 r6 r7 r� Z_optionsr� r� rK Z
keyword_valuer r r rk � s<
zConfigObj.__init__c sB t |tj�r�|| _tjj|�rBt|d��}|j� p4g }W d Q R X n@| j rXt
d| j ��n*| j r~t|d��}|j d� W d Q R X g }n�t |t
tf�r�t
|�}n�t |t��rt |t�rʇ fdd�� � || � nx|D ]}|| | |< q�W | `|d k r�| j|� nd | _d S t|dt�tk �r(|j� �p$g }ntd��|�r�| j|�}xN|D ]F}| �sF|d dk�rd�qFx"dD ]}|j|��rj|| _P �qjW P �qFW td
d� |D ���s�t t |���dd� |D �}| j |� | j�r d| jd j }t | j�d k�rd| } t!| �}
n
| jd }
| j|
_"| |
_#|
�| `|d k�r4d | _n
| j|� d S )N�rbz Config file not found: "%s".�wrg c sJ x| j D ]}| | ||< qW x(| jD ] }i ||< � | | || � q$W d S )N)r� r� )Z
in_section� this_sectionr� rs )� set_sectionr r r� � s
z$ConfigObj._load.<locals>.set_section�readz>infile must be a filename, file like object, or list of lines.r8 �
�
�
c s s | ]}t |tj�V qd S )N)r[ r� r� )r� rh r r r � <genexpr> s z"ConfigObj._load.<locals>.<genexpr>c S s g | ]}|j d ��qS )z
)�rstrip)r� rh r r r r� s z#ConfigObj._load.<locals>.<listcomp>z at line %s.r z2Parsing failed with several errors.
First error %s���)r� r� )r� r� r� )$r[ r� r� �filename�os�path�isfile�open� readlinesr1 rn r0 �writerH rR r� r �_errors�_handle_configspecr2 ra r� r� rZ � _handle_bom�endswith�newlines�all�AssertionErrorr� �_parseri ry r �errors�config) rE r� r2 �hZcontentr� rh r �inforp �errorr )r� r r� � sj
zConfigObj._loadc C s� |d kr t }d | _g | _|d | _|d | _|d | _|d | _|d | _|d | _|d | _ |d | _
|d | _ d
| _ d | _
|d | _|d | _g | _g | _d | _| jr�d
| _tj| � d S )
Nr. r- r/ r0 r1 r3 r4 r r5 Fr7 r6 )r� r� r r. r- r/ r0 r1 r3 r4 r r5 �BOMr r7 r6 �initial_comment�
final_commentr2 r� r� r� )rE r� r r r r� 0 s.
zConfigObj._initialisec s0 �fdd�� ddj � fdd��j�j D �� S )Nc s* y� | S t k
r$ tj� | �S X d S )N)r$ r� r� )rz )rE r r r� Q s z#ConfigObj.__repr__.<locals>._getvalzConfigObj({%s})z, c s$ g | ] }d t |�t � |��f �qS )z%s: %s)r� )r� rz )r� r r r� W s z&ConfigObj.__repr__.<locals>.<listcomp>)rx r� r� )rE r )r� rE r r� P s zConfigObj.__repr__c C sH | j dk r&| j j� tkr&| j|| j �S t|ttf�r>|d }n|}t|tj�r\| j|| j �S | j dk �r(t| j j� }|dkr�x8tt j
� �D ](\}\}}|s�q�|j |�r�| j||�S q�W | j|| j �S t | }|j |�s�| j|| j �S |t
|�d� }t|ttf��r||d< n|}d| _| j|| j �S x�tt j
� �D ]�\}\}}t|tj� �s6|j |� �rf�q6n�|| _ |�s�d| _|t
|�d� }t|ttf��r�||d< n|}t|tj��r�|jd�S t|tj��r�|jd�jd�S | j|d�S | j||�S �q6W tj�rt|t��r| j|d�S t|tj��r8|jd�jd�S | j|d�S dS )a1
Handle any BOM, and decode if necessary.
If an encoding is specified, that *must* be used - but the BOM should
still be removed (and the BOM attribute set).
(If the encoding is wrongly specified, then a BOM for an alternative
encoding won't be discovered or removed.)
If an encoding is not specified, UTF8 or UTF16 BOM will be detected and
removed. The BOM attribute will be set. UTF16 will be decoded to
unicode.
NOTE: This method must not be called with an empty ``infile``.
Specifying the *wrong* encoding is likely to cause a
``UnicodeDecodeError``.
``infile`` must always be returned as a list of lines, but may be
passed in as a single string.
Nr r Tzutf-8)r r r �_decoder[ rH rR r� Z text_type�BOMSr� �
startswith�BOM_SETry r � binary_type�
splitlines�decodeZPY2�str)rE r� rh �encr r Zfinal_encoding�newliner r r r [ s^
zConfigObj._handle_bomc C s& t |tj�r | jr |j| j�S |S dS )z@Decode ASCII strings to unicode if a self.encoding is specified.N)r[ r� r r r )rE ZaStringr r r �_a_to_u� s zConfigObj._a_to_uc C sx t |tj�r|jd�S t |tj�r@|r6|j|�jd�S |jd�S |rtx.t|�D ]"\}}t |tj�rN|j|�||< qNW |S )z�
Decode infile to unicode. Using the specified encoding.
if is a string, it also needs converting to a list.
T)r[ r� r� r r r � enumerate)rE r� r rP rh r r r r � s
zConfigObj._decodec C s& t |tj�r | jr |j| j�S |S dS )z'Decode element to unicode if necessary.N)r[ r� r r5 r )rE rh r r r �_decode_element� s zConfigObj._decode_elementc C s t |tj�st|�S |S dS )zh
Used by ``stringify`` within validate, to turn non-string values
into strings.
N)r[ r� r� r )rE rK r r r �_str� s zConfigObj._strc C s" | j }| jrd| _ g }d}| }t|�d }d}d}�x�||k �r�|rHg }|d7 }|| } | j� }
|
sp|
jd�r�d}|j| � q6|s�|| _g }d}d}| jj| �} | dk �r�| j � \} }
}}}| r�| j
dkr�| | _
|
j d�}||j d�k� r�| j dt
||� q6||jk �rHy| j||�j}W n( tk
�rD | j d t
||� w6Y nX n<||jk�r\|j}n(||jd k�rr|}n| j d
t
||� q6| j|�}||k�r�| j d t||� q6t||| |d �}|||< ||j|< ||j|< q6| jj| �} | dk�r| j d
j| �t||� q6| j � \} }}| �r,| j
dk�r,| | _
|dd� dk�r�y| j||||�\}}}W n( tk
�r� | j dt||� w6Y njX | j�r�d}y t|�}W nN tk
�r� } z0t |�t k�r�d}nd}| j |t ||� w6W Y dd}~X nX n�| j�rTd}y t|�}W nL tk
�rP } z.t |t ��r*d}nd}| j |t ||� w6W Y dd}~X nX n<y| j |�\}}W n( tk
�r� | j dt||� w6Y nX | j|�}||k�r�| j dt||� q6|j!||dd� ||j|< ||j|< q6q6W | j
dk�r�d| _
| �r | j �r || _n |�s|| _"|| _ dS )z Actually parse the config file.Fr8 �#TN�[�]z Cannot compute the section depthz Cannot compute nesting levelzSection too nestedzDuplicate section name)rW z=Invalid line ({0!r}) (matched as neither section nor keyword)� �"""�'''z Parse error in multiline valuerg z Unknown name or type in valuez+Parse error from unrepr-ing multiline valuez!Parse error from unrepr-ing valuezParse error in valuezDuplicate keyword name)r6 r� )r$ r% )#r/ r6 ry �stripr r� r �_sectionmarkerr{ �groupsr4 �count�
_handle_errorr r� � _match_depthrb rj �_unquoter r� r� r� �_keyword�formatr �
_multiliner� �typer( r' r[ �
_handle_valuer� r )rE r� Ztemp_list_valuesZ comment_listZ
done_startr� �maxline� cur_indexZ
reset_commentrh Zsline�mat�indentZ sect_openZ sect_nameZ
sect_close�commentZ cur_depthrb rz rK �erp r r r r s�
zConfigObj._parsec C s> x$||j k r$||jkr t� �|j}qW |j |kr4|S t� �dS )z�
Given a section and a depth level, walk back through the sections
parents to see if the depth level matches a previous section.
Return a reference to the right section,
or raise a SyntaxError.
N)r� rb rj )rE Zsectr� r r r r+ � s
zConfigObj._match_depthc C sB || }|d7 }dj ||�}||||�}| jr2|�| jj|� dS )z�
Handle an error according to the error settings.
Either raise the error or store it.
The error will have occured at ``cur_index``
r8 z{0} at line {1}.N)r. r. r r� )rE �textZ
ErrorClassr� r3 rh rl r r r r r* � s zConfigObj._handle_errorc C s4 |st �|d |d kr0|d dkr0|dd� }|S )z%Return an unquoted version of a valuer r8 �"�'r� )r9 r: r� )rj )rE rK r r r r, � s
zConfigObj._unquotec s� |r� j r|dkrdS |rjt|ttf�rj|s0dS t|�dkrR� j|d dd�d S dj� fdd �|D ��S t|tj�s�� j r�t
|�}n t d
| ��|s�d S � j o�d |ko�d
|k}|o�d|kr�d|kp�d |k}|o�| o�d|ko�d|ko�d
|k}|� s�| �o| }|�rh� j �st
}nNd |k�r0td| ��n6|d tk�r\|d tk�r\d|k�r\t
}n
� j|�}n
� j|�}|t
k�r�d
|k�r�� j �r�� j|�}|| S )a�
Return a safely quoted version of a value.
Raise a ConfigObjError if the value cannot be safely quoted.
If multiline is ``True`` (default) then use triple quotes
if necessary.
* Don't quote values that don't need it.
* Recursively quote members of a list and return a comma joined list.
* Multiline is ``False`` for lists.
* Obey list syntax for empty and single member lists.
If ``list_values=False`` then the value is only quoted if it contains
a ``\n`` (is multiline) or '#'.
If ``write_empty_values`` is set, and the value is an empty string, it
won't be quoted.
rg �,r8 r F)� multilinez, c s g | ]}� j |d d��qS )F)r< )�_quote)r� r� )rE r r r� � s z$ConfigObj._quote.<locals>.<listcomp>zValue "%s" is not a string.z""r� r r: r9 z#Value "%s" cannot be safely quoted.r� )r7 r[ rH rR ry r= rx r� r� r3 r rZ r/ �noquotr � wspace_plus�_get_single_quote�_get_triple_quote)rE rK r< Zno_lists_no_quotesZ need_tripleZhash_triple_quoteZcheck_for_single�quotr )rE r r= � sB
"
zConfigObj._quotec C s4 d|kr d|kr t d| ��nd|kr,t}nt}|S )Nr: r9 z#Value "%s" cannot be safely quoted.)r �squot�dquot)rE rK rB r r r r@ % s zConfigObj._get_single_quotec C sD |j d�dkr(|j d�dkr(td| ��|j d�dkr<t}nt}|S )Nz"""r8 z'''z#Value "%s" cannot be safely quoted.r� r� r� )�findr �tdquot�tsquot)rE rK rB r r r rA / s zConfigObj._get_triple_quotec s� � j r|dfS � js6� jj|�}|dkr.t� �|j� S � jj|�}|dkrPt� �|j� \}}}}|dkrv|dkrvt� �|dk r�g |fS |dk r�|r�| r�d}n|p�d}� j|�}|dkr�||fS � jj |�}� fdd�|D �}|dk r�||g7 }||fS )z�
Given a value string, unquote, remove comment,
handle lists. (including empty and single member lists)
rg Nz""c s g | ]}� j |��qS r )r, )r� r� )rE r r r� d s z+ConfigObj._handle_value.<locals>.<listcomp>)
r� r/ � _nolistvaluer{ rj r( � _valueexpr, �
_listvalueexp�findall)rE rK r4 r/ ZsingleZ
empty_listr6 r� r )rE r r1 9 s6
zConfigObj._handle_valuec
C s� |dd� }|dd� }| j | d }| j | d }|j|�} | dk r`t| j� �}
|
j|� |
S |j|�dkrtt� �xD||k r�|d7 }|d7 }|| } | j|�dkr�|| 7 }qvP qvW t� �|j| �} | dkr�t� �| j� \}} || | |fS )z9Extract the value, where we are in a multiline situation.Nr# r r8 r� r� r� )�
_triple_quoter{ rH r( r� rE rj )
rE rK r� r3 r2 rB ZnewvalueZ single_lineZ
multi_liner4 Zretvalrh r6 r r r r/ j s0
zConfigObj._multilinec C s� t |t�szyt|dddd�}W nZ tk
rL } ztd| ��W Y dd}~X n. tk
rx } ztd| ��W Y dd}~X nX || _dS )zParse the configspec.T)r. r1 r� z Parsing configspec failed: %sNz Reading configspec failed: %s)r[ r r r rn r2 )rE r2 r7 r r r r � s
z ConfigObj._handle_configspecc C s� |j }|jd�}t|t�r<x |jD ]}||kr"||| _ q"W xz|jD ]p}|dkrRqD||kr�i ||< d|| _|r�|jj|g �|j|< |jj|d�|j|< t|| t�rD|| || _ qDW dS )z�
Called by validate. Handles setting the configspec on subsections
including sections to be validated by __many__
�__many__Trg N) r2 r r[ r� r� r� r� r� r� )rE rs �copyr2 �manyr� r r r �_set_configspec� s"
zConfigObj._set_configspecc C sN | j s| j| j|��}nt|�}d|| j| j|dd��| jd�|| j|�f S )z.Write an individual line, for the write methodz
%s%s%s%s%sF)r< z = )r6 r r= r� r )rE �
indent_stringr� r� r6 r� r r r � _write_line� s zConfigObj._write_linec C s< d|| j d| �| j| j|�dd�| j d| �| j|�f S )zWrite a section marker linez
%s%s%s%s%sr! F)r< r" )r r= r )rE rQ r� r� r6 r r r �
_write_marker� s
zConfigObj._write_markerc C s. |sdS | j }|jd�s&|| jd�7 }|| S )zDeal with a comment.rg r z # )r4 r r )rE r6 r~ r r r �_handle_comment� s
zConfigObj._handle_commentc sB � j dkrt� _ g }� jd�}� jd�}|dkr�� j}d� _� }xB� jD ]8}� j|�}|j� }|rv|j|� rv|| }|j|� qHW � j |j } x�|j
|j D ]�}
|
|j kr�q�xF|j
|
D ]8} � j| j� �} | r�| j|� r�|| } |j| | � q�W ||
} � j|j|
�}
t| t��rF|j� j| | j |
|
�� |j� j| d�� q�|j� j| |
| |
�� q�W |� k�r�xH� jD ]>}� j|�}|j� }|�r�|j|� �r�|| }|j|� �qrW |� _|� k �r�|S � jdk�rF|dk�rF� j�r�� fdd�|D �}� j�rB� jdk�s"tj � jj � �dk�rB|�s2|jd � t |d
|d
< |S � j �pRt j!}t"|d d�dk �r�|j#d k�r�t$j%d
k�r�|dk�r�d}� j|�j&|�}|j'|��s�||7 }t|t(j)��r�|}n|j*� j�pڈ j+�p�d�}� j�r� jdk�s�t,� j��rt | }|dk �r |j|� n"t-� jd��}|j|� W dQ R X dS )a~
Write the current ConfigObj as a file
tekNico: FIXME: use StringIO instead of real files
>>> filename = a.filename
>>> a.filename = 'test.ini'
>>> a.write()
>>> a.filename = filename
>>> a == ConfigObj('test.ini', raise_errors=True)
1
>>> import os
>>> os.remove('test.ini')
Nr z# F)rs c s g | ]}|j � j��qS r )�encoder )r� �l)rE r r r� / s z#ConfigObj.write.<locals>.<listcomp>r rg r �moder� Zwin32z
r� �ascii�wb).r4 r r r- r r r& r r� r� r� r� r� r� �lstriprT r� r[ r� rS �extendr rR r r� r r r r r r r r� �linesepra rW �sys�platformrx r r� r rU r5 r r� )rE Zoutfilers r� ZcsZcspZint_valrh Z
stripped_linerQ r� Z comment_liner� r6 r �outputZ output_bytesr r )rE r r � s�
zConfigObj.writec st �dkrt�j dkrtd���r0ddlm} |�_���rt�j j�_�j j�_�j j�_�j j�_�j j �_ �j j
�_
�j � �j ��� � ������fdd�}i �d}d}� fdd ��j D �} �fd
d �� j
D �}
�fd d �� j D �} x�� j D ]�} | dk� r�q�| �j k�s| �jk�rZd}
d}��rf| �j k�rf� jj| g ��j| < � jj| d��j| < n d}
�| }|| � | ||
||�\}}q�W d}d � j k�r�� d }nd
� j k�r�� d
}|dk �r�x,| D ]$} �| }|| ||d||�\}}�q�W g } x<| D ]4} d}��s d�| < nd}d| }�j|��| < �q�W x<|
D ]4} d}��sJd�| < nd}d| }�j|��| < �q2W x��j
D ]�} ��k�r�| dk�r��qr�| j dk�r�| j| � �qr��rڈ jj| g ��j| < � jj| d��j| < �j����| d�}|�| < |dk�rd}n|dk�rd}nd}�qrW | �_��r<�j �r<d}|�r\��r\��r\t�j� � }|�rfdS |�rpdS �S )a;
Test the ConfigObj against a configspec.
It uses the ``validator`` object from *validate.py*.
To run ``validate`` on the current ConfigObj, call: ::
test = config.validate(validator)
(Normally having previously passed in the configspec when the ConfigObj
was created - you can dynamically assign a dictionary of checks to the
``configspec`` attribute of a section though).
It returns ``True`` if everything passes, or a dictionary of
pass/fails (True/False). If every member of a subsection passes, it
will just have the value ``True``. (It also returns ``False`` if all
members fail).
In addition, it converts the values from strings to their native
types if their checks pass (and ``stringify`` is set).
If ``preserve_errors`` is ``True`` (``False`` is default) then instead
of a marking a fail with a ``False``, it will preserve the actual
exception object. This can contain info about the reason for failure.
For example the ``VdtValueTooSmallError`` indicates that the value
supplied was too small. If a value (or section) is missing it will
still be marked as ``False``.
You must have the validate module to use ``preserve_errors=True``.
You can then use the ``flatten_errors`` function to turn your nested
results dictionary into a flattened list of failures - useful for
displaying meaningful error messages.
NzNo configspec supplied.r )�VdtMissingValuec sP �j j| d � y�j� | ��j | < W n tt�jfk
rB Y nX y�j|||d�}W nP �jk
r� } z2� s~t|�j�r�d�| < n |�| < d}d}W Y d d }~X n�X d}d�| < �j s�|�r"�j �s
t|t
t f�r�fdd�|D �}n |o�|d k�r d}n
�j |�}||k�s|�r"|�| < � �rH|�rH| �j
k�rH�j
j| � ||fS )N)�missingFTc s g | ]}� j |��qS r )r )r� �item)rE r r r� � s z>ConfigObj.validate.<locals>.validate_entry.<locals>.<listcomp>rg )r� r� Zget_default_valuer� r� �baseErrorClass�checkr[ �_vdtMissingValuer3 rH rR r r� r� )r� �specr� ra �ret_true� ret_falserd r7 )r2 rN r� �preserve_errorsrs rE � validatorr r �validate_entry� s:
z*ConfigObj.validate.<locals>.validate_entryTc s g | ]}|� kr|�qS r r )r� r| )r2 r r r� � s z&ConfigObj.validate.<locals>.<listcomp>c s g | ]}|� j kr|�qS r )r� )r� r| )rs r r r� � s c s g | ]}|� j kr|�qS r )r� )r� r| )rs r r r� � s rM �
___many___rg Fz"Value %r was provided as a sectionz)Section %r was provided as a single valuer� )ri rN rs )rM rl )r2 r� �validater` re r r r r r r4 rP r� r� r� r� r r� rc r� r� r� �anyr� )rE rj ri rN rs r` rk rg rh Z unvalidatedZincorrect_sectionsZincorrect_scalarsr� ra r� rO rp rd r )r2 rN r� ri rs rE rj r rm S s� $
-
zConfigObj.validatec C s | j � | j� d| _d| _dS )z@Clear ConfigObj instance and restore to 'freshly created' state.N)r� r� r2 r� )rE r r r �reset" s zConfigObj.resetc C st t | jtj�st� �| j}i }x$tD ] }|dkr2q$t| |�||< q$W | j}||d< | j� | j |� | j
||� dS )z�
Reload a ConfigObj from file.
This method raises a ``ReloadError`` if the ConfigObj doesn't have
a filename attribute pointing to a file.
r2 N) r[ r� r� r� r& r� ra r� r� r� r� )rE r� Zcurrent_optionsr� r2 r r r �reload- s
zConfigObj.reload)NNNNTFTFFTNNFFF)N)T)NN)FFN)-r? r@ rA rm r� r� r� r- r' rI rJ rH Z_single_line_singleZ_single_line_doubleZ_multi_line_singleZ_multi_line_doublerL r� rk r� r� r� r r r r r r r+ r* r, r= r@ rA r1 r/ r rP rR rS rT r rm ro rp r r r r r / sx
6`
u
(
G
1#
r
O c @ s" e Zd ZdZdd� Zddd�ZdS ) r! a�
A simple validator.
Can be used to check that all members expected are present.
To use it, provide a configspec with all your members in (the value given
will be ignored). Pass an instance of ``SimpleVal`` to the ``validate``
method of your ``ConfigObj``. ``validate`` will return ``True`` if all
members are present, or a dictionary with True/False meaning
present/missing. (Whole missing sections will be replaced with ``False``)
c C s
t | _d S )N)r rc )rE r r r rk S s zSimpleVal.__init__Fc C s |r | j � �|S )z9A dummy check method, always returns the value unchanged.)rc )rE rd �memberra r r r rd V s zSimpleVal.checkN)F)r? r@ rA rm rk rd r r r r r! G s
c C s� |dkrg }g }|dkr t |�S |dks2t|t�r^|j|dd� d|f� |rV|j� t |�S xht|j� �D ]X\}}|dkr~qlt| j|�t�r�|j|� t | | |||� ql|j|dd� ||f� qlW |r�|j� t |�S )a�
An example function that will turn a nested dictionary of results
(as returned by ``ConfigObj.validate``) into a flat list.
``cfg`` is the ConfigObj instance being checked, ``res`` is the results
dictionary returned by ``validate``.
(This is a recursive function, so you shouldn't use the ``levels`` or
``results`` arguments - they are used by the function.)
Returns a list of keys that failed. Each member of the list is a tuple::
([list of sections...], key, result)
If ``validate`` was called with ``preserve_errors=False`` (the default)
then ``result`` will always be ``False``.
*list of sections* is a flattened list of sections that the key was found
in.
If the section was missing (or a section was expected and a scalar provided
- or vice-versa) then key will be ``None``.
If the value (or section) was missing then ``result`` will be ``False``.
If ``validate`` was called with ``preserve_errors=True`` and a value
was present, but failed the check, then ``result`` will be the exception
object returned. You can use this as a string that describes the failure.
For example *The value "3" is of the wrong type*.
NTF)
�sortedr[ r� r� r� rH r� r r� r) )Zcfg�resZlevels�resultsrz r� r r r r) ] s*
c sV g }|j � fdd�| jD �� x2| jD ](}|| jkr&|j t| | � |f �� q&W |S )a�
Find all the values and sections not in the configspec from a validated
ConfigObj.
``get_extra_values`` returns a list of tuples where each tuple represents
either an extra section, or an extra value.
The tuples contain two values, a tuple representing the section the value
is in and the name of the extra values. For extra values in the top level
section the first member will be an empty tuple. For values in the 'foo'
section the first member will be ``('foo',)``. For members in the 'bar'
subsection of the 'foo' section the first member will be ``('foo', 'bar')``.
NOTE: If you call ``get_extra_values`` on a ConfigObj instance that hasn't
been validated it will return an empty list.
c s g | ] }� |f�qS r r )r� rW )�_prependr r r� � s z$get_extra_values.<locals>.<listcomp>)r[ r� r� r* )Zconfru r� rW r )ru r r* � s
)r N)r r )r
r )r r )r r r r r r r r r! r" r# r$ r% r& r' r( r) r* )NN);r� r� r] �codecsr r r r r� Z_versionr r9 r r r r rC rD r> r? rG rF �objectr� �__all__r r ZMAX_INTERPOL_DEPTHr� r> r� r( rB Z_builderr6 rj r r r rn r& r r r" r# r% r$ r' rq r� r� r� r� r� r� r r! r) r* r r r r �<module> s� 7 | i "
< __pycache__/pyparsing.cpython-36.opt-1.pyc 0000644 00000610513 14751155147 0014375 0 ustar 00 3
��s`� � @ s� d Z dZdZdZddlZddlmZ ddlZddl Z ddl
Z
ddl Z ddl Z ddl
Z
ddlZddlZddlZddlmZ yddlmZ W n ek
r� ddlmZ Y nX ydd l
mZ W n> ek
r� ydd lmZ W n ek
r� dZY nX Y nX d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrgiZee j�dds� Z e d dskZ e �r"e j Z e Z!e"Z#e Z$e%e&e'e(e)ee*e+e,e-e.g Z/nbe j0Z e1Z2dtdu� Z$g Z/ddl3Z3xBdvj4� D ]6Z5ye/j6e7e3e5�� W n e8k
�r| �wJY nX �qJW e9dwdx� e2dy�D ��Z:dzd{� Z;G d|d}� d}e<�Z=ej>ej? Z@d~ZAeAd ZBe@eA ZCe"d��ZDd�jEd�dx� ejFD ��ZGG d�d!� d!eH�ZIG d�d#� d#eI�ZJG d�d%� d%eI�ZKG d�d'� d'eK�ZLG d�d*� d*eH�ZMG d�d�� d�e<�ZNG d�d&� d&e<�ZOe
jPjQeO� d�d=� ZRd�dN� ZSd�dK� ZTd�d�� ZUd�d�� ZVd�d�� ZWd�dU� ZX�d/d�d��ZYG d�d(� d(e<�ZZG d�d0� d0eZ�Z[G d�d� de[�Z\G d�d� de[�Z]G d�d� de[�Z^e^Z_e^eZ_`G d�d� de[�ZaG d�d � d e^�ZbG d�d � d ea�ZcG d�dp� dpe[�ZdG d�d3� d3e[�ZeG d�d+� d+e[�ZfG d�d)� d)e[�ZgG d�d
� d
e[�ZhG d�d2� d2e[�ZiG d�d�� d�e[�ZjG d�d� dej�ZkG d�d� dej�ZlG d�d� dej�ZmG d�d.� d.ej�ZnG d�d-� d-ej�ZoG d�d5� d5ej�ZpG d�d4� d4ej�ZqG d�d$� d$eZ�ZrG d�d
� d
er�ZsG d�d � d er�ZtG d�d� der�ZuG d�d� der�ZvG d�d"� d"eZ�ZwG d�d� dew�ZxG d�d � d ew�ZyG d�d�� d�ew�ZzG d�d � d ez�Z{G d�d6� d6ez�Z|G d�d�� d�e<�Z}e}� Z~G d�d � d ew�ZG d�d,� d,ew�Z�G d�d� dew�Z�G d�d�� d�e��Z�G d�d1� d1ew�Z�G d�d� de��Z�G d�d� de��Z�G d�d� de��Z�G d�d/� d/e��Z�G d�d � d e<�Z�d�df� Z��d0d�dD�Z��d1d�d@�Z�d�d΄ Z�d�dS� Z�d�dR� Z�d�d҄ Z��d2d�dW�Z�d�dE� Z��d3d�dk�Z�d�dl� Z�d�dn� Z�e\� j�dG�Z�el� j�dM�Z�em� j�dL�Z�en� j�de�Z�eo� j�dd�Z�eeeDd�d�dڍj�d�d܄ �Z�efd݃j�d�d܄ �Z�efd߃j�d�d܄ �Z�e�e�B e�B eeeGd�dyd�B efd�e j��B Z�e�e�e�d� e� �Z�e^d�ed�j�d� e�e{e�e�B ��j�d� d� Z�d�dc� Z�d�dQ� Z�d�d`� Z�d�d^� Z�d�dq� Z�e�d�d܄ �Z�e�d�d܄ �Z�d�d� Z�d�dO� Z�d�dP� Z�d�di� Z�e<� e�_��d4d�do�Z�e=� Z�e<� e�_�e<� e�_�e�d��e�d��fd�dm�Z�e�Z�e�efd��d� �j�d��Z�e�efd��d� �j�d��Z�e�efd��d� efd��d� B �j��d �Z�e�e_�d�e�j� �j��d�Z�d�d�de�j� f�ddT�Z��d5�ddj�Z�e��d�Z�e��d�Z�e�eee@eC�d �j��d��\Z�Z�e�e��d j4� �d
��Z�ef�d �d jEe�jà � �d
�j��d�ZĐdd_� Z�e�ef�d��d �j��d�Z�ef�d�j��d�Z�ef�d�jȃ j��d�Z�ef�d�j��d�Z�e�ef�d��d e�B �j��d�Z�e�Z�ef�d�j��d�Z�e�e{eeeGdɐd �eee�d �e^dɃ em� � ��j j��d �Z�e�ee�j� e�B d��d ��j�d>�Z�G �d dr� dr�Z�eҐd!k� r�eb�d"�Z�eb�d#�Z�eee@eC�d$ �Z�e�eՐd%dӐd&�j�e��Z�e�e�eփ�j��d'�Zאd(e�B Z�e�eՐd%dӐd&�j�e��Z�e�e�eك�j��d)�Z�eӐd*�eؐd'� e� eڐd)� Z�e�jܐd+� e�j�jܐd,� e�j�jܐd,� e�j�jܐd-� ddl�Z�e�j�j�e�e�j�� e�j�jܐd.� dS (6 aS
pyparsing module - Classes and methods to define and execute parsing grammars
The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you
don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.
Here is a program to parse "Hello, World!" (or any greeting of the form
C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
The program outputs the following::
Hello, World! -> ['Hello', ',', 'World', '!']
The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of '+', '|' and '^' operators.
The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
object with named attributes.
The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.)
- quoted strings
- embedded comments
z2.1.10z07 Oct 2016 01:31 UTCz*Paul McGuire <ptmcg@users.sourceforge.net>� N)�ref)�datetime)�RLock)� OrderedDict�And�CaselessKeyword�CaselessLiteral�
CharsNotIn�Combine�Dict�Each�Empty�
FollowedBy�Forward�
GoToColumn�Group�Keyword�LineEnd� LineStart�Literal�
MatchFirst�NoMatch�NotAny� OneOrMore�OnlyOnce�Optional�Or�ParseBaseException�ParseElementEnhance�ParseException�ParseExpression�ParseFatalException� ParseResults�ParseSyntaxException�
ParserElement� QuotedString�RecursiveGrammarException�Regex�SkipTo� StringEnd� StringStart�Suppress�Token�TokenConverter�White�Word�WordEnd� WordStart�
ZeroOrMore� alphanums�alphas�
alphas8bit� anyCloseTag�
anyOpenTag�
cStyleComment�col�commaSeparatedList�commonHTMLEntity� countedArray�cppStyleComment�dblQuotedString�dblSlashComment�
delimitedList�dictOf�downcaseTokens�empty�hexnums� htmlComment�javaStyleComment�line�lineEnd� lineStart�lineno� makeHTMLTags� makeXMLTags�matchOnlyAtCol�matchPreviousExpr�matchPreviousLiteral�
nestedExpr�nullDebugAction�nums�oneOf�opAssoc�operatorPrecedence�
printables�punc8bit�pythonStyleComment� quotedString� removeQuotes�replaceHTMLEntity� replaceWith�
restOfLine�sglQuotedString�srange� stringEnd� stringStart�traceParseAction�
unicodeString� upcaseTokens�
withAttribute�
indentedBlock�originalTextFor�ungroup�
infixNotation� locatedExpr� withClass�
CloseMatch�tokenMap�pyparsing_common� c C s` t | t�r| S yt| �S tk
rZ t| �jtj� d�}td�}|jdd� � |j |�S X dS )a Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
then < returns the unicode object | encodes it with the default encoding | ... >.
�xmlcharrefreplacez&#\d+;c S s$ dt t| d dd� ��dd � S )Nz\ur � � ���)�hex�int)�t� rw � /usr/lib/python3.6/pyparsing.py�<lambda>� s z_ustr.<locals>.<lambda>N)
�
isinstanceZunicode�str�UnicodeEncodeError�encode�sys�getdefaultencodingr' �setParseAction�transformString)�obj�retZ
xmlcharrefrw rw rx �_ustr� s
r� z6sum len sorted reversed list tuple set any all min maxc c s | ]
}|V qd S )Nrw )�.0�yrw rw rx � <genexpr>� s r� rr c C s> d}dd� dj � D �}x"t||�D ]\}}| j||�} q"W | S )z/Escape &, <, >, ", ', etc. in a string of data.z&><"'c s s | ]}d | d V qdS )�&�;Nrw )r� �srw rw rx r� � s z _xml_escape.<locals>.<genexpr>zamp gt lt quot apos)�split�zip�replace)�dataZ from_symbolsZ
to_symbolsZfrom_Zto_rw rw rx � _xml_escape� s
r� c @ s e Zd ZdS )�
_ConstantsN)�__name__�
__module__� __qualname__rw rw rw rx r� � s r� �
0123456789Z ABCDEFabcdef�\ � c c s | ]}|t jkr|V qd S )N)�stringZ
whitespace)r� �crw rw rx r� � s c @ sP e Zd ZdZddd�Zedd� �Zdd � Zd
d � Zd d
� Z ddd�Z
dd� Z dS )r z7base exception class for all parsing runtime exceptionsr Nc C s> || _ |d kr || _d| _n || _|| _|| _|||f| _d S )Nr� )�loc�msg�pstr�
parserElement�args)�selfr� r� r� �elemrw rw rx �__init__� s zParseBaseException.__init__c C s | |j |j|j|j�S )z�
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
)r� r� r� r� )�cls�perw rw rx �_from_exception� s z"ParseBaseException._from_exceptionc C sN |dkrt | j| j�S |dkr,t| j| j�S |dkrBt| j| j�S t|��dS )z�supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
rJ r9 �columnrG N)r9 r� )rJ r� r� r9 rG �AttributeError)r� Zanamerw rw rx � __getattr__� s z ParseBaseException.__getattr__c C s d| j | j| j| jf S )Nz"%s (at char %d), (line:%d, col:%d))r� r� rJ r� )r� rw rw rx �__str__� s zParseBaseException.__str__c C s t | �S )N)r� )r� rw rw rx �__repr__� s zParseBaseException.__repr__�>!<c C s< | j }| jd }|r4dj|d|� |||d� f�}|j� S )z�Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
rr r� N)rG r� �join�strip)r� Z markerStringZline_strZ line_columnrw rw rx �
markInputline� s
z ParseBaseException.markInputlinec C s dj � tt| �� S )Nzlineno col line)r� �dir�type)r� rw rw rx �__dir__� s zParseBaseException.__dir__)r NN)r� ) r� r� r� �__doc__r� � classmethodr� r� r� r� r� r� rw rw rw rx r � s
c @ s e Zd ZdZdS )r aN
Exception thrown when parse expressions don't match class;
supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
N)r� r� r� r� rw rw rw rx r � s c @ s e Zd ZdZdS )r! znuser-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediatelyN)r� r� r� r� rw rw rw rx r! s c @ s e Zd ZdZdS )r# z�just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been foundN)r� r� r� r� rw rw rw rx r# s c @ s e Zd ZdZdd� Zdd� ZdS )r& zZexception thrown by L{ParserElement.validate} if the grammar could be improperly recursivec C s
|| _ d S )N)�parseElementTrace)r� �parseElementListrw rw rx r� s z"RecursiveGrammarException.__init__c C s
d| j S )Nz RecursiveGrammarException: %s)r� )r� rw rw rx r� s z!RecursiveGrammarException.__str__N)r� r� r� r� r� r� rw rw rw rx r& s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�_ParseResultsWithOffsetc C s ||f| _ d S )N)�tup)r� Zp1Zp2rw rw rx r� $ s z _ParseResultsWithOffset.__init__c C s
| j | S )N)r� )r� �irw rw rx � __getitem__& s z#_ParseResultsWithOffset.__getitem__c C s t | jd �S )Nr )�reprr� )r� rw rw rx r� ( s z _ParseResultsWithOffset.__repr__c C s | j d |f| _ d S )Nr )r� )r� r� rw rw rx � setOffset* s z!_ParseResultsWithOffset.setOffsetN)r� r� r� r� r� r� r� rw rw rw rx r� # s r� c @ s� e Zd ZdZd[dd�Zddddefdd�Zdd � Zefd
d �Zd d
� Z dd� Z
dd� Z dd� Z e Z
dd� Zdd� Zdd� Zdd� Zd d � Zer�eZeZeZn$eZeZeZd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd\d(d)�Z d*d+� Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z!d4d5� Z"d6d7� Z#d8d9� Z$d:d;� Z%d<d=� Z&d]d?d@�Z'dAdB� Z(dCdD� Z)dEdF� Z*d^dHdI�Z+dJdK� Z,dLdM� Z-d_dOdP�Z.dQdR� Z/dSdT� Z0dUdV� Z1dWdX� Z2dYdZ� Z3dS )`r" aI
Structured parse results, to provide multiple means of access to the parsed data:
- as a list (C{len(results)})
- by list index (C{results[0], results[1]}, etc.)
- by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
NTc C s" t || �r|S tj| �}d|_|S )NT)rz �object�__new__�_ParseResults__doinit)r� �toklist�name�asList�modalZretobjrw rw rx r� T s
zParseResults.__new__c
C s` | j rvd| _ d | _d | _i | _|| _|| _|d kr6g }||t�rP|d d � | _n ||t�rft|�| _n|g| _t � | _
|d k o�|�r\|s�d| j|< ||t �r�t |�}|| _||t
d �ttf�o�|d dg fk�s\||t�r�|g}|�r&||t��rt|j� d�| |< ntt|d �d�| |< || | _n6y|d | |< W n$ tttfk
�rZ || |< Y nX d S )NFr r� )r� �_ParseResults__name�_ParseResults__parent�_ParseResults__accumNames�_ParseResults__asList�_ParseResults__modal�list�_ParseResults__toklist�_generatorType�dict�_ParseResults__tokdictru r� r� �
basestringr" r� �copy�KeyError� TypeError�
IndexError)r� r� r� r� r� rz rw rw rx r� ] sB
$
zParseResults.__init__c C sP t |ttf�r| j| S || jkr4| j| d d S tdd� | j| D ��S d S )Nrr r c S s g | ] }|d �qS )r rw )r� �vrw rw rx �
<listcomp>� s z,ParseResults.__getitem__.<locals>.<listcomp>rs )rz ru �slicer� r� r� r" )r� r� rw rw rx r� � s
zParseResults.__getitem__c C s� ||t �r0| jj|t� �|g | j|< |d }nD||ttf�rN|| j|< |}n&| jj|t� �t |d�g | j|< |}||t�r�t| �|_ d S )Nr )
r� r� �getr� ru r� r� r" �wkrefr� )r� �kr� rz �subrw rw rx � __setitem__� s
"
zParseResults.__setitem__c
C s� t |ttf�r�t| j�}| j|= t |t�rH|dk r:||7 }t||d �}tt|j|�� �}|j� x^| j j
� D ]F\}}x<|D ]4}x.t |�D ]"\}\}} t || | |k �||< q�W q|W qnW n| j |= d S )Nr rr )
rz ru r� �lenr� r� �range�indices�reverser� �items� enumerater� )
r� r� ZmylenZremovedr� � occurrences�jr� �value�positionrw rw rx � __delitem__� s
$zParseResults.__delitem__c C s
|| j kS )N)r� )r� r� rw rw rx � __contains__� s zParseResults.__contains__c C s
t | j�S )N)r� r� )r� rw rw rx �__len__� s zParseResults.__len__c C s
| j S )N)r� )r� rw rw rx �__bool__� s zParseResults.__bool__c C s
t | j�S )N)�iterr� )r� rw rw rx �__iter__� s zParseResults.__iter__c C s t | jd d d� �S )Nrr rs )r� r� )r� rw rw rx � __reversed__� s zParseResults.__reversed__c C s$ t | jd�r| jj� S t| j�S d S )N�iterkeys)�hasattrr� r� r� )r� rw rw rx � _iterkeys� s
zParseResults._iterkeysc s � fdd�� j � D �S )Nc 3 s | ]}� | V qd S )Nrw )r� r� )r� rw rx r� � s z+ParseResults._itervalues.<locals>.<genexpr>)r� )r� rw )r� rx � _itervalues� s zParseResults._itervaluesc s � fdd�� j � D �S )Nc 3 s | ]}|� | fV qd S )Nrw )r� r� )r� rw rx r� � s z*ParseResults._iteritems.<locals>.<genexpr>)r� )r� rw )r� rx �
_iteritems� s zParseResults._iteritemsc C s t | j� �S )zVReturns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).)r� r� )r� rw rw rx �keys� s zParseResults.keysc C s t | j� �S )zXReturns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).)r� �
itervalues)r� rw rw rx �values� s zParseResults.valuesc C s t | j� �S )zfReturns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).)r� � iteritems)r� rw rw rx r� � s zParseResults.itemsc C s
t | j�S )z�Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names.)�boolr� )r� rw rw rx �haskeys� s zParseResults.haskeysc O s� |s
dg}x6|j � D ]*\}}|dkr2|d |f}qtd| ��qW t|d t�sht|�dksh|d | kr�|d }| | }| |= |S |d }|S dS )a�
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
rr �defaultr z-pop() got an unexpected keyword argument '%s'Nrs )r� r� rz ru r� )r� r� �kwargsr� r� �indexr� Z defaultvaluerw rw rx �pop� s " zParseResults.popc C s || kr| | S |S dS )ai
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
Nrw )r� �key� defaultValuerw rw rx r� s zParseResults.getc C sZ | j j||� xF| jj� D ]8\}}x.t|�D ]"\}\}}t||||k �||< q,W qW dS )a
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
N)r� �insertr� r� r� r� )r� r� ZinsStrr� r� r� r� r� rw rw rx r� 2 s zParseResults.insertc C s | j j|� dS )a�
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
N)r� �append)r� �itemrw rw rx r� F s zParseResults.appendc C s$ t |t�r| |7 } n | jj|� dS )a
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
N)rz r" r� �extend)r� Zitemseqrw rw rx r� T s
zParseResults.extendc C s | j dd�= | jj� dS )z7
Clear all elements and results names.
N)r� r� �clear)r� rw rw rx r� f s zParseResults.clearc C sf y| | S t k
r dS X || jkr^|| jkrD| j| d d S tdd� | j| D ��S ndS d S )Nr� rr r c S s g | ] }|d �qS )r rw )r� r� rw rw rx r� w s z,ParseResults.__getattr__.<locals>.<listcomp>rs )r� r� r� r" )r� r� rw rw rx r� m s
zParseResults.__getattr__c C s | j � }||7 }|S )N)r� )r� �otherr� rw rw rx �__add__{ s zParseResults.__add__c s� |j rnt| j���fdd�� |j j� }� fdd�|D �}x4|D ],\}}|| |< t|d t�r>t| �|d _q>W | j|j7 _| jj |j� | S )Nc s | dk r � S | � S )Nr rw )�a)�offsetrw rx ry � s z'ParseResults.__iadd__.<locals>.<lambda>c s4 g | ],\}}|D ] }|t |d � |d ��f�qqS )r rr )r� )r� r� �vlistr� )� addoffsetrw rx r� � s z)ParseResults.__iadd__.<locals>.<listcomp>r )
r� r� r� r� rz r" r� r� r� �update)r� r� Z
otheritemsZotherdictitemsr� r� rw )r r rx �__iadd__� s
zParseResults.__iadd__c C s& t |t�r|dkr| j� S || S d S )Nr )rz ru r� )r� r� rw rw rx �__radd__� s zParseResults.__radd__c C s dt | j�t | j�f S )Nz(%s, %s))r� r� r� )r� rw rw rx r� � s zParseResults.__repr__c C s ddj dd� | jD �� d S )N�[z, c s s( | ] }t |t�rt|�nt|�V qd S )N)rz r" r� r� )r� r� rw rw rx r� � s z'ParseResults.__str__.<locals>.<genexpr>�])r� r� )r� rw rw rx r� � s zParseResults.__str__r� c C sP g }xF| j D ]<}|r"|r"|j|� t|t�r:||j� 7 }q |jt|�� q W |S )N)r� r� rz r" �
_asStringListr� )r� �sep�outr� rw rw rx r
� s
zParseResults._asStringListc C s dd� | j D �S )a�
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
c S s" g | ]}t |t�r|j� n|�qS rw )rz r" r� )r� �resrw rw rx r� � s z'ParseResults.asList.<locals>.<listcomp>)r� )r� rw rw rx r� � s zParseResults.asListc s6 t r | j}n| j}� fdd�� t� fdd�|� D ��S )a�
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
c s6 t | t�r.| j� r| j� S � fdd�| D �S n| S d S )Nc s g | ] }� |��qS rw rw )r� r� )�toItemrw rx r� � s z7ParseResults.asDict.<locals>.toItem.<locals>.<listcomp>)rz r" r� �asDict)r� )r rw rx r � s
z#ParseResults.asDict.<locals>.toItemc 3 s | ]\}}|� |�fV qd S )Nrw )r� r� r� )r rw rx r� � s z&ParseResults.asDict.<locals>.<genexpr>)�PY_3r� r� r� )r� Zitem_fnrw )r rx r � s
zParseResults.asDictc C s8 t | j�}| jj� |_| j|_|jj| j� | j|_|S )zA
Returns a new copy of a C{ParseResults} object.
)r" r� r� r� r� r� r r� )r� r� rw rw rx r� � s
zParseResults.copyFc C sP d}g }t dd� | jj� D ��}|d }|s8d}d}d}d} |dk rJ|} n | jrV| j} | sf|rbdS d} |||d| d g7 }x�t| j�D ]�\}
} t| t�r�|
|kr�|| j||
|o�|dk||�g7 }n || jd|o�|dk||�g7 }q�d} |
|kr�||
} | �s
|�rq�nd} t t
| ��}
|||d| d |
d
| d g 7 }q�W |||d
| d g7 }dj |�S ) z�
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
�
c s s( | ] \}}|D ]}|d |fV qqdS )rr Nrw )r� r� r r� rw rw rx r� � s z%ParseResults.asXML.<locals>.<genexpr>z r� NZITEM�<�>z</) r� r� r� r� r� r� rz r" �asXMLr� r� r� )r� ZdoctagZnamedItemsOnly�indentZ formatted�nlr Z
namedItemsZnextLevelIndentZselfTagr� r
ZresTagZ xmlBodyTextrw rw rx r � sT
zParseResults.asXMLc C s: x4| j j� D ]&\}}x |D ]\}}||kr|S qW q W d S )N)r� r� )r� r� r� r r� r� rw rw rx Z__lookup$ s
zParseResults.__lookupc C s� | j r | j S | jr.| j� }|r(|j| �S dS nNt| �dkrxt| j�dkrxtt| jj� ��d d dkrxtt| jj� ��S dS dS )a(
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
Nrr r rs )r rs ) r� r� �_ParseResults__lookupr� r� �nextr� r� r� )r� �parrw rw rx �getName+ s
zParseResults.getNamer c C sb g }d}|j |t| j� � � |�rX| j� r�tdd� | j� D ��}xz|D ]r\}}|r^|j |� |j d|d| |f � t|t�r�|r�|j |j||d �� q�|j t|�� qH|j t |�� qHW n�t
dd� | D ���rX| }x~t |�D ]r\} }
t|
t��r*|j d|d| | |d|d |
j||d �f � q�|j d|d| | |d|d t|
�f � q�W d j |�S )
aH
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
r c s s | ]\}}t |�|fV qd S )N)r{ )r� r� r� rw rw rx r� g s z$ParseResults.dump.<locals>.<genexpr>z
%s%s- %s: z rr c s s | ]}t |t�V qd S )N)rz r" )r� �vvrw rw rx r� s s z
%s%s[%d]:
%s%s%sr� )
r� r� r� r� �sortedr� rz r" �dumpr� �anyr� r� ) r� r �depth�fullr �NLr� r� r� r� r rw rw rx r P s,
4.zParseResults.dumpc O s t j | j� f|�|� dS )a�
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
N)�pprintr� )r� r� r� rw rw rx r" } s zParseResults.pprintc C s. | j | jj� | jd k r | j� p d | j| jffS )N)r� r� r� r� r� r� )r� rw rw rx � __getstate__� s
zParseResults.__getstate__c C sN |d | _ |d \| _}}| _i | _| jj|� |d k rDt|�| _nd | _d S )Nr rr )r� r� r� r� r r� r� )r� �stater Z inAccumNamesrw rw rx � __setstate__� s
zParseResults.__setstate__c C s | j | j| j| jfS )N)r� r� r� r� )r� rw rw rx �__getnewargs__� s zParseResults.__getnewargs__c C s t t| ��t| j� � S )N)r� r� r� r� )r� rw rw rx r� � s zParseResults.__dir__)NNTT)N)r� )NFr� T)r� r T)4r� r� r� r� r� rz r� r� r� r� r� r� r� � __nonzero__r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r� r
r� r r� r r r r r" r# r% r& r� rw rw rw rx r" - sh &
'
4
#
=%
-
c C sF |}d| k ot |�k n r4|| d dkr4dS | |jdd| � S )a Returns current column within a string, counting newlines as line separators.
The first column is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r rr r )r� �rfind)r� �strgr� rw rw rx r9 � s
c C s |j dd| �d S )a Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r r rr )�count)r� r) rw rw rx rJ � s
c C sF |j dd| �}|jd| �}|dkr2||d |� S ||d d� S dS )zfReturns the line of text containing loc within a string, counting newlines as line separators.
r r rr N)r( �find)r� r) ZlastCRZnextCRrw rw rx rG � s
c C s8 t dt|� d t|� dt|| �t|| �f � d S )NzMatch z at loc z(%d,%d))�printr� rJ r9 )�instringr� �exprrw rw rx �_defaultStartDebugAction� s r/ c C s$ t dt|� d t|j� � � d S )NzMatched z -> )r, r� r{ r� )r- �startlocZendlocr. �toksrw rw rx �_defaultSuccessDebugAction� s r2 c C s t dt|� � d S )NzException raised:)r, r� )r- r� r. �excrw rw rx � _defaultExceptionDebugAction� s r4 c G s dS )zG'Do-nothing' debug action, to suppress debugging output during parsing.Nrw )r� rw rw rx rQ � s rq c s� �t kr�fdd�S dg�dg�td d� dkrFddd �}dd
d �� n tj}tj� d }|dd
�d }|d |d | f�� �����fdd�}d}yt�dt�d�j�}W n tk
r� t��}Y nX ||_|S )Nc s � |�S )Nrw )r� �lrv )�funcrw rx ry � s z _trim_arity.<locals>.<lambda>r Frq ro � c S s8 t dkr dnd }tj| | d d�| }|j|jfgS )
Nro r7 r rq rr )�limit)ro r7 r ������)�system_version� traceback�
extract_stack�filenamerJ )r8 r �
frame_summaryrw rw rx r= s z"_trim_arity.<locals>.extract_stackc S s$ t j| |d�}|d }|j|jfgS )N)r8 rr rs )r< �
extract_tbr> rJ )�tbr8 Zframesr? rw rw rx r@ s z _trim_arity.<locals>.extract_tb� )r8 rr c s� x�y �| �d d � � }d�d< |S t k
r� �d r>� n4z.tj� d }� |dd�d d d� �ksj� W d ~X �d �kr��d d7 < w� Y qX qW d S )Nr Trr rq )r8 rs rs )r� r~ �exc_info)r� r� rA )r@ �
foundArityr6 r8 �maxargs�pa_call_line_synthrw rx �wrapper s" z _trim_arity.<locals>.wrapperz<parse action>r� � __class__)ro r7 )r )r rs ) �singleArgBuiltinsr; r< r= r@ �getattrr� � Exceptionr{ )r6 rE r= Z LINE_DIFFZ this_linerG � func_namerw )r@ rD r6 r8 rE rF rx � _trim_arity� s*
rM c s� e Zd ZdZdZdZedd� �Zedd� �Zd�dd �Z d
d � Z
d d
� Z d�dd�Z d�dd�Z
dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd�d d �Zd!d"� Zd�d#d$�Zd%d&� Zd'd(� ZG d)d*� d*e�Zed+k r�G d,d-� d-e�Z nG d.d-� d-e�Z i Z e � Z d/d/gZ d�d0d1�Z!eZ"ed2d3� �Z#dZ$ed�d5d6��Z%d�d7d8�Z&e'dfd9d:�Z(d;d<� Z)e'fd=d>�Z*e'dfd?d@�Z+dAdB� Z,dCdD� Z-dEdF� Z.dGdH� Z/dIdJ� Z0dKdL� Z1dMdN� Z2dOdP� Z3dQdR� Z4dSdT� Z5dUdV� Z6dWdX� Z7dYdZ� Z8d�d[d\�Z9d]d^� Z:d_d`� Z;dadb� Z<dcdd� Z=dedf� Z>dgdh� Z?d�didj�Z@dkdl� ZAdmdn� ZBdodp� ZCdqdr� ZDg fdsdt�ZEd�dudv�ZF� fdwdx�ZGdydz� ZHd{d|� ZId}d~� ZJdd�� ZKd�d�d��ZLd�d�d��ZM� ZNS )�r$ z)Abstract base level parser element class.z
Fc C s
| t _dS )a�
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
N)r$ �DEFAULT_WHITE_CHARS)�charsrw rw rx �setDefaultWhitespaceChars= s
z'ParserElement.setDefaultWhitespaceCharsc C s
| t _dS )a�
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
N)r$ �_literalStringClass)r� rw rw rx �inlineLiteralsUsingL s z!ParserElement.inlineLiteralsUsingc C s� t � | _d | _d | _d | _|| _d| _tj| _ d| _
d| _ d| _ t � | _
d| _d| _d| _d| _d| _d| _d | _d| _d| _d S )NTFr� )NNN)r� � parseAction�
failAction�strRepr� resultsName�
saveAsList�skipWhitespacer$ rN �
whiteChars�copyDefaultWhiteChars�mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined�
mayIndexError�errmsg� modalResults� debugActions�re� callPreparse�
callDuringTry)r� �savelistrw rw rx r� a s( zParserElement.__init__c C s< t j | �}| jdd� |_| jdd� |_| jr8tj|_|S )a$
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
N)r� rS r] rZ r$ rN rY )r� Zcpyrw rw rx r� x s
zParserElement.copyc C s* || _ d| j | _t| d�r&| j| j_| S )af
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
z Expected � exception)r� ra r� rh r� )r� r� rw rw rx �setName� s
zParserElement.setNamec C s4 | j � }|jd�r"|dd� }d}||_| |_|S )aP
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
NOTE: this returns a *copy* of the original C{ParserElement} object;
this is so that the client can define a basic element, such as an
integer, and reference it in multiple places with different names.
You can also set results names using the abbreviated syntax,
C{expr("name")} in place of C{expr.setResultsName("name")} -
see L{I{__call__}<__call__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
�*Nrr Trs )r� �endswithrV rb )r� r� �listAllMatchesZnewselfrw rw rx �setResultsName� s
z ParserElement.setResultsNameTc s@ |r&| j � d� fdd� }� |_|| _ nt| j d�r<| j j| _ | S )z�Method to invoke the Python pdb debugger when this element is
about to be parsed. Set C{breakFlag} to True to enable, False to
disable.
Tc s dd l }|j� � | |||�S )Nr )�pdbZ set_trace)r- r� � doActions� callPreParsern )� _parseMethodrw rx �breaker� s z'ParserElement.setBreak.<locals>.breaker�_originalParseMethod)TT)�_parsers r� )r� Z breakFlagrr rw )rq rx �setBreak� s
zParserElement.setBreakc O s& t ttt |���| _|jdd�| _| S )a
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
rf F)r� �maprM rS r� rf )r� �fnsr� rw rw rx r� � s "z ParserElement.setParseActionc O s4 | j tttt|���7 _ | jp,|jdd�| _| S )z�
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
rf F)rS r� rv rM rf r� )r� rw r� rw rw rx �addParseAction� s z ParserElement.addParseActionc sb |j dd��|j dd�r tnt� x(|D ] �� ��fdd�}| jj|� q&W | jpZ|j dd�| _| S )a� Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
�messagez failed user-defined condition�fatalFc s$ t t��| ||��s � | |���d S )N)r� rM )r� r5 rv )�exc_type�fnr� rw rx �pa s z&ParserElement.addCondition.<locals>.parf )r� r! r rS r� rf )r� rw r� r} rw )r{ r| r� rx � addCondition� s
zParserElement.addConditionc C s
|| _ | S )a Define action to perform if parsing fails at this expression.
Fail acton fn is a callable function that takes the arguments
C{fn(s,loc,expr,err)} where:
- s = string being parsed
- loc = location where expression match was attempted and failed
- expr = the parse expression that failed
- err = the exception thrown
The function returns no value. It may throw C{L{ParseFatalException}}
if it is desired to stop parsing immediately.)rT )r� r| rw rw rx �
setFailAction s
zParserElement.setFailActionc C sZ d}xP|rTd}xB| j D ]8}y x|j||�\}}d}q W W q tk
rL Y qX qW qW |S )NTF)r] rt r )r� r- r� Z
exprsFound�eZdummyrw rw rx �_skipIgnorables# s z ParserElement._skipIgnorablesc C sL | j r| j||�}| jrH| j}t|�}x ||k rF|| |krF|d7 }q(W |S )Nrr )r] r� rX rY r� )r� r- r� Zwt�instrlenrw rw rx �preParse0 s zParserElement.preParsec C s |g fS )Nrw )r� r- r� ro rw rw rx � parseImpl< s zParserElement.parseImplc C s |S )Nrw )r� r- r� � tokenlistrw rw rx � postParse? s zParserElement.postParsec " C s� | j }|s| jr�| jd r,| jd ||| � |rD| jrD| j||�}n|}|}yDy| j|||�\}}W n( tk
r� t|t|�| j | ��Y nX W nX t
k
r� } z<| jd r�| jd ||| | � | jr�| j||| | � � W Y d d } ~ X nX n�|o�| j�r| j||�}n|}|}| j �s$|t|�k�rhy| j|||�\}}W n* tk
�rd t|t|�| j | ��Y nX n| j|||�\}}| j |||�}t
|| j| j| jd�}
| j�r�|�s�| j�r�|�rVyRxL| jD ]B} | |||
�}|d k �r�t
|| j| j�o�t|t
tf�| jd�}
�q�W W nF t
k
�rR } z(| jd �r@| jd ||| | � � W Y d d } ~ X nX nNxL| jD ]B} | |||
�}|d k �r^t
|| j| j�o�t|t
tf�| jd�}
�q^W |�r�| jd �r�| jd |||| |
� ||
fS )Nr rq )r� r� rr )r^ rT rc re r� r� r� r r� ra r r` r� r" rV rW rb rS rf rz r� ) r� r- r� ro rp Z debugging�prelocZ tokensStart�tokens�errZ retTokensr| rw rw rx �
_parseNoCacheC sp
zParserElement._parseNoCachec C s> y| j ||dd�d S tk
r8 t||| j| ��Y nX d S )NF)ro r )rt r! r ra )r� r- r� rw rw rx �tryParse� s zParserElement.tryParsec C s2 y| j ||� W n ttfk
r( dS X dS d S )NFT)r� r r� )r� r- r� rw rw rx � canParseNext� s
zParserElement.canParseNextc @ s e Zd Zdd� ZdS )z ParserElement._UnboundedCachec sd i � t � | _�� �fdd�}� fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )�cache� not_in_cacherw rx r� � s z3ParserElement._UnboundedCache.__init__.<locals>.getc s |� |< d S )Nrw )r� r� r� )r� rw rx �set� s z3ParserElement._UnboundedCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z5ParserElement._UnboundedCache.__init__.<locals>.clear)r� r� �types�
MethodTyper� r� r� )r� r� r� r� rw )r� r� rx r� � s z&ParserElement._UnboundedCache.__init__N)r� r� r� r� rw rw rw rx �_UnboundedCache� s r� Nc @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sh t � | _�t� � � �fdd�}� �fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s" |� |< t � ��kr � jd� d S )NF)r� �popitem)r� r� r� )r� �sizerw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear)r� r� � _OrderedDictr� r� r� r� r� )r� r� r� r� r� rw )r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx �
_FifoCache� s r� c @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sv t � | _�i � tjg ���� �fdd�}� ��fdd�}� �fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s2 |� |< t � ��kr$� j�j� d � �j|� d S )N)r� r� �popleftr� )r� r� r� )r� �key_fifor� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � �j � d S )N)r� )r� )r� r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear) r� r� � collections�dequer� r� r� r� r� )r� r� r� r� r� rw )r� r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx r� � s r c C s� d\}}| ||||f}t j�� t j}|j|�} | |jkr�t j| d7 < y| j||||�} W n8 tk
r� }
z |j||
j |
j
� � � W Y d d }
~
X q�X |j|| d | d j � f� | S n4t j| d7 < t | t
�r�| �| d | d j � fS W d Q R X d S )Nr rr )r rr )r$ �packrat_cache_lock�
packrat_cacher� r� �packrat_cache_statsr� r r� rH r� r� rz rK ) r� r- r� ro rp ZHITZMISS�lookupr� r� r� rw rw rx � _parseCache� s$
zParserElement._parseCachec C s( t jj� dgtt j� t jd d �< d S )Nr )r$ r� r� r� r� rw rw rw rx �
resetCache� s
zParserElement.resetCache� c C s8 t js4dt _| dkr t j� t _n t j| �t _t jt _dS )a� Enables "packrat" parsing, which adds memoizing to the parsing logic.
Repeated parse attempts at the same string location (which happens
often in many complex grammars) can immediately return a cached value,
instead of re-executing parsing/validating code. Memoizing is done of
both valid results and parsing exceptions.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "compile as you go", you must call
C{enablePackrat} before calling C{psyco.full()}. If you do not do this,
Python will crash. For best results, call C{enablePackrat()} immediately
after importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
TN)r$ �_packratEnabledr� r� r� r� rt )Zcache_size_limitrw rw rx �
enablePackrat s zParserElement.enablePackratc C s� t j� | js| j� x| jD ] }|j� q W | js<|j� }y<| j|d�\}}|rv| j||�}t � t
� }|j||� W n0 t k
r� } zt j r�� n|�W Y dd}~X nX |S dS )aB
Execute the parse expression with the given string.
This is the main interface to the client code, once the complete
expression has been built.
If you want the grammar to require that the entire input string be
successfully parsed, then set C{parseAll} to True (equivalent to ending
the grammar with C{L{StringEnd()}}).
Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
in order to report proper column numbers in parse actions.
If the input string contains tabs and
the grammar uses parse actions that use the C{loc} argument to index into the
string being parsed, you can ensure you have a consistent view of the input
string by:
- calling C{parseWithTabs} on your grammar before calling C{parseString}
(see L{I{parseWithTabs}<parseWithTabs>})
- define your parse action using the full C{(s,loc,toks)} signature, and
reference the input string using the parse action's C{s} argument
- explictly expand the tabs in your input string before calling
C{parseString}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
r N)
r$ r� r_ �
streamliner] r\ �
expandtabsrt r� r
r) r �verbose_stacktrace)r� r- �parseAllr� r� r� Zser3 rw rw rx � parseString# s$ zParserElement.parseStringc c s@ | j s| j� x| jD ] }|j� qW | js8t|�j� }t|�}d}| j}| j}t j
� d} y�x�||kon| |k �ry |||�}
|||
dd�\} } W n t k
r� |
d }Y q`X | |kr�| d7 } | |
| fV |r�|||�}
|
|kr�| }q�|d7 }n| }q`|
d }q`W W n4 t k
�r: } zt j
�r&� n|�W Y dd}~X nX dS )a�
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
C{maxMatches} argument, to clip scanning after 'n' matches are found. If
C{overlap} is specified, then overlapping matches will be reported.
Note that the start and end locations are reported relative to the string
being parsed. See L{I{parseString}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
r F)rp rr N)r_ r� r] r\ r� r� r� r� rt r$ r� r r r� )r� r- �
maxMatchesZoverlapr� r� r� Z
preparseFnZparseFn�matchesr� ZnextLocr� Znextlocr3 rw rw rx �
scanStringU sB
zParserElement.scanStringc C s� g }d}d| _ y�xh| j|�D ]Z\}}}|j|||� � |rrt|t�rT||j� 7 }n t|t�rh||7 }n
|j|� |}q W |j||d� � dd� |D �}djtt t
|���S t k
r� } zt j
rȂ n|�W Y dd}~X nX dS )af
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
r TNc S s g | ] }|r|�qS rw rw )r� �orw rw rx r� � s z1ParserElement.transformString.<locals>.<listcomp>r� )r\ r� r� rz r" r� r� r� rv r� �_flattenr r$ r� )r� r- r ZlastErv r� r� r3 rw rw rx r� � s(
z ParserElement.transformStringc C sP yt dd� | j||�D ��S tk
rJ } ztjr6� n|�W Y dd}~X nX dS )a~
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
c S s g | ]\}}}|�qS rw rw )r� rv r� r� rw rw rx r� � s z.ParserElement.searchString.<locals>.<listcomp>N)r" r� r r$ r� )r� r- r� r3 rw rw rx � searchString� s zParserElement.searchStringc c sX d}d}x<| j ||d�D ]*\}}}|||� V |r>|d V |}qW ||d� V dS )a[
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
r )r� N)r� ) r� r- �maxsplitZincludeSeparatorsZsplitsZlastrv r� r� rw rw rx r� � s
zParserElement.splitc C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )a�
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
z4Cannot combine element of type %s with ParserElementrq )�
stacklevelN) rz r� r$ rQ �warnings�warnr� �
SyntaxWarningr )r� r� rw rw rx r � s
zParserElement.__add__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of + operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx r s
zParserElement.__radd__c C sL t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| tj � |g�S )zQ
Implementation of - operator, returns C{L{And}} with error stop
z4Cannot combine element of type %s with ParserElementrq )r� N)
rz r� r$ rQ r� r� r� r� r �
_ErrorStop)r� r� rw rw rx �__sub__ s
zParserElement.__sub__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of - operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rsub__ s
zParserElement.__rsub__c s� t |t�r|d }}n�t |t�r�|d dd� }|d dkrHd|d f}t |d t�r�|d dkr�|d dkrvt��S |d dkr�t��S �|d t�� S nJt |d t�r�t |d t�r�|\}}||8 }n tdt|d �t|d ���ntdt|���|dk �r td��|dk �r td��|| k�o2dkn �rBtd ��|�r�� �fd
d �� |�r�|dk�rt�� |� }nt�g| �� |� }n� |�}n |dk�r��}nt�g| �}|S )
a�
Implementation of * operator, allows use of C{expr * 3} in place of
C{expr + expr + expr}. Expressions may also me multiplied by a 2-integer
tuple, similar to C{{min,max}} multipliers in regular expressions. Tuples
may also include C{None} as in:
- C{expr*(n,None)} or C{expr*(n,)} is equivalent
to C{expr*n + L{ZeroOrMore}(expr)}
(read as "at least n instances of C{expr}")
- C{expr*(None,n)} is equivalent to C{expr*(0,n)}
(read as "0 to n instances of C{expr}")
- C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
- C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
Note that C{expr*(None,n)} does not raise an exception if
more than n exprs exist in the input stream; that is,
C{expr*(None,n)} does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
C{expr*(None,n) + ~expr}
r Nrq rr z7cannot multiply 'ParserElement' and ('%s','%s') objectsz0cannot multiply 'ParserElement' and '%s' objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuez+cannot multiply ParserElement by 0 or (0,0)c s( | dkr t �� | d � �S t ��S d S )Nrr )r )�n)�makeOptionalListr� rw rx r� ] s z/ParserElement.__mul__.<locals>.makeOptionalList)NN) rz ru �tupler2 r r� r� �
ValueErrorr )r� r� Z minElementsZ optElementsr� rw )r� r� rx �__mul__, sD
zParserElement.__mul__c C s
| j |�S )N)r� )r� r� rw rw rx �__rmul__p s zParserElement.__rmul__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zI
Implementation of | operator - returns C{L{MatchFirst}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__or__s s
zParserElement.__or__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || B S )z]
Implementation of | operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__ror__ s
zParserElement.__ror__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zA
Implementation of ^ operator - returns C{L{Or}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__xor__� s
zParserElement.__xor__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || A S )z]
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rxor__� s
zParserElement.__rxor__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zC
Implementation of & operator - returns C{L{Each}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__and__� s
zParserElement.__and__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || @ S )z]
Implementation of & operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rand__� s
zParserElement.__rand__c C s t | �S )zE
Implementation of ~ operator - returns C{L{NotAny}}
)r )r� rw rw rx �
__invert__� s zParserElement.__invert__c C s |dk r| j |�S | j� S dS )a
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
N)rm r� )r� r� rw rw rx �__call__� s
zParserElement.__call__c C s t | �S )z�
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
)r+ )r� rw rw rx �suppress� s zParserElement.suppressc C s
d| _ | S )a
Disables the skipping of whitespace before matching the characters in the
C{ParserElement}'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
F)rX )r� rw rw rx �leaveWhitespace� s z ParserElement.leaveWhitespacec C s d| _ || _d| _| S )z8
Overrides the default whitespace chars
TF)rX rY rZ )r� rO rw rw rx �setWhitespaceChars� s z ParserElement.setWhitespaceCharsc C s
d| _ | S )z�
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
T)r\ )r� rw rw rx �
parseWithTabs� s zParserElement.parseWithTabsc C sL t |t�rt|�}t |t�r4|| jkrH| jj|� n| jjt|j� �� | S )a�
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
)rz r� r+ r] r� r� )r� r� rw rw rx �ignore� s
zParserElement.ignorec C s" |pt |p t|ptf| _d| _| S )zT
Enable display of debugging messages while doing pattern matching.
T)r/ r2 r4 rc r^ )r� Z startActionZ
successActionZexceptionActionrw rw rx �setDebugActions
s
z ParserElement.setDebugActionsc C s |r| j ttt� nd| _| S )a�
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
F)r� r/ r2 r4 r^ )r� �flagrw rw rx �setDebug s #zParserElement.setDebugc C s | j S )N)r� )r� rw rw rx r� @ s zParserElement.__str__c C s t | �S )N)r� )r� rw rw rx r� C s zParserElement.__repr__c C s d| _ d | _| S )NT)r_ rU )r� rw rw rx r� F s zParserElement.streamlinec C s d S )Nrw )r� r� rw rw rx �checkRecursionK s z ParserElement.checkRecursionc C s | j g � dS )zj
Check defined expressions for valid structure, check for infinite recursive definitions.
N)r� )r� �
validateTracerw rw rx �validateN s zParserElement.validatec C s� y |j � }W n2 tk
r> t|d��}|j � }W dQ R X Y nX y | j||�S tk
r| } ztjrh� n|�W Y dd}~X nX dS )z�
Execute the parse expression on the given file or filename.
If a filename is specified (instead of a file object),
the entire file is opened, read, and closed before parsing.
�rN)�readr� �openr� r r$ r� )r� Zfile_or_filenamer� Z
file_contents�fr3 rw rw rx � parseFileT s zParserElement.parseFilec sH t |t�r"| |kp t| �t|�kS t |t�r6| j|�S tt| �|kS d S )N)rz r$ �varsr� r� �super)r� r� )rH rw rx �__eq__h s
zParserElement.__eq__c C s
| |k S )Nrw )r� r� rw rw rx �__ne__p s zParserElement.__ne__c C s t t| ��S )N)�hash�id)r� rw rw rx �__hash__s s zParserElement.__hash__c C s | |kS )Nrw )r� r� rw rw rx �__req__v s zParserElement.__req__c C s
| |k S )Nrw )r� r� rw rw rx �__rne__y s zParserElement.__rne__c C s0 y| j t|�|d� dS tk
r* dS X dS )a�
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
)r� TFN)r� r� r )r� Z
testStringr� rw rw rx r� | s
zParserElement.matches�#c C s� t |t�r"tttj|j� j� ��}t |t�r4t|�}g }g }d} �x�|D �]�}
|dk rb|j |
d�sl|rx|
rx|j
|
� qH|
s~qHdj |�|
g} g }y:|
j dd�}
| j
|
|d�} | j
| j|d�� | o�| } W n� tk
�rx }
z�t |
t�r�dnd }d|
k�r0| j
t|
j|
�� | j
d
t|
j|
�d d | � n| j
d
|
j d | � | j
d
t|
� � | �ob|} |
} W Y dd}
~
X nD tk
�r� } z&| j
dt|� � | �o�|} |} W Y dd}~X nX |�r�|�r�| j
d � tdj | �� |j
|
| f� qHW | |fS )a3
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\n of strings that spans \n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
TNFr z\n)r� )r z(FATAL)r� � rr �^zFAIL: zFAIL-EXCEPTION: )rz r� r� rv r{ r� �rstrip�
splitlinesr r� r� r� r� r� r r r! rG r� r9 rK r, )r� Ztestsr� ZcommentZfullDumpZ printResultsZ failureTestsZ
allResultsZcomments�successrv r �resultr� rz r3 rw rw rx �runTests� sN W
$
zParserElement.runTests)F)F)T)T)TT)TT)r� )F)N)T)F)T)Tr� TTF)Or� r� r� r� rN r� � staticmethodrP rR r� r� ri rm ru r� rx r~ r r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� rt r� r� r� r� �_MAX_INTr� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__rw rw )rH rx r$ 8 s�
&
H
"
2G+ D
)
c s e Zd ZdZ� fdd�Z� ZS )r, zT
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
c s t t| �jdd� d S )NF)rg )r� r, r� )r� )rH rw rx r� s zToken.__init__)r� r� r� r� r� r� rw rw )rH rx r, s c s e Zd ZdZ� fdd�Z� ZS )r
z,
An empty token, will always match.
c s$ t t| �j� d| _d| _d| _d S )Nr
TF)r� r
r� r� r[ r` )r� )rH rw rx r� s zEmpty.__init__)r� r� r� r� r� r� rw rw )rH rx r
s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r z(
A token that will never match.
c s* t t| �j� d| _d| _d| _d| _d S )Nr TFzUnmatchable token)r� r r� r� r[ r` ra )r� )rH rw rx r� * s
zNoMatch.__init__Tc C s t ||| j| ��d S )N)r ra )r� r- r� ro rw rw rx r� 1 s zNoMatch.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r & s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
c s� t t| �j� || _t|�| _y|d | _W n* tk
rV tj dt
dd� t | _ Y nX dt
| j� | _d| j | _d| _d| _d S )Nr z2null string passed to Literal; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �matchr� �matchLen�firstMatchCharr� r� r� r� r
rH r� r� ra r[ r` )r� � matchString)rH rw rx r� C s
zLiteral.__init__Tc C sJ || | j kr6| jdks&|j| j|�r6|| j | jfS t||| j| ��d S )Nrr )r� r� �
startswithr� r ra )r� r- r� ro rw rw rx r� V s zLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r 5 s
c sL e Zd ZdZed Zd� fdd� Zddd �Z� fd
d �Ze d d
� �Z
� Z S )r a\
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
Accepts two optional constructor arguments in addition to the keyword string:
- C{identChars} is a string of characters that would be valid identifier characters,
defaulting to all alphanumerics + "_" and "$"
- C{caseless} allows case-insensitive matching, default is C{False}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
z_$NFc s� t t| �j� |d kr tj}|| _t|�| _y|d | _W n$ tk
r^ t j
dt dd� Y nX d| j | _ d| j | _
d| _d| _|| _|r�|j� | _|j� }t|�| _d S )Nr z2null string passed to Keyword; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �DEFAULT_KEYWORD_CHARSr� r� r� r� r� r� r� r� r� ra r[ r` �caseless�upper�
caselessmatchr� �
identChars)r� r� r� r� )rH rw rx r� q s&
zKeyword.__init__Tc C s | j r||||| j � j� | jkr�|t|�| j ksL||| j j� | jkr�|dksj||d j� | jkr�|| j | jfS nv|| | jkr�| jdks�|j| j|�r�|t|�| j ks�||| j | jkr�|dks�||d | jkr�|| j | jfS t ||| j
| ��d S )Nr rr ) r� r� r� r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s * &zKeyword.parseImplc s t t| �j� }tj|_|S )N)r� r r� r� r� )r� r� )rH rw rx r� � s z Keyword.copyc C s
| t _dS )z,Overrides the default Keyword chars
N)r r� )rO rw rw rx �setDefaultKeywordChars� s z Keyword.setDefaultKeywordChars)NF)T) r� r� r� r� r3 r� r� r� r� r� r� r� rw rw )rH rx r ^ s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r al
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
c s6 t t| �j|j� � || _d| j | _d| j | _d S )Nz'%s'z Expected )r� r r� r� � returnStringr� ra )r� r� )rH rw rx r� � s zCaselessLiteral.__init__Tc C s@ |||| j � j� | jkr,|| j | jfS t||| j| ��d S )N)r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s zCaselessLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
r z�
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
Nc s t t| �j||dd� d S )NT)r� )r� r r� )r� r� r� )rH rw rx r� � s zCaselessKeyword.__init__Tc C sj |||| j � j� | jkrV|t|�| j ksF||| j j� | jkrV|| j | jfS t||| j| ��d S )N)r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s *zCaselessKeyword.parseImpl)N)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
rl ax
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
rr c sB t t| �j� || _|| _|| _d| j| jf | _d| _d| _d S )Nz&Expected %r (with up to %d mismatches)F) r� rl r� r� � match_string�
maxMismatchesra r` r[ )r� r� r� )rH rw rx r� � s zCloseMatch.__init__Tc C s� |}t |�}|t | j� }||kr�| j}d}g } | j}
x�tt|||� | j��D ]0\}} | \} }
| |
krP| j|� t | �|
krPP qPW |d }t|||� g�}| j|d< | |d< ||fS t||| j| ��d S )Nr rr Zoriginal�
mismatches) r� r� r� r� r� r� r" r ra )r� r- r� ro �startr� �maxlocr� Zmatch_stringlocr� r� Zs_m�src�mat�resultsrw rw rx r� � s( "
zCloseMatch.parseImpl)rr )T)r� r� r� r� r� r� r� rw rw )rH rx rl � s c s8 e Zd ZdZd
� fdd� Zdd d
�Z� fd d �Z� ZS )r/ a
Token for matching words composed of allowed character sets.
Defined with string containing all allowed initial characters,
an optional string containing allowed body characters (if omitted,
defaults to the initial character set), and an optional minimum,
maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction. An optional
C{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
Nrr r Fc s� t t| �j� � rFdj� fdd�|D ��}|rFdj� fdd�|D ��}|| _t|�| _|rl|| _t|�| _n|| _t|�| _|dk| _ |dk r�t
d��|| _ |dkr�|| _ nt
| _ |dkr�|| _ || _ t| �| _d| j | _d | _|| _d
| j| j k�r�|dk�r�|dk�r�|dk�r�| j| jk�r8d t| j� | _nHt| j�dk�rfd tj| j�t| j�f | _nd
t| j�t| j�f | _| j�r�d| j d | _ytj| j�| _W n tk
�r� d | _Y nX d S )Nr� c 3 s | ]}|� kr|V qd S )Nrw )r� r� )� excludeCharsrw rx r� 7
s z Word.__init__.<locals>.<genexpr>c 3 s | ]}|� kr|V qd S )Nrw )r� r� )r� rw rx r� 9
s r rr zZcannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permittedz Expected Fr� z[%s]+z%s[%s]*z [%s][%s]*z\b)r� r/ r� r� �
initCharsOrigr� � initChars�
bodyCharsOrig� bodyChars� maxSpecifiedr� �minLen�maxLenr� r� r� ra r` � asKeyword�_escapeRegexRangeChars�reStringr� rd �escape�compilerK )r� r� r �min�max�exactr r� )rH )r� rx r� 4
sT
0
z
Word.__init__Tc
C sD | j r<| j j||�}|s(t||| j| ��|j� }||j� fS || | jkrZt||| j| ��|}|d7 }t|�}| j}|| j }t
||�}x ||k r�|| |kr�|d7 }q�W d} || | j k r�d} | j r�||k r�|| |kr�d} | j
�r |dk�r||d |k�s||k �r || |k�r d} | �r4t||| j| ��||||� fS )Nrr FTr )rd r� r ra �end�groupr� r� r r r
r r r )
r� r- r� ro r� r� r� Z bodycharsr� ZthrowExceptionrw rw rx r� j
s6
4zWord.parseImplc st yt t| �j� S tk
r" Y nX | jd krndd� }| j| jkr^d|| j�|| j�f | _nd|| j� | _| jS )Nc S s$ t | �dkr | d d� d S | S d S )N� z...)r� )r� rw rw rx �
charsAsStr�
s z Word.__str__.<locals>.charsAsStrz W:(%s,%s)zW:(%s))r� r/ r� rK rU r� r )r� r )rH rw rx r� �
s
z Word.__str__)Nrr r r FN)T)r� r� r� r� r� r� r� r� rw rw )rH rx r/
s .6
#c sF e Zd ZdZeejd��Zd � fdd� Zd dd�Z � fd d
�Z
� Z S )
r' a�
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
z[A-Z]r c s� t t| �j� t|t�r�|s,tjdtdd� || _|| _ y t
j | j| j �| _
| j| _ W q� t
jk
r� tjd| tdd� � Y q�X n2t|tj�r�|| _
t|� | _| _ || _ ntd��t| �| _d| j | _d| _d| _d S )
z�The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags.z0null string passed to Regex; use Empty() insteadrq )r� z$invalid pattern (%s) passed to RegexzCRegex may only be constructed with a string or a compiled RE objectz Expected FTN)r� r' r� rz r� r� r� r� �pattern�flagsrd r r �
sre_constants�error�compiledREtyper{ r� r� r� ra r` r[ )r� r r )rH rw rx r� �
s.
zRegex.__init__Tc C sd | j j||�}|s"t||| j| ��|j� }|j� }t|j� �}|r\x|D ]}|| ||< qHW ||fS )N)rd r� r ra r
� groupdictr" r )r� r- r� ro r� �dr� r� rw rw rx r� �
s
zRegex.parseImplc sD yt t| �j� S tk
r" Y nX | jd kr>dt| j� | _| jS )NzRe:(%s))r� r' r� rK rU r� r )r� )rH rw rx r� �
s
z
Regex.__str__)r )T) r� r� r� r� r� rd r r r� r� r� r� rw rw )rH rx r' �
s
"
c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r% a�
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
NFTc sN t t� �j� |j� }|s0tjdtdd� t� �|d kr>|}n"|j� }|s`tjdtdd� t� �|� _t |�� _
|d � _ |� _ t |�� _
|� _|� _|� _|� _|r�tjtjB � _dtj� j�t� j d �|d k r�t|�p�df � _n<d� _dtj� j�t� j d �|d k �rt|��p df � _t � j �d k�rp� jd
d j� fd d
�tt � j �d dd�D �� d 7 _|�r�� jdtj|� 7 _|�r�� jdtj|� 7 _tj� j�d � _� jdtj� j � 7 _y tj � j� j�� _� j� _ W n0 t j k
�r& tjd� j tdd� � Y nX t � �� _!d� j! � _"d� _#d� _$d S )Nz$quoteChar cannot be the empty stringrq )r� z'endQuoteChar cannot be the empty stringr z %s(?:[^%s%s]r� z%s(?:[^%s\n\r%s]rr z|(?:z)|(?:c 3 s4 | ],}d t j� jd|� �t� j| �f V qdS )z%s[^%s]N)rd r � endQuoteCharr )r� r� )r� rw rx r� / s z(QuotedString.__init__.<locals>.<genexpr>�)z|(?:%s)z|(?:%s.)z(.)z)*%sz$invalid pattern (%s) passed to Regexz Expected FTrs )%r� r% r� r� r� r� r� � SyntaxError� quoteCharr� � quoteCharLen�firstQuoteCharr �endQuoteCharLen�escChar�escQuote�unquoteResults�convertWhitespaceEscapesrd � MULTILINE�DOTALLr r r r r� r� �escCharReplacePatternr r r r r� r� ra r` r[ )r� r r r Z multiliner! r r" )rH )r� rx r� sf
6
zQuotedString.__init__c C s� || | j kr | jj||�p d }|s4t||| j| ��|j� }|j� }| jr�|| j| j � }t
|t �r�d|kr�| j r�ddddd�}x |j
� D ]\}}|j||�}q�W | jr�tj| jd|�}| jr�|j| j| j�}||fS )N�\� r � �
)z\tz\nz\fz\rz\g<1>)r rd r� r ra r
r r! r r rz r� r" r� r� r r� r% r r ) r� r- r� ro r� r� Zws_mapZwslitZwscharrw rw rx r� G s(
zQuotedString.parseImplc sF yt t| �j� S tk
r" Y nX | jd kr@d| j| jf | _| jS )Nz.quoted string, starting with %s ending with %s)r� r% r� rK rU r r )r� )rH rw rx r� j s
zQuotedString.__str__)NNFTNT)T)r� r� r� r� r� r� r� r� rw rw )rH rx r% �
s A
#c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r a�
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
rr r c s� t t| �j� d| _|| _|dk r*td��|| _|dkr@|| _nt| _|dkrZ|| _|| _t | �| _
d| j
| _ | jdk| _ d| _
d S )NFrr zfcannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permittedr z Expected )r� r r� rX �notCharsr� r r r� r� r� ra r[ r` )r� r* r
r r )rH rw rx r� � s
zCharsNotIn.__init__Tc C s� || | j kr t||| j| ��|}|d7 }| j }t|| j t|��}x ||k rd|| |krd|d7 }qFW || | jk r�t||| j| ��||||� fS )Nrr )r* r ra r
r r� r )r� r- r� ro r� Znotchars�maxlenrw rw rx r� � s
zCharsNotIn.parseImplc sd yt t| �j� S tk
r" Y nX | jd kr^t| j�dkrRd| jd d� | _n d| j | _| jS )Nr z
!W:(%s...)z!W:(%s))r� r r� rK rU r� r* )r� )rH rw rx r� � s
zCharsNotIn.__str__)rr r r )T)r� r� r� r� r� r� r� r� rw rw )rH rx r v s
c s< e Zd ZdZdddddd�Zd� fd d � Zddd�Z� ZS )r. a�
Special matching class for matching whitespace. Normally, whitespace is ignored
by pyparsing grammars. This class is included when some whitespace structures
are significant. Define with a string containing the whitespace characters to be
matched; default is C{" \t\r\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments,
as defined for the C{L{Word}} class.
z<SPC>z<TAB>z<LF>z<CR>z<FF>)r� r' r r) r( �
rr r c s� t t� �j� |� _� jdj� fdd�� jD ��� djdd� � jD ��� _d� _d� j � _ |� _
|dkrt|� _ nt � _ |dkr�|� _ |� _
d S )Nr� c 3 s | ]}|� j kr|V qd S )N)�
matchWhite)r� r� )r� rw rx r� � s z!White.__init__.<locals>.<genexpr>c s s | ]}t j| V qd S )N)r. � whiteStrs)r� r� rw rw rx r� � s Tz Expected r )
r� r. r� r- r� r� rY r� r[ ra r r r� )r� Zwsr
r r )rH )r� rx r� � s zWhite.__init__Tc C s� || | j kr t||| j| ��|}|d7 }|| j }t|t|��}x"||k rd|| | j krd|d7 }qDW || | jk r�t||| j| ��||||� fS )Nrr )r- r ra r r
r� r )r� r- r� ro r� r� rw rw rx r� � s
zWhite.parseImpl)r, rr r r )T)r� r� r� r� r. r� r� r� rw rw )rH rx r. � s c s e Zd Z� fdd�Z� ZS )�_PositionTokenc s( t t| �j� | jj| _d| _d| _d S )NTF)r� r/ r� rH r� r� r[ r` )r� )rH rw rx r� � s
z_PositionToken.__init__)r� r� r� r� r� rw rw )rH rx r/ � s r/ c s2 e Zd ZdZ� fdd�Zdd� Zd dd�Z� ZS )
r zb
Token to advance to a specific column of input text; useful for tabular report scraping.
c s t t| �j� || _d S )N)r� r r� r9 )r� �colno)rH rw rx r� � s zGoToColumn.__init__c C s` t ||�| j kr\t|�}| jr*| j||�}x0||k rZ|| j� rZt ||�| j krZ|d7 }q,W |S )Nrr )r9 r� r] r� �isspace)r� r- r� r� rw rw rx r� � s & zGoToColumn.preParseTc C sD t ||�}|| j kr"t||d| ��|| j | }|||� }||fS )NzText not in expected column)r9 r )r� r- r� ro ZthiscolZnewlocr� rw rw rx r� s
zGoToColumn.parseImpl)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Matches if current position is at the beginning of a line within the parse string
Example::
test = ''' AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
c s t t| �j� d| _d S )NzExpected start of line)r� r r� ra )r� )rH rw rx r� & s zLineStart.__init__Tc C s* t ||�dkr|g fS t||| j| ��d S )Nrr )r9 r ra )r� r- r� ro rw rw rx r� * s zLineStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r zU
Matches if current position is at the end of a line within the parse string
c s, t t| �j� | jtjjdd�� d| _d S )Nr r� zExpected end of line)r� r r� r� r$ rN r� ra )r� )rH rw rx r� 3 s zLineEnd.__init__Tc C sb |t |�k r6|| dkr$|d dfS t||| j| ��n(|t |�krN|d g fS t||| j| ��d S )Nr rr )r� r ra )r� r- r� ro rw rw rx r� 8 s zLineEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r / s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r* zM
Matches if current position is at the beginning of the parse string
c s t t| �j� d| _d S )NzExpected start of text)r� r* r� ra )r� )rH rw rx r� G s zStringStart.__init__Tc C s0 |dkr(|| j |d�kr(t||| j| ��|g fS )Nr )r� r ra )r� r- r� ro rw rw rx r� K s zStringStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r* C s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r) zG
Matches if current position is at the end of the parse string
c s t t| �j� d| _d S )NzExpected end of text)r� r) r� ra )r� )rH rw rx r� V s zStringEnd.__init__Tc C s^ |t |�k r t||| j| ��n<|t |�kr6|d g fS |t |�krJ|g fS t||| j| ��d S )Nrr )r� r ra )r� r- r� ro rw rw rx r� Z s zStringEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r) R s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r1 ap
Matches if the current position is at the beginning of a Word, and
is not preceded by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
the string being parsed, or at the beginning of a line.
c s" t t| �j� t|�| _d| _d S )NzNot at the start of a word)r� r1 r� r� � wordCharsra )r� r2 )rH rw rx r� l s
zWordStart.__init__Tc C s@ |dkr8||d | j ks(|| | j kr8t||| j| ��|g fS )Nr rr )r2 r ra )r� r- r� ro rw rw rx r� q s
zWordStart.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r1 d s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r0 aZ
Matches if the current position is at the end of a Word, and
is not followed by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
the string being parsed, or at the end of a line.
c s( t t| �j� t|�| _d| _d| _d S )NFzNot at the end of a word)r� r0 r� r� r2 rX ra )r� r2 )rH rw rx r� � s
zWordEnd.__init__Tc C sP t |�}|dkrH||k rH|| | jks8||d | jkrHt||| j| ��|g fS )Nr rr )r� r2 r ra )r� r- r� ro r� rw rw rx r� � s zWordEnd.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r0 x s c s� e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Z� fd d �Z� fd
d�Z � fdd�Z
d� fdd� Z g fdd�Z � fdd�Z
� ZS )r z^
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r"t|�}t|t�r<tj|�g| _ njt|t
j �rzt|�}t dd� |D ��rnt
tj|�}t|�| _ n,yt|�| _ W n tk
r� |g| _ Y nX d| _d S )Nc s s | ]}t |t�V qd S )N)rz r� )r� r. rw rw rx r� � s z+ParseExpression.__init__.<locals>.<genexpr>F)r� r r� rz r� r� r� r$ rQ �exprsr� �Iterable�allrv r� re )r� r3 rg )rH rw rx r� � s
zParseExpression.__init__c C s
| j | S )N)r3 )r� r� rw rw rx r� � s zParseExpression.__getitem__c C s | j j|� d | _| S )N)r3 r� rU )r� r� rw rw rx r� � s zParseExpression.appendc C s4 d| _ dd� | jD �| _x| jD ] }|j� q W | S )z~Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions.Fc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z3ParseExpression.leaveWhitespace.<locals>.<listcomp>)rX r3 r� )r� r� rw rw rx r� � s
z ParseExpression.leaveWhitespacec sz t |t�rF|| jkrvtt| �j|� xP| jD ]}|j| jd � q,W n0tt| �j|� x | jD ]}|j| jd � q^W | S )Nrr rs rs )rz r+ r] r� r r� r3 )r� r� r� )rH rw rx r� � s
zParseExpression.ignorec sL yt t| �j� S tk
r" Y nX | jd krFd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU rH r� r� r3 )r� )rH rw rx r� � s
zParseExpression.__str__c s0 t t| �j� x| jD ] }|j� qW t| j�dk�r | jd }t|| j�r�|j r�|jd kr�|j r�|jd d � | jd g | _d | _
| j |j O _ | j |j O _ | jd }t|| j�o�|j o�|jd ko�|j �r | jd d� |jd d � | _d | _
| j |j O _ | j |j O _ dt
| � | _| S )Nrq r rr z Expected rs rs )r� r r� r3 r� rz rH rS rV r^ rU r[ r` r� ra )r� r� r� )rH rw rx r� � s0
zParseExpression.streamlinec s t t| �j||�}|S )N)r� r rm )r� r� rl r� )rH rw rx rm � s z ParseExpression.setResultsNamec C s: |d d � | g }x| j D ]}|j|� qW | jg � d S )N)r3 r� r� )r� r� �tmpr� rw rw rx r� � s zParseExpression.validatec s$ t t| �j� }dd� | jD �|_|S )Nc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z(ParseExpression.copy.<locals>.<listcomp>)r� r r� r3 )r� r� )rH rw rx r� � s zParseExpression.copy)F)F)r� r� r� r� r� r� r� r� r� r� r� rm r� r� r� rw rw )rH rx r � s
" c sT e Zd ZdZG dd� de�Zd� fdd� Zddd�Zd d
� Zd d � Z d
d� Z
� Z S )r a
Requires all given C{ParseExpression}s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the C{'+'} operator.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
c s e Zd Z� fdd�Z� ZS )zAnd._ErrorStopc s& t tj| �j||� d| _| j� d S )N�-)r� r r� r� r� r� )r� r� r� )rH rw rx r�
s zAnd._ErrorStop.__init__)r� r� r� r� r� rw rw )rH rx r�
s r� Tc sR t t| �j||� tdd� | jD ��| _| j| jd j� | jd j| _d| _ d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r�
s z And.__init__.<locals>.<genexpr>r T)
r� r r� r5 r3 r[ r� rY rX re )r� r3 rg )rH rw rx r�
s
z And.__init__c C s | j d j|||dd�\}}d}x�| j dd � D ]�}t|tj�rFd}q0|r�y|j|||�\}}W q� tk
rv � Y q� tk
r� } zd |_tj|��W Y d d }~X q� t k
r� t|t
|�| j | ��Y q�X n|j|||�\}}|s�|j � r0||7 }q0W ||fS )Nr F)rp rr T)
r3 rt rz r r� r# r �
__traceback__r� r� r� ra r� ) r� r- r� ro �
resultlistZ errorStopr� Z
exprtokensr� rw rw rx r�
s( z
And.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx r 5
s
z And.__iadd__c C s8 |d d � | g }x | j D ]}|j|� |jsP qW d S )N)r3 r� r[ )r� r� �subRecCheckListr� rw rw rx r� :
s
zAnd.checkRecursionc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� �{r� c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� F
s z And.__str__.<locals>.<genexpr>�})r� r� rU r� r3 )r� rw rw rx r� A
s
z And.__str__)T)T) r� r� r� r� r
r� r� r� r r� r� r� rw rw )rH rx r � s
c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the expression that matches the longest string will be used.
May be constructed using the C{'^'} operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� \
s z Or.__init__.<locals>.<genexpr>T)r� r r� r3 r r[ )r� r3 rg )rH rw rx r� Y
s z Or.__init__Tc C sT d}d }g }x�| j D ]�}y|j||�}W nv tk
rd } z d | _| j|krT| }| j}W Y d d } ~ X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX |j||f� qW |�r*|j dd� d� x`|D ]X\}
}y|j
|||�S tk
�r$ } z"d | _| j|k�r| }| j}W Y d d } ~ X q�X q�W |d k �rB| j|_ |�nt||d| ��d S )Nrr c S s
| d S )Nr rw )�xrw rw rx ry u
s z Or.parseImpl.<locals>.<lambda>)r� z no defined alternatives to matchrs ) r3 r� r r8 r� r� r� ra r� �sortrt r� ) r� r- r� ro � maxExcLoc� maxExceptionr� r� Zloc2r� �_rw rw rx r� `
s<
z Or.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ixor__�
s
z Or.__ixor__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r; z ^ c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z Or.__str__.<locals>.<genexpr>r< )r� r� rU r� r3 )r� rw rw rx r� �
s
z
Or.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r3 r� )r� r� r: r� rw rw rx r� �
s zOr.checkRecursion)F)T)
r� r� r� r� r� r� rB r� r� r� rw rw )rH rx r K
s
& c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the first one listed is the one that will match.
May be constructed using the C{'|'} operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� �
s z&MatchFirst.__init__.<locals>.<genexpr>T)r� r r� r3 r r[ )r� r3 rg )rH rw rx r� �
s zMatchFirst.__init__Tc C s� d}d }x�| j D ]�}y|j|||�}|S tk
r\ } z|j|krL|}|j}W Y d d }~X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX qW |d k r�| j|_|�nt||d| ��d S )Nrr z no defined alternatives to matchrs )r3 rt r r� r� r� ra r� ) r� r- r� ro r? r@ r� r� r� rw rw rx r� �
s$
zMatchFirst.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ior__�
s
zMatchFirst.__ior__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r; z | c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z%MatchFirst.__str__.<locals>.<genexpr>r< )r� r� rU r� r3 )r� rw rw rx r� �
s
zMatchFirst.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r3 r� )r� r� r: r� rw rw rx r� �
s zMatchFirst.checkRecursion)F)T)
r� r� r� r� r� r� rC r� r� r� rw rw )rH rx r �
s
c s< e Zd ZdZd � fdd� Zd dd�Zdd� Zd d
� Z� ZS )
r am
Requires all given C{ParseExpression}s to be found, but in any order.
Expressions may be separated by whitespace.
May be constructed using the C{'&'} operator.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
Tc s8 t t| �j||� tdd� | jD ��| _d| _d| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� s z Each.__init__.<locals>.<genexpr>T)r� r r� r5 r3 r[ rX �initExprGroups)r� r3 rg )rH rw rx r� s z
Each.__init__c
s� | j r�tdd� | jD ��| _dd� | jD �}dd� | jD �}|| | _dd� | jD �| _dd� | jD �| _dd� | jD �| _| j| j7 _d | _ |}| jd d � }| jd d � � g }d
} x�| �rp|� | j | j }
g } x~|
D ]v} y| j||�}W n t k
�r | j
| � Y q�X |j
| jj t | �| �� | |k�rD|j
| � q�| � kr� j
| � q�W t| �t|
�kr�d } q�W |�r�d jd d� |D ��}
t ||d
|
��|� fdd�| jD �7 }g }x*|D ]"} | j|||�\}}|j
|� �q�W t|tg ��}||fS )Nc s s& | ] }t |t�rt|j�|fV qd S )N)rz r r� r. )r� r� rw rw rx r� s z!Each.parseImpl.<locals>.<genexpr>c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� s z"Each.parseImpl.<locals>.<listcomp>c S s" g | ]}|j rt|t� r|�qS rw )r[ rz r )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r2 r. )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� ! s c S s g | ]}t |tttf�s|�qS rw )rz r r2 r )r� r� rw rw rx r� " s FTz, c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� = s z*Missing one or more required elements (%s)c s$ g | ] }t |t�r|j� kr|�qS rw )rz r r. )r� r� )�tmpOptrw rx r� A s )rD r� r3 Zopt1mapZ optionalsZmultioptionalsZ
multirequiredZrequiredr� r r� r� r� �remover� r� rt �sumr" )r� r- r� ro Zopt1Zopt2ZtmpLocZtmpReqdZ
matchOrderZ keepMatchingZtmpExprsZfailedr� Zmissingr9 r� Z finalResultsrw )rE rx r� sP
zEach.parseImplc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r; z & c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� P s z Each.__str__.<locals>.<genexpr>r< )r� r� rU r� r3 )r� rw rw rx r� K s
z Each.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r3 r� )r� r� r: r� rw rw rx r� T s zEach.checkRecursion)T)T) r� r� r� r� r� r� r� r� r� rw rw )rH rx r �
s
5
1 c sl e Zd ZdZd� fdd� Zddd�Zdd � Z� fd
d �Z� fd d
�Zdd� Z g fdd�Z
� fdd�Z � Z S )r za
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r@ttjt�r2tj|�}ntjt |��}|| _
d | _ |d k r�|j | _ |j
| _
| j|j� |j| _|j| _|j| _| jj|j� d S )N)r� r r� rz r� �
issubclassr$ rQ r, r r. rU r` r[ r� rY rX rW re r] r� )r� r. rg )rH rw rx r� ^ s
z ParseElementEnhance.__init__Tc C s2 | j d k r | j j|||dd�S td|| j| ��d S )NF)rp r� )r. rt r ra )r� r- r� ro rw rw rx r� p s
z ParseElementEnhance.parseImplc C s* d| _ | jj� | _| jd k r&| jj� | S )NF)rX r. r� r� )r� rw rw rx r� v s
z#ParseElementEnhance.leaveWhitespacec sr t |t�rB|| jkrntt| �j|� | jd k rn| jj| jd � n,tt| �j|� | jd k rn| jj| jd � | S )Nrr rs rs )rz r+ r] r� r r� r. )r� r� )rH rw rx r� } s
zParseElementEnhance.ignorec s& t t| �j� | jd k r"| jj� | S )N)r� r r� r. )r� )rH rw rx r� � s
z ParseElementEnhance.streamlinec C sB | |krt || g ��|d d � | g }| jd k r>| jj|� d S )N)r& r. r� )r� r� r: rw rw rx r� � s
z"ParseElementEnhance.checkRecursionc C s6 |d d � | g }| j d k r(| j j|� | jg � d S )N)r. r� r� )r� r� r6 rw rw rx r� � s
z ParseElementEnhance.validatec sV yt t| �j� S tk
r" Y nX | jd krP| jd k rPd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU r. rH r� r� )r� )rH rw rx r� � s zParseElementEnhance.__str__)F)T)
r� r� r� r� r� r� r� r� r� r� r� r� r� rw rw )rH rx r Z s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
c s t t| �j|� d| _d S )NT)r� r r� r[ )r� r. )rH rw rx r� � s zFollowedBy.__init__Tc C s | j j||� |g fS )N)r. r� )r� r- r� ro rw rw rx r� � s zFollowedBy.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s2 e Zd ZdZ� fdd�Zd dd�Zdd� Z� ZS )
r a�
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
c s0 t t| �j|� d| _d| _dt| j� | _d S )NFTzFound unwanted token, )r� r r� rX r[ r� r. ra )r� r. )rH rw rx r� � s zNotAny.__init__Tc C s& | j j||�r t||| j| ��|g fS )N)r. r� r ra )r� r- r� ro rw rw rx r� � s zNotAny.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� z~{r< )r� r� rU r� r. )r� rw rw rx r� � s
zNotAny.__str__)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd Zd� fdd� Zddd�Z� ZS ) �_MultipleMatchNc sF t t| �j|� d| _|}t|t�r.tj|�}|d k r<| nd | _d S )NT) r� rI r� rW rz r� r$ rQ � not_ender)r� r. �stopOnZender)rH rw rx r� � s
z_MultipleMatch.__init__Tc C s� | j j}| j}| jd k }|r$| jj}|r2|||� ||||dd�\}}yZ| j } xJ|rb|||� | rr|||�}
n|}
|||
|�\}} | s�| j� rT|| 7 }qTW W n ttfk
r� Y nX ||fS )NF)rp ) r. rt r� rJ r� r] r� r r� ) r� r- r� ro Zself_expr_parseZself_skip_ignorablesZ check_enderZ
try_not_enderr� ZhasIgnoreExprsr� Z tmptokensrw rw rx r� � s,
z_MultipleMatch.parseImpl)N)T)r� r� r� r� r� r� rw rw )rH rx rI � s rI c @ s e Zd ZdZdd� ZdS )r a�
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
c C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r; z}...)r� r� rU r� r. )r� rw rw rx r� ! s
zOneOrMore.__str__N)r� r� r� r� r� rw rw rw rx r s c s8 e Zd ZdZd
� fdd� Zd � fdd� Zdd � Z� ZS ) r2 aw
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
Nc s t t| �j||d� d| _d S )N)rK T)r� r2 r� r[ )r� r. rK )rH rw rx r� 6 s zZeroOrMore.__init__Tc s6 yt t| �j|||�S ttfk
r0 |g fS X d S )N)r� r2 r� r r� )r� r- r� ro )rH rw rx r� : s zZeroOrMore.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r z]...)r� r� rU r� r. )r� rw rw rx r� @ s
zZeroOrMore.__str__)N)T)r� r� r� r� r� r� r� r� rw rw )rH rx r2 * s c @ s e Zd Zdd� ZeZdd� ZdS )�
_NullTokenc C s dS )NFrw )r� rw rw rx r� J s z_NullToken.__bool__c C s dS )Nr� rw )r� rw rw rx r� M s z_NullToken.__str__N)r� r� r� r� r' r� rw rw rw rx rL I s rL c s6 e Zd ZdZef� fdd� Zd dd�Zdd� Z� ZS )
r aa
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
c s. t t| �j|dd� | jj| _|| _d| _d S )NF)rg T)r� r r� r. rW r� r[ )r� r. r� )rH rw rx r� t s
zOptional.__init__Tc C sz y | j j|||dd�\}}W nT ttfk
rp | jtk rh| j jr^t| jg�}| j|| j j< ql| jg}ng }Y nX ||fS )NF)rp )r. rt r r� r� �_optionalNotMatchedrV r" )r� r- r� ro r� rw rw rx r� z s
zOptional.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r r )r� r� rU r� r. )r� rw rw rx r� � s
zOptional.__str__)T) r� r� r� r� rM r� r� r� r� rw rw )rH rx r Q s "
c s, e Zd ZdZd � fdd� Zd
dd�Z� ZS ) r( a�
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
FNc s` t t| �j|� || _d| _d| _|| _d| _t|t �rFt
j |�| _ n|| _ dt
| j� | _d S )NTFzNo match found for )r� r( r� �
ignoreExprr[ r` � includeMatchr� rz r� r$ rQ �failOnr� r. ra )r� r� �includer� rP )rH rw rx r� � s
zSkipTo.__init__Tc C s, |}t |�}| j}| jj}| jd k r,| jjnd }| jd k rB| jjnd } |}
x�|
|kr�|d k rh|||
�rhP | d k r�x*y| ||
�}
W qr tk
r� P Y qrX qrW y|||
ddd� W n tt fk
r� |
d7 }
Y qLX P qLW t||| j
| ��|
}|||� } t | �} | j �r$||||dd�\}}
| |
7 } || fS )NF)ro rp rr )rp )
r� r. rt rP r� rN r� r r r� ra r" rO )r� r- r� ro r0 r� r. Z
expr_parseZself_failOn_canParseNextZself_ignoreExpr_tryParseZtmplocZskiptextZ
skipresultr� rw rw rx r� � s<
zSkipTo.parseImpl)FNN)T)r� r� r� r� r� r� r� rw rw )rH rx r( � s 6
c sb e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Zd d � Zg fd
d�Z dd� Z
� fdd�Z � Z S )r aK
Forward declaration of an expression to be defined later -
used for recursive grammars, such as algebraic infix notation.
When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
Note: take care when assigning to C{Forward} not to overlook precedence of operators.
Specifically, '|' has a lower precedence than '<<', so that::
fwdExpr << a | b | c
will actually be evaluated as::
(fwdExpr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the C{Forward}::
fwdExpr << (a | b | c)
Converting to use the '<<=' operator instead will avoid this problem.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
Nc s t t| �j|dd� d S )NF)rg )r� r r� )r� r� )rH rw rx r� s zForward.__init__c C sj t |t�rtj|�}|| _d | _| jj| _| jj| _| j| jj � | jj
| _
| jj | _ | j j
| jj � | S )N)rz r� r$ rQ r. rU r` r[ r� rY rX rW r] r� )r� r� rw rw rx �
__lshift__ s
zForward.__lshift__c C s | |> S )Nrw )r� r� rw rw rx � __ilshift__' s zForward.__ilshift__c C s
d| _ | S )NF)rX )r� rw rw rx r� * s zForward.leaveWhitespacec C s$ | j s d| _ | jd k r | jj� | S )NT)r_ r. r� )r� rw rw rx r� . s
zForward.streamlinec C s> | |kr0|d d � | g }| j d k r0| j j|� | jg � d S )N)r. r� r� )r� r� r6 rw rw rx r� 5 s
zForward.validatec C s> t | d�r| jS | jjd S d}W d | j| _X | jjd | S )Nr� z: ...�Nonez: )r� r� rH r� Z _revertClass�_ForwardNoRecurser. r� )r� Z retStringrw rw rx r� < s
zForward.__str__c s. | j d k rtt| �j� S t� }|| K }|S d S )N)r. r� r r� )r� r� )rH rw rx r� M s
z Forward.copy)N)
r� r� r� r� r� rR rS r� r� r� r� r� r� rw rw )rH rx r s
c @ s e Zd Zdd� ZdS )rU c C s dS )Nz...rw )r� rw rw rx r� V s z_ForwardNoRecurse.__str__N)r� r� r� r� rw rw rw rx rU U s rU c s" e Zd ZdZd� fdd� Z� ZS )r- zQ
Abstract subclass of C{ParseExpression}, for converting parsed results.
Fc s t t| �j|� d| _d S )NF)r� r- r� rW )r� r. rg )rH rw rx r� ] s zTokenConverter.__init__)F)r� r� r� r� r� r� rw rw )rH rx r- Y s c s6 e Zd ZdZd
� fdd� Z� fdd�Zdd � Z� ZS ) r
a�
Converter to concatenate all matching tokens to a single string.
By default, the matching patterns must also be contiguous in the input string;
this can be disabled by specifying C{'adjacent=False'} in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
r� Tc s8 t t| �j|� |r | j� || _d| _|| _d| _d S )NT)r� r
r� r� �adjacentrX �
joinStringre )r� r. rW rV )rH rw rx r� r s zCombine.__init__c s( | j rtj| |� ntt| �j|� | S )N)rV r$ r� r� r
)r� r� )rH rw rx r� | s zCombine.ignorec C sP |j � }|d d �= |tdj|j| j��g| jd�7 }| jrH|j� rH|gS |S d S )Nr� )r� )r� r" r� r
rW rb rV r� )r� r- r� r� ZretToksrw rw rx r� � s
"zCombine.postParse)r� T)r� r� r� r� r� r� r� r� rw rw )rH rx r
a s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r a�
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s zGroup.__init__c C s |gS )Nrw )r� r- r� r� rw rw rx r� � s zGroup.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r aW
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s z
Dict.__init__c C s� x�t |�D ]�\}}t|�dkr q
|d }t|t�rBt|d �j� }t|�dkr^td|�||< q
t|�dkr�t|d t� r�t|d |�||< q
|j� }|d= t|�dks�t|t�r�|j � r�t||�||< q
t|d |�||< q
W | j
r�|gS |S d S )Nr rr r� rq ) r� r� rz ru r� r� r� r" r� r� rV )r� r- r� r� r� �tokZikeyZ dictvaluerw rw rx r� � s$
zDict.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s # c @ s e Zd ZdZdd� Zdd� ZdS )r+ aV
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
c C s g S )Nrw )r� r- r� r� rw rw rx r� � s zSuppress.postParsec C s | S )Nrw )r� rw rw rx r� � s zSuppress.suppressN)r� r� r� r� r� r� rw rw rw rx r+ � s c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) r zI
Wrapper for parse actions, to ensure they are only called once.
c C s t |�| _d| _d S )NF)rM �callable�called)r� Z
methodCallrw rw rx r� s
zOnlyOnce.__init__c C s. | j s | j|||�}d| _ |S t||d��d S )NTr� )rZ rY r )r� r� r5 rv r� rw rw rx r� s
zOnlyOnce.__call__c C s
d| _ d S )NF)rZ )r� rw rw rx �reset
s zOnlyOnce.resetN)r� r� r� r� r� r� r[ rw rw rw rx r � s c s: t � �� � fdd�}y � j|_W n tk
r4 Y nX |S )as
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
c s� � j }| dd � \}}}t| �dkr8| d jj d | }tjjd|t||�||f � y � | � }W n8 tk
r� } z tjjd||f � � W Y d d }~X nX tjjd||f � |S )Nro r �.z">>entering %s(line: '%s', %d, %r)
z <<leaving %s (exception: %s)
z<<leaving %s (ret: %r)
r9 )r� r� rH r~ �stderr�writerG rK )ZpaArgsZthisFuncr� r5 rv r� r3 )r� rw rx �z# s ztraceParseAction.<locals>.z)rM r� r� )r� r_ rw )r� rx rb
s
�,Fc C s` t | �d t |� d t | � d }|rBt| t|| � �j|�S | tt|�| � j|�S dS )a�
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
z [r� z]...N)r� r
r2 ri r+ )r. Zdelim�combineZdlNamerw rw rx r@ 9 s
$c sj t � � � �fdd�}|dkr0tt�jdd� �}n|j� }|jd� |j|dd� |� jd t�� d
�S ) a:
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
c s. |d }� |r t t�g| ��p&t t�> g S )Nr )r r rC )r� r5 rv r� )� arrayExprr. rw rx �countFieldParseAction_ s "z+countedArray.<locals>.countFieldParseActionNc S s t | d �S )Nr )ru )rv rw rw rx ry d s z countedArray.<locals>.<lambda>ZarrayLenT)rf z(len) z...)r r/ rR r� r� ri rx r� )r. ZintExprrc rw )rb r. rx r< L s
c C s: g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W |S )N)rz r� r� r� r� )�Lr� r� rw rw rx r� k s
r� c s6 t � � � fdd�}| j|dd� � jdt| � � � S )a*
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
c sP |rBt |�dkr � |d > qLt|j� �}� tdd� |D ��> n
� t� > d S )Nrr r c s s | ]}t |�V qd S )N)r )r� �ttrw rw rx r� � s zDmatchPreviousLiteral.<locals>.copyTokenToRepeater.<locals>.<genexpr>)r� r� r� r r
)r� r5 rv Ztflat)�reprw rx �copyTokenToRepeater� s z1matchPreviousLiteral.<locals>.copyTokenToRepeaterT)rf z(prev) )r rx ri r� )r. rg rw )rf rx rO t s
c sF t � � | j� }� |K � � fdd�}| j|dd� � jdt| � � � S )aS
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
c s* t |j� �� � fdd�}�j|dd� d S )Nc s$ t |j� �}|� kr tddd��d S )Nr� r )r� r� r )r� r5 rv Z theseTokens)� matchTokensrw rx �mustMatchTheseTokens� s zLmatchPreviousExpr.<locals>.copyTokenToRepeater.<locals>.mustMatchTheseTokensT)rf )r� r� r� )r� r5 rv ri )rf )rh rx rg � s z.matchPreviousExpr.<locals>.copyTokenToRepeaterT)rf z(prev) )r r� rx ri r� )r. Ze2rg rw )rf rx rN � s c C s> x dD ]}| j |t| �} qW | j dd�} | j dd�} t| �S )Nz\^-]r z\nr' z\t)r� �_bslashr� )r� r� rw rw rx r � s
r Tc
s� |rdd� }dd� }t � ndd� }dd� }t� g }t| t�rF| j� }n&t| tj�r\t| �}ntj dt
dd� |svt � S d }x�|t |�d
k �r|| }xnt
||d
d � �D ]N\}} || |�r�||| d
= P q�||| �r�||| d
= |j|| � | }P q�W |d
7 }q|W | �r�|�r�yht |�t d j|��k�rZtd
d jdd� |D �� �jdj|��S tdjdd� |D ���jdj|��S W n& tk
�r� tj dt
dd� Y nX t� fdd�|D ��jdj|��S )a�
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
c S s | j � |j � kS )N)r� )r �brw rw rx ry � s zoneOf.<locals>.<lambda>c S s |j � j| j � �S )N)r� r� )r rk rw rw rx ry � s c S s | |kS )Nrw )r rk rw rw rx ry � s c S s
|j | �S )N)r� )r rk rw rw rx ry � s z6Invalid argument to oneOf, expected string or iterablerq )r� r rr Nr� z[%s]c s s | ]}t |�V qd S )N)r )r� �symrw rw rx r� � s zoneOf.<locals>.<genexpr>z | �|c s s | ]}t j|�V qd S )N)rd r )r� rl rw rw rx r� � s z7Exception creating Regex for oneOf, building MatchFirstc 3 s | ]}� |�V qd S )Nrw )r� rl )�parseElementClassrw rx r� � s )r r rz r� r� r� r4 r� r� r� r� r r� r� r� r� r' ri rK r )
Zstrsr� ZuseRegexZisequalZmasksZsymbolsr� Zcurr� r� rw )rn rx rS � sL
((c C s t tt| | ���S )a�
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
)r r2 r )r� r� rw rw rx rA � s !c C s^ t � jdd� �}|j� }d|_|d�| |d� }|r@dd� }ndd� }|j|� | j|_|S ) a�
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
c S s |S )Nrw )r� r� rv rw rw rx ry 8 s z!originalTextFor.<locals>.<lambda>F�_original_start�
_original_endc S s | |j |j� S )N)ro rp )r� r5 rv rw rw rx ry = s c S s& | |j d�|j d�� g|d d �< d S )Nro rp )r� )r� r5 rv rw rw rx � extractText? s z$originalTextFor.<locals>.extractText)r
r� r� re r] )r. ZasStringZ locMarkerZ endlocMarker� matchExprrq rw rw rx rg s
c C s t | �jdd� �S )zp
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
c S s | d S )Nr rw )rv rw rw rx ry J s zungroup.<locals>.<lambda>)r- r� )r. rw rw rx rh E s c C s4 t � jdd� �}t|d�| d� |j� j� d� �S )a�
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
c S s |S )Nrw )r� r5 rv rw rw rx ry ` s z locatedExpr.<locals>.<lambda>Z
locn_startr� Zlocn_end)r
r� r r� r� )r. Zlocatorrw rw rx rj L s z\[]-*.$+^?()~ )r c C s |d d S )Nr rr rw )r� r5 rv rw rw rx ry k s ry z\\0?[xX][0-9a-fA-F]+c C s t t|d jd�d��S )Nr z\0x� )�unichrru �lstrip)r� r5 rv rw rw rx ry l s z \\0[0-7]+c C s t t|d dd � d��S )Nr rr � )rt ru )r� r5 rv rw rw rx ry m s z\])r� r z\wr7 r r� Znegate�bodyr c sB dd� � y dj � fdd�tj| �jD ��S tk
r< dS X dS )a�
Helper to easily define string ranges for use in Word construction. Borrows
syntax from regexp '[]' string range definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string is the expanded
character set joined into a single string.
The values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
c S s< t | t�s| S djdd� tt| d �t| d �d �D ��S )Nr� c s s | ]}t |�V qd S )N)rt )r� r� rw rw rx r� � s z+srange.<locals>.<lambda>.<locals>.<genexpr>r rr )rz r" r� r� �ord)�prw rw rx ry � s zsrange.<locals>.<lambda>r� c 3 s | ]}� |�V qd S )Nrw )r� �part)� _expandedrw rx r� � s zsrange.<locals>.<genexpr>N)r� �_reBracketExprr� rw rK )r� rw )r{ rx r_ r s
c s � fdd�}|S )zt
Helper method for defining parse actions that require matching at a specific
column in the input text.
c s" t || �� kr t| |d� ��d S )Nz matched token not at column %d)r9 r )r) Zlocnr1 )r� rw rx � verifyCol� s z!matchOnlyAtCol.<locals>.verifyColrw )r� r} rw )r� rx rM � s c s � fdd�S )a�
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
c s � gS )Nrw )r� r5 rv )�replStrrw rx ry � s z replaceWith.<locals>.<lambda>rw )r~ rw )r~ rx r\ � s c C s |d dd� S )a
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
r rr rs rw )r� r5 rv rw rw rx rZ � s c sN � �fdd�}yt �dt �d�j�}W n tk
rB t��}Y nX ||_|S )aG
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
c s � �fdd�|D �S )Nc s g | ]}�|f� �� �qS rw rw )r� Ztokn)r� r6 rw rx r� � s z(tokenMap.<locals>.pa.<locals>.<listcomp>rw )r� r5 rv )r� r6 rw rx r} � s ztokenMap.<locals>.par� rH )rJ r� rK r{ )r6 r� r} rL rw )r� r6 rx rm � s c C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� �lower)rv rw rw rx ry � s c C s� t | t�r | }t| | d�} n| j}tttd �}|r�tj� j t
�}t d�| d� t t
t|t d� | ��� tddgd�jd �j d
d � � t d � }n�d
jdd� tD ��}tj� j t
�t|�B }t d�| d� t t
t|j t�tt d�| � ��� tddgd�jd �j dd � � t d � }ttd�| d �}|jdd
j|jdd�j� j� � �jd| �}|jdd
j|jdd�j� j� � �jd| �}||_||_||fS )zRInternal helper to construct opening and closing tag expressions, given a tag name)r� z_-:r �tag�=�/F)r� rC c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z_makeTags.<locals>.<lambda>r r� c s s | ]}|d kr|V qdS )r Nrw )r� r� rw rw rx r� � s z _makeTags.<locals>.<genexpr>c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z</r� �:r� z<%s>r
z</%s>) rz r� r r� r/ r4 r3 r> r� r� rZ r+ r r2 r r rm r� rV rY rB r
�_Lr� �titler� ri r� )�tagStrZxmlZresnameZ tagAttrNameZ tagAttrValueZopenTagZprintablesLessRAbrackZcloseTagrw rw rx � _makeTags� s"
T\..r� c C s
t | d�S )a
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
F)r� )r� rw rw rx rK � s c C s
t | d�S )z�
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
T)r� )r� rw rw rx rL s c s8 | r| dd� � n|j � � dd� � D �� � fdd�}|S )a<
Helper to create a validating parse action to be used with start tags created
with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
with a required attribute value, to avoid false matches on common tags such as
C{<TD>} or C{<DIV>}.
Call C{withAttribute} with a series of attribute names and values. Specify the list
of filter attributes names and values as:
- keyword arguments, as in C{(align="right")}, or
- as an explicit dict with C{**} operator, when an attribute name is also a Python
reserved word, as in C{**{"class":"Customer", "align":"right"}}
- a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
For attribute names with a namespace prefix, you must use the second form. Attribute
names are matched insensitive to upper/lower case.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
Nc S s g | ]\}}||f�qS rw rw )r� r� r� rw rw rx r� Q s z!withAttribute.<locals>.<listcomp>c s^ xX� D ]P\}}||kr&t | |d| ��|tjkr|| |krt | |d||| |f ��qW d S )Nzno matching attribute z+attribute '%s' has value '%s', must be '%s')r re � ANY_VALUE)r� r5 r� ZattrNameZ attrValue)�attrsrw rx r} R s zwithAttribute.<locals>.pa)r� )r� ZattrDictr} rw )r� rx re s 2 c C s |r d| nd}t f || i�S )a�
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
z%s:class�class)re )Z classname� namespaceZ classattrrw rw rx rk \ s �(r c C s� t � }| || | B }�x`t|�D �]R\}}|d dd� \}} }
} | dk rTd| nd| } | dkr�|dksxt|�dkr�td��|\}
}t � j| �}|
tjk�rd| dkr�t|| �t|t |� � }n�| dk�r |dk �r t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�rZt||
| | | �t||
| | | � }ntd ��n�|
tj
k�rH| dk�r�t |t ��s�t |�}t|j
| �t|| � }n�| dk�r|dk �r�t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�r>t||
| | | �t||
| | | � }ntd ��ntd
��| �r`|j| � ||j| �|B K }|}q"W ||K }|S ) a�
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
Nr ro z%s termz %s%s termrq z@if numterms=3, opExpr must be a tuple or list of two expressionsrr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)N)r r� r� r� ri rT �LEFTr r r �RIGHTrz r r. r� )ZbaseExprZopListZlparZrparr� ZlastExprr� ZoperDefZopExprZarityZrightLeftAssocr} ZtermNameZopExpr1ZopExpr2ZthisExprrr rw rw rx ri � sR ;
&
&
z4"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�"z string enclosed in double quotesz4'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�'z string enclosed in single quotesz*quotedString using single or double quotes�uzunicode string literalc C s� | |krt d��|dk�r(t| t�o,t|t��r t| �dkr�t|�dkr�|dk r�tt| t| | tj dd� ��j dd� �}n$t
j � t| | tj �j dd� � }nx|dk r�tt| t | � t |� ttjdd� ��j dd� �}n4ttt | � t |� ttjdd� ��j d d� �}nt d
��t
� }|dk �rb|tt| �t||B |B � t|� �K }n$|tt| �t||B � t|� �K }|jd | |f � |S ) a~
Helper method for defining nested lists enclosed in opening and closing
delimiters ("(" and ")" are the default).
Parameters:
- opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
z.opening and closing strings cannot be the sameNrr )r c S s | d j � S )Nr )r� )rv rw rw rx ry 9 s z nestedExpr.<locals>.<lambda>c S s | d j � S )Nr )r� )rv rw rw rx ry < s c S s | d j � S )Nr )r� )rv rw rw rx ry B s c S s | d j � S )Nr )r� )rv rw rw rx ry F s zOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)r� rz r� r� r
r r r$ rN r� rC r� r r r r+ r2 ri )�openerZcloserZcontentrN r� rw rw rx rP � s4 :
*$c s� � fdd�}� fdd�}� fdd�}t t� jd�j� �}t� t� j|� jd�}t� j|�jd �}t� j|�jd
�} |r�tt|�| t |t| � t|� � | �}
n$tt|�t |t| � t|� � �}
| j t
t� � |
jd �S ) a
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
c sN |t | �krd S t|| �}|� d krJ|� d kr>t| |d��t| |d��d S )Nrr zillegal nestingznot a peer entryrs rs )r� r9 r! r )r� r5 rv �curCol)� indentStackrw rx �checkPeerIndent� s
z&indentedBlock.<locals>.checkPeerIndentc s2 t || �}|� d kr"� j|� n t| |d��d S )Nrr znot a subentryrs )r9 r� r )r� r5 rv r� )r� rw rx �checkSubIndent� s
z%indentedBlock.<locals>.checkSubIndentc sN |t | �krd S t|| �}� o4|� d k o4|� d ksBt| |d��� j� d S )Nrr rq znot an unindentrs r: )r� r9 r r� )r� r5 rv r� )r� rw rx �
checkUnindent� s
z$indentedBlock.<locals>.checkUnindentz �INDENTr� ZUNINDENTzindented block) r r r� r� r
r� ri r r r� rj ) ZblockStatementExprr� r r� r� r� r! r� ZPEERZUNDENTZsmExprrw )r� rx rf Q s N , z#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]z_:zany tagzgt lt amp nbsp quot aposz><& "'z &(?P<entity>rm z);zcommon HTML entityc C s t j| j�S )zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMapr� Zentity)rv rw rw rx r[ � s z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style comment)r� z � commaItem)r� c @ s� e Zd ZdZee�Zee�Ze e
�j d�j e�Z
e e�j d�j eed��Zed�j d�j e�Ze� j e�d e� j e� j d�Zejd d
� � eeeed �j� e � B j d �Zeje� ed
�j d�j e�Zed�j d�j e�ZeeB eB j� Zed�j d�j e�Z e e d e d �j d�Z ed�j d�Z ed�j d�Z!e!de! d j d�Z"ee!de! d> �d ee!de! d? � j d �Z#e#j$d d
� � d!e j d"�Z%e&e"e%B e#B j d#��j d#�Z'ed$�j d%�Z(e)d@d'd(��Z*e)dAd*d+��Z+ed,�j d-�Z,ed.�j d/�Z-ed0�j d1�Z.e/j� e0j� B Z1e)d2d3� �Z2e&e3e4d4� e5� e e6d4d5� ee7d6�� ��j� j d7�Z8e9ee:j;� e8B d8d9��j d:�Z<e)ed;d
� ��Z=e)ed<d
� ��Z>d=S )Brn a�
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
�integerz hex integerrs z[+-]?\d+zsigned integerr� �fractionc C s | d | d S )Nr rr rs rw )rv rw rw rx ry � s zpyparsing_common.<lambda>r7 z"fraction or mixed integer-fractionz
[+-]?\d+\.\d*z real numberz+[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)z$real number with scientific notationz [+-]?\d+\.?\d*([eE][+-]?\d+)?�fnumberrA �
identifierzK(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}z IPv4 addressz[0-9a-fA-F]{1,4}� hex_integerr� � zfull IPv6 addressr rB z::zshort IPv6 addressc C s t dd� | D ��dk S )Nc s s | ]}t jj|�rd V qdS )rr N)rn �
_ipv6_partr� )r� re rw rw rx r� � s z,pyparsing_common.<lambda>.<locals>.<genexpr>rv )rG )rv rw rw rx ry � s z::ffff:zmixed IPv6 addressz IPv6 addressz:[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}z MAC address�%Y-%m-%dc s � fdd�}|S )a�
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
c sL yt j|d � �j� S tk
rF } zt| |t|���W Y d d }~X nX d S )Nr )r �strptimeZdater� r r{ )r� r5 rv �ve)�fmtrw rx �cvt_fn� s z.pyparsing_common.convertToDate.<locals>.cvt_fnrw )r� r� rw )r� rx �
convertToDate� s z pyparsing_common.convertToDate�%Y-%m-%dT%H:%M:%S.%fc s � fdd�}|S )a
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
c sH yt j|d � �S tk
rB } zt| |t|���W Y d d }~X nX d S )Nr )r r� r� r r{ )r� r5 rv r� )r� rw rx r� � s z2pyparsing_common.convertToDatetime.<locals>.cvt_fnrw )r� r� rw )r� rx �convertToDatetime� s z"pyparsing_common.convertToDatetimez7(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?z ISO8601 datez�(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?zISO8601 datetimez2[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}�UUIDc C s t jj|d �S )a
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
r )rn �_html_stripperr� )r� r5 r� rw rw rx �
stripHTMLTags� s
z pyparsing_common.stripHTMLTagsr` )r� z r� r� )r� zcomma separated listc C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� r )rv rw rw rx ry � s N)r rB )r rB )r� )r� )?r� r� r� r� rm ru ZconvertToInteger�floatZconvertToFloatr/ rR ri r� r� rD r� r' Zsigned_integerr� rx r r� Z
mixed_integerrG �realZsci_realr� �numberr� r4 r3 r� Z ipv4_addressr� Z_full_ipv6_addressZ_short_ipv6_addressr~ Z_mixed_ipv6_addressr
Z ipv6_addressZ mac_addressr� r� r� Z iso8601_dateZiso8601_datetime�uuidr7 r6 r� r� r r r rV r. �
_commasepitemr@ rY r� Zcomma_separated_listrd rB rw rw rw rx rn � sN ""
2 8 �__main__Zselect�fromz_$r\ )ra �columnsrj ZtablesZcommandaK
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
z]
100
-100
+100
3.14159
6.02e23
1e-12
z
100
FF
z6
12345678-1234-5678-1234-567812345678
)rq )r` F)N)FT)T)r� )T)�r� � __version__Z__versionTime__�
__author__r� �weakrefr r� r� r~ r� rd r r� r" r< r� r �_threadr � ImportErrorZ threadingr r� Z ordereddict�__all__r� � version_infor; r �maxsizer� r{ r� �chrrt r� rG r� r �reversedr� r� r r5 r
r rI ZmaxintZxranger� Z __builtin__r� Zfnamer� rJ r� r� r� r� r� r� Zascii_uppercaseZascii_lowercaser4 rR rD r3 rj r� Z printablerV rK r r r! r# r& r� r" �MutableMapping�registerr9 rJ rG r/ r2 r4 rQ rM r$ r, r
r r r� rQ r r r rl r/ r' r% r r. r/ r r r r* r) r1 r0 r r r r r r r r rI r r2 rL rM r r( r rU r- r
r r r+ r rb r@ r< r� rO rN r rS rA rg rh rj ri rC rI rH ra r` r� Z _escapedPuncZ_escapedHexCharZ_escapedOctChar�UNICODEZ _singleCharZ
_charRangerm r| r_ rM r\ rZ rm rd rB r� rK rL re r� rk rT r� r� ri rU r> r^ rY rc rP rf r5 rW r7 r6 r� r� r� r� r; r[ r8 rE r� r] r? r= rF rX r� r� r: rn r� Z selectTokenZ fromTokenZidentZ
columnNameZcolumnNameListZ
columnSpecZ tableNameZ
tableNameListZ simpleSQLr� r� r� r� r� r� rw rw rw rx �<module>= s�
8
@ d &A= I
G3 pLOD|M &# @sQ,A, I# % &0
, ? #k Zr
(
0
" __pycache__/decorator.cpython-36.opt-1.pyc 0000644 00000030070 14751155147 0014335 0 ustar 00 3
5*[Z�@ � @ s� d Z ddlmZ ddlZddlZddlZddlZddlZddlZdZ ej
dkrdddlm Z dd� Z n ej
d d
�Zd d � Z d
d� Z y
ejZW n ek
r� dd� ZY nX ej
dd�Zdd� Zejd�ZG dd� de�Zf fdd�Zd*dd�ZyddlmZ W n" ek
�r dd lm Z Y nX G d d � d e�Z e ej �Z e e j!�Z"e"d k�rhe j# �rhd d!� Z e e _ n,e"d k�r|e j#�r|ne"d"k�r�d#d!� Z e e _ ee �Z$d$d%� Z%d&d'� Z&d(d)� Z'dS )+zT
Decorator module, see http://pypi.python.org/pypi/decorator
for the documentation.
� )�print_functionNz4.2.1�3)�getfullargspecc C s | j S )N)�__init__)�cls� r � /usr/lib/python3.6/decorator.py�get_init0 s r � FullArgSpecz5args varargs varkw defaults kwonlyargs kwonlydefaultsc C s t jtj| �g df �S )z?A quick and dirty replacement for getfullargspec for Python 2.XN)r
�_make�inspect�
getargspec)�fr r r r 7 s r c C s | j jS )N)r �__func__)r r r r r ; s c C s dS )NFr )r r r r �iscoroutinefunctionB s r �ArgSpeczargs varargs varkw defaultsc C s t | �}t|j|j|j|j�S )z$A replacement for inspect.getargspec)r r �args�varargs�varkw�defaults)r �specr r r r
J s r
z \s*def\s*([_\w][_\w\d]*)\s*\(c @ sZ e Zd ZdZej� Zf Z Z Z Z
Z Z d
dd�Z
dd� Zddd �Zedd d ��ZdS )�
FunctionMakerz�
An object with the ability to create functions with a given signature.
It has attributes name, doc, module, signature, defaults, dict and
methods update and make.
Nc C s� || _ |�rf|j| _| jdkr$d| _|j| _|j| _tj|��rft |�}t
|di �| _ x dD ]} t | | t
|| �� q\W x&t
| j�D ]\}
} t | d
|
| � q�W t| j�} t| j�}
| jr�| jd | j � |
jd | j � n| jr�| jd � x.| jD ]$} | jd | � |
jd
| | f � q�W | j�rB| jd| j � |
jd| j � dj| �| _dj|
�| _ |jj� | _|�rr|| _|d k �r�|| _|�r�|| _|�r�|| _|�r�|| _|�r�|| _t| d��s�td| ��d S )Nz<lambda>�_lambda_�__annotations__r r r r �
kwonlyargs�kwonlydefaultszarg%d�*z%s=Nonez%s=%sz**z, � signaturez%You are decorating a non function: %s)r r r r r r ) �shortsignature�__name__�name�__doc__�doc�
__module__�moduler �
isfunctionr �getattr� annotations�setattr� enumerater �listr �appendr r �joinr �__dict__�copy�dictr �hasattr� TypeError)�self�funcr r r r" r$ ZfuncdictZargspec�a�i�argZallargsZ allshortargsr r r r a sZ
zFunctionMaker.__init__c K s� | j |_t| dd�|_t| di �|_| j|_| jp4d|_t| dd�|_ yt
j d�}W n t k
rl d}Y nX |j
jdd�}t| d|�|_|jj|� dS ) z2Update the signature of func with the data in selfr" Nr/ r' � �?r r$ )r r r& r! r- r � __defaults__r �__kwdefaults__r �sys� _getframe�AttributeError� f_globals�getr# �update)r2 r3 �kw�frameZ callermoduler r r r@ � s
zFunctionMaker.updateFc
K s |t | � }|pi }tj|�}|dkr2td| ��|jd�}t|gdd� | jjd�D � �}x$|D ] } | dkrbtd | |f ��qbW |j d
�s�|d
7 }d t
| j �f }
yt ||
d �} t
| |� W n* td
tjd� t|tjd� � Y nX || } |�r ||d< | j| f|� | S )zBMake a new function from a given template and update the signatureNz not a valid function template
%s� c S s g | ]}|j d ��qS )z *)�strip)�.0r6 r r r �
<listcomp>� s z&FunctionMaker.make.<locals>.<listcomp>�,�_func_�_call_z%s is overridden in
%s�
z<decorator-gen-%d>ZsinglezError in generated code:)�fileZ
__source__)rH rI )�vars�DEF�search� SyntaxError�group�setr �split� NameError�endswith�next�_compile_count�compile�exec�printr; �stderrr@ )
r2 Z src_templ�evaldict� addsource�attrs�src�mor �names�n�filename�coder3 r r r �make� s4
zFunctionMaker.makeTc K s� t |t�r0|j� jdd�\} }
|
dd � } d} n d} d} |} | | | | |||�}
djdd� |j� D ��}|jd�}|r�t|�r�d| jd d
�}nd | }|
j |||f|�S )
z�
Create a function from the strings name, signature and body.
evaldict is the evaluation dictionary. If addsource is true an
attribute __source__ is added to the result. The attributes attrs
are added, if any.
�(rC NrJ c s s | ]}d | V qdS )z Nr )rE �liner r r � <genexpr>� s z'FunctionMaker.create.<locals>.<genexpr>rI z#async def %(name)s(%(signature)s):
�returnz return awaitz def %(name)s(%(signature)s):
���)
�
isinstance�strrD rR r, �
splitlinesr? r �replacerd )r �objZbodyr[ r r" r$ r\ r] r �restr r3 r2 Zibody�callerr r r �create� s
zFunctionMaker.create)NNNNNNN)NF)NNNT)r r# � __qualname__r! � itertools�countrV r r r r r r r r@ rd � classmethodrq r r r r r T s
3
" r c C sn t || d�}d}x0t|�D ]$\}}d| }|||< ||d 7 }qW tj| d| || d�}t| d�rj| j|_|S )zE
decorate(func, caller) decorates a function using a caller.
)rI rH � z_e%d_z, z,return _call_(_func_, %s%%(shortsignature)s))� __wrapped__rr )r/ r) r rq r0 rr ) r3 rp Zextrasr[ Zesr5 ZextraZexZfunr r r �decorate� s
rx c
C s |dk rt || �S df }}tj| �rB| jj� }d| j| jf }n~tj| �r�| jdkr\d}n| j}| j}| jj}t | j
pzf �}dj | jj || |� �}|r�|d7 }| j
}n| j
jj� }| jj}t| t d�}tjd ||f d
||f ||| j| d �} |�rd | | _
| S )
z=decorator(caller) converts a caller function into a decoratorNrv zHdecorator(%s) converts functions/generators into factories of %s objectsz<lambda>r z, rG )Z_callZ
_decorate_z %s(func, %s)zhif func is None: return lambda func: _decorate_(func, _call, (%s))
return _decorate_(func, _call, (%s)))r" r$ rw )N)rx r Zisclassr �lowerr% r! �__code__� co_argcount�lenr9 r, � co_varnames� __class__�__call__r/ r rq r# )
rp Z_funcZ defaultargsr r r" �nargsZndefsr[ �decr r r � decorator� s:
r� )�_GeneratorContextManager)�GeneratorContextManagerc @ s e Zd Zdd� ZdS )�ContextManagerc C s t j|dt| |d�|d�S )zContext manager decoratorz.with _self_: return _func_(%(shortsignature)s))Z_self_rH )rw )r rq r/ )r2 r3 r r r r # s zContextManager.__call__N)r r# rr r r r r r r� " s r� � c O s t j| |||��S )N)r� r )r2 �gr4 �kr r r r - s r � c O s t j| |||�S )N)r� r )r2 r� r4 r� r r r r 3 s c C s t | �S )N)�_contextmanager)r3 r r r �contextmanager: s r� c C sR d}x:t |�D ].\}}t|| �r&d}P t| |�r| ||< d}qW |rN|j| � dS )z_
Append ``a`` to the list of the virtual ancestors, unless it is already
included.
TFN)r) �
issubclassr+ )r4 �
vancestors�add�j�var r r r+ A s
r+ c s@ ddj �� �tjdf�fdd� � � ��fdd�}d� |_|S ) zr
Factory of decorators turning a function into a generic function
dispatching on the given arguments.
z(%s,)z, rv c s0 |t | �t � ��r,tdt � �t | �|f ��dS )z5Make sure one passes the expected number of argumentsz Expected %d arguments, got %d%sN)r| r1 )Z argumentsZwrong�msg)�
dispatch_argsr r �check[ s zdispatch_on.<locals>.checkc s� t t��j�}t ��|ks&td� ��i ����fdd����fdd�� ��fdd�}� �fdd �}� ��fd
d �}tj�d � t|d
�|���� |�d�
S )z4Decorator turning a function into a generic functionz Unknown dispatch arguments %sc sv � | � dd� t t���D �}xH�D ]@}x:t| ||�D ]*\}}}t||�r6||j� kr6t||� q6W q$W dd� |D �S )zU
Get a list of sets of virtual ancestors for the given types
c S s g | ]}g �qS r r )rE �_r r r rF p s zIdispatch_on.<locals>.gen_func_dec.<locals>.vancestors.<locals>.<listcomp>c S s g | ] }t |��qS r )rQ )rE �rar r r rF u s )�ranger| �zipr� �mror+ )�typesZras�types_�tZtype_r� )r� r� �typemapr r r� k s
z5dispatch_on.<locals>.gen_func_dec.<locals>.vancestorsc s� � | � g }x�t | �| � �D ]p\}}t|�}|dkrFtd||f ��n4|dkrr|\}td||fi �j� dd� }n|j� }|j|dd� � q W |S )zG
Get a list of virtual MROs, one for each type
rC z Ambiguous dispatch for %s: %sr� Nri )r� r| � RuntimeError�typer� r+ )r� Zlistsr� ZvasZn_vasr� r� )r� r� r r � ancestorsw s z4dispatch_on.<locals>.gen_func_dec.<locals>.ancestorsc s �� � ��� fdd�}|S )zU
Decorator to register an implementation for the given types
c s& � t | �jtjd| j � | ��< | S )Nz in )r r �operator�ltr )r )r� r� r� r r r� � s z@dispatch_on.<locals>.gen_func_dec.<locals>.register.<locals>.decr )r� r� )r� r� )r� r �register� s z3dispatch_on.<locals>.gen_func_dec.<locals>.registerc s@ �| � g }x.t j� | � � D ] }|jtdd� |D ��� q W |S )zI
An utility to introspect the dispatch algorithm
c s s | ] }|j V qd S )N)r )rE r4 r r r rg � s zKdispatch_on.<locals>.gen_func_dec.<locals>.dispatch_info.<locals>.<genexpr>)rs �productr+ �tuple)r� ZlstZanc)r� r� r r �
dispatch_info� s
z8dispatch_on.<locals>.gen_func_dec.<locals>.dispatch_infoc s� t dd� | D ��}y �| }W n tk
r2 Y n X |||�S tj� |� � }t|� x(|D ] }�j|�}|d k rZ|||�S qZW �||�S )Nc s s | ]}t |�V qd S )N)r� )rE r6 r r r rg � s zGdispatch_on.<locals>.gen_func_dec.<locals>._dispatch.<locals>.<genexpr>)r� �KeyErrorrs r� rU r? )r� r rA r� r � combinationsr� )r� r3 r� r r � _dispatch� s
z4dispatch_on.<locals>.gen_func_dec.<locals>._dispatchz#return _f_(%s, %%(shortsignature)s))Z_f_)r� �defaultr� r� r� r� rw )rQ r r rS r rq r/ )r3 Zargsetr� r� r� )r� r� � dispatch_str)r� r3 r� r� r � gen_func_deca s
z!dispatch_on.<locals>.gen_func_dec� dispatch_on)r, r� �ner )r� r� r )r� r� r� r r� S s
W
r� )N)(r! Z
__future__r �rer; r r� rs � collections� __version__�versionr r �
namedtupler
r r= r r
rW rM �objectr rx r� �
contextlibr� � ImportErrorr� r� r Zinitr| r Zn_argsr r� r� r+ r� r r r r �<module>! s\
&
__pycache__/configobj.cpython-36.opt-1.pyc 0000644 00000163135 14751155147 0014324 0 ustar 00 3
��S^ � @ sV d dl Z d dlZd dlZd dlmZmZmZmZ d dlZd dl m
Z
da edKedLedMedNiZ dddddddddddddddd�Z
eeeeed �Zd
d � Zd Zd
ZdZdZdZdZe� ZdOZd$Zd%Zd&Zd'd(d'd(d(dd'dddd(d(d)� Z d*d+� Z G d,d!� d!e �Z G d-d.� d.e�Z e � Z!d/d0� Z"G d1d� de#�Z$G d2d� de$�Z%G d3d� de$�Z&G d4d � d e'�Z(G d5d� de$�Z)G d6d� de$�Z*G d7d� de$�Z+G d8d � d e+�Z,G d9d � d e$�Z-G d:d � d e+�Z.G d;d � d e$�Z/G d<d=� d=e�Z0G d>d?� d?e0�Z1G d@dA� dAe0�Z2e1e2dB�Z3dCdD� Z4G dEdF� dFe5�Z6G dGd� de6�Z7G dHd� de�Z8dPdId"�Z9f fdJd#�Z:dS )Q� N)�BOM_UTF8� BOM_UTF16� BOM_UTF16_BE� BOM_UTF16_LE)� __version__�utf_8�utf16_be�utf_16�utf16_le)r �u16�utf16zutf-16r � utf_16_bezutf-16ber
� utf_16_lezutf-16ler �u8�utf�utf8zutf-8)r r r r
Nc C s t j| j� �dkS )Nr )�BOM_LIST�get�lower)�encoding� r � /usr/lib/python3.6/configobj.py�
match_utf8D s r z'%s'z"%s"z%sz
'"z"""%s"""z'''%s'''�DEFAULT_INDENT_TYPE�DEFAULT_INTERPOLATION�ConfigObjError� NestingError�
ParseError�DuplicateError�ConfigspecError� ConfigObj� SimpleVal�InterpolationError�InterpolationLoopError�MissingInterpolationOption�RepeatSectionError� ReloadError� UnreprError� UnknownType�flatten_errors�get_extra_values� configparserz �
TF) �
interpolation� raise_errors� list_values� create_empty�
file_error�
configspec� stringify� indent_typer �default_encoding�unrepr�write_empty_valuesc C s> t d krdd l a d| } t j| �}|j� d j� d j� d S )Nr za=� )�compiler�parse� getChildren)�s�pr r r �getObj� s
r> c @ s e Zd ZdS )r( N)�__name__�
__module__� __qualname__r r r r r( � s c @ s\ e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dS )�Builderc C s t d krt|jj��t |�S )N)�mr( � __class__r? )�self�or r r �build� s z
Builder.buildc C s t t| j|j� ��S )N)�list�maprG r; )rE rF r r r �
build_List� s zBuilder.build_Listc C s |j S )N)�value)rE rF r r r � build_Const� s zBuilder.build_Constc C s6 i }t t| j|j� ��}x|D ]}t|�||< q W |S )N)�iterrI rG r; �next)rE rF �d�iZelr r r �
build_Dict� s
zBuilder.build_Dictc C s t | j|��S )N)�tuplerJ )rE rF r r r � build_Tuple� s zBuilder.build_Tuplec C s6 |j dkrd S |j dkr dS |j dkr*dS td��d S )N�None�TrueT�FalseFzUndefined Name)�namer( )rE rF r r r �
build_Name� s
zBuilder.build_Namec C sh t t| j|j� ��\}}y t|�}W n tk
r@ td��Y nX t|t� sX|j dkr`td��|| S )NZAddg )
rH rI rL r; �float� TypeErrorr( �
isinstance�complex�real)rE rF r] �imagr r r � build_Add� s zBuilder.build_Addc C s | j |j�}t||j�S )N)rG �expr�getattrZattrname)rE rF �parentr r r �
build_Getattr� s zBuilder.build_Getattrc C s | j |j� d � S )Nr )rL r; )rE rF r r r �build_UnarySub� s zBuilder.build_UnarySubc C s | j |j� d �S )Nr )rL r; )rE rF r r r �build_UnaryAdd� s zBuilder.build_UnaryAddN)
r? r@ rA rG rJ rL rQ rS rX r_ rc rd re r r r r rB � s
rB c C s | s| S dd l }|j| �S )Nr )�astZ literal_eval)r< rf r r r r6 � s r6 c @ s e Zd ZdZddd�ZdS )r zk
This is the base class for all errors that ConfigObj raises.
It is a subclass of SyntaxError.
� Nc C s || _ || _tj| |� d S )N)�line� line_number� SyntaxError�__init__)rE �messageri rh r r r rk � s zConfigObjError.__init__)rg Nrg )r? r@ rA �__doc__rk r r r r r � s c @ s e Zd ZdZdS )r zE
This error indicates a level of nesting that doesn't match.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdS )r z�
This error indicates that a line is badly written.
It is neither a valid ``key = value`` line,
nor a valid section marker line.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdd� ZdS )r& zW
A 'reload' operation failed.
This exception is a subclass of ``IOError``.
c C s t j| d� d S )Nz#reload failed, filename is not set.)�IOErrorrk )rE r r r rk � s zReloadError.__init__N)r? r@ rA rm rk r r r r r& � s c @ s e Zd ZdZdS )r z:
The keyword or section specified already exists.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdS )r z7
An error occured whilst parsing a configspec.
N)r? r@ rA rm r r r r r � s c @ s e Zd ZdZdS )r" z,Base class for the two interpolation errors.N)r? r@ rA rm r r r r r" � s c @ s e Zd ZdZdd� ZdS )r# z=Maximum interpolation depth exceeded in string interpolation.c C s t j| d| � d S )Nz*interpolation loop detected in value "%s".)r" rk )rE �optionr r r rk s z InterpolationLoopError.__init__N)r? r@ rA rm rk r r r r r# s c @ s e Zd ZdZdS )r% zk
This error indicates additional sections in a section with a
``__many__`` (repeated) section.
N)r? r@ rA rm r r r r r% s c @ s e Zd ZdZdd� ZdS )r$ z0A value specified for interpolation was missing.c C s d| }t j| |� d S )Nz%missing option "%s" in interpolation.)r" rk )rE ro �msgr r r rk s z#MissingInterpolationOption.__init__N)r? r@ rA rm rk r r r r r$ s c @ s e Zd ZdZdS )r' z An error parsing in unrepr mode.N)r? r@ rA rm r r r r r' s c @ s> e Zd ZdZejd�ZdZdd� Zdd� Z dd � Z
d
d � Z d S )
�InterpolationEnginez�
A helper class to help perform string interpolation.
This class is an abstract base class; its descendants perform
the actual work.
z
%\(([^)]*)\)s�%c C s
|| _ d S )N)�section)rE rs r r r rk * s z InterpolationEngine.__init__c s0 �j |kr|S � �fdd�� � ||�ji �}|S )Nc s� | |j f|krt| ��d|| |j f< �jj|�}xz|r��j|�\}}}|dkrT|}n� ||||�}|j� \} }
dj|d| � |||
d� f�}| t|� } �jj|| �}q2W || |j f= |S )ax The function that does the actual work.
``value``: the string we're trying to interpolate.
``section``: the section in which that string was found
``backtrail``: a dict to keep track of where we've been,
to detect and prevent infinite recursion loops
This is similar to a depth-first-search algorithm.
r8 Nrg )rW r# �_KEYCRE�search� _parse_match�span�join�len) �keyrK rs Z backtrail�match�k�vr< Z replacement�start�endZnew_search_start)�recursive_interpolaterE r r r� 4 s z>InterpolationEngine.interpolate.<locals>.recursive_interpolate)�_cookiers )rE rz rK r )r� rE r � interpolate/ s
,z InterpolationEngine.interpolatec C s� | j jj}d| j j_| j }x^|j|�}|dk r<t|t� r<P |jdi �j|�}|dk rdt|t� rdP |j|krpP |j}q W || j j_|dkr�t|��||fS )z�Helper function to fetch values from owning section.
Returns a 2-tuple: the value, and the section where it was found.
FN�DEFAULT)rs �mainr- r r[ �Sectionrb r$ )rE rz Z save_interpZcurrent_section�valr r r �_fetchd s"
zInterpolationEngine._fetchc C s
t � �dS )a� Implementation-dependent helper function.
Will be passed a match object corresponding to the interpolation
key we just found (e.g., "%(foo)s" or "$foo"). Should look up that
key in the appropriate config file section (using the ``_fetch()``
helper function) and return a 3-tuple: (key, value, section)
``key`` is the name of the key we're looking for
``value`` is the value found for that key
``section`` is a reference to the section where it was found
``key`` and ``section`` should be None if no further
interpolation should be performed on the resulting value
(e.g., if we interpolated "$$" and returned "$").
N)�NotImplementedError)rE r{ r r r rv � s z InterpolationEngine._parse_matchN) r? r@ rA rm �re�compilert r� rk r� r� rv r r r r rq s
5"rq c @ s& e Zd ZdZdZejd�Zdd� ZdS )�ConfigParserInterpolationzBehaves like ConfigParser.rr z
%\(([^)]*)\)sc C s" |j d�}| j|�\}}|||fS )Nr8 )�groupr� )rE r{ rz rK rs r r r rv � s
z&ConfigParserInterpolation._parse_matchN) r? r@ rA rm r� r� r� rt rv r r r r r� � s
r� c @ s4 e Zd ZdZdZdZejdejej B �Z
dd� Z dS )�TemplateInterpolationz Behaves like string.Template.�$z�
\$(?:
(?P<escaped>\$) | # Two $ signs
(?P<named>[_a-z][_a-z0-9]*) | # $name format
{(?P<braced>[^}]*)} # ${name} format
)
c C s\ |j d�p|j d�}|d k r4| j|�\}}|||fS |j d�d k rNd | jd fS d |j � d fS )NZnamedZbracedZescaped)r� r� �
_delimiter)rE r{ rz rK rs r r r rv � s
z"TemplateInterpolation._parse_matchN) r? r@ rA rm r� r� r� r� �
IGNORECASE�VERBOSErt rv r r r r r� � s r� )r+ �templatec G s | j | f|�� S )N)�__new__)�cls�argsr r r �
__newobj__� s r� c @ s$ e Zd ZdZdd� Zdd� ZdDdd�Zd d
� Zd d � Zd
d� Z dEdd�Z
dd� Z dFdd�Z dd� Z
efdd�Zdd� Zd d � ZdGd d �Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� ZeZd*d+� Zd,d-� ZeZd.e_d/d0� Z d1d2� Z d3d4� Z dHd6d7�Z d8d9� Z d:d;� Z!d<d=� Z"d>d?� Z#d@dA� Z$dBdC� Z%dS )Ir� a�
A dictionary-like object that represents a section in a config file.
It does string interpolation if the 'interpolation' attribute
of the 'main' object is set to True.
Interpolation is tried first from this object, then from the 'DEFAULT'
section of this object, next from the parent and its 'DEFAULT' section,
and so on until the main object is reached.
A Section will behave like an ordered dictionary - following the
order of the ``scalars`` and ``sections`` attributes.
You can use this to change the order of members.
Iteration follows the order: scalars, then sections.
c C s$ t j| |d � | jj|d � d S )Nr r8 )�dict�update�__dict__)rE �stater r r � __setstate__� s zSection.__setstate__c C s t | �| jf}t| jf|fS )N)r� r� r� rD )rE r� r r r �
__reduce__� s zSection.__reduce__Nc C sX |dkr i }t j| � || _|| _|| _|| _| j� x |j� D ]\}}|| |< q@W dS )z�
* parent is the section above
* depth is the depth level of this section
* main is the main ConfigObj
* indict is a dictionary to initialise the section with
N)r� rk rb r� �depthrW � _initialise�items)rE rb r� r� �indictrW �entryrK r r r rk � s
zSection.__init__c C s: g | _ g | _i | _i | _d | _g | _i | _g | _d| _d S )NF) �scalars�sections�comments�inline_commentsr2 �defaults�default_values� extra_values�_created)rE r r r r� s zSection._initialisec C sv y
| j }W n^ tk
rh | jj}|dkr.t}|j� }tj|d �}|d krVd| j_|S || � }| _ Y nX |j||�S )NTF) Z_interpolation_engine�AttributeErrorr� r- r r �interpolation_enginesr r� )rE rz rK ZenginerW Zclass_r r r � _interpolate s
zSection._interpolatec sf t j���}�jjrbt|tj�r,�j�|�S t|t�rb��fdd�� � fdd�|D �}||krb|S |S )z+Fetch the item and do string interpolation.c s t | tj�r�j� | �S | S )N)r[ �six� string_typesr� )r� )rz rE r r �_check/ s z#Section.__getitem__.<locals>._checkc s g | ] }� |��qS r r )�.0r� )r� r r �
<listcomp>3 s z'Section.__getitem__.<locals>.<listcomp>) r� � __getitem__r� r- r[ r� r� r� rH )rE rz r� �newr )r� rz rE r r� ( s
zSection.__getitem__Fc
C sN t |tj�std| ��|| jkr6g | j|< d| j|< || jkrL| jj|� t |t�rz|| krj| j j
|� t j | ||� n�t |t �r�| r�|| kr�| j j
|� | j
d }t j | |t| || j||d�� n�|| kr�| jj
|� | jj�s<t |tj�r�nHt |ttf��r0x6|D ] }t |tj��s
td| ���q
W n td| ��t j | ||� dS )a�
Correctly set a value.
Making dictionary values Section instances.
(We have to special case 'Section' instances - which are also dicts)
Keys must be strings.
Values need only be strings (or lists of strings) if
``main.stringify`` is set.
``unrepr`` must be set when setting a value to a dictionary, without
creating a new sub-section.
z The key "%s" is not a string.rg r8 )r� rW zValue is not a string "%s".N)r[ r� r� �
ValueErrorr� r� r� �remover� r� �appendr� � __setitem__r� r� r� r3 rH rR rZ )rE rz rK r6 Z new_depthr� r r r r� 9 sF
zSection.__setitem__c C sD t j| |� || jkr$| jj|� n | jj|� | j|= | j|= dS )z-Remove items from the sequence when deleting.N)r� � __delitem__r� r� r� r� r� )rE rz r r r r� t s
zSection.__delitem__c C s" y| | S t k
r |S X dS )z>A version of ``get`` that doesn't bypass string interpolation.N)�KeyError)rE rz �defaultr r r r s z Section.getc C s x|D ]}|| | |< qW dS )zD
A version of update that uses our ``__setitem__``.
Nr )rE r� r� r r r r� � s
zSection.updatec C s: y | | }W n" t k
r. |tkr&� |}Y nX | |= |S )z�
'D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised'
)r� �MISSING)rE rz r� r� r r r �pop� s
z Section.popc C s6 | j | j }|std��|d }| | }| |= ||fS )zPops the first (key,val)z": 'popitem(): dictionary is empty'r )r� r� r� )rE Zsequencerz r� r r r �popitem� s zSection.popitemc C s8 t j| � g | _g | _i | _i | _d| _g | _g | _dS )z�
A version of clear that also affects scalars/sections
Also clears comments and configspec.
Leaves other attributes alone :
depth/main/parent are not affected
N) r� �clearr� r� r� r� r2 r� r� )rE r r r r� � s
z
Section.clearc C s. y| | S t k
r( || |< | | S X dS )z:A version of setdefault that sets sequence if appropriate.N)r� )rE rz r� r r r �
setdefault� s
zSection.setdefaultc C s t t| j| j t | j� ���S )z8D.items() -> list of D's (key, value) pairs, as 2-tuples)rH �zipr� r� �values)rE r r r r� � s z
Section.itemsc C s | j | j S )z D.keys() -> list of D's keys)r� r� )rE r r r �keys� s z Section.keysc s � fdd�� j � j D �S )z D.values() -> list of D's valuesc s g | ] }� | �qS r r )r� rz )rE r r r� � s z"Section.values.<locals>.<listcomp>)r� r� )rE r )rE r r� � s zSection.valuesc C s t t| j� ��S )z=D.iteritems() -> an iterator over the (key, value) items of D)rM rH r� )rE r r r � iteritems� s zSection.iteritemsc C s t | j| j �S )z.D.iterkeys() -> an iterator over the keys of D)rM r� r� )rE r r r �iterkeys� s zSection.iterkeysc C s t t| j� ��S )z2D.itervalues() -> an iterator over the values of D)rM rH r� )rE r r r �
itervalues� s zSection.itervaluesc s0 �fdd�� ddj � fdd��j�j D �� S )zx.__repr__() <==> repr(x)c s* y� | S t k
r$ tj� | �S X d S )N)r$ r� r� )rz )rE r r �_getval� s z!Section.__repr__.<locals>._getvalz{%s}z, c s$ g | ] }d t |�t � |��f �qS )z%s: %s)�repr)r� rz )r� r r r� � s z$Section.__repr__.<locals>.<listcomp>)rx r� r� )rE r )r� rE r �__repr__� s zSection.__repr__zx.__str__() <==> str(x)c C s` i }xV| D ]N}| | }t |t�r*|j� }n&t |t�r>t|�}nt |t�rPt|�}|||< q
W |S )a0
Return a deepcopy of self as a dictionary.
All members that are ``Section`` instances are recursively turned to
ordinary dictionaries - by calling their ``dict`` method.
>>> n = a.dict()
>>> n == a
1
>>> n is a
0
)r[ r� r� rH rR )rE Znewdictr� �
this_entryr r r r� � s
z Section.dictc C sV xPt |j� �D ]@\}}|| krFt| | t�rFt|t�rF| | j|� q|| |< qW dS )aQ
A recursive update - useful for merging config files.
>>> a = '''[section1]
... option1 = True
... [[subsection]]
... more_options = False
... # end of file'''.splitlines()
>>> b = '''# File is user.ini
... [section1]
... option1 = False
... # end of file'''.splitlines()
>>> c1 = ConfigObj(b)
>>> c2 = ConfigObj(a)
>>> c2.merge(c1)
>>> c2
ConfigObj({'section1': {'option1': 'False', 'subsection': {'more_options': 'False'}}})
N)rH r� r[ r� �merge)rE r� rz r� r r r r� s
z
Section.mergec C s� || j kr| j }n || jkr$| j}n td| ��|j|�}| | }tj| |� tj| ||� |j|� |j||� | j | }| j
| }| j |= | j
|= || j |< || j
|< dS )a
Change a keyname to another, without changing position in sequence.
Implemented so that transformations can be made on keys,
as well as on values. (used by encode and decode)
Also renames comments.
zKey "%s" not found.N) r� r� r� �indexr� r� r� r� �insertr� r� )rE ZoldkeyZnewkey�the_list�posr� ZcommZinline_commentr r r �rename, s"
zSection.renameTc K s i }xtt t| j��D ]b}| j| }y$|| |f|�}| j| }|||< W q tk
rt |r^� n| j| }d||< Y qX qW x�t t| j��D ]~}| j| }|r�y|| |f|� W n. tk
r� |rƂ n| j| }d||< Y nX | j| }| | j|f||d�|��||< q�W |S )a�
Walk every member and call a function on the keyword and value.
Return a dictionary of the return values
If the function raises an exception, raise the errror
unless ``raise_errors=False``, in which case set the return value to
``False``.
Any unrecognised keyword arguments you pass to walk, will be pased on
to the function you pass in.
Note: if ``call_on_sections`` is ``True`` then - on encountering a
subsection, *first* the function is called for the *whole* subsection,
and then recurses into it's members. This means your function must be
able to handle strings, dictionaries and lists. This allows you
to change the key of subsections as well as for ordinary members. The
return value when called on the whole subsection has to be discarded.
See the encode and decode methods for examples, including functions.
.. admonition:: caution
You can use ``walk`` to transform the names of members of a section
but you mustn't add or delete members.
>>> config = '''[XXXXsection]
... XXXXkey = XXXXvalue'''.splitlines()
>>> cfg = ConfigObj(config)
>>> cfg
ConfigObj({'XXXXsection': {'XXXXkey': 'XXXXvalue'}})
>>> def transform(section, key):
... val = section[key]
... newkey = key.replace('XXXX', 'CLIENT1')
... section.rename(key, newkey)
... if isinstance(val, (tuple, list, dict)):
... pass
... else:
... val = val.replace('XXXX', 'CLIENT1')
... section[newkey] = val
>>> cfg.walk(transform, call_on_sections=True)
{'CLIENT1section': {'CLIENT1key': None}}
>>> cfg
ConfigObj({'CLIENT1section': {'CLIENT1key': 'CLIENT1value'}})
F)r. �call_on_sections)�rangery r� � Exceptionr� �walk) rE Zfunctionr. r� Zkeywargs�outrP r� r� r r r r� J s: /
z Section.walkc C sn | | }|dkrdS |dkr dS y(t |tj�s6t� �n| jj|j� S W n tk
rh td| ��Y nX dS )a_
Accepts a key as input. The corresponding value must be a string or
the objects (``True`` or 1) or (``False`` or 0). We allow 0 and 1 to
retain compatibility with Python 2.2.
If the string is one of ``True``, ``On``, ``Yes``, or ``1`` it returns
``True``.
If the string is one of ``False``, ``Off``, ``No``, or ``0`` it returns
``False``.
``as_bool`` is not case sensitive.
Any other input will raise a ``ValueError``.
>>> a = ConfigObj()
>>> a['a'] = 'fish'
>>> a.as_bool('a')
Traceback (most recent call last):
ValueError: Value "fish" is neither True nor False
>>> a['b'] = 'True'
>>> a.as_bool('b')
1
>>> a['b'] = 'off'
>>> a.as_bool('b')
0
TFz$Value "%s" is neither True nor FalseN)r[ r� r� r� r� �_boolsr r� )rE rz r� r r r �as_bool� s zSection.as_boolc C s t | | �S )ai
A convenience method which coerces the specified value to an integer.
If the value is an invalid literal for ``int``, a ``ValueError`` will
be raised.
>>> a = ConfigObj()
>>> a['a'] = 'fish'
>>> a.as_int('a')
Traceback (most recent call last):
ValueError: invalid literal for int() with base 10: 'fish'
>>> a['b'] = '1'
>>> a.as_int('b')
1
>>> a['b'] = '3.2'
>>> a.as_int('b')
Traceback (most recent call last):
ValueError: invalid literal for int() with base 10: '3.2'
)�int)rE rz r r r �as_int� s zSection.as_intc C s t | | �S )a>
A convenience method which coerces the specified value to a float.
If the value is an invalid literal for ``float``, a ``ValueError`` will
be raised.
>>> a = ConfigObj()
>>> a['a'] = 'fish'
>>> a.as_float('a') #doctest: +IGNORE_EXCEPTION_DETAIL
Traceback (most recent call last):
ValueError: invalid literal for float(): fish
>>> a['b'] = '1'
>>> a.as_float('b')
1.0
>>> a['b'] = '3.2'
>>> a.as_float('b') #doctest: +ELLIPSIS
3.2...
)rY )rE rz r r r �as_float� s zSection.as_floatc C s$ | | }t |ttf�r t|�S |gS )aU
A convenience method which fetches the specified value, guaranteeing
that it is a list.
>>> a = ConfigObj()
>>> a['a'] = 1
>>> a.as_list('a')
[1]
>>> a['a'] = (1,)
>>> a.as_list('a')
[1]
>>> a['a'] = [1]
>>> a.as_list('a')
[1]
)r[ rR rH )rE rz �resultr r r �as_list� s zSection.as_listc C s2 | j | }tj| ||� || jkr.| jj|� |S )a
Restore (and return) default value for the specified key.
This method will only work for a ConfigObj that was created
with a configspec and has been validated.
If there is no default value for this key, ``KeyError`` is raised.
)r� r� r� r� r� )rE rz r� r r r �restore_default s
zSection.restore_defaultc C s: x| j D ]}| j|� qW x| jD ]}| | j� q"W dS )a'
Recursively restore default values to all members
that have them.
This method will only work for a ConfigObj that was created
with a configspec and has been validated.
It doesn't delete or modify entries without default values.
N)r� r� r� �restore_defaults)rE rz rs r r r r� s
zSection.restore_defaults)NN)F)N)N)TF)&r? r@ rA rm r� r� rk r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� �__iter__r� r� �__str__r� r� r� r� r� r� r� r� r� r� r r r r r� � sH
;
T,r� c @ s� e Zd ZdZejdej�Zejdej�Zejdej�Z ejdej�Z
ejdej�Z ejd�Z ejd�Z
ejd �Zejd
�Ze efe
efd �Zd d
d d
d d
d d
d�ZdFdd�Zdd� ZdGdd�Zdd� Zdd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Z d&d'� Z d(d)� Z dHd*d+�Z d,d-� Z d.d/� Z!d0d1� Z"d2d3� Z#d4d5� Z$d6d7� Z%d8d9� Z&d:d;� Z'd<d=� Z(dId>d?�Z)dJd@dA�Z*dBdC� Z+dDdE� Z,dS )Kr z2An object to read, create, and write config files.a� ^ # line start
(\s*) # indentation
( # keyword
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'"=].*?) # no quotes
)
\s*=\s* # divider
(.*) # value (including list values and comments)
$ # line end
a= ^
(\s*) # 1: indentation
((?:\[\s*)+) # 2: section marker open
( # 3: section name open
(?:"\s*\S.*?\s*")| # at least one non-space with double quotes
(?:'\s*\S.*?\s*')| # at least one non-space with single quotes
(?:[^'"\s].*?) # at least one non-space unquoted
) # section name close
((?:\s*\])+) # 4: section marker close
\s*(\#.*)? # 5: optional comment
$a� ^
(?:
(?:
(
(?:
(?:
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\#][^,\#]*?) # unquoted
)
\s*,\s* # comma
)* # match all list items ending in a comma (if any)
)
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\#\s][^,]*?)| # unquoted
(?:(?<!,)) # Empty value
)? # last item in a list - or string value
)|
(,) # alternatively a single comma - empty list
)
\s*(\#.*)? # optional comment
$z�
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'",\#]?.*?) # unquoted
)
\s*,\s* # comma
a ^
(
(?:".*?")| # double quotes
(?:'.*?')| # single quotes
(?:[^'"\#].*?)| # unquoted
(?:) # Empty value
)
\s*(\#.*)? # optional comment
$z^'''(.*?)'''\s*(#.*)?$z^"""(.*?)"""\s*(#.*)?$z^(.*?)'''\s*(#.*)?$z^(.*?)"""\s*(#.*)?$)z'''z"""TF)�yes�noZonZoff�1�0�trueZfalseNc
C s� || _ tj| | d| � |p g }||||||| |
| | |
|d� }|dkrJ|}n|ddl}|jdtdd� x |D ]}|tkrhtd| ��qhW x@ttj � �D ]0\}}||kr�|||< || }||kr�|||< q�W |r�d|d < | j
|� |d
}|| _ | j ||� dS ) a�
Parse a config file or create a config file object.
``ConfigObj(infile=None, configspec=None, encoding=None,
interpolation=True, raise_errors=False, list_values=True,
create_empty=False, file_error=False, stringify=True,
indent_type=None, default_encoding=None, unrepr=False,
write_empty_values=False, _inspec=False)``
r ) r2 r r- r. r/ r0 r1 r3 r4 r5 r6 r7 NzUPassing in an options dictionary to ConfigObj() is deprecated. Use **options instead.� )�
stacklevelzUnrecognised option "%s".Fr/ r2 )
�_inspecr� rk �warnings�warn�DeprecationWarning�OPTION_DEFAULTSrZ rH r� r� �_original_configspec�_load)rE �infile�optionsr2 r r- r. r/ r0 r1 r3 r4 r5 r6 r7 r� Z_optionsr� r� rK Z
keyword_valuer r r rk � s<
zConfigObj.__init__c s" t |tj�r�|| _tjj|�rBt|d��}|j� p4g }W d Q R X n@| j rXt
d| j ��n*| j r~t|d��}|j d� W d Q R X g }n�t |t
tf�r�t
|�}n�t |t��rt |t�rʇ fdd�� � || � nx|D ]}|| | |< q�W | `|d k r�| j|� nd | _d S t|dt�tk �r(|j� �p$g }ntd��|�r�| j|�}xN|D ]F}| �sF|d dk�rd�qFx"dD ]}|j|��rj|| _P �qjW P �qFW d
d� |D �}| j|� | j�r�d| jd j }t | j�d k�r�d| } t | �}
n
| jd }
| j|
_ | |
_ |
�| `|d k�rd | _n
| j|� d S )N�rbz Config file not found: "%s".�wrg c sJ x| j D ]}| | ||< qW x(| jD ] }i ||< � | | || � q$W d S )N)r� r� )Z
in_section� this_sectionr� rs )� set_sectionr r r� � s
z$ConfigObj._load.<locals>.set_section�readz>infile must be a filename, file like object, or list of lines.r8 �
�
�
c S s g | ]}|j d ��qS )z
)�rstrip)r� rh r r r r� s z#ConfigObj._load.<locals>.<listcomp>z at line %s.r z2Parsing failed with several errors.
First error %s���)r� r� )r� r� r� )!r[ r� r� �filename�os�path�isfile�open� readlinesr1 rn r0 �writerH rR r� r �_errors�_handle_configspecr2 ra r� r� rZ � _handle_bom�endswith�newlines�_parseri ry r �errors�config) rE r� r2 �hZcontentr� rh r �inforp �errorr )r� r r� � sh
zConfigObj._loadc C s� |d kr t }d | _g | _|d | _|d | _|d | _|d | _|d | _|d | _|d | _ |d | _
|d | _ d
| _ d | _
|d | _|d | _g | _g | _d | _| jr�d
| _tj| � d S )
Nr. r- r/ r0 r1 r3 r4 r r5 Fr7 r6 )r� r� r r. r- r/ r0 r1 r3 r4 r r5 �BOMr r7 r6 �initial_comment�
final_commentr2 r� r� r� )rE r� r r r r� 0 s.
zConfigObj._initialisec s0 �fdd�� ddj � fdd��j�j D �� S )Nc s* y� | S t k
r$ tj� | �S X d S )N)r$ r� r� )rz )rE r r r� Q s z#ConfigObj.__repr__.<locals>._getvalzConfigObj({%s})z, c s$ g | ] }d t |�t � |��f �qS )z%s: %s)r� )r� rz )r� r r r� W s z&ConfigObj.__repr__.<locals>.<listcomp>)rx r� r� )rE r )r� rE r r� P s zConfigObj.__repr__c C sH | j dk r&| j j� tkr&| j|| j �S t|ttf�r>|d }n|}t|tj�r\| j|| j �S | j dk �r(t| j j� }|dkr�x8tt j
� �D ](\}\}}|s�q�|j |�r�| j||�S q�W | j|| j �S t | }|j |�s�| j|| j �S |t
|�d� }t|ttf��r||d< n|}d| _| j|| j �S x�tt j
� �D ]�\}\}}t|tj� �s6|j |� �rf�q6n�|| _ |�s�d| _|t
|�d� }t|ttf��r�||d< n|}t|tj��r�|jd�S t|tj��r�|jd�jd�S | j|d�S | j||�S �q6W tj�rt|t��r| j|d�S t|tj��r8|jd�jd�S | j|d�S dS )a1
Handle any BOM, and decode if necessary.
If an encoding is specified, that *must* be used - but the BOM should
still be removed (and the BOM attribute set).
(If the encoding is wrongly specified, then a BOM for an alternative
encoding won't be discovered or removed.)
If an encoding is not specified, UTF8 or UTF16 BOM will be detected and
removed. The BOM attribute will be set. UTF16 will be decoded to
unicode.
NOTE: This method must not be called with an empty ``infile``.
Specifying the *wrong* encoding is likely to cause a
``UnicodeDecodeError``.
``infile`` must always be returned as a list of lines, but may be
passed in as a single string.
Nr r Tzutf-8)r r r �_decoder[ rH rR r� Z text_type�BOMSr� �
startswith�BOM_SETry r � binary_type�
splitlines�decodeZPY2�str)rE r� rh �encr r Zfinal_encoding�newliner r r r [ s^
zConfigObj._handle_bomc C s& t |tj�r | jr |j| j�S |S dS )z@Decode ASCII strings to unicode if a self.encoding is specified.N)r[ r� r r r )rE ZaStringr r r �_a_to_u� s zConfigObj._a_to_uc C sx t |tj�r|jd�S t |tj�r@|r6|j|�jd�S |jd�S |rtx.t|�D ]"\}}t |tj�rN|j|�||< qNW |S )z�
Decode infile to unicode. Using the specified encoding.
if is a string, it also needs converting to a list.
T)r[ r� r� r r r � enumerate)rE r� r rP rh r r r r � s
zConfigObj._decodec C s& t |tj�r | jr |j| j�S |S dS )z'Decode element to unicode if necessary.N)r[ r� r r5 r )rE rh r r r �_decode_element� s zConfigObj._decode_elementc C s t |tj�st|�S |S dS )zh
Used by ``stringify`` within validate, to turn non-string values
into strings.
N)r[ r� r� r )rE rK r r r �_str� s zConfigObj._strc C s" | j }| jrd| _ g }d}| }t|�d }d}d}�x�||k �r�|rHg }|d7 }|| } | j� }
|
sp|
jd�r�d}|j| � q6|s�|| _g }d}d}| jj| �} | dk �r�| j � \} }
}}}| r�| j
dkr�| | _
|
j d�}||j d�k� r�| j dt
||� q6||jk �rHy| j||�j}W n( tk
�rD | j d t
||� w6Y nX n<||jk�r\|j}n(||jd k�rr|}n| j d
t
||� q6| j|�}||k�r�| j d t||� q6t||| |d �}|||< ||j|< ||j|< q6| jj| �} | dk�r| j d
j| �t||� q6| j � \} }}| �r,| j
dk�r,| | _
|dd� dk�r�y| j||||�\}}}W n( tk
�r� | j dt||� w6Y njX | j�r�d}y t|�}W nN tk
�r� } z0t |�t k�r�d}nd}| j |t ||� w6W Y dd}~X nX n�| j�rTd}y t|�}W nL tk
�rP } z.t |t ��r*d}nd}| j |t ||� w6W Y dd}~X nX n<y| j |�\}}W n( tk
�r� | j dt||� w6Y nX | j|�}||k�r�| j dt||� q6|j!||dd� ||j|< ||j|< q6q6W | j
dk�r�d| _
| �r | j �r || _n |�s|| _"|| _ dS )z Actually parse the config file.Fr8 �#TN�[�]z Cannot compute the section depthz Cannot compute nesting levelzSection too nestedzDuplicate section name)rW z=Invalid line ({0!r}) (matched as neither section nor keyword)� �"""�'''z Parse error in multiline valuerg z Unknown name or type in valuez+Parse error from unrepr-ing multiline valuez!Parse error from unrepr-ing valuezParse error in valuezDuplicate keyword name)r6 r� )r! r" )#r/ r6 ry �stripr r� r
�_sectionmarkerr{ �groupsr4 �count�
_handle_errorr r� � _match_depthrb rj �_unquoter r� r� r� �_keyword�formatr �
_multiliner� �typer( r' r[ �
_handle_valuer� r )rE r� Ztemp_list_valuesZ comment_listZ
done_startr� �maxline� cur_indexZ
reset_commentrh Zsline�mat�indentZ sect_openZ sect_nameZ
sect_close�commentZ cur_depthrb rz rK �erp r r r r s�
zConfigObj._parsec C s> x$||j k r$||jkr t� �|j}qW |j |kr4|S t� �dS )z�
Given a section and a depth level, walk back through the sections
parents to see if the depth level matches a previous section.
Return a reference to the right section,
or raise a SyntaxError.
N)r� rb rj )rE Zsectr� r r r r( � s
zConfigObj._match_depthc C sB || }|d7 }dj ||�}||||�}| jr2|�| jj|� dS )z�
Handle an error according to the error settings.
Either raise the error or store it.
The error will have occured at ``cur_index``
r8 z{0} at line {1}.N)r+ r. r r� )rE �textZ
ErrorClassr� r0 rh rl r r r r r' � s zConfigObj._handle_errorc C s4 |st �|d |d kr0|d dkr0|dd� }|S )z%Return an unquoted version of a valuer r8 �"�'r� )r6 r7 r� )rj )rE rK r r r r) � s
zConfigObj._unquotec s� |r� j r|dkrdS |rjt|ttf�rj|s0dS t|�dkrR� j|d dd�d S dj� fdd �|D ��S t|tj�s�� j r�t
|�}n t d
| ��|s�d S � j o�d |ko�d
|k}|o�d|kr�d|kp�d |k}|o�| o�d|ko�d|ko�d
|k}|� s�| �o| }|�rh� j �st
}nNd |k�r0td| ��n6|d tk�r\|d tk�r\d|k�r\t
}n
� j|�}n
� j|�}|t
k�r�d
|k�r�� j �r�� j|�}|| S )a�
Return a safely quoted version of a value.
Raise a ConfigObjError if the value cannot be safely quoted.
If multiline is ``True`` (default) then use triple quotes
if necessary.
* Don't quote values that don't need it.
* Recursively quote members of a list and return a comma joined list.
* Multiline is ``False`` for lists.
* Obey list syntax for empty and single member lists.
If ``list_values=False`` then the value is only quoted if it contains
a ``\n`` (is multiline) or '#'.
If ``write_empty_values`` is set, and the value is an empty string, it
won't be quoted.
rg �,r8 r F)� multilinez, c s g | ]}� j |d d��qS )F)r9 )�_quote)r� r� )rE r r r� � s z$ConfigObj._quote.<locals>.<listcomp>zValue "%s" is not a string.z""r� r r7 r6 z#Value "%s" cannot be safely quoted.r� )r7 r[ rH rR ry r: rx r� r� r3 r rZ r/ �noquotr � wspace_plus�_get_single_quote�_get_triple_quote)rE rK r9 Zno_lists_no_quotesZ need_tripleZhash_triple_quoteZcheck_for_single�quotr )rE r r: � sB
"
zConfigObj._quotec C s4 d|kr d|kr t d| ��nd|kr,t}nt}|S )Nr7 r6 z#Value "%s" cannot be safely quoted.)r �squot�dquot)rE rK r? r r r r= % s zConfigObj._get_single_quotec C sD |j d�dkr(|j d�dkr(td| ��|j d�dkr<t}nt}|S )Nz"""r8 z'''z#Value "%s" cannot be safely quoted.r� r� r� )�findr �tdquot�tsquot)rE rK r? r r r r> / s zConfigObj._get_triple_quotec s� � j r|dfS � js6� jj|�}|dkr.t� �|j� S � jj|�}|dkrPt� �|j� \}}}}|dkrv|dkrvt� �|dk r�g |fS |dk r�|r�| r�d}n|p�d}� j|�}|dkr�||fS � jj |�}� fdd�|D �}|dk r�||g7 }||fS )z�
Given a value string, unquote, remove comment,
handle lists. (including empty and single member lists)
rg Nz""c s g | ]}� j |��qS r )r) )r� r� )rE r r r� d s z+ConfigObj._handle_value.<locals>.<listcomp>)
r� r/ � _nolistvaluer{ rj r% � _valueexpr) �
_listvalueexp�findall)rE rK r1 r/ ZsingleZ
empty_listr3 r� r )rE r r. 9 s6
zConfigObj._handle_valuec
C s� |dd� }|dd� }| j | d }| j | d }|j|�} | dk r`t| j� �}
|
j|� |
S |j|�dkrtt� �xD||k r�|d7 }|d7 }|| } | j|�dkr�|| 7 }qvP qvW t� �|j| �} | dkr�t� �| j� \}} || | |fS )z9Extract the value, where we are in a multiline situation.Nr r r8 r� r� r� )�
_triple_quoter{ rH r% r� rB rj )
rE rK r� r0 r/ r? ZnewvalueZ single_lineZ
multi_liner1 Zretvalrh r3 r r r r, j s0
zConfigObj._multilinec C s� t |t�szyt|dddd�}W nZ tk
rL } ztd| ��W Y dd}~X n. tk
rx } ztd| ��W Y dd}~X nX || _dS )zParse the configspec.T)r. r1 r� z Parsing configspec failed: %sNz Reading configspec failed: %s)r[ r r r rn r2 )rE r2 r4 r r r r � s
z ConfigObj._handle_configspecc C s� |j }|jd�}t|t�r<x |jD ]}||kr"||| _ q"W xz|jD ]p}|dkrRqD||kr�i ||< d|| _|r�|jj|g �|j|< |jj|d�|j|< t|| t�rD|| || _ qDW dS )z�
Called by validate. Handles setting the configspec on subsections
including sections to be validated by __many__
�__many__Trg N) r2 r r[ r� r� r� r� r� r� )rE rs �copyr2 �manyr� r r r �_set_configspec� s"
zConfigObj._set_configspecc C sN | j s| j| j|��}nt|�}d|| j| j|dd��| jd�|| j|�f S )z.Write an individual line, for the write methodz
%s%s%s%s%sF)r9 z = )r6 r r: r� r )rE �
indent_stringr� r� r3 r� r r r � _write_line� s zConfigObj._write_linec C s< d|| j d| �| j| j|�dd�| j d| �| j|�f S )zWrite a section marker linez
%s%s%s%s%sr F)r9 r )r r: r )rE rN r� r� r3 r r r �
_write_marker� s
zConfigObj._write_markerc C s. |sdS | j }|jd�s&|| jd�7 }|| S )zDeal with a comment.rg r z # )r4 r r )rE r3 r~ r r r �_handle_comment� s
zConfigObj._handle_commentc sB � j dkrt� _ g }� jd�}� jd�}|dkr�� j}d� _� }xB� jD ]8}� j|�}|j� }|rv|j|� rv|| }|j|� qHW � j |j } x�|j
|j D ]�}
|
|j kr�q�xF|j
|
D ]8} � j| j� �} | r�| j|� r�|| } |j| | � q�W ||
} � j|j|
�}
t| t��rF|j� j| | j |
|
�� |j� j| d�� q�|j� j| |
| |
�� q�W |� k�r�xH� jD ]>}� j|�}|j� }|�r�|j|� �r�|| }|j|� �qrW |� _|� k �r�|S � jdk�rF|dk�rF� j�r�� fdd�|D �}� j�rB� jdk�s"tj � jj � �dk�rB|�s2|jd � t |d
|d
< |S � j �pRt j!}t"|d d�dk �r�|j#d k�r�t$j%d
k�r�|dk�r�d}� j|�j&|�}|j'|��s�||7 }t|t(j)��r�|}n|j*� j�pڈ j+�p�d�}� j�r� jdk�s�t,� j��rt | }|dk �r |j|� n"t-� jd��}|j|� W dQ R X dS )a~
Write the current ConfigObj as a file
tekNico: FIXME: use StringIO instead of real files
>>> filename = a.filename
>>> a.filename = 'test.ini'
>>> a.write()
>>> a.filename = filename
>>> a == ConfigObj('test.ini', raise_errors=True)
1
>>> import os
>>> os.remove('test.ini')
Nr z# F)rs c s g | ]}|j � j��qS r )�encoder )r� �l)rE r r r� / s z#ConfigObj.write.<locals>.<listcomp>r rg r �moder� Zwin32z
r� �ascii�wb).r4 r r r- r
r r# r r� r� r� r� r� r� �lstriprQ r� r[ r� rP �extendr rO r r� r r r r r r r r� �linesepra rT �sys�platformrx r r� r rR r5 r r� )rE Zoutfilers r� ZcsZcspZint_valrh Z
stripped_linerN r� Z comment_liner� r3 r �outputZ output_bytesr r )rE r r � s�
zConfigObj.writec st �dkrt�j dkrtd���r0ddlm} |�_���rt�j j�_�j j�_�j j�_�j j�_�j j �_ �j j
�_
�j � �j ��� � ������fdd�}i �d}d}� fdd ��j D �} �fd
d �� j
D �}
�fd d �� j D �} x�� j D ]�} | dk� r�q�| �j k�s| �jk�rZd}
d}��rf| �j k�rf� jj| g ��j| < � jj| d��j| < n d}
�| }|| � | ||
||�\}}q�W d}d � j k�r�� d }nd
� j k�r�� d
}|dk �r�x,| D ]$} �| }|| ||d||�\}}�q�W g } x<| D ]4} d}��s d�| < nd}d| }�j|��| < �q�W x<|
D ]4} d}��sJd�| < nd}d| }�j|��| < �q2W x��j
D ]�} ��k�r�| dk�r��qr�| j dk�r�| j| � �qr��rڈ jj| g ��j| < � jj| d��j| < �j����| d�}|�| < |dk�rd}n|dk�rd}nd}�qrW | �_��r<�j �r<d}|�r\��r\��r\t�j� � }|�rfdS |�rpdS �S )a;
Test the ConfigObj against a configspec.
It uses the ``validator`` object from *validate.py*.
To run ``validate`` on the current ConfigObj, call: ::
test = config.validate(validator)
(Normally having previously passed in the configspec when the ConfigObj
was created - you can dynamically assign a dictionary of checks to the
``configspec`` attribute of a section though).
It returns ``True`` if everything passes, or a dictionary of
pass/fails (True/False). If every member of a subsection passes, it
will just have the value ``True``. (It also returns ``False`` if all
members fail).
In addition, it converts the values from strings to their native
types if their checks pass (and ``stringify`` is set).
If ``preserve_errors`` is ``True`` (``False`` is default) then instead
of a marking a fail with a ``False``, it will preserve the actual
exception object. This can contain info about the reason for failure.
For example the ``VdtValueTooSmallError`` indicates that the value
supplied was too small. If a value (or section) is missing it will
still be marked as ``False``.
You must have the validate module to use ``preserve_errors=True``.
You can then use the ``flatten_errors`` function to turn your nested
results dictionary into a flattened list of failures - useful for
displaying meaningful error messages.
NzNo configspec supplied.r )�VdtMissingValuec sP �j j| d � y�j� | ��j | < W n tt�jfk
rB Y nX y�j|||d�}W nP �jk
r� } z2� s~t|�j�r�d�| < n |�| < d}d}W Y d d }~X n�X d}d�| < �j s�|�r"�j �s
t|t
t f�r�fdd�|D �}n |o�|d k�r d}n
�j |�}||k�s|�r"|�| < � �rH|�rH| �j
k�rH�j
j| � ||fS )N)�missingFTc s g | ]}� j |��qS r )r )r� �item)rE r r r� � s z>ConfigObj.validate.<locals>.validate_entry.<locals>.<listcomp>rg )r� r� Zget_default_valuer� r� �baseErrorClass�checkr[ �_vdtMissingValuer3 rH rR r r� r� )r� �specr� r^ �ret_true� ret_falsera r4 )r2 rK r� �preserve_errorsrs rE � validatorr r �validate_entry� s:
z*ConfigObj.validate.<locals>.validate_entryTc s g | ]}|� kr|�qS r r )r� r| )r2 r r r� � s z&ConfigObj.validate.<locals>.<listcomp>c s g | ]}|� j kr|�qS r )r� )r� r| )rs r r r� � s c s g | ]}|� j kr|�qS r )r� )r� r| )rs r r r� � s rJ �
___many___rg Fz"Value %r was provided as a sectionz)Section %r was provided as a single valuer� )rf rK rs )rJ ri )r2 r� �validater] rb r
r r r r r4 rM r� r� r� r� r r� r` r� r� r� �anyr� )rE rg rf rK rs r] rh rd re Z unvalidatedZincorrect_sectionsZincorrect_scalarsr� r^ r� rL rp ra r )r2 rK r� rf rs rE rg r rj S s� $
-
zConfigObj.validatec C s | j � | j� d| _d| _dS )z@Clear ConfigObj instance and restore to 'freshly created' state.N)r� r� r2 r� )rE r r r �reset" s zConfigObj.resetc C st t | jtj�st� �| j}i }x$tD ] }|dkr2q$t| |�||< q$W | j}||d< | j� | j |� | j
||� dS )z�
Reload a ConfigObj from file.
This method raises a ``ReloadError`` if the ConfigObj doesn't have
a filename attribute pointing to a file.
r2 N) r[ r� r� r� r& r� ra r� r� r� r� )rE r� Zcurrent_optionsr� r2 r r r �reload- s
zConfigObj.reload)NNNNTFTFFTNNFFF)N)T)NN)FFN)-r? r@ rA rm r� r� r� r* r$ rF rG rE Z_single_line_singleZ_single_line_doubleZ_multi_line_singleZ_multi_line_doublerI r� rk r� r� r� r r r r r r r( r' r) r: r= r> r. r, r rM rO rP rQ r rj rl rm r r r r r / sx
6`
u
(
G
1#
r
O c @ s" e Zd ZdZdd� Zddd�ZdS ) r! a�
A simple validator.
Can be used to check that all members expected are present.
To use it, provide a configspec with all your members in (the value given
will be ignored). Pass an instance of ``SimpleVal`` to the ``validate``
method of your ``ConfigObj``. ``validate`` will return ``True`` if all
members are present, or a dictionary with True/False meaning
present/missing. (Whole missing sections will be replaced with ``False``)
c C s
t | _d S )N)r r` )rE r r r rk S s zSimpleVal.__init__Fc C s |r | j � �|S )z9A dummy check method, always returns the value unchanged.)r` )rE ra �memberr^ r r r ra V s zSimpleVal.checkN)F)r? r@ rA rm rk ra r r r r r! G s
c C s� |dkrg }g }|dkr t |�S |dks2t|t�r^|j|dd� d|f� |rV|j� t |�S xht|j� �D ]X\}}|dkr~qlt| j|�t�r�|j|� t | | |||� ql|j|dd� ||f� qlW |r�|j� t |�S )a�
An example function that will turn a nested dictionary of results
(as returned by ``ConfigObj.validate``) into a flat list.
``cfg`` is the ConfigObj instance being checked, ``res`` is the results
dictionary returned by ``validate``.
(This is a recursive function, so you shouldn't use the ``levels`` or
``results`` arguments - they are used by the function.)
Returns a list of keys that failed. Each member of the list is a tuple::
([list of sections...], key, result)
If ``validate`` was called with ``preserve_errors=False`` (the default)
then ``result`` will always be ``False``.
*list of sections* is a flattened list of sections that the key was found
in.
If the section was missing (or a section was expected and a scalar provided
- or vice-versa) then key will be ``None``.
If the value (or section) was missing then ``result`` will be ``False``.
If ``validate`` was called with ``preserve_errors=True`` and a value
was present, but failed the check, then ``result`` will be the exception
object returned. You can use this as a string that describes the failure.
For example *The value "3" is of the wrong type*.
NTF)
�sortedr[ r� r� r� rH r� r r� r) )Zcfg�resZlevels�resultsrz r� r r r r) ] s*
c sV g }|j � fdd�| jD �� x2| jD ](}|| jkr&|j t| | � |f �� q&W |S )a�
Find all the values and sections not in the configspec from a validated
ConfigObj.
``get_extra_values`` returns a list of tuples where each tuple represents
either an extra section, or an extra value.
The tuples contain two values, a tuple representing the section the value
is in and the name of the extra values. For extra values in the top level
section the first member will be an empty tuple. For values in the 'foo'
section the first member will be ``('foo',)``. For members in the 'bar'
subsection of the 'foo' section the first member will be ``('foo', 'bar')``.
NOTE: If you call ``get_extra_values`` on a ConfigObj instance that hasn't
been validated it will return an empty list.
c s g | ] }� |f�qS r r )r� rW )�_prependr r r� � s z$get_extra_values.<locals>.<listcomp>)rX r� r� r* )Zconfrr r� rW r )rr r r* � s
)r N)r r )r
r )r r )r r r r r r r r r! r" r# r$ r% r& r' r( r) r* )NN);r� r� rZ �codecsr r r r r� Z_versionr r9 r r r r r@ rA r; r< rD rC �objectr� �__all__r r ZMAX_INTERPOL_DEPTHr� r> r� r( rB Z_builderr6 rj r r r rn r& r r r" r# r% r$ r' rq r� r� r� r� r� r� r r! r) r* r r r r �<module> s� 7 | i "
< __pycache__/_version.cpython-36.pyc 0000644 00000000206 14751155147 0013236 0 ustar 00 3
��S � @ s d Z dS )z5.0.6N)� __version__� r r � /usr/lib/python3.6/_version.py�<module> s sepolgen/module.py 0000644 00000016167 14751155147 0010244 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
Utilities for dealing with the compilation of modules and creation
of module tress.
"""
import re
import tempfile
try:
from subprocess import getstatusoutput
except ImportError:
from commands import getstatusoutput
import os
import os.path
import shutil
import selinux
from . import defaults
def is_valid_name(modname):
"""Check that a module name is valid.
"""
m = re.findall(r"[^a-zA-Z0-9_\-\.]", modname)
if len(m) == 0 and modname[0].isalpha():
return True
else:
return False
class ModuleTree:
def __init__(self, modname):
self.modname = modname
self.dirname = None
def dir_name(self):
return self.dirname
def te_name(self):
return self.dirname + "/" + self.modname + ".te"
def fc_name(self):
return self.dirname + "/" + self.modname + ".fc"
def if_name(self):
return self.dirname + "/" + self.modname + ".if"
def package_name(self):
return self.dirname + "/" + self.modname + ".pp"
def makefile_name(self):
return self.dirname + "/Makefile"
def create(self, parent_dirname, makefile_include=None):
self.dirname = parent_dirname + "/" + self.modname
os.mkdir(self.dirname)
fd = open(self.makefile_name(), "w")
if makefile_include:
fd.write("include " + makefile_include)
else:
fd.write("include " + defaults.refpolicy_makefile())
fd.close()
# Create empty files for the standard refpolicy
# module files
open(self.te_name(), "w").close()
open(self.fc_name(), "w").close()
open(self.if_name(), "w").close()
def modname_from_sourcename(sourcename):
return os.path.splitext(os.path.split(sourcename)[1])[0]
class ModuleCompiler:
"""ModuleCompiler eases running of the module compiler.
The ModuleCompiler class encapsulates running the commandline
module compiler (checkmodule) and module packager (semodule_package).
You are likely interested in the create_module_package method.
Several options are controlled via paramaters (only effects the
non-refpol builds):
.mls [boolean] Generate an MLS module (by passed -M to
checkmodule). True to generate an MLS module, false
otherwise.
.module [boolean] Generate a module instead of a base module.
True to generate a module, false to generate a base.
.checkmodule [string] Fully qualified path to the module compiler.
Default is /usr/bin/checkmodule.
.semodule_package [string] Fully qualified path to the module
packager. Defaults to /usr/bin/semodule_package.
.output [file object] File object used to write verbose
output of the compililation and packaging process.
"""
def __init__(self, output=None):
"""Create a ModuleCompiler instance, optionally with an
output file object for verbose output of the compilation process.
"""
self.mls = selinux.is_selinux_mls_enabled()
self.module = True
self.checkmodule = "/usr/bin/checkmodule"
self.semodule_package = "/usr/bin/semodule_package"
self.output = output
self.last_output = ""
self.refpol_makefile = defaults.refpolicy_makefile()
self.make = "/usr/bin/make"
def o(self, str):
if self.output:
self.output.write(str + "\n")
self.last_output = str
def run(self, command):
self.o(command)
rc, output = getstatusoutput(command)
self.o(output)
return rc
def gen_filenames(self, sourcename):
"""Generate the module and policy package filenames from
a source file name. The source file must be in the form
of "foo.te". This will generate "foo.mod" and "foo.pp".
Returns a tuple with (modname, policypackage).
"""
splitname = sourcename.split(".")
if len(splitname) < 2:
raise RuntimeError("invalid sourcefile name %s (must end in .te)", sourcename)
# Handle other periods in the filename correctly
basename = ".".join(splitname[0:-1])
modname = basename + ".mod"
packagename = basename + ".pp"
return (modname, packagename)
def create_module_package(self, sourcename, refpolicy=True):
"""Create a module package saved in a packagename from a
sourcename.
The create_module_package creates a module package saved in a
file named sourcename (.pp is the standard extension) from a
source file (.te is the standard extension). The source file
should contain SELinux policy statements appropriate for a
base or non-base module (depending on the setting of .module).
Only file names are accepted, not open file objects or
descriptors because the command line SELinux tools are used.
On error a RuntimeError will be raised with a descriptive
error message.
"""
if refpolicy:
self.refpol_build(sourcename)
else:
modname, packagename = self.gen_filenames(sourcename)
self.compile(sourcename, modname)
self.package(modname, packagename)
os.unlink(modname)
def refpol_build(self, sourcename):
# Compile
command = self.make + " -f " + self.refpol_makefile
rc = self.run(command)
# Raise an error if the process failed
if rc != 0:
raise RuntimeError("compilation failed:\n%s" % self.last_output)
def compile(self, sourcename, modname):
s = [self.checkmodule]
if self.mls:
s.append("-M")
if self.module:
s.append("-m")
s.append("-o")
s.append(modname)
s.append(sourcename)
rc = self.run(" ".join(s))
if rc != 0:
raise RuntimeError("compilation failed:\n%s" % self.last_output)
def package(self, modname, packagename):
s = [self.semodule_package]
s.append("-o")
s.append(packagename)
s.append("-m")
s.append(modname)
rc = self.run(" ".join(s))
if rc != 0:
raise RuntimeError("packaging failed [%s]" % self.last_output)
sepolgen/matching.py 0000644 00000020720 14751155147 0010537 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
Classes and algorithms for matching requested access to access vectors.
"""
import itertools
from . import access
from . import objectmodel
from . import util
class Match(util.Comparison):
def __init__(self, interface=None, dist=0):
self.interface = interface
self.dist = dist
self.info_dir_change = False
# when implementing __eq__ also __hash__ is needed on py2
# if object is muttable __hash__ should be None
self.__hash__ = None
def _compare(self, other, method):
try:
a = (self.dist, self.info_dir_change)
b = (other.dist, other.info_dir_change)
return method(a, b)
except (AttributeError, TypeError):
# trying to compare to foreign type
return NotImplemented
class MatchList:
DEFAULT_THRESHOLD = 150
def __init__(self):
# Match objects that pass the threshold
self.children = []
# Match objects over the threshold
self.bastards = []
self.threshold = self.DEFAULT_THRESHOLD
self.allow_info_dir_change = False
self.av = None
def best(self):
if len(self.children):
return self.children[0]
if len(self.bastards):
return self.bastards[0]
return None
def __len__(self):
# Only return the length of the matches so
# that this can be used to test if there is
# a match.
return len(self.children) + len(self.bastards)
def __iter__(self):
return iter(self.children)
def all(self):
return itertools.chain(self.children, self.bastards)
def append(self, match):
if match.dist <= self.threshold:
if not match.info_dir_change or self.allow_info_dir_change:
self.children.append(match)
else:
self.bastards.append(match)
else:
self.bastards.append(match)
def sort(self):
self.children.sort()
self.bastards.sort()
class AccessMatcher:
def __init__(self, perm_maps=None):
self.type_penalty = 10
self.obj_penalty = 10
if perm_maps:
self.perm_maps = perm_maps
else:
self.perm_maps = objectmodel.PermMappings()
# We want a change in the information flow direction
# to be a strong penalty - stronger than access to
# a few unrelated types.
self.info_dir_penalty = 100
def type_distance(self, a, b):
if a == b or access.is_idparam(b):
return 0
else:
return -self.type_penalty
def perm_distance(self, av_req, av_prov):
# First check that we have enough perms
diff = av_req.perms.difference(av_prov.perms)
if len(diff) != 0:
total = self.perm_maps.getdefault_distance(av_req.obj_class, diff)
return -total
else:
diff = av_prov.perms.difference(av_req.perms)
return self.perm_maps.getdefault_distance(av_req.obj_class, diff)
def av_distance(self, req, prov):
"""Determine the 'distance' between 2 access vectors.
This function is used to find an access vector that matches
a 'required' access. To do this we comput a signed numeric
value that indicates how close the req access is to the
'provided' access vector. The closer the value is to 0
the closer the match, with 0 being an exact match.
A value over 0 indicates that the prov access vector provides more
access than the req (in practice, this means that the source type,
target type, and object class is the same and the perms in prov is
a superset of those in req.
A value under 0 indicates that the prov access less - or unrelated
- access to the req access. A different type or object class will
result in a very low value.
The values other than 0 should only be interpreted relative to
one another - they have no exact meaning and are likely to
change.
Params:
req - [AccessVector] The access that is required. This is the
access being matched.
prov - [AccessVector] The access provided. This is the potential
match that is being evaluated for req.
Returns:
0 : Exact match between the acess vectors.
< 0 : The prov av does not provide all of the access in req.
A smaller value indicates that the access is further.
> 0 : The prov av provides more access than req. The larger
the value the more access over req.
"""
# FUTURE - this is _very_ expensive and probably needs some
# thorough performance work. This version is meant to give
# meaningful results relatively simply.
dist = 0
# Get the difference between the types. The addition is safe
# here because type_distance only returns 0 or negative.
dist += self.type_distance(req.src_type, prov.src_type)
dist += self.type_distance(req.tgt_type, prov.tgt_type)
# Object class distance
if req.obj_class != prov.obj_class and not access.is_idparam(prov.obj_class):
dist -= self.obj_penalty
# Permission distance
# If this av doesn't have a matching source type, target type, and object class
# count all of the permissions against it. Otherwise determine the perm
# distance and dir.
if dist < 0:
pdist = self.perm_maps.getdefault_distance(prov.obj_class, prov.perms)
else:
pdist = self.perm_distance(req, prov)
# Combine the perm and other distance
if dist < 0:
if pdist < 0:
return dist + pdist
else:
return dist - pdist
elif dist >= 0:
if pdist < 0:
return pdist - dist
else:
return dist + pdist
def av_set_match(self, av_set, av):
"""
"""
dist = None
# Get the distance for each access vector
for x in av_set:
tmp = self.av_distance(av, x)
if dist is None:
dist = tmp
elif tmp >= 0:
if dist >= 0:
dist += tmp
else:
dist = tmp + -dist
else:
if dist < 0:
dist += tmp
else:
dist -= tmp
# Penalize for information flow - we want to prevent the
# addition of a write if the requested is read none. We are
# much less concerned about the reverse.
av_dir = self.perm_maps.getdefault_direction(av.obj_class, av.perms)
if av_set.info_dir is None:
av_set.info_dir = objectmodel.FLOW_NONE
for x in av_set:
av_set.info_dir = av_set.info_dir | \
self.perm_maps.getdefault_direction(x.obj_class, x.perms)
if (av_dir & objectmodel.FLOW_WRITE == 0) and (av_set.info_dir & objectmodel.FLOW_WRITE):
if dist < 0:
dist -= self.info_dir_penalty
else:
dist += self.info_dir_penalty
return dist
def search_ifs(self, ifset, av, match_list):
match_list.av = av
for iv in itertools.chain(ifset.tgt_type_all,
ifset.tgt_type_map.get(av.tgt_type, [])):
if not iv.enabled:
#print "iv %s not enabled" % iv.name
continue
dist = self.av_set_match(iv.access, av)
if dist >= 0:
m = Match(iv, dist)
match_list.append(m)
match_list.sort()
sepolgen/objectmodel.py 0000644 00000014566 14751155147 0011247 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
This module provides knowledge object classes and permissions. It should
be used to keep this knowledge from leaking into the more generic parts of
the policy generation.
"""
# Objects that can be implicitly typed - these objects do
# not _have_ to be implicitly typed (e.g., sockets can be
# explicitly labeled), but they often are.
#
# File is in this list for /proc/self
#
# This list is useful when dealing with rules that have a
# type (or param) used as both a subject and object. For
# example:
#
# allow httpd_t httpd_t : socket read;
#
# This rule makes sense because the socket was (presumably) created
# by a process with the type httpd_t.
implicitly_typed_objects = ["socket", "fd", "process", "file", "lnk_file", "fifo_file",
"dbus", "capability", "unix_stream_socket"]
#::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
#
#Information Flow
#
# All of the permissions in SELinux can be described in terms of
# information flow. For example, a read of a file is a flow of
# information from that file to the process reading. Viewing
# permissions in these terms can be used to model a varity of
# security properties.
#
# Here we have some infrastructure for understanding permissions
# in terms of information flow
#
#::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
# Information flow deals with information either flowing from a subject
# to and object ("write") or to a subject from an object ("read"). Read
# or write is described from the subject point-of-view. It is also possible
# for a permission to represent both a read and write (though the flow is
# typical asymettric in terms of bandwidth). It is also possible for
# permission to not flow information (meaning that the result is pure
# side-effect).
#
# The following constants are for representing the directionality
# of information flow.
FLOW_NONE = 0
FLOW_READ = 1
FLOW_WRITE = 2
FLOW_BOTH = FLOW_READ | FLOW_WRITE
# These are used by the parser and for nice disply of the directions
str_to_dir = { "n" : FLOW_NONE, "r" : FLOW_READ, "w" : FLOW_WRITE, "b" : FLOW_BOTH }
dir_to_str = { FLOW_NONE : "n", FLOW_READ : "r", FLOW_WRITE : "w", FLOW_BOTH : "b" }
class PermMap:
"""A mapping between a permission and its information flow properties.
PermMap represents the information flow properties of a single permission
including the direction (read, write, etc.) and an abstract representation
of the bandwidth of the flow (weight).
"""
def __init__(self, perm, dir, weight):
self.perm = perm
self.dir = dir
self.weight = weight
def __repr__(self):
return "<sepolgen.objectmodel.PermMap %s %s %d>" % (self.perm,
dir_to_str[self.dir],
self.weight)
class PermMappings:
"""The information flow properties of a set of object classes and permissions.
PermMappings maps one or more classes and permissions to their PermMap objects
describing their information flow charecteristics.
"""
def __init__(self):
self.classes = { }
self.default_weight = 5
self.default_dir = FLOW_BOTH
def from_file(self, fd):
"""Read the permission mappings from a file. This reads the format used
by Apol in the setools suite.
"""
# This parsing is deliberitely picky and bails at the least error. It
# is assumed that the permission map file will be shipped as part
# of sepolgen and not user modified, so this is a reasonable design
# choice. If user supplied permission mappings are needed the parser
# should be made a little more robust and give better error messages.
cur = None
for line in fd:
fields = line.split()
if len(fields) == 0 or len(fields) == 1 or fields[0] == "#":
continue
if fields[0] == "class":
c = fields[1]
if c in self.classes:
raise ValueError("duplicate class in perm map")
self.classes[c] = { }
cur = self.classes[c]
else:
if len(fields) != 3:
raise ValueError("error in object classs permissions")
if cur is None:
raise ValueError("permission outside of class")
pm = PermMap(fields[0], str_to_dir[fields[1]], int(fields[2]))
cur[pm.perm] = pm
def get(self, obj, perm):
"""Get the permission map for the object permission.
Returns:
PermMap representing the permission
Raises:
KeyError if the object or permission is not defined
"""
return self.classes[obj][perm]
def getdefault(self, obj, perm):
"""Get the permission map for the object permission or a default.
getdefault is the same as get except that a default PermMap is
returned if the object class or permission is not defined. The
default is FLOW_BOTH with a weight of 5.
"""
try:
pm = self.classes[obj][perm]
except KeyError:
return PermMap(perm, self.default_dir, self.default_weight)
return pm
def getdefault_direction(self, obj, perms):
dir = FLOW_NONE
for perm in perms:
pm = self.getdefault(obj, perm)
dir = dir | pm.dir
return dir
def getdefault_distance(self, obj, perms):
total = 0
for perm in perms:
pm = self.getdefault(obj, perm)
total += pm.weight
return total
sepolgen/lex.py 0000644 00000123631 14751155147 0007542 0 ustar 00 # -----------------------------------------------------------------------------
# ply: lex.py
#
# Copyright (C) 2001-2018
# David M. Beazley (Dabeaz LLC)
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
# * Neither the name of the David Beazley or Dabeaz LLC may be used to
# endorse or promote products derived from this software without
# specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
# -----------------------------------------------------------------------------
__version__ = '3.11'
__tabversion__ = '3.10'
import re
import sys
import types
import copy
import os
import inspect
# This tuple contains known string types
try:
# Python 2.6
StringTypes = (types.StringType, types.UnicodeType)
except AttributeError:
# Python 3.0
StringTypes = (str, bytes)
# This regular expression is used to match valid token names
_is_identifier = re.compile(r'^[a-zA-Z0-9_]+$')
# Exception thrown when invalid token encountered and no default error
# handler is defined.
class LexError(Exception):
def __init__(self, message, s):
self.args = (message,)
self.text = s
# Token class. This class is used to represent the tokens produced.
class LexToken(object):
def __str__(self):
return 'LexToken(%s,%r,%d,%d)' % (self.type, self.value, self.lineno, self.lexpos)
def __repr__(self):
return str(self)
# This object is a stand-in for a logging object created by the
# logging module.
class PlyLogger(object):
def __init__(self, f):
self.f = f
def critical(self, msg, *args, **kwargs):
self.f.write((msg % args) + '\n')
def warning(self, msg, *args, **kwargs):
self.f.write('WARNING: ' + (msg % args) + '\n')
def error(self, msg, *args, **kwargs):
self.f.write('ERROR: ' + (msg % args) + '\n')
info = critical
debug = critical
# Null logger is used when no output is generated. Does nothing.
class NullLogger(object):
def __getattribute__(self, name):
return self
def __call__(self, *args, **kwargs):
return self
# -----------------------------------------------------------------------------
# === Lexing Engine ===
#
# The following Lexer class implements the lexer runtime. There are only
# a few public methods and attributes:
#
# input() - Store a new string in the lexer
# token() - Get the next token
# clone() - Clone the lexer
#
# lineno - Current line number
# lexpos - Current position in the input string
# -----------------------------------------------------------------------------
class Lexer:
def __init__(self):
self.lexre = None # Master regular expression. This is a list of
# tuples (re, findex) where re is a compiled
# regular expression and findex is a list
# mapping regex group numbers to rules
self.lexretext = None # Current regular expression strings
self.lexstatere = {} # Dictionary mapping lexer states to master regexs
self.lexstateretext = {} # Dictionary mapping lexer states to regex strings
self.lexstaterenames = {} # Dictionary mapping lexer states to symbol names
self.lexstate = 'INITIAL' # Current lexer state
self.lexstatestack = [] # Stack of lexer states
self.lexstateinfo = None # State information
self.lexstateignore = {} # Dictionary of ignored characters for each state
self.lexstateerrorf = {} # Dictionary of error functions for each state
self.lexstateeoff = {} # Dictionary of eof functions for each state
self.lexreflags = 0 # Optional re compile flags
self.lexdata = None # Actual input data (as a string)
self.lexpos = 0 # Current position in input text
self.lexlen = 0 # Length of the input text
self.lexerrorf = None # Error rule (if any)
self.lexeoff = None # EOF rule (if any)
self.lextokens = None # List of valid tokens
self.lexignore = '' # Ignored characters
self.lexliterals = '' # Literal characters that can be passed through
self.lexmodule = None # Module
self.lineno = 1 # Current line number
self.lexoptimize = False # Optimized mode
def clone(self, object=None):
c = copy.copy(self)
# If the object parameter has been supplied, it means we are attaching the
# lexer to a new object. In this case, we have to rebind all methods in
# the lexstatere and lexstateerrorf tables.
if object:
newtab = {}
for key, ritem in self.lexstatere.items():
newre = []
for cre, findex in ritem:
newfindex = []
for f in findex:
if not f or not f[0]:
newfindex.append(f)
continue
newfindex.append((getattr(object, f[0].__name__), f[1]))
newre.append((cre, newfindex))
newtab[key] = newre
c.lexstatere = newtab
c.lexstateerrorf = {}
for key, ef in self.lexstateerrorf.items():
c.lexstateerrorf[key] = getattr(object, ef.__name__)
c.lexmodule = object
return c
# ------------------------------------------------------------
# writetab() - Write lexer information to a table file
# ------------------------------------------------------------
def writetab(self, lextab, outputdir=''):
if isinstance(lextab, types.ModuleType):
raise IOError("Won't overwrite existing lextab module")
basetabmodule = lextab.split('.')[-1]
filename = os.path.join(outputdir, basetabmodule) + '.py'
with open(filename, 'w') as tf:
tf.write('# %s.py. This file automatically created by PLY (version %s). Don\'t edit!\n' % (basetabmodule, __version__))
tf.write('_tabversion = %s\n' % repr(__tabversion__))
tf.write('_lextokens = set(%s)\n' % repr(tuple(sorted(self.lextokens))))
tf.write('_lexreflags = %s\n' % repr(int(self.lexreflags)))
tf.write('_lexliterals = %s\n' % repr(self.lexliterals))
tf.write('_lexstateinfo = %s\n' % repr(self.lexstateinfo))
# Rewrite the lexstatere table, replacing function objects with function names
tabre = {}
for statename, lre in self.lexstatere.items():
titem = []
for (pat, func), retext, renames in zip(lre, self.lexstateretext[statename], self.lexstaterenames[statename]):
titem.append((retext, _funcs_to_names(func, renames)))
tabre[statename] = titem
tf.write('_lexstatere = %s\n' % repr(tabre))
tf.write('_lexstateignore = %s\n' % repr(self.lexstateignore))
taberr = {}
for statename, ef in self.lexstateerrorf.items():
taberr[statename] = ef.__name__ if ef else None
tf.write('_lexstateerrorf = %s\n' % repr(taberr))
tabeof = {}
for statename, ef in self.lexstateeoff.items():
tabeof[statename] = ef.__name__ if ef else None
tf.write('_lexstateeoff = %s\n' % repr(tabeof))
# ------------------------------------------------------------
# readtab() - Read lexer information from a tab file
# ------------------------------------------------------------
def readtab(self, tabfile, fdict):
if isinstance(tabfile, types.ModuleType):
lextab = tabfile
else:
exec('import %s' % tabfile)
lextab = sys.modules[tabfile]
if getattr(lextab, '_tabversion', '0.0') != __tabversion__:
raise ImportError('Inconsistent PLY version')
self.lextokens = lextab._lextokens
self.lexreflags = lextab._lexreflags
self.lexliterals = lextab._lexliterals
self.lextokens_all = self.lextokens | set(self.lexliterals)
self.lexstateinfo = lextab._lexstateinfo
self.lexstateignore = lextab._lexstateignore
self.lexstatere = {}
self.lexstateretext = {}
for statename, lre in lextab._lexstatere.items():
titem = []
txtitem = []
for pat, func_name in lre:
titem.append((re.compile(pat, lextab._lexreflags), _names_to_funcs(func_name, fdict)))
self.lexstatere[statename] = titem
self.lexstateretext[statename] = txtitem
self.lexstateerrorf = {}
for statename, ef in lextab._lexstateerrorf.items():
self.lexstateerrorf[statename] = fdict[ef]
self.lexstateeoff = {}
for statename, ef in lextab._lexstateeoff.items():
self.lexstateeoff[statename] = fdict[ef]
self.begin('INITIAL')
# ------------------------------------------------------------
# input() - Push a new string into the lexer
# ------------------------------------------------------------
def input(self, s):
# Pull off the first character to see if s looks like a string
c = s[:1]
if not isinstance(c, StringTypes):
raise ValueError('Expected a string')
self.lexdata = s
self.lexpos = 0
self.lexlen = len(s)
# ------------------------------------------------------------
# begin() - Changes the lexing state
# ------------------------------------------------------------
def begin(self, state):
if state not in self.lexstatere:
raise ValueError('Undefined state')
self.lexre = self.lexstatere[state]
self.lexretext = self.lexstateretext[state]
self.lexignore = self.lexstateignore.get(state, '')
self.lexerrorf = self.lexstateerrorf.get(state, None)
self.lexeoff = self.lexstateeoff.get(state, None)
self.lexstate = state
# ------------------------------------------------------------
# push_state() - Changes the lexing state and saves old on stack
# ------------------------------------------------------------
def push_state(self, state):
self.lexstatestack.append(self.lexstate)
self.begin(state)
# ------------------------------------------------------------
# pop_state() - Restores the previous state
# ------------------------------------------------------------
def pop_state(self):
self.begin(self.lexstatestack.pop())
# ------------------------------------------------------------
# current_state() - Returns the current lexing state
# ------------------------------------------------------------
def current_state(self):
return self.lexstate
# ------------------------------------------------------------
# skip() - Skip ahead n characters
# ------------------------------------------------------------
def skip(self, n):
self.lexpos += n
# ------------------------------------------------------------
# opttoken() - Return the next token from the Lexer
#
# Note: This function has been carefully implemented to be as fast
# as possible. Don't make changes unless you really know what
# you are doing
# ------------------------------------------------------------
def token(self):
# Make local copies of frequently referenced attributes
lexpos = self.lexpos
lexlen = self.lexlen
lexignore = self.lexignore
lexdata = self.lexdata
while lexpos < lexlen:
# This code provides some short-circuit code for whitespace, tabs, and other ignored characters
if lexdata[lexpos] in lexignore:
lexpos += 1
continue
# Look for a regular expression match
for lexre, lexindexfunc in self.lexre:
m = lexre.match(lexdata, lexpos)
if not m:
continue
# Create a token for return
tok = LexToken()
tok.value = m.group()
tok.lineno = self.lineno
tok.lexpos = lexpos
i = m.lastindex
func, tok.type = lexindexfunc[i]
if not func:
# If no token type was set, it's an ignored token
if tok.type:
self.lexpos = m.end()
return tok
else:
lexpos = m.end()
break
lexpos = m.end()
# If token is processed by a function, call it
tok.lexer = self # Set additional attributes useful in token rules
self.lexmatch = m
self.lexpos = lexpos
newtok = func(tok)
# Every function must return a token, if nothing, we just move to next token
if not newtok:
lexpos = self.lexpos # This is here in case user has updated lexpos.
lexignore = self.lexignore # This is here in case there was a state change
break
# Verify type of the token. If not in the token map, raise an error
if not self.lexoptimize:
if newtok.type not in self.lextokens_all:
raise LexError("%s:%d: Rule '%s' returned an unknown token type '%s'" % (
func.__code__.co_filename, func.__code__.co_firstlineno,
func.__name__, newtok.type), lexdata[lexpos:])
return newtok
else:
# No match, see if in literals
if lexdata[lexpos] in self.lexliterals:
tok = LexToken()
tok.value = lexdata[lexpos]
tok.lineno = self.lineno
tok.type = tok.value
tok.lexpos = lexpos
self.lexpos = lexpos + 1
return tok
# No match. Call t_error() if defined.
if self.lexerrorf:
tok = LexToken()
tok.value = self.lexdata[lexpos:]
tok.lineno = self.lineno
tok.type = 'error'
tok.lexer = self
tok.lexpos = lexpos
self.lexpos = lexpos
newtok = self.lexerrorf(tok)
if lexpos == self.lexpos:
# Error method didn't change text position at all. This is an error.
raise LexError("Scanning error. Illegal character '%s'" % (lexdata[lexpos]), lexdata[lexpos:])
lexpos = self.lexpos
if not newtok:
continue
return newtok
self.lexpos = lexpos
raise LexError("Illegal character '%s' at index %d" % (lexdata[lexpos], lexpos), lexdata[lexpos:])
if self.lexeoff:
tok = LexToken()
tok.type = 'eof'
tok.value = ''
tok.lineno = self.lineno
tok.lexpos = lexpos
tok.lexer = self
self.lexpos = lexpos
newtok = self.lexeoff(tok)
return newtok
self.lexpos = lexpos + 1
if self.lexdata is None:
raise RuntimeError('No input string given with input()')
return None
# Iterator interface
def __iter__(self):
return self
def next(self):
t = self.token()
if t is None:
raise StopIteration
return t
__next__ = next
# -----------------------------------------------------------------------------
# ==== Lex Builder ===
#
# The functions and classes below are used to collect lexing information
# and build a Lexer object from it.
# -----------------------------------------------------------------------------
# -----------------------------------------------------------------------------
# _get_regex(func)
#
# Returns the regular expression assigned to a function either as a doc string
# or as a .regex attribute attached by the @TOKEN decorator.
# -----------------------------------------------------------------------------
def _get_regex(func):
return getattr(func, 'regex', func.__doc__)
# -----------------------------------------------------------------------------
# get_caller_module_dict()
#
# This function returns a dictionary containing all of the symbols defined within
# a caller further down the call stack. This is used to get the environment
# associated with the yacc() call if none was provided.
# -----------------------------------------------------------------------------
def get_caller_module_dict(levels):
f = sys._getframe(levels)
ldict = f.f_globals.copy()
if f.f_globals != f.f_locals:
ldict.update(f.f_locals)
return ldict
# -----------------------------------------------------------------------------
# _funcs_to_names()
#
# Given a list of regular expression functions, this converts it to a list
# suitable for output to a table file
# -----------------------------------------------------------------------------
def _funcs_to_names(funclist, namelist):
result = []
for f, name in zip(funclist, namelist):
if f and f[0]:
result.append((name, f[1]))
else:
result.append(f)
return result
# -----------------------------------------------------------------------------
# _names_to_funcs()
#
# Given a list of regular expression function names, this converts it back to
# functions.
# -----------------------------------------------------------------------------
def _names_to_funcs(namelist, fdict):
result = []
for n in namelist:
if n and n[0]:
result.append((fdict[n[0]], n[1]))
else:
result.append(n)
return result
# -----------------------------------------------------------------------------
# _form_master_re()
#
# This function takes a list of all of the regex components and attempts to
# form the master regular expression. Given limitations in the Python re
# module, it may be necessary to break the master regex into separate expressions.
# -----------------------------------------------------------------------------
def _form_master_re(relist, reflags, ldict, toknames):
if not relist:
return []
regex = '|'.join(relist)
try:
lexre = re.compile(regex, reflags)
# Build the index to function map for the matching engine
lexindexfunc = [None] * (max(lexre.groupindex.values()) + 1)
lexindexnames = lexindexfunc[:]
for f, i in lexre.groupindex.items():
handle = ldict.get(f, None)
if type(handle) in (types.FunctionType, types.MethodType):
lexindexfunc[i] = (handle, toknames[f])
lexindexnames[i] = f
elif handle is not None:
lexindexnames[i] = f
if f.find('ignore_') > 0:
lexindexfunc[i] = (None, None)
else:
lexindexfunc[i] = (None, toknames[f])
return [(lexre, lexindexfunc)], [regex], [lexindexnames]
except Exception:
m = int(len(relist)/2)
if m == 0:
m = 1
llist, lre, lnames = _form_master_re(relist[:m], reflags, ldict, toknames)
rlist, rre, rnames = _form_master_re(relist[m:], reflags, ldict, toknames)
return (llist+rlist), (lre+rre), (lnames+rnames)
# -----------------------------------------------------------------------------
# def _statetoken(s,names)
#
# Given a declaration name s of the form "t_" and a dictionary whose keys are
# state names, this function returns a tuple (states,tokenname) where states
# is a tuple of state names and tokenname is the name of the token. For example,
# calling this with s = "t_foo_bar_SPAM" might return (('foo','bar'),'SPAM')
# -----------------------------------------------------------------------------
def _statetoken(s, names):
parts = s.split('_')
for i, part in enumerate(parts[1:], 1):
if part not in names and part != 'ANY':
break
if i > 1:
states = tuple(parts[1:i])
else:
states = ('INITIAL',)
if 'ANY' in states:
states = tuple(names)
tokenname = '_'.join(parts[i:])
return (states, tokenname)
# -----------------------------------------------------------------------------
# LexerReflect()
#
# This class represents information needed to build a lexer as extracted from a
# user's input file.
# -----------------------------------------------------------------------------
class LexerReflect(object):
def __init__(self, ldict, log=None, reflags=0):
self.ldict = ldict
self.error_func = None
self.tokens = []
self.reflags = reflags
self.stateinfo = {'INITIAL': 'inclusive'}
self.modules = set()
self.error = False
self.log = PlyLogger(sys.stderr) if log is None else log
# Get all of the basic information
def get_all(self):
self.get_tokens()
self.get_literals()
self.get_states()
self.get_rules()
# Validate all of the information
def validate_all(self):
self.validate_tokens()
self.validate_literals()
self.validate_rules()
return self.error
# Get the tokens map
def get_tokens(self):
tokens = self.ldict.get('tokens', None)
if not tokens:
self.log.error('No token list is defined')
self.error = True
return
if not isinstance(tokens, (list, tuple)):
self.log.error('tokens must be a list or tuple')
self.error = True
return
if not tokens:
self.log.error('tokens is empty')
self.error = True
return
self.tokens = tokens
# Validate the tokens
def validate_tokens(self):
terminals = {}
for n in self.tokens:
if not _is_identifier.match(n):
self.log.error("Bad token name '%s'", n)
self.error = True
if n in terminals:
self.log.warning("Token '%s' multiply defined", n)
terminals[n] = 1
# Get the literals specifier
def get_literals(self):
self.literals = self.ldict.get('literals', '')
if not self.literals:
self.literals = ''
# Validate literals
def validate_literals(self):
try:
for c in self.literals:
if not isinstance(c, StringTypes) or len(c) > 1:
self.log.error('Invalid literal %s. Must be a single character', repr(c))
self.error = True
except TypeError:
self.log.error('Invalid literals specification. literals must be a sequence of characters')
self.error = True
def get_states(self):
self.states = self.ldict.get('states', None)
# Build statemap
if self.states:
if not isinstance(self.states, (tuple, list)):
self.log.error('states must be defined as a tuple or list')
self.error = True
else:
for s in self.states:
if not isinstance(s, tuple) or len(s) != 2:
self.log.error("Invalid state specifier %s. Must be a tuple (statename,'exclusive|inclusive')", repr(s))
self.error = True
continue
name, statetype = s
if not isinstance(name, StringTypes):
self.log.error('State name %s must be a string', repr(name))
self.error = True
continue
if not (statetype == 'inclusive' or statetype == 'exclusive'):
self.log.error("State type for state %s must be 'inclusive' or 'exclusive'", name)
self.error = True
continue
if name in self.stateinfo:
self.log.error("State '%s' already defined", name)
self.error = True
continue
self.stateinfo[name] = statetype
# Get all of the symbols with a t_ prefix and sort them into various
# categories (functions, strings, error functions, and ignore characters)
def get_rules(self):
tsymbols = [f for f in self.ldict if f[:2] == 't_']
# Now build up a list of functions and a list of strings
self.toknames = {} # Mapping of symbols to token names
self.funcsym = {} # Symbols defined as functions
self.strsym = {} # Symbols defined as strings
self.ignore = {} # Ignore strings by state
self.errorf = {} # Error functions by state
self.eoff = {} # EOF functions by state
for s in self.stateinfo:
self.funcsym[s] = []
self.strsym[s] = []
if len(tsymbols) == 0:
self.log.error('No rules of the form t_rulename are defined')
self.error = True
return
for f in tsymbols:
t = self.ldict[f]
states, tokname = _statetoken(f, self.stateinfo)
self.toknames[f] = tokname
if hasattr(t, '__call__'):
if tokname == 'error':
for s in states:
self.errorf[s] = t
elif tokname == 'eof':
for s in states:
self.eoff[s] = t
elif tokname == 'ignore':
line = t.__code__.co_firstlineno
file = t.__code__.co_filename
self.log.error("%s:%d: Rule '%s' must be defined as a string", file, line, t.__name__)
self.error = True
else:
for s in states:
self.funcsym[s].append((f, t))
elif isinstance(t, StringTypes):
if tokname == 'ignore':
for s in states:
self.ignore[s] = t
if '\\' in t:
self.log.warning("%s contains a literal backslash '\\'", f)
elif tokname == 'error':
self.log.error("Rule '%s' must be defined as a function", f)
self.error = True
else:
for s in states:
self.strsym[s].append((f, t))
else:
self.log.error('%s not defined as a function or string', f)
self.error = True
# Sort the functions by line number
for f in self.funcsym.values():
f.sort(key=lambda x: x[1].__code__.co_firstlineno)
# Sort the strings by regular expression length
for s in self.strsym.values():
s.sort(key=lambda x: len(x[1]), reverse=True)
# Validate all of the t_rules collected
def validate_rules(self):
for state in self.stateinfo:
# Validate all rules defined by functions
for fname, f in self.funcsym[state]:
line = f.__code__.co_firstlineno
file = f.__code__.co_filename
module = inspect.getmodule(f)
self.modules.add(module)
tokname = self.toknames[fname]
if isinstance(f, types.MethodType):
reqargs = 2
else:
reqargs = 1
nargs = f.__code__.co_argcount
if nargs > reqargs:
self.log.error("%s:%d: Rule '%s' has too many arguments", file, line, f.__name__)
self.error = True
continue
if nargs < reqargs:
self.log.error("%s:%d: Rule '%s' requires an argument", file, line, f.__name__)
self.error = True
continue
if not _get_regex(f):
self.log.error("%s:%d: No regular expression defined for rule '%s'", file, line, f.__name__)
self.error = True
continue
try:
c = re.compile('(?P<%s>%s)' % (fname, _get_regex(f)), self.reflags)
if c.match(''):
self.log.error("%s:%d: Regular expression for rule '%s' matches empty string", file, line, f.__name__)
self.error = True
except re.error as e:
self.log.error("%s:%d: Invalid regular expression for rule '%s'. %s", file, line, f.__name__, e)
if '#' in _get_regex(f):
self.log.error("%s:%d. Make sure '#' in rule '%s' is escaped with '\\#'", file, line, f.__name__)
self.error = True
# Validate all rules defined by strings
for name, r in self.strsym[state]:
tokname = self.toknames[name]
if tokname == 'error':
self.log.error("Rule '%s' must be defined as a function", name)
self.error = True
continue
if tokname not in self.tokens and tokname.find('ignore_') < 0:
self.log.error("Rule '%s' defined for an unspecified token %s", name, tokname)
self.error = True
continue
try:
c = re.compile('(?P<%s>%s)' % (name, r), self.reflags)
if (c.match('')):
self.log.error("Regular expression for rule '%s' matches empty string", name)
self.error = True
except re.error as e:
self.log.error("Invalid regular expression for rule '%s'. %s", name, e)
if '#' in r:
self.log.error("Make sure '#' in rule '%s' is escaped with '\\#'", name)
self.error = True
if not self.funcsym[state] and not self.strsym[state]:
self.log.error("No rules defined for state '%s'", state)
self.error = True
# Validate the error function
efunc = self.errorf.get(state, None)
if efunc:
f = efunc
line = f.__code__.co_firstlineno
file = f.__code__.co_filename
module = inspect.getmodule(f)
self.modules.add(module)
if isinstance(f, types.MethodType):
reqargs = 2
else:
reqargs = 1
nargs = f.__code__.co_argcount
if nargs > reqargs:
self.log.error("%s:%d: Rule '%s' has too many arguments", file, line, f.__name__)
self.error = True
if nargs < reqargs:
self.log.error("%s:%d: Rule '%s' requires an argument", file, line, f.__name__)
self.error = True
for module in self.modules:
self.validate_module(module)
# -----------------------------------------------------------------------------
# validate_module()
#
# This checks to see if there are duplicated t_rulename() functions or strings
# in the parser input file. This is done using a simple regular expression
# match on each line in the source code of the given module.
# -----------------------------------------------------------------------------
def validate_module(self, module):
try:
lines, linen = inspect.getsourcelines(module)
except IOError:
return
fre = re.compile(r'\s*def\s+(t_[a-zA-Z_0-9]*)\(')
sre = re.compile(r'\s*(t_[a-zA-Z_0-9]*)\s*=')
counthash = {}
linen += 1
for line in lines:
m = fre.match(line)
if not m:
m = sre.match(line)
if m:
name = m.group(1)
prev = counthash.get(name)
if not prev:
counthash[name] = linen
else:
filename = inspect.getsourcefile(module)
self.log.error('%s:%d: Rule %s redefined. Previously defined on line %d', filename, linen, name, prev)
self.error = True
linen += 1
# -----------------------------------------------------------------------------
# lex(module)
#
# Build all of the regular expression rules from definitions in the supplied module
# -----------------------------------------------------------------------------
def lex(module=None, object=None, debug=False, optimize=False, lextab='lextab',
reflags=int(re.VERBOSE), nowarn=False, outputdir=None, debuglog=None, errorlog=None):
if lextab is None:
lextab = 'lextab'
global lexer
ldict = None
stateinfo = {'INITIAL': 'inclusive'}
lexobj = Lexer()
lexobj.lexoptimize = optimize
global token, input
if errorlog is None:
errorlog = PlyLogger(sys.stderr)
if debug:
if debuglog is None:
debuglog = PlyLogger(sys.stderr)
# Get the module dictionary used for the lexer
if object:
module = object
# Get the module dictionary used for the parser
if module:
_items = [(k, getattr(module, k)) for k in dir(module)]
ldict = dict(_items)
# If no __file__ attribute is available, try to obtain it from the __module__ instead
if '__file__' not in ldict:
ldict['__file__'] = sys.modules[ldict['__module__']].__file__
else:
ldict = get_caller_module_dict(2)
# Determine if the module is package of a package or not.
# If so, fix the tabmodule setting so that tables load correctly
pkg = ldict.get('__package__')
if pkg and isinstance(lextab, str):
if '.' not in lextab:
lextab = pkg + '.' + lextab
# Collect parser information from the dictionary
linfo = LexerReflect(ldict, log=errorlog, reflags=reflags)
linfo.get_all()
if not optimize:
if linfo.validate_all():
raise SyntaxError("Can't build lexer")
if optimize and lextab:
try:
lexobj.readtab(lextab, ldict)
token = lexobj.token
input = lexobj.input
lexer = lexobj
return lexobj
except ImportError:
pass
# Dump some basic debugging information
if debug:
debuglog.info('lex: tokens = %r', linfo.tokens)
debuglog.info('lex: literals = %r', linfo.literals)
debuglog.info('lex: states = %r', linfo.stateinfo)
# Build a dictionary of valid token names
lexobj.lextokens = set()
for n in linfo.tokens:
lexobj.lextokens.add(n)
# Get literals specification
if isinstance(linfo.literals, (list, tuple)):
lexobj.lexliterals = type(linfo.literals[0])().join(linfo.literals)
else:
lexobj.lexliterals = linfo.literals
lexobj.lextokens_all = lexobj.lextokens | set(lexobj.lexliterals)
# Get the stateinfo dictionary
stateinfo = linfo.stateinfo
regexs = {}
# Build the master regular expressions
for state in stateinfo:
regex_list = []
# Add rules defined by functions first
for fname, f in linfo.funcsym[state]:
regex_list.append('(?P<%s>%s)' % (fname, _get_regex(f)))
if debug:
debuglog.info("lex: Adding rule %s -> '%s' (state '%s')", fname, _get_regex(f), state)
# Now add all of the simple rules
for name, r in linfo.strsym[state]:
regex_list.append('(?P<%s>%s)' % (name, r))
if debug:
debuglog.info("lex: Adding rule %s -> '%s' (state '%s')", name, r, state)
regexs[state] = regex_list
# Build the master regular expressions
if debug:
debuglog.info('lex: ==== MASTER REGEXS FOLLOW ====')
for state in regexs:
lexre, re_text, re_names = _form_master_re(regexs[state], reflags, ldict, linfo.toknames)
lexobj.lexstatere[state] = lexre
lexobj.lexstateretext[state] = re_text
lexobj.lexstaterenames[state] = re_names
if debug:
for i, text in enumerate(re_text):
debuglog.info("lex: state '%s' : regex[%d] = '%s'", state, i, text)
# For inclusive states, we need to add the regular expressions from the INITIAL state
for state, stype in stateinfo.items():
if state != 'INITIAL' and stype == 'inclusive':
lexobj.lexstatere[state].extend(lexobj.lexstatere['INITIAL'])
lexobj.lexstateretext[state].extend(lexobj.lexstateretext['INITIAL'])
lexobj.lexstaterenames[state].extend(lexobj.lexstaterenames['INITIAL'])
lexobj.lexstateinfo = stateinfo
lexobj.lexre = lexobj.lexstatere['INITIAL']
lexobj.lexretext = lexobj.lexstateretext['INITIAL']
lexobj.lexreflags = reflags
# Set up ignore variables
lexobj.lexstateignore = linfo.ignore
lexobj.lexignore = lexobj.lexstateignore.get('INITIAL', '')
# Set up error functions
lexobj.lexstateerrorf = linfo.errorf
lexobj.lexerrorf = linfo.errorf.get('INITIAL', None)
if not lexobj.lexerrorf:
errorlog.warning('No t_error rule is defined')
# Set up eof functions
lexobj.lexstateeoff = linfo.eoff
lexobj.lexeoff = linfo.eoff.get('INITIAL', None)
# Check state information for ignore and error rules
for s, stype in stateinfo.items():
if stype == 'exclusive':
if s not in linfo.errorf:
errorlog.warning("No error rule is defined for exclusive state '%s'", s)
if s not in linfo.ignore and lexobj.lexignore:
errorlog.warning("No ignore rule is defined for exclusive state '%s'", s)
elif stype == 'inclusive':
if s not in linfo.errorf:
linfo.errorf[s] = linfo.errorf.get('INITIAL', None)
if s not in linfo.ignore:
linfo.ignore[s] = linfo.ignore.get('INITIAL', '')
# Create global versions of the token() and input() functions
token = lexobj.token
input = lexobj.input
lexer = lexobj
# If in optimize mode, we write the lextab
if lextab and optimize:
if outputdir is None:
# If no output directory is set, the location of the output files
# is determined according to the following rules:
# - If lextab specifies a package, files go into that package directory
# - Otherwise, files go in the same directory as the specifying module
if isinstance(lextab, types.ModuleType):
srcfile = lextab.__file__
else:
if '.' not in lextab:
srcfile = ldict['__file__']
else:
parts = lextab.split('.')
pkgname = '.'.join(parts[:-1])
exec('import %s' % pkgname)
srcfile = getattr(sys.modules[pkgname], '__file__', '')
outputdir = os.path.dirname(srcfile)
try:
lexobj.writetab(lextab, outputdir)
if lextab in sys.modules:
del sys.modules[lextab]
except IOError as e:
errorlog.warning("Couldn't write lextab module %r. %s" % (lextab, e))
return lexobj
# -----------------------------------------------------------------------------
# runmain()
#
# This runs the lexer as a main program
# -----------------------------------------------------------------------------
def runmain(lexer=None, data=None):
if not data:
try:
filename = sys.argv[1]
f = open(filename)
data = f.read()
f.close()
except IndexError:
sys.stdout.write('Reading from standard input (type EOF to end):\n')
data = sys.stdin.read()
if lexer:
_input = lexer.input
else:
_input = input
_input(data)
if lexer:
_token = lexer.token
else:
_token = token
while True:
tok = _token()
if not tok:
break
sys.stdout.write('(%s,%r,%d,%d)\n' % (tok.type, tok.value, tok.lineno, tok.lexpos))
# -----------------------------------------------------------------------------
# @TOKEN(regex)
#
# This decorator function can be used to set the regex expression on a function
# when its docstring might need to be set in an alternative way
# -----------------------------------------------------------------------------
def TOKEN(r):
def set_regex(f):
if hasattr(r, '__call__'):
f.regex = _get_regex(r)
else:
f.regex = r
return f
return set_regex
# Alternative spelling of the TOKEN decorator
Token = TOKEN
sepolgen/audit.py 0000644 00000052734 14751155147 0010065 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
import re
import sys
from . import refpolicy
from . import access
from . import util
# Convenience functions
def get_audit_boot_msgs():
"""Obtain all of the avc and policy load messages from the audit
log. This function uses ausearch and requires that the current
process have sufficient rights to run ausearch.
Returns:
string contain all of the audit messages returned by ausearch.
"""
import subprocess
import time
fd=open("/proc/uptime", "r")
off=float(fd.read().split()[0])
fd.close
s = time.localtime(time.time() - off)
bootdate = time.strftime("%x", s)
boottime = time.strftime("%X", s)
output = subprocess.Popen(["/sbin/ausearch", "-m", "AVC,USER_AVC,MAC_POLICY_LOAD,DAEMON_START,SELINUX_ERR", "-ts", bootdate, boottime],
stdout=subprocess.PIPE).communicate()[0]
if util.PY3:
output = util.decode_input(output)
return output
def get_audit_msgs():
"""Obtain all of the avc and policy load messages from the audit
log. This function uses ausearch and requires that the current
process have sufficient rights to run ausearch.
Returns:
string contain all of the audit messages returned by ausearch.
"""
import subprocess
output = subprocess.Popen(["/sbin/ausearch", "-m", "AVC,USER_AVC,MAC_POLICY_LOAD,DAEMON_START,SELINUX_ERR"],
stdout=subprocess.PIPE).communicate()[0]
if util.PY3:
output = util.decode_input(output)
return output
def get_dmesg_msgs():
"""Obtain all of the avc and policy load messages from /bin/dmesg.
Returns:
string contain all of the audit messages returned by dmesg.
"""
import subprocess
output = subprocess.Popen(["/bin/dmesg"],
stdout=subprocess.PIPE).communicate()[0]
if util.PY3:
output = util.decode_input(output)
return output
# Classes representing audit messages
class AuditMessage:
"""Base class for all objects representing audit messages.
AuditMessage is a base class for all audit messages and only
provides storage for the raw message (as a string) and a
parsing function that does nothing.
"""
def __init__(self, message):
self.message = message
self.header = ""
def from_split_string(self, recs):
"""Parse a string that has been split into records by space into
an audit message.
This method should be overridden by subclasses. Error reporting
should be done by raise ValueError exceptions.
"""
for msg in recs:
fields = msg.split("=")
if len(fields) != 2:
if msg[:6] == "audit(":
self.header = msg
return
else:
continue
if fields[0] == "msg":
self.header = fields[1]
return
class InvalidMessage(AuditMessage):
"""Class representing invalid audit messages. This is used to differentiate
between audit messages that aren't recognized (that should return None from
the audit message parser) and a message that is recognized but is malformed
in some way.
"""
def __init__(self, message):
AuditMessage.__init__(self, message)
class PathMessage(AuditMessage):
"""Class representing a path message"""
def __init__(self, message):
AuditMessage.__init__(self, message)
self.path = ""
def from_split_string(self, recs):
AuditMessage.from_split_string(self, recs)
for msg in recs:
fields = msg.split("=")
if len(fields) != 2:
continue
if fields[0] == "path":
self.path = fields[1][1:-1]
return
import selinux.audit2why as audit2why
avcdict = {}
class AVCMessage(AuditMessage):
"""AVC message representing an access denial or granted message.
This is a very basic class and does not represent all possible fields
in an avc message. Currently the fields are:
scontext - context for the source (process) that generated the message
tcontext - context for the target
tclass - object class for the target (only one)
comm - the process name
exe - the on-disc binary
path - the path of the target
access - list of accesses that were allowed or denied
denial - boolean indicating whether this was a denial (True) or granted
(False) message.
ioctlcmd - ioctl 'request' parameter
An example audit message generated from the audit daemon looks like (line breaks
added):
'type=AVC msg=audit(1155568085.407:10877): avc: denied { search } for
pid=677 comm="python" name="modules" dev=dm-0 ino=13716388
scontext=user_u:system_r:setroubleshootd_t:s0
tcontext=system_u:object_r:modules_object_t:s0 tclass=dir'
An example audit message stored in syslog (not processed by the audit daemon - line
breaks added):
'Sep 12 08:26:43 dhcp83-5 kernel: audit(1158064002.046:4): avc: denied { read }
for pid=2 496 comm="bluez-pin" name=".gdm1K3IFT" dev=dm-0 ino=3601333
scontext=user_u:system_r:bluetooth_helper_t:s0-s0:c0
tcontext=system_u:object_r:xdm_tmp_t:s0 tclass=file
"""
def __init__(self, message):
AuditMessage.__init__(self, message)
self.scontext = refpolicy.SecurityContext()
self.tcontext = refpolicy.SecurityContext()
self.tclass = ""
self.comm = ""
self.exe = ""
self.path = ""
self.name = ""
self.accesses = []
self.denial = True
self.ioctlcmd = None
self.type = audit2why.TERULE
def __parse_access(self, recs, start):
# This is kind of sucky - the access that is in a space separated
# list like '{ read write }'. This doesn't fit particularly well with splitting
# the string on spaces. This function takes the list of recs and a starting
# position one beyond the open brace. It then adds the accesses until it finds
# the close brace or the end of the list (which is an error if reached without
# seeing a close brace).
found_close = False
i = start
if i == (len(recs) - 1):
raise ValueError("AVC message in invalid format [%s]\n" % self.message)
while i < len(recs):
if recs[i] == "}":
found_close = True
break
self.accesses.append(recs[i])
i = i + 1
if not found_close:
raise ValueError("AVC message in invalid format [%s]\n" % self.message)
return i + 1
def from_split_string(self, recs):
AuditMessage.from_split_string(self, recs)
# FUTURE - fully parse avc messages and store all possible fields
# Required fields
found_src = False
found_tgt = False
found_class = False
found_access = False
for i in range(len(recs)):
if recs[i] == "{":
i = self.__parse_access(recs, i + 1)
found_access = True
continue
elif recs[i] == "granted":
self.denial = False
fields = recs[i].split("=")
if len(fields) != 2:
continue
if fields[0] == "scontext":
self.scontext = refpolicy.SecurityContext(fields[1])
found_src = True
elif fields[0] == "tcontext":
self.tcontext = refpolicy.SecurityContext(fields[1])
found_tgt = True
elif fields[0] == "tclass":
self.tclass = fields[1]
found_class = True
elif fields[0] == "comm":
self.comm = fields[1][1:-1]
elif fields[0] == "exe":
self.exe = fields[1][1:-1]
elif fields[0] == "name":
self.name = fields[1][1:-1]
elif fields[0] == "ioctlcmd":
try:
self.ioctlcmd = int(fields[1], 16)
except ValueError:
pass
if not found_src or not found_tgt or not found_class or not found_access:
raise ValueError("AVC message in invalid format [%s]\n" % self.message)
self.analyze()
def analyze(self):
tcontext = self.tcontext.to_string()
scontext = self.scontext.to_string()
access_tuple = tuple( self.accesses)
self.data = []
if (scontext, tcontext, self.tclass, access_tuple) in avcdict.keys():
self.type, self.data = avcdict[(scontext, tcontext, self.tclass, access_tuple)]
else:
self.type, self.data = audit2why.analyze(scontext, tcontext, self.tclass, self.accesses)
if self.type == audit2why.NOPOLICY:
self.type = audit2why.TERULE
if self.type == audit2why.BADTCON:
raise ValueError("Invalid Target Context %s\n" % tcontext)
if self.type == audit2why.BADSCON:
raise ValueError("Invalid Source Context %s\n" % scontext)
if self.type == audit2why.BADSCON:
raise ValueError("Invalid Type Class %s\n" % self.tclass)
if self.type == audit2why.BADPERM:
raise ValueError("Invalid permission %s\n" % " ".join(self.accesses))
if self.type == audit2why.BADCOMPUTE:
raise ValueError("Error during access vector computation")
if self.type == audit2why.CONSTRAINT:
self.data = [ self.data ]
if self.scontext.user != self.tcontext.user:
self.data.append(("user (%s)" % self.scontext.user, 'user (%s)' % self.tcontext.user))
if self.scontext.role != self.tcontext.role and self.tcontext.role != "object_r":
self.data.append(("role (%s)" % self.scontext.role, 'role (%s)' % self.tcontext.role))
if self.scontext.level != self.tcontext.level:
self.data.append(("level (%s)" % self.scontext.level, 'level (%s)' % self.tcontext.level))
avcdict[(scontext, tcontext, self.tclass, access_tuple)] = (self.type, self.data)
class PolicyLoadMessage(AuditMessage):
"""Audit message indicating that the policy was reloaded."""
def __init__(self, message):
AuditMessage.__init__(self, message)
class DaemonStartMessage(AuditMessage):
"""Audit message indicating that a daemon was started."""
def __init__(self, message):
AuditMessage.__init__(self, message)
self.auditd = False
def from_split_string(self, recs):
AuditMessage.from_split_string(self, recs)
if "auditd" in recs:
self.auditd = True
class ComputeSidMessage(AuditMessage):
"""Audit message indicating that a sid was not valid.
Compute sid messages are generated on attempting to create a security
context that is not valid. Security contexts are invalid if the role is
not authorized for the user or the type is not authorized for the role.
This class does not store all of the fields from the compute sid message -
just the type and role.
"""
def __init__(self, message):
AuditMessage.__init__(self, message)
self.invalid_context = refpolicy.SecurityContext()
self.scontext = refpolicy.SecurityContext()
self.tcontext = refpolicy.SecurityContext()
self.tclass = ""
def from_split_string(self, recs):
AuditMessage.from_split_string(self, recs)
if len(recs) < 10:
raise ValueError("Split string does not represent a valid compute sid message")
try:
self.invalid_context = refpolicy.SecurityContext(recs[5])
self.scontext = refpolicy.SecurityContext(recs[7].split("=")[1])
self.tcontext = refpolicy.SecurityContext(recs[8].split("=")[1])
self.tclass = recs[9].split("=")[1]
except:
raise ValueError("Split string does not represent a valid compute sid message")
def output(self):
return "role %s types %s;\n" % (self.role, self.type)
# Parser for audit messages
class AuditParser:
"""Parser for audit messages.
This class parses audit messages and stores them according to their message
type. This is not a general purpose audit message parser - it only extracts
selinux related messages.
Each audit messages are stored in one of four lists:
avc_msgs - avc denial or granted messages. Messages are stored in
AVCMessage objects.
comput_sid_messages - invalid sid messages. Messages are stored in
ComputSidMessage objects.
invalid_msgs - selinux related messages that are not valid. Messages
are stored in InvalidMessageObjects.
policy_load_messages - policy load messages. Messages are stored in
PolicyLoadMessage objects.
These lists will be reset when a policy load message is seen if
AuditParser.last_load_only is set to true. It is assumed that messages
are fed to the parser in chronological order - time stamps are not
parsed.
"""
def __init__(self, last_load_only=False):
self.__initialize()
self.last_load_only = last_load_only
def __initialize(self):
self.avc_msgs = []
self.compute_sid_msgs = []
self.invalid_msgs = []
self.policy_load_msgs = []
self.path_msgs = []
self.by_header = { }
self.check_input_file = False
# Low-level parsing function - tries to determine if this audit
# message is an SELinux related message and then parses it into
# the appropriate AuditMessage subclass. This function deliberately
# does not impose policy (e.g., on policy load message) or store
# messages to make as simple and reusable as possible.
#
# Return values:
# None - no recognized audit message found in this line
#
# InvalidMessage - a recognized but invalid message was found.
#
# AuditMessage (or subclass) - object representing a parsed
# and valid audit message.
def __parse_line(self, line):
# strip("\x1c\x1d\x1e\x85") is only needed for python2
# since str.split() in python3 already does this
rec = [x.strip("\x1c\x1d\x1e\x85") for x in line.split()]
for i in rec:
found = False
if i == "avc:" or i == "message=avc:" or i == "msg='avc:":
msg = AVCMessage(line)
found = True
elif i == "security_compute_sid:":
msg = ComputeSidMessage(line)
found = True
elif i == "type=MAC_POLICY_LOAD" or i == "type=1403":
msg = PolicyLoadMessage(line)
found = True
elif i == "type=AVC_PATH":
msg = PathMessage(line)
found = True
elif i == "type=DAEMON_START":
msg = DaemonStartMessage(list)
found = True
if found:
self.check_input_file = True
try:
msg.from_split_string(rec)
except ValueError:
msg = InvalidMessage(line)
return msg
return None
# Higher-level parse function - take a line, parse it into an
# AuditMessage object, and store it in the appropriate list.
# This function will optionally reset all of the lists when
# it sees a load policy message depending on the value of
# self.last_load_only.
def __parse(self, line):
msg = self.__parse_line(line)
if msg is None:
return
# Append to the correct list
if isinstance(msg, PolicyLoadMessage):
if self.last_load_only:
self.__initialize()
elif isinstance(msg, DaemonStartMessage):
# We initialize every time the auditd is started. This
# is less than ideal, but unfortunately it is the only
# way to catch reboots since the initial policy load
# by init is not stored in the audit log.
if msg.auditd and self.last_load_only:
self.__initialize()
self.policy_load_msgs.append(msg)
elif isinstance(msg, AVCMessage):
self.avc_msgs.append(msg)
elif isinstance(msg, ComputeSidMessage):
self.compute_sid_msgs.append(msg)
elif isinstance(msg, InvalidMessage):
self.invalid_msgs.append(msg)
elif isinstance(msg, PathMessage):
self.path_msgs.append(msg)
# Group by audit header
if msg.header != "":
if msg.header in self.by_header:
self.by_header[msg.header].append(msg)
else:
self.by_header[msg.header] = [msg]
# Post processing will add additional information from AVC messages
# from related messages - only works on messages generated by
# the audit system.
def __post_process(self):
for value in self.by_header.values():
avc = []
path = None
for msg in value:
if isinstance(msg, PathMessage):
path = msg
elif isinstance(msg, AVCMessage):
avc.append(msg)
if len(avc) > 0 and path:
for a in avc:
a.path = path.path
def parse_file(self, input):
"""Parse the contents of a file object. This method can be called
multiple times (along with parse_string)."""
line = input.readline()
while line:
self.__parse(line)
line = input.readline()
if not self.check_input_file:
sys.stderr.write("Nothing to do\n")
sys.exit(0)
self.__post_process()
def parse_string(self, input):
"""Parse a string containing audit messages - messages should
be separated by new lines. This method can be called multiple
times (along with parse_file)."""
lines = input.split('\n')
for l in lines:
self.__parse(l)
self.__post_process()
def to_role(self, role_filter=None):
"""Return RoleAllowSet statements matching the specified filter
Filter out types that match the filer, or all roles
Params:
role_filter - [optional] Filter object used to filter the
output.
Returns:
Access vector set representing the denied access in the
audit logs parsed by this object.
"""
role_types = access.RoleTypeSet()
for cs in self.compute_sid_msgs:
if not role_filter or role_filter.filter(cs):
role_types.add(cs.invalid_context.role, cs.invalid_context.type)
return role_types
def to_access(self, avc_filter=None, only_denials=True):
"""Convert the audit logs access into a an access vector set.
Convert the audit logs into an access vector set, optionally
filtering the restults with the passed in filter object.
Filter objects are object instances with a .filter method
that takes and access vector and returns True if the message
should be included in the final output and False otherwise.
Params:
avc_filter - [optional] Filter object used to filter the
output.
Returns:
Access vector set representing the denied access in the
audit logs parsed by this object.
"""
av_set = access.AccessVectorSet()
for avc in self.avc_msgs:
if avc.denial != True and only_denials:
continue
if not avc_filter or avc_filter.filter(avc):
av = access.AccessVector([avc.scontext.type, avc.tcontext.type,
avc.tclass] + avc.accesses)
av.data = avc.data
av.type = avc.type
if avc.ioctlcmd:
xperm_set = refpolicy.XpermSet()
xperm_set.add(avc.ioctlcmd)
av.xperms["ioctl"] = xperm_set
av_set.add_av(av, audit_msg=avc)
return av_set
class AVCTypeFilter:
def __init__(self, regex):
self.regex = re.compile(regex)
def filter(self, avc):
if self.regex.match(avc.scontext.type):
return True
if self.regex.match(avc.tcontext.type):
return True
return False
class ComputeSidTypeFilter:
def __init__(self, regex):
self.regex = re.compile(regex)
def filter(self, avc):
if self.regex.match(avc.invalid_context.type):
return True
if self.regex.match(avc.scontext.type):
return True
if self.regex.match(avc.tcontext.type):
return True
return False
sepolgen/__pycache__/module.cpython-36.pyc 0000644 00000015711 14751155147 0014522 0 ustar 00 3
�� fw � @ s� d Z ddlZddlZyddlmZ W n ek
rD ddlmZ Y nX ddlZddlZddl Z ddl
Z
ddl m Z dd� Z
G dd � d �Zd
d � ZG d d
� d
�ZdS )zU
Utilities for dealing with the compilation of modules and creation
of module tress.
� N)�getstatusoutput� )�defaultsc C s0 t jd| �}t|�dkr(| d j� r(dS dS dS )z'Check that a module name is valid.
z[^a-zA-Z0-9_\-\.]r TFN)�re�findall�len�isalpha)�modname�m� r � /usr/lib/python3.6/module.py�
is_valid_name( s r
c @ sN e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z ddd�Z
dS )�
ModuleTreec C s || _ d | _d S )N)r �dirname)�selfr r r r �__init__2 s zModuleTree.__init__c C s | j S )N)r )r r r r �dir_name6 s zModuleTree.dir_namec C s | j d | j d S )N�/z.te)r r )r r r r �te_name9 s zModuleTree.te_namec C s | j d | j d S )Nr z.fc)r r )r r r r �fc_name< s zModuleTree.fc_namec C s | j d | j d S )Nr z.if)r r )r r r r �if_name? s zModuleTree.if_namec C s | j d | j d S )Nr z.pp)r r )r r r r � package_nameB s zModuleTree.package_namec C s
| j d S )Nz /Makefile)r )r r r r �
makefile_nameE s zModuleTree.makefile_nameNc C s� |d | j | _tj| j� t| j� d�}|r>|jd| � n|jdtj� � |j � t| j
� d�j � t| j � d�j � t| j � d�j � d S )Nr �wzinclude )
r r �os�mkdir�openr �writer �refpolicy_makefile�closer r r )r Zparent_dirnameZmakefile_include�fdr r r �createH s zModuleTree.create)N) �__name__�
__module__� __qualname__r r r r r r r r! r r r r r 1 s r c C s t jjt jj| �d �d S )Nr r )r �path�splitext�split)�
sourcenamer r r �modname_from_sourcenameX s r) c @ sT e Zd ZdZddd�Zdd� Zdd� Zd d
� Zdd d
�Zdd� Z dd� Z
dd� Z dS )�ModuleCompilerat ModuleCompiler eases running of the module compiler.
The ModuleCompiler class encapsulates running the commandline
module compiler (checkmodule) and module packager (semodule_package).
You are likely interested in the create_module_package method.
Several options are controlled via paramaters (only effects the
non-refpol builds):
.mls [boolean] Generate an MLS module (by passed -M to
checkmodule). True to generate an MLS module, false
otherwise.
.module [boolean] Generate a module instead of a base module.
True to generate a module, false to generate a base.
.checkmodule [string] Fully qualified path to the module compiler.
Default is /usr/bin/checkmodule.
.semodule_package [string] Fully qualified path to the module
packager. Defaults to /usr/bin/semodule_package.
.output [file object] File object used to write verbose
output of the compililation and packaging process.
Nc C s< t j� | _d| _d| _d| _|| _d| _tj � | _
d| _ dS )z�Create a ModuleCompiler instance, optionally with an
output file object for verbose output of the compilation process.
Tz/usr/bin/checkmodulez/usr/bin/semodule_package� z
/usr/bin/makeN) �selinuxZis_selinux_mls_enabled�mls�module� checkmodule�semodule_package�output� last_outputr r �refpol_makefile�make)r r1 r r r r t s
zModuleCompiler.__init__c C s | j r| j j|d � || _d S )N�
)r1 r r2 )r �strr r r �o� s zModuleCompiler.oc C s$ | j |� t|�\}}| j |� |S )N)r7 r )r �command�rcr1 r r r �run� s
zModuleCompiler.runc C sJ |j d�}t|�dk r td|��dj|dd� �}|d }|d }||fS ) z�Generate the module and policy package filenames from
a source file name. The source file must be in the form
of "foo.te". This will generate "foo.mod" and "foo.pp".
Returns a tuple with (modname, policypackage).
�.� z,invalid sourcefile name %s (must end in .te)r r z.modz.pp���)r' r � RuntimeError�join)r r( Z splitname�basenamer � packagenamer r r �
gen_filenames� s
z ModuleCompiler.gen_filenamesTc C sD |r| j |� n0| j|�\}}| j||� | j||� tj|� dS )a� Create a module package saved in a packagename from a
sourcename.
The create_module_package creates a module package saved in a
file named sourcename (.pp is the standard extension) from a
source file (.te is the standard extension). The source file
should contain SELinux policy statements appropriate for a
base or non-base module (depending on the setting of .module).
Only file names are accepted, not open file objects or
descriptors because the command line SELinux tools are used.
On error a RuntimeError will be raised with a descriptive
error message.
N)� refpol_buildrB �compile�packager �unlink)r r( Z refpolicyr rA r r r �create_module_package� s z$ModuleCompiler.create_module_packagec C s4 | j d | j }| j|�}|dkr0td| j ��d S )Nz -f r zcompilation failed:
%s)r4 r3 r: r> r2 )r r( r8 r9 r r r rC � s
zModuleCompiler.refpol_buildc C sp | j g}| jr|jd� | jr(|jd� |jd� |j|� |j|� | jdj|��}|dkrltd| j ��d S )Nz-Mz-mz-o� r zcompilation failed:
%s)r/ r- �appendr. r: r? r> r2 )r r( r �sr9 r r r rD � s
zModuleCompiler.compilec C sZ | j g}|jd� |j|� |jd� |j|� | jdj|��}|dkrVtd| j ��d S )Nz-oz-mrH r zpackaging failed [%s])r0 rI r: r? r> r2 )r r rA rJ r9 r r r rE � s
zModuleCompiler.package)N)T) r" r# r$ �__doc__r r7 r: rB rG rC rD rE r r r r r* [ s
r* )rK r Ztempfile�
subprocessr � ImportErrorZcommandsr Zos.pathZshutilr, r+ r r
r r) r* r r r r �<module> s ' sepolgen/__pycache__/defaults.cpython-36.pyc 0000644 00000004306 14751155147 0015042 0 ustar 00 3
�� fU � @ sT d dl Z d dlZG dd� de�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dS )� Nc @ s e Zd Zdd� Zddd�ZdS )� PathChooserc
C s� t � | _tjj|�s(d| _d| jd< d S || _tjd�}tjd�}t|d��`}xXt |�D ]L\}}|j
|�rlqX|j
|�}|s�t d||d f ��|j d �| j|j d�< qXW W d Q R X d S )
Nz
(defaults)zJ/usr/share/selinux/default:/usr/share/selinux/mls:/usr/share/selinux/devel�SELINUX_DEVEL_PATHz
^\s*(?:#.+)?$z^\s*(\w+)\s*=\s*(.+?)\s*$�rz(%s:%d: line is not in key = value format� � )
�dict�config�os�path�exists�config_pathname�re�compile�open� enumerate�match�
ValueError�group)�self�pathname�ignoreZconsider�fd�lineno�line�mo� r � /usr/lib/python3.6/defaults.py�__init__ s
zPathChooser.__init__r c C sp | j j|d �}|d kr(td|| jf ��|jd�}x*|D ]"}tjj||�}tjj|�r8|S q8W tjj|d |�S )Nz%s was not in %s�:r ) r �getr r �splitr r
�joinr )r Z testfilenameZpathset�paths�p�targetr r r �__call__, s
zPathChooser.__call__N)r )�__name__�
__module__� __qualname__r r% r r r r r s r c C s dS )Nz/var/lib/sepolgenr r r r r �data_dir; s r) c C s
t � d S )Nz /perm_map)r) r r r r �perm_map> s r* c C s
t � d S )Nz/interface_info)r) r r r r �interface_infoA s r+ c C s
t � d S )Nz/attribute_info)r) r r r r �attribute_infoD s r, c C s( t d�} | d�}tjj|�s$| d�}|S )Nz/etc/selinux/sepolgen.conf�Makefilezinclude/Makefile)r r r
r )�chooser�resultr r r �refpolicy_makefileG s
r0 c C s t d�} | d�S )Nz/etc/selinux/sepolgen.conf�include)r )r. r r r �headersN s r2 )
r r
�objectr r) r* r+ r, r0 r2 r r r r �<module> s " sepolgen/__pycache__/matching.cpython-36.opt-1.pyc 0000644 00000013715 14751155147 0015770 0 ustar 00 3
�� f�! � @ sb d Z ddlZddlmZ ddlmZ ddlmZ G dd� dej�ZG d d
� d
�ZG d d � d �Z dS )
zI
Classes and algorithms for matching requested access to access vectors.
� N� )�access)� objectmodel)�utilc @ s e Zd Zddd�Zdd� ZdS )�MatchNr c C s || _ || _d| _d | _d S )NF)� interface�dist�info_dir_change�__hash__)�selfr r � r � /usr/lib/python3.6/matching.py�__init__ s zMatch.__init__c C s@ y"| j | jf}|j |jf}|||�S ttfk
r: tS X d S )N)r r �AttributeError� TypeError�NotImplemented)r �other�method�a�br r r
�_compare( s
zMatch._compare)Nr )�__name__�
__module__� __qualname__r r r r r r
r s
r c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )� MatchList� c C s$ g | _ g | _| j| _d| _d | _d S )NF)�children�bastards�DEFAULT_THRESHOLD� threshold�allow_info_dir_change�av)r r r r
r 3 s
zMatchList.__init__c C s, t | j�r| jd S t | j�r(| jd S d S )Nr )�lenr r )r r r r
�best< s
zMatchList.bestc C s t | j�t | j� S )N)r" r r )r r r r
�__len__C s zMatchList.__len__c C s
t | j�S )N)�iterr )r r r r
�__iter__I s zMatchList.__iter__c C s t j| j| j�S )N)� itertools�chainr r )r r r r
�allL s z
MatchList.allc C sF |j | jkr6|j s| jr(| jj|� qB| jj|� n | jj|� d S )N)r r r r r �appendr )r �matchr r r
r* O s
zMatchList.appendc C s | j j� | jj� d S )N)r �sortr )r r r r
r, X s
zMatchList.sortN) r r r r r r# r$ r& r) r* r, r r r r
r 1 s r c @ s> e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� ZdS )�
AccessMatcherNc C s, d| _ d| _|r|| _n
tj� | _d| _d S )N�
�d )� type_penalty� obj_penalty� perm_mapsr Z PermMappings�info_dir_penalty)r r2 r r r
r ^ s
zAccessMatcher.__init__c C s" ||kst j|�rdS | j S d S )Nr )r �
is_idparamr0 )r r r r r r
�
type_distancej s zAccessMatcher.type_distancec C sR |j j|j �}t|�dkr0| jj|j|�}| S |j j|j �}| jj|j|�S d S )Nr )�perms�
differencer" r2 �getdefault_distance� obj_class)r Zav_reqZav_provZdiffZtotalr r r
�
perm_distanceq s zAccessMatcher.perm_distancec C s� d}|| j |j|j�7 }|| j |j|j�7 }|j|jkrPtj|j� rP|| j8 }|dk rl| jj|j|j �}n | j
||�}|dk r�|dk r�|| S || S n |dkr�|dk r�|| S || S dS )a+ Determine the 'distance' between 2 access vectors.
This function is used to find an access vector that matches
a 'required' access. To do this we comput a signed numeric
value that indicates how close the req access is to the
'provided' access vector. The closer the value is to 0
the closer the match, with 0 being an exact match.
A value over 0 indicates that the prov access vector provides more
access than the req (in practice, this means that the source type,
target type, and object class is the same and the perms in prov is
a superset of those in req.
A value under 0 indicates that the prov access less - or unrelated
- access to the req access. A different type or object class will
result in a very low value.
The values other than 0 should only be interpreted relative to
one another - they have no exact meaning and are likely to
change.
Params:
req - [AccessVector] The access that is required. This is the
access being matched.
prov - [AccessVector] The access provided. This is the potential
match that is being evaluated for req.
Returns:
0 : Exact match between the acess vectors.
< 0 : The prov av does not provide all of the access in req.
A smaller value indicates that the access is further.
> 0 : The prov av provides more access than req. The larger
the value the more access over req.
r N) r5 Zsrc_type�tgt_typer9 r r4 r1 r2 r8 r6 r: )r ZreqZprovr Zpdistr r r
� av_distance| s '
zAccessMatcher.av_distancec C s� d}xf|D ]^}| j ||�}|dkr(|}q
|dkrN|dkrB||7 }qh|| }q
|dk r`||7 }q
||8 }q
W | jj|j|j�}|jdkr�tj|_x&|D ] }|j| jj|j|j�B |_q�W |tj@ dkr�|jtj@ r�|dk r�|| j 8 }n
|| j 7 }|S )z
Nr )
r< r2 Zgetdefault_directionr9 r6 Zinfo_dirr Z FLOW_NONEZ
FLOW_WRITEr3 )r Zav_setr! r �xZtmpZav_dirr r r
� av_set_match� s.
zAccessMatcher.av_set_matchc C sh ||_ xTtj|j|jj|jg ��D ]6}|js.q"| j|j |�}|dkr"t
||�}|j |� q"W |j � d S )Nr )
r! r' r( Z tgt_type_allZ tgt_type_map�getr; Zenabledr> r r r* r, )r Zifsetr! Z
match_listZivr �mr r r
�
search_ifs� s
zAccessMatcher.search_ifs)N) r r r r r5 r: r< r> rA r r r r
r- ] s
H(r- )
�__doc__r' � r r r Z
Comparisonr r r- r r r r
�<module> s , sepolgen/__pycache__/classperms.cpython-36.pyc 0000644 00000004665 14751155147 0015417 0 ustar 00 3
�� f �
@ s� d dl Z d*Zd diZd
ZdZdZdZdZdZdZ dZ
dZ dd� Z dd� Z
ddlmZ ej� d d � Zd d � Zd d!� Zd"d#� Zd$d%� Zdd&lmZ ej� ed'�Zej� Zej� d(Zd)Z ej e�Z e e � dS )+� N�DEFINE�NAME�TICK�SQUOTE�OBRACE�CBRACE�SEMI�OPAREN�CPAREN�COMMAZdefinez\`z\'z\{z\}z\;z\(z\)z\,z
c C s t j| jd�| _| S )z[a-zA-Z_][a-zA-Z0-9_]*r )�reserved�get�value�type)�t� r � /usr/lib/python3.6/classperms.py�t_NAME. s r c C s t d| jd � | jd� d S )NzIllegal character '%s'r � )�printr �skip)r r r r �t_error3 s r r )�lexc C s8 t | �dkr | d g| d< n| d g| d g | d< dS )zHstatements : define_stmt
| define_stmt statements
� r r N)�len)�pr r r � p_statements: s r c C s | d | d g| d< dS )zOdefine_stmt : DEFINE OPAREN TICK NAME SQUOTE COMMA TICK list SQUOTE CPAREN
� � r Nr )r r r r �
p_define_stmtC s r c C s, | d dkr| d | d< n| d g| d< dS )z2list : NAME
| OBRACE names CBRACE
r �{r r Nr )r r r r �p_listJ s r! c C s6 t | �dkr | d g| d< n| d g| d | d< dS )z+names : NAME
| NAME names
r r r N)r )r r r r �p_namesS s r" c C s t d| j| j| jf � d S )Nz$Syntax error on line %d %s [type=%s])r �linenor r )r r r r �p_error\ s r$ )�yaccz
all_perms.sptz%define(`foo',`{ read write append }')a2 define(`all_filesystem_perms',`{ mount remount unmount getattr relabelfrom relabelto transition associate quotamod quotaget }')
define(`all_security_perms',`{ compute_av compute_create compute_member check_context load_policy compute_relabel compute_user setenforce setbool setsecparam setcheckreqprot }')
)
r r r r r r r r r
r ) �sys�tokensr Zt_TICKZt_SQUOTEZt_OBRACEZt_CBRACEZt_SEMIZt_OPARENZt_CPARENZt_COMMAZt_ignorer r � r r r r! r" r$ r% �open�f�readZtxt�closeZtestZtest2�parse�resultr r r r r �<module> sL
sepolgen/__pycache__/matching.cpython-36.pyc 0000644 00000013715 14751155147 0015031 0 ustar 00 3
�� f�! � @ sb d Z ddlZddlmZ ddlmZ ddlmZ G dd� dej�ZG d d
� d
�ZG d d � d �Z dS )
zI
Classes and algorithms for matching requested access to access vectors.
� N� )�access)� objectmodel)�utilc @ s e Zd Zddd�Zdd� ZdS )�MatchNr c C s || _ || _d| _d | _d S )NF)� interface�dist�info_dir_change�__hash__)�selfr r � r � /usr/lib/python3.6/matching.py�__init__ s zMatch.__init__c C s@ y"| j | jf}|j |jf}|||�S ttfk
r: tS X d S )N)r r �AttributeError� TypeError�NotImplemented)r �other�method�a�br r r
�_compare( s
zMatch._compare)Nr )�__name__�
__module__� __qualname__r r r r r r
r s
r c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )� MatchList� c C s$ g | _ g | _| j| _d| _d | _d S )NF)�children�bastards�DEFAULT_THRESHOLD� threshold�allow_info_dir_change�av)r r r r
r 3 s
zMatchList.__init__c C s, t | j�r| jd S t | j�r(| jd S d S )Nr )�lenr r )r r r r
�best< s
zMatchList.bestc C s t | j�t | j� S )N)r" r r )r r r r
�__len__C s zMatchList.__len__c C s
t | j�S )N)�iterr )r r r r
�__iter__I s zMatchList.__iter__c C s t j| j| j�S )N)� itertools�chainr r )r r r r
�allL s z
MatchList.allc C sF |j | jkr6|j s| jr(| jj|� qB| jj|� n | jj|� d S )N)r r r r r �appendr )r �matchr r r
r* O s
zMatchList.appendc C s | j j� | jj� d S )N)r �sortr )r r r r
r, X s
zMatchList.sortN) r r r r r r# r$ r& r) r* r, r r r r
r 1 s r c @ s> e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� ZdS )�
AccessMatcherNc C s, d| _ d| _|r|| _n
tj� | _d| _d S )N�
�d )� type_penalty� obj_penalty� perm_mapsr Z PermMappings�info_dir_penalty)r r2 r r r
r ^ s
zAccessMatcher.__init__c C s" ||kst j|�rdS | j S d S )Nr )r �
is_idparamr0 )r r r r r r
�
type_distancej s zAccessMatcher.type_distancec C sR |j j|j �}t|�dkr0| jj|j|�}| S |j j|j �}| jj|j|�S d S )Nr )�perms�
differencer" r2 �getdefault_distance� obj_class)r Zav_reqZav_provZdiffZtotalr r r
�
perm_distanceq s zAccessMatcher.perm_distancec C s� d}|| j |j|j�7 }|| j |j|j�7 }|j|jkrPtj|j� rP|| j8 }|dk rl| jj|j|j �}n | j
||�}|dk r�|dk r�|| S || S n |dkr�|dk r�|| S || S dS )a+ Determine the 'distance' between 2 access vectors.
This function is used to find an access vector that matches
a 'required' access. To do this we comput a signed numeric
value that indicates how close the req access is to the
'provided' access vector. The closer the value is to 0
the closer the match, with 0 being an exact match.
A value over 0 indicates that the prov access vector provides more
access than the req (in practice, this means that the source type,
target type, and object class is the same and the perms in prov is
a superset of those in req.
A value under 0 indicates that the prov access less - or unrelated
- access to the req access. A different type or object class will
result in a very low value.
The values other than 0 should only be interpreted relative to
one another - they have no exact meaning and are likely to
change.
Params:
req - [AccessVector] The access that is required. This is the
access being matched.
prov - [AccessVector] The access provided. This is the potential
match that is being evaluated for req.
Returns:
0 : Exact match between the acess vectors.
< 0 : The prov av does not provide all of the access in req.
A smaller value indicates that the access is further.
> 0 : The prov av provides more access than req. The larger
the value the more access over req.
r N) r5 Zsrc_type�tgt_typer9 r r4 r1 r2 r8 r6 r: )r ZreqZprovr Zpdistr r r
� av_distance| s '
zAccessMatcher.av_distancec C s� d}xf|D ]^}| j ||�}|dkr(|}q
|dkrN|dkrB||7 }qh|| }q
|dk r`||7 }q
||8 }q
W | jj|j|j�}|jdkr�tj|_x&|D ] }|j| jj|j|j�B |_q�W |tj@ dkr�|jtj@ r�|dk r�|| j 8 }n
|| j 7 }|S )z
Nr )
r< r2 Zgetdefault_directionr9 r6 Zinfo_dirr Z FLOW_NONEZ
FLOW_WRITEr3 )r Zav_setr! r �xZtmpZav_dirr r r
� av_set_match� s.
zAccessMatcher.av_set_matchc C sh ||_ xTtj|j|jj|jg ��D ]6}|js.q"| j|j |�}|dkr"t
||�}|j |� q"W |j � d S )Nr )
r! r' r( Z tgt_type_allZ tgt_type_map�getr; Zenabledr> r r r* r, )r Zifsetr! Z
match_listZivr �mr r r
�
search_ifs� s
zAccessMatcher.search_ifs)N) r r r r r5 r: r< r> rA r r r r
r- ] s
H(r- )
�__doc__r' � r r r Z
Comparisonr r r- r r r r
�<module> s , sepolgen/__pycache__/util.cpython-36.pyc 0000644 00000014346 14751155147 0014215 0 ustar 00 3
�� fp � @ s� d dl Z d dlZejd dkZer,eZeZneZeZG dd� d�Z dd� Z
d dd �Z d
d � Z d d
� Z
G dd� d�Zejd k r�dd� Zn d dlmZ dd� Zedkr�d dlZe ejdd�Zejd� x"ed�D ]Zej� ejd� q�W dS ) � N� c @ s* e Zd Zd dd�Zd dd�Zd
d d
�ZdS )�ConsoleProgressBar�d �#c C s( d| _ d| _|| _|| _|| _d| _d S )Nr F)�blocks�current�steps� indicator�out�done)�selfr
r r � r
�/usr/lib/python3.6/util.py�__init__" s zConsoleProgressBar.__init__Nc C s* d| _ |r| jjd| � | jjd� d S )NFz
%s:
z3%--10---20---30---40---50---60---70---80---90--100
)r r
�write)r �messager
r
r �start* s zConsoleProgressBar.start� c C s� | j |7 _ | j}tt| j t| j� d �d �| _| jdkrFd| _| j| }| jj| j| � | jj � | jdkr�| j
r�d| _
| jjd� d S )Nr � �2 T�
) r r �int�round�floatr r
r r �flushr )r �n�old�newr
r
r �step0 s "
zConsoleProgressBar.step)r r )N)r )�__name__�
__module__� __qualname__r r r r
r
r
r r ! s
r c C s g }|j | � |S )N)�extend)�s�lr
r
r � set_to_listB s
r% Fc C s@ t | �std��|r,t| �}|j� |d S x| D ]}|S W dS )a�
Return the first element of a set.
It sometimes useful to return the first element from a set but,
because sets are not indexable, this is rather hard. This function
will return the first element from a set. If sorted is True, then
the set will first be sorted (making this an expensive operation).
Otherwise a random element will be returned (as sets are not ordered).
zempty containterr N)�len�
IndexErrorr% �sort)r# �sortedr$ �xr
r
r �firstG s
r+ c C s: t j� }y| j|�}W n tk
r4 | jd�}Y nX |S )z/Encode given text via preferred system encodingzutf-8)�locale�getpreferredencoding�encode� UnicodeError)�text�encodingZ encoded_textr
r
r � encode_input\ s r2 c C s: t j� }y| j|�}W n tk
r4 | jd�}Y nX |S )z/Decode given text via preferred system encodingzutf-8)r, r- �decoder/ )r0 r1 Z decoded_textr
r
r � decode_inputi s r4 c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )�
Comparisonz�Class used when implementing rich comparison.
Inherit from this class if you want to have a rich
comparison withing the class, afterwards implement
_compare function within your class.c C s t S )N)�NotImplemented)r �other�methodr
r
r �_compare} s zComparison._comparec C s | j |dd� �S )Nc S s | |kS )Nr
)�a�br
r
r �<lambda>� s z#Comparison.__eq__.<locals>.<lambda>)r9 )r r7 r
r
r �__eq__� s zComparison.__eq__c C s | j |dd� �S )Nc S s | |k S )Nr
)r: r; r
r
r r< � s z#Comparison.__lt__.<locals>.<lambda>)r9 )r r7 r
r
r �__lt__� s zComparison.__lt__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__le__.<locals>.<lambda>)r9 )r r7 r
r
r �__le__� s zComparison.__le__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__ge__.<locals>.<lambda>)r9 )r r7 r
r
r �__ge__� s zComparison.__ge__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__gt__.<locals>.<lambda>)r9 )r r7 r
r
r �__gt__� s zComparison.__gt__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__ne__.<locals>.<lambda>)r9 )r r7 r
r
r �__ne__� s zComparison.__ne__N) r r r! �__doc__r9 r= r> r? r@ rA rB r
r
r
r r5 v s r5 r � c s G � fdd�d�}|S )z,Convert a cmp= function into a key= functionc s\ e Zd Zdd� Z� fdd�Z� fdd�Z� fdd�Z� fd d
�Z� fd d �Z� fd
d�Z dS )zcmp_to_key.<locals>.Kc W s
|| _ d S )N)�obj)r rE �argsr
r
r r � s z cmp_to_key.<locals>.K.__init__c s � | j |j �dk S )Nr )rE )r r7 )�mycmpr
r r> � s z cmp_to_key.<locals>.K.__lt__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r rA � s z cmp_to_key.<locals>.K.__gt__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r= � s z cmp_to_key.<locals>.K.__eq__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r? � s z cmp_to_key.<locals>.K.__le__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r@ � s z cmp_to_key.<locals>.K.__ge__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r rB � s z cmp_to_key.<locals>.K.__ne__N)
r r r! r r> rA r= r? r@ rB r
)rG r
r �K� s rH r
)rG rH r
)rG r �
cmp_to_key� s rI )rI c C s | |k|| k S )Nr
)r+ �secondr
r
r �cmp� s rK �__main__i� )r z computing pig����MbP?)F)r rD )r, �sys� version_infoZPY3�bytesZ
bytes_type�strZ string_typeZunicoder r% r+ r2 r4 r5 rI � functoolsrK r Ztime�stdout�pr �range�ir Zsleepr
r
r
r �<module> s0 !
sepolgen/__pycache__/sepolgeni18n.cpython-36.pyc 0000644 00000000460 14751155147 0015544 0 ustar 00 3
�� f� � @ s6 y d dl Z e jd�Zej ZW n dd� ZY nX dS )� Nzselinux-pythonc C s | S )N� )�strr r �"/usr/lib/python3.6/sepolgeni18n.py�_ s r )�gettextZ translation�tr r r r r �<module> s
sepolgen/__pycache__/lex.cpython-36.pyc 0000644 00000051662 14751155147 0014032 0 ustar 00 3
�� f�� � @ s< d Z dZddlZddlZddlZddlZddlZddlZyejej fZ
W n e k
rd e e
fZ
Y nX ejd�ZG dd� de�ZG dd� de�ZG d d
� d
e�ZG d d � d e�ZG d
d� d�Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Z G dd � d e�Z ddd d d e ej �d dddf
d d �Z d%d!d"�Z!d#d$� Z"e"Z#dS )&z3.11z3.10� Nz^[a-zA-Z0-9_]+$c @ s e Zd Zdd� ZdS )�LexErrorc C s |f| _ || _d S )N)�args�text)�self�message�s� r �/usr/lib/python3.6/lex.py�__init__: s zLexError.__init__N)�__name__�
__module__� __qualname__r
r r r r r 9 s r c @ s e Zd Zdd� Zdd� ZdS )�LexTokenc C s d| j | j| j| jf S )NzLexToken(%s,%r,%d,%d))�type�value�lineno�lexpos)r r r r �__str__A s zLexToken.__str__c C s t | �S )N)�str)r r r r �__repr__D s zLexToken.__repr__N)r r r
r r r r r r r @ s r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� ZeZeZd S )
� PlyLoggerc C s
|| _ d S )N)�f)r r r r r r
L s zPlyLogger.__init__c O s | j j|| d � d S )N�
)r �write)r �msgr �kwargsr r r �criticalO s zPlyLogger.criticalc O s | j jd|| d � d S )Nz WARNING: r )r r )r r r r r r r �warningR s zPlyLogger.warningc O s | j jd|| d � d S )NzERROR: r )r r )r r r r r r r �errorU s zPlyLogger.errorN) r r r
r
r r r �info�debugr r r r r K s r c @ s e Zd Zdd� Zdd� ZdS )�
NullLoggerc C s | S )Nr )r �namer r r �__getattribute__^ s zNullLogger.__getattribute__c O s | S )Nr )r r r r r r �__call__a s zNullLogger.__call__N)r r r
r# r$ r r r r r! ] s r! c @ s| e Zd Zdd� Zd dd�Zd dd�Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd � ZeZdS ) �Lexerc C s� d | _ d | _i | _i | _i | _d| _g | _d | _i | _i | _ i | _
d| _ d | _ d| _
d| _d | _d | _d | _d| _d| _d | _d| _d| _d S )N�INITIALr � � F)�lexre� lexretext�
lexstatere�lexstateretext�lexstaterenames�lexstate�
lexstatestack� lexstateinfo�lexstateignore�lexstateerrorf� lexstateeoff�
lexreflags�lexdatar �lexlen� lexerrorf�lexeoff� lextokens� lexignore� lexliterals� lexmoduler � lexoptimize)r r r r r
t s. zLexer.__init__Nc C s� t j | �}|r�i }x�| jj� D ]�\}}g }x\|D ]T\}}g } xF|D ]>}
|
sV|
d rb| j|
� qB| jt||
d j�|
d f� qBW q0W |j|| f� |||< q W ||_i |_x(| jj� D ]\}} t|| j�|j|< q�W ||_|S )Nr r( )�copyr+ �items�append�getattrr r2 r< ) r �object�cZnewtab�keyZritemZnewreZcreZfindexZ newfindexr �efr r r �clone� s(
& z Lexer.cloner' c C s� t |tj�rtd��|jd�d }tjj||�d }t|d����}|j d|t
f � |j dt t � � |j dt t
t| j��� � |j d t t| j�� � |j d
t | j� � |j d t | j� � i }xb| jj� D ]T\}}g } x>t|| j| | j| �D ]"\\}
} } }
| j| t| |
�f� q�W | ||< q�W |j d t |� � |j d
t | j� � i }x,| j j� D ] \}}|�rt|j nd ||< �q`W |j dt |� � i }x,| j j� D ] \}}|�r�|j nd ||< �q�W |j dt |� � W d Q R X d S )Nz&Won't overwrite existing lextab module�.r( z.py�wzJ# %s.py. This file automatically created by PLY (version %s). Don't edit!
z_tabversion = %s
z_lextokens = set(%s)
z_lexreflags = %s
z_lexliterals = %s
z_lexstateinfo = %s
z_lexstatere = %s
z_lexstateignore = %s
z_lexstateerrorf = %s
z_lexstateeoff = %s
���) �
isinstance�types�
ModuleType�IOError�split�os�path�join�openr � __version__�repr�__tabversion__�tuple�sortedr9 �intr4 r; r0 r+ r? �zipr, r- r@ �_funcs_to_namesr1 r2 r r3 )r �lextab� outputdirZ
basetabmodule�filenameZtfZtabre� statename�lre�titem�pat�funcZretext�renamesZtaberrrE Ztabeofr r r �writetab� s6 ( zLexer.writetabc C sR t |tj�r|}ntd| � tj| }t|dd�tkr@td��|j | _
|j | _ |j
| _| j
t| j�B | _|j| _|j| _i | _i | _xb|jj� D ]T\}}g }g }x.|D ]&\}} |jtj||j �t | |�f� q�W || j|< || j|< q�W i | _ x$|j j� D ]\}}
||
| j |< q�W i | _ x&|j j� D ]\}}
||
| j |< �q(W | j!d� d S )Nz import %sZ _tabversionz0.0zInconsistent PLY versionr& )"rJ rK rL �exec�sys�modulesrA rU � ImportErrorZ
_lextokensr9 Z _lexreflagsr4 Z _lexliteralsr; �set�
lextokens_allZ
_lexstateinfor0 Z_lexstateignorer1 r+ r, Z _lexstaterer? r@ �re�compile�_names_to_funcsr2 Z_lexstateerrorfr3 Z
_lexstateeoff�begin) r Ztabfile�fdictr[ r^ r_ r` Ztxtitemra Z func_namerE r r r �readtab� s8
"
z
Lexer.readtabc C s8 |d d� }t |t�s td��|| _d| _t|�| _d S )Nr( zExpected a stringr )rJ � StringTypes�
ValueErrorr5 r �lenr6 )r r rC r r r �input� s
z Lexer.inputc C sd || j krtd��| j | | _| j| | _| jj|d�| _| jj|d �| _ | j
j|d �| _ || _ d S )NzUndefined stater' )
r+ rr r) r, r* r1 �getr: r2 r7 r3 r8 r. )r �stater r r rn s
z Lexer.beginc C s | j j| j� | j|� d S )N)r/ r@ r. rn )r rv r r r �
push_state s zLexer.push_statec C s | j | jj� � d S )N)rn r/ �pop)r r r r � pop_state s zLexer.pop_statec C s | j S )N)r. )r r r r �
current_state! s zLexer.current_statec C s | j |7 _ d S )N)r )r �nr r r �skip' s z
Lexer.skipc C s~ | j }| j}| j}| j}�x�||k �r|| |kr<|d7 }q �x�| jD ]�\}}|j||�}|s`qFt� }|j� |_| j |_ ||_ |j
} || \}
|_ |
s�|j r�|j � | _ |S |j � }P |j � }| |_
|| _|| _ |
|�} | s�| j }| j}P | j�s(| j | jk�r(td|
jj|
jj|
j| j f ||d � ��| S W || | jk�rrt� }|| |_| j |_ |j|_ ||_ |d | _ |S | j�r�t� }| j|d � |_| j |_ d|_ | |_
||_ || _ | j|�} || j k�r�td|| ||d � ��| j }| �s�q | S || _ td|| |f ||d � ��q W | j�r\t� }d|_ d|_| j |_ ||_ | |_
|| _ | j|�} | S |d | _ | jd k�rztd��d S ) Nr( z4%s:%d: Rule '%s' returned an unknown token type '%s'r z&Scanning error. Illegal character '%s'z"Illegal character '%s' at index %d�eofr' z"No input string given with input())r r6 r: r5 r) �matchr �groupr r � lastindexr �end�lexerZlexmatchr= rj r �__code__� co_filename�co_firstlinenor r; r7 r8 � RuntimeError) r r r6 r: r5 r) � lexindexfunc�m�tok�irb Znewtokr r r �token1 s�
"
z Lexer.tokenc C s | S )Nr )r r r r �__iter__� s zLexer.__iter__c C s | j � }|d krt�|S )N)r� �
StopIteration)r �tr r r �next� s z
Lexer.next)N)r' )r r r
r
rF rd rp rt rn rw ry rz r| r� r� r� �__next__r r r r r% s s
%(
nr% c C s t | d| j�S )N�regex)rA �__doc__)rb r r r �
_get_regex� s r� c C s0 t j| �}|jj� }|j|jkr,|j|j� |S )N)rf � _getframe� f_globalsr> �f_locals�update)Zlevelsr �ldictr r r �get_caller_module_dict� s
r� c C sJ g }x@t | |�D ]2\}}|r8|d r8|j||d f� q|j|� qW |S )Nr r( )rY r@ )Zfunclist�namelist�resultr r" r r r rZ � s rZ c C sH g }x>| D ]6}|r6|d r6|j ||d |d f� q
|j |� q
W |S )Nr r( )r@ )r� ro r� r{ r r r rm � s
rm c C sd | sg S dj | �}y�tj||�}d gt|jj� �d }|d d � }x�|jj� D ]z\}} |j|d �}
t|
�t j
t j fkr�|
|| f|| < ||| < qP|
d k rP||| < |j d�dkr�d|| < qPd || f|| < qPW ||fg|g|gfS t
k
�r^ tt| �d �} | dk�rd} t| d | � |||�\} }
}t| | d � |||�\}}}| | |
| || fS X d S )N�|r( �ignore_r � )NN)rQ rk rl �max�
groupindex�valuesr? ru r rK � FunctionType�
MethodType�find� ExceptionrX rs �_form_master_re)Zrelist�reflagsr� �toknamesr� r) r� Z
lexindexnamesr r� Zhandler� Zllistr_ ZlnamesZrlistZrreZrnamesr r r r� � s2
r� c C s� | j d�}x0t|dd � d�D ]\}}||kr |dkr P q W |dkrVt|d|� �}nd}d|krjt|�}dj||d � �}||fS )N�_r( �ANYr& )r& )rN � enumeraterV rQ )r �names�partsr� �part�statesZ tokennamer r r � _statetoken s
r� c @ sf e Zd Zddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dS )� LexerReflectNr c C sL || _ d | _g | _|| _ddi| _t� | _d| _|d krBtt j
�n|| _ d S )Nr& � inclusiveF) r� Z
error_func�tokensr� � stateinfori rg r r rf �stderr�log)r r� r� r� r r r r
. s
zLexerReflect.__init__c C s$ | j � | j� | j� | j� d S )N)�
get_tokens� get_literals�
get_states� get_rules)r r r r �get_all9 s zLexerReflect.get_allc C s | j � | j� | j� | jS )N)�validate_tokens�validate_literals�validate_rulesr )r r r r � validate_all@ s zLexerReflect.validate_allc C sp | j jdd �}|s(| jjd� d| _d S t|ttf�sL| jjd� d| _d S |sf| jjd� d| _d S || _d S )Nr� zNo token list is definedTz tokens must be a list or tupleztokens is empty)r� ru r� r rJ �listrV r� )r r� r r r r� G s zLexerReflect.get_tokensc C sT i }xJ| j D ]@}tj|�s.| jjd|� d| _||krD| jjd|� d||< q W d S )NzBad token name '%s'TzToken '%s' multiply definedr( )r� �_is_identifierr~ r� r r )r Z terminalsr{ r r r r� [ s
z LexerReflect.validate_tokensc C s | j jdd�| _| js d| _d S )N�literalsr' )r� ru r� )r r r r r� f s zLexerReflect.get_literalsc C sp yDx>| j D ]4}t|t� s&t|�dkr
| jjdt|�� d| _q
W W n& tk
rj | jjd� d| _Y nX d S )Nr( z.Invalid literal %s. Must be a single characterTzIInvalid literals specification. literals must be a sequence of characters)r� rJ rq rs r� r rT � TypeError)r rC r r r r� l s z LexerReflect.validate_literalsc C s� | j jdd �| _| jr�t| jttf�s:| jjd� d| _n�x�| jD ]�}t|t� s^t|�dkrx| jjdt |�� d| _qB|\}}t|t
�s�| jjdt |�� d| _qB|dkp�|dks�| jjd |� d| _qB|| j kr�| jjd
|� d| _qB|| j |< qBW d S ) Nr� z)states must be defined as a tuple or listTr� zMInvalid state specifier %s. Must be a tuple (statename,'exclusive|inclusive')z State name %s must be a stringr� � exclusivez:State type for state %s must be 'inclusive' or 'exclusive'zState '%s' already defined) r� ru r� rJ rV r� r� r rs rT rq r� )r r r" Z statetyper r r r� w s0
zLexerReflect.get_statesc C sR dd� | j D �}i | _i | _i | _i | _i | _i | _x"| jD ]}g | j|< g | j|< q<W t|�dkrz| j j
d� d| _
d S �x�|D �]x}| j | }t || j�\}}|| j|< t |d��rX|dkr�x�|D ]}|| j|< q�W n||dkr�xr|D ]}|| j|< q�W nZ|d k�r2|j
j}|j
j}| j j
d
|||j� d| _
n$x�|D ]}| j| j||f� �q8W q�t|t��r�|d k�r�x|D ]}|| j|< �qtW d |k�r�| j jd |� nD|dk�r�| j j
d
|� d| _
n$x8|D ]}| j| j||f� �q�W q�| j j
d|� d| _
q�W x$| jj� D ]}|jdd� d� �q W x&| jj� D ]}|jdd� dd� �q2W d S )Nc S s g | ]}|d d� dkr|�qS )Nr� Zt_r )�.0r r r r �
<listcomp>� s z*LexerReflect.get_rules.<locals>.<listcomp>r z+No rules of the form t_rulename are definedTr$ r r} �ignorez,%s:%d: Rule '%s' must be defined as a string�\z#%s contains a literal backslash '\'z'Rule '%s' must be defined as a functionz&%s not defined as a function or stringc S s | d j jS )Nr( )r� r� )�xr r r �<lambda>� s z(LexerReflect.get_rules.<locals>.<lambda>)rD c S s t | d �S )Nr( )rs )r� r r r r� � s )rD �reverse)r� r� �funcsym�strsymr� �errorf�eoffr� rs r� r r� �hasattrr� r� r� r r@ rJ rq r r� �sort) r Ztsymbolsr r r� r� �tokname�line�filer r r r� � sb
zLexerReflect.get_rulesc C s� �xp| j D �]d}�x|| j| D �]l\}}|jj}|jj}tj|�}| jj|� | j | }t
|t j �rjd}nd}|jj
} | |kr�| jjd|||j� d| _q | |k r�| jjd|||j� d| _q t|�s�| jjd|||j� d| _q yDtjd|t|�f | j�}
|
jd��r$| jjd |||j� d| _W q tjk
�r� } zD| jjd
|||j| � d t|�k�rt| jjd |||j� d| _W Y d d } ~ X q X q W �x
| j| D ]�\} }
| j | }|d
k�r�| jjd| � d| _�q�|| jk�r|jd�dk �r| jjd| |� d| _�q�y:tjd| |
f | j�}
|
jd��r@| jjd| � d| _W nT tjk
�r� } z4| jjd| | � d |
k�r�| jjd| � d| _W Y d d } ~ X nX �q�W | j| �r�| j| �r�| jjd|� d| _| jj|d �}|r
|}|jj}|jj}tj|�}| jj|� t
|t j ��r d}nd}|jj
} | |k�rN| jjd|||j� d| _| |k r
| jjd|||j� d| _q
W x| jD ]}| j|� �q|W d S )Nr� r( z'%s:%d: Rule '%s' has too many argumentsTz%%s:%d: Rule '%s' requires an argumentz2%s:%d: No regular expression defined for rule '%s'z
(?P<%s>%s)r' z<%s:%d: Regular expression for rule '%s' matches empty stringz3%s:%d: Invalid regular expression for rule '%s'. %s�#z6%s:%d. Make sure '#' in rule '%s' is escaped with '\#'r z'Rule '%s' must be defined as a functionr� r z-Rule '%s' defined for an unspecified token %sz5Regular expression for rule '%s' matches empty stringz,Invalid regular expression for rule '%s'. %sz/Make sure '#' in rule '%s' is escaped with '\#'z No rules defined for state '%s') r� r� r� r� r� �inspectZ getmodulerg �addr� rJ rK r� � co_argcountr� r r r� rk rl r� r~ r� r� r� r� ru �validate_module)r rv �fnamer r� r� �moduler� Zreqargs�nargsrC �er" �rZefuncr r r r� � s�
zLexerReflect.validate_rulesc C s� yt j|�\}}W n tk
r& d S X tjd�}tjd�}i }|d7 }xv|D ]n}|j|�}|sj|j|�}|r�|jd�} |j| �}
|
s�||| < n$t j|�} | j j
d| || |
� d| _
|d7 }qNW d S )Nz \s*def\s+(t_[a-zA-Z_0-9]*)\(z\s*(t_[a-zA-Z_0-9]*)\s*=r( z7%s:%d: Rule %s redefined. Previously defined on line %dT) r� ZgetsourcelinesrM rk rl r~ r ru Z
getsourcefiler� r ) r r� �linesZlinenZfreZsreZ counthashr� r� r" �prevr] r r r r� ? s*
z LexerReflect.validate_module)Nr )r r r
r
r� r� r� r� r� r� r� r� r� r� r r r r r� - s
Bgr� Fr[ c
# s� |d kr d}d }
ddi} t � } || _| d kr6ttj�} |rL|d krLttj�}|rT|� � r�� fdd�t� �D �}
t|
�}
d|
kr�tj|
d j|
d< nt d�}
|
j
d �}|r�t |t �r�d
|kr�|d
| }t
|
| |d �}|j� |s�|j� r�td ��|o�|�r4y | j||
� | ja| ja| a| S tk
�r2 Y nX |�rd|jd
|j� |jd|j� |jd|j� t� | _x |jD ]}| jj |� �qtW t |jt t f��r�t |jd �� j |j�| _!n|j| _!| jt| j!�B | _"|j} i }x�| D ]�}g }xH|j#| D ]:\}}|j$d|t%|�f � |�r�|jd|t%|�|� �q�W x@|j&| D ]2\}}|j$d||f � |�r@|jd|||� �q@W |||< �q�W |�r�|jd� xt|D ]l}t'|| ||
|j(�\}}}|| j)|< || j*|< || j+|< |�r�x&t,|�D ]\}} |jd||| � �q�W �q�W xl| j-� D ]`\}} |dk�r| dk�r| j)| j.| j)d � | j*| j.| j*d � | j+| j.| j+d � �qW | | _/| j)d | _0| j*d | _1|| _2|j3| _4| j4j
dd�| _5|j6| _7|j6j
dd �| _8| j8�s�| j9d� |j:| _;|j:j
dd �| _<x�| j-� D ]�\} } | dk�rL| |j6k�r*| j9d| � | |j3k�r�| j5�r�| j9d| � nJ| dk�r | |j6k�rv|j6j
dd �|j6| < | |j3k�r |j3j
dd�|j3| < �q W | ja| ja| a|�r�|�r�|d k�r2t |t=j>��r�|j} nNd
|k�r�|
d } n:|j?d
�} d
j | d d � �}!t@d|! � tAtj|! dd�} tBjCjD| �}y$| jE||� |tjk�rTtj|= W n6 tFk
�r� }" z| j9d ||"f � W Y d d }"~"X nX | S ) Nr[ r& r� c s g | ]}|t � |�f�qS r )rA )r� �k)r� r r r� y s zlex.<locals>.<listcomp>�__file__r r� � __package__rG )r� r� zCan't build lexerzlex: tokens = %rzlex: literals = %rzlex: states = %rr z
(?P<%s>%s)z(lex: Adding rule %s -> '%s' (state '%s')z#lex: ==== MASTER REGEXS FOLLOW ====z"lex: state '%s' : regex[%d] = '%s'r' zNo t_error rule is definedr� z1No error rule is defined for exclusive state '%s'z2No ignore rule is defined for exclusive state '%s'r( z import %sz#Couldn't write lextab module %r. %srI )Gr% r= r rf r� �dir�dictrg r� r� ru rJ r r� r� r� � SyntaxErrorrp r� rt r� rh r r� r� r� ri r9 r� r� rV r rQ r; rj r� r@ r� r� r� r� r+ r, r- r� r? �extendr0 r) r* r4 r� r1 r: r� r2 r7 r r� r3 r8 rK rL rN re rA rO rP �dirnamerd rM )#r� rB r �optimizer[ r� Znowarnr\ ZdebuglogZerrorlogr� r� ZlexobjZ_itemsZpkgZlinfor{ Zregexsrv Z
regex_listr� r r" r� r) Zre_textZre_namesr� r �styper Zsrcfiler� Zpkgnamer� r )r� r �lex^ s�
$r� c C s� |sVy&t jd }t|�}|j� }|j� W n* tk
rT t jjd� t jj� }Y nX | rb| j }nt }||� | rz| j
}nt
}x0|� }|s�P t jjd|j |j |j
|jf � q�W d S )Nr( z/Reading from standard input (type EOF to end):
z(%s,%r,%d,%d)
)rf �argvrR �read�close�
IndexError�stdoutr �stdinrt r� r r r r )r� �datar] r Z_inputZ_tokenr� r r r �runmain s*
r� c s � fdd�}|S )Nc s t � d�rt� �| _n� | _| S )Nr$ )r� r� r� )r )r� r r � set_regexA s
zTOKEN.<locals>.set_regexr )r� r� r )r� r �TOKEN@ s r� )NN)$rS rU rk rf rK r> rO r� Z
StringTypeZ UnicodeTyperq �AttributeErrorr �bytesrl r� r� r rB r r r! r% r� r� rZ rm r� r� r� rX �VERBOSEr� r� r� �Tokenr r r r �<module>" sD
F
( 3
@
"
sepolgen/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000161 14751155147 0015724 0 ustar 00 3
�� f � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s sepolgen/__pycache__/module.cpython-36.opt-1.pyc 0000644 00000015711 14751155147 0015461 0 ustar 00 3
�� fw � @ s� d Z ddlZddlZyddlmZ W n ek
rD ddlmZ Y nX ddlZddlZddl Z ddl
Z
ddl m Z dd� Z
G dd � d �Zd
d � ZG d d
� d
�ZdS )zU
Utilities for dealing with the compilation of modules and creation
of module tress.
� N)�getstatusoutput� )�defaultsc C s0 t jd| �}t|�dkr(| d j� r(dS dS dS )z'Check that a module name is valid.
z[^a-zA-Z0-9_\-\.]r TFN)�re�findall�len�isalpha)�modname�m� r � /usr/lib/python3.6/module.py�
is_valid_name( s r
c @ sN e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z ddd�Z
dS )�
ModuleTreec C s || _ d | _d S )N)r �dirname)�selfr r r r �__init__2 s zModuleTree.__init__c C s | j S )N)r )r r r r �dir_name6 s zModuleTree.dir_namec C s | j d | j d S )N�/z.te)r r )r r r r �te_name9 s zModuleTree.te_namec C s | j d | j d S )Nr z.fc)r r )r r r r �fc_name< s zModuleTree.fc_namec C s | j d | j d S )Nr z.if)r r )r r r r �if_name? s zModuleTree.if_namec C s | j d | j d S )Nr z.pp)r r )r r r r � package_nameB s zModuleTree.package_namec C s
| j d S )Nz /Makefile)r )r r r r �
makefile_nameE s zModuleTree.makefile_nameNc C s� |d | j | _tj| j� t| j� d�}|r>|jd| � n|jdtj� � |j � t| j
� d�j � t| j � d�j � t| j � d�j � d S )Nr �wzinclude )
r r �os�mkdir�openr �writer �refpolicy_makefile�closer r r )r Zparent_dirnameZmakefile_include�fdr r r �createH s zModuleTree.create)N) �__name__�
__module__� __qualname__r r r r r r r r! r r r r r 1 s r c C s t jjt jj| �d �d S )Nr r )r �path�splitext�split)�
sourcenamer r r �modname_from_sourcenameX s r) c @ sT e Zd ZdZddd�Zdd� Zdd� Zd d
� Zdd d
�Zdd� Z dd� Z
dd� Z dS )�ModuleCompilerat ModuleCompiler eases running of the module compiler.
The ModuleCompiler class encapsulates running the commandline
module compiler (checkmodule) and module packager (semodule_package).
You are likely interested in the create_module_package method.
Several options are controlled via paramaters (only effects the
non-refpol builds):
.mls [boolean] Generate an MLS module (by passed -M to
checkmodule). True to generate an MLS module, false
otherwise.
.module [boolean] Generate a module instead of a base module.
True to generate a module, false to generate a base.
.checkmodule [string] Fully qualified path to the module compiler.
Default is /usr/bin/checkmodule.
.semodule_package [string] Fully qualified path to the module
packager. Defaults to /usr/bin/semodule_package.
.output [file object] File object used to write verbose
output of the compililation and packaging process.
Nc C s< t j� | _d| _d| _d| _|| _d| _tj � | _
d| _ dS )z�Create a ModuleCompiler instance, optionally with an
output file object for verbose output of the compilation process.
Tz/usr/bin/checkmodulez/usr/bin/semodule_package� z
/usr/bin/makeN) �selinuxZis_selinux_mls_enabled�mls�module� checkmodule�semodule_package�output� last_outputr r �refpol_makefile�make)r r1 r r r r t s
zModuleCompiler.__init__c C s | j r| j j|d � || _d S )N�
)r1 r r2 )r �strr r r �o� s zModuleCompiler.oc C s$ | j |� t|�\}}| j |� |S )N)r7 r )r �command�rcr1 r r r �run� s
zModuleCompiler.runc C sJ |j d�}t|�dk r td|��dj|dd� �}|d }|d }||fS ) z�Generate the module and policy package filenames from
a source file name. The source file must be in the form
of "foo.te". This will generate "foo.mod" and "foo.pp".
Returns a tuple with (modname, policypackage).
�.� z,invalid sourcefile name %s (must end in .te)r r z.modz.pp���)r' r � RuntimeError�join)r r( Z splitname�basenamer � packagenamer r r �
gen_filenames� s
z ModuleCompiler.gen_filenamesTc C sD |r| j |� n0| j|�\}}| j||� | j||� tj|� dS )a� Create a module package saved in a packagename from a
sourcename.
The create_module_package creates a module package saved in a
file named sourcename (.pp is the standard extension) from a
source file (.te is the standard extension). The source file
should contain SELinux policy statements appropriate for a
base or non-base module (depending on the setting of .module).
Only file names are accepted, not open file objects or
descriptors because the command line SELinux tools are used.
On error a RuntimeError will be raised with a descriptive
error message.
N)� refpol_buildrB �compile�packager �unlink)r r( Z refpolicyr rA r r r �create_module_package� s z$ModuleCompiler.create_module_packagec C s4 | j d | j }| j|�}|dkr0td| j ��d S )Nz -f r zcompilation failed:
%s)r4 r3 r: r> r2 )r r( r8 r9 r r r rC � s
zModuleCompiler.refpol_buildc C sp | j g}| jr|jd� | jr(|jd� |jd� |j|� |j|� | jdj|��}|dkrltd| j ��d S )Nz-Mz-mz-o� r zcompilation failed:
%s)r/ r- �appendr. r: r? r> r2 )r r( r �sr9 r r r rD � s
zModuleCompiler.compilec C sZ | j g}|jd� |j|� |jd� |j|� | jdj|��}|dkrVtd| j ��d S )Nz-oz-mrH r zpackaging failed [%s])r0 rI r: r? r> r2 )r r rA rJ r9 r r r rE � s
zModuleCompiler.package)N)T) r" r# r$ �__doc__r r7 r: rB rG rC rD rE r r r r r* [ s
r* )rK r Ztempfile�
subprocessr � ImportErrorZcommandsr Zos.pathZshutilr, r+ r r
r r) r* r r r r �<module> s ' sepolgen/__pycache__/util.cpython-36.opt-1.pyc 0000644 00000014346 14751155147 0015154 0 ustar 00 3
�� fp � @ s� d dl Z d dlZejd dkZer,eZeZneZeZG dd� d�Z dd� Z
d dd �Z d
d � Z d d
� Z
G dd� d�Zejd k r�dd� Zn d dlmZ dd� Zedkr�d dlZe ejdd�Zejd� x"ed�D ]Zej� ejd� q�W dS ) � N� c @ s* e Zd Zd dd�Zd dd�Zd
d d
�ZdS )�ConsoleProgressBar�d �#c C s( d| _ d| _|| _|| _|| _d| _d S )Nr F)�blocks�current�steps� indicator�out�done)�selfr
r r � r
�/usr/lib/python3.6/util.py�__init__" s zConsoleProgressBar.__init__Nc C s* d| _ |r| jjd| � | jjd� d S )NFz
%s:
z3%--10---20---30---40---50---60---70---80---90--100
)r r
�write)r �messager
r
r �start* s zConsoleProgressBar.start� c C s� | j |7 _ | j}tt| j t| j� d �d �| _| jdkrFd| _| j| }| jj| j| � | jj � | jdkr�| j
r�d| _
| jjd� d S )Nr � �2 T�
) r r �int�round�floatr r
r r �flushr )r �n�old�newr
r
r �step0 s "
zConsoleProgressBar.step)r r )N)r )�__name__�
__module__� __qualname__r r r r
r
r
r r ! s
r c C s g }|j | � |S )N)�extend)�s�lr
r
r � set_to_listB s
r% Fc C s@ t | �std��|r,t| �}|j� |d S x| D ]}|S W dS )a�
Return the first element of a set.
It sometimes useful to return the first element from a set but,
because sets are not indexable, this is rather hard. This function
will return the first element from a set. If sorted is True, then
the set will first be sorted (making this an expensive operation).
Otherwise a random element will be returned (as sets are not ordered).
zempty containterr N)�len�
IndexErrorr% �sort)r# �sortedr$ �xr
r
r �firstG s
r+ c C s: t j� }y| j|�}W n tk
r4 | jd�}Y nX |S )z/Encode given text via preferred system encodingzutf-8)�locale�getpreferredencoding�encode� UnicodeError)�text�encodingZ encoded_textr
r
r � encode_input\ s r2 c C s: t j� }y| j|�}W n tk
r4 | jd�}Y nX |S )z/Decode given text via preferred system encodingzutf-8)r, r- �decoder/ )r0 r1 Z decoded_textr
r
r � decode_inputi s r4 c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )�
Comparisonz�Class used when implementing rich comparison.
Inherit from this class if you want to have a rich
comparison withing the class, afterwards implement
_compare function within your class.c C s t S )N)�NotImplemented)r �other�methodr
r
r �_compare} s zComparison._comparec C s | j |dd� �S )Nc S s | |kS )Nr
)�a�br
r
r �<lambda>� s z#Comparison.__eq__.<locals>.<lambda>)r9 )r r7 r
r
r �__eq__� s zComparison.__eq__c C s | j |dd� �S )Nc S s | |k S )Nr
)r: r; r
r
r r< � s z#Comparison.__lt__.<locals>.<lambda>)r9 )r r7 r
r
r �__lt__� s zComparison.__lt__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__le__.<locals>.<lambda>)r9 )r r7 r
r
r �__le__� s zComparison.__le__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__ge__.<locals>.<lambda>)r9 )r r7 r
r
r �__ge__� s zComparison.__ge__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__gt__.<locals>.<lambda>)r9 )r r7 r
r
r �__gt__� s zComparison.__gt__c C s | j |dd� �S )Nc S s | |kS )Nr
)r: r; r
r
r r< � s z#Comparison.__ne__.<locals>.<lambda>)r9 )r r7 r
r
r �__ne__� s zComparison.__ne__N) r r r! �__doc__r9 r= r> r? r@ rA rB r
r
r
r r5 v s r5 r � c s G � fdd�d�}|S )z,Convert a cmp= function into a key= functionc s\ e Zd Zdd� Z� fdd�Z� fdd�Z� fdd�Z� fd d
�Z� fd d �Z� fd
d�Z dS )zcmp_to_key.<locals>.Kc W s
|| _ d S )N)�obj)r rE �argsr
r
r r � s z cmp_to_key.<locals>.K.__init__c s � | j |j �dk S )Nr )rE )r r7 )�mycmpr
r r> � s z cmp_to_key.<locals>.K.__lt__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r rA � s z cmp_to_key.<locals>.K.__gt__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r= � s z cmp_to_key.<locals>.K.__eq__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r? � s z cmp_to_key.<locals>.K.__le__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r r@ � s z cmp_to_key.<locals>.K.__ge__c s � | j |j �dkS )Nr )rE )r r7 )rG r
r rB � s z cmp_to_key.<locals>.K.__ne__N)
r r r! r r> rA r= r? r@ rB r
)rG r
r �K� s rH r
)rG rH r
)rG r �
cmp_to_key� s rI )rI c C s | |k|| k S )Nr
)r+ �secondr
r
r �cmp� s rK �__main__i� )r z computing pig����MbP?)F)r rD )r, �sys� version_infoZPY3�bytesZ
bytes_type�strZ string_typeZunicoder r% r+ r2 r4 r5 rI � functoolsrK r Ztime�stdout�pr �range�ir Zsleepr
r
r
r �<module> s0 !
sepolgen/__pycache__/audit.cpython-36.pyc 0000644 00000042452 14751155147 0014345 0 ustar 00 3
�� f�U � @ s� d dl Z d dlZddlmZ ddlmZ ddlmZ dd� Zdd � Zd
d � ZG d d
� d
�Z G dd� de �Z
G dd� de �Z d dl j
Z
i ZG dd� de �ZG dd� de �ZG dd� de �ZG dd� de �ZG dd� d�ZG d d � d �ZG d d � d �ZdS ) � N� )� refpolicy)�access)�utilc C s� ddl } ddl}tdd�}t|j� j� d �}|j |j|j� | �}|jd|�}|jd|�}| j ddd d
||g| j
d �j � d }t j
r�t j|�}|S ) a
Obtain all of the avc and policy load messages from the audit
log. This function uses ausearch and requires that the current
process have sufficient rights to run ausearch.
Returns:
string contain all of the audit messages returned by ausearch.
r Nz /proc/uptime�rz%xz%Xz/sbin/ausearchz-mz5AVC,USER_AVC,MAC_POLICY_LOAD,DAEMON_START,SELINUX_ERRz-ts)�stdout)�
subprocess�time�open�float�read�split�closeZ localtimeZstrftime�Popen�PIPE� communicater �PY3� decode_input)r r �fdZoff�sZbootdateZboottime�output� r �/usr/lib/python3.6/audit.py�get_audit_boot_msgs s
r c C s: ddl } | jdddg| jd�j� d }tjr6tj|�}|S )a
Obtain all of the avc and policy load messages from the audit
log. This function uses ausearch and requires that the current
process have sufficient rights to run ausearch.
Returns:
string contain all of the audit messages returned by ausearch.
r Nz/sbin/ausearchz-mz5AVC,USER_AVC,MAC_POLICY_LOAD,DAEMON_START,SELINUX_ERR)r )r r r r r r r )r r r r r �get_audit_msgs2 s
r c C s6 ddl } | jdg| jd�j� d }tjr2tj|�}|S )z�Obtain all of the avc and policy load messages from /bin/dmesg.
Returns:
string contain all of the audit messages returned by dmesg.
r Nz
/bin/dmesg)r )r r r r r r r )r r r r r �get_dmesg_msgsA s
r c @ s e Zd ZdZdd� Zdd� ZdS )� AuditMessagez�Base class for all objects representing audit messages.
AuditMessage is a base class for all audit messages and only
provides storage for the raw message (as a string) and a
parsing function that does nothing.
c C s || _ d| _d S )N� )�message�header)�selfr r r r �__init__W s zAuditMessage.__init__c C s^ xX|D ]P}|j d�}t|�dkr<|dd� dkr|| _dS q|d dkr|d | _dS qW dS ) z�Parse a string that has been split into records by space into
an audit message.
This method should be overridden by subclasses. Error reporting
should be done by raise ValueError exceptions.
�=� N� zaudit(r �msgr )r
�lenr )r �recsr% �fieldsr r r �from_split_string[ s
z AuditMessage.from_split_stringN)�__name__�
__module__� __qualname__�__doc__r! r) r r r r r P s r c @ s e Zd ZdZdd� ZdS )�InvalidMessagez�Class representing invalid audit messages. This is used to differentiate
between audit messages that aren't recognized (that should return None from
the audit message parser) and a message that is recognized but is malformed
in some way.
c C s t j| |� d S )N)r r! )r r r r r r! v s zInvalidMessage.__init__N)r* r+ r, r- r! r r r r r. p s r. c @ s e Zd ZdZdd� Zdd� ZdS )� PathMessagez!Class representing a path messagec C s t j| |� d| _d S )Nr )r r! �path)r r r r r r! { s zPathMessage.__init__c C sX t j| |� xF|D ]>}|jd�}t|�dkr.q|d dkr|d dd� | _d S qW d S )Nr" r# r r0 r ���)r r) r
r& r0 )r r' r% r( r r r r) s
z PathMessage.from_split_stringN)r* r+ r, r- r! r) r r r r r/ y s r/ c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �
AVCMessagea� AVC message representing an access denial or granted message.
This is a very basic class and does not represent all possible fields
in an avc message. Currently the fields are:
scontext - context for the source (process) that generated the message
tcontext - context for the target
tclass - object class for the target (only one)
comm - the process name
exe - the on-disc binary
path - the path of the target
access - list of accesses that were allowed or denied
denial - boolean indicating whether this was a denial (True) or granted
(False) message.
ioctlcmd - ioctl 'request' parameter
An example audit message generated from the audit daemon looks like (line breaks
added):
'type=AVC msg=audit(1155568085.407:10877): avc: denied { search } for
pid=677 comm="python" name="modules" dev=dm-0 ino=13716388
scontext=user_u:system_r:setroubleshootd_t:s0
tcontext=system_u:object_r:modules_object_t:s0 tclass=dir'
An example audit message stored in syslog (not processed by the audit daemon - line
breaks added):
'Sep 12 08:26:43 dhcp83-5 kernel: audit(1158064002.046:4): avc: denied { read }
for pid=2 496 comm="bluez-pin" name=".gdm1K3IFT" dev=dm-0 ino=3601333
scontext=user_u:system_r:bluetooth_helper_t:s0-s0:c0
tcontext=system_u:object_r:xdm_tmp_t:s0 tclass=file
c C s\ t j| |� tj� | _tj� | _d| _d| _d| _d| _ d| _
g | _ d| _ d | _
tj| _d S )Nr T)r r! r �SecurityContext�scontext�tcontext�tclass�comm�exer0 �name�accesses�denial�ioctlcmd� audit2why�TERULE�type)r r r r r r! � s
zAVCMessage.__init__c C s| d}|}|t |�d kr&td| j ��x:|t |�k r`|| dkrFd}P | jj|| � |d }q(W |sttd| j ��|d S )NFr z#AVC message in invalid format [%s]
�}T)r& �
ValueErrorr r: �append)r r' �startZ found_close�ir r r Z__parse_access� s zAVCMessage.__parse_accessc C s� t j| |� d}d}d}d}�xftt|��D �]T}|| dkrV| j||d �}d}q,n|| dkrhd| _|| jd�}t|�dkr�q,|d d kr�tj|d �| _ d}q,|d d
kr�tj|d �| _
d}q,|d d kr�|d | _ d}q,|d d k�r|d dd� | _ q,|d d
k�r(|d dd� | _
q,|d dk�rJ|d dd� | _q,|d dkr,yt|d d�| _W q, tk
�r� Y q,X q,W | �s�| �s�| �s�| �r�td| j ��| j� d S )NF�{r TZgrantedr" r# r r4 r5 r6 r7 r8 r9 r< � z#AVC message in invalid format [%s]
r1 r1 r1 )r r) �ranger& �_AVCMessage__parse_accessr; r
r r3 r4 r5 r6 r7 r8 r9 �intr< rA r �analyze)r r' Z found_srcZ found_tgtZ found_classZ found_accessrD r( r r r r) � sL
z AVCMessage.from_split_stringc C s� | j j� }| jj� }t| j�}g | _||| j|ftj� krXt||| j|f \| _ | _�n�t
j ||| j| j�\| _ | _| j t
j kr�t
j
| _ | j t
jkr�td| ��| j t
jkr�td| ��| j t
jkr�td| j ��| j t
jkr�tddj| j� ��| j t
jk�rtd��| j t
jk�r�| jg| _| jj| j jk�rR| jjd| jj d| j j f� | jj| j jk�r�| j jdk�r�| jjd | jj d | j j f� | jj| j jk�r�| jjd
| jj d
| j j f� | j | jft||| j|f< d S ) NzInvalid Target Context %s
zInvalid Source Context %s
zInvalid Type Class %s
zInvalid permission %s
� z&Error during access vector computationz user (%s)Zobject_rz role (%s)z
level (%s))r5 Z to_stringr4 �tupler: �datar6 �avcdict�keysr? r= rJ ZNOPOLICYr> ZBADTCONrA ZBADSCONZBADPERM�joinZ
BADCOMPUTEZ
CONSTRAINT�userrB �role�level)r r5 r4 Z access_tupler r r rJ � s8
zAVCMessage.analyzeN)r* r+ r, r- r! rH r) rJ r r r r r2 � s
-r2 c @ s e Zd ZdZdd� ZdS )�PolicyLoadMessagez6Audit message indicating that the policy was reloaded.c C s t j| |� d S )N)r r! )r r r r r r! s zPolicyLoadMessage.__init__N)r* r+ r, r- r! r r r r rT s rT c @ s e Zd ZdZdd� Zdd� ZdS )�DaemonStartMessagez3Audit message indicating that a daemon was started.c C s t j| |� d| _d S )NF)r r! �auditd)r r r r r r! % s zDaemonStartMessage.__init__c C s t j| |� d|krd| _d S )NrV T)r r) rV )r r' r r r r) ) s z$DaemonStartMessage.from_split_stringN)r* r+ r, r- r! r) r r r r rU # s rU c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �ComputeSidMessagea� Audit message indicating that a sid was not valid.
Compute sid messages are generated on attempting to create a security
context that is not valid. Security contexts are invalid if the role is
not authorized for the user or the type is not authorized for the role.
This class does not store all of the fields from the compute sid message -
just the type and role.
c C s4 t j| |� tj� | _tj� | _tj� | _d| _d S )Nr )r r! r r3 �invalid_contextr4 r5 r6 )r r r r r r! 9 s
zComputeSidMessage.__init__c C s� t j| |� t|�dk r td��y\tj|d �| _tj|d jd�d �| _tj|d jd�d �| _ |d jd�d | _
W n td��Y nX d S ) N�
z;Split string does not represent a valid compute sid message� � r" r � � ) r r) r& rA r r3 rX r
r4 r5 r6 )r r' r r r r) @ s z#ComputeSidMessage.from_split_stringc C s d| j | jf S )Nzrole %s types %s;
)rR r? )r r r r r L s zComputeSidMessage.outputN)r* r+ r, r- r! r) r r r r r rW / s rW c @ s^ e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
ddd�Z ddd�Z dS )� AuditParsera� Parser for audit messages.
This class parses audit messages and stores them according to their message
type. This is not a general purpose audit message parser - it only extracts
selinux related messages.
Each audit messages are stored in one of four lists:
avc_msgs - avc denial or granted messages. Messages are stored in
AVCMessage objects.
comput_sid_messages - invalid sid messages. Messages are stored in
ComputSidMessage objects.
invalid_msgs - selinux related messages that are not valid. Messages
are stored in InvalidMessageObjects.
policy_load_messages - policy load messages. Messages are stored in
PolicyLoadMessage objects.
These lists will be reset when a policy load message is seen if
AuditParser.last_load_only is set to true. It is assumed that messages
are fed to the parser in chronological order - time stamps are not
parsed.
Fc C s | j � || _d S )N)�_AuditParser__initialize�last_load_only)r r` r r r r! g s zAuditParser.__init__c C s. g | _ g | _g | _g | _g | _i | _d| _d S )NF)�avc_msgs�compute_sid_msgs� invalid_msgs�policy_load_msgs� path_msgs� by_header�check_input_file)r r r r Z __initializek s zAuditParser.__initializec C s� dd� |j � D �}x�|D ]�}d}|dks8|dks8|dkrFt|�}d}n^|dkr\t|�}d}nH|d ksl|d
krzt|�}d}n*|d kr�t|�}d}n|d kr�tt�}d}|rd| _y|j|� W n t k
r� t
|�}Y nX |S qW d S )
Nc S s g | ]}|j d ��qS )u
)�strip)�.0�xr r r �
<listcomp>� s z,AuditParser.__parse_line.<locals>.<listcomp>Fzavc:z message=avc:z msg='avc:Tzsecurity_compute_sid:ztype=MAC_POLICY_LOADz type=1403z
type=AVC_PATHztype=DAEMON_START) r
r2 rW rT r/ rU �listrg r) rA r. )r �lineZrecrD �foundr% r r r Z __parse_line� s4
zAuditParser.__parse_linec C s� | j |�}|d krd S t|t�r0| jr�| j� n�t|t�r\|jrN| jrN| j� | jj|� n^t|t �rt| j
j|� nFt|t �r�| j j|� n.t|t
�r�| jj|� nt|t�r�| jj|� |jdkr�|j| jkr�| j|j j|� n|g| j|j< d S )Nr )�_AuditParser__parse_line�
isinstancerT r` r_ rU rV rd rB r2 ra rW rb r. rc r/ re r rf )r rm r% r r r Z__parse� s,
zAuditParser.__parsec C sx xr| j j� D ]d}g }d }x0|D ](}t|t�r2|}q t|t�r |j|� q W t|�dkr |r x|D ] }|j|_q`W q W d S )Nr )rf �valuesrp r/ r2 rB r& r0 )r �value�avcr0 r% �ar r r Z__post_process� s
zAuditParser.__post_processc C sL |j � }x|r"| j|� |j � }q
W | js@tjjd� tjd� | j� dS )zpParse the contents of a file object. This method can be called
multiple times (along with parse_string).zNothing to do
r N)�readline�_AuditParser__parserg �sys�stderr�write�exit�_AuditParser__post_process)r �inputrm r r r �
parse_file� s
zAuditParser.parse_filec C s. |j d�}x|D ]}| j|� qW | j� dS )z�Parse a string containing audit messages - messages should
be separated by new lines. This method can be called multiple
times (along with parse_file).�
N)r
rv r{ )r r| �lines�lr r r � parse_string� s
zAuditParser.parse_stringNc C s@ t j� }x2| jD ](}| s$|j|�r|j|jj|jj� qW |S )ao Return RoleAllowSet statements matching the specified filter
Filter out types that match the filer, or all roles
Params:
role_filter - [optional] Filter object used to filter the
output.
Returns:
Access vector set representing the denied access in the
audit logs parsed by this object.
)r Z RoleTypeSetrb �filter�addrX rR r? )r Z role_filterZ
role_typesZcsr r r �to_role� s
zAuditParser.to_roleTc C s� t j� }x�| jD ]�}|jdkr$|r$q| s4|j|�rt j|jj|jj|j g|j
�}|j |_ |j|_|j r�t
j� }|j|j � ||jd< |j||d� qW |S )a� Convert the audit logs access into a an access vector set.
Convert the audit logs into an access vector set, optionally
filtering the restults with the passed in filter object.
Filter objects are object instances with a .filter method
that takes and access vector and returns True if the message
should be included in the final output and False otherwise.
Params:
avc_filter - [optional] Filter object used to filter the
output.
Returns:
Access vector set representing the denied access in the
audit logs parsed by this object.
TZioctl)Z audit_msg)r ZAccessVectorSetra r; r� Z AccessVectorr4 r? r5 r6 r: rM r< r ZXpermSetr� ZxpermsZadd_av)r Z
avc_filterZ only_denialsZav_setrs �avZ xperm_setr r r � to_access� s
zAuditParser.to_access)F)N)NT)
r* r+ r, r- r! r_ ro rv r{ r} r� r� r� r r r r r^ Q s
$%
r^ c @ s e Zd Zdd� Zdd� ZdS )�
AVCTypeFilterc C s t j|�| _d S )N)�re�compile�regex)r r� r r r r! % s zAVCTypeFilter.__init__c C s, | j j|jj�rdS | j j|jj�r(dS dS )NTF)r� �matchr4 r? r5 )r rs r r r r� ( s
zAVCTypeFilter.filterN)r* r+ r, r! r� r r r r r� $ s r� c @ s e Zd Zdd� Zdd� ZdS )�ComputeSidTypeFilterc C s t j|�| _d S )N)r� r� r� )r r� r r r r! 0 s z ComputeSidTypeFilter.__init__c C s@ | j j|jj�rdS | j j|jj�r(dS | j j|jj�r<dS dS )NTF)r� r� rX r? r4 r5 )r rs r r r r� 3 s zComputeSidTypeFilter.filterN)r* r+ r, r! r� r r r r r� / s r� )r� rw r r r r r r r r r. r/ Zselinux.audit2whyr= rN r2 rT rU rW r^ r� r� r r r r �<module> s*
" T sepolgen/__pycache__/__init__.cpython-36.pyc 0000644 00000000161 14751155147 0014765 0 ustar 00 3
�� f � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s sepolgen/__pycache__/lex.cpython-36.opt-1.pyc 0000644 00000051662 14751155147 0014771 0 ustar 00 3
�� f�� � @ s< d Z dZddlZddlZddlZddlZddlZddlZyejej fZ
W n e k
rd e e
fZ
Y nX ejd�ZG dd� de�ZG dd� de�ZG d d
� d
e�ZG d d � d e�ZG d
d� d�Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� Z G dd � d e�Z ddd d d e ej �d dddf
d d �Z d%d!d"�Z!d#d$� Z"e"Z#dS )&z3.11z3.10� Nz^[a-zA-Z0-9_]+$c @ s e Zd Zdd� ZdS )�LexErrorc C s |f| _ || _d S )N)�args�text)�self�message�s� r �/usr/lib/python3.6/lex.py�__init__: s zLexError.__init__N)�__name__�
__module__� __qualname__r
r r r r r 9 s r c @ s e Zd Zdd� Zdd� ZdS )�LexTokenc C s d| j | j| j| jf S )NzLexToken(%s,%r,%d,%d))�type�value�lineno�lexpos)r r r r �__str__A s zLexToken.__str__c C s t | �S )N)�str)r r r r �__repr__D s zLexToken.__repr__N)r r r
r r r r r r r @ s r c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� ZeZeZd S )
� PlyLoggerc C s
|| _ d S )N)�f)r r r r r r
L s zPlyLogger.__init__c O s | j j|| d � d S )N�
)r �write)r �msgr �kwargsr r r �criticalO s zPlyLogger.criticalc O s | j jd|| d � d S )Nz WARNING: r )r r )r r r r r r r �warningR s zPlyLogger.warningc O s | j jd|| d � d S )NzERROR: r )r r )r r r r r r r �errorU s zPlyLogger.errorN) r r r
r
r r r �info�debugr r r r r K s r c @ s e Zd Zdd� Zdd� ZdS )�
NullLoggerc C s | S )Nr )r �namer r r �__getattribute__^ s zNullLogger.__getattribute__c O s | S )Nr )r r r r r r �__call__a s zNullLogger.__call__N)r r r
r# r$ r r r r r! ] s r! c @ s| e Zd Zdd� Zd dd�Zd dd�Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd � ZeZdS ) �Lexerc C s� d | _ d | _i | _i | _i | _d| _g | _d | _i | _i | _ i | _
d| _ d | _ d| _
d| _d | _d | _d | _d| _d| _d | _d| _d| _d S )N�INITIALr � � F)�lexre� lexretext�
lexstatere�lexstateretext�lexstaterenames�lexstate�
lexstatestack� lexstateinfo�lexstateignore�lexstateerrorf� lexstateeoff�
lexreflags�lexdatar �lexlen� lexerrorf�lexeoff� lextokens� lexignore� lexliterals� lexmoduler � lexoptimize)r r r r r
t s. zLexer.__init__Nc C s� t j | �}|r�i }x�| jj� D ]�\}}g }x\|D ]T\}}g } xF|D ]>}
|
sV|
d rb| j|
� qB| jt||
d j�|
d f� qBW q0W |j|| f� |||< q W ||_i |_x(| jj� D ]\}} t|| j�|j|< q�W ||_|S )Nr r( )�copyr+ �items�append�getattrr r2 r< ) r �object�cZnewtab�keyZritemZnewreZcreZfindexZ newfindexr �efr r r �clone� s(
& z Lexer.cloner' c C s� t |tj�rtd��|jd�d }tjj||�d }t|d����}|j d|t
f � |j dt t � � |j dt t
t| j��� � |j d t t| j�� � |j d
t | j� � |j d t | j� � i }xb| jj� D ]T\}}g } x>t|| j| | j| �D ]"\\}
} } }
| j| t| |
�f� q�W | ||< q�W |j d t |� � |j d
t | j� � i }x,| j j� D ] \}}|�rt|j nd ||< �q`W |j dt |� � i }x,| j j� D ] \}}|�r�|j nd ||< �q�W |j dt |� � W d Q R X d S )Nz&Won't overwrite existing lextab module�.r( z.py�wzJ# %s.py. This file automatically created by PLY (version %s). Don't edit!
z_tabversion = %s
z_lextokens = set(%s)
z_lexreflags = %s
z_lexliterals = %s
z_lexstateinfo = %s
z_lexstatere = %s
z_lexstateignore = %s
z_lexstateerrorf = %s
z_lexstateeoff = %s
���) �
isinstance�types�
ModuleType�IOError�split�os�path�join�openr � __version__�repr�__tabversion__�tuple�sortedr9 �intr4 r; r0 r+ r? �zipr, r- r@ �_funcs_to_namesr1 r2 r r3 )r �lextab� outputdirZ
basetabmodule�filenameZtfZtabre� statename�lre�titem�pat�funcZretext�renamesZtaberrrE Ztabeofr r r �writetab� s6 ( zLexer.writetabc C sR t |tj�r|}ntd| � tj| }t|dd�tkr@td��|j | _
|j | _ |j
| _| j
t| j�B | _|j| _|j| _i | _i | _xb|jj� D ]T\}}g }g }x.|D ]&\}} |jtj||j �t | |�f� q�W || j|< || j|< q�W i | _ x$|j j� D ]\}}
||
| j |< q�W i | _ x&|j j� D ]\}}
||
| j |< �q(W | j!d� d S )Nz import %sZ _tabversionz0.0zInconsistent PLY versionr& )"rJ rK rL �exec�sys�modulesrA rU � ImportErrorZ
_lextokensr9 Z _lexreflagsr4 Z _lexliteralsr; �set�
lextokens_allZ
_lexstateinfor0 Z_lexstateignorer1 r+ r, Z _lexstaterer? r@ �re�compile�_names_to_funcsr2 Z_lexstateerrorfr3 Z
_lexstateeoff�begin) r Ztabfile�fdictr[ r^ r_ r` Ztxtitemra Z func_namerE r r r �readtab� s8
"
z
Lexer.readtabc C s8 |d d� }t |t�s td��|| _d| _t|�| _d S )Nr( zExpected a stringr )rJ � StringTypes�
ValueErrorr5 r �lenr6 )r r rC r r r �input� s
z Lexer.inputc C sd || j krtd��| j | | _| j| | _| jj|d�| _| jj|d �| _ | j
j|d �| _ || _ d S )NzUndefined stater' )
r+ rr r) r, r* r1 �getr: r2 r7 r3 r8 r. )r �stater r r rn s
z Lexer.beginc C s | j j| j� | j|� d S )N)r/ r@ r. rn )r rv r r r �
push_state s zLexer.push_statec C s | j | jj� � d S )N)rn r/ �pop)r r r r � pop_state s zLexer.pop_statec C s | j S )N)r. )r r r r �
current_state! s zLexer.current_statec C s | j |7 _ d S )N)r )r �nr r r �skip' s z
Lexer.skipc C s~ | j }| j}| j}| j}�x�||k �r|| |kr<|d7 }q �x�| jD ]�\}}|j||�}|s`qFt� }|j� |_| j |_ ||_ |j
} || \}
|_ |
s�|j r�|j � | _ |S |j � }P |j � }| |_
|| _|| _ |
|�} | s�| j }| j}P | j�s(| j | jk�r(td|
jj|
jj|
j| j f ||d � ��| S W || | jk�rrt� }|| |_| j |_ |j|_ ||_ |d | _ |S | j�r�t� }| j|d � |_| j |_ d|_ | |_
||_ || _ | j|�} || j k�r�td|| ||d � ��| j }| �s�q | S || _ td|| |f ||d � ��q W | j�r\t� }d|_ d|_| j |_ ||_ | |_
|| _ | j|�} | S |d | _ | jd k�rztd��d S ) Nr( z4%s:%d: Rule '%s' returned an unknown token type '%s'r z&Scanning error. Illegal character '%s'z"Illegal character '%s' at index %d�eofr' z"No input string given with input())r r6 r: r5 r) �matchr �groupr r � lastindexr �end�lexerZlexmatchr= rj r �__code__� co_filename�co_firstlinenor r; r7 r8 � RuntimeError) r r r6 r: r5 r) � lexindexfunc�m�tok�irb Znewtokr r r �token1 s�
"
z Lexer.tokenc C s | S )Nr )r r r r �__iter__� s zLexer.__iter__c C s | j � }|d krt�|S )N)r� �
StopIteration)r �tr r r �next� s z
Lexer.next)N)r' )r r r
r
rF rd rp rt rn rw ry rz r| r� r� r� �__next__r r r r r% s s
%(
nr% c C s t | d| j�S )N�regex)rA �__doc__)rb r r r �
_get_regex� s r� c C s0 t j| �}|jj� }|j|jkr,|j|j� |S )N)rf � _getframe� f_globalsr> �f_locals�update)Zlevelsr �ldictr r r �get_caller_module_dict� s
r� c C sJ g }x@t | |�D ]2\}}|r8|d r8|j||d f� q|j|� qW |S )Nr r( )rY r@ )Zfunclist�namelist�resultr r" r r r rZ � s rZ c C sH g }x>| D ]6}|r6|d r6|j ||d |d f� q
|j |� q
W |S )Nr r( )r@ )r� ro r� r{ r r r rm � s
rm c C sd | sg S dj | �}y�tj||�}d gt|jj� �d }|d d � }x�|jj� D ]z\}} |j|d �}
t|
�t j
t j fkr�|
|| f|| < ||| < qP|
d k rP||| < |j d�dkr�d|| < qPd || f|| < qPW ||fg|g|gfS t
k
�r^ tt| �d �} | dk�rd} t| d | � |||�\} }
}t| | d � |||�\}}}| | |
| || fS X d S )N�|r( �ignore_r � )NN)rQ rk rl �max�
groupindex�valuesr? ru r rK � FunctionType�
MethodType�find� ExceptionrX rs �_form_master_re)Zrelist�reflagsr� �toknamesr� r) r� Z
lexindexnamesr r� Zhandler� Zllistr_ ZlnamesZrlistZrreZrnamesr r r r� � s2
r� c C s� | j d�}x0t|dd � d�D ]\}}||kr |dkr P q W |dkrVt|d|� �}nd}d|krjt|�}dj||d � �}||fS )N�_r( �ANYr& )r& )rN � enumeraterV rQ )r �names�partsr� �part�statesZ tokennamer r r � _statetoken s
r� c @ sf e Zd Zddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dS )� LexerReflectNr c C sL || _ d | _g | _|| _ddi| _t� | _d| _|d krBtt j
�n|| _ d S )Nr& � inclusiveF) r� Z
error_func�tokensr� � stateinfori rg r r rf �stderr�log)r r� r� r� r r r r
. s
zLexerReflect.__init__c C s$ | j � | j� | j� | j� d S )N)�
get_tokens� get_literals�
get_states� get_rules)r r r r �get_all9 s zLexerReflect.get_allc C s | j � | j� | j� | jS )N)�validate_tokens�validate_literals�validate_rulesr )r r r r � validate_all@ s zLexerReflect.validate_allc C sp | j jdd �}|s(| jjd� d| _d S t|ttf�sL| jjd� d| _d S |sf| jjd� d| _d S || _d S )Nr� zNo token list is definedTz tokens must be a list or tupleztokens is empty)r� ru r� r rJ �listrV r� )r r� r r r r� G s zLexerReflect.get_tokensc C sT i }xJ| j D ]@}tj|�s.| jjd|� d| _||krD| jjd|� d||< q W d S )NzBad token name '%s'TzToken '%s' multiply definedr( )r� �_is_identifierr~ r� r r )r Z terminalsr{ r r r r� [ s
z LexerReflect.validate_tokensc C s | j jdd�| _| js d| _d S )N�literalsr' )r� ru r� )r r r r r� f s zLexerReflect.get_literalsc C sp yDx>| j D ]4}t|t� s&t|�dkr
| jjdt|�� d| _q
W W n& tk
rj | jjd� d| _Y nX d S )Nr( z.Invalid literal %s. Must be a single characterTzIInvalid literals specification. literals must be a sequence of characters)r� rJ rq rs r� r rT � TypeError)r rC r r r r� l s z LexerReflect.validate_literalsc C s� | j jdd �| _| jr�t| jttf�s:| jjd� d| _n�x�| jD ]�}t|t� s^t|�dkrx| jjdt |�� d| _qB|\}}t|t
�s�| jjdt |�� d| _qB|dkp�|dks�| jjd |� d| _qB|| j kr�| jjd
|� d| _qB|| j |< qBW d S ) Nr� z)states must be defined as a tuple or listTr� zMInvalid state specifier %s. Must be a tuple (statename,'exclusive|inclusive')z State name %s must be a stringr� � exclusivez:State type for state %s must be 'inclusive' or 'exclusive'zState '%s' already defined) r� ru r� rJ rV r� r� r rs rT rq r� )r r r" Z statetyper r r r� w s0
zLexerReflect.get_statesc C sR dd� | j D �}i | _i | _i | _i | _i | _i | _x"| jD ]}g | j|< g | j|< q<W t|�dkrz| j j
d� d| _
d S �x�|D �]x}| j | }t || j�\}}|| j|< t |d��rX|dkr�x�|D ]}|| j|< q�W n||dkr�xr|D ]}|| j|< q�W nZ|d k�r2|j
j}|j
j}| j j
d
|||j� d| _
n$x�|D ]}| j| j||f� �q8W q�t|t��r�|d k�r�x|D ]}|| j|< �qtW d |k�r�| j jd |� nD|dk�r�| j j
d
|� d| _
n$x8|D ]}| j| j||f� �q�W q�| j j
d|� d| _
q�W x$| jj� D ]}|jdd� d� �q W x&| jj� D ]}|jdd� dd� �q2W d S )Nc S s g | ]}|d d� dkr|�qS )Nr� Zt_r )�.0r r r r �
<listcomp>� s z*LexerReflect.get_rules.<locals>.<listcomp>r z+No rules of the form t_rulename are definedTr$ r r} �ignorez,%s:%d: Rule '%s' must be defined as a string�\z#%s contains a literal backslash '\'z'Rule '%s' must be defined as a functionz&%s not defined as a function or stringc S s | d j jS )Nr( )r� r� )�xr r r �<lambda>� s z(LexerReflect.get_rules.<locals>.<lambda>)rD c S s t | d �S )Nr( )rs )r� r r r r� � s )rD �reverse)r� r� �funcsym�strsymr� �errorf�eoffr� rs r� r r� �hasattrr� r� r� r r@ rJ rq r r� �sort) r Ztsymbolsr r r� r� �tokname�line�filer r r r� � sb
zLexerReflect.get_rulesc C s� �xp| j D �]d}�x|| j| D �]l\}}|jj}|jj}tj|�}| jj|� | j | }t
|t j �rjd}nd}|jj
} | |kr�| jjd|||j� d| _q | |k r�| jjd|||j� d| _q t|�s�| jjd|||j� d| _q yDtjd|t|�f | j�}
|
jd��r$| jjd |||j� d| _W q tjk
�r� } zD| jjd
|||j| � d t|�k�rt| jjd |||j� d| _W Y d d } ~ X q X q W �x
| j| D ]�\} }
| j | }|d
k�r�| jjd| � d| _�q�|| jk�r|jd�dk �r| jjd| |� d| _�q�y:tjd| |
f | j�}
|
jd��r@| jjd| � d| _W nT tjk
�r� } z4| jjd| | � d |
k�r�| jjd| � d| _W Y d d } ~ X nX �q�W | j| �r�| j| �r�| jjd|� d| _| jj|d �}|r
|}|jj}|jj}tj|�}| jj|� t
|t j ��r d}nd}|jj
} | |k�rN| jjd|||j� d| _| |k r
| jjd|||j� d| _q
W x| jD ]}| j|� �q|W d S )Nr� r( z'%s:%d: Rule '%s' has too many argumentsTz%%s:%d: Rule '%s' requires an argumentz2%s:%d: No regular expression defined for rule '%s'z
(?P<%s>%s)r' z<%s:%d: Regular expression for rule '%s' matches empty stringz3%s:%d: Invalid regular expression for rule '%s'. %s�#z6%s:%d. Make sure '#' in rule '%s' is escaped with '\#'r z'Rule '%s' must be defined as a functionr� r z-Rule '%s' defined for an unspecified token %sz5Regular expression for rule '%s' matches empty stringz,Invalid regular expression for rule '%s'. %sz/Make sure '#' in rule '%s' is escaped with '\#'z No rules defined for state '%s') r� r� r� r� r� �inspectZ getmodulerg �addr� rJ rK r� � co_argcountr� r r r� rk rl r� r~ r� r� r� r� ru �validate_module)r rv �fnamer r� r� �moduler� Zreqargs�nargsrC �er" �rZefuncr r r r� � s�
zLexerReflect.validate_rulesc C s� yt j|�\}}W n tk
r& d S X tjd�}tjd�}i }|d7 }xv|D ]n}|j|�}|sj|j|�}|r�|jd�} |j| �}
|
s�||| < n$t j|�} | j j
d| || |
� d| _
|d7 }qNW d S )Nz \s*def\s+(t_[a-zA-Z_0-9]*)\(z\s*(t_[a-zA-Z_0-9]*)\s*=r( z7%s:%d: Rule %s redefined. Previously defined on line %dT) r� ZgetsourcelinesrM rk rl r~ r ru Z
getsourcefiler� r ) r r� �linesZlinenZfreZsreZ counthashr� r� r" �prevr] r r r r� ? s*
z LexerReflect.validate_module)Nr )r r r
r
r� r� r� r� r� r� r� r� r� r� r r r r r� - s
Bgr� Fr[ c
# s� |d kr d}d }
ddi} t � } || _| d kr6ttj�} |rL|d krLttj�}|rT|� � r�� fdd�t� �D �}
t|
�}
d|
kr�tj|
d j|
d< nt d�}
|
j
d �}|r�t |t �r�d
|kr�|d
| }t
|
| |d �}|j� |s�|j� r�td ��|o�|�r4y | j||
� | ja| ja| a| S tk
�r2 Y nX |�rd|jd
|j� |jd|j� |jd|j� t� | _x |jD ]}| jj |� �qtW t |jt t f��r�t |jd �� j |j�| _!n|j| _!| jt| j!�B | _"|j} i }x�| D ]�}g }xH|j#| D ]:\}}|j$d|t%|�f � |�r�|jd|t%|�|� �q�W x@|j&| D ]2\}}|j$d||f � |�r@|jd|||� �q@W |||< �q�W |�r�|jd� xt|D ]l}t'|| ||
|j(�\}}}|| j)|< || j*|< || j+|< |�r�x&t,|�D ]\}} |jd||| � �q�W �q�W xl| j-� D ]`\}} |dk�r| dk�r| j)| j.| j)d � | j*| j.| j*d � | j+| j.| j+d � �qW | | _/| j)d | _0| j*d | _1|| _2|j3| _4| j4j
dd�| _5|j6| _7|j6j
dd �| _8| j8�s�| j9d� |j:| _;|j:j
dd �| _<x�| j-� D ]�\} } | dk�rL| |j6k�r*| j9d| � | |j3k�r�| j5�r�| j9d| � nJ| dk�r | |j6k�rv|j6j
dd �|j6| < | |j3k�r |j3j
dd�|j3| < �q W | ja| ja| a|�r�|�r�|d k�r2t |t=j>��r�|j} nNd
|k�r�|
d } n:|j?d
�} d
j | d d � �}!t@d|! � tAtj|! dd�} tBjCjD| �}y$| jE||� |tjk�rTtj|= W n6 tFk
�r� }" z| j9d ||"f � W Y d d }"~"X nX | S ) Nr[ r& r� c s g | ]}|t � |�f�qS r )rA )r� �k)r� r r r� y s zlex.<locals>.<listcomp>�__file__r r� � __package__rG )r� r� zCan't build lexerzlex: tokens = %rzlex: literals = %rzlex: states = %rr z
(?P<%s>%s)z(lex: Adding rule %s -> '%s' (state '%s')z#lex: ==== MASTER REGEXS FOLLOW ====z"lex: state '%s' : regex[%d] = '%s'r' zNo t_error rule is definedr� z1No error rule is defined for exclusive state '%s'z2No ignore rule is defined for exclusive state '%s'r( z import %sz#Couldn't write lextab module %r. %srI )Gr% r= r rf r� �dir�dictrg r� r� ru rJ r r� r� r� � SyntaxErrorrp r� rt r� rh r r� r� r� ri r9 r� r� rV r rQ r; rj r� r@ r� r� r� r� r+ r, r- r� r? �extendr0 r) r* r4 r� r1 r: r� r2 r7 r r� r3 r8 rK rL rN re rA rO rP �dirnamerd rM )#r� rB r �optimizer[ r� Znowarnr\ ZdebuglogZerrorlogr� r� ZlexobjZ_itemsZpkgZlinfor{ Zregexsrv Z
regex_listr� r r" r� r) Zre_textZre_namesr� r �styper Zsrcfiler� Zpkgnamer� r )r� r �lex^ s�
$r� c C s� |sVy&t jd }t|�}|j� }|j� W n* tk
rT t jjd� t jj� }Y nX | rb| j }nt }||� | rz| j
}nt
}x0|� }|s�P t jjd|j |j |j
|jf � q�W d S )Nr( z/Reading from standard input (type EOF to end):
z(%s,%r,%d,%d)
)rf �argvrR �read�close�
IndexError�stdoutr �stdinrt r� r r r r )r� �datar] r Z_inputZ_tokenr� r r r �runmain s*
r� c s � fdd�}|S )Nc s t � d�rt� �| _n� | _| S )Nr$ )r� r� r� )r )r� r r � set_regexA s
zTOKEN.<locals>.set_regexr )r� r� r )r� r �TOKEN@ s r� )NN)$rS rU rk rf rK r> rO r� Z
StringTypeZ UnicodeTyperq �AttributeErrorr �bytesrl r� r� r rB r r r! r% r� r� rZ rm r� r� r� rX �VERBOSEr� r� r� �Tokenr r r r �<module>" sD
F
( 3
@
"
sepolgen/__pycache__/interfaces.cpython-36.pyc 0000644 00000030375 14751155147 0015363 0 ustar 00 3
�� fQ@ � @ s� d Z ddlZddlZddlmZ ddlmZ ddlmZ ddlmZ ddlm Z G d d
� d
�Z
d d � Z d
d� Z dd� Z
dd� Zdd� ZG dd� d�ZG dd� d�ZG dd� d�ZG dd � d �ZdS ) z7
Classes for representing and manipulating interfaces.
� N� )�access)� refpolicy)� objectmodel)�matching)�_c @ sH e Zd ZdZdd� Zdd� Zdd� Zeee�Zedd � d
�Z d d � Z
d
S )�Paramz;
Object representing a paramater for an interface.
c C s" d| _ tj| _tj� | _d| _d S )N� T)� _Param__namer �SRC_TYPE�type�IdSet� obj_classesZrequired)�self� r � /usr/lib/python3.6/interfaces.py�__init__& s
zParam.__init__c C s t j|�std| ��|| _d S )NzName [%s] is not a param)r �
is_idparam�
ValueErrorr
)r �namer r r �set_name, s
zParam.set_namec C s | j S )N)r
)r r r r �get_name1 s zParam.get_namec C s t | jdd � �S )Nr )�intr )r r r r �<lambda>6 s zParam.<lambda>)�fgetc C s d| j tj| j dj| j�f S )Nz0<sepolgen.policygen.Param instance [%s, %s, %s]>� )r r � field_to_strr �joinr )r r r r �__repr__8 s zParam.__repr__N) �__name__�
__module__� __qualname__�__doc__r r r �propertyr �numr r r r r r " s
r c C s� d}| |kr�|| }||j kr"d S |tjks6|tjkr�|j tjksN|j tjkr�d}|r`|jg}ng }x&tj|j|�D ]}|tj krtd}P qtW tj|_ q�d}n t
� }| |_ ||_ |||j < |r�|jj |j� |S )Nr r )
r r r �TGT_TYPE� obj_class� itertools�chainr r Zimplicitly_typed_objectsr r �add)r r �av�params�ret�pZavobjs�objr r r �__param_insert> s0
r/ c C s~ d}d}t j| j�r.t| jtj| |�dkr.d}t j| j�rTt| jtj| |�dkrTd}t j| j�rzt| jtj | |�dkrzd}|S )aj Extract the paramaters from an access vector.
Extract the paramaters (in the form $N) from an access
vector, storing them as Param objects in a dictionary.
Some attempt is made at resolving conflicts with other
entries in the dict, but if an unresolvable conflict is
found it is reported to the caller.
The goal here is to figure out how interface parameters are
actually used in the interface - e.g., that $1 is a domain used as
a SRC_TYPE. In general an interface will look like this:
interface(`foo', `
allow $1 foo : file read;
')
This is simple to figure out - $1 is a SRC_TYPE. A few interfaces
are more complex, for example:
interface(`foo_trans',`
domain_auto_trans($1,fingerd_exec_t,fingerd_t)
allow $1 fingerd_t:fd use;
allow fingerd_t $1:fd use;
allow fingerd_t $1:fifo_file rw_file_perms;
allow fingerd_t $1:process sigchld;
')
Here the usage seems ambigious, but it is not. $1 is still domain
and therefore should be returned as a SRC_TYPE.
Returns:
0 - success
1 - conflict found
r Fr )
r r �src_typer/ r r �tgt_typer% r& � OBJ_CLASS)r* r+ r, Z found_srcr r r �av_extract_paramsj s $ r3 c C s" t j| j�r t| jtjd |�S d S )N)r r �roler/ r ZROLE)r4 r+ r r r �role_extract_params� s r5 c sl � fdd�}d}|| j tj�r"d}|| jtj�r4d}|| jtj�rFd}tj| j �rht
| j tj d � �rhd}|S )Nc s2 d}x(| D ] }t j|�r
t||d � �r
d}q
W |S )Nr r )r r r/ )�setr r, �x)r+ r r �extract_from_set� s
z2type_rule_extract_params.<locals>.extract_from_setr r ) � src_typesr r � tgt_typesr% r r2 r r Z dest_typer/ Z DEST_TYPE)�ruler+ r8 r, r )r+ r �type_rule_extract_params� s r< c C s6 d}x,| j D ]"}tj|�r t|tjd |�r d}q W |S )Nr r )�argsr r r/ r r )�ifcallr+ r, �argr r r �ifcall_extract_params� s
r@ c @ s e Zd Zdd� Zdd� ZdS )�AttributeVectorc C s d| _ tj� | _d S )Nr )r r �AccessVectorSet)r r r r r � s zAttributeVector.__init__c C s | j j|� d S )N)r �add_av)r r* r r r rC � s zAttributeVector.add_avN)r r r! r rC r r r r rA � s rA c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )� AttributeSetc C s
i | _ d S )N)�
attributes)r r r r r � s zAttributeSet.__init__c C s || j |j< d S )N)rE r )r �attrr r r �add_attr� s zAttributeSet.add_attrc C s~ dd� }d }x^|D ]V}|d d� }|d dkrF|r<| j |� ||�}q|r|jd�}tj|�}|j|� qW |rz| j |� d S )Nc S sH | dd� j � }t|�dks(|d dkr4td| ��t� }|d |_|S )Nr � r Z Attributez#Syntax error Attribute statement %s���)�split�len� SyntaxErrorrA r )�line�fields�ar r r �
parse_attr� s
z*AttributeSet.from_file.<locals>.parse_attrr r �[�,rI )rG rJ r � AccessVectorrC )r �fdrP rO rM �lr* r r r � from_file� s
zAttributeSet.from_fileN)r r r! r rG rV r r r r rD � s rD c @ sF e Zd Zdi fdd�Zi fdd�Zdd� Zdd � Zd
d � Zd d
� ZdS )�InterfaceVectorNc C s6 d| _ d| _tj� | _i | _|r,| j||� d| _d S )NTr F)�enabledr r rB r+ �from_interface�expanded)r � interfacerE r r r r � s
zInterfaceVector.__init__c
C sF |j | _ xN|j� D ]B}|jtjjkr&qd|j kr2qtj|�}x|D ]}| j|� qBW qW |r�x�|j � D ]v}xp|j
D ]f}||j
kr�qr|j
| }xJ|jD ]@} t j | �}|j |j kr�|j
|_ |j|j kr�|j
|_| j|� q�W qrW qfW x |j� D ]}
t|
| j�r�q�W x |j� D ]} t| | j��r�qW x |j� D ]} t| | j��r*�q*W d S )NZ dontaudit)r ZavrulesZ rule_typer ZAVRuleZALLOWr Zavrule_to_access_vectorsrC ZtypeattributesrE �copyr0 r r1 Zrolesr5 r+ Z typerulesr< �interface_callsr@ )
r r[ rE ZavruleZavsr* Z
typeattributerF Zattr_vecrO r4 r; r> r r r rY � s>
z InterfaceVector.from_interfacec C s t || j�dkr| jj|� d S )Nr )r3 r+ r rC )r r* r r r rC 3 s zInterfaceVector.add_avc C s< g }|j d| j � x | jD ]}|j t|�� q W dj|�S )Nz[InterfaceVector %s]�
)�appendr r �strr )r �sr* r r r � to_string9 s
zInterfaceVector.to_stringc C s | j � S )N)r )r r r r �__str__@ s zInterfaceVector.__str__c C s d| j | jf S )Nz<InterfaceVector %s:%s>)r rX )r r r r r C s zInterfaceVector.__repr__) r r r! r rY rC rb rc r r r r r rW � s 4rW c @ sx e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zi fdd�Z di fdd�Z
dd� Z dd� Z dd� Z
dd� ZdS )� InterfaceSetNc C s i | _ i | _g | _|| _d S )N)�
interfaces� tgt_type_map� tgt_type_all�output)r rh r r r r H s zInterfaceSet.__init__c C s | j r| j j|d � d S )Nr^ )rh �write)r r` r r r �oN s zInterfaceSet.oc C s� x�t | jj� dd� d�D ]�}|jd|j � x:t |jj� dd� d�D ] }|jd|jtj|j f � qDW |jd� t |j j
� �}x&|D ] }|jdj |�� |jd � q�W qW d S )
Nc S s | j S )N)r )r7 r r r r S s z&InterfaceSet.to_file.<locals>.<lambda>)�keyz[InterfaceVector %s c S s | j S )N)r )r7 r r r r U s z%s:%s z]
rR r^ ) �sortedre �valuesri r r+ r r r r Zto_listr )r rT Ziv�paramZavlr* r r r �to_fileR s
zInterfaceSet.to_filec C s� dd� }d }x^|D ]V}|d d� }|d dkrF|r<| j |� ||�}q|r|jd�}tj|�}|j|� qW |rz| j |� | j� d S )Nc S s� | dd� j � }t|�dk s(|d dkr4td| ��t� }|d |_t|�dkrTd S xb|dd � D ]R}|j d�}t|�dkr�td| ��t� }|d |_tj|d |_||j |j< qbW |S ) Nr rH r rW z)Syntax error InterfaceVector statement %s�:z-Invalid param in InterfaceVector statement %srI )
rJ rK rL rW r r r Z str_to_fieldr r+ )rM rN �ifvZfieldr- rn r r r � parse_ifv^ s
z)InterfaceSet.from_file.<locals>.parse_ifvr r rQ rR rI )�add_ifvrJ r rS rC �index)r rT rr rq rM rU r* r r r rV ] s
zInterfaceSet.from_filec C s || j |j< d S )N)re r )r rq r r r rs � s zInterfaceSet.add_ifvc C s� xz| j j� D ]l}t� }x:|jD ]0}tj|j�rB| jj|� t� }P |j|j� q W x$|D ] }| j j
|g �}|j|� qXW q W d S )N) re rm r6 r r r1 rg r_ r) rf �
setdefault)r rq r: r* r rU r r r rt � s
zInterfaceSet.indexc C s t ||�}| j|� d S )N)rW rs )r r[ rE rq r r r r) � s
zInterfaceSet.addc C s@ x(t j|j� |j� �D ]}| j||� qW | j|� | j� d S )N)r' r( re � templatesr) �expand_ifcallsrt )r �headersrh rE �ir r r � add_headers� s
zInterfaceSet.add_headersc C sZ t j|�rPt|dd � �}|t|j�kr,d S |j|d }t|t�rH|S |gS n|gS d S )Nr )r r r rK r= �
isinstance�list)r �idr> r$ r? r r r � map_param� s
zInterfaceSet.map_paramc
C s� | j |j|�}|d krd S | j |j|�}|d kr4d S | j |j|�}|d krNd S tj� }x0|jD ]&}| j ||�} | d krzq^q^|j| � q^W t|�dkr�d S x:|D ]2}
x,|D ]$} x |D ]} |j j
|
| | |� q�W q�W q�W d S )Nr ) r~ r0 r1 r& r r
Zperms�updaterK r r) )
r rq r* r> r9 r: r Z new_permsZpermr- r0 r1 r& r r r �
map_add_av� s*
zInterfaceSet.map_add_avc C s� |d fg}| j |j }d|_x�t|�dkr�|jd�\}}| j |j }||krrx |jD ]}| j|||� qTW |jrrq xv|j� D ]j} | j|jkr�| j t
d�� d S y|| j }
W n* t k
r� | j t
d| j �� w|Y nX |j |
| f� q|W q W d S )NTr r z Found circular interface classz#Missing interface definition for %srI )
re r rZ rK �popr r� r] Zifnamerj r �KeyErrorr_ ) r r[ �
if_by_name�stackrq ZcurZ
cur_ifcallZcur_ifvr* r> Znewifr r r �do_expand_ifcalls� s*
z InterfaceSet.do_expand_ifcallsc C sZ i }x&t j|j� |j� �D ]}|||j< qW x(t j|j� |j� �D ]}| j||� qBW d S )N)r' r( re rv r r� )r rx r� ry r[ r r r rw � s
zInterfaceSet.expand_ifcalls)N)r r r! r rj ro rV rs rt r) rz r~ r� r� rw r r r r rd G s
# $rd )r" r\ r' r r r r r Z sepolgeni18nr r r/ r3 r5 r< r@ rA rD rW rd r r r r �<module> s" ,4 Z sepolgen/__pycache__/audit.cpython-36.opt-1.pyc 0000644 00000042452 14751155147 0015304 0 ustar 00 3
�� f�U � @ s� d dl Z d dlZddlmZ ddlmZ ddlmZ dd� Zdd � Zd
d � ZG d d
� d
�Z G dd� de �Z
G dd� de �Z d dl j
Z
i ZG dd� de �ZG dd� de �ZG dd� de �ZG dd� de �ZG dd� d�ZG d d � d �ZG d d � d �ZdS ) � N� )� refpolicy)�access)�utilc C s� ddl } ddl}tdd�}t|j� j� d �}|j |j|j� | �}|jd|�}|jd|�}| j ddd d
||g| j
d �j � d }t j
r�t j|�}|S ) a
Obtain all of the avc and policy load messages from the audit
log. This function uses ausearch and requires that the current
process have sufficient rights to run ausearch.
Returns:
string contain all of the audit messages returned by ausearch.
r Nz /proc/uptime�rz%xz%Xz/sbin/ausearchz-mz5AVC,USER_AVC,MAC_POLICY_LOAD,DAEMON_START,SELINUX_ERRz-ts)�stdout)�
subprocess�time�open�float�read�split�closeZ localtimeZstrftime�Popen�PIPE� communicater �PY3� decode_input)r r �fdZoff�sZbootdateZboottime�output� r �/usr/lib/python3.6/audit.py�get_audit_boot_msgs s
r c C s: ddl } | jdddg| jd�j� d }tjr6tj|�}|S )a
Obtain all of the avc and policy load messages from the audit
log. This function uses ausearch and requires that the current
process have sufficient rights to run ausearch.
Returns:
string contain all of the audit messages returned by ausearch.
r Nz/sbin/ausearchz-mz5AVC,USER_AVC,MAC_POLICY_LOAD,DAEMON_START,SELINUX_ERR)r )r r r r r r r )r r r r r �get_audit_msgs2 s
r c C s6 ddl } | jdg| jd�j� d }tjr2tj|�}|S )z�Obtain all of the avc and policy load messages from /bin/dmesg.
Returns:
string contain all of the audit messages returned by dmesg.
r Nz
/bin/dmesg)r )r r r r r r r )r r r r r �get_dmesg_msgsA s
r c @ s e Zd ZdZdd� Zdd� ZdS )� AuditMessagez�Base class for all objects representing audit messages.
AuditMessage is a base class for all audit messages and only
provides storage for the raw message (as a string) and a
parsing function that does nothing.
c C s || _ d| _d S )N� )�message�header)�selfr r r r �__init__W s zAuditMessage.__init__c C s^ xX|D ]P}|j d�}t|�dkr<|dd� dkr|| _dS q|d dkr|d | _dS qW dS ) z�Parse a string that has been split into records by space into
an audit message.
This method should be overridden by subclasses. Error reporting
should be done by raise ValueError exceptions.
�=� N� zaudit(r �msgr )r
�lenr )r �recsr% �fieldsr r r �from_split_string[ s
z AuditMessage.from_split_stringN)�__name__�
__module__� __qualname__�__doc__r! r) r r r r r P s r c @ s e Zd ZdZdd� ZdS )�InvalidMessagez�Class representing invalid audit messages. This is used to differentiate
between audit messages that aren't recognized (that should return None from
the audit message parser) and a message that is recognized but is malformed
in some way.
c C s t j| |� d S )N)r r! )r r r r r r! v s zInvalidMessage.__init__N)r* r+ r, r- r! r r r r r. p s r. c @ s e Zd ZdZdd� Zdd� ZdS )� PathMessagez!Class representing a path messagec C s t j| |� d| _d S )Nr )r r! �path)r r r r r r! { s zPathMessage.__init__c C sX t j| |� xF|D ]>}|jd�}t|�dkr.q|d dkr|d dd� | _d S qW d S )Nr" r# r r0 r ���)r r) r
r& r0 )r r' r% r( r r r r) s
z PathMessage.from_split_stringN)r* r+ r, r- r! r) r r r r r/ y s r/ c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �
AVCMessagea� AVC message representing an access denial or granted message.
This is a very basic class and does not represent all possible fields
in an avc message. Currently the fields are:
scontext - context for the source (process) that generated the message
tcontext - context for the target
tclass - object class for the target (only one)
comm - the process name
exe - the on-disc binary
path - the path of the target
access - list of accesses that were allowed or denied
denial - boolean indicating whether this was a denial (True) or granted
(False) message.
ioctlcmd - ioctl 'request' parameter
An example audit message generated from the audit daemon looks like (line breaks
added):
'type=AVC msg=audit(1155568085.407:10877): avc: denied { search } for
pid=677 comm="python" name="modules" dev=dm-0 ino=13716388
scontext=user_u:system_r:setroubleshootd_t:s0
tcontext=system_u:object_r:modules_object_t:s0 tclass=dir'
An example audit message stored in syslog (not processed by the audit daemon - line
breaks added):
'Sep 12 08:26:43 dhcp83-5 kernel: audit(1158064002.046:4): avc: denied { read }
for pid=2 496 comm="bluez-pin" name=".gdm1K3IFT" dev=dm-0 ino=3601333
scontext=user_u:system_r:bluetooth_helper_t:s0-s0:c0
tcontext=system_u:object_r:xdm_tmp_t:s0 tclass=file
c C s\ t j| |� tj� | _tj� | _d| _d| _d| _d| _ d| _
g | _ d| _ d | _
tj| _d S )Nr T)r r! r �SecurityContext�scontext�tcontext�tclass�comm�exer0 �name�accesses�denial�ioctlcmd� audit2why�TERULE�type)r r r r r r! � s
zAVCMessage.__init__c C s| d}|}|t |�d kr&td| j ��x:|t |�k r`|| dkrFd}P | jj|| � |d }q(W |sttd| j ��|d S )NFr z#AVC message in invalid format [%s]
�}T)r& �
ValueErrorr r: �append)r r' �startZ found_close�ir r r Z__parse_access� s zAVCMessage.__parse_accessc C s� t j| |� d}d}d}d}�xftt|��D �]T}|| dkrV| j||d �}d}q,n|| dkrhd| _|| jd�}t|�dkr�q,|d d kr�tj|d �| _ d}q,|d d
kr�tj|d �| _
d}q,|d d kr�|d | _ d}q,|d d k�r|d dd� | _ q,|d d
k�r(|d dd� | _
q,|d dk�rJ|d dd� | _q,|d dkr,yt|d d�| _W q, tk
�r� Y q,X q,W | �s�| �s�| �s�| �r�td| j ��| j� d S )NF�{r TZgrantedr" r# r r4 r5 r6 r7 r8 r9 r< � z#AVC message in invalid format [%s]
r1 r1 r1 )r r) �ranger& �_AVCMessage__parse_accessr; r
r r3 r4 r5 r6 r7 r8 r9 �intr< rA r �analyze)r r' Z found_srcZ found_tgtZ found_classZ found_accessrD r( r r r r) � sL
z AVCMessage.from_split_stringc C s� | j j� }| jj� }t| j�}g | _||| j|ftj� krXt||| j|f \| _ | _�n�t
j ||| j| j�\| _ | _| j t
j kr�t
j
| _ | j t
jkr�td| ��| j t
jkr�td| ��| j t
jkr�td| j ��| j t
jkr�tddj| j� ��| j t
jk�rtd��| j t
jk�r�| jg| _| jj| j jk�rR| jjd| jj d| j j f� | jj| j jk�r�| j jdk�r�| jjd | jj d | j j f� | jj| j jk�r�| jjd
| jj d
| j j f� | j | jft||| j|f< d S ) NzInvalid Target Context %s
zInvalid Source Context %s
zInvalid Type Class %s
zInvalid permission %s
� z&Error during access vector computationz user (%s)Zobject_rz role (%s)z
level (%s))r5 Z to_stringr4 �tupler: �datar6 �avcdict�keysr? r= rJ ZNOPOLICYr> ZBADTCONrA ZBADSCONZBADPERM�joinZ
BADCOMPUTEZ
CONSTRAINT�userrB �role�level)r r5 r4 Z access_tupler r r rJ � s8
zAVCMessage.analyzeN)r* r+ r, r- r! rH r) rJ r r r r r2 � s
-r2 c @ s e Zd ZdZdd� ZdS )�PolicyLoadMessagez6Audit message indicating that the policy was reloaded.c C s t j| |� d S )N)r r! )r r r r r r! s zPolicyLoadMessage.__init__N)r* r+ r, r- r! r r r r rT s rT c @ s e Zd ZdZdd� Zdd� ZdS )�DaemonStartMessagez3Audit message indicating that a daemon was started.c C s t j| |� d| _d S )NF)r r! �auditd)r r r r r r! % s zDaemonStartMessage.__init__c C s t j| |� d|krd| _d S )NrV T)r r) rV )r r' r r r r) ) s z$DaemonStartMessage.from_split_stringN)r* r+ r, r- r! r) r r r r rU # s rU c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �ComputeSidMessagea� Audit message indicating that a sid was not valid.
Compute sid messages are generated on attempting to create a security
context that is not valid. Security contexts are invalid if the role is
not authorized for the user or the type is not authorized for the role.
This class does not store all of the fields from the compute sid message -
just the type and role.
c C s4 t j| |� tj� | _tj� | _tj� | _d| _d S )Nr )r r! r r3 �invalid_contextr4 r5 r6 )r r r r r r! 9 s
zComputeSidMessage.__init__c C s� t j| |� t|�dk r td��y\tj|d �| _tj|d jd�d �| _tj|d jd�d �| _ |d jd�d | _
W n td��Y nX d S ) N�
z;Split string does not represent a valid compute sid message� � r" r � � ) r r) r& rA r r3 rX r
r4 r5 r6 )r r' r r r r) @ s z#ComputeSidMessage.from_split_stringc C s d| j | jf S )Nzrole %s types %s;
)rR r? )r r r r r L s zComputeSidMessage.outputN)r* r+ r, r- r! r) r r r r r rW / s rW c @ s^ e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
ddd�Z ddd�Z dS )� AuditParsera� Parser for audit messages.
This class parses audit messages and stores them according to their message
type. This is not a general purpose audit message parser - it only extracts
selinux related messages.
Each audit messages are stored in one of four lists:
avc_msgs - avc denial or granted messages. Messages are stored in
AVCMessage objects.
comput_sid_messages - invalid sid messages. Messages are stored in
ComputSidMessage objects.
invalid_msgs - selinux related messages that are not valid. Messages
are stored in InvalidMessageObjects.
policy_load_messages - policy load messages. Messages are stored in
PolicyLoadMessage objects.
These lists will be reset when a policy load message is seen if
AuditParser.last_load_only is set to true. It is assumed that messages
are fed to the parser in chronological order - time stamps are not
parsed.
Fc C s | j � || _d S )N)�_AuditParser__initialize�last_load_only)r r` r r r r! g s zAuditParser.__init__c C s. g | _ g | _g | _g | _g | _i | _d| _d S )NF)�avc_msgs�compute_sid_msgs� invalid_msgs�policy_load_msgs� path_msgs� by_header�check_input_file)r r r r Z __initializek s zAuditParser.__initializec C s� dd� |j � D �}x�|D ]�}d}|dks8|dks8|dkrFt|�}d}n^|dkr\t|�}d}nH|d ksl|d
krzt|�}d}n*|d kr�t|�}d}n|d kr�tt�}d}|rd| _y|j|� W n t k
r� t
|�}Y nX |S qW d S )
Nc S s g | ]}|j d ��qS )u
)�strip)�.0�xr r r �
<listcomp>� s z,AuditParser.__parse_line.<locals>.<listcomp>Fzavc:z message=avc:z msg='avc:Tzsecurity_compute_sid:ztype=MAC_POLICY_LOADz type=1403z
type=AVC_PATHztype=DAEMON_START) r
r2 rW rT r/ rU �listrg r) rA r. )r �lineZrecrD �foundr% r r r Z __parse_line� s4
zAuditParser.__parse_linec C s� | j |�}|d krd S t|t�r0| jr�| j� n�t|t�r\|jrN| jrN| j� | jj|� n^t|t �rt| j
j|� nFt|t �r�| j j|� n.t|t
�r�| jj|� nt|t�r�| jj|� |jdkr�|j| jkr�| j|j j|� n|g| j|j< d S )Nr )�_AuditParser__parse_line�
isinstancerT r` r_ rU rV rd rB r2 ra rW rb r. rc r/ re r rf )r rm r% r r r Z__parse� s,
zAuditParser.__parsec C sx xr| j j� D ]d}g }d }x0|D ](}t|t�r2|}q t|t�r |j|� q W t|�dkr |r x|D ] }|j|_q`W q W d S )Nr )rf �valuesrp r/ r2 rB r& r0 )r �value�avcr0 r% �ar r r Z__post_process� s
zAuditParser.__post_processc C sL |j � }x|r"| j|� |j � }q
W | js@tjjd� tjd� | j� dS )zpParse the contents of a file object. This method can be called
multiple times (along with parse_string).zNothing to do
r N)�readline�_AuditParser__parserg �sys�stderr�write�exit�_AuditParser__post_process)r �inputrm r r r �
parse_file� s
zAuditParser.parse_filec C s. |j d�}x|D ]}| j|� qW | j� dS )z�Parse a string containing audit messages - messages should
be separated by new lines. This method can be called multiple
times (along with parse_file).�
N)r
rv r{ )r r| �lines�lr r r � parse_string� s
zAuditParser.parse_stringNc C s@ t j� }x2| jD ](}| s$|j|�r|j|jj|jj� qW |S )ao Return RoleAllowSet statements matching the specified filter
Filter out types that match the filer, or all roles
Params:
role_filter - [optional] Filter object used to filter the
output.
Returns:
Access vector set representing the denied access in the
audit logs parsed by this object.
)r Z RoleTypeSetrb �filter�addrX rR r? )r Z role_filterZ
role_typesZcsr r r �to_role� s
zAuditParser.to_roleTc C s� t j� }x�| jD ]�}|jdkr$|r$q| s4|j|�rt j|jj|jj|j g|j
�}|j |_ |j|_|j r�t
j� }|j|j � ||jd< |j||d� qW |S )a� Convert the audit logs access into a an access vector set.
Convert the audit logs into an access vector set, optionally
filtering the restults with the passed in filter object.
Filter objects are object instances with a .filter method
that takes and access vector and returns True if the message
should be included in the final output and False otherwise.
Params:
avc_filter - [optional] Filter object used to filter the
output.
Returns:
Access vector set representing the denied access in the
audit logs parsed by this object.
TZioctl)Z audit_msg)r ZAccessVectorSetra r; r� Z AccessVectorr4 r? r5 r6 r: rM r< r ZXpermSetr� ZxpermsZadd_av)r Z
avc_filterZ only_denialsZav_setrs �avZ xperm_setr r r � to_access� s
zAuditParser.to_access)F)N)NT)
r* r+ r, r- r! r_ ro rv r{ r} r� r� r� r r r r r^ Q s
$%
r^ c @ s e Zd Zdd� Zdd� ZdS )�
AVCTypeFilterc C s t j|�| _d S )N)�re�compile�regex)r r� r r r r! % s zAVCTypeFilter.__init__c C s, | j j|jj�rdS | j j|jj�r(dS dS )NTF)r� �matchr4 r? r5 )r rs r r r r� ( s
zAVCTypeFilter.filterN)r* r+ r, r! r� r r r r r� $ s r� c @ s e Zd Zdd� Zdd� ZdS )�ComputeSidTypeFilterc C s t j|�| _d S )N)r� r� r� )r r� r r r r! 0 s z ComputeSidTypeFilter.__init__c C s@ | j j|jj�rdS | j j|jj�r(dS | j j|jj�r<dS dS )NTF)r� r� rX r? r4 r5 )r rs r r r r� 3 s zComputeSidTypeFilter.filterN)r* r+ r, r! r� r r r r r� / s r� )r� rw r r r r r r r r r. r/ Zselinux.audit2whyr= rN r2 rT rU rW r^ r� r� r r r r �<module> s*
" T sepolgen/__pycache__/output.cpython-36.pyc 0000644 00000006656 14751155147 0014605 0 ustar 00 3
�� f� � @ sp d Z ddlmZ ddlmZ ejr.ddlmZ G dd� d�Zdd� Zd d
� Zd d � Z d
d� Z
dd� Z dd� Z dS )ai
Classes and functions for the output of reference policy modules.
This module takes a refpolicy.Module object and formats it for
output using the ModuleWriter object. By separating the output
in this way the other parts of Madison can focus solely on
generating policy. This keeps the semantic / syntactic issues
cleanly separated from the formatting issues.
� )� refpolicy)�util)�cmpc @ s e Zd Zdd� Zdd� ZdS )� ModuleWriterc C s d | _ d | _d| _d| _d S )NT)�fd�module�sort�requires)�self� r � /usr/lib/python3.6/output.py�__init__& s zModuleWriter.__init__c C sJ || _ | jrt| j � x.tj| j dd�D ]\}}|jdt|� � q(W d S )NT)Z showdepthz%s
)r r � sort_filterr Zwalktree�write�str)r
r r �node�depthr r r r , s
zModuleWriter.writeN)�__name__�
__module__� __qualname__r
r r r r r r % s r c C s� t j| �}|j� t j|�}|j� t|�t|�krFt|d |d �S x4t||�D ]&}|d |d krRt|d |d �S qRW dS )N� r )r Z set_to_listr �lenr �zip)�x�yZxlZyl�vr r r �
id_set_cmp= s
r c C sd t | j|j�}|dkr|S t | j|j�}|dkr4|S t | j|j�}|dkrN|S tt| j�t|j��S )Nr )r � src_typesZ tgt_typesZ obj_classesr r Zperms)�a�b�retr r r �
avrule_cmpK s r! c C s8 | j d |j d kr*t| j d |j d �S t| j|j�S )Nr )�argsr Zifname)r r r r r �
ifcall_cmpZ s r# c C sf t | tj�r8t |tj�r"t| |�S t| jd g|j�S n*t |tj�rNt| |�S t| j|jd g�S d S )Nr ) �
isinstancer �
InterfaceCallr# r r" r ZAVRuler! )r r r r r �rule_cmp` s
r& c C s t | j|j�S )N)r Zrole)r r r r r �
role_type_cmpl s r' c C s& dd� }x| j � D ] }||� qW dS )z/Sort and group the output for readability.
c S s� g }x(| j � D ] }|j|� |jtj� � qW x| j� D ]}|j|� q8W |jtj� � g }|j| j� � |j| j� � |jt j
t �d� d }g }x||D ]t}t |tj
�r�|jd }n t j|j�}||k�r|r�|jtj� � |}tj� } | jjd| � |j| � |j|� q�W |j|� g }
|
j| j� � |
jt j
t�d� t|
��rftj� } | jjd� |j| � |j|
� x$| jD ]} | |k�rx|j| � �qxW || _d S )N)�keyr z ============= %s ==============z"============= ROLES ==============)Zmodule_declarations�appendr �Commentr �extendZavrulesZinterface_callsr r �
cmp_to_keyr& r$ r% r" �firstr �linesZ
role_typesr' r Zchildren) r �c�modZrequireZrulesZcurZ sep_rulesZruler ZcommentZrasZchildr r r � sort_noder sL
z sort_filter.<locals>.sort_nodeN)Znodes)r r1 r r r r r o s <r N)
�__doc__� r r ZPY3r r r r! r# r& r' r r r r r �<module> s sepolgen/__pycache__/refpolicy.cpython-36.opt-1.pyc 0000644 00000117634 14751155147 0016177 0 ustar 00 3
�� f�} � @ sb d dl Z d dlZd ZdZdZdZdZdZddd d
d d gZeeeeeed
�Z G dd� d�Z
G dd� de
�Z G dd� de
�Z dzdd�Z
d{dd�Zd}d d �Zd d � ZG d d!� d!e�ZG d"d#� d#e �ZG d$d%� d%e �ZG d&d'� d'�ZG d(d)� d)e �ZG d*d+� d+e �ZG d,d-� d-e �ZG d.d/� d/e �ZG d0d1� d1e �ZG d2d3� d3e �ZG d4d5� d5e �Z G d6d7� d7e �Z G d8d9� d9e �Z G d:d;� d;e �Z G d<d=� d=e �Z G d>d?� d?e �Z!G d@dA� dAe �Z"G dBdC� dCe �Z#G dDdE� dEe �Z$G dFdG� dGe �Z%G dHdI� dIe �Z&G dJdK� dKe �Z'G dLdM� dMe �Z(G dNdO� dOe �Z)G dPdQ� dQe �Z*G dRdS� dSe �Z+G dTdU� dUe �Z,G dVdW� dWe �Z-G dXdY� dYe �Z.G dZd[� d[e �Z/G d\d]� d]e �Z0d^d_� Z1G d`da� dae �Z2G dbdc� dce �Z3G ddde� dee �Z4G dfdg� dge �Z5G dhdi� die �Z6G djdk� dke �Z7G dldm� dme �Z8G dndo� doe �Z9G dpdq� dqe �Z:G drds� dse �Z;G dtdu� du�Z<G dvdw� dw�Z=G dxdy� dy�Z>dS )~� N� � � � � �source�target�object�
permission�role� destination)r r r r
r r c @ s e Zd Zddd�ZdS )�
PolicyBaseNc C s d | _ d | _d S )N)�parent�comment)�selfr � r � /usr/lib/python3.6/refpolicy.py�__init__5 s zPolicyBase.__init__)N)�__name__�
__module__� __qualname__r r r r r r
4 s r
c @ s� e Zd ZdZd/dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� ZdS )0�Nodea� Base class objects produced from parsing the reference policy.
The Node class is used as the base class for any non-leaf
object produced by parsing the reference policy. This object
should contain a reference to its parent (or None for a top-level
object) and 0 or more children.
The general idea here is to have a very simple tree structure. Children
are not separated out by type. Instead the tree structure represents
fairly closely the real structure of the policy statements.
The object should be iterable - by default over all children but
subclasses are free to provide additional iterators over a subset
of their childre (see Interface for example).
Nc C s t j| |� g | _d S )N)r
r �children)r r r r r r J s z
Node.__init__c C s
t | j�S )N)�iterr )r r r r �__iter__N s z
Node.__iter__c C s t dd� t| ��S )Nc S s
t | t�S )N)�
isinstancer )�xr r r �<lambda>W s z Node.nodes.<locals>.<lambda>)�filter�walktree)r r r r �nodesV s z
Node.nodesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Module)r r r r r Z s z Node.modules.<locals>.<lambda>)r r )r r r r �modulesY s z Node.modulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � Interface)r r r r r ] s z!Node.interfaces.<locals>.<lambda>)r r )r r r r �
interfaces\ s zNode.interfacesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Template)r r r r r ` s z Node.templates.<locals>.<lambda>)r r )r r r r � templates_ s zNode.templatesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �
SupportMacros)r r r r r c s z%Node.support_macros.<locals>.<lambda>)r r )r r r r �support_macrosb s zNode.support_macrosc C s t dd� t| ��S )Nc S s
t | t�S )N)r �ModuleDeclaration)r r r r r h s z*Node.module_declarations.<locals>.<lambda>)r r )r r r r �module_declarationsg s zNode.module_declarationsc C s t dd� t| ��S )Nc S s
t | t�S )N)r �
InterfaceCall)r r r r r k s z&Node.interface_calls.<locals>.<lambda>)r r )r r r r �interface_callsj s zNode.interface_callsc C s t dd� t| ��S )Nc S s
t | t�S )N)r �AVRule)r r r r r n s z Node.avrules.<locals>.<lambda>)r r )r r r r �avrulesm s z Node.avrulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � AVExtRule)r r r r r q s z!Node.avextrules.<locals>.<lambda>)r r )r r r r �
avextrulesp s zNode.avextrulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �TypeRule)r r r r r t s z Node.typerules.<locals>.<lambda>)r r )r r r r � typeruless s zNode.typerulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � TypeBound)r r r r r w s z!Node.typebounds.<locals>.<lambda>)r r )r r r r �
typeboundsv s zNode.typeboundsc C s t dd� t| ��S )zAIterate over all of the TypeAttribute children of this Interface.c S s
t | t�S )N)r �
TypeAttribute)r r r r r { s z%Node.typeattributes.<locals>.<lambda>)r r )r r r r �typeattributesy s zNode.typeattributesc C s t dd� t| ��S )zAIterate over all of the RoleAttribute children of this Interface.c S s
t | t�S )N)r �
RoleAttribute)r r r r r s z%Node.roleattributes.<locals>.<lambda>)r r )r r r r �roleattributes} s zNode.roleattributesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Require)r r r r r � s z Node.requires.<locals>.<lambda>)r r )r r r r �requires� s z
Node.requiresc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Role)r r r r r � s z Node.roles.<locals>.<lambda>)r r )r r r r �roles� s z
Node.rolesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � RoleAllow)r r r r r � s z"Node.role_allows.<locals>.<lambda>)r r )r r r r � role_allows� s zNode.role_allowsc C s t dd� t| ��S )Nc S s
t | t�S )N)r �RoleType)r r r r r � s z!Node.role_types.<locals>.<lambda>)r r )r r r r �
role_types� s zNode.role_typesc C s( | j r t| j �d | j� S | j� S d S )N�
)r �str� to_string)r r r r �__str__� s z Node.__str__c C s d| j j| j� f S )Nz<%s(%s)>)� __class__r rC )r r r r �__repr__� s z
Node.__repr__c C s dS )N� r )r r r r rC � s zNode.to_string)N)r r r �__doc__r r r r" r$ r& r( r* r, r. r0 r2 r4 r6 r8 r: r< r> r@ rD rF rC r r r r r 9 s.
r c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �LeafNc C s t j| |� d S )N)r
r )r r r r r r � s z
Leaf.__init__c C s( | j r t| j �d | j� S | j� S d S )NrA )r rB rC )r r r r rD � s z Leaf.__str__c C s d| j j| j� f S )Nz<%s(%s)>)rE r rC )r r r r rF � s z
Leaf.__repr__c C s dS )NrG r )r r r r rC � s zLeaf.to_string)N)r r r r rD rF rC r r r r rI � s
rI TFc
c s� |r
d}nd}| dfg}x�t |�dkr�|j|�\}}|rD||fV n|V t|t�rg }t |j�d } xD| dkr�|dks�t|j| |�r�|j|j| |d f� | d8 } qhW |j|� qW dS )a� Iterate over a Node and its Children.
The walktree function iterates over a tree containing Nodes and
leaf objects. The iteration can perform a depth first or a breadth
first traversal of the tree (controlled by the depthfirst
paramater. The passed in node will be returned.
This function will only work correctly for trees - arbitrary graphs
will likely cause infinite looping.
r r N���)�len�popr r r �append�extend)
�nodeZ
depthfirst� showdepth�type�index�stackZcur�depth�items�ir r r r � s"
r c c s* x$| D ] }|dks t ||�r|V qW dS )a Iterate over the direct children of a Node.
The walktree function iterates over the children of a Node.
Unlike walktree it does note return the passed in node or
the children of any Node objects (that is, it does not go
beyond the current level in the tree).
N)r )rO rQ r r r r �walknode� s
rW �{�}c C sR t | �}d}|dk r td��dj| �}|dkr2|S |d d | d |d S dS )z�Convert a set (or any sequence type) into a string representation
formatted to match SELinux space separated list conventions.
For example the list ['read', 'write'] would be converted into:
'{ read write }'
rG r z"cannot convert 0 len set to string� r N)rK �
ValueError�join)�s�cont�lrB r r r �list_to_space_str� s
r` c C s" t | �}|dk rtd��dj| �S )Nr z'cannot conver 0 len set to comma stringz, )rK r[ r\ )r] r_ r r r �list_to_comma_str� s ra c @ s& e Zd Zddd�Zdd� Zdd� ZdS ) �IdSetNc C s& |rt j| |� n
t j| � d| _d S )NF)�setr Z
compliment)r �listr r r r � s
zIdSet.__init__c C s t t| ��S )N)r` �sorted)r r r r � to_space_str s zIdSet.to_space_strc C s t t| ��S )N)ra re )r r r r � to_comma_str s zIdSet.to_comma_str)N)r r r r rf rg r r r r rb � s
rb c @ s4 e Zd ZdZd dd�Zdd� Zdd� Zd d d
�ZdS )
�SecurityContextz;An SELinux security context with optional MCS / MLS fields.Nc C s: t j| |� d| _d| _d| _d| _|dk r6| j|� dS )z�Create a SecurityContext object, optionally from a string.
Parameters:
[context] - string representing a security context. Same format
as a string passed to the from_string method.
rG N)rI r �userr rQ �level� from_string)r �contextr r r r r s zSecurityContext.__init__c C s� t j|�}|d dkr |d }|jd�}t|�dk r@td| ��|d | _|d | _|d | _t|�dkr�dj|dd� �| _ nd| _ dS )z�Parse a string representing a context into a SecurityContext.
The string should be in the standard format - e.g.,
'user:role:type:level'.
Raises ValueError if the string is not parsable as a security context.
r r �:r z)context string [%s] not in a valid formatr N)
�selinuxZ selinux_trans_to_raw_context�splitrK r[ ri r rQ r\ rj )r rl �raw�fieldsr r r rk s
zSecurityContext.from_stringc C s0 | j |j ko.| j|jko.| j|jko.| j|jkS )a Compare two SecurityContext objects - all fields must be exactly the
the same for the comparison to work. It is possible for the level fields
to be semantically the same yet syntactically different - in this case
this function will return false.
)ri r rQ rj )r �otherr r r �__eq__4 s zSecurityContext.__eq__c C s\ | j | j| jg}| jdkrF|dkr:tj� dkrD|jd� qR|j|� n |j| j� dj|�S )a� Return a string representing this security context.
By default, the string will contiain a MCS / MLS level
potentially from the default which is passed in if none was
set.
Arguments:
default_level - the default level to use if self.level is an
empty string.
Returns:
A string represening the security context in the form
'user:role:type:level'.
Nr Zs0rm )ri r rQ rj rn Zis_selinux_mls_enabledrM r\ )r Z
default_levelrq r r r rC ? s
zSecurityContext.to_string)NN)N)r r r rH r rk rs rC r r r r rh s
rh c @ s e Zd ZdZddd�ZdS )� ObjectClassa" SELinux object class and permissions.
This class is a basic representation of an SELinux object
class - it does not represent separate common permissions -
just the union of the common and class specific permissions.
It is meant to be convenient for policy generation.
rG Nc C s t j| |� || _t� | _d S )N)rI r �namerb �perms)r ru r r r r r a s zObjectClass.__init__)rG N)r r r rH r r r r r rt Y s rt c @ s< e Zd ZdZddd�Zdd� Zdd� Zdd
d �Zd d
� Zd S )�XpermSeta) Extended permission set.
This class represents one or more extended permissions
represented by numeric values or ranges of values. The
.complement attribute is used to specify all permission
except those specified.
Two xperm set can be merged using the .extend() method.
Fc C s || _ g | _d S )N)�
complement�ranges)r rx r r r r p s zXpermSet.__init__c C s� | j j� d}x�|t| j �k r�x�|d t| j �k r�| j |d d | j | d d kr�| j | d t| j | d | j |d d �f| j |< | j |d = q P q W |d7 }qW dS )z0Ensure that ranges are not overlapping.
r r N)ry �sortrK �max)r rV r r r Z__normalize_rangest s
$ zXpermSet.__normalize_rangesc C s | j j|j � | j� dS )z%Add ranges from an xperm set
N)ry rN �_XpermSet__normalize_ranges)r r] r r r rN � s zXpermSet.extendNc C s( |dkr |}| j j||f� | j� dS )z7Add value of range of values to the xperm set.
N)ry rM r| )r ZminimumZmaximumr r r �add� s z XpermSet.addc C sz | j s
dS | jrdnd}t| j �dkrX| j d d | j d d krX|t| j d d � S tdd� | j �}d|dj|�f S ) NrG z~ r r c S s$ | d | d kr t | d �S d| S )Nr r z%s-%s)rB )r r r r r � s z$XpermSet.to_string.<locals>.<lambda>z%s{ %s }rZ )ry rx rK rB �mapr\ )r Zcompl�valsr r r rC � s *zXpermSet.to_string)F)N) r r r rH r r| rN r} rC r r r r rw f s
rw c @ s" e Zd ZdZddd�Zdd� ZdS )r5 z[SElinux typeattribute statement.
This class represents a typeattribute statement.
Nc C s t j| |� d| _t� | _d S )NrG )rI r rQ rb �
attributes)r r r r r r � s zTypeAttribute.__init__c C s d| j | jj� f S )Nztypeattribute %s %s;)rQ r� rg )r r r r rC � s zTypeAttribute.to_string)N)r r r rH r rC r r r r r5 � s
r5 c @ s" e Zd ZdZddd�Zdd� ZdS )r7 z[SElinux roleattribute statement.
This class represents a roleattribute statement.
Nc C s t j| |� d| _t� | _d S )NrG )rI r r rb r8 )r r r r r r � s zRoleAttribute.__init__c C s d| j | jj� f S )Nzroleattribute %s %s;)r r8 rg )r r r r rC � s zRoleAttribute.to_string)N)r r r rH r rC r r r r r7 � s
r7 c @ s e Zd Zddd�Zdd� ZdS )r; Nc C s t j| |� d| _t� | _d S )NrG )rI r r rb �types)r r r r r r � s z
Role.__init__c C s* d}x | j D ]}|d| j|f 7 }q W |S )NrG zrole %s types %s;
)r� r )r r] �tr r r rC � s zRole.to_string)N)r r r r rC r r r r r; � s
r; c @ s e Zd Zddd�Zdd� ZdS )�TyperG Nc C s& t j| |� || _t� | _t� | _d S )N)rI r ru rb r� �aliases)r ru r r r r r � s z
Type.__init__c C sR d| j }t| j�dkr*|d| jj� }t| j�dkrJ|d| jj� }|d S )Nztype %sr zalias %sz, %s�;)ru rK r� rf r� rg )r r] r r r rC � s
zType.to_string)rG N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )� TypeAliasNc C s t j| |� d| _t� | _d S )NrG )rI r rQ rb r� )r r r r r r � s zTypeAlias.__init__c C s d| j | jj� f S )Nztypealias %s alias %s;)rQ r� rf )r r r r rC � s zTypeAlias.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )� AttributerG Nc C s t j| |� || _d S )N)rI r ru )r ru r r r r r � s zAttribute.__init__c C s
d| j S )Nz
attribute %s;)ru )r r r r rC � s zAttribute.to_string)rG N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�Attribute_RolerG Nc C s t j| |� || _d S )N)rI r ru )r ru r r r r r � s zAttribute_Role.__init__c C s
d| j S )Nzattribute_role %s;)ru )r r r r rC � s zAttribute_Role.to_string)rG N)r r r r rC r r r r r� � s
r� c @ sB e Zd ZdZdZdZdZdZddd�Zd d
� Z d d � Z
d
d� Z dS )r- a� SELinux access vector (AV) rule.
The AVRule class represents all varieties of AV rules including
allow, dontaudit, and auditallow (indicated by the flags self.ALLOW,
self.DONTAUDIT, and self.AUDITALLOW respectively).
The source and target types, object classes, and perms are all represented
by sets containing strings. Sets are used to make it simple to add
strings repeatedly while avoiding duplicates.
No checking is done to make certain that the symbols are valid or
consistent (e.g., perms that don't match the object classes). It is
even possible to put invalid types like '$1' into the rules to allow
storage of the reference policy interfaces.
r r r r Nc C sF t j| |� t� | _t� | _t� | _t� | _| j| _|rB| j |� d S )N)
rI r rb � src_types� tgt_types� obj_classesrv �ALLOW� rule_type�from_av)r �avr r r r r
s zAVRule.__init__c C sD | j | jkrdS | j | jkr dS | j | jkr0dS | j | jkr@dS d S )NZallowZ dontauditZ
auditallowZ
neverallow)r� r� � DONTAUDIT�
AUDITALLOW�
NEVERALLOW)r r r r �__rule_type_str s zAVRule.__rule_type_strc C sV | j j|j� |j|jkr(| jjd� n| jj|j� | jj|j� | jj|j� dS )zIAdd the access from an access vector to this allow
rule.
r N) r� r} �src_type�tgt_typer� r� � obj_classrv �update)r r� r r r r� s zAVRule.from_avc C s. d| j � | jj� | jj� | jj� | jj� f S )z�Return a string representation of the rule
that is a valid policy language representation (assuming
that the types, object class, etc. are valie).
z%s %s %s:%s %s;)�_AVRule__rule_type_strr� rf r� r� rv )r r r r rC * s
zAVRule.to_string)NN) r r r rH r� r� r� r� r r� r� rC r r r r r- � s
r- c @ sB e Zd ZdZdZdZdZdZddd�Zd d
� Z d d � Z
d
d� Z dS )r/ aj Extended permission access vector rule.
The AVExtRule class represents allowxperm, dontauditxperm,
auditallowxperm, and neverallowxperm rules.
The source and target types, and object classes are represented
by sets containing strings. The operation is a single string,
e.g. 'ioctl'. Extended permissions are represented by an XpermSet.
r r r r Nc C sN t j| |� t� | _t� | _t� | _| j| _t� | _ || _
|rJ| j ||� d S )N) rI r rb r� r� r� �
ALLOWXPERMr� rw �xperms� operationr� )r r� �opr r r r r D s zAVExtRule.__init__c C sD | j | jkrdS | j | jkr dS | j | jkr0dS | j | jkr@dS d S )NZ
allowxpermZdontauditxpermZauditallowxpermZneverallowxperm)r� r� �DONTAUDITXPERM�AUDITALLOWXPERM�NEVERALLOWXPERM)r r r r r� O s zAVExtRule.__rule_type_strc C sZ | j j|j� |j|jkr(| jjd� n| jj|j� | jj|j� || _|j| | _d S )Nr ) r� r} r� r� r� r� r� r� r� )r r� r� r r r r� Y s zAVExtRule.from_avc C s2 d| j � | jj� | jj� | jj� | j| jj� f S )z�Return a string representation of the rule that is
a valid policy language representation (assuming that
the types, object class, etc. are valid).
z%s %s %s:%s %s %s;)�_AVExtRule__rule_type_strr� rf r� r� r� r� rC )r r r r rC c s zAVExtRule.to_string)NNN) r r r rH r� r� r� r� r r� r� rC r r r r r/ 5 s
r/ c @ s6 e Zd ZdZdZdZdZd dd�Zdd � Zd
d � Z dS )
r1 z�SELinux type rules.
This class is very similar to the AVRule class, but is for representing
the type rules (type_trans, type_change, and type_member). The major
difference is the lack of perms and only and sing destination type.
r r r Nc C s6 t j| |� t� | _t� | _t� | _d| _| j| _d S )NrG ) rI r rb r� r� r� � dest_type�TYPE_TRANSITIONr� )r r r r r r z s zTypeRule.__init__c C s( | j | jkrdS | j | jkr dS dS d S )NZtype_transitionZ type_changeZ type_member)r� r� � TYPE_CHANGE)r r r r r� � s
zTypeRule.__rule_type_strc C s* d| j � | jj� | jj� | jj� | jf S )Nz%s %s %s:%s %s;)�_TypeRule__rule_type_strr� rf r� r� r� )r r r r rC � s
zTypeRule.to_string)N)
r r r rH r� r� Z TYPE_MEMBERr r� rC r r r r r1 o s
r1 c @ s" e Zd ZdZddd�Zdd� ZdS )r3 zSSElinux typebound statement.
This class represents a typebound statement.
Nc C s t j| |� d| _t� | _d S )NrG )rI r rQ rb r� )r r r r r r � s zTypeBound.__init__c C s d| j | jj� f S )Nztypebounds %s %s;)rQ r� rg )r r r r rC � s zTypeBound.to_string)N)r r r rH r rC r r r r r3 � s
r3 c @ s e Zd Zddd�Zdd� ZdS )r= Nc C s t j| |� t� | _t� | _d S )N)rI r rb � src_roles� tgt_roles)r r r r r r � s zRoleAllow.__init__c C s d| j j� | jj� f S )Nz allow %s %s;)r� rg r� )r r r r rC � s
zRoleAllow.to_string)N)r r r r rC r r r r r= � s
r= c @ s e Zd Zddd�Zdd� ZdS )r? Nc C s t j| |� d| _t� | _d S )NrG )rI r r rb r� )r r r r r r � s zRoleType.__init__c C s* d}x | j D ]}|d| j|f 7 }q W |S )NrG zrole %s types %s;
)r� r )r r] r� r r r rC � s zRoleType.to_string)N)r r r r rC r r r r r? � s
r? c @ s e Zd Zddd�Zdd� ZdS )r) Nc C s" t j| |� d| _d| _d| _d S )NrG F)rI r ru �version� refpolicy)r r r r r r � s zModuleDeclaration.__init__c C s* | j rd| j| jf S d| j| jf S d S )Nzpolicy_module(%s, %s)z
module %s %s;)r� ru r� )r r r r rC � s zModuleDeclaration.to_string)N)r r r r rC r r r r r) � s
r) c @ s e Zd Zddd�Zdd� ZdS )� ConditionalNc C s t j| |� g | _d S )N)r r � cond_expr)r r r r r r � s zConditional.__init__c C s dt | jdd� S )Nz[If %s]rG )r^ )rG rG )r` r� )r r r r rC � s zConditional.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�BoolNc C s t j| |� d| _d| _d S )NrG F)rI r ru �state)r r r r r r � s z
Bool.__init__c C s$ d| j }|jr|d S |d S d S )Nzbool %s �trueZfalse)ru r� )r r] r r r rC � s
zBool.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�
InitialSidNc C s t j| |� d| _d | _d S )NrG )rI r ru rl )r r r r r Z__init� s zInitialSid.__initc C s d| j t| j�f S )Nz sid %s %s)ru rB rl )r r r r rC � s zInitialSid.to_string)N)r r r Z_InitialSid__initrC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�GenfsConNc C s" t j| |� d| _d| _d | _d S )NrG )rI r �
filesystem�pathrl )r r r r r r � s zGenfsCon.__init__c C s d| j | jt| j�f S )Nzgenfscon %s %s %s)r� r� rB rl )r r r r rC � s zGenfsCon.to_string)N)r r r r rC r r r r r� � s
r� c @ s* e Zd ZdZdZdZd dd�Zdd� ZdS )
�
FilesystemUser r r Nc C s$ t j| |� | j| _d| _d | _d S )NrG )rI r �XATTRrQ r� rl )r r r r r r � s zFilesystemUse.__init__c C sN d}| j | jkrd}n"| j | jkr(d}n| j | jkr8d}d|| jt| j�f S )NrG z
fs_use_xattr z
fs_use_trans z fs_use_task z %s %s %s;)rQ r� �TRANS�TASKr� rB rl )r r] r r r rC � s zFilesystemUse.to_string)N)r r r r� r� r� r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�PortConNc C s" t j| |� d| _d| _d | _d S )NrG )rI r � port_type� port_numberrl )r r r r r r s zPortCon.__init__c C s d| j | jt| j�f S )Nzportcon %s %s %s)r� r� rB rl )r r r r rC s zPortCon.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�NodeConNc C s" t j| |� d| _d| _d | _d S )NrG )rI r �start�endrl )r r r r r r
s zNodeCon.__init__c C s d| j | jt| j�f S )Nznodecon %s %s %s)r� r� rB rl )r r r r rC s zNodeCon.to_string)N)r r r r rC r r r r r� s
r� c @ s e Zd Zddd�Zdd� ZdS )�NetifConNc C s" t j| |� d| _d | _d | _d S )NrG )rI r � interface�interface_context�packet_context)r r r r r r s zNetifCon.__init__c C s d| j t| j�t| j�f S )Nznetifcon %s %s %s)r� rB r� r� )r r r r rC s zNetifCon.to_string)N)r r r r rC r r r r r� s
r� c @ s e Zd Zddd�Zdd� ZdS )�PirqConNc C s t j| |� d| _d | _d S )NrG )rI r � pirq_numberrl )r r r r r r s zPirqCon.__init__c C s d| j t| j�f S )Nz
pirqcon %s %s)r� rB rl )r r r r rC # s zPirqCon.to_string)N)r r r r rC r r r r r� s
r� c @ s e Zd Zddd�Zdd� ZdS )�IomemConNc C s t j| |� d| _d | _d S )NrG )rI r �
device_memrl )r r r r r r ' s zIomemCon.__init__c C s d| j t| j�f S )Nziomemcon %s %s)r� rB rl )r r r r rC , s zIomemCon.to_string)N)r r r r rC r r r r r� & s
r� c @ s e Zd Zddd�Zdd� ZdS )� IoportConNc C s t j| |� d| _d | _d S )NrG )rI r �ioportrl )r r r r r r 0 s zIoportCon.__init__c C s d| j t| j�f S )Nzioportcon %s %s)r� rB rl )r r r r rC 5 s zIoportCon.to_string)N)r r r r rC r r r r r� / s
r� c @ s e Zd Zddd�Zdd� ZdS )� PciDeviceConNc C s t j| |� d| _d | _d S )NrG )rI r �devicerl )r r r r r r 9 s zPciDeviceCon.__init__c C s d| j t| j�f S )Nzpcidevicecon %s %s)r� rB rl )r r r r rC > s zPciDeviceCon.to_string)N)r r r r rC r r r r r� 8 s
r� c @ s e Zd Zddd�Zdd� ZdS )�
DeviceTreeConNc C s t j| |� d| _d | _d S )NrG )rI r r� rl )r r r r r r B s zDeviceTreeCon.__init__c C s d| j t| j�f S )Nzdevicetreecon %s %s)r� rB rl )r r r r rC G s zDeviceTreeCon.to_string)N)r r r r rC r r r r r� A s
r� c C sL xFt | dd�D ]6\}}d}xt|�D ] }|d }q$W t|t|� � qW d S )NT)rP rG � )r �range�printrB )�headrO rT r] rV r r r �
print_treeL s
r� c @ s e Zd Zddd�Zdd� ZdS )�HeadersNc C s t j| |� d S )N)r r )r r r r r r U s zHeaders.__init__c C s dS )Nz [Headers]r )r r r r rC X s zHeaders.to_string)N)r r r r rC r r r r r� T s
r� c @ s e Zd Zddd�Zdd� ZdS )r! Nc C s t j| |� d S )N)r r )r r r r r r ] s zModule.__init__c C s dS )NrG r )r r r r rC ` s zModule.to_string)N)r r r r rC r r r r r! \ s
r! c @ s" e Zd ZdZddd�Zdd� ZdS ) r# zqA reference policy interface definition.
This class represents a reference policy interface definition.
rG Nc C s t j| |� || _d S )N)r r ru )r ru r r r r r h s zInterface.__init__c C s
d| j S )Nz[Interface name: %s])ru )r r r r rC l s zInterface.to_string)rG N)r r r rH r rC r r r r r# c s
r# c @ s e Zd Zddd�Zdd� ZdS )�
TunablePolicyNc C s t j| |� g | _d S )N)r r r� )r r r r r r p s zTunablePolicy.__init__c C s dt | jdd� S )Nz[Tunable Policy %s]rG )r^ )rG rG )r` r� )r r r r rC t s zTunablePolicy.to_string)N)r r r r rC r r r r r� o s
r� c @ s e Zd Zddd�Zdd� ZdS )r% rG Nc C s t j| |� || _d S )N)r r ru )r ru r r r r r x s zTemplate.__init__c C s
d| j S )Nz[Template name: %s])ru )r r r r rC | s zTemplate.to_string)rG N)r r r r rC r r r r r% w s
r% c @ s e Zd Zddd�Zdd� ZdS )�IfDefrG Nc C s t j| |� || _d S )N)r r ru )r ru r r r r r � s zIfDef.__init__c C s
d| j S )Nz[Ifdef name: %s])ru )r r r r rC � s zIfDef.to_string)rG N)r r r r rC r r r r r� s
r� c @ s& e Zd Zd dd�Zdd� Zdd� ZdS )
r+ rG Nc C s" t j| |� || _g | _g | _d S )N)rI r �ifname�argsZcomments)r r� r r r r r � s zInterfaceCall.__init__c C sT | j |j krdS t| j�t|j�kr(dS x&t| j|j�D ]\}}||kr8dS q8W dS )NFT)r� rK r� �zip)r rr �a�br r r �matches� s zInterfaceCall.matchesc C sd d| j }d}xL| jD ]B}t|t�r.t|�}n|}|dkrH|d| }n|| }|d7 }qW |d S )Nz%s(r z, %sr �))r� r� r rd r` )r r] rV r� rB r r r rC � s
zInterfaceCall.to_string)rG N)r r r r r� rC r r r r r+ � s
r+ c @ s e Zd Zddd�Zdd� ZdS )�OptionalPolicyNc C s t j| |� d S )N)r r )r r r r r r � s zOptionalPolicy.__init__c C s dS )Nz[Optional Policy]r )r r r r rC � s zOptionalPolicy.to_string)N)r r r r rC r r r r r� � s
r� c @ s> e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� ZdS )r' Nc C s t j| |� d | _d S )N)r r r~ )r r r r r r � s zSupportMacros.__init__c C s dS )Nz[Support Macros]r )r r r r rC � s zSupportMacros.to_stringc C sD t � }|| jkr6x.| j|�D ]}|j| j|�� q W n
|j|� |S )N)rc r~ �by_namer� �_SupportMacros__expand_permr} )r �permr] �pr r r Z
__expand_perm� s
zSupportMacros.__expand_permc C sJ i | _ x>| D ]6}t� }x |jD ]}|j| j|�� q W || j |j< q W d S )N)r~ rc rv r� r� ru )r r Z exp_permsr� r r r Z __gen_map� s
zSupportMacros.__gen_mapc C s | j s| j� | j | S )N)r~ �_SupportMacros__gen_map)r ru r r r r� � s zSupportMacros.by_namec C s | j s| j� || j kS )N)r~ r� )r ru r r r �has_key� s zSupportMacros.has_key)N) r r r r rC r� r� r� r� r r r r r' � s
r' c @ s& e Zd Zddd�Zdd� Zdd� ZdS ) r9 Nc C s6 t j| |� t� | _i | _t� | _t� | _t� | _d S )N)rI r rb r� r� r< �data�users)r r r r r r � s zRequire.__init__c C s | j j|t� �}|j|� d S )N)r� �
setdefaultrb r� )r r� rv r� r r r �
add_obj_class� s zRequire.add_obj_classc C s� g }|j d� x | jD ]}|j d| � qW x,| jj� D ] \}}|j d||j� f � q8W x | jD ]}|j d| � qbW x | jD ]}|j d| � q�W x | jD ]}|j d| � q�W |j d� t|�dkr�d S d
j |�S ) Nz require {z type %s;z
class %s %s;z role %s;z bool %s;z user %s;rY r rG rA )
rM r� r� rU rf r< r� r� rK r\ )r r] rQ r� rv r �boolri r r r rC � s
zRequire.to_string)N)r r r r r� rC r r r r r9 � s
r9 c @ s e Zd Zdd� Zdd� ZdS )�
ObjPermSetc C s || _ t� | _d S )N)ru rc rv )r ru r r r r � s zObjPermSet.__init__c C s d| j | jj� f S )Nzdefine(`%s', `%s'))ru rv rf )r r r r rC � s zObjPermSet.to_stringN)r r r r rC r r r r r� � s r� c @ s e Zd Zdd� Zdd� ZdS )�ClassMapc C s || _ || _d S )N)r� rv )r r� rv r r r r s zClassMap.__init__c C s | j d | j S )Nz: )r� rv )r r r r rC s zClassMap.to_stringN)r r r r rC r r r r r� s r� c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �CommentNc C s |r || _ ng | _ d S )N)�lines)r r_ r r r r
s zComment.__init__c C sB t | j�dkrdS g }x | jD ]}|jd| � q W dj|�S d S )Nr rG �#rA )rK r� rM r\ )r �out�liner r r rC s zComment.to_stringc C s2 t |j�r.x"|jD ]}|dkr| jj|� qW d S )NrG )rK r� rM )r rr r� r r r �merge s
z
Comment.mergec C s | j � S )N)rC )r r r r rD ! s zComment.__str__)N)r r r r rC r� rD r r r r r� s
r� )TFN)N�rX rY )r� )?�stringrn ZSRC_TYPEZTGT_TYPEZ OBJ_CLASSZPERMSZROLEZ DEST_TYPEZ field_to_strZ str_to_fieldr
r rI r rW r` ra rc rb rh rt rw r5 r7 r; r� r� r� r� r- r/ r1 r3 r= r? r) r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r! r# r� r% r� r+ r� r' r9 r� r� r� r r r r �<module> s| a
&
P
=
@:!
!&$ sepolgen/__pycache__/policygen.cpython-36.opt-1.pyc 0000644 00000031030 14751155147 0016155 0 ustar 00 3
�� f�; � @ s� d Z ddlZddlZddljZy ddlT W n Y nX ddlmZ ddlmZ ddlm Z ddlm
Z
dd lm Z dd
lm Z dZ
dZd ZG d d
� d
�Zdefdd�Zdd� ZG dd� d�Zdd� ZdS )z>
classes and algorithms for the generation of SELinux policy.
� N)�*� )� refpolicy)� objectmodel)�access)�
interfaces)�matching)�util� c @ s� e Zd ZdZd dd�Zd dd�Zd!dd �Zefd
d �Zd d
� Z dd� Z
dd� Z d"dd�Z dd� Z
dd� Zdd� Zdd � Zd d � ZdS )#�PolicyGeneratora� Generate a reference policy module from access vectors.
PolicyGenerator generates a new reference policy module
or updates an existing module based on requested access
in the form of access vectors.
It generates allow rules and optionally module require
statements, reference policy interfaces, and extended
permission access vector rules. By default only allow rules
are generated. The methods .set_gen_refpol, .set_gen_requires
and .set_gen_xperms turns on interface generation,
requires generation, and xperms rules genration respectively.
PolicyGenerator can also optionally add comments explaining
why a particular access was allowed based on the audit
messages that generated the access. The access vectors
passed in must have the .audit_msgs field set correctly
and .explain set to SHORT|LONG_EXPLANATION to enable this
feature.
The module created by PolicyGenerator can be passed to
output.ModuleWriter to output a text representation.
Nc C s> d| _ t| _d| _|r || _n
tj� | _d| _d| _d| _ dS )z�Initialize a PolicyGenerator with an optional
existing module.
If the module paramater is not None then access
will be added to the passed in module. Otherwise
a new reference policy module will be created.
NF)
�ifgen�NO_EXPLANATION�explain� gen_requires�moduler ZModule� dontaudit�xperms�domains)�selfr � r � /usr/lib/python3.6/policygen.py�__init__E s
zPolicyGenerator.__init__c C s* |rt ||�| _d| _nd| _| j� dS )a? Set whether reference policy interfaces are generated.
To turn on interface generation pass in an interface set
to use for interface generation. To turn off interface
generation pass in None.
If interface generation is enabled requires generation
will also be enabled.
TN)�InterfaceGeneratorr r �"_PolicyGenerator__set_module_style)r Zif_set� perm_mapsr r r �set_gen_refpolY s
z PolicyGenerator.set_gen_refpolTc C s
|| _ dS )a& Set whether module requires are generated.
Passing in true will turn on requires generation and
False will disable generation. If requires generation is
disabled interface generation will also be disabled and
can only be re-enabled via .set_gen_refpol.
N)r )r Zstatusr r r �set_gen_requiresk s z PolicyGenerator.set_gen_requiresc C s
|| _ dS )z)Set whether access is explained.
N)r )r r r r r �set_gen_explainu s z PolicyGenerator.set_gen_explainc C s
|| _ d S )N)r )r r r r r �set_gen_dontauditz s z!PolicyGenerator.set_gen_dontauditc C s
|| _ dS )zSSet whether extended permission access vector rules
are generated.
N)r )r r r r r �set_gen_xperms} s z PolicyGenerator.set_gen_xpermsc C s. | j r d}nd}x| jj� D ]
}||_q W d S )NTF)r r �module_declarationsr )r r �modr r r Z__set_module_style� s
z"PolicyGenerator.__set_module_style�1.0c C s\ d}x| j j� D ]}|}qW |s8tj� }| j jjd|� ||_||_| jrRd|_nd|_dS )z?Set the name of the module and optionally the version.
Nr TF) r r r ZModuleDeclaration�children�insert�name�versionr )r r% r& �mr! r r r �set_module_name� s z PolicyGenerator.set_module_namec C s | j rt | j� | jS )N)r r )r r r r �
get_module� s
zPolicyGenerator.get_modulec C sv t j|�}| jr|j|_d|_| jr>tt jt || jd���|_|j
t j krl| jd7 _|j
rl| jd7 _|j
t jkr�| jd7 _|j
t jkr�t|j�dkr�| jddjd d
� |jD �� 7 _n | jd |jd d 7 _|j
t jk�rP| jd
7 _| jd7 _| jd|jd 7 _x*|jdd� D ]}| jd| 7 _�q4W �y|j
t jk�rTd|jk�rTd|jk�s�d|jk�rT| j�s�ttdd�d d | _g }xHdd
� tt gt|jt |jt |ji�D �D ] }|| jk�r�|j |� �q�W t|�dk�r$| jd|j|jdj|�f 7 _n0t|�dk�rT| jd|j|jdj|�f 7 _W n Y nX | j j j |� dS )z Add access vector rule.
� )� verbosityz0
#!!!! This avc is allowed in the current policyzN
#!!!! This av rule may have been overridden by an extended permission av rulez:
#!!!! This avc has a dontaudit rule in the current policyr zH
#!!!! This avc can be allowed using one of the these booleans:
# %sz, c S s g | ] }|d �qS )r r )�.0�xr r r �
<listcomp>� s z1PolicyGenerator.__add_av_rule.<locals>.<listcomp>z5
#!!!! This avc can be allowed using the boolean '%s'r z�
#!!!! This avc is a constraint violation. You would need to modify the attributes of either the source or target types to allow this access.z
#Constraint rule: z
# Nz?
# Possible cause is the source %s and target %s are different.�write�dir�openZdomain)r% �typesc S s g | ] }|t �qS r )ZTCONTEXT)r, r- r r r r. � s zL
#!!!! The source type '%s' can write to a '%s' of the following type:
# %s
zM
#!!!! The source type '%s' can write to a '%s' of the following types:
# %s
)!r ZAVRuler Z DONTAUDIT� rule_type�commentr �str�Comment�explain_access�type� audit2whyZALLOWr ZBOOLEAN�len�data�joinZ
CONSTRAINTZTERULE�perms� obj_classr ZseinfoZ ATTRIBUTEZsesearchZSCONTEXT�src_typeZCLASSZPERMS�appendr r# )r �avZrule�reasonr2 �ir r r Z
__add_av_rule� sN
& . $&z PolicyGenerator.__add_av_rulec C s@ x:|j j� D ],}tj||�}| jr*|j|_| jjj |� q W dS )z5Add extended permission access vector rules.
N)
r �keysr Z AVExtRuler ZDONTAUDITXPERMr3 r r# r@ )r rA �opZextruler r r Z__add_ext_av_rules� s
z"PolicyGenerator.__add_ext_av_rulesc C s` | j r*| j j|| j�\}}| jjj|� n|}x,|D ]$}| j|� | jr4|jr4| j|� q4W dS )zJAdd the access from the access vector set to this
module.
N) r �genr r r# �extend� _PolicyGenerator__add_av_ruler �"_PolicyGenerator__add_ext_av_rules)r Zav_setZ raw_allow�ifcallsrA r r r �
add_access� s
zPolicyGenerator.add_accessc C s x|D ]}| j jj|� qW d S )N)r r# r@ )r Z
role_type_set� role_typer r r �add_role_types� s
z PolicyGenerator.add_role_types)N)NN)T)r" )�__name__�
__module__� __qualname__�__doc__r r r �SHORT_EXPLANATIONr r r r r( r) rH rI rK rM r r r r r - s
5 r c s g �� �fdd�}|t kr�x�| jD ]�}�jd|j � �jdt|j�t|j�f � �jd|jtj |j
�f � �jd|j |j |j
f � �jtjd|j d d d
d d �� q"W |� nb|�r�jd
| j| j| j| jj� f � t| j�dk�r| jd }�jd|j |j |j
f � |� �S )a� Explain why a policy statement was generated.
Return a string containing a text explanation of
why a policy statement was generated. The string is
commented and wrapped and can be directly inserted
into a policy.
Params:
av - access vector representing the access. Should
have .audit_msgs set appropriately.
verbosity - the amount of explanation provided. Should
be set to NO_EXPLANATION, SHORT_EXPLANATION, or
LONG_EXPLANATION.
Returns:
list of strings - strings explaining the access or an empty
string if verbosity=NO_EXPLANATION or there is not sufficient
information to provide an explanation.
c sN � sd S �j d� x6� j� D ]*} t| j� j�}�j d|j� | jf � q W d S )Nz Interface options:z %s # [%d])r@ �all�call_interface� interfacerA Z to_stringZdist)�match�ifcall)�ml�sr r �explain_interfaces s
z*explain_access.<locals>.explain_interfacesz %sz scontext="%s" tcontext="%s"z class="%s" perms="%s"z comm="%s" exe="%s" path="%s"z message="�"�P z z )Zinitial_indentZsubsequent_indentz) src="%s" tgt="%s" class="%s", perms="%s"r z comm="%s" exe="%s" path="%s")�LONG_EXPLANATIONZ
audit_msgsr@ �headerr5 ZscontextZtcontextZtclassr Zlist_to_space_strZaccessesZcommZexe�pathrG �textwrapZwrap�messager? �tgt_typer> r= Z to_space_strr: )rA rX r+ rZ �msgr )rX rY r r7 � s*
r7 c C s� g }g }|j | jj� � |jdd� dd� tj� }| j|_x�tt |��D ]r}|| j
tj krl|j j
|j� qH|| j
tjkr�|j j
|j� qH|| j
tjkr�|j j
|j� qHt|| j
� qHW |S )Nc S s | j S )N)�num)�paramr r r �<lambda>9 s z call_interface.<locals>.<lambda>T)�key�reverse)rG �params�values�sortr Z
InterfaceCallr% Zifname�ranger: r8 �SRC_TYPE�argsr@ r? �TGT_TYPErb � OBJ_CLASSr> �print)rU rA ri rn rW rC r r r rT 4 s rT c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) r Nc C s& || _ | j|� tj|�| _g | _d S )N)�ifs�hack_check_ifsr Z
AccessMatcher�matcher�calls)r rr r r r r r N s
zInterfaceGenerator.__init__c C s� x�|j j� D ]|}g }|j|jj� � |jdd� dd� xPtt|��D ]@}|d || jkrbd|_P || j t
j t
j t
j
gkrDd|_P qDW q W d S )Nc S s | j S )N)rd )re r r r rf \ s z3InterfaceGenerator.hack_check_ifs.<locals>.<lambda>T)rg rh r F)r rj rG ri rk rl r: rd Zenabledr8 r rm ro rp )r rr r- ri rC r r r rs T s
z!InterfaceGenerator.hack_check_ifsc C s� | j |�}g }xH| jD ]>}t|j� j|j�}|rFtjt|j||��|_ |j
||f� qW g }xX|D ]P\}}d} x4|D ],}
|
j |�rt|
j r�|j r�|
j j |j � d} qtW | sb|j
|� qbW ||fS )NFT)
rV ru rT ZbestrU rA r r6 r7 r4 r@ Zmatches�merge) r �avsr+ �raw_avrJ rX rW �drr �foundZo_ifcallr r r rF k s$
zInterfaceGenerator.genc C sP g }xF|D ]>}t j� }| jj| j||� t|�r>| jj|� q
|j|� q
W |S )N)r Z MatchListrt Z
search_ifsrr r: ru r@ )r rw rx rA Zansr r r rV � s
zInterfaceGenerator.match)N)rN rO rP r rs rF rV r r r r r M s
r c C s& dd� }x| j � D ] }||� qW dS )z*Add require statements to the module.
c S s� t j� }xJ| j� D ]>}|jj|j� |jj|j� x |jD ]}|j||j � q:W qW x,| j
� D ] }x|j D ]}|jj |� qjW q^W x,| j
� D ] }|jj |j� |jj|j� q�W |jjd� | jjd|� d S )Nr r )r ZRequireZavrulesr2 �updateZ src_typesZ tgt_typesZ obj_classesZ
add_obj_classr= Zinterface_callsrn �addZ
role_typesZrolesZrole�discardr# r$ )�node�rZavrule�objrW �argrL r r r �collect_requires� s z&gen_requires.<locals>.collect_requiresN)Znodes)r r� r~ r r r r � s r )rQ � itertoolsr` Zselinux.audit2whyr9 Zsetoolsr* r r r r r r r
rR r] r r7 rT r r r r r r �<module> s,
Q7B sepolgen/__pycache__/refparser.cpython-36.pyc 0000644 00000070600 14751155147 0015224 0 ustar 00 3
�� f�x � I @ s� d dl Z d dlZd dlZd dlZddlmZ ddlmZ ddlmZ ddlmZ ddlm Z �dZ
d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdOdNdPdQ�4Z dRZ dSZ
dTZdUZdVZdWZdXZdYZdZZd[Zd\Zd]Zd^Zd_Zd`ZdaZdbZ dcZ ddZ dedf� Z dgdh� Z didj� Z!dkdl� Z"dmdn� Z#dodp� Z$dqdr� Z%dsdt� Z&dudv� Z'da(da)dwa*da+dxa,�d dydz�Z-d{d|� Z.d}d~� Z/dd�� Z0d�d�� Z1d�d�� Z2d�d�� Z3d�d�� Z4d�d�� Z5d�d�� Z6d�d�� Z7d�d�� Z8d�d�� Z9d�d�� Z:d�d�� Z;d�d�� Z<d�d�� Z=d�d�� Z>d�d�� Z?d�d�� Z@d�d�� ZAd�d�� ZBd�d�� ZCd�d�� ZDd�d�� ZEd�d�� ZFd�d�� ZGd�d�� ZHd�d�� ZId�d�� ZJd�d�� ZKd�d�� ZLd�d�� ZMd�d�� ZNd�d�� ZOd�d�� ZPd�d ZQd�dĄ ZRd�dƄ ZSd�dȄ ZTd�dʄ ZUd�d̄ ZVd�d΄ ZWd�dЄ ZXd�d҄ ZYd�dԄ ZZd�dք Z[d�d Z\d�dڄ Z]d�d܄ Z^d�dބ Z_d�d� Z`d�d� Zad�d� Zbd�d� Zcd�d� Zdd�d� Zed�d� Zfd�d� Zgd�d� Zhd�d� Zid�d� Zjd�d�� Zkd�d�� Zld�d�� Zmd�d�� Znd�d�� Zodapdaqd��d � Zr�d
�d�d�Zs�d�d� Zt�d �d�d�ZudS ( � N� )�access)�defaults)�lex)� refpolicy)�yacc�TICK�SQUOTE�OBRACE�CBRACE�SEMI�COLON�OPAREN�CPAREN�COMMA�MINUS�TILDE�ASTERISK�AMP�BAR�EXPL�EQUAL�FILENAME�
IDENTIFIER�NUMBER�PATH� IPV6_ADDR�MODULE�
POLICY_MODULE�REQUIRE�SID�GENFSCON� FS_USE_XATTR� FS_USE_TRANS� FS_USE_TASK�PORTCON�NODECON�NETIFCON�PIRQCON�IOMEMCON� IOPORTCON� PCIDEVICECON�
DEVICETREECON�CLASS�
TYPEATTRIBUTE�
ROLEATTRIBUTE�TYPE� ATTRIBUTE�ATTRIBUTE_ROLE�ALIAS� TYPEALIAS�BOOL�TRUE�FALSE�IF�ELSE�ROLE�TYPES�ALLOW� DONTAUDIT�
AUDITALLOW�
NEVERALLOW�
PERMISSIVE�
TYPEBOUNDS�TYPE_TRANSITION� TYPE_CHANGE� TYPE_MEMBER�RANGE_TRANSITION�ROLE_TRANSITION�
OPT_POLICY� INTERFACE�TUNABLE_POLICY�GEN_REQ�TEMPLATE� GEN_CONTEXT�IFELSE�IFDEF�IFNDEF�DEFINE)4�moduleZ
policy_moduleZrequireZsidZgenfscon� fs_use_xattr� fs_use_trans� fs_use_taskZportconZnodeconZnetifconZpirqconZiomemconZ ioportconZ pcideviceconZ
devicetreecon�classZ
typeattributeZ
roleattribute�typeZ attributeZattribute_role�aliasZ typealias�bool�trueZfalse�if�else�role�typesZallow� dontaudit�
auditallow�
neverallowZ
permissiveZ
typeboundsZtype_transition� type_change� type_memberZrange_transitionZrole_transitionZoptional_policy� interfaceZtunable_policyZ gen_require�templateZ gen_contextZifelseZifndef�ifdefZdefinez\`z\'z\{z\}z\;+z\:z\(z\)z\,z\-z\~z\*z\&z\|z\!z\=z[0-9\.]+z/[a-zA-Z0-9)_\.\*/\$]*z c C s | S )z2[a-fA-F0-9]{0,4}:[a-fA-F0-9]{0,4}:([a-fA-F0-9]|:)*� )�trf rf � /usr/lib/python3.6/refparser.py� t_IPV6_ADDR� s ri c C s | j jd7 _dS )zdnl.*\nr N)�lexer�lineno)rg rf rf rh � t_m4comment� s rl c C s | j d� dS )zdefine.*refpolicywarn\(.*\nr N)�skip)rg rf rf rh �t_refpolicywarn1� s rn c C s | j jd7 _dS )zrefpolicywarn\(.*\nr N)rj rk )rg rf rf rh �t_refpolicywarn� s ro c C s t j| jd�| _| S )z#[a-zA-Z_\$][a-zA-Z0-9_\-\+\.\$\*~]*r )�reserved�get�valuerV )rg rf rf rh � t_IDENTIFIER� s rs c C s t j| jd�| _| S )z \"[a-zA-Z0-9_\-\+\.\$\*~ :]+\"r )rp rq rr rV )rg rf rf rh �
t_FILENAME s rt c C s | j jd7 _dS )z\#.*\nr N)rj rk )rg rf rf rh � t_comment s ru c C s t d| jd � | jd� d S )NzIllegal character '%s'r r )�printrr rm )rg rf rf rh �t_error s rw c C s | j jt| j�7 _dS )z\n+N)rj rk �lenrr )rg rf rf rh � t_newline s ry � Tc C sX | d kr d S xF| D ]>}|d kr q||_ |d k rB|jjd||f� q|jjd|� qW d S )Nr )�parent�children�insert)Zstmtsr{ �val�srf rf rh �collect- s
r� c C s8 x2| D ]*}t j|�r&|jt j|�� q|j|� qW d S )N)�sptZhas_key�updateZby_name�add)Zidsr �idrf rf rh �expand9 s
r� c C sN t | �dkr&| d r&tjj| d � n$t | �dkrJ| d rJtjj| d � dS )z^statements : statement
| statements statement
| empty
� r N)rx �mr| �append)�prf rf rh � p_statementsA s r� c C s | d | d< dS )z�statement : interface
| template
| obj_perm_set
| policy
| policy_module_stmt
| module_stmt
r r Nrf )r� rf rf rh � p_statementK s r� c C s dS )zempty :Nrf )r� rf rf rh �p_emptyU s r� c C s. t j� }| d |_| d |_d|_ || d< dS )zHpolicy_module_stmt : POLICY_MODULE OPAREN IDENTIFIER COMMA NUMBER CPAREN� � Tr N)r �ModuleDeclaration�name�version)r� r� rf rf rh �p_policy_module_stmt` s
r� c C s( t j| d �}t| d |� || d< dS )zainterface : INTERFACE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
� � r N)r � Interfacer� )r� �xrf rf rh � p_interfaceh s r� c C s( t j| d �}t| d |� || d< dS )z�template : TEMPLATE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
| DEFINE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
r� r� r N)r ZTemplater� )r� r� rf rf rh �
p_templateo s r� c C s d| d< dS )z4define : DEFINE OPAREN TICK IDENTIFIER SQUOTE CPARENNr rf )r� rf rf rh �p_definew s r� c C sz t | �dkr"| d r"| d | d< nTt | �dkrv| d sL| d rv| d | d< n*| d sb| d | d< n| d | d | d< dS )zlinterface_stmts : policy
| interface_stmts policy
| empty
r� r r N)rx )r� rf rf rh �p_interface_stmts~ s r� c C sF t j� }t| d |dd� t| �dkr8t| d |dd� |g| d< dS ) z�optional_policy : OPT_POLICY OPAREN TICK interface_stmts SQUOTE CPAREN
| OPT_POLICY OPAREN TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
r� T)r~ � r� Fr N)r ZOptionalPolicyr� rx )r� �orf rf rh �p_optional_policy� s
r� c C sP t j� }| d |_t| d |dd� t| �dkrBt| d |dd� |g| d< d S )
z�tunable_policy : TUNABLE_POLICY OPAREN TICK cond_expr SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
| TUNABLE_POLICY OPAREN TICK cond_expr SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
r� r� T)r~ � � Fr N)r Z
TunablePolicy� cond_exprr� rx )r� r� rf rf rh �p_tunable_policy� s
r� c C s dS )a� ifelse : IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA COMMA TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
| IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
| IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
Nrf )r� rf rf rh �p_ifelse� s r� c C sb t j| d �}| d dkr d}nd}t| d ||d� t| �dkrTt| d |dd� |g| d < d
S ) aJ ifdef : IFDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
| IFNDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
| IFDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
r� r re TFr� )r~ r� r N)r ZIfDefr� rx )r� r� �vrf rf rh �p_ifdef� s r� c C s8 t j| d d�}t| �dkr,|jj| d � || d< dS )z�interface_call : IDENTIFIER OPAREN interface_call_param_list CPAREN
| IDENTIFIER OPAREN CPAREN
| IDENTIFIER OPAREN interface_call_param_list CPAREN SEMIr )Zifnamer� r� r N)r Z
InterfaceCallrx �args�extend)r� �irf rf rh �p_interface_call� s r� c C s6 t | �dkr| d | d< n| d d| d g| d< dS )z�interface_call_param : IDENTIFIER
| IDENTIFIER MINUS IDENTIFIER
| nested_id_set
| TRUE
| FALSE
| FILENAME
r� r r �-r� N)rx )r� rf rf rh �p_interface_call_param� s
r� c C s6 t | �dkr | d g| d< n| d | d g | d< dS )z�interface_call_param_list : interface_call_param
| interface_call_param_list COMMA interface_call_param
r� r r r� N)rx )r� rf rf rh �p_interface_call_param_list� s r� c C s$ t j| d �}| d |_|| d< dS )zRobj_perm_set : DEFINE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK names SQUOTE CPARENr� r� r N)r Z
ObjPermSet�perms)r� r rf rf rh �p_obj_perm_set� s
r� c C s | d | d< dS )z�policy : policy_stmt
| optional_policy
| tunable_policy
| ifdef
| ifelse
| conditional
r r Nrf )r� rf rf rh �p_policy� s r� c C s | d r| d g| d< dS )a� policy_stmt : gen_require
| avrule_def
| typerule_def
| typebound_def
| typeattribute_def
| roleattribute_def
| interface_call
| role_def
| role_allow
| permissive
| type_def
| typealias_def
| attribute_def
| attribute_role_def
| range_transition_def
| role_transition_def
| bool
| define
| initial_sid
| genfscon
| fs_use
| portcon
| nodecon
| netifcon
| pirqcon
| iomemcon
| ioportcon
| pcidevicecon
| devicetreecon
r r Nrf )r� rf rf rh �
p_policy_stmt� s r� c C s. t j� }| d |_| d |_d|_ || d< dS )z+module_stmt : MODULE IDENTIFIER NUMBER SEMIr� r� Fr N)r r� r� r� )r� r� rf rf rh �
p_module_stmt s
r� c C s dS )zlgen_require : GEN_REQ OPAREN TICK requires SQUOTE CPAREN
| REQUIRE OBRACE requires CBRACENrf )r� rf rf rh �
p_gen_require! s r� c C s dS )zsrequires : require
| requires require
| ifdef
| requires ifdef
Nrf )r� rf rf rh �
p_requires) s r� c C s dS )z�require : TYPE comma_list SEMI
| ROLE comma_list SEMI
| ATTRIBUTE comma_list SEMI
| ATTRIBUTE_ROLE comma_list SEMI
| CLASS comma_list SEMI
| BOOL comma_list SEMI
Nrf )r� rf rf rh � p_require1 s r� c C sH t j� }| d |_| d |_| d |_t| �dkr<| d |_|| d< dS )z�security_context : IDENTIFIER COLON IDENTIFIER COLON IDENTIFIER
| IDENTIFIER COLON IDENTIFIER COLON IDENTIFIER COLON mls_range_defr r� r� � r� r N)r ZSecurityContext�userr\ rV rx �level)r� r rf rf rh �p_security_context; s
r� c C s | d }| d |_ || d< dS )zQgen_context : GEN_CONTEXT OPAREN security_context COMMA mls_range_def CPAREN
r� r� r N)r� )r� r rf rf rh �
p_gen_contextH s
r� c C s | d | d< dS )z<context : security_context
| gen_context
r r Nrf )r� rf rf rh � p_contextS s r� c C s( t j� }| d |_| d |_|| d< dS )z$initial_sid : SID IDENTIFIER contextr� r� r N)r Z
InitialSidr� �context)r� r rf rf rh �
p_initial_sidY s
r� c C s2 t j� }| d |_| d |_| d |_|| d< dS )z+genfscon : GENFSCON IDENTIFIER PATH contextr� r� r� r N)r ZGenfsCon�
filesystem�pathr� )r� �grf rf rh �
p_genfscon` s
r� c C sn t j� }| d dkr t jj|_n.| d dkr8t jj|_n| d dkrNt jj|_| d |_| d |_|| d< dS ) z�fs_use : FS_USE_XATTR IDENTIFIER context SEMI
| FS_USE_TASK IDENTIFIER context SEMI
| FS_USE_TRANS IDENTIFIER context SEMI
r rR rT rS r� r� r N)r Z
FilesystemUseZXATTRrV ZTASKZTRANSr� r� )r� �frf rf rh �p_fs_usej s
r� c C s` t j� }| d |_t| �dkr4| d |_| d |_n | d d | d |_| d |_|| d< dS )zkportcon : PORTCON IDENTIFIER NUMBER context
| PORTCON IDENTIFIER NUMBER MINUS NUMBER contextr� r� r� r� r� r N)r ZPortConZ port_typerx Z port_numberr� )r� �crf rf rh � p_portcon| s
r� c C s2 t j� }| d |_| d |_| d |_|| d< dS )zanodecon : NODECON NUMBER NUMBER context
| NODECON IPV6_ADDR IPV6_ADDR context
r� r� r� r N)r ZNodeCon�start�endr� )r� �nrf rf rh � p_nodecon� s
r� c C s2 t j� }| d |_| d |_| d |_|| d< dS )z.netifcon : NETIFCON IDENTIFIER context contextr� r� r� r N)r ZNetifConrc Zinterface_contextZpacket_context)r� r� rf rf rh �
p_netifcon� s
r� c C s( t j� }| d |_| d |_|| d< dS )z pirqcon : PIRQCON NUMBER contextr� r� r N)r ZPirqConZ pirq_numberr� )r� r� rf rf rh � p_pirqcon� s
r� c C sV t j� }t| �dkr*| d |_| d |_n | d d | d |_| d |_|| d< dS )zYiomemcon : IOMEMCON NUMBER context
| IOMEMCON NUMBER MINUS NUMBER contextr� r� r� r� r N)r ZIomemConrx Z
device_memr� )r� r� rf rf rh �
p_iomemcon� s
r� c C sV t j� }t| �dkr*| d |_| d |_n | d d | d |_| d |_|| d< dS )z\ioportcon : IOPORTCON NUMBER context
| IOPORTCON NUMBER MINUS NUMBER contextr� r� r� r� r N)r Z IoportConrx Zioportr� )r� r� rf rf rh � p_ioportcon� s
r� c C s( t j� }| d |_| d |_|| d< dS )z*pcidevicecon : PCIDEVICECON NUMBER contextr� r� r N)r Z PciDeviceConZdevicer� )r� r� rf rf rh �p_pcidevicecon� s
r� c C s( t j� }| d |_| d |_|| d< dS )z,devicetreecon : DEVICETREECON NUMBER contextr� r� r N)r Z
DevicetTeeConr� r� )r� r� rf rf rh �p_devicetreecon� s
r� c C s4 | d | d< t | �dkr0| d d | d | d< dS )z[mls_range_def : mls_level_def MINUS mls_level_def
| mls_level_def
r r r� r� r� N)rx )r� rf rf rh �p_mls_range_def� s r� c C s: | d | d< t | �dkr6| d d dj| d � | d< dS )zRmls_level_def : IDENTIFIER COLON comma_list
| IDENTIFIER
r r r� �:�,r� N)rx �join)r� rf rf rh �p_mls_level_def� s r� c C s� t j| d �}t| �dkrD| d dkr8|jj| d � qv| d |_n2t| �dkrv| d |_t| �dkrv|jj| d � || d< dS ) z�type_def : TYPE IDENTIFIER COMMA comma_list SEMI
| TYPE IDENTIFIER SEMI
| TYPE IDENTIFIER ALIAS names SEMI
| TYPE IDENTIFIER ALIAS names COMMA comma_list SEMI
r� r� r� r� r� r� r N)r ZTyperx �
attributesr� �aliases)r� rg rf rf rh �
p_type_def� s
r� c C s t j| d �}|| d< dS )z)attribute_def : ATTRIBUTE IDENTIFIER SEMIr� r N)r Z Attribute)r� �arf rf rh �p_attribute_def� s r� c C s t j| d �}|| d< dS )z3attribute_role_def : ATTRIBUTE_ROLE IDENTIFIER SEMIr� r N)r ZAttribute_Role)r� r� rf rf rh �p_attribute_role_def� s r� c C s( t j� }| d |_| d |_|| d< dS )z5typealias_def : TYPEALIAS IDENTIFIER ALIAS names SEMIr� r� r N)r Z TypeAliasrV r� )r� rg rf rf rh �p_typealias_def� s
r� c C s: t j� }| d |_t| �dkr.|jj| d � || d< dS )zWrole_def : ROLE IDENTIFIER TYPES comma_list SEMI
| ROLE IDENTIFIER SEMIr� r� r N)r ZRoler\ rx r] r� )r� �rrf rf rh �
p_role_def s
r� c C s( t j� }| d |_| d |_|| d< dS )z#role_allow : ALLOW names names SEMIr� r� r N)r Z RoleAllowZ src_rolesZ tgt_roles)r� r� rf rf rh � p_role_allow s
r� c C s dS )z"permissive : PERMISSIVE names SEMINrf )r� rf rf rh � p_permissive s r� c C s� t j� }| d dkr t jj|_n.| d dkr8t jj|_n| d dkrNt jj|_| d |_| d |_| d |_| d |_ || d < d
S ) z�avrule_def : ALLOW names names COLON names names SEMI
| DONTAUDIT names names COLON names names SEMI
| AUDITALLOW names names COLON names names SEMI
| NEVERALLOW names names COLON names names SEMI
r r^ r_ r` r� r� r� r� r N)
r �AVRuler= � rule_typer> r? � src_types� tgt_types� obj_classesr� )r� r� rf rf rh � p_avrule_def s
r� c C st t j� }| d dkr t jj|_n| d dkr6t jj|_| d |_| d |_| d |_| d |_| d |_ || d < d
S ) a� typerule_def : TYPE_TRANSITION names names COLON names IDENTIFIER SEMI
| TYPE_TRANSITION names names COLON names IDENTIFIER FILENAME SEMI
| TYPE_TRANSITION names names COLON names IDENTIFIER IDENTIFIER SEMI
| TYPE_CHANGE names names COLON names IDENTIFIER SEMI
| TYPE_MEMBER names names COLON names IDENTIFIER SEMI
r ra rb r� r� r� r� r� r N)
r ZTypeRulerC r� rD r� r� r� Z dest_type� file_name)r� rg rf rf rh �p_typerule_def* s
r� c C s. t j� }| d |_|jj| d � || d< dS )z5typebound_def : TYPEBOUNDS IDENTIFIER comma_list SEMIr� r� r N)r Z TypeBoundrV r� r� )r� rg rf rf rh �p_typebound_def= s
r� c C s8 t j� }| d |_| d dkr&d|_nd|_|| d< dS )zIbool : BOOL IDENTIFIER TRUE SEMI
| BOOL IDENTIFIER FALSE SEMIr� r� rY TFr N)r ZBoolr� �state)r� �brf rf rh �p_boolD s
r� c C sP t j� }| d |_t| d |dd� t| �dkrBt| d |dd� |g| d< d S )
z� conditional : IF OPAREN cond_expr CPAREN OBRACE interface_stmts CBRACE
| IF OPAREN cond_expr CPAREN OBRACE interface_stmts CBRACE ELSE OBRACE interface_stmts CBRACE
r� r� T)r~ r� �
Fr N)r Z Conditionalr� r� rx )r� r� rf rf rh �
p_conditionalO s
r� c C s. t j� }| d |_|jj| d � || d< dS )z<typeattribute_def : TYPEATTRIBUTE IDENTIFIER comma_list SEMIr� r� r N)r Z
TypeAttributerV r� r� )r� rg rf rf rh �p_typeattribute_defZ s
r� c C s. t j� }| d |_|jj| d � || d< dS )z<roleattribute_def : ROLEATTRIBUTE IDENTIFIER comma_list SEMIr� r� r N)r Z
RoleAttributer\ Zroleattributesr� )r� rg rf rf rh �p_roleattribute_defa s
r� c C s dS )z�range_transition_def : RANGE_TRANSITION names names COLON names mls_range_def SEMI
| RANGE_TRANSITION names names names SEMINrf )r� rf rf rh �p_range_transition_defh s r� c C s dS )z<role_transition_def : ROLE_TRANSITION names names names SEMINrf )r� rf rf rh �p_role_transition_defm s r� c C sj t | �}|dkr | d g| d< nF|dkr@| d g| d | d< n&| d | d | d g | d | d< dS )a cond_expr : IDENTIFIER
| EXPL cond_expr
| cond_expr AMP AMP cond_expr
| cond_expr BAR BAR cond_expr
| cond_expr EQUAL EQUAL cond_expr
| cond_expr EXPL EQUAL cond_expr
r� r r r� r� N)rx )r� �lrf rf rh � p_cond_exprq s r� c C sr t j� }t| �dk r$t| d |� nBt| �dkrFt| d |� d|_n t| d g� |jd| d � || d< dS )z�names : identifier
| nested_id_set
| asterisk
| TILDE identifier
| TILDE nested_id_set
| IDENTIFIER MINUS IDENTIFIER
r� r r� Tr� r N)r ZIdSetrx r� Z
complimentr� )r� r rf rf rh �p_names� s r� c C s | d g| d< dS )zidentifier : IDENTIFIERr r Nrf )r� rf rf rh � p_identifier� s r� c C s | d g| d< dS )zasterisk : ASTERISKr r Nrf )r� rf rf rh �
p_asterisk� s r� c C s | d | d< dS )z1nested_id_set : OBRACE nested_id_list CBRACE
r� r Nrf )r� rf rf rh �p_nested_id_set� s r� c C s2 t | �dkr| d | d< n| d | d | d< dS )z`nested_id_list : nested_id_element
| nested_id_list nested_id_element
r� r r N)rx )r� rf rf rh �p_nested_id_list� s r� c C s4 t | �dkr| d | d< nd| d }|g| d< dS )zxnested_id_element : identifier
| MINUS IDENTIFIER
| nested_id_set
r� r r r� N)rx )r� �strrf rf rh �p_nested_id_element� s r� c C s0 t | �dkr | d | d | d< | d | d< dS )zTcomma_list : nested_id_list
| comma_list COMMA nested_id_list
r� r r� r N)rx )r� rf rf rh � p_comma_list� s r� c C s dS )z/optional_semi : SEMI
| emptyNrf )r� rf rf rh �p_optional_semi� s r� c C s& dt | j| j| jf att� dad S )Nz(%s: Syntax error on line %d %s [type=%s]F)�
parse_filerk rr rV �errorrv �success)�tokrf rf rh �p_error� s r� c C s( | si S i }x| D ]}|||j < qW d S )N)r� )r� �mapr� rf rf rh �prep_spt� s
r c C sH t s tj� atjd|dd�a | d k r*| antj� a|s@tj� an|ad S )NZLALRr )�method�debugZ write_tables) �parserr rj r r� r �Module�
SupportMacrosr� )rQ �supportr rf rf rh �create_globals� s
r Fc C s� t |||� dt_daytj| |td� W nB tk
rl } z&d ad adt|� d tj � a
W Y d d }~X nX ts�d adt
}t |��t S )Nr T)r rj zinternal parser error: %s�
zcould not parse text: "%s")
r rj rk r� r �parse� Exceptionr� � traceback�
format_excr� �
ValueErrorr� )�textrQ r r �e�msgrf rf rh r
� s *r
c C s� g }d }x�t j| �D ]�\}}}x�|D ]~}t jj|�}t jj||�}|d dkr�|dkr\|}q�ttjd|d ��r�|j|d |f� q$|d dkr$|j|d |f� q$W qW ||fS )Nr z.sptzobj_perm_sets.sptZpatternsr z.if) �os�walkr� �splitextr� rx �re�findallr� ) �root�modules�support_macros�dirpathZdirnames� filenamesr� �modname�filenamerf rf rh � list_headers
s
r c s> ddl m} tj� }g }d }tjj| �r|tjj| �d }|dkrLtd| ��tjj |�} |j
| d | f� t t j
� �\}
}n t | �\}}|r�| r�td���fdd��d � �fd d
� } d } |�r8�d | � tj� } | || � |jj
| � tjd �}
tjd
dddddddddg
�}|
jj
tj|�� |jj
|
� �d� ��rd� �rd|jtjt|�d�}|jd� g }x�|D ]�}tj� }|d |_y*|�r�| |d || � n| |d |� W nF tk
�r� } z(�t|�d � |j
|d � �wnW Y d d }~X nX |jj
|� ��rn� �rn|j � �qnW t|��r:�dd j |� � |S ) Nr )�utilrz zInvalid file name %sr z1could not find support macros (obj_perm_sets.spt)c s � r� j | � d S )N)�write)r )�outputrf rh r� 3 s zparse_headers.<locals>.oc s� � r�d| � y.t | �}|j� }|j� | at|||� � W nT tk
r^ } zd S d }~X n6 tk
r� } ztd| t|�f ��W Y d d }~X nX d S )Nzparsing file %s
zerror parsing file %s: %s)�open�read�closer� r
�IOErrorr r� )r� rQ r� �fdZtxtr )r r� rf rh r� 7 s z!parse_headers.<locals>.parse_filez Parsing support macros (%s): �can_execz$1z$2�fileZexecute_no_transr" r# �getattr�lockZexecuteZioctlzdone.
)ZstepszParsing interface filesr z failed to parse some headers: %sz, )N) rz r r ZHeadersr r� �isfile�splitr r r� r r �headersr r| r� r Z AccessVectorr� ZConsoleProgressBar�sys�stdoutrx r� r r� r� �stepr� )r r! r� r r r- r r r� r Z all_modulesr� r� r' �avZstatusZfailuresr� r� r rf )r r� r! rh �
parse_headers sb
r2 )Ir r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP )N)NNF)NTF)vr. r r r rz r r r r r �tokensrp Zt_TICKZt_SQUOTEZt_OBRACEZt_CBRACEZt_SEMIZt_COLONZt_OPARENZt_CPARENZt_COMMAZt_MINUSZt_TILDEZ
t_ASTERISKZt_AMPZt_BARZt_EXPLZt_EQUALZt_NUMBERZt_PATHZt_ignoreri rl rn ro rs rt ru rw ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r rj r r
r r2 rf rf rf rh �<module> s�
"
sepolgen/__pycache__/interfaces.cpython-36.opt-1.pyc 0000644 00000030375 14751155147 0016322 0 ustar 00 3
�� fQ@ � @ s� d Z ddlZddlZddlmZ ddlmZ ddlmZ ddlmZ ddlm Z G d d
� d
�Z
d d � Z d
d� Z dd� Z
dd� Zdd� ZG dd� d�ZG dd� d�ZG dd� d�ZG dd � d �ZdS ) z7
Classes for representing and manipulating interfaces.
� N� )�access)� refpolicy)� objectmodel)�matching)�_c @ sH e Zd ZdZdd� Zdd� Zdd� Zeee�Zedd � d
�Z d d � Z
d
S )�Paramz;
Object representing a paramater for an interface.
c C s" d| _ tj| _tj� | _d| _d S )N� T)� _Param__namer �SRC_TYPE�type�IdSet� obj_classesZrequired)�self� r � /usr/lib/python3.6/interfaces.py�__init__& s
zParam.__init__c C s t j|�std| ��|| _d S )NzName [%s] is not a param)r �
is_idparam�
ValueErrorr
)r �namer r r �set_name, s
zParam.set_namec C s | j S )N)r
)r r r r �get_name1 s zParam.get_namec C s t | jdd � �S )Nr )�intr )r r r r �<lambda>6 s zParam.<lambda>)�fgetc C s d| j tj| j dj| j�f S )Nz0<sepolgen.policygen.Param instance [%s, %s, %s]>� )r r � field_to_strr �joinr )r r r r �__repr__8 s zParam.__repr__N) �__name__�
__module__� __qualname__�__doc__r r r �propertyr �numr r r r r r " s
r c C s� d}| |kr�|| }||j kr"d S |tjks6|tjkr�|j tjksN|j tjkr�d}|r`|jg}ng }x&tj|j|�D ]}|tj krtd}P qtW tj|_ q�d}n t
� }| |_ ||_ |||j < |r�|jj |j� |S )Nr r )
r r r �TGT_TYPE� obj_class� itertools�chainr r Zimplicitly_typed_objectsr r �add)r r �av�params�ret�pZavobjs�objr r r �__param_insert> s0
r/ c C s~ d}d}t j| j�r.t| jtj| |�dkr.d}t j| j�rTt| jtj| |�dkrTd}t j| j�rzt| jtj | |�dkrzd}|S )aj Extract the paramaters from an access vector.
Extract the paramaters (in the form $N) from an access
vector, storing them as Param objects in a dictionary.
Some attempt is made at resolving conflicts with other
entries in the dict, but if an unresolvable conflict is
found it is reported to the caller.
The goal here is to figure out how interface parameters are
actually used in the interface - e.g., that $1 is a domain used as
a SRC_TYPE. In general an interface will look like this:
interface(`foo', `
allow $1 foo : file read;
')
This is simple to figure out - $1 is a SRC_TYPE. A few interfaces
are more complex, for example:
interface(`foo_trans',`
domain_auto_trans($1,fingerd_exec_t,fingerd_t)
allow $1 fingerd_t:fd use;
allow fingerd_t $1:fd use;
allow fingerd_t $1:fifo_file rw_file_perms;
allow fingerd_t $1:process sigchld;
')
Here the usage seems ambigious, but it is not. $1 is still domain
and therefore should be returned as a SRC_TYPE.
Returns:
0 - success
1 - conflict found
r Fr )
r r �src_typer/ r r �tgt_typer% r& � OBJ_CLASS)r* r+ r, Z found_srcr r r �av_extract_paramsj s $ r3 c C s" t j| j�r t| jtjd |�S d S )N)r r �roler/ r ZROLE)r4 r+ r r r �role_extract_params� s r5 c sl � fdd�}d}|| j tj�r"d}|| jtj�r4d}|| jtj�rFd}tj| j �rht
| j tj d � �rhd}|S )Nc s2 d}x(| D ] }t j|�r
t||d � �r
d}q
W |S )Nr r )r r r/ )�setr r, �x)r+ r r �extract_from_set� s
z2type_rule_extract_params.<locals>.extract_from_setr r ) � src_typesr r � tgt_typesr% r r2 r r Z dest_typer/ Z DEST_TYPE)�ruler+ r8 r, r )r+ r �type_rule_extract_params� s r< c C s6 d}x,| j D ]"}tj|�r t|tjd |�r d}q W |S )Nr r )�argsr r r/ r r )�ifcallr+ r, �argr r r �ifcall_extract_params� s
r@ c @ s e Zd Zdd� Zdd� ZdS )�AttributeVectorc C s d| _ tj� | _d S )Nr )r r �AccessVectorSet)r r r r r � s zAttributeVector.__init__c C s | j j|� d S )N)r �add_av)r r* r r r rC � s zAttributeVector.add_avN)r r r! r rC r r r r rA � s rA c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )� AttributeSetc C s
i | _ d S )N)�
attributes)r r r r r � s zAttributeSet.__init__c C s || j |j< d S )N)rE r )r �attrr r r �add_attr� s zAttributeSet.add_attrc C s~ dd� }d }x^|D ]V}|d d� }|d dkrF|r<| j |� ||�}q|r|jd�}tj|�}|j|� qW |rz| j |� d S )Nc S sH | dd� j � }t|�dks(|d dkr4td| ��t� }|d |_|S )Nr � r Z Attributez#Syntax error Attribute statement %s���)�split�len� SyntaxErrorrA r )�line�fields�ar r r �
parse_attr� s
z*AttributeSet.from_file.<locals>.parse_attrr r �[�,rI )rG rJ r � AccessVectorrC )r �fdrP rO rM �lr* r r r � from_file� s
zAttributeSet.from_fileN)r r r! r rG rV r r r r rD � s rD c @ sF e Zd Zdi fdd�Zi fdd�Zdd� Zdd � Zd
d � Zd d
� ZdS )�InterfaceVectorNc C s6 d| _ d| _tj� | _i | _|r,| j||� d| _d S )NTr F)�enabledr r rB r+ �from_interface�expanded)r � interfacerE r r r r � s
zInterfaceVector.__init__c
C sF |j | _ xN|j� D ]B}|jtjjkr&qd|j kr2qtj|�}x|D ]}| j|� qBW qW |r�x�|j � D ]v}xp|j
D ]f}||j
kr�qr|j
| }xJ|jD ]@} t j | �}|j |j kr�|j
|_ |j|j kr�|j
|_| j|� q�W qrW qfW x |j� D ]}
t|
| j�r�q�W x |j� D ]} t| | j��r�qW x |j� D ]} t| | j��r*�q*W d S )NZ dontaudit)r ZavrulesZ rule_typer ZAVRuleZALLOWr Zavrule_to_access_vectorsrC ZtypeattributesrE �copyr0 r r1 Zrolesr5 r+ Z typerulesr< �interface_callsr@ )
r r[ rE ZavruleZavsr* Z
typeattributerF Zattr_vecrO r4 r; r> r r r rY � s>
z InterfaceVector.from_interfacec C s t || j�dkr| jj|� d S )Nr )r3 r+ r rC )r r* r r r rC 3 s zInterfaceVector.add_avc C s< g }|j d| j � x | jD ]}|j t|�� q W dj|�S )Nz[InterfaceVector %s]�
)�appendr r �strr )r �sr* r r r � to_string9 s
zInterfaceVector.to_stringc C s | j � S )N)r )r r r r �__str__@ s zInterfaceVector.__str__c C s d| j | jf S )Nz<InterfaceVector %s:%s>)r rX )r r r r r C s zInterfaceVector.__repr__) r r r! r rY rC rb rc r r r r r rW � s 4rW c @ sx e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zi fdd�Z di fdd�Z
dd� Z dd� Z dd� Z
dd� ZdS )� InterfaceSetNc C s i | _ i | _g | _|| _d S )N)�
interfaces� tgt_type_map� tgt_type_all�output)r rh r r r r H s zInterfaceSet.__init__c C s | j r| j j|d � d S )Nr^ )rh �write)r r` r r r �oN s zInterfaceSet.oc C s� x�t | jj� dd� d�D ]�}|jd|j � x:t |jj� dd� d�D ] }|jd|jtj|j f � qDW |jd� t |j j
� �}x&|D ] }|jdj |�� |jd � q�W qW d S )
Nc S s | j S )N)r )r7 r r r r S s z&InterfaceSet.to_file.<locals>.<lambda>)�keyz[InterfaceVector %s c S s | j S )N)r )r7 r r r r U s z%s:%s z]
rR r^ ) �sortedre �valuesri r r+ r r r r Zto_listr )r rT Ziv�paramZavlr* r r r �to_fileR s
zInterfaceSet.to_filec C s� dd� }d }x^|D ]V}|d d� }|d dkrF|r<| j |� ||�}q|r|jd�}tj|�}|j|� qW |rz| j |� | j� d S )Nc S s� | dd� j � }t|�dk s(|d dkr4td| ��t� }|d |_t|�dkrTd S xb|dd � D ]R}|j d�}t|�dkr�td| ��t� }|d |_tj|d |_||j |j< qbW |S ) Nr rH r rW z)Syntax error InterfaceVector statement %s�:z-Invalid param in InterfaceVector statement %srI )
rJ rK rL rW r r r Z str_to_fieldr r+ )rM rN �ifvZfieldr- rn r r r � parse_ifv^ s
z)InterfaceSet.from_file.<locals>.parse_ifvr r rQ rR rI )�add_ifvrJ r rS rC �index)r rT rr rq rM rU r* r r r rV ] s
zInterfaceSet.from_filec C s || j |j< d S )N)re r )r rq r r r rs � s zInterfaceSet.add_ifvc C s� xz| j j� D ]l}t� }x:|jD ]0}tj|j�rB| jj|� t� }P |j|j� q W x$|D ] }| j j
|g �}|j|� qXW q W d S )N) re rm r6 r r r1 rg r_ r) rf �
setdefault)r rq r: r* r rU r r r rt � s
zInterfaceSet.indexc C s t ||�}| j|� d S )N)rW rs )r r[ rE rq r r r r) � s
zInterfaceSet.addc C s@ x(t j|j� |j� �D ]}| j||� qW | j|� | j� d S )N)r' r( re � templatesr) �expand_ifcallsrt )r �headersrh rE �ir r r � add_headers� s
zInterfaceSet.add_headersc C sZ t j|�rPt|dd � �}|t|j�kr,d S |j|d }t|t�rH|S |gS n|gS d S )Nr )r r r rK r= �
isinstance�list)r �idr> r$ r? r r r � map_param� s
zInterfaceSet.map_paramc
C s� | j |j|�}|d krd S | j |j|�}|d kr4d S | j |j|�}|d krNd S tj� }x0|jD ]&}| j ||�} | d krzq^q^|j| � q^W t|�dkr�d S x:|D ]2}
x,|D ]$} x |D ]} |j j
|
| | |� q�W q�W q�W d S )Nr ) r~ r0 r1 r& r r
Zperms�updaterK r r) )
r rq r* r> r9 r: r Z new_permsZpermr- r0 r1 r& r r r �
map_add_av� s*
zInterfaceSet.map_add_avc C s� |d fg}| j |j }d|_x�t|�dkr�|jd�\}}| j |j }||krrx |jD ]}| j|||� qTW |jrrq xv|j� D ]j} | j|jkr�| j t
d�� d S y|| j }
W n* t k
r� | j t
d| j �� w|Y nX |j |
| f� q|W q W d S )NTr r z Found circular interface classz#Missing interface definition for %srI )
re r rZ rK �popr r� r] Zifnamerj r �KeyErrorr_ ) r r[ �
if_by_name�stackrq ZcurZ
cur_ifcallZcur_ifvr* r> Znewifr r r �do_expand_ifcalls� s*
z InterfaceSet.do_expand_ifcallsc C sZ i }x&t j|j� |j� �D ]}|||j< qW x(t j|j� |j� �D ]}| j||� qBW d S )N)r' r( re rv r r� )r rx r� ry r[ r r r rw � s
zInterfaceSet.expand_ifcalls)N)r r r! r rj ro rV rs rt r) rz r~ r� r� rw r r r r rd G s
# $rd )r" r\ r' r r r r r Z sepolgeni18nr r r/ r3 r5 r< r@ rA rD rW rd r r r r �<module> s" ,4 Z sepolgen/__pycache__/yacc.cpython-36.pyc 0000644 00000151562 14751155147 0014161 0 ustar 00 3
�� fd �
@ s
d dl Z d dlZd dlZd dlZd dlZd dlZdZdZdZ dZ
dZ dZ dZ
d Zd
Zd Zejd dk rleZneZejZG d d � d e�ZG d
d� de�ZG dd� de�Zdd� Z dd� Z da da da dZ!dd� Z"dd� Z#dd� Z$d d � Z%G d d � d �Z&G d d!� d!�Z'G d"d#� d#�Z(e j)d$�Z*G d%d&� d&e�Z+G d'd(� d(e�Z,G d)d*� d*e�Z-d+d,� Z.G d-d.� d.e�Z/G d/d0� d0e�Z0G d1d2� d2e�Z1G d3d4� d4e�Z2d5d6� Z3d7d8� Z4G d9d:� d:e�Z5G d;d<� d<e2�Z6d=d>� Z7d?d@� Z8G dAdB� dBe�Z9de de ddd de
ddddf
dCdD�Z:dS )E� Nz3.11z3.10Tz
parser.out�parsetab�LALR� F�( c @ s4 e Zd Zdd� Zdd� ZeZdd� Zdd� ZeZd S )
� PlyLoggerc C s
|| _ d S )N)�f)�selfr � r �/usr/lib/python3.6/yacc.py�__init__m s zPlyLogger.__init__c O s | j j|| d � d S )N�
)r �write)r �msg�args�kwargsr r r
�debugp s zPlyLogger.debugc O s | j jd|| d � d S )Nz WARNING: r )r r
)r r r r r r r
�warningu s zPlyLogger.warningc O s | j jd|| d � d S )NzERROR: r )r r
)r r r r r r r
�errorx s zPlyLogger.errorN) �__name__�
__module__� __qualname__r r �infor r Zcriticalr r r r
r l s r c @ s e Zd Zdd� Zdd� ZdS )�
NullLoggerc C s | S )Nr )r �namer r r
�__getattribute__ s zNullLogger.__getattribute__c O s | S )Nr )r r r r r r
�__call__� s zNullLogger.__call__N)r r r r r r r r r
r ~ s r c @ s e Zd ZdS )� YaccErrorN)r r r r r r r
r � s r c C sP t | �}d|krt |�}t|�tkr4|d t� d }dt| �jt| �|f }|S )Nr z ...z<%s @ 0x%x> (%s))�repr�len� resultlimit�typer �id)�r�repr_str�resultr r r
�
format_result� s r% c C sB t | �}d|krt |�}t|�dk r(|S dt| �jt| �f S d S )Nr � z <%s @ 0x%x>)r r r r r! )r" r# r r r
�format_stack_entry� s r' a PLY: Don't use global functions errok(), token(), and restart() in p_error().
Instead, invoke the methods on the associated parser instance:
def p_error(p):
...
# Use parser.errok(), parser.token(), parser.restart()
...
parser = yacc.yacc()
c C s t jt� t� S )N)�warnings�warn�_warnmsg�_errokr r r r
�errok� s
r, c C s t jt� t� S )N)r( r) r* �_restartr r r r
�restart� s
r. c C s t jt� t� S )N)r( r) r* �_tokenr r r r
�token� s
r0 c C s> |j a|ja|ja| |�}y
bbbW n tk
r8 Y nX |S )N)r, r+ r0 r/ r. r- � NameError)� errorfuncr0 �parserr" r r r
�call_errorfunc� s
r4 c @ s e Zd Zdd� Zdd� ZdS )�
YaccSymbolc C s | j S )N)r )r r r r
�__str__� s zYaccSymbol.__str__c C s t | �S )N)�str)r r r r
�__repr__� s zYaccSymbol.__repr__N)r r r r6 r8 r r r r
r5 � s r5 c @ sn e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� ZdS )�YaccProductionNc C s || _ || _d | _d | _d S )N)�slice�stack�lexerr3 )r �sr; r r r
r � s zYaccProduction.__init__c C sB t |t�r dd� | j| D �S |dkr2| j| jS | j| jS d S )Nc S s g | ]
}|j �qS r )�value)�.0r= r r r
�
<listcomp>� s z.YaccProduction.__getitem__.<locals>.<listcomp>r )�
isinstancer: r> r; )r �nr r r
� __getitem__� s
zYaccProduction.__getitem__c C s || j | _d S )N)r: r> )r rB �vr r r
� __setitem__� s zYaccProduction.__setitem__c C s dd� | j ||� D �S )Nc S s g | ]
}|j �qS r )r> )r? r= r r r
r@ � s z/YaccProduction.__getslice__.<locals>.<listcomp>)r: )r �i�jr r r
� __getslice__� s zYaccProduction.__getslice__c C s
t | j�S )N)r r: )r r r r
�__len__� s zYaccProduction.__len__c C s t | j| dd�S )N�linenor )�getattrr: )r rB r r r
rJ s zYaccProduction.linenoc C s || j | _d S )N)r: rJ )r rB rJ r r r
�
set_lineno s zYaccProduction.set_linenoc C s, t | j| dd�}t | j| d|�}||fS )NrJ r � endlineno)rK r: )r rB � startlineZendliner r r
�linespan s zYaccProduction.linespanc C s t | j| dd�S )N�lexposr )rK r: )r rB r r r
rP s zYaccProduction.lexposc C s || j | _d S )N)r: rP )r rB rP r r r
�
set_lexpos s zYaccProduction.set_lexposc C s, t | j| dd�}t | j| d|�}||fS )NrP r � endlexpos)rK r: )r rB �startpos�endposr r r
�lexspan s zYaccProduction.lexspanc C s t �d S )N)� SyntaxError)r r r r
r s zYaccProduction.error)N)r r r r rC rE rH rI rJ rL rO rP rQ rU r r r r r
r9 � s
r9 c @ s\ e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zdd
d�Zddd�Z ddd�Z
ddd�Z d S )�LRParserc C s0 |j | _|j| _|j| _|| _| j� d| _d S )NT) �lr_productions� productions� lr_action�action�lr_goto�gotor2 �set_defaulted_states�errorok)r ZlrtabZerrorfr r r
r s zLRParser.__init__c C s
d| _ d S )NT)r_ )r r r r
r, ( s zLRParser.errokc C s@ | j d d �= | jd d �= t� }d|_| jj|� | j jd� d S )Nz$endr )�
statestack�symstackr5 r �append)r �symr r r
r. + s zLRParser.restartc C sT i | _ xH| jj� D ]:\}}t|j� �}t|�dkr|d dk r|d | j |< qW d S )N� r )�defaulted_statesr[ �items�list�valuesr )r �state�actionsZrulesr r r
r^ ; s
z LRParser.set_defaulted_statesc C s
i | _ d S )N)re )r r r r
�disable_defaulted_statesB s z!LRParser.disable_defaulted_statesNFc C sZ |st r.t|t�r ttj�}| j|||||�S |rD| j|||||�S | j|||||�S d S )N) � yaccdevelrA �intr �sys�stderr�
parsedebug�parseopt�parseopt_notrack)r �inputr< r �tracking� tokenfuncr r r
�parseE s
zLRParser.parsec C s� d }g }| j }| j} | j}
| j} td �} d}
|jd� |sLddlm} |j}|| _| | _ |d k rj|j
|� |d krz|j }n|}|| _ g }|| _ g }|| _
|| _d }|jd� t� }d|_|j|� d}�x�|jd� |jd|� || k�r.|�s|� s�|� }n|j� }|�st� }d|_|j}|| j|�}n| | }|jd|| � |jd d
d jd d
� |D �dd � �t|�f j� � |d k �r�|dk�r�|j|� |}|jd|� |j|� d }|
r�|
d8 }
q�|dk �rN|
| }|j}|j}t� }||_d |_|�rB|jd|jddjdd
� || d � D �� d | |d%| | � n |jd|jg | |d& | � |�r�|| d d � }||d< |�r�|d }|j|_|j |_ |d' }t |d|j�|_ t |d|j �|_ || _ yd|| d �= || _!|j"| � || d �= |jdt#| d �� |j|� | |d( | }|j|� W q� t$k
�r� |j|� |j%|dd)� � |j� |d* }d|_d|_|}t&}
d| _'Y q�X q�n�|�r�|j|_|j |_ |g}|| _ yL|| _!|j"| � |jdt#| d �� |j|� | |d+ | }|j|� W q� t$k
�rJ |j|� |j� |d, }d|_d|_|}t&}
d| _'Y q�X q�|dk�r�|d- } t | dd �} |jdt#| �� |jd� | S |d k�r�|j(d d
d jd d
� |D �dd � �t|�f j� � |
dk�s�| j'�r�t&}
d| _'|}|jdk�r�d }| j)�rB|�rt*|d � �r||_|| _!t+| j)|| �} | j'�r�| }d }q�n`|�r�t*|d ��r\|j} nd} | �r~t,j-j.d | |jf � nt,j-j.d!|j � nt,j-j.d"� d S nt&}
t|�dk�r�|jdk�r�d }d }d}|d d �= q�|jdk�r�d S |jdk�r�|d. }|jdk�r6|�r0t |d |j�|_ t |d#|j �|_ d }q�t� }d|_t*|d ��r\|j |_|_ t*|d#��rv|j |_ |_ ||_|j|� |}q�|j� }|�r�|j|_|j |_ |j� |d/ }q�t/d$��q�W d S )0Nr zPLY: PARSE DEBUG STARTrd )�lexz$end� z State : %sz#Defaulted state %s: Reduce using %dz Stack : %sz%s . %s� c S s g | ]
}|j �qS r )r )r? �xxr r r
r@ � s z'LRParser.parsedebug.<locals>.<listcomp>z Action : Shift and goto state %sz3Action : Reduce rule [%s] with %s and goto state %d�[�,c S s g | ]}t |j��qS r )r' r> )r? Z_vr r r
r@ � s �]rM rR z Result : %sr Fr> zDone : Returning %szPLY: PARSE DEBUG ENDz Error : %sc S s g | ]
}|j �qS r )r )r? rz r r r
r@ D s r< rJ z(yacc: Syntax error at line %d, token=%s
z yacc: Syntax error, token=%sz yacc: Parse error in input. EOF
rP z yacc: internal parser error!!!
���r~ r~ r~ r~ r~ r~ r~ r~ r~ r~ )0r[ r] rY re r9 r rx rw r< r3 rs r0 r` ra r; rb r5 r r �pop�get�joinr7 �lstripr r r> rJ rP rK rM rR r: ri �callabler% rV �extend� error_countr_ r r2 �hasattrr4 rn ro r
� RuntimeError) r rs r< r rt ru � lookahead�lookaheadstackrj r] �prodre �pslice�
errorcountrw � get_tokenr` ra �errtokenrc ri �ltype�t�p�pname�plen�targ�t1rB r$ �tokrJ r r r
rp ^ s~
.
$
.
zLRParser.parsedebugc C sv d }g }| j }| j} | j}
| j} td �} d}
|sBddlm} |j}|| _| | _|d k r`|j |� |d krp|j
}n|}|| _
g }|| _ g }|| _ || _
d }|jd� t� }d|_|j|� d}�x�|| k�r|s�|s�|� }n|j� }|s�t� }d|_|j}|| j|�}n| | }|d k �rh|dk�rN|j|� |}|j|� d }|
r�|
d8 }
q�|dk �rF|
| }|j}|j}t� }||_d |_|�r�|| d d � }||d< |�r�|d }|j|_|j|_|d }t|d|j�|_t|d|j�|_|| _yP|| d �= || _ |j | � || d �= |j|� | |d | }|j|� W q� t k
�r� |j|� |j |dd� � |j� |d }d|_d|_|}t }
d| _!Y q�X q�n�|�r�|j|_|j|_|g}|| _y8|| _ |j | � |j|� | |d | }|j|� W q� t k
�rB |j|� |j� |d }d|_d|_|}t }
d| _!Y q�X q�|dk�rh|d } t| d d �} | S |d k�rf|
dk�s�| j!�rNt }
d| _!|}|jdk�r�d }| j"�r�|�r�t#|d
� �r�||_|| _ t$| j"|| �} | j!�rL| }d }q�n`|�r<t#|d ��r|j} nd} | �r(t%j&j'd | |jf � nt%j&j'd
|j � nt%j&j'd� d S nt }
t|�dk�r�|jdk�r�d }d }d}|d d �= q�|jdk�r�d S |jdk�r6|d }|jdk�r�|�r�t|d |j�|_t|d|j�|_d }q�t� }d|_t#|d ��r|j |_|_t#|d��r |j |_|_||_|j|� |}q�|j� }|�rT|j|_|j|_|j� |d }q�t(d��q�W d S )Nr rd )rw z$endrM rR r Fr> r< rJ z(yacc: Syntax error at line %d, token=%s
z yacc: Syntax error, token=%sz yacc: Parse error in input. EOF
rP z yacc: internal parser error!!!
r~ r~ r~ r~ r~ r~ r~ r~ r~ ))r[ r] rY re r9 rx rw r< r3 rs r0 r` ra r; rb r5 r r r� r r r> rJ rP rK rM rR r: ri r� rV r� r� r_ r2 r� r4 rn ro r
r� ) r rs r< r rt ru r� r� rj r] r� re r� r� rw r� r` ra r� rc ri r� r� r� r� r� r� r� rB r$ r� rJ r r r
rq � sX
zLRParser.parseoptc C s� d }g }| j }| j} | j}
| j} td �} d}
|sBddlm} |j}|| _| | _|d k r`|j |� |d krp|j
}n|}|| _
g }|| _ g }|| _ || _
d }|jd� t� }d|_|j|� d}�x|| k�r|s�|s�|� }n|j� }|s�t� }d|_|j}|| j|�}n| | }|d k �r |dk�rN|j|� |}|j|� d }|
r�|
d8 }
q�|dk �r�|
| }|j}|j}t� }||_d |_|�rX|| d d � }||d< || _yP|| d �= || _|j| � || d �= |j|� | |d | }|j|� W q� tk
�rR |j|� |j|dd� � |j� |d }d|_d|_|}t}
d| _ Y q�X q�n�|g}|| _y8|| _|j| � |j|� | |d | }|j|� W q� tk
�r� |j|� |j� |d }d|_d|_|}t}
d| _ Y q�X q�|dk�r |d }t |dd �} | S |d k�r�|
dk�s(| j �r�t}
d| _ |}|jdk�rFd }| j �r�|�rht |d� �rh||_|| _t | j || �} | j �r�| }d }q�n`|�r�t |d ��r�|j!} nd} | �r�t"j#j$d
| |jf � nt"j#j$d |j � nt"j#j$d � d S nt}
t|�dk�r(|jdk�r(d }d }d}|d d �= q�|jdk�r8d S |jdk�r�|d }|jdk�r^d }q�t� }d|_t |d ��r�|j! |_!|_%t |d
��r�|j& |_&|_'||_|j|� |}q�|j� }|j� |d }q�t(d��q�W d S )Nr rd )rw z$endr Fr> r< rJ z(yacc: Syntax error at line %d, token=%s
z yacc: Syntax error, token=%sz yacc: Parse error in input. EOF
rP z yacc: internal parser error!!!
r~ r~ r~ r~ r~ r~ r~ r~ ))r[ r] rY re r9 rx rw r< r3 rs r0 r` ra r; rb r5 r r r� r r r> r: ri r� rV r� r� r_ rK r2 r� r4 rJ rn ro r
rM rP rR r� ) r rs r< r rt ru r� r� rj r] r� re r� r� rw r� r` ra r� rc ri r� r� r� r� r� r� rB r$ r� rJ r r r
rr � s8
zLRParser.parseopt_notrack)NNFFN)NNFFN)NNFFN)NNFFN) r r r r r, r. r^ rk rv rp rq rr r r r r
rW s
]
4rW z^[a-zA-Z0-9_-]+$c @ sR e Zd ZdZddd�Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dS )�
Productionr �rightNrx c C s� || _ t|�| _|| _|| _d | _|| _|| _|| _t | j�| _ g | _
x$| jD ]}|| j
krN| j
j |� qNW g | _ d | _
| jr�d| j dj| j�f | _n d| j | _d S )Nz%s -> %sry z
%s -> <empty>)r �tupler� �number�funcr� �file�line�precr �usymsrb �lr_items�lr_nextr� r7 ) r r� r r� �
precedencer� r� r� r= r r r
r ! s$
zProduction.__init__c C s | j S )N)r7 )r r r r
r6 ? s zProduction.__str__c C s dt | � d S )Nz Production(�))r7 )r r r r
r8 B s zProduction.__repr__c C s
t | j�S )N)r r� )r r r r
rI E s zProduction.__len__c C s dS )Nrd r )r r r r
� __nonzero__H s zProduction.__nonzero__c C s
| j | S )N)r� )r �indexr r r
rC K s zProduction.__getitem__c C s� |t | j�krd S t| |�}y| j|j|d |_W n ttfk
rT g |_Y nX y|j|d |_W n tk
r� d |_Y nX |S )Nrd )r r� �LRItem� Prodnames�lr_after�
IndexError�KeyError� lr_before)r rB r� r r r
�lr_itemO s
zProduction.lr_itemc C s | j r|| j | _d S )N)r� r� )r �pdictr r r
�bind_ s zProduction.bind�r� r )r� Nrx r ) r r r �reducedr r6 r8 rI r� rC r� r� r r r r
r� s
r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�MiniProductionc C s. || _ || _|| _d | _|| _|| _|| _d S )N)r r r� r� r� r� r7 )r r7 r r r� r� r� r r r
r h s zMiniProduction.__init__c C s | j S )N)r7 )r r r r
r6 q s zMiniProduction.__str__c C s
d| j S )NzMiniProduction(%s))r7 )r r r r
r8 t s zMiniProduction.__repr__c C s | j r|| j | _d S )N)r� r� )r r� r r r
r� x s zMiniProduction.bindN)r r r r r6 r8 r� r r r r
r� g s r� c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )r� c C sZ |j | _ t|j�| _|j| _|| _i | _| jj|d� t| j�| _t| j�| _|j | _ d S )N�.)
r rg r� r� �lr_index�
lookaheads�insertr� r r� )r r� rB r r r
r � s zLRItem.__init__c C s, | j r d| jdj| j �f }n
d| j }|S )Nz%s -> %sry z
%s -> <empty>)r� r r� )r r= r r r
r6 � s
zLRItem.__str__c C s dt | � d S )NzLRItem(r� )r7 )r r r r
r8 � s zLRItem.__repr__N)r r r r r6 r8 r r r r
r� � s r� c C s: t | �d }x(|dkr4| | |kr*| | S |d8 }qW d S )Nrd r )r )Zsymbols� terminalsrF r r r
�rightmost_terminal� s
r� c @ s e Zd ZdS )� GrammarErrorN)r r r r r r r
r� � s r� c @ s� e Zd Zdd� Zdd� Zdd� Zdd� Zd$d d
�Zd%dd�Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zd d � Zd d � Zd&d d!�Zd"d#� Zd S )'�Grammarc C sf d g| _ i | _i | _i | _x|D ]}g | j|< q W g | jd< i | _i | _i | _i | _t� | _ d | _
d S )Nr ) � Productionsr� �Prodmap� Terminals� Nonterminals�First�Follow�
Precedence�set�UsedPrecedence�Start)r r� �termr r r
r � s
zGrammar.__init__c C s
t | j�S )N)r r� )r r r r
rI � s zGrammar.__len__c C s
| j | S )N)r� )r r� r r r
rC � s zGrammar.__getitem__c C sL | j d gkstd��|| jkr*td| ��|dkr:td��||f| j|< d S )Nz2Must call set_precedence() before add_production()z,Precedence already specified for terminal %r�leftr� �nonassocz:Associativity must be one of 'left','right', or 'nonassoc')r� r� r� )r� �AssertionErrorr� r� )r r� �assoc�levelr r r
�set_precedence� s
zGrammar.set_precedenceNrx r c C s� || j kr td|||f ��|dkr6td|||f ��tj|�sRtd|||f ��x�t|�D ]�\}}|d dkr�yJt|�}t|�dkr�td||||f ��|| j kr�g | j |< |||< w\W n tk
r� Y nX tj|� r\|d kr\td
||||f ��q\W d |k�r�|d d k�r$td ||f ��|d d k�rBtd
||f ��|d } | jj | �}
|
�sptd||| f ��n | j
j | � |dd �= nt || j �} | jj | d�}
d||f } | | j
k�r�| j
| } td||| f d| j| jf ��t| j�}
|| jk�rg | j|< xR|D ]J}|| j k�r.| j | j|
� n&|| jk�rDg | j|< | j| j|
� �q W t|
|||
|||�}| jj|� || j
| < y| j| j|� W n" tk
�r� |g| j|< Y nX d S )Nz7%s:%d: Illegal rule name %r. Already defined as a tokenr z5%s:%d: Illegal rule name %r. error is a reserved wordz%s:%d: Illegal rule name %rr z'"rd zA%s:%d: Literal token %s in rule %r may only be a single characterz%precz!%s:%d: Illegal name %r in rule %rz+%s:%d: Syntax error. Nothing follows %%prec� zH%s:%d: Syntax error. %%prec can only appear at the end of a grammar rulez/%s:%d: Nothing known about the precedence of %rr� z%s -> %sz%s:%d: Duplicate rule %s. z Previous definition at %s:%dr~ ���r~ r� )r� r )r� r� �_is_identifier�match� enumerate�evalr rV r� r� r� �addr� r� r� r� r� r� rb r� r� r� )r �prodname�symsr� r� r� rB r= �cZprecnameZprodprec�map�mZpnumberr� r� r r r
�add_production sp
zGrammar.add_productionc C sT |s| j d j}|| jkr&td| ��tdd|g�| j d< | j| jd� || _d S )Nrd zstart symbol %s undefinedr zS')r� r r� r� r� rb r� )r �startr r r
� set_startc s
zGrammar.set_startc s> � ��fdd�� t � �� �jd jd � �fdd��jD �S )Nc sJ | �kr d S �j | � x.�jj| g �D ] }x|jD ] }� |� q2W q&W d S )N)r� r� r� r� )r= r� r" )�mark_reachable_from� reachabler r r
r� v s
z5Grammar.find_unreachable.<locals>.mark_reachable_fromr c s g | ]}|� kr|�qS r r )r? r= )r� r r
r@ � s z,Grammar.find_unreachable.<locals>.<listcomp>)r� r� r� r� )r r )r� r� r r
�find_unreachables s zGrammar.find_unreachablec C s� i }x| j D ] }d||< q W d|d< x| jD ] }d||< q,W xpd}x`| jj� D ]R\}}xH|D ]@}x |jD ]}|| shd}P qhW d}|r\|| s�d||< d}P q\W qNW |s>P q>W g } x@|j� D ]4\}}
|
s�|| jkr�|| j kr�|dkr�q�| j|� q�W | S )NTz$endFr )r� r� r� rf r� rb ) r Z
terminatesr� rB � some_changeZplr� r= Z p_terminates�infiniter� r r r
�infinite_cycles� s:
zGrammar.infinite_cyclesc C sX g }xN| j D ]D}|sq x8|jD ].}|| jkr || jkr |dkr |j||f� q W q W |S )Nr )r� r� r� r� rb )r r$ r� r= r r r
�undefined_symbols� s zGrammar.undefined_symbolsc C s8 g }x.| j j� D ] \}}|dkr| r|j|� qW |S )Nr )r� rf rb )r Z
unused_tokr= rD r r r
�unused_terminals� s
zGrammar.unused_terminalsc C s< g }x2| j j� D ]$\}}|s| j| d }|j|� qW |S )Nr )r� rf r� rb )r Z unused_prodr= rD r� r r r
� unused_rules� s zGrammar.unused_rulesc C sD g }x:| j D ]0}|| jkp"|| jks |j|| j | d f� q W |S )Nr )r� r� r� rb )r ZunusedZtermnamer r r
�unused_precedence� s
zGrammar.unused_precedencec C s` g }xV|D ]D}d}x2| j | D ]$}|dkr0d}q ||kr |j|� q W |rLq
P q
W |jd� |S )NFz<empty>T)r� rb )r Zbetar$ �xZx_produces_emptyr r r r
�_first s
zGrammar._firstc C s� | j r | j S x| jD ]}|g| j |< qW dg| j d< x| jD ]}g | j |< q<W xjd}xZ| jD ]P}xJ| j| D ]<}x6| j|j�D ]&}|| j | kr~| j | j|� d}q~W qlW q\W |sPP qPW | j S )Nz$endFT)r� r� r� r� r� r� rb )r r� rB r� r� r r r r
�
compute_first. s$ zGrammar.compute_firstc
C sV | j r | j S | js| j� x| jD ]}g | j |< q"W |sD| jd j}dg| j |< � x�d}x�| jdd � D ]�}x�t|j�D ]�\}}|| jkrx| j|j|d d � �}d}xB|D ]:} | dkr�| | j | kr�| j | j | � d}| dkr�d}q�W |�s|t
|j�d krxx:| j |j D ]*} | | j | k�r| j | j | � d}�qW qxW qhW |sTP qTW | j S )Nrd z$endFz<empty>T) r� r� r� r� r� r r� r� r� rb r )
r r� �k�didaddr� rF �BZfstZhasemptyr r r r
�compute_followS s<
zGrammar.compute_followc C s� x�| j D ]�}|}d}g }x�|t|�kr,d }ntt||�}y| j|j|d |_W n ttfk
rn g |_Y nX y|j|d |_W n tk
r� d |_Y nX ||_ |s�P |j
|� |}|d7 }qW ||_ qW d S )Nr rd ) r� r r� r� r� r� r� r� r� r� rb r� )r r� ZlastlrirF r� Zlrir r r
�
build_lritems� s.
zGrammar.build_lritems)Nrx r )N)N)r r r r rI rC r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r
r� � s $
T
@#%
;r� c @ s e Zd ZdS )� VersionErrorN)r r r r r r r
r� � s r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�LRTablec C s d | _ d | _d | _d | _d S )N)rZ r\ rX � lr_method)r r r r
r � s zLRTable.__init__c C s~ t |tj�r|}ntd| � tj| }|jtkr:td��|j | _
|j | _ g | _
x |jD ]}| j
jt|� � qXW |j| _|jS )Nz import %sz&yacc table file version is out of date)rA �types�
ModuleType�execrn �modulesZ _tabversion�__tabversion__r� Z
_lr_actionrZ Z_lr_gotor\ rX Z_lr_productionsrb r� Z
_lr_methodr� Z
_lr_signature)r �moduler r� r r r
�
read_table� s
zLRTable.read_tablec C s� y dd l }W n tk
r( dd l}Y nX tjj|�s:t�t|d�}|j|�}|tkr^t d��|j|�| _
|j|�}|j|�| _ |j|�| _ |j|�}g | _
x |D ]}| j
jt|� � q�W |j� |S )Nr �rbz&yacc table file version is out of date)�cPickle� ImportError�pickle�os�path�exists�open�loadr� r� r� rZ r\ rX rb r� �close)r �filenamer� Zin_fZ
tabversion� signaturerY r� r r r
� read_pickle� s(
zLRTable.read_picklec C s x| j D ]}|j|� qW d S )N)rX r� )r r� r� r r r
�bind_callables� s zLRTable.bind_callablesN)r r r r r� r r r r r r
r� � s r� c C sT i }x| D ] }d||< q
W g }i }x,| D ]$}|| dkr(t ||||| ||� q(W |S )Nr )�traverse)�X�R�FP�Nr� r; �Fr r r
�digraph s
r
c C s |j | � t|�}||| < || �|| < || �}xr|D ]j} || dkrXt| ||||||� t|| || �|| < x.|j| g �D ] }
|
|| kr||| j |
� q|W q4W || |k�rt||d < || ||d < |j� } x2| | k�rt||d < || ||d < |j� } q�W d S )Nr rd r~ r~ r~ r~ )rb r r �minr� �MAXINTr ) r� r r; r r r r �d�rel�y�a�elementr r r
r s(
r c @ s e Zd ZdS )� LALRErrorN)r r r r r r r
r + s r c @ s� e Zd Zd$dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd � Zd d � Zd%d d!�Zd&d"d#�ZdS )'�LRGeneratedTabler Nc C s� |dkrt d| ��|| _|| _|s*t� }|| _i | _i | _|j| _i | _ i | _
d| _ d| _ d| _
g | _g | _g | _| jj� | jj� | jj� | j� d S )N�SLRr zUnsupported method %sr )r r )r �grammarr� r �logrZ r\ r� rX �
lr_goto_cache� lr0_cidhash�
_add_countZ sr_conflictZ rr_conflictZ conflicts� sr_conflicts� rr_conflictsr� r� r� �lr_parse_table)r r �methodr r r r
r 6 s,
zLRGeneratedTable.__init__c C sz | j d7 _ |d d � }d}xV|rtd}xH|D ]@}x:|jD ]0}t|dd�| j krRq:|j|j� | j |_d}q:W q.W q W |S )Nrd TF� lr0_addedr )r r� rK rb r� r )r �I�Jr� rG r� r r r
� lr0_closure[ s
z LRGeneratedTable.lr0_closurec C s� | j jt|�|f�}|r |S | j j|�}|s:i }|| j |< g }xP|D ]H}|j}|rD|j|krD|jt|��}|s~i }||t|�< |j|� |}qDW |jd�}|s�|r�| j|�}||d< n||d< || j t|�|f< |S )Nz$end)r r� r! r� r� rb r! ) r r r� �gr= Zgsr� rB �s1r r r
�lr0_gotou s2
zLRGeneratedTable.lr0_gotoc C s� | j | jjd jg�g}d}x"|D ]}|| jt|�< |d7 }q"W d}x�|t|�k r�|| }|d7 }i }x$|D ] }x|jD ] }d ||< qxW qlW xJ|D ]B}| j||�}| s�t|�| jkr�q�t|�| jt|�< |j |� q�W qFW |S )Nr rd )
r! r r� r� r r! r r� r$ rb ) r �CrF r Zasyms�iir= r� r" r r r
� lr0_items� s(
zLRGeneratedTable.lr0_itemsc C s� t � }d}xrxV| jjdd � D ]B}|jdkr:|j|j� q x$|jD ]}||krBP qBW |j|j� q W t|�|krrP t|�}q W |S )Nr rd )r� r r� r r� r r� )r �nullableZ num_nullabler� r� r r r
� compute_nullable_nonterminals� s
z.LRGeneratedTable.compute_nullable_nonterminalsc C sr g }xht |�D ]\\}}xR|D ]J}|j|jd k r ||j|jd f}|d | jjkr ||kr |j|� q W qW |S )Nrd )r� r� r r� r r� rb )r r% �transZstatenori r� r� r r r
� find_nonterminal_transitions� s
z-LRGeneratedTable.find_nonterminal_transitionsc
C s� |\}}g }| j || |�}xJ|D ]B}|j|jd k r"|j|jd } | | jjkr"| |kr"|j| � q"W |dkr�|| jjd jd kr�|jd� |S )Nrd r z$end)r$ r� r r� r r� rb r� )
r r% r* r( ri r �termsr" r� r r r r
� dr_relation s
z LRGeneratedTable.dr_relationc C sv g }|\}}| j || |�}| jjt|�d�}xB|D ]:} | j| jd k r4| j| jd }
|
|kr4|j||
f� q4W |S )Nrd r~ )r$ r r� r! r� r r� rb ) r r% r* �emptyr ri r r" rG r� r r r r
�reads_relation s
z LRGeneratedTable.reads_relationc C s� i }i }i }x|D ] }d||< qW �x�|D �]�\}} g }
g } �xR|| D �]D} | j | krZqH| j}
|}x�|
| jd k �r
|
d }
| j|
}||f|kr�|
d }xH|| jk r�| j| | jjkr�P | j| |kr�P |d }q�W | j||f� | j|| |�}| jj t
|�d�}qfW x�|| D ]t}|j | j k�r,�q|j| jk�r>�qd}xD||jk �rx|j| | j|d k�rlP |d }�qDW |
j||f� �qW qHW x2| D ]*}||k�r�g ||< || j|| f� �q�W |
||| f< q*W ||fS )Nrd r r~ ) r r� r r� r r� rb r$ r r� r! )r r% r* r( ZlookdictZ includedictZdtransr� ri r ZlookbZincludesr� r� rG Zlir" r" rF r r r
�compute_lookback_includesD sX
z*LRGeneratedTable.compute_lookback_includesc s0 � ��fdd�}� ��fdd�}t |||�}|S )Nc s �j � | ��S )N)r- )r� )r% r( r r r
�<lambda>� s z4LRGeneratedTable.compute_read_sets.<locals>.<lambda>c s �j � | ��S )N)r/ )r� )r% r( r r r
r1 � s )r
)r r% �ntransr( r r r r )r% r( r r
�compute_read_sets� s z"LRGeneratedTable.compute_read_setsc s( �fdd�}� fdd�}t |||�}|S )Nc s � | S )Nr )r� )�readsetsr r
r1 � s z6LRGeneratedTable.compute_follow_sets.<locals>.<lambda>c s � j | g �S )N)r� )r� )�inclsetsr r
r1 � s )r
)r r2 r4 r5 r r r r )r5 r4 r
�compute_follow_sets� s z$LRGeneratedTable.compute_follow_setsc C sx xr|j � D ]f\}}x\|D ]T\}}||jkr4g |j|< |j|g �}x*|D ]"}||j| krF|j| j|� qFW qW q
W d S )N)rf r� r� rb ) r Z lookbacksZ followsetr* Zlbri r� r r r r r
�add_lookaheads� s
z LRGeneratedTable.add_lookaheadsc C sP | j � }| j|�}| j|||�}| j|||�\}}| j|||�}| j||� d S )N)r) r+ r3 r0 r6 r7 )r r% r( r* r4 ZlookdZincludedZ
followsetsr r r
�add_lalr_lookaheads� s
z$LRGeneratedTable.add_lalr_lookaheadsc $ C s8 | j j}| j j}| j}| j}| j}i }|jd| j� | j� }| jdkrP| j |� d}�x�|D �]�} g }
i } i } i }
|jd� |jd|� |jd� x | D ]}|jd|j
|� q�W |jd� �x| D �]�}|j |j d k�r(|j
dkr�d| d < || d < �q�| jdk�r|j| }n| j j|j
}�x�|D �]�}|
j||d
|j
|f f� | j|�}|d k �r�|dk�r>|j|d�\}}||j
j\}}||k �s�||k�r�|d k�r�|j
| |< || |< | �r�| �r�|jd
|� | jj||df� ||j
jd7 _nB||k�r|dk�rd | |< n$|�s�|jd|� | jj||df� n�|dk �r�|| }||j
}|j|jk�r�|j
| |< || |< || }}||j
jd7 _||j
jd8 _n
|| }}| jj|||f� |jd|| | j
| | � n td| ��n(|j
| |< || |< ||j
jd7 _�q&W q�|j }|j|d }|| j jkr�| j| |�}| jjt |�d�} | dkr�|
j||d| f� | j|�}|d k �r�|dk�r�|| k�r�td| ��n�|dk �r�|j|d�\}}|| | j
j\}}||k�s||k�rR|d k�rR|| | j
jd8 _| | |< || |< |�s�|jd|� | jj||df� nL||k�rp|dk�rpd | |< n.| �r�| �r�|jd
|� | jj||df� n td| ��q�| | |< || |< q�W i } xF|
D ]>\}}} || k�r�|| | k�r�|jd|| � d| || f< �q�W |jd� d} xX|
D ]P\}}} || k�r"|| | k �r"|| f| k�r"|j d|| � d} d| || f< �q"W | �r�|j d� i } x6| D ].}!x&|!j D ] }"|"| j j k�r�d | |"< �q�W �q�W xL| D ]D}#| j| |#�}| jjt |�d �} | dk�r�| |
|#< |jd|#| � �q�W | ||< | ||< |
||< |d7 }q\W d S ) NzParsing method: %sr r rx zstate %dz (%d) %srd zS'z$endzreduce using rule %d (%s)r� r� z3 ! shift/reduce conflict for %s resolved as reduce�reducer� z2 ! shift/reduce conflict for %s resolved as shiftZshiftz= ! reduce/reduce conflict for %s resolved using rule %d (%s)z Unknown conflict in state %dzshift and go to state %dz Shift/shift conflict in state %dz %-15s %sz ! %-15s [ %s ]z" %-30s shift and go to state %d)r� r r~ )r� r r~ ) r r� r� r\ rZ r r r� r' r8 r� r r� r r� r� rb r� r� r r� r� r r r� r� r$ r r! r r� r� )$r r� r� r] r[ r Zactionpr% �str ZactlistZ st_actionZ
st_actionpZst_gotor� Zlaheadsr r" ZsprecZslevelZrprecZrlevelZoldpZppZchosenpZrejectprF r" rG Z _actprintr� Znot_usedZnkeysr& r= rB r r r
r � s
z LRGeneratedTable.lr_parse_tablerx c C s� t |tj�rtd��|jd�d }tjj||�d }�ylt|d�}|j dtjj
|�t | j |f � d}|�rti }xf| j
j� D ]X\} }
xN|
j� D ]B\} } |j| �}
|
s�g g f}
|
|| < |
d j| � |
d j| � q�W q|W |j d� xz|j� D ]n\}} |j d | � x | d D ]}
|j d
|
� �q W |j d � x | d D ]}
|j d
|
� �q8W |j d � q�W |j d
� |j d� nJ|j d� x4| j
j� D ]&\}} |j d|d |d | f � �q�W |j d
� |�r�i }xl| jj� D ]^\} }
xR|
j� D ]F\} } |j| �}
|
�sg g f}
|
|| < |
d j| � |
d j| � �q�W �q�W |j d� x||j� D ]p\}} |j d | � x | d D ]}
|j d
|
� �qjW |j d � x | d D ]}
|j d
|
� �q�W |j d � �qJW |j d
� |j d� nJ|j d� x4| jj� D ]&\}} |j d|d |d | f � �q�W |j d
� |j d� xd| jD ]Z}|j�rl|j d|j|j|j|jtjj
|j�|jf � n |j dt|�|j|jf � �q0W |j d� |j� W n& tk
�r� } z� W Y d d }~X nX d S )Nz"Won't overwrite existing tabmoduler� rd z.py�wz�
# %s
# This file is automatically generated. Do not edit.
# pylint: disable=W,C,R
_tabversion = %r
_lr_method = %r
_lr_signature = %r
r z
_lr_action_items = {z%r:([z%r,z],[z]),z}
z�
_lr_action = {}
for _k, _v in _lr_action_items.items():
for _x,_y in zip(_v[0],_v[1]):
if not _x in _lr_action: _lr_action[_x] = {}
_lr_action[_x][_k] = _y
del _lr_action_items
z
_lr_action = { z (%r,%r):%r,z
_lr_goto_items = {z�
_lr_goto = {}
for _k, _v in _lr_goto_items.items():
for _x, _y in zip(_v[0], _v[1]):
if not _x in _lr_goto: _lr_goto[_x] = {}
_lr_goto[_x][_k] = _y
del _lr_goto_items
z
_lr_goto = { z_lr_productions = [
z (%r,%r,%d,%r,%r,%d),
z (%r,%r,%d,None,None,None),
z]
r~ )rA r� r� �IOError�splitr� r� r� r� r
�basenamer� r� rZ rf r� rb r\ rX r� r7 r r r� r� r� )r � tabmodule� outputdirr Zbasemodulenamer r Zsmallerrf r= Zndr rD rF r� r� �er r r
� write_table�
s�
"
"
"
z LRGeneratedTable.write_tablec C s y dd l }W n tk
r( dd l}Y nX t|d���}|jt|t� |j| j|t� |j||t� |j| j|t� |j| j |t� g }x^| j
D ]T}|j r�|j |j
|j|j|j tjj|j�|jf� q�|j t
|�|j|jd d d f� q�W |j||t� W d Q R X d S )Nr �wb)r� r� r� r� �dumpr� �pickle_protocolr� rZ r\ rX r� rb r7 r r r� r� r> r� r� )r r r r� ZoutfZoutpr� r r r
� pickle_table" s ,"z LRGeneratedTable.pickle_table)r N)rx rx )rx )r r r r r! r$ r' r) r+ r- r/ r0 r3 r6 r7 r8 r rB rF r r r r
r 5 s"
%#8 +P B
{r c C s0 t j| �}|jj� }|j|jkr,|j|j� |S )N)rn � _getframe� f_globals�copy�f_locals�update)Zlevelsr Zldictr r r
�get_caller_module_dictE s
rL c C s g }| j � }d }|}x�|D ]�}|d7 }|j� }|s4qy�|d dkrh|sVtd||f ��|} |dd � }
n@|d } | }|dd � }
|d } | dkr�| dkr�td||f ��|j||| |
f� W q tk
r� � Y q tk
r� td |||j� f ��Y qX qW |S )
Nrd r �|z%s:%d: Misplaced '|'r� �:z::=z!%s:%d: Syntax error. Expected ':'z %s:%d: Syntax error in rule %r)�
splitlinesr= rV rb � Exception�strip) �docr� r� r ZpstringsZlastpZdlineZpsr� r� r� Zassignr r r
�
parse_grammarQ s6
rS c @ s� e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � ZdS )!�
ParserReflectNc C sL || _ d | _d | _d | _t� | _g | _d| _|d krBtt j
�| _ n|| _ d S )NF) r� r� �
error_func�tokensr� r� r r r rn ro r )r r� r r r r
r { s zParserReflect.__init__c C s, | j � | j� | j� | j� | j� d S )N)� get_start�get_error_func�
get_tokens�get_precedence�get_pfunctions)r r r r
�get_all� s
zParserReflect.get_allc C s6 | j � | j� | j� | j� | j� | j� | jS )N)�validate_start�validate_error_func�validate_tokens�validate_precedence�validate_pfunctions�validate_modulesr )r r r r
� validate_all� s zParserReflect.validate_allc C s� g }yv| j r|j| j � | jr:|jdjdd� | jD ��� | jrR|jdj| j�� x$| jD ]}|d rZ|j|d � qZW W n ttfk
r� Y nX dj|�S )Nrx c S s g | ]}d j |��qS )rx )r� )r? r� r r r
r@ � s z+ParserReflect.signature.<locals>.<listcomp>ry r )r� rb r� r� rV �pfuncs� TypeError�
ValueError)r �partsr r r r
r � s zParserReflect.signaturec C s� t jd�}x�| jD ]�}ytj|�\}}W n tk
r> wY nX i }xjt|�D ]^\}}|d7 }|j|�}|rN|jd�}|j |�} | s�|||< qNtj
|�}
| j j d|
||| � qNW qW d S )Nz \s*def\s+(p_[a-zA-Z_0-9]*)\(rd z;%s:%d: Function %s redefined. Previously defined on line %d)
�re�compiler� �inspectZgetsourcelinesr< r� r� �groupr� �
getsourcefiler r ) r Zfrer� �linesZlinenZ counthashr� r� r �prevr r r r
rb � s$
z ParserReflect.validate_modulesc C s | j jd�| _d S )Nr� )r� r� r� )r r r r
rW � s zParserReflect.get_startc C s& | j d k r"t| j t�s"| jjd� d S )Nz'start' must be a string)r� rA � string_typesr r )r r r r
r] � s
z ParserReflect.validate_startc C s | j jd�| _d S )N�p_error)r� r� rU )r r r r
rX � s z ParserReflect.get_error_funcc C s� | j r�t| j tj�rd}n*t| j tj�r.d}n| jjd� d| _d S | j jj}| j jj }t
j | j �}| j j
|� | j jj| }|dkr�| jjd||� d| _d S )Nr rd z2'p_error' defined, but is not a function or methodTz$%s:%d: p_error() requires 1 argument)rU rA r� � FunctionType�
MethodTyper r �__code__�co_firstlineno� co_filenamerj � getmoduler� r� � co_argcount)r ZismethodZelineZefiler� Zargcountr r r
r^ � s
z!ParserReflect.validate_error_funcc C sr | j jd�}|s&| jjd� d| _d S t|ttf�sJ| jjd� d| _d S |sd| jjd� d| _d S t|�| _d S )NrV zNo token list is definedTz tokens must be a list or tupleztokens is empty) r� r� r r rA rg r� �sortedrV )r rV r r r
rY � s zParserReflect.get_tokensc C sZ d| j kr | jjd� d| _d S t� }x.| j D ]$}||krH| jjd|� |j|� q.W d S )Nr z.Illegal token name 'error'. Is a reserved wordTzToken %r multiply defined)rV r r r� r r� )r r� rB r r r
r_ s
z ParserReflect.validate_tokensc C s | j jd�| _d S )Nr� )r� r� r� )r r r r
rZ s z ParserReflect.get_precedencec C s g }| j �rt| j ttf�s2| jjd� d| _d S x�t| j �D ]�\}}t|ttf�sj| jjd� d| _d S t|�dk r�| jjd|� d| _d S |d }t|t�s�| jjd� d| _d S xH|dd � D ]8}t|t�s�| jjd � d| _d S |j |||d f� q�W q>W || _
d S )
Nz"precedence must be a list or tupleTzBad precedence tabler� z?Malformed precedence entry %s. Must be (assoc, term, ..., term)r z)precedence associativity must be a stringrd z precedence items must be strings) r� rA rg r� r r r� r ro rb �preclist)r ry r� r� r� r� r r r
r` s6
z!ParserReflect.validate_precedencec C s� g }xl| j j� D ]^\}}|jd� s|dkr.qt|tjtjf�rt|d|jj �}t
j |�}|j ||||j
f� qW |jdd� d� || _d S )N�p_rp rt c S s | d t | d �| d | d fS )Nr rd r� r )r7 )Z
p_functionr r r
r1 F s
z.ParserReflect.get_pfunctions.<locals>.<lambda>)�key)r� rf �
startswithrA r� rq rr rK rs rt rj rv rb �__doc__�sortrd )r Z p_functionsr �itemr� r� r r r
r[ 9 s
z ParserReflect.get_pfunctionsc C s^ g }t | j�dkr(| jjd� d| _d S �x"| jD �]\}}}}tj|�}| j| }t|tj �rfd}nd}|j
j |kr�| jjd|||j � d| _q2|j
j |k r�| jjd|||j � d| _q2|j
s�| jjd|||j � q2y,t|||�} x| D ]}
|j||
f� q�W W n: tk
�r< } z | jjt| �� d| _W Y d d } ~ X nX | jj|� q2W �x| jj� D ]�\} }
| jd ��r�t|
tjtj f��r��q\| jd
��r��q\| jd ��r�| d k�r�| jjd | � t|
tj��r�|
j
j dk�s�t|
tj ��r\|
jj
j dk�r\|
j
�r\y8|
j
jd
�}|d dk�r4| jjd|
j
j|
j
j| � W n t k
�rL Y nX �q\W || _ d S )Nr z+no rules of the form p_rulename are definedTr� rd z%%s:%d: Rule %r has too many argumentsz#%s:%d: Rule %r requires an argumentzA%s:%d: No documentation string specified in function %r (ignored)rz Zt_rp z %r not defined as a functionry rN z9%s:%d: Possible grammar rule %r defined without p_ prefix) r rd r r rj rl r� rA r� rr rs rw r r} r rS rb rV r7 r� r� rf r| rq �__func__r= ru rt r� r )r r r� r� r rR r� r� ZreqargsZparsed_gr" rA rB rD r r r
ra N s\
z!ParserReflect.validate_pfunctions)N)r r r r r\ rc r rb rW r] rX r^ rY r_ rZ r` r[ ra r r r r
rT z s
rT c
< O s� |d kr t }| rd}| d kr&ttj�} � r�� fdd�t� �D �}
t|
�}d|krdtj|d j|d< d|kr�d|kr�ttj|d d�r�tj|d j |d< nt
d�}| d k�r t |t j
�r�|j}nLd|kr�|d }n:|jd�}dj|d d6� �}td
| � ttj| dd �}tjj|�} |jd�}|�rNt |t��rNd|k�rN|d | }|d k �r`||d < t|| d
�}|j� |j�r�td��|j� }y�t � }| �r�|j | �}n
|j |�}|�s�||k�ry"|j |j � t!||j"�}|j#a#|S t$k
�r } z| j%d|� W Y d d }~X nX W nF t&k
�rH } z| j%t|�� W Y d d }~X n t'k
�r\ Y nX |
d k�r�|�r�y tt(tjj| |�d��}
W n< t)k
�r� } z | j%d||f � t*� }
W Y d d }~X nX nt*� }
|
j+dt,� d}|j-� �r�td��|j"�s| j%d� t.|j/�}xZ|j0D ]P\}} } y|j1|| | � W n0 t2k
�rb } z| j%d|� W Y d d }~X nX �qW xl|j3D ]b\} } | \} }!}"}#y|j4|"|#| | |!� W n4 t2k
�r� } z| jd|� d}W Y d d }~X nX �qrW y&|d k�r�|j5|j6� n
|j5|� W n6 t2k
�r4 } z| jt|�� d}W Y d d }~X nX |�rDtd��|j7� }$x*|$D ]"\}%}&| jd|&j8|&j9|%� d}�qRW |j:� }'|'�r�|
j+d � |
j+d� |
j+d � x&|'D ] }| j%d|� |
j+d|� �q�W |�r|
j+d � |
j+d� |
j+d � x&t;|j<�D ]\}(})|
j+d |(|)� �q�W |j=� }*x$|*D ] }&| j%d |&j8|&j9|&j>� �q&W t?|'�d k�r^| j%d � t?|'�d k�r|| j%d t?|'�� t?|*�d k�r�| j%d � t?|*�d k�r�| j%d!t?|*�� |�r�|
j+d � |
j+d"� |
j+d � t@|jA�}+|+jB� x2|+D ]*}|
j+d#|d$jd%d� |jA| D ��� �q�W |
j+d � |
j+d&� |
j+d � t@|jC�},|,jB� x2|,D ]*}-|
j+d#|-d$jd'd� |jC|- D ��� �qRW |
j+d � |�r�|jD� }.x|.D ]}/| j%d(|/� �q�W |jE� }0x |0D ]}1| jd)|1� d}�q�W |jF� }2x$|2D ] \}} | jd*| |� d}�q�W |�rtd��|�r*| jGd+| � tH|| |
�}|�r�t?|jI�}3|3d k�r\| j%d,� n|3d k�rr| j%d-|3� t?|jJ�}4|4d k�r�| j%d.� n|4d k�r�| j%d/|4� |�r�|jI�s�|jJ�r�|
j%d � |
j%d0� |
j%d � x&|jID ] \}5}6}7|
j%d1|6|5|7� �q�W tK� }8x�|jJD ]x\}5}9}:|5tL|9�tL|:�f|8k�r8�q|
j%d2|5|9� |
j%d3|:|5� | j%d2|5|9� | j%d3|:|5� |8jM|5tL|9�tL|:�f� �qW g };xL|jJD ]B\}5}9}:|:jN �r�|:|;k�r�|
j%d4|:� | j%d4|:� |;jO|:� �q�W |� rDy&|jP|| |� |tjk� r
tj|= W n6 t)k
� rB } z| j%d5||f � W Y d d }~X nX | � r�y|jQ| |� W n6 t)k
� r� } z| j%d5| |f � W Y d d }~X nX |j |j � t!||j"�}|j#a#|S )7Nr c s g | ]}|t � |�f�qS r )rK )r? r� )r� r r
r@ � s zyacc.<locals>.<listcomp>�__file__r � __package__r� r� rd z import %srx r� )r zUnable to build parserz.There was a problem loading the table file: %rr; zCouldn't open %r. %sz5Created by PLY version %s (http://www.dabeaz.com/ply)Fz no p_error() function is definedz%sTz;%s:%d: Symbol %r used, but not defined as a token or a rulezUnused terminals:z Token %r defined, but not usedz %sr� z Rule %-5d %sz$%s:%d: Rule %r defined, but not usedzThere is 1 unused tokenzThere are %d unused tokenszThere is 1 unused rulezThere are %d unused rulesz'Terminals, with rules where they appearz
%-20s : %sry c S s g | ] }t |��qS r )r7 )r? r= r r r
r@ M
s z*Nonterminals, with rules where they appearc S s g | ] }t |��qS r )r7 )r? r= r r r
r@ U
s zSymbol %r is unreachablez)Infinite recursion detected for symbol %rz0Precedence rule %r defined for unknown symbol %rzGenerating %s tablesz1 shift/reduce conflictz%d shift/reduce conflictsz1 reduce/reduce conflictz%d reduce/reduce conflictsz
Conflicts:z7shift/reduce conflict for %s in state %d resolved as %sz;reduce/reduce conflict in state %d resolved using rule (%s)z rejected rule (%s) in state %dzRule (%s) is never reducedzCouldn't create %r. %sr~ )R�
tab_moduler rn ro �dir�dictr� r� r� r� rL rA r� r� r= r� r� rK r� r� �dirnamer� r7 rT r\ r r r r� r r� r r� rW rU rv rP r r� r� r� r< r r � __version__rc r� rV ry r� r� r r� r� r� r� r� r� r� r� r� r� r r rg r� r~ r� r� r� r� r r r r r� r! r� r� rb rB rF )<r r r� r? r� Zcheck_recursion�optimizeZ write_tablesZ debugfiler@ ZdebuglogZerrorlogZ
picklefileZ_itemsr� Zsrcfilerg ZpkgnameZpkgZpinfor ZlrZread_signaturer3 rA �errorsr r� r� r� �funcnameZgramr� r� r� r� r� rc r� r� rB r� r� r, ZnontermsZnontermZ unreachable�ur� �infZ unused_precZnum_srZnum_rrri r� Z
resolutionZalready_reportedZruleZrejectedZ warned_neverr )r� r
�yacc� s�
"
$
*
*
$$ r� );rh r� rn Zos.pathr� rj r( r� r� Z yaccdebugZ
debug_filer� Z
default_lrr� rl r rE � version_infoZ
basestringro r7 �maxsizer �objectr r rP r r% r' r+ r/ r- r* r, r. r0 r4 r5 r9 rW ri r� r� r� r� r� r� r� r� r� r
r r r rL rS rT r� r r r r
�<module>> s�
7 m
H. rT
)
sepolgen/__pycache__/objectmodel.cpython-36.opt-1.pyc 0000644 00000007523 14751155147 0016465 0 ustar 00 3
�� fv � @ sp d Z ddddddddd g Zd
Zd Zd ZeeB Zeeeed
�ZedededediZG dd� d�ZG dd� d�Z dS )z�
This module provides knowledge object classes and permissions. It should
be used to keep this knowledge from leaking into the more generic parts of
the policy generation.
Zsocket�fdZprocess�fileZlnk_fileZ fifo_fileZdbusZ
capabilityZunix_stream_socket� � � )�n�r�w�br r r r c @ s e Zd ZdZdd� Zdd� ZdS )�PermMapa A mapping between a permission and its information flow properties.
PermMap represents the information flow properties of a single permission
including the direction (read, write, etc.) and an abstract representation
of the bandwidth of the flow (weight).
c C s || _ || _|| _d S )N)�perm�dir�weight)�selfr r r
� r �!/usr/lib/python3.6/objectmodel.py�__init__T s zPermMap.__init__c C s d| j t| j | jf S )Nz'<sepolgen.objectmodel.PermMap %s %s %d>)r �
dir_to_strr r
)r r r r �__repr__Y s zPermMap.__repr__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r
M s r
c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )� PermMappingsz�The information flow properties of a set of object classes and permissions.
PermMappings maps one or more classes and permissions to their PermMap objects
describing their information flow charecteristics.
c C s i | _ d| _t| _d S )N� )�classes�default_weight� FLOW_BOTH� default_dir)r r r r r d s zPermMappings.__init__c C s� d}x�|D ]�}|j � }t|�dks
t|�dks
|d dkr<q
|d dkrx|d }|| jkrbtd��i | j|< | j| }q
t|�dkr�td��|dkr�td ��t|d t|d t|d
��}|||j< q
W dS ) zsRead the permission mappings from a file. This reads the format used
by Apol in the setools suite.
Nr r �#�classzduplicate class in perm map� z"error in object classs permissionszpermission outside of classr )�split�lenr �
ValueErrorr
�
str_to_dir�intr )r r Zcur�lineZfields�c�pmr r r � from_filei s"
$
zPermMappings.from_filec C s | j | | S )z�Get the permission map for the object permission.
Returns:
PermMap representing the permission
Raises:
KeyError if the object or permission is not defined
)r )r �objr r r r �get� s zPermMappings.getc C s8 y| j | | }W n tk
r2 t|| j| j�S X |S )a Get the permission map for the object permission or a default.
getdefault is the same as get except that a default PermMap is
returned if the object class or permission is not defined. The
default is FLOW_BOTH with a weight of 5.
)r �KeyErrorr
r r )r r* r r( r r r �
getdefault� s
zPermMappings.getdefaultc C s, t }x"|D ]}| j||�}||jB }q
W |S )N)� FLOW_NONEr- r )r r* �permsr r r( r r r �getdefault_direction� s
z!PermMappings.getdefault_directionc C s, d}x"|D ]}| j ||�}||j7 }q
W |S )Nr )r- r
)r r* r/ Ztotalr r( r r r �getdefault_distance� s
z PermMappings.getdefault_distanceN)
r r r r r r) r+ r- r0 r1 r r r r r ^ s
r N)
r Zimplicitly_typed_objectsr. Z FLOW_READZ
FLOW_WRITEr r$ r r
r r r r r �<module> s
sepolgen/__pycache__/yacc.cpython-36.opt-1.pyc 0000644 00000151423 14751155147 0015114 0 ustar 00 3
�� fd �
@ s
d dl Z d dlZd dlZd dlZd dlZd dlZdZdZdZ dZ
dZ dZ dZ
d Zd
Zd Zejd dk rleZneZejZG d d � d e�ZG d
d� de�ZG dd� de�Zdd� Z dd� Z da da da dZ!dd� Z"dd� Z#dd� Z$d d � Z%G d d � d �Z&G d d!� d!�Z'G d"d#� d#�Z(e j)d$�Z*G d%d&� d&e�Z+G d'd(� d(e�Z,G d)d*� d*e�Z-d+d,� Z.G d-d.� d.e�Z/G d/d0� d0e�Z0G d1d2� d2e�Z1G d3d4� d4e�Z2d5d6� Z3d7d8� Z4G d9d:� d:e�Z5G d;d<� d<e2�Z6d=d>� Z7d?d@� Z8G dAdB� dBe�Z9de de ddd de
ddddf
dCdD�Z:dS )E� Nz3.11z3.10Tz
parser.out�parsetab�LALR� F�( c @ s4 e Zd Zdd� Zdd� ZeZdd� Zdd� ZeZd S )
� PlyLoggerc C s
|| _ d S )N)�f)�selfr � r �/usr/lib/python3.6/yacc.py�__init__m s zPlyLogger.__init__c O s | j j|| d � d S )N�
)r �write)r �msg�args�kwargsr r r
�debugp s zPlyLogger.debugc O s | j jd|| d � d S )Nz WARNING: r )r r
)r r r r r r r
�warningu s zPlyLogger.warningc O s | j jd|| d � d S )NzERROR: r )r r
)r r r r r r r
�errorx s zPlyLogger.errorN) �__name__�
__module__� __qualname__r r �infor r Zcriticalr r r r
r l s r c @ s e Zd Zdd� Zdd� ZdS )�
NullLoggerc C s | S )Nr )r �namer r r
�__getattribute__ s zNullLogger.__getattribute__c O s | S )Nr )r r r r r r
�__call__� s zNullLogger.__call__N)r r r r r r r r r
r ~ s r c @ s e Zd ZdS )� YaccErrorN)r r r r r r r
r � s r c C sP t | �}d|krt |�}t|�tkr4|d t� d }dt| �jt| �|f }|S )Nr z ...z<%s @ 0x%x> (%s))�repr�len� resultlimit�typer �id)�r�repr_str�resultr r r
�
format_result� s r% c C sB t | �}d|krt |�}t|�dk r(|S dt| �jt| �f S d S )Nr � z <%s @ 0x%x>)r r r r r! )r" r# r r r
�format_stack_entry� s r' a PLY: Don't use global functions errok(), token(), and restart() in p_error().
Instead, invoke the methods on the associated parser instance:
def p_error(p):
...
# Use parser.errok(), parser.token(), parser.restart()
...
parser = yacc.yacc()
c C s t jt� t� S )N)�warnings�warn�_warnmsg�_errokr r r r
�errok� s
r, c C s t jt� t� S )N)r( r) r* �_restartr r r r
�restart� s
r. c C s t jt� t� S )N)r( r) r* �_tokenr r r r
�token� s
r0 c C s> |j a|ja|ja| |�}y
bbbW n tk
r8 Y nX |S )N)r, r+ r0 r/ r. r- � NameError)� errorfuncr0 �parserr" r r r
�call_errorfunc� s
r4 c @ s e Zd Zdd� Zdd� ZdS )�
YaccSymbolc C s | j S )N)r )r r r r
�__str__� s zYaccSymbol.__str__c C s t | �S )N)�str)r r r r
�__repr__� s zYaccSymbol.__repr__N)r r r r6 r8 r r r r
r5 � s r5 c @ sn e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� ZdS )�YaccProductionNc C s || _ || _d | _d | _d S )N)�slice�stack�lexerr3 )r �sr; r r r
r � s zYaccProduction.__init__c C sB t |t�r dd� | j| D �S |dkr2| j| jS | j| jS d S )Nc S s g | ]
}|j �qS r )�value)�.0r= r r r
�
<listcomp>� s z.YaccProduction.__getitem__.<locals>.<listcomp>r )�
isinstancer: r> r; )r �nr r r
� __getitem__� s
zYaccProduction.__getitem__c C s || j | _d S )N)r: r> )r rB �vr r r
� __setitem__� s zYaccProduction.__setitem__c C s dd� | j ||� D �S )Nc S s g | ]
}|j �qS r )r> )r? r= r r r
r@ � s z/YaccProduction.__getslice__.<locals>.<listcomp>)r: )r �i�jr r r
� __getslice__� s zYaccProduction.__getslice__c C s
t | j�S )N)r r: )r r r r
�__len__� s zYaccProduction.__len__c C s t | j| dd�S )N�linenor )�getattrr: )r rB r r r
rJ s zYaccProduction.linenoc C s || j | _d S )N)r: rJ )r rB rJ r r r
�
set_lineno s zYaccProduction.set_linenoc C s, t | j| dd�}t | j| d|�}||fS )NrJ r � endlineno)rK r: )r rB � startlineZendliner r r
�linespan s zYaccProduction.linespanc C s t | j| dd�S )N�lexposr )rK r: )r rB r r r
rP s zYaccProduction.lexposc C s || j | _d S )N)r: rP )r rB rP r r r
�
set_lexpos s zYaccProduction.set_lexposc C s, t | j| dd�}t | j| d|�}||fS )NrP r � endlexpos)rK r: )r rB �startpos�endposr r r
�lexspan s zYaccProduction.lexspanc C s t �d S )N)� SyntaxError)r r r r
r s zYaccProduction.error)N)r r r r rC rE rH rI rJ rL rO rP rQ rU r r r r r
r9 � s
r9 c @ s\ e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zdd
d�Zddd�Z ddd�Z
ddd�Z d S )�LRParserc C s0 |j | _|j| _|j| _|| _| j� d| _d S )NT) �lr_productions� productions� lr_action�action�lr_goto�gotor2 �set_defaulted_states�errorok)r ZlrtabZerrorfr r r
r s zLRParser.__init__c C s
d| _ d S )NT)r_ )r r r r
r, ( s zLRParser.errokc C s@ | j d d �= | jd d �= t� }d|_| jj|� | j jd� d S )Nz$endr )�
statestack�symstackr5 r �append)r �symr r r
r. + s zLRParser.restartc C sT i | _ xH| jj� D ]:\}}t|j� �}t|�dkr|d dk r|d | j |< qW d S )N� r )�defaulted_statesr[ �items�list�valuesr )r �state�actionsZrulesr r r
r^ ; s
z LRParser.set_defaulted_statesc C s
i | _ d S )N)re )r r r r
�disable_defaulted_statesB s z!LRParser.disable_defaulted_statesNFc C sZ |st r.t|t�r ttj�}| j|||||�S |rD| j|||||�S | j|||||�S d S )N) � yaccdevelrA �intr �sys�stderr�
parsedebug�parseopt�parseopt_notrack)r �inputr< r �tracking� tokenfuncr r r
�parseE s
zLRParser.parsec C s� d }g }| j }| j} | j}
| j} td �} d}
|jd� |sLddlm} |j}|| _| | _ |d k rj|j
|� |d krz|j }n|}|| _ g }|| _ g }|| _
|| _d }|jd� t� }d|_|j|� d}�x�|jd� |jd|� || k�r.|�s|� s�|� }n|j� }|�st� }d|_|j}|| j|�}n| | }|jd|| � |jd d
d jd d
� |D �dd � �t|�f j� � |d k �r�|dk�r�|j|� |}|jd|� |j|� d }|
r�|
d8 }
q�|dk �rN|
| }|j}|j}t� }||_d |_|�rB|jd|jddjdd
� || d � D �� d | |d%| | � n |jd|jg | |d& | � |�r�|| d d � }||d< |�r�|d }|j|_|j |_ |d' }t |d|j�|_ t |d|j �|_ || _ yd|| d �= || _!|j"| � || d �= |jdt#| d �� |j|� | |d( | }|j|� W q� t$k
�r� |j|� |j%|dd)� � |j� |d* }d|_d|_|}t&}
d| _'Y q�X q�n�|�r�|j|_|j |_ |g}|| _ yL|| _!|j"| � |jdt#| d �� |j|� | |d+ | }|j|� W q� t$k
�rJ |j|� |j� |d, }d|_d|_|}t&}
d| _'Y q�X q�|dk�r�|d- } t | dd �} |jdt#| �� |jd� | S |d k�r�|j(d d
d jd d
� |D �dd � �t|�f j� � |
dk�s�| j'�r�t&}
d| _'|}|jdk�r�d }| j)�rB|�rt*|d � �r||_|| _!t+| j)|| �} | j'�r�| }d }q�n`|�r�t*|d ��r\|j} nd} | �r~t,j-j.d | |jf � nt,j-j.d!|j � nt,j-j.d"� d S nt&}
t|�dk�r�|jdk�r�d }d }d}|d d �= q�|jdk�r�d S |jdk�r�|d. }|jdk�r6|�r0t |d |j�|_ t |d#|j �|_ d }q�t� }d|_t*|d ��r\|j |_|_ t*|d#��rv|j |_ |_ ||_|j|� |}q�|j� }|�r�|j|_|j |_ |j� |d/ }q�t/d$��q�W d S )0Nr zPLY: PARSE DEBUG STARTrd )�lexz$end� z State : %sz#Defaulted state %s: Reduce using %dz Stack : %sz%s . %s� c S s g | ]
}|j �qS r )r )r? �xxr r r
r@ � s z'LRParser.parsedebug.<locals>.<listcomp>z Action : Shift and goto state %sz3Action : Reduce rule [%s] with %s and goto state %d�[�,c S s g | ]}t |j��qS r )r' r> )r? Z_vr r r
r@ � s �]rM rR z Result : %sr Fr> zDone : Returning %szPLY: PARSE DEBUG ENDz Error : %sc S s g | ]
}|j �qS r )r )r? rz r r r
r@ D s r< rJ z(yacc: Syntax error at line %d, token=%s
z yacc: Syntax error, token=%sz yacc: Parse error in input. EOF
rP z yacc: internal parser error!!!
���r~ r~ r~ r~ r~ r~ r~ r~ r~ r~ )0r[ r] rY re r9 r rx rw r< r3 rs r0 r` ra r; rb r5 r r �pop�get�joinr7 �lstripr r r> rJ rP rK rM rR r: ri �callabler% rV �extend� error_countr_ r r2 �hasattrr4 rn ro r
� RuntimeError) r rs r< r rt ru � lookahead�lookaheadstackrj r] �prodre �pslice�
errorcountrw � get_tokenr` ra �errtokenrc ri �ltype�t�p�pname�plen�targ�t1rB r$ �tokrJ r r r
rp ^ s~
.
$
.
zLRParser.parsedebugc C sv d }g }| j }| j} | j}
| j} td �} d}
|sBddlm} |j}|| _| | _|d k r`|j |� |d krp|j
}n|}|| _
g }|| _ g }|| _ || _
d }|jd� t� }d|_|j|� d}�x�|| k�r|s�|s�|� }n|j� }|s�t� }d|_|j}|| j|�}n| | }|d k �rh|dk�rN|j|� |}|j|� d }|
r�|
d8 }
q�|dk �rF|
| }|j}|j}t� }||_d |_|�r�|| d d � }||d< |�r�|d }|j|_|j|_|d }t|d|j�|_t|d|j�|_|| _yP|| d �= || _ |j | � || d �= |j|� | |d | }|j|� W q� t k
�r� |j|� |j |dd� � |j� |d }d|_d|_|}t }
d| _!Y q�X q�n�|�r�|j|_|j|_|g}|| _y8|| _ |j | � |j|� | |d | }|j|� W q� t k
�rB |j|� |j� |d }d|_d|_|}t }
d| _!Y q�X q�|dk�rh|d } t| d d �} | S |d k�rf|
dk�s�| j!�rNt }
d| _!|}|jdk�r�d }| j"�r�|�r�t#|d
� �r�||_|| _ t$| j"|| �} | j!�rL| }d }q�n`|�r<t#|d ��r|j} nd} | �r(t%j&j'd | |jf � nt%j&j'd
|j � nt%j&j'd� d S nt }
t|�dk�r�|jdk�r�d }d }d}|d d �= q�|jdk�r�d S |jdk�r6|d }|jdk�r�|�r�t|d |j�|_t|d|j�|_d }q�t� }d|_t#|d ��r|j |_|_t#|d��r |j |_|_||_|j|� |}q�|j� }|�rT|j|_|j|_|j� |d }q�t(d��q�W d S )Nr rd )rw z$endrM rR r Fr> r< rJ z(yacc: Syntax error at line %d, token=%s
z yacc: Syntax error, token=%sz yacc: Parse error in input. EOF
rP z yacc: internal parser error!!!
r~ r~ r~ r~ r~ r~ r~ r~ r~ ))r[ r] rY re r9 rx rw r< r3 rs r0 r` ra r; rb r5 r r r� r r r> rJ rP rK rM rR r: ri r� rV r� r� r_ r2 r� r4 rn ro r
r� ) r rs r< r rt ru r� r� rj r] r� re r� r� rw r� r` ra r� rc ri r� r� r� r� r� r� r� rB r$ r� rJ r r r
rq � sX
zLRParser.parseoptc C s� d }g }| j }| j} | j}
| j} td �} d}
|sBddlm} |j}|| _| | _|d k r`|j |� |d krp|j
}n|}|| _
g }|| _ g }|| _ || _
d }|jd� t� }d|_|j|� d}�x|| k�r|s�|s�|� }n|j� }|s�t� }d|_|j}|| j|�}n| | }|d k �r |dk�rN|j|� |}|j|� d }|
r�|
d8 }
q�|dk �r�|
| }|j}|j}t� }||_d |_|�rX|| d d � }||d< || _yP|| d �= || _|j| � || d �= |j|� | |d | }|j|� W q� tk
�rR |j|� |j|dd� � |j� |d }d|_d|_|}t}
d| _ Y q�X q�n�|g}|| _y8|| _|j| � |j|� | |d | }|j|� W q� tk
�r� |j|� |j� |d }d|_d|_|}t}
d| _ Y q�X q�|dk�r |d }t |dd �} | S |d k�r�|
dk�s(| j �r�t}
d| _ |}|jdk�rFd }| j �r�|�rht |d� �rh||_|| _t | j || �} | j �r�| }d }q�n`|�r�t |d ��r�|j!} nd} | �r�t"j#j$d
| |jf � nt"j#j$d |j � nt"j#j$d � d S nt}
t|�dk�r(|jdk�r(d }d }d}|d d �= q�|jdk�r8d S |jdk�r�|d }|jdk�r^d }q�t� }d|_t |d ��r�|j! |_!|_%t |d
��r�|j& |_&|_'||_|j|� |}q�|j� }|j� |d }q�t(d��q�W d S )Nr rd )rw z$endr Fr> r< rJ z(yacc: Syntax error at line %d, token=%s
z yacc: Syntax error, token=%sz yacc: Parse error in input. EOF
rP z yacc: internal parser error!!!
r~ r~ r~ r~ r~ r~ r~ r~ ))r[ r] rY re r9 rx rw r< r3 rs r0 r` ra r; rb r5 r r r� r r r> r: ri r� rV r� r� r_ rK r2 r� r4 rJ rn ro r
rM rP rR r� ) r rs r< r rt ru r� r� rj r] r� re r� r� rw r� r` ra r� rc ri r� r� r� r� r� r� rB r$ r� rJ r r r
rr � s8
zLRParser.parseopt_notrack)NNFFN)NNFFN)NNFFN)NNFFN) r r r r r, r. r^ rk rv rp rq rr r r r r
rW s
]
4rW z^[a-zA-Z0-9_-]+$c @ sR e Zd ZdZddd�Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dS )�
Productionr �rightNrx c C s� || _ t|�| _|| _|| _d | _|| _|| _|| _t | j�| _ g | _
x$| jD ]}|| j
krN| j
j |� qNW g | _ d | _
| jr�d| j dj| j�f | _n d| j | _d S )Nz%s -> %sry z
%s -> <empty>)r �tupler� �number�funcr� �file�line�precr �usymsrb �lr_items�lr_nextr� r7 ) r r� r r� �
precedencer� r� r� r= r r r
r ! s$
zProduction.__init__c C s | j S )N)r7 )r r r r
r6 ? s zProduction.__str__c C s dt | � d S )Nz Production(�))r7 )r r r r
r8 B s zProduction.__repr__c C s
t | j�S )N)r r� )r r r r
rI E s zProduction.__len__c C s dS )Nrd r )r r r r
� __nonzero__H s zProduction.__nonzero__c C s
| j | S )N)r� )r �indexr r r
rC K s zProduction.__getitem__c C s� |t | j�krd S t| |�}y| j|j|d |_W n ttfk
rT g |_Y nX y|j|d |_W n tk
r� d |_Y nX |S )Nrd )r r� �LRItem� Prodnames�lr_after�
IndexError�KeyError� lr_before)r rB r� r r r
�lr_itemO s
zProduction.lr_itemc C s | j r|| j | _d S )N)r� r� )r �pdictr r r
�bind_ s zProduction.bind�r� r )r� Nrx r ) r r r �reducedr r6 r8 rI r� rC r� r� r r r r
r� s
r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�MiniProductionc C s. || _ || _|| _d | _|| _|| _|| _d S )N)r r r� r� r� r� r7 )r r7 r r r� r� r� r r r
r h s zMiniProduction.__init__c C s | j S )N)r7 )r r r r
r6 q s zMiniProduction.__str__c C s
d| j S )NzMiniProduction(%s))r7 )r r r r
r8 t s zMiniProduction.__repr__c C s | j r|| j | _d S )N)r� r� )r r� r r r
r� x s zMiniProduction.bindN)r r r r r6 r8 r� r r r r
r� g s r� c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )r� c C sZ |j | _ t|j�| _|j| _|| _i | _| jj|d� t| j�| _t| j�| _|j | _ d S )N�.)
r rg r� r� �lr_index�
lookaheads�insertr� r r� )r r� rB r r r
r � s zLRItem.__init__c C s, | j r d| jdj| j �f }n
d| j }|S )Nz%s -> %sry z
%s -> <empty>)r� r r� )r r= r r r
r6 � s
zLRItem.__str__c C s dt | � d S )NzLRItem(r� )r7 )r r r r
r8 � s zLRItem.__repr__N)r r r r r6 r8 r r r r
r� � s r� c C s: t | �d }x(|dkr4| | |kr*| | S |d8 }qW d S )Nrd r )r )Zsymbols� terminalsrF r r r
�rightmost_terminal� s
r� c @ s e Zd ZdS )� GrammarErrorN)r r r r r r r
r� � s r� c @ s� e Zd Zdd� Zdd� Zdd� Zdd� Zd$d d
�Zd%dd�Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zd d � Zd d � Zd&d d!�Zd"d#� Zd S )'�Grammarc C sf d g| _ i | _i | _i | _x|D ]}g | j|< q W g | jd< i | _i | _i | _i | _t� | _ d | _
d S )Nr ) � Productionsr� �Prodmap� Terminals� Nonterminals�First�Follow�
Precedence�set�UsedPrecedence�Start)r r� �termr r r
r � s
zGrammar.__init__c C s
t | j�S )N)r r� )r r r r
rI � s zGrammar.__len__c C s
| j | S )N)r� )r r� r r r
rC � s zGrammar.__getitem__c C s8 || j krtd| ��|dkr&td��||f| j |< d S )Nz,Precedence already specified for terminal %r�leftr� �nonassocz:Associativity must be one of 'left','right', or 'nonassoc')r� r� r� )r� r� )r r� �assoc�levelr r r
�set_precedence� s
zGrammar.set_precedenceNrx r c C s� || j kr td|||f ��|dkr6td|||f ��tj|�sRtd|||f ��x�t|�D ]�\}}|d dkr�yJt|�}t|�dkr�td||||f ��|| j kr�g | j |< |||< w\W n tk
r� Y nX tj|� r\|d kr\td
||||f ��q\W d |k�r�|d d k�r$td ||f ��|d d k�rBtd
||f ��|d } | jj | �}
|
�sptd||| f ��n | j
j | � |dd �= nt || j �} | jj | d�}
d||f } | | j
k�r�| j
| } td||| f d| j| jf ��t| j�}
|| jk�rg | j|< xR|D ]J}|| j k�r.| j | j|
� n&|| jk�rDg | j|< | j| j|
� �q W t|
|||
|||�}| jj|� || j
| < y| j| j|� W n" tk
�r� |g| j|< Y nX d S )Nz7%s:%d: Illegal rule name %r. Already defined as a tokenr z5%s:%d: Illegal rule name %r. error is a reserved wordz%s:%d: Illegal rule name %rr z'"rd zA%s:%d: Literal token %s in rule %r may only be a single characterz%precz!%s:%d: Illegal name %r in rule %rz+%s:%d: Syntax error. Nothing follows %%prec� zH%s:%d: Syntax error. %%prec can only appear at the end of a grammar rulez/%s:%d: Nothing known about the precedence of %rr� z%s -> %sz%s:%d: Duplicate rule %s. z Previous definition at %s:%dr~ ���r~ r� )r� r )r� r� �_is_identifier�match� enumerate�evalr rV r� r� r� �addr� r� r� r� r� r� rb r� r� r� )r �prodname�symsr� r� r� rB r= �cZprecnameZprodprec�map�mZpnumberr� r� r r r
�add_production sp
zGrammar.add_productionc C sT |s| j d j}|| jkr&td| ��tdd|g�| j d< | j| jd� || _d S )Nrd zstart symbol %s undefinedr zS')r� r r� r� r� rb r� )r �startr r r
� set_startc s
zGrammar.set_startc s> � ��fdd�� t � �� �jd jd � �fdd��jD �S )Nc sJ | �kr d S �j | � x.�jj| g �D ] }x|jD ] }� |� q2W q&W d S )N)r� r� r� r� )r= r� r" )�mark_reachable_from� reachabler r r
r� v s
z5Grammar.find_unreachable.<locals>.mark_reachable_fromr c s g | ]}|� kr|�qS r r )r? r= )r� r r
r@ � s z,Grammar.find_unreachable.<locals>.<listcomp>)r� r� r� r� )r r )r� r� r r
�find_unreachables s zGrammar.find_unreachablec C s� i }x| j D ] }d||< q W d|d< x| jD ] }d||< q,W xpd}x`| jj� D ]R\}}xH|D ]@}x |jD ]}|| shd}P qhW d}|r\|| s�d||< d}P q\W qNW |s>P q>W g } x@|j� D ]4\}}
|
s�|| jkr�|| j kr�|dkr�q�| j|� q�W | S )NTz$endFr )r� r� r� rf r� rb ) r Z
terminatesr� rB � some_changeZplr� r= Z p_terminates�infiniter� r r r
�infinite_cycles� s:
zGrammar.infinite_cyclesc C sX g }xN| j D ]D}|sq x8|jD ].}|| jkr || jkr |dkr |j||f� q W q W |S )Nr )r� r� r� r� rb )r r$ r� r= r r r
�undefined_symbols� s zGrammar.undefined_symbolsc C s8 g }x.| j j� D ] \}}|dkr| r|j|� qW |S )Nr )r� rf rb )r Z
unused_tokr= rD r r r
�unused_terminals� s
zGrammar.unused_terminalsc C s< g }x2| j j� D ]$\}}|s| j| d }|j|� qW |S )Nr )r� rf r� rb )r Z unused_prodr= rD r� r r r
� unused_rules� s zGrammar.unused_rulesc C sD g }x:| j D ]0}|| jkp"|| jks |j|| j | d f� q W |S )Nr )r� r� r� rb )r ZunusedZtermnamer r r
�unused_precedence� s
zGrammar.unused_precedencec C s` g }xV|D ]D}d}x2| j | D ]$}|dkr0d}q ||kr |j|� q W |rLq
P q
W |jd� |S )NFz<empty>T)r� rb )r Zbetar$ �xZx_produces_emptyr r r r
�_first s
zGrammar._firstc C s� | j r | j S x| jD ]}|g| j |< qW dg| j d< x| jD ]}g | j |< q<W xjd}xZ| jD ]P}xJ| j| D ]<}x6| j|j�D ]&}|| j | kr~| j | j|� d}q~W qlW q\W |sPP qPW | j S )Nz$endFT)r� r� r� r� r� r� rb )r r� rB r� r� r r r r
�
compute_first. s$ zGrammar.compute_firstc
C sV | j r | j S | js| j� x| jD ]}g | j |< q"W |sD| jd j}dg| j |< � x�d}x�| jdd � D ]�}x�t|j�D ]�\}}|| jkrx| j|j|d d � �}d}xB|D ]:} | dkr�| | j | kr�| j | j | � d}| dkr�d}q�W |�s|t
|j�d krxx:| j |j D ]*} | | j | k�r| j | j | � d}�qW qxW qhW |sTP qTW | j S )Nrd z$endFz<empty>T) r� r� r� r� r� r r� r� r� rb r )
r r� �k�didaddr� rF �BZfstZhasemptyr r r r
�compute_followS s<
zGrammar.compute_followc C s� x�| j D ]�}|}d}g }x�|t|�kr,d }ntt||�}y| j|j|d |_W n ttfk
rn g |_Y nX y|j|d |_W n tk
r� d |_Y nX ||_ |s�P |j
|� |}|d7 }qW ||_ qW d S )Nr rd ) r� r r� r� r� r� r� r� r� r� rb r� )r r� ZlastlrirF r� Zlrir r r
�
build_lritems� s.
zGrammar.build_lritems)Nrx r )N)N)r r r r rI rC r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r
r� � s $
T
@#%
;r� c @ s e Zd ZdS )� VersionErrorN)r r r r r r r
r� � s r� c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�LRTablec C s d | _ d | _d | _d | _d S )N)rZ r\ rX � lr_method)r r r r
r � s zLRTable.__init__c C s~ t |tj�r|}ntd| � tj| }|jtkr:td��|j | _
|j | _ g | _
x |jD ]}| j
jt|� � qXW |j| _|jS )Nz import %sz&yacc table file version is out of date)rA �types�
ModuleType�execrn �modulesZ _tabversion�__tabversion__r� Z
_lr_actionrZ Z_lr_gotor\ rX Z_lr_productionsrb r� Z
_lr_methodr� Z
_lr_signature)r �moduler r� r r r
�
read_table� s
zLRTable.read_tablec C s� y dd l }W n tk
r( dd l}Y nX tjj|�s:t�t|d�}|j|�}|tkr^t d��|j|�| _
|j|�}|j|�| _ |j|�| _ |j|�}g | _
x |D ]}| j
jt|� � q�W |j� |S )Nr �rbz&yacc table file version is out of date)�cPickle� ImportError�pickle�os�path�exists�open�loadr� r� r� rZ r\ rX rb r� �close)r �filenamer� Zin_fZ
tabversion� signaturerY r� r r r
� read_pickle� s(
zLRTable.read_picklec C s x| j D ]}|j|� qW d S )N)rX r� )r r� r� r r r
�bind_callables� s zLRTable.bind_callablesN)r r r r r� r r r r r r
r� � s r� c C sT i }x| D ] }d||< q
W g }i }x,| D ]$}|| dkr(t ||||| ||� q(W |S )Nr )�traverse)�X�R�FP�Nr� r; �Fr r r
�digraph s
r c C s |j | � t|�}||| < || �|| < || �}xr|D ]j} || dkrXt| ||||||� t|| || �|| < x.|j| g �D ] }
|
|| kr||| j |
� q|W q4W || |k�rt||d < || ||d < |j� } x2| | k�rt||d < || ||d < |j� } q�W d S )Nr rd r~ r~ r~ r~ )rb r r �minr� �MAXINTr ) r� r r; r r r r �d�rel�y�a�elementr r r
r s(
r c @ s e Zd ZdS )� LALRErrorN)r r r r r r r
r + s r c @ s� e Zd Zd$dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd � Zd d � Zd%d d!�Zd&d"d#�ZdS )'�LRGeneratedTabler Nc C s� |dkrt d| ��|| _|| _|s*t� }|| _i | _i | _|j| _i | _ i | _
d| _ d| _ d| _
g | _g | _g | _| jj� | jj� | jj� | j� d S )N�SLRr zUnsupported method %sr )r r )r �grammarr� r �logrZ r\ r� rX �
lr_goto_cache� lr0_cidhash�
_add_countZ sr_conflictZ rr_conflictZ conflicts� sr_conflicts� rr_conflictsr� r� r� �lr_parse_table)r r �methodr r r r
r 6 s,
zLRGeneratedTable.__init__c C sz | j d7 _ |d d � }d}xV|rtd}xH|D ]@}x:|jD ]0}t|dd�| j krRq:|j|j� | j |_d}q:W q.W q W |S )Nrd TF� lr0_addedr )r r� rK rb r� r )r �I�Jr� rG r� r r r
� lr0_closure[ s
z LRGeneratedTable.lr0_closurec C s� | j jt|�|f�}|r |S | j j|�}|s:i }|| j |< g }xP|D ]H}|j}|rD|j|krD|jt|��}|s~i }||t|�< |j|� |}qDW |jd�}|s�|r�| j|�}||d< n||d< || j t|�|f< |S )Nz$end)r r� r! r� r� rb r ) r r r� �gr= Zgsr� rB �s1r r r
�lr0_gotou s2
zLRGeneratedTable.lr0_gotoc C s� | j | jjd jg�g}d}x"|D ]}|| jt|�< |d7 }q"W d}x�|t|�k r�|| }|d7 }i }x$|D ] }x|jD ] }d ||< qxW qlW xJ|D ]B}| j||�}| s�t|�| jkr�q�t|�| jt|�< |j |� q�W qFW |S )Nr rd )
r r r� r� r r! r r� r# rb ) r �CrF r Zasyms�iir= r� r! r r r
� lr0_items� s(
zLRGeneratedTable.lr0_itemsc C s� t � }d}xrxV| jjdd � D ]B}|jdkr:|j|j� q x$|jD ]}||krBP qBW |j|j� q W t|�|krrP t|�}q W |S )Nr rd )r� r r� r r� r r� )r �nullableZ num_nullabler� r� r r r
� compute_nullable_nonterminals� s
z.LRGeneratedTable.compute_nullable_nonterminalsc C sr g }xht |�D ]\\}}xR|D ]J}|j|jd k r ||j|jd f}|d | jjkr ||kr |j|� q W qW |S )Nrd )r� r� r r� r r� rb )r r$ �transZstatenori r� r� r r r
� find_nonterminal_transitions� s
z-LRGeneratedTable.find_nonterminal_transitionsc
C s� |\}}g }| j || |�}xJ|D ]B}|j|jd k r"|j|jd } | | jjkr"| |kr"|j| � q"W |dkr�|| jjd jd kr�|jd� |S )Nrd r z$end)r# r� r r� r r� rb r� )
r r$ r) r' ri r �termsr! r� r r r r
� dr_relation s
z LRGeneratedTable.dr_relationc C sv g }|\}}| j || |�}| jjt|�d�}xB|D ]:} | j| jd k r4| j| jd }
|
|kr4|j||
f� q4W |S )Nrd r~ )r# r r� r! r� r r� rb ) r r$ r) �emptyr
ri r r! rG r� r r r r
�reads_relation s
z LRGeneratedTable.reads_relationc C s� i }i }i }x|D ] }d||< qW �x�|D �]�\}} g }
g } �xR|| D �]D} | j | krZqH| j}
|}x�|
| jd k �r
|
d }
| j|
}||f|kr�|
d }xH|| jk r�| j| | jjkr�P | j| |kr�P |d }q�W | j||f� | j|| |�}| jj t
|�d�}qfW x�|| D ]t}|j | j k�r,�q|j| jk�r>�qd}xD||jk �rx|j| | j|d k�rlP |d }�qDW |
j||f� �qW qHW x2| D ]*}||k�r�g ||< || j|| f� �q�W |
||| f< q*W ||fS )Nrd r r~ ) r r� r r� r r� rb r# r r� r! )r r$ r) r' ZlookdictZ includedictZdtransr� ri r ZlookbZincludesr� r� rG Zlir! r" rF r r r
�compute_lookback_includesD sX
z*LRGeneratedTable.compute_lookback_includesc s0 � ��fdd�}� ��fdd�}t |||�}|S )Nc s �j � | ��S )N)r, )r� )r$ r' r r r
�<lambda>� s z4LRGeneratedTable.compute_read_sets.<locals>.<lambda>c s �j � | ��S )N)r. )r� )r$ r' r r r
r0 � s )r )r r$ �ntransr' r r r r )r$ r' r r
�compute_read_sets� s z"LRGeneratedTable.compute_read_setsc s( �fdd�}� fdd�}t |||�}|S )Nc s � | S )Nr )r� )�readsetsr r
r0 � s z6LRGeneratedTable.compute_follow_sets.<locals>.<lambda>c s � j | g �S )N)r� )r� )�inclsetsr r
r0 � s )r )r r1 r3 r4 r r r r )r4 r3 r
�compute_follow_sets� s z$LRGeneratedTable.compute_follow_setsc C sx xr|j � D ]f\}}x\|D ]T\}}||jkr4g |j|< |j|g �}x*|D ]"}||j| krF|j| j|� qFW qW q
W d S )N)rf r� r� rb ) r Z lookbacksZ followsetr) Zlbri r� r r r r r
�add_lookaheads� s
z LRGeneratedTable.add_lookaheadsc C sP | j � }| j|�}| j|||�}| j|||�\}}| j|||�}| j||� d S )N)r( r* r2 r/ r5 r6 )r r$ r' r) r3 ZlookdZincludedZ
followsetsr r r
�add_lalr_lookaheads� s
z$LRGeneratedTable.add_lalr_lookaheadsc $ C s8 | j j}| j j}| j}| j}| j}i }|jd| j� | j� }| jdkrP| j |� d}�x�|D �]�} g }
i } i } i }
|jd� |jd|� |jd� x | D ]}|jd|j
|� q�W |jd� �x| D �]�}|j |j d k�r(|j
dkr�d| d < || d < �q�| jdk�r|j| }n| j j|j
}�x�|D �]�}|
j||d
|j
|f f� | j|�}|d k �r�|dk�r>|j|d�\}}||j
j\}}||k �s�||k�r�|d k�r�|j
| |< || |< | �r�| �r�|jd
|� | jj||df� ||j
jd7 _nB||k�r|dk�rd | |< n$|�s�|jd|� | jj||df� n�|dk �r�|| }||j
}|j|jk�r�|j
| |< || |< || }}||j
jd7 _||j
jd8 _n
|| }}| jj|||f� |jd|| | j
| | � n td| ��n(|j
| |< || |< ||j
jd7 _�q&W q�|j }|j|d }|| j jkr�| j| |�}| jjt |�d�} | dkr�|
j||d| f� | j|�}|d k �r�|dk�r�|| k�r�td| ��n�|dk �r�|j|d�\}}|| | j
j\}}||k�s||k�rR|d k�rR|| | j
jd8 _| | |< || |< |�s�|jd|� | jj||df� nL||k�rp|dk�rpd | |< n.| �r�| �r�|jd
|� | jj||df� n td| ��q�| | |< || |< q�W i } xF|
D ]>\}}} || k�r�|| | k�r�|jd|| � d| || f< �q�W |jd� d} xX|
D ]P\}}} || k�r"|| | k �r"|| f| k�r"|j d|| � d} d| || f< �q"W | �r�|j d� i } x6| D ].}!x&|!j D ] }"|"| j j k�r�d | |"< �q�W �q�W xL| D ]D}#| j| |#�}| jjt |�d �} | dk�r�| |
|#< |jd|#| � �q�W | ||< | ||< |
||< |d7 }q\W d S ) NzParsing method: %sr r rx zstate %dz (%d) %srd zS'z$endzreduce using rule %d (%s)r� r� z3 ! shift/reduce conflict for %s resolved as reduce�reducer� z2 ! shift/reduce conflict for %s resolved as shiftZshiftz= ! reduce/reduce conflict for %s resolved using rule %d (%s)z Unknown conflict in state %dzshift and go to state %dz Shift/shift conflict in state %dz %-15s %sz ! %-15s [ %s ]z" %-30s shift and go to state %d)r� r r~ )r� r r~ ) r r� r� r\ rZ r r r� r& r7 r� r r� r r� r� rb r� r� r r� r� r r r� r� r# r r! r r� r� )$r r� r� r] r[ r Zactionpr$ �str ZactlistZ st_actionZ
st_actionpZst_gotor� Zlaheadsr r" ZsprecZslevelZrprecZrlevelZoldpZppZchosenpZrejectprF r! rG Z _actprintr� Znot_usedZnkeysr% r= rB r r r
r � s
z LRGeneratedTable.lr_parse_tablerx c C s� t |tj�rtd��|jd�d }tjj||�d }�ylt|d�}|j dtjj
|�t | j |f � d}|�rti }xf| j
j� D ]X\} }
xN|
j� D ]B\} } |j| �}
|
s�g g f}
|
|| < |
d j| � |
d j| � q�W q|W |j d� xz|j� D ]n\}} |j d | � x | d D ]}
|j d
|
� �q W |j d � x | d D ]}
|j d
|
� �q8W |j d � q�W |j d
� |j d� nJ|j d� x4| j
j� D ]&\}} |j d|d |d | f � �q�W |j d
� |�r�i }xl| jj� D ]^\} }
xR|
j� D ]F\} } |j| �}
|
�sg g f}
|
|| < |
d j| � |
d j| � �q�W �q�W |j d� x||j� D ]p\}} |j d | � x | d D ]}
|j d
|
� �qjW |j d � x | d D ]}
|j d
|
� �q�W |j d � �qJW |j d
� |j d� nJ|j d� x4| jj� D ]&\}} |j d|d |d | f � �q�W |j d
� |j d� xd| jD ]Z}|j�rl|j d|j|j|j|jtjj
|j�|jf � n |j dt|�|j|jf � �q0W |j d� |j� W n& tk
�r� } z� W Y d d }~X nX d S )Nz"Won't overwrite existing tabmoduler� rd z.py�wz�
# %s
# This file is automatically generated. Do not edit.
# pylint: disable=W,C,R
_tabversion = %r
_lr_method = %r
_lr_signature = %r
r z
_lr_action_items = {z%r:([z%r,z],[z]),z}
z�
_lr_action = {}
for _k, _v in _lr_action_items.items():
for _x,_y in zip(_v[0],_v[1]):
if not _x in _lr_action: _lr_action[_x] = {}
_lr_action[_x][_k] = _y
del _lr_action_items
z
_lr_action = { z (%r,%r):%r,z
_lr_goto_items = {z�
_lr_goto = {}
for _k, _v in _lr_goto_items.items():
for _x, _y in zip(_v[0], _v[1]):
if not _x in _lr_goto: _lr_goto[_x] = {}
_lr_goto[_x][_k] = _y
del _lr_goto_items
z
_lr_goto = { z_lr_productions = [
z (%r,%r,%d,%r,%r,%d),
z (%r,%r,%d,None,None,None),
z]
r~ )rA r� r� �IOError�splitr� r� r� r� r
�basenamer� r� rZ rf r� rb r\ rX r� r7 r r r� r� r� )r � tabmodule� outputdirr Zbasemodulenamer� r Zsmallerrf r= Zndr rD rF r� r� �er r r
� write_table�
s�
"
"
"
z LRGeneratedTable.write_tablec C s y dd l }W n tk
r( dd l}Y nX t|d���}|jt|t� |j| j|t� |j||t� |j| j|t� |j| j |t� g }x^| j
D ]T}|j r�|j |j
|j|j|j tjj|j�|jf� q�|j t
|�|j|jd d d f� q�W |j||t� W d Q R X d S )Nr �wb)r� r� r� r� �dumpr� �pickle_protocolr� rZ r\ rX r� rb r7 r r r� r� r= r� r� )r r� r r� ZoutfZoutpr� r r r
� pickle_table" s ,"z LRGeneratedTable.pickle_table)r N)rx rx )rx )r r r r r r# r& r( r* r, r. r/ r2 r5 r6 r7 r rA rE r r r r
r 5 s"
%#8 +P B
{r c C s0 t j| �}|jj� }|j|jkr,|j|j� |S )N)rn � _getframe� f_globals�copy�f_locals�update)Zlevelsr Zldictr r r
�get_caller_module_dictE s
rK c C s g }| j � }d }|}x�|D ]�}|d7 }|j� }|s4qy�|d dkrh|sVtd||f ��|} |dd � }
n@|d } | }|dd � }
|d } | dkr�| dkr�td||f ��|j||| |
f� W q tk
r� � Y q tk
r� td |||j� f ��Y qX qW |S )
Nrd r �|z%s:%d: Misplaced '|'r� �:z::=z!%s:%d: Syntax error. Expected ':'z %s:%d: Syntax error in rule %r)�
splitlinesr< rV rb � Exception�strip) �docr� r� r ZpstringsZlastpZdlineZpsr� r� r� Zassignr r r
�
parse_grammarQ s6
rR c @ s� e Zd Zd dd�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � ZdS )!�
ParserReflectNc C sL || _ d | _d | _d | _t� | _g | _d| _|d krBtt j
�| _ n|| _ d S )NF) r� r� �
error_func�tokensr� r� r r r rn ro r )r r� r r r r
r { s zParserReflect.__init__c C s, | j � | j� | j� | j� | j� d S )N)� get_start�get_error_func�
get_tokens�get_precedence�get_pfunctions)r r r r
�get_all� s
zParserReflect.get_allc C s6 | j � | j� | j� | j� | j� | j� | jS )N)�validate_start�validate_error_func�validate_tokens�validate_precedence�validate_pfunctions�validate_modulesr )r r r r
� validate_all� s zParserReflect.validate_allc C s� g }yv| j r|j| j � | jr:|jdjdd� | jD ��� | jrR|jdj| j�� x$| jD ]}|d rZ|j|d � qZW W n ttfk
r� Y nX dj|�S )Nrx c S s g | ]}d j |��qS )rx )r� )r? r� r r r
r@ � s z+ParserReflect.signature.<locals>.<listcomp>ry r )r� rb r� r� rU �pfuncs� TypeError�
ValueError)r �partsr r r r
r � s zParserReflect.signaturec C s� t jd�}x�| jD ]�}ytj|�\}}W n tk
r> wY nX i }xjt|�D ]^\}}|d7 }|j|�}|rN|jd�}|j |�} | s�|||< qNtj
|�}
| j j d|
||| � qNW qW d S )Nz \s*def\s+(p_[a-zA-Z_0-9]*)\(rd z;%s:%d: Function %s redefined. Previously defined on line %d)
�re�compiler� �inspectZgetsourcelinesr; r� r� �groupr� �
getsourcefiler r ) r Zfrer� �linesZlinenZ counthashr� r� r �prevr� r r r
ra � s$
z ParserReflect.validate_modulesc C s | j jd�| _d S )Nr� )r� r� r� )r r r r
rV � s zParserReflect.get_startc C s& | j d k r"t| j t�s"| jjd� d S )Nz'start' must be a string)r� rA � string_typesr r )r r r r
r\ � s
z ParserReflect.validate_startc C s | j jd�| _d S )N�p_error)r� r� rT )r r r r
rW � s z ParserReflect.get_error_funcc C s� | j r�t| j tj�rd}n*t| j tj�r.d}n| jjd� d| _d S | j jj}| j jj }t
j | j �}| j j
|� | j jj| }|dkr�| jjd||� d| _d S )Nr rd z2'p_error' defined, but is not a function or methodTz$%s:%d: p_error() requires 1 argument)rT rA r� � FunctionType�
MethodTyper r �__code__�co_firstlineno� co_filenameri � getmoduler� r� � co_argcount)r ZismethodZelineZefiler� Zargcountr r r
r] � s
z!ParserReflect.validate_error_funcc C sr | j jd�}|s&| jjd� d| _d S t|ttf�sJ| jjd� d| _d S |sd| jjd� d| _d S t|�| _d S )NrU zNo token list is definedTz tokens must be a list or tupleztokens is empty) r� r� r r rA rg r� �sortedrU )r rU r r r
rX � s zParserReflect.get_tokensc C sZ d| j kr | jjd� d| _d S t� }x.| j D ]$}||krH| jjd|� |j|� q.W d S )Nr z.Illegal token name 'error'. Is a reserved wordTzToken %r multiply defined)rU r r r� r r� )r r� rB r r r
r^ s
z ParserReflect.validate_tokensc C s | j jd�| _d S )Nr� )r� r� r� )r r r r
rY s z ParserReflect.get_precedencec C s g }| j �rt| j ttf�s2| jjd� d| _d S x�t| j �D ]�\}}t|ttf�sj| jjd� d| _d S t|�dk r�| jjd|� d| _d S |d }t|t�s�| jjd� d| _d S xH|dd � D ]8}t|t�s�| jjd � d| _d S |j |||d f� q�W q>W || _
d S )
Nz"precedence must be a list or tupleTzBad precedence tabler� z?Malformed precedence entry %s. Must be (assoc, term, ..., term)r z)precedence associativity must be a stringrd z precedence items must be strings) r� rA rg r� r r r� r rn rb �preclist)r rx r� r� r� r� r r r
r_ s6
z!ParserReflect.validate_precedencec C s� g }xl| j j� D ]^\}}|jd� s|dkr.qt|tjtjf�rt|d|jj �}t
j |�}|j ||||j
f� qW |jdd� d� || _d S )N�p_ro rs c S s | d t | d �| d | d fS )Nr rd r� r )r7 )Z
p_functionr r r
r0 F s
z.ParserReflect.get_pfunctions.<locals>.<lambda>)�key)r� rf �
startswithrA r� rp rq rK rr rs ri ru rb �__doc__�sortrc )r Z p_functionsr �itemr� r� r r r
rZ 9 s
z ParserReflect.get_pfunctionsc C s^ g }t | j�dkr(| jjd� d| _d S �x"| jD �]\}}}}tj|�}| j| }t|tj �rfd}nd}|j
j |kr�| jjd|||j � d| _q2|j
j |k r�| jjd|||j � d| _q2|j
s�| jjd|||j � q2y,t|||�} x| D ]}
|j||
f� q�W W n: tk
�r< } z | jjt| �� d| _W Y d d } ~ X nX | jj|� q2W �x| jj� D ]�\} }
| jd ��r�t|
tjtj f��r��q\| jd
��r��q\| jd ��r�| d k�r�| jjd | � t|
tj��r�|
j
j dk�s�t|
tj ��r\|
jj
j dk�r\|
j
�r\y8|
j
jd
�}|d dk�r4| jjd|
j
j|
j
j| � W n t k
�rL Y nX �q\W || _ d S )Nr z+no rules of the form p_rulename are definedTr� rd z%%s:%d: Rule %r has too many argumentsz#%s:%d: Rule %r requires an argumentzA%s:%d: No documentation string specified in function %r (ignored)ry Zt_ro z %r not defined as a functionry rM z9%s:%d: Possible grammar rule %r defined without p_ prefix) r rc r r ri rk r� rA r� rq rr rv r r| r rR rb rV r7 r� r� rf r{ rp �__func__r< rt rs r� r )r r r� r� r rQ r� r� ZreqargsZparsed_gr! r@ rB rD r r r
r` N s\
z!ParserReflect.validate_pfunctions)N)r r r r r[ rb r ra rV r\ rW r] rX r^ rY r_ rZ r` r r r r
rS z s
rS c
< O s� |d kr t }| rd}| d kr&ttj�} � r�� fdd�t� �D �}
t|
�}d|krdtj|d j|d< d|kr�d|kr�ttj|d d�r�tj|d j |d< nt
d�}| d k�r t |t j
�r�|j}nLd|kr�|d }n:|jd�}dj|d d6� �}td
| � ttj| dd �}tjj|�} |jd�}|�rNt |t��rNd|k�rN|d | }|d k �r`||d < t|| d
�}|j� |j�r�td��|j� }y�t � }| �r�|j | �}n
|j |�}|�s�||k�ry"|j |j � t!||j"�}|j#a#|S t$k
�r } z| j%d|� W Y d d }~X nX W nF t&k
�rH } z| j%t|�� W Y d d }~X n t'k
�r\ Y nX |
d k�r�|�r�y tt(tjj| |�d��}
W n< t)k
�r� } z | j%d||f � t*� }
W Y d d }~X nX nt*� }
|
j+dt,� d}|j-� �r�td��|j"�s| j%d� t.|j/�}xZ|j0D ]P\}} } y|j1|| | � W n0 t2k
�rb } z| j%d|� W Y d d }~X nX �qW xl|j3D ]b\} } | \} }!}"}#y|j4|"|#| | |!� W n4 t2k
�r� } z| jd|� d}W Y d d }~X nX �qrW y&|d k�r�|j5|j6� n
|j5|� W n6 t2k
�r4 } z| jt|�� d}W Y d d }~X nX |�rDtd��|j7� }$x*|$D ]"\}%}&| jd|&j8|&j9|%� d}�qRW |j:� }'|'�r�|
j+d � |
j+d� |
j+d � x&|'D ] }| j%d|� |
j+d|� �q�W |�r|
j+d � |
j+d� |
j+d � x&t;|j<�D ]\}(})|
j+d |(|)� �q�W |j=� }*x$|*D ] }&| j%d |&j8|&j9|&j>� �q&W t?|'�d k�r^| j%d � t?|'�d k�r|| j%d t?|'�� t?|*�d k�r�| j%d � t?|*�d k�r�| j%d!t?|*�� |�r�|
j+d � |
j+d"� |
j+d � t@|jA�}+|+jB� x2|+D ]*}|
j+d#|d$jd%d� |jA| D ��� �q�W |
j+d � |
j+d&� |
j+d � t@|jC�},|,jB� x2|,D ]*}-|
j+d#|-d$jd'd� |jC|- D ��� �qRW |
j+d � |�r�|jD� }.x|.D ]}/| j%d(|/� �q�W |jE� }0x |0D ]}1| jd)|1� d}�q�W |jF� }2x$|2D ] \}} | jd*| |� d}�q�W |�rtd��|�r*| jGd+| � tH|| |
�}|�r�t?|jI�}3|3d k�r\| j%d,� n|3d k�rr| j%d-|3� t?|jJ�}4|4d k�r�| j%d.� n|4d k�r�| j%d/|4� |�r�|jI�s�|jJ�r�|
j%d � |
j%d0� |
j%d � x&|jID ] \}5}6}7|
j%d1|6|5|7� �q�W tK� }8x�|jJD ]x\}5}9}:|5tL|9�tL|:�f|8k�r8�q|
j%d2|5|9� |
j%d3|:|5� | j%d2|5|9� | j%d3|:|5� |8jM|5tL|9�tL|:�f� �qW g };xL|jJD ]B\}5}9}:|:jN �r�|:|;k�r�|
j%d4|:� | j%d4|:� |;jO|:� �q�W |� rDy&|jP|| |� |tjk� r
tj|= W n6 t)k
� rB } z| j%d5||f � W Y d d }~X nX | � r�y|jQ| |� W n6 t)k
� r� } z| j%d5| |f � W Y d d }~X nX |j |j � t!||j"�}|j#a#|S )7Nr c s g | ]}|t � |�f�qS r )rK )r? r� )r� r r
r@ � s zyacc.<locals>.<listcomp>�__file__r � __package__r� r� rd z import %srx r� )r zUnable to build parserz.There was a problem loading the table file: %rr: zCouldn't open %r. %sz5Created by PLY version %s (http://www.dabeaz.com/ply)Fz no p_error() function is definedz%sTz;%s:%d: Symbol %r used, but not defined as a token or a rulezUnused terminals:z Token %r defined, but not usedz %sr� z Rule %-5d %sz$%s:%d: Rule %r defined, but not usedzThere is 1 unused tokenzThere are %d unused tokenszThere is 1 unused rulezThere are %d unused rulesz'Terminals, with rules where they appearz
%-20s : %sry c S s g | ] }t |��qS r )r7 )r? r= r r r
r@ M
s z*Nonterminals, with rules where they appearc S s g | ] }t |��qS r )r7 )r? r= r r r
r@ U
s zSymbol %r is unreachablez)Infinite recursion detected for symbol %rz0Precedence rule %r defined for unknown symbol %rzGenerating %s tablesz1 shift/reduce conflictz%d shift/reduce conflictsz1 reduce/reduce conflictz%d reduce/reduce conflictsz
Conflicts:z7shift/reduce conflict for %s in state %d resolved as %sz;reduce/reduce conflict in state %d resolved using rule (%s)z rejected rule (%s) in state %dzRule (%s) is never reducedzCouldn't create %r. %sr~ )R�
tab_moduler rn ro �dir�dictr� r� r� r� rK rA r� r� r< r� r� rK r� r� �dirnamer� r7 rS r[ r r r r� r r� r r� rW rT rv rO r r� r� r� r; r r � __version__rb r� rU rx r� r� r r� r� r� r� r� r� r� r� r� r� r r rg r� r} r� r� r� r� r r r r r� r! r� r� rb rA rE )<r r r� r> r� Zcheck_recursion�optimizeZ write_tablesZ debugfiler? ZdebuglogZerrorlogZ
picklefileZ_itemsr� Zsrcfilerf ZpkgnameZpkgZpinfor ZlrZread_signaturer3 r@ �errorsr r� r� r� �funcnameZgramr� r� r� r� r� rc r� r� rB r� r� r+ ZnontermsZnontermZ unreachable�ur� �infZ unused_precZnum_srZnum_rrri r� Z
resolutionZalready_reportedZruleZrejectedZ warned_neverr )r� r
�yacc� s�
"
$
*
*
$$ r� );rg r� rn Zos.pathr� ri r( r� r� Z yaccdebugZ
debug_filer� Z
default_lrr� rl r rD � version_infoZ
basestringrn r7 �maxsizer �objectr r rO r r% r' r+ r/ r- r* r, r. r0 r4 r5 r9 rW rh r� r� r� r� r� r� r� r� r� r r r r rK rR rS r� r r r r
�<module>> s�
7 m
H. rT
)
sepolgen/__pycache__/refpolicy.cpython-36.pyc 0000644 00000117634 14751155147 0015240 0 ustar 00 3
�� f�} � @ sb d dl Z d dlZd ZdZdZdZdZdZddd d
d d gZeeeeeed
�Z G dd� d�Z
G dd� de
�Z G dd� de
�Z dzdd�Z
d{dd�Zd}d d �Zd d � ZG d d!� d!e�ZG d"d#� d#e �ZG d$d%� d%e �ZG d&d'� d'�ZG d(d)� d)e �ZG d*d+� d+e �ZG d,d-� d-e �ZG d.d/� d/e �ZG d0d1� d1e �ZG d2d3� d3e �ZG d4d5� d5e �Z G d6d7� d7e �Z G d8d9� d9e �Z G d:d;� d;e �Z G d<d=� d=e �Z G d>d?� d?e �Z!G d@dA� dAe �Z"G dBdC� dCe �Z#G dDdE� dEe �Z$G dFdG� dGe �Z%G dHdI� dIe �Z&G dJdK� dKe �Z'G dLdM� dMe �Z(G dNdO� dOe �Z)G dPdQ� dQe �Z*G dRdS� dSe �Z+G dTdU� dUe �Z,G dVdW� dWe �Z-G dXdY� dYe �Z.G dZd[� d[e �Z/G d\d]� d]e �Z0d^d_� Z1G d`da� dae �Z2G dbdc� dce �Z3G ddde� dee �Z4G dfdg� dge �Z5G dhdi� die �Z6G djdk� dke �Z7G dldm� dme �Z8G dndo� doe �Z9G dpdq� dqe �Z:G drds� dse �Z;G dtdu� du�Z<G dvdw� dw�Z=G dxdy� dy�Z>dS )~� N� � � � � �source�target�object�
permission�role� destination)r r r r
r r c @ s e Zd Zddd�ZdS )�
PolicyBaseNc C s d | _ d | _d S )N)�parent�comment)�selfr � r � /usr/lib/python3.6/refpolicy.py�__init__5 s zPolicyBase.__init__)N)�__name__�
__module__� __qualname__r r r r r r
4 s r
c @ s� e Zd ZdZd/dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� ZdS )0�Nodea� Base class objects produced from parsing the reference policy.
The Node class is used as the base class for any non-leaf
object produced by parsing the reference policy. This object
should contain a reference to its parent (or None for a top-level
object) and 0 or more children.
The general idea here is to have a very simple tree structure. Children
are not separated out by type. Instead the tree structure represents
fairly closely the real structure of the policy statements.
The object should be iterable - by default over all children but
subclasses are free to provide additional iterators over a subset
of their childre (see Interface for example).
Nc C s t j| |� g | _d S )N)r
r �children)r r r r r r J s z
Node.__init__c C s
t | j�S )N)�iterr )r r r r �__iter__N s z
Node.__iter__c C s t dd� t| ��S )Nc S s
t | t�S )N)�
isinstancer )�xr r r �<lambda>W s z Node.nodes.<locals>.<lambda>)�filter�walktree)r r r r �nodesV s z
Node.nodesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Module)r r r r r Z s z Node.modules.<locals>.<lambda>)r r )r r r r �modulesY s z Node.modulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � Interface)r r r r r ] s z!Node.interfaces.<locals>.<lambda>)r r )r r r r �
interfaces\ s zNode.interfacesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Template)r r r r r ` s z Node.templates.<locals>.<lambda>)r r )r r r r � templates_ s zNode.templatesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �
SupportMacros)r r r r r c s z%Node.support_macros.<locals>.<lambda>)r r )r r r r �support_macrosb s zNode.support_macrosc C s t dd� t| ��S )Nc S s
t | t�S )N)r �ModuleDeclaration)r r r r r h s z*Node.module_declarations.<locals>.<lambda>)r r )r r r r �module_declarationsg s zNode.module_declarationsc C s t dd� t| ��S )Nc S s
t | t�S )N)r �
InterfaceCall)r r r r r k s z&Node.interface_calls.<locals>.<lambda>)r r )r r r r �interface_callsj s zNode.interface_callsc C s t dd� t| ��S )Nc S s
t | t�S )N)r �AVRule)r r r r r n s z Node.avrules.<locals>.<lambda>)r r )r r r r �avrulesm s z Node.avrulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � AVExtRule)r r r r r q s z!Node.avextrules.<locals>.<lambda>)r r )r r r r �
avextrulesp s zNode.avextrulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �TypeRule)r r r r r t s z Node.typerules.<locals>.<lambda>)r r )r r r r � typeruless s zNode.typerulesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � TypeBound)r r r r r w s z!Node.typebounds.<locals>.<lambda>)r r )r r r r �
typeboundsv s zNode.typeboundsc C s t dd� t| ��S )zAIterate over all of the TypeAttribute children of this Interface.c S s
t | t�S )N)r �
TypeAttribute)r r r r r { s z%Node.typeattributes.<locals>.<lambda>)r r )r r r r �typeattributesy s zNode.typeattributesc C s t dd� t| ��S )zAIterate over all of the RoleAttribute children of this Interface.c S s
t | t�S )N)r �
RoleAttribute)r r r r r s z%Node.roleattributes.<locals>.<lambda>)r r )r r r r �roleattributes} s zNode.roleattributesc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Require)r r r r r � s z Node.requires.<locals>.<lambda>)r r )r r r r �requires� s z
Node.requiresc C s t dd� t| ��S )Nc S s
t | t�S )N)r �Role)r r r r r � s z Node.roles.<locals>.<lambda>)r r )r r r r �roles� s z
Node.rolesc C s t dd� t| ��S )Nc S s
t | t�S )N)r � RoleAllow)r r r r r � s z"Node.role_allows.<locals>.<lambda>)r r )r r r r � role_allows� s zNode.role_allowsc C s t dd� t| ��S )Nc S s
t | t�S )N)r �RoleType)r r r r r � s z!Node.role_types.<locals>.<lambda>)r r )r r r r �
role_types� s zNode.role_typesc C s( | j r t| j �d | j� S | j� S d S )N�
)r �str� to_string)r r r r �__str__� s z Node.__str__c C s d| j j| j� f S )Nz<%s(%s)>)� __class__r rC )r r r r �__repr__� s z
Node.__repr__c C s dS )N� r )r r r r rC � s zNode.to_string)N)r r r �__doc__r r r r" r$ r& r( r* r, r. r0 r2 r4 r6 r8 r: r< r> r@ rD rF rC r r r r r 9 s.
r c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �LeafNc C s t j| |� d S )N)r
r )r r r r r r � s z
Leaf.__init__c C s( | j r t| j �d | j� S | j� S d S )NrA )r rB rC )r r r r rD � s z Leaf.__str__c C s d| j j| j� f S )Nz<%s(%s)>)rE r rC )r r r r rF � s z
Leaf.__repr__c C s dS )NrG r )r r r r rC � s zLeaf.to_string)N)r r r r rD rF rC r r r r rI � s
rI TFc
c s� |r
d}nd}| dfg}x�t |�dkr�|j|�\}}|rD||fV n|V t|t�rg }t |j�d } xD| dkr�|dks�t|j| |�r�|j|j| |d f� | d8 } qhW |j|� qW dS )a� Iterate over a Node and its Children.
The walktree function iterates over a tree containing Nodes and
leaf objects. The iteration can perform a depth first or a breadth
first traversal of the tree (controlled by the depthfirst
paramater. The passed in node will be returned.
This function will only work correctly for trees - arbitrary graphs
will likely cause infinite looping.
r r N���)�len�popr r r �append�extend)
�nodeZ
depthfirst� showdepth�type�index�stackZcur�depth�items�ir r r r � s"
r c c s* x$| D ] }|dks t ||�r|V qW dS )a Iterate over the direct children of a Node.
The walktree function iterates over the children of a Node.
Unlike walktree it does note return the passed in node or
the children of any Node objects (that is, it does not go
beyond the current level in the tree).
N)r )rO rQ r r r r �walknode� s
rW �{�}c C sR t | �}d}|dk r td��dj| �}|dkr2|S |d d | d |d S dS )z�Convert a set (or any sequence type) into a string representation
formatted to match SELinux space separated list conventions.
For example the list ['read', 'write'] would be converted into:
'{ read write }'
rG r z"cannot convert 0 len set to string� r N)rK �
ValueError�join)�s�cont�lrB r r r �list_to_space_str� s
r` c C s" t | �}|dk rtd��dj| �S )Nr z'cannot conver 0 len set to comma stringz, )rK r[ r\ )r] r_ r r r �list_to_comma_str� s ra c @ s& e Zd Zddd�Zdd� Zdd� ZdS ) �IdSetNc C s& |rt j| |� n
t j| � d| _d S )NF)�setr Z
compliment)r �listr r r r � s
zIdSet.__init__c C s t t| ��S )N)r` �sorted)r r r r � to_space_str s zIdSet.to_space_strc C s t t| ��S )N)ra re )r r r r � to_comma_str s zIdSet.to_comma_str)N)r r r r rf rg r r r r rb � s
rb c @ s4 e Zd ZdZd dd�Zdd� Zdd� Zd d d
�ZdS )
�SecurityContextz;An SELinux security context with optional MCS / MLS fields.Nc C s: t j| |� d| _d| _d| _d| _|dk r6| j|� dS )z�Create a SecurityContext object, optionally from a string.
Parameters:
[context] - string representing a security context. Same format
as a string passed to the from_string method.
rG N)rI r �userr rQ �level� from_string)r �contextr r r r r s zSecurityContext.__init__c C s� t j|�}|d dkr |d }|jd�}t|�dk r@td| ��|d | _|d | _|d | _t|�dkr�dj|dd� �| _ nd| _ dS )z�Parse a string representing a context into a SecurityContext.
The string should be in the standard format - e.g.,
'user:role:type:level'.
Raises ValueError if the string is not parsable as a security context.
r r �:r z)context string [%s] not in a valid formatr N)
�selinuxZ selinux_trans_to_raw_context�splitrK r[ ri r rQ r\ rj )r rl �raw�fieldsr r r rk s
zSecurityContext.from_stringc C s0 | j |j ko.| j|jko.| j|jko.| j|jkS )a Compare two SecurityContext objects - all fields must be exactly the
the same for the comparison to work. It is possible for the level fields
to be semantically the same yet syntactically different - in this case
this function will return false.
)ri r rQ rj )r �otherr r r �__eq__4 s zSecurityContext.__eq__c C s\ | j | j| jg}| jdkrF|dkr:tj� dkrD|jd� qR|j|� n |j| j� dj|�S )a� Return a string representing this security context.
By default, the string will contiain a MCS / MLS level
potentially from the default which is passed in if none was
set.
Arguments:
default_level - the default level to use if self.level is an
empty string.
Returns:
A string represening the security context in the form
'user:role:type:level'.
Nr Zs0rm )ri r rQ rj rn Zis_selinux_mls_enabledrM r\ )r Z
default_levelrq r r r rC ? s
zSecurityContext.to_string)NN)N)r r r rH r rk rs rC r r r r rh s
rh c @ s e Zd ZdZddd�ZdS )� ObjectClassa" SELinux object class and permissions.
This class is a basic representation of an SELinux object
class - it does not represent separate common permissions -
just the union of the common and class specific permissions.
It is meant to be convenient for policy generation.
rG Nc C s t j| |� || _t� | _d S )N)rI r �namerb �perms)r ru r r r r r a s zObjectClass.__init__)rG N)r r r rH r r r r r rt Y s rt c @ s< e Zd ZdZddd�Zdd� Zdd� Zdd
d �Zd d
� Zd S )�XpermSeta) Extended permission set.
This class represents one or more extended permissions
represented by numeric values or ranges of values. The
.complement attribute is used to specify all permission
except those specified.
Two xperm set can be merged using the .extend() method.
Fc C s || _ g | _d S )N)�
complement�ranges)r rx r r r r p s zXpermSet.__init__c C s� | j j� d}x�|t| j �k r�x�|d t| j �k r�| j |d d | j | d d kr�| j | d t| j | d | j |d d �f| j |< | j |d = q P q W |d7 }qW dS )z0Ensure that ranges are not overlapping.
r r N)ry �sortrK �max)r rV r r r Z__normalize_rangest s
$ zXpermSet.__normalize_rangesc C s | j j|j � | j� dS )z%Add ranges from an xperm set
N)ry rN �_XpermSet__normalize_ranges)r r] r r r rN � s zXpermSet.extendNc C s( |dkr |}| j j||f� | j� dS )z7Add value of range of values to the xperm set.
N)ry rM r| )r ZminimumZmaximumr r r �add� s z XpermSet.addc C sz | j s
dS | jrdnd}t| j �dkrX| j d d | j d d krX|t| j d d � S tdd� | j �}d|dj|�f S ) NrG z~ r r c S s$ | d | d kr t | d �S d| S )Nr r z%s-%s)rB )r r r r r � s z$XpermSet.to_string.<locals>.<lambda>z%s{ %s }rZ )ry rx rK rB �mapr\ )r Zcompl�valsr r r rC � s *zXpermSet.to_string)F)N) r r r rH r r| rN r} rC r r r r rw f s
rw c @ s" e Zd ZdZddd�Zdd� ZdS )r5 z[SElinux typeattribute statement.
This class represents a typeattribute statement.
Nc C s t j| |� d| _t� | _d S )NrG )rI r rQ rb �
attributes)r r r r r r � s zTypeAttribute.__init__c C s d| j | jj� f S )Nztypeattribute %s %s;)rQ r� rg )r r r r rC � s zTypeAttribute.to_string)N)r r r rH r rC r r r r r5 � s
r5 c @ s" e Zd ZdZddd�Zdd� ZdS )r7 z[SElinux roleattribute statement.
This class represents a roleattribute statement.
Nc C s t j| |� d| _t� | _d S )NrG )rI r r rb r8 )r r r r r r � s zRoleAttribute.__init__c C s d| j | jj� f S )Nzroleattribute %s %s;)r r8 rg )r r r r rC � s zRoleAttribute.to_string)N)r r r rH r rC r r r r r7 � s
r7 c @ s e Zd Zddd�Zdd� ZdS )r; Nc C s t j| |� d| _t� | _d S )NrG )rI r r rb �types)r r r r r r � s z
Role.__init__c C s* d}x | j D ]}|d| j|f 7 }q W |S )NrG zrole %s types %s;
)r� r )r r] �tr r r rC � s zRole.to_string)N)r r r r rC r r r r r; � s
r; c @ s e Zd Zddd�Zdd� ZdS )�TyperG Nc C s& t j| |� || _t� | _t� | _d S )N)rI r ru rb r� �aliases)r ru r r r r r � s z
Type.__init__c C sR d| j }t| j�dkr*|d| jj� }t| j�dkrJ|d| jj� }|d S )Nztype %sr zalias %sz, %s�;)ru rK r� rf r� rg )r r] r r r rC � s
zType.to_string)rG N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )� TypeAliasNc C s t j| |� d| _t� | _d S )NrG )rI r rQ rb r� )r r r r r r � s zTypeAlias.__init__c C s d| j | jj� f S )Nztypealias %s alias %s;)rQ r� rf )r r r r rC � s zTypeAlias.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )� AttributerG Nc C s t j| |� || _d S )N)rI r ru )r ru r r r r r � s zAttribute.__init__c C s
d| j S )Nz
attribute %s;)ru )r r r r rC � s zAttribute.to_string)rG N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�Attribute_RolerG Nc C s t j| |� || _d S )N)rI r ru )r ru r r r r r � s zAttribute_Role.__init__c C s
d| j S )Nzattribute_role %s;)ru )r r r r rC � s zAttribute_Role.to_string)rG N)r r r r rC r r r r r� � s
r� c @ sB e Zd ZdZdZdZdZdZddd�Zd d
� Z d d � Z
d
d� Z dS )r- a� SELinux access vector (AV) rule.
The AVRule class represents all varieties of AV rules including
allow, dontaudit, and auditallow (indicated by the flags self.ALLOW,
self.DONTAUDIT, and self.AUDITALLOW respectively).
The source and target types, object classes, and perms are all represented
by sets containing strings. Sets are used to make it simple to add
strings repeatedly while avoiding duplicates.
No checking is done to make certain that the symbols are valid or
consistent (e.g., perms that don't match the object classes). It is
even possible to put invalid types like '$1' into the rules to allow
storage of the reference policy interfaces.
r r r r Nc C sF t j| |� t� | _t� | _t� | _t� | _| j| _|rB| j |� d S )N)
rI r rb � src_types� tgt_types� obj_classesrv �ALLOW� rule_type�from_av)r �avr r r r r
s zAVRule.__init__c C sD | j | jkrdS | j | jkr dS | j | jkr0dS | j | jkr@dS d S )NZallowZ dontauditZ
auditallowZ
neverallow)r� r� � DONTAUDIT�
AUDITALLOW�
NEVERALLOW)r r r r �__rule_type_str s zAVRule.__rule_type_strc C sV | j j|j� |j|jkr(| jjd� n| jj|j� | jj|j� | jj|j� dS )zIAdd the access from an access vector to this allow
rule.
r N) r� r} �src_type�tgt_typer� r� � obj_classrv �update)r r� r r r r� s zAVRule.from_avc C s. d| j � | jj� | jj� | jj� | jj� f S )z�Return a string representation of the rule
that is a valid policy language representation (assuming
that the types, object class, etc. are valie).
z%s %s %s:%s %s;)�_AVRule__rule_type_strr� rf r� r� rv )r r r r rC * s
zAVRule.to_string)NN) r r r rH r� r� r� r� r r� r� rC r r r r r- � s
r- c @ sB e Zd ZdZdZdZdZdZddd�Zd d
� Z d d � Z
d
d� Z dS )r/ aj Extended permission access vector rule.
The AVExtRule class represents allowxperm, dontauditxperm,
auditallowxperm, and neverallowxperm rules.
The source and target types, and object classes are represented
by sets containing strings. The operation is a single string,
e.g. 'ioctl'. Extended permissions are represented by an XpermSet.
r r r r Nc C sN t j| |� t� | _t� | _t� | _| j| _t� | _ || _
|rJ| j ||� d S )N) rI r rb r� r� r� �
ALLOWXPERMr� rw �xperms� operationr� )r r� �opr r r r r D s zAVExtRule.__init__c C sD | j | jkrdS | j | jkr dS | j | jkr0dS | j | jkr@dS d S )NZ
allowxpermZdontauditxpermZauditallowxpermZneverallowxperm)r� r� �DONTAUDITXPERM�AUDITALLOWXPERM�NEVERALLOWXPERM)r r r r r� O s zAVExtRule.__rule_type_strc C sZ | j j|j� |j|jkr(| jjd� n| jj|j� | jj|j� || _|j| | _d S )Nr ) r� r} r� r� r� r� r� r� r� )r r� r� r r r r� Y s zAVExtRule.from_avc C s2 d| j � | jj� | jj� | jj� | j| jj� f S )z�Return a string representation of the rule that is
a valid policy language representation (assuming that
the types, object class, etc. are valid).
z%s %s %s:%s %s %s;)�_AVExtRule__rule_type_strr� rf r� r� r� r� rC )r r r r rC c s zAVExtRule.to_string)NNN) r r r rH r� r� r� r� r r� r� rC r r r r r/ 5 s
r/ c @ s6 e Zd ZdZdZdZdZd dd�Zdd � Zd
d � Z dS )
r1 z�SELinux type rules.
This class is very similar to the AVRule class, but is for representing
the type rules (type_trans, type_change, and type_member). The major
difference is the lack of perms and only and sing destination type.
r r r Nc C s6 t j| |� t� | _t� | _t� | _d| _| j| _d S )NrG ) rI r rb r� r� r� � dest_type�TYPE_TRANSITIONr� )r r r r r r z s zTypeRule.__init__c C s( | j | jkrdS | j | jkr dS dS d S )NZtype_transitionZ type_changeZ type_member)r� r� � TYPE_CHANGE)r r r r r� � s
zTypeRule.__rule_type_strc C s* d| j � | jj� | jj� | jj� | jf S )Nz%s %s %s:%s %s;)�_TypeRule__rule_type_strr� rf r� r� r� )r r r r rC � s
zTypeRule.to_string)N)
r r r rH r� r� Z TYPE_MEMBERr r� rC r r r r r1 o s
r1 c @ s" e Zd ZdZddd�Zdd� ZdS )r3 zSSElinux typebound statement.
This class represents a typebound statement.
Nc C s t j| |� d| _t� | _d S )NrG )rI r rQ rb r� )r r r r r r � s zTypeBound.__init__c C s d| j | jj� f S )Nztypebounds %s %s;)rQ r� rg )r r r r rC � s zTypeBound.to_string)N)r r r rH r rC r r r r r3 � s
r3 c @ s e Zd Zddd�Zdd� ZdS )r= Nc C s t j| |� t� | _t� | _d S )N)rI r rb � src_roles� tgt_roles)r r r r r r � s zRoleAllow.__init__c C s d| j j� | jj� f S )Nz allow %s %s;)r� rg r� )r r r r rC � s
zRoleAllow.to_string)N)r r r r rC r r r r r= � s
r= c @ s e Zd Zddd�Zdd� ZdS )r? Nc C s t j| |� d| _t� | _d S )NrG )rI r r rb r� )r r r r r r � s zRoleType.__init__c C s* d}x | j D ]}|d| j|f 7 }q W |S )NrG zrole %s types %s;
)r� r )r r] r� r r r rC � s zRoleType.to_string)N)r r r r rC r r r r r? � s
r? c @ s e Zd Zddd�Zdd� ZdS )r) Nc C s" t j| |� d| _d| _d| _d S )NrG F)rI r ru �version� refpolicy)r r r r r r � s zModuleDeclaration.__init__c C s* | j rd| j| jf S d| j| jf S d S )Nzpolicy_module(%s, %s)z
module %s %s;)r� ru r� )r r r r rC � s zModuleDeclaration.to_string)N)r r r r rC r r r r r) � s
r) c @ s e Zd Zddd�Zdd� ZdS )� ConditionalNc C s t j| |� g | _d S )N)r r � cond_expr)r r r r r r � s zConditional.__init__c C s dt | jdd� S )Nz[If %s]rG )r^ )rG rG )r` r� )r r r r rC � s zConditional.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�BoolNc C s t j| |� d| _d| _d S )NrG F)rI r ru �state)r r r r r r � s z
Bool.__init__c C s$ d| j }|jr|d S |d S d S )Nzbool %s �trueZfalse)ru r� )r r] r r r rC � s
zBool.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�
InitialSidNc C s t j| |� d| _d | _d S )NrG )rI r ru rl )r r r r r Z__init� s zInitialSid.__initc C s d| j t| j�f S )Nz sid %s %s)ru rB rl )r r r r rC � s zInitialSid.to_string)N)r r r Z_InitialSid__initrC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�GenfsConNc C s" t j| |� d| _d| _d | _d S )NrG )rI r �
filesystem�pathrl )r r r r r r � s zGenfsCon.__init__c C s d| j | jt| j�f S )Nzgenfscon %s %s %s)r� r� rB rl )r r r r rC � s zGenfsCon.to_string)N)r r r r rC r r r r r� � s
r� c @ s* e Zd ZdZdZdZd dd�Zdd� ZdS )
�
FilesystemUser r r Nc C s$ t j| |� | j| _d| _d | _d S )NrG )rI r �XATTRrQ r� rl )r r r r r r � s zFilesystemUse.__init__c C sN d}| j | jkrd}n"| j | jkr(d}n| j | jkr8d}d|| jt| j�f S )NrG z
fs_use_xattr z
fs_use_trans z fs_use_task z %s %s %s;)rQ r� �TRANS�TASKr� rB rl )r r] r r r rC � s zFilesystemUse.to_string)N)r r r r� r� r� r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�PortConNc C s" t j| |� d| _d| _d | _d S )NrG )rI r � port_type� port_numberrl )r r r r r r s zPortCon.__init__c C s d| j | jt| j�f S )Nzportcon %s %s %s)r� r� rB rl )r r r r rC s zPortCon.to_string)N)r r r r rC r r r r r� � s
r� c @ s e Zd Zddd�Zdd� ZdS )�NodeConNc C s" t j| |� d| _d| _d | _d S )NrG )rI r �start�endrl )r r r r r r
s zNodeCon.__init__c C s d| j | jt| j�f S )Nznodecon %s %s %s)r� r� rB rl )r r r r rC s zNodeCon.to_string)N)r r r r rC r r r r r� s
r� c @ s e Zd Zddd�Zdd� ZdS )�NetifConNc C s" t j| |� d| _d | _d | _d S )NrG )rI r � interface�interface_context�packet_context)r r r r r r s zNetifCon.__init__c C s d| j t| j�t| j�f S )Nznetifcon %s %s %s)r� rB r� r� )r r r r rC s zNetifCon.to_string)N)r r r r rC r r r r r� s
r� c @ s e Zd Zddd�Zdd� ZdS )�PirqConNc C s t j| |� d| _d | _d S )NrG )rI r � pirq_numberrl )r r r r r r s zPirqCon.__init__c C s d| j t| j�f S )Nz
pirqcon %s %s)r� rB rl )r r r r rC # s zPirqCon.to_string)N)r r r r rC r r r r r� s
r� c @ s e Zd Zddd�Zdd� ZdS )�IomemConNc C s t j| |� d| _d | _d S )NrG )rI r �
device_memrl )r r r r r r ' s zIomemCon.__init__c C s d| j t| j�f S )Nziomemcon %s %s)r� rB rl )r r r r rC , s zIomemCon.to_string)N)r r r r rC r r r r r� & s
r� c @ s e Zd Zddd�Zdd� ZdS )� IoportConNc C s t j| |� d| _d | _d S )NrG )rI r �ioportrl )r r r r r r 0 s zIoportCon.__init__c C s d| j t| j�f S )Nzioportcon %s %s)r� rB rl )r r r r rC 5 s zIoportCon.to_string)N)r r r r rC r r r r r� / s
r� c @ s e Zd Zddd�Zdd� ZdS )� PciDeviceConNc C s t j| |� d| _d | _d S )NrG )rI r �devicerl )r r r r r r 9 s zPciDeviceCon.__init__c C s d| j t| j�f S )Nzpcidevicecon %s %s)r� rB rl )r r r r rC > s zPciDeviceCon.to_string)N)r r r r rC r r r r r� 8 s
r� c @ s e Zd Zddd�Zdd� ZdS )�
DeviceTreeConNc C s t j| |� d| _d | _d S )NrG )rI r r� rl )r r r r r r B s zDeviceTreeCon.__init__c C s d| j t| j�f S )Nzdevicetreecon %s %s)r� rB rl )r r r r rC G s zDeviceTreeCon.to_string)N)r r r r rC r r r r r� A s
r� c C sL xFt | dd�D ]6\}}d}xt|�D ] }|d }q$W t|t|� � qW d S )NT)rP rG � )r �range�printrB )�headrO rT r] rV r r r �
print_treeL s
r� c @ s e Zd Zddd�Zdd� ZdS )�HeadersNc C s t j| |� d S )N)r r )r r r r r r U s zHeaders.__init__c C s dS )Nz [Headers]r )r r r r rC X s zHeaders.to_string)N)r r r r rC r r r r r� T s
r� c @ s e Zd Zddd�Zdd� ZdS )r! Nc C s t j| |� d S )N)r r )r r r r r r ] s zModule.__init__c C s dS )NrG r )r r r r rC ` s zModule.to_string)N)r r r r rC r r r r r! \ s
r! c @ s" e Zd ZdZddd�Zdd� ZdS ) r# zqA reference policy interface definition.
This class represents a reference policy interface definition.
rG Nc C s t j| |� || _d S )N)r r ru )r ru r r r r r h s zInterface.__init__c C s
d| j S )Nz[Interface name: %s])ru )r r r r rC l s zInterface.to_string)rG N)r r r rH r rC r r r r r# c s
r# c @ s e Zd Zddd�Zdd� ZdS )�
TunablePolicyNc C s t j| |� g | _d S )N)r r r� )r r r r r r p s zTunablePolicy.__init__c C s dt | jdd� S )Nz[Tunable Policy %s]rG )r^ )rG rG )r` r� )r r r r rC t s zTunablePolicy.to_string)N)r r r r rC r r r r r� o s
r� c @ s e Zd Zddd�Zdd� ZdS )r% rG Nc C s t j| |� || _d S )N)r r ru )r ru r r r r r x s zTemplate.__init__c C s
d| j S )Nz[Template name: %s])ru )r r r r rC | s zTemplate.to_string)rG N)r r r r rC r r r r r% w s
r% c @ s e Zd Zddd�Zdd� ZdS )�IfDefrG Nc C s t j| |� || _d S )N)r r ru )r ru r r r r r � s zIfDef.__init__c C s
d| j S )Nz[Ifdef name: %s])ru )r r r r rC � s zIfDef.to_string)rG N)r r r r rC r r r r r� s
r� c @ s& e Zd Zd dd�Zdd� Zdd� ZdS )
r+ rG Nc C s" t j| |� || _g | _g | _d S )N)rI r �ifname�argsZcomments)r r� r r r r r � s zInterfaceCall.__init__c C sT | j |j krdS t| j�t|j�kr(dS x&t| j|j�D ]\}}||kr8dS q8W dS )NFT)r� rK r� �zip)r rr �a�br r r �matches� s zInterfaceCall.matchesc C sd d| j }d}xL| jD ]B}t|t�r.t|�}n|}|dkrH|d| }n|| }|d7 }qW |d S )Nz%s(r z, %sr �))r� r� r rd r` )r r] rV r� rB r r r rC � s
zInterfaceCall.to_string)rG N)r r r r r� rC r r r r r+ � s
r+ c @ s e Zd Zddd�Zdd� ZdS )�OptionalPolicyNc C s t j| |� d S )N)r r )r r r r r r � s zOptionalPolicy.__init__c C s dS )Nz[Optional Policy]r )r r r r rC � s zOptionalPolicy.to_string)N)r r r r rC r r r r r� � s
r� c @ s> e Zd Zddd�Zdd� Zdd� Zdd � Zd
d � Zd d
� ZdS )r' Nc C s t j| |� d | _d S )N)r r r~ )r r r r r r � s zSupportMacros.__init__c C s dS )Nz[Support Macros]r )r r r r rC � s zSupportMacros.to_stringc C sD t � }|| jkr6x.| j|�D ]}|j| j|�� q W n
|j|� |S )N)rc r~ �by_namer� �_SupportMacros__expand_permr} )r �permr] �pr r r Z
__expand_perm� s
zSupportMacros.__expand_permc C sJ i | _ x>| D ]6}t� }x |jD ]}|j| j|�� q W || j |j< q W d S )N)r~ rc rv r� r� ru )r r Z exp_permsr� r r r Z __gen_map� s
zSupportMacros.__gen_mapc C s | j s| j� | j | S )N)r~ �_SupportMacros__gen_map)r ru r r r r� � s zSupportMacros.by_namec C s | j s| j� || j kS )N)r~ r� )r ru r r r �has_key� s zSupportMacros.has_key)N) r r r r rC r� r� r� r� r r r r r' � s
r' c @ s& e Zd Zddd�Zdd� Zdd� ZdS ) r9 Nc C s6 t j| |� t� | _i | _t� | _t� | _t� | _d S )N)rI r rb r� r� r< �data�users)r r r r r r � s zRequire.__init__c C s | j j|t� �}|j|� d S )N)r� �
setdefaultrb r� )r r� rv r� r r r �
add_obj_class� s zRequire.add_obj_classc C s� g }|j d� x | jD ]}|j d| � qW x,| jj� D ] \}}|j d||j� f � q8W x | jD ]}|j d| � qbW x | jD ]}|j d| � q�W x | jD ]}|j d| � q�W |j d� t|�dkr�d S d
j |�S ) Nz require {z type %s;z
class %s %s;z role %s;z bool %s;z user %s;rY r rG rA )
rM r� r� rU rf r< r� r� rK r\ )r r] rQ r� rv r �boolri r r r rC � s
zRequire.to_string)N)r r r r r� rC r r r r r9 � s
r9 c @ s e Zd Zdd� Zdd� ZdS )�
ObjPermSetc C s || _ t� | _d S )N)ru rc rv )r ru r r r r � s zObjPermSet.__init__c C s d| j | jj� f S )Nzdefine(`%s', `%s'))ru rv rf )r r r r rC � s zObjPermSet.to_stringN)r r r r rC r r r r r� � s r� c @ s e Zd Zdd� Zdd� ZdS )�ClassMapc C s || _ || _d S )N)r� rv )r r� rv r r r r s zClassMap.__init__c C s | j d | j S )Nz: )r� rv )r r r r rC s zClassMap.to_stringN)r r r r rC r r r r r� s r� c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) �CommentNc C s |r || _ ng | _ d S )N)�lines)r r_ r r r r
s zComment.__init__c C sB t | j�dkrdS g }x | jD ]}|jd| � q W dj|�S d S )Nr rG �#rA )rK r� rM r\ )r �out�liner r r rC s zComment.to_stringc C s2 t |j�r.x"|jD ]}|dkr| jj|� qW d S )NrG )rK r� rM )r rr r� r r r �merge s
z
Comment.mergec C s | j � S )N)rC )r r r r rD ! s zComment.__str__)N)r r r r rC r� rD r r r r r� s
r� )TFN)N�rX rY )r� )?�stringrn ZSRC_TYPEZTGT_TYPEZ OBJ_CLASSZPERMSZROLEZ DEST_TYPEZ field_to_strZ str_to_fieldr
r rI r rW r` ra rc rb rh rt rw r5 r7 r; r� r� r� r� r- r/ r1 r3 r= r? r) r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r! r# r� r% r� r+ r� r' r9 r� r� r� r r r r �<module> s| a
&
P
=
@:!
!&$ sepolgen/__pycache__/objectmodel.cpython-36.pyc 0000644 00000007523 14751155147 0015526 0 ustar 00 3
�� fv � @ sp d Z ddddddddd g Zd
Zd Zd ZeeB Zeeeed
�ZedededediZG dd� d�ZG dd� d�Z dS )z�
This module provides knowledge object classes and permissions. It should
be used to keep this knowledge from leaking into the more generic parts of
the policy generation.
Zsocket�fdZprocess�fileZlnk_fileZ fifo_fileZdbusZ
capabilityZunix_stream_socket� � � )�n�r�w�br r r r c @ s e Zd ZdZdd� Zdd� ZdS )�PermMapa A mapping between a permission and its information flow properties.
PermMap represents the information flow properties of a single permission
including the direction (read, write, etc.) and an abstract representation
of the bandwidth of the flow (weight).
c C s || _ || _|| _d S )N)�perm�dir�weight)�selfr r r
� r �!/usr/lib/python3.6/objectmodel.py�__init__T s zPermMap.__init__c C s d| j t| j | jf S )Nz'<sepolgen.objectmodel.PermMap %s %s %d>)r �
dir_to_strr r
)r r r r �__repr__Y s zPermMap.__repr__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r
M s r
c @ s@ e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dS )� PermMappingsz�The information flow properties of a set of object classes and permissions.
PermMappings maps one or more classes and permissions to their PermMap objects
describing their information flow charecteristics.
c C s i | _ d| _t| _d S )N� )�classes�default_weight� FLOW_BOTH� default_dir)r r r r r d s zPermMappings.__init__c C s� d}x�|D ]�}|j � }t|�dks
t|�dks
|d dkr<q
|d dkrx|d }|| jkrbtd��i | j|< | j| }q
t|�dkr�td��|dkr�td ��t|d t|d t|d
��}|||j< q
W dS ) zsRead the permission mappings from a file. This reads the format used
by Apol in the setools suite.
Nr r �#�classzduplicate class in perm map� z"error in object classs permissionszpermission outside of classr )�split�lenr �
ValueErrorr
�
str_to_dir�intr )r r Zcur�lineZfields�c�pmr r r � from_filei s"
$
zPermMappings.from_filec C s | j | | S )z�Get the permission map for the object permission.
Returns:
PermMap representing the permission
Raises:
KeyError if the object or permission is not defined
)r )r �objr r r r �get� s zPermMappings.getc C s8 y| j | | }W n tk
r2 t|| j| j�S X |S )a Get the permission map for the object permission or a default.
getdefault is the same as get except that a default PermMap is
returned if the object class or permission is not defined. The
default is FLOW_BOTH with a weight of 5.
)r �KeyErrorr
r r )r r* r r( r r r �
getdefault� s
zPermMappings.getdefaultc C s, t }x"|D ]}| j||�}||jB }q
W |S )N)� FLOW_NONEr- r )r r* �permsr r r( r r r �getdefault_direction� s
z!PermMappings.getdefault_directionc C s, d}x"|D ]}| j ||�}||j7 }q
W |S )Nr )r- r
)r r* r/ Ztotalr r( r r r �getdefault_distance� s
z PermMappings.getdefault_distanceN)
r r r r r r) r+ r- r0 r1 r r r r r ^ s
r N)
r Zimplicitly_typed_objectsr. Z FLOW_READZ
FLOW_WRITEr r$ r r
r r r r r �<module> s
sepolgen/__pycache__/classperms.cpython-36.opt-1.pyc 0000644 00000004665 14751155147 0016356 0 ustar 00 3
�� f �
@ s� d dl Z d*Zd diZd
ZdZdZdZdZdZdZ dZ
dZ dd� Z dd� Z
ddlmZ ej� d d � Zd d � Zd d!� Zd"d#� Zd$d%� Zdd&lmZ ej� ed'�Zej� Zej� d(Zd)Z ej e�Z e e � dS )+� N�DEFINE�NAME�TICK�SQUOTE�OBRACE�CBRACE�SEMI�OPAREN�CPAREN�COMMAZdefinez\`z\'z\{z\}z\;z\(z\)z\,z
c C s t j| jd�| _| S )z[a-zA-Z_][a-zA-Z0-9_]*r )�reserved�get�value�type)�t� r � /usr/lib/python3.6/classperms.py�t_NAME. s r c C s t d| jd � | jd� d S )NzIllegal character '%s'r � )�printr �skip)r r r r �t_error3 s r r )�lexc C s8 t | �dkr | d g| d< n| d g| d g | d< dS )zHstatements : define_stmt
| define_stmt statements
� r r N)�len)�pr r r � p_statements: s r c C s | d | d g| d< dS )zOdefine_stmt : DEFINE OPAREN TICK NAME SQUOTE COMMA TICK list SQUOTE CPAREN
� � r Nr )r r r r �
p_define_stmtC s r c C s, | d dkr| d | d< n| d g| d< dS )z2list : NAME
| OBRACE names CBRACE
r �{r r Nr )r r r r �p_listJ s r! c C s6 t | �dkr | d g| d< n| d g| d | d< dS )z+names : NAME
| NAME names
r r r N)r )r r r r �p_namesS s r" c C s t d| j| j| jf � d S )Nz$Syntax error on line %d %s [type=%s])r �linenor r )r r r r �p_error\ s r$ )�yaccz
all_perms.sptz%define(`foo',`{ read write append }')a2 define(`all_filesystem_perms',`{ mount remount unmount getattr relabelfrom relabelto transition associate quotamod quotaget }')
define(`all_security_perms',`{ compute_av compute_create compute_member check_context load_policy compute_relabel compute_user setenforce setbool setsecparam setcheckreqprot }')
)
r r r r r r r r r
r ) �sys�tokensr Zt_TICKZt_SQUOTEZt_OBRACEZt_CBRACEZt_SEMIZt_OPARENZt_CPARENZt_COMMAZt_ignorer r � r r r r! r" r$ r% �open�f�readZtxt�closeZtestZtest2�parse�resultr r r r r �<module> sL
sepolgen/__pycache__/access.cpython-36.pyc 0000644 00000026026 14751155147 0014477 0 ustar 00 3
�� f�. � @ sz d Z ddlmZ ddlmZ ddlmZ dd� ZG dd � d ej�Zd
d � Z G d d
� d
�Z
dd� Z dd� Z G dd� d�Z
dS )aV
Classes representing basic access.
SELinux - at the most basic level - represents access as
the 4-tuple subject (type or context), target (type or context),
object class, permission. The policy language elaborates this basic
access to faciliate more concise rules (e.g., allow rules can have multiple
source or target types - see refpolicy for more information).
This module has objects for representing the most basic access (AccessVector)
and sets of that access (AccessVectorSet). These objects are used in Madison
in a variety of ways, but they are the fundamental representation of access.
� )� refpolicy)�util� )� audit2whyc C sN t | �dkrF| d dkrFyt| dd� � W n tk
r@ dS X dS dS dS )z�Determine if an id is a paramater in the form $N, where N is
an integer.
Returns:
True if the id is a paramater
False if the id is not a paramater
r r �$NFT)�len�int�
ValueError)�id� r � /usr/lib/python3.6/access.py�
is_idparam' s r
c @ sJ e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )� AccessVectora
An access vector is the basic unit of access in SELinux.
Access vectors are the most basic representation of access within
SELinux. It represents the access a source type has to a target
type in terms of an object class and a set of permissions.
Access vectors are distinct from AVRules in that they can only
store a single source type, target type, and object class. The
simplicity of AccessVectors makes them useful for storing access
in a form that is easy to search and compare.
The source, target, and object are stored as string. No checking
done to verify that the strings are valid SELinux identifiers.
Identifiers in the form $N (where N is an integer) are reserved as
interface parameters and are treated as wild cards in many
circumstances.
Properties:
.src_type - The source type allowed access. [String or None]
.tgt_type - The target type to which access is allowed. [String or None]
.obj_class - The object class to which access is allowed. [String or None]
.perms - The permissions allowed to the object class. [IdSet]
.audit_msgs - The audit messages that generated this access vector [List of strings]
.xperms - Extended permissions attached to the AV. [Dictionary {operation: xperm set}]
Nc C sV |r| j |� n d | _d | _d | _tj� | _g | _tj | _
g | _ i | _ d | _
d | _d S )N)� from_list�src_type�tgt_type� obj_classr �IdSet�perms�
audit_msgsr �TERULE�type�data�xperms�__hash__Z
info_flow_dir)�selfZ init_listr r r �__init__S s
zAccessVector.__init__c C sR t |�dk r tdt|� ��|d | _|d | _|d | _tj|dd� �| _dS )ax Initialize an access vector from a list.
Initialize an access vector from a list treating the list as
positional arguments - i.e., 0 = src_type, 1 = tgt_type, etc.
All of the list elements 3 and greater are treated as perms.
For example, the list ['foo_t', 'bar_t', 'file', 'read', 'write']
would create an access vector list with the source type 'foo_t',
target type 'bar_t', object class 'file', and permissions 'read'
and 'write'.
This format is useful for very simple storage to strings or disc
(see to_list) and for initializing access vectors.
� z+List must contain at least four elements %sr r � � N) r r �strr r r r r r )r �listr r r r h s
zAccessVector.from_listc C s$ | j | j| jg}|jt| j�� |S )z�
Convert an access vector to a list.
Convert an access vector to a list treating the list as positional
values. See from_list for more information on how an access vector
is represented in a list.
)r r r �extend�sortedr )r �lr r r �to_list} s zAccessVector.to_listc C sP | j j|j � x<|jD ]2}|| jkr2tj� | j|< | j| j|j| � qW dS )z0Add permissions and extended permissions from AVN)r �updater r ZXpermSetr" )r �av�opr r r �merge� s
zAccessVector.mergec C s | j � S )N)� to_string)r r r r �__str__� s zAccessVector.__str__c C s d| j | j| j| jj� f S )Nzallow %s %s:%s %s;)r r r r Z to_space_str)r r r r r* � s
zAccessVector.to_stringc C sp yRt | j�}| j| j| j|f}t |j�}|j� |j� |j|j|j|f}|||�S ttfk
rj tS X d S )N) r! r r r r �sort�AttributeError� TypeError�NotImplemented)r �other�method�x�a�y�br r r �_compare� s
zAccessVector._compare)N) �__name__�
__module__� __qualname__�__doc__r r r% r) r+ r* r6 r r r r r 8 s
r c C sv t | t�r| gS g }x\| jD ]R}xL| jD ]B}x<| jD ]2}t� }||_||_||_| jj � |_|j
|� q4W q(W q W |S )aQ Convert an avrule into a list of access vectors.
AccessVectors and AVRules are similary, but differ in that
an AVRule can more than one source type, target type, and
object class. This function expands a single avrule into a
list of one or more AccessVectors representing the access
defined in the AVRule.
) �
isinstancer Z src_typesZ tgt_typesZ obj_classesr r r r �copy�append)Zavruler3 r r r �accessr r r �avrule_to_access_vectors� s
r? c @ sT e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd e j
g fd
d�Z ddd�Z d S )�AccessVectorSeta/ A non-overlapping set of access vectors.
An AccessVectorSet is designed to store one or more access vectors
that are non-overlapping. Access can be added to the set
incrementally and access vectors will be added or merged as
necessary. For example, adding the following access vectors using
add_av:
allow $1 etc_t : read;
allow $1 etc_t : write;
allow $1 var_log_t : read;
Would result in an access vector set with the access vectors:
allow $1 etc_t : { read write};
allow $1 var_log_t : read;
c C s i | _ d| _dS )z)Initialize an access vector set.
N)�srcZinfo_dir)r r r r r � s zAccessVectorSet.__init__c c sB x<| j j� D ].}x(|j� D ] }x|j� D ]
}|V q(W qW q W dS )z9Iterate over all of the unique access vectors in the set.N)rA �values)r �tgts�objsr' r r r �__iter__� s zAccessVectorSet.__iter__c C s: d}x0| j j� D ]"}x |j� D ]}|t|�7 }q W qW |S )a5 Return the number of unique access vectors in the set.
Because of the inernal representation of the access vector set,
__len__ is not a constant time operation. Worst case is O(N)
where N is the number of unique access vectors, but the common
case is probably better.
r )rA rB r )r r$ rC rD r r r �__len__� s
zAccessVectorSet.__len__c C s$ g }x| D ]}|j |j� � q
W |S )ab Return the unique access vectors in the set as a list.
The format of the returned list is a set of nested lists,
each access vector represented by a list. This format is
designed to be simply serializable to a file.
For example, consider an access vector set with the following
access vectors:
allow $1 user_t : file read;
allow $1 etc_t : file { read write};
to_list would return the following:
[[$1, user_t, file, read]
[$1, etc_t, file, read, write]]
See AccessVector.to_list for more information.
)r= r% )r r$ r' r r r r% � s
zAccessVectorSet.to_listc C s x|D ]}| j t|�� qW dS )a Add access vectors stored in a list.
See to list for more information on the list format that this
method accepts.
This will add all of the access from the list. Any existing
access vectors in the set will be retained.
N)�add_avr )r r$ r' r r r r s
zAccessVectorSet.from_listNc C s: t � }||_||_||_||_||_||_| j||� dS )z)Add an access vector to the set.
N)r r r r r r r rG ) r r r r r � audit_msgZavc_typer r' r r r �add s zAccessVectorSet.addc C sv | j j|ji �}|j|ji �}|j|jf|krF||j|jf j|� n|||j|jf< |rr||j|jf jj|� dS )z Add an access vector to the set.N) rA �
setdefaultr r r r r) r r= )r r' rH Ztgt�clsr r r rG s zAccessVectorSet.add_av)N)
r7 r8 r9 r: r rE rF r% r r r rI rG r r r r r@ � s
r@ c C s2 t j� }x$| D ] }|j|j� |j|j� qW |S )N)r r rI r r )�avs�typesr' r r r �avs_extract_types* s
rN c C sJ i }x@| D ]8}|j |kr$||j }ntj� }|||j < |j|j� q
W |S )N)r r r r& r )rL r r' �sr r r �avs_extract_obj_perms2 s
rP c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) � RoleTypeSetz�A non-overlapping set of role type statements.
This clas allows the incremental addition of role type statements and
maintains a non-overlapping list of statements.
c C s
i | _ dS )z Initialize an access vector set.N)�
role_types)r r r r r C s zRoleTypeSet.__init__c c s x| j j� D ]
}|V q W dS )zAIterate over all of the unique role allows statements in the set.N)rR rB )r � role_typer r r rE G s zRoleTypeSet.__iter__c C s t | jj� �S )z2Return the unique number of role allow statements.)r rR �keys)r r r r rF L s zRoleTypeSet.__len__c C s> || j kr| j | }ntj� }||_|| j |< |jj|� d S )N)rR r ZRoleType�rolerM rI )r rU r rS r r r rI P s
zRoleTypeSet.addN)r7 r8 r9 r: r rE rF rI r r r r rQ = s
rQ N)r: � r r Zselinuxr r
Z
Comparisonr r? r@ rN rP rQ r r r r �<module> s oj sepolgen/__pycache__/sepolgeni18n.cpython-36.opt-1.pyc 0000644 00000000460 14751155147 0016503 0 ustar 00 3
�� f� � @ s6 y d dl Z e jd�Zej ZW n dd� ZY nX dS )� Nzselinux-pythonc C s | S )N� )�strr r �"/usr/lib/python3.6/sepolgeni18n.py�_ s r )�gettextZ translation�tr r r r r �<module> s
sepolgen/__pycache__/access.cpython-36.opt-1.pyc 0000644 00000026026 14751155147 0015436 0 ustar 00 3
�� f�. � @ sz d Z ddlmZ ddlmZ ddlmZ dd� ZG dd � d ej�Zd
d � Z G d d
� d
�Z
dd� Z dd� Z G dd� d�Z
dS )aV
Classes representing basic access.
SELinux - at the most basic level - represents access as
the 4-tuple subject (type or context), target (type or context),
object class, permission. The policy language elaborates this basic
access to faciliate more concise rules (e.g., allow rules can have multiple
source or target types - see refpolicy for more information).
This module has objects for representing the most basic access (AccessVector)
and sets of that access (AccessVectorSet). These objects are used in Madison
in a variety of ways, but they are the fundamental representation of access.
� )� refpolicy)�util� )� audit2whyc C sN t | �dkrF| d dkrFyt| dd� � W n tk
r@ dS X dS dS dS )z�Determine if an id is a paramater in the form $N, where N is
an integer.
Returns:
True if the id is a paramater
False if the id is not a paramater
r r �$NFT)�len�int�
ValueError)�id� r � /usr/lib/python3.6/access.py�
is_idparam' s r
c @ sJ e Zd ZdZddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )� AccessVectora
An access vector is the basic unit of access in SELinux.
Access vectors are the most basic representation of access within
SELinux. It represents the access a source type has to a target
type in terms of an object class and a set of permissions.
Access vectors are distinct from AVRules in that they can only
store a single source type, target type, and object class. The
simplicity of AccessVectors makes them useful for storing access
in a form that is easy to search and compare.
The source, target, and object are stored as string. No checking
done to verify that the strings are valid SELinux identifiers.
Identifiers in the form $N (where N is an integer) are reserved as
interface parameters and are treated as wild cards in many
circumstances.
Properties:
.src_type - The source type allowed access. [String or None]
.tgt_type - The target type to which access is allowed. [String or None]
.obj_class - The object class to which access is allowed. [String or None]
.perms - The permissions allowed to the object class. [IdSet]
.audit_msgs - The audit messages that generated this access vector [List of strings]
.xperms - Extended permissions attached to the AV. [Dictionary {operation: xperm set}]
Nc C sV |r| j |� n d | _d | _d | _tj� | _g | _tj | _
g | _ i | _ d | _
d | _d S )N)� from_list�src_type�tgt_type� obj_classr �IdSet�perms�
audit_msgsr �TERULE�type�data�xperms�__hash__Z
info_flow_dir)�selfZ init_listr r r �__init__S s
zAccessVector.__init__c C sR t |�dk r tdt|� ��|d | _|d | _|d | _tj|dd� �| _dS )ax Initialize an access vector from a list.
Initialize an access vector from a list treating the list as
positional arguments - i.e., 0 = src_type, 1 = tgt_type, etc.
All of the list elements 3 and greater are treated as perms.
For example, the list ['foo_t', 'bar_t', 'file', 'read', 'write']
would create an access vector list with the source type 'foo_t',
target type 'bar_t', object class 'file', and permissions 'read'
and 'write'.
This format is useful for very simple storage to strings or disc
(see to_list) and for initializing access vectors.
� z+List must contain at least four elements %sr r � � N) r r �strr r r r r r )r �listr r r r h s
zAccessVector.from_listc C s$ | j | j| jg}|jt| j�� |S )z�
Convert an access vector to a list.
Convert an access vector to a list treating the list as positional
values. See from_list for more information on how an access vector
is represented in a list.
)r r r �extend�sortedr )r �lr r r �to_list} s zAccessVector.to_listc C sP | j j|j � x<|jD ]2}|| jkr2tj� | j|< | j| j|j| � qW dS )z0Add permissions and extended permissions from AVN)r �updater r ZXpermSetr" )r �av�opr r r �merge� s
zAccessVector.mergec C s | j � S )N)� to_string)r r r r �__str__� s zAccessVector.__str__c C s d| j | j| j| jj� f S )Nzallow %s %s:%s %s;)r r r r Z to_space_str)r r r r r* � s
zAccessVector.to_stringc C sp yRt | j�}| j| j| j|f}t |j�}|j� |j� |j|j|j|f}|||�S ttfk
rj tS X d S )N) r! r r r r �sort�AttributeError� TypeError�NotImplemented)r �other�method�x�a�y�br r r �_compare� s
zAccessVector._compare)N) �__name__�
__module__� __qualname__�__doc__r r r% r) r+ r* r6 r r r r r 8 s
r c C sv t | t�r| gS g }x\| jD ]R}xL| jD ]B}x<| jD ]2}t� }||_||_||_| jj � |_|j
|� q4W q(W q W |S )aQ Convert an avrule into a list of access vectors.
AccessVectors and AVRules are similary, but differ in that
an AVRule can more than one source type, target type, and
object class. This function expands a single avrule into a
list of one or more AccessVectors representing the access
defined in the AVRule.
) �
isinstancer Z src_typesZ tgt_typesZ obj_classesr r r r �copy�append)Zavruler3 r r r �accessr r r �avrule_to_access_vectors� s
r? c @ sT e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd e j
g fd
d�Z ddd�Z d S )�AccessVectorSeta/ A non-overlapping set of access vectors.
An AccessVectorSet is designed to store one or more access vectors
that are non-overlapping. Access can be added to the set
incrementally and access vectors will be added or merged as
necessary. For example, adding the following access vectors using
add_av:
allow $1 etc_t : read;
allow $1 etc_t : write;
allow $1 var_log_t : read;
Would result in an access vector set with the access vectors:
allow $1 etc_t : { read write};
allow $1 var_log_t : read;
c C s i | _ d| _dS )z)Initialize an access vector set.
N)�srcZinfo_dir)r r r r r � s zAccessVectorSet.__init__c c sB x<| j j� D ].}x(|j� D ] }x|j� D ]
}|V q(W qW q W dS )z9Iterate over all of the unique access vectors in the set.N)rA �values)r �tgts�objsr' r r r �__iter__� s zAccessVectorSet.__iter__c C s: d}x0| j j� D ]"}x |j� D ]}|t|�7 }q W qW |S )a5 Return the number of unique access vectors in the set.
Because of the inernal representation of the access vector set,
__len__ is not a constant time operation. Worst case is O(N)
where N is the number of unique access vectors, but the common
case is probably better.
r )rA rB r )r r$ rC rD r r r �__len__� s
zAccessVectorSet.__len__c C s$ g }x| D ]}|j |j� � q
W |S )ab Return the unique access vectors in the set as a list.
The format of the returned list is a set of nested lists,
each access vector represented by a list. This format is
designed to be simply serializable to a file.
For example, consider an access vector set with the following
access vectors:
allow $1 user_t : file read;
allow $1 etc_t : file { read write};
to_list would return the following:
[[$1, user_t, file, read]
[$1, etc_t, file, read, write]]
See AccessVector.to_list for more information.
)r= r% )r r$ r' r r r r% � s
zAccessVectorSet.to_listc C s x|D ]}| j t|�� qW dS )a Add access vectors stored in a list.
See to list for more information on the list format that this
method accepts.
This will add all of the access from the list. Any existing
access vectors in the set will be retained.
N)�add_avr )r r$ r' r r r r s
zAccessVectorSet.from_listNc C s: t � }||_||_||_||_||_||_| j||� dS )z)Add an access vector to the set.
N)r r r r r r r rG ) r r r r r � audit_msgZavc_typer r' r r r �add s zAccessVectorSet.addc C sv | j j|ji �}|j|ji �}|j|jf|krF||j|jf j|� n|||j|jf< |rr||j|jf jj|� dS )z Add an access vector to the set.N) rA �
setdefaultr r r r r) r r= )r r' rH Ztgt�clsr r r rG s zAccessVectorSet.add_av)N)
r7 r8 r9 r: r rE rF r% r r r rI rG r r r r r@ � s
r@ c C s2 t j� }x$| D ] }|j|j� |j|j� qW |S )N)r r rI r r )�avs�typesr' r r r �avs_extract_types* s
rN c C sJ i }x@| D ]8}|j |kr$||j }ntj� }|||j < |j|j� q
W |S )N)r r r r& r )rL r r' �sr r r �avs_extract_obj_perms2 s
rP c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) � RoleTypeSetz�A non-overlapping set of role type statements.
This clas allows the incremental addition of role type statements and
maintains a non-overlapping list of statements.
c C s
i | _ dS )z Initialize an access vector set.N)�
role_types)r r r r r C s zRoleTypeSet.__init__c c s x| j j� D ]
}|V q W dS )zAIterate over all of the unique role allows statements in the set.N)rR rB )r � role_typer r r rE G s zRoleTypeSet.__iter__c C s t | jj� �S )z2Return the unique number of role allow statements.)r rR �keys)r r r r rF L s zRoleTypeSet.__len__c C s> || j kr| j | }ntj� }||_|| j |< |jj|� d S )N)rR r ZRoleType�rolerM rI )r rU r rS r r r rI P s
zRoleTypeSet.addN)r7 r8 r9 r: r rE rF rI r r r r rQ = s
rQ N)r: � r r Zselinuxr r
Z
Comparisonr r? r@ rN rP rQ r r r r �<module> s oj sepolgen/__pycache__/refparser.cpython-36.opt-1.pyc 0000644 00000070600 14751155147 0016163 0 ustar 00 3
�� f�x � I @ s� d dl Z d dlZd dlZd dlZddlmZ ddlmZ ddlmZ ddlmZ ddlm Z �dZ
d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdOdNdPdQ�4Z dRZ dSZ
dTZdUZdVZdWZdXZdYZdZZd[Zd\Zd]Zd^Zd_Zd`ZdaZdbZ dcZ ddZ dedf� Z dgdh� Z didj� Z!dkdl� Z"dmdn� Z#dodp� Z$dqdr� Z%dsdt� Z&dudv� Z'da(da)dwa*da+dxa,�d dydz�Z-d{d|� Z.d}d~� Z/dd�� Z0d�d�� Z1d�d�� Z2d�d�� Z3d�d�� Z4d�d�� Z5d�d�� Z6d�d�� Z7d�d�� Z8d�d�� Z9d�d�� Z:d�d�� Z;d�d�� Z<d�d�� Z=d�d�� Z>d�d�� Z?d�d�� Z@d�d�� ZAd�d�� ZBd�d�� ZCd�d�� ZDd�d�� ZEd�d�� ZFd�d�� ZGd�d�� ZHd�d�� ZId�d�� ZJd�d�� ZKd�d�� ZLd�d�� ZMd�d�� ZNd�d�� ZOd�d�� ZPd�d ZQd�dĄ ZRd�dƄ ZSd�dȄ ZTd�dʄ ZUd�d̄ ZVd�d΄ ZWd�dЄ ZXd�d҄ ZYd�dԄ ZZd�dք Z[d�d Z\d�dڄ Z]d�d܄ Z^d�dބ Z_d�d� Z`d�d� Zad�d� Zbd�d� Zcd�d� Zdd�d� Zed�d� Zfd�d� Zgd�d� Zhd�d� Zid�d� Zjd�d�� Zkd�d�� Zld�d�� Zmd�d�� Znd�d�� Zodapdaqd��d � Zr�d
�d�d�Zs�d�d� Zt�d �d�d�ZudS ( � N� )�access)�defaults)�lex)� refpolicy)�yacc�TICK�SQUOTE�OBRACE�CBRACE�SEMI�COLON�OPAREN�CPAREN�COMMA�MINUS�TILDE�ASTERISK�AMP�BAR�EXPL�EQUAL�FILENAME�
IDENTIFIER�NUMBER�PATH� IPV6_ADDR�MODULE�
POLICY_MODULE�REQUIRE�SID�GENFSCON� FS_USE_XATTR� FS_USE_TRANS� FS_USE_TASK�PORTCON�NODECON�NETIFCON�PIRQCON�IOMEMCON� IOPORTCON� PCIDEVICECON�
DEVICETREECON�CLASS�
TYPEATTRIBUTE�
ROLEATTRIBUTE�TYPE� ATTRIBUTE�ATTRIBUTE_ROLE�ALIAS� TYPEALIAS�BOOL�TRUE�FALSE�IF�ELSE�ROLE�TYPES�ALLOW� DONTAUDIT�
AUDITALLOW�
NEVERALLOW�
PERMISSIVE�
TYPEBOUNDS�TYPE_TRANSITION� TYPE_CHANGE� TYPE_MEMBER�RANGE_TRANSITION�ROLE_TRANSITION�
OPT_POLICY� INTERFACE�TUNABLE_POLICY�GEN_REQ�TEMPLATE� GEN_CONTEXT�IFELSE�IFDEF�IFNDEF�DEFINE)4�moduleZ
policy_moduleZrequireZsidZgenfscon� fs_use_xattr� fs_use_trans� fs_use_taskZportconZnodeconZnetifconZpirqconZiomemconZ ioportconZ pcideviceconZ
devicetreecon�classZ
typeattributeZ
roleattribute�typeZ attributeZattribute_role�aliasZ typealias�bool�trueZfalse�if�else�role�typesZallow� dontaudit�
auditallow�
neverallowZ
permissiveZ
typeboundsZtype_transition� type_change� type_memberZrange_transitionZrole_transitionZoptional_policy� interfaceZtunable_policyZ gen_require�templateZ gen_contextZifelseZifndef�ifdefZdefinez\`z\'z\{z\}z\;+z\:z\(z\)z\,z\-z\~z\*z\&z\|z\!z\=z[0-9\.]+z/[a-zA-Z0-9)_\.\*/\$]*z c C s | S )z2[a-fA-F0-9]{0,4}:[a-fA-F0-9]{0,4}:([a-fA-F0-9]|:)*� )�trf rf � /usr/lib/python3.6/refparser.py� t_IPV6_ADDR� s ri c C s | j jd7 _dS )zdnl.*\nr N)�lexer�lineno)rg rf rf rh � t_m4comment� s rl c C s | j d� dS )zdefine.*refpolicywarn\(.*\nr N)�skip)rg rf rf rh �t_refpolicywarn1� s rn c C s | j jd7 _dS )zrefpolicywarn\(.*\nr N)rj rk )rg rf rf rh �t_refpolicywarn� s ro c C s t j| jd�| _| S )z#[a-zA-Z_\$][a-zA-Z0-9_\-\+\.\$\*~]*r )�reserved�get�valuerV )rg rf rf rh � t_IDENTIFIER� s rs c C s t j| jd�| _| S )z \"[a-zA-Z0-9_\-\+\.\$\*~ :]+\"r )rp rq rr rV )rg rf rf rh �
t_FILENAME s rt c C s | j jd7 _dS )z\#.*\nr N)rj rk )rg rf rf rh � t_comment s ru c C s t d| jd � | jd� d S )NzIllegal character '%s'r r )�printrr rm )rg rf rf rh �t_error s rw c C s | j jt| j�7 _dS )z\n+N)rj rk �lenrr )rg rf rf rh � t_newline s ry � Tc C sX | d kr d S xF| D ]>}|d kr q||_ |d k rB|jjd||f� q|jjd|� qW d S )Nr )�parent�children�insert)Zstmtsr{ �val�srf rf rh �collect- s
r� c C s8 x2| D ]*}t j|�r&|jt j|�� q|j|� qW d S )N)�sptZhas_key�updateZby_name�add)Zidsr �idrf rf rh �expand9 s
r� c C sN t | �dkr&| d r&tjj| d � n$t | �dkrJ| d rJtjj| d � dS )z^statements : statement
| statements statement
| empty
� r N)rx �mr| �append)�prf rf rh � p_statementsA s r� c C s | d | d< dS )z�statement : interface
| template
| obj_perm_set
| policy
| policy_module_stmt
| module_stmt
r r Nrf )r� rf rf rh � p_statementK s r� c C s dS )zempty :Nrf )r� rf rf rh �p_emptyU s r� c C s. t j� }| d |_| d |_d|_ || d< dS )zHpolicy_module_stmt : POLICY_MODULE OPAREN IDENTIFIER COMMA NUMBER CPAREN� � Tr N)r �ModuleDeclaration�name�version)r� r� rf rf rh �p_policy_module_stmt` s
r� c C s( t j| d �}t| d |� || d< dS )zainterface : INTERFACE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
� � r N)r � Interfacer� )r� �xrf rf rh � p_interfaceh s r� c C s( t j| d �}t| d |� || d< dS )z�template : TEMPLATE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
| DEFINE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
r� r� r N)r ZTemplater� )r� r� rf rf rh �
p_templateo s r� c C s d| d< dS )z4define : DEFINE OPAREN TICK IDENTIFIER SQUOTE CPARENNr rf )r� rf rf rh �p_definew s r� c C sz t | �dkr"| d r"| d | d< nTt | �dkrv| d sL| d rv| d | d< n*| d sb| d | d< n| d | d | d< dS )zlinterface_stmts : policy
| interface_stmts policy
| empty
r� r r N)rx )r� rf rf rh �p_interface_stmts~ s r� c C sF t j� }t| d |dd� t| �dkr8t| d |dd� |g| d< dS ) z�optional_policy : OPT_POLICY OPAREN TICK interface_stmts SQUOTE CPAREN
| OPT_POLICY OPAREN TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
r� T)r~ � r� Fr N)r ZOptionalPolicyr� rx )r� �orf rf rh �p_optional_policy� s
r� c C sP t j� }| d |_t| d |dd� t| �dkrBt| d |dd� |g| d< d S )
z�tunable_policy : TUNABLE_POLICY OPAREN TICK cond_expr SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
| TUNABLE_POLICY OPAREN TICK cond_expr SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
r� r� T)r~ � � Fr N)r Z
TunablePolicy� cond_exprr� rx )r� r� rf rf rh �p_tunable_policy� s
r� c C s dS )a� ifelse : IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA COMMA TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
| IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
| IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
Nrf )r� rf rf rh �p_ifelse� s r� c C sb t j| d �}| d dkr d}nd}t| d ||d� t| �dkrTt| d |dd� |g| d < d
S ) aJ ifdef : IFDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
| IFNDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
| IFDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
r� r re TFr� )r~ r� r N)r ZIfDefr� rx )r� r� �vrf rf rh �p_ifdef� s r� c C s8 t j| d d�}t| �dkr,|jj| d � || d< dS )z�interface_call : IDENTIFIER OPAREN interface_call_param_list CPAREN
| IDENTIFIER OPAREN CPAREN
| IDENTIFIER OPAREN interface_call_param_list CPAREN SEMIr )Zifnamer� r� r N)r Z
InterfaceCallrx �args�extend)r� �irf rf rh �p_interface_call� s r� c C s6 t | �dkr| d | d< n| d d| d g| d< dS )z�interface_call_param : IDENTIFIER
| IDENTIFIER MINUS IDENTIFIER
| nested_id_set
| TRUE
| FALSE
| FILENAME
r� r r �-r� N)rx )r� rf rf rh �p_interface_call_param� s
r� c C s6 t | �dkr | d g| d< n| d | d g | d< dS )z�interface_call_param_list : interface_call_param
| interface_call_param_list COMMA interface_call_param
r� r r r� N)rx )r� rf rf rh �p_interface_call_param_list� s r� c C s$ t j| d �}| d |_|| d< dS )zRobj_perm_set : DEFINE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK names SQUOTE CPARENr� r� r N)r Z
ObjPermSet�perms)r� r rf rf rh �p_obj_perm_set� s
r� c C s | d | d< dS )z�policy : policy_stmt
| optional_policy
| tunable_policy
| ifdef
| ifelse
| conditional
r r Nrf )r� rf rf rh �p_policy� s r� c C s | d r| d g| d< dS )a� policy_stmt : gen_require
| avrule_def
| typerule_def
| typebound_def
| typeattribute_def
| roleattribute_def
| interface_call
| role_def
| role_allow
| permissive
| type_def
| typealias_def
| attribute_def
| attribute_role_def
| range_transition_def
| role_transition_def
| bool
| define
| initial_sid
| genfscon
| fs_use
| portcon
| nodecon
| netifcon
| pirqcon
| iomemcon
| ioportcon
| pcidevicecon
| devicetreecon
r r Nrf )r� rf rf rh �
p_policy_stmt� s r� c C s. t j� }| d |_| d |_d|_ || d< dS )z+module_stmt : MODULE IDENTIFIER NUMBER SEMIr� r� Fr N)r r� r� r� )r� r� rf rf rh �
p_module_stmt s
r� c C s dS )zlgen_require : GEN_REQ OPAREN TICK requires SQUOTE CPAREN
| REQUIRE OBRACE requires CBRACENrf )r� rf rf rh �
p_gen_require! s r� c C s dS )zsrequires : require
| requires require
| ifdef
| requires ifdef
Nrf )r� rf rf rh �
p_requires) s r� c C s dS )z�require : TYPE comma_list SEMI
| ROLE comma_list SEMI
| ATTRIBUTE comma_list SEMI
| ATTRIBUTE_ROLE comma_list SEMI
| CLASS comma_list SEMI
| BOOL comma_list SEMI
Nrf )r� rf rf rh � p_require1 s r� c C sH t j� }| d |_| d |_| d |_t| �dkr<| d |_|| d< dS )z�security_context : IDENTIFIER COLON IDENTIFIER COLON IDENTIFIER
| IDENTIFIER COLON IDENTIFIER COLON IDENTIFIER COLON mls_range_defr r� r� � r� r N)r ZSecurityContext�userr\ rV rx �level)r� r rf rf rh �p_security_context; s
r� c C s | d }| d |_ || d< dS )zQgen_context : GEN_CONTEXT OPAREN security_context COMMA mls_range_def CPAREN
r� r� r N)r� )r� r rf rf rh �
p_gen_contextH s
r� c C s | d | d< dS )z<context : security_context
| gen_context
r r Nrf )r� rf rf rh � p_contextS s r� c C s( t j� }| d |_| d |_|| d< dS )z$initial_sid : SID IDENTIFIER contextr� r� r N)r Z
InitialSidr� �context)r� r rf rf rh �
p_initial_sidY s
r� c C s2 t j� }| d |_| d |_| d |_|| d< dS )z+genfscon : GENFSCON IDENTIFIER PATH contextr� r� r� r N)r ZGenfsCon�
filesystem�pathr� )r� �grf rf rh �
p_genfscon` s
r� c C sn t j� }| d dkr t jj|_n.| d dkr8t jj|_n| d dkrNt jj|_| d |_| d |_|| d< dS ) z�fs_use : FS_USE_XATTR IDENTIFIER context SEMI
| FS_USE_TASK IDENTIFIER context SEMI
| FS_USE_TRANS IDENTIFIER context SEMI
r rR rT rS r� r� r N)r Z
FilesystemUseZXATTRrV ZTASKZTRANSr� r� )r� �frf rf rh �p_fs_usej s
r� c C s` t j� }| d |_t| �dkr4| d |_| d |_n | d d | d |_| d |_|| d< dS )zkportcon : PORTCON IDENTIFIER NUMBER context
| PORTCON IDENTIFIER NUMBER MINUS NUMBER contextr� r� r� r� r� r N)r ZPortConZ port_typerx Z port_numberr� )r� �crf rf rh � p_portcon| s
r� c C s2 t j� }| d |_| d |_| d |_|| d< dS )zanodecon : NODECON NUMBER NUMBER context
| NODECON IPV6_ADDR IPV6_ADDR context
r� r� r� r N)r ZNodeCon�start�endr� )r� �nrf rf rh � p_nodecon� s
r� c C s2 t j� }| d |_| d |_| d |_|| d< dS )z.netifcon : NETIFCON IDENTIFIER context contextr� r� r� r N)r ZNetifConrc Zinterface_contextZpacket_context)r� r� rf rf rh �
p_netifcon� s
r� c C s( t j� }| d |_| d |_|| d< dS )z pirqcon : PIRQCON NUMBER contextr� r� r N)r ZPirqConZ pirq_numberr� )r� r� rf rf rh � p_pirqcon� s
r� c C sV t j� }t| �dkr*| d |_| d |_n | d d | d |_| d |_|| d< dS )zYiomemcon : IOMEMCON NUMBER context
| IOMEMCON NUMBER MINUS NUMBER contextr� r� r� r� r N)r ZIomemConrx Z
device_memr� )r� r� rf rf rh �
p_iomemcon� s
r� c C sV t j� }t| �dkr*| d |_| d |_n | d d | d |_| d |_|| d< dS )z\ioportcon : IOPORTCON NUMBER context
| IOPORTCON NUMBER MINUS NUMBER contextr� r� r� r� r N)r Z IoportConrx Zioportr� )r� r� rf rf rh � p_ioportcon� s
r� c C s( t j� }| d |_| d |_|| d< dS )z*pcidevicecon : PCIDEVICECON NUMBER contextr� r� r N)r Z PciDeviceConZdevicer� )r� r� rf rf rh �p_pcidevicecon� s
r� c C s( t j� }| d |_| d |_|| d< dS )z,devicetreecon : DEVICETREECON NUMBER contextr� r� r N)r Z
DevicetTeeConr� r� )r� r� rf rf rh �p_devicetreecon� s
r� c C s4 | d | d< t | �dkr0| d d | d | d< dS )z[mls_range_def : mls_level_def MINUS mls_level_def
| mls_level_def
r r r� r� r� N)rx )r� rf rf rh �p_mls_range_def� s r� c C s: | d | d< t | �dkr6| d d dj| d � | d< dS )zRmls_level_def : IDENTIFIER COLON comma_list
| IDENTIFIER
r r r� �:�,r� N)rx �join)r� rf rf rh �p_mls_level_def� s r� c C s� t j| d �}t| �dkrD| d dkr8|jj| d � qv| d |_n2t| �dkrv| d |_t| �dkrv|jj| d � || d< dS ) z�type_def : TYPE IDENTIFIER COMMA comma_list SEMI
| TYPE IDENTIFIER SEMI
| TYPE IDENTIFIER ALIAS names SEMI
| TYPE IDENTIFIER ALIAS names COMMA comma_list SEMI
r� r� r� r� r� r� r N)r ZTyperx �
attributesr� �aliases)r� rg rf rf rh �
p_type_def� s
r� c C s t j| d �}|| d< dS )z)attribute_def : ATTRIBUTE IDENTIFIER SEMIr� r N)r Z Attribute)r� �arf rf rh �p_attribute_def� s r� c C s t j| d �}|| d< dS )z3attribute_role_def : ATTRIBUTE_ROLE IDENTIFIER SEMIr� r N)r ZAttribute_Role)r� r� rf rf rh �p_attribute_role_def� s r� c C s( t j� }| d |_| d |_|| d< dS )z5typealias_def : TYPEALIAS IDENTIFIER ALIAS names SEMIr� r� r N)r Z TypeAliasrV r� )r� rg rf rf rh �p_typealias_def� s
r� c C s: t j� }| d |_t| �dkr.|jj| d � || d< dS )zWrole_def : ROLE IDENTIFIER TYPES comma_list SEMI
| ROLE IDENTIFIER SEMIr� r� r N)r ZRoler\ rx r] r� )r� �rrf rf rh �
p_role_def s
r� c C s( t j� }| d |_| d |_|| d< dS )z#role_allow : ALLOW names names SEMIr� r� r N)r Z RoleAllowZ src_rolesZ tgt_roles)r� r� rf rf rh � p_role_allow s
r� c C s dS )z"permissive : PERMISSIVE names SEMINrf )r� rf rf rh � p_permissive s r� c C s� t j� }| d dkr t jj|_n.| d dkr8t jj|_n| d dkrNt jj|_| d |_| d |_| d |_| d |_ || d < d
S ) z�avrule_def : ALLOW names names COLON names names SEMI
| DONTAUDIT names names COLON names names SEMI
| AUDITALLOW names names COLON names names SEMI
| NEVERALLOW names names COLON names names SEMI
r r^ r_ r` r� r� r� r� r N)
r �AVRuler= � rule_typer> r? � src_types� tgt_types� obj_classesr� )r� r� rf rf rh � p_avrule_def s
r� c C st t j� }| d dkr t jj|_n| d dkr6t jj|_| d |_| d |_| d |_| d |_| d |_ || d < d
S ) a� typerule_def : TYPE_TRANSITION names names COLON names IDENTIFIER SEMI
| TYPE_TRANSITION names names COLON names IDENTIFIER FILENAME SEMI
| TYPE_TRANSITION names names COLON names IDENTIFIER IDENTIFIER SEMI
| TYPE_CHANGE names names COLON names IDENTIFIER SEMI
| TYPE_MEMBER names names COLON names IDENTIFIER SEMI
r ra rb r� r� r� r� r� r N)
r ZTypeRulerC r� rD r� r� r� Z dest_type� file_name)r� rg rf rf rh �p_typerule_def* s
r� c C s. t j� }| d |_|jj| d � || d< dS )z5typebound_def : TYPEBOUNDS IDENTIFIER comma_list SEMIr� r� r N)r Z TypeBoundrV r� r� )r� rg rf rf rh �p_typebound_def= s
r� c C s8 t j� }| d |_| d dkr&d|_nd|_|| d< dS )zIbool : BOOL IDENTIFIER TRUE SEMI
| BOOL IDENTIFIER FALSE SEMIr� r� rY TFr N)r ZBoolr� �state)r� �brf rf rh �p_boolD s
r� c C sP t j� }| d |_t| d |dd� t| �dkrBt| d |dd� |g| d< d S )
z� conditional : IF OPAREN cond_expr CPAREN OBRACE interface_stmts CBRACE
| IF OPAREN cond_expr CPAREN OBRACE interface_stmts CBRACE ELSE OBRACE interface_stmts CBRACE
r� r� T)r~ r� �
Fr N)r Z Conditionalr� r� rx )r� r� rf rf rh �
p_conditionalO s
r� c C s. t j� }| d |_|jj| d � || d< dS )z<typeattribute_def : TYPEATTRIBUTE IDENTIFIER comma_list SEMIr� r� r N)r Z
TypeAttributerV r� r� )r� rg rf rf rh �p_typeattribute_defZ s
r� c C s. t j� }| d |_|jj| d � || d< dS )z<roleattribute_def : ROLEATTRIBUTE IDENTIFIER comma_list SEMIr� r� r N)r Z
RoleAttributer\ Zroleattributesr� )r� rg rf rf rh �p_roleattribute_defa s
r� c C s dS )z�range_transition_def : RANGE_TRANSITION names names COLON names mls_range_def SEMI
| RANGE_TRANSITION names names names SEMINrf )r� rf rf rh �p_range_transition_defh s r� c C s dS )z<role_transition_def : ROLE_TRANSITION names names names SEMINrf )r� rf rf rh �p_role_transition_defm s r� c C sj t | �}|dkr | d g| d< nF|dkr@| d g| d | d< n&| d | d | d g | d | d< dS )a cond_expr : IDENTIFIER
| EXPL cond_expr
| cond_expr AMP AMP cond_expr
| cond_expr BAR BAR cond_expr
| cond_expr EQUAL EQUAL cond_expr
| cond_expr EXPL EQUAL cond_expr
r� r r r� r� N)rx )r� �lrf rf rh � p_cond_exprq s r� c C sr t j� }t| �dk r$t| d |� nBt| �dkrFt| d |� d|_n t| d g� |jd| d � || d< dS )z�names : identifier
| nested_id_set
| asterisk
| TILDE identifier
| TILDE nested_id_set
| IDENTIFIER MINUS IDENTIFIER
r� r r� Tr� r N)r ZIdSetrx r� Z
complimentr� )r� r rf rf rh �p_names� s r� c C s | d g| d< dS )zidentifier : IDENTIFIERr r Nrf )r� rf rf rh � p_identifier� s r� c C s | d g| d< dS )zasterisk : ASTERISKr r Nrf )r� rf rf rh �
p_asterisk� s r� c C s | d | d< dS )z1nested_id_set : OBRACE nested_id_list CBRACE
r� r Nrf )r� rf rf rh �p_nested_id_set� s r� c C s2 t | �dkr| d | d< n| d | d | d< dS )z`nested_id_list : nested_id_element
| nested_id_list nested_id_element
r� r r N)rx )r� rf rf rh �p_nested_id_list� s r� c C s4 t | �dkr| d | d< nd| d }|g| d< dS )zxnested_id_element : identifier
| MINUS IDENTIFIER
| nested_id_set
r� r r r� N)rx )r� �strrf rf rh �p_nested_id_element� s r� c C s0 t | �dkr | d | d | d< | d | d< dS )zTcomma_list : nested_id_list
| comma_list COMMA nested_id_list
r� r r� r N)rx )r� rf rf rh � p_comma_list� s r� c C s dS )z/optional_semi : SEMI
| emptyNrf )r� rf rf rh �p_optional_semi� s r� c C s& dt | j| j| jf att� dad S )Nz(%s: Syntax error on line %d %s [type=%s]F)�
parse_filerk rr rV �errorrv �success)�tokrf rf rh �p_error� s r� c C s( | si S i }x| D ]}|||j < qW d S )N)r� )r� �mapr� rf rf rh �prep_spt� s
r c C sH t s tj� atjd|dd�a | d k r*| antj� a|s@tj� an|ad S )NZLALRr )�method�debugZ write_tables) �parserr rj r r� r �Module�
SupportMacrosr� )rQ �supportr rf rf rh �create_globals� s
r Fc C s� t |||� dt_daytj| |td� W nB tk
rl } z&d ad adt|� d tj � a
W Y d d }~X nX ts�d adt
}t |��t S )Nr T)r rj zinternal parser error: %s�
zcould not parse text: "%s")
r rj rk r� r �parse� Exceptionr� � traceback�
format_excr� �
ValueErrorr� )�textrQ r r �e�msgrf rf rh r
� s *r
c C s� g }d }x�t j| �D ]�\}}}x�|D ]~}t jj|�}t jj||�}|d dkr�|dkr\|}q�ttjd|d ��r�|j|d |f� q$|d dkr$|j|d |f� q$W qW ||fS )Nr z.sptzobj_perm_sets.sptZpatternsr z.if) �os�walkr� �splitextr� rx �re�findallr� ) �root�modules�support_macros�dirpathZdirnames� filenamesr� �modname�filenamerf rf rh � list_headers
s
r c s> ddl m} tj� }g }d }tjj| �r|tjj| �d }|dkrLtd| ��tjj |�} |j
| d | f� t t j
� �\}
}n t | �\}}|r�| r�td���fdd��d � �fd d
� } d } |�r8�d | � tj� } | || � |jj
| � tjd �}
tjd
dddddddddg
�}|
jj
tj|�� |jj
|
� �d� ��rd� �rd|jtjt|�d�}|jd� g }x�|D ]�}tj� }|d |_y*|�r�| |d || � n| |d |� W nF tk
�r� } z(�t|�d � |j
|d � �wnW Y d d }~X nX |jj
|� ��rn� �rn|j � �qnW t|��r:�dd j |� � |S ) Nr )�utilrz zInvalid file name %sr z1could not find support macros (obj_perm_sets.spt)c s � r� j | � d S )N)�write)r )�outputrf rh r� 3 s zparse_headers.<locals>.oc s� � r�d| � y.t | �}|j� }|j� | at|||� � W nT tk
r^ } zd S d }~X n6 tk
r� } ztd| t|�f ��W Y d d }~X nX d S )Nzparsing file %s
zerror parsing file %s: %s)�open�read�closer� r
�IOErrorr r� )r� rQ r� �fdZtxtr )r r� rf rh r� 7 s z!parse_headers.<locals>.parse_filez Parsing support macros (%s): �can_execz$1z$2�fileZexecute_no_transr" r# �getattr�lockZexecuteZioctlzdone.
)ZstepszParsing interface filesr z failed to parse some headers: %sz, )N) rz r r ZHeadersr r� �isfile�splitr r r� r r �headersr r| r� r Z AccessVectorr� ZConsoleProgressBar�sys�stdoutrx r� r r� r� �stepr� )r r! r� r r r- r r r� r Z all_modulesr� r� r' �avZstatusZfailuresr� r� r rf )r r� r! rh �
parse_headers sb
r2 )Ir r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP )N)NNF)NTF)vr. r r r rz r r r r r �tokensrp Zt_TICKZt_SQUOTEZt_OBRACEZt_CBRACEZt_SEMIZt_COLONZt_OPARENZt_CPARENZt_COMMAZt_MINUSZt_TILDEZ
t_ASTERISKZt_AMPZt_BARZt_EXPLZt_EQUALZt_NUMBERZt_PATHZt_ignoreri rl rn ro rs rt ru rw ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r rj r r
r r2 rf rf rf rh �<module> s�
"
sepolgen/__pycache__/defaults.cpython-36.opt-1.pyc 0000644 00000004306 14751155147 0016001 0 ustar 00 3
�� fU � @ sT d dl Z d dlZG dd� de�Zdd� Zdd� Zdd � Zd
d � Zd d
� Zdd� Z dS )� Nc @ s e Zd Zdd� Zddd�ZdS )� PathChooserc
C s� t � | _tjj|�s(d| _d| jd< d S || _tjd�}tjd�}t|d��`}xXt |�D ]L\}}|j
|�rlqX|j
|�}|s�t d||d f ��|j d �| j|j d�< qXW W d Q R X d S )
Nz
(defaults)zJ/usr/share/selinux/default:/usr/share/selinux/mls:/usr/share/selinux/devel�SELINUX_DEVEL_PATHz
^\s*(?:#.+)?$z^\s*(\w+)\s*=\s*(.+?)\s*$�rz(%s:%d: line is not in key = value format� � )
�dict�config�os�path�exists�config_pathname�re�compile�open� enumerate�match�
ValueError�group)�self�pathname�ignoreZconsider�fd�lineno�line�mo� r � /usr/lib/python3.6/defaults.py�__init__ s
zPathChooser.__init__r c C sp | j j|d �}|d kr(td|| jf ��|jd�}x*|D ]"}tjj||�}tjj|�r8|S q8W tjj|d |�S )Nz%s was not in %s�:r ) r �getr r �splitr r
�joinr )r Z testfilenameZpathset�paths�p�targetr r r �__call__, s
zPathChooser.__call__N)r )�__name__�
__module__� __qualname__r r% r r r r r s r c C s dS )Nz/var/lib/sepolgenr r r r r �data_dir; s r) c C s
t � d S )Nz /perm_map)r) r r r r �perm_map> s r* c C s
t � d S )Nz/interface_info)r) r r r r �interface_infoA s r+ c C s
t � d S )Nz/attribute_info)r) r r r r �attribute_infoD s r, c C s( t d�} | d�}tjj|�s$| d�}|S )Nz/etc/selinux/sepolgen.conf�Makefilezinclude/Makefile)r r r
r )�chooser�resultr r r �refpolicy_makefileG s
r0 c C s t d�} | d�S )Nz/etc/selinux/sepolgen.conf�include)r )r. r r r �headersN s r2 )
r r
�objectr r) r* r+ r, r0 r2 r r r r �<module> s " sepolgen/__pycache__/output.cpython-36.opt-1.pyc 0000644 00000006656 14751155147 0015544 0 ustar 00 3
�� f� � @ sp d Z ddlmZ ddlmZ ejr.ddlmZ G dd� d�Zdd� Zd d
� Zd d � Z d
d� Z
dd� Z dd� Z dS )ai
Classes and functions for the output of reference policy modules.
This module takes a refpolicy.Module object and formats it for
output using the ModuleWriter object. By separating the output
in this way the other parts of Madison can focus solely on
generating policy. This keeps the semantic / syntactic issues
cleanly separated from the formatting issues.
� )� refpolicy)�util)�cmpc @ s e Zd Zdd� Zdd� ZdS )� ModuleWriterc C s d | _ d | _d| _d| _d S )NT)�fd�module�sort�requires)�self� r � /usr/lib/python3.6/output.py�__init__& s zModuleWriter.__init__c C sJ || _ | jrt| j � x.tj| j dd�D ]\}}|jdt|� � q(W d S )NT)Z showdepthz%s
)r r � sort_filterr Zwalktree�write�str)r
r r �node�depthr r r r , s
zModuleWriter.writeN)�__name__�
__module__� __qualname__r
r r r r r r % s r c C s� t j| �}|j� t j|�}|j� t|�t|�krFt|d |d �S x4t||�D ]&}|d |d krRt|d |d �S qRW dS )N� r )r Z set_to_listr �lenr �zip)�x�yZxlZyl�vr r r �
id_set_cmp= s
r c C sd t | j|j�}|dkr|S t | j|j�}|dkr4|S t | j|j�}|dkrN|S tt| j�t|j��S )Nr )r � src_typesZ tgt_typesZ obj_classesr r Zperms)�a�b�retr r r �
avrule_cmpK s r! c C s8 | j d |j d kr*t| j d |j d �S t| j|j�S )Nr )�argsr Zifname)r r r r r �
ifcall_cmpZ s r# c C sf t | tj�r8t |tj�r"t| |�S t| jd g|j�S n*t |tj�rNt| |�S t| j|jd g�S d S )Nr ) �
isinstancer �
InterfaceCallr# r r" r ZAVRuler! )r r r r r �rule_cmp` s
r& c C s t | j|j�S )N)r Zrole)r r r r r �
role_type_cmpl s r' c C s& dd� }x| j � D ] }||� qW dS )z/Sort and group the output for readability.
c S s� g }x(| j � D ] }|j|� |jtj� � qW x| j� D ]}|j|� q8W |jtj� � g }|j| j� � |j| j� � |jt j
t �d� d }g }x||D ]t}t |tj
�r�|jd }n t j|j�}||k�r|r�|jtj� � |}tj� } | jjd| � |j| � |j|� q�W |j|� g }
|
j| j� � |
jt j
t�d� t|
��rftj� } | jjd� |j| � |j|
� x$| jD ]} | |k�rx|j| � �qxW || _d S )N)�keyr z ============= %s ==============z"============= ROLES ==============)Zmodule_declarations�appendr �Commentr �extendZavrulesZinterface_callsr r �
cmp_to_keyr& r$ r% r" �firstr �linesZ
role_typesr' r Zchildren) r �c�modZrequireZrulesZcurZ sep_rulesZruler ZcommentZrasZchildr r r � sort_noder sL
z sort_filter.<locals>.sort_nodeN)Znodes)r r1 r r r r r o s <r N)
�__doc__� r r ZPY3r r r r! r# r& r' r r r r r �<module> s sepolgen/__pycache__/policygen.cpython-36.pyc 0000644 00000031111 14751155147 0015216 0 ustar 00 3
�� f�; � @ s� d Z ddlZddlZddljZy ddlT W n Y nX ddlmZ ddlmZ ddlm Z ddlm
Z
dd lm Z dd
lm Z dZ
dZd ZG d d
� d
�Zdefdd�Zdd� ZG dd� d�Zdd� ZdS )z>
classes and algorithms for the generation of SELinux policy.
� N)�*� )� refpolicy)� objectmodel)�access)�
interfaces)�matching)�util� c @ s� e Zd ZdZd dd�Zd dd�Zd!dd �Zefd
d �Zd d
� Z dd� Z
dd� Z d"dd�Z dd� Z
dd� Zdd� Zdd � Zd d � ZdS )#�PolicyGeneratora� Generate a reference policy module from access vectors.
PolicyGenerator generates a new reference policy module
or updates an existing module based on requested access
in the form of access vectors.
It generates allow rules and optionally module require
statements, reference policy interfaces, and extended
permission access vector rules. By default only allow rules
are generated. The methods .set_gen_refpol, .set_gen_requires
and .set_gen_xperms turns on interface generation,
requires generation, and xperms rules genration respectively.
PolicyGenerator can also optionally add comments explaining
why a particular access was allowed based on the audit
messages that generated the access. The access vectors
passed in must have the .audit_msgs field set correctly
and .explain set to SHORT|LONG_EXPLANATION to enable this
feature.
The module created by PolicyGenerator can be passed to
output.ModuleWriter to output a text representation.
Nc C s> d| _ t| _d| _|r || _n
tj� | _d| _d| _d| _ dS )z�Initialize a PolicyGenerator with an optional
existing module.
If the module paramater is not None then access
will be added to the passed in module. Otherwise
a new reference policy module will be created.
NF)
�ifgen�NO_EXPLANATION�explain� gen_requires�moduler ZModule� dontaudit�xperms�domains)�selfr � r � /usr/lib/python3.6/policygen.py�__init__E s
zPolicyGenerator.__init__c C s* |rt ||�| _d| _nd| _| j� dS )a? Set whether reference policy interfaces are generated.
To turn on interface generation pass in an interface set
to use for interface generation. To turn off interface
generation pass in None.
If interface generation is enabled requires generation
will also be enabled.
TN)�InterfaceGeneratorr r �"_PolicyGenerator__set_module_style)r Zif_set� perm_mapsr r r �set_gen_refpolY s
z PolicyGenerator.set_gen_refpolTc C s
|| _ dS )a& Set whether module requires are generated.
Passing in true will turn on requires generation and
False will disable generation. If requires generation is
disabled interface generation will also be disabled and
can only be re-enabled via .set_gen_refpol.
N)r )r Zstatusr r r �set_gen_requiresk s z PolicyGenerator.set_gen_requiresc C s
|| _ dS )z)Set whether access is explained.
N)r )r r r r r �set_gen_explainu s z PolicyGenerator.set_gen_explainc C s
|| _ d S )N)r )r r r r r �set_gen_dontauditz s z!PolicyGenerator.set_gen_dontauditc C s
|| _ dS )zSSet whether extended permission access vector rules
are generated.
N)r )r r r r r �set_gen_xperms} s z PolicyGenerator.set_gen_xpermsc C s. | j r d}nd}x| jj� D ]
}||_q W d S )NTF)r r �module_declarationsr )r r �modr r r Z__set_module_style� s
z"PolicyGenerator.__set_module_style�1.0c C s\ d}x| j j� D ]}|}qW |s8tj� }| j jjd|� ||_||_| jrRd|_nd|_dS )z?Set the name of the module and optionally the version.
Nr TF) r r r ZModuleDeclaration�children�insert�name�versionr )r r% r& �mr! r r r �set_module_name� s z PolicyGenerator.set_module_namec C s | j rt | j� | jS )N)r r )r r r r �
get_module� s
zPolicyGenerator.get_modulec C sv t j|�}| jr|j|_d|_| jr>tt jt || jd���|_|j
t j krl| jd7 _|j
rl| jd7 _|j
t jkr�| jd7 _|j
t jkr�t|j�dkr�| jddjd d
� |jD �� 7 _n | jd |jd d 7 _|j
t jk�rP| jd
7 _| jd7 _| jd|jd 7 _x*|jdd� D ]}| jd| 7 _�q4W �y|j
t jk�rTd|jk�rTd|jk�s�d|jk�rT| j�s�ttdd�d d | _g }xHdd
� tt gt|jt |jt |ji�D �D ] }|| jk�r�|j |� �q�W t|�dk�r$| jd|j|jdj|�f 7 _n0t|�dk�rT| jd|j|jdj|�f 7 _W n Y nX | j j j |� dS )z Add access vector rule.
� )� verbosityz0
#!!!! This avc is allowed in the current policyzN
#!!!! This av rule may have been overridden by an extended permission av rulez:
#!!!! This avc has a dontaudit rule in the current policyr zH
#!!!! This avc can be allowed using one of the these booleans:
# %sz, c S s g | ] }|d �qS )r r )�.0�xr r r �
<listcomp>� s z1PolicyGenerator.__add_av_rule.<locals>.<listcomp>z5
#!!!! This avc can be allowed using the boolean '%s'r z�
#!!!! This avc is a constraint violation. You would need to modify the attributes of either the source or target types to allow this access.z
#Constraint rule: z
# Nz?
# Possible cause is the source %s and target %s are different.�write�dir�openZdomain)r% �typesc S s g | ] }|t �qS r )ZTCONTEXT)r, r- r r r r. � s zL
#!!!! The source type '%s' can write to a '%s' of the following type:
# %s
zM
#!!!! The source type '%s' can write to a '%s' of the following types:
# %s
)!r ZAVRuler Z DONTAUDIT� rule_type�commentr �str�Comment�explain_access�type� audit2whyZALLOWr ZBOOLEAN�len�data�joinZ
CONSTRAINTZTERULE�perms� obj_classr ZseinfoZ ATTRIBUTEZsesearchZSCONTEXT�src_typeZCLASSZPERMS�appendr r# )r �avZrule�reasonr2 �ir r r Z
__add_av_rule� sN
& . $&z PolicyGenerator.__add_av_rulec C s@ x:|j j� D ],}tj||�}| jr*|j|_| jjj |� q W dS )z5Add extended permission access vector rules.
N)
r �keysr Z AVExtRuler ZDONTAUDITXPERMr3 r r# r@ )r rA �opZextruler r r Z__add_ext_av_rules� s
z"PolicyGenerator.__add_ext_av_rulesc C s` | j r*| j j|| j�\}}| jjj|� n|}x,|D ]$}| j|� | jr4|jr4| j|� q4W dS )zJAdd the access from the access vector set to this
module.
N) r �genr r r# �extend� _PolicyGenerator__add_av_ruler �"_PolicyGenerator__add_ext_av_rules)r Zav_setZ raw_allow�ifcallsrA r r r �
add_access� s
zPolicyGenerator.add_accessc C s x|D ]}| j jj|� qW d S )N)r r# r@ )r Z
role_type_set� role_typer r r �add_role_types� s
z PolicyGenerator.add_role_types)N)NN)T)r" )�__name__�
__module__� __qualname__�__doc__r r r �SHORT_EXPLANATIONr r r r r( r) rH rI rK rM r r r r r - s
5 r c s g �� �fdd�}|t kr�x�| jD ]�}�jd|j � �jdt|j�t|j�f � �jd|jtj |j
�f � �jd|j |j |j
f � �jtjd|j d d d
d d �� q"W |� nb|�r�jd
| j| j| j| jj� f � t| j�dk�r| jd }�jd|j |j |j
f � |� �S )a� Explain why a policy statement was generated.
Return a string containing a text explanation of
why a policy statement was generated. The string is
commented and wrapped and can be directly inserted
into a policy.
Params:
av - access vector representing the access. Should
have .audit_msgs set appropriately.
verbosity - the amount of explanation provided. Should
be set to NO_EXPLANATION, SHORT_EXPLANATION, or
LONG_EXPLANATION.
Returns:
list of strings - strings explaining the access or an empty
string if verbosity=NO_EXPLANATION or there is not sufficient
information to provide an explanation.
c sN � sd S �j d� x6� j� D ]*} t| j� j�}�j d|j� | jf � q W d S )Nz Interface options:z %s # [%d])r@ �all�call_interface� interfacerA Z to_stringZdist)�match�ifcall)�ml�sr r �explain_interfaces s
z*explain_access.<locals>.explain_interfacesz %sz scontext="%s" tcontext="%s"z class="%s" perms="%s"z comm="%s" exe="%s" path="%s"z message="�"�P z z )Zinitial_indentZsubsequent_indentz) src="%s" tgt="%s" class="%s", perms="%s"r z comm="%s" exe="%s" path="%s")�LONG_EXPLANATIONZ
audit_msgsr@ �headerr5 ZscontextZtcontextZtclassr Zlist_to_space_strZaccessesZcommZexe�pathrG �textwrapZwrap�messager? �tgt_typer> r= Z to_space_strr: )rA rX r+ rZ �msgr )rX rY r r7 � s*
r7 c C s� g }g }|j | jj� � |jdd� dd� tj� }| j|_x�tt |��D ]z}|| j
tj krl|j j
|j� qH|| j
tjkr�|j j
|j� qH|| j
tjkr�|j j
|j� qHt|| j
� dsHt�qHW t |j �dks�t�|S )Nc S s | j S )N)�num)�paramr r r �<lambda>9 s z call_interface.<locals>.<lambda>T)�key�reverser )rG �params�values�sortr Z
InterfaceCallr% Zifname�ranger: r8 �SRC_TYPE�argsr@ r? �TGT_TYPErb � OBJ_CLASSr> �print�AssertionError)rU rA ri rn rW rC r r r rT 4 s" rT c @ s. e Zd Zd
dd�Zdd� Zdd� Zdd � ZdS ) r Nc C s& || _ | j|� tj|�| _g | _d S )N)�ifs�hack_check_ifsr Z
AccessMatcher�matcher�calls)r rs r r r r r N s
zInterfaceGenerator.__init__c C s� x�|j j� D ]|}g }|j|jj� � |jdd� dd� xPtt|��D ]@}|d || jkrbd|_P || j t
j t
j t
j
gkrDd|_P qDW q W d S )Nc S s | j S )N)rd )re r r r rf \ s z3InterfaceGenerator.hack_check_ifs.<locals>.<lambda>T)rg rh r F)r rj rG ri rk rl r: rd Zenabledr8 r rm ro rp )r rs r- ri rC r r r rt T s
z!InterfaceGenerator.hack_check_ifsc C s� | j |�}g }xH| jD ]>}t|j� j|j�}|rFtjt|j||��|_ |j
||f� qW g }xX|D ]P\}}d} x4|D ],}
|
j |�rt|
j r�|j r�|
j j |j � d} qtW | sb|j
|� qbW ||fS )NFT)
rV rv rT ZbestrU rA r r6 r7 r4 r@ Zmatches�merge) r �avsr+ �raw_avrJ rX rW �drs �foundZo_ifcallr r r rF k s$
zInterfaceGenerator.genc C sP g }xF|D ]>}t j� }| jj| j||� t|�r>| jj|� q
|j|� q
W |S )N)r Z MatchListru Z
search_ifsrs r: rv r@ )r rx ry rA Zansr r r rV � s
zInterfaceGenerator.match)N)rN rO rP r rt rF rV r r r r r M s
r c C s& dd� }x| j � D ] }||� qW dS )z*Add require statements to the module.
c S s� t j� }xJ| j� D ]>}|jj|j� |jj|j� x |jD ]}|j||j � q:W qW x,| j
� D ] }x|j D ]}|jj |� qjW q^W x,| j
� D ] }|jj |j� |jj|j� q�W |jjd� | jjd|� d S )Nr r )r ZRequireZavrulesr2 �updateZ src_typesZ tgt_typesZ obj_classesZ
add_obj_classr= Zinterface_callsrn �addZ
role_typesZrolesZrole�discardr# r$ )�node�rZavrule�objrW �argrL r r r �collect_requires� s z&gen_requires.<locals>.collect_requiresN)Znodes)r r� r r r r r � s r )rQ � itertoolsr` Zselinux.audit2whyr9 Zsetoolsr* r r r r r r r
rR r] r r7 rT r r r r r r �<module> s,
Q7B sepolgen/policygen.py 0000644 00000035770 14751155147 0010751 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
classes and algorithms for the generation of SELinux policy.
"""
import itertools
import textwrap
import selinux.audit2why as audit2why
try:
from setools import *
except:
pass
from . import refpolicy
from . import objectmodel
from . import access
from . import interfaces
from . import matching
from . import util
# Constants for the level of explanation from the generation
# routines
NO_EXPLANATION = 0
SHORT_EXPLANATION = 1
LONG_EXPLANATION = 2
class PolicyGenerator:
"""Generate a reference policy module from access vectors.
PolicyGenerator generates a new reference policy module
or updates an existing module based on requested access
in the form of access vectors.
It generates allow rules and optionally module require
statements, reference policy interfaces, and extended
permission access vector rules. By default only allow rules
are generated. The methods .set_gen_refpol, .set_gen_requires
and .set_gen_xperms turns on interface generation,
requires generation, and xperms rules genration respectively.
PolicyGenerator can also optionally add comments explaining
why a particular access was allowed based on the audit
messages that generated the access. The access vectors
passed in must have the .audit_msgs field set correctly
and .explain set to SHORT|LONG_EXPLANATION to enable this
feature.
The module created by PolicyGenerator can be passed to
output.ModuleWriter to output a text representation.
"""
def __init__(self, module=None):
"""Initialize a PolicyGenerator with an optional
existing module.
If the module paramater is not None then access
will be added to the passed in module. Otherwise
a new reference policy module will be created.
"""
self.ifgen = None
self.explain = NO_EXPLANATION
self.gen_requires = False
if module:
self.module = module
else:
self.module = refpolicy.Module()
self.dontaudit = False
self.xperms = False
self.domains = None
def set_gen_refpol(self, if_set=None, perm_maps=None):
"""Set whether reference policy interfaces are generated.
To turn on interface generation pass in an interface set
to use for interface generation. To turn off interface
generation pass in None.
If interface generation is enabled requires generation
will also be enabled.
"""
if if_set:
self.ifgen = InterfaceGenerator(if_set, perm_maps)
self.gen_requires = True
else:
self.ifgen = None
self.__set_module_style()
def set_gen_requires(self, status=True):
"""Set whether module requires are generated.
Passing in true will turn on requires generation and
False will disable generation. If requires generation is
disabled interface generation will also be disabled and
can only be re-enabled via .set_gen_refpol.
"""
self.gen_requires = status
def set_gen_explain(self, explain=SHORT_EXPLANATION):
"""Set whether access is explained.
"""
self.explain = explain
def set_gen_dontaudit(self, dontaudit):
self.dontaudit = dontaudit
def set_gen_xperms(self, xperms):
"""Set whether extended permission access vector rules
are generated.
"""
self.xperms = xperms
def __set_module_style(self):
if self.ifgen:
refpolicy = True
else:
refpolicy = False
for mod in self.module.module_declarations():
mod.refpolicy = refpolicy
def set_module_name(self, name, version="1.0"):
"""Set the name of the module and optionally the version.
"""
# find an existing module declaration
m = None
for mod in self.module.module_declarations():
m = mod
if not m:
m = refpolicy.ModuleDeclaration()
self.module.children.insert(0, m)
m.name = name
m.version = version
if self.ifgen:
m.refpolicy = True
else:
m.refpolicy = False
def get_module(self):
# Generate the requires
if self.gen_requires:
gen_requires(self.module)
"""Return the generated module"""
return self.module
def __add_av_rule(self, av):
"""Add access vector rule.
"""
rule = refpolicy.AVRule(av)
if self.dontaudit:
rule.rule_type = rule.DONTAUDIT
rule.comment = ""
if self.explain:
rule.comment = str(refpolicy.Comment(explain_access(av, verbosity=self.explain)))
if av.type == audit2why.ALLOW:
rule.comment += "\n#!!!! This avc is allowed in the current policy"
if av.xperms:
rule.comment += "\n#!!!! This av rule may have been overridden by an extended permission av rule"
if av.type == audit2why.DONTAUDIT:
rule.comment += "\n#!!!! This avc has a dontaudit rule in the current policy"
if av.type == audit2why.BOOLEAN:
if len(av.data) > 1:
rule.comment += "\n#!!!! This avc can be allowed using one of the these booleans:\n# %s" % ", ".join([x[0] for x in av.data])
else:
rule.comment += "\n#!!!! This avc can be allowed using the boolean '%s'" % av.data[0][0]
if av.type == audit2why.CONSTRAINT:
rule.comment += "\n#!!!! This avc is a constraint violation. You would need to modify the attributes of either the source or target types to allow this access."
rule.comment += "\n#Constraint rule: "
rule.comment += "\n#\t" + av.data[0]
for reason in av.data[1:]:
rule.comment += "\n#\tPossible cause is the source %s and target %s are different." % reason
try:
if ( av.type == audit2why.TERULE and
"write" in av.perms and
( "dir" in av.obj_class or "open" in av.perms )):
if not self.domains:
self.domains = seinfo(ATTRIBUTE, name="domain")[0]["types"]
types=[]
for i in [x[TCONTEXT] for x in sesearch([ALLOW], {SCONTEXT: av.src_type, CLASS: av.obj_class, PERMS: av.perms})]:
if i not in self.domains:
types.append(i)
if len(types) == 1:
rule.comment += "\n#!!!! The source type '%s' can write to a '%s' of the following type:\n# %s\n" % ( av.src_type, av.obj_class, ", ".join(types))
elif len(types) >= 1:
rule.comment += "\n#!!!! The source type '%s' can write to a '%s' of the following types:\n# %s\n" % ( av.src_type, av.obj_class, ", ".join(types))
except:
pass
self.module.children.append(rule)
def __add_ext_av_rules(self, av):
"""Add extended permission access vector rules.
"""
for op in av.xperms.keys():
extrule = refpolicy.AVExtRule(av, op)
if self.dontaudit:
extrule.rule_type = extrule.DONTAUDITXPERM
self.module.children.append(extrule)
def add_access(self, av_set):
"""Add the access from the access vector set to this
module.
"""
# Use the interface generator to split the access
# into raw allow rules and interfaces. After this
# a will contain a list of access that should be
# used as raw allow rules and the interfaces will
# be added to the module.
if self.ifgen:
raw_allow, ifcalls = self.ifgen.gen(av_set, self.explain)
self.module.children.extend(ifcalls)
else:
raw_allow = av_set
# Generate the raw allow rules from the filtered list
for av in raw_allow:
self.__add_av_rule(av)
if self.xperms and av.xperms:
self.__add_ext_av_rules(av)
def add_role_types(self, role_type_set):
for role_type in role_type_set:
self.module.children.append(role_type)
def explain_access(av, ml=None, verbosity=SHORT_EXPLANATION):
"""Explain why a policy statement was generated.
Return a string containing a text explanation of
why a policy statement was generated. The string is
commented and wrapped and can be directly inserted
into a policy.
Params:
av - access vector representing the access. Should
have .audit_msgs set appropriately.
verbosity - the amount of explanation provided. Should
be set to NO_EXPLANATION, SHORT_EXPLANATION, or
LONG_EXPLANATION.
Returns:
list of strings - strings explaining the access or an empty
string if verbosity=NO_EXPLANATION or there is not sufficient
information to provide an explanation.
"""
s = []
def explain_interfaces():
if not ml:
return
s.append(" Interface options:")
for match in ml.all():
ifcall = call_interface(match.interface, ml.av)
s.append(' %s # [%d]' % (ifcall.to_string(), match.dist))
# Format the raw audit data to explain why the
# access was requested - either long or short.
if verbosity == LONG_EXPLANATION:
for msg in av.audit_msgs:
s.append(' %s' % msg.header)
s.append(' scontext="%s" tcontext="%s"' %
(str(msg.scontext), str(msg.tcontext)))
s.append(' class="%s" perms="%s"' %
(msg.tclass, refpolicy.list_to_space_str(msg.accesses)))
s.append(' comm="%s" exe="%s" path="%s"' % (msg.comm, msg.exe, msg.path))
s.extend(textwrap.wrap('message="' + msg.message + '"', 80, initial_indent=" ",
subsequent_indent=" "))
explain_interfaces()
elif verbosity:
s.append(' src="%s" tgt="%s" class="%s", perms="%s"' %
(av.src_type, av.tgt_type, av.obj_class, av.perms.to_space_str()))
# For the short display we are only going to use the additional information
# from the first audit message. For the vast majority of cases this info
# will always be the same anyway.
if len(av.audit_msgs) > 0:
msg = av.audit_msgs[0]
s.append(' comm="%s" exe="%s" path="%s"' % (msg.comm, msg.exe, msg.path))
explain_interfaces()
return s
def call_interface(interface, av):
params = []
args = []
params.extend(interface.params.values())
params.sort(key=lambda param: param.num, reverse=True)
ifcall = refpolicy.InterfaceCall()
ifcall.ifname = interface.name
for i in range(len(params)):
if params[i].type == refpolicy.SRC_TYPE:
ifcall.args.append(av.src_type)
elif params[i].type == refpolicy.TGT_TYPE:
ifcall.args.append(av.tgt_type)
elif params[i].type == refpolicy.OBJ_CLASS:
ifcall.args.append(av.obj_class)
else:
print(params[i].type)
assert(0)
assert(len(ifcall.args) > 0)
return ifcall
class InterfaceGenerator:
def __init__(self, ifs, perm_maps=None):
self.ifs = ifs
self.hack_check_ifs(ifs)
self.matcher = matching.AccessMatcher(perm_maps)
self.calls = []
def hack_check_ifs(self, ifs):
# FIXME: Disable interfaces we can't call - this is a hack.
# Because we don't handle roles, multiple paramaters, etc.,
# etc., we must make certain we can actually use a returned
# interface.
for x in ifs.interfaces.values():
params = []
params.extend(x.params.values())
params.sort(key=lambda param: param.num, reverse=True)
for i in range(len(params)):
# Check that the paramater position matches
# the number (e.g., $1 is the first arg). This
# will fail if the parser missed something.
if (i + 1) != params[i].num:
x.enabled = False
break
# Check that we can handle the param type (currently excludes
# roles.
if params[i].type not in [refpolicy.SRC_TYPE, refpolicy.TGT_TYPE,
refpolicy.OBJ_CLASS]:
x.enabled = False
break
def gen(self, avs, verbosity):
raw_av = self.match(avs)
ifcalls = []
for ml in self.calls:
ifcall = call_interface(ml.best().interface, ml.av)
if verbosity:
ifcall.comment = refpolicy.Comment(explain_access(ml.av, ml, verbosity))
ifcalls.append((ifcall, ml))
d = []
for ifcall, ifs in ifcalls:
found = False
for o_ifcall in d:
if o_ifcall.matches(ifcall):
if o_ifcall.comment and ifcall.comment:
o_ifcall.comment.merge(ifcall.comment)
found = True
if not found:
d.append(ifcall)
return (raw_av, d)
def match(self, avs):
raw_av = []
for av in avs:
ans = matching.MatchList()
self.matcher.search_ifs(self.ifs, av, ans)
if len(ans):
self.calls.append(ans)
else:
raw_av.append(av)
return raw_av
def gen_requires(module):
"""Add require statements to the module.
"""
def collect_requires(node):
r = refpolicy.Require()
for avrule in node.avrules():
r.types.update(avrule.src_types)
r.types.update(avrule.tgt_types)
for obj in avrule.obj_classes:
r.add_obj_class(obj, avrule.perms)
for ifcall in node.interface_calls():
for arg in ifcall.args:
# FIXME - handle non-type arguments when we
# can actually figure those out.
r.types.add(arg)
for role_type in node.role_types():
r.roles.add(role_type.role)
r.types.update(role_type.types)
r.types.discard("self")
node.children.insert(0, r)
# FUTURE - this is untested on modules with any sort of
# nesting
for node in module.nodes():
collect_requires(node)
sepolgen/access.py 0000644 00000027306 14751155147 0010215 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
Classes representing basic access.
SELinux - at the most basic level - represents access as
the 4-tuple subject (type or context), target (type or context),
object class, permission. The policy language elaborates this basic
access to faciliate more concise rules (e.g., allow rules can have multiple
source or target types - see refpolicy for more information).
This module has objects for representing the most basic access (AccessVector)
and sets of that access (AccessVectorSet). These objects are used in Madison
in a variety of ways, but they are the fundamental representation of access.
"""
from . import refpolicy
from . import util
from selinux import audit2why
def is_idparam(id):
"""Determine if an id is a paramater in the form $N, where N is
an integer.
Returns:
True if the id is a paramater
False if the id is not a paramater
"""
if len(id) > 1 and id[0] == '$':
try:
int(id[1:])
except ValueError:
return False
return True
else:
return False
class AccessVector(util.Comparison):
"""
An access vector is the basic unit of access in SELinux.
Access vectors are the most basic representation of access within
SELinux. It represents the access a source type has to a target
type in terms of an object class and a set of permissions.
Access vectors are distinct from AVRules in that they can only
store a single source type, target type, and object class. The
simplicity of AccessVectors makes them useful for storing access
in a form that is easy to search and compare.
The source, target, and object are stored as string. No checking
done to verify that the strings are valid SELinux identifiers.
Identifiers in the form $N (where N is an integer) are reserved as
interface parameters and are treated as wild cards in many
circumstances.
Properties:
.src_type - The source type allowed access. [String or None]
.tgt_type - The target type to which access is allowed. [String or None]
.obj_class - The object class to which access is allowed. [String or None]
.perms - The permissions allowed to the object class. [IdSet]
.audit_msgs - The audit messages that generated this access vector [List of strings]
.xperms - Extended permissions attached to the AV. [Dictionary {operation: xperm set}]
"""
def __init__(self, init_list=None):
if init_list:
self.from_list(init_list)
else:
self.src_type = None
self.tgt_type = None
self.obj_class = None
self.perms = refpolicy.IdSet()
self.audit_msgs = []
self.type = audit2why.TERULE
self.data = []
self.xperms = {}
# when implementing __eq__ also __hash__ is needed on py2
# if object is muttable __hash__ should be None
self.__hash__ = None
# The direction of the information flow represented by this
# access vector - used for matching
self.info_flow_dir = None
def from_list(self, list):
"""Initialize an access vector from a list.
Initialize an access vector from a list treating the list as
positional arguments - i.e., 0 = src_type, 1 = tgt_type, etc.
All of the list elements 3 and greater are treated as perms.
For example, the list ['foo_t', 'bar_t', 'file', 'read', 'write']
would create an access vector list with the source type 'foo_t',
target type 'bar_t', object class 'file', and permissions 'read'
and 'write'.
This format is useful for very simple storage to strings or disc
(see to_list) and for initializing access vectors.
"""
if len(list) < 4:
raise ValueError("List must contain at least four elements %s" % str(list))
self.src_type = list[0]
self.tgt_type = list[1]
self.obj_class = list[2]
self.perms = refpolicy.IdSet(list[3:])
def to_list(self):
"""
Convert an access vector to a list.
Convert an access vector to a list treating the list as positional
values. See from_list for more information on how an access vector
is represented in a list.
"""
l = [self.src_type, self.tgt_type, self.obj_class]
l.extend(sorted(self.perms))
return l
def merge(self, av):
"""Add permissions and extended permissions from AV"""
self.perms.update(av.perms)
for op in av.xperms:
if op not in self.xperms:
self.xperms[op] = refpolicy.XpermSet()
self.xperms[op].extend(av.xperms[op])
def __str__(self):
return self.to_string()
def to_string(self):
return "allow %s %s:%s %s;" % (self.src_type, self.tgt_type,
self.obj_class, self.perms.to_space_str())
def _compare(self, other, method):
try:
x = list(self.perms)
a = (self.src_type, self.tgt_type, self.obj_class, x)
y = list(other.perms)
x.sort()
y.sort()
b = (other.src_type, other.tgt_type, other.obj_class, y)
return method(a, b)
except (AttributeError, TypeError):
# trying to compare to foreign type
return NotImplemented
def avrule_to_access_vectors(avrule):
"""Convert an avrule into a list of access vectors.
AccessVectors and AVRules are similary, but differ in that
an AVRule can more than one source type, target type, and
object class. This function expands a single avrule into a
list of one or more AccessVectors representing the access
defined in the AVRule.
"""
if isinstance(avrule, AccessVector):
return [avrule]
a = []
for src_type in avrule.src_types:
for tgt_type in avrule.tgt_types:
for obj_class in avrule.obj_classes:
access = AccessVector()
access.src_type = src_type
access.tgt_type = tgt_type
access.obj_class = obj_class
access.perms = avrule.perms.copy()
a.append(access)
return a
class AccessVectorSet:
"""A non-overlapping set of access vectors.
An AccessVectorSet is designed to store one or more access vectors
that are non-overlapping. Access can be added to the set
incrementally and access vectors will be added or merged as
necessary. For example, adding the following access vectors using
add_av:
allow $1 etc_t : read;
allow $1 etc_t : write;
allow $1 var_log_t : read;
Would result in an access vector set with the access vectors:
allow $1 etc_t : { read write};
allow $1 var_log_t : read;
"""
def __init__(self):
"""Initialize an access vector set.
"""
self.src = {}
# The information flow direction of this access vector
# set - see objectmodel.py for more information. This
# stored here to speed up searching - see matching.py.
self.info_dir = None
def __iter__(self):
"""Iterate over all of the unique access vectors in the set."""
for tgts in self.src.values():
for objs in tgts.values():
for av in objs.values():
yield av
def __len__(self):
"""Return the number of unique access vectors in the set.
Because of the inernal representation of the access vector set,
__len__ is not a constant time operation. Worst case is O(N)
where N is the number of unique access vectors, but the common
case is probably better.
"""
l = 0
for tgts in self.src.values():
for objs in tgts.values():
l += len(objs)
return l
def to_list(self):
"""Return the unique access vectors in the set as a list.
The format of the returned list is a set of nested lists,
each access vector represented by a list. This format is
designed to be simply serializable to a file.
For example, consider an access vector set with the following
access vectors:
allow $1 user_t : file read;
allow $1 etc_t : file { read write};
to_list would return the following:
[[$1, user_t, file, read]
[$1, etc_t, file, read, write]]
See AccessVector.to_list for more information.
"""
l = []
for av in self:
l.append(av.to_list())
return l
def from_list(self, l):
"""Add access vectors stored in a list.
See to list for more information on the list format that this
method accepts.
This will add all of the access from the list. Any existing
access vectors in the set will be retained.
"""
for av in l:
self.add_av(AccessVector(av))
def add(self, src_type, tgt_type, obj_class, perms, audit_msg=None, avc_type=audit2why.TERULE, data=[]):
"""Add an access vector to the set.
"""
av = AccessVector()
av.src_type = src_type
av.tgt_type = tgt_type
av.obj_class = obj_class
av.perms = perms
av.data = data
av.type = avc_type
self.add_av(av, audit_msg)
def add_av(self, av, audit_msg=None):
"""Add an access vector to the set."""
tgt = self.src.setdefault(av.src_type, { })
cls = tgt.setdefault(av.tgt_type, { })
if (av.obj_class, av.type) in cls:
cls[av.obj_class, av.type].merge(av)
else:
cls[av.obj_class, av.type] = av
if audit_msg:
cls[av.obj_class, av.type].audit_msgs.append(audit_msg)
def avs_extract_types(avs):
types = refpolicy.IdSet()
for av in avs:
types.add(av.src_type)
types.add(av.tgt_type)
return types
def avs_extract_obj_perms(avs):
perms = { }
for av in avs:
if av.obj_class in perms:
s = perms[av.obj_class]
else:
s = refpolicy.IdSet()
perms[av.obj_class] = s
s.update(av.perms)
return perms
class RoleTypeSet:
"""A non-overlapping set of role type statements.
This clas allows the incremental addition of role type statements and
maintains a non-overlapping list of statements.
"""
def __init__(self):
"""Initialize an access vector set."""
self.role_types = {}
def __iter__(self):
"""Iterate over all of the unique role allows statements in the set."""
for role_type in self.role_types.values():
yield role_type
def __len__(self):
"""Return the unique number of role allow statements."""
return len(self.role_types.keys())
def add(self, role, type):
if role in self.role_types:
role_type = self.role_types[role]
else:
role_type = refpolicy.RoleType()
role_type.role = role
self.role_types[role] = role_type
role_type.types.add(type)
sepolgen/util.py 0000644 00000012560 14751155147 0007725 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
import locale
import sys
PY3 = sys.version_info[0] == 3
if PY3:
bytes_type=bytes
string_type=str
else:
bytes_type=str
string_type=unicode
class ConsoleProgressBar:
def __init__(self, out, steps=100, indicator='#'):
self.blocks = 0
self.current = 0
self.steps = steps
self.indicator = indicator
self.out = out
self.done = False
def start(self, message=None):
self.done = False
if message:
self.out.write('\n%s:\n' % message)
self.out.write('%--10---20---30---40---50---60---70---80---90--100\n')
def step(self, n=1):
self.current += n
old = self.blocks
self.blocks = int(round(self.current / float(self.steps) * 100) / 2)
if self.blocks > 50:
self.blocks = 50
new = self.blocks - old
self.out.write(self.indicator * new)
self.out.flush()
if self.blocks == 50 and not self.done:
self.done = True
self.out.write("\n")
def set_to_list(s):
l = []
l.extend(s)
return l
def first(s, sorted=False):
"""
Return the first element of a set.
It sometimes useful to return the first element from a set but,
because sets are not indexable, this is rather hard. This function
will return the first element from a set. If sorted is True, then
the set will first be sorted (making this an expensive operation).
Otherwise a random element will be returned (as sets are not ordered).
"""
if not len(s):
raise IndexError("empty containter")
if sorted:
l = set_to_list(s)
l.sort()
return l[0]
else:
for x in s:
return x
def encode_input(text):
"""Encode given text via preferred system encoding"""
# locale will often find out the correct encoding
encoding = locale.getpreferredencoding()
try:
encoded_text = text.encode(encoding)
except UnicodeError:
# if it fails to find correct encoding then ascii is used
# which may lead to UnicodeError if `text` contains non ascii signs
# utf-8 is our guess to fix the situation
encoded_text = text.encode('utf-8')
return encoded_text
def decode_input(text):
"""Decode given text via preferred system encoding"""
# locale will often find out the correct encoding
encoding = locale.getpreferredencoding()
try:
decoded_text = text.decode(encoding)
except UnicodeError:
# if it fails to find correct encoding then ascii is used
# which may lead to UnicodeError if `text` contains non ascii signs
# utf-8 is our guess to fix the situation
decoded_text = text.decode('utf-8')
return decoded_text
class Comparison():
"""Class used when implementing rich comparison.
Inherit from this class if you want to have a rich
comparison withing the class, afterwards implement
_compare function within your class."""
def _compare(self, other, method):
return NotImplemented
def __eq__(self, other):
return self._compare(other, lambda a, b: a == b)
def __lt__(self, other):
return self._compare(other, lambda a, b: a < b)
def __le__(self, other):
return self._compare(other, lambda a, b: a <= b)
def __ge__(self, other):
return self._compare(other, lambda a, b: a >= b)
def __gt__(self, other):
return self._compare(other, lambda a, b: a > b)
def __ne__(self, other):
return self._compare(other, lambda a, b: a != b)
if sys.version_info < (2,7):
# cmp_to_key function is missing in python2.6
def cmp_to_key(mycmp):
'Convert a cmp= function into a key= function'
class K:
def __init__(self, obj, *args):
self.obj = obj
def __lt__(self, other):
return mycmp(self.obj, other.obj) < 0
def __gt__(self, other):
return mycmp(self.obj, other.obj) > 0
def __eq__(self, other):
return mycmp(self.obj, other.obj) == 0
def __le__(self, other):
return mycmp(self.obj, other.obj) <= 0
def __ge__(self, other):
return mycmp(self.obj, other.obj) >= 0
def __ne__(self, other):
return mycmp(self.obj, other.obj) != 0
return K
else:
from functools import cmp_to_key
def cmp(first, second):
return (first > second) - (second > first)
if __name__ == "__main__":
import time
p = ConsoleProgressBar(sys.stdout, steps=999)
p.start("computing pi")
for i in range(999):
p.step()
time.sleep(0.001)
sepolgen/interfaces.py 0000644 00000040121 14751155147 0011065 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
Classes for representing and manipulating interfaces.
"""
import copy
import itertools
from . import access
from . import refpolicy
from . import objectmodel
from . import matching
from .sepolgeni18n import _
class Param:
"""
Object representing a paramater for an interface.
"""
def __init__(self):
self.__name = ""
self.type = refpolicy.SRC_TYPE
self.obj_classes = refpolicy.IdSet()
self.required = True
def set_name(self, name):
if not access.is_idparam(name):
raise ValueError("Name [%s] is not a param" % name)
self.__name = name
def get_name(self):
return self.__name
name = property(get_name, set_name)
num = property(fget=lambda self: int(self.name[1:]))
def __repr__(self):
return "<sepolgen.policygen.Param instance [%s, %s, %s]>" % \
(self.name, refpolicy.field_to_str[self.type], " ".join(self.obj_classes))
# Helper for extract perms
def __param_insert(name, type, av, params):
ret = 0
if name in params:
p = params[name]
# The entries are identical - we're done
if type == p.type:
return
# Hanldle implicitly typed objects (like process)
if (type == refpolicy.SRC_TYPE or type == refpolicy.TGT_TYPE) and \
(p.type == refpolicy.TGT_TYPE or p.type == refpolicy.SRC_TYPE):
#print name, refpolicy.field_to_str[p.type]
# If the object is not implicitly typed, tell the
# caller there is a likely conflict.
ret = 1
if av:
avobjs = [av.obj_class]
else:
avobjs = []
for obj in itertools.chain(p.obj_classes, avobjs):
if obj in objectmodel.implicitly_typed_objects:
ret = 0
break
# "Promote" to a SRC_TYPE as this is the likely usage.
# We do this even if the above test fails on purpose
# as there is really no sane way to resolve the conflict
# here. The caller can take other actions if needed.
p.type = refpolicy.SRC_TYPE
else:
# There is some conflict - no way to resolve it really
# so we just leave the first entry and tell the caller
# there was a conflict.
ret = 1
else:
p = Param()
p.name = name
p.type = type
params[p.name] = p
if av:
p.obj_classes.add(av.obj_class)
return ret
def av_extract_params(av, params):
"""Extract the paramaters from an access vector.
Extract the paramaters (in the form $N) from an access
vector, storing them as Param objects in a dictionary.
Some attempt is made at resolving conflicts with other
entries in the dict, but if an unresolvable conflict is
found it is reported to the caller.
The goal here is to figure out how interface parameters are
actually used in the interface - e.g., that $1 is a domain used as
a SRC_TYPE. In general an interface will look like this:
interface(`foo', `
allow $1 foo : file read;
')
This is simple to figure out - $1 is a SRC_TYPE. A few interfaces
are more complex, for example:
interface(`foo_trans',`
domain_auto_trans($1,fingerd_exec_t,fingerd_t)
allow $1 fingerd_t:fd use;
allow fingerd_t $1:fd use;
allow fingerd_t $1:fifo_file rw_file_perms;
allow fingerd_t $1:process sigchld;
')
Here the usage seems ambigious, but it is not. $1 is still domain
and therefore should be returned as a SRC_TYPE.
Returns:
0 - success
1 - conflict found
"""
ret = 0
found_src = False
if access.is_idparam(av.src_type):
if __param_insert(av.src_type, refpolicy.SRC_TYPE, av, params) == 1:
ret = 1
if access.is_idparam(av.tgt_type):
if __param_insert(av.tgt_type, refpolicy.TGT_TYPE, av, params) == 1:
ret = 1
if access.is_idparam(av.obj_class):
if __param_insert(av.obj_class, refpolicy.OBJ_CLASS, av, params) == 1:
ret = 1
return ret
def role_extract_params(role, params):
if access.is_idparam(role.role):
return __param_insert(role.role, refpolicy.ROLE, None, params)
def type_rule_extract_params(rule, params):
def extract_from_set(set, type):
ret = 0
for x in set:
if access.is_idparam(x):
if __param_insert(x, type, None, params):
ret = 1
return ret
ret = 0
if extract_from_set(rule.src_types, refpolicy.SRC_TYPE):
ret = 1
if extract_from_set(rule.tgt_types, refpolicy.TGT_TYPE):
ret = 1
if extract_from_set(rule.obj_classes, refpolicy.OBJ_CLASS):
ret = 1
if access.is_idparam(rule.dest_type):
if __param_insert(rule.dest_type, refpolicy.DEST_TYPE, None, params):
ret = 1
return ret
def ifcall_extract_params(ifcall, params):
ret = 0
for arg in ifcall.args:
if access.is_idparam(arg):
# Assume interface arguments are source types. Fairly safe
# assumption for most interfaces
if __param_insert(arg, refpolicy.SRC_TYPE, None, params):
ret = 1
return ret
class AttributeVector:
def __init__(self):
self.name = ""
self.access = access.AccessVectorSet()
def add_av(self, av):
self.access.add_av(av)
class AttributeSet:
def __init__(self):
self.attributes = { }
def add_attr(self, attr):
self.attributes[attr.name] = attr
def from_file(self, fd):
def parse_attr(line):
fields = line[1:-1].split()
if len(fields) != 2 or fields[0] != "Attribute":
raise SyntaxError("Syntax error Attribute statement %s" % line)
a = AttributeVector()
a.name = fields[1]
return a
a = None
for line in fd:
line = line[:-1]
if line[0] == "[":
if a:
self.add_attr(a)
a = parse_attr(line)
elif a:
l = line.split(",")
av = access.AccessVector(l)
a.add_av(av)
if a:
self.add_attr(a)
class InterfaceVector:
def __init__(self, interface=None, attributes={}):
# Enabled is a loose concept currently - we are essentially
# not enabling interfaces that we can't handle currently.
# See InterfaceVector.add_ifv for more information.
self.enabled = True
self.name = ""
# The access that is enabled by this interface - eventually
# this will include indirect access from typeattribute
# statements.
self.access = access.AccessVectorSet()
# Paramaters are stored in a dictionary (key: param name
# value: Param object).
self.params = { }
if interface:
self.from_interface(interface, attributes)
self.expanded = False
def from_interface(self, interface, attributes={}):
self.name = interface.name
# Add allow rules
for avrule in interface.avrules():
if avrule.rule_type != refpolicy.AVRule.ALLOW:
continue
# Handle some policy bugs
if "dontaudit" in interface.name:
#print "allow rule in interface: %s" % interface
continue
avs = access.avrule_to_access_vectors(avrule)
for av in avs:
self.add_av(av)
# Add typeattribute access
if attributes:
for typeattribute in interface.typeattributes():
for attr in typeattribute.attributes:
if attr not in attributes.attributes:
# print "missing attribute " + attr
continue
attr_vec = attributes.attributes[attr]
for a in attr_vec.access:
av = copy.copy(a)
if av.src_type == attr_vec.name:
av.src_type = typeattribute.type
if av.tgt_type == attr_vec.name:
av.tgt_type = typeattribute.type
self.add_av(av)
# Extract paramaters from roles
for role in interface.roles():
if role_extract_params(role, self.params):
pass
#print "found conflicting role param %s for interface %s" % \
# (role.name, interface.name)
# Extract paramaters from type rules
for rule in interface.typerules():
if type_rule_extract_params(rule, self.params):
pass
#print "found conflicting params in rule %s in interface %s" % \
# (str(rule), interface.name)
for ifcall in interface.interface_calls():
if ifcall_extract_params(ifcall, self.params):
pass
#print "found conflicting params in ifcall %s in interface %s" % \
# (str(ifcall), interface.name)
def add_av(self, av):
if av_extract_params(av, self.params) == 1:
pass
#print "found conflicting perms [%s]" % str(av)
self.access.add_av(av)
def to_string(self):
s = []
s.append("[InterfaceVector %s]" % self.name)
for av in self.access:
s.append(str(av))
return "\n".join(s)
def __str__(self):
return self.__repr__()
def __repr__(self):
return "<InterfaceVector %s:%s>" % (self.name, self.enabled)
class InterfaceSet:
def __init__(self, output=None):
self.interfaces = { }
self.tgt_type_map = { }
self.tgt_type_all = []
self.output = output
def o(self, str):
if self.output:
self.output.write(str + "\n")
def to_file(self, fd):
for iv in sorted(self.interfaces.values(), key=lambda x: x.name):
fd.write("[InterfaceVector %s " % iv.name)
for param in sorted(iv.params.values(), key=lambda x: x.name):
fd.write("%s:%s " % (param.name, refpolicy.field_to_str[param.type]))
fd.write("]\n")
avl = sorted(iv.access.to_list())
for av in avl:
fd.write(",".join(av))
fd.write("\n")
def from_file(self, fd):
def parse_ifv(line):
fields = line[1:-1].split()
if len(fields) < 2 or fields[0] != "InterfaceVector":
raise SyntaxError("Syntax error InterfaceVector statement %s" % line)
ifv = InterfaceVector()
ifv.name = fields[1]
if len(fields) == 2:
return
for field in fields[2:]:
p = field.split(":")
if len(p) != 2:
raise SyntaxError("Invalid param in InterfaceVector statement %s" % line)
param = Param()
param.name = p[0]
param.type = refpolicy.str_to_field[p[1]]
ifv.params[param.name] = param
return ifv
ifv = None
for line in fd:
line = line[:-1]
if line[0] == "[":
if ifv:
self.add_ifv(ifv)
ifv = parse_ifv(line)
elif ifv:
l = line.split(",")
av = access.AccessVector(l)
ifv.add_av(av)
if ifv:
self.add_ifv(ifv)
self.index()
def add_ifv(self, ifv):
self.interfaces[ifv.name] = ifv
def index(self):
for ifv in self.interfaces.values():
tgt_types = set()
for av in ifv.access:
if access.is_idparam(av.tgt_type):
self.tgt_type_all.append(ifv)
tgt_types = set()
break
tgt_types.add(av.tgt_type)
for type in tgt_types:
l = self.tgt_type_map.setdefault(type, [])
l.append(ifv)
def add(self, interface, attributes={}):
ifv = InterfaceVector(interface, attributes)
self.add_ifv(ifv)
def add_headers(self, headers, output=None, attributes={}):
for i in itertools.chain(headers.interfaces(), headers.templates()):
self.add(i, attributes)
self.expand_ifcalls(headers)
self.index()
def map_param(self, id, ifcall):
if access.is_idparam(id):
num = int(id[1:])
if num > len(ifcall.args):
# Tell caller to drop this because it must have
# been generated from an optional param.
return None
else:
arg = ifcall.args[num - 1]
if isinstance(arg, list):
return arg
else:
return [arg]
else:
return [id]
def map_add_av(self, ifv, av, ifcall):
src_types = self.map_param(av.src_type, ifcall)
if src_types is None:
return
tgt_types = self.map_param(av.tgt_type, ifcall)
if tgt_types is None:
return
obj_classes = self.map_param(av.obj_class, ifcall)
if obj_classes is None:
return
new_perms = refpolicy.IdSet()
for perm in av.perms:
p = self.map_param(perm, ifcall)
if p is None:
continue
else:
new_perms.update(p)
if len(new_perms) == 0:
return
for src_type in src_types:
for tgt_type in tgt_types:
for obj_class in obj_classes:
ifv.access.add(src_type, tgt_type, obj_class, new_perms)
def do_expand_ifcalls(self, interface, if_by_name):
# Descend an interface call tree adding the access
# from each interface. This is a depth first walk
# of the tree.
stack = [(interface, None)]
ifv = self.interfaces[interface.name]
ifv.expanded = True
while len(stack) > 0:
cur, cur_ifcall = stack.pop(-1)
cur_ifv = self.interfaces[cur.name]
if cur != interface:
for av in cur_ifv.access:
self.map_add_av(ifv, av, cur_ifcall)
# If we have already fully expanded this interface
# there is no reason to descend further.
if cur_ifv.expanded:
continue
for ifcall in cur.interface_calls():
if ifcall.ifname == interface.name:
self.o(_("Found circular interface class"))
return
try:
newif = if_by_name[ifcall.ifname]
except KeyError:
self.o(_("Missing interface definition for %s" % ifcall.ifname))
continue
stack.append((newif, ifcall))
def expand_ifcalls(self, headers):
# Create a map of interface names to interfaces -
# this mirrors the interface vector map we already
# have.
if_by_name = { }
for i in itertools.chain(headers.interfaces(), headers.templates()):
if_by_name[i.name] = i
for interface in itertools.chain(headers.interfaces(), headers.templates()):
self.do_expand_ifcalls(interface, if_by_name)
sepolgen/classperms.py 0000644 00000005402 14751155147 0011121 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
import sys
tokens = ('DEFINE',
'NAME',
'TICK',
'SQUOTE',
'OBRACE',
'CBRACE',
'SEMI',
'OPAREN',
'CPAREN',
'COMMA')
reserved = {
'define' : 'DEFINE' }
t_TICK = r'\`'
t_SQUOTE = r'\''
t_OBRACE = r'\{'
t_CBRACE = r'\}'
t_SEMI = r'\;'
t_OPAREN = r'\('
t_CPAREN = r'\)'
t_COMMA = r'\,'
t_ignore = " \t\n"
def t_NAME(t):
r'[a-zA-Z_][a-zA-Z0-9_]*'
t.type = reserved.get(t.value,'NAME')
return t
def t_error(t):
print("Illegal character '%s'" % t.value[0])
t.skip(1)
from . import lex
lex.lex()
def p_statements(p):
'''statements : define_stmt
| define_stmt statements
'''
if len(p) == 2:
p[0] = [p[1]]
else:
p[0] = [p[1]] + [p[2]]
def p_define_stmt(p):
# This sucks - corresponds to 'define(`foo',`{ read write }')
'''define_stmt : DEFINE OPAREN TICK NAME SQUOTE COMMA TICK list SQUOTE CPAREN
'''
p[0] = [p[4], p[8]]
def p_list(p):
'''list : NAME
| OBRACE names CBRACE
'''
if p[1] == "{":
p[0] = p[2]
else:
p[0] = [p[1]]
def p_names(p):
'''names : NAME
| NAME names
'''
if len(p) == 2:
p[0] = [p[1]]
else:
p[0] = [p[1]] + p[2]
def p_error(p):
print("Syntax error on line %d %s [type=%s]" % (p.lineno, p.value, p.type))
from . import yacc
yacc.yacc()
f = open("all_perms.spt")
txt = f.read()
f.close()
#lex.input(txt)
#while 1:
# tok = lex.token()
# if not tok:
# break
# print tok
test = "define(`foo',`{ read write append }')"
test2 = """define(`all_filesystem_perms',`{ mount remount unmount getattr relabelfrom relabelto transition associate quotamod quotaget }')
define(`all_security_perms',`{ compute_av compute_create compute_member check_context load_policy compute_relabel compute_user setenforce setbool setsecparam setcheckreqprot }')
"""
result = yacc.parse(txt)
print(result)
sepolgen/output.py 0000644 00000011774 14751155147 0010316 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
"""
Classes and functions for the output of reference policy modules.
This module takes a refpolicy.Module object and formats it for
output using the ModuleWriter object. By separating the output
in this way the other parts of Madison can focus solely on
generating policy. This keeps the semantic / syntactic issues
cleanly separated from the formatting issues.
"""
from . import refpolicy
from . import util
if util.PY3:
from .util import cmp
class ModuleWriter:
def __init__(self):
self.fd = None
self.module = None
self.sort = True
self.requires = True
def write(self, module, fd):
self.module = module
if self.sort:
sort_filter(self.module)
# FIXME - make this handle nesting
for node, depth in refpolicy.walktree(self.module, showdepth=True):
fd.write("%s\n" % str(node))
# Helper functions for sort_filter - this is all done old school
# C style rather than with polymorphic methods because this sorting
# is specific to output. It is not necessarily the comparison you
# want generally.
# Compare two IdSets - we could probably do something clever
# with different here, but this works.
def id_set_cmp(x, y):
xl = util.set_to_list(x)
xl.sort()
yl = util.set_to_list(y)
yl.sort()
if len(xl) != len(yl):
return cmp(xl[0], yl[0])
for v in zip(xl, yl):
if v[0] != v[1]:
return cmp(v[0], v[1])
return 0
# Compare two avrules
def avrule_cmp(a, b):
ret = id_set_cmp(a.src_types, b.src_types)
if ret != 0:
return ret
ret = id_set_cmp(a.tgt_types, b.tgt_types)
if ret != 0:
return ret
ret = id_set_cmp(a.obj_classes, b.obj_classes)
if ret != 0:
return ret
# At this point, who cares - just return something
return cmp(len(a.perms), len(b.perms))
# Compare two interface calls
def ifcall_cmp(a, b):
if a.args[0] != b.args[0]:
return cmp(a.args[0], b.args[0])
return cmp(a.ifname, b.ifname)
# Compare an two avrules or interface calls
def rule_cmp(a, b):
if isinstance(a, refpolicy.InterfaceCall):
if isinstance(b, refpolicy.InterfaceCall):
return ifcall_cmp(a, b)
else:
return id_set_cmp([a.args[0]], b.src_types)
else:
if isinstance(b, refpolicy.AVRule):
return avrule_cmp(a,b)
else:
return id_set_cmp(a.src_types, [b.args[0]])
def role_type_cmp(a, b):
return cmp(a.role, b.role)
def sort_filter(module):
"""Sort and group the output for readability.
"""
def sort_node(node):
c = []
# Module statement
for mod in node.module_declarations():
c.append(mod)
c.append(refpolicy.Comment())
# Requires
for require in node.requires():
c.append(require)
c.append(refpolicy.Comment())
# Rules
#
# We are going to group output by source type (which
# we assume is the first argument for interfaces).
rules = []
rules.extend(node.avrules())
rules.extend(node.interface_calls())
rules.sort(key=util.cmp_to_key(rule_cmp))
cur = None
sep_rules = []
for rule in rules:
if isinstance(rule, refpolicy.InterfaceCall):
x = rule.args[0]
else:
x = util.first(rule.src_types)
if cur != x:
if cur:
sep_rules.append(refpolicy.Comment())
cur = x
comment = refpolicy.Comment()
comment.lines.append("============= %s ==============" % cur)
sep_rules.append(comment)
sep_rules.append(rule)
c.extend(sep_rules)
ras = []
ras.extend(node.role_types())
ras.sort(key=util.cmp_to_key(role_type_cmp))
if len(ras):
comment = refpolicy.Comment()
comment.lines.append("============= ROLES ==============")
c.append(comment)
c.extend(ras)
# Everything else
for child in node.children:
if child not in c:
c.append(child)
node.children = c
for node in module.nodes():
sort_node(node)
sepolgen/yacc.py 0000644 00000414144 14751155147 0007673 0 ustar 00 # -----------------------------------------------------------------------------
# ply: yacc.py
#
# Copyright (C) 2001-2018
# David M. Beazley (Dabeaz LLC)
# All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions are
# met:
#
# * Redistributions of source code must retain the above copyright notice,
# this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright notice,
# this list of conditions and the following disclaimer in the documentation
# and/or other materials provided with the distribution.
# * Neither the name of the David Beazley or Dabeaz LLC may be used to
# endorse or promote products derived from this software without
# specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
# -----------------------------------------------------------------------------
#
# This implements an LR parser that is constructed from grammar rules defined
# as Python functions. The grammar is specified by supplying the BNF inside
# Python documentation strings. The inspiration for this technique was borrowed
# from John Aycock's Spark parsing system. PLY might be viewed as cross between
# Spark and the GNU bison utility.
#
# The current implementation is only somewhat object-oriented. The
# LR parser itself is defined in terms of an object (which allows multiple
# parsers to co-exist). However, most of the variables used during table
# construction are defined in terms of global variables. Users shouldn't
# notice unless they are trying to define multiple parsers at the same
# time using threads (in which case they should have their head examined).
#
# This implementation supports both SLR and LALR(1) parsing. LALR(1)
# support was originally implemented by Elias Ioup (ezioup@alumni.uchicago.edu),
# using the algorithm found in Aho, Sethi, and Ullman "Compilers: Principles,
# Techniques, and Tools" (The Dragon Book). LALR(1) has since been replaced
# by the more efficient DeRemer and Pennello algorithm.
#
# :::::::: WARNING :::::::
#
# Construction of LR parsing tables is fairly complicated and expensive.
# To make this module run fast, a *LOT* of work has been put into
# optimization---often at the expensive of readability and what might
# consider to be good Python "coding style." Modify the code at your
# own risk!
# ----------------------------------------------------------------------------
import re
import types
import sys
import os.path
import inspect
import warnings
__version__ = '3.11'
__tabversion__ = '3.10'
#-----------------------------------------------------------------------------
# === User configurable parameters ===
#
# Change these to modify the default behavior of yacc (if you wish)
#-----------------------------------------------------------------------------
yaccdebug = True # Debugging mode. If set, yacc generates a
# a 'parser.out' file in the current directory
debug_file = 'parser.out' # Default name of the debugging file
tab_module = 'parsetab' # Default name of the table module
default_lr = 'LALR' # Default LR table generation method
error_count = 3 # Number of symbols that must be shifted to leave recovery mode
yaccdevel = False # Set to True if developing yacc. This turns off optimized
# implementations of certain functions.
resultlimit = 40 # Size limit of results when running in debug mode.
pickle_protocol = 0 # Protocol to use when writing pickle files
# String type-checking compatibility
if sys.version_info[0] < 3:
string_types = basestring
else:
string_types = str
MAXINT = sys.maxsize
# This object is a stand-in for a logging object created by the
# logging module. PLY will use this by default to create things
# such as the parser.out file. If a user wants more detailed
# information, they can create their own logging object and pass
# it into PLY.
class PlyLogger(object):
def __init__(self, f):
self.f = f
def debug(self, msg, *args, **kwargs):
self.f.write((msg % args) + '\n')
info = debug
def warning(self, msg, *args, **kwargs):
self.f.write('WARNING: ' + (msg % args) + '\n')
def error(self, msg, *args, **kwargs):
self.f.write('ERROR: ' + (msg % args) + '\n')
critical = debug
# Null logger is used when no output is generated. Does nothing.
class NullLogger(object):
def __getattribute__(self, name):
return self
def __call__(self, *args, **kwargs):
return self
# Exception raised for yacc-related errors
class YaccError(Exception):
pass
# Format the result message that the parser produces when running in debug mode.
def format_result(r):
repr_str = repr(r)
if '\n' in repr_str:
repr_str = repr(repr_str)
if len(repr_str) > resultlimit:
repr_str = repr_str[:resultlimit] + ' ...'
result = '<%s @ 0x%x> (%s)' % (type(r).__name__, id(r), repr_str)
return result
# Format stack entries when the parser is running in debug mode
def format_stack_entry(r):
repr_str = repr(r)
if '\n' in repr_str:
repr_str = repr(repr_str)
if len(repr_str) < 16:
return repr_str
else:
return '<%s @ 0x%x>' % (type(r).__name__, id(r))
# Panic mode error recovery support. This feature is being reworked--much of the
# code here is to offer a deprecation/backwards compatible transition
_errok = None
_token = None
_restart = None
_warnmsg = '''PLY: Don't use global functions errok(), token(), and restart() in p_error().
Instead, invoke the methods on the associated parser instance:
def p_error(p):
...
# Use parser.errok(), parser.token(), parser.restart()
...
parser = yacc.yacc()
'''
def errok():
warnings.warn(_warnmsg)
return _errok()
def restart():
warnings.warn(_warnmsg)
return _restart()
def token():
warnings.warn(_warnmsg)
return _token()
# Utility function to call the p_error() function with some deprecation hacks
def call_errorfunc(errorfunc, token, parser):
global _errok, _token, _restart
_errok = parser.errok
_token = parser.token
_restart = parser.restart
r = errorfunc(token)
try:
del _errok, _token, _restart
except NameError:
pass
return r
#-----------------------------------------------------------------------------
# === LR Parsing Engine ===
#
# The following classes are used for the LR parser itself. These are not
# used during table construction and are independent of the actual LR
# table generation algorithm
#-----------------------------------------------------------------------------
# This class is used to hold non-terminal grammar symbols during parsing.
# It normally has the following attributes set:
# .type = Grammar symbol type
# .value = Symbol value
# .lineno = Starting line number
# .endlineno = Ending line number (optional, set automatically)
# .lexpos = Starting lex position
# .endlexpos = Ending lex position (optional, set automatically)
class YaccSymbol:
def __str__(self):
return self.type
def __repr__(self):
return str(self)
# This class is a wrapper around the objects actually passed to each
# grammar rule. Index lookup and assignment actually assign the
# .value attribute of the underlying YaccSymbol object.
# The lineno() method returns the line number of a given
# item (or 0 if not defined). The linespan() method returns
# a tuple of (startline,endline) representing the range of lines
# for a symbol. The lexspan() method returns a tuple (lexpos,endlexpos)
# representing the range of positional information for a symbol.
class YaccProduction:
def __init__(self, s, stack=None):
self.slice = s
self.stack = stack
self.lexer = None
self.parser = None
def __getitem__(self, n):
if isinstance(n, slice):
return [s.value for s in self.slice[n]]
elif n >= 0:
return self.slice[n].value
else:
return self.stack[n].value
def __setitem__(self, n, v):
self.slice[n].value = v
def __getslice__(self, i, j):
return [s.value for s in self.slice[i:j]]
def __len__(self):
return len(self.slice)
def lineno(self, n):
return getattr(self.slice[n], 'lineno', 0)
def set_lineno(self, n, lineno):
self.slice[n].lineno = lineno
def linespan(self, n):
startline = getattr(self.slice[n], 'lineno', 0)
endline = getattr(self.slice[n], 'endlineno', startline)
return startline, endline
def lexpos(self, n):
return getattr(self.slice[n], 'lexpos', 0)
def set_lexpos(self, n, lexpos):
self.slice[n].lexpos = lexpos
def lexspan(self, n):
startpos = getattr(self.slice[n], 'lexpos', 0)
endpos = getattr(self.slice[n], 'endlexpos', startpos)
return startpos, endpos
def error(self):
raise SyntaxError
# -----------------------------------------------------------------------------
# == LRParser ==
#
# The LR Parsing engine.
# -----------------------------------------------------------------------------
class LRParser:
def __init__(self, lrtab, errorf):
self.productions = lrtab.lr_productions
self.action = lrtab.lr_action
self.goto = lrtab.lr_goto
self.errorfunc = errorf
self.set_defaulted_states()
self.errorok = True
def errok(self):
self.errorok = True
def restart(self):
del self.statestack[:]
del self.symstack[:]
sym = YaccSymbol()
sym.type = '$end'
self.symstack.append(sym)
self.statestack.append(0)
# Defaulted state support.
# This method identifies parser states where there is only one possible reduction action.
# For such states, the parser can make a choose to make a rule reduction without consuming
# the next look-ahead token. This delayed invocation of the tokenizer can be useful in
# certain kinds of advanced parsing situations where the lexer and parser interact with
# each other or change states (i.e., manipulation of scope, lexer states, etc.).
#
# See: http://www.gnu.org/software/bison/manual/html_node/Default-Reductions.html#Default-Reductions
def set_defaulted_states(self):
self.defaulted_states = {}
for state, actions in self.action.items():
rules = list(actions.values())
if len(rules) == 1 and rules[0] < 0:
self.defaulted_states[state] = rules[0]
def disable_defaulted_states(self):
self.defaulted_states = {}
def parse(self, input=None, lexer=None, debug=False, tracking=False, tokenfunc=None):
if debug or yaccdevel:
if isinstance(debug, int):
debug = PlyLogger(sys.stderr)
return self.parsedebug(input, lexer, debug, tracking, tokenfunc)
elif tracking:
return self.parseopt(input, lexer, debug, tracking, tokenfunc)
else:
return self.parseopt_notrack(input, lexer, debug, tracking, tokenfunc)
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# parsedebug().
#
# This is the debugging enabled version of parse(). All changes made to the
# parsing engine should be made here. Optimized versions of this function
# are automatically created by the ply/ygen.py script. This script cuts out
# sections enclosed in markers such as this:
#
# #--! DEBUG
# statements
# #--! DEBUG
#
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
def parsedebug(self, input=None, lexer=None, debug=False, tracking=False, tokenfunc=None):
#--! parsedebug-start
lookahead = None # Current lookahead symbol
lookaheadstack = [] # Stack of lookahead symbols
actions = self.action # Local reference to action table (to avoid lookup on self.)
goto = self.goto # Local reference to goto table (to avoid lookup on self.)
prod = self.productions # Local reference to production list (to avoid lookup on self.)
defaulted_states = self.defaulted_states # Local reference to defaulted states
pslice = YaccProduction(None) # Production object passed to grammar rules
errorcount = 0 # Used during error recovery
#--! DEBUG
debug.info('PLY: PARSE DEBUG START')
#--! DEBUG
# If no lexer was given, we will try to use the lex module
if not lexer:
from . import lex
lexer = lex.lexer
# Set up the lexer and parser objects on pslice
pslice.lexer = lexer
pslice.parser = self
# If input was supplied, pass to lexer
if input is not None:
lexer.input(input)
if tokenfunc is None:
# Tokenize function
get_token = lexer.token
else:
get_token = tokenfunc
# Set the parser() token method (sometimes used in error recovery)
self.token = get_token
# Set up the state and symbol stacks
statestack = [] # Stack of parsing states
self.statestack = statestack
symstack = [] # Stack of grammar symbols
self.symstack = symstack
pslice.stack = symstack # Put in the production
errtoken = None # Err token
# The start state is assumed to be (0,$end)
statestack.append(0)
sym = YaccSymbol()
sym.type = '$end'
symstack.append(sym)
state = 0
while True:
# Get the next symbol on the input. If a lookahead symbol
# is already set, we just use that. Otherwise, we'll pull
# the next token off of the lookaheadstack or from the lexer
#--! DEBUG
debug.debug('')
debug.debug('State : %s', state)
#--! DEBUG
if state not in defaulted_states:
if not lookahead:
if not lookaheadstack:
lookahead = get_token() # Get the next token
else:
lookahead = lookaheadstack.pop()
if not lookahead:
lookahead = YaccSymbol()
lookahead.type = '$end'
# Check the action table
ltype = lookahead.type
t = actions[state].get(ltype)
else:
t = defaulted_states[state]
#--! DEBUG
debug.debug('Defaulted state %s: Reduce using %d', state, -t)
#--! DEBUG
#--! DEBUG
debug.debug('Stack : %s',
('%s . %s' % (' '.join([xx.type for xx in symstack][1:]), str(lookahead))).lstrip())
#--! DEBUG
if t is not None:
if t > 0:
# shift a symbol on the stack
statestack.append(t)
state = t
#--! DEBUG
debug.debug('Action : Shift and goto state %s', t)
#--! DEBUG
symstack.append(lookahead)
lookahead = None
# Decrease error count on successful shift
if errorcount:
errorcount -= 1
continue
if t < 0:
# reduce a symbol on the stack, emit a production
p = prod[-t]
pname = p.name
plen = p.len
# Get production function
sym = YaccSymbol()
sym.type = pname # Production name
sym.value = None
#--! DEBUG
if plen:
debug.info('Action : Reduce rule [%s] with %s and goto state %d', p.str,
'['+','.join([format_stack_entry(_v.value) for _v in symstack[-plen:]])+']',
goto[statestack[-1-plen]][pname])
else:
debug.info('Action : Reduce rule [%s] with %s and goto state %d', p.str, [],
goto[statestack[-1]][pname])
#--! DEBUG
if plen:
targ = symstack[-plen-1:]
targ[0] = sym
#--! TRACKING
if tracking:
t1 = targ[1]
sym.lineno = t1.lineno
sym.lexpos = t1.lexpos
t1 = targ[-1]
sym.endlineno = getattr(t1, 'endlineno', t1.lineno)
sym.endlexpos = getattr(t1, 'endlexpos', t1.lexpos)
#--! TRACKING
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# The code enclosed in this section is duplicated
# below as a performance optimization. Make sure
# changes get made in both locations.
pslice.slice = targ
try:
# Call the grammar rule with our special slice object
del symstack[-plen:]
self.state = state
p.callable(pslice)
del statestack[-plen:]
#--! DEBUG
debug.info('Result : %s', format_result(pslice[0]))
#--! DEBUG
symstack.append(sym)
state = goto[statestack[-1]][pname]
statestack.append(state)
except SyntaxError:
# If an error was set. Enter error recovery state
lookaheadstack.append(lookahead) # Save the current lookahead token
symstack.extend(targ[1:-1]) # Put the production slice back on the stack
statestack.pop() # Pop back one state (before the reduce)
state = statestack[-1]
sym.type = 'error'
sym.value = 'error'
lookahead = sym
errorcount = error_count
self.errorok = False
continue
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
else:
#--! TRACKING
if tracking:
sym.lineno = lexer.lineno
sym.lexpos = lexer.lexpos
#--! TRACKING
targ = [sym]
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# The code enclosed in this section is duplicated
# above as a performance optimization. Make sure
# changes get made in both locations.
pslice.slice = targ
try:
# Call the grammar rule with our special slice object
self.state = state
p.callable(pslice)
#--! DEBUG
debug.info('Result : %s', format_result(pslice[0]))
#--! DEBUG
symstack.append(sym)
state = goto[statestack[-1]][pname]
statestack.append(state)
except SyntaxError:
# If an error was set. Enter error recovery state
lookaheadstack.append(lookahead) # Save the current lookahead token
statestack.pop() # Pop back one state (before the reduce)
state = statestack[-1]
sym.type = 'error'
sym.value = 'error'
lookahead = sym
errorcount = error_count
self.errorok = False
continue
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
if t == 0:
n = symstack[-1]
result = getattr(n, 'value', None)
#--! DEBUG
debug.info('Done : Returning %s', format_result(result))
debug.info('PLY: PARSE DEBUG END')
#--! DEBUG
return result
if t is None:
#--! DEBUG
debug.error('Error : %s',
('%s . %s' % (' '.join([xx.type for xx in symstack][1:]), str(lookahead))).lstrip())
#--! DEBUG
# We have some kind of parsing error here. To handle
# this, we are going to push the current token onto
# the tokenstack and replace it with an 'error' token.
# If there are any synchronization rules, they may
# catch it.
#
# In addition to pushing the error token, we call call
# the user defined p_error() function if this is the
# first syntax error. This function is only called if
# errorcount == 0.
if errorcount == 0 or self.errorok:
errorcount = error_count
self.errorok = False
errtoken = lookahead
if errtoken.type == '$end':
errtoken = None # End of file!
if self.errorfunc:
if errtoken and not hasattr(errtoken, 'lexer'):
errtoken.lexer = lexer
self.state = state
tok = call_errorfunc(self.errorfunc, errtoken, self)
if self.errorok:
# User must have done some kind of panic
# mode recovery on their own. The
# returned token is the next lookahead
lookahead = tok
errtoken = None
continue
else:
if errtoken:
if hasattr(errtoken, 'lineno'):
lineno = lookahead.lineno
else:
lineno = 0
if lineno:
sys.stderr.write('yacc: Syntax error at line %d, token=%s\n' % (lineno, errtoken.type))
else:
sys.stderr.write('yacc: Syntax error, token=%s' % errtoken.type)
else:
sys.stderr.write('yacc: Parse error in input. EOF\n')
return
else:
errorcount = error_count
# case 1: the statestack only has 1 entry on it. If we're in this state, the
# entire parse has been rolled back and we're completely hosed. The token is
# discarded and we just keep going.
if len(statestack) <= 1 and lookahead.type != '$end':
lookahead = None
errtoken = None
state = 0
# Nuke the pushback stack
del lookaheadstack[:]
continue
# case 2: the statestack has a couple of entries on it, but we're
# at the end of the file. nuke the top entry and generate an error token
# Start nuking entries on the stack
if lookahead.type == '$end':
# Whoa. We're really hosed here. Bail out
return
if lookahead.type != 'error':
sym = symstack[-1]
if sym.type == 'error':
# Hmmm. Error is on top of stack, we'll just nuke input
# symbol and continue
#--! TRACKING
if tracking:
sym.endlineno = getattr(lookahead, 'lineno', sym.lineno)
sym.endlexpos = getattr(lookahead, 'lexpos', sym.lexpos)
#--! TRACKING
lookahead = None
continue
# Create the error symbol for the first time and make it the new lookahead symbol
t = YaccSymbol()
t.type = 'error'
if hasattr(lookahead, 'lineno'):
t.lineno = t.endlineno = lookahead.lineno
if hasattr(lookahead, 'lexpos'):
t.lexpos = t.endlexpos = lookahead.lexpos
t.value = lookahead
lookaheadstack.append(lookahead)
lookahead = t
else:
sym = symstack.pop()
#--! TRACKING
if tracking:
lookahead.lineno = sym.lineno
lookahead.lexpos = sym.lexpos
#--! TRACKING
statestack.pop()
state = statestack[-1]
continue
# Call an error function here
raise RuntimeError('yacc: internal parser error!!!\n')
#--! parsedebug-end
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# parseopt().
#
# Optimized version of parse() method. DO NOT EDIT THIS CODE DIRECTLY!
# This code is automatically generated by the ply/ygen.py script. Make
# changes to the parsedebug() method instead.
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
def parseopt(self, input=None, lexer=None, debug=False, tracking=False, tokenfunc=None):
#--! parseopt-start
lookahead = None # Current lookahead symbol
lookaheadstack = [] # Stack of lookahead symbols
actions = self.action # Local reference to action table (to avoid lookup on self.)
goto = self.goto # Local reference to goto table (to avoid lookup on self.)
prod = self.productions # Local reference to production list (to avoid lookup on self.)
defaulted_states = self.defaulted_states # Local reference to defaulted states
pslice = YaccProduction(None) # Production object passed to grammar rules
errorcount = 0 # Used during error recovery
# If no lexer was given, we will try to use the lex module
if not lexer:
from . import lex
lexer = lex.lexer
# Set up the lexer and parser objects on pslice
pslice.lexer = lexer
pslice.parser = self
# If input was supplied, pass to lexer
if input is not None:
lexer.input(input)
if tokenfunc is None:
# Tokenize function
get_token = lexer.token
else:
get_token = tokenfunc
# Set the parser() token method (sometimes used in error recovery)
self.token = get_token
# Set up the state and symbol stacks
statestack = [] # Stack of parsing states
self.statestack = statestack
symstack = [] # Stack of grammar symbols
self.symstack = symstack
pslice.stack = symstack # Put in the production
errtoken = None # Err token
# The start state is assumed to be (0,$end)
statestack.append(0)
sym = YaccSymbol()
sym.type = '$end'
symstack.append(sym)
state = 0
while True:
# Get the next symbol on the input. If a lookahead symbol
# is already set, we just use that. Otherwise, we'll pull
# the next token off of the lookaheadstack or from the lexer
if state not in defaulted_states:
if not lookahead:
if not lookaheadstack:
lookahead = get_token() # Get the next token
else:
lookahead = lookaheadstack.pop()
if not lookahead:
lookahead = YaccSymbol()
lookahead.type = '$end'
# Check the action table
ltype = lookahead.type
t = actions[state].get(ltype)
else:
t = defaulted_states[state]
if t is not None:
if t > 0:
# shift a symbol on the stack
statestack.append(t)
state = t
symstack.append(lookahead)
lookahead = None
# Decrease error count on successful shift
if errorcount:
errorcount -= 1
continue
if t < 0:
# reduce a symbol on the stack, emit a production
p = prod[-t]
pname = p.name
plen = p.len
# Get production function
sym = YaccSymbol()
sym.type = pname # Production name
sym.value = None
if plen:
targ = symstack[-plen-1:]
targ[0] = sym
#--! TRACKING
if tracking:
t1 = targ[1]
sym.lineno = t1.lineno
sym.lexpos = t1.lexpos
t1 = targ[-1]
sym.endlineno = getattr(t1, 'endlineno', t1.lineno)
sym.endlexpos = getattr(t1, 'endlexpos', t1.lexpos)
#--! TRACKING
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# The code enclosed in this section is duplicated
# below as a performance optimization. Make sure
# changes get made in both locations.
pslice.slice = targ
try:
# Call the grammar rule with our special slice object
del symstack[-plen:]
self.state = state
p.callable(pslice)
del statestack[-plen:]
symstack.append(sym)
state = goto[statestack[-1]][pname]
statestack.append(state)
except SyntaxError:
# If an error was set. Enter error recovery state
lookaheadstack.append(lookahead) # Save the current lookahead token
symstack.extend(targ[1:-1]) # Put the production slice back on the stack
statestack.pop() # Pop back one state (before the reduce)
state = statestack[-1]
sym.type = 'error'
sym.value = 'error'
lookahead = sym
errorcount = error_count
self.errorok = False
continue
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
else:
#--! TRACKING
if tracking:
sym.lineno = lexer.lineno
sym.lexpos = lexer.lexpos
#--! TRACKING
targ = [sym]
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# The code enclosed in this section is duplicated
# above as a performance optimization. Make sure
# changes get made in both locations.
pslice.slice = targ
try:
# Call the grammar rule with our special slice object
self.state = state
p.callable(pslice)
symstack.append(sym)
state = goto[statestack[-1]][pname]
statestack.append(state)
except SyntaxError:
# If an error was set. Enter error recovery state
lookaheadstack.append(lookahead) # Save the current lookahead token
statestack.pop() # Pop back one state (before the reduce)
state = statestack[-1]
sym.type = 'error'
sym.value = 'error'
lookahead = sym
errorcount = error_count
self.errorok = False
continue
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
if t == 0:
n = symstack[-1]
result = getattr(n, 'value', None)
return result
if t is None:
# We have some kind of parsing error here. To handle
# this, we are going to push the current token onto
# the tokenstack and replace it with an 'error' token.
# If there are any synchronization rules, they may
# catch it.
#
# In addition to pushing the error token, we call call
# the user defined p_error() function if this is the
# first syntax error. This function is only called if
# errorcount == 0.
if errorcount == 0 or self.errorok:
errorcount = error_count
self.errorok = False
errtoken = lookahead
if errtoken.type == '$end':
errtoken = None # End of file!
if self.errorfunc:
if errtoken and not hasattr(errtoken, 'lexer'):
errtoken.lexer = lexer
self.state = state
tok = call_errorfunc(self.errorfunc, errtoken, self)
if self.errorok:
# User must have done some kind of panic
# mode recovery on their own. The
# returned token is the next lookahead
lookahead = tok
errtoken = None
continue
else:
if errtoken:
if hasattr(errtoken, 'lineno'):
lineno = lookahead.lineno
else:
lineno = 0
if lineno:
sys.stderr.write('yacc: Syntax error at line %d, token=%s\n' % (lineno, errtoken.type))
else:
sys.stderr.write('yacc: Syntax error, token=%s' % errtoken.type)
else:
sys.stderr.write('yacc: Parse error in input. EOF\n')
return
else:
errorcount = error_count
# case 1: the statestack only has 1 entry on it. If we're in this state, the
# entire parse has been rolled back and we're completely hosed. The token is
# discarded and we just keep going.
if len(statestack) <= 1 and lookahead.type != '$end':
lookahead = None
errtoken = None
state = 0
# Nuke the pushback stack
del lookaheadstack[:]
continue
# case 2: the statestack has a couple of entries on it, but we're
# at the end of the file. nuke the top entry and generate an error token
# Start nuking entries on the stack
if lookahead.type == '$end':
# Whoa. We're really hosed here. Bail out
return
if lookahead.type != 'error':
sym = symstack[-1]
if sym.type == 'error':
# Hmmm. Error is on top of stack, we'll just nuke input
# symbol and continue
#--! TRACKING
if tracking:
sym.endlineno = getattr(lookahead, 'lineno', sym.lineno)
sym.endlexpos = getattr(lookahead, 'lexpos', sym.lexpos)
#--! TRACKING
lookahead = None
continue
# Create the error symbol for the first time and make it the new lookahead symbol
t = YaccSymbol()
t.type = 'error'
if hasattr(lookahead, 'lineno'):
t.lineno = t.endlineno = lookahead.lineno
if hasattr(lookahead, 'lexpos'):
t.lexpos = t.endlexpos = lookahead.lexpos
t.value = lookahead
lookaheadstack.append(lookahead)
lookahead = t
else:
sym = symstack.pop()
#--! TRACKING
if tracking:
lookahead.lineno = sym.lineno
lookahead.lexpos = sym.lexpos
#--! TRACKING
statestack.pop()
state = statestack[-1]
continue
# Call an error function here
raise RuntimeError('yacc: internal parser error!!!\n')
#--! parseopt-end
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# parseopt_notrack().
#
# Optimized version of parseopt() with line number tracking removed.
# DO NOT EDIT THIS CODE DIRECTLY. This code is automatically generated
# by the ply/ygen.py script. Make changes to the parsedebug() method instead.
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
def parseopt_notrack(self, input=None, lexer=None, debug=False, tracking=False, tokenfunc=None):
#--! parseopt-notrack-start
lookahead = None # Current lookahead symbol
lookaheadstack = [] # Stack of lookahead symbols
actions = self.action # Local reference to action table (to avoid lookup on self.)
goto = self.goto # Local reference to goto table (to avoid lookup on self.)
prod = self.productions # Local reference to production list (to avoid lookup on self.)
defaulted_states = self.defaulted_states # Local reference to defaulted states
pslice = YaccProduction(None) # Production object passed to grammar rules
errorcount = 0 # Used during error recovery
# If no lexer was given, we will try to use the lex module
if not lexer:
from . import lex
lexer = lex.lexer
# Set up the lexer and parser objects on pslice
pslice.lexer = lexer
pslice.parser = self
# If input was supplied, pass to lexer
if input is not None:
lexer.input(input)
if tokenfunc is None:
# Tokenize function
get_token = lexer.token
else:
get_token = tokenfunc
# Set the parser() token method (sometimes used in error recovery)
self.token = get_token
# Set up the state and symbol stacks
statestack = [] # Stack of parsing states
self.statestack = statestack
symstack = [] # Stack of grammar symbols
self.symstack = symstack
pslice.stack = symstack # Put in the production
errtoken = None # Err token
# The start state is assumed to be (0,$end)
statestack.append(0)
sym = YaccSymbol()
sym.type = '$end'
symstack.append(sym)
state = 0
while True:
# Get the next symbol on the input. If a lookahead symbol
# is already set, we just use that. Otherwise, we'll pull
# the next token off of the lookaheadstack or from the lexer
if state not in defaulted_states:
if not lookahead:
if not lookaheadstack:
lookahead = get_token() # Get the next token
else:
lookahead = lookaheadstack.pop()
if not lookahead:
lookahead = YaccSymbol()
lookahead.type = '$end'
# Check the action table
ltype = lookahead.type
t = actions[state].get(ltype)
else:
t = defaulted_states[state]
if t is not None:
if t > 0:
# shift a symbol on the stack
statestack.append(t)
state = t
symstack.append(lookahead)
lookahead = None
# Decrease error count on successful shift
if errorcount:
errorcount -= 1
continue
if t < 0:
# reduce a symbol on the stack, emit a production
p = prod[-t]
pname = p.name
plen = p.len
# Get production function
sym = YaccSymbol()
sym.type = pname # Production name
sym.value = None
if plen:
targ = symstack[-plen-1:]
targ[0] = sym
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# The code enclosed in this section is duplicated
# below as a performance optimization. Make sure
# changes get made in both locations.
pslice.slice = targ
try:
# Call the grammar rule with our special slice object
del symstack[-plen:]
self.state = state
p.callable(pslice)
del statestack[-plen:]
symstack.append(sym)
state = goto[statestack[-1]][pname]
statestack.append(state)
except SyntaxError:
# If an error was set. Enter error recovery state
lookaheadstack.append(lookahead) # Save the current lookahead token
symstack.extend(targ[1:-1]) # Put the production slice back on the stack
statestack.pop() # Pop back one state (before the reduce)
state = statestack[-1]
sym.type = 'error'
sym.value = 'error'
lookahead = sym
errorcount = error_count
self.errorok = False
continue
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
else:
targ = [sym]
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
# The code enclosed in this section is duplicated
# above as a performance optimization. Make sure
# changes get made in both locations.
pslice.slice = targ
try:
# Call the grammar rule with our special slice object
self.state = state
p.callable(pslice)
symstack.append(sym)
state = goto[statestack[-1]][pname]
statestack.append(state)
except SyntaxError:
# If an error was set. Enter error recovery state
lookaheadstack.append(lookahead) # Save the current lookahead token
statestack.pop() # Pop back one state (before the reduce)
state = statestack[-1]
sym.type = 'error'
sym.value = 'error'
lookahead = sym
errorcount = error_count
self.errorok = False
continue
# !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
if t == 0:
n = symstack[-1]
result = getattr(n, 'value', None)
return result
if t is None:
# We have some kind of parsing error here. To handle
# this, we are going to push the current token onto
# the tokenstack and replace it with an 'error' token.
# If there are any synchronization rules, they may
# catch it.
#
# In addition to pushing the error token, we call call
# the user defined p_error() function if this is the
# first syntax error. This function is only called if
# errorcount == 0.
if errorcount == 0 or self.errorok:
errorcount = error_count
self.errorok = False
errtoken = lookahead
if errtoken.type == '$end':
errtoken = None # End of file!
if self.errorfunc:
if errtoken and not hasattr(errtoken, 'lexer'):
errtoken.lexer = lexer
self.state = state
tok = call_errorfunc(self.errorfunc, errtoken, self)
if self.errorok:
# User must have done some kind of panic
# mode recovery on their own. The
# returned token is the next lookahead
lookahead = tok
errtoken = None
continue
else:
if errtoken:
if hasattr(errtoken, 'lineno'):
lineno = lookahead.lineno
else:
lineno = 0
if lineno:
sys.stderr.write('yacc: Syntax error at line %d, token=%s\n' % (lineno, errtoken.type))
else:
sys.stderr.write('yacc: Syntax error, token=%s' % errtoken.type)
else:
sys.stderr.write('yacc: Parse error in input. EOF\n')
return
else:
errorcount = error_count
# case 1: the statestack only has 1 entry on it. If we're in this state, the
# entire parse has been rolled back and we're completely hosed. The token is
# discarded and we just keep going.
if len(statestack) <= 1 and lookahead.type != '$end':
lookahead = None
errtoken = None
state = 0
# Nuke the pushback stack
del lookaheadstack[:]
continue
# case 2: the statestack has a couple of entries on it, but we're
# at the end of the file. nuke the top entry and generate an error token
# Start nuking entries on the stack
if lookahead.type == '$end':
# Whoa. We're really hosed here. Bail out
return
if lookahead.type != 'error':
sym = symstack[-1]
if sym.type == 'error':
# Hmmm. Error is on top of stack, we'll just nuke input
# symbol and continue
lookahead = None
continue
# Create the error symbol for the first time and make it the new lookahead symbol
t = YaccSymbol()
t.type = 'error'
if hasattr(lookahead, 'lineno'):
t.lineno = t.endlineno = lookahead.lineno
if hasattr(lookahead, 'lexpos'):
t.lexpos = t.endlexpos = lookahead.lexpos
t.value = lookahead
lookaheadstack.append(lookahead)
lookahead = t
else:
sym = symstack.pop()
statestack.pop()
state = statestack[-1]
continue
# Call an error function here
raise RuntimeError('yacc: internal parser error!!!\n')
#--! parseopt-notrack-end
# -----------------------------------------------------------------------------
# === Grammar Representation ===
#
# The following functions, classes, and variables are used to represent and
# manipulate the rules that make up a grammar.
# -----------------------------------------------------------------------------
# regex matching identifiers
_is_identifier = re.compile(r'^[a-zA-Z0-9_-]+$')
# -----------------------------------------------------------------------------
# class Production:
#
# This class stores the raw information about a single production or grammar rule.
# A grammar rule refers to a specification such as this:
#
# expr : expr PLUS term
#
# Here are the basic attributes defined on all productions
#
# name - Name of the production. For example 'expr'
# prod - A list of symbols on the right side ['expr','PLUS','term']
# prec - Production precedence level
# number - Production number.
# func - Function that executes on reduce
# file - File where production function is defined
# lineno - Line number where production function is defined
#
# The following attributes are defined or optional.
#
# len - Length of the production (number of symbols on right hand side)
# usyms - Set of unique symbols found in the production
# -----------------------------------------------------------------------------
class Production(object):
reduced = 0
def __init__(self, number, name, prod, precedence=('right', 0), func=None, file='', line=0):
self.name = name
self.prod = tuple(prod)
self.number = number
self.func = func
self.callable = None
self.file = file
self.line = line
self.prec = precedence
# Internal settings used during table construction
self.len = len(self.prod) # Length of the production
# Create a list of unique production symbols used in the production
self.usyms = []
for s in self.prod:
if s not in self.usyms:
self.usyms.append(s)
# List of all LR items for the production
self.lr_items = []
self.lr_next = None
# Create a string representation
if self.prod:
self.str = '%s -> %s' % (self.name, ' '.join(self.prod))
else:
self.str = '%s -> <empty>' % self.name
def __str__(self):
return self.str
def __repr__(self):
return 'Production(' + str(self) + ')'
def __len__(self):
return len(self.prod)
def __nonzero__(self):
return 1
def __getitem__(self, index):
return self.prod[index]
# Return the nth lr_item from the production (or None if at the end)
def lr_item(self, n):
if n > len(self.prod):
return None
p = LRItem(self, n)
# Precompute the list of productions immediately following.
try:
p.lr_after = self.Prodnames[p.prod[n+1]]
except (IndexError, KeyError):
p.lr_after = []
try:
p.lr_before = p.prod[n-1]
except IndexError:
p.lr_before = None
return p
# Bind the production function name to a callable
def bind(self, pdict):
if self.func:
self.callable = pdict[self.func]
# This class serves as a minimal standin for Production objects when
# reading table data from files. It only contains information
# actually used by the LR parsing engine, plus some additional
# debugging information.
class MiniProduction(object):
def __init__(self, str, name, len, func, file, line):
self.name = name
self.len = len
self.func = func
self.callable = None
self.file = file
self.line = line
self.str = str
def __str__(self):
return self.str
def __repr__(self):
return 'MiniProduction(%s)' % self.str
# Bind the production function name to a callable
def bind(self, pdict):
if self.func:
self.callable = pdict[self.func]
# -----------------------------------------------------------------------------
# class LRItem
#
# This class represents a specific stage of parsing a production rule. For
# example:
#
# expr : expr . PLUS term
#
# In the above, the "." represents the current location of the parse. Here
# basic attributes:
#
# name - Name of the production. For example 'expr'
# prod - A list of symbols on the right side ['expr','.', 'PLUS','term']
# number - Production number.
#
# lr_next Next LR item. Example, if we are ' expr -> expr . PLUS term'
# then lr_next refers to 'expr -> expr PLUS . term'
# lr_index - LR item index (location of the ".") in the prod list.
# lookaheads - LALR lookahead symbols for this item
# len - Length of the production (number of symbols on right hand side)
# lr_after - List of all productions that immediately follow
# lr_before - Grammar symbol immediately before
# -----------------------------------------------------------------------------
class LRItem(object):
def __init__(self, p, n):
self.name = p.name
self.prod = list(p.prod)
self.number = p.number
self.lr_index = n
self.lookaheads = {}
self.prod.insert(n, '.')
self.prod = tuple(self.prod)
self.len = len(self.prod)
self.usyms = p.usyms
def __str__(self):
if self.prod:
s = '%s -> %s' % (self.name, ' '.join(self.prod))
else:
s = '%s -> <empty>' % self.name
return s
def __repr__(self):
return 'LRItem(' + str(self) + ')'
# -----------------------------------------------------------------------------
# rightmost_terminal()
#
# Return the rightmost terminal from a list of symbols. Used in add_production()
# -----------------------------------------------------------------------------
def rightmost_terminal(symbols, terminals):
i = len(symbols) - 1
while i >= 0:
if symbols[i] in terminals:
return symbols[i]
i -= 1
return None
# -----------------------------------------------------------------------------
# === GRAMMAR CLASS ===
#
# The following class represents the contents of the specified grammar along
# with various computed properties such as first sets, follow sets, LR items, etc.
# This data is used for critical parts of the table generation process later.
# -----------------------------------------------------------------------------
class GrammarError(YaccError):
pass
class Grammar(object):
def __init__(self, terminals):
self.Productions = [None] # A list of all of the productions. The first
# entry is always reserved for the purpose of
# building an augmented grammar
self.Prodnames = {} # A dictionary mapping the names of nonterminals to a list of all
# productions of that nonterminal.
self.Prodmap = {} # A dictionary that is only used to detect duplicate
# productions.
self.Terminals = {} # A dictionary mapping the names of terminal symbols to a
# list of the rules where they are used.
for term in terminals:
self.Terminals[term] = []
self.Terminals['error'] = []
self.Nonterminals = {} # A dictionary mapping names of nonterminals to a list
# of rule numbers where they are used.
self.First = {} # A dictionary of precomputed FIRST(x) symbols
self.Follow = {} # A dictionary of precomputed FOLLOW(x) symbols
self.Precedence = {} # Precedence rules for each terminal. Contains tuples of the
# form ('right',level) or ('nonassoc', level) or ('left',level)
self.UsedPrecedence = set() # Precedence rules that were actually used by the grammer.
# This is only used to provide error checking and to generate
# a warning about unused precedence rules.
self.Start = None # Starting symbol for the grammar
def __len__(self):
return len(self.Productions)
def __getitem__(self, index):
return self.Productions[index]
# -----------------------------------------------------------------------------
# set_precedence()
#
# Sets the precedence for a given terminal. assoc is the associativity such as
# 'left','right', or 'nonassoc'. level is a numeric level.
#
# -----------------------------------------------------------------------------
def set_precedence(self, term, assoc, level):
assert self.Productions == [None], 'Must call set_precedence() before add_production()'
if term in self.Precedence:
raise GrammarError('Precedence already specified for terminal %r' % term)
if assoc not in ['left', 'right', 'nonassoc']:
raise GrammarError("Associativity must be one of 'left','right', or 'nonassoc'")
self.Precedence[term] = (assoc, level)
# -----------------------------------------------------------------------------
# add_production()
#
# Given an action function, this function assembles a production rule and
# computes its precedence level.
#
# The production rule is supplied as a list of symbols. For example,
# a rule such as 'expr : expr PLUS term' has a production name of 'expr' and
# symbols ['expr','PLUS','term'].
#
# Precedence is determined by the precedence of the right-most non-terminal
# or the precedence of a terminal specified by %prec.
#
# A variety of error checks are performed to make sure production symbols
# are valid and that %prec is used correctly.
# -----------------------------------------------------------------------------
def add_production(self, prodname, syms, func=None, file='', line=0):
if prodname in self.Terminals:
raise GrammarError('%s:%d: Illegal rule name %r. Already defined as a token' % (file, line, prodname))
if prodname == 'error':
raise GrammarError('%s:%d: Illegal rule name %r. error is a reserved word' % (file, line, prodname))
if not _is_identifier.match(prodname):
raise GrammarError('%s:%d: Illegal rule name %r' % (file, line, prodname))
# Look for literal tokens
for n, s in enumerate(syms):
if s[0] in "'\"":
try:
c = eval(s)
if (len(c) > 1):
raise GrammarError('%s:%d: Literal token %s in rule %r may only be a single character' %
(file, line, s, prodname))
if c not in self.Terminals:
self.Terminals[c] = []
syms[n] = c
continue
except SyntaxError:
pass
if not _is_identifier.match(s) and s != '%prec':
raise GrammarError('%s:%d: Illegal name %r in rule %r' % (file, line, s, prodname))
# Determine the precedence level
if '%prec' in syms:
if syms[-1] == '%prec':
raise GrammarError('%s:%d: Syntax error. Nothing follows %%prec' % (file, line))
if syms[-2] != '%prec':
raise GrammarError('%s:%d: Syntax error. %%prec can only appear at the end of a grammar rule' %
(file, line))
precname = syms[-1]
prodprec = self.Precedence.get(precname)
if not prodprec:
raise GrammarError('%s:%d: Nothing known about the precedence of %r' % (file, line, precname))
else:
self.UsedPrecedence.add(precname)
del syms[-2:] # Drop %prec from the rule
else:
# If no %prec, precedence is determined by the rightmost terminal symbol
precname = rightmost_terminal(syms, self.Terminals)
prodprec = self.Precedence.get(precname, ('right', 0))
# See if the rule is already in the rulemap
map = '%s -> %s' % (prodname, syms)
if map in self.Prodmap:
m = self.Prodmap[map]
raise GrammarError('%s:%d: Duplicate rule %s. ' % (file, line, m) +
'Previous definition at %s:%d' % (m.file, m.line))
# From this point on, everything is valid. Create a new Production instance
pnumber = len(self.Productions)
if prodname not in self.Nonterminals:
self.Nonterminals[prodname] = []
# Add the production number to Terminals and Nonterminals
for t in syms:
if t in self.Terminals:
self.Terminals[t].append(pnumber)
else:
if t not in self.Nonterminals:
self.Nonterminals[t] = []
self.Nonterminals[t].append(pnumber)
# Create a production and add it to the list of productions
p = Production(pnumber, prodname, syms, prodprec, func, file, line)
self.Productions.append(p)
self.Prodmap[map] = p
# Add to the global productions list
try:
self.Prodnames[prodname].append(p)
except KeyError:
self.Prodnames[prodname] = [p]
# -----------------------------------------------------------------------------
# set_start()
#
# Sets the starting symbol and creates the augmented grammar. Production
# rule 0 is S' -> start where start is the start symbol.
# -----------------------------------------------------------------------------
def set_start(self, start=None):
if not start:
start = self.Productions[1].name
if start not in self.Nonterminals:
raise GrammarError('start symbol %s undefined' % start)
self.Productions[0] = Production(0, "S'", [start])
self.Nonterminals[start].append(0)
self.Start = start
# -----------------------------------------------------------------------------
# find_unreachable()
#
# Find all of the nonterminal symbols that can't be reached from the starting
# symbol. Returns a list of nonterminals that can't be reached.
# -----------------------------------------------------------------------------
def find_unreachable(self):
# Mark all symbols that are reachable from a symbol s
def mark_reachable_from(s):
if s in reachable:
return
reachable.add(s)
for p in self.Prodnames.get(s, []):
for r in p.prod:
mark_reachable_from(r)
reachable = set()
mark_reachable_from(self.Productions[0].prod[0])
return [s for s in self.Nonterminals if s not in reachable]
# -----------------------------------------------------------------------------
# infinite_cycles()
#
# This function looks at the various parsing rules and tries to detect
# infinite recursion cycles (grammar rules where there is no possible way
# to derive a string of only terminals).
# -----------------------------------------------------------------------------
def infinite_cycles(self):
terminates = {}
# Terminals:
for t in self.Terminals:
terminates[t] = True
terminates['$end'] = True
# Nonterminals:
# Initialize to false:
for n in self.Nonterminals:
terminates[n] = False
# Then propagate termination until no change:
while True:
some_change = False
for (n, pl) in self.Prodnames.items():
# Nonterminal n terminates iff any of its productions terminates.
for p in pl:
# Production p terminates iff all of its rhs symbols terminate.
for s in p.prod:
if not terminates[s]:
# The symbol s does not terminate,
# so production p does not terminate.
p_terminates = False
break
else:
# didn't break from the loop,
# so every symbol s terminates
# so production p terminates.
p_terminates = True
if p_terminates:
# symbol n terminates!
if not terminates[n]:
terminates[n] = True
some_change = True
# Don't need to consider any more productions for this n.
break
if not some_change:
break
infinite = []
for (s, term) in terminates.items():
if not term:
if s not in self.Prodnames and s not in self.Terminals and s != 'error':
# s is used-but-not-defined, and we've already warned of that,
# so it would be overkill to say that it's also non-terminating.
pass
else:
infinite.append(s)
return infinite
# -----------------------------------------------------------------------------
# undefined_symbols()
#
# Find all symbols that were used the grammar, but not defined as tokens or
# grammar rules. Returns a list of tuples (sym, prod) where sym in the symbol
# and prod is the production where the symbol was used.
# -----------------------------------------------------------------------------
def undefined_symbols(self):
result = []
for p in self.Productions:
if not p:
continue
for s in p.prod:
if s not in self.Prodnames and s not in self.Terminals and s != 'error':
result.append((s, p))
return result
# -----------------------------------------------------------------------------
# unused_terminals()
#
# Find all terminals that were defined, but not used by the grammar. Returns
# a list of all symbols.
# -----------------------------------------------------------------------------
def unused_terminals(self):
unused_tok = []
for s, v in self.Terminals.items():
if s != 'error' and not v:
unused_tok.append(s)
return unused_tok
# ------------------------------------------------------------------------------
# unused_rules()
#
# Find all grammar rules that were defined, but not used (maybe not reachable)
# Returns a list of productions.
# ------------------------------------------------------------------------------
def unused_rules(self):
unused_prod = []
for s, v in self.Nonterminals.items():
if not v:
p = self.Prodnames[s][0]
unused_prod.append(p)
return unused_prod
# -----------------------------------------------------------------------------
# unused_precedence()
#
# Returns a list of tuples (term,precedence) corresponding to precedence
# rules that were never used by the grammar. term is the name of the terminal
# on which precedence was applied and precedence is a string such as 'left' or
# 'right' corresponding to the type of precedence.
# -----------------------------------------------------------------------------
def unused_precedence(self):
unused = []
for termname in self.Precedence:
if not (termname in self.Terminals or termname in self.UsedPrecedence):
unused.append((termname, self.Precedence[termname][0]))
return unused
# -------------------------------------------------------------------------
# _first()
#
# Compute the value of FIRST1(beta) where beta is a tuple of symbols.
#
# During execution of compute_first1, the result may be incomplete.
# Afterward (e.g., when called from compute_follow()), it will be complete.
# -------------------------------------------------------------------------
def _first(self, beta):
# We are computing First(x1,x2,x3,...,xn)
result = []
for x in beta:
x_produces_empty = False
# Add all the non-<empty> symbols of First[x] to the result.
for f in self.First[x]:
if f == '<empty>':
x_produces_empty = True
else:
if f not in result:
result.append(f)
if x_produces_empty:
# We have to consider the next x in beta,
# i.e. stay in the loop.
pass
else:
# We don't have to consider any further symbols in beta.
break
else:
# There was no 'break' from the loop,
# so x_produces_empty was true for all x in beta,
# so beta produces empty as well.
result.append('<empty>')
return result
# -------------------------------------------------------------------------
# compute_first()
#
# Compute the value of FIRST1(X) for all symbols
# -------------------------------------------------------------------------
def compute_first(self):
if self.First:
return self.First
# Terminals:
for t in self.Terminals:
self.First[t] = [t]
self.First['$end'] = ['$end']
# Nonterminals:
# Initialize to the empty set:
for n in self.Nonterminals:
self.First[n] = []
# Then propagate symbols until no change:
while True:
some_change = False
for n in self.Nonterminals:
for p in self.Prodnames[n]:
for f in self._first(p.prod):
if f not in self.First[n]:
self.First[n].append(f)
some_change = True
if not some_change:
break
return self.First
# ---------------------------------------------------------------------
# compute_follow()
#
# Computes all of the follow sets for every non-terminal symbol. The
# follow set is the set of all symbols that might follow a given
# non-terminal. See the Dragon book, 2nd Ed. p. 189.
# ---------------------------------------------------------------------
def compute_follow(self, start=None):
# If already computed, return the result
if self.Follow:
return self.Follow
# If first sets not computed yet, do that first.
if not self.First:
self.compute_first()
# Add '$end' to the follow list of the start symbol
for k in self.Nonterminals:
self.Follow[k] = []
if not start:
start = self.Productions[1].name
self.Follow[start] = ['$end']
while True:
didadd = False
for p in self.Productions[1:]:
# Here is the production set
for i, B in enumerate(p.prod):
if B in self.Nonterminals:
# Okay. We got a non-terminal in a production
fst = self._first(p.prod[i+1:])
hasempty = False
for f in fst:
if f != '<empty>' and f not in self.Follow[B]:
self.Follow[B].append(f)
didadd = True
if f == '<empty>':
hasempty = True
if hasempty or i == (len(p.prod)-1):
# Add elements of follow(a) to follow(b)
for f in self.Follow[p.name]:
if f not in self.Follow[B]:
self.Follow[B].append(f)
didadd = True
if not didadd:
break
return self.Follow
# -----------------------------------------------------------------------------
# build_lritems()
#
# This function walks the list of productions and builds a complete set of the
# LR items. The LR items are stored in two ways: First, they are uniquely
# numbered and placed in the list _lritems. Second, a linked list of LR items
# is built for each production. For example:
#
# E -> E PLUS E
#
# Creates the list
#
# [E -> . E PLUS E, E -> E . PLUS E, E -> E PLUS . E, E -> E PLUS E . ]
# -----------------------------------------------------------------------------
def build_lritems(self):
for p in self.Productions:
lastlri = p
i = 0
lr_items = []
while True:
if i > len(p):
lri = None
else:
lri = LRItem(p, i)
# Precompute the list of productions immediately following
try:
lri.lr_after = self.Prodnames[lri.prod[i+1]]
except (IndexError, KeyError):
lri.lr_after = []
try:
lri.lr_before = lri.prod[i-1]
except IndexError:
lri.lr_before = None
lastlri.lr_next = lri
if not lri:
break
lr_items.append(lri)
lastlri = lri
i += 1
p.lr_items = lr_items
# -----------------------------------------------------------------------------
# == Class LRTable ==
#
# This basic class represents a basic table of LR parsing information.
# Methods for generating the tables are not defined here. They are defined
# in the derived class LRGeneratedTable.
# -----------------------------------------------------------------------------
class VersionError(YaccError):
pass
class LRTable(object):
def __init__(self):
self.lr_action = None
self.lr_goto = None
self.lr_productions = None
self.lr_method = None
def read_table(self, module):
if isinstance(module, types.ModuleType):
parsetab = module
else:
exec('import %s' % module)
parsetab = sys.modules[module]
if parsetab._tabversion != __tabversion__:
raise VersionError('yacc table file version is out of date')
self.lr_action = parsetab._lr_action
self.lr_goto = parsetab._lr_goto
self.lr_productions = []
for p in parsetab._lr_productions:
self.lr_productions.append(MiniProduction(*p))
self.lr_method = parsetab._lr_method
return parsetab._lr_signature
def read_pickle(self, filename):
try:
import cPickle as pickle
except ImportError:
import pickle
if not os.path.exists(filename):
raise ImportError
in_f = open(filename, 'rb')
tabversion = pickle.load(in_f)
if tabversion != __tabversion__:
raise VersionError('yacc table file version is out of date')
self.lr_method = pickle.load(in_f)
signature = pickle.load(in_f)
self.lr_action = pickle.load(in_f)
self.lr_goto = pickle.load(in_f)
productions = pickle.load(in_f)
self.lr_productions = []
for p in productions:
self.lr_productions.append(MiniProduction(*p))
in_f.close()
return signature
# Bind all production function names to callable objects in pdict
def bind_callables(self, pdict):
for p in self.lr_productions:
p.bind(pdict)
# -----------------------------------------------------------------------------
# === LR Generator ===
#
# The following classes and functions are used to generate LR parsing tables on
# a grammar.
# -----------------------------------------------------------------------------
# -----------------------------------------------------------------------------
# digraph()
# traverse()
#
# The following two functions are used to compute set valued functions
# of the form:
#
# F(x) = F'(x) U U{F(y) | x R y}
#
# This is used to compute the values of Read() sets as well as FOLLOW sets
# in LALR(1) generation.
#
# Inputs: X - An input set
# R - A relation
# FP - Set-valued function
# ------------------------------------------------------------------------------
def digraph(X, R, FP):
N = {}
for x in X:
N[x] = 0
stack = []
F = {}
for x in X:
if N[x] == 0:
traverse(x, N, stack, F, X, R, FP)
return F
def traverse(x, N, stack, F, X, R, FP):
stack.append(x)
d = len(stack)
N[x] = d
F[x] = FP(x) # F(X) <- F'(x)
rel = R(x) # Get y's related to x
for y in rel:
if N[y] == 0:
traverse(y, N, stack, F, X, R, FP)
N[x] = min(N[x], N[y])
for a in F.get(y, []):
if a not in F[x]:
F[x].append(a)
if N[x] == d:
N[stack[-1]] = MAXINT
F[stack[-1]] = F[x]
element = stack.pop()
while element != x:
N[stack[-1]] = MAXINT
F[stack[-1]] = F[x]
element = stack.pop()
class LALRError(YaccError):
pass
# -----------------------------------------------------------------------------
# == LRGeneratedTable ==
#
# This class implements the LR table generation algorithm. There are no
# public methods except for write()
# -----------------------------------------------------------------------------
class LRGeneratedTable(LRTable):
def __init__(self, grammar, method='LALR', log=None):
if method not in ['SLR', 'LALR']:
raise LALRError('Unsupported method %s' % method)
self.grammar = grammar
self.lr_method = method
# Set up the logger
if not log:
log = NullLogger()
self.log = log
# Internal attributes
self.lr_action = {} # Action table
self.lr_goto = {} # Goto table
self.lr_productions = grammar.Productions # Copy of grammar Production array
self.lr_goto_cache = {} # Cache of computed gotos
self.lr0_cidhash = {} # Cache of closures
self._add_count = 0 # Internal counter used to detect cycles
# Diagonistic information filled in by the table generator
self.sr_conflict = 0
self.rr_conflict = 0
self.conflicts = [] # List of conflicts
self.sr_conflicts = []
self.rr_conflicts = []
# Build the tables
self.grammar.build_lritems()
self.grammar.compute_first()
self.grammar.compute_follow()
self.lr_parse_table()
# Compute the LR(0) closure operation on I, where I is a set of LR(0) items.
def lr0_closure(self, I):
self._add_count += 1
# Add everything in I to J
J = I[:]
didadd = True
while didadd:
didadd = False
for j in J:
for x in j.lr_after:
if getattr(x, 'lr0_added', 0) == self._add_count:
continue
# Add B --> .G to J
J.append(x.lr_next)
x.lr0_added = self._add_count
didadd = True
return J
# Compute the LR(0) goto function goto(I,X) where I is a set
# of LR(0) items and X is a grammar symbol. This function is written
# in a way that guarantees uniqueness of the generated goto sets
# (i.e. the same goto set will never be returned as two different Python
# objects). With uniqueness, we can later do fast set comparisons using
# id(obj) instead of element-wise comparison.
def lr0_goto(self, I, x):
# First we look for a previously cached entry
g = self.lr_goto_cache.get((id(I), x))
if g:
return g
# Now we generate the goto set in a way that guarantees uniqueness
# of the result
s = self.lr_goto_cache.get(x)
if not s:
s = {}
self.lr_goto_cache[x] = s
gs = []
for p in I:
n = p.lr_next
if n and n.lr_before == x:
s1 = s.get(id(n))
if not s1:
s1 = {}
s[id(n)] = s1
gs.append(n)
s = s1
g = s.get('$end')
if not g:
if gs:
g = self.lr0_closure(gs)
s['$end'] = g
else:
s['$end'] = gs
self.lr_goto_cache[(id(I), x)] = g
return g
# Compute the LR(0) sets of item function
def lr0_items(self):
C = [self.lr0_closure([self.grammar.Productions[0].lr_next])]
i = 0
for I in C:
self.lr0_cidhash[id(I)] = i
i += 1
# Loop over the items in C and each grammar symbols
i = 0
while i < len(C):
I = C[i]
i += 1
# Collect all of the symbols that could possibly be in the goto(I,X) sets
asyms = {}
for ii in I:
for s in ii.usyms:
asyms[s] = None
for x in asyms:
g = self.lr0_goto(I, x)
if not g or id(g) in self.lr0_cidhash:
continue
self.lr0_cidhash[id(g)] = len(C)
C.append(g)
return C
# -----------------------------------------------------------------------------
# ==== LALR(1) Parsing ====
#
# LALR(1) parsing is almost exactly the same as SLR except that instead of
# relying upon Follow() sets when performing reductions, a more selective
# lookahead set that incorporates the state of the LR(0) machine is utilized.
# Thus, we mainly just have to focus on calculating the lookahead sets.
#
# The method used here is due to DeRemer and Pennelo (1982).
#
# DeRemer, F. L., and T. J. Pennelo: "Efficient Computation of LALR(1)
# Lookahead Sets", ACM Transactions on Programming Languages and Systems,
# Vol. 4, No. 4, Oct. 1982, pp. 615-649
#
# Further details can also be found in:
#
# J. Tremblay and P. Sorenson, "The Theory and Practice of Compiler Writing",
# McGraw-Hill Book Company, (1985).
#
# -----------------------------------------------------------------------------
# -----------------------------------------------------------------------------
# compute_nullable_nonterminals()
#
# Creates a dictionary containing all of the non-terminals that might produce
# an empty production.
# -----------------------------------------------------------------------------
def compute_nullable_nonterminals(self):
nullable = set()
num_nullable = 0
while True:
for p in self.grammar.Productions[1:]:
if p.len == 0:
nullable.add(p.name)
continue
for t in p.prod:
if t not in nullable:
break
else:
nullable.add(p.name)
if len(nullable) == num_nullable:
break
num_nullable = len(nullable)
return nullable
# -----------------------------------------------------------------------------
# find_nonterminal_trans(C)
#
# Given a set of LR(0) items, this functions finds all of the non-terminal
# transitions. These are transitions in which a dot appears immediately before
# a non-terminal. Returns a list of tuples of the form (state,N) where state
# is the state number and N is the nonterminal symbol.
#
# The input C is the set of LR(0) items.
# -----------------------------------------------------------------------------
def find_nonterminal_transitions(self, C):
trans = []
for stateno, state in enumerate(C):
for p in state:
if p.lr_index < p.len - 1:
t = (stateno, p.prod[p.lr_index+1])
if t[1] in self.grammar.Nonterminals:
if t not in trans:
trans.append(t)
return trans
# -----------------------------------------------------------------------------
# dr_relation()
#
# Computes the DR(p,A) relationships for non-terminal transitions. The input
# is a tuple (state,N) where state is a number and N is a nonterminal symbol.
#
# Returns a list of terminals.
# -----------------------------------------------------------------------------
def dr_relation(self, C, trans, nullable):
state, N = trans
terms = []
g = self.lr0_goto(C[state], N)
for p in g:
if p.lr_index < p.len - 1:
a = p.prod[p.lr_index+1]
if a in self.grammar.Terminals:
if a not in terms:
terms.append(a)
# This extra bit is to handle the start state
if state == 0 and N == self.grammar.Productions[0].prod[0]:
terms.append('$end')
return terms
# -----------------------------------------------------------------------------
# reads_relation()
#
# Computes the READS() relation (p,A) READS (t,C).
# -----------------------------------------------------------------------------
def reads_relation(self, C, trans, empty):
# Look for empty transitions
rel = []
state, N = trans
g = self.lr0_goto(C[state], N)
j = self.lr0_cidhash.get(id(g), -1)
for p in g:
if p.lr_index < p.len - 1:
a = p.prod[p.lr_index + 1]
if a in empty:
rel.append((j, a))
return rel
# -----------------------------------------------------------------------------
# compute_lookback_includes()
#
# Determines the lookback and includes relations
#
# LOOKBACK:
#
# This relation is determined by running the LR(0) state machine forward.
# For example, starting with a production "N : . A B C", we run it forward
# to obtain "N : A B C ." We then build a relationship between this final
# state and the starting state. These relationships are stored in a dictionary
# lookdict.
#
# INCLUDES:
#
# Computes the INCLUDE() relation (p,A) INCLUDES (p',B).
#
# This relation is used to determine non-terminal transitions that occur
# inside of other non-terminal transition states. (p,A) INCLUDES (p', B)
# if the following holds:
#
# B -> LAT, where T -> epsilon and p' -L-> p
#
# L is essentially a prefix (which may be empty), T is a suffix that must be
# able to derive an empty string. State p' must lead to state p with the string L.
#
# -----------------------------------------------------------------------------
def compute_lookback_includes(self, C, trans, nullable):
lookdict = {} # Dictionary of lookback relations
includedict = {} # Dictionary of include relations
# Make a dictionary of non-terminal transitions
dtrans = {}
for t in trans:
dtrans[t] = 1
# Loop over all transitions and compute lookbacks and includes
for state, N in trans:
lookb = []
includes = []
for p in C[state]:
if p.name != N:
continue
# Okay, we have a name match. We now follow the production all the way
# through the state machine until we get the . on the right hand side
lr_index = p.lr_index
j = state
while lr_index < p.len - 1:
lr_index = lr_index + 1
t = p.prod[lr_index]
# Check to see if this symbol and state are a non-terminal transition
if (j, t) in dtrans:
# Yes. Okay, there is some chance that this is an includes relation
# the only way to know for certain is whether the rest of the
# production derives empty
li = lr_index + 1
while li < p.len:
if p.prod[li] in self.grammar.Terminals:
break # No forget it
if p.prod[li] not in nullable:
break
li = li + 1
else:
# Appears to be a relation between (j,t) and (state,N)
includes.append((j, t))
g = self.lr0_goto(C[j], t) # Go to next set
j = self.lr0_cidhash.get(id(g), -1) # Go to next state
# When we get here, j is the final state, now we have to locate the production
for r in C[j]:
if r.name != p.name:
continue
if r.len != p.len:
continue
i = 0
# This look is comparing a production ". A B C" with "A B C ."
while i < r.lr_index:
if r.prod[i] != p.prod[i+1]:
break
i = i + 1
else:
lookb.append((j, r))
for i in includes:
if i not in includedict:
includedict[i] = []
includedict[i].append((state, N))
lookdict[(state, N)] = lookb
return lookdict, includedict
# -----------------------------------------------------------------------------
# compute_read_sets()
#
# Given a set of LR(0) items, this function computes the read sets.
#
# Inputs: C = Set of LR(0) items
# ntrans = Set of nonterminal transitions
# nullable = Set of empty transitions
#
# Returns a set containing the read sets
# -----------------------------------------------------------------------------
def compute_read_sets(self, C, ntrans, nullable):
FP = lambda x: self.dr_relation(C, x, nullable)
R = lambda x: self.reads_relation(C, x, nullable)
F = digraph(ntrans, R, FP)
return F
# -----------------------------------------------------------------------------
# compute_follow_sets()
#
# Given a set of LR(0) items, a set of non-terminal transitions, a readset,
# and an include set, this function computes the follow sets
#
# Follow(p,A) = Read(p,A) U U {Follow(p',B) | (p,A) INCLUDES (p',B)}
#
# Inputs:
# ntrans = Set of nonterminal transitions
# readsets = Readset (previously computed)
# inclsets = Include sets (previously computed)
#
# Returns a set containing the follow sets
# -----------------------------------------------------------------------------
def compute_follow_sets(self, ntrans, readsets, inclsets):
FP = lambda x: readsets[x]
R = lambda x: inclsets.get(x, [])
F = digraph(ntrans, R, FP)
return F
# -----------------------------------------------------------------------------
# add_lookaheads()
#
# Attaches the lookahead symbols to grammar rules.
#
# Inputs: lookbacks - Set of lookback relations
# followset - Computed follow set
#
# This function directly attaches the lookaheads to productions contained
# in the lookbacks set
# -----------------------------------------------------------------------------
def add_lookaheads(self, lookbacks, followset):
for trans, lb in lookbacks.items():
# Loop over productions in lookback
for state, p in lb:
if state not in p.lookaheads:
p.lookaheads[state] = []
f = followset.get(trans, [])
for a in f:
if a not in p.lookaheads[state]:
p.lookaheads[state].append(a)
# -----------------------------------------------------------------------------
# add_lalr_lookaheads()
#
# This function does all of the work of adding lookahead information for use
# with LALR parsing
# -----------------------------------------------------------------------------
def add_lalr_lookaheads(self, C):
# Determine all of the nullable nonterminals
nullable = self.compute_nullable_nonterminals()
# Find all non-terminal transitions
trans = self.find_nonterminal_transitions(C)
# Compute read sets
readsets = self.compute_read_sets(C, trans, nullable)
# Compute lookback/includes relations
lookd, included = self.compute_lookback_includes(C, trans, nullable)
# Compute LALR FOLLOW sets
followsets = self.compute_follow_sets(trans, readsets, included)
# Add all of the lookaheads
self.add_lookaheads(lookd, followsets)
# -----------------------------------------------------------------------------
# lr_parse_table()
#
# This function constructs the parse tables for SLR or LALR
# -----------------------------------------------------------------------------
def lr_parse_table(self):
Productions = self.grammar.Productions
Precedence = self.grammar.Precedence
goto = self.lr_goto # Goto array
action = self.lr_action # Action array
log = self.log # Logger for output
actionp = {} # Action production array (temporary)
log.info('Parsing method: %s', self.lr_method)
# Step 1: Construct C = { I0, I1, ... IN}, collection of LR(0) items
# This determines the number of states
C = self.lr0_items()
if self.lr_method == 'LALR':
self.add_lalr_lookaheads(C)
# Build the parser table, state by state
st = 0
for I in C:
# Loop over each production in I
actlist = [] # List of actions
st_action = {}
st_actionp = {}
st_goto = {}
log.info('')
log.info('state %d', st)
log.info('')
for p in I:
log.info(' (%d) %s', p.number, p)
log.info('')
for p in I:
if p.len == p.lr_index + 1:
if p.name == "S'":
# Start symbol. Accept!
st_action['$end'] = 0
st_actionp['$end'] = p
else:
# We are at the end of a production. Reduce!
if self.lr_method == 'LALR':
laheads = p.lookaheads[st]
else:
laheads = self.grammar.Follow[p.name]
for a in laheads:
actlist.append((a, p, 'reduce using rule %d (%s)' % (p.number, p)))
r = st_action.get(a)
if r is not None:
# Whoa. Have a shift/reduce or reduce/reduce conflict
if r > 0:
# Need to decide on shift or reduce here
# By default we favor shifting. Need to add
# some precedence rules here.
# Shift precedence comes from the token
sprec, slevel = Precedence.get(a, ('right', 0))
# Reduce precedence comes from rule being reduced (p)
rprec, rlevel = Productions[p.number].prec
if (slevel < rlevel) or ((slevel == rlevel) and (rprec == 'left')):
# We really need to reduce here.
st_action[a] = -p.number
st_actionp[a] = p
if not slevel and not rlevel:
log.info(' ! shift/reduce conflict for %s resolved as reduce', a)
self.sr_conflicts.append((st, a, 'reduce'))
Productions[p.number].reduced += 1
elif (slevel == rlevel) and (rprec == 'nonassoc'):
st_action[a] = None
else:
# Hmmm. Guess we'll keep the shift
if not rlevel:
log.info(' ! shift/reduce conflict for %s resolved as shift', a)
self.sr_conflicts.append((st, a, 'shift'))
elif r < 0:
# Reduce/reduce conflict. In this case, we favor the rule
# that was defined first in the grammar file
oldp = Productions[-r]
pp = Productions[p.number]
if oldp.line > pp.line:
st_action[a] = -p.number
st_actionp[a] = p
chosenp, rejectp = pp, oldp
Productions[p.number].reduced += 1
Productions[oldp.number].reduced -= 1
else:
chosenp, rejectp = oldp, pp
self.rr_conflicts.append((st, chosenp, rejectp))
log.info(' ! reduce/reduce conflict for %s resolved using rule %d (%s)',
a, st_actionp[a].number, st_actionp[a])
else:
raise LALRError('Unknown conflict in state %d' % st)
else:
st_action[a] = -p.number
st_actionp[a] = p
Productions[p.number].reduced += 1
else:
i = p.lr_index
a = p.prod[i+1] # Get symbol right after the "."
if a in self.grammar.Terminals:
g = self.lr0_goto(I, a)
j = self.lr0_cidhash.get(id(g), -1)
if j >= 0:
# We are in a shift state
actlist.append((a, p, 'shift and go to state %d' % j))
r = st_action.get(a)
if r is not None:
# Whoa have a shift/reduce or shift/shift conflict
if r > 0:
if r != j:
raise LALRError('Shift/shift conflict in state %d' % st)
elif r < 0:
# Do a precedence check.
# - if precedence of reduce rule is higher, we reduce.
# - if precedence of reduce is same and left assoc, we reduce.
# - otherwise we shift
# Shift precedence comes from the token
sprec, slevel = Precedence.get(a, ('right', 0))
# Reduce precedence comes from the rule that could have been reduced
rprec, rlevel = Productions[st_actionp[a].number].prec
if (slevel > rlevel) or ((slevel == rlevel) and (rprec == 'right')):
# We decide to shift here... highest precedence to shift
Productions[st_actionp[a].number].reduced -= 1
st_action[a] = j
st_actionp[a] = p
if not rlevel:
log.info(' ! shift/reduce conflict for %s resolved as shift', a)
self.sr_conflicts.append((st, a, 'shift'))
elif (slevel == rlevel) and (rprec == 'nonassoc'):
st_action[a] = None
else:
# Hmmm. Guess we'll keep the reduce
if not slevel and not rlevel:
log.info(' ! shift/reduce conflict for %s resolved as reduce', a)
self.sr_conflicts.append((st, a, 'reduce'))
else:
raise LALRError('Unknown conflict in state %d' % st)
else:
st_action[a] = j
st_actionp[a] = p
# Print the actions associated with each terminal
_actprint = {}
for a, p, m in actlist:
if a in st_action:
if p is st_actionp[a]:
log.info(' %-15s %s', a, m)
_actprint[(a, m)] = 1
log.info('')
# Print the actions that were not used. (debugging)
not_used = 0
for a, p, m in actlist:
if a in st_action:
if p is not st_actionp[a]:
if not (a, m) in _actprint:
log.debug(' ! %-15s [ %s ]', a, m)
not_used = 1
_actprint[(a, m)] = 1
if not_used:
log.debug('')
# Construct the goto table for this state
nkeys = {}
for ii in I:
for s in ii.usyms:
if s in self.grammar.Nonterminals:
nkeys[s] = None
for n in nkeys:
g = self.lr0_goto(I, n)
j = self.lr0_cidhash.get(id(g), -1)
if j >= 0:
st_goto[n] = j
log.info(' %-30s shift and go to state %d', n, j)
action[st] = st_action
actionp[st] = st_actionp
goto[st] = st_goto
st += 1
# -----------------------------------------------------------------------------
# write()
#
# This function writes the LR parsing tables to a file
# -----------------------------------------------------------------------------
def write_table(self, tabmodule, outputdir='', signature=''):
if isinstance(tabmodule, types.ModuleType):
raise IOError("Won't overwrite existing tabmodule")
basemodulename = tabmodule.split('.')[-1]
filename = os.path.join(outputdir, basemodulename) + '.py'
try:
f = open(filename, 'w')
f.write('''
# %s
# This file is automatically generated. Do not edit.
# pylint: disable=W,C,R
_tabversion = %r
_lr_method = %r
_lr_signature = %r
''' % (os.path.basename(filename), __tabversion__, self.lr_method, signature))
# Change smaller to 0 to go back to original tables
smaller = 1
# Factor out names to try and make smaller
if smaller:
items = {}
for s, nd in self.lr_action.items():
for name, v in nd.items():
i = items.get(name)
if not i:
i = ([], [])
items[name] = i
i[0].append(s)
i[1].append(v)
f.write('\n_lr_action_items = {')
for k, v in items.items():
f.write('%r:([' % k)
for i in v[0]:
f.write('%r,' % i)
f.write('],[')
for i in v[1]:
f.write('%r,' % i)
f.write(']),')
f.write('}\n')
f.write('''
_lr_action = {}
for _k, _v in _lr_action_items.items():
for _x,_y in zip(_v[0],_v[1]):
if not _x in _lr_action: _lr_action[_x] = {}
_lr_action[_x][_k] = _y
del _lr_action_items
''')
else:
f.write('\n_lr_action = { ')
for k, v in self.lr_action.items():
f.write('(%r,%r):%r,' % (k[0], k[1], v))
f.write('}\n')
if smaller:
# Factor out names to try and make smaller
items = {}
for s, nd in self.lr_goto.items():
for name, v in nd.items():
i = items.get(name)
if not i:
i = ([], [])
items[name] = i
i[0].append(s)
i[1].append(v)
f.write('\n_lr_goto_items = {')
for k, v in items.items():
f.write('%r:([' % k)
for i in v[0]:
f.write('%r,' % i)
f.write('],[')
for i in v[1]:
f.write('%r,' % i)
f.write(']),')
f.write('}\n')
f.write('''
_lr_goto = {}
for _k, _v in _lr_goto_items.items():
for _x, _y in zip(_v[0], _v[1]):
if not _x in _lr_goto: _lr_goto[_x] = {}
_lr_goto[_x][_k] = _y
del _lr_goto_items
''')
else:
f.write('\n_lr_goto = { ')
for k, v in self.lr_goto.items():
f.write('(%r,%r):%r,' % (k[0], k[1], v))
f.write('}\n')
# Write production table
f.write('_lr_productions = [\n')
for p in self.lr_productions:
if p.func:
f.write(' (%r,%r,%d,%r,%r,%d),\n' % (p.str, p.name, p.len,
p.func, os.path.basename(p.file), p.line))
else:
f.write(' (%r,%r,%d,None,None,None),\n' % (str(p), p.name, p.len))
f.write(']\n')
f.close()
except IOError as e:
raise
# -----------------------------------------------------------------------------
# pickle_table()
#
# This function pickles the LR parsing tables to a supplied file object
# -----------------------------------------------------------------------------
def pickle_table(self, filename, signature=''):
try:
import cPickle as pickle
except ImportError:
import pickle
with open(filename, 'wb') as outf:
pickle.dump(__tabversion__, outf, pickle_protocol)
pickle.dump(self.lr_method, outf, pickle_protocol)
pickle.dump(signature, outf, pickle_protocol)
pickle.dump(self.lr_action, outf, pickle_protocol)
pickle.dump(self.lr_goto, outf, pickle_protocol)
outp = []
for p in self.lr_productions:
if p.func:
outp.append((p.str, p.name, p.len, p.func, os.path.basename(p.file), p.line))
else:
outp.append((str(p), p.name, p.len, None, None, None))
pickle.dump(outp, outf, pickle_protocol)
# -----------------------------------------------------------------------------
# === INTROSPECTION ===
#
# The following functions and classes are used to implement the PLY
# introspection features followed by the yacc() function itself.
# -----------------------------------------------------------------------------
# -----------------------------------------------------------------------------
# get_caller_module_dict()
#
# This function returns a dictionary containing all of the symbols defined within
# a caller further down the call stack. This is used to get the environment
# associated with the yacc() call if none was provided.
# -----------------------------------------------------------------------------
def get_caller_module_dict(levels):
f = sys._getframe(levels)
ldict = f.f_globals.copy()
if f.f_globals != f.f_locals:
ldict.update(f.f_locals)
return ldict
# -----------------------------------------------------------------------------
# parse_grammar()
#
# This takes a raw grammar rule string and parses it into production data
# -----------------------------------------------------------------------------
def parse_grammar(doc, file, line):
grammar = []
# Split the doc string into lines
pstrings = doc.splitlines()
lastp = None
dline = line
for ps in pstrings:
dline += 1
p = ps.split()
if not p:
continue
try:
if p[0] == '|':
# This is a continuation of a previous rule
if not lastp:
raise SyntaxError("%s:%d: Misplaced '|'" % (file, dline))
prodname = lastp
syms = p[1:]
else:
prodname = p[0]
lastp = prodname
syms = p[2:]
assign = p[1]
if assign != ':' and assign != '::=':
raise SyntaxError("%s:%d: Syntax error. Expected ':'" % (file, dline))
grammar.append((file, dline, prodname, syms))
except SyntaxError:
raise
except Exception:
raise SyntaxError('%s:%d: Syntax error in rule %r' % (file, dline, ps.strip()))
return grammar
# -----------------------------------------------------------------------------
# ParserReflect()
#
# This class represents information extracted for building a parser including
# start symbol, error function, tokens, precedence list, action functions,
# etc.
# -----------------------------------------------------------------------------
class ParserReflect(object):
def __init__(self, pdict, log=None):
self.pdict = pdict
self.start = None
self.error_func = None
self.tokens = None
self.modules = set()
self.grammar = []
self.error = False
if log is None:
self.log = PlyLogger(sys.stderr)
else:
self.log = log
# Get all of the basic information
def get_all(self):
self.get_start()
self.get_error_func()
self.get_tokens()
self.get_precedence()
self.get_pfunctions()
# Validate all of the information
def validate_all(self):
self.validate_start()
self.validate_error_func()
self.validate_tokens()
self.validate_precedence()
self.validate_pfunctions()
self.validate_modules()
return self.error
# Compute a signature over the grammar
def signature(self):
parts = []
try:
if self.start:
parts.append(self.start)
if self.prec:
parts.append(''.join([''.join(p) for p in self.prec]))
if self.tokens:
parts.append(' '.join(self.tokens))
for f in self.pfuncs:
if f[3]:
parts.append(f[3])
except (TypeError, ValueError):
pass
return ''.join(parts)
# -----------------------------------------------------------------------------
# validate_modules()
#
# This method checks to see if there are duplicated p_rulename() functions
# in the parser module file. Without this function, it is really easy for
# users to make mistakes by cutting and pasting code fragments (and it's a real
# bugger to try and figure out why the resulting parser doesn't work). Therefore,
# we just do a little regular expression pattern matching of def statements
# to try and detect duplicates.
# -----------------------------------------------------------------------------
def validate_modules(self):
# Match def p_funcname(
fre = re.compile(r'\s*def\s+(p_[a-zA-Z_0-9]*)\(')
for module in self.modules:
try:
lines, linen = inspect.getsourcelines(module)
except IOError:
continue
counthash = {}
for linen, line in enumerate(lines):
linen += 1
m = fre.match(line)
if m:
name = m.group(1)
prev = counthash.get(name)
if not prev:
counthash[name] = linen
else:
filename = inspect.getsourcefile(module)
self.log.warning('%s:%d: Function %s redefined. Previously defined on line %d',
filename, linen, name, prev)
# Get the start symbol
def get_start(self):
self.start = self.pdict.get('start')
# Validate the start symbol
def validate_start(self):
if self.start is not None:
if not isinstance(self.start, string_types):
self.log.error("'start' must be a string")
# Look for error handler
def get_error_func(self):
self.error_func = self.pdict.get('p_error')
# Validate the error function
def validate_error_func(self):
if self.error_func:
if isinstance(self.error_func, types.FunctionType):
ismethod = 0
elif isinstance(self.error_func, types.MethodType):
ismethod = 1
else:
self.log.error("'p_error' defined, but is not a function or method")
self.error = True
return
eline = self.error_func.__code__.co_firstlineno
efile = self.error_func.__code__.co_filename
module = inspect.getmodule(self.error_func)
self.modules.add(module)
argcount = self.error_func.__code__.co_argcount - ismethod
if argcount != 1:
self.log.error('%s:%d: p_error() requires 1 argument', efile, eline)
self.error = True
# Get the tokens map
def get_tokens(self):
tokens = self.pdict.get('tokens')
if not tokens:
self.log.error('No token list is defined')
self.error = True
return
if not isinstance(tokens, (list, tuple)):
self.log.error('tokens must be a list or tuple')
self.error = True
return
if not tokens:
self.log.error('tokens is empty')
self.error = True
return
self.tokens = sorted(tokens)
# Validate the tokens
def validate_tokens(self):
# Validate the tokens.
if 'error' in self.tokens:
self.log.error("Illegal token name 'error'. Is a reserved word")
self.error = True
return
terminals = set()
for n in self.tokens:
if n in terminals:
self.log.warning('Token %r multiply defined', n)
terminals.add(n)
# Get the precedence map (if any)
def get_precedence(self):
self.prec = self.pdict.get('precedence')
# Validate and parse the precedence map
def validate_precedence(self):
preclist = []
if self.prec:
if not isinstance(self.prec, (list, tuple)):
self.log.error('precedence must be a list or tuple')
self.error = True
return
for level, p in enumerate(self.prec):
if not isinstance(p, (list, tuple)):
self.log.error('Bad precedence table')
self.error = True
return
if len(p) < 2:
self.log.error('Malformed precedence entry %s. Must be (assoc, term, ..., term)', p)
self.error = True
return
assoc = p[0]
if not isinstance(assoc, string_types):
self.log.error('precedence associativity must be a string')
self.error = True
return
for term in p[1:]:
if not isinstance(term, string_types):
self.log.error('precedence items must be strings')
self.error = True
return
preclist.append((term, assoc, level+1))
self.preclist = preclist
# Get all p_functions from the grammar
def get_pfunctions(self):
p_functions = []
for name, item in self.pdict.items():
if not name.startswith('p_') or name == 'p_error':
continue
if isinstance(item, (types.FunctionType, types.MethodType)):
line = getattr(item, 'co_firstlineno', item.__code__.co_firstlineno)
module = inspect.getmodule(item)
p_functions.append((line, module, name, item.__doc__))
# Sort all of the actions by line number; make sure to stringify
# modules to make them sortable, since `line` may not uniquely sort all
# p functions
p_functions.sort(key=lambda p_function: (
p_function[0],
str(p_function[1]),
p_function[2],
p_function[3]))
self.pfuncs = p_functions
# Validate all of the p_functions
def validate_pfunctions(self):
grammar = []
# Check for non-empty symbols
if len(self.pfuncs) == 0:
self.log.error('no rules of the form p_rulename are defined')
self.error = True
return
for line, module, name, doc in self.pfuncs:
file = inspect.getsourcefile(module)
func = self.pdict[name]
if isinstance(func, types.MethodType):
reqargs = 2
else:
reqargs = 1
if func.__code__.co_argcount > reqargs:
self.log.error('%s:%d: Rule %r has too many arguments', file, line, func.__name__)
self.error = True
elif func.__code__.co_argcount < reqargs:
self.log.error('%s:%d: Rule %r requires an argument', file, line, func.__name__)
self.error = True
elif not func.__doc__:
self.log.warning('%s:%d: No documentation string specified in function %r (ignored)',
file, line, func.__name__)
else:
try:
parsed_g = parse_grammar(doc, file, line)
for g in parsed_g:
grammar.append((name, g))
except SyntaxError as e:
self.log.error(str(e))
self.error = True
# Looks like a valid grammar rule
# Mark the file in which defined.
self.modules.add(module)
# Secondary validation step that looks for p_ definitions that are not functions
# or functions that look like they might be grammar rules.
for n, v in self.pdict.items():
if n.startswith('p_') and isinstance(v, (types.FunctionType, types.MethodType)):
continue
if n.startswith('t_'):
continue
if n.startswith('p_') and n != 'p_error':
self.log.warning('%r not defined as a function', n)
if ((isinstance(v, types.FunctionType) and v.__code__.co_argcount == 1) or
(isinstance(v, types.MethodType) and v.__func__.__code__.co_argcount == 2)):
if v.__doc__:
try:
doc = v.__doc__.split(' ')
if doc[1] == ':':
self.log.warning('%s:%d: Possible grammar rule %r defined without p_ prefix',
v.__code__.co_filename, v.__code__.co_firstlineno, n)
except IndexError:
pass
self.grammar = grammar
# -----------------------------------------------------------------------------
# yacc(module)
#
# Build a parser
# -----------------------------------------------------------------------------
def yacc(method='LALR', debug=yaccdebug, module=None, tabmodule=tab_module, start=None,
check_recursion=True, optimize=False, write_tables=True, debugfile=debug_file,
outputdir=None, debuglog=None, errorlog=None, picklefile=None):
if tabmodule is None:
tabmodule = tab_module
# Reference to the parsing method of the last built parser
global parse
# If pickling is enabled, table files are not created
if picklefile:
write_tables = 0
if errorlog is None:
errorlog = PlyLogger(sys.stderr)
# Get the module dictionary used for the parser
if module:
_items = [(k, getattr(module, k)) for k in dir(module)]
pdict = dict(_items)
# If no __file__ or __package__ attributes are available, try to obtain them
# from the __module__ instead
if '__file__' not in pdict:
pdict['__file__'] = sys.modules[pdict['__module__']].__file__
if '__package__' not in pdict and '__module__' in pdict:
if hasattr(sys.modules[pdict['__module__']], '__package__'):
pdict['__package__'] = sys.modules[pdict['__module__']].__package__
else:
pdict = get_caller_module_dict(2)
if outputdir is None:
# If no output directory is set, the location of the output files
# is determined according to the following rules:
# - If tabmodule specifies a package, files go into that package directory
# - Otherwise, files go in the same directory as the specifying module
if isinstance(tabmodule, types.ModuleType):
srcfile = tabmodule.__file__
else:
if '.' not in tabmodule:
srcfile = pdict['__file__']
else:
parts = tabmodule.split('.')
pkgname = '.'.join(parts[:-1])
exec('import %s' % pkgname)
srcfile = getattr(sys.modules[pkgname], '__file__', '')
outputdir = os.path.dirname(srcfile)
# Determine if the module is package of a package or not.
# If so, fix the tabmodule setting so that tables load correctly
pkg = pdict.get('__package__')
if pkg and isinstance(tabmodule, str):
if '.' not in tabmodule:
tabmodule = pkg + '.' + tabmodule
# Set start symbol if it's specified directly using an argument
if start is not None:
pdict['start'] = start
# Collect parser information from the dictionary
pinfo = ParserReflect(pdict, log=errorlog)
pinfo.get_all()
if pinfo.error:
raise YaccError('Unable to build parser')
# Check signature against table files (if any)
signature = pinfo.signature()
# Read the tables
try:
lr = LRTable()
if picklefile:
read_signature = lr.read_pickle(picklefile)
else:
read_signature = lr.read_table(tabmodule)
if optimize or (read_signature == signature):
try:
lr.bind_callables(pinfo.pdict)
parser = LRParser(lr, pinfo.error_func)
parse = parser.parse
return parser
except Exception as e:
errorlog.warning('There was a problem loading the table file: %r', e)
except VersionError as e:
errorlog.warning(str(e))
except ImportError:
pass
if debuglog is None:
if debug:
try:
debuglog = PlyLogger(open(os.path.join(outputdir, debugfile), 'w'))
except IOError as e:
errorlog.warning("Couldn't open %r. %s" % (debugfile, e))
debuglog = NullLogger()
else:
debuglog = NullLogger()
debuglog.info('Created by PLY version %s (http://www.dabeaz.com/ply)', __version__)
errors = False
# Validate the parser information
if pinfo.validate_all():
raise YaccError('Unable to build parser')
if not pinfo.error_func:
errorlog.warning('no p_error() function is defined')
# Create a grammar object
grammar = Grammar(pinfo.tokens)
# Set precedence level for terminals
for term, assoc, level in pinfo.preclist:
try:
grammar.set_precedence(term, assoc, level)
except GrammarError as e:
errorlog.warning('%s', e)
# Add productions to the grammar
for funcname, gram in pinfo.grammar:
file, line, prodname, syms = gram
try:
grammar.add_production(prodname, syms, funcname, file, line)
except GrammarError as e:
errorlog.error('%s', e)
errors = True
# Set the grammar start symbols
try:
if start is None:
grammar.set_start(pinfo.start)
else:
grammar.set_start(start)
except GrammarError as e:
errorlog.error(str(e))
errors = True
if errors:
raise YaccError('Unable to build parser')
# Verify the grammar structure
undefined_symbols = grammar.undefined_symbols()
for sym, prod in undefined_symbols:
errorlog.error('%s:%d: Symbol %r used, but not defined as a token or a rule', prod.file, prod.line, sym)
errors = True
unused_terminals = grammar.unused_terminals()
if unused_terminals:
debuglog.info('')
debuglog.info('Unused terminals:')
debuglog.info('')
for term in unused_terminals:
errorlog.warning('Token %r defined, but not used', term)
debuglog.info(' %s', term)
# Print out all productions to the debug log
if debug:
debuglog.info('')
debuglog.info('Grammar')
debuglog.info('')
for n, p in enumerate(grammar.Productions):
debuglog.info('Rule %-5d %s', n, p)
# Find unused non-terminals
unused_rules = grammar.unused_rules()
for prod in unused_rules:
errorlog.warning('%s:%d: Rule %r defined, but not used', prod.file, prod.line, prod.name)
if len(unused_terminals) == 1:
errorlog.warning('There is 1 unused token')
if len(unused_terminals) > 1:
errorlog.warning('There are %d unused tokens', len(unused_terminals))
if len(unused_rules) == 1:
errorlog.warning('There is 1 unused rule')
if len(unused_rules) > 1:
errorlog.warning('There are %d unused rules', len(unused_rules))
if debug:
debuglog.info('')
debuglog.info('Terminals, with rules where they appear')
debuglog.info('')
terms = list(grammar.Terminals)
terms.sort()
for term in terms:
debuglog.info('%-20s : %s', term, ' '.join([str(s) for s in grammar.Terminals[term]]))
debuglog.info('')
debuglog.info('Nonterminals, with rules where they appear')
debuglog.info('')
nonterms = list(grammar.Nonterminals)
nonterms.sort()
for nonterm in nonterms:
debuglog.info('%-20s : %s', nonterm, ' '.join([str(s) for s in grammar.Nonterminals[nonterm]]))
debuglog.info('')
if check_recursion:
unreachable = grammar.find_unreachable()
for u in unreachable:
errorlog.warning('Symbol %r is unreachable', u)
infinite = grammar.infinite_cycles()
for inf in infinite:
errorlog.error('Infinite recursion detected for symbol %r', inf)
errors = True
unused_prec = grammar.unused_precedence()
for term, assoc in unused_prec:
errorlog.error('Precedence rule %r defined for unknown symbol %r', assoc, term)
errors = True
if errors:
raise YaccError('Unable to build parser')
# Run the LRGeneratedTable on the grammar
if debug:
errorlog.debug('Generating %s tables', method)
lr = LRGeneratedTable(grammar, method, debuglog)
if debug:
num_sr = len(lr.sr_conflicts)
# Report shift/reduce and reduce/reduce conflicts
if num_sr == 1:
errorlog.warning('1 shift/reduce conflict')
elif num_sr > 1:
errorlog.warning('%d shift/reduce conflicts', num_sr)
num_rr = len(lr.rr_conflicts)
if num_rr == 1:
errorlog.warning('1 reduce/reduce conflict')
elif num_rr > 1:
errorlog.warning('%d reduce/reduce conflicts', num_rr)
# Write out conflicts to the output file
if debug and (lr.sr_conflicts or lr.rr_conflicts):
debuglog.warning('')
debuglog.warning('Conflicts:')
debuglog.warning('')
for state, tok, resolution in lr.sr_conflicts:
debuglog.warning('shift/reduce conflict for %s in state %d resolved as %s', tok, state, resolution)
already_reported = set()
for state, rule, rejected in lr.rr_conflicts:
if (state, id(rule), id(rejected)) in already_reported:
continue
debuglog.warning('reduce/reduce conflict in state %d resolved using rule (%s)', state, rule)
debuglog.warning('rejected rule (%s) in state %d', rejected, state)
errorlog.warning('reduce/reduce conflict in state %d resolved using rule (%s)', state, rule)
errorlog.warning('rejected rule (%s) in state %d', rejected, state)
already_reported.add((state, id(rule), id(rejected)))
warned_never = []
for state, rule, rejected in lr.rr_conflicts:
if not rejected.reduced and (rejected not in warned_never):
debuglog.warning('Rule (%s) is never reduced', rejected)
errorlog.warning('Rule (%s) is never reduced', rejected)
warned_never.append(rejected)
# Write the table file if requested
if write_tables:
try:
lr.write_table(tabmodule, outputdir, signature)
if tabmodule in sys.modules:
del sys.modules[tabmodule]
except IOError as e:
errorlog.warning("Couldn't create %r. %s" % (tabmodule, e))
# Write a pickled version of the tables
if picklefile:
try:
lr.pickle_table(picklefile, signature)
except IOError as e:
errorlog.warning("Couldn't create %r. %s" % (picklefile, e))
# Build the parser
lr.bind_callables(pinfo.pdict)
parser = LRParser(lr, pinfo.error_func)
parse = parser.parse
return parser
sepolgen/refpolicy.py 0000644 00000076642 14751155147 0010757 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
import string
import selinux
# OVERVIEW
#
# This file contains objects and functions used to represent the reference
# policy (including the headers, M4 macros, and policy language statements).
#
# This representation is very different from the semantic representation
# used in libsepol. Instead, it is a more typical abstract representation
# used by the first stage of compilers. It is basically a parse tree.
#
# This choice is intentional as it allows us to handle the unprocessed
# M4 statements - including the $1 style arguments - and to more easily generate
# the data structures that we need for policy generation.
#
# Constans for referring to fields
SRC_TYPE = 0
TGT_TYPE = 1
OBJ_CLASS = 2
PERMS = 3
ROLE = 4
DEST_TYPE = 5
# String represenations of the above constants
field_to_str = ["source", "target", "object", "permission", "role", "destination" ]
str_to_field = { "source" : SRC_TYPE, "target" : TGT_TYPE, "object" : OBJ_CLASS,
"permission" : PERMS, "role" : ROLE, "destination" : DEST_TYPE }
# Base Classes
class PolicyBase:
def __init__(self, parent=None):
self.parent = None
self.comment = None
class Node(PolicyBase):
"""Base class objects produced from parsing the reference policy.
The Node class is used as the base class for any non-leaf
object produced by parsing the reference policy. This object
should contain a reference to its parent (or None for a top-level
object) and 0 or more children.
The general idea here is to have a very simple tree structure. Children
are not separated out by type. Instead the tree structure represents
fairly closely the real structure of the policy statements.
The object should be iterable - by default over all children but
subclasses are free to provide additional iterators over a subset
of their childre (see Interface for example).
"""
def __init__(self, parent=None):
PolicyBase.__init__(self, parent)
self.children = []
def __iter__(self):
return iter(self.children)
# Not all of the iterators will return something on all Nodes, but
# they won't explode either. Putting them here is just easier.
# Top level nodes
def nodes(self):
return filter(lambda x: isinstance(x, Node), walktree(self))
def modules(self):
return filter(lambda x: isinstance(x, Module), walktree(self))
def interfaces(self):
return filter(lambda x: isinstance(x, Interface), walktree(self))
def templates(self):
return filter(lambda x: isinstance(x, Template), walktree(self))
def support_macros(self):
return filter(lambda x: isinstance(x, SupportMacros), walktree(self))
# Common policy statements
def module_declarations(self):
return filter(lambda x: isinstance(x, ModuleDeclaration), walktree(self))
def interface_calls(self):
return filter(lambda x: isinstance(x, InterfaceCall), walktree(self))
def avrules(self):
return filter(lambda x: isinstance(x, AVRule), walktree(self))
def avextrules(self):
return filter(lambda x: isinstance(x, AVExtRule), walktree(self))
def typerules(self):
return filter(lambda x: isinstance(x, TypeRule), walktree(self))
def typebounds(self):
return filter(lambda x: isinstance(x, TypeBound), walktree(self))
def typeattributes(self):
"""Iterate over all of the TypeAttribute children of this Interface."""
return filter(lambda x: isinstance(x, TypeAttribute), walktree(self))
def roleattributes(self):
"""Iterate over all of the RoleAttribute children of this Interface."""
return filter(lambda x: isinstance(x, RoleAttribute), walktree(self))
def requires(self):
return filter(lambda x: isinstance(x, Require), walktree(self))
def roles(self):
return filter(lambda x: isinstance(x, Role), walktree(self))
def role_allows(self):
return filter(lambda x: isinstance(x, RoleAllow), walktree(self))
def role_types(self):
return filter(lambda x: isinstance(x, RoleType), walktree(self))
def __str__(self):
if self.comment:
return str(self.comment) + "\n" + self.to_string()
else:
return self.to_string()
def __repr__(self):
return "<%s(%s)>" % (self.__class__.__name__, self.to_string())
def to_string(self):
return ""
class Leaf(PolicyBase):
def __init__(self, parent=None):
PolicyBase.__init__(self, parent)
def __str__(self):
if self.comment:
return str(self.comment) + "\n" + self.to_string()
else:
return self.to_string()
def __repr__(self):
return "<%s(%s)>" % (self.__class__.__name__, self.to_string())
def to_string(self):
return ""
# Utility functions
def walktree(node, depthfirst=True, showdepth=False, type=None):
"""Iterate over a Node and its Children.
The walktree function iterates over a tree containing Nodes and
leaf objects. The iteration can perform a depth first or a breadth
first traversal of the tree (controlled by the depthfirst
paramater. The passed in node will be returned.
This function will only work correctly for trees - arbitrary graphs
will likely cause infinite looping.
"""
# We control depth first / versus breadth first by
# how we pop items off of the node stack.
if depthfirst:
index = -1
else:
index = 0
stack = [(node, 0)]
while len(stack) > 0:
cur, depth = stack.pop(index)
if showdepth:
yield cur, depth
else:
yield cur
# If the node is not a Node instance it must
# be a leaf - so no need to add it to the stack
if isinstance(cur, Node):
items = []
i = len(cur.children) - 1
while i >= 0:
if type is None or isinstance(cur.children[i], type):
items.append((cur.children[i], depth + 1))
i -= 1
stack.extend(items)
def walknode(node, type=None):
"""Iterate over the direct children of a Node.
The walktree function iterates over the children of a Node.
Unlike walktree it does note return the passed in node or
the children of any Node objects (that is, it does not go
beyond the current level in the tree).
"""
for x in node:
if type is None or isinstance(x, type):
yield x
def list_to_space_str(s, cont=('{', '}')):
"""Convert a set (or any sequence type) into a string representation
formatted to match SELinux space separated list conventions.
For example the list ['read', 'write'] would be converted into:
'{ read write }'
"""
l = len(s)
str = ""
if l < 1:
raise ValueError("cannot convert 0 len set to string")
str = " ".join(s)
if l == 1:
return str
else:
return cont[0] + " " + str + " " + cont[1]
def list_to_comma_str(s):
l = len(s)
if l < 1:
raise ValueError("cannot conver 0 len set to comma string")
return ", ".join(s)
# Basic SELinux types
class IdSet(set):
def __init__(self, list=None):
if list:
set.__init__(self, list)
else:
set.__init__(self)
self.compliment = False
def to_space_str(self):
return list_to_space_str(sorted(self))
def to_comma_str(self):
return list_to_comma_str(sorted(self))
class SecurityContext(Leaf):
"""An SELinux security context with optional MCS / MLS fields."""
def __init__(self, context=None, parent=None):
"""Create a SecurityContext object, optionally from a string.
Parameters:
[context] - string representing a security context. Same format
as a string passed to the from_string method.
"""
Leaf.__init__(self, parent)
self.user = ""
self.role = ""
self.type = ""
self.level = None
if context is not None:
self.from_string(context)
def from_string(self, context):
"""Parse a string representing a context into a SecurityContext.
The string should be in the standard format - e.g.,
'user:role:type:level'.
Raises ValueError if the string is not parsable as a security context.
"""
# try to translate the context string to raw form
raw = selinux.selinux_trans_to_raw_context(context)
if raw[0] == 0:
context = raw[1]
fields = context.split(":")
if len(fields) < 3:
raise ValueError("context string [%s] not in a valid format" % context)
self.user = fields[0]
self.role = fields[1]
self.type = fields[2]
if len(fields) > 3:
# FUTURE - normalize level fields to allow more comparisons to succeed.
self.level = ':'.join(fields[3:])
else:
self.level = None
def __eq__(self, other):
"""Compare two SecurityContext objects - all fields must be exactly the
the same for the comparison to work. It is possible for the level fields
to be semantically the same yet syntactically different - in this case
this function will return false.
"""
return self.user == other.user and \
self.role == other.role and \
self.type == other.type and \
self.level == other.level
def to_string(self, default_level=None):
"""Return a string representing this security context.
By default, the string will contiain a MCS / MLS level
potentially from the default which is passed in if none was
set.
Arguments:
default_level - the default level to use if self.level is an
empty string.
Returns:
A string represening the security context in the form
'user:role:type:level'.
"""
fields = [self.user, self.role, self.type]
if self.level is None:
if default_level is None:
if selinux.is_selinux_mls_enabled() == 1:
fields.append("s0")
else:
fields.append(default_level)
else:
fields.append(self.level)
return ":".join(fields)
class ObjectClass(Leaf):
"""SELinux object class and permissions.
This class is a basic representation of an SELinux object
class - it does not represent separate common permissions -
just the union of the common and class specific permissions.
It is meant to be convenient for policy generation.
"""
def __init__(self, name="", parent=None):
Leaf.__init__(self, parent)
self.name = name
self.perms = IdSet()
class XpermSet():
"""Extended permission set.
This class represents one or more extended permissions
represented by numeric values or ranges of values. The
.complement attribute is used to specify all permission
except those specified.
Two xperm set can be merged using the .extend() method.
"""
def __init__(self, complement=False):
self.complement = complement
self.ranges = []
def __normalize_ranges(self):
"""Ensure that ranges are not overlapping.
"""
self.ranges.sort()
i = 0
while i < len(self.ranges):
while i + 1 < len(self.ranges):
if self.ranges[i + 1][0] <= self.ranges[i][1] + 1:
self.ranges[i] = (self.ranges[i][0], max(self.ranges[i][1],
self.ranges[i + 1][1]))
del self.ranges[i + 1]
else:
break
i += 1
def extend(self, s):
"""Add ranges from an xperm set
"""
self.ranges.extend(s.ranges)
self.__normalize_ranges()
def add(self, minimum, maximum=None):
"""Add value of range of values to the xperm set.
"""
if maximum is None:
maximum = minimum
self.ranges.append((minimum, maximum))
self.__normalize_ranges()
def to_string(self):
if not self.ranges:
return ""
compl = "~ " if self.complement else ""
# print single value without braces
if len(self.ranges) == 1 and self.ranges[0][0] == self.ranges[0][1]:
return compl + str(self.ranges[0][0])
vals = map(lambda x: str(x[0]) if x[0] == x[1] else "%s-%s" % x,
self.ranges)
return "%s{ %s }" % (compl, " ".join(vals))
# Basic statements
class TypeAttribute(Leaf):
"""SElinux typeattribute statement.
This class represents a typeattribute statement.
"""
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.type = ""
self.attributes = IdSet()
def to_string(self):
return "typeattribute %s %s;" % (self.type, self.attributes.to_comma_str())
class RoleAttribute(Leaf):
"""SElinux roleattribute statement.
This class represents a roleattribute statement.
"""
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.role = ""
self.roleattributes = IdSet()
def to_string(self):
return "roleattribute %s %s;" % (self.role, self.roleattributes.to_comma_str())
class Role(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.role = ""
self.types = IdSet()
def to_string(self):
s = ""
for t in self.types:
s += "role %s types %s;\n" % (self.role, t)
return s
class Type(Leaf):
def __init__(self, name="", parent=None):
Leaf.__init__(self, parent)
self.name = name
self.attributes = IdSet()
self.aliases = IdSet()
def to_string(self):
s = "type %s" % self.name
if len(self.aliases) > 0:
s = s + "alias %s" % self.aliases.to_space_str()
if len(self.attributes) > 0:
s = s + ", %s" % self.attributes.to_comma_str()
return s + ";"
class TypeAlias(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.type = ""
self.aliases = IdSet()
def to_string(self):
return "typealias %s alias %s;" % (self.type, self.aliases.to_space_str())
class Attribute(Leaf):
def __init__(self, name="", parent=None):
Leaf.__init__(self, parent)
self.name = name
def to_string(self):
return "attribute %s;" % self.name
class Attribute_Role(Leaf):
def __init__(self, name="", parent=None):
Leaf.__init__(self, parent)
self.name = name
def to_string(self):
return "attribute_role %s;" % self.name
# Classes representing rules
class AVRule(Leaf):
"""SELinux access vector (AV) rule.
The AVRule class represents all varieties of AV rules including
allow, dontaudit, and auditallow (indicated by the flags self.ALLOW,
self.DONTAUDIT, and self.AUDITALLOW respectively).
The source and target types, object classes, and perms are all represented
by sets containing strings. Sets are used to make it simple to add
strings repeatedly while avoiding duplicates.
No checking is done to make certain that the symbols are valid or
consistent (e.g., perms that don't match the object classes). It is
even possible to put invalid types like '$1' into the rules to allow
storage of the reference policy interfaces.
"""
ALLOW = 0
DONTAUDIT = 1
AUDITALLOW = 2
NEVERALLOW = 3
def __init__(self, av=None, parent=None):
Leaf.__init__(self, parent)
self.src_types = IdSet()
self.tgt_types = IdSet()
self.obj_classes = IdSet()
self.perms = IdSet()
self.rule_type = self.ALLOW
if av:
self.from_av(av)
def __rule_type_str(self):
if self.rule_type == self.ALLOW:
return "allow"
elif self.rule_type == self.DONTAUDIT:
return "dontaudit"
elif self.rule_type == self.AUDITALLOW:
return "auditallow"
elif self.rule_type == self.NEVERALLOW:
return "neverallow"
def from_av(self, av):
"""Add the access from an access vector to this allow
rule.
"""
self.src_types.add(av.src_type)
if av.src_type == av.tgt_type:
self.tgt_types.add("self")
else:
self.tgt_types.add(av.tgt_type)
self.obj_classes.add(av.obj_class)
self.perms.update(av.perms)
def to_string(self):
"""Return a string representation of the rule
that is a valid policy language representation (assuming
that the types, object class, etc. are valie).
"""
return "%s %s %s:%s %s;" % (self.__rule_type_str(),
self.src_types.to_space_str(),
self.tgt_types.to_space_str(),
self.obj_classes.to_space_str(),
self.perms.to_space_str())
class AVExtRule(Leaf):
"""Extended permission access vector rule.
The AVExtRule class represents allowxperm, dontauditxperm,
auditallowxperm, and neverallowxperm rules.
The source and target types, and object classes are represented
by sets containing strings. The operation is a single string,
e.g. 'ioctl'. Extended permissions are represented by an XpermSet.
"""
ALLOWXPERM = 0
DONTAUDITXPERM = 1
AUDITALLOWXPERM = 2
NEVERALLOWXPERM = 3
def __init__(self, av=None, op=None, parent=None):
Leaf.__init__(self, parent)
self.src_types = IdSet()
self.tgt_types = IdSet()
self.obj_classes = IdSet()
self.rule_type = self.ALLOWXPERM
self.xperms = XpermSet()
self.operation = op
if av:
self.from_av(av, op)
def __rule_type_str(self):
if self.rule_type == self.ALLOWXPERM:
return "allowxperm"
elif self.rule_type == self.DONTAUDITXPERM:
return "dontauditxperm"
elif self.rule_type == self.AUDITALLOWXPERM:
return "auditallowxperm"
elif self.rule_type == self.NEVERALLOWXPERM:
return "neverallowxperm"
def from_av(self, av, op):
self.src_types.add(av.src_type)
if av.src_type == av.tgt_type:
self.tgt_types.add("self")
else:
self.tgt_types.add(av.tgt_type)
self.obj_classes.add(av.obj_class)
self.operation = op
self.xperms = av.xperms[op]
def to_string(self):
"""Return a string representation of the rule that is
a valid policy language representation (assuming that
the types, object class, etc. are valid).
"""
return "%s %s %s:%s %s %s;" % (self.__rule_type_str(),
self.src_types.to_space_str(),
self.tgt_types.to_space_str(),
self.obj_classes.to_space_str(),
self.operation,
self.xperms.to_string())
class TypeRule(Leaf):
"""SELinux type rules.
This class is very similar to the AVRule class, but is for representing
the type rules (type_trans, type_change, and type_member). The major
difference is the lack of perms and only and sing destination type.
"""
TYPE_TRANSITION = 0
TYPE_CHANGE = 1
TYPE_MEMBER = 2
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.src_types = IdSet()
self.tgt_types = IdSet()
self.obj_classes = IdSet()
self.dest_type = ""
self.rule_type = self.TYPE_TRANSITION
def __rule_type_str(self):
if self.rule_type == self.TYPE_TRANSITION:
return "type_transition"
elif self.rule_type == self.TYPE_CHANGE:
return "type_change"
else:
return "type_member"
def to_string(self):
return "%s %s %s:%s %s;" % (self.__rule_type_str(),
self.src_types.to_space_str(),
self.tgt_types.to_space_str(),
self.obj_classes.to_space_str(),
self.dest_type)
class TypeBound(Leaf):
"""SElinux typebound statement.
This class represents a typebound statement.
"""
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.type = ""
self.tgt_types = IdSet()
def to_string(self):
return "typebounds %s %s;" % (self.type, self.tgt_types.to_comma_str())
class RoleAllow(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.src_roles = IdSet()
self.tgt_roles = IdSet()
def to_string(self):
return "allow %s %s;" % (self.src_roles.to_comma_str(),
self.tgt_roles.to_comma_str())
class RoleType(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.role = ""
self.types = IdSet()
def to_string(self):
s = ""
for t in self.types:
s += "role %s types %s;\n" % (self.role, t)
return s
class ModuleDeclaration(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.name = ""
self.version = ""
self.refpolicy = False
def to_string(self):
if self.refpolicy:
return "policy_module(%s, %s)" % (self.name, self.version)
else:
return "module %s %s;" % (self.name, self.version)
class Conditional(Node):
def __init__(self, parent=None):
Node.__init__(self, parent)
self.cond_expr = []
def to_string(self):
return "[If %s]" % list_to_space_str(self.cond_expr, cont=("", ""))
class Bool(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.name = ""
self.state = False
def to_string(self):
s = "bool %s " % self.name
if s.state:
return s + "true"
else:
return s + "false"
class InitialSid(Leaf):
def __init(self, parent=None):
Leaf.__init__(self, parent)
self.name = ""
self.context = None
def to_string(self):
return "sid %s %s" % (self.name, str(self.context))
class GenfsCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.filesystem = ""
self.path = ""
self.context = None
def to_string(self):
return "genfscon %s %s %s" % (self.filesystem, self.path, str(self.context))
class FilesystemUse(Leaf):
XATTR = 1
TRANS = 2
TASK = 3
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.type = self.XATTR
self.filesystem = ""
self.context = None
def to_string(self):
s = ""
if self.type == self.XATTR:
s = "fs_use_xattr "
elif self.type == self.TRANS:
s = "fs_use_trans "
elif self.type == self.TASK:
s = "fs_use_task "
return "%s %s %s;" % (s, self.filesystem, str(self.context))
class PortCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.port_type = ""
self.port_number = ""
self.context = None
def to_string(self):
return "portcon %s %s %s" % (self.port_type, self.port_number, str(self.context))
class NodeCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.start = ""
self.end = ""
self.context = None
def to_string(self):
return "nodecon %s %s %s" % (self.start, self.end, str(self.context))
class NetifCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.interface = ""
self.interface_context = None
self.packet_context = None
def to_string(self):
return "netifcon %s %s %s" % (self.interface, str(self.interface_context),
str(self.packet_context))
class PirqCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.pirq_number = ""
self.context = None
def to_string(self):
return "pirqcon %s %s" % (self.pirq_number, str(self.context))
class IomemCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.device_mem = ""
self.context = None
def to_string(self):
return "iomemcon %s %s" % (self.device_mem, str(self.context))
class IoportCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.ioport = ""
self.context = None
def to_string(self):
return "ioportcon %s %s" % (self.ioport, str(self.context))
class PciDeviceCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.device = ""
self.context = None
def to_string(self):
return "pcidevicecon %s %s" % (self.device, str(self.context))
class DeviceTreeCon(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.path = ""
self.context = None
def to_string(self):
return "devicetreecon %s %s" % (self.path, str(self.context))
# Reference policy specific types
def print_tree(head):
for node, depth in walktree(head, showdepth=True):
s = ""
for i in range(depth):
s = s + "\t"
print(s + str(node))
class Headers(Node):
def __init__(self, parent=None):
Node.__init__(self, parent)
def to_string(self):
return "[Headers]"
class Module(Node):
def __init__(self, parent=None):
Node.__init__(self, parent)
def to_string(self):
return ""
class Interface(Node):
"""A reference policy interface definition.
This class represents a reference policy interface definition.
"""
def __init__(self, name="", parent=None):
Node.__init__(self, parent)
self.name = name
def to_string(self):
return "[Interface name: %s]" % self.name
class TunablePolicy(Node):
def __init__(self, parent=None):
Node.__init__(self, parent)
self.cond_expr = []
def to_string(self):
return "[Tunable Policy %s]" % list_to_space_str(self.cond_expr, cont=("", ""))
class Template(Node):
def __init__(self, name="", parent=None):
Node.__init__(self, parent)
self.name = name
def to_string(self):
return "[Template name: %s]" % self.name
class IfDef(Node):
def __init__(self, name="", parent=None):
Node.__init__(self, parent)
self.name = name
def to_string(self):
return "[Ifdef name: %s]" % self.name
class InterfaceCall(Leaf):
def __init__(self, ifname="", parent=None):
Leaf.__init__(self, parent)
self.ifname = ifname
self.args = []
self.comments = []
def matches(self, other):
if self.ifname != other.ifname:
return False
if len(self.args) != len(other.args):
return False
for a,b in zip(self.args, other.args):
if a != b:
return False
return True
def to_string(self):
s = "%s(" % self.ifname
i = 0
for a in self.args:
if isinstance(a, list):
str = list_to_space_str(a)
else:
str = a
if i != 0:
s = s + ", %s" % str
else:
s = s + str
i += 1
return s + ")"
class OptionalPolicy(Node):
def __init__(self, parent=None):
Node.__init__(self, parent)
def to_string(self):
return "[Optional Policy]"
class SupportMacros(Node):
def __init__(self, parent=None):
Node.__init__(self, parent)
self.map = None
def to_string(self):
return "[Support Macros]"
def __expand_perm(self, perm):
# Recursive expansion - the assumption is that these
# are ordered correctly so that no macro is used before
# it is defined
s = set()
if perm in self.map:
for p in self.by_name(perm):
s.update(self.__expand_perm(p))
else:
s.add(perm)
return s
def __gen_map(self):
self.map = {}
for x in self:
exp_perms = set()
for perm in x.perms:
exp_perms.update(self.__expand_perm(perm))
self.map[x.name] = exp_perms
def by_name(self, name):
if not self.map:
self.__gen_map()
return self.map[name]
def has_key(self, name):
if not self.map:
self.__gen_map()
return name in self.map
class Require(Leaf):
def __init__(self, parent=None):
Leaf.__init__(self, parent)
self.types = IdSet()
self.obj_classes = { }
self.roles = IdSet()
self.data = IdSet()
self.users = IdSet()
def add_obj_class(self, obj_class, perms):
p = self.obj_classes.setdefault(obj_class, IdSet())
p.update(perms)
def to_string(self):
s = []
s.append("require {")
for type in self.types:
s.append("\ttype %s;" % type)
for obj_class, perms in self.obj_classes.items():
s.append("\tclass %s %s;" % (obj_class, perms.to_space_str()))
for role in self.roles:
s.append("\trole %s;" % role)
for bool in self.data:
s.append("\tbool %s;" % bool)
for user in self.users:
s.append("\tuser %s;" % user)
s.append("}")
# Handle empty requires
if len(s) == 2:
return ""
return "\n".join(s)
class ObjPermSet:
def __init__(self, name):
self.name = name
self.perms = set()
def to_string(self):
return "define(`%s', `%s')" % (self.name, self.perms.to_space_str())
class ClassMap:
def __init__(self, obj_class, perms):
self.obj_class = obj_class
self.perms = perms
def to_string(self):
return self.obj_class + ": " + self.perms
class Comment:
def __init__(self, l=None):
if l:
self.lines = l
else:
self.lines = []
def to_string(self):
# If there are no lines, treat this as a spacer between
# policy statements and return a new line.
if len(self.lines) == 0:
return ""
else:
out = []
for line in self.lines:
out.append("#" + line)
return "\n".join(out)
def merge(self, other):
if len(other.lines):
for line in other.lines:
if line != "":
self.lines.append(line)
def __str__(self):
return self.to_string()
sepolgen/refparser.py 0000644 00000074302 14751155147 0010743 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006-2007 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
# OVERVIEW
#
#
# This is a parser for the refpolicy policy "language" - i.e., the
# normal SELinux policy language plus the refpolicy style M4 macro
# constructs on top of that base language. This parser is primarily
# aimed at parsing the policy headers in order to create an abstract
# policy representation suitable for generating policy.
#
# Both the lexer and parser are included in this file. The are implemented
# using the Ply library (included with sepolgen).
import sys
import os
import re
import traceback
from . import access
from . import defaults
from . import lex
from . import refpolicy
from . import yacc
# :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
#
# lexer
#
# :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
tokens = (
# basic tokens, punctuation
'TICK',
'SQUOTE',
'OBRACE',
'CBRACE',
'SEMI',
'COLON',
'OPAREN',
'CPAREN',
'COMMA',
'MINUS',
'TILDE',
'ASTERISK',
'AMP',
'BAR',
'EXPL',
'EQUAL',
'FILENAME',
'IDENTIFIER',
'NUMBER',
'PATH',
'IPV6_ADDR',
# reserved words
# module
'MODULE',
'POLICY_MODULE',
'REQUIRE',
# flask
'SID',
'GENFSCON',
'FS_USE_XATTR',
'FS_USE_TRANS',
'FS_USE_TASK',
'PORTCON',
'NODECON',
'NETIFCON',
'PIRQCON',
'IOMEMCON',
'IOPORTCON',
'PCIDEVICECON',
'DEVICETREECON',
# object classes
'CLASS',
# types and attributes
'TYPEATTRIBUTE',
'ROLEATTRIBUTE',
'TYPE',
'ATTRIBUTE',
'ATTRIBUTE_ROLE',
'ALIAS',
'TYPEALIAS',
# conditional policy
'BOOL',
'TRUE',
'FALSE',
'IF',
'ELSE',
# users and roles
'ROLE',
'TYPES',
# rules
'ALLOW',
'DONTAUDIT',
'AUDITALLOW',
'NEVERALLOW',
'PERMISSIVE',
'TYPEBOUNDS',
'TYPE_TRANSITION',
'TYPE_CHANGE',
'TYPE_MEMBER',
'RANGE_TRANSITION',
'ROLE_TRANSITION',
# refpolicy keywords
'OPT_POLICY',
'INTERFACE',
'TUNABLE_POLICY',
'GEN_REQ',
'TEMPLATE',
'GEN_CONTEXT',
# m4
'IFELSE',
'IFDEF',
'IFNDEF',
'DEFINE'
)
# All reserved keywords - see t_IDENTIFIER for how these are matched in
# the lexer.
reserved = {
# module
'module' : 'MODULE',
'policy_module' : 'POLICY_MODULE',
'require' : 'REQUIRE',
# flask
'sid' : 'SID',
'genfscon' : 'GENFSCON',
'fs_use_xattr' : 'FS_USE_XATTR',
'fs_use_trans' : 'FS_USE_TRANS',
'fs_use_task' : 'FS_USE_TASK',
'portcon' : 'PORTCON',
'nodecon' : 'NODECON',
'netifcon' : 'NETIFCON',
'pirqcon' : 'PIRQCON',
'iomemcon' : 'IOMEMCON',
'ioportcon' : 'IOPORTCON',
'pcidevicecon' : 'PCIDEVICECON',
'devicetreecon' : 'DEVICETREECON',
# object classes
'class' : 'CLASS',
# types and attributes
'typeattribute' : 'TYPEATTRIBUTE',
'roleattribute' : 'ROLEATTRIBUTE',
'type' : 'TYPE',
'attribute' : 'ATTRIBUTE',
'attribute_role' : 'ATTRIBUTE_ROLE',
'alias' : 'ALIAS',
'typealias' : 'TYPEALIAS',
# conditional policy
'bool' : 'BOOL',
'true' : 'TRUE',
'false' : 'FALSE',
'if' : 'IF',
'else' : 'ELSE',
# users and roles
'role' : 'ROLE',
'types' : 'TYPES',
# rules
'allow' : 'ALLOW',
'dontaudit' : 'DONTAUDIT',
'auditallow' : 'AUDITALLOW',
'neverallow' : 'NEVERALLOW',
'permissive' : 'PERMISSIVE',
'typebounds' : 'TYPEBOUNDS',
'type_transition' : 'TYPE_TRANSITION',
'type_change' : 'TYPE_CHANGE',
'type_member' : 'TYPE_MEMBER',
'range_transition' : 'RANGE_TRANSITION',
'role_transition' : 'ROLE_TRANSITION',
# refpolicy keywords
'optional_policy' : 'OPT_POLICY',
'interface' : 'INTERFACE',
'tunable_policy' : 'TUNABLE_POLICY',
'gen_require' : 'GEN_REQ',
'template' : 'TEMPLATE',
'gen_context' : 'GEN_CONTEXT',
# M4
'ifelse' : 'IFELSE',
'ifndef' : 'IFNDEF',
'ifdef' : 'IFDEF',
'define' : 'DEFINE'
}
# The ply lexer allows definition of tokens in 2 ways: regular expressions
# or functions.
# Simple regex tokens
t_TICK = r'\`'
t_SQUOTE = r'\''
t_OBRACE = r'\{'
t_CBRACE = r'\}'
# This will handle spurios extra ';' via the +
t_SEMI = r'\;+'
t_COLON = r'\:'
t_OPAREN = r'\('
t_CPAREN = r'\)'
t_COMMA = r'\,'
t_MINUS = r'\-'
t_TILDE = r'\~'
t_ASTERISK = r'\*'
t_AMP = r'\&'
t_BAR = r'\|'
t_EXPL = r'\!'
t_EQUAL = r'\='
t_NUMBER = r'[0-9\.]+'
t_PATH = r'/[a-zA-Z0-9)_\.\*/\$]*'
#t_IPV6_ADDR = r'[a-fA-F0-9]{0,4}:[a-fA-F0-9]{0,4}:([a-fA-F0-9]{0,4}:)*'
# Ignore whitespace - this is a special token for ply that more efficiently
# ignores uninteresting tokens.
t_ignore = " \t"
# More complex tokens
def t_IPV6_ADDR(t):
r'[a-fA-F0-9]{0,4}:[a-fA-F0-9]{0,4}:([a-fA-F0-9]|:)*'
# This is a function simply to force it sooner into
# the regex list
return t
def t_m4comment(t):
r'dnl.*\n'
# Ignore all comments
t.lexer.lineno += 1
def t_refpolicywarn1(t):
r'define.*refpolicywarn\(.*\n'
# Ignore refpolicywarn statements - they sometimes
# contain text that we can't parse.
t.skip(1)
def t_refpolicywarn(t):
r'refpolicywarn\(.*\n'
# Ignore refpolicywarn statements - they sometimes
# contain text that we can't parse.
t.lexer.lineno += 1
def t_IDENTIFIER(t):
r'[a-zA-Z_\$][a-zA-Z0-9_\-\+\.\$\*~]*'
# Handle any keywords
t.type = reserved.get(t.value,'IDENTIFIER')
return t
def t_FILENAME(t):
r'\"[a-zA-Z0-9_\-\+\.\$\*~ :]+\"'
# Handle any keywords
t.type = reserved.get(t.value,'FILENAME')
return t
def t_comment(t):
r'\#.*\n'
# Ignore all comments
t.lexer.lineno += 1
def t_error(t):
print("Illegal character '%s'" % t.value[0])
t.skip(1)
def t_newline(t):
r'\n+'
t.lexer.lineno += len(t.value)
# :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
#
# Parser
#
# :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
# Global data used during parsing - making it global is easier than
# passing the state through the parsing functions.
# m is the top-level data structure (stands for modules).
m = None
# error is either None (indicating no error) or a string error message.
error = None
parse_file = ""
# spt is the support macros (e.g., obj/perm sets) - it is an instance of
# refpolicy.SupportMacros and should always be present during parsing
# though it may not contain any macros.
spt = None
success = True
# utilities
def collect(stmts, parent, val=None):
if stmts is None:
return
for s in stmts:
if s is None:
continue
s.parent = parent
if val is not None:
parent.children.insert(0, (val, s))
else:
parent.children.insert(0, s)
def expand(ids, s):
for id in ids:
if spt.has_key(id): # noqa
s.update(spt.by_name(id))
else:
s.add(id)
# Top-level non-terminal
def p_statements(p):
'''statements : statement
| statements statement
| empty
'''
if len(p) == 2 and p[1]:
m.children.append(p[1])
elif len(p) > 2 and p[2]:
m.children.append(p[2])
def p_statement(p):
'''statement : interface
| template
| obj_perm_set
| policy
| policy_module_stmt
| module_stmt
'''
p[0] = p[1]
def p_empty(p):
'empty :'
pass
#
# Reference policy language constructs
#
# This is for the policy module statement (e.g., policy_module(foo,1.2.0)).
# We have a separate terminal for either the basic language module statement
# and interface calls to make it easier to identifier.
def p_policy_module_stmt(p):
'policy_module_stmt : POLICY_MODULE OPAREN IDENTIFIER COMMA NUMBER CPAREN'
m = refpolicy.ModuleDeclaration()
m.name = p[3]
m.version = p[5]
m.refpolicy = True
p[0] = m
def p_interface(p):
'''interface : INTERFACE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
'''
x = refpolicy.Interface(p[4])
collect(p[8], x)
p[0] = x
def p_template(p):
'''template : TEMPLATE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
| DEFINE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
'''
x = refpolicy.Template(p[4])
collect(p[8], x)
p[0] = x
def p_define(p):
'''define : DEFINE OPAREN TICK IDENTIFIER SQUOTE CPAREN'''
# This is for defining single M4 values (to be used later in ifdef statements).
# Example: define(`sulogin_no_pam'). We don't currently do anything with these
# but we should in the future when we correctly resolve ifdef statements.
p[0] = None
def p_interface_stmts(p):
'''interface_stmts : policy
| interface_stmts policy
| empty
'''
if len(p) == 2 and p[1]:
p[0] = p[1]
elif len(p) > 2:
if not p[1]:
if p[2]:
p[0] = p[2]
elif not p[2]:
p[0] = p[1]
else:
p[0] = p[1] + p[2]
def p_optional_policy(p):
'''optional_policy : OPT_POLICY OPAREN TICK interface_stmts SQUOTE CPAREN
| OPT_POLICY OPAREN TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
'''
o = refpolicy.OptionalPolicy()
collect(p[4], o, val=True)
if len(p) > 7:
collect(p[8], o, val=False)
p[0] = [o]
def p_tunable_policy(p):
'''tunable_policy : TUNABLE_POLICY OPAREN TICK cond_expr SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
| TUNABLE_POLICY OPAREN TICK cond_expr SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN
'''
x = refpolicy.TunablePolicy()
x.cond_expr = p[4]
collect(p[8], x, val=True)
if len(p) > 11:
collect(p[12], x, val=False)
p[0] = [x]
def p_ifelse(p):
'''ifelse : IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA COMMA TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
| IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK IDENTIFIER SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
| IFELSE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK SQUOTE COMMA TICK interface_stmts SQUOTE COMMA TICK interface_stmts SQUOTE CPAREN optional_semi
'''
# x = refpolicy.IfDef(p[4])
# v = True
# collect(p[8], x, val=v)
# if len(p) > 12:
# collect(p[12], x, val=False)
# p[0] = [x]
pass
def p_ifdef(p):
'''ifdef : IFDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
| IFNDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
| IFDEF OPAREN TICK IDENTIFIER SQUOTE COMMA TICK statements SQUOTE COMMA TICK statements SQUOTE CPAREN optional_semi
'''
x = refpolicy.IfDef(p[4])
if p[1] == 'ifdef':
v = True
else:
v = False
collect(p[8], x, val=v)
if len(p) > 12:
collect(p[12], x, val=False)
p[0] = [x]
def p_interface_call(p):
'''interface_call : IDENTIFIER OPAREN interface_call_param_list CPAREN
| IDENTIFIER OPAREN CPAREN
| IDENTIFIER OPAREN interface_call_param_list CPAREN SEMI'''
# Allow spurious semi-colons at the end of interface calls
i = refpolicy.InterfaceCall(ifname=p[1])
if len(p) > 4:
i.args.extend(p[3])
p[0] = i
def p_interface_call_param(p):
'''interface_call_param : IDENTIFIER
| IDENTIFIER MINUS IDENTIFIER
| nested_id_set
| TRUE
| FALSE
| FILENAME
'''
# Intentionally let single identifiers pass through
# List means set, non-list identifier
if len(p) == 2:
p[0] = p[1]
else:
p[0] = [p[1], "-" + p[3]]
def p_interface_call_param_list(p):
'''interface_call_param_list : interface_call_param
| interface_call_param_list COMMA interface_call_param
'''
if len(p) == 2:
p[0] = [p[1]]
else:
p[0] = p[1] + [p[3]]
def p_obj_perm_set(p):
'obj_perm_set : DEFINE OPAREN TICK IDENTIFIER SQUOTE COMMA TICK names SQUOTE CPAREN'
s = refpolicy.ObjPermSet(p[4])
s.perms = p[8]
p[0] = s
#
# Basic SELinux policy language
#
def p_policy(p):
'''policy : policy_stmt
| optional_policy
| tunable_policy
| ifdef
| ifelse
| conditional
'''
p[0] = p[1]
def p_policy_stmt(p):
'''policy_stmt : gen_require
| avrule_def
| typerule_def
| typebound_def
| typeattribute_def
| roleattribute_def
| interface_call
| role_def
| role_allow
| permissive
| type_def
| typealias_def
| attribute_def
| attribute_role_def
| range_transition_def
| role_transition_def
| bool
| define
| initial_sid
| genfscon
| fs_use
| portcon
| nodecon
| netifcon
| pirqcon
| iomemcon
| ioportcon
| pcidevicecon
| devicetreecon
'''
if p[1]:
p[0] = [p[1]]
def p_module_stmt(p):
'module_stmt : MODULE IDENTIFIER NUMBER SEMI'
m = refpolicy.ModuleDeclaration()
m.name = p[2]
m.version = p[3]
m.refpolicy = False
p[0] = m
def p_gen_require(p):
'''gen_require : GEN_REQ OPAREN TICK requires SQUOTE CPAREN
| REQUIRE OBRACE requires CBRACE'''
# We ignore the require statements - they are redundant data from our point-of-view.
# Checkmodule will verify them later anyway so we just assume that they match what
# is in the rest of the interface.
pass
def p_requires(p):
'''requires : require
| requires require
| ifdef
| requires ifdef
'''
pass
def p_require(p):
'''require : TYPE comma_list SEMI
| ROLE comma_list SEMI
| ATTRIBUTE comma_list SEMI
| ATTRIBUTE_ROLE comma_list SEMI
| CLASS comma_list SEMI
| BOOL comma_list SEMI
'''
pass
def p_security_context(p):
'''security_context : IDENTIFIER COLON IDENTIFIER COLON IDENTIFIER
| IDENTIFIER COLON IDENTIFIER COLON IDENTIFIER COLON mls_range_def'''
# This will likely need some updates to handle complex levels
s = refpolicy.SecurityContext()
s.user = p[1]
s.role = p[3]
s.type = p[5]
if len(p) > 6:
s.level = p[7]
p[0] = s
def p_gen_context(p):
'''gen_context : GEN_CONTEXT OPAREN security_context COMMA mls_range_def CPAREN
'''
# We actually store gen_context statements in a SecurityContext
# object - it knows how to output either a bare context or a
# gen_context statement.
s = p[3]
s.level = p[5]
p[0] = s
def p_context(p):
'''context : security_context
| gen_context
'''
p[0] = p[1]
def p_initial_sid(p):
'''initial_sid : SID IDENTIFIER context'''
s = refpolicy.InitialSid()
s.name = p[2]
s.context = p[3]
p[0] = s
def p_genfscon(p):
'''genfscon : GENFSCON IDENTIFIER PATH context'''
g = refpolicy.GenfsCon()
g.filesystem = p[2]
g.path = p[3]
g.context = p[4]
p[0] = g
def p_fs_use(p):
'''fs_use : FS_USE_XATTR IDENTIFIER context SEMI
| FS_USE_TASK IDENTIFIER context SEMI
| FS_USE_TRANS IDENTIFIER context SEMI
'''
f = refpolicy.FilesystemUse()
if p[1] == "fs_use_xattr":
f.type = refpolicy.FilesystemUse.XATTR
elif p[1] == "fs_use_task":
f.type = refpolicy.FilesystemUse.TASK
elif p[1] == "fs_use_trans":
f.type = refpolicy.FilesystemUse.TRANS
f.filesystem = p[2]
f.context = p[3]
p[0] = f
def p_portcon(p):
'''portcon : PORTCON IDENTIFIER NUMBER context
| PORTCON IDENTIFIER NUMBER MINUS NUMBER context'''
c = refpolicy.PortCon()
c.port_type = p[2]
if len(p) == 5:
c.port_number = p[3]
c.context = p[4]
else:
c.port_number = p[3] + "-" + p[4]
c.context = p[5]
p[0] = c
def p_nodecon(p):
'''nodecon : NODECON NUMBER NUMBER context
| NODECON IPV6_ADDR IPV6_ADDR context
'''
n = refpolicy.NodeCon()
n.start = p[2]
n.end = p[3]
n.context = p[4]
p[0] = n
def p_netifcon(p):
'netifcon : NETIFCON IDENTIFIER context context'
n = refpolicy.NetifCon()
n.interface = p[2]
n.interface_context = p[3]
n.packet_context = p[4]
p[0] = n
def p_pirqcon(p):
'pirqcon : PIRQCON NUMBER context'
c = refpolicy.PirqCon()
c.pirq_number = p[2]
c.context = p[3]
p[0] = c
def p_iomemcon(p):
'''iomemcon : IOMEMCON NUMBER context
| IOMEMCON NUMBER MINUS NUMBER context'''
c = refpolicy.IomemCon()
if len(p) == 4:
c.device_mem = p[2]
c.context = p[3]
else:
c.device_mem = p[2] + "-" + p[3]
c.context = p[4]
p[0] = c
def p_ioportcon(p):
'''ioportcon : IOPORTCON NUMBER context
| IOPORTCON NUMBER MINUS NUMBER context'''
c = refpolicy.IoportCon()
if len(p) == 4:
c.ioport = p[2]
c.context = p[3]
else:
c.ioport = p[2] + "-" + p[3]
c.context = p[4]
p[0] = c
def p_pcidevicecon(p):
'pcidevicecon : PCIDEVICECON NUMBER context'
c = refpolicy.PciDeviceCon()
c.device = p[2]
c.context = p[3]
p[0] = c
def p_devicetreecon(p):
'devicetreecon : DEVICETREECON NUMBER context'
c = refpolicy.DevicetTeeCon()
c.path = p[2]
c.context = p[3]
p[0] = c
def p_mls_range_def(p):
'''mls_range_def : mls_level_def MINUS mls_level_def
| mls_level_def
'''
p[0] = p[1]
if len(p) > 2:
p[0] = p[0] + "-" + p[3]
def p_mls_level_def(p):
'''mls_level_def : IDENTIFIER COLON comma_list
| IDENTIFIER
'''
p[0] = p[1]
if len(p) > 2:
p[0] = p[0] + ":" + ",".join(p[3])
def p_type_def(p):
'''type_def : TYPE IDENTIFIER COMMA comma_list SEMI
| TYPE IDENTIFIER SEMI
| TYPE IDENTIFIER ALIAS names SEMI
| TYPE IDENTIFIER ALIAS names COMMA comma_list SEMI
'''
t = refpolicy.Type(p[2])
if len(p) == 6:
if p[3] == ',':
t.attributes.update(p[4])
else:
t.aliases = p[4]
elif len(p) > 4:
t.aliases = p[4]
if len(p) == 8:
t.attributes.update(p[6])
p[0] = t
def p_attribute_def(p):
'attribute_def : ATTRIBUTE IDENTIFIER SEMI'
a = refpolicy.Attribute(p[2])
p[0] = a
def p_attribute_role_def(p):
'attribute_role_def : ATTRIBUTE_ROLE IDENTIFIER SEMI'
a = refpolicy.Attribute_Role(p[2])
p[0] = a
def p_typealias_def(p):
'typealias_def : TYPEALIAS IDENTIFIER ALIAS names SEMI'
t = refpolicy.TypeAlias()
t.type = p[2]
t.aliases = p[4]
p[0] = t
def p_role_def(p):
'''role_def : ROLE IDENTIFIER TYPES comma_list SEMI
| ROLE IDENTIFIER SEMI'''
r = refpolicy.Role()
r.role = p[2]
if len(p) > 4:
r.types.update(p[4])
p[0] = r
def p_role_allow(p):
'role_allow : ALLOW names names SEMI'
r = refpolicy.RoleAllow()
r.src_roles = p[2]
r.tgt_roles = p[3]
p[0] = r
def p_permissive(p):
'permissive : PERMISSIVE names SEMI'
pass
def p_avrule_def(p):
'''avrule_def : ALLOW names names COLON names names SEMI
| DONTAUDIT names names COLON names names SEMI
| AUDITALLOW names names COLON names names SEMI
| NEVERALLOW names names COLON names names SEMI
'''
a = refpolicy.AVRule()
if p[1] == 'dontaudit':
a.rule_type = refpolicy.AVRule.DONTAUDIT
elif p[1] == 'auditallow':
a.rule_type = refpolicy.AVRule.AUDITALLOW
elif p[1] == 'neverallow':
a.rule_type = refpolicy.AVRule.NEVERALLOW
a.src_types = p[2]
a.tgt_types = p[3]
a.obj_classes = p[5]
a.perms = p[6]
p[0] = a
def p_typerule_def(p):
'''typerule_def : TYPE_TRANSITION names names COLON names IDENTIFIER SEMI
| TYPE_TRANSITION names names COLON names IDENTIFIER FILENAME SEMI
| TYPE_TRANSITION names names COLON names IDENTIFIER IDENTIFIER SEMI
| TYPE_CHANGE names names COLON names IDENTIFIER SEMI
| TYPE_MEMBER names names COLON names IDENTIFIER SEMI
'''
t = refpolicy.TypeRule()
if p[1] == 'type_change':
t.rule_type = refpolicy.TypeRule.TYPE_CHANGE
elif p[1] == 'type_member':
t.rule_type = refpolicy.TypeRule.TYPE_MEMBER
t.src_types = p[2]
t.tgt_types = p[3]
t.obj_classes = p[5]
t.dest_type = p[6]
t.file_name = p[7]
p[0] = t
def p_typebound_def(p):
'''typebound_def : TYPEBOUNDS IDENTIFIER comma_list SEMI'''
t = refpolicy.TypeBound()
t.type = p[2]
t.tgt_types.update(p[3])
p[0] = t
def p_bool(p):
'''bool : BOOL IDENTIFIER TRUE SEMI
| BOOL IDENTIFIER FALSE SEMI'''
b = refpolicy.Bool()
b.name = p[2]
if p[3] == "true":
b.state = True
else:
b.state = False
p[0] = b
def p_conditional(p):
''' conditional : IF OPAREN cond_expr CPAREN OBRACE interface_stmts CBRACE
| IF OPAREN cond_expr CPAREN OBRACE interface_stmts CBRACE ELSE OBRACE interface_stmts CBRACE
'''
c = refpolicy.Conditional()
c.cond_expr = p[3]
collect(p[6], c, val=True)
if len(p) > 8:
collect(p[10], c, val=False)
p[0] = [c]
def p_typeattribute_def(p):
'''typeattribute_def : TYPEATTRIBUTE IDENTIFIER comma_list SEMI'''
t = refpolicy.TypeAttribute()
t.type = p[2]
t.attributes.update(p[3])
p[0] = t
def p_roleattribute_def(p):
'''roleattribute_def : ROLEATTRIBUTE IDENTIFIER comma_list SEMI'''
t = refpolicy.RoleAttribute()
t.role = p[2]
t.roleattributes.update(p[3])
p[0] = t
def p_range_transition_def(p):
'''range_transition_def : RANGE_TRANSITION names names COLON names mls_range_def SEMI
| RANGE_TRANSITION names names names SEMI'''
pass
def p_role_transition_def(p):
'''role_transition_def : ROLE_TRANSITION names names names SEMI'''
pass
def p_cond_expr(p):
'''cond_expr : IDENTIFIER
| EXPL cond_expr
| cond_expr AMP AMP cond_expr
| cond_expr BAR BAR cond_expr
| cond_expr EQUAL EQUAL cond_expr
| cond_expr EXPL EQUAL cond_expr
'''
l = len(p)
if l == 2:
p[0] = [p[1]]
elif l == 3:
p[0] = [p[1]] + p[2]
else:
p[0] = p[1] + [p[2] + p[3]] + p[4]
#
# Basic terminals
#
# Identifiers and lists of identifiers. These must
# be handled somewhat gracefully. Names returns an IdSet and care must
# be taken that this is _assigned_ to an object to correctly update
# all of the flags (as opposed to using update). The other terminals
# return list - this is to preserve ordering if it is important for
# parsing (for example, interface_call must retain the ordering). Other
# times the list should be used to update an IdSet.
def p_names(p):
'''names : identifier
| nested_id_set
| asterisk
| TILDE identifier
| TILDE nested_id_set
| IDENTIFIER MINUS IDENTIFIER
'''
s = refpolicy.IdSet()
if len(p) < 3:
expand(p[1], s)
elif len(p) == 3:
expand(p[2], s)
s.compliment = True
else:
expand([p[1]])
s.add("-" + p[3])
p[0] = s
def p_identifier(p):
'identifier : IDENTIFIER'
p[0] = [p[1]]
def p_asterisk(p):
'asterisk : ASTERISK'
p[0] = [p[1]]
def p_nested_id_set(p):
'''nested_id_set : OBRACE nested_id_list CBRACE
'''
p[0] = p[2]
def p_nested_id_list(p):
'''nested_id_list : nested_id_element
| nested_id_list nested_id_element
'''
if len(p) == 2:
p[0] = p[1]
else:
p[0] = p[1] + p[2]
def p_nested_id_element(p):
'''nested_id_element : identifier
| MINUS IDENTIFIER
| nested_id_set
'''
if len(p) == 2:
p[0] = p[1]
else:
# For now just leave the '-'
str = "-" + p[2]
p[0] = [str]
def p_comma_list(p):
'''comma_list : nested_id_list
| comma_list COMMA nested_id_list
'''
if len(p) > 2:
p[1] = p[1] + p[3]
p[0] = p[1]
def p_optional_semi(p):
'''optional_semi : SEMI
| empty'''
pass
#
# Interface to the parser
#
def p_error(tok):
global error, parse_file, success, parser
error = "%s: Syntax error on line %d %s [type=%s]" % (parse_file, tok.lineno, tok.value, tok.type)
print(error)
success = False
def prep_spt(spt):
if not spt:
return { }
map = {}
for x in spt:
map[x.name] = x
parser = None
lexer = None
def create_globals(module, support, debug):
global parser, lexer, m, spt
if not parser:
lexer = lex.lex()
parser = yacc.yacc(method="LALR", debug=debug, write_tables=0)
if module is not None:
m = module
else:
m = refpolicy.Module()
if not support:
spt = refpolicy.SupportMacros()
else:
spt = support
def parse(text, module=None, support=None, debug=False):
create_globals(module, support, debug)
global error, parser, lexer, success
lexer.lineno = 1
success = True
try:
parser.parse(text, debug=debug, lexer=lexer)
except Exception as e:
parser = None
lexer = None
error = "internal parser error: %s" % str(e) + "\n" + traceback.format_exc()
if not success:
# force the parser and lexer to be rebuilt - we have some problems otherwise
parser = None
msg = 'could not parse text: "%s"' % error
raise ValueError(msg)
return m
def list_headers(root):
modules = []
support_macros = None
for dirpath, dirnames, filenames in os.walk(root):
for name in filenames:
modname = os.path.splitext(name)
filename = os.path.join(dirpath, name)
if modname[1] == '.spt':
if name == "obj_perm_sets.spt":
support_macros = filename
elif len(re.findall("patterns", modname[0])):
modules.append((modname[0], filename))
elif modname[1] == '.if':
modules.append((modname[0], filename))
return (modules, support_macros)
def parse_headers(root, output=None, expand=True, debug=False):
from . import util
headers = refpolicy.Headers()
modules = []
support_macros = None
if os.path.isfile(root):
name = os.path.split(root)[1]
if name == '':
raise ValueError("Invalid file name %s" % root)
modname = os.path.splitext(name)
modules.append((modname[0], root))
all_modules, support_macros = list_headers(defaults.headers())
else:
modules, support_macros = list_headers(root)
if expand and not support_macros:
raise ValueError("could not find support macros (obj_perm_sets.spt)")
def o(msg):
if output:
output.write(msg)
def parse_file(f, module, spt=None):
global parse_file
if debug:
o("parsing file %s\n" % f)
try:
fd = open(f)
txt = fd.read()
fd.close()
parse_file = f
parse(txt, module, spt, debug)
except IOError as e:
return
except ValueError as e:
raise ValueError("error parsing file %s: %s" % (f, str(e)))
spt = None
if support_macros:
o("Parsing support macros (%s): " % support_macros)
spt = refpolicy.SupportMacros()
parse_file(support_macros, spt)
headers.children.append(spt)
# FIXME: Total hack - add in can_exec rather than parse the insanity
# of misc_macros. We are just going to pretend that this is an interface
# to make the expansion work correctly.
can_exec = refpolicy.Interface("can_exec")
av = access.AccessVector(["$1","$2","file","execute_no_trans","open", "read",
"getattr","lock","execute","ioctl"])
can_exec.children.append(refpolicy.AVRule(av))
headers.children.append(can_exec)
o("done.\n")
if output and not debug:
status = util.ConsoleProgressBar(sys.stdout, steps=len(modules))
status.start("Parsing interface files")
failures = []
for x in modules:
m = refpolicy.Module()
m.name = x[0]
try:
if expand:
parse_file(x[1], m, spt)
else:
parse_file(x[1], m)
except ValueError as e:
o(str(e) + "\n")
failures.append(x[1])
continue
headers.children.append(m)
if output and not debug:
status.step()
if len(failures):
o("failed to parse some headers: %s" % ", ".join(failures))
return headers
sepolgen/sepolgeni18n.py 0000644 00000001631 14751155147 0011261 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
try:
import gettext
t = gettext.translation( 'selinux-python' )
_ = t.gettext
except:
def _(str):
return str
sepolgen/defaults.py 0000644 00000005525 14751155147 0010562 0 ustar 00 # Authors: Karl MacMillan <kmacmillan@mentalrootkit.com>
#
# Copyright (C) 2006 Red Hat
# see file 'COPYING' for use and warranty information
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License as
# published by the Free Software Foundation; version 2 only
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
import os
import re
# Select the correct location for the development files based on a
# path variable (optionally read from a configuration file)
class PathChooser(object):
def __init__(self, pathname):
self.config = dict()
if not os.path.exists(pathname):
self.config_pathname = "(defaults)"
self.config["SELINUX_DEVEL_PATH"] = "/usr/share/selinux/default:/usr/share/selinux/mls:/usr/share/selinux/devel"
return
self.config_pathname = pathname
ignore = re.compile(r"^\s*(?:#.+)?$")
consider = re.compile(r"^\s*(\w+)\s*=\s*(.+?)\s*$")
with open(pathname, "r") as fd:
for lineno, line in enumerate(fd):
if ignore.match(line): continue
mo = consider.match(line)
if not mo:
raise ValueError("%s:%d: line is not in key = value format" % (pathname, lineno+1))
self.config[mo.group(1)] = mo.group(2)
# We're only exporting one useful function, so why not be a function
def __call__(self, testfilename, pathset="SELINUX_DEVEL_PATH"):
paths = self.config.get(pathset, None)
if paths is None:
raise ValueError("%s was not in %s" % (pathset, self.config_pathname))
paths = paths.split(":")
for p in paths:
target = os.path.join(p, testfilename)
if os.path.exists(target): return target
return os.path.join(paths[0], testfilename)
"""
Various default settings, including file and directory locations.
"""
def data_dir():
return "/var/lib/sepolgen"
def perm_map():
return data_dir() + "/perm_map"
def interface_info():
return data_dir() + "/interface_info"
def attribute_info():
return data_dir() + "/attribute_info"
def refpolicy_makefile():
chooser = PathChooser("/etc/selinux/sepolgen.conf")
result = chooser("Makefile")
if not os.path.exists(result):
result = chooser("include/Makefile")
return result
def headers():
chooser = PathChooser("/etc/selinux/sepolgen.conf")
return chooser("include")
sepolgen/__init__.py 0000644 00000000000 14751155147 0010471 0 ustar 00 pip/pep425tags.py 0000644 00000025344 14751155147 0007626 0 ustar 00 """Generate and work with PEP 425 Compatibility Tags."""
from __future__ import absolute_import
import re
import sys
import warnings
import platform
import logging
try:
import sysconfig
except ImportError: # pragma nocover
# Python < 2.7
import distutils.sysconfig as sysconfig
import distutils.util
from pip.compat import OrderedDict
import pip.utils.glibc
logger = logging.getLogger(__name__)
_osx_arch_pat = re.compile(r'(.+)_(\d+)_(\d+)_(.+)')
def get_config_var(var):
try:
return sysconfig.get_config_var(var)
except IOError as e: # Issue #1074
warnings.warn("{0}".format(e), RuntimeWarning)
return None
def get_abbr_impl():
"""Return abbreviated implementation name."""
if hasattr(sys, 'pypy_version_info'):
pyimpl = 'pp'
elif sys.platform.startswith('java'):
pyimpl = 'jy'
elif sys.platform == 'cli':
pyimpl = 'ip'
else:
pyimpl = 'cp'
return pyimpl
def get_impl_ver():
"""Return implementation version."""
impl_ver = get_config_var("py_version_nodot")
if not impl_ver or get_abbr_impl() == 'pp':
impl_ver = ''.join(map(str, get_impl_version_info()))
return impl_ver
def get_impl_version_info():
"""Return sys.version_info-like tuple for use in decrementing the minor
version."""
if get_abbr_impl() == 'pp':
# as per https://github.com/pypa/pip/issues/2882
return (sys.version_info[0], sys.pypy_version_info.major,
sys.pypy_version_info.minor)
else:
return sys.version_info[0], sys.version_info[1]
def get_impl_tag():
"""
Returns the Tag for this specific implementation.
"""
return "{0}{1}".format(get_abbr_impl(), get_impl_ver())
def get_flag(var, fallback, expected=True, warn=True):
"""Use a fallback method for determining SOABI flags if the needed config
var is unset or unavailable."""
val = get_config_var(var)
if val is None:
if warn:
logger.debug("Config variable '%s' is unset, Python ABI tag may "
"be incorrect", var)
return fallback()
return val == expected
def get_abi_tag():
"""Return the ABI tag based on SOABI (if available) or emulate SOABI
(CPython 2, PyPy)."""
soabi = get_config_var('SOABI')
impl = get_abbr_impl()
if not soabi and impl in ('cp', 'pp') and hasattr(sys, 'maxunicode'):
d = ''
m = ''
u = ''
if get_flag('Py_DEBUG',
lambda: hasattr(sys, 'gettotalrefcount'),
warn=(impl == 'cp')):
d = 'd'
if get_flag('WITH_PYMALLOC',
lambda: impl == 'cp',
warn=(impl == 'cp')):
m = 'm'
if get_flag('Py_UNICODE_SIZE',
lambda: sys.maxunicode == 0x10ffff,
expected=4,
warn=(impl == 'cp' and
sys.version_info < (3, 3))) \
and sys.version_info < (3, 3):
u = 'u'
abi = '%s%s%s%s%s' % (impl, get_impl_ver(), d, m, u)
elif soabi and soabi.startswith('cpython-'):
abi = 'cp' + soabi.split('-')[1]
elif soabi:
abi = soabi.replace('.', '_').replace('-', '_')
else:
abi = None
return abi
def _is_running_32bit():
return sys.maxsize == 2147483647
def get_platform():
"""Return our platform name 'win32', 'linux_x86_64'"""
if sys.platform == 'darwin':
# distutils.util.get_platform() returns the release based on the value
# of MACOSX_DEPLOYMENT_TARGET on which Python was built, which may
# be significantly older than the user's current machine.
release, _, machine = platform.mac_ver()
split_ver = release.split('.')
if machine == "x86_64" and _is_running_32bit():
machine = "i386"
elif machine == "ppc64" and _is_running_32bit():
machine = "ppc"
return 'macosx_{0}_{1}_{2}'.format(split_ver[0], split_ver[1], machine)
# XXX remove distutils dependency
result = distutils.util.get_platform().replace('.', '_').replace('-', '_')
if result == "linux_x86_64" and _is_running_32bit():
# 32 bit Python program (running on a 64 bit Linux): pip should only
# install and run 32 bit compiled extensions in that case.
result = "linux_i686"
return result
def is_manylinux1_compatible():
# Only Linux, and only x86-64 / i686
if get_platform() not in ("linux_x86_64", "linux_i686"):
return False
# Check for presence of _manylinux module
try:
import _manylinux
return bool(_manylinux.manylinux1_compatible)
except (ImportError, AttributeError):
# Fall through to heuristic check below
pass
# Check glibc version. CentOS 5 uses glibc 2.5.
return pip.utils.glibc.have_compatible_glibc(2, 5)
def get_darwin_arches(major, minor, machine):
"""Return a list of supported arches (including group arches) for
the given major, minor and machine architecture of an macOS machine.
"""
arches = []
def _supports_arch(major, minor, arch):
# Looking at the application support for macOS versions in the chart
# provided by https://en.wikipedia.org/wiki/OS_X#Versions it appears
# our timeline looks roughly like:
#
# 10.0 - Introduces ppc support.
# 10.4 - Introduces ppc64, i386, and x86_64 support, however the ppc64
# and x86_64 support is CLI only, and cannot be used for GUI
# applications.
# 10.5 - Extends ppc64 and x86_64 support to cover GUI applications.
# 10.6 - Drops support for ppc64
# 10.7 - Drops support for ppc
#
# Given that we do not know if we're installing a CLI or a GUI
# application, we must be conservative and assume it might be a GUI
# application and behave as if ppc64 and x86_64 support did not occur
# until 10.5.
#
# Note: The above information is taken from the "Application support"
# column in the chart not the "Processor support" since I believe
# that we care about what instruction sets an application can use
# not which processors the OS supports.
if arch == 'ppc':
return (major, minor) <= (10, 5)
if arch == 'ppc64':
return (major, minor) == (10, 5)
if arch == 'i386':
return (major, minor) >= (10, 4)
if arch == 'x86_64':
return (major, minor) >= (10, 5)
if arch in groups:
for garch in groups[arch]:
if _supports_arch(major, minor, garch):
return True
return False
groups = OrderedDict([
("fat", ("i386", "ppc")),
("intel", ("x86_64", "i386")),
("fat64", ("x86_64", "ppc64")),
("fat32", ("x86_64", "i386", "ppc")),
])
if _supports_arch(major, minor, machine):
arches.append(machine)
for garch in groups:
if machine in groups[garch] and _supports_arch(major, minor, garch):
arches.append(garch)
arches.append('universal')
return arches
def get_supported(versions=None, noarch=False, platform=None,
impl=None, abi=None):
"""Return a list of supported tags for each version specified in
`versions`.
:param versions: a list of string versions, of the form ["33", "32"],
or None. The first version will be assumed to support our ABI.
:param platform: specify the exact platform you want valid
tags for, or None. If None, use the local system platform.
:param impl: specify the exact implementation you want valid
tags for, or None. If None, use the local interpreter impl.
:param abi: specify the exact abi you want valid
tags for, or None. If None, use the local interpreter abi.
"""
supported = []
# Versions must be given with respect to the preference
if versions is None:
versions = []
version_info = get_impl_version_info()
major = version_info[:-1]
# Support all previous minor Python versions.
for minor in range(version_info[-1], -1, -1):
versions.append(''.join(map(str, major + (minor,))))
impl = impl or get_abbr_impl()
abis = []
abi = abi or get_abi_tag()
if abi:
abis[0:0] = [abi]
abi3s = set()
import imp
for suffix in imp.get_suffixes():
if suffix[0].startswith('.abi'):
abi3s.add(suffix[0].split('.', 2)[1])
abis.extend(sorted(list(abi3s)))
abis.append('none')
if not noarch:
arch = platform or get_platform()
if arch.startswith('macosx'):
# support macosx-10.6-intel on macosx-10.9-x86_64
match = _osx_arch_pat.match(arch)
if match:
name, major, minor, actual_arch = match.groups()
tpl = '{0}_{1}_%i_%s'.format(name, major)
arches = []
for m in reversed(range(int(minor) + 1)):
for a in get_darwin_arches(int(major), m, actual_arch):
arches.append(tpl % (m, a))
else:
# arch pattern didn't match (?!)
arches = [arch]
elif platform is None and is_manylinux1_compatible():
arches = [arch.replace('linux', 'manylinux1'), arch]
else:
arches = [arch]
# Current version, current API (built specifically for our Python):
for abi in abis:
for arch in arches:
supported.append(('%s%s' % (impl, versions[0]), abi, arch))
# abi3 modules compatible with older version of Python
for version in versions[1:]:
# abi3 was introduced in Python 3.2
if version in ('31', '30'):
break
for abi in abi3s: # empty set if not Python 3
for arch in arches:
supported.append(("%s%s" % (impl, version), abi, arch))
# Has binaries, does not use the Python API:
for arch in arches:
supported.append(('py%s' % (versions[0][0]), 'none', arch))
# No abi / arch, but requires our implementation:
supported.append(('%s%s' % (impl, versions[0]), 'none', 'any'))
# Tagged specifically as being cross-version compatible
# (with just the major version specified)
supported.append(('%s%s' % (impl, versions[0][0]), 'none', 'any'))
# No abi / arch, generic Python
for i, version in enumerate(versions):
supported.append(('py%s' % (version,), 'none', 'any'))
if i == 0:
supported.append(('py%s' % (version[0]), 'none', 'any'))
return supported
supported_tags = get_supported()
supported_tags_noarch = get_supported(noarch=True)
implementation_tag = get_impl_tag()
pip/_vendor/chardet/escsm.py 0000644 00000024416 14751155147 0012107 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .enums import MachineState
HZ_CLS = (
1,0,0,0,0,0,0,0, # 00 - 07
0,0,0,0,0,0,0,0, # 08 - 0f
0,0,0,0,0,0,0,0, # 10 - 17
0,0,0,1,0,0,0,0, # 18 - 1f
0,0,0,0,0,0,0,0, # 20 - 27
0,0,0,0,0,0,0,0, # 28 - 2f
0,0,0,0,0,0,0,0, # 30 - 37
0,0,0,0,0,0,0,0, # 38 - 3f
0,0,0,0,0,0,0,0, # 40 - 47
0,0,0,0,0,0,0,0, # 48 - 4f
0,0,0,0,0,0,0,0, # 50 - 57
0,0,0,0,0,0,0,0, # 58 - 5f
0,0,0,0,0,0,0,0, # 60 - 67
0,0,0,0,0,0,0,0, # 68 - 6f
0,0,0,0,0,0,0,0, # 70 - 77
0,0,0,4,0,5,2,0, # 78 - 7f
1,1,1,1,1,1,1,1, # 80 - 87
1,1,1,1,1,1,1,1, # 88 - 8f
1,1,1,1,1,1,1,1, # 90 - 97
1,1,1,1,1,1,1,1, # 98 - 9f
1,1,1,1,1,1,1,1, # a0 - a7
1,1,1,1,1,1,1,1, # a8 - af
1,1,1,1,1,1,1,1, # b0 - b7
1,1,1,1,1,1,1,1, # b8 - bf
1,1,1,1,1,1,1,1, # c0 - c7
1,1,1,1,1,1,1,1, # c8 - cf
1,1,1,1,1,1,1,1, # d0 - d7
1,1,1,1,1,1,1,1, # d8 - df
1,1,1,1,1,1,1,1, # e0 - e7
1,1,1,1,1,1,1,1, # e8 - ef
1,1,1,1,1,1,1,1, # f0 - f7
1,1,1,1,1,1,1,1, # f8 - ff
)
HZ_ST = (
MachineState.START,MachineState.ERROR, 3,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,# 00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 08-0f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START, 4,MachineState.ERROR,# 10-17
5,MachineState.ERROR, 6,MachineState.ERROR, 5, 5, 4,MachineState.ERROR,# 18-1f
4,MachineState.ERROR, 4, 4, 4,MachineState.ERROR, 4,MachineState.ERROR,# 20-27
4,MachineState.ITS_ME,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 28-2f
)
HZ_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0)
HZ_SM_MODEL = {'class_table': HZ_CLS,
'class_factor': 6,
'state_table': HZ_ST,
'char_len_table': HZ_CHAR_LEN_TABLE,
'name': "HZ-GB-2312",
'language': 'Chinese'}
ISO2022CN_CLS = (
2,0,0,0,0,0,0,0, # 00 - 07
0,0,0,0,0,0,0,0, # 08 - 0f
0,0,0,0,0,0,0,0, # 10 - 17
0,0,0,1,0,0,0,0, # 18 - 1f
0,0,0,0,0,0,0,0, # 20 - 27
0,3,0,0,0,0,0,0, # 28 - 2f
0,0,0,0,0,0,0,0, # 30 - 37
0,0,0,0,0,0,0,0, # 38 - 3f
0,0,0,4,0,0,0,0, # 40 - 47
0,0,0,0,0,0,0,0, # 48 - 4f
0,0,0,0,0,0,0,0, # 50 - 57
0,0,0,0,0,0,0,0, # 58 - 5f
0,0,0,0,0,0,0,0, # 60 - 67
0,0,0,0,0,0,0,0, # 68 - 6f
0,0,0,0,0,0,0,0, # 70 - 77
0,0,0,0,0,0,0,0, # 78 - 7f
2,2,2,2,2,2,2,2, # 80 - 87
2,2,2,2,2,2,2,2, # 88 - 8f
2,2,2,2,2,2,2,2, # 90 - 97
2,2,2,2,2,2,2,2, # 98 - 9f
2,2,2,2,2,2,2,2, # a0 - a7
2,2,2,2,2,2,2,2, # a8 - af
2,2,2,2,2,2,2,2, # b0 - b7
2,2,2,2,2,2,2,2, # b8 - bf
2,2,2,2,2,2,2,2, # c0 - c7
2,2,2,2,2,2,2,2, # c8 - cf
2,2,2,2,2,2,2,2, # d0 - d7
2,2,2,2,2,2,2,2, # d8 - df
2,2,2,2,2,2,2,2, # e0 - e7
2,2,2,2,2,2,2,2, # e8 - ef
2,2,2,2,2,2,2,2, # f0 - f7
2,2,2,2,2,2,2,2, # f8 - ff
)
ISO2022CN_ST = (
MachineState.START, 3,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 00-07
MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 08-0f
MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 10-17
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 4,MachineState.ERROR,# 18-1f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 20-27
5, 6,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 28-2f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 30-37
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.START,# 38-3f
)
ISO2022CN_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0, 0, 0, 0)
ISO2022CN_SM_MODEL = {'class_table': ISO2022CN_CLS,
'class_factor': 9,
'state_table': ISO2022CN_ST,
'char_len_table': ISO2022CN_CHAR_LEN_TABLE,
'name': "ISO-2022-CN",
'language': 'Chinese'}
ISO2022JP_CLS = (
2,0,0,0,0,0,0,0, # 00 - 07
0,0,0,0,0,0,2,2, # 08 - 0f
0,0,0,0,0,0,0,0, # 10 - 17
0,0,0,1,0,0,0,0, # 18 - 1f
0,0,0,0,7,0,0,0, # 20 - 27
3,0,0,0,0,0,0,0, # 28 - 2f
0,0,0,0,0,0,0,0, # 30 - 37
0,0,0,0,0,0,0,0, # 38 - 3f
6,0,4,0,8,0,0,0, # 40 - 47
0,9,5,0,0,0,0,0, # 48 - 4f
0,0,0,0,0,0,0,0, # 50 - 57
0,0,0,0,0,0,0,0, # 58 - 5f
0,0,0,0,0,0,0,0, # 60 - 67
0,0,0,0,0,0,0,0, # 68 - 6f
0,0,0,0,0,0,0,0, # 70 - 77
0,0,0,0,0,0,0,0, # 78 - 7f
2,2,2,2,2,2,2,2, # 80 - 87
2,2,2,2,2,2,2,2, # 88 - 8f
2,2,2,2,2,2,2,2, # 90 - 97
2,2,2,2,2,2,2,2, # 98 - 9f
2,2,2,2,2,2,2,2, # a0 - a7
2,2,2,2,2,2,2,2, # a8 - af
2,2,2,2,2,2,2,2, # b0 - b7
2,2,2,2,2,2,2,2, # b8 - bf
2,2,2,2,2,2,2,2, # c0 - c7
2,2,2,2,2,2,2,2, # c8 - cf
2,2,2,2,2,2,2,2, # d0 - d7
2,2,2,2,2,2,2,2, # d8 - df
2,2,2,2,2,2,2,2, # e0 - e7
2,2,2,2,2,2,2,2, # e8 - ef
2,2,2,2,2,2,2,2, # f0 - f7
2,2,2,2,2,2,2,2, # f8 - ff
)
ISO2022JP_ST = (
MachineState.START, 3,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 00-07
MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 08-0f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 10-17
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,# 18-1f
MachineState.ERROR, 5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 4,MachineState.ERROR,MachineState.ERROR,# 20-27
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 6,MachineState.ITS_ME,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,# 28-2f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,# 30-37
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 38-3f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.START,MachineState.START,# 40-47
)
ISO2022JP_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0, 0, 0, 0, 0)
ISO2022JP_SM_MODEL = {'class_table': ISO2022JP_CLS,
'class_factor': 10,
'state_table': ISO2022JP_ST,
'char_len_table': ISO2022JP_CHAR_LEN_TABLE,
'name': "ISO-2022-JP",
'language': 'Japanese'}
ISO2022KR_CLS = (
2,0,0,0,0,0,0,0, # 00 - 07
0,0,0,0,0,0,0,0, # 08 - 0f
0,0,0,0,0,0,0,0, # 10 - 17
0,0,0,1,0,0,0,0, # 18 - 1f
0,0,0,0,3,0,0,0, # 20 - 27
0,4,0,0,0,0,0,0, # 28 - 2f
0,0,0,0,0,0,0,0, # 30 - 37
0,0,0,0,0,0,0,0, # 38 - 3f
0,0,0,5,0,0,0,0, # 40 - 47
0,0,0,0,0,0,0,0, # 48 - 4f
0,0,0,0,0,0,0,0, # 50 - 57
0,0,0,0,0,0,0,0, # 58 - 5f
0,0,0,0,0,0,0,0, # 60 - 67
0,0,0,0,0,0,0,0, # 68 - 6f
0,0,0,0,0,0,0,0, # 70 - 77
0,0,0,0,0,0,0,0, # 78 - 7f
2,2,2,2,2,2,2,2, # 80 - 87
2,2,2,2,2,2,2,2, # 88 - 8f
2,2,2,2,2,2,2,2, # 90 - 97
2,2,2,2,2,2,2,2, # 98 - 9f
2,2,2,2,2,2,2,2, # a0 - a7
2,2,2,2,2,2,2,2, # a8 - af
2,2,2,2,2,2,2,2, # b0 - b7
2,2,2,2,2,2,2,2, # b8 - bf
2,2,2,2,2,2,2,2, # c0 - c7
2,2,2,2,2,2,2,2, # c8 - cf
2,2,2,2,2,2,2,2, # d0 - d7
2,2,2,2,2,2,2,2, # d8 - df
2,2,2,2,2,2,2,2, # e0 - e7
2,2,2,2,2,2,2,2, # e8 - ef
2,2,2,2,2,2,2,2, # f0 - f7
2,2,2,2,2,2,2,2, # f8 - ff
)
ISO2022KR_ST = (
MachineState.START, 3,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,# 00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 08-0f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 4,MachineState.ERROR,MachineState.ERROR,# 10-17
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 18-1f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 20-27
)
ISO2022KR_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0)
ISO2022KR_SM_MODEL = {'class_table': ISO2022KR_CLS,
'class_factor': 6,
'state_table': ISO2022KR_ST,
'char_len_table': ISO2022KR_CHAR_LEN_TABLE,
'name': "ISO-2022-KR",
'language': 'Korean'}
pip/_vendor/chardet/big5freq.py 0000644 00000075026 14751155147 0012504 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# Big5 frequency table
# by Taiwan's Mandarin Promotion Council
# <http://www.edu.tw:81/mandr/>
#
# 128 --> 0.42261
# 256 --> 0.57851
# 512 --> 0.74851
# 1024 --> 0.89384
# 2048 --> 0.97583
#
# Ideal Distribution Ratio = 0.74851/(1-0.74851) =2.98
# Random Distribution Ration = 512/(5401-512)=0.105
#
# Typical Distribution Ratio about 25% of Ideal one, still much higher than RDR
BIG5_TYPICAL_DISTRIBUTION_RATIO = 0.75
#Char to FreqOrder table
BIG5_TABLE_SIZE = 5376
BIG5_CHAR_TO_FREQ_ORDER = (
1,1801,1506, 255,1431, 198, 9, 82, 6,5008, 177, 202,3681,1256,2821, 110, # 16
3814, 33,3274, 261, 76, 44,2114, 16,2946,2187,1176, 659,3971, 26,3451,2653, # 32
1198,3972,3350,4202, 410,2215, 302, 590, 361,1964, 8, 204, 58,4510,5009,1932, # 48
63,5010,5011, 317,1614, 75, 222, 159,4203,2417,1480,5012,3555,3091, 224,2822, # 64
3682, 3, 10,3973,1471, 29,2787,1135,2866,1940, 873, 130,3275,1123, 312,5013, # 80
4511,2052, 507, 252, 682,5014, 142,1915, 124, 206,2947, 34,3556,3204, 64, 604, # 96
5015,2501,1977,1978, 155,1991, 645, 641,1606,5016,3452, 337, 72, 406,5017, 80, # 112
630, 238,3205,1509, 263, 939,1092,2654, 756,1440,1094,3453, 449, 69,2987, 591, # 128
179,2096, 471, 115,2035,1844, 60, 50,2988, 134, 806,1869, 734,2036,3454, 180, # 144
995,1607, 156, 537,2907, 688,5018, 319,1305, 779,2145, 514,2379, 298,4512, 359, # 160
2502, 90,2716,1338, 663, 11, 906,1099,2553, 20,2441, 182, 532,1716,5019, 732, # 176
1376,4204,1311,1420,3206, 25,2317,1056, 113, 399, 382,1950, 242,3455,2474, 529, # 192
3276, 475,1447,3683,5020, 117, 21, 656, 810,1297,2300,2334,3557,5021, 126,4205, # 208
706, 456, 150, 613,4513, 71,1118,2037,4206, 145,3092, 85, 835, 486,2115,1246, # 224
1426, 428, 727,1285,1015, 800, 106, 623, 303,1281,5022,2128,2359, 347,3815, 221, # 240
3558,3135,5023,1956,1153,4207, 83, 296,1199,3093, 192, 624, 93,5024, 822,1898, # 256
2823,3136, 795,2065, 991,1554,1542,1592, 27, 43,2867, 859, 139,1456, 860,4514, # 272
437, 712,3974, 164,2397,3137, 695, 211,3037,2097, 195,3975,1608,3559,3560,3684, # 288
3976, 234, 811,2989,2098,3977,2233,1441,3561,1615,2380, 668,2077,1638, 305, 228, # 304
1664,4515, 467, 415,5025, 262,2099,1593, 239, 108, 300, 200,1033, 512,1247,2078, # 320
5026,5027,2176,3207,3685,2682, 593, 845,1062,3277, 88,1723,2038,3978,1951, 212, # 336
266, 152, 149, 468,1899,4208,4516, 77, 187,5028,3038, 37, 5,2990,5029,3979, # 352
5030,5031, 39,2524,4517,2908,3208,2079, 55, 148, 74,4518, 545, 483,1474,1029, # 368
1665, 217,1870,1531,3138,1104,2655,4209, 24, 172,3562, 900,3980,3563,3564,4519, # 384
32,1408,2824,1312, 329, 487,2360,2251,2717, 784,2683, 4,3039,3351,1427,1789, # 400
188, 109, 499,5032,3686,1717,1790, 888,1217,3040,4520,5033,3565,5034,3352,1520, # 416
3687,3981, 196,1034, 775,5035,5036, 929,1816, 249, 439, 38,5037,1063,5038, 794, # 432
3982,1435,2301, 46, 178,3278,2066,5039,2381,5040, 214,1709,4521, 804, 35, 707, # 448
324,3688,1601,2554, 140, 459,4210,5041,5042,1365, 839, 272, 978,2262,2580,3456, # 464
2129,1363,3689,1423, 697, 100,3094, 48, 70,1231, 495,3139,2196,5043,1294,5044, # 480
2080, 462, 586,1042,3279, 853, 256, 988, 185,2382,3457,1698, 434,1084,5045,3458, # 496
314,2625,2788,4522,2335,2336, 569,2285, 637,1817,2525, 757,1162,1879,1616,3459, # 512
287,1577,2116, 768,4523,1671,2868,3566,2526,1321,3816, 909,2418,5046,4211, 933, # 528
3817,4212,2053,2361,1222,4524, 765,2419,1322, 786,4525,5047,1920,1462,1677,2909, # 544
1699,5048,4526,1424,2442,3140,3690,2600,3353,1775,1941,3460,3983,4213, 309,1369, # 560
1130,2825, 364,2234,1653,1299,3984,3567,3985,3986,2656, 525,1085,3041, 902,2001, # 576
1475, 964,4527, 421,1845,1415,1057,2286, 940,1364,3141, 376,4528,4529,1381, 7, # 592
2527, 983,2383, 336,1710,2684,1846, 321,3461, 559,1131,3042,2752,1809,1132,1313, # 608
265,1481,1858,5049, 352,1203,2826,3280, 167,1089, 420,2827, 776, 792,1724,3568, # 624
4214,2443,3281,5050,4215,5051, 446, 229, 333,2753, 901,3818,1200,1557,4530,2657, # 640
1921, 395,2754,2685,3819,4216,1836, 125, 916,3209,2626,4531,5052,5053,3820,5054, # 656
5055,5056,4532,3142,3691,1133,2555,1757,3462,1510,2318,1409,3569,5057,2146, 438, # 672
2601,2910,2384,3354,1068, 958,3043, 461, 311,2869,2686,4217,1916,3210,4218,1979, # 688
383, 750,2755,2627,4219, 274, 539, 385,1278,1442,5058,1154,1965, 384, 561, 210, # 704
98,1295,2556,3570,5059,1711,2420,1482,3463,3987,2911,1257, 129,5060,3821, 642, # 720
523,2789,2790,2658,5061, 141,2235,1333, 68, 176, 441, 876, 907,4220, 603,2602, # 736
710, 171,3464, 404, 549, 18,3143,2398,1410,3692,1666,5062,3571,4533,2912,4534, # 752
5063,2991, 368,5064, 146, 366, 99, 871,3693,1543, 748, 807,1586,1185, 22,2263, # 768
379,3822,3211,5065,3212, 505,1942,2628,1992,1382,2319,5066, 380,2362, 218, 702, # 784
1818,1248,3465,3044,3572,3355,3282,5067,2992,3694, 930,3283,3823,5068, 59,5069, # 800
585, 601,4221, 497,3466,1112,1314,4535,1802,5070,1223,1472,2177,5071, 749,1837, # 816
690,1900,3824,1773,3988,1476, 429,1043,1791,2236,2117, 917,4222, 447,1086,1629, # 832
5072, 556,5073,5074,2021,1654, 844,1090, 105, 550, 966,1758,2828,1008,1783, 686, # 848
1095,5075,2287, 793,1602,5076,3573,2603,4536,4223,2948,2302,4537,3825, 980,2503, # 864
544, 353, 527,4538, 908,2687,2913,5077, 381,2629,1943,1348,5078,1341,1252, 560, # 880
3095,5079,3467,2870,5080,2054, 973, 886,2081, 143,4539,5081,5082, 157,3989, 496, # 896
4224, 57, 840, 540,2039,4540,4541,3468,2118,1445, 970,2264,1748,1966,2082,4225, # 912
3144,1234,1776,3284,2829,3695, 773,1206,2130,1066,2040,1326,3990,1738,1725,4226, # 928
279,3145, 51,1544,2604, 423,1578,2131,2067, 173,4542,1880,5083,5084,1583, 264, # 944
610,3696,4543,2444, 280, 154,5085,5086,5087,1739, 338,1282,3096, 693,2871,1411, # 960
1074,3826,2445,5088,4544,5089,5090,1240, 952,2399,5091,2914,1538,2688, 685,1483, # 976
4227,2475,1436, 953,4228,2055,4545, 671,2400, 79,4229,2446,3285, 608, 567,2689, # 992
3469,4230,4231,1691, 393,1261,1792,2401,5092,4546,5093,5094,5095,5096,1383,1672, # 1008
3827,3213,1464, 522,1119, 661,1150, 216, 675,4547,3991,1432,3574, 609,4548,2690, # 1024
2402,5097,5098,5099,4232,3045, 0,5100,2476, 315, 231,2447, 301,3356,4549,2385, # 1040
5101, 233,4233,3697,1819,4550,4551,5102, 96,1777,1315,2083,5103, 257,5104,1810, # 1056
3698,2718,1139,1820,4234,2022,1124,2164,2791,1778,2659,5105,3097, 363,1655,3214, # 1072
5106,2993,5107,5108,5109,3992,1567,3993, 718, 103,3215, 849,1443, 341,3357,2949, # 1088
1484,5110,1712, 127, 67, 339,4235,2403, 679,1412, 821,5111,5112, 834, 738, 351, # 1104
2994,2147, 846, 235,1497,1881, 418,1993,3828,2719, 186,1100,2148,2756,3575,1545, # 1120
1355,2950,2872,1377, 583,3994,4236,2581,2995,5113,1298,3699,1078,2557,3700,2363, # 1136
78,3829,3830, 267,1289,2100,2002,1594,4237, 348, 369,1274,2197,2178,1838,4552, # 1152
1821,2830,3701,2757,2288,2003,4553,2951,2758, 144,3358, 882,4554,3995,2759,3470, # 1168
4555,2915,5114,4238,1726, 320,5115,3996,3046, 788,2996,5116,2831,1774,1327,2873, # 1184
3997,2832,5117,1306,4556,2004,1700,3831,3576,2364,2660, 787,2023, 506, 824,3702, # 1200
534, 323,4557,1044,3359,2024,1901, 946,3471,5118,1779,1500,1678,5119,1882,4558, # 1216
165, 243,4559,3703,2528, 123, 683,4239, 764,4560, 36,3998,1793, 589,2916, 816, # 1232
626,1667,3047,2237,1639,1555,1622,3832,3999,5120,4000,2874,1370,1228,1933, 891, # 1248
2084,2917, 304,4240,5121, 292,2997,2720,3577, 691,2101,4241,1115,4561, 118, 662, # 1264
5122, 611,1156, 854,2386,1316,2875, 2, 386, 515,2918,5123,5124,3286, 868,2238, # 1280
1486, 855,2661, 785,2216,3048,5125,1040,3216,3578,5126,3146, 448,5127,1525,5128, # 1296
2165,4562,5129,3833,5130,4242,2833,3579,3147, 503, 818,4001,3148,1568, 814, 676, # 1312
1444, 306,1749,5131,3834,1416,1030, 197,1428, 805,2834,1501,4563,5132,5133,5134, # 1328
1994,5135,4564,5136,5137,2198, 13,2792,3704,2998,3149,1229,1917,5138,3835,2132, # 1344
5139,4243,4565,2404,3580,5140,2217,1511,1727,1120,5141,5142, 646,3836,2448, 307, # 1360
5143,5144,1595,3217,5145,5146,5147,3705,1113,1356,4002,1465,2529,2530,5148, 519, # 1376
5149, 128,2133, 92,2289,1980,5150,4003,1512, 342,3150,2199,5151,2793,2218,1981, # 1392
3360,4244, 290,1656,1317, 789, 827,2365,5152,3837,4566, 562, 581,4004,5153, 401, # 1408
4567,2252, 94,4568,5154,1399,2794,5155,1463,2025,4569,3218,1944,5156, 828,1105, # 1424
4245,1262,1394,5157,4246, 605,4570,5158,1784,2876,5159,2835, 819,2102, 578,2200, # 1440
2952,5160,1502, 436,3287,4247,3288,2836,4005,2919,3472,3473,5161,2721,2320,5162, # 1456
5163,2337,2068, 23,4571, 193, 826,3838,2103, 699,1630,4248,3098, 390,1794,1064, # 1472
3581,5164,1579,3099,3100,1400,5165,4249,1839,1640,2877,5166,4572,4573, 137,4250, # 1488
598,3101,1967, 780, 104, 974,2953,5167, 278, 899, 253, 402, 572, 504, 493,1339, # 1504
5168,4006,1275,4574,2582,2558,5169,3706,3049,3102,2253, 565,1334,2722, 863, 41, # 1520
5170,5171,4575,5172,1657,2338, 19, 463,2760,4251, 606,5173,2999,3289,1087,2085, # 1536
1323,2662,3000,5174,1631,1623,1750,4252,2691,5175,2878, 791,2723,2663,2339, 232, # 1552
2421,5176,3001,1498,5177,2664,2630, 755,1366,3707,3290,3151,2026,1609, 119,1918, # 1568
3474, 862,1026,4253,5178,4007,3839,4576,4008,4577,2265,1952,2477,5179,1125, 817, # 1584
4254,4255,4009,1513,1766,2041,1487,4256,3050,3291,2837,3840,3152,5180,5181,1507, # 1600
5182,2692, 733, 40,1632,1106,2879, 345,4257, 841,2531, 230,4578,3002,1847,3292, # 1616
3475,5183,1263, 986,3476,5184, 735, 879, 254,1137, 857, 622,1300,1180,1388,1562, # 1632
4010,4011,2954, 967,2761,2665,1349, 592,2134,1692,3361,3003,1995,4258,1679,4012, # 1648
1902,2188,5185, 739,3708,2724,1296,1290,5186,4259,2201,2202,1922,1563,2605,2559, # 1664
1871,2762,3004,5187, 435,5188, 343,1108, 596, 17,1751,4579,2239,3477,3709,5189, # 1680
4580, 294,3582,2955,1693, 477, 979, 281,2042,3583, 643,2043,3710,2631,2795,2266, # 1696
1031,2340,2135,2303,3584,4581, 367,1249,2560,5190,3585,5191,4582,1283,3362,2005, # 1712
240,1762,3363,4583,4584, 836,1069,3153, 474,5192,2149,2532, 268,3586,5193,3219, # 1728
1521,1284,5194,1658,1546,4260,5195,3587,3588,5196,4261,3364,2693,1685,4262, 961, # 1744
1673,2632, 190,2006,2203,3841,4585,4586,5197, 570,2504,3711,1490,5198,4587,2633, # 1760
3293,1957,4588, 584,1514, 396,1045,1945,5199,4589,1968,2449,5200,5201,4590,4013, # 1776
619,5202,3154,3294, 215,2007,2796,2561,3220,4591,3221,4592, 763,4263,3842,4593, # 1792
5203,5204,1958,1767,2956,3365,3712,1174, 452,1477,4594,3366,3155,5205,2838,1253, # 1808
2387,2189,1091,2290,4264, 492,5206, 638,1169,1825,2136,1752,4014, 648, 926,1021, # 1824
1324,4595, 520,4596, 997, 847,1007, 892,4597,3843,2267,1872,3713,2405,1785,4598, # 1840
1953,2957,3103,3222,1728,4265,2044,3714,4599,2008,1701,3156,1551, 30,2268,4266, # 1856
5207,2027,4600,3589,5208, 501,5209,4267, 594,3478,2166,1822,3590,3479,3591,3223, # 1872
829,2839,4268,5210,1680,3157,1225,4269,5211,3295,4601,4270,3158,2341,5212,4602, # 1888
4271,5213,4015,4016,5214,1848,2388,2606,3367,5215,4603, 374,4017, 652,4272,4273, # 1904
375,1140, 798,5216,5217,5218,2366,4604,2269, 546,1659, 138,3051,2450,4605,5219, # 1920
2254, 612,1849, 910, 796,3844,1740,1371, 825,3845,3846,5220,2920,2562,5221, 692, # 1936
444,3052,2634, 801,4606,4274,5222,1491, 244,1053,3053,4275,4276, 340,5223,4018, # 1952
1041,3005, 293,1168, 87,1357,5224,1539, 959,5225,2240, 721, 694,4277,3847, 219, # 1968
1478, 644,1417,3368,2666,1413,1401,1335,1389,4019,5226,5227,3006,2367,3159,1826, # 1984
730,1515, 184,2840, 66,4607,5228,1660,2958, 246,3369, 378,1457, 226,3480, 975, # 2000
4020,2959,1264,3592, 674, 696,5229, 163,5230,1141,2422,2167, 713,3593,3370,4608, # 2016
4021,5231,5232,1186, 15,5233,1079,1070,5234,1522,3224,3594, 276,1050,2725, 758, # 2032
1126, 653,2960,3296,5235,2342, 889,3595,4022,3104,3007, 903,1250,4609,4023,3481, # 2048
3596,1342,1681,1718, 766,3297, 286, 89,2961,3715,5236,1713,5237,2607,3371,3008, # 2064
5238,2962,2219,3225,2880,5239,4610,2505,2533, 181, 387,1075,4024, 731,2190,3372, # 2080
5240,3298, 310, 313,3482,2304, 770,4278, 54,3054, 189,4611,3105,3848,4025,5241, # 2096
1230,1617,1850, 355,3597,4279,4612,3373, 111,4280,3716,1350,3160,3483,3055,4281, # 2112
2150,3299,3598,5242,2797,4026,4027,3009, 722,2009,5243,1071, 247,1207,2343,2478, # 2128
1378,4613,2010, 864,1437,1214,4614, 373,3849,1142,2220, 667,4615, 442,2763,2563, # 2144
3850,4028,1969,4282,3300,1840, 837, 170,1107, 934,1336,1883,5244,5245,2119,4283, # 2160
2841, 743,1569,5246,4616,4284, 582,2389,1418,3484,5247,1803,5248, 357,1395,1729, # 2176
3717,3301,2423,1564,2241,5249,3106,3851,1633,4617,1114,2086,4285,1532,5250, 482, # 2192
2451,4618,5251,5252,1492, 833,1466,5253,2726,3599,1641,2842,5254,1526,1272,3718, # 2208
4286,1686,1795, 416,2564,1903,1954,1804,5255,3852,2798,3853,1159,2321,5256,2881, # 2224
4619,1610,1584,3056,2424,2764, 443,3302,1163,3161,5257,5258,4029,5259,4287,2506, # 2240
3057,4620,4030,3162,2104,1647,3600,2011,1873,4288,5260,4289, 431,3485,5261, 250, # 2256
97, 81,4290,5262,1648,1851,1558, 160, 848,5263, 866, 740,1694,5264,2204,2843, # 2272
3226,4291,4621,3719,1687, 950,2479, 426, 469,3227,3720,3721,4031,5265,5266,1188, # 2288
424,1996, 861,3601,4292,3854,2205,2694, 168,1235,3602,4293,5267,2087,1674,4622, # 2304
3374,3303, 220,2565,1009,5268,3855, 670,3010, 332,1208, 717,5269,5270,3603,2452, # 2320
4032,3375,5271, 513,5272,1209,2882,3376,3163,4623,1080,5273,5274,5275,5276,2534, # 2336
3722,3604, 815,1587,4033,4034,5277,3605,3486,3856,1254,4624,1328,3058,1390,4035, # 2352
1741,4036,3857,4037,5278, 236,3858,2453,3304,5279,5280,3723,3859,1273,3860,4625, # 2368
5281, 308,5282,4626, 245,4627,1852,2480,1307,2583, 430, 715,2137,2454,5283, 270, # 2384
199,2883,4038,5284,3606,2727,1753, 761,1754, 725,1661,1841,4628,3487,3724,5285, # 2400
5286, 587, 14,3305, 227,2608, 326, 480,2270, 943,2765,3607, 291, 650,1884,5287, # 2416
1702,1226, 102,1547, 62,3488, 904,4629,3489,1164,4294,5288,5289,1224,1548,2766, # 2432
391, 498,1493,5290,1386,1419,5291,2056,1177,4630, 813, 880,1081,2368, 566,1145, # 2448
4631,2291,1001,1035,2566,2609,2242, 394,1286,5292,5293,2069,5294, 86,1494,1730, # 2464
4039, 491,1588, 745, 897,2963, 843,3377,4040,2767,2884,3306,1768, 998,2221,2070, # 2480
397,1827,1195,1970,3725,3011,3378, 284,5295,3861,2507,2138,2120,1904,5296,4041, # 2496
2151,4042,4295,1036,3490,1905, 114,2567,4296, 209,1527,5297,5298,2964,2844,2635, # 2512
2390,2728,3164, 812,2568,5299,3307,5300,1559, 737,1885,3726,1210, 885, 28,2695, # 2528
3608,3862,5301,4297,1004,1780,4632,5302, 346,1982,2222,2696,4633,3863,1742, 797, # 2544
1642,4043,1934,1072,1384,2152, 896,4044,3308,3727,3228,2885,3609,5303,2569,1959, # 2560
4634,2455,1786,5304,5305,5306,4045,4298,1005,1308,3728,4299,2729,4635,4636,1528, # 2576
2610, 161,1178,4300,1983, 987,4637,1101,4301, 631,4046,1157,3229,2425,1343,1241, # 2592
1016,2243,2570, 372, 877,2344,2508,1160, 555,1935, 911,4047,5307, 466,1170, 169, # 2608
1051,2921,2697,3729,2481,3012,1182,2012,2571,1251,2636,5308, 992,2345,3491,1540, # 2624
2730,1201,2071,2406,1997,2482,5309,4638, 528,1923,2191,1503,1874,1570,2369,3379, # 2640
3309,5310, 557,1073,5311,1828,3492,2088,2271,3165,3059,3107, 767,3108,2799,4639, # 2656
1006,4302,4640,2346,1267,2179,3730,3230, 778,4048,3231,2731,1597,2667,5312,4641, # 2672
5313,3493,5314,5315,5316,3310,2698,1433,3311, 131, 95,1504,4049, 723,4303,3166, # 2688
1842,3610,2768,2192,4050,2028,2105,3731,5317,3013,4051,1218,5318,3380,3232,4052, # 2704
4304,2584, 248,1634,3864, 912,5319,2845,3732,3060,3865, 654, 53,5320,3014,5321, # 2720
1688,4642, 777,3494,1032,4053,1425,5322, 191, 820,2121,2846, 971,4643, 931,3233, # 2736
135, 664, 783,3866,1998, 772,2922,1936,4054,3867,4644,2923,3234, 282,2732, 640, # 2752
1372,3495,1127, 922, 325,3381,5323,5324, 711,2045,5325,5326,4055,2223,2800,1937, # 2768
4056,3382,2224,2255,3868,2305,5327,4645,3869,1258,3312,4057,3235,2139,2965,4058, # 2784
4059,5328,2225, 258,3236,4646, 101,1227,5329,3313,1755,5330,1391,3314,5331,2924, # 2800
2057, 893,5332,5333,5334,1402,4305,2347,5335,5336,3237,3611,5337,5338, 878,1325, # 2816
1781,2801,4647, 259,1385,2585, 744,1183,2272,4648,5339,4060,2509,5340, 684,1024, # 2832
4306,5341, 472,3612,3496,1165,3315,4061,4062, 322,2153, 881, 455,1695,1152,1340, # 2848
660, 554,2154,4649,1058,4650,4307, 830,1065,3383,4063,4651,1924,5342,1703,1919, # 2864
5343, 932,2273, 122,5344,4652, 947, 677,5345,3870,2637, 297,1906,1925,2274,4653, # 2880
2322,3316,5346,5347,4308,5348,4309, 84,4310, 112, 989,5349, 547,1059,4064, 701, # 2896
3613,1019,5350,4311,5351,3497, 942, 639, 457,2306,2456, 993,2966, 407, 851, 494, # 2912
4654,3384, 927,5352,1237,5353,2426,3385, 573,4312, 680, 921,2925,1279,1875, 285, # 2928
790,1448,1984, 719,2168,5354,5355,4655,4065,4066,1649,5356,1541, 563,5357,1077, # 2944
5358,3386,3061,3498, 511,3015,4067,4068,3733,4069,1268,2572,3387,3238,4656,4657, # 2960
5359, 535,1048,1276,1189,2926,2029,3167,1438,1373,2847,2967,1134,2013,5360,4313, # 2976
1238,2586,3109,1259,5361, 700,5362,2968,3168,3734,4314,5363,4315,1146,1876,1907, # 2992
4658,2611,4070, 781,2427, 132,1589, 203, 147, 273,2802,2407, 898,1787,2155,4071, # 3008
4072,5364,3871,2803,5365,5366,4659,4660,5367,3239,5368,1635,3872, 965,5369,1805, # 3024
2699,1516,3614,1121,1082,1329,3317,4073,1449,3873, 65,1128,2848,2927,2769,1590, # 3040
3874,5370,5371, 12,2668, 45, 976,2587,3169,4661, 517,2535,1013,1037,3240,5372, # 3056
3875,2849,5373,3876,5374,3499,5375,2612, 614,1999,2323,3877,3110,2733,2638,5376, # 3072
2588,4316, 599,1269,5377,1811,3735,5378,2700,3111, 759,1060, 489,1806,3388,3318, # 3088
1358,5379,5380,2391,1387,1215,2639,2256, 490,5381,5382,4317,1759,2392,2348,5383, # 3104
4662,3878,1908,4074,2640,1807,3241,4663,3500,3319,2770,2349, 874,5384,5385,3501, # 3120
3736,1859, 91,2928,3737,3062,3879,4664,5386,3170,4075,2669,5387,3502,1202,1403, # 3136
3880,2969,2536,1517,2510,4665,3503,2511,5388,4666,5389,2701,1886,1495,1731,4076, # 3152
2370,4667,5390,2030,5391,5392,4077,2702,1216, 237,2589,4318,2324,4078,3881,4668, # 3168
4669,2703,3615,3504, 445,4670,5393,5394,5395,5396,2771, 61,4079,3738,1823,4080, # 3184
5397, 687,2046, 935, 925, 405,2670, 703,1096,1860,2734,4671,4081,1877,1367,2704, # 3200
3389, 918,2106,1782,2483, 334,3320,1611,1093,4672, 564,3171,3505,3739,3390, 945, # 3216
2641,2058,4673,5398,1926, 872,4319,5399,3506,2705,3112, 349,4320,3740,4082,4674, # 3232
3882,4321,3741,2156,4083,4675,4676,4322,4677,2408,2047, 782,4084, 400, 251,4323, # 3248
1624,5400,5401, 277,3742, 299,1265, 476,1191,3883,2122,4324,4325,1109, 205,5402, # 3264
2590,1000,2157,3616,1861,5403,5404,5405,4678,5406,4679,2573, 107,2484,2158,4085, # 3280
3507,3172,5407,1533, 541,1301, 158, 753,4326,2886,3617,5408,1696, 370,1088,4327, # 3296
4680,3618, 579, 327, 440, 162,2244, 269,1938,1374,3508, 968,3063, 56,1396,3113, # 3312
2107,3321,3391,5409,1927,2159,4681,3016,5410,3619,5411,5412,3743,4682,2485,5413, # 3328
2804,5414,1650,4683,5415,2613,5416,5417,4086,2671,3392,1149,3393,4087,3884,4088, # 3344
5418,1076, 49,5419, 951,3242,3322,3323, 450,2850, 920,5420,1812,2805,2371,4328, # 3360
1909,1138,2372,3885,3509,5421,3243,4684,1910,1147,1518,2428,4685,3886,5422,4686, # 3376
2393,2614, 260,1796,3244,5423,5424,3887,3324, 708,5425,3620,1704,5426,3621,1351, # 3392
1618,3394,3017,1887, 944,4329,3395,4330,3064,3396,4331,5427,3744, 422, 413,1714, # 3408
3325, 500,2059,2350,4332,2486,5428,1344,1911, 954,5429,1668,5430,5431,4089,2409, # 3424
4333,3622,3888,4334,5432,2307,1318,2512,3114, 133,3115,2887,4687, 629, 31,2851, # 3440
2706,3889,4688, 850, 949,4689,4090,2970,1732,2089,4335,1496,1853,5433,4091, 620, # 3456
3245, 981,1242,3745,3397,1619,3746,1643,3326,2140,2457,1971,1719,3510,2169,5434, # 3472
3246,5435,5436,3398,1829,5437,1277,4690,1565,2048,5438,1636,3623,3116,5439, 869, # 3488
2852, 655,3890,3891,3117,4092,3018,3892,1310,3624,4691,5440,5441,5442,1733, 558, # 3504
4692,3747, 335,1549,3065,1756,4336,3748,1946,3511,1830,1291,1192, 470,2735,2108, # 3520
2806, 913,1054,4093,5443,1027,5444,3066,4094,4693, 982,2672,3399,3173,3512,3247, # 3536
3248,1947,2807,5445, 571,4694,5446,1831,5447,3625,2591,1523,2429,5448,2090, 984, # 3552
4695,3749,1960,5449,3750, 852, 923,2808,3513,3751, 969,1519, 999,2049,2325,1705, # 3568
5450,3118, 615,1662, 151, 597,4095,2410,2326,1049, 275,4696,3752,4337, 568,3753, # 3584
3626,2487,4338,3754,5451,2430,2275, 409,3249,5452,1566,2888,3514,1002, 769,2853, # 3600
194,2091,3174,3755,2226,3327,4339, 628,1505,5453,5454,1763,2180,3019,4096, 521, # 3616
1161,2592,1788,2206,2411,4697,4097,1625,4340,4341, 412, 42,3119, 464,5455,2642, # 3632
4698,3400,1760,1571,2889,3515,2537,1219,2207,3893,2643,2141,2373,4699,4700,3328, # 3648
1651,3401,3627,5456,5457,3628,2488,3516,5458,3756,5459,5460,2276,2092, 460,5461, # 3664
4701,5462,3020, 962, 588,3629, 289,3250,2644,1116, 52,5463,3067,1797,5464,5465, # 3680
5466,1467,5467,1598,1143,3757,4342,1985,1734,1067,4702,1280,3402, 465,4703,1572, # 3696
510,5468,1928,2245,1813,1644,3630,5469,4704,3758,5470,5471,2673,1573,1534,5472, # 3712
5473, 536,1808,1761,3517,3894,3175,2645,5474,5475,5476,4705,3518,2929,1912,2809, # 3728
5477,3329,1122, 377,3251,5478, 360,5479,5480,4343,1529, 551,5481,2060,3759,1769, # 3744
2431,5482,2930,4344,3330,3120,2327,2109,2031,4706,1404, 136,1468,1479, 672,1171, # 3760
3252,2308, 271,3176,5483,2772,5484,2050, 678,2736, 865,1948,4707,5485,2014,4098, # 3776
2971,5486,2737,2227,1397,3068,3760,4708,4709,1735,2931,3403,3631,5487,3895, 509, # 3792
2854,2458,2890,3896,5488,5489,3177,3178,4710,4345,2538,4711,2309,1166,1010, 552, # 3808
681,1888,5490,5491,2972,2973,4099,1287,1596,1862,3179, 358, 453, 736, 175, 478, # 3824
1117, 905,1167,1097,5492,1854,1530,5493,1706,5494,2181,3519,2292,3761,3520,3632, # 3840
4346,2093,4347,5495,3404,1193,2489,4348,1458,2193,2208,1863,1889,1421,3331,2932, # 3856
3069,2182,3521, 595,2123,5496,4100,5497,5498,4349,1707,2646, 223,3762,1359, 751, # 3872
3121, 183,3522,5499,2810,3021, 419,2374, 633, 704,3897,2394, 241,5500,5501,5502, # 3888
838,3022,3763,2277,2773,2459,3898,1939,2051,4101,1309,3122,2246,1181,5503,1136, # 3904
2209,3899,2375,1446,4350,2310,4712,5504,5505,4351,1055,2615, 484,3764,5506,4102, # 3920
625,4352,2278,3405,1499,4353,4103,5507,4104,4354,3253,2279,2280,3523,5508,5509, # 3936
2774, 808,2616,3765,3406,4105,4355,3123,2539, 526,3407,3900,4356, 955,5510,1620, # 3952
4357,2647,2432,5511,1429,3766,1669,1832, 994, 928,5512,3633,1260,5513,5514,5515, # 3968
1949,2293, 741,2933,1626,4358,2738,2460, 867,1184, 362,3408,1392,5516,5517,4106, # 3984
4359,1770,1736,3254,2934,4713,4714,1929,2707,1459,1158,5518,3070,3409,2891,1292, # 4000
1930,2513,2855,3767,1986,1187,2072,2015,2617,4360,5519,2574,2514,2170,3768,2490, # 4016
3332,5520,3769,4715,5521,5522, 666,1003,3023,1022,3634,4361,5523,4716,1814,2257, # 4032
574,3901,1603, 295,1535, 705,3902,4362, 283, 858, 417,5524,5525,3255,4717,4718, # 4048
3071,1220,1890,1046,2281,2461,4107,1393,1599, 689,2575, 388,4363,5526,2491, 802, # 4064
5527,2811,3903,2061,1405,2258,5528,4719,3904,2110,1052,1345,3256,1585,5529, 809, # 4080
5530,5531,5532, 575,2739,3524, 956,1552,1469,1144,2328,5533,2329,1560,2462,3635, # 4096
3257,4108, 616,2210,4364,3180,2183,2294,5534,1833,5535,3525,4720,5536,1319,3770, # 4112
3771,1211,3636,1023,3258,1293,2812,5537,5538,5539,3905, 607,2311,3906, 762,2892, # 4128
1439,4365,1360,4721,1485,3072,5540,4722,1038,4366,1450,2062,2648,4367,1379,4723, # 4144
2593,5541,5542,4368,1352,1414,2330,2935,1172,5543,5544,3907,3908,4724,1798,1451, # 4160
5545,5546,5547,5548,2936,4109,4110,2492,2351, 411,4111,4112,3637,3333,3124,4725, # 4176
1561,2674,1452,4113,1375,5549,5550, 47,2974, 316,5551,1406,1591,2937,3181,5552, # 4192
1025,2142,3125,3182, 354,2740, 884,2228,4369,2412, 508,3772, 726,3638, 996,2433, # 4208
3639, 729,5553, 392,2194,1453,4114,4726,3773,5554,5555,2463,3640,2618,1675,2813, # 4224
919,2352,2975,2353,1270,4727,4115, 73,5556,5557, 647,5558,3259,2856,2259,1550, # 4240
1346,3024,5559,1332, 883,3526,5560,5561,5562,5563,3334,2775,5564,1212, 831,1347, # 4256
4370,4728,2331,3909,1864,3073, 720,3910,4729,4730,3911,5565,4371,5566,5567,4731, # 4272
5568,5569,1799,4732,3774,2619,4733,3641,1645,2376,4734,5570,2938, 669,2211,2675, # 4288
2434,5571,2893,5572,5573,1028,3260,5574,4372,2413,5575,2260,1353,5576,5577,4735, # 4304
3183, 518,5578,4116,5579,4373,1961,5580,2143,4374,5581,5582,3025,2354,2355,3912, # 4320
516,1834,1454,4117,2708,4375,4736,2229,2620,1972,1129,3642,5583,2776,5584,2976, # 4336
1422, 577,1470,3026,1524,3410,5585,5586, 432,4376,3074,3527,5587,2594,1455,2515, # 4352
2230,1973,1175,5588,1020,2741,4118,3528,4737,5589,2742,5590,1743,1361,3075,3529, # 4368
2649,4119,4377,4738,2295, 895, 924,4378,2171, 331,2247,3076, 166,1627,3077,1098, # 4384
5591,1232,2894,2231,3411,4739, 657, 403,1196,2377, 542,3775,3412,1600,4379,3530, # 4400
5592,4740,2777,3261, 576, 530,1362,4741,4742,2540,2676,3776,4120,5593, 842,3913, # 4416
5594,2814,2032,1014,4121, 213,2709,3413, 665, 621,4380,5595,3777,2939,2435,5596, # 4432
2436,3335,3643,3414,4743,4381,2541,4382,4744,3644,1682,4383,3531,1380,5597, 724, # 4448
2282, 600,1670,5598,1337,1233,4745,3126,2248,5599,1621,4746,5600, 651,4384,5601, # 4464
1612,4385,2621,5602,2857,5603,2743,2312,3078,5604, 716,2464,3079, 174,1255,2710, # 4480
4122,3645, 548,1320,1398, 728,4123,1574,5605,1891,1197,3080,4124,5606,3081,3082, # 4496
3778,3646,3779, 747,5607, 635,4386,4747,5608,5609,5610,4387,5611,5612,4748,5613, # 4512
3415,4749,2437, 451,5614,3780,2542,2073,4388,2744,4389,4125,5615,1764,4750,5616, # 4528
4390, 350,4751,2283,2395,2493,5617,4391,4126,2249,1434,4127, 488,4752, 458,4392, # 4544
4128,3781, 771,1330,2396,3914,2576,3184,2160,2414,1553,2677,3185,4393,5618,2494, # 4560
2895,2622,1720,2711,4394,3416,4753,5619,2543,4395,5620,3262,4396,2778,5621,2016, # 4576
2745,5622,1155,1017,3782,3915,5623,3336,2313, 201,1865,4397,1430,5624,4129,5625, # 4592
5626,5627,5628,5629,4398,1604,5630, 414,1866, 371,2595,4754,4755,3532,2017,3127, # 4608
4756,1708, 960,4399, 887, 389,2172,1536,1663,1721,5631,2232,4130,2356,2940,1580, # 4624
5632,5633,1744,4757,2544,4758,4759,5634,4760,5635,2074,5636,4761,3647,3417,2896, # 4640
4400,5637,4401,2650,3418,2815, 673,2712,2465, 709,3533,4131,3648,4402,5638,1148, # 4656
502, 634,5639,5640,1204,4762,3649,1575,4763,2623,3783,5641,3784,3128, 948,3263, # 4672
121,1745,3916,1110,5642,4403,3083,2516,3027,4132,3785,1151,1771,3917,1488,4133, # 4688
1987,5643,2438,3534,5644,5645,2094,5646,4404,3918,1213,1407,2816, 531,2746,2545, # 4704
3264,1011,1537,4764,2779,4405,3129,1061,5647,3786,3787,1867,2897,5648,2018, 120, # 4720
4406,4407,2063,3650,3265,2314,3919,2678,3419,1955,4765,4134,5649,3535,1047,2713, # 4736
1266,5650,1368,4766,2858, 649,3420,3920,2546,2747,1102,2859,2679,5651,5652,2000, # 4752
5653,1111,3651,2977,5654,2495,3921,3652,2817,1855,3421,3788,5655,5656,3422,2415, # 4768
2898,3337,3266,3653,5657,2577,5658,3654,2818,4135,1460, 856,5659,3655,5660,2899, # 4784
2978,5661,2900,3922,5662,4408, 632,2517, 875,3923,1697,3924,2296,5663,5664,4767, # 4800
3028,1239, 580,4768,4409,5665, 914, 936,2075,1190,4136,1039,2124,5666,5667,5668, # 4816
5669,3423,1473,5670,1354,4410,3925,4769,2173,3084,4137, 915,3338,4411,4412,3339, # 4832
1605,1835,5671,2748, 398,3656,4413,3926,4138, 328,1913,2860,4139,3927,1331,4414, # 4848
3029, 937,4415,5672,3657,4140,4141,3424,2161,4770,3425, 524, 742, 538,3085,1012, # 4864
5673,5674,3928,2466,5675, 658,1103, 225,3929,5676,5677,4771,5678,4772,5679,3267, # 4880
1243,5680,4142, 963,2250,4773,5681,2714,3658,3186,5682,5683,2596,2332,5684,4774, # 4896
5685,5686,5687,3536, 957,3426,2547,2033,1931,2941,2467, 870,2019,3659,1746,2780, # 4912
2781,2439,2468,5688,3930,5689,3789,3130,3790,3537,3427,3791,5690,1179,3086,5691, # 4928
3187,2378,4416,3792,2548,3188,3131,2749,4143,5692,3428,1556,2549,2297, 977,2901, # 4944
2034,4144,1205,3429,5693,1765,3430,3189,2125,1271, 714,1689,4775,3538,5694,2333, # 4960
3931, 533,4417,3660,2184, 617,5695,2469,3340,3539,2315,5696,5697,3190,5698,5699, # 4976
3932,1988, 618, 427,2651,3540,3431,5700,5701,1244,1690,5702,2819,4418,4776,5703, # 4992
3541,4777,5704,2284,1576, 473,3661,4419,3432, 972,5705,3662,5706,3087,5707,5708, # 5008
4778,4779,5709,3793,4145,4146,5710, 153,4780, 356,5711,1892,2902,4420,2144, 408, # 5024
803,2357,5712,3933,5713,4421,1646,2578,2518,4781,4782,3934,5714,3935,4422,5715, # 5040
2416,3433, 752,5716,5717,1962,3341,2979,5718, 746,3030,2470,4783,4423,3794, 698, # 5056
4784,1893,4424,3663,2550,4785,3664,3936,5719,3191,3434,5720,1824,1302,4147,2715, # 5072
3937,1974,4425,5721,4426,3192, 823,1303,1288,1236,2861,3542,4148,3435, 774,3938, # 5088
5722,1581,4786,1304,2862,3939,4787,5723,2440,2162,1083,3268,4427,4149,4428, 344, # 5104
1173, 288,2316, 454,1683,5724,5725,1461,4788,4150,2597,5726,5727,4789, 985, 894, # 5120
5728,3436,3193,5729,1914,2942,3795,1989,5730,2111,1975,5731,4151,5732,2579,1194, # 5136
425,5733,4790,3194,1245,3796,4429,5734,5735,2863,5736, 636,4791,1856,3940, 760, # 5152
1800,5737,4430,2212,1508,4792,4152,1894,1684,2298,5738,5739,4793,4431,4432,2213, # 5168
479,5740,5741, 832,5742,4153,2496,5743,2980,2497,3797, 990,3132, 627,1815,2652, # 5184
4433,1582,4434,2126,2112,3543,4794,5744, 799,4435,3195,5745,4795,2113,1737,3031, # 5200
1018, 543, 754,4436,3342,1676,4796,4797,4154,4798,1489,5746,3544,5747,2624,2903, # 5216
4155,5748,5749,2981,5750,5751,5752,5753,3196,4799,4800,2185,1722,5754,3269,3270, # 5232
1843,3665,1715, 481, 365,1976,1857,5755,5756,1963,2498,4801,5757,2127,3666,3271, # 5248
433,1895,2064,2076,5758, 602,2750,5759,5760,5761,5762,5763,3032,1628,3437,5764, # 5264
3197,4802,4156,2904,4803,2519,5765,2551,2782,5766,5767,5768,3343,4804,2905,5769, # 5280
4805,5770,2864,4806,4807,1221,2982,4157,2520,5771,5772,5773,1868,1990,5774,5775, # 5296
5776,1896,5777,5778,4808,1897,4158, 318,5779,2095,4159,4437,5780,5781, 485,5782, # 5312
938,3941, 553,2680, 116,5783,3942,3667,5784,3545,2681,2783,3438,3344,2820,5785, # 5328
3668,2943,4160,1747,2944,2983,5786,5787, 207,5788,4809,5789,4810,2521,5790,3033, # 5344
890,3669,3943,5791,1878,3798,3439,5792,2186,2358,3440,1652,5793,5794,5795, 941, # 5360
2299, 208,3546,4161,2020, 330,4438,3944,2906,2499,3799,4439,4811,5796,5797,5798, # 5376
)
pip/_vendor/chardet/euctwprober.py 0000644 00000003323 14751155147 0013330 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .mbcharsetprober import MultiByteCharSetProber
from .codingstatemachine import CodingStateMachine
from .chardistribution import EUCTWDistributionAnalysis
from .mbcssm import EUCTW_SM_MODEL
class EUCTWProber(MultiByteCharSetProber):
def __init__(self):
super(EUCTWProber, self).__init__()
self.coding_sm = CodingStateMachine(EUCTW_SM_MODEL)
self.distribution_analyzer = EUCTWDistributionAnalysis()
self.reset()
@property
def charset_name(self):
return "EUC-TW"
@property
def language(self):
return "Taiwan"
pip/_vendor/chardet/universaldetector.py 0000644 00000030305 14751155147 0014531 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
"""
Module containing the UniversalDetector detector class, which is the primary
class a user of ``chardet`` should use.
:author: Mark Pilgrim (initial port to Python)
:author: Shy Shalom (original C code)
:author: Dan Blanchard (major refactoring for 3.0)
:author: Ian Cordasco
"""
import codecs
import logging
import re
from .charsetgroupprober import CharSetGroupProber
from .enums import InputState, LanguageFilter, ProbingState
from .escprober import EscCharSetProber
from .latin1prober import Latin1Prober
from .mbcsgroupprober import MBCSGroupProber
from .sbcsgroupprober import SBCSGroupProber
class UniversalDetector(object):
"""
The ``UniversalDetector`` class underlies the ``chardet.detect`` function
and coordinates all of the different charset probers.
To get a ``dict`` containing an encoding and its confidence, you can simply
run:
.. code::
u = UniversalDetector()
u.feed(some_bytes)
u.close()
detected = u.result
"""
MINIMUM_THRESHOLD = 0.20
HIGH_BYTE_DETECTOR = re.compile(b'[\x80-\xFF]')
ESC_DETECTOR = re.compile(b'(\033|~{)')
WIN_BYTE_DETECTOR = re.compile(b'[\x80-\x9F]')
ISO_WIN_MAP = {'iso-8859-1': 'Windows-1252',
'iso-8859-2': 'Windows-1250',
'iso-8859-5': 'Windows-1251',
'iso-8859-6': 'Windows-1256',
'iso-8859-7': 'Windows-1253',
'iso-8859-8': 'Windows-1255',
'iso-8859-9': 'Windows-1254',
'iso-8859-13': 'Windows-1257'}
def __init__(self, lang_filter=LanguageFilter.ALL):
self._esc_charset_prober = None
self._charset_probers = []
self.result = None
self.done = None
self._got_data = None
self._input_state = None
self._last_char = None
self.lang_filter = lang_filter
self.logger = logging.getLogger(__name__)
self._has_win_bytes = None
self.reset()
def reset(self):
"""
Reset the UniversalDetector and all of its probers back to their
initial states. This is called by ``__init__``, so you only need to
call this directly in between analyses of different documents.
"""
self.result = {'encoding': None, 'confidence': 0.0, 'language': None}
self.done = False
self._got_data = False
self._has_win_bytes = False
self._input_state = InputState.PURE_ASCII
self._last_char = b''
if self._esc_charset_prober:
self._esc_charset_prober.reset()
for prober in self._charset_probers:
prober.reset()
def feed(self, byte_str):
"""
Takes a chunk of a document and feeds it through all of the relevant
charset probers.
After calling ``feed``, you can check the value of the ``done``
attribute to see if you need to continue feeding the
``UniversalDetector`` more data, or if it has made a prediction
(in the ``result`` attribute).
.. note::
You should always call ``close`` when you're done feeding in your
document if ``done`` is not already ``True``.
"""
if self.done:
return
if not len(byte_str):
return
if not isinstance(byte_str, bytearray):
byte_str = bytearray(byte_str)
# First check for known BOMs, since these are guaranteed to be correct
if not self._got_data:
# If the data starts with BOM, we know it is UTF
if byte_str.startswith(codecs.BOM_UTF8):
# EF BB BF UTF-8 with BOM
self.result = {'encoding': "UTF-8-SIG",
'confidence': 1.0,
'language': ''}
elif byte_str.startswith((codecs.BOM_UTF32_LE,
codecs.BOM_UTF32_BE)):
# FF FE 00 00 UTF-32, little-endian BOM
# 00 00 FE FF UTF-32, big-endian BOM
self.result = {'encoding': "UTF-32",
'confidence': 1.0,
'language': ''}
elif byte_str.startswith(b'\xFE\xFF\x00\x00'):
# FE FF 00 00 UCS-4, unusual octet order BOM (3412)
self.result = {'encoding': "X-ISO-10646-UCS-4-3412",
'confidence': 1.0,
'language': ''}
elif byte_str.startswith(b'\x00\x00\xFF\xFE'):
# 00 00 FF FE UCS-4, unusual octet order BOM (2143)
self.result = {'encoding': "X-ISO-10646-UCS-4-2143",
'confidence': 1.0,
'language': ''}
elif byte_str.startswith((codecs.BOM_LE, codecs.BOM_BE)):
# FF FE UTF-16, little endian BOM
# FE FF UTF-16, big endian BOM
self.result = {'encoding': "UTF-16",
'confidence': 1.0,
'language': ''}
self._got_data = True
if self.result['encoding'] is not None:
self.done = True
return
# If none of those matched and we've only see ASCII so far, check
# for high bytes and escape sequences
if self._input_state == InputState.PURE_ASCII:
if self.HIGH_BYTE_DETECTOR.search(byte_str):
self._input_state = InputState.HIGH_BYTE
elif self._input_state == InputState.PURE_ASCII and \
self.ESC_DETECTOR.search(self._last_char + byte_str):
self._input_state = InputState.ESC_ASCII
self._last_char = byte_str[-1:]
# If we've seen escape sequences, use the EscCharSetProber, which
# uses a simple state machine to check for known escape sequences in
# HZ and ISO-2022 encodings, since those are the only encodings that
# use such sequences.
if self._input_state == InputState.ESC_ASCII:
if not self._esc_charset_prober:
self._esc_charset_prober = EscCharSetProber(self.lang_filter)
if self._esc_charset_prober.feed(byte_str) == ProbingState.FOUND_IT:
self.result = {'encoding':
self._esc_charset_prober.charset_name,
'confidence':
self._esc_charset_prober.get_confidence(),
'language':
self._esc_charset_prober.language}
self.done = True
# If we've seen high bytes (i.e., those with values greater than 127),
# we need to do more complicated checks using all our multi-byte and
# single-byte probers that are left. The single-byte probers
# use character bigram distributions to determine the encoding, whereas
# the multi-byte probers use a combination of character unigram and
# bigram distributions.
elif self._input_state == InputState.HIGH_BYTE:
if not self._charset_probers:
self._charset_probers = [MBCSGroupProber(self.lang_filter)]
# If we're checking non-CJK encodings, use single-byte prober
if self.lang_filter & LanguageFilter.NON_CJK:
self._charset_probers.append(SBCSGroupProber())
self._charset_probers.append(Latin1Prober())
for prober in self._charset_probers:
if prober.feed(byte_str) == ProbingState.FOUND_IT:
self.result = {'encoding': prober.charset_name,
'confidence': prober.get_confidence(),
'language': prober.language}
self.done = True
break
if self.WIN_BYTE_DETECTOR.search(byte_str):
self._has_win_bytes = True
def close(self):
"""
Stop analyzing the current document and come up with a final
prediction.
:returns: The ``result`` attribute, a ``dict`` with the keys
`encoding`, `confidence`, and `language`.
"""
# Don't bother with checks if we're already done
if self.done:
return self.result
self.done = True
if not self._got_data:
self.logger.debug('no data received!')
# Default to ASCII if it is all we've seen so far
elif self._input_state == InputState.PURE_ASCII:
self.result = {'encoding': 'ascii',
'confidence': 1.0,
'language': ''}
# If we have seen non-ASCII, return the best that met MINIMUM_THRESHOLD
elif self._input_state == InputState.HIGH_BYTE:
prober_confidence = None
max_prober_confidence = 0.0
max_prober = None
for prober in self._charset_probers:
if not prober:
continue
prober_confidence = prober.get_confidence()
if prober_confidence > max_prober_confidence:
max_prober_confidence = prober_confidence
max_prober = prober
if max_prober and (max_prober_confidence > self.MINIMUM_THRESHOLD):
charset_name = max_prober.charset_name
lower_charset_name = max_prober.charset_name.lower()
confidence = max_prober.get_confidence()
# Use Windows encoding name instead of ISO-8859 if we saw any
# extra Windows-specific bytes
if lower_charset_name.startswith('iso-8859'):
if self._has_win_bytes:
charset_name = self.ISO_WIN_MAP.get(lower_charset_name,
charset_name)
self.result = {'encoding': charset_name,
'confidence': confidence,
'language': max_prober.language}
# Log all prober confidences if none met MINIMUM_THRESHOLD
if self.logger.getEffectiveLevel() == logging.DEBUG:
if self.result['encoding'] is None:
self.logger.debug('no probers hit minimum threshold')
for group_prober in self._charset_probers:
if not group_prober:
continue
if isinstance(group_prober, CharSetGroupProber):
for prober in group_prober.probers:
self.logger.debug('%s %s confidence = %s',
prober.charset_name,
prober.language,
prober.get_confidence())
else:
self.logger.debug('%s %s confidence = %s',
prober.charset_name,
prober.language,
prober.get_confidence())
return self.result
pip/_vendor/chardet/langcyrillicmodel.py 0000644 00000043034 14751155147 0014467 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# KOI8-R language model
# Character Mapping Table:
KOI8R_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154, # 40
155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253, # 50
253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69, # 60
67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253, # 70
191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206, # 80
207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222, # 90
223,224,225, 68,226,227,228,229,230,231,232,233,234,235,236,237, # a0
238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253, # b0
27, 3, 21, 28, 13, 2, 39, 19, 26, 4, 23, 11, 8, 12, 5, 1, # c0
15, 16, 9, 7, 6, 14, 24, 10, 17, 18, 20, 25, 30, 29, 22, 54, # d0
59, 37, 44, 58, 41, 48, 53, 46, 55, 42, 60, 36, 49, 38, 31, 34, # e0
35, 43, 45, 32, 40, 52, 56, 33, 61, 62, 51, 57, 47, 63, 50, 70, # f0
)
win1251_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154, # 40
155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253, # 50
253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69, # 60
67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253, # 70
191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
239,240,241,242,243,244,245,246, 68,247,248,249,250,251,252,253,
37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
3, 21, 10, 19, 13, 2, 24, 20, 4, 23, 11, 8, 12, 5, 1, 15,
9, 7, 6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27, 16,
)
latin5_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154, # 40
155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253, # 50
253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69, # 60
67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253, # 70
191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
3, 21, 10, 19, 13, 2, 24, 20, 4, 23, 11, 8, 12, 5, 1, 15,
9, 7, 6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27, 16,
239, 68,240,241,242,243,244,245,246,247,248,249,250,251,252,255,
)
macCyrillic_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154, # 40
155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253, # 50
253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69, # 60
67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253, # 70
37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
239,240,241,242,243,244,245,246,247,248,249,250,251,252, 68, 16,
3, 21, 10, 19, 13, 2, 24, 20, 4, 23, 11, 8, 12, 5, 1, 15,
9, 7, 6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27,255,
)
IBM855_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154, # 40
155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253, # 50
253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69, # 60
67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253, # 70
191,192,193,194, 68,195,196,197,198,199,200,201,202,203,204,205,
206,207,208,209,210,211,212,213,214,215,216,217, 27, 59, 54, 70,
3, 37, 21, 44, 28, 58, 13, 41, 2, 48, 39, 53, 19, 46,218,219,
220,221,222,223,224, 26, 55, 4, 42,225,226,227,228, 23, 60,229,
230,231,232,233,234,235, 11, 36,236,237,238,239,240,241,242,243,
8, 49, 12, 38, 5, 31, 1, 34, 15,244,245,246,247, 35, 16,248,
43, 9, 45, 7, 32, 6, 40, 14, 52, 24, 56, 10, 33, 17, 61,249,
250, 18, 62, 20, 51, 25, 57, 30, 47, 29, 63, 22, 50,251,252,255,
)
IBM866_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154, # 40
155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253, # 50
253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69, # 60
67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253, # 70
37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
3, 21, 10, 19, 13, 2, 24, 20, 4, 23, 11, 8, 12, 5, 1, 15,
191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
9, 7, 6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27, 16,
239, 68,240,241,242,243,244,245,246,247,248,249,250,251,252,255,
)
# Model Table:
# total sequences: 100%
# first 512 sequences: 97.6601%
# first 1024 sequences: 2.3389%
# rest sequences: 0.1237%
# negative sequences: 0.0009%
RussianLangModel = (
0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,1,3,3,3,3,1,3,3,3,2,3,2,3,3,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,3,2,2,2,2,2,0,0,2,
3,3,3,2,3,3,3,3,3,3,3,3,3,3,2,3,3,0,0,3,3,3,3,3,3,3,3,3,2,3,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,2,2,3,3,3,3,3,3,3,3,3,2,3,3,0,0,3,3,3,3,3,3,3,3,2,3,3,1,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,0,0,3,3,3,3,3,3,3,3,3,3,3,2,1,
0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,0,0,3,3,3,3,3,3,3,3,3,3,3,2,1,
0,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,2,2,2,3,1,3,3,1,3,3,3,3,2,2,3,0,2,2,2,3,3,2,1,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,3,3,3,3,3,2,2,3,2,3,3,3,2,1,2,2,0,1,2,2,2,2,2,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,3,0,2,2,3,3,2,1,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,3,3,1,2,3,2,2,3,2,3,3,3,3,2,2,3,0,3,2,2,3,1,1,1,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,2,3,3,3,3,2,2,2,0,3,3,3,2,2,2,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,2,3,2,3,3,3,3,3,3,2,3,2,2,0,1,3,2,1,2,2,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,2,1,1,3,0,1,1,1,1,2,1,1,0,2,2,2,1,2,0,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,3,3,2,2,2,2,1,3,2,3,2,3,2,1,2,2,0,1,1,2,1,2,1,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,3,2,2,3,2,3,3,3,2,2,2,2,0,2,2,2,2,3,1,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
3,2,3,2,2,3,3,3,3,3,3,3,3,3,1,3,2,0,0,3,3,3,3,2,3,3,3,3,2,3,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,3,3,3,3,2,2,3,3,0,2,1,0,3,2,3,2,3,0,0,1,2,0,0,1,0,1,2,1,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,3,0,2,3,3,3,3,2,3,3,3,3,1,2,2,0,0,2,3,2,2,2,3,2,3,2,2,3,0,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,2,3,0,2,3,2,3,0,1,2,3,3,2,0,2,3,0,0,2,3,2,2,0,1,3,1,3,2,2,1,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,3,0,2,3,3,3,3,3,3,3,3,2,1,3,2,0,0,2,2,3,3,3,2,3,3,0,2,2,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,2,3,3,2,2,2,3,3,0,0,1,1,1,1,1,2,0,0,1,1,1,1,0,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,2,3,3,3,3,3,3,3,0,3,2,3,3,2,3,2,0,2,1,0,1,1,0,1,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,3,3,3,2,2,2,2,3,1,3,2,3,1,1,2,1,0,2,2,2,2,1,3,1,0,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
2,2,3,3,3,3,3,1,2,2,1,3,1,0,3,0,0,3,0,0,0,1,1,0,1,2,1,0,0,0,0,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,2,2,1,1,3,3,3,2,2,1,2,2,3,1,1,2,0,0,2,2,1,3,0,0,2,1,1,2,1,1,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,2,3,3,3,3,1,2,2,2,1,2,1,3,3,1,1,2,1,2,1,2,2,0,2,0,0,1,1,0,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,3,3,3,3,2,1,3,2,2,3,2,0,3,2,0,3,0,1,0,1,1,0,0,1,1,1,1,0,1,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,2,3,3,3,2,2,2,3,3,1,2,1,2,1,0,1,0,1,1,0,1,0,0,2,1,1,1,0,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
3,1,1,2,1,2,3,3,2,2,1,2,2,3,0,2,1,0,0,2,2,3,2,1,2,2,2,2,2,3,1,0,
0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,1,1,0,1,1,2,2,1,1,3,0,0,1,3,1,1,1,0,0,0,1,0,1,1,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,1,3,3,3,2,0,0,0,2,1,0,1,0,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,1,0,0,2,3,2,2,2,1,2,2,2,1,2,1,0,0,1,1,1,0,2,0,1,1,1,0,0,1,1,
1,0,0,0,0,0,1,2,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
2,3,3,3,3,0,0,0,0,1,0,0,0,0,3,0,1,2,1,0,0,0,0,0,0,0,1,1,0,0,1,1,
1,0,1,0,1,2,0,0,1,1,2,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,1,0,0,1,1,0,
2,2,3,2,2,2,3,1,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,0,1,0,1,1,1,0,2,1,
1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,1,1,0,1,1,0,
3,3,3,2,2,2,2,3,2,2,1,1,2,2,2,2,1,1,3,1,2,1,2,0,0,1,1,0,1,0,2,1,
1,1,1,1,1,2,1,0,1,1,1,1,0,1,0,0,1,1,0,0,1,0,1,0,0,1,0,0,0,1,1,0,
2,0,0,1,0,3,2,2,2,2,1,2,1,2,1,2,0,0,0,2,1,2,2,1,1,2,2,0,1,1,0,2,
1,1,1,1,1,0,1,1,1,2,1,1,1,2,1,0,1,2,1,1,1,1,0,1,1,1,0,0,1,0,0,1,
1,3,2,2,2,1,1,1,2,3,0,0,0,0,2,0,2,2,1,0,0,0,0,0,0,1,0,0,0,0,1,1,
1,0,1,1,0,1,0,1,1,0,1,1,0,2,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,1,1,0,
2,3,2,3,2,1,2,2,2,2,1,0,0,0,2,0,0,1,1,0,0,0,0,0,0,0,1,1,0,0,2,1,
1,1,2,1,0,2,0,0,1,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0,0,0,1,0,0,0,0,0,
3,0,0,1,0,2,2,2,3,2,2,2,2,2,2,2,0,0,0,2,1,2,1,1,1,2,2,0,0,0,1,2,
1,1,1,1,1,0,1,2,1,1,1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,1,1,0,0,1,
2,3,2,3,3,2,0,1,1,1,0,0,1,0,2,0,1,1,3,1,0,0,0,0,0,0,0,1,0,0,2,1,
1,1,1,1,1,1,1,0,1,0,1,1,1,1,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,0,1,0,
2,3,3,3,3,1,2,2,2,2,0,1,1,0,2,1,1,1,2,1,0,1,1,0,0,1,0,1,0,0,2,0,
0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,3,3,2,0,0,1,1,2,2,1,0,0,2,0,1,1,3,0,0,1,0,0,0,0,0,1,0,1,2,1,
1,1,2,0,1,1,1,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0,0,0,0,0,1,0,1,1,0,
1,3,2,3,2,1,0,0,2,2,2,0,1,0,2,0,1,1,1,0,1,0,0,0,3,0,1,1,0,0,2,1,
1,1,1,0,1,1,0,0,0,0,1,1,0,1,0,0,2,1,1,0,1,0,0,0,1,0,1,0,0,1,1,0,
3,1,2,1,1,2,2,2,2,2,2,1,2,2,1,1,0,0,0,2,2,2,0,0,0,1,2,1,0,1,0,1,
2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,2,1,1,1,0,1,0,1,1,0,1,1,1,0,0,1,
3,0,0,0,0,2,0,1,1,1,1,1,1,1,0,1,0,0,0,1,1,1,0,1,0,1,1,0,0,1,0,1,
1,1,0,0,1,0,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,0,0,1,0,0,0,1,0,0,0,1,
1,3,3,2,2,0,0,0,2,2,0,0,0,1,2,0,1,1,2,0,0,0,0,0,0,0,0,1,0,0,2,1,
0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,
2,3,2,3,2,0,0,0,0,1,1,0,0,0,2,0,2,0,2,0,0,0,0,0,1,0,0,1,0,0,1,1,
1,1,2,0,1,2,1,0,1,1,2,1,1,1,1,1,2,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,
1,3,2,2,2,1,0,0,2,2,1,0,1,2,2,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,1,1,
0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,1,0,2,3,1,2,2,2,2,2,2,1,1,0,0,0,1,0,1,0,2,1,1,1,0,0,0,0,1,
1,1,0,1,1,0,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
2,0,2,0,0,1,0,3,2,1,2,1,2,2,0,1,0,0,0,2,1,0,0,2,1,1,1,1,0,2,0,2,
2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,0,1,1,1,1,0,0,0,1,1,1,1,0,1,0,0,1,
1,2,2,2,2,1,0,0,1,0,0,0,0,0,2,0,1,1,1,1,0,0,0,0,1,0,1,2,0,0,2,0,
1,0,1,1,1,2,1,0,1,0,1,1,0,0,1,0,1,1,1,0,1,0,0,0,1,0,0,1,0,1,1,0,
2,1,2,2,2,0,3,0,1,1,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
0,0,0,1,1,1,0,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,
1,2,2,3,2,2,0,0,1,1,2,0,1,2,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,
0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,1,1,0,0,1,0,0,0,0,0,0,0,0,1,1,0,
2,2,1,1,2,1,2,2,2,2,2,1,2,2,0,1,0,0,0,1,2,2,2,1,2,1,1,1,1,1,2,1,
1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,0,1,
1,2,2,2,2,0,1,0,2,2,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,
0,0,1,0,0,1,0,0,0,0,1,0,1,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,2,2,2,2,0,0,0,2,2,2,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,
0,1,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,2,2,2,2,0,0,0,0,1,0,0,1,1,2,0,0,0,0,1,0,1,0,0,1,0,0,2,0,0,0,1,
0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
1,2,2,2,1,1,2,0,2,1,1,1,1,0,2,2,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,1,
0,0,1,0,1,1,0,0,0,0,1,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
1,0,2,1,2,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,
0,0,1,0,1,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,
1,0,0,0,0,2,0,1,2,1,0,1,1,1,0,1,0,0,0,1,0,1,0,0,1,0,1,0,0,0,0,1,
0,0,0,0,0,1,0,0,1,1,0,0,1,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,
2,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,1,1,0,1,0,1,0,0,1,1,1,1,0,0,0,1,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,1,0,1,1,0,1,0,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,1,0,1,1,0,1,0,0,0,
0,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
)
Koi8rModel = {
'char_to_order_map': KOI8R_char_to_order_map,
'precedence_matrix': RussianLangModel,
'typical_positive_ratio': 0.976601,
'keep_english_letter': False,
'charset_name': "KOI8-R",
'language': 'Russian',
}
Win1251CyrillicModel = {
'char_to_order_map': win1251_char_to_order_map,
'precedence_matrix': RussianLangModel,
'typical_positive_ratio': 0.976601,
'keep_english_letter': False,
'charset_name': "windows-1251",
'language': 'Russian',
}
Latin5CyrillicModel = {
'char_to_order_map': latin5_char_to_order_map,
'precedence_matrix': RussianLangModel,
'typical_positive_ratio': 0.976601,
'keep_english_letter': False,
'charset_name': "ISO-8859-5",
'language': 'Russian',
}
MacCyrillicModel = {
'char_to_order_map': macCyrillic_char_to_order_map,
'precedence_matrix': RussianLangModel,
'typical_positive_ratio': 0.976601,
'keep_english_letter': False,
'charset_name': "MacCyrillic",
'language': 'Russian',
}
Ibm866Model = {
'char_to_order_map': IBM866_char_to_order_map,
'precedence_matrix': RussianLangModel,
'typical_positive_ratio': 0.976601,
'keep_english_letter': False,
'charset_name': "IBM866",
'language': 'Russian',
}
Ibm855Model = {
'char_to_order_map': IBM855_char_to_order_map,
'precedence_matrix': RussianLangModel,
'typical_positive_ratio': 0.976601,
'keep_english_letter': False,
'charset_name': "IBM855",
'language': 'Russian',
}
pip/_vendor/chardet/big5prober.py 0000644 00000003335 14751155147 0013032 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .mbcharsetprober import MultiByteCharSetProber
from .codingstatemachine import CodingStateMachine
from .chardistribution import Big5DistributionAnalysis
from .mbcssm import BIG5_SM_MODEL
class Big5Prober(MultiByteCharSetProber):
def __init__(self):
super(Big5Prober, self).__init__()
self.coding_sm = CodingStateMachine(BIG5_SM_MODEL)
self.distribution_analyzer = Big5DistributionAnalysis()
self.reset()
@property
def charset_name(self):
return "Big5"
@property
def language(self):
return "Chinese"
pip/_vendor/chardet/gb2312freq.py 0000644 00000050353 14751155147 0012552 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# GB2312 most frequently used character table
#
# Char to FreqOrder table , from hz6763
# 512 --> 0.79 -- 0.79
# 1024 --> 0.92 -- 0.13
# 2048 --> 0.98 -- 0.06
# 6768 --> 1.00 -- 0.02
#
# Ideal Distribution Ratio = 0.79135/(1-0.79135) = 3.79
# Random Distribution Ration = 512 / (3755 - 512) = 0.157
#
# Typical Distribution Ratio about 25% of Ideal one, still much higher that RDR
GB2312_TYPICAL_DISTRIBUTION_RATIO = 0.9
GB2312_TABLE_SIZE = 3760
GB2312_CHAR_TO_FREQ_ORDER = (
1671, 749,1443,2364,3924,3807,2330,3921,1704,3463,2691,1511,1515, 572,3191,2205,
2361, 224,2558, 479,1711, 963,3162, 440,4060,1905,2966,2947,3580,2647,3961,3842,
2204, 869,4207, 970,2678,5626,2944,2956,1479,4048, 514,3595, 588,1346,2820,3409,
249,4088,1746,1873,2047,1774, 581,1813, 358,1174,3590,1014,1561,4844,2245, 670,
1636,3112, 889,1286, 953, 556,2327,3060,1290,3141, 613, 185,3477,1367, 850,3820,
1715,2428,2642,2303,2732,3041,2562,2648,3566,3946,1349, 388,3098,2091,1360,3585,
152,1687,1539, 738,1559, 59,1232,2925,2267,1388,1249,1741,1679,2960, 151,1566,
1125,1352,4271, 924,4296, 385,3166,4459, 310,1245,2850, 70,3285,2729,3534,3575,
2398,3298,3466,1960,2265, 217,3647, 864,1909,2084,4401,2773,1010,3269,5152, 853,
3051,3121,1244,4251,1895, 364,1499,1540,2313,1180,3655,2268, 562, 715,2417,3061,
544, 336,3768,2380,1752,4075, 950, 280,2425,4382, 183,2759,3272, 333,4297,2155,
1688,2356,1444,1039,4540, 736,1177,3349,2443,2368,2144,2225, 565, 196,1482,3406,
927,1335,4147, 692, 878,1311,1653,3911,3622,1378,4200,1840,2969,3149,2126,1816,
2534,1546,2393,2760, 737,2494, 13, 447, 245,2747, 38,2765,2129,2589,1079, 606,
360, 471,3755,2890, 404, 848, 699,1785,1236, 370,2221,1023,3746,2074,2026,2023,
2388,1581,2119, 812,1141,3091,2536,1519, 804,2053, 406,1596,1090, 784, 548,4414,
1806,2264,2936,1100, 343,4114,5096, 622,3358, 743,3668,1510,1626,5020,3567,2513,
3195,4115,5627,2489,2991, 24,2065,2697,1087,2719, 48,1634, 315, 68, 985,2052,
198,2239,1347,1107,1439, 597,2366,2172, 871,3307, 919,2487,2790,1867, 236,2570,
1413,3794, 906,3365,3381,1701,1982,1818,1524,2924,1205, 616,2586,2072,2004, 575,
253,3099, 32,1365,1182, 197,1714,2454,1201, 554,3388,3224,2748, 756,2587, 250,
2567,1507,1517,3529,1922,2761,2337,3416,1961,1677,2452,2238,3153, 615, 911,1506,
1474,2495,1265,1906,2749,3756,3280,2161, 898,2714,1759,3450,2243,2444, 563, 26,
3286,2266,3769,3344,2707,3677, 611,1402, 531,1028,2871,4548,1375, 261,2948, 835,
1190,4134, 353, 840,2684,1900,3082,1435,2109,1207,1674, 329,1872,2781,4055,2686,
2104, 608,3318,2423,2957,2768,1108,3739,3512,3271,3985,2203,1771,3520,1418,2054,
1681,1153, 225,1627,2929, 162,2050,2511,3687,1954, 124,1859,2431,1684,3032,2894,
585,4805,3969,2869,2704,2088,2032,2095,3656,2635,4362,2209, 256, 518,2042,2105,
3777,3657, 643,2298,1148,1779, 190, 989,3544, 414, 11,2135,2063,2979,1471, 403,
3678, 126, 770,1563, 671,2499,3216,2877, 600,1179, 307,2805,4937,1268,1297,2694,
252,4032,1448,1494,1331,1394, 127,2256, 222,1647,1035,1481,3056,1915,1048, 873,
3651, 210, 33,1608,2516, 200,1520, 415, 102, 0,3389,1287, 817, 91,3299,2940,
836,1814, 549,2197,1396,1669,2987,3582,2297,2848,4528,1070, 687, 20,1819, 121,
1552,1364,1461,1968,2617,3540,2824,2083, 177, 948,4938,2291, 110,4549,2066, 648,
3359,1755,2110,2114,4642,4845,1693,3937,3308,1257,1869,2123, 208,1804,3159,2992,
2531,2549,3361,2418,1350,2347,2800,2568,1291,2036,2680, 72, 842,1990, 212,1233,
1154,1586, 75,2027,3410,4900,1823,1337,2710,2676, 728,2810,1522,3026,4995, 157,
755,1050,4022, 710, 785,1936,2194,2085,1406,2777,2400, 150,1250,4049,1206, 807,
1910, 534, 529,3309,1721,1660, 274, 39,2827, 661,2670,1578, 925,3248,3815,1094,
4278,4901,4252, 41,1150,3747,2572,2227,4501,3658,4902,3813,3357,3617,2884,2258,
887, 538,4187,3199,1294,2439,3042,2329,2343,2497,1255, 107, 543,1527, 521,3478,
3568, 194,5062, 15, 961,3870,1241,1192,2664, 66,5215,3260,2111,1295,1127,2152,
3805,4135, 901,1164,1976, 398,1278, 530,1460, 748, 904,1054,1966,1426, 53,2909,
509, 523,2279,1534, 536,1019, 239,1685, 460,2353, 673,1065,2401,3600,4298,2272,
1272,2363, 284,1753,3679,4064,1695, 81, 815,2677,2757,2731,1386, 859, 500,4221,
2190,2566, 757,1006,2519,2068,1166,1455, 337,2654,3203,1863,1682,1914,3025,1252,
1409,1366, 847, 714,2834,2038,3209, 964,2970,1901, 885,2553,1078,1756,3049, 301,
1572,3326, 688,2130,1996,2429,1805,1648,2930,3421,2750,3652,3088, 262,1158,1254,
389,1641,1812, 526,1719, 923,2073,1073,1902, 468, 489,4625,1140, 857,2375,3070,
3319,2863, 380, 116,1328,2693,1161,2244, 273,1212,1884,2769,3011,1775,1142, 461,
3066,1200,2147,2212, 790, 702,2695,4222,1601,1058, 434,2338,5153,3640, 67,2360,
4099,2502, 618,3472,1329, 416,1132, 830,2782,1807,2653,3211,3510,1662, 192,2124,
296,3979,1739,1611,3684, 23, 118, 324, 446,1239,1225, 293,2520,3814,3795,2535,
3116, 17,1074, 467,2692,2201, 387,2922, 45,1326,3055,1645,3659,2817, 958, 243,
1903,2320,1339,2825,1784,3289, 356, 576, 865,2315,2381,3377,3916,1088,3122,1713,
1655, 935, 628,4689,1034,1327, 441, 800, 720, 894,1979,2183,1528,5289,2702,1071,
4046,3572,2399,1571,3281, 79, 761,1103, 327, 134, 758,1899,1371,1615, 879, 442,
215,2605,2579, 173,2048,2485,1057,2975,3317,1097,2253,3801,4263,1403,1650,2946,
814,4968,3487,1548,2644,1567,1285, 2, 295,2636, 97, 946,3576, 832, 141,4257,
3273, 760,3821,3521,3156,2607, 949,1024,1733,1516,1803,1920,2125,2283,2665,3180,
1501,2064,3560,2171,1592, 803,3518,1416, 732,3897,4258,1363,1362,2458, 119,1427,
602,1525,2608,1605,1639,3175, 694,3064, 10, 465, 76,2000,4846,4208, 444,3781,
1619,3353,2206,1273,3796, 740,2483, 320,1723,2377,3660,2619,1359,1137,1762,1724,
2345,2842,1850,1862, 912, 821,1866, 612,2625,1735,2573,3369,1093, 844, 89, 937,
930,1424,3564,2413,2972,1004,3046,3019,2011, 711,3171,1452,4178, 428, 801,1943,
432, 445,2811, 206,4136,1472, 730, 349, 73, 397,2802,2547, 998,1637,1167, 789,
396,3217, 154,1218, 716,1120,1780,2819,4826,1931,3334,3762,2139,1215,2627, 552,
3664,3628,3232,1405,2383,3111,1356,2652,3577,3320,3101,1703, 640,1045,1370,1246,
4996, 371,1575,2436,1621,2210, 984,4033,1734,2638, 16,4529, 663,2755,3255,1451,
3917,2257,1253,1955,2234,1263,2951, 214,1229, 617, 485, 359,1831,1969, 473,2310,
750,2058, 165, 80,2864,2419, 361,4344,2416,2479,1134, 796,3726,1266,2943, 860,
2715, 938, 390,2734,1313,1384, 248, 202, 877,1064,2854, 522,3907, 279,1602, 297,
2357, 395,3740, 137,2075, 944,4089,2584,1267,3802, 62,1533,2285, 178, 176, 780,
2440, 201,3707, 590, 478,1560,4354,2117,1075, 30, 74,4643,4004,1635,1441,2745,
776,2596, 238,1077,1692,1912,2844, 605, 499,1742,3947, 241,3053, 980,1749, 936,
2640,4511,2582, 515,1543,2162,5322,2892,2993, 890,2148,1924, 665,1827,3581,1032,
968,3163, 339,1044,1896, 270, 583,1791,1720,4367,1194,3488,3669, 43,2523,1657,
163,2167, 290,1209,1622,3378, 550, 634,2508,2510, 695,2634,2384,2512,1476,1414,
220,1469,2341,2138,2852,3183,2900,4939,2865,3502,1211,3680, 854,3227,1299,2976,
3172, 186,2998,1459, 443,1067,3251,1495, 321,1932,3054, 909, 753,1410,1828, 436,
2441,1119,1587,3164,2186,1258, 227, 231,1425,1890,3200,3942, 247, 959, 725,5254,
2741, 577,2158,2079, 929, 120, 174, 838,2813, 591,1115, 417,2024, 40,3240,1536,
1037, 291,4151,2354, 632,1298,2406,2500,3535,1825,1846,3451, 205,1171, 345,4238,
18,1163, 811, 685,2208,1217, 425,1312,1508,1175,4308,2552,1033, 587,1381,3059,
2984,3482, 340,1316,4023,3972, 792,3176, 519, 777,4690, 918, 933,4130,2981,3741,
90,3360,2911,2200,5184,4550, 609,3079,2030, 272,3379,2736, 363,3881,1130,1447,
286, 779, 357,1169,3350,3137,1630,1220,2687,2391, 747,1277,3688,2618,2682,2601,
1156,3196,5290,4034,3102,1689,3596,3128, 874, 219,2783, 798, 508,1843,2461, 269,
1658,1776,1392,1913,2983,3287,2866,2159,2372, 829,4076, 46,4253,2873,1889,1894,
915,1834,1631,2181,2318, 298, 664,2818,3555,2735, 954,3228,3117, 527,3511,2173,
681,2712,3033,2247,2346,3467,1652, 155,2164,3382, 113,1994, 450, 899, 494, 994,
1237,2958,1875,2336,1926,3727, 545,1577,1550, 633,3473, 204,1305,3072,2410,1956,
2471, 707,2134, 841,2195,2196,2663,3843,1026,4940, 990,3252,4997, 368,1092, 437,
3212,3258,1933,1829, 675,2977,2893, 412, 943,3723,4644,3294,3283,2230,2373,5154,
2389,2241,2661,2323,1404,2524, 593, 787, 677,3008,1275,2059, 438,2709,2609,2240,
2269,2246,1446, 36,1568,1373,3892,1574,2301,1456,3962, 693,2276,5216,2035,1143,
2720,1919,1797,1811,2763,4137,2597,1830,1699,1488,1198,2090, 424,1694, 312,3634,
3390,4179,3335,2252,1214, 561,1059,3243,2295,2561, 975,5155,2321,2751,3772, 472,
1537,3282,3398,1047,2077,2348,2878,1323,3340,3076, 690,2906, 51, 369, 170,3541,
1060,2187,2688,3670,2541,1083,1683, 928,3918, 459, 109,4427, 599,3744,4286, 143,
2101,2730,2490, 82,1588,3036,2121, 281,1860, 477,4035,1238,2812,3020,2716,3312,
1530,2188,2055,1317, 843, 636,1808,1173,3495, 649, 181,1002, 147,3641,1159,2414,
3750,2289,2795, 813,3123,2610,1136,4368, 5,3391,4541,2174, 420, 429,1728, 754,
1228,2115,2219, 347,2223,2733, 735,1518,3003,2355,3134,1764,3948,3329,1888,2424,
1001,1234,1972,3321,3363,1672,1021,1450,1584, 226, 765, 655,2526,3404,3244,2302,
3665, 731, 594,2184, 319,1576, 621, 658,2656,4299,2099,3864,1279,2071,2598,2739,
795,3086,3699,3908,1707,2352,2402,1382,3136,2475,1465,4847,3496,3865,1085,3004,
2591,1084, 213,2287,1963,3565,2250, 822, 793,4574,3187,1772,1789,3050, 595,1484,
1959,2770,1080,2650, 456, 422,2996, 940,3322,4328,4345,3092,2742, 965,2784, 739,
4124, 952,1358,2498,2949,2565, 332,2698,2378, 660,2260,2473,4194,3856,2919, 535,
1260,2651,1208,1428,1300,1949,1303,2942, 433,2455,2450,1251,1946, 614,1269, 641,
1306,1810,2737,3078,2912, 564,2365,1419,1415,1497,4460,2367,2185,1379,3005,1307,
3218,2175,1897,3063, 682,1157,4040,4005,1712,1160,1941,1399, 394, 402,2952,1573,
1151,2986,2404, 862, 299,2033,1489,3006, 346, 171,2886,3401,1726,2932, 168,2533,
47,2507,1030,3735,1145,3370,1395,1318,1579,3609,4560,2857,4116,1457,2529,1965,
504,1036,2690,2988,2405, 745,5871, 849,2397,2056,3081, 863,2359,3857,2096, 99,
1397,1769,2300,4428,1643,3455,1978,1757,3718,1440, 35,4879,3742,1296,4228,2280,
160,5063,1599,2013, 166, 520,3479,1646,3345,3012, 490,1937,1545,1264,2182,2505,
1096,1188,1369,1436,2421,1667,2792,2460,1270,2122, 727,3167,2143, 806,1706,1012,
1800,3037, 960,2218,1882, 805, 139,2456,1139,1521, 851,1052,3093,3089, 342,2039,
744,5097,1468,1502,1585,2087, 223, 939, 326,2140,2577, 892,2481,1623,4077, 982,
3708, 135,2131, 87,2503,3114,2326,1106, 876,1616, 547,2997,2831,2093,3441,4530,
4314, 9,3256,4229,4148, 659,1462,1986,1710,2046,2913,2231,4090,4880,5255,3392,
3274,1368,3689,4645,1477, 705,3384,3635,1068,1529,2941,1458,3782,1509, 100,1656,
2548, 718,2339, 408,1590,2780,3548,1838,4117,3719,1345,3530, 717,3442,2778,3220,
2898,1892,4590,3614,3371,2043,1998,1224,3483, 891, 635, 584,2559,3355, 733,1766,
1729,1172,3789,1891,2307, 781,2982,2271,1957,1580,5773,2633,2005,4195,3097,1535,
3213,1189,1934,5693,3262, 586,3118,1324,1598, 517,1564,2217,1868,1893,4445,3728,
2703,3139,1526,1787,1992,3882,2875,1549,1199,1056,2224,1904,2711,5098,4287, 338,
1993,3129,3489,2689,1809,2815,1997, 957,1855,3898,2550,3275,3057,1105,1319, 627,
1505,1911,1883,3526, 698,3629,3456,1833,1431, 746, 77,1261,2017,2296,1977,1885,
125,1334,1600, 525,1798,1109,2222,1470,1945, 559,2236,1186,3443,2476,1929,1411,
2411,3135,1777,3372,2621,1841,1613,3229, 668,1430,1839,2643,2916, 195,1989,2671,
2358,1387, 629,3205,2293,5256,4439, 123,1310, 888,1879,4300,3021,3605,1003,1162,
3192,2910,2010, 140,2395,2859, 55,1082,2012,2901, 662, 419,2081,1438, 680,2774,
4654,3912,1620,1731,1625,5035,4065,2328, 512,1344, 802,5443,2163,2311,2537, 524,
3399, 98,1155,2103,1918,2606,3925,2816,1393,2465,1504,3773,2177,3963,1478,4346,
180,1113,4655,3461,2028,1698, 833,2696,1235,1322,1594,4408,3623,3013,3225,2040,
3022, 541,2881, 607,3632,2029,1665,1219, 639,1385,1686,1099,2803,3231,1938,3188,
2858, 427, 676,2772,1168,2025, 454,3253,2486,3556, 230,1950, 580, 791,1991,1280,
1086,1974,2034, 630, 257,3338,2788,4903,1017, 86,4790, 966,2789,1995,1696,1131,
259,3095,4188,1308, 179,1463,5257, 289,4107,1248, 42,3413,1725,2288, 896,1947,
774,4474,4254, 604,3430,4264, 392,2514,2588, 452, 237,1408,3018, 988,4531,1970,
3034,3310, 540,2370,1562,1288,2990, 502,4765,1147, 4,1853,2708, 207, 294,2814,
4078,2902,2509, 684, 34,3105,3532,2551, 644, 709,2801,2344, 573,1727,3573,3557,
2021,1081,3100,4315,2100,3681, 199,2263,1837,2385, 146,3484,1195,2776,3949, 997,
1939,3973,1008,1091,1202,1962,1847,1149,4209,5444,1076, 493, 117,5400,2521, 972,
1490,2934,1796,4542,2374,1512,2933,2657, 413,2888,1135,2762,2314,2156,1355,2369,
766,2007,2527,2170,3124,2491,2593,2632,4757,2437, 234,3125,3591,1898,1750,1376,
1942,3468,3138, 570,2127,2145,3276,4131, 962, 132,1445,4196, 19, 941,3624,3480,
3366,1973,1374,4461,3431,2629, 283,2415,2275, 808,2887,3620,2112,2563,1353,3610,
955,1089,3103,1053, 96, 88,4097, 823,3808,1583, 399, 292,4091,3313, 421,1128,
642,4006, 903,2539,1877,2082, 596, 29,4066,1790, 722,2157, 130, 995,1569, 769,
1485, 464, 513,2213, 288,1923,1101,2453,4316, 133, 486,2445, 50, 625, 487,2207,
57, 423, 481,2962, 159,3729,1558, 491, 303, 482, 501, 240,2837, 112,3648,2392,
1783, 362, 8,3433,3422, 610,2793,3277,1390,1284,1654, 21,3823, 734, 367, 623,
193, 287, 374,1009,1483, 816, 476, 313,2255,2340,1262,2150,2899,1146,2581, 782,
2116,1659,2018,1880, 255,3586,3314,1110,2867,2137,2564, 986,2767,5185,2006, 650,
158, 926, 762, 881,3157,2717,2362,3587, 306,3690,3245,1542,3077,2427,1691,2478,
2118,2985,3490,2438, 539,2305, 983, 129,1754, 355,4201,2386, 827,2923, 104,1773,
2838,2771, 411,2905,3919, 376, 767, 122,1114, 828,2422,1817,3506, 266,3460,1007,
1609,4998, 945,2612,4429,2274, 726,1247,1964,2914,2199,2070,4002,4108, 657,3323,
1422, 579, 455,2764,4737,1222,2895,1670, 824,1223,1487,2525, 558, 861,3080, 598,
2659,2515,1967, 752,2583,2376,2214,4180, 977, 704,2464,4999,2622,4109,1210,2961,
819,1541, 142,2284, 44, 418, 457,1126,3730,4347,4626,1644,1876,3671,1864, 302,
1063,5694, 624, 723,1984,3745,1314,1676,2488,1610,1449,3558,3569,2166,2098, 409,
1011,2325,3704,2306, 818,1732,1383,1824,1844,3757, 999,2705,3497,1216,1423,2683,
2426,2954,2501,2726,2229,1475,2554,5064,1971,1794,1666,2014,1343, 783, 724, 191,
2434,1354,2220,5065,1763,2752,2472,4152, 131, 175,2885,3434, 92,1466,4920,2616,
3871,3872,3866, 128,1551,1632, 669,1854,3682,4691,4125,1230, 188,2973,3290,1302,
1213, 560,3266, 917, 763,3909,3249,1760, 868,1958, 764,1782,2097, 145,2277,3774,
4462, 64,1491,3062, 971,2132,3606,2442, 221,1226,1617, 218, 323,1185,3207,3147,
571, 619,1473,1005,1744,2281, 449,1887,2396,3685, 275, 375,3816,1743,3844,3731,
845,1983,2350,4210,1377, 773, 967,3499,3052,3743,2725,4007,1697,1022,3943,1464,
3264,2855,2722,1952,1029,2839,2467, 84,4383,2215, 820,1391,2015,2448,3672, 377,
1948,2168, 797,2545,3536,2578,2645, 94,2874,1678, 405,1259,3071, 771, 546,1315,
470,1243,3083, 895,2468, 981, 969,2037, 846,4181, 653,1276,2928, 14,2594, 557,
3007,2474, 156, 902,1338,1740,2574, 537,2518, 973,2282,2216,2433,1928, 138,2903,
1293,2631,1612, 646,3457, 839,2935, 111, 496,2191,2847, 589,3186, 149,3994,2060,
4031,2641,4067,3145,1870, 37,3597,2136,1025,2051,3009,3383,3549,1121,1016,3261,
1301, 251,2446,2599,2153, 872,3246, 637, 334,3705, 831, 884, 921,3065,3140,4092,
2198,1944, 246,2964, 108,2045,1152,1921,2308,1031, 203,3173,4170,1907,3890, 810,
1401,2003,1690, 506, 647,1242,2828,1761,1649,3208,2249,1589,3709,2931,5156,1708,
498, 666,2613, 834,3817,1231, 184,2851,1124, 883,3197,2261,3710,1765,1553,2658,
1178,2639,2351, 93,1193, 942,2538,2141,4402, 235,1821, 870,1591,2192,1709,1871,
3341,1618,4126,2595,2334, 603, 651, 69, 701, 268,2662,3411,2555,1380,1606, 503,
448, 254,2371,2646, 574,1187,2309,1770, 322,2235,1292,1801, 305, 566,1133, 229,
2067,2057, 706, 167, 483,2002,2672,3295,1820,3561,3067, 316, 378,2746,3452,1112,
136,1981, 507,1651,2917,1117, 285,4591, 182,2580,3522,1304, 335,3303,1835,2504,
1795,1792,2248, 674,1018,2106,2449,1857,2292,2845, 976,3047,1781,2600,2727,1389,
1281, 52,3152, 153, 265,3950, 672,3485,3951,4463, 430,1183, 365, 278,2169, 27,
1407,1336,2304, 209,1340,1730,2202,1852,2403,2883, 979,1737,1062, 631,2829,2542,
3876,2592, 825,2086,2226,3048,3625, 352,1417,3724, 542, 991, 431,1351,3938,1861,
2294, 826,1361,2927,3142,3503,1738, 463,2462,2723, 582,1916,1595,2808, 400,3845,
3891,2868,3621,2254, 58,2492,1123, 910,2160,2614,1372,1603,1196,1072,3385,1700,
3267,1980, 696, 480,2430, 920, 799,1570,2920,1951,2041,4047,2540,1321,4223,2469,
3562,2228,1271,2602, 401,2833,3351,2575,5157, 907,2312,1256, 410, 263,3507,1582,
996, 678,1849,2316,1480, 908,3545,2237, 703,2322, 667,1826,2849,1531,2604,2999,
2407,3146,2151,2630,1786,3711, 469,3542, 497,3899,2409, 858, 837,4446,3393,1274,
786, 620,1845,2001,3311, 484, 308,3367,1204,1815,3691,2332,1532,2557,1842,2020,
2724,1927,2333,4440, 567, 22,1673,2728,4475,1987,1858,1144,1597, 101,1832,3601,
12, 974,3783,4391, 951,1412, 1,3720, 453,4608,4041, 528,1041,1027,3230,2628,
1129, 875,1051,3291,1203,2262,1069,2860,2799,2149,2615,3278, 144,1758,3040, 31,
475,1680, 366,2685,3184, 311,1642,4008,2466,5036,1593,1493,2809, 216,1420,1668,
233, 304,2128,3284, 232,1429,1768,1040,2008,3407,2740,2967,2543, 242,2133, 778,
1565,2022,2620, 505,2189,2756,1098,2273, 372,1614, 708, 553,2846,2094,2278, 169,
3626,2835,4161, 228,2674,3165, 809,1454,1309, 466,1705,1095, 900,3423, 880,2667,
3751,5258,2317,3109,2571,4317,2766,1503,1342, 866,4447,1118, 63,2076, 314,1881,
1348,1061, 172, 978,3515,1747, 532, 511,3970, 6, 601, 905,2699,3300,1751, 276,
1467,3725,2668, 65,4239,2544,2779,2556,1604, 578,2451,1802, 992,2331,2624,1320,
3446, 713,1513,1013, 103,2786,2447,1661, 886,1702, 916, 654,3574,2031,1556, 751,
2178,2821,2179,1498,1538,2176, 271, 914,2251,2080,1325, 638,1953,2937,3877,2432,
2754, 95,3265,1716, 260,1227,4083, 775, 106,1357,3254, 426,1607, 555,2480, 772,
1985, 244,2546, 474, 495,1046,2611,1851,2061, 71,2089,1675,2590, 742,3758,2843,
3222,1433, 267,2180,2576,2826,2233,2092,3913,2435, 956,1745,3075, 856,2113,1116,
451, 3,1988,2896,1398, 993,2463,1878,2049,1341,2718,2721,2870,2108, 712,2904,
4363,2753,2324, 277,2872,2349,2649, 384, 987, 435, 691,3000, 922, 164,3939, 652,
1500,1184,4153,2482,3373,2165,4848,2335,3775,3508,3154,2806,2830,1554,2102,1664,
2530,1434,2408, 893,1547,2623,3447,2832,2242,2532,3169,2856,3223,2078, 49,3770,
3469, 462, 318, 656,2259,3250,3069, 679,1629,2758, 344,1138,1104,3120,1836,1283,
3115,2154,1437,4448, 934, 759,1999, 794,2862,1038, 533,2560,1722,2342, 855,2626,
1197,1663,4476,3127, 85,4240,2528, 25,1111,1181,3673, 407,3470,4561,2679,2713,
768,1925,2841,3986,1544,1165, 932, 373,1240,2146,1930,2673, 721,4766, 354,4333,
391,2963, 187, 61,3364,1442,1102, 330,1940,1767, 341,3809,4118, 393,2496,2062,
2211, 105, 331, 300, 439, 913,1332, 626, 379,3304,1557, 328, 689,3952, 309,1555,
931, 317,2517,3027, 325, 569, 686,2107,3084, 60,1042,1333,2794, 264,3177,4014,
1628, 258,3712, 7,4464,1176,1043,1778, 683, 114,1975, 78,1492, 383,1886, 510,
386, 645,5291,2891,2069,3305,4138,3867,2939,2603,2493,1935,1066,1848,3588,1015,
1282,1289,4609, 697,1453,3044,2666,3611,1856,2412, 54, 719,1330, 568,3778,2459,
1748, 788, 492, 551,1191,1000, 488,3394,3763, 282,1799, 348,2016,1523,3155,2390,
1049, 382,2019,1788,1170, 729,2968,3523, 897,3926,2785,2938,3292, 350,2319,3238,
1718,1717,2655,3453,3143,4465, 161,2889,2980,2009,1421, 56,1908,1640,2387,2232,
1917,1874,2477,4921, 148, 83,3438, 592,4245,2882,1822,1055, 741, 115,1496,1624,
381,1638,4592,1020, 516,3214, 458, 947,4575,1432, 211,1514,2926,1865,2142, 189,
852,1221,1400,1486, 882,2299,4036, 351, 28,1122, 700,6479,6480,6481,6482,6483, #last 512
)
pip/_vendor/chardet/gb2312prober.py 0000644 00000003332 14751155147 0013101 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .mbcharsetprober import MultiByteCharSetProber
from .codingstatemachine import CodingStateMachine
from .chardistribution import GB2312DistributionAnalysis
from .mbcssm import GB2312_SM_MODEL
class GB2312Prober(MultiByteCharSetProber):
def __init__(self):
super(GB2312Prober, self).__init__()
self.coding_sm = CodingStateMachine(GB2312_SM_MODEL)
self.distribution_analyzer = GB2312DistributionAnalysis()
self.reset()
@property
def charset_name(self):
return "GB2312"
@property
def language(self):
return "Chinese"
pip/_vendor/chardet/langgreekmodel.py 0000644 00000030620 14751155147 0013747 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# 255: Control characters that usually does not exist in any text
# 254: Carriage/Return
# 253: symbol (punctuation) that does not belong to word
# 252: 0 - 9
# Character Mapping Table:
Latin7_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 82,100,104, 94, 98,101,116,102,111,187,117, 92, 88,113, 85, # 40
79,118,105, 83, 67,114,119, 95, 99,109,188,253,253,253,253,253, # 50
253, 72, 70, 80, 81, 60, 96, 93, 89, 68,120, 97, 77, 86, 69, 55, # 60
78,115, 65, 66, 58, 76,106,103, 87,107,112,253,253,253,253,253, # 70
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 80
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 90
253,233, 90,253,253,253,253,253,253,253,253,253,253, 74,253,253, # a0
253,253,253,253,247,248, 61, 36, 46, 71, 73,253, 54,253,108,123, # b0
110, 31, 51, 43, 41, 34, 91, 40, 52, 47, 44, 53, 38, 49, 59, 39, # c0
35, 48,250, 37, 33, 45, 56, 50, 84, 57,120,121, 17, 18, 22, 15, # d0
124, 1, 29, 20, 21, 3, 32, 13, 25, 5, 11, 16, 10, 6, 30, 4, # e0
9, 8, 14, 7, 2, 12, 28, 23, 42, 24, 64, 75, 19, 26, 27,253, # f0
)
win1253_char_to_order_map = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 82,100,104, 94, 98,101,116,102,111,187,117, 92, 88,113, 85, # 40
79,118,105, 83, 67,114,119, 95, 99,109,188,253,253,253,253,253, # 50
253, 72, 70, 80, 81, 60, 96, 93, 89, 68,120, 97, 77, 86, 69, 55, # 60
78,115, 65, 66, 58, 76,106,103, 87,107,112,253,253,253,253,253, # 70
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 80
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 90
253,233, 61,253,253,253,253,253,253,253,253,253,253, 74,253,253, # a0
253,253,253,253,247,253,253, 36, 46, 71, 73,253, 54,253,108,123, # b0
110, 31, 51, 43, 41, 34, 91, 40, 52, 47, 44, 53, 38, 49, 59, 39, # c0
35, 48,250, 37, 33, 45, 56, 50, 84, 57,120,121, 17, 18, 22, 15, # d0
124, 1, 29, 20, 21, 3, 32, 13, 25, 5, 11, 16, 10, 6, 30, 4, # e0
9, 8, 14, 7, 2, 12, 28, 23, 42, 24, 64, 75, 19, 26, 27,253, # f0
)
# Model Table:
# total sequences: 100%
# first 512 sequences: 98.2851%
# first 1024 sequences:1.7001%
# rest sequences: 0.0359%
# negative sequences: 0.0148%
GreekLangModel = (
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,2,2,3,3,3,3,3,3,3,3,1,3,3,3,0,2,2,3,3,0,3,0,3,2,0,3,3,3,0,
3,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,0,3,3,0,3,2,3,3,0,3,2,3,3,3,0,0,3,0,3,0,3,3,2,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
0,2,3,2,2,3,3,3,3,3,3,3,3,0,3,3,3,3,0,2,3,3,0,3,3,3,3,2,3,3,3,0,
2,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,0,2,1,3,3,3,3,2,3,3,2,3,3,2,0,
0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,0,3,3,3,3,3,3,0,3,3,0,3,3,3,3,3,3,3,3,3,3,0,3,2,3,3,0,
2,0,1,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,2,3,0,0,0,0,3,3,0,3,1,3,3,3,0,3,3,0,3,3,3,3,0,0,0,0,
2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,0,3,0,3,3,3,3,3,0,3,2,2,2,3,0,2,3,3,3,3,3,2,3,3,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,3,2,2,2,3,3,3,3,0,3,1,3,3,3,3,2,3,3,3,3,3,3,3,2,2,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,2,0,3,0,0,0,3,3,2,3,3,3,3,3,0,0,3,2,3,0,2,3,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,0,3,3,3,3,0,0,3,3,0,2,3,0,3,0,3,3,3,0,0,3,0,3,0,2,2,3,3,0,0,
0,0,1,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,2,0,3,2,3,3,3,3,0,3,3,3,3,3,0,3,3,2,3,2,3,3,2,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,2,3,2,3,3,3,3,3,3,0,2,3,2,3,2,2,2,3,2,3,3,2,3,0,2,2,2,3,0,
2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,0,0,0,3,3,3,2,3,3,0,0,3,0,3,0,0,0,3,2,0,3,0,3,0,0,2,0,2,0,
0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,0,3,3,3,3,3,3,0,3,3,0,3,0,0,0,3,3,0,3,3,3,0,0,1,2,3,0,
3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,2,0,0,3,2,2,3,3,0,3,3,3,3,3,2,1,3,0,3,2,3,3,2,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,3,0,2,3,3,3,3,3,3,0,0,3,0,3,0,0,0,3,3,0,3,2,3,0,0,3,3,3,0,
3,0,0,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,0,3,3,3,3,3,3,0,0,3,0,3,0,0,0,3,2,0,3,2,3,0,0,3,2,3,0,
2,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,1,2,2,3,3,3,3,3,3,0,2,3,0,3,0,0,0,3,3,0,3,0,2,0,0,2,3,1,0,
2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,0,3,3,3,3,0,3,0,3,3,2,3,0,3,3,3,3,3,3,0,3,3,3,0,2,3,0,0,3,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,0,3,3,3,0,0,3,0,0,0,3,3,0,3,0,2,3,3,0,0,3,0,3,0,3,3,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,0,0,0,3,3,3,3,3,3,0,0,3,0,2,0,0,0,3,3,0,3,0,3,0,0,2,0,2,0,
0,0,0,0,1,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,3,0,3,0,2,0,3,2,0,3,2,3,2,3,0,0,3,2,3,2,3,3,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,0,0,2,3,3,3,3,3,0,0,0,3,0,2,1,0,0,3,2,2,2,0,3,0,0,2,2,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,0,3,3,3,2,0,3,0,3,0,3,3,0,2,1,2,3,3,0,0,3,0,3,0,3,3,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,3,3,3,0,3,3,3,3,3,3,0,2,3,0,3,0,0,0,2,1,0,2,2,3,0,0,2,2,2,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,3,0,0,2,3,3,3,2,3,0,0,1,3,0,2,0,0,0,0,3,0,1,0,2,0,0,1,1,1,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,3,1,0,3,0,0,0,3,2,0,3,2,3,3,3,0,0,3,0,3,2,2,2,1,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,0,3,3,3,0,0,3,0,0,0,0,2,0,2,3,3,2,2,2,2,3,0,2,0,2,2,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,3,3,3,2,0,0,0,0,0,0,2,3,0,2,0,2,3,2,0,0,3,0,3,0,3,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,3,2,3,3,2,2,3,0,2,0,3,0,0,0,2,0,0,0,0,1,2,0,2,0,2,0,
0,2,0,2,0,2,2,0,0,1,0,2,2,2,0,2,2,2,0,2,2,2,0,0,2,0,0,1,0,0,0,0,
0,2,0,3,3,2,0,0,0,0,0,0,1,3,0,2,0,2,2,2,0,0,2,0,3,0,0,2,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,0,2,3,2,0,2,2,0,2,0,2,2,0,2,0,2,2,2,0,0,0,0,0,0,2,3,0,0,0,2,
0,1,2,0,0,0,0,2,2,0,0,0,2,1,0,2,2,0,0,0,0,0,0,1,0,2,0,0,0,0,0,0,
0,0,2,1,0,2,3,2,2,3,2,3,2,0,0,3,3,3,0,0,3,2,0,0,0,1,1,0,2,0,2,2,
0,2,0,2,0,2,2,0,0,2,0,2,2,2,0,2,2,2,2,0,0,2,0,0,0,2,0,1,0,0,0,0,
0,3,0,3,3,2,2,0,3,0,0,0,2,2,0,2,2,2,1,2,0,0,1,2,2,0,0,3,0,0,0,2,
0,1,2,0,0,0,1,2,0,0,0,0,0,0,0,2,2,0,1,0,0,2,0,0,0,2,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,3,3,2,2,0,0,0,2,0,2,3,3,0,2,0,0,0,0,0,0,2,2,2,0,2,2,0,2,0,2,
0,2,2,0,0,2,2,2,2,1,0,0,2,2,0,2,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,
0,2,0,3,2,3,0,0,0,3,0,0,2,2,0,2,0,2,2,2,0,0,2,0,0,0,0,0,0,0,0,2,
0,0,2,2,0,0,2,2,2,0,0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,2,0,0,3,2,0,2,2,2,2,2,0,0,0,2,0,0,0,0,2,0,1,0,0,2,0,1,0,0,0,
0,2,2,2,0,2,2,0,1,2,0,2,2,2,0,2,2,2,2,1,2,2,0,0,2,0,0,0,0,0,0,0,
0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
0,2,0,2,0,2,2,0,0,0,0,1,2,1,0,0,2,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,3,2,3,0,0,2,0,0,0,2,2,0,2,0,0,0,1,0,0,2,0,2,0,2,2,0,0,0,0,
0,0,2,0,0,0,0,2,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,
0,2,2,3,2,2,0,0,0,0,0,0,1,3,0,2,0,2,2,0,0,0,1,0,2,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,0,2,0,3,2,0,2,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
0,0,2,0,0,0,0,1,1,0,0,2,1,2,0,2,2,0,1,0,0,1,0,0,0,2,0,0,0,0,0,0,
0,3,0,2,2,2,0,0,2,0,0,0,2,0,0,0,2,3,0,2,0,0,0,0,0,0,2,2,0,0,0,2,
0,1,2,0,0,0,1,2,2,1,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,1,2,0,2,2,0,2,0,0,2,0,0,0,0,1,2,1,0,2,1,0,0,0,0,0,0,0,0,0,0,
0,0,2,0,0,0,3,1,2,2,0,2,0,0,0,0,2,0,0,0,2,0,0,3,0,0,0,0,2,2,2,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,1,0,2,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,2,
0,2,2,0,0,2,2,2,2,2,0,1,2,0,0,0,2,2,0,1,0,2,0,0,2,2,0,0,0,0,0,0,
0,0,0,0,1,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,2,
0,1,2,0,0,0,0,2,2,1,0,1,0,1,0,2,2,2,1,0,0,0,0,0,0,1,0,0,0,0,0,0,
0,2,0,1,2,0,0,0,0,0,0,0,0,0,0,2,0,0,2,2,0,0,0,0,1,0,0,0,0,0,0,2,
0,2,2,0,0,0,0,2,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,
0,2,2,2,2,0,0,0,3,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,1,
0,0,2,0,0,0,0,1,2,0,0,0,0,0,0,2,2,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,
0,2,0,2,2,2,0,0,2,0,0,0,0,0,0,0,2,2,2,0,0,0,2,0,0,0,0,0,0,0,0,2,
0,0,1,0,0,0,0,2,1,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
0,3,0,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,2,
0,0,2,0,0,0,0,2,2,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,2,0,2,2,1,0,0,0,0,0,0,2,0,0,2,0,2,2,2,0,0,0,0,0,0,2,0,0,0,0,2,
0,0,2,0,0,2,0,2,2,0,0,0,0,2,0,2,0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,
0,0,3,0,0,0,2,2,0,2,2,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,
0,2,2,2,2,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,
0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,2,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
0,2,0,0,0,2,0,0,0,0,0,1,0,0,0,0,2,2,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,2,0,0,0,
0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,2,0,2,0,0,0,
0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,2,0,0,0,1,2,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
)
Latin7GreekModel = {
'char_to_order_map': Latin7_char_to_order_map,
'precedence_matrix': GreekLangModel,
'typical_positive_ratio': 0.982851,
'keep_english_letter': False,
'charset_name': "ISO-8859-7",
'language': 'Greek',
}
Win1253GreekModel = {
'char_to_order_map': win1253_char_to_order_map,
'precedence_matrix': GreekLangModel,
'typical_positive_ratio': 0.982851,
'keep_english_letter': False,
'charset_name': "windows-1253",
'language': 'Greek',
}
pip/_vendor/chardet/cli/__init__.py 0000644 00000000001 14751155147 0013263 0 ustar 00
pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000161 14751155147 0020515 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.pyc 0000644 00000000161 14751155147 0017556 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.pyc 0000644 00000005671 14751155147 0020140 0 ustar 00 3
���e�
� @ sr d Z ddlmZmZmZ ddlZddlZddlmZ ddl m
Z
ddl m Z d
dd �Z
dd
d �Zed krne� dS )a
Script which takes one or more file paths and reports on their detected
encodings
Example::
% chardetect somefile someotherfile
somefile: windows-1252 with confidence 0.5
someotherfile: ascii with confidence 1.0
If no paths are provided, it takes its input from stdin.
� )�absolute_import�print_function�unicode_literalsN)� __version__)�PY2)�UniversalDetector�stdinc C s| t � }x&| D ] }t|�}|j|� |jr P q W |j� |j}trP|jtj � d�}|d rndj
||d |d �S dj
|�S dS )z�
Return a string describing the probable encoding of a file or
list of strings.
:param lines: The lines to get the encoding of.
:type lines: Iterable of bytes
:param name: Name of file or collection of lines
:type name: str
�ignore�encodingz {0}: {1} with confidence {2}Z
confidencez{0}: no resultN) r � bytearrayZfeed�done�close�resultr �decode�sys�getfilesystemencoding�format)�lines�name�u�liner � r � /usr/lib/python3.6/chardetect.py�description_of s
r c C s� t jdd�}|jddt jd�dtr(tjntjjgd� |jdd d
jt �d � |j
| �}x4|j D ]*}|j � rxt
dtjd� t
t||j�� q^W dS )z�
Handles command line arguments and gets things started.
:param argv: List of arguments, as if specified on the command-line.
If None, ``sys.argv[1:]`` is used instead.
:type argv: list of str
zVTakes one or more file paths and reports their detected encodings)� description�inputz^File whose encoding we would like to determine. (default: stdin)�rb�*)�help�type�nargs�defaultz --version�versionz %(prog)s {0})�actionr" z0You are running chardetect interactively. Press z8CTRL-D twice at the start of a blank line to signal the z4end of your input. If you want help, run chardetect z--help
)�fileNzhYou are running chardetect interactively. Press CTRL-D twice at the start of a blank line to signal the z�You are running chardetect interactively. Press CTRL-D twice at the start of a blank line to signal the end of your input. If you want help, run chardetect z�You are running chardetect interactively. Press CTRL-D twice at the start of a blank line to signal the end of your input. If you want help, run chardetect --help
)�argparse�ArgumentParser� add_argumentZFileTyper r r �bufferr r �
parse_argsr �isatty�print�stderrr r )�argv�parser�args�fr r r �main6 s
r1 �__main__)r )N)�__doc__Z
__future__r r r r% r Zchardetr Zchardet.compatr Zchardet.universaldetectorr r r1 �__name__r r r r �<module> s
pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.opt-1.pyc 0000644 00000005671 14751155147 0021077 0 ustar 00 3
���e�
� @ sr d Z ddlmZmZmZ ddlZddlZddlmZ ddl m
Z
ddl m Z d
dd �Z
dd
d �Zed krne� dS )a
Script which takes one or more file paths and reports on their detected
encodings
Example::
% chardetect somefile someotherfile
somefile: windows-1252 with confidence 0.5
someotherfile: ascii with confidence 1.0
If no paths are provided, it takes its input from stdin.
� )�absolute_import�print_function�unicode_literalsN)� __version__)�PY2)�UniversalDetector�stdinc C s| t � }x&| D ] }t|�}|j|� |jr P q W |j� |j}trP|jtj � d�}|d rndj
||d |d �S dj
|�S dS )z�
Return a string describing the probable encoding of a file or
list of strings.
:param lines: The lines to get the encoding of.
:type lines: Iterable of bytes
:param name: Name of file or collection of lines
:type name: str
�ignore�encodingz {0}: {1} with confidence {2}Z
confidencez{0}: no resultN) r � bytearrayZfeed�done�close�resultr �decode�sys�getfilesystemencoding�format)�lines�name�u�liner � r � /usr/lib/python3.6/chardetect.py�description_of s
r c C s� t jdd�}|jddt jd�dtr(tjntjjgd� |jdd d
jt �d � |j
| �}x4|j D ]*}|j � rxt
dtjd� t
t||j�� q^W dS )z�
Handles command line arguments and gets things started.
:param argv: List of arguments, as if specified on the command-line.
If None, ``sys.argv[1:]`` is used instead.
:type argv: list of str
zVTakes one or more file paths and reports their detected encodings)� description�inputz^File whose encoding we would like to determine. (default: stdin)�rb�*)�help�type�nargs�defaultz --version�versionz %(prog)s {0})�actionr" z0You are running chardetect interactively. Press z8CTRL-D twice at the start of a blank line to signal the z4end of your input. If you want help, run chardetect z--help
)�fileNzhYou are running chardetect interactively. Press CTRL-D twice at the start of a blank line to signal the z�You are running chardetect interactively. Press CTRL-D twice at the start of a blank line to signal the end of your input. If you want help, run chardetect z�You are running chardetect interactively. Press CTRL-D twice at the start of a blank line to signal the end of your input. If you want help, run chardetect --help
)�argparse�ArgumentParser� add_argumentZFileTyper r r �bufferr r �
parse_argsr �isatty�print�stderrr r )�argv�parser�args�fr r r �main6 s
r1 �__main__)r )N)�__doc__Z
__future__r r r r% r Zchardetr Zchardet.compatr Zchardet.universaldetectorr r r1 �__name__r r r r �<module> s
pip/_vendor/chardet/cli/chardetect.py 0000644 00000005262 14751155147 0013650 0 ustar 00 #!/usr/bin/env python
"""
Script which takes one or more file paths and reports on their detected
encodings
Example::
% chardetect somefile someotherfile
somefile: windows-1252 with confidence 0.5
someotherfile: ascii with confidence 1.0
If no paths are provided, it takes its input from stdin.
"""
from __future__ import absolute_import, print_function, unicode_literals
import argparse
import sys
from chardet import __version__
from chardet.compat import PY2
from chardet.universaldetector import UniversalDetector
def description_of(lines, name='stdin'):
"""
Return a string describing the probable encoding of a file or
list of strings.
:param lines: The lines to get the encoding of.
:type lines: Iterable of bytes
:param name: Name of file or collection of lines
:type name: str
"""
u = UniversalDetector()
for line in lines:
line = bytearray(line)
u.feed(line)
# shortcut out of the loop to save reading further - particularly useful if we read a BOM.
if u.done:
break
u.close()
result = u.result
if PY2:
name = name.decode(sys.getfilesystemencoding(), 'ignore')
if result['encoding']:
return '{0}: {1} with confidence {2}'.format(name, result['encoding'],
result['confidence'])
else:
return '{0}: no result'.format(name)
def main(argv=None):
"""
Handles command line arguments and gets things started.
:param argv: List of arguments, as if specified on the command-line.
If None, ``sys.argv[1:]`` is used instead.
:type argv: list of str
"""
# Get command line arguments
parser = argparse.ArgumentParser(
description="Takes one or more file paths and reports their detected \
encodings")
parser.add_argument('input',
help='File whose encoding we would like to determine. \
(default: stdin)',
type=argparse.FileType('rb'), nargs='*',
default=[sys.stdin if PY2 else sys.stdin.buffer])
parser.add_argument('--version', action='version',
version='%(prog)s {0}'.format(__version__))
args = parser.parse_args(argv)
for f in args.input:
if f.isatty():
print("You are running chardetect interactively. Press " +
"CTRL-D twice at the start of a blank line to signal the " +
"end of your input. If you want help, run chardetect " +
"--help\n", file=sys.stderr)
print(description_of(f, f.name))
if __name__ == '__main__':
main()
pip/_vendor/chardet/mbcsgroupprober.py 0000644 00000003734 14751155147 0014210 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
# Proofpoint, Inc.
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetgroupprober import CharSetGroupProber
from .utf8prober import UTF8Prober
from .sjisprober import SJISProber
from .eucjpprober import EUCJPProber
from .gb2312prober import GB2312Prober
from .euckrprober import EUCKRProber
from .cp949prober import CP949Prober
from .big5prober import Big5Prober
from .euctwprober import EUCTWProber
class MBCSGroupProber(CharSetGroupProber):
def __init__(self, lang_filter=None):
super(MBCSGroupProber, self).__init__(lang_filter=lang_filter)
self.probers = [
UTF8Prober(),
SJISProber(),
EUCJPProber(),
GB2312Prober(),
EUCKRProber(),
CP949Prober(),
Big5Prober(),
EUCTWProber()
]
self.reset()
pip/_vendor/chardet/cp949prober.py 0000644 00000003477 14751155147 0013063 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .chardistribution import EUCKRDistributionAnalysis
from .codingstatemachine import CodingStateMachine
from .mbcharsetprober import MultiByteCharSetProber
from .mbcssm import CP949_SM_MODEL
class CP949Prober(MultiByteCharSetProber):
def __init__(self):
super(CP949Prober, self).__init__()
self.coding_sm = CodingStateMachine(CP949_SM_MODEL)
# NOTE: CP949 is a superset of EUC-KR, so the distribution should be
# not different.
self.distribution_analyzer = EUCKRDistributionAnalysis()
self.reset()
@property
def charset_name(self):
return "CP949"
@property
def language(self):
return "Korean"
pip/_vendor/chardet/sjisprober.py 0000644 00000007276 14751155147 0013164 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .mbcharsetprober import MultiByteCharSetProber
from .codingstatemachine import CodingStateMachine
from .chardistribution import SJISDistributionAnalysis
from .jpcntx import SJISContextAnalysis
from .mbcssm import SJIS_SM_MODEL
from .enums import ProbingState, MachineState
class SJISProber(MultiByteCharSetProber):
def __init__(self):
super(SJISProber, self).__init__()
self.coding_sm = CodingStateMachine(SJIS_SM_MODEL)
self.distribution_analyzer = SJISDistributionAnalysis()
self.context_analyzer = SJISContextAnalysis()
self.reset()
def reset(self):
super(SJISProber, self).reset()
self.context_analyzer.reset()
@property
def charset_name(self):
return self.context_analyzer.charset_name
@property
def language(self):
return "Japanese"
def feed(self, byte_str):
for i in range(len(byte_str)):
coding_state = self.coding_sm.next_state(byte_str[i])
if coding_state == MachineState.ERROR:
self.logger.debug('%s %s prober hit error at byte %s',
self.charset_name, self.language, i)
self._state = ProbingState.NOT_ME
break
elif coding_state == MachineState.ITS_ME:
self._state = ProbingState.FOUND_IT
break
elif coding_state == MachineState.START:
char_len = self.coding_sm.get_current_charlen()
if i == 0:
self._last_char[1] = byte_str[0]
self.context_analyzer.feed(self._last_char[2 - char_len:],
char_len)
self.distribution_analyzer.feed(self._last_char, char_len)
else:
self.context_analyzer.feed(byte_str[i + 1 - char_len:i + 3
- char_len], char_len)
self.distribution_analyzer.feed(byte_str[i - 1:i + 1],
char_len)
self._last_char[0] = byte_str[-1]
if self.state == ProbingState.DETECTING:
if (self.context_analyzer.got_enough_data() and
(self.get_confidence() > self.SHORTCUT_THRESHOLD)):
self._state = ProbingState.FOUND_IT
return self.state
def get_confidence(self):
context_conf = self.context_analyzer.get_confidence()
distrib_conf = self.distribution_analyzer.get_confidence()
return max(context_conf, distrib_conf)
pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.pyc 0000644 00000004144 14751155147 0021175 0 ustar 00 3
���e� � @ s, d dl mZ d dlmZ G dd� de�ZdS )� )� ProbingState)�
CharSetProberc sR e Zd Zd� fdd� Z� fdd�Zedd� �Zedd � �Zd
d � Zd d
� Z � Z
S )�CharSetGroupProberNc s( t t| �j|d� d| _g | _d | _d S )N)� lang_filter� )�superr �__init__� _active_num�probers�_best_guess_prober)�selfr )� __class__� �(/usr/lib/python3.6/charsetgroupprober.pyr ! s zCharSetGroupProber.__init__c sN t t| �j� d| _x.| jD ]$}|r |j� d|_| jd7 _q W d | _d S )Nr Tr )r r �resetr r
�activer )r �prober)r
r r r ' s zCharSetGroupProber.resetc C s | j s| j� | j sd S | j jS )N)r �get_confidence� charset_name)r r r r r 1 s
z CharSetGroupProber.charset_namec C s | j s| j� | j sd S | j jS )N)r r �language)r r r r r 9 s
zCharSetGroupProber.languagec C s� xx| j D ]n}|sq|jsq|j|�}|s*q|tjkr@|| _| jS |tjkrd|_| jd8 _| jdkrtj| _ | jS qW | jS )NFr r )
r
r �feedr �FOUND_ITr �state�NOT_MEr Z_state)r Zbyte_strr r r r r r A s$
zCharSetGroupProber.feedc C s� | j }|tjkrdS |tjkr"dS d}d | _x\| jD ]R}|s>q4|jsV| jjd|j � q4|j
� }| jjd|j |j |� ||k r4|}|| _q4W | js�dS |S )Ng�G�z��?g{�G�z�?g z
%s not activez%s %s confidence = %s) r r r r r r
r Zlogger�debugr r r )r r Z best_confr Zconfr r r r U s*
z!CharSetGroupProber.get_confidence)N) �__name__�
__module__� __qualname__r r �propertyr r r r �
__classcell__r r )r
r r s
r N)Zenumsr Z
charsetproberr r r r r r �<module> s pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.opt-1.pyc 0000644 00000055420 14751155147 0021027 0 ustar 00 3
���e, � @ s d�Z d�Ze ed�d�d�d�d��Zd�S )�� � � � � �j �k �d � � � �e �^ � � �l �m �n �o � � � �Y �_ �p �q � � � �� �@ �H �I �r �J �s �t �f �Q �� �u �Z �g �N �R �` �� �[ �O �T �h �i �a �b �\ �� �� �� �� �� �� �X �� �� �� �� �� �� �� �v �� �� �� �� �c �U �S �� �� �� �� �� �� �� �� �� �� �� �� � � �� � �� �K � � �4 �" �3 �w �/ �: �9 �1 �5 �7 �+ � � �, � �0 � � � �' �> � �6 �- � � � �= � �� � �* �. � � �L � �B �? � �
� �$ � �
�( � � �# �V �� �� �� �� �� � � �) � �! � �2 �% � � �C �M �& �] � � �D �8 �; �A �E �< �F �P �G �W � � � � � g� �@��?FzTIS-620ZThai)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguageN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r ( r� r� rr rr rr rr r� r� rr rr r� rr rr r� rr rr rr rr rr rr rr rr r� r� rr rr rr r� rr rr rr rr r� rr rr r� r� r� r� rr r� rr rr r| rr rr r� r� r| rr rr rr rr r� r| r� r| r� r� rr r| r� r| r| rr r� rr rr r| rr r� r� rr rr r� rr rr r� rr rr rr rr rr rr rr rr rr r� rr r| rr r� r| r| r| rr r� r| rr r� r� r� r� r� r� r� r| rr r� r� rr r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr r| rr rr rr rr rr rr rr rr rr rr rr r| r| r| r| r| r| r| rr rr r| rr r| rr rr r| r| r| rr r� r| rr r� rr rr r| r| r� r| rr rr r� r| r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| r| rr rr rr rr r� r| rr rr rr rr rr r| r| r| r| rr rr r| r| rr rr r| r| rr r| rr r| r| rr rr r� r| rr r� r| r| rr rr r� r� r| r� r� r� rr r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr rr rr r| r| rr rr rr rr r| rr r| r| rr rr r| r| rr r| r| r| r| r� r� rr r� r| r� r� rr r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr r| rr r| rr rr r| r| rr r| rr rr r| rr r� r� r| rr r| r| r| rr r| r| r| r| r| r� r| r� r| r| r� r� rr rr r| r� r� r� r| r| r� r� rr r� r� r� r� r� r� r� r� r� r� r| rr r� r� r| r� r� rr rr r| rr rr r| r� r� rr rr r� rr rr r� r| r| rr r� r| r| r� r� r� r� r| r| r| r� r| r| r� r� r� r| r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| rr rr r| r� r� rr rr r� r| rr r� r| r� r| r| r| r| r� r| r� r� r| r| r| r� r| r| r� r� r� r| r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| rr r| rr r| r� r| r| r� rr r| r� rr r| r� r| rr r| r| rr r� r| rr r| r| r� r| r| r| r| r� r| r| r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| rr rr r| rr r| r| r| rr r| r| rr r| r| r� r| rr r| r| rr r� rr r| r| r| rr r| r| r| rr rr r| r� rr r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� rr r� rr rr rr rr rr r� r� rr r� r| r| rr rr rr rr rr r� r� r� r� r� rr r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r| rr r� r� r� rr r� r| r� r� r� r� r� rr r� r� r� r� r� r� r� r� r| r� rr rr rr rr r� r� r| rr r� r� rr r� rr rr r| rr rr rr rr rr r� r� rr rr rr r� r� r� rr rr r� r� rr r� r� r� r� r| r� r� r| r� r� rr r� r� r� r� r� r| rr r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| rr rr rr rr rr rr rr r� r| r� rr rr r| r| r� r| r| r| rr r� r� r| r� r| r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| r� r| rr rr rr r� r| r� r| r| r� r| r� rr r| r| r� r| r� r� r� r| r| r� r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| r� rr rr r� r� rr r� r| rr r� r� rr r| r� r� r| r� r| r| rr r| r� r� r� r� r� r| rr r� r� r� rr r� r| r� r| r� rr r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r� r� rr r| rr rr rr r� rr r| r� rr r| r� rr r| r| r| r| r� rr rr r� r| r� rr r� r| rr r� r| r� r� rr r| r| r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr rr r| rr r| rr rr r| rr r| rr r| rr rr r| r� r� rr r| r| r| r� r| r| r| r� r| r| r� r| r� r� r| r| r| rr r� r� rr r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| rr r| r| r� r� rr r| rr r| rr r| r� rr r| r| r� r| r� r| r| r| r� r| r| r| r| r� rr r| r� r| r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr rr r| rr r� r| rr rr r| r| rr r� r� r� r| r� rr rr r| r| rr r� r� r� rr r� r� r� r� rr r� r� rr rr r� r| r� r| r� r� r� rr r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr r| rr r| rr rr r� r� rr r� r� r| r� r| r� r� rr r� r� r� r| rr r� r� r� r� r� r� r� r� rr r� r� r| r| r| r| r� r� r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r| r| r� r� r| r� rr rr r| rr r| r| rr r| r| rr r� r| r| r� r| r� rr r| r� r| r| r| r| r| r� rr r| r� r| r| r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr rr rr rr rr r� rr rr r� r| r� r� rr r| r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| r| r| rr r� r� r� rr r� rr r| r� rr r| r| rr rr rr rr rr r� r� r| r| r| r� r| r| r� r| r� r| rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| rr r� rr rr r| rr rr r� rr rr r� rr r| r| rr r| rr rr rr r� r� r| r| rr r� r� r� r� rr r� r� rr r� r� r� r| r| r� r� rr r� r� r| r| r| rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r| rr rr r| r� rr rr r| r| rr r� rr r| r� rr r| r� r� r| r| r� r| rr r| r� r� rr r� r� r� r� rr r� r� r| rr r� rr r� r� rr r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� rr r| r| r| r� r| r� r� rr r� r� rr r� rr r� r� r| r� r� r� r� r| r� r� r� r� r| r� r� r� r� r| r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� rr rr rr rr r| r| r| r| r| r� rr r� r� r� r| r� r� r� r| r� r| r� rr r| r� r� rr r� r� r� r� r� rr r� r� r| rr r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r� rr rr r� r| r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r� rr r� r� r� r| r� r� r| r� rr rr r| rr rr rr r| rr r� r� r| r| r| r� r� r� r| r| r� r� r� r� r� r� r� rr r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| r� r� r� r� r� r� r� r� r� r� r� r| rr r� rr rr r� r� r� r� rr r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r� r| rr r� r| rr r� r� rr r� r| r| r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| r� r� r� r� r� rr r� r| r| r| r| r| r| r� r� r� r� r� rr r� r� r� rr r� r� r� r� r� r� r� r| r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� rr r� r| r| r� rr rr r| rr rr r� r� r� r� r| r| r� r| r� rr rr r� r� r� rr r| r� r� r� r� r| r� r� r� r� r� r� r� r� r| r� r� r� rr r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� rr r� r� rr r� rr r� r� r� r� r� rr r| r� r� r� rr r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rr rr r� rr r| r� rr rr r� r| r| r� r� r| r� r� r� r| r� r� r� r� r� rr r� r� r� rr r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r| r� rr rr rr r| r| r� r� r� r� r� rr r� r� r� r| r| r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| rr r� r| r� r� r| r� r� rr r� r� r� r| r� r� r� r� r� rr r� r� rr r� r� r� r| r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� rr r� r| r� r� r| r| r� r� r| r� r� r� r� rr r� r| r� r� r� r� r| r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r| r| r� r� r� r| r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� rr r� r� r� r� r� r� r� r� rr r| r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r| r| r� r� r� r� r� r� r� r� r| rr r| r� r| r| rr r� r� r� r| rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| r| r� r� r� r� r� r� r| r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� rr r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� rr r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� rr rr r� r� r� r� r| rr r� r� r| r� r� r� r� r� r� r| r� r� r� r� r� r| r� r� r� r| r� r� r� r� r| r� r� rr r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� rr r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| r� r� r� r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� rr r� r� r� r� r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� rr rr r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r| r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r| r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )ZTIS620CharToOrderMapZ
ThaiLangModelZTIS620ThaiModel� r� r� �#/usr/lib/python3.6/langthaimodel.py�<module>% s*
pip/_vendor/chardet/__pycache__/big5prober.cpython-36.pyc 0000644 00000002021 14751155147 0017305 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�Big5DistributionAnalysis)�
BIG5_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )�
Big5Proberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� � /usr/lib/python3.6/big5prober.pyr # s
zBig5Prober.__init__c C s dS )NZBig5r )r
r r r
� charset_name) s zBig5Prober.charset_namec C s dS )NZChineser )r
r r r
�language- s zBig5Prober.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r " s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.opt-1.pyc 0000644 00000003543 14751155147 0020316 0 ustar 00 3
���e�
� @ sH d dl mZ d dlmZmZ d dlmZ d dlmZ G dd� de�Z dS )� )�
CharSetProber)� ProbingState� MachineState)�CodingStateMachine)�
UTF8_SM_MODELc sT e Zd ZdZ� fdd�Z� fdd�Zedd� �Zedd � �Zd
d � Z d d
� Z
� Z S )�
UTF8Proberg �?c s* t t| �j� tt�| _d | _| j� d S )N)�superr �__init__r r � coding_sm�
_num_mb_chars�reset)�self)� __class__� � /usr/lib/python3.6/utf8prober.pyr & s
zUTF8Prober.__init__c s" t t| �j� | jj� d| _d S )N� )r r r r
r )r
)r r r r , s
zUTF8Prober.resetc C s dS )Nzutf-8r )r
r r r � charset_name1 s zUTF8Prober.charset_namec C s dS )N� r )r
r r r �language5 s zUTF8Prober.languagec C s� xj|D ]b}| j j|�}|tjkr,tj| _P q|tjkrBtj| _P q|tj kr| j j
� dkr| j d7 _ qW | j tj
kr�| j� | jkr�tj| _| j S )N� r )r
Z
next_stater ZERRORr ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenr �stateZ DETECTING�get_confidenceZSHORTCUT_THRESHOLD)r
Zbyte_str�cZ coding_stater r r �feed9 s
zUTF8Prober.feedc C s. d}| j dk r&|| j| j 9 }d| S |S d S )Ng�G�z��?� g �?)r �
ONE_CHAR_PROB)r
Zunliker r r r L s
zUTF8Prober.get_confidence) �__name__�
__module__� __qualname__r r r �propertyr r r r �
__classcell__r r )r r r # s r N)
Z
charsetproberr Zenumsr r Zcodingstatemachiner Zmbcssmr r r r r r �<module> s pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.pyc 0000644 00000002031 14751155147 0017607 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�EUCTWDistributionAnalysis)�EUCTW_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� EUCTWProberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/euctwprober.pyr " s
zEUCTWProber.__init__c C s dS )NzEUC-TWr )r
r r r
� charset_name( s zEUCTWProber.charset_namec C s dS )NZTaiwanr )r
r r r
�language, s zEUCTWProber.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r ! s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.pyc 0000644 00000002024 14751155147 0020463 0 ustar 00 3
���e� � @ s� d dl mZ d dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z d dl m
Z
d dlmZ d d lmZ G d
d � d e�Zd S )
� )�CharSetGroupProber)�
UTF8Prober)�
SJISProber)� EUCJPProber)� GB2312Prober)� EUCKRProber)� CP949Prober)�
Big5Prober)� EUCTWProberc s e Zd Zd� fdd� Z� ZS )�MBCSGroupProberNc sD t t| �j|d� t� t� t� t� t� t� t � t
� g| _ | j � d S )N)� lang_filter)
�superr �__init__r r r r r r r r
Zprobers�reset)�selfr )� __class__� �%/usr/lib/python3.6/mbcsgroupprober.pyr * s
zMBCSGroupProber.__init__)N)�__name__�
__module__� __qualname__r �
__classcell__r r )r r r ) s r N)Zcharsetgroupproberr Z
utf8proberr Z
sjisproberr Z eucjpproberr Z gb2312proberr Z euckrproberr Z cp949proberr Z
big5proberr Z euctwproberr
r r r r r �<module> s pip/_vendor/chardet/__pycache__/escprober.cpython-36.opt-1.pyc 0000644 00000004742 14751155147 0020204 0 ustar 00 3
���en � @ sX d dl mZ d dlmZ d dlmZmZmZ d dlm Z m
Z
m Z m Z G dd� de�Z
dS )� )�
CharSetProber)�CodingStateMachine)�LanguageFilter� ProbingState� MachineState)� HZ_SM_MODEL�ISO2022CN_SM_MODEL�ISO2022JP_SM_MODEL�ISO2022KR_SM_MODELc sV e Zd ZdZd� fdd� Z� fdd�Zedd� �Zed d
� �Zd d � Z d
d� Z
� Z S )�EscCharSetProberz�
This CharSetProber uses a "code scheme" approach for detecting encodings,
whereby easily recognizable escape or shift sequences are relied on to
identify these encodings.
Nc s� t t| �j|d� g | _| jtj@ rD| jjtt �� | jjtt
�� | jtj @ r`| jjtt �� | jtj
@ r|| jjtt�� d | _d | _d | _d | _| j� d S )N)� lang_filter)�superr �__init__� coding_smr r ZCHINESE_SIMPLIFIED�appendr r r ZJAPANESEr ZKOREANr
�active_sm_count�_detected_charset�_detected_language�_state�reset)�selfr )� __class__� � /usr/lib/python3.6/escprober.pyr * s zEscCharSetProber.__init__c sN t t| �j� x"| jD ]}|s qd|_|j� qW t| j�| _d | _d | _d S )NT) r
r r r �active�lenr r r )r r )r r r r : s zEscCharSetProber.resetc C s | j S )N)r )r r r r � charset_nameE s z EscCharSetProber.charset_namec C s | j S )N)r )r r r r �languageI s zEscCharSetProber.languagec C s | j r
dS dS d S )Ng�G�z��?g )r )r r r r �get_confidenceM s z EscCharSetProber.get_confidencec C s� x�|D ]�}x�| j D ]�}| s|j r&q|j|�}|tjkrhd|_| jd8 _| jdkr�tj| _| j S q|tj
krtj | _|j � | _
|j| _| j S qW qW | j S )NFr � )r r Z
next_stater ZERRORr r ZNOT_MEr �stateZITS_MEZFOUND_ITZget_coding_state_machiner r r )r Zbyte_str�cr Z coding_stater r r �feedS s"
zEscCharSetProber.feed)N) �__name__�
__module__� __qualname__�__doc__r r �propertyr r r r" �
__classcell__r r )r r r # s r N)Z
charsetproberr Zcodingstatemachiner Zenumsr r r Zescsmr r r r
r r r r r �<module> s pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.opt-1.pyc 0000644 00000004470 14751155147 0020400 0 ustar 00 3
���e� � @ s` d dl mZ d dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z m Z G dd� de�Z
d S )
� )�MultiByteCharSetProber)�CodingStateMachine)�SJISDistributionAnalysis)�SJISContextAnalysis)�
SJIS_SM_MODEL)� ProbingState� MachineStatec sP e Zd Z� fdd�Z� fdd�Zedd� �Zedd� �Zd d
� Zd d � Z � Z
S )
�
SJISProberc s4 t t| �j� tt�| _t� | _t� | _ | j
� d S )N) �superr �__init__r r � coding_smr �distribution_analyzerr �context_analyzer�reset)�self)� __class__� � /usr/lib/python3.6/sjisprober.pyr % s
zSJISProber.__init__c s t t| �j� | jj� d S )N)r
r r r )r )r r r r , s zSJISProber.resetc C s | j jS )N)r � charset_name)r r r r r 0 s zSJISProber.charset_namec C s dS )NZJapaneser )r r r r �language4 s zSJISProber.languagec C sL �xt t|��D ]�}| jj|| �}|tjkrP| jjd| j| j |� t
j | _ P q|tj
krft
j| _ P q|tjkr| jj� }|dkr�|d | jd< | jj| jd| d � |� | jj| j|� q| jj||d | |d | � |� | jj||d |d � |� qW |d | jd< | jt
jk�rF| jj� �rF| j� | jk�rFt
j| _ | jS )Nz!%s %s prober hit error at byte %s� r � � ���)�range�lenr Z
next_stater ZERRORZlogger�debugr r r ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenZ
_last_charr �feedr
�stateZ DETECTINGZgot_enough_data�get_confidenceZSHORTCUT_THRESHOLD)r Zbyte_str�iZ coding_stateZchar_lenr r r r 8 s6
zSJISProber.feedc C s | j j� }| jj� }t||�S )N)r r r
�max)r Z context_confZ distrib_confr r r r Y s
zSJISProber.get_confidence) �__name__�
__module__� __qualname__r r �propertyr r r r �
__classcell__r r )r r r $ s !r N)Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zjpcntxr Zmbcssmr Zenumsr r r r r r r �<module> s pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.pyc 0000644 00000005365 14751155147 0021114 0 ustar 00 3
���e � @ s( d dl Z ddlmZ G dd� de�ZdS )� N� )� MachineStatec @ sD e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Ze d d
� �Z
dS )�CodingStateMachinea�
A state machine to verify a byte sequence for a particular encoding. For
each byte the detector receives, it will feed that byte to every active
state machine available, one byte at a time. The state machine changes its
state based on its previous state and the byte it receives. There are 3
states in a state machine that are of interest to an auto-detector:
START state: This is the state to start with, or a legal byte sequence
(i.e. a valid code point) for character has been identified.
ME state: This indicates that the state machine identified a byte sequence
that is specific to the charset it is designed for and that
there is no other possible encoding which can contain this byte
sequence. This will to lead to an immediate positive answer for
the detector.
ERROR state: This indicates the state machine identified an illegal byte
sequence for that encoding. This will lead to an immediate
negative answer for this encoding. Detector will exclude this
encoding from consideration from here on.
c C s0 || _ d| _d| _d | _tjt�| _| j� d S )Nr ) �_model�_curr_byte_pos�_curr_char_len� _curr_state�loggingZ getLogger�__name__Zlogger�reset)�selfZsm� r
�(/usr/lib/python3.6/codingstatemachine.py�__init__7 s zCodingStateMachine.__init__c C s t j| _d S )N)r �STARTr )r r
r
r r ? s zCodingStateMachine.resetc C sh | j d | }| jtjkr0d| _| j d | | _| j| j d | }| j d | | _| jd7 _| jS )NZ class_tabler Zchar_len_tableZ class_factorZ state_tabler )r r r r r r )r �cZ
byte_classZ
curr_stater
r
r �
next_stateB s z CodingStateMachine.next_statec C s | j S )N)r )r r
r
r �get_current_charlenP s z&CodingStateMachine.get_current_charlenc C s
| j d S )N�name)r )r r
r
r �get_coding_state_machineS s z+CodingStateMachine.get_coding_state_machinec C s
| j d S )N�language)r )r r
r
r r V s zCodingStateMachine.languageN) r
�
__module__� __qualname__�__doc__r r r r r �propertyr r
r
r
r r ! s r )r Zenumsr �objectr r
r
r
r �<module> s pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.opt-1.pyc 0000644 00000002030 14751155147 0020266 0 ustar 00 3
���e? � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�EUCKRDistributionAnalysis)�CodingStateMachine)�MultiByteCharSetProber)�CP949_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� CP949Proberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/cp949prober.pyr # s
zCP949Prober.__init__c C s dS )NZCP949r )r
r r r
� charset_name+ s zCP949Prober.charset_namec C s dS )NZKoreanr )r
r r r
�language/ s zCP949Prober.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r " s r N) Zchardistributionr Zcodingstatemachiner Zmbcharsetproberr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.opt-1.pyc 0000644 00000005532 14751155147 0021406 0 ustar 00 3
���e � @ s4 d dl mZ d dlmZmZmZ G dd� de�ZdS )� )�
CharSetProber)�CharacterCategory� ProbingState�SequenceLikelihoodc sb e Zd ZdZdZdZdZd� fdd� Z� fd d
�Ze d d � �Z
e d
d� �Z dd� Z dd� Z
� ZS )�SingleByteCharSetProber�@ i gffffff�?g�������?FNc sJ t t| �j� || _|| _|| _d | _d | _d | _d | _ d | _
| j � d S )N) �superr �__init__�_model� _reversed� _name_prober� _last_order�
_seq_counters� _total_seqs� _total_char�
_freq_char�reset)�self�model�reversedZ name_prober)� __class__� �%/usr/lib/python3.6/sbcharsetprober.pyr ' s z SingleByteCharSetProber.__init__c s: t t| �j� d| _dgtj� | _d| _d| _d| _ d S )N� � )
r r r r
r Zget_num_categoriesr r r r )r )r r r r 5 s z SingleByteCharSetProber.resetc C s | j r| j jS | jd S d S )N� charset_name)r r r
)r r r r r ? s z$SingleByteCharSetProber.charset_namec C s | j r| j jS | jjd�S d S )N�language)r r r
�get)r r r r r F s z SingleByteCharSetProber.languagec C sn | j d s| j|�}|s | jS | j d }x�t|�D ]�\}}|| }|tjk rZ| jd7 _|| jk r�| jd7 _| j | jk r�| j
d7 _
| j s�| j | j | }| j d | }n || j | j }| j d | }| j | d7 < || _ q2W | j d }| jt
jk�rh| j
| jk�rh| j� }|| jk�r@| jjd||� t
j| _n(|| jk �rh| jjd||| j� t
j| _| jS )NZkeep_english_letter�char_to_order_mapr Zprecedence_matrixr z$%s confidence = %s, we have a winnerz9%s confidence = %s, below negative shortcut threshhold %s)r
Zfilter_international_words�state� enumerater ZCONTROLr � SAMPLE_SIZEr r
r r r r Z DETECTING�SB_ENOUGH_REL_THRESHOLD�get_confidence�POSITIVE_SHORTCUT_THRESHOLDZlogger�debugZFOUND_ITZ_state�NEGATIVE_SHORTCUT_THRESHOLDZNOT_ME) r Zbyte_strr �i�c�orderr r Z
confidencer r r �feedM sF
z SingleByteCharSetProber.feedc C sN d}| j dkrJd| jtj | j | jd }|| j | j }|dkrJd}|S )Ng{�G�z�?r g �?Ztypical_positive_ratiog�G�z��?)r r r ZPOSITIVEr
r r )r �rr r r r# | s
z&SingleByteCharSetProber.get_confidence)FN)�__name__�
__module__� __qualname__r! r" r$ r& r r �propertyr r r* r# �
__classcell__r r )r r r ! s
/r N)Z
charsetproberr Zenumsr r r r r r r r �<module> s pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.opt-1.pyc 0000644 00000002031 14751155147 0020546 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�EUCTWDistributionAnalysis)�EUCTW_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� EUCTWProberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/euctwprober.pyr " s
zEUCTWProber.__init__c C s dS )NzEUC-TWr )r
r r r
� charset_name( s zEUCTWProber.charset_namec C s dS )NZTaiwanr )r
r r r
�language, s zEUCTWProber.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r ! s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.opt-1.pyc 0000644 00000002031 14751155147 0020530 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�EUCKRDistributionAnalysis)�EUCKR_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� EUCKRProberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/euckrprober.pyr # s
zEUCKRProber.__init__c C s dS )NzEUC-KRr )r
r r r
� charset_name) s zEUCKRProber.charset_namec C s dS )NZKoreanr )r
r r r
�language- s zEUCKRProber.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r " s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/enums.cpython-36.pyc 0000644 00000004753 14751155147 0016412 0 ustar 00 3
���e} � @ sh d Z G dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG d d
� d
e�ZG d d � d e�Zd
S )zr
All of the Enums that are used throughout the chardet package.
:author: Dan Blanchard (dan.blanchard@gmail.com)
c @ s e Zd ZdZdZdZdZdS )�
InputStatezS
This enum represents the different states a universal detector can be in.
� � � N)�__name__�
__module__� __qualname__�__doc__Z
PURE_ASCIIZ ESC_ASCIIZ HIGH_BYTE� r r �/usr/lib/python3.6/enums.pyr s r c @ s< e Zd ZdZdZdZdZdZdZdZ eeB Z
e
eB eB Z dS ) �LanguageFilterzj
This enum represents the different language filters we can apply to a
``UniversalDetector``.
r r � � � � N) r r r r ZCHINESE_SIMPLIFIEDZCHINESE_TRADITIONALZJAPANESEZKOREANZNON_CJKZALLZCHINESEZCJKr r r r
r s r c @ s e Zd ZdZdZdZdZdS )� ProbingStatezG
This enum represents the different states a prober can be in.
r r r N)r r r r Z DETECTINGZFOUND_ITZNOT_MEr r r r
r s r c @ s e Zd ZdZdZdZdZdS )� MachineStatezN
This enum represents the different states a state machine can be in.
r r r N)r r r r ZSTARTZERRORZITS_MEr r r r
r ) s r c @ s, e Zd ZdZdZdZdZdZedd� �Z dS ) �SequenceLikelihoodzX
This enum represents the likelihood of a character following the previous one.
r r r � c C s dS )z::returns: The number of likelihood categories in the enum.r r )�clsr r r
�get_num_categories; s z%SequenceLikelihood.get_num_categoriesN)
r r r r ZNEGATIVEZUNLIKELYZLIKELYZPOSITIVE� classmethodr r r r r
r 2 s r c @ s$ e Zd ZdZdZdZdZdZdZdS )�CharacterCategoryz�
This enum represents the different categories language models for
``SingleByteCharsetProber`` put characters into.
Anything less than CONTROL is considered a letter.
� � � � � N) r r r r Z UNDEFINEDZ
LINE_BREAKZSYMBOLZDIGITZCONTROLr r r r
r A s r N)r �objectr r r r r r r r r r
�<module> s pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.pyc 0000644 00000005456 14751155147 0017666 0 ustar 00 3
���e� � @ s^ d dl mZ d dlmZ dZdZd ZdZdZdZ dZ
dZ d Z d
Z
eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee eeeeeee
ee
ee
eeeeeeeeeeee ee ee e
eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee e e e e e e
e
e e e e e e e e e
e
e e e e e ee e e e e e
e
e
e e e e e e e e e e e e e e e e e e e e e e e ee e e e e e e e �f ZdZG d d � d e�Zd
S )� )�
CharSetProber)� ProbingState� � � � � � � � c sL e Zd Z� fdd�Zdd� Zedd� �Zedd� �Zd d
� Zd d � Z � Z
S )
� Latin1Proberc s& t t| �j� d | _d | _| j� d S )N)�superr �__init__�_last_char_class�
_freq_counter�reset)�self)� __class__� �"/usr/lib/python3.6/latin1prober.pyr a s zLatin1Prober.__init__c C s t | _dgt | _tj| � d S )Nr )�OTHr � FREQ_CAT_NUMr r r )r r r r r g s zLatin1Prober.resetc C s dS )Nz
ISO-8859-1r )r r r r � charset_namel s zLatin1Prober.charset_namec C s dS )N� r )r r r r �languagep s zLatin1Prober.languagec C sb | j |�}xP|D ]H}t| }t| jt | }|dkr@tj| _P | j| d7 < || _qW | j S )Nr r )
Zfilter_with_english_letters�Latin1_CharToClass�Latin1ClassModelr � CLASS_NUMr �NOT_MEZ_stater �state)r Zbyte_str�cZ
char_classZfreqr r r �feedt s
zLatin1Prober.feedc C s\ | j tjkrdS t| j�}|dk r(d}n | jd | jd d | }|dk rPd}|d }|S )Ng{�G�z�?g r r g 4@g\��(\�?)r r r �sumr )r ZtotalZ
confidencer r r �get_confidence� s
zLatin1Prober.get_confidence) �__name__�
__module__� __qualname__r r �propertyr r r! r# �
__classcell__r r )r r r ` s r N)@r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )Z
charsetproberr Zenumsr r ZUDFr ZASCZASSZACVZACOZASVZASOr r r r r r r r �<module> sh pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.opt-1.pyc 0000644 00000002024 14751155147 0021422 0 ustar 00 3
���e� � @ s� d dl mZ d dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z d dl m
Z
d dlmZ d d lmZ G d
d � d e�Zd S )
� )�CharSetGroupProber)�
UTF8Prober)�
SJISProber)� EUCJPProber)� GB2312Prober)� EUCKRProber)� CP949Prober)�
Big5Prober)� EUCTWProberc s e Zd Zd� fdd� Z� ZS )�MBCSGroupProberNc sD t t| �j|d� t� t� t� t� t� t� t � t
� g| _ | j � d S )N)� lang_filter)
�superr �__init__r r r r r r r r
Zprobers�reset)�selfr )� __class__� �%/usr/lib/python3.6/mbcsgroupprober.pyr * s
zMBCSGroupProber.__init__)N)�__name__�
__module__� __qualname__r �
__classcell__r r )r r r ) s r N)Zcharsetgroupproberr Z
utf8proberr Z
sjisproberr Z eucjpproberr Z gb2312proberr Z euckrproberr Z cp949proberr Z
big5proberr Z euctwproberr
r r r r r �<module> s pip/_vendor/chardet/__pycache__/compat.cpython-36.opt-1.pyc 0000644 00000000431 14751155147 0017472 0 ustar 00 3
���en � @ s@ d dl Z e jdk r(dZdZeefZeZndZdZeefZeZdS )� N� TF)r r ) �sys� version_infoZPY2ZPY3�strZunicodeZbase_strZ text_type�bytes� r r � /usr/lib/python3.6/compat.py�<module> s
pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.opt-1.pyc 0000644 00000004144 14751155147 0022134 0 ustar 00 3
���e� � @ s, d dl mZ d dlmZ G dd� de�ZdS )� )� ProbingState)�
CharSetProberc sR e Zd Zd� fdd� Z� fdd�Zedd� �Zedd � �Zd
d � Zd d
� Z � Z
S )�CharSetGroupProberNc s( t t| �j|d� d| _g | _d | _d S )N)� lang_filter� )�superr �__init__� _active_num�probers�_best_guess_prober)�selfr )� __class__� �(/usr/lib/python3.6/charsetgroupprober.pyr ! s zCharSetGroupProber.__init__c sN t t| �j� d| _x.| jD ]$}|r |j� d|_| jd7 _q W d | _d S )Nr Tr )r r �resetr r
�activer )r �prober)r
r r r ' s zCharSetGroupProber.resetc C s | j s| j� | j sd S | j jS )N)r �get_confidence� charset_name)r r r r r 1 s
z CharSetGroupProber.charset_namec C s | j s| j� | j sd S | j jS )N)r r �language)r r r r r 9 s
zCharSetGroupProber.languagec C s� xx| j D ]n}|sq|jsq|j|�}|s*q|tjkr@|| _| jS |tjkrd|_| jd8 _| jdkrtj| _ | jS qW | jS )NFr r )
r
r �feedr �FOUND_ITr �state�NOT_MEr Z_state)r Zbyte_strr r r r r r A s$
zCharSetGroupProber.feedc C s� | j }|tjkrdS |tjkr"dS d}d | _x\| jD ]R}|s>q4|jsV| jjd|j � q4|j
� }| jjd|j |j |� ||k r4|}|| _q4W | js�dS |S )Ng�G�z��?g{�G�z�?g z
%s not activez%s %s confidence = %s) r r r r r r
r Zlogger�debugr r r )r r Z best_confr Zconfr r r r U s*
z!CharSetGroupProber.get_confidence)N) �__name__�
__module__� __qualname__r r �propertyr r r r �
__classcell__r r )r
r r s
r N)Zenumsr Z
charsetproberr r r r r r �<module> s pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.opt-1.pyc 0000644 00000057637 14751155147 0021213 0 ustar 00 3
���e�1 � @ s4 d�Z d�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zd�S )�� � � � �R �d �h �^ �b �e �t �f �o � �u �\ �X �q �U �O �v �i �S �C �r �w �_ �c �m � �H �F �P �Q �< �` �] �Y �D �x �a �M �V �E �7 �N �s �A �B �: �L �j �g �W �k �p �� �Z �J � � �= �$ �. �G �I �6 �l �{ �n � �3 �+ �) �" �[ �( �4 �/ �, �5 �& �1 �; �' �# �0 � �% �! �- �8 �2 �T �9 �y � � � � �| � � � � � � �
� � � � �
� � � � � � � � � � � �* � �@ �K � � � � g���s�?Fz
ISO-8859-7ZGreek)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1253N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r9 r: r r r r r r r r r r r; r r r r r r r< r= r> r? r@ rA rB r rC r rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r( r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r9 r> r r r r r r r r r r r; r r r r r r r< r r r? r@ rA rB r rC r rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r( r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r ( r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj ry ry rj rj rj rj rj rj rj rj rf rj rj rj r� ry ry rj rj r� rj r� rj ry r� rj rj rj r� rj r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj r� rj rj r� rj ry rj rj r� rj ry rj rj rj r� r� rj r� rj r� rj rj ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� ry rj ry ry rj rj rj rj rj rj rj rj r� rj rj rj rj r� ry rj rj r� rj rj rj rj ry rj rj rj r� ry r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rj rj ry rj rj rj rj rj rj rj rj rj rj rj rj r� ry rf rj rj rj rj ry rj rj ry rj rj ry r� r� r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj r� rj rj rj rj rj rj r� rj rj r� rj rj rj rj rj rj rj rj rj rj r� rj ry rj rj r� ry r� rf r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry rj r� r� r� r� rj rj r� rj rf rj rj rj r� rj rj r� rj rj rj rj r� r� r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj r� rj r� rj rj rj rj rj r� rj ry ry ry rj r� ry rj rj rj rj rj ry rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj rj ry ry ry rj rj rj rj r� rj rf rj rj rj rj ry rj rj rj rj rj rj rj ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry r� rj r� r� r� rj rj ry rj rj rj rj rj r� r� rj ry rj r� ry rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj rj r� r� rj rj r� ry rj r� rj r� rj rj rj r� r� rj r� rj r� ry ry rj rj r� r� r� r� rf r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry r� rj ry rj rj rj rj r� rj rj rj rj rj r� rj rj ry rj ry rj rj ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj ry rj ry rj rj rj rj rj rj r� ry rj ry rj ry ry ry rj ry rj rj ry rj r� ry ry ry rj r� ry r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� r� rj rj rj ry rj rj r� r� rj r� rj r� r� r� rj ry r� rj r� rj r� r� ry r� ry r� r� r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj r� rj rj rj rj rj rj r� rj rj r� rj r� r� r� rj rj r� rj rj rj r� r� rf ry rj r� rj r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry r� r� rj ry ry rj rj r� rj rj rj rj rj ry rf rj r� rj ry rj rj ry rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj r� ry rj rj rj rj rj rj r� r� rj r� rj r� r� r� rj rj r� rj ry rj r� r� rj rj rj r� rj r� r� r� ry r� r� r� r� r� rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj r� rj rj rj rj rj rj r� r� rj r� rj r� r� r� rj ry r� rj ry rj r� r� rj ry rj r� ry r� r� r� r� r� r� r� r� r� rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rf ry ry rj rj rj rj rj rj r� ry rj r� rj r� r� r� rj rj r� rj r� ry r� r� ry rj rf r� ry r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj rj r� rj r� rj rj ry rj r� rj rj rj rj rj rj r� rj rj rj r� ry rj r� r� rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj r� r� rj r� r� r� rj rj r� rj r� ry rj rj r� r� rj r� rj r� rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� r� rj rj rj rj rj rj r� r� rj r� ry r� r� r� rj rj r� rj r� rj r� r� ry r� ry r� r� r� r� r� rf r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj rj r� rj r� ry r� rj ry r� rj ry rj ry rj r� r� rj ry rj ry rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� ry rj rj rj rj rj r� r� r� rj r� ry rf r� r� rj ry ry ry r� rj r� r� ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj ry r� rj r� rj r� rj rj r� ry rf ry rj rj r� r� rj r� rj r� rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rj rj rj r� rj rj rj rj rj rj r� ry rj r� rj r� r� r� ry rf r� ry ry rj r� r� ry ry ry r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� ry rj rj rj ry rj r� r� rf rj r� ry r� r� r� r� rj r� rf r� ry r� r� rf rf rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj rf r� rj r� r� r� rj ry r� rj ry rj rj rj r� r� rj r� rj ry ry ry rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj r� r� rj r� r� r� r� ry r� ry rj rj ry ry ry ry rj r� ry r� ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj ry r� r� r� r� r� r� ry rj r� ry r� ry rj ry r� r� rj r� rj r� rj rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj ry rj rj ry ry rj r� ry r� rj r� r� r� ry r� r� r� r� rf ry r� ry r� ry r� r� ry r� ry r� ry ry r� r� rf r� ry ry ry r� ry ry ry r� ry ry ry r� r� ry r� r� rf r� r� r� r� r� ry r� rj rj ry r� r� r� r� r� r� rf rj r� ry r� ry ry ry r� r� ry r� rj r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� ry rj ry r� ry ry r� ry r� ry ry r� ry r� ry ry ry r� r� r� r� r� r� ry rj r� r� r� ry r� rf ry r� r� r� r� ry ry r� r� r� ry rf r� ry ry r� r� r� r� r� r� rf r� ry r� r� r� r� r� r� r� r� ry rf r� ry rj ry ry rj ry rj ry r� r� rj rj rj r� r� rj ry r� r� r� rf rf r� ry r� ry ry r� ry r� ry r� ry ry r� r� ry r� ry ry ry r� ry ry ry ry r� r� ry r� r� r� ry r� rf r� r� r� r� r� rj r� rj rj ry ry r� rj r� r� r� ry ry r� ry ry ry rf ry r� r� rf ry ry r� r� rj r� r� r� ry r� rf ry r� r� r� rf ry r� r� r� r� r� r� r� ry ry r� rf r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rj rj ry ry r� r� r� ry r� ry rj rj r� ry r� r� r� r� r� r� ry ry ry r� ry ry r� ry r� ry r� ry ry r� r� ry ry ry ry rf r� r� ry ry r� ry r� r� ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� ry r� rj ry rj r� r� r� rj r� r� ry ry r� ry r� ry ry ry r� r� ry r� r� r� r� r� r� r� r� ry r� r� ry ry r� r� ry ry ry r� r� r� r� r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� rj ry r� ry ry ry ry ry r� r� r� ry r� r� r� r� ry r� rf r� r� ry r� rf r� r� r� r� ry ry ry r� ry ry r� rf ry r� ry ry ry r� ry ry ry ry rf ry ry r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� ry r� ry r� ry ry r� r� r� r� rf ry rf r� r� ry ry r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj ry rj r� r� ry r� r� r� ry ry r� ry r� r� r� rf r� r� ry r� ry r� ry ry r� r� r� r� r� r� ry r� r� r� r� ry ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� ry ry rj ry ry r� r� r� r� r� r� rf rj r� ry r� ry ry r� r� r� rf r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� ry r� rj ry r� ry r� r� r� r� r� r� ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� ry r� r� r� r� rf rf r� r� ry rf ry r� ry ry r� rf r� r� rf r� r� r� ry r� r� r� r� r� r� r� rj r� ry ry ry r� r� ry r� r� r� ry r� r� r� ry rj r� ry r� r� r� r� r� r� ry ry r� r� r� ry r� rf ry r� r� r� rf ry ry rf r� r� r� ry r� r� ry r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rf ry r� ry ry r� ry r� r� ry r� r� r� r� rf ry rf r� ry rf r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� rj rf ry ry r� ry r� r� r� r� ry r� r� r� ry r� r� rj r� r� r� r� ry ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rf r� ry r� rf ry r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� rf r� r� r� r� r� r� ry r� ry ry r� r� ry ry ry ry ry r� rf ry r� r� r� ry ry r� rf r� ry r� r� ry ry r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� rj r� r� ry r� r� r� r� r� r� r� r� ry r� ry r� r� r� r� ry r� rf ry r� r� r� r� ry ry rf r� rf r� rf r� ry ry ry rf r� r� r� r� r� r� rf r� r� r� r� r� r� r� ry r� rf ry r� r� r� r� r� r� r� r� r� r� ry r� r� ry ry r� r� r� r� rf r� r� r� r� r� r� ry r� ry ry r� r� r� r� ry ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� ry r� r� ry r� r� r� r� ry ry ry ry r� r� r� rj r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� ry r� r� r� r� r� r� rf r� r� ry r� r� r� r� rf ry r� r� r� r� r� r� ry ry rf rf r� r� r� r� r� r� rf r� r� r� r� r� r� r� ry r� ry ry ry r� r� ry r� r� r� r� r� r� r� ry ry ry r� r� r� ry r� r� r� r� r� r� r� r� ry r� r� rf r� r� r� r� ry rf r� r� r� r� r� r� rf r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� rj r� ry r� r� r� r� r� r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� ry r� r� r� r� ry r� r� ry r� r� r� r� ry ry r� r� r� r� rf r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� ry ry rf r� r� r� r� r� r� ry r� r� ry r� ry ry ry r� r� r� r� r� r� ry r� r� r� r� ry r� r� ry r� r� ry r� ry ry r� r� r� r� ry r� ry r� r� r� r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� rj r� r� r� ry ry r� ry ry r� r� r� r� r� ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� ry r� r� r� r� r� r� ry ry ry ry ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� rf rf r� r� r� rf r� r� r� r� r� r� r� ry rf r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� ry r� r� r� ry r� r� r� r� r� rf r� r� r� r� ry ry r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� rf r� ry r� r� r� r� ry r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� rf rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� rf r� r� ry r� ry r� r� r� r� r� r� r� r� r� r� r� ry rf r� r� r� r� r� r� ry r� r� r� rf ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )ZLatin7_char_to_order_mapZwin1253_char_to_order_mapZGreekLangModelZLatin7GreekModelZWin1253GreekModel� r� r� �$/usr/lib/python3.6/langgreekmodel.py�<module># sV
pip/_vendor/chardet/__pycache__/__init__.cpython-36.pyc 0000644 00000001375 14751155147 0017017 0 ustar 00 3
���e � @ s8 d dl mZmZ d dlmZ d dlmZmZ dd� ZdS )� )�PY2�PY3)�UniversalDetector)� __version__�VERSIONc C sH t | t�s0t | t�s(tdjt| ����nt| �} t� }|j| � |j� S )z�
Detect the encoding of the given byte string.
:param byte_str: The byte sequence to examine.
:type byte_str: ``bytes`` or ``bytearray``
z4Expected object of type bytes or bytearray, got: {0}) �
isinstance� bytearray�bytes� TypeError�format�typer Zfeed�close)Zbyte_strZdetector� r � /usr/lib/python3.6/__init__.py�detect s
r N) �compatr r Zuniversaldetectorr �versionr r r r r r r �<module> s pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.opt-1.pyc 0000644 00000152605 14751155147 0020227 0 ustar 00 3
���e�{ � @ s d Z dZ�dZ�dS ( g �?i � � �� � � �� � �R � � � �� � �� �
�n � �! � � �L �, �A � �s � � � � � �L
�S
� � �� �� � � �. �N �i � � �� �: �� � � �? � � �= �N �K �� � �� �l �� � �
� �� �
� � �
� � � ��
�o �$ � �i � � �c �8 � �� � � � � � � �z �| �� �t �" �
�e �@ �\ � � � � � �� � � �F � �M
�Q �H � � �P �v �� �f �� � � �D �T
�� � �F �N
� �E � �O � �/ �� �s �� �3 �< �2 � � �& �L �� �� �O
� �� �G � � �M � � �? � � �` � �F �* �� �g � �Z �
�: � � � �K �� � � � � � � �� �` �� � � �g � � � �q � �~ � �� �P
� � � �� � �! � �u � � �* � � � �
� �~ �� �� �� � �e �� �G �^ �� �� � � �U �C �� �B �� � � �� � � � �j �o �/ � � �O �2 �[ � �� �
�& � � � �� �S �( � � � �p �] � �6 �i �
�' � � �� � � �8 � �+ �% �[ � � �\ �� � �� � � �X �( � �� �� �0 �� � �H �
�
�" �! �� �+ � �1 �" � � �
�O �G � � �f �1 �� � �� �� � � � �2 �9 �� �l �, �� � � �� � � � �} �h �# �q
�Q �M �& � �X � � �# � �� �
� � �� �j �� �� �M � � �� �% � � � �$ � � �' �� �� �N �i � �7 � �J �� �! �� �� � � �� �M � �) �P �U
�� � � �
� �% �
�
�� � � �
� �I �� �3 �� �
� �r
� �� �� � � � �m �� � �$ � � �x � �� �� � �
� �� �� �% �& �� �
� � � � � � � �& � �' � � �' � � �. � � � � �H � �� � �� �$ �# �� �D �& �A �� � �� �� � � �U �G � �� �� �
�Q
�P �S �' � � �d � �0 �F �� �� �* � � � � � �� �J � � �U � �� � �I �R
� � �< � �S
�: �7
��
�� � � �9 �� �} � �� � � �V �P �T
� �) �C � �� � �& �
�� �) � � �m � �� � � � � �4 �� �� � �n �* � �� � � � � �O � � �� � � �+ �( �
�� �� � �U
�( �� �5 �Y �j �
�l � �u � �) �
�* �+ �V
�
�= �� � �� �� �� �� � �4 � �! �� � �T �, �x �� �� �e � �� �� �J �P � �s
�5 �A �V
�/ �k �� �
� �l �! � �� �A � �` � �
� � �A � �
� � � �
�� � � � �� � � �� �M �
� � � � �� �W
� � �
�t
� �� �+ �} � �j �8
�� � � � � � � �� �- �) �m �� �� �W
�� � � �
� �a � �
�P �K � �, � �� �� �7 �' �u
�� �{ �k �� � � �� �
�9
�� � � � � � � � � � �1 �� �b � �� �
�� � �o �� �X
�, �Q �� � �� � � � ��
��
�X
�� � � �5 �D � � �l � �� �[ �
�� � �Y
� �% � �. �Y � �* � �� �
�� �R �� �� � �p �� � �n �c �g �+ � �� �' �2 � � �� �{ � �l �� �m � � �:
�� �f �
�� �| �5 �� � � �� �Z
�� �
� � �� � �, � � � �� �; �� �I �Y �� �� �[
�X �" �� � �� �� � �~ �� �� �, � �k � �� �- �� � � � � �D � �� � �> �] �� �, �� �� �� �v �L �B �i �& �� �� �
�� � � �G �� �� � �B �� �
�!
�� �� �u � �� � �� � � �a � �� � �v
�S �� �} �;
� �D �� �= �� �0 � �� �\
�( �� � �� �v � � �� �� �� � �. �� �� �9 �H � � �� �� �]
�E � �� �� �� � �! �� �/ �� �� � � �- � � �Q �* � �. �/ �� � �� � �0 �3 � �"
� �* �R � � �� �W �� �� �/ � �b �. �� � � � �� �� �� �� �R � � � �) � �2 � � �� �� �� �� �� � �Z �� �T � �w
� �� �� � � � � � �� � �[ �O � � � �` �7 �x
�^
� � � � �� � �\ �� �� �� �� �� �� �g � � �n � �
�_ � �~ �� � �� �0 � �
�a �� �y
�] �� �� �� � �� � �� � �; �� � �- � �� �L �� �� � �/ � �� �� �� �` �� �# �" �� � �� � �0 �
�s � � �� �d �s ��
�� �Y
�� � �k �w �o �� � �� �� �� �1 � �2 �� �g �p �Q � �U � �v �� � � � �C �S � �^ � � �5 � � �B �� �_ � �b �N �� �� �X � �� � �
� �L �c �
�
� �K �w �* �a �G �3 � �
� � � �1 �6 � �2 �6 �N � � � � �3 �� �: � �\ �q � � � �- �� � � �3 �
�� �� �� �x �
� � �r �� �4 �
�_
� �U � � � �@ � �5 �� � � � � �� �/ �+ �6 � � � � �� � � �
�7 �Z
� �� � �8 �4 � �C � � � �� �l � �`
� �� �� � � �Y � � �� � �5 �� �{ � � � � �$ �7 � �M �V �0 �r � �� � �g � �V � �8 � �9 �, �Z �� � �{ �# �W �0 � � �$ � �
��
� �4 � �[ � �v � � �c � �V �M �$ �- � � � �X � � � �d � �� �W �[
� � �� � � �q ��
� �1 � � � � �t � � � � � � ��
�2 � �2 �: �3 � �. � � �2 �� �
� � � �� � �% � �� � � � �
�� � � � � � �
��
�6 � �4 �� �| � � �S � � � �_ ��
� � �� � �` � � � � � �3 � � �; �r � � � �7 �Y �L �; � �� �� � � � � �T �\ �� � � �< �� �V �5 � � ��
� � � � �" �x �% � �; �8 � � � �2 �E �= �! � � �� �^ � �w ��
�" � �� � �s � �# �< �Q � �� �r �$ � �] � �% � �. �& � �3 �5 �B � �y �' �� � � � � � �> �Y �a
�b
�( �
� �) �* � � � � � �: � �6 � �^ � � � � �( ��
�+ �+ � � �x �, � �. �h �/ �- � � � �
�V � � � �h �� �z �. � � � � �< � �� �; �/ �? � � �
� �0 �8 �� � �� �5 �6 �
�_ �) �1 �2 � �3 �y � � �� �
� �^ �4 � � �? �$ �+ �\
� �5 �_ �W �� � �z
�6 �0 � �
�]
� �� �p �7 � �� �8 �^
�<
�� �V �9 � �6 �� �I �w �} �c
�^ � �
�9 �@ � �
�A � �� � � �: �e �1 � � �B �� �� � �� � �� � � � �7 �; �< �� �= �{
�� �( �` �R �1 �Y � �I �� �� � � �6 � �d
�> �� �� �e
�? �� �o � �q �Y �n � � �l � �C �D �{ �� �
�_
�E �P �U � � � �� � � �E �m � �@ �� �: �
� �
�A � � � � � �#
� �N �
� �B � �C �W �T �T � �� �
� �f
�; �D � �& ��
�| � �� �� � � ��
� � �< �=
��
�� � � �V � ��
� �o �� � �E ��
�F � � � �� �� �� � � � �D �- �8 �� �G �d �� � ��
�H �t �� � �I �z �
� �J ��
��
�K � � �|
� � � � �>
� �� � � � � �L �: � �= �� �M � �?
� � � �H �� � � � �N � � � �O �P � �F �k �Q �9 � �� �� ��
� �u � �v � � � � � �R �S � �� �} �
�> � �� �� � �
�: �T � �� �N � �C �� � �� �U �~ � � �W �� �G � � � �, � � � �� �O �� �| � � �� �O �? �V �` � � � �~ � �w � � � �@ �! �� � �; � � �� � �W �� �" ��
�X � �Y � �R �g
�u � ��
�h
��
�x �= �
� �Z � �< �� � �[ � �# � �= � �\ �$ � �] �H �I �^ �7 �O �$
�
�_ �% �v �J � � �! �w �t � �` �a �b �9 �& �� �" �{ � �� � �' �c �� �d �8 � � � �� �[ �9 � � �d �Z � �e � � �� �@
�! �( �" �f �� �� � �� �# �$ �T �g �K � � �% � �W �M �h � � �i � �� � �% � �� �� � � �
�`
� �y �7 �m �L �j �k � �: �> �! �� �� � � �B �) �l �| � � �
�z � �� �i
�� �M � �� ��
� � �m � �n �u �q �v �� ��
�
�* �N �o �p � � �q �7 �. �r �� �y ��
� � �
� �f � � � �s �! �y ��
�O � � � �� �+ �P �j
��
�> � � � � � �Y � �A �t � �u �%
�
� �v � � �z �2 �w �, �� �� � � �3 �Q �� � �
�x � �6 �9 �k
� � �& �6 �� � �- �
� �R �y �� �Q �9 �c ��
�' �. �
�o �( �B �F �? �l
�� �) �e �� ��
�z ��
�S �T � �� �� �{ �/ � � �" � �b �/ �� �` � � �0 �u � �v � � �1 � �
� � �U � �* �� �/ �E � �S � �8 �Z �| �} �F �+ � �� �! �~ �2 �, �F �P � �m
� �
� �e �s � �C �� �r � � � � � �a �3 �Z �% �- � � �� � �4 � � �� �A � � �
��
�i �
� � � �D �. � � � � �n � � � � ��
� � � � �3 �5 �J �0 �� �s ��
� �� � �@ � � �V � �/ �� �� �6 �W �A �7 �o ��
�� �P �0 � �1 � �n
� � �a �Q �2 � �p �: � � �P � �b �� � � � � �{ �3 �7 �E � � � � �� �| �F �G �X � � � � �� �] ��
�4 � � �}
� �� ��
�5 � �& � �8 �
�� �� � �� � � � � �L � �� � � ��
� �Y �
� � � � �4 �
�B �9 �8 � � � � �� �H ��
�/ �3 �Z �[ � ��
�o
� �� �: �0 �� �n �\ �� �] �� �^ � �� �� � �� � � �I �� � �� �; � �4 � �< � �= �; � � �
� �� �X � � � �� �5 �_ � ��
�
�� � �� �� �} �0 �> �p
�J � � �K � �� �� �&
�F �� �� � ��
��
�# � �[ � � �� �f � �> �q
� �? �r
� �6 � � �� � ��
� �� �� � �j � � � � �@ �- �p �9 �; �6 �y �A �� �� � � �'
� � � � � � � �V �� �� �` �� �4 �� � � �K �
�a ��
�6 �� �� �� � � � �" � � �K � �
� � �� �� �Y �G �o � �b �f �c �7 � �s
�p �r � �8 �� � � � � � �A
�Q �
�C �, �
� �� � � �� �\ �L � �u � �~
��
�� � �9 �� �� �B � �Z � � �
�C �� �� � �j �d � �0 �h �g � �e �� �M �} �7 ��
� �
� �D � � � � � �f �: �� � �N �; �
�E �F � �(
� � �< � �� �G �M �= �w �g � �~ �t �? �� � � �
�t �m �# �� � �+ � � �h � �� � � � �[ �
�O � � � �� �
�� �B
� �� �$ �t
� �
� � �a �� � � �H � � � �� �Q �" �< �
�� � �- �1 � �# �u
�' �� �D �� � � �
��
�I �� �> �J �% �� � �P � �
�i � �
�= �a
� �K � �v
�� �� �� �� �
� �� � �_ �� �j �� �? �E �1 ��
��
� �k �� �8 �Q �� � �l �� �� �
� �m �@ �
� �b �� � �� � �R �� �� � �5 �� � �� � �L � �w
� �n � �� � �4 �H � �� �M � � � � � �� �� � �\ � �o �� �N �] � � �
� �\ �x
�g � �E �
�� �� �� � �� �� �p � ��
� �q �
� �� �� � �� �O �� �� �� �r � �Z � �s �t �� � � � �P �e �� �� �� �� �� �o �� �� �^ � �} �� �� �� �z �A �& �� �� � ��
�� �� �n �- �� ��
�Q � �i �
�� � �� �R �� �u �� �� � � �B �� �� ��
�y
� �� �v �w �B �h �q �� � � �< � �* �i �S �" �T �C �> �) �
�x �U � �� � �~ �� � �� �z �� �V � � �� �� �C
�) �q � �� �W �
�� �� �� �D �� �E �T �F �p �� �� �# �# �y � ��
� �� �G �� �z
� � �� � � �� � � �S �� �X �
� �� �� �� �u �
�= �H � � �_ � �R � � � � �� �w �� �� �Y �z �{ �q �� � �3 �� �5 �� �
�� �{
� � �| �} �S �~ �� �
�
� �Z �[ �� � � � � �` �� �F � �] � � �n �� �� �I �� �
� �� �� � �� � �G �T �J �� �K �z �S �r �\ �)
� �
�v � �5 �� � � ��
�b � � �j � � �� �� ��
� � �] �^ � � � �c �� �� � � �
�� ��
�a �: �1 �� � � �� �A �h � �a ��
�6 �� � � � �b
�- �� �
�H �_ � �� � �
� � �� � � �� � �|
� �*
�f �� � �� � �
�D
� �
�L �W � � � �U � �
� � �$ �� �
�
�� �N � � �R �k � �E
�� �� � � �M �� �S �' � �` �� �s � �F
� � �a �}
�� ��
�( �j � � �~
�V �B �[ �b �W �� �� �b �
�I � �c
� �
� �{ �� � �� �� �� �c �
�� � �d �
�
�] �� �� � �= �e � �� � � � �
� �� �
�N � � �� �f �g �
��
�
� �h � � � � ��
�= � �X � � � � � � � � �d
� �H �C �
�i � �T �W �
�
� �9 � � �N �� �K �E �j �4 �J �
�Y �
� �G
� �k � � �h �O � �
�
� �] �P �Z � �l �� �Q �[ �k � �m �n �R �o �c � � � � � �S �X � � � �\ �+ �� �� � �� �I �T �U �U �� � �
�� �l ��
�D � � � �p � �q �
�k � �m � �
�K � � � � � �� �V �8 ��
� � �r �@ �W �r ��
�C �G � � � �
� �^ �
�� �� �8 �t � �: �� �
�! � �n �s � �" ��
�# �$ �] �t � �% ��
�& �r �u �' �+
�( �) � �e
�
�} �
� �� � �* �4 �1 �+ � � �� �� �� � � �, � ��
�> �X �t �r �? �� �
�- � �v �u �{ �� �w �w �� �. �x �T �,
� � � �/ �0 �� �� �� �1 ��
� �2 ��
�G �R �
� �^ � �Y �
�Z �� �
�[ �3 �^ � � � �� �� �
�) �\ � �4 �@ �v � �5 � �6 �7 � �d �] ��
�� �^ �8 � �& �� � � � �9 �y �u � � �
�� �z �R � �{ � � �� �( �_ �� �< �9 � �l � �� �� �_ �
�S �` �k �� �[ � � � �
�x �: � �; �< �!
�$ �= � �| � � �> �d ��
� �? �e � � �� �� � � � �� � ��
�} �@ �A �B �� �. �~ �a �O �
�� �� �` �b � �
�% � � �� �
�; ��
� � � �C � �D �� � � �� �f
�"
�L �
� � � ��
�E �; � �F �& �G ��
�
�� �x �H �) �� � �c � �I �d �T � ��
�
�e �� �� �� � � � �J � �g �~ � �U � �e � � � � �f �a �8 �g ��
� �b �h �K �y �� � � �L � �: �
�� � � �� �* �M �i � �� �c �t �� �M �N �� � � � � � �
� � �f � � �Y �d �e � �* � �� �O �H
� �#
�� �# �; �
�� �� � �� �I
�\ �@ � � �� �s �$
��
�P �Q �
� �
�R �j �S �T �� �+ �� �U � �V � �� �L �
�! � �J
�\ �4 �W �� � �X �Y �Z � �[ �> �w �k �f � �� �+ � � �%
�� � �$ � �\ � � � �l �
�] � �l �^ �_ �g
�% � �` �a �g � � �� �
�� �N �K
�b �c �d � �
�c �w ��
�e �� �b �y � �f �h �g �h �h � �' �i � �m �� �z �j �d �i �� � � �< �� � �| � � �� � � � � � �O �k ��
�l � � �
�a � � �m �� � � �n �
� �u �� �n � � �� �e �&
�
�o �� � � � �< �� �p �q �P �Q � �j �� � � � �� �( � �_ �r �s � � � � �< �E �R �f �� �� � �� �] � � �I �t �= � �u � �v � �
�� �o �
�
�k �, �l �w �'
� � �m � � � �F �` � �� �f �� � �
�S �J �x � �y �z �n � �L
�� �p �O �� � � �
�{ ��
� � �A �y � �� �U �� �| �} �~ �F � �q �� ��
� �� � � � � � �� � � �p � �� �B � �o � � � � �p � �-
�� �r � � �q �q �� �(
�� �r � � � �s � �� �� �
� � ��
�( �.
�s �)
� �t � �� � �*
�� �u � � �T �v �M
�{ � � �t � �' �� � � �
�� � � � � �� �� �g �Z �w �
� �c � �j �+
�p � � � �x �� �� � �h � � � �
� � � �� �,
�= � � �� � �u � � � �� �/
�y � �
�� �y �v � �� � �w � � � � �� � � �
�z � � � �� �> �� �C �' � � �� �{ � �Z � � � � � � �� �� �a � �� � � �q �? � �
� �| � � �" � ��
�� � �} �� � � �� �= � �A � �1 � �) � � � �? �
�
� � � �x � � � � � �
� � �h � �S � �� � �( � �
� � �' �x �y � �
� � �
��
� � � �� �_ � �� � �> � �} �P � �� �� � � � �~ � �
�N
� �c � �
� � � �H � � �i � � � �� � � � � � � � � �j � � � �* � � � �
�� � � � �h
� � �_ � � �/ � �< � �~ �7 �k �T � � �] � �U �b �
�t � � �g � �z �� �
�� �| � �� � � � � � � �{ � � � � �0
� ��
� �+ � �, � � � �I � � � � � � �� � �B � � �4 �s �
� � � � �� ��
� � �? �C � � � � �G �� �� � � � � � � � � � �� �� � � �| �1
� � �m �C �� �� �l � � �i
�} �� �? �� �� � � �� � �h �� �� �I �� �� � �V � �� � �� � � �� �^ � �� �� � �- �. � � �) � � �
� � � �2
� �i � �� ��
�� � � �A � � �� �-
�� �� � � �� �
�� �
� �� � � � �� � �
� �
� �� �
�� �� �Q �� �
�O
� � � �� � � � �z �K �� �� � �[ �� �J �� �� �@ � �.
� � � � �D � �} �/
�@ � �
�� � ��
� �@ � �R �� � �� �j
�~ � �� �J � �� ��
�� � � �� �
�0
� �m � �� � �m �~ �� � �� � �1
�� � �� � � � � � �
�d �� �� �� �X � �� �9 �� � � �� �� �U � �� � � �� �L � �3
�� � �� �
� �� �� �� � �� � �� �
� � �$ �( �v �� � �& �� �b � �� � �� � � � � � �� �� �{ � � �� �� �� � �� �� � �� �2
� � �� �� � �� � � �
� � �� �� � � � �^ � �� �V � � � � �� � � �� � �� � � � � �2 �W � �
�W �o �i � �k
�X � � � �A �4
� �
� �3
� � �� � � � � ��
� �� �
� � � � � � �� � �� �H � � � � � � � � � � �D � � �I �s �
� � �
�� � � � � � �w � �{ � � � � � � �/ �n �, � � � �� � �� � � �
� � � � �
� �4
�B � � � �P
�5
��
� �
� �� �
� � � � �| � �z � � � � �
�' � �5
� � � �! � � �y �� � �V � � � �� � � � � �� � �� � �� � � �
� � �- � � � � � ��
� �
�� � �� � � ��
� �" �% � � � �J �C � �� �x � � � � � � � �l
�6
� � � � �
� �
�� � �X � � � �7
� �� �
�N � �m
� � �� � �W � � �! � � �
��
�> �8
� �" �# �9
�j �D �� � � �$ �
�% � �
� � �X �& � �' �E � �( �F � �) � �x �� �k � � � �� �* �+ � �� �� �D � � �, � � � � � � �K �- �. �/ �:
� �0 �J � � �1 �| � � � �� � � �� �E �* �2 �
� � � � �� �H �x � �� � �3 � �� � � �3 � �� �� �;
�p �� �<
� �� � � �� �4 �5 � � �6 � �O �� �
�7 �8 �� �9 �� �: � �� �; �� �� �� �� �< �
� �Y �= �> �
� �? �� �@ �A �B �
�� � �=
�� �� � �o � �f �� � �� ��
��
� � �C � �D � �# � �
�>
� �E � � �F �Z �E � � �� �[ �$ �
�� �G �?
� �� �� �� �G �� �� � �@
�H �� �A
�\ �L � � �� �� �
�I � � � � � � �i �J � �� �
� �K �L �] �M �N �
�� �j � �Q
�
�B
�O �P �� � �Q �
� �� �R �
�S �T �� �( �� � � �C
�� �U � �V � �W �X �� �� �Y � �� �� �Z � �� �d �[ �c �H � �_ � �# �0 �\ � �] � �n �
�� �� �� � �^ � � �_ �k �D
�� �` �a � � �b �� �� � �c � � � �� �d � � �� �� � � �d �^ �E
�e � � �� �
� � � �f � �_ �7 � � �� � �
�� �F
� � �g �- �� � �! � �� �h � �q �; � � �� � �X � � � �� � �i �j � �� �� �
�k �l �� �� �~ �m �G
�` �n �y �p � �� �o �> � �p �� �q �
� � �r �� �a �� � � �s �t �" �u �| �� �? � � � �v � � �� �� �� �e � � �w �x �y � � � �� �z �{ �@ �| �� � �} � � � �� �% �s � �R
� �. �� �M �? �
�� �~ � �� �b � �� �@ �� �� � � �� �� �� � �� �� �� � �� � �
� �6
�I �� � � � � � � � �c �� �� � � � � � �2 � � �� �m � �@ � � � � �� � �N � � � �f � � � �Z �
� � � � � �� �\ �H
� �d �� �� �J �� �� � �� ��
� � � �� �� �K � �� � �# �� �� �� � �� �� � � � �K �� � � � �g � � �� �h �� �> � �. �� �� � � �� � � � �) �n
�t � � � � �
�o
��
�I
�� �
� � �q �� �� �r � � � �� � � �p
�� �� � �� �z � � � �U � �J
� � �1 �K
�t � � � � � �� �
�� �� �J �� � �L � � �� � � � � N( r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r )Z EUCTW_TYPICAL_DISTRIBUTION_RATIOZEUCTW_TABLE_SIZEZEUCTW_CHAR_TO_FREQ_ORDER� r r � /usr/lib/python3.6/euctwfreq.py�<module>, s� pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.pyc 0000644 00000004436 14751155147 0017601 0 ustar 00 3
���e� � @ s` d dl mZmZ d dlmZ d dlmZ d dlmZ d dl m
Z
d dl m Z G dd� de�Z
d S )
� )� ProbingState� MachineState)�MultiByteCharSetProber)�CodingStateMachine)�EUCJPDistributionAnalysis)�EUCJPContextAnalysis)�EUCJP_SM_MODELc sP e Zd Z� fdd�Z� fdd�Zedd� �Zedd� �Zd d
� Zd d � Z � Z
S )
� EUCJPProberc s4 t t| �j� tt�| _t� | _t� | _ | j
� d S )N) �superr �__init__r r � coding_smr �distribution_analyzerr �context_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/eucjpprober.pyr % s
zEUCJPProber.__init__c s t t| �j� | jj� d S )N)r
r r r )r )r r r r , s zEUCJPProber.resetc C s dS )NzEUC-JPr )r r r r � charset_name0 s zEUCJPProber.charset_namec C s dS )NZJapaneser )r r r r �language4 s zEUCJPProber.languagec C s6 x�t t|��D ]�}| jj|| �}|tjkrN| jjd| j| j |� t
j | _ P q|tj
krdt
j| _ P q|tjkr| jj� }|dkr�|d | jd< | jj| j|� | jj| j|� q| jj||d |d � |� | jj||d |d � |� qW |d | jd< | jt
jk�r0| jj� �r0| j� | jk�r0t
j| _ | jS )Nz!%s %s prober hit error at byte %s� r ���)�range�lenr Z
next_stater ZERRORZlogger�debugr r r ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenZ
_last_charr �feedr
�stateZ DETECTINGZgot_enough_data�get_confidenceZSHORTCUT_THRESHOLD)r Zbyte_str�iZ coding_stateZchar_lenr r r r 8 s4
zEUCJPProber.feedc C s | j j� }| jj� }t||�S )N)r r r
�max)r Z context_confZ distrib_confr r r r Y s
zEUCJPProber.get_confidence) �__name__�
__module__� __qualname__r r �propertyr r r r �
__classcell__r r )r r r $ s !r N)Zenumsr r Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zjpcntxr Zmbcssmr r r r r r �<module> s pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.opt-1.pyc 0000644 00000005456 14751155147 0020625 0 ustar 00 3
���e� � @ s^ d dl mZ d dlmZ dZdZd ZdZdZdZ dZ
dZ d Z d
Z
eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee eeeeeee
ee
ee
eeeeeeeeeeee ee ee e
eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee e e e e e e
e
e e e e e e e e e
e
e e e e e ee e e e e e
e
e
e e e e e e e e e e e e e e e e e e e e e e e ee e e e e e e e �f ZdZG d d � d e�Zd
S )� )�
CharSetProber)� ProbingState� � � � � � � � c sL e Zd Z� fdd�Zdd� Zedd� �Zedd� �Zd d
� Zd d � Z � Z
S )
� Latin1Proberc s& t t| �j� d | _d | _| j� d S )N)�superr �__init__�_last_char_class�
_freq_counter�reset)�self)� __class__� �"/usr/lib/python3.6/latin1prober.pyr a s zLatin1Prober.__init__c C s t | _dgt | _tj| � d S )Nr )�OTHr � FREQ_CAT_NUMr r r )r r r r r g s zLatin1Prober.resetc C s dS )Nz
ISO-8859-1r )r r r r � charset_namel s zLatin1Prober.charset_namec C s dS )N� r )r r r r �languagep s zLatin1Prober.languagec C sb | j |�}xP|D ]H}t| }t| jt | }|dkr@tj| _P | j| d7 < || _qW | j S )Nr r )
Zfilter_with_english_letters�Latin1_CharToClass�Latin1ClassModelr � CLASS_NUMr �NOT_MEZ_stater �state)r Zbyte_str�cZ
char_classZfreqr r r �feedt s
zLatin1Prober.feedc C s\ | j tjkrdS t| j�}|dk r(d}n | jd | jd d | }|dk rPd}|d }|S )Ng{�G�z�?g r r g 4@g\��(\�?)r r r �sumr )r ZtotalZ
confidencer r r �get_confidence� s
zLatin1Prober.get_confidence) �__name__�
__module__� __qualname__r r �propertyr r r! r# �
__classcell__r r )r r r ` s r N)@r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )Z
charsetproberr Zenumsr r ZUDFr ZASCZASSZACVZACOZASVZASOr r r r r r r r �<module> sh pip/_vendor/chardet/__pycache__/version.cpython-36.pyc 0000644 00000000550 14751155147 0016737 0 ustar 00 3
���e� � @ s d Z dZejd�ZdS )z�
This module exists only to simplify retrieving the version number of chardet
from within setup.py and from chardet subpackages.
:author: Dan Blanchard (dan.blanchard@gmail.com)
z3.0.4�.N)�__doc__� __version__�split�VERSION� r r � /usr/lib/python3.6/version.py�<module> s pip/_vendor/chardet/__pycache__/escsm.cpython-36.opt-1.pyc 0000644 00000016167 14751155147 0017336 0 ustar 00 3
���e) � @ s� d dl mZ dZejejdejejejejejejejejejejejejejejejejejejejdejdejdejdddejdejdddejdejdejejejejejejejf0ZdZedeedd d
�ZdZ ejdejejejejejejejejejejejejejejejejejejejejejejejejejejejejdejejejejejejejejejddejejejejejejejejejejejejejejejejejejejejejejf@Z
dZ e d e
e d d d
�Z dZ
ejdejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejdejejejdejejejejejdejejejejejejejejejejejejejejejejejejejejejejejejejejejejfHZdZe
deeddd
�ZdZejdejejejejejejejejejejejejejejejejejejejdejejejejejejdejejejejejejejejejejejf(Zd Zedeeddd
�ZdS ) � )� MachineState� � � � � � z
HZ-GB-2312ZChinese)Z class_tableZ class_factorZ state_tableZchar_len_table�nameZlanguage� z ISO-2022-CN� � �
z ISO-2022-JPZJapanesez ISO-2022-KRZKoreanN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r ) r r r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )
r r r r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r )Zenumsr ZHZ_CLSZSTARTZERRORZITS_MEZHZ_STZHZ_CHAR_LEN_TABLEZ HZ_SM_MODELZ
ISO2022CN_CLSZ ISO2022CN_STZISO2022CN_CHAR_LEN_TABLEZISO2022CN_SM_MODELZ
ISO2022JP_CLSZ ISO2022JP_STZISO2022JP_CHAR_LEN_TABLEZISO2022JP_SM_MODELZ
ISO2022KR_CLSZ ISO2022KR_STZISO2022KR_CHAR_LEN_TABLEZISO2022KR_SM_MODEL� r r �/usr/lib/python3.6/escsm.py�<module> sp " $ $ $ pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.opt-1.pyc 0000644 00000013173 14751155147 0021760 0 ustar 00 3
���e�0 � @ s� d Z ddlZddlZddlZddlmZ ddlmZmZm Z ddl
m Z ddl m
Z
ddlmZ dd lmZ G d
d � d e�ZdS ) a
Module containing the UniversalDetector detector class, which is the primary
class a user of ``chardet`` should use.
:author: Mark Pilgrim (initial port to Python)
:author: Shy Shalom (original C code)
:author: Dan Blanchard (major refactoring for 3.0)
:author: Ian Cordasco
� N� )�CharSetGroupProber)�
InputState�LanguageFilter� ProbingState)�EscCharSetProber)� Latin1Prober)�MBCSGroupProber)�SBCSGroupProberc @ sn e Zd ZdZdZejd�Zejd�Zejd�Z dddd d
d d d
d�Z
e j fdd�Z
dd� Zdd� Zdd� ZdS )�UniversalDetectoraq
The ``UniversalDetector`` class underlies the ``chardet.detect`` function
and coordinates all of the different charset probers.
To get a ``dict`` containing an encoding and its confidence, you can simply
run:
.. code::
u = UniversalDetector()
u.feed(some_bytes)
u.close()
detected = u.result
g�������?s [�-�]s (|~{)s [�-�]z Windows-1252z Windows-1250z Windows-1251z Windows-1256z Windows-1253z Windows-1255z Windows-1254z Windows-1257)z
iso-8859-1z
iso-8859-2z
iso-8859-5z
iso-8859-6z
iso-8859-7z
iso-8859-8z
iso-8859-9z iso-8859-13c C sN d | _ g | _d | _d | _d | _d | _d | _|| _tj t
�| _ d | _ | j
� d S )N)�_esc_charset_prober�_charset_probers�result�done� _got_data� _input_state�
_last_char� lang_filter�loggingZ getLogger�__name__�logger�_has_win_bytes�reset)�selfr � r �'/usr/lib/python3.6/universaldetector.py�__init__Q s zUniversalDetector.__init__c C sZ dddd�| _ d| _d| _d| _tj| _d| _| jr>| jj � x| j
D ] }|j � qFW dS )z�
Reset the UniversalDetector and all of its probers back to their
initial states. This is called by ``__init__``, so you only need to
call this directly in between analyses of different documents.
Ng )�encoding�
confidence�languageF� ) r r r r r �
PURE_ASCIIr r r r r
)r �proberr r r r ^ s
zUniversalDetector.resetc C s> | j r
dS t|�sdS t|t�s(t|�}| js�|jtj�rJdddd�| _nv|jtj tj
f�rldddd�| _nT|jd�r�dddd�| _n:|jd �r�d
ddd�| _n |jtj tj f�r�d ddd�| _d | _| jd
dk r�d | _ dS | j
tjk�r.| jj|��rtj| _
n*| j
tjk�r.| jj| j| ��r.tj| _
|dd� | _| j
tjk�r�| j�s^t| j�| _| jj|�tjk�r:| jj | jj � | jj d�| _d | _ n�| j
tjk�r:| j �s�t | j�g| _ | jt!j"@ �r�| j j#t$� � | j j#t%� � x@| j D ]6}|j|�tjk�r�|j |j � |j d�| _d | _ P �q�W | j&j|��r:d | _'dS )a�
Takes a chunk of a document and feeds it through all of the relevant
charset probers.
After calling ``feed``, you can check the value of the ``done``
attribute to see if you need to continue feeding the
``UniversalDetector`` more data, or if it has made a prediction
(in the ``result`` attribute).
.. note::
You should always call ``close`` when you're done feeding in your
document if ``done`` is not already ``True``.
Nz UTF-8-SIGg �?� )r r r zUTF-32s �� zX-ISO-10646-UCS-4-3412s ��zX-ISO-10646-UCS-4-2143zUTF-16Tr r ���)(r �len�
isinstance� bytearrayr �
startswith�codecs�BOM_UTF8r � BOM_UTF32_LE� BOM_UTF32_BE�BOM_LE�BOM_BEr r r! �HIGH_BYTE_DETECTOR�search� HIGH_BYTE� ESC_DETECTORr Z ESC_ASCIIr r r �feedr ZFOUND_IT� charset_name�get_confidencer r
r r ZNON_CJK�appendr
r �WIN_BYTE_DETECTORr )r Zbyte_strr" r r r r3 o s|
zUniversalDetector.feedc C s� | j r | jS d| _ | js&| jjd� n�| jtjkrBdddd�| _n�| jtjkr�d}d}d}x,| j D ]"}|slqb|j
� }||krb|}|}qbW |r�|| j kr�|j }|j j
� }|j
� }|jd �r�| jr�| jj||�}|||jd�| _| jj� tjk�rz| jd
dk�rz| jjd � xn| j D ]d}|�s �qt|t��rZxF|jD ] }| jjd |j |j|j
� � �q4W n| jjd |j |j|j
� � �qW | jS )
z�
Stop analyzing the current document and come up with a final
prediction.
:returns: The ``result`` attribute, a ``dict`` with the keys
`encoding`, `confidence`, and `language`.
Tzno data received!�asciig �?r# )r r r Ng ziso-8859r z no probers hit minimum thresholdz%s %s confidence = %s)r r r r �debugr r r! r1 r
r5 �MINIMUM_THRESHOLDr4 �lowerr( r � ISO_WIN_MAP�getr ZgetEffectiveLevelr �DEBUGr& r Zprobers) r Zprober_confidenceZmax_prober_confidenceZ
max_proberr" r4 Zlower_charset_namer Z group_proberr r r �close� s`
zUniversalDetector.closeN)r �
__module__� __qualname__�__doc__r: �re�compiler/ r2 r7 r< r ZALLr r r3 r? r r r r r 3 s"
mr )rB r) r rC Zcharsetgroupproberr Zenumsr r r Z escproberr Z latin1proberr Zmbcsgroupproberr Zsbcsgroupproberr
�objectr r r r r �<module>$ s pip/_vendor/chardet/__pycache__/enums.cpython-36.opt-1.pyc 0000644 00000004753 14751155147 0017351 0 ustar 00 3
���e} � @ sh d Z G dd� de�ZG dd� de�ZG dd� de�ZG dd� de�ZG d d
� d
e�ZG d d � d e�Zd
S )zr
All of the Enums that are used throughout the chardet package.
:author: Dan Blanchard (dan.blanchard@gmail.com)
c @ s e Zd ZdZdZdZdZdS )�
InputStatezS
This enum represents the different states a universal detector can be in.
� � � N)�__name__�
__module__� __qualname__�__doc__Z
PURE_ASCIIZ ESC_ASCIIZ HIGH_BYTE� r r �/usr/lib/python3.6/enums.pyr s r c @ s< e Zd ZdZdZdZdZdZdZdZ eeB Z
e
eB eB Z dS ) �LanguageFilterzj
This enum represents the different language filters we can apply to a
``UniversalDetector``.
r r � � � � N) r r r r ZCHINESE_SIMPLIFIEDZCHINESE_TRADITIONALZJAPANESEZKOREANZNON_CJKZALLZCHINESEZCJKr r r r
r s r c @ s e Zd ZdZdZdZdZdS )� ProbingStatezG
This enum represents the different states a prober can be in.
r r r N)r r r r Z DETECTINGZFOUND_ITZNOT_MEr r r r
r s r c @ s e Zd ZdZdZdZdZdS )� MachineStatezN
This enum represents the different states a state machine can be in.
r r r N)r r r r ZSTARTZERRORZITS_MEr r r r
r ) s r c @ s, e Zd ZdZdZdZdZdZedd� �Z dS ) �SequenceLikelihoodzX
This enum represents the likelihood of a character following the previous one.
r r r � c C s dS )z::returns: The number of likelihood categories in the enum.r r )�clsr r r
�get_num_categories; s z%SequenceLikelihood.get_num_categoriesN)
r r r r ZNEGATIVEZUNLIKELYZLIKELYZPOSITIVE� classmethodr r r r r
r 2 s r c @ s$ e Zd ZdZdZdZdZdZdZdS )�CharacterCategoryz�
This enum represents the different categories language models for
``SingleByteCharsetProber`` put characters into.
Anything less than CONTROL is considered a letter.
� � � � � N) r r r r Z UNDEFINEDZ
LINE_BREAKZSYMBOLZDIGITZCONTROLr r r r
r A s r N)r �objectr r r r r r r r r r
�<module> s pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.opt-1.pyc 0000644 00000113272 14751155147 0017525 0 ustar 00 3
���e�L � � @ s8 d`Z G dd� de�ZG dd � d e�ZG d
d � d e�Zd S )a� � � � � � c @ sP e Zd ZdZdZdZdZdZdd� Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
dS )�JapaneseContextAnalysis� r �d i� r c C s* d | _ d | _d | _d | _d | _| j� d S )N)�
_total_rel� _rel_sample�_need_to_skip_char_num�_last_char_order�_done�reset)�self� r � /usr/lib/python3.6/jpcntx.py�__init__{ s z JapaneseContextAnalysis.__init__c C s* d| _ dg| j | _d| _d| _d| _d S )Nr r F���)r
�NUM_OF_CATEGORYr r r
r )r r r r r � s
z JapaneseContextAnalysis.resetc C s� | j r
d S | j}x�||k r�| j|||d � �\}}||7 }||krV|| | _d| _q|dkr�| jdkr�| jd7 _| j| jkr�d| _ P | jt| j | d7 < || _qW d S )Nr r Tr r r )r r � get_orderr
r
�MAX_REL_THRESHOLDr �jp2CharContext)r �byte_strZ num_bytes�i�order�char_lenr r r �feed� s
z JapaneseContextAnalysis.feedc C s | j | jkS )N)r
�ENOUGH_REL_THRESHOLD)r r r r �got_enough_data� s z'JapaneseContextAnalysis.got_enough_datac C s, | j | jkr"| j | jd | j S | jS d S )Nr )r
�MINIMUM_DATA_THRESHOLDr � DONT_KNOW)r r r r �get_confidence� s z&JapaneseContextAnalysis.get_confidencec C s dS )Nr r )r r r )r r r r r r � s z!JapaneseContextAnalysis.get_orderNr )�__name__�
__module__� __qualname__r r! r r r r r r r r" r r r r r r t s r c s0 e Zd Z� fdd�Zedd� �Zdd� Z� ZS )�SJISContextAnalysisc s t t| �j� d| _d S )NZ SHIFT_JIS)�superr& r �
_charset_name)r )� __class__r r r � s z SJISContextAnalysis.__init__c C s | j S )N)r( )r r r r � charset_name� s z SJISContextAnalysis.charset_namec C s� |sdS |d }d| ko"dkn s@d| ko:dkn rld}|dksdd | ko^dkn rpd
| _ nd}t|�dkr�|d }|d kr�d| ko�d kn r�|d |fS d|fS )Nr r � � �� � r � � ZCP932�� �� r )r r r )r( �len)r r �
first_charr � second_charr r r r � s 0 z SJISContextAnalysis.get_order)r# r$ r% r �propertyr* r �
__classcell__r r )r) r r& � s r& c @ s e Zd Zdd� ZdS )�EUCJPContextAnalysisc C s� |sd S |d }|dks0d| ko*dkn r6d}n|dkrDd}nd}t |�dkr�|d }|d kr�d| kovd
kn r�|d |fS d
|fS )Nr r � � � r � r � �� r )r r r )r3 )r r r4 r r5 r r r r � s z EUCJPContextAnalysis.get_orderN)r# r$ r% r r r r r r8 � s r8 N�Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )Sr? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )r �objectr r& r8 r r r r �<module> s� C pip/_vendor/chardet/__pycache__/big5freq.cpython-36.pyc 0000644 00000152574 14751155147 0016774 0 ustar 00 3
���ez � @ s d Z dZ�dZ�dS ( g �?� � � �� � � �� � �R � � � �� �a �� � �n �� �! �� � �L �, �B � � � � � � � �{
�]
� � �
�j � � �. �N �i � � �� �: � � � �? � � �= �N �K �� � �k �q �� � ��
� �� � �b � �
� � � ��
�o �2 � �i � �� �c �8 � � � � � � � � �{ �| �� � �" ��
� �@ �\ � �� � � � �� � � �F � �|
�Q �H � � �P �v �� � �� � � �D �^
�� � �F �}
� �E � �O � �0 �� �s �� �4 �< �2 � � �& �M �� �� �~
� �� �G � � �[ � � �? � � �a � �K �* � �g �� �Z �
�: � � � �K � � � � � � � �� �` �l � � � � �
� �q � �~ � �� �
� � �� �� � �c � �u � � �* � � � ��
� �~ �m �� �� � �e � �G �^ � �n � � �U �C �� �C �� � � �� � � � �j �o �/ � � �P �7 �[ �� �� ��
�? � � � �o �S �( � � � �p �] � �6 �j � �@ � � �� � � �8 � �+ �3 �[ � � �\ � � �� � � �] �A � �� �� �1 �� � �H ��
��
�d � �� �+ � �2 � � � ��
�O �L � � �f �1 �� � � �� � � � �3 �9 �� �l �, �� � � �� � � � � � �e �z
�Q �M �& �� �X � � � � �� �
� � �� �k �p � �M � � �� �% � � � � � � �' �� � �\ � � �7 � �J � �! �� �� � � �� �N � �B �P �_
�q � � ��
� � ��
��
� � � � � �I �� �8 �� �
� �{
� �� �
� � � �m �� � �f � � �x � �� � � ��
� �
�� �g � �� �
� � � � � � � �& � �' � � � � � �. � �� � � �M � �� � � �$ �# �� �D �h �A � � �� �r � � �U �G � �� �� �
�
�Q �S �i � � �d � �0 �F �� �� �C � � � � � �� �J � �� �U � �� � �N �
� � �< � �
�: �A
��
� � � �9 �� �} � �� � � �W �P �
� �) �D � � � �4 ��
�� �) �� � �r � �s � �� �t � �9 �� � � �s �* � � � � � � �] � � � � � �D �j �(
�
�� � �
� �u �5 �Y �j � �l � �u � � ��
� � �`
�
�= �� � �� �� �� � � �5 � �! �� � �T �E �x � � �e � �� �� �O �P � �|
�6 �A �
�/ �k �� �
� �l �! � �� �B � �` � �
�� � �A � � � � � ��
�v � �� � �w � � �� �M �
� �� � � � �a
� � ��
�}
�� �x �, �} � � �B
� � � �� � � � � �F �k �m � �� �
�� � � ��
� �b � �)
�^ �P �
�, � �� �� �7 �5 �~
�y �| � �z � � �� ��
�C
�{ � � � � � �� � � � �1 �� �b � � ��
�� � �t �� �
� �_ �� � �� �� � � ��
��
�b
�� � � �5 �D � � �l � �| �[ �*
�� � �
� �% � �G �^ � �l � �� ��
� �` � �� � �p �� � �n �c �g �m � �� �' �2 � � �� �{ �� � �� � � � �D
�� �f � �� �| �: �� � � �� �
�� ��
�
�� �� � �n � �� �� �� �; �� �I �Y �} �� �
�X �" � �
�� �� � � �� �� �- � �l �� �� � �� � � � � �E � �~ � �> �] �� �, �� �� �� �v �L �B �i �& �� �� � �� � � �G �� �� � �B �� �
�+
� � � � � �� �� �� � �a � � � �
�a �� �} �E
� �D �� �= �� �0 � �� �
�6 �� � �� �v �! � � �� �� � � �� � �9 �H � � � � �
�F � �� �� �� � �" � �H �� �� �� �
�o � � �R �* � �. � �� � � � �I �3 � �,
� �* �S � � � �X �� �� �/ � �b �p � � � � �� �� �� �� �R � � � �7 � �2 �� � �� � �� �� �� � �_ �� �b � �
� �� � � � � � � � � �` �O � � �� �` �7 �
�
� � � � �� � �a �� �� �� �� �� �� �g � �� � � �
�_ � �~ �� � �� � � �
�a �� �
�b �� �� �� � �� � �� � �; �� � �- �
�� �Q �� �� � �q � �� �� �� �` �� �# �# �� � �� � �r �
�s � � �� �d �t ��
�� �c
�� � �k �w � �� � �� �� � � � � �� �g � �Q � �U �
� �� � � � �C �S � �c � � �5 � � �B �� �_ � �c �N �� �� �Y � �� �� �
� �L �d ��
�
� �K � �8 �a �G � � �
� � � �s �6 � �t �; �N � � � � �4 �� �: � �\ �q � � � �. �� � � �u ��
�� �� �� � ��
� �
�r �� � ��
�
�� �c � � � �@ � � �� � � � � �� �/ �9 � � � � �� �� � � �
�< �d
� �� � �8 �v � �C �� � �
�� �m � �
� �� �� � � �Z �� � �� �� �w �� �{ � � � �� �$ � � �M �d �0 �r � �� � �g � �V � � � � �: �Z �� � �{ �$ �e �0 � � �$ � �
�
� �5 � �[ �� �v � � �c � �V �R �$ �; � � � �f � � �� �d � �� �W �e
� � �� � � � �
� �J � � � � �u �� � � �
� � �
�K � �2 � �L � �. � � �2 �� � � � � �� � �% � �� �� � �
� �� � �� � � � �
��
�x � �M �� �} � � �T � � �� �d �
� � �� � �` � � � � � �3 � � �; � � � � �y �Y �L � � �� �� � � � � �U �\ �� � � � �� �V �N � � ��
� � �
� �" �x �% � �; �= � � �� �2 �E � �! � �� �� �^ �� �" �w ��
�# � �� �� � � �$ �< �Q � �� �r �% � �] �� �& � �< �' � �3 �6 �B � � �( �� � �� � �� � � �g �
�
�) �
� �* �+ �! � � �� � �: � �7 � �^ � � � � �( �
�, �+ � � �x �- � �/ �h �= �. �� �� � � �V � � � �h �� � �/ � � � � �< � �� �; �0 � � �� �
� �1 �z �� � �� �5 �6 �
�_ �) �2 �3 �� �4 �y �" � �� ��
� �^ �5 � �� �? �% �+ �f
� �6 �_ �W �� � �
�7 �> � �
�g
�# �� �u �8 � �� �9 �h
�F
�� �V �{ �� �O �� �I �w �~ �
�^ � � �: � � �� � �� �� � � �; �e �1 � � � �� �� � �� � �� �� � � �P �< �= �� �> �
�� �( �` �R �? �Y � �I �� �� �� � �7 �� �
�? �� �� �
�@ �� �o � �q �Y �n � � �l � � � � �� ��
�i
�E �P �V � �!
� �� � � � �n � �A �� �| �
� �
�B � � � � � �-
� �O ��
� �C � �D �W �T �T � �� �� � �
�} �E �� �& �
� � �� �� � � �
� � �~ �G
��
�� � �$ �W � � �� �o �� �
�F � �G �� � �"
�� �� �� �#
�� �� �D �- �Q �� �H �e �� � � �I � �� � �J �z �
� �K � � �L � �$
�
� � � � �H
� �� � � �� �� �M �: �� � �� �N �� �I
�� � �� �H �� � � � �O �� � � �P �Q �� � �k �R �R �� �� �� ��
�
� �� � �� � � � �� �S �T � �� � �%
� � �� �� �� �&
�S �U � �� �S � �C �� � �� �V �~ � �! �X �� � � � � �, �� � �� �� �O �� �| � � �� �P � �e � � � � � � � � � � � �� � �T � � �� � �W �� � � �X � �Y � �R �
�v � � �
� � �= � � �Z � �U �� � �[ �� � � �V �% �\ � � �] � � �^ �8 �T �.
�'
�_ � �v � � � � �w �t � �` �a �b �> � �� �" �{ � �� � � �c �� �d �9 � � � �� �[ �9 � � �d �h �
�e � � �� �J
�! � � �f �� �� � �� � � �T �g � � � �% � �W �M �h � � �i � �� � � � �� �� � � �(
�j
� �y �7 �m � �j �k � �? �W �" �� �� � � �B � �l �| � � �)
�z � �� �
�� � � �� � � � �m � �n �u �v �w �� � �*
� � �o �p � � �q �7 �. �r �� � �
� � �
� �f � � �� �s �& �y � � � � � �� � � �
� �> � � � �� � �Y � � �t � �u �/
�+
� �v � � � �@ �w � �� �� � � �3 � �� � �,
�x �� �6 �9 �
� � � �6 �� � � �! � � �y �� �Q �: �c �
� � �-
�o � � �F �X �
�� � �f �� � �z ��
� � � �� �� �{ �/ � � �' � �b � �� �` � � � �u � �v � � � � ��
�
�
� � � �� �0 �E � �S � �8 �[ �| �} �G � � �� �! �~ � � �F �U � �
� � � �e �s � � �� �w � � � �" � �a � �Z �& � � � �� � �
� � �� �A � � �
� �i � � � � � � � � � �
�o � � � � ��
�
� � � �A � �J �0 �� �x ��
� �� � �Y � � � � � �� �� � � �Z �8 �o � �� �Q � � � � �
� � �a �Q �� � �p �; � � �P � �b �� � � � � � �� �
� � � � � �� � � � � � � � � �� �] � �� � � �
� �� � �� � �' � � �.
�� �� �
�� � � � �� �L � �� � � � � � �/
� � � � �B �0
�[ � �8 � � � � �� � � �/ �3 � �� � � �
� �� � �0 �� �n �� �� �� � �� � �� � � �� � � � � � � � � �4 � � � � �< � � �
� �� �Y � � � �� �C �� � � �
�� � �� �� �} �1 � �
� � � �K � �� �� �0
�F �� �� � ��
� �# � �\ � � �� �f � �> �
� � �
� �� � � �� � ��
� �� �� � �j � � � � � �- �p �9 �@ �6 �y � �� �� � �
�1
�� � � � � � � �V �� �� �� �� �4 �� � � �K �1
�� ��
�D �� �� �� � � � �# � � � �� �2
� � � �� �Z �H �p � �� �g �� �� � �
�q �r �
�� �� � � � � � �K
�V �
�\ �, �
� �� � � �� �] � � �u � �
� � � �� �� �� � � �Z � � �
� � �� � �j �� � �0 �h �h � �� �� � � �E � � �
� � � � � � � �� �� �� � � �� �
� � � �2
� � �� � �� � �M �� �w �� � � �y �? �� � �� �
�t �m �( �� � �+ � � �� � �� � � � �i �
� � �� � �� �
�� �L
� �� �) �
� �
� � �f �� � � � � � � �� �R �" �A �3
�� � �- �1 � �$ �
�( �� �] �� �# � �$ ��
� �� �� � �* �� � � � �
�� � �
�= �k
� �! � �
�� �� �� �� �
� �� � �_ �� �� �� �� �^ �2 � ��
� �� �� �9 � �� �� �� �� �� �4
� �� �� �
� �b � � �� � � �� � � �5 �� �� �� � �" � �
� �� � �� � �4 �I � �� �# � � � � � � �� � �j � �� � �$ �k � � �
� �\ �
�g � �E �5
�� �� �� � �� �� �� � ��
� �� �6
� �� � � �� �% � �� �� �� � �[ � �� �� �� � � � �& �e �� �� �� �� �� �o �� �� �l � �} �� �� �� �z �� �+ �� �� � � �� �� �n �- � ��
�' � �i �
�� � �� �( �� �� �� �� � � �� �� �� � �
� �� �� �� �B �i �q �� � � �< � �* �j �) �" �* �� �> �) �7
�� �+ � �� � � �� � �� �z �� �, � � �� � �M
�) �r � �� �- � �� �� �� �� �� �� �T �� �p �� �� �# �# �� � � � �� �� �� �
� � �� � � �� � � �S �� �. �8
� �� �� �� �z �9
�= �� � � �m � �S � � � � �� �x �� �� �/ �� �� �q �� � �3 �� �5 �� �:
� �
� �� �� �� � �� �� �
�;
� �0 �1 �� � � � � �n �� �_ � �] � � �n �� �� �� �� �
�% �� �� � �� � �` � �� �� �� �z �T �s �2 �3
�� �
�{ � �5 �� � � ��
�g � � �k �� �� �� � ��
� � �3 �4 � � � �c � �� � �
�
�� � �a �: �1 � �� � �! �A �h � �o ��
�6 �" � � � �l
�- �� �
�a �5 � �� � �
� � �# �! � �$ � �
� �4
�f �� � �% �& �
�N
�
�� �W � � � � � �
�' � �$ �� � �<
� �N � � �W �k � �O
�� �� � � �� �� �X �, � �6 �& �t �� �P
� � �7 �
� ��
�- �j � � �
� �C �[ �p � � �' �8 �
�b �� �m
� �
� �{ �( � �� �� �� �9 �
�� � �: �
�
�^ �� �� �� �B �; � �� � � �� �
� �� �
�� � �� �) �< �= �
� �
� �> � � � � ��
�= �� � � �� � � � � � � �n
� �H �D �
�? �� �U �W �
�=
� �: � � �N � �K �E �@ �4 �c �
� �>
� �Q
�
�A � � �h �� � �
�
�( �] �� � �� �B �* �� � �l �� �C �D �� �E �h � � �� � � �� �X � � � � �+ �� �� � �+ �J �� �� �U �� � �
�� �m � �E � � � �F � �G �
�k � �n � �
�d � � � � � �� �� �F �! � � �r �@ �� �H �" �C �G � � �� �
� �^ �
�� � �8 �t �) �; � �?
�! � �o �I �� �" �# �# �$ � �J � �% ��
�& �r �K �' �5
�( �) � �o
�@
�} �A
� �, � �* �4 �1 �+ � � � � �� �" � �, � �
�C �� �u �r �D �- �
�- � �L �v �{ �� �| �M �. �. �N �Y �6
� � � �/ �0 �/ � �� �1 �$ � �2 �% �G �R �B
�� �_ � �� �C
�� � �D
�� �3 � � � � � �� � �. �� � �4 �@ �w � �5 � �6 �7 � �i �� �& �0 �� �8 � �& �� �* � �+ �G �O �u � �# �
�1 �P �R � �Q � � �� �) �� �� �= �9 � �l � �� �� � �E
�S � �k � �\ � � � �
�y �: � �; �< �F
�% �= � �R � � �> �d �' �, �? �e �$ � �2 �3 �- � �� �4 � �( �S �@ �A �B �� �. �T � �O �
� �� �� � � �
�& � � �� �
�< �
� � � �C � �D � � �U �� �p
�G
�e �
� � � �
�E �; �V �F �' �G �) �
�� �} �H �* �� �W � � �I � �T � �
�
� �� �� �� � � � �J �. �g �~ � �U � �j � � � �X � �� �8 � �* � �� � �K �~ �� � � �L � �H �
�� � �% �� �+ �f � � � �� �t �� �M �N �� � �� � � � �
� � �k �Y � �Y �� � � �* �/ �� �O �R
�Z �H
�� �# �I �
�� �� � �5 �S
�] �E �[ �\ �
�s �I
�+ �P �Q �, � �
�R � �S �T �� �, �� �U �] �V �� �� �L �- �! � �T
�\ �4 �W � � �X �Y �Z � �[ �> �w � � � �� �+ �^ � �J
�� �_ �$ � �\ � �� � �l �. �] �` � �^ �_ �q
�% � �` �a � � �� �
�6 �g �U
�b �c �d �a �
�q �x �
�e �
�b �y � �f �h �g �h � � �' �i � � �� � �j �r � �
�0 � �= �� �b �| � � �� � � � � � �h �k ��
�l � � �
�a � �c �m �� � � �n �
� �u � � �d �e �� �s �K
�/ �o �7 � �& � �J �8 �p �q �i �j �f � �� �g � � �� �( � �` �r �s � � � � �< �F �k �f �� �� � �� �] � � �I �t �> � �u � �v � �
�� � �
�0 � �- � �w �L
� � � � � � �G �a � �
�t � � �
�S �K �x � �y �z � � �V
�� � �O �� �1 � ��
�{ �
�� � �F �y � �9 �Z �� �| �} �~ �F �� � �� ��
� �: � � � � �2 �� � � �p � �; �G � � � �h � � � � �7
�� � � � �q � �� �M
�� � � � � � � �� �� ��
� � ��
�( �8
� �N
� � �3 �� � �O
�< � � � �T � �W
� � � � � �( �� � � �1 �� � � � � � �� �u �Z � �
� �c � �j �P
�p � � �
� �� �� � �v �i �j � �
� � � � �Q
�K � � �� �' � �� � � �� �9
� � �
�� �z � � �
� � �k � � � �� �� � �2 � � �l � �� �> �= �C �' � � �> �
� �Z � � � � �m �n � �� �b � �� � � �q �? � �
� � � � �" � �
�? �
�} �� � �o �@ �> � �A � �1 � �) � � � �? �
��
� � � �x � � � � � �3 � � �h � � �l � � � �) � ��
�p � �' � � � �4 � � �
�
� � � �A �_ � �B � �L � �
�P �q �� � � �r � � � � �X
� �c �s �!
� � � �H � � �w � � � �C �D �t � � � � � � �x �
� � �/ � � � �5 �
�4 �u � �r
� � �_ � � �/ � �< � �~ �7 �y �m � � �^ �5 �n �b �
�t � � �l � � �� �6 �� � �7 �� � � � � � �v � � � � �8 �:
� �
� �0 � �1 � �w � �I � � � � � �( �� � �B �� � �4 �s ��
� � � � �
��
� � �? �C � �x � �E �H � �� �F �y �z �G � � � � �{ � � � �| � �;
�} �9 �m �H �~ �� �z � � �s
� �� �M �� �� � � �� � �m �� �� �I �� �� � �o � �� � �� � � �� �_ � �� �� �� �2 �3 �H � �* � � �
� � � �<
� �i �: �� ��
�� � � �A � �� �� �R
�� �� � � � ��
�� �"
� �� � � � �� � �
� ��
� �� �
�� �� �Q � ��
�Y
� � � � � � � �{ �K �� � � �[ � �J �� �� �N � �S
� � � � �I � � �T
�@ � ��
�� � ��
� �@ � �R � � �� �t
� � �� �J �I �� �
�� � � �� �
�U
� �m � �� � �{ � �� � �
�; �V
� � �� � � �< � � ��
�d �� �� �� �X � �� �9 �� � �6 �� �� �U � �� � � �� �L �! �=
�� �) �� �
� � �� �� � � � �� �
� �= �$ �( �v �� � �& �� �c � � � �� � �
�� �> �� �� �� �{ �" � �� �� �� �# �� �� � �� �W
� � �� �� �� �� � �$ �
�% � �� �� � �� �& �^ � �� �[ � �� �' � �� � � �� � �� �( � �� � �2 �\ �J �
�p �p �n � �u
�q �) �� � �O �>
� �
�* �X
� �� �� �+ �� � �, ��
� �� �
� � � �� �K � �
� �� �I �- � � �! � � � � � �. �D � � �J �s �#
� � ��
�� �7 � � � �/ �w � �| � � � � � �" �4 �| �, � � �� � �� � � � � � � � � �? �Y
�P �0 � �1 �Z
�Z
�
� �
� �� ��
�# �@ �2 � �| � �z � � � � �A �' � �?
�� � �� �8 � � �y �� �L �V �
�3 � �� �� �$ �� � �� �M �� �% �� � � ��
� �
�. � �4 �N � � � � �
�� � �� � � ��
�5 �9 �% � �� �� �K �Q � �� �x �6 �7 � �B � �
�O �v
�[
� � �& � ��
� �
�� � �X � �* � �\
�P �� �
�N �+ �w
� � �� � �W �C � � � �Q �D � �? �]
�� � � �^
�o �R �
�� �E � �
� �F � �' � �X � �G � �S � � �T �R � �8 �x �� �k �S � �T � � � � �� �� �D � �9 �! � � � � �( � �L �" �# �$ �% �_
� �& �J �: �U � �} � �) � �
�; �< �
�E �+ �' �
� �H �= �V �* �H �y �, �+ �W �3 �> �� � �? �( �I �, �- �`
�q � �a
� �� � �
�� �) �* �X � �+ � �O �� �Y �, �- � �. � �/ �� �� �0 �. �� �� � �1 �
�J �r �2 �3 �$
� �4 � �5 �6 �7 ��
� �b
�� �� � �} � �f �� �K �� ��
��
� � �8 �Z �9 �� �: �� ��
�c
�� �: � � �; �s �J �@ �� �� �t �; �
�/ �< �d
� � � �� �U �� �0 � �e
�= �� �f
�u �M � �� � � ��
�> � �[ � �A �L � �i �? � �
��
� �@ �A �v �B �C �\ �� �j � �[
��
�g
�D �E �� � �F � �B � �G ��
� �H �� �( �� �M �C �h
�� �I �N �J � �K �L � � �M �� �1 �2 �N � � �d �O �d �V �D �` � �# �5 �P �] �Q �E �n �
�� � � �^ �R �_ �F �S �p �i
�� �T �U � �
� �V �� �� � � �G �� � � �e �H �O � � �P �` �W �w �j
�X � � �3 �
�a � �I �Y �J �x �7 � � �� �- ��
�4 �k
� �b �Z �- � � �. �c � �[ � �r �; �� �K �5 �L �X � � � �� � �\ �] � � �6 �%
�^ �_ � �� �~ �` �l
�y �a �z �~ �� �� �b �? � �c �7 �d �
� � �e � �z �� �� �M �f �g �/ �h �| � �@ �d � � �i �N � �� � �8 �f � � �j �k � �O �P � �� �l �m �@ �n �9 � �o � � �� �� �< �s � �\
�Q �. �R �N �@ ��
� �p � �S �{ �q � �A �� �� � � �� �T �
� � � �: � �� �r ��
�s �@
�W �; �t �u � �v �w �x �y �| � � � � �z �� �� �3 �Q � �� �m � �A �{ �| � �� � �} �O �R �� � �g � � �~ �Z �
� � � � � �� �\ �m
� �} �� �< �X �� �� � � ��
� � � �
�� �Y � �� � �0 �� �� �� � �= �� � � � �L �� � � � �h � � �� �i �> �> � �/ �? �U � � �� � � �e �) �x
�t � �f �S � ��
�y
��
�n
�
� � �T � �@ �� � � � � �� � �� � �� �� � �� �z �U �g � �V �� �o
� � �6 �p
�t � � � � � �� ��
�A �� �J �V �h �Z �� �� �W �� � � � N( r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r )Z BIG5_TYPICAL_DISTRIBUTION_RATIOZBIG5_TABLE_SIZEZBIG5_CHAR_TO_FREQ_ORDER� r r � /usr/lib/python3.6/big5freq.py�<module>+ s� pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.pyc 0000644 00000055442 14751155147 0020640 0 ustar 00 3
���e^+ � @ s d�Z d�Ze ed�d�d�d�d��Zd�S )�� � �% �/ �' � �4 �$ �- �5 �< � �1 � �. �* �0 �E �, �# � �3 �& �> �A �+ �8 � � � � � � � � � � �
� �
� � � �@ � � � � � �9 �: � � � � � � � � � � � � � � � � � � � � � � � � �e � � � � � � � � �j � � � � � � � �d � � � � � � � � �^ �P �] � �i � � �? � � � � � � �~ �} �| �h �I �c �O �U �{ �6 �z �b �\ �y �x �[ �g �w �D �v �u �a �t �s �2 �Z �r �q �p �o �7 �) �( �V �Y �F �; �N �G �R �X �! �M �B �T �S �n �K �= �` � �C �m �J �W �f �" �_ �Q �l �L �H � � � �k � g�X4�� �?Tz
ISO-8859-9ZTurkish)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguageN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r r r r r r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ( r$ r r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r$ r r r r$ r$ r r$ r$ r� r$ r$ r$ r$ r$ r� r$ r r$ r$ r r r� r� r r r� r� r� r r� r� r r r r r� r� r� r� r� r� r� r r r� r� r r� r� r r$ r r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r r$ r r� r$ r$ r r$ r$ r� r$ r$ r$ r$ r$ r� r$ r� r$ r$ r r r� r r� r r� r� r� r� r� r� r r r r r� r� r� r� r� r� r� r r r� r� r� r r� r r$ r$ r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r r$ r r r$ r$ r� r$ r$ r r r$ r$ r$ r$ r� r$ r� r$ r$ r r r� r� r� r r� r� r� r� r r r� r r r r� r� r� r r� r� r� r� r r� r� r� r� r� r r$ r$ r$ r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r$ r r$ r$ r r� r$ r r r r r r$ r$ r� r� r� r r r r� r r� r� r r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r r� r r r� r r� r� r r$ r$ r$ r r$ r$ r r r$ r$ r$ r$ r$ r$ r$ r r$ r r r� r$ r r� r r r$ r$ r r r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r r� r r$ r$ r r$ r$ r$ r$ r$ r$ r$ r r r� r� r r$ r� r r$ r� r� r r r r$ r� r$ r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r� r$ r$ r$ r� r$ r r� r r$ r r$ r$ r r� r� r r$ r r� r� r r� r� r� r� r� r� r r� r� r r� r� r� r� r� r� r� r� r� r r r r� r r� r� r r$ r$ r$ r r$ r$ r r$ r$ r$ r$ r r$ r$ r$ r� r$ r$ r� r� r r r� r� r r$ r r r� r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r� r� r r� r r� r r� r� r r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r r$ r$ r$ r� r$ r r� r r$ r r r r$ r r$ r r r� r� r r r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r� r� r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r r$ r$ r$ r� r$ r r r� r r$ r� r� r r r r r� r� r� r r$ r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r r� r� r� r$ r$ r$ r$ r$ r$ r$ r r r r r$ r r$ r$ r� r$ r$ r r r r r� r� r r r$ r r� r� r r$ r� r$ r r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r� r r$ r$ r$ r r$ r$ r$ r r r r r$ r r$ r$ r� r$ r r� r� r r r� r r r r r r� r� r� r r� r$ r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r r� r� r� r$ r$ r$ r r$ r$ r r$ r r r r$ r$ r$ r$ r r$ r r r� r$ r r r r$ r$ r r$ r r� r� r r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r r$ r r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r r r r� r$ r$ r r$ r$ r� r r$ r$ r r$ r� r$ r� r$ r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r r r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r$ r$ r� r� r$ r r� r$ r$ r� r$ r r$ r$ r$ r� r$ r r$ r r� r� r� r� r� r� r� r� r� r� r r� r r r� r r� r� r� r� r� r� r� r r r� r� r r� r� r r$ r$ r$ r r r$ r$ r r� r� r r� r� r$ r$ r r$ r� r� r r� r� r r� r r� r� r� r r� r r� r� r$ r r� r r� r� r� r r r r� r r r r r r r r� r r r r� r� r� r r� r� r� r� r� r r r r$ r$ r� r$ r$ r$ r$ r$ r r$ r� r� r� r� r r$ r� r r$ r r� r r$ r r$ r� r$ r� r r$ r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r$ r$ r r r$ r r r� r r r$ r� r r r r� r r� r� r� r r� r r r� r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r r r� r� r r� r� r� r$ r$ r$ r r$ r$ r r r$ r$ r r r$ r$ r r� r r r r� r r r� r� r r r r r� r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r� r r r$ r� r� r r� r� r$ r$ r� r$ r� r� r r� r r r� r� r r r r r� r r� r� r r r r r� r r� r r r r r r� r r r r r r r r� r r� r� r� r� r� r� r r� r� r$ r$ r$ r r$ r r$ r$ r� r r r r$ r$ r$ r� r$ r� r� r� r r r� r r r r r r� r� r� r r� r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r$ r$ r$ r$ r$ r$ r r r r r$ r$ r$ r$ r r� r r� r� r� r r r� r� r r r$ r$ r� r� r r r r r� r� r r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r r r r$ r$ r� r$ r$ r$ r$ r$ r$ r r r� r r� r r$ r r$ r r r r r r r r r$ r r$ r r� r r r r r r r r r r r r r r r r� r� r r r r� r r r� r� r r� r� r� r r r$ r$ r r r r� r r r r r$ r r r r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r r r$ r r$ r r r r$ r$ r$ r� r r r r� r r r� r� r r r r r r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r r� r r� r r� r� r� r$ r$ r$ r r$ r$ r$ r$ r$ r r$ r r r$ r$ r r r� r� r� r� r� r� r� r$ r r r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r$ r$ r$ r r r$ r$ r r r r r r r$ r$ r� r$ r r� r� r r r� r� r$ r r r r� r� r� r� r� r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r$ r$ r$ r r r$ r r r r$ r r r r$ r$ r� r$ r� r� r� r� r r� r� r$ r r r r� r� r� r r r� r� r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r$ r$ r� r$ r$ r$ r$ r$ r r r r r r� r r r r r r r� r r r r r r r r r� r� r r r r r r r� r r r$ r r r r r r� r� r r� r r� r r� r r� r� r� r r� r r$ r$ r$ r r$ r$ r$ r� r r r� r r r$ r r� r$ r� r� r� r r� r� r� r r� r� r r� r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r r� r� r r r r� r� r r� r� r$ r$ r r$ r� r� r r r� r r� r$ r� r� r� r r� r r r� r r r� r r r r� r r r r r r� r r r r� r r� r r r r� r� r� r� r� r� r� r� r� r$ r$ r$ r r$ r r$ r r� r r r r r$ r r� r r r r� r r r� r� r r� r r r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r r� r� r� r$ r$ r$ r� r$ r$ r r r r$ r r� r$ r r$ r� r$ r� r� r� r r� r� r� r r� r r� r� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r� r$ r$ r r$ r$ r r r� r� r� r� r r r� r r$ r� r� r� r$ r r r� r$ r� r r r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r r r r� r$ r r r r r$ r$ r r$ r� r� r r� r r r� r r r� r r r� r r r� r r r r r r r� r r r r� r r r r r r r r r r� r r� r r� r� r� r� r� r� r� r$ r$ r$ r� r r r$ r� r� r r r� r� r r r� r$ r� r� r r r� r r� r� r� r� r� r r� r� r� r� r$ r r� r r� r r� r r� r� r r� r r� r r r r r r r� r r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r r� r r� r r r r� r� r$ r$ r� r r� r� r r� r� r r r r� r r� r r� r r� r� r r� r r r� r r� r r r r� r r� r r r r� r r r r� r r� r� r� r r r� r� r� r� r$ r r$ r� r r� r� r� r� r� r� r� r� r r r� r r� r� r r� r� r r� r� r� r� r� r r� r� r� r� r� r r r� r� r r� r r� r� r r� r� r� r r r� r r� r r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r� r r$ r� r� r r� r r� r r$ r r$ r� r� r r$ r� r r r� r� r� r� r r� r r� r� r r r� r� r r r� r r r� r� r r� r� r r r� r r r r� r r� r� r� r� r r� r� r� r� r$ r r r� r� r r r� r� r� r� r� r� r$ r r r r� r� r� r� r� r r� r� r� r� r� r r� r r� r� r r� r� r� r� r� r� r r� r� r� r� r� r� r� r r� r� r� r r� r r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r� r r$ r r r r r r r r r� r r$ r r r r� r� r r r� r� r� r r r r$ r� r r r r� r r r r� r r r r r r r r� r� r� r� r r� r r r� r� r� r� r� r� r� r� r r r r$ r� r$ r$ r$ r r r r r r� r r� r r� r r r r� r� r r r r$ r r r r r� r� r r r r� r r r� r� r r r� r r r r r� r� r r� r� r� r r� r r� r r� r� r� r� r$ r$ r r� r� r$ r r� r� r� r� r� r� r$ r r r r� r� r r� r� r r� r� r� r� r� r r� r r� r� r r r r� r� r r� r r r� r� r r r� r� r r r r r r� r r� r� r� r� r� r� r� r� r� r$ r$ r r� r� r r� r� r� r� r r� r� r$ r$ r r r� r� r r� r� r r� r r� r� r� r r� r r� r� r� r r r� r� r r� r r r� r� r r r r r r� r r r r r r r� r� r r r� r� r� r� r$ r$ r r� r� r r r� r� r� r r r� r r r r$ r r� r r� r r r� r� r� r� r� r r� r r� r� r r r� r� r� r� r� r r� r� r r� r� r� r r r� r r� r r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r� r� r� r r� r� r r� r� r r$ r r r� r� r r� r� r r� r� r� r r� r r� r r� r� r r r r r r r� r r r r� r� r r r� r r r r r r r r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r r r r r� r� r r r� r$ r$ r r r� r� r r� r� r r� r r� r r r r� r� r� r� r� r r r r r r� r r r� r r r r r� r� r� r r r r� r r� r� r� r r� r� r� r� r� r$ r$ r$ r� r r r$ r r� r� r r� r� r r$ r r� r� r� r� r� r� r r� r r� r� r� r r� r� r� r� r r r� r� r� r r� r� r r� r r r� r r� r r r r� r r� r� r� r� r� r� r� r� r� r� r� r$ r r$ r� r� r� r� r� r� r� r r� r� r r r r r� r� r r� r� r r� r� r� r� r� r r� r r� r� r� r r r r� r r� r r r r� r� r r r r r� r r� r r� r r� r� r� r r� r� r� r� r� r� r� r� r r r� r r r r r r r r� r� r r� r r� r� r r$ r� r� r� r� r r� r� r r r� r� r� r r� r r� r� r� r� r� r r r� r r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r r� r� r r$ r� r r$ r r r r� r r� r� r r� r r r r r r r� r� r r r r r r r� r r� r r� r r� r r r� r� r r r r r r r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r r r r� r� r� r r� r� r$ r r� r r� r� r r� r� r r� r� r� r r r r� r r� r� r� r� r� r r� r r� r� r r� r� r� r� r r� r r� r r r r� r r� r� r� r� r� r� r� r� r� r� r� r� r r r� r r r r r� r r r r r r� r� r r r r r r� r r� r� r� r r r r r� r� r r r� r r r r� r r r r r r r r r� r r r r r� r r� r� r� r� r� r� r� r� r$ r r r� r� r r� r� r� r� r� r� r� r r r� r r� r� r r� r� r r� r� r� r� r� r r� r� r� r� r r r� r� r� r� r� r r� r� r� r� r� r� r� r r� r� r� r r� r r� r� r� r� r� r� r� r� r� r� r� r� r$ r r� r r r� r r r� r r� r� r r� r� r� r r� r r� r� r� r� r� r r� r� r� r� r r� r r� r r� r r r� r� r r r� r r� r r r� r� r r� r r� r r� r� r� r� r� r� r� r� r r r r� r r r� r� r� r r� r� r� r r r� r r� r� r r� r� r r� r� r� r� r r r� r r� r� r� r r� r� r� r r� r� r r� r� r� r� r� r� r r� r r� r r� r� r� r� r� r� r� r� r� r� r� r r r r r r� r r r r� r� r� r� r r r� r� r r� r� r� r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r r r r� r r� r� r� r r� r r� r� r� r r� r� r r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r r� r� r� r� r� r r� r� r r r r� r r r r r r r r� r� r� r� r r� r� r r r� r� r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r r r r� r� r� r r� r� r� r� r� r� r r r r r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r� r� r r� r� r� r r� r� r� r� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r r� r r� r� r� r� r� r� r r r� r� r� r� r� r� r� r r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )Z Latin5_TurkishCharToOrderMapZTurkishLangModelZLatin5TurkishModel� r� r� �&/usr/lib/python3.6/langturkishmodel.py�<module>% s* pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.pyc 0000644 00000056746 14751155147 0017263 0 ustar 00 3
���e�4 � 0 @ s d Z dZ� d2Z� d1S (3 g @�0 �
� �x �t �� � � �H �a �� � �� � �+ � �W �u � �h � �] � � �� � �� � � � � � �v �w � �� �� � �m �F �! �p �� � �� � �� � �� � �x �� �/ � � �� �� � � �� � �9 � � �� �t �� �- �y � �K � � �� �� �� �� � �O � �n �� �� �� �� �� � �0 � �� �< �4 �{ � �� �� �� �� �i �� �r �� �� �� �� � �� �� �� �� �� �� �X �X �� �� �� �� �Y � � �& � �P �� �� �� � � �� �� �^ �� �� �� �� �� � �� �9 �� �� �� �� �� �� �Q �� �" � �t � � � � � �] �{ �7 � � � �{ � �; � �u �� �z �/ � �| �� � � �� �7 � � �. � � � � � � � � � � � � � �{ � � � �# �| �} � �~ � �t �8 � �_ � �
� � �
�! � � � �_ � � �� �� � � �* � �u � �` �" � � �| � � � � � � �a � � � � � � �? � �R �! � �/ � � �! �" �= � � �# � �$ �% �& �' �( �) �, �� �' �b �$ �* � �+ � �- �� �, � � � �� � �& �U � �� �# � � �- �. �' � � �f �/ �s � �0 �� � � � �� � � �9 �e �[ �1 � � � �Z � � �: �� � � �2 �3 �� �G � � � �y �4 �� � � �5 �6 �7 �, �w �� � �s �8 � �� �9 �: � � �~ �; � �< �; �} �= �> �? �o �) �� � �@ � �A �B � �� �2 �Y �C �D � �< �E �F �G �H �I �% �J �K �L �M �N �O � �` �> �P � �= �Q � �R � �S �T �; �� � � � � �U � �V �W �X �4 �Y � � �Z �[ � �\ �] � � �^ � � �_ �" �P � � �` �; � �~ �H �a � �v � �z �? � � � �b � � �< �c �d �d �e �f �c �0 � �d � �g �y � � �h �i �s �0 �j �= �k � �l � �� � �< �b � � �U � �� � � �I �m �n �o � �p �q �r �s �t �u � �� � �� �6 �v �w � �* � �] �x �y � � �z �Z � �- �: � �b �
�{ �| � �& �' � �� �5 � � � �> �} �~ �w � �g � � � �6 � �% � � �( � �v � � � �w � �� � � �E � �� � � � � �� � � �f �� �V � �7 � � � � �B � �N � �[ � �' � � � � � � �� �S � � � � �� �e � � �x � � �� � � � � � � � � � � � � � � � � � �� �? � � � � �q � �f � �( �) �� � �~ �� �\ �� � � �� �� �) � � � � �� � �� � � � � �$ � �� �� � �� � �l � � � � �~ �� �� �C � � � � �@ � �� � � �� �2 � �� �K � �z �V � �� �� � � �Q �r �f � � � � � � �h �+ �3 � �1 � � � � � � �g �( � � � �z �� � � � � � � � � � � � �� � � � � �A � �< �j � � �M �g � �2 �� �� �� �� �� �� �� �� �� �V �h � �� �J �� �� �0 �� � �b � � � �� � �� � �� � �Y � � � �� � �� �a �! �* � �� �� �� �� �K �D �8 � �R � �B � �@ � � � � �� �� � �y �� �� �� �� � �X �: � �� �# �� � �� �i �� �G � �� �k � �� �= �� �� � �� �! � �� �� �J �� �� �= � � � �} �� � �j � � �� �� �� �� �� �� �� �� �� �� �E �� �� �� �� � �j �O �4 �� � �� �� �� �� � �� �� � �v �] � �C � �� � � � � � �o � � � � �
� � � �l �c �A � � �� �� � � � � � �T � �� �k � �� �� � � �� �3 �* � �q �� �� �> �� � � � � � �+ � � � � � �; � �p � �x � �� � �� � � � � �� � � �
� � � �
�� � � � �l � � � � � � �) �� � � � �m �8 � � �D � �� � � � � � � � � � � �7 �L �B � � �D � �� � � � �t � � � � �! �
�" �# �$ �% �R �& �' �( �) �* � �+ �, � �, �- �. �m �� �
�^ �/ �c � �E �� � � �a �m �0 �E �1 �2 �3 � � � �4 �T � � �� �5 � � � �� �6 �7 � �n � � �o �8 �9 �F � � � �: �G �; �< �= �> �? �@ �A �B �C �D �E �$ �F �G �� �� �% � � �p �H �I �J �K �L �� � � �� � � �� �M �N �O �P �Q �R � � �S �/ �T � �U �� � � �V � �I �H �� � �� � � �W � �X � �q �Y �Z �[ �\ �� �r � �s �] �^ �_ �` � �v �L �a � �� �. � �b �F �> �� �� �j �c �Z � �� �B �6 � �` �d �e � �� �| � �f � � �5 �g � �h � �i �H � �j �� � �k � �l �� �1 �m �n �o �p �q �r �C �s �t �u �v �w �� �x �y �z �{ � � �| �} �~ � � � � � � � � �O �� � � � � � � � � � � � �E � � �q � � �I � �\ � �- � � �S � � � �
� �e � � �� �l � �M � � �Q � �P � � �^ � �
�- �F � � � � � � � �� � � � � � � � �� � � �
�. �� �t � � � � �J �� � � � � � � �g � � � � � � � � � � � � � � � � � � �� � � � � � � � � � � � �� � �� �u � � �� �9 � � �� �� � �� �$ �� �� �� � � �5 �% � �k �L � �� � �� �� � � � �� �� �A � � � �� � �� � �� �� �R � �u � �� �� � �� �) �� �� �: �� �� �� � �� �� �� �" �$ �v �� � � �c �Z � �� �� �� �� � �* �W � �K �� �L �� �+ � � � �� �� �� �� � �� � �B �� �� �? �� � �� � �� �� � �� � �M �[ �5 �� �� �� �n � �� �� �� �� �C �� �' �� �� �� �� �� � � �� �
�� �� �� � �� � �� �� �� �� �� �F �T �/ �� �� �� �� � �8 � �u � �� �� �K �� �( �M � � �i � � �� �� � � � � �� � �T � �? � �� � � � � � �e � �( �� � � � � � �% �0 � � � �O � � �8 � � � � � �� � � � � � � �� �# � �� � � �� �V �
� � �P � � �M �W �� �
� � � �| � �
�S �� � � � �� �� �� � � �� �� � � � � � � �� � � � �9 �D � � �� � �� � � �3 � �� � � � �{ � � �� � � � � � �� � � � � �! �k � �� � �� �N �� �Y �� �" �# �$ �% �& �' �( �] �) �* �+ �, �- �. � �/ �� �� �> � � �� �1 � � �� � �\ � �2 � �3 �� �� �4 �5 �6 �w �7 � �8 � �3 � � �� �9 �: �L � �� � �; �� �< � � � � �� �� � � �� �� �= � �J �> �? �@ �� �A �� �B �C �D �� �E �� �� �F �G �H �I �� �� �� � �� �� �J �K � �� �L �M �N � �I �O �P �� �Q �R �S � �T �� �U �V �W �X �� �Y �Z �[ �\ �] �� � �^ �_ �` �a �� � �b �c �d �e � �� �f �g �U �� �x � �h � �� �i �j � � �� �4 �& �� �� �� �! � �� � �S �y � �� �� �" �
�� �# �k �� �l �m �n � � �� �p �Q � �. �o �U � �O �� �p �� �q �r �s �x �t � �u �v �w � � �$ �x � �y �� �` �z �{ �| �} �� �~ � � � � � � � �� �C �� � � �� �% �y � � �o � �� � � � � � � � � � � � � �� � �� � � � � �@ � �� � �G � �� �� � �2 �� �� �� � � � � � �N � � �� �� � �� � � � � � �r � �� �z �n � �� � �P � �# � �& �Q � �� �m � �c � �� � �' � �w � � �� �( �l �@ �� �� �� �) �� �* � � � � �� � � � � � � � � �� � � � �H � � � � � � � � � � �� � � �r � � � �A � � �� �� � � �} �, � � �: � � � � �
� �I � �N � �1 � �W �� �� � � � � �� �� �+ �� �� �1 �� �b �� �� �q �� �, �� � � �e � �� �_ � �d �� �� �� �� �� �� � �� �2 � � � �� � �� �� �� �� � �� � �� �� � �- �� �� � �� �� �� �� �� �� �� �� �� �� �� �� �� � �� �� �� �� � �� �7 �� �� �� � �� �� �� �� �� �� �� �� � � �� � � � �� �, �G �� � �� �� � �^ �� �� �. �� � �g � �� �� �� � � � � � � �� � �_ � � � � � � �h �h � �{ � �| � � � �3 � � � �� �� � �
�
�\ � � � � �
�
�
�
�
�
�
� �
�
�
�
� � � �
�j �
�i � �4 � �
�
�
�
�
�
� � �
�
�
�
� �6 �d �� �/ �
�
� � � �o �
� �R �� � �� � �& �
�k �n �z �� � �� �� �
� �
� �� �X � �d � �S � �} �
�} � �� �~ � �� � �� �
�!
�N �"
� � � �� �� �� �#
� � �s �$
�%
�&
�f �D � �1 �'
� � �(
�@ �)
�^ � �� � �*
�� �+
�,
�-
�.
�/
�J �+ �0
�1
�2
�� �T � �3
�4
�5
�6
�� �7
�A �. � � �� �8
�9
� �" �:
�;
�� �<
�=
�>
� � �0 �?
� �@
� �A
�B
� �C
�D
�E
�F
�G
� � �_ �[ �H
�I
� � �` �a �J
� � � � �K
�L
�M
�N
� �O
� �i � � � �P
�Q
�R
N(0 r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx r ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 )Z EUCKR_TYPICAL_DISTRIBUTION_RATIOZEUCKR_TABLE_SIZEZEUCKR_CHAR_TO_FREQ_ORDER� r1 r1 � /usr/lib/python3.6/euckrfreq.py�<module>) s( pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.pyc 0000644 00000002776 14751155147 0020507 0 ustar 00 3
���e�
� @ s� d dl mZ d dlmZ d dlmZmZmZmZm Z m
Z
d dl m Z m
Z
d dlmZmZ d dlmZ d dlmZ d dlmZ d d lmZ G d
d � d e�Zd S )
� )�CharSetGroupProber)�SingleByteCharSetProber)�Win1251CyrillicModel�
Koi8rModel�Latin5CyrillicModel�MacCyrillicModel� Ibm866Model� Ibm855Model)�Latin7GreekModel�Win1253GreekModel)�Latin5BulgarianModel�Win1251BulgarianModel)�TIS620ThaiModel)�Win1255HebrewModel)� HebrewProber)�Latin5TurkishModelc s e Zd Z� fdd�Z� ZS )�SBCSGroupProberc
s� t t| �j� tt�tt�tt�tt�tt�tt �tt
�tt �tt �tt
�tt�tt�g | _t� }ttd|�}ttd|�}|j||� | jj|||g� | j� d S )NFT)�superr �__init__r r r r r r r r
r r r
r r Zprobersr r Zset_model_probers�extend�reset)�selfZ
hebrew_proberZlogical_hebrew_proberZvisual_hebrew_prober)� __class__� �%/usr/lib/python3.6/sbcsgroupprober.pyr , s,
zSBCSGroupProber.__init__)�__name__�
__module__� __qualname__r �
__classcell__r r )r r r + s r N)Zcharsetgroupproberr Zsbcharsetproberr Zlangcyrillicmodelr r r r r r Zlanggreekmodelr
r Zlangbulgarianmodelr r
Z
langthaimodelr Zlanghebrewmodelr Z hebrewproberr Zlangturkishmodelr r r r r r �<module> s pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.pyc 0000644 00000055420 14751155147 0020070 0 ustar 00 3
���e, � @ s d�Z d�Ze ed�d�d�d�d��Zd�S )�� � � � � �j �k �d � � � �e �^ � � �l �m �n �o � � � �Y �_ �p �q � � � �� �@ �H �I �r �J �s �t �f �Q �� �u �Z �g �N �R �` �� �[ �O �T �h �i �a �b �\ �� �� �� �� �� �� �X �� �� �� �� �� �� �� �v �� �� �� �� �c �U �S �� �� �� �� �� �� �� �� �� �� �� �� � � �� � �� �K � � �4 �" �3 �w �/ �: �9 �1 �5 �7 �+ � � �, � �0 � � � �' �> � �6 �- � � � �= � �� � �* �. � � �L � �B �? � �
� �$ � �
�( � � �# �V �� �� �� �� �� � � �) � �! � �2 �% � � �C �M �& �] � � �D �8 �; �A �E �< �F �P �G �W � � � � � g� �@��?FzTIS-620ZThai)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguageN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r ( r� r� rr rr rr rr r� r� rr rr r� rr rr r� rr rr rr rr rr rr rr rr r� r� rr rr rr r� rr rr rr rr r� rr rr r� r� r� r� rr r� rr rr r| rr rr r� r� r| rr rr rr rr r� r| r� r| r� r� rr r| r� r| r| rr r� rr rr r| rr r� r� rr rr r� rr rr r� rr rr rr rr rr rr rr rr rr r� rr r| rr r� r| r| r| rr r� r| rr r� r� r� r� r� r� r� r| rr r� r� rr r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr r| rr rr rr rr rr rr rr rr rr rr rr r| r| r| r| r| r| r| rr rr r| rr r| rr rr r| r| r| rr r� r| rr r� rr rr r| r| r� r| rr rr r� r| r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| r| rr rr rr rr r� r| rr rr rr rr rr r| r| r| r| rr rr r| r| rr rr r| r| rr r| rr r| r| rr rr r� r| rr r� r| r| rr rr r� r� r| r� r� r� rr r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr rr rr r| r| rr rr rr rr r| rr r| r| rr rr r| r| rr r| r| r| r| r� r� rr r� r| r� r� rr r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr r| rr r| rr rr r| r| rr r| rr rr r| rr r� r� r| rr r| r| r| rr r| r| r| r| r| r� r| r� r| r| r� r� rr rr r| r� r� r� r| r| r� r� rr r� r� r� r� r� r� r� r� r� r� r| rr r� r� r| r� r� rr rr r| rr rr r| r� r� rr rr r� rr rr r� r| r| rr r� r| r| r� r� r� r� r| r| r| r� r| r| r� r� r� r| r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| rr rr r| r� r� rr rr r� r| rr r� r| r� r| r| r| r| r� r| r� r� r| r| r| r� r| r| r� r� r� r| r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| rr r| rr r| r� r| r| r� rr r| r� rr r| r� r| rr r| r| rr r� r| rr r| r| r� r| r| r| r| r� r| r| r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| rr rr r| rr r| r| r| rr r| r| rr r| r| r� r| rr r| r| rr r� rr r| r| r| rr r| r| r| rr rr r| r� rr r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� rr r� rr rr rr rr rr r� r� rr r� r| r| rr rr rr rr rr r� r� r� r� r� rr r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r| rr r� r� r� rr r� r| r� r� r� r� r� rr r� r� r� r� r� r� r� r� r| r� rr rr rr rr r� r� r| rr r� r� rr r� rr rr r| rr rr rr rr rr r� r� rr rr rr r� r� r� rr rr r� r� rr r� r� r� r� r| r� r� r| r� r� rr r� r� r� r� r� r| rr r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| rr rr rr rr rr rr rr r� r| r� rr rr r| r| r� r| r| r| rr r� r� r| r� r| r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| r� r| rr rr rr r� r| r� r| r| r� r| r� rr r| r| r� r| r� r� r� r| r| r� r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| r� rr rr r� r� rr r� r| rr r� r� rr r| r� r� r| r� r| r| rr r| r� r� r� r� r� r| rr r� r� r� rr r� r| r� r| r� rr r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r� r� rr r| rr rr rr r� rr r| r� rr r| r� rr r| r| r| r| r� rr rr r� r| r� rr r� r| rr r� r| r� r� rr r| r| r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr rr r| rr r| rr rr r| rr r| rr r| rr rr r| r� r� rr r| r| r| r� r| r| r| r� r| r| r� r| r� r� r| r| r| rr r� r� rr r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| rr r| r| r� r� rr r| rr r| rr r| r� rr r| r| r� r| r� r| r| r| r� r| r| r| r| r� rr r| r� r| r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr rr r| rr r� r| rr rr r| r| rr r� r� r� r| r� rr rr r| r| rr r� r� r� rr r� r� r� r� rr r� r� rr rr r� r| r� r| r� r� r� rr r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr r| rr r| rr rr r� r� rr r� r� r| r� r| r� r� rr r� r� r� r| rr r� r� r� r� r� r� r� r� rr r� r� r| r| r| r| r� r� r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r| r| r� r� r| r� rr rr r| rr r| r| rr r| r| rr r� r| r| r� r| r� rr r| r� r| r| r| r| r| r� rr r| r� r| r| r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr rr rr rr rr r� rr rr r� r| r� r� rr r| r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| r| r| rr r� r� r� rr r� rr r| r� rr r| r| rr rr rr rr rr r� r� r| r| r| r� r| r| r� r| r� r| rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| rr r� rr rr r| rr rr r� rr rr r� rr r| r| rr r| rr rr rr r� r� r| r| rr r� r� r� r� rr r� r� rr r� r� r� r| r| r� r� rr r� r� r| r| r| rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r| rr rr r| r� rr rr r| r| rr r� rr r| r� rr r| r� r� r| r| r� r| rr r| r� r� rr r� r� r� r� rr r� r� r| rr r� rr r� r� rr r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� rr r| r| r| r� r| r� r� rr r� r� rr r� rr r� r� r| r� r� r� r� r| r� r� r� r� r| r� r� r� r� r| r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� rr rr rr rr r| r| r| r| r| r� rr r� r� r� r| r� r� r� r| r� r| r� rr r| r� r� rr r� r� r� r� r� rr r� r� r| rr r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r� rr rr r� r| r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r� rr r� r� r� r| r� r� r| r� rr rr r| rr rr rr r| rr r� r� r| r| r| r� r� r� r| r| r� r� r� r� r� r� r� rr r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| r� r� r� r� r� r� r� r� r� r� r� r| rr r� rr rr r� r� r� r� rr r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r� r| rr r� r| rr r� r� rr r� r| r| r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r| r� r� r� r� r� rr r� r| r| r| r| r| r| r� r� r� r� r� rr r� r� r� rr r� r� r� r� r� r� r� r| r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� rr r� r| r| r� rr rr r| rr rr r� r� r� r� r| r| r� r| r� rr rr r� r� r� rr r| r� r� r� r� r| r� r� r� r� r� r� r� r� r| r� r� r� rr r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� rr r� r� rr r� rr r� r� r� r� r� rr r| r� r� r� rr r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rr rr r� rr r| r� rr rr r� r| r| r� r� r| r� r� r� r| r� r� r� r� r� rr r� r� r� rr r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r| r� rr rr rr r| r| r� r� r� r� r� rr r� r� r� r| r| r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r| rr r� r| r� r� r| r� r� rr r� r� r� r| r� r� r� r� r� rr r� r� rr r� r� r� r| r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� rr r� r| r� r� r| r| r� r� r| r� r� r� r� rr r� r| r� r� r� r� r| r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r| r| r� r� r� r| r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� rr r� r� r� r� r� r� r� r� rr r| r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr rr rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r| r| r� r� r� r� r� r� r� r� r| rr r| r� r| r| rr r� r� r� r| rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| r| r� r� r� r� r� r� r| r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� rr r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� rr r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� rr rr r� r� r� r� r| rr r� r� r| r� r� r� r� r� r� r| r� r� r� r� r� r| r� r� r� r| r� r� r� r� r| r� r� rr r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� rr r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr rr r| r� r� r� r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� rr r� r� r� r� r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� rr rr r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r| r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rr r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r| r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rr r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )ZTIS620CharToOrderMapZ
ThaiLangModelZTIS620ThaiModel� r� r� �#/usr/lib/python3.6/langthaimodel.py�<module>% s*
pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.pyc 0000644 00000060307 14751155147 0021117 0 ustar 00 3
���e01 � @ s4 d�Z d�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zd�S )�� � � � � �( �6 �- � �2 �1 �& �' �5 �$ �) �" �# �/ �. �G �+ �! �% �9 �0 �@ �D �7 �4 � � � � � � � � � � � � �
� � � �C �
� � � � �A �> � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �K �� �� �� �� �� �� �� �� �O �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �3 �Q �� �N �� �� �� �� �, �� �� �� �= �� �� �� �� �� �: �� �B �; �� �� �� �< �E �? �� �� �� �R � �J �� �F �P �� �H �� � �S �M �T � �L �U � � � � �I �* � � � � � �8 � � �V �W � g��(��P�?Tz
ISO-8859-2Z Hungarian)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1250N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r� r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN r} rO r� rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r� ra rb rc rd re rf rg rh r{ rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r� r| r� r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r` r� r r� r� r� r� r� r� ri r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r ( r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r# r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r2 r2 r2 r r r2 r2 r# r# r r r r r r# r r2 r r r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r r2 r2 r# r# r2 r2 r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r2 r r# r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r# r# r r2 r2 r2 r2 r2 r2 r2 r# r# r2 r r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r# r# r r2 r2 r2 r# r2 r2 r2 r2 r2 r# r2 r2 r r r� r2 r r2 r� r� r� r� r� r� r� r� r� r� r2 r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r2 r r2 r2 r2 r2 r2 r r2 r2 r r r2 r r2 r r� r2 r r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r r2 r2 r2 r# r r2 r r r2 r# r r2 r2 r r r� r2 r2 r2 r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r r r2 r2 r2 r2 r2 r2 r r2 r2 r2 r2 r r2 r2 r2 r2 r� r r2 r r� r� r� r# r# r� r� r� r� r� r2 r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r# r# r# r2 r2 r r# r2 r r r2 r r# r2 r r r# r� r2 r2 r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r r r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r# r r# r2 r2 r2 r2 r r r2 r# r# r2 r r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r2 r2 r r r2 r2 r2 r2 r2 r r# r2 r2 r2 r2 r2 r r r# r2 r2 r2 r� r# r# r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r2 r r2 r2 r2 r r� r2 r r2 r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r r2 r2 r2 r# r2 r r r r2 r# r# r2 r2 r# r# r� r2 r2 r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r r2 r2 r2 r r2 r2 r2 r2 r2 r# r r2 r r r� r r r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r r r r2 r# r2 r2 r r r# r2 r2 r2 r# r# r2 r# r r2 r r2 r r r r# r� r r r r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r2 r# r# r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r# r r# r2 r2 r2 r r r2 r r# r� r2 r r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r# r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r# r# r� r2 r2 r2 r2 r� r r2 r� r� r r# r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r r r2 r2 r r r r r2 r2 r� r# r r2 r r2 r r r2 r r# r r� r r r r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r# r r2 r2 r2 r r# r r2 r2 r r r r2 r r2 r2 r# r2 r2 r# r# r� r r2 r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r# r r r r r2 r2 r2 r# r# r# r2 r2 r# r# r2 r# r# r2 r r# r r2 r# r# r� r r r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r r# r r# r# r2 r2 r# r# r# r# r2 r2 r# r# r r r# r r# r# r r r# r# r� r r r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r# r# r r# r# r2 r2 r# r� r# r# r2 r2 r r� r# r# r r2 r# r� r r r# r� r� r# r2 r r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r r# r2 r2 r2 r2 r2 r# r r2 r r2 r2 r r# r# r2 r r2 r r# r r r� r# r r# r� r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r2 r2 r2 r2 r r r r r2 r# r r r# r# r2 r2 r� r2 r r# r r2 r r# r2 r2 r# r# r� r r# r2 r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r r r r2 r r2 r2 r2 r r# r# r2 r2 r# r# r# r r r2 r r2 r r r r# r� r r r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r# r� r� r2 r2 r2 r2 r2 r� r� r2 r2 r r2 r� r� r� r r2 r2 r# r� r# r r� r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r r2 r2 r2 r2 r2 r# r r2 r2 r r r# r# r� r2 r2 r r r# r r r# r� r r r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r2 r r r# r2 r# r r2 r2 r r r# r# r r r# r# r# r# r2 r r# r# r# r# r r# r� r# r r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r# r� r� r� r� r� r� r� r� r� r r2 r2 r# r# r# r# r# r2 r2 r2 r� r# r# r2 r2 r# r# r# r# r# r r r� r2 r# r# r r� r r# r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r# r� r# r r# r r r� r# r r2 r# r r� r� r� r r# r# r# r# r# r r� r� r# r# r� r� r� r� r# r r# r r r r# r r# r r� r r� r r r# r# r r# r# r r# r# r# r� r# r� r� r� r# r# r� r# r# r# r r2 r r2 r2 r� r# r r r2 r# r� r# r� r r# r r r� r# r# r� r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r2 r2 r r r# r� r� r2 r r2 r r� r� r� r# r# r2 r� r� r# r# r� r� r r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r# r r r2 r2 r# r� r# r2 r r2 r# r# r# r� r# r# r# r# r# r2 r# r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r# r# r r r r# r� r# r r2 r2 r r� r� r� r r# r# r# r r# r# r# r� r# r# r# r� r� r� r# r r r r r r# r# r# r r� r r# r# r# r# r# r r# r# r# r# r# r# r� r# r# r# r� r� r# r# r2 r r r# r� r� r# r# r r r� r2 r� r# r r# r# r� r� r# r# r# r� r# r# r# r# r� r r# r# r# r r r# r# r# r r# r r# r# r# r# r# r# r# r r# r# r# r r2 r# r# r# r# r# r# r# r# r# r� r# r r2 r2 r� r# r� r� r� r2 r2 r# r� r� r# r r r# r� r� r� r� r r� r� r# r# r# r� r r# r# r# r r# r# r# r# r# r# r r# r# r� r# r# r� r# r# r# r� r# r r# r# r� r# r# r# r# r# r# r# r� r# r r2 r2 r� r# r� r� r� r r r� r� r� r� r# r r r� r� r� r� r# r� r� r# r# r� r� r r� r# r� r r# r# r# r# r r# r# r# r# r# r# r# r r# r# r# r# r# r# r# r# r# r r� r# r# r# r# r# r� r# r2 r r r� r# r� r# r� r r2 r r� r� r# r r r# r� r� r# r# r# r� r� r r# r� r# r r r# r# r r# r# r# r# r# r# r r# r# r# r# r# r# r� r r# r� r# r# r� r# r# r# r� r# r# r r# r# r� r# r r r r� r� r# r� r� r r r# r# r� r� r r# r# r� r� r� r# r r� r� r r# r� r� r r# r# r# r r# r# r# r# r r# r r# r# r# r r r# r# r r# r# r# r r# r# r# r# r# r# r# r# r# r# r� r# r# r r2 r� r� r� r# r� r2 r r# r� r� r# r r# r# r� r� r� r� r r# r� r# r# r� r� r r# r r# r# r# r� r� r� r# r� r# r# r# r# r# r r� r� r# r� r� r� r r� r� r# r# r# r# r# r# r# r# r� r# r2 r� r� r r# r r r# r� r� r r# r r r� r� r� r r# r# r# r� r# r# r� r� r# r# r r� r� r� r# r r# r r r# r# r r# r r� r# r# r# r# r# r# r# r# r# r r# r# r� r� r# r# r# r# r� r� r# r# r2 r r� r� r� r# r� r r r r� r� r� r r r# r� r� r� r� r2 r# r# r# r# r� r� r r# r# r# r r# r� r# r# r# r� r# r# r# r# r# r# r# r� r r# r� r� r# r� r# r# r� r# r# r# r# r# r# r� r# r r2 r r� r� r� r# r� r r r� r� r� r� r r# r# r� r� r� r� r r# r� r# r# r� r� r r# r# r� r r# r# r# r# r r# r r# r r� r# r# r# r� r r# r# r# r r# r# r# r# r� r# r# r# r# r# r� r# r2 r# r# r r r r2 r r# r# r r r# r# r� r# r� r r r# r# r# r# r# r� r� r# r# r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r� r� r� r� r r r� r� r� r� r r r# r� r� r� r# r# r� r� r# r r� r� r r# r# r# r r r# r# r# r r# r r# r# r� r# r# r# r# r r# r# r# r r# r# r# r# r� r# r r# r# r# r� r# r# r� r� r# r r2 r r# r� r� r r� r# r# r� r� r� r# r# r# r# r� r# r# r� r� r# r� r� r� r� r� r# r r# r r# r r# r# r# r r� r r# r# r# r� r# r r� r� r# r# r# r� r� r� r� r� r� r� r� r� r r2 r r� r� r� r� r� r# r# r r# r� r� r# r# r# r� r� r� r� r r� r� r# r# r� r� r r# r# r# r r# r# r# r# r# r# r r# r� r# r# r# r# r� r r# r# r# r# r# r# r� r# r� r# r# r# r# r# r� r# r# r r r� r# r# r# r� r r r r� r� r� r2 r r# r� r� r� r# r# r� r� r# r# r� r# r# r# r� r� r# r# r� r# r# r# r# r# r# r# r# r r# r# r# r# r# r# r# r r# r# r# r� r� r# r# r# r� r# r� r# r r# r� r r# r# r r r# r# r r# r# r# r� r� r� r# r# r� r# r# r# r# r� r� r# r# r# r� r� r� r# r r r r r r# r# r# r r� r r# r# r# r# r# r# r# r# r# r# r# r# r� r# r# r� r� r� r# r� r# r r2 r� r� r� r# r� r r r� r� r� r� r r r� r� r� r� r� r# r� r� r# r� r� r� r r� r# r� r r# r# r# r# r# r� r r� r� r� r# r r# r# r# r# r� r# r r� r# r� r# r� r# r# r# r� r# r� r# r r r r� r� r� r# r� r r# r r� r� r� r# r# r r� r� r� r� r# r� r� r# r# r� r� r r# r� r# r r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r r� r# r# r# r# r# r� r# r# r r r� r� r� r# r� r r r r� r� r� r# r# r� r� r� r� r� r# r# r� r r� r� r# r# r# r� r# r# r� r# r# r# r# r# r# r� r# r# r# r# r� r� r# r� r� r# r# r� r# r� r# r# r# r# r# r� r� r� r# r# r� r� r# r� r# r r# r� r� r# r# r# r r� r� r� r# r# r� r# r� r# r# r� r� r# r� r� r� r� r� r� r r# r r# r# r# r# r# r r� r r� r# r# r� r# r r# r� r# r# r# r� r� r� r� r� r� r# r� r� r r# r# r� r# r r� r� r# r# r# r� r� r� r# r# r� r� r� r� r� r# r� r� r# r� r� r� r r# r� r# r r r# r# r# r# r# r r# r# r� r# r# r# r# r r# r# r# r r# r# r� r# r� r# r# r# r# r# r� r# r# r r r� r� r� r� r� r# r# r� r� r� r� r r# r� r� r� r� r� r r� r� r r r� r� r r� r� r# r r# r# r# r# r# r# r# r� r# r# r� r# r# r� r# r� r� r� r# r# r# r# r� r� r# r# r# r# r� r� r# r# r# r r� r� r2 r# r� r r# r# r# r� r� r# r# r# r� r� r� r# r# r� r� r� r# r� r� r# r� r# r� r# r r# r� r# r# r# r r# r# r� r# r# r# r# r# r� r� r� r# r# r# r# r# r� r# r� r� r� r# r� r� r r# r# r� r� r� r� r� r# r� r� r� r� r� r� r� r� r# r� r# r� r� r� r# r� r� r� r� r r� r� r� r r# r# r# r# r# r# r# r# r# r� r# r# r# r# r# r# r# r# r# r r# r# r� r� r# r# r# r# r# r� r# r r# r# r# r r# r# r# r� r# r# r r# r� r� r� r� r# r# r# r# r� r# r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r� r# r# r# r# r# r� r� r# r# r r# r� r� r� r# r# r� r� r� r# r# r� r� r# r� r# r� r� r� r# r r# r# r# r# r# r# r# r# r� r# r� r# r# r# r# r# r# r� r# r# r# r� r� r� r� r� r� r# r� r� r r� r� r� r# r# r# r# r� r� r# r# r� r� r� r� r� r# r# r# r r� r� r# r� r� r# r� r# r� r� r� r� r# r# r# r# r# r# r# r# r r� r# r# r# r# r� r# r# r# r� r# r# r# r� r� r� r� r� r� r� r� r� r# r� r� r# r# r# r# r# r� r� r r# r� r# r� r� r� r# r� r# r� r� r� r� r� r� r# r� r� r� r� r� r� r# r# r# r# r# r# r� r# r# r� r# r� r# r# r� r# r# r� r� r# r# r# r� r� r� r� r� r� r� r� r� r# r� r� r# r# r# r� r� r� r� r# r� r r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r# r# r# r# r# r� r� r# r# r� r# r� r# r� r� r# r# r# r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r# r# r r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r# r� r# r� r� r# r# r� r# r� r# r# r� r# r# r# r� r# r# r# r� r� r� r� r� r� r� r� r� r r# r# r# r# r# r# r# r# r# r# r� r� r# r# r# r� r� r# r� r� r# r� r# r� r# r# r# r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r# r# r# r# r� r� r� r# r# r# r� r� r� r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r# r# r# r# r� r# r# r� r# r� r# r� r� r# r# r� r� r# r# r� r� r� r� r� r� r� r� r� r� )Z Latin2_HungarianCharToOrderMapZ win1250HungarianCharToOrderMapZHungarianLangModelZLatin2HungarianModelZWin1250HungarianModel� r� r� �(/usr/lib/python3.6/langhungarianmodel.py�<module># sV
pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.pyc 0000644 00000003543 14751155147 0017357 0 ustar 00 3
���e�
� @ sH d dl mZ d dlmZmZ d dlmZ d dlmZ G dd� de�Z dS )� )�
CharSetProber)� ProbingState� MachineState)�CodingStateMachine)�
UTF8_SM_MODELc sT e Zd ZdZ� fdd�Z� fdd�Zedd� �Zedd � �Zd
d � Z d d
� Z
� Z S )�
UTF8Proberg �?c s* t t| �j� tt�| _d | _| j� d S )N)�superr �__init__r r � coding_sm�
_num_mb_chars�reset)�self)� __class__� � /usr/lib/python3.6/utf8prober.pyr & s
zUTF8Prober.__init__c s" t t| �j� | jj� d| _d S )N� )r r r r
r )r
)r r r r , s
zUTF8Prober.resetc C s dS )Nzutf-8r )r
r r r � charset_name1 s zUTF8Prober.charset_namec C s dS )N� r )r
r r r �language5 s zUTF8Prober.languagec C s� xj|D ]b}| j j|�}|tjkr,tj| _P q|tjkrBtj| _P q|tj kr| j j
� dkr| j d7 _ qW | j tj
kr�| j� | jkr�tj| _| j S )N� r )r
Z
next_stater ZERRORr ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenr �stateZ DETECTING�get_confidenceZSHORTCUT_THRESHOLD)r
Zbyte_str�cZ coding_stater r r �feed9 s
zUTF8Prober.feedc C s. d}| j dk r&|| j| j 9 }d| S |S d S )Ng�G�z��?� g �?)r �
ONE_CHAR_PROB)r
Zunliker r r r L s
zUTF8Prober.get_confidence) �__name__�
__module__� __qualname__r r r �propertyr r r r �
__classcell__r r )r r r # s r N)
Z
charsetproberr Zenumsr r Zcodingstatemachiner Zmbcssmr r r r r r �<module> s pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.pyc 0000644 00000005513 14751155147 0017744 0 ustar 00 3
���e6 � @ s, d dl mZ d dlmZ G dd� de�ZdS )� )�
CharSetProber)� ProbingStatec s� e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZ� fdd�Zdd� Zdd� Zdd� Zdd� Zdd� Zedd � �Zed d � �Zed d � �Z� ZS )!� HebrewProber�� �� �� �� �� �� �� �� � � � g{�G�z�?z
ISO-8859-8z windows-1255c s> t t| �j� d | _d | _d | _d | _d | _d | _| j � d S )N)
�superr �__init__�_final_char_logical_score�_final_char_visual_score�_prev� _before_prev�_logical_prober�_visual_prober�reset)�self)� __class__� �"/usr/lib/python3.6/hebrewprober.pyr � s zHebrewProber.__init__c C s d| _ d| _d| _d| _d S )N� � )r r r r )r r r r r � s zHebrewProber.resetc C s || _ || _d S )N)r r )r Z
logicalProberZ visualProberr r r �set_model_probers� s z HebrewProber.set_model_probersc C s || j | j| j| j| jgkS )N)� FINAL_KAF� FINAL_MEM� FINAL_NUN�FINAL_PE� FINAL_TSADI)r �cr r r �is_final� s zHebrewProber.is_finalc C s || j | j| j| jgkS )N)�
NORMAL_KAF�
NORMAL_MEM�
NORMAL_NUN� NORMAL_PE)r r% r r r � is_non_final� s
zHebrewProber.is_non_finalc C s� | j tjkrtjS | j|�}x�|D ]�}|dkrp| jdkr�| j| j�rT| jd7 _q�| j| j�r�| j d7 _ n,| jdkr�| j| j�r�|dkr�| j d7 _ | j| _|| _q"W tj
S )Nr r ) �stater �NOT_MEZfilter_high_byte_onlyr r& r r r+ r � DETECTING)r Zbyte_strZcurr r r �feed� s
zHebrewProber.feedc C sx | j | j }|| jkr | jS || j kr.| jS | jj� | jj� }|| jkrR| jS || j k rd| jS |dk rr| jS | jS )Ng ) r r �MIN_FINAL_CHAR_DISTANCE�LOGICAL_HEBREW_NAME�VISUAL_HEBREW_NAMEr Zget_confidencer �MIN_MODEL_DISTANCE)r ZfinalsubZmodelsubr r r � charset_name� s
zHebrewProber.charset_namec C s dS )NZHebrewr )r r r r �language s zHebrewProber.languagec C s( | j jtjkr"| jjtjkr"tjS tjS )N)r r, r r- r r. )r r r r r, s zHebrewProber.state) �__name__�
__module__� __qualname__r r' r! r( r" r) r# r* r$ Z NORMAL_TSADIr0 r3 r2 r1 r r r r& r+ r/ �propertyr4 r5 r, �
__classcell__r r )r r r � s.
; r N)Z
charsetproberr Zenumsr r r r r r �<module> s c pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.opt-1.pyc 0000644 00000056746 14751155147 0020222 0 ustar 00 3
���e�4 � 0 @ s d Z dZ� d2Z� d1S (3 g @�0 �
� �x �t �� � � �H �a �� � �� � �+ � �W �u � �h � �] � � �� � �� � � � � � �v �w � �� �� � �m �F �! �p �� � �� � �� � �� � �x �� �/ � � �� �� � � �� � �9 � � �� �t �� �- �y � �K � � �� �� �� �� � �O � �n �� �� �� �� �� � �0 � �� �< �4 �{ � �� �� �� �� �i �� �r �� �� �� �� � �� �� �� �� �� �� �X �X �� �� �� �� �Y � � �& � �P �� �� �� � � �� �� �^ �� �� �� �� �� � �� �9 �� �� �� �� �� �� �Q �� �" � �t � � � � � �] �{ �7 � � � �{ � �; � �u �� �z �/ � �| �� � � �� �7 � � �. � � � � � � � � � � � � � �{ � � � �# �| �} � �~ � �t �8 � �_ � �
� � �
�! � � � �_ � � �� �� � � �* � �u � �` �" � � �| � � � � � � �a � � � � � � �? � �R �! � �/ � � �! �" �= � � �# � �$ �% �& �' �( �) �, �� �' �b �$ �* � �+ � �- �� �, � � � �� � �& �U � �� �# � � �- �. �' � � �f �/ �s � �0 �� � � � �� � � �9 �e �[ �1 � � � �Z � � �: �� � � �2 �3 �� �G � � � �y �4 �� � � �5 �6 �7 �, �w �� � �s �8 � �� �9 �: � � �~ �; � �< �; �} �= �> �? �o �) �� � �@ � �A �B � �� �2 �Y �C �D � �< �E �F �G �H �I �% �J �K �L �M �N �O � �` �> �P � �= �Q � �R � �S �T �; �� � � � � �U � �V �W �X �4 �Y � � �Z �[ � �\ �] � � �^ � � �_ �" �P � � �` �; � �~ �H �a � �v � �z �? � � � �b � � �< �c �d �d �e �f �c �0 � �d � �g �y � � �h �i �s �0 �j �= �k � �l � �� � �< �b � � �U � �� � � �I �m �n �o � �p �q �r �s �t �u � �� � �� �6 �v �w � �* � �] �x �y � � �z �Z � �- �: � �b �
�{ �| � �& �' � �� �5 � � � �> �} �~ �w � �g � � � �6 � �% � � �( � �v � � � �w � �� � � �E � �� � � � � �� � � �f �� �V � �7 � � � � �B � �N � �[ � �' � � � � � � �� �S � � � � �� �e � � �x � � �� � � � � � � � � � � � � � � � � � �� �? � � � � �q � �f � �( �) �� � �~ �� �\ �� � � �� �� �) � � � � �� � �� � � � � �$ � �� �� � �� � �l � � � � �~ �� �� �C � � � � �@ � �� � � �� �2 � �� �K � �z �V � �� �� � � �Q �r �f � � � � � � �h �+ �3 � �1 � � � � � � �g �( � � � �z �� � � � � � � � � � � � �� � � � � �A � �< �j � � �M �g � �2 �� �� �� �� �� �� �� �� �� �V �h � �� �J �� �� �0 �� � �b � � � �� � �� � �� � �Y � � � �� � �� �a �! �* � �� �� �� �� �K �D �8 � �R � �B � �@ � � � � �� �� � �y �� �� �� �� � �X �: � �� �# �� � �� �i �� �G � �� �k � �� �= �� �� � �� �! � �� �� �J �� �� �= � � � �} �� � �j � � �� �� �� �� �� �� �� �� �� �� �E �� �� �� �� � �j �O �4 �� � �� �� �� �� � �� �� � �v �] � �C � �� � � � � � �o � � � � �
� � � �l �c �A � � �� �� � � � � � �T � �� �k � �� �� � � �� �3 �* � �q �� �� �> �� � � � � � �+ � � � � � �; � �p � �x � �� � �� � � � � �� � � �
� � � �
�� � � � �l � � � � � � �) �� � � � �m �8 � � �D � �� � � � � � � � � � � �7 �L �B � � �D � �� � � � �t � � � � �! �
�" �# �$ �% �R �& �' �( �) �* � �+ �, � �, �- �. �m �� �
�^ �/ �c � �E �� � � �a �m �0 �E �1 �2 �3 � � � �4 �T � � �� �5 � � � �� �6 �7 � �n � � �o �8 �9 �F � � � �: �G �; �< �= �> �? �@ �A �B �C �D �E �$ �F �G �� �� �% � � �p �H �I �J �K �L �� � � �� � � �� �M �N �O �P �Q �R � � �S �/ �T � �U �� � � �V � �I �H �� � �� � � �W � �X � �q �Y �Z �[ �\ �� �r � �s �] �^ �_ �` � �v �L �a � �� �. � �b �F �> �� �� �j �c �Z � �� �B �6 � �` �d �e � �� �| � �f � � �5 �g � �h � �i �H � �j �� � �k � �l �� �1 �m �n �o �p �q �r �C �s �t �u �v �w �� �x �y �z �{ � � �| �} �~ � � � � � � � � �O �� � � � � � � � � � � � �E � � �q � � �I � �\ � �- � � �S � � � �
� �e � � �� �l � �M � � �Q � �P � � �^ � �
�- �F � � � � � � � �� � � � � � � � �� � � �
�. �� �t � � � � �J �� � � � � � � �g � � � � � � � � � � � � � � � � � � �� � � � � � � � � � � � �� � �� �u � � �� �9 � � �� �� � �� �$ �� �� �� � � �5 �% � �k �L � �� � �� �� � � � �� �� �A � � � �� � �� � �� �� �R � �u � �� �� � �� �) �� �� �: �� �� �� � �� �� �� �" �$ �v �� � � �c �Z � �� �� �� �� � �* �W � �K �� �L �� �+ � � � �� �� �� �� � �� � �B �� �� �? �� � �� � �� �� � �� � �M �[ �5 �� �� �� �n � �� �� �� �� �C �� �' �� �� �� �� �� � � �� �
�� �� �� � �� � �� �� �� �� �� �F �T �/ �� �� �� �� � �8 � �u � �� �� �K �� �( �M � � �i � � �� �� � � � � �� � �T � �? � �� � � � � � �e � �( �� � � � � � �% �0 � � � �O � � �8 � � � � � �� � � � � � � �� �# � �� � � �� �V �
� � �P � � �M �W �� �
� � � �| � �
�S �� � � � �� �� �� � � �� �� � � � � � � �� � � � �9 �D � � �� � �� � � �3 � �� � � � �{ � � �� � � � � � �� � � � � �! �k � �� � �� �N �� �Y �� �" �# �$ �% �& �' �( �] �) �* �+ �, �- �. � �/ �� �� �> � � �� �1 � � �� � �\ � �2 � �3 �� �� �4 �5 �6 �w �7 � �8 � �3 � � �� �9 �: �L � �� � �; �� �< � � � � �� �� � � �� �� �= � �J �> �? �@ �� �A �� �B �C �D �� �E �� �� �F �G �H �I �� �� �� � �� �� �J �K � �� �L �M �N � �I �O �P �� �Q �R �S � �T �� �U �V �W �X �� �Y �Z �[ �\ �] �� � �^ �_ �` �a �� � �b �c �d �e � �� �f �g �U �� �x � �h � �� �i �j � � �� �4 �& �� �� �� �! � �� � �S �y � �� �� �" �
�� �# �k �� �l �m �n � � �� �p �Q � �. �o �U � �O �� �p �� �q �r �s �x �t � �u �v �w � � �$ �x � �y �� �` �z �{ �| �} �� �~ � � � � � � � �� �C �� � � �� �% �y � � �o � �� � � � � � � � � � � � � �� � �� � � � � �@ � �� � �G � �� �� � �2 �� �� �� � � � � � �N � � �� �� � �� � � � � � �r � �� �z �n � �� � �P � �# � �& �Q � �� �m � �c � �� � �' � �w � � �� �( �l �@ �� �� �� �) �� �* � � � � �� � � � � � � � � �� � � � �H � � � � � � � � � � �� � � �r � � � �A � � �� �� � � �} �, � � �: � � � � �
� �I � �N � �1 � �W �� �� � � � � �� �� �+ �� �� �1 �� �b �� �� �q �� �, �� � � �e � �� �_ � �d �� �� �� �� �� �� � �� �2 � � � �� � �� �� �� �� � �� � �� �� � �- �� �� � �� �� �� �� �� �� �� �� �� �� �� �� �� � �� �� �� �� � �� �7 �� �� �� � �� �� �� �� �� �� �� �� � � �� � � � �� �, �G �� � �� �� � �^ �� �� �. �� � �g � �� �� �� � � � � � � �� � �_ � � � � � � �h �h � �{ � �| � � � �3 � � � �� �� � �
�
�\ � � � � �
�
�
�
�
�
�
� �
�
�
�
� � � �
�j �
�i � �4 � �
�
�
�
�
�
� � �
�
�
�
� �6 �d �� �/ �
�
� � � �o �
� �R �� � �� � �& �
�k �n �z �� � �� �� �
� �
� �� �X � �d � �S � �} �
�} � �� �~ � �� � �� �
�!
�N �"
� � � �� �� �� �#
� � �s �$
�%
�&
�f �D � �1 �'
� � �(
�@ �)
�^ � �� � �*
�� �+
�,
�-
�.
�/
�J �+ �0
�1
�2
�� �T � �3
�4
�5
�6
�� �7
�A �. � � �� �8
�9
� �" �:
�;
�� �<
�=
�>
� � �0 �?
� �@
� �A
�B
� �C
�D
�E
�F
�G
� � �_ �[ �H
�I
� � �` �a �J
� � � � �K
�L
�M
�N
� �O
� �i � � � �P
�Q
�R
N(0 r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx r ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 )Z EUCKR_TYPICAL_DISTRIBUTION_RATIOZEUCKR_TABLE_SIZEZEUCKR_CHAR_TO_FREQ_ORDER� r1 r1 � /usr/lib/python3.6/euckrfreq.py�<module>) s( pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.pyc 0000644 00000152605 14751155147 0017270 0 ustar 00 3
���e�{ � @ s d Z dZ�dZ�dS ( g �?i � � �� � � �� � �R � � � �� � �� �
�n � �! � � �L �, �A � �s � � � � � �L
�S
� � �� �� � � �. �N �i � � �� �: �� � � �? � � �= �N �K �� � �� �l �� � �
� �� �
� � �
� � � ��
�o �$ � �i � � �c �8 � �� � � � � � � �z �| �� �t �" �
�e �@ �\ � � � � � �� � � �F � �M
�Q �H � � �P �v �� �f �� � � �D �T
�� � �F �N
� �E � �O � �/ �� �s �� �3 �< �2 � � �& �L �� �� �O
� �� �G � � �M � � �? � � �` � �F �* �� �g � �Z �
�: � � � �K �� � � � � � � �� �` �� � � �g � � � �q � �~ � �� �P
� � � �� � �! � �u � � �* � � � �
� �~ �� �� �� � �e �� �G �^ �� �� � � �U �C �� �B �� � � �� � � � �j �o �/ � � �O �2 �[ � �� �
�& � � � �� �S �( � � � �p �] � �6 �i �
�' � � �� � � �8 � �+ �% �[ � � �\ �� � �� � � �X �( � �� �� �0 �� � �H �
�
�" �! �� �+ � �1 �" � � �
�O �G � � �f �1 �� � �� �� � � � �2 �9 �� �l �, �� � � �� � � � �} �h �# �q
�Q �M �& � �X � � �# � �� �
� � �� �j �� �� �M � � �� �% � � � �$ � � �' �� �� �N �i � �7 � �J �� �! �� �� � � �� �M � �) �P �U
�� � � �
� �% �
�
�� � � �
� �I �� �3 �� �
� �r
� �� �� � � � �m �� � �$ � � �x � �� �� � �
� �� �� �% �& �� �
� � � � � � � �& � �' � � �' � � �. � � � � �H � �� � �� �$ �# �� �D �& �A �� � �� �� � � �U �G � �� �� �
�Q
�P �S �' � � �d � �0 �F �� �� �* � � � � � �� �J � � �U � �� � �I �R
� � �< � �S
�: �7
��
�� � � �9 �� �} � �� � � �V �P �T
� �) �C � �� � �& �
�� �) � � �m � �� � � � � �4 �� �� � �n �* � �� � � � � �O � � �� � � �+ �( �
�� �� � �U
�( �� �5 �Y �j �
�l � �u � �) �
�* �+ �V
�
�= �� � �� �� �� �� � �4 � �! �� � �T �, �x �� �� �e � �� �� �J �P � �s
�5 �A �V
�/ �k �� �
� �l �! � �� �A � �` � �
� � �A � �
� � � �
�� � � � �� � � �� �M �
� � � � �� �W
� � �
�t
� �� �+ �} � �j �8
�� � � � � � � �� �- �) �m �� �� �W
�� � � �
� �a � �
�P �K � �, � �� �� �7 �' �u
�� �{ �k �� � � �� �
�9
�� � � � � � � � � � �1 �� �b � �� �
�� � �o �� �X
�, �Q �� � �� � � � ��
��
�X
�� � � �5 �D � � �l � �� �[ �
�� � �Y
� �% � �. �Y � �* � �� �
�� �R �� �� � �p �� � �n �c �g �+ � �� �' �2 � � �� �{ � �l �� �m � � �:
�� �f �
�� �| �5 �� � � �� �Z
�� �
� � �� � �, � � � �� �; �� �I �Y �� �� �[
�X �" �� � �� �� � �~ �� �� �, � �k � �� �- �� � � � � �D � �� � �> �] �� �, �� �� �� �v �L �B �i �& �� �� �
�� � � �G �� �� � �B �� �
�!
�� �� �u � �� � �� � � �a � �� � �v
�S �� �} �;
� �D �� �= �� �0 � �� �\
�( �� � �� �v � � �� �� �� � �. �� �� �9 �H � � �� �� �]
�E � �� �� �� � �! �� �/ �� �� � � �- � � �Q �* � �. �/ �� � �� � �0 �3 � �"
� �* �R � � �� �W �� �� �/ � �b �. �� � � � �� �� �� �� �R � � � �) � �2 � � �� �� �� �� �� � �Z �� �T � �w
� �� �� � � � � � �� � �[ �O � � � �` �7 �x
�^
� � � � �� � �\ �� �� �� �� �� �� �g � � �n � �
�_ � �~ �� � �� �0 � �
�a �� �y
�] �� �� �� � �� � �� � �; �� � �- � �� �L �� �� � �/ � �� �� �� �` �� �# �" �� � �� � �0 �
�s � � �� �d �s ��
�� �Y
�� � �k �w �o �� � �� �� �� �1 � �2 �� �g �p �Q � �U � �v �� � � � �C �S � �^ � � �5 � � �B �� �_ � �b �N �� �� �X � �� � �
� �L �c �
�
� �K �w �* �a �G �3 � �
� � � �1 �6 � �2 �6 �N � � � � �3 �� �: � �\ �q � � � �- �� � � �3 �
�� �� �� �x �
� � �r �� �4 �
�_
� �U � � � �@ � �5 �� � � � � �� �/ �+ �6 � � � � �� � � �
�7 �Z
� �� � �8 �4 � �C � � � �� �l � �`
� �� �� � � �Y � � �� � �5 �� �{ � � � � �$ �7 � �M �V �0 �r � �� � �g � �V � �8 � �9 �, �Z �� � �{ �# �W �0 � � �$ � �
��
� �4 � �[ � �v � � �c � �V �M �$ �- � � � �X � � � �d � �� �W �[
� � �� � � �q ��
� �1 � � � � �t � � � � � � ��
�2 � �2 �: �3 � �. � � �2 �� �
� � � �� � �% � �� � � � �
�� � � � � � �
��
�6 � �4 �� �| � � �S � � � �_ ��
� � �� � �` � � � � � �3 � � �; �r � � � �7 �Y �L �; � �� �� � � � � �T �\ �� � � �< �� �V �5 � � ��
� � � � �" �x �% � �; �8 � � � �2 �E �= �! � � �� �^ � �w ��
�" � �� � �s � �# �< �Q � �� �r �$ � �] � �% � �. �& � �3 �5 �B � �y �' �� � � � � � �> �Y �a
�b
�( �
� �) �* � � � � � �: � �6 � �^ � � � � �( ��
�+ �+ � � �x �, � �. �h �/ �- � � � �
�V � � � �h �� �z �. � � � � �< � �� �; �/ �? � � �
� �0 �8 �� � �� �5 �6 �
�_ �) �1 �2 � �3 �y � � �� �
� �^ �4 � � �? �$ �+ �\
� �5 �_ �W �� � �z
�6 �0 � �
�]
� �� �p �7 � �� �8 �^
�<
�� �V �9 � �6 �� �I �w �} �c
�^ � �
�9 �@ � �
�A � �� � � �: �e �1 � � �B �� �� � �� � �� � � � �7 �; �< �� �= �{
�� �( �` �R �1 �Y � �I �� �� � � �6 � �d
�> �� �� �e
�? �� �o � �q �Y �n � � �l � �C �D �{ �� �
�_
�E �P �U � � � �� � � �E �m � �@ �� �: �
� �
�A � � � � � �#
� �N �
� �B � �C �W �T �T � �� �
� �f
�; �D � �& ��
�| � �� �� � � ��
� � �< �=
��
�� � � �V � ��
� �o �� � �E ��
�F � � � �� �� �� � � � �D �- �8 �� �G �d �� � ��
�H �t �� � �I �z �
� �J ��
��
�K � � �|
� � � � �>
� �� � � � � �L �: � �= �� �M � �?
� � � �H �� � � � �N � � � �O �P � �F �k �Q �9 � �� �� ��
� �u � �v � � � � � �R �S � �� �} �
�> � �� �� � �
�: �T � �� �N � �C �� � �� �U �~ � � �W �� �G � � � �, � � � �� �O �� �| � � �� �O �? �V �` � � � �~ � �w � � � �@ �! �� � �; � � �� � �W �� �" ��
�X � �Y � �R �g
�u � ��
�h
��
�x �= �
� �Z � �< �� � �[ � �# � �= � �\ �$ � �] �H �I �^ �7 �O �$
�
�_ �% �v �J � � �! �w �t � �` �a �b �9 �& �� �" �{ � �� � �' �c �� �d �8 � � � �� �[ �9 � � �d �Z � �e � � �� �@
�! �( �" �f �� �� � �� �# �$ �T �g �K � � �% � �W �M �h � � �i � �� � �% � �� �� � � �
�`
� �y �7 �m �L �j �k � �: �> �! �� �� � � �B �) �l �| � � �
�z � �� �i
�� �M � �� ��
� � �m � �n �u �q �v �� ��
�
�* �N �o �p � � �q �7 �. �r �� �y ��
� � �
� �f � � � �s �! �y ��
�O � � � �� �+ �P �j
��
�> � � � � � �Y � �A �t � �u �%
�
� �v � � �z �2 �w �, �� �� � � �3 �Q �� � �
�x � �6 �9 �k
� � �& �6 �� � �- �
� �R �y �� �Q �9 �c ��
�' �. �
�o �( �B �F �? �l
�� �) �e �� ��
�z ��
�S �T � �� �� �{ �/ � � �" � �b �/ �� �` � � �0 �u � �v � � �1 � �
� � �U � �* �� �/ �E � �S � �8 �Z �| �} �F �+ � �� �! �~ �2 �, �F �P � �m
� �
� �e �s � �C �� �r � � � � � �a �3 �Z �% �- � � �� � �4 � � �� �A � � �
��
�i �
� � � �D �. � � � � �n � � � � ��
� � � � �3 �5 �J �0 �� �s ��
� �� � �@ � � �V � �/ �� �� �6 �W �A �7 �o ��
�� �P �0 � �1 � �n
� � �a �Q �2 � �p �: � � �P � �b �� � � � � �{ �3 �7 �E � � � � �� �| �F �G �X � � � � �� �] ��
�4 � � �}
� �� ��
�5 � �& � �8 �
�� �� � �� � � � � �L � �� � � ��
� �Y �
� � � � �4 �
�B �9 �8 � � � � �� �H ��
�/ �3 �Z �[ � ��
�o
� �� �: �0 �� �n �\ �� �] �� �^ � �� �� � �� � � �I �� � �� �; � �4 � �< � �= �; � � �
� �� �X � � � �� �5 �_ � ��
�
�� � �� �� �} �0 �> �p
�J � � �K � �� �� �&
�F �� �� � ��
��
�# � �[ � � �� �f � �> �q
� �? �r
� �6 � � �� � ��
� �� �� � �j � � � � �@ �- �p �9 �; �6 �y �A �� �� � � �'
� � � � � � � �V �� �� �` �� �4 �� � � �K �
�a ��
�6 �� �� �� � � � �" � � �K � �
� � �� �� �Y �G �o � �b �f �c �7 � �s
�p �r � �8 �� � � � � � �A
�Q �
�C �, �
� �� � � �� �\ �L � �u � �~
��
�� � �9 �� �� �B � �Z � � �
�C �� �� � �j �d � �0 �h �g � �e �� �M �} �7 ��
� �
� �D � � � � � �f �: �� � �N �; �
�E �F � �(
� � �< � �� �G �M �= �w �g � �~ �t �? �� � � �
�t �m �# �� � �+ � � �h � �� � � � �[ �
�O � � � �� �
�� �B
� �� �$ �t
� �
� � �a �� � � �H � � � �� �Q �" �< �
�� � �- �1 � �# �u
�' �� �D �� � � �
��
�I �� �> �J �% �� � �P � �
�i � �
�= �a
� �K � �v
�� �� �� �� �
� �� � �_ �� �j �� �? �E �1 ��
��
� �k �� �8 �Q �� � �l �� �� �
� �m �@ �
� �b �� � �� � �R �� �� � �5 �� � �� � �L � �w
� �n � �� � �4 �H � �� �M � � � � � �� �� � �\ � �o �� �N �] � � �
� �\ �x
�g � �E �
�� �� �� � �� �� �p � ��
� �q �
� �� �� � �� �O �� �� �� �r � �Z � �s �t �� � � � �P �e �� �� �� �� �� �o �� �� �^ � �} �� �� �� �z �A �& �� �� � ��
�� �� �n �- �� ��
�Q � �i �
�� � �� �R �� �u �� �� � � �B �� �� ��
�y
� �� �v �w �B �h �q �� � � �< � �* �i �S �" �T �C �> �) �
�x �U � �� � �~ �� � �� �z �� �V � � �� �� �C
�) �q � �� �W �
�� �� �� �D �� �E �T �F �p �� �� �# �# �y � ��
� �� �G �� �z
� � �� � � �� � � �S �� �X �
� �� �� �� �u �
�= �H � � �_ � �R � � � � �� �w �� �� �Y �z �{ �q �� � �3 �� �5 �� �
�� �{
� � �| �} �S �~ �� �
�
� �Z �[ �� � � � � �` �� �F � �] � � �n �� �� �I �� �
� �� �� � �� � �G �T �J �� �K �z �S �r �\ �)
� �
�v � �5 �� � � ��
�b � � �j � � �� �� ��
� � �] �^ � � � �c �� �� � � �
�� ��
�a �: �1 �� � � �� �A �h � �a ��
�6 �� � � � �b
�- �� �
�H �_ � �� � �
� � �� � � �� � �|
� �*
�f �� � �� � �
�D
� �
�L �W � � � �U � �
� � �$ �� �
�
�� �N � � �R �k � �E
�� �� � � �M �� �S �' � �` �� �s � �F
� � �a �}
�� ��
�( �j � � �~
�V �B �[ �b �W �� �� �b �
�I � �c
� �
� �{ �� � �� �� �� �c �
�� � �d �
�
�] �� �� � �= �e � �� � � � �
� �� �
�N � � �� �f �g �
��
�
� �h � � � � ��
�= � �X � � � � � � � � �d
� �H �C �
�i � �T �W �
�
� �9 � � �N �� �K �E �j �4 �J �
�Y �
� �G
� �k � � �h �O � �
�
� �] �P �Z � �l �� �Q �[ �k � �m �n �R �o �c � � � � � �S �X � � � �\ �+ �� �� � �� �I �T �U �U �� � �
�� �l ��
�D � � � �p � �q �
�k � �m � �
�K � � � � � �� �V �8 ��
� � �r �@ �W �r ��
�C �G � � � �
� �^ �
�� �� �8 �t � �: �� �
�! � �n �s � �" ��
�# �$ �] �t � �% ��
�& �r �u �' �+
�( �) � �e
�
�} �
� �� � �* �4 �1 �+ � � �� �� �� � � �, � ��
�> �X �t �r �? �� �
�- � �v �u �{ �� �w �w �� �. �x �T �,
� � � �/ �0 �� �� �� �1 ��
� �2 ��
�G �R �
� �^ � �Y �
�Z �� �
�[ �3 �^ � � � �� �� �
�) �\ � �4 �@ �v � �5 � �6 �7 � �d �] ��
�� �^ �8 � �& �� � � � �9 �y �u � � �
�� �z �R � �{ � � �� �( �_ �� �< �9 � �l � �� �� �_ �
�S �` �k �� �[ � � � �
�x �: � �; �< �!
�$ �= � �| � � �> �d ��
� �? �e � � �� �� � � � �� � ��
�} �@ �A �B �� �. �~ �a �O �
�� �� �` �b � �
�% � � �� �
�; ��
� � � �C � �D �� � � �� �f
�"
�L �
� � � ��
�E �; � �F �& �G ��
�
�� �x �H �) �� � �c � �I �d �T � ��
�
�e �� �� �� � � � �J � �g �~ � �U � �e � � � � �f �a �8 �g ��
� �b �h �K �y �� � � �L � �: �
�� � � �� �* �M �i � �� �c �t �� �M �N �� � � � � � �
� � �f � � �Y �d �e � �* � �� �O �H
� �#
�� �# �; �
�� �� � �� �I
�\ �@ � � �� �s �$
��
�P �Q �
� �
�R �j �S �T �� �+ �� �U � �V � �� �L �
�! � �J
�\ �4 �W �� � �X �Y �Z � �[ �> �w �k �f � �� �+ � � �%
�� � �$ � �\ � � � �l �
�] � �l �^ �_ �g
�% � �` �a �g � � �� �
�� �N �K
�b �c �d � �
�c �w ��
�e �� �b �y � �f �h �g �h �h � �' �i � �m �� �z �j �d �i �� � � �< �� � �| � � �� � � � � � �O �k ��
�l � � �
�a � � �m �� � � �n �
� �u �� �n � � �� �e �&
�
�o �� � � � �< �� �p �q �P �Q � �j �� � � � �� �( � �_ �r �s � � � � �< �E �R �f �� �� � �� �] � � �I �t �= � �u � �v � �
�� �o �
�
�k �, �l �w �'
� � �m � � � �F �` � �� �f �� � �
�S �J �x � �y �z �n � �L
�� �p �O �� � � �
�{ ��
� � �A �y � �� �U �� �| �} �~ �F � �q �� ��
� �� � � � � � �� � � �p � �� �B � �o � � � � �p � �-
�� �r � � �q �q �� �(
�� �r � � � �s � �� �� �
� � ��
�( �.
�s �)
� �t � �� � �*
�� �u � � �T �v �M
�{ � � �t � �' �� � � �
�� � � � � �� �� �g �Z �w �
� �c � �j �+
�p � � � �x �� �� � �h � � � �
� � � �� �,
�= � � �� � �u � � � �� �/
�y � �
�� �y �v � �� � �w � � � � �� � � �
�z � � � �� �> �� �C �' � � �� �{ � �Z � � � � � � �� �� �a � �� � � �q �? � �
� �| � � �" � ��
�� � �} �� � � �� �= � �A � �1 � �) � � � �? �
�
� � � �x � � � � � �
� � �h � �S � �� � �( � �
� � �' �x �y � �
� � �
��
� � � �� �_ � �� � �> � �} �P � �� �� � � � �~ � �
�N
� �c � �
� � � �H � � �i � � � �� � � � � � � � � �j � � � �* � � � �
�� � � � �h
� � �_ � � �/ � �< � �~ �7 �k �T � � �] � �U �b �
�t � � �g � �z �� �
�� �| � �� � � � � � � �{ � � � � �0
� ��
� �+ � �, � � � �I � � � � � � �� � �B � � �4 �s �
� � � � �� ��
� � �? �C � � � � �G �� �� � � � � � � � � � �� �� � � �| �1
� � �m �C �� �� �l � � �i
�} �� �? �� �� � � �� � �h �� �� �I �� �� � �V � �� � �� � � �� �^ � �� �� � �- �. � � �) � � �
� � � �2
� �i � �� ��
�� � � �A � � �� �-
�� �� � � �� �
�� �
� �� � � � �� � �
� �
� �� �
�� �� �Q �� �
�O
� � � �� � � � �z �K �� �� � �[ �� �J �� �� �@ � �.
� � � � �D � �} �/
�@ � �
�� � ��
� �@ � �R �� � �� �j
�~ � �� �J � �� ��
�� � � �� �
�0
� �m � �� � �m �~ �� � �� � �1
�� � �� � � � � � �
�d �� �� �� �X � �� �9 �� � � �� �� �U � �� � � �� �L � �3
�� � �� �
� �� �� �� � �� � �� �
� � �$ �( �v �� � �& �� �b � �� � �� � � � � � �� �� �{ � � �� �� �� � �� �� � �� �2
� � �� �� � �� � � �
� � �� �� � � � �^ � �� �V � � � � �� � � �� � �� � � � � �2 �W � �
�W �o �i � �k
�X � � � �A �4
� �
� �3
� � �� � � � � ��
� �� �
� � � � � � �� � �� �H � � � � � � � � � � �D � � �I �s �
� � �
�� � � � � � �w � �{ � � � � � � �/ �n �, � � � �� � �� � � �
� � � � �
� �4
�B � � � �P
�5
��
� �
� �� �
� � � � �| � �z � � � � �
�' � �5
� � � �! � � �y �� � �V � � � �� � � � � �� � �� � �� � � �
� � �- � � � � � ��
� �
�� � �� � � ��
� �" �% � � � �J �C � �� �x � � � � � � � �l
�6
� � � � �
� �
�� � �X � � � �7
� �� �
�N � �m
� � �� � �W � � �! � � �
��
�> �8
� �" �# �9
�j �D �� � � �$ �
�% � �
� � �X �& � �' �E � �( �F � �) � �x �� �k � � � �� �* �+ � �� �� �D � � �, � � � � � � �K �- �. �/ �:
� �0 �J � � �1 �| � � � �� � � �� �E �* �2 �
� � � � �� �H �x � �� � �3 � �� � � �3 � �� �� �;
�p �� �<
� �� � � �� �4 �5 � � �6 � �O �� �
�7 �8 �� �9 �� �: � �� �; �� �� �� �� �< �
� �Y �= �> �
� �? �� �@ �A �B �
�� � �=
�� �� � �o � �f �� � �� ��
��
� � �C � �D � �# � �
�>
� �E � � �F �Z �E � � �� �[ �$ �
�� �G �?
� �� �� �� �G �� �� � �@
�H �� �A
�\ �L � � �� �� �
�I � � � � � � �i �J � �� �
� �K �L �] �M �N �
�� �j � �Q
�
�B
�O �P �� � �Q �
� �� �R �
�S �T �� �( �� � � �C
�� �U � �V � �W �X �� �� �Y � �� �� �Z � �� �d �[ �c �H � �_ � �# �0 �\ � �] � �n �
�� �� �� � �^ � � �_ �k �D
�� �` �a � � �b �� �� � �c � � � �� �d � � �� �� � � �d �^ �E
�e � � �� �
� � � �f � �_ �7 � � �� � �
�� �F
� � �g �- �� � �! � �� �h � �q �; � � �� � �X � � � �� � �i �j � �� �� �
�k �l �� �� �~ �m �G
�` �n �y �p � �� �o �> � �p �� �q �
� � �r �� �a �� � � �s �t �" �u �| �� �? � � � �v � � �� �� �� �e � � �w �x �y � � � �� �z �{ �@ �| �� � �} � � � �� �% �s � �R
� �. �� �M �? �
�� �~ � �� �b � �� �@ �� �� � � �� �� �� � �� �� �� � �� � �
� �6
�I �� � � � � � � � �c �� �� � � � � � �2 � � �� �m � �@ � � � � �� � �N � � � �f � � � �Z �
� � � � � �� �\ �H
� �d �� �� �J �� �� � �� ��
� � � �� �� �K � �� � �# �� �� �� � �� �� � � � �K �� � � � �g � � �� �h �� �> � �. �� �� � � �� � � � �) �n
�t � � � � �
�o
��
�I
�� �
� � �q �� �� �r � � � �� � � �p
�� �� � �� �z � � � �U � �J
� � �1 �K
�t � � � � � �� �
�� �� �J �� � �L � � �� � � � � N( r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r )Z EUCTW_TYPICAL_DISTRIBUTION_RATIOZEUCTW_TABLE_SIZEZEUCTW_CHAR_TO_FREQ_ORDER� r r � /usr/lib/python3.6/euctwfreq.py�<module>, s� pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.opt-1.pyc 0000644 00000004436 14751155147 0020540 0 ustar 00 3
���e� � @ s` d dl mZmZ d dlmZ d dlmZ d dlmZ d dl m
Z
d dl m Z G dd� de�Z
d S )
� )� ProbingState� MachineState)�MultiByteCharSetProber)�CodingStateMachine)�EUCJPDistributionAnalysis)�EUCJPContextAnalysis)�EUCJP_SM_MODELc sP e Zd Z� fdd�Z� fdd�Zedd� �Zedd� �Zd d
� Zd d � Z � Z
S )
� EUCJPProberc s4 t t| �j� tt�| _t� | _t� | _ | j
� d S )N) �superr �__init__r r � coding_smr �distribution_analyzerr �context_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/eucjpprober.pyr % s
zEUCJPProber.__init__c s t t| �j� | jj� d S )N)r
r r r )r )r r r r , s zEUCJPProber.resetc C s dS )NzEUC-JPr )r r r r � charset_name0 s zEUCJPProber.charset_namec C s dS )NZJapaneser )r r r r �language4 s zEUCJPProber.languagec C s6 x�t t|��D ]�}| jj|| �}|tjkrN| jjd| j| j |� t
j | _ P q|tj
krdt
j| _ P q|tjkr| jj� }|dkr�|d | jd< | jj| j|� | jj| j|� q| jj||d |d � |� | jj||d |d � |� qW |d | jd< | jt
jk�r0| jj� �r0| j� | jk�r0t
j| _ | jS )Nz!%s %s prober hit error at byte %s� r ���)�range�lenr Z
next_stater ZERRORZlogger�debugr r r ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenZ
_last_charr �feedr
�stateZ DETECTINGZgot_enough_data�get_confidenceZSHORTCUT_THRESHOLD)r Zbyte_str�iZ coding_stateZchar_lenr r r r 8 s4
zEUCJPProber.feedc C s | j j� }| jj� }t||�S )N)r r r
�max)r Z context_confZ distrib_confr r r r Y s
zEUCJPProber.get_confidence) �__name__�
__module__� __qualname__r r �propertyr r r r �
__classcell__r r )r r r $ s !r N)Zenumsr r Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zjpcntxr Zmbcssmr r r r r r �<module> s pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.opt-1.pyc 0000644 00000002776 14751155147 0021446 0 ustar 00 3
���e�
� @ s� d dl mZ d dlmZ d dlmZmZmZmZm Z m
Z
d dl m Z m
Z
d dlmZmZ d dlmZ d dlmZ d dlmZ d d lmZ G d
d � d e�Zd S )
� )�CharSetGroupProber)�SingleByteCharSetProber)�Win1251CyrillicModel�
Koi8rModel�Latin5CyrillicModel�MacCyrillicModel� Ibm866Model� Ibm855Model)�Latin7GreekModel�Win1253GreekModel)�Latin5BulgarianModel�Win1251BulgarianModel)�TIS620ThaiModel)�Win1255HebrewModel)� HebrewProber)�Latin5TurkishModelc s e Zd Z� fdd�Z� ZS )�SBCSGroupProberc
s� t t| �j� tt�tt�tt�tt�tt�tt �tt
�tt �tt �tt
�tt�tt�g | _t� }ttd|�}ttd|�}|j||� | jj|||g� | j� d S )NFT)�superr �__init__r r r r r r r r
r r r
r r Zprobersr r Zset_model_probers�extend�reset)�selfZ
hebrew_proberZlogical_hebrew_proberZvisual_hebrew_prober)� __class__� �%/usr/lib/python3.6/sbcsgroupprober.pyr , s,
zSBCSGroupProber.__init__)�__name__�
__module__� __qualname__r �
__classcell__r r )r r r + s r N)Zcharsetgroupproberr Zsbcharsetproberr Zlangcyrillicmodelr r r r r r Zlanggreekmodelr
r Zlangbulgarianmodelr r
Z
langthaimodelr Zlanghebrewmodelr Z hebrewproberr Zlangturkishmodelr r r r r r �<module> s pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.pyc 0000644 00000006456 14751155147 0020130 0 ustar 00 3
���e� � @ s0 d dl Z d dlZddlmZ G dd� de�ZdS )� N� )� ProbingStatec @ sn e Zd ZdZddd�Zdd� Zedd� �Zd d
� Zed d � �Z d
d� Z
e dd� �Z e dd� �Z
e dd� �ZdS )�
CharSetProbergffffff�?Nc C s d | _ || _tjt�| _d S )N)�_state� lang_filter�loggingZ getLogger�__name__Zlogger)�selfr � r
�#/usr/lib/python3.6/charsetprober.py�__init__' s zCharSetProber.__init__c C s t j| _d S )N)r Z DETECTINGr )r r
r
r �reset, s zCharSetProber.resetc C s d S )Nr
)r r
r
r � charset_name/ s zCharSetProber.charset_namec C s d S )Nr
)r �bufr
r
r �feed3 s zCharSetProber.feedc C s | j S )N)r )r r
r
r �state6 s zCharSetProber.statec C s dS )Ng r
)r r
r
r �get_confidence: s z CharSetProber.get_confidencec C s t jdd| �} | S )Ns ([ -])+� )�re�sub)r r
r
r �filter_high_byte_only= s z#CharSetProber.filter_high_byte_onlyc C sb t � }tjd| �}xJ|D ]B}|j|dd� � |dd� }|j� rP|dk rPd}|j|� qW |S )u9
We define three types of bytes:
alphabet: english alphabets [a-zA-Z]
international: international characters [-ÿ]
marker: everything else [^a-zA-Z-ÿ]
The input buffer can be thought to contain a series of words delimited
by markers. This function works to filter all words that contain at
least one international character. All contiguous sequences of markers
are replaced by a single space ascii character.
This filter applies to all scripts which do not use English characters.
s% [a-zA-Z]*[�-�]+[a-zA-Z]*[^a-zA-Z�-�]?Nr � �r ���r )� bytearrayr �findall�extend�isalpha)r �filteredZwordsZwordZ last_charr
r
r �filter_international_wordsB s
z(CharSetProber.filter_international_wordsc C s� t � }d}d}x�tt| ��D ]r}| ||d � }|dkr>d}n |dkrJd}|dk r |j� r ||kr�| r�|j| ||� � |jd� |d }q W |s�|j| |d � � |S )
a�
Returns a copy of ``buf`` that retains only the sequences of English
alphabet and high byte characters that are not between <> characters.
Also retains English alphabet and high byte characters immediately
before occurrences of >.
This filter can be applied to all scripts which contain both English
characters and extended ASCII characters, but is currently only used by
``Latin1Prober``.
Fr r � >� <Tr r N)r �range�lenr r )r r Zin_tag�prevZcurrZbuf_charr
r
r �filter_with_english_lettersg s"
z)CharSetProber.filter_with_english_letters)N)r �
__module__� __qualname__ZSHORTCUT_THRESHOLDr r
�propertyr r r r � staticmethodr r r$ r
r
r
r r # s
%r )r r Zenumsr �objectr r
r
r
r �<module> s pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.opt-1.pyc 0000644 00000005513 14751155147 0020703 0 ustar 00 3
���e6 � @ s, d dl mZ d dlmZ G dd� de�ZdS )� )�
CharSetProber)� ProbingStatec s� e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZ� fdd�Zdd� Zdd� Zdd� Zdd� Zdd� Zedd � �Zed d � �Zed d � �Z� ZS )!� HebrewProber�� �� �� �� �� �� �� �� � � � g{�G�z�?z
ISO-8859-8z windows-1255c s> t t| �j� d | _d | _d | _d | _d | _d | _| j � d S )N)
�superr �__init__�_final_char_logical_score�_final_char_visual_score�_prev� _before_prev�_logical_prober�_visual_prober�reset)�self)� __class__� �"/usr/lib/python3.6/hebrewprober.pyr � s zHebrewProber.__init__c C s d| _ d| _d| _d| _d S )N� � )r r r r )r r r r r � s zHebrewProber.resetc C s || _ || _d S )N)r r )r Z
logicalProberZ visualProberr r r �set_model_probers� s z HebrewProber.set_model_probersc C s || j | j| j| j| jgkS )N)� FINAL_KAF� FINAL_MEM� FINAL_NUN�FINAL_PE� FINAL_TSADI)r �cr r r �is_final� s zHebrewProber.is_finalc C s || j | j| j| jgkS )N)�
NORMAL_KAF�
NORMAL_MEM�
NORMAL_NUN� NORMAL_PE)r r% r r r � is_non_final� s
zHebrewProber.is_non_finalc C s� | j tjkrtjS | j|�}x�|D ]�}|dkrp| jdkr�| j| j�rT| jd7 _q�| j| j�r�| j d7 _ n,| jdkr�| j| j�r�|dkr�| j d7 _ | j| _|| _q"W tj
S )Nr r ) �stater �NOT_MEZfilter_high_byte_onlyr r& r r r+ r � DETECTING)r Zbyte_strZcurr r r �feed� s
zHebrewProber.feedc C sx | j | j }|| jkr | jS || j kr.| jS | jj� | jj� }|| jkrR| jS || j k rd| jS |dk rr| jS | jS )Ng ) r r �MIN_FINAL_CHAR_DISTANCE�LOGICAL_HEBREW_NAME�VISUAL_HEBREW_NAMEr Zget_confidencer �MIN_MODEL_DISTANCE)r ZfinalsubZmodelsubr r r � charset_name� s
zHebrewProber.charset_namec C s dS )NZHebrewr )r r r r �language s zHebrewProber.languagec C s( | j jtjkr"| jjtjkr"tjS tjS )N)r r, r r- r r. )r r r r r, s zHebrewProber.state) �__name__�
__module__� __qualname__r r' r! r( r" r) r# r* r$ Z NORMAL_TSADIr0 r3 r2 r1 r r r r& r+ r/ �propertyr4 r5 r, �
__classcell__r r )r r r � s.
; r N)Z
charsetproberr Zenumsr r r r r r �<module> s c pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.opt-1.pyc 0000644 00000004151 14751155147 0021374 0 ustar 00 3
���eU
� @ s0 d dl mZ d dlmZmZ G dd� de�ZdS )� )�
CharSetProber)� ProbingState� MachineStatec sV e Zd ZdZd� fdd� Z� fdd�Zedd� �Zed d
� �Zd d � Z d
d� Z
� Z S )�MultiByteCharSetProberz
MultiByteCharSetProber
Nc s, t t| �j|d� d | _d | _ddg| _d S )N)� lang_filter� )�superr �__init__�distribution_analyzer� coding_sm�
_last_char)�selfr )� __class__� �%/usr/lib/python3.6/mbcharsetprober.pyr ' s z MultiByteCharSetProber.__init__c s< t t| �j� | jr | jj� | jr.| jj� ddg| _d S )Nr )r r �resetr r
r )r
)r r r r - s
z MultiByteCharSetProber.resetc C s t �d S )N)�NotImplementedError)r
r r r � charset_name5 s z#MultiByteCharSetProber.charset_namec C s t �d S )N)r )r
r r r �language9 s z MultiByteCharSetProber.languagec C s x�t t|��D ]�}| jj|| �}|tjkrN| jjd| j| j |� t
j | _ P q|tj
krdt
j| _ P q|tjkr| jj� }|dkr�|d | jd< | jj| j|� q| jj||d |d � |� qW |d | jd< | jt
jkr�| jj� r�| j� | jkr�t
j| _ | jS )Nz!%s %s prober hit error at byte %sr r ���)�range�lenr Z
next_stater ZERRORZlogger�debugr r r ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenr r
�feed�stateZ DETECTINGZgot_enough_data�get_confidenceZSHORTCUT_THRESHOLD)r
Zbyte_str�iZ coding_stateZchar_lenr r r r = s.
zMultiByteCharSetProber.feedc C s
| j j� S )N)r
r )r
r r r r Z s z%MultiByteCharSetProber.get_confidence)N) �__name__�
__module__� __qualname__�__doc__r r �propertyr r r r �
__classcell__r r )r r r " s r N)Z
charsetproberr Zenumsr r r r r r r �<module> s pip/_vendor/chardet/__pycache__/compat.cpython-36.pyc 0000644 00000000431 14751155147 0016533 0 ustar 00 3
���en � @ s@ d dl Z e jdk r(dZdZeefZeZndZdZeefZeZdS )� N� TF)r r ) �sys� version_infoZPY2ZPY3�strZunicodeZbase_strZ text_type�bytes� r r � /usr/lib/python3.6/compat.py�<module> s
pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.pyc 0000644 00000014135 14751155147 0020633 0 ustar 00 3
���e�$ � @ s� d dl mZmZmZ d dlmZmZmZ d dlm Z m
Z
m Z d dl m
Z
mZmZ d dlmZmZmZ G dd� de�ZG dd � d e�ZG d
d � d e�ZG d d
� d
e�ZG dd� de�ZG dd� de�ZG dd� de�ZdS )� )�EUCTW_CHAR_TO_FREQ_ORDER�EUCTW_TABLE_SIZE� EUCTW_TYPICAL_DISTRIBUTION_RATIO)�EUCKR_CHAR_TO_FREQ_ORDER�EUCKR_TABLE_SIZE� EUCKR_TYPICAL_DISTRIBUTION_RATIO)�GB2312_CHAR_TO_FREQ_ORDER�GB2312_TABLE_SIZE�!GB2312_TYPICAL_DISTRIBUTION_RATIO)�BIG5_CHAR_TO_FREQ_ORDER�BIG5_TABLE_SIZE� BIG5_TYPICAL_DISTRIBUTION_RATIO)�JIS_CHAR_TO_FREQ_ORDER�JIS_TABLE_SIZE� JIS_TYPICAL_DISTRIBUTION_RATIOc @ sL e Zd ZdZdZdZdZdd� Zdd� Zd d
� Z d d � Z
d
d� Z dd� Z dS )�CharDistributionAnalysisi g�G�z��?g{�G�z�?� c C s0 d | _ d | _d | _d | _d | _d | _| j� d S )N)�_char_to_freq_order� _table_size�typical_distribution_ratio�_done� _total_chars� _freq_chars�reset)�self� r �&/usr/lib/python3.6/chardistribution.py�__init__. s z!CharDistributionAnalysis.__init__c C s d| _ d| _d| _dS )z reset analyser, clear any stateF� N)r r r )r r r r r = s z CharDistributionAnalysis.resetc C sX |dkr| j |�}nd}|dkrT| jd7 _|| jk rTd| j| krT| jd7 _dS )z"feed a character with known length� r r i N���)� get_orderr r r r )r �charZchar_len�orderr r r �feedF s
z CharDistributionAnalysis.feedc C sT | j dks| j| jkr | jS | j | jkrN| j| j | j | j }|| jk rN|S | jS )z(return confidence based on existing datar )r r �MINIMUM_DATA_THRESHOLD�SURE_NOr �SURE_YES)r �rr r r �get_confidenceT s
z'CharDistributionAnalysis.get_confidencec C s | j | jkS )N)r �ENOUGH_DATA_THRESHOLD)r r r r �got_enough_datad s z(CharDistributionAnalysis.got_enough_datac C s dS )Nr r r )r �byte_strr r r r! i s z"CharDistributionAnalysis.get_orderN)
�__name__�
__module__� __qualname__r* r' r& r% r r r$ r) r+ r! r r r r r ( s r c s$ e Zd Z� fdd�Zdd� Z� ZS )�EUCTWDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) �superr0 r r r r r r r )r )� __class__r r r r s z"EUCTWDistributionAnalysis.__init__c C s0 |d }|dkr(d|d |d d S dS d S )Nr �� �^ r � r r )r r, �
first_charr r r r! x s z#EUCTWDistributionAnalysis.get_order)r- r. r/ r r! �
__classcell__r r )r2 r r0 q s r0 c s$ e Zd Z� fdd�Zdd� Z� ZS )�EUCKRDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 r8 r r r r r r r )r )r2 r r r � s z"EUCKRDistributionAnalysis.__init__c C s0 |d }|dkr(d|d |d d S dS d S )Nr � r4 r r5 r r )r r, r6 r r r r! � s z#EUCKRDistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r r8 � s r8 c s$ e Zd Z� fdd�Zdd� Z� ZS )�GB2312DistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 r: r r r r r r
r )r )r2 r r r � s z#GB2312DistributionAnalysis.__init__c C s> |d |d }}|dkr6|dkr6d|d | d S dS d S )Nr r r9 r5 r4 r r )r r, r6 � second_charr r r r! � s z$GB2312DistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r r: � s r: c s$ e Zd Z� fdd�Zdd� Z� ZS )�Big5DistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 r< r r r r r r
r )r )r2 r r r � s z!Big5DistributionAnalysis.__init__c C sX |d |d }}|dkrP|dkr:d|d | d d S d|d | d S ndS d S ) Nr r � r5 � �? �@ r r )r r, r6 r; r r r r! � s z"Big5DistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r r< � s r< c s$ e Zd Z� fdd�Zdd� Z� ZS )�SJISDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 rA r r r r r r r )r )r2 r r r � s z!SJISDistributionAnalysis.__init__c C sr |d |d }}|dkr0|dkr0d|d }n&|dkrR|dkrRd|d d }nd S || d }|d
krnd }|S )
Nr r � � � �� �� � r@ � r r r )r r, r6 r; r# r r r r! � s z"SJISDistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r rA � s rA c s$ e Zd Z� fdd�Zdd� Z� ZS )�EUCJPDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 rI r r r r r r r )r )r2 r r r � s z"EUCJPDistributionAnalysis.__init__c C s0 |d }|dkr(d|d |d d S dS d S )Nr � r4 r5 r r r )r r, r" r r r r! � s z#EUCJPDistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r rI � s rI N) Z euctwfreqr r r Z euckrfreqr r r Z
gb2312freqr r r
Zbig5freqr r r
Zjisfreqr r r �objectr r0 r8 r: r< rA rI r r r r �<module> s I pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.opt-1.pyc 0000644 00000060341 14751155147 0022044 0 ustar 00 3
���e'2 � @ s4 d�Z d�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zd�S )�� � � � �M �Z �c �d �H �m �k �e �O � �Q �f �L �^ �R �n � �l �[ �J �w �T �` �o � �s �A �E �F �B �? �D �p �g �\ �� �h �_ �V �W �G �t �� �U �] �a �q �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �i �� �� �� �� �� �� �- �� �� � � �# �+ �% �, �7 �/ �( �; �! �. �& �$ �) � �' � �" �3 �0 �1 �5 �2 �6 �9 �= �� �C �� �< �8 � � � � � � � � � � � �
� � � �
� � � � � � � � � � � �K �4 �� �* � �> �� �� �� �: � �b � � � � � � �x �N �@ �S �y �u �X �z �Y �j �I �P �v �r � g! _B�?Fz
ISO-8859-5Z Bulgairan)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1251Z BulgarianN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r( r/ r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ r rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r> r? r@ rA rB rC rD rE r� rF rG rH rI rJ rK rL rM r� r� r� r� r� r� rW rN rO rP rQ rR rS rT rU r� rV rX rY rZ r� r� r� r[ r\ r] r_ r` r^ r| r~ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r� r} r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� ( r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )Z Latin5_BulgarianCharToOrderMapZ win1251BulgarianCharToOrderMapZBulgarianLangModelZLatin5BulgarianModelZWin1251BulgarianModel� r� r� �(/usr/lib/python3.6/langbulgarianmodel.py�<module>& sV
pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.opt-1.pyc 0000644 00000042131 14751155147 0017476 0 ustar 00 3
���e�c � @ sl d dl mZ d ZejejejdejejejejejejejejejejejejejejejejejejejejfZd Zedeedd�Zd Z ejejdejejejddejd ejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejfFZ
d!Z e d
e
e dd�Z d"Z
ddddejejejejejejejejejejejejejejejejejejejejejejejejejejdejdejejejejejejejf(Zd#Ze
d eedd�Zd$ZejejdejejejejejejejejejejejejejfZd%Zedeedd�Zd&Zejejejddddejejejejejejejejejejejejejejejejejejejejejejejejejdejejejejejejejejejejejejejejejf0Zd'Zed
eedd�Zd(Zejejejejejejdejejejejejejejejejejejejejejejejejdejejejejejejejejejdejejejejejejejejejejejejejf0Zd)Zed
eedd�Z d*Z ejejejdejejejejejejejejejejejejejejejejejejejejfZ d+Z e d e e dd�Z d,Z!dd
d
ejddejejejejejejejejejejejejd d d d ejejd d d d d ejd d d d d d dd
d
ejdd d d ejd d d d d d d ejejejejf8Z"d-Z#e!d e"e#dd�Z$d.Z%d d d
d ddejejejejejejejejejejejejdddejejejdddejdejd d d
d d d dddejdddejejejdddddejdejejejf8Z&d/Z'e%d e&e'dd�Z(d0Z)ejejejejejejdd
d dd d
d dddejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejddddejejejejejejejejejejejejejdddejejejejejejejejejejejejd
d
d
d
ejejejejejejejejejejejejejejd
d
ejejejejejejejejejejejejd d d d ejejejejejejejejejejejejejejejd ejejejejejejejejejejejejddddejejejejejejejejejejejejejejejdejejejejejejejejejejejejdddejejejejejejejejejejejejejejejejejejejejejejejejejejejf�Z*d1Z+e)de*e+d d�Z,d S )2� )� MachineState� � � � � ZBig5)Z class_tableZ class_factorZ state_tableZchar_len_table�name� � � � �
ZCP949zEUC-JPzEUC-KRzx-euc-twZGB2312Z Shift_JISzUTF-16BEzUTF-16LE� � �
� � � zUTF-8N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r
r
r
r
r
r
r
r
r
r
r
r r r r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )
r r r r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r r r r r r r r r r r r r r
r r r r r r r r r r r r r r r )r r r r r r r r r r r r r r r r )-Zenumsr ZBIG5_CLSZERRORZSTARTZITS_MEZBIG5_STZBIG5_CHAR_LEN_TABLEZ
BIG5_SM_MODELZ CP949_CLSZCP949_STZCP949_CHAR_LEN_TABLEZCP949_SM_MODELZ EUCJP_CLSZEUCJP_STZEUCJP_CHAR_LEN_TABLEZEUCJP_SM_MODELZ EUCKR_CLSZEUCKR_STZEUCKR_CHAR_LEN_TABLEZEUCKR_SM_MODELZ EUCTW_CLSZEUCTW_STZEUCTW_CHAR_LEN_TABLEZEUCTW_SM_MODELZ
GB2312_CLSZ GB2312_STZGB2312_CHAR_LEN_TABLEZGB2312_SM_MODELZSJIS_CLSZSJIS_STZSJIS_CHAR_LEN_TABLEZ
SJIS_SM_MODELZ
UCS2BE_CLSZ UCS2BE_STZUCS2BE_CHAR_LEN_TABLEZUCS2BE_SM_MODELZ
UCS2LE_CLSZ UCS2LE_STZUCS2LE_CHAR_LEN_TABLEZUCS2LE_SM_MODELZUTF8_CLSZUTF8_STZUTF8_CHAR_LEN_TABLEZ
UTF8_SM_MODEL� r r � /usr/lib/python3.6/mbcssm.py�<module> sh $ (((((, " $ $ $ $ $ pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.opt-1.pyc 0000644 00000005365 14751155147 0022053 0 ustar 00 3
���e � @ s( d dl Z ddlmZ G dd� de�ZdS )� N� )� MachineStatec @ sD e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Ze d d
� �Z
dS )�CodingStateMachinea�
A state machine to verify a byte sequence for a particular encoding. For
each byte the detector receives, it will feed that byte to every active
state machine available, one byte at a time. The state machine changes its
state based on its previous state and the byte it receives. There are 3
states in a state machine that are of interest to an auto-detector:
START state: This is the state to start with, or a legal byte sequence
(i.e. a valid code point) for character has been identified.
ME state: This indicates that the state machine identified a byte sequence
that is specific to the charset it is designed for and that
there is no other possible encoding which can contain this byte
sequence. This will to lead to an immediate positive answer for
the detector.
ERROR state: This indicates the state machine identified an illegal byte
sequence for that encoding. This will lead to an immediate
negative answer for this encoding. Detector will exclude this
encoding from consideration from here on.
c C s0 || _ d| _d| _d | _tjt�| _| j� d S )Nr ) �_model�_curr_byte_pos�_curr_char_len� _curr_state�loggingZ getLogger�__name__Zlogger�reset)�selfZsm� r
�(/usr/lib/python3.6/codingstatemachine.py�__init__7 s zCodingStateMachine.__init__c C s t j| _d S )N)r �STARTr )r r
r
r r ? s zCodingStateMachine.resetc C sh | j d | }| jtjkr0d| _| j d | | _| j| j d | }| j d | | _| jd7 _| jS )NZ class_tabler Zchar_len_tableZ class_factorZ state_tabler )r r r r r r )r �cZ
byte_classZ
curr_stater
r
r �
next_stateB s z CodingStateMachine.next_statec C s | j S )N)r )r r
r
r �get_current_charlenP s z&CodingStateMachine.get_current_charlenc C s
| j d S )N�name)r )r r
r
r �get_coding_state_machineS s z+CodingStateMachine.get_coding_state_machinec C s
| j d S )N�language)r )r r
r
r r V s zCodingStateMachine.languageN) r
�
__module__� __qualname__�__doc__r r r r r �propertyr r
r
r
r r ! s r )r Zenumsr �objectr r
r
r
r �<module> s pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.pyc 0000644 00000013173 14751155147 0021021 0 ustar 00 3
���e�0 � @ s� d Z ddlZddlZddlZddlmZ ddlmZmZm Z ddl
m Z ddl m
Z
ddlmZ dd lmZ G d
d � d e�ZdS ) a
Module containing the UniversalDetector detector class, which is the primary
class a user of ``chardet`` should use.
:author: Mark Pilgrim (initial port to Python)
:author: Shy Shalom (original C code)
:author: Dan Blanchard (major refactoring for 3.0)
:author: Ian Cordasco
� N� )�CharSetGroupProber)�
InputState�LanguageFilter� ProbingState)�EscCharSetProber)� Latin1Prober)�MBCSGroupProber)�SBCSGroupProberc @ sn e Zd ZdZdZejd�Zejd�Zejd�Z dddd d
d d d
d�Z
e j fdd�Z
dd� Zdd� Zdd� ZdS )�UniversalDetectoraq
The ``UniversalDetector`` class underlies the ``chardet.detect`` function
and coordinates all of the different charset probers.
To get a ``dict`` containing an encoding and its confidence, you can simply
run:
.. code::
u = UniversalDetector()
u.feed(some_bytes)
u.close()
detected = u.result
g�������?s [�-�]s (|~{)s [�-�]z Windows-1252z Windows-1250z Windows-1251z Windows-1256z Windows-1253z Windows-1255z Windows-1254z Windows-1257)z
iso-8859-1z
iso-8859-2z
iso-8859-5z
iso-8859-6z
iso-8859-7z
iso-8859-8z
iso-8859-9z iso-8859-13c C sN d | _ g | _d | _d | _d | _d | _d | _|| _tj t
�| _ d | _ | j
� d S )N)�_esc_charset_prober�_charset_probers�result�done� _got_data� _input_state�
_last_char� lang_filter�loggingZ getLogger�__name__�logger�_has_win_bytes�reset)�selfr � r �'/usr/lib/python3.6/universaldetector.py�__init__Q s zUniversalDetector.__init__c C sZ dddd�| _ d| _d| _d| _tj| _d| _| jr>| jj � x| j
D ] }|j � qFW dS )z�
Reset the UniversalDetector and all of its probers back to their
initial states. This is called by ``__init__``, so you only need to
call this directly in between analyses of different documents.
Ng )�encoding�
confidence�languageF� ) r r r r r �
PURE_ASCIIr r r r r
)r �proberr r r r ^ s
zUniversalDetector.resetc C s> | j r
dS t|�sdS t|t�s(t|�}| js�|jtj�rJdddd�| _nv|jtj tj
f�rldddd�| _nT|jd�r�dddd�| _n:|jd �r�d
ddd�| _n |jtj tj f�r�d ddd�| _d | _| jd
dk r�d | _ dS | j
tjk�r.| jj|��rtj| _
n*| j
tjk�r.| jj| j| ��r.tj| _
|dd� | _| j
tjk�r�| j�s^t| j�| _| jj|�tjk�r:| jj | jj � | jj d�| _d | _ n�| j
tjk�r:| j �s�t | j�g| _ | jt!j"@ �r�| j j#t$� � | j j#t%� � x@| j D ]6}|j|�tjk�r�|j |j � |j d�| _d | _ P �q�W | j&j|��r:d | _'dS )a�
Takes a chunk of a document and feeds it through all of the relevant
charset probers.
After calling ``feed``, you can check the value of the ``done``
attribute to see if you need to continue feeding the
``UniversalDetector`` more data, or if it has made a prediction
(in the ``result`` attribute).
.. note::
You should always call ``close`` when you're done feeding in your
document if ``done`` is not already ``True``.
Nz UTF-8-SIGg �?� )r r r zUTF-32s �� zX-ISO-10646-UCS-4-3412s ��zX-ISO-10646-UCS-4-2143zUTF-16Tr r ���)(r �len�
isinstance� bytearrayr �
startswith�codecs�BOM_UTF8r � BOM_UTF32_LE� BOM_UTF32_BE�BOM_LE�BOM_BEr r r! �HIGH_BYTE_DETECTOR�search� HIGH_BYTE� ESC_DETECTORr Z ESC_ASCIIr r r �feedr ZFOUND_IT� charset_name�get_confidencer r
r r ZNON_CJK�appendr
r �WIN_BYTE_DETECTORr )r Zbyte_strr" r r r r3 o s|
zUniversalDetector.feedc C s� | j r | jS d| _ | js&| jjd� n�| jtjkrBdddd�| _n�| jtjkr�d}d}d}x,| j D ]"}|slqb|j
� }||krb|}|}qbW |r�|| j kr�|j }|j j
� }|j
� }|jd �r�| jr�| jj||�}|||jd�| _| jj� tjk�rz| jd
dk�rz| jjd � xn| j D ]d}|�s �qt|t��rZxF|jD ] }| jjd |j |j|j
� � �q4W n| jjd |j |j|j
� � �qW | jS )
z�
Stop analyzing the current document and come up with a final
prediction.
:returns: The ``result`` attribute, a ``dict`` with the keys
`encoding`, `confidence`, and `language`.
Tzno data received!�asciig �?r# )r r r Ng ziso-8859r z no probers hit minimum thresholdz%s %s confidence = %s)r r r r �debugr r r! r1 r
r5 �MINIMUM_THRESHOLDr4 �lowerr( r � ISO_WIN_MAP�getr ZgetEffectiveLevelr �DEBUGr& r Zprobers) r Zprober_confidenceZmax_prober_confidenceZ
max_proberr" r4 Zlower_charset_namer Z group_proberr r r �close� s`
zUniversalDetector.closeN)r �
__module__� __qualname__�__doc__r: �re�compiler/ r2 r7 r< r ZALLr r r3 r? r r r r r 3 s"
mr )rB r) r rC Zcharsetgroupproberr Zenumsr r r Z escproberr Z latin1proberr Zmbcsgroupproberr Zsbcsgroupproberr
�objectr r r r r �<module>$ s pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.opt-1.pyc 0000644 00000060307 14751155147 0022056 0 ustar 00 3
���e01 � @ s4 d�Z d�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zd�S )�� � � � � �( �6 �- � �2 �1 �& �' �5 �$ �) �" �# �/ �. �G �+ �! �% �9 �0 �@ �D �7 �4 � � � � � � � � � � � � �
� � � �C �
� � � � �A �> � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �K �� �� �� �� �� �� �� �� �O �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �3 �Q �� �N �� �� �� �� �, �� �� �� �= �� �� �� �� �� �: �� �B �; �� �� �� �< �E �? �� �� �� �R � �J �� �F �P �� �H �� � �S �M �T � �L �U � � � � �I �* � � � � � �8 � � �V �W � g��(��P�?Tz
ISO-8859-2Z Hungarian)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1250N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r� r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN r} rO r� rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r� ra rb rc rd re rf rg rh r{ rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r� r| r� r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r` r� r r� r� r� r� r� r� ri r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r ( r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r# r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r2 r2 r2 r r r2 r2 r# r# r r r r r r# r r2 r r r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r r2 r2 r# r# r2 r2 r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r2 r r# r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r# r# r r2 r2 r2 r2 r2 r2 r2 r# r# r2 r r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r# r# r r2 r2 r2 r# r2 r2 r2 r2 r2 r# r2 r2 r r r� r2 r r2 r� r� r� r� r� r� r� r� r� r� r2 r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r2 r r2 r2 r2 r2 r2 r r2 r2 r r r2 r r2 r r� r2 r r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r r2 r2 r2 r2 r2 r r2 r2 r2 r# r r2 r r r2 r# r r2 r2 r r r� r2 r2 r2 r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r r r2 r2 r2 r2 r2 r2 r r2 r2 r2 r2 r r2 r2 r2 r2 r� r r2 r r� r� r� r# r# r� r� r� r� r� r2 r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r# r# r# r2 r2 r r# r2 r r r2 r r# r2 r r r# r� r2 r2 r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r r r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r# r r# r2 r2 r2 r2 r r r2 r# r# r2 r r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r2 r2 r r r2 r2 r2 r2 r2 r r# r2 r2 r2 r2 r2 r r r# r2 r2 r2 r� r# r# r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r2 r r2 r2 r2 r r� r2 r r2 r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r# r� r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r r2 r2 r2 r# r2 r r r r2 r# r# r2 r2 r# r# r� r2 r2 r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r2 r r2 r2 r2 r r2 r r2 r2 r2 r r2 r2 r2 r2 r2 r# r r2 r r r� r r r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r r r r2 r# r2 r2 r r r# r2 r2 r2 r# r# r2 r# r r2 r r2 r r r r# r� r r r r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r2 r# r# r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r# r r# r2 r2 r2 r r r2 r r# r� r2 r r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r# r2 r2 r2 r2 r2 r# r r2 r2 r2 r2 r# r# r� r2 r2 r2 r2 r� r r2 r� r� r r# r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r r r2 r2 r r r r r2 r2 r� r# r r2 r r2 r r r2 r r# r r� r r r r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r2 r2 r2 r2 r2 r2 r# r r2 r2 r2 r r# r r2 r2 r r r r2 r r2 r2 r# r2 r2 r# r# r� r r2 r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r# r r r r r2 r2 r2 r# r# r# r2 r2 r# r# r2 r# r# r2 r r# r r2 r# r# r� r r r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r r# r r# r# r2 r2 r# r# r# r# r2 r2 r# r# r r r# r r# r# r r r# r# r� r r r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r# r# r r# r# r2 r2 r# r� r# r# r2 r2 r r� r# r# r r2 r# r� r r r# r� r� r# r2 r r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r r# r2 r2 r2 r2 r2 r# r r2 r r2 r2 r r# r# r2 r r2 r r# r r r� r# r r# r� r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r2 r2 r2 r2 r r r r r2 r# r r r# r# r2 r2 r� r2 r r# r r2 r r# r2 r2 r# r# r� r r# r2 r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r2 r2 r r r r2 r r2 r2 r2 r r# r# r2 r2 r# r# r# r r r2 r r2 r r r r# r� r r r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r# r� r� r2 r2 r2 r2 r2 r� r� r2 r2 r r2 r� r� r� r r2 r2 r# r� r# r r� r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r r2 r2 r2 r2 r2 r# r r2 r2 r r r# r# r� r2 r2 r r r# r r r# r� r r r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r2 r r r# r2 r# r r2 r2 r r r# r# r r r# r# r# r# r2 r r# r# r# r# r r# r� r# r r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r# r� r� r� r� r� r� r� r� r� r r2 r2 r# r# r# r# r# r2 r2 r2 r� r# r# r2 r2 r# r# r# r# r# r r r� r2 r# r# r r� r r# r# r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r2 r# r� r# r r# r r r� r# r r2 r# r r� r� r� r r# r# r# r# r# r r� r� r# r# r� r� r� r� r# r r# r r r r# r r# r r� r r� r r r# r# r r# r# r r# r# r# r� r# r� r� r� r# r# r� r# r# r# r r2 r r2 r2 r� r# r r r2 r# r� r# r� r r# r r r� r# r# r� r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r2 r2 r r r# r� r� r2 r r2 r r� r� r� r# r# r2 r� r� r# r# r� r� r r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r# r r r2 r2 r# r� r# r2 r r2 r# r# r# r� r# r# r# r# r# r2 r# r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r2 r# r# r# r r r r# r� r# r r2 r2 r r� r� r� r r# r# r# r r# r# r# r� r# r# r# r� r� r� r# r r r r r r# r# r# r r� r r# r# r# r# r# r r# r# r# r# r# r# r� r# r# r# r� r� r# r# r2 r r r# r� r� r# r# r r r� r2 r� r# r r# r# r� r� r# r# r# r� r# r# r# r# r� r r# r# r# r r r# r# r# r r# r r# r# r# r# r# r# r# r r# r# r# r r2 r# r# r# r# r# r# r# r# r# r� r# r r2 r2 r� r# r� r� r� r2 r2 r# r� r� r# r r r# r� r� r� r� r r� r� r# r# r# r� r r# r# r# r r# r# r# r# r# r# r r# r# r� r# r# r� r# r# r# r� r# r r# r# r� r# r# r# r# r# r# r# r� r# r r2 r2 r� r# r� r� r� r r r� r� r� r� r# r r r� r� r� r� r# r� r� r# r# r� r� r r� r# r� r r# r# r# r# r r# r# r# r# r# r# r# r r# r# r# r# r# r# r# r# r# r r� r# r# r# r# r# r� r# r2 r r r� r# r� r# r� r r2 r r� r� r# r r r# r� r� r# r# r# r� r� r r# r� r# r r r# r# r r# r# r# r# r# r# r r# r# r# r# r# r# r� r r# r� r# r# r� r# r# r# r� r# r# r r# r# r� r# r r r r� r� r# r� r� r r r# r# r� r� r r# r# r� r� r� r# r r� r� r r# r� r� r r# r# r# r r# r# r# r# r r# r r# r# r# r r r# r# r r# r# r# r r# r# r# r# r# r# r# r# r# r# r� r# r# r r2 r� r� r� r# r� r2 r r# r� r� r# r r# r# r� r� r� r� r r# r� r# r# r� r� r r# r r# r# r# r� r� r� r# r� r# r# r# r# r# r r� r� r# r� r� r� r r� r� r# r# r# r# r# r# r# r# r� r# r2 r� r� r r# r r r# r� r� r r# r r r� r� r� r r# r# r# r� r# r# r� r� r# r# r r� r� r� r# r r# r r r# r# r r# r r� r# r# r# r# r# r# r# r# r# r r# r# r� r� r# r# r# r# r� r� r# r# r2 r r� r� r� r# r� r r r r� r� r� r r r# r� r� r� r� r2 r# r# r# r# r� r� r r# r# r# r r# r� r# r# r# r� r# r# r# r# r# r# r# r� r r# r� r� r# r� r# r# r� r# r# r# r# r# r# r� r# r r2 r r� r� r� r# r� r r r� r� r� r� r r# r# r� r� r� r� r r# r� r# r# r� r� r r# r# r� r r# r# r# r# r r# r r# r r� r# r# r# r� r r# r# r# r r# r# r# r# r� r# r# r# r# r# r� r# r2 r# r# r r r r2 r r# r# r r r# r# r� r# r� r r r# r# r# r# r# r� r� r# r# r� r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r� r� r� r� r r r� r� r� r� r r r# r� r� r� r# r# r� r� r# r r� r� r r# r# r# r r r# r# r# r r# r r# r# r� r# r# r# r# r r# r# r# r r# r# r# r# r� r# r r# r# r# r� r# r# r� r� r# r r2 r r# r� r� r r� r# r# r� r� r� r# r# r# r# r� r# r# r� r� r# r� r� r� r� r� r# r r# r r# r r# r# r# r r� r r# r# r# r� r# r r� r� r# r# r# r� r� r� r� r� r� r� r� r� r r2 r r� r� r� r� r� r# r# r r# r� r� r# r# r# r� r� r� r� r r� r� r# r# r� r� r r# r# r# r r# r# r# r# r# r# r r# r� r# r# r# r# r� r r# r# r# r# r# r# r� r# r� r# r# r# r# r# r� r# r# r r r� r# r# r# r� r r r r� r� r� r2 r r# r� r� r� r# r# r� r� r# r# r� r# r# r# r� r� r# r# r� r# r# r# r# r# r# r# r# r r# r# r# r# r# r# r# r r# r# r# r� r� r# r# r# r� r# r� r# r r# r� r r# r# r r r# r# r r# r# r# r� r� r� r# r# r� r# r# r# r# r� r� r# r# r# r� r� r� r# r r r r r r# r# r# r r� r r# r# r# r# r# r# r# r# r# r# r# r# r� r# r# r� r� r� r# r� r# r r2 r� r� r� r# r� r r r� r� r� r� r r r� r� r� r� r� r# r� r� r# r� r� r� r r� r# r� r r# r# r# r# r# r� r r� r� r� r# r r# r# r# r# r� r# r r� r# r� r# r� r# r# r# r� r# r� r# r r r r� r� r� r# r� r r# r r� r� r� r# r# r r� r� r� r� r# r� r� r# r# r� r� r r# r� r# r r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r# r r� r# r# r# r# r# r� r# r# r r r� r� r� r# r� r r r r� r� r� r# r# r� r� r� r� r� r# r# r� r r� r� r# r# r# r� r# r# r� r# r# r# r# r# r# r� r# r# r# r# r� r� r# r� r� r# r# r� r# r� r# r# r# r# r# r� r� r� r# r# r� r� r# r� r# r r# r� r� r# r# r# r r� r� r� r# r# r� r# r� r# r# r� r� r# r� r� r� r� r� r� r r# r r# r# r# r# r# r r� r r� r# r# r� r# r r# r� r# r# r# r� r� r� r� r� r� r# r� r� r r# r# r� r# r r� r� r# r# r# r� r� r� r# r# r� r� r� r� r� r# r� r� r# r� r� r� r r# r� r# r r r# r# r# r# r# r r# r# r� r# r# r# r# r r# r# r# r r# r# r� r# r� r# r# r# r# r# r� r# r# r r r� r� r� r� r� r# r# r� r� r� r� r r# r� r� r� r� r� r r� r� r r r� r� r r� r� r# r r# r# r# r# r# r# r# r� r# r# r� r# r# r� r# r� r� r� r# r# r# r# r� r� r# r# r# r# r� r� r# r# r# r r� r� r2 r# r� r r# r# r# r� r� r# r# r# r� r� r� r# r# r� r� r� r# r� r� r# r� r# r� r# r r# r� r# r# r# r r# r# r� r# r# r# r# r# r� r� r� r# r# r# r# r# r� r# r� r� r� r# r� r� r r# r# r� r� r� r� r� r# r� r� r� r� r� r� r� r� r# r� r# r� r� r� r# r� r� r� r� r r� r� r� r r# r# r# r# r# r# r# r# r# r� r# r# r# r# r# r# r# r# r# r r# r# r� r� r# r# r# r# r# r� r# r r# r# r# r r# r# r# r� r# r# r r# r� r� r� r� r# r# r# r# r� r# r� r� r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r� r# r# r# r# r# r� r� r# r# r r# r� r� r� r# r# r� r� r� r# r# r� r� r# r� r# r� r� r� r# r r# r# r# r# r# r# r# r# r� r# r� r# r# r# r# r# r# r� r# r# r# r� r� r� r� r� r� r# r� r� r r� r� r� r# r# r# r# r� r� r# r# r� r� r� r� r� r# r# r# r r� r� r# r� r� r# r� r# r� r� r� r� r# r# r# r# r# r# r# r# r r� r# r# r# r# r� r# r# r# r� r# r# r# r� r� r� r� r� r� r� r� r� r# r� r� r# r# r# r# r# r� r� r r# r� r# r� r� r� r# r� r# r� r� r� r� r� r� r# r� r� r� r� r� r� r# r# r# r# r# r# r� r# r# r� r# r� r# r# r� r# r# r� r� r# r# r# r� r� r� r� r� r� r� r� r� r# r� r� r# r# r# r� r� r� r� r# r� r r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r# r# r# r# r# r� r� r# r# r� r# r� r# r� r� r# r# r# r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r# r# r r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r# r� r# r� r� r# r# r� r# r� r# r# r� r# r# r# r� r# r# r# r� r� r� r� r� r� r� r� r� r r# r# r# r# r# r# r# r# r# r# r� r� r# r# r# r� r� r# r� r� r# r� r# r� r# r# r# r� r� r# r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r# r# r# r# r� r� r� r# r# r# r� r� r� r� r# r# r# r� r� r� r� r� r� r� r� r� r� r� r� r� r# r# r# r# r# r# r� r# r# r� r# r� r# r� r� r# r# r� r� r# r# r� r� r� r� r� r� r� r� r� r� )Z Latin2_HungarianCharToOrderMapZ win1250HungarianCharToOrderMapZHungarianLangModelZLatin2HungarianModelZWin1250HungarianModel� r� r� �(/usr/lib/python3.6/langhungarianmodel.py�<module># sV
pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.opt-1.pyc 0000644 00000055442 14751155147 0021577 0 ustar 00 3
���e^+ � @ s d�Z d�Ze ed�d�d�d�d��Zd�S )�� � �% �/ �' � �4 �$ �- �5 �< � �1 � �. �* �0 �E �, �# � �3 �& �> �A �+ �8 � � � � � � � � � � �
� �
� � � �@ � � � � � �9 �: � � � � � � � � � � � � � � � � � � � � � � � � �e � � � � � � � � �j � � � � � � � �d � � � � � � � � �^ �P �] � �i � � �? � � � � � � �~ �} �| �h �I �c �O �U �{ �6 �z �b �\ �y �x �[ �g �w �D �v �u �a �t �s �2 �Z �r �q �p �o �7 �) �( �V �Y �F �; �N �G �R �X �! �M �B �T �S �n �K �= �` � �C �m �J �W �f �" �_ �Q �l �L �H � � � �k � g�X4�� �?Tz
ISO-8859-9ZTurkish)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguageN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r r r r r r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ( r$ r r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r$ r r r r$ r$ r r$ r$ r� r$ r$ r$ r$ r$ r� r$ r r$ r$ r r r� r� r r r� r� r� r r� r� r r r r r� r� r� r� r� r� r� r r r� r� r r� r� r r$ r r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r r$ r r� r$ r$ r r$ r$ r� r$ r$ r$ r$ r$ r� r$ r� r$ r$ r r r� r r� r r� r� r� r� r� r� r r r r r� r� r� r� r� r� r� r r r� r� r� r r� r r$ r$ r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r r$ r r r$ r$ r� r$ r$ r r r$ r$ r$ r$ r� r$ r� r$ r$ r r r� r� r� r r� r� r� r� r r r� r r r r� r� r� r r� r� r� r� r r� r� r� r� r� r r$ r$ r$ r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r$ r r$ r$ r r� r$ r r r r r r$ r$ r� r� r� r r r r� r r� r� r r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r r� r r r� r r� r� r r$ r$ r$ r r$ r$ r r r$ r$ r$ r$ r$ r$ r$ r r$ r r r� r$ r r� r r r$ r$ r r r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r r� r r$ r$ r r$ r$ r$ r$ r$ r$ r$ r r r� r� r r$ r� r r$ r� r� r r r r$ r� r$ r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r$ r� r$ r$ r$ r� r$ r r� r r$ r r$ r$ r r� r� r r$ r r� r� r r� r� r� r� r� r� r r� r� r r� r� r� r� r� r� r� r� r� r r r r� r r� r� r r$ r$ r$ r r$ r$ r r$ r$ r$ r$ r r$ r$ r$ r� r$ r$ r� r� r r r� r� r r$ r r r� r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r� r� r r� r r� r r� r� r r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r r$ r$ r$ r� r$ r r� r r$ r r r r$ r r$ r r r� r� r r r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r� r� r$ r$ r$ r r$ r$ r$ r$ r$ r$ r$ r r$ r$ r$ r� r$ r r r� r r$ r� r� r r r r r� r� r� r r$ r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r r� r� r� r$ r$ r$ r$ r$ r$ r$ r r r r r$ r r$ r$ r� r$ r$ r r r r r� r� r r r$ r r� r� r r$ r� r$ r r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r� r r$ r$ r$ r r$ r$ r$ r r r r r$ r r$ r$ r� r$ r r� r� r r r� r r r r r r� r� r� r r� r$ r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r r� r� r� r$ r$ r$ r r$ r$ r r$ r r r r$ r$ r$ r$ r r$ r r r� r$ r r r r$ r$ r r$ r r� r� r r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r r$ r r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r r r r� r$ r$ r r$ r$ r� r r$ r$ r r$ r� r$ r� r$ r r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r r r r$ r$ r� r$ r$ r$ r$ r$ r$ r$ r$ r$ r� r� r$ r r� r$ r$ r� r$ r r$ r$ r$ r� r$ r r$ r r� r� r� r� r� r� r� r� r� r� r r� r r r� r r� r� r� r� r� r� r� r r r� r� r r� r� r r$ r$ r$ r r r$ r$ r r� r� r r� r� r$ r$ r r$ r� r� r r� r� r r� r r� r� r� r r� r r� r� r$ r r� r r� r� r� r r r r� r r r r r r r r� r r r r� r� r� r r� r� r� r� r� r r r r$ r$ r� r$ r$ r$ r$ r$ r r$ r� r� r� r� r r$ r� r r$ r r� r r$ r r$ r� r$ r� r r$ r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r$ r$ r r r$ r r r� r r r$ r� r r r r� r r� r� r� r r� r r r� r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r r r� r� r r� r� r� r$ r$ r$ r r$ r$ r r r$ r$ r r r$ r$ r r� r r r r� r r r� r� r r r r r� r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r� r r r$ r� r� r r� r� r$ r$ r� r$ r� r� r r� r r r� r� r r r r r� r r� r� r r r r r� r r� r r r r r r� r r r r r r r r� r r� r� r� r� r� r� r r� r� r$ r$ r$ r r$ r r$ r$ r� r r r r$ r$ r$ r� r$ r� r� r� r r r� r r r r r r� r� r� r r� r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r$ r$ r$ r$ r$ r$ r r r r r$ r$ r$ r$ r r� r r� r� r� r r r� r� r r r$ r$ r� r� r r r r r� r� r r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r r r r$ r$ r� r$ r$ r$ r$ r$ r$ r r r� r r� r r$ r r$ r r r r r r r r r$ r r$ r r� r r r r r r r r r r r r r r r r� r� r r r r� r r r� r� r r� r� r� r r r$ r$ r r r r� r r r r r$ r r r r� r� r� r� r� r� r� r� r� r� r r� r r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r r r$ r r$ r r r r$ r$ r$ r� r r r r� r r r� r� r r r r r r� r� r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r r� r r� r r� r� r� r$ r$ r$ r r$ r$ r$ r$ r$ r r$ r r r$ r$ r r r� r� r� r� r� r� r� r$ r r r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r$ r$ r$ r r r$ r$ r r r r r r r$ r$ r� r$ r r� r� r r r� r� r$ r r r r� r� r� r� r� r$ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r$ r$ r$ r r r$ r r r r$ r r r r$ r$ r� r$ r� r� r� r� r r� r� r$ r r r r� r� r� r r r� r� r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r$ r$ r� r$ r$ r$ r$ r$ r r r r r r� r r r r r r r� r r r r r r r r r� r� r r r r r r r� r r r$ r r r r r r� r� r r� r r� r r� r r� r� r� r r� r r$ r$ r$ r r$ r$ r$ r� r r r� r r r$ r r� r$ r� r� r� r r� r� r� r r� r� r r� r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r r� r� r r r r� r� r r� r� r$ r$ r r$ r� r� r r r� r r� r$ r� r� r� r r� r r r� r r r� r r r r� r r r r r r� r r r r� r r� r r r r� r� r� r� r� r� r� r� r� r$ r$ r$ r r$ r r$ r r� r r r r r$ r r� r r r r� r r r� r� r r� r r r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r r� r� r� r$ r$ r$ r� r$ r$ r r r r$ r r� r$ r r$ r� r$ r� r� r� r r� r� r� r r� r r� r� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r� r$ r$ r r$ r$ r r r� r� r� r� r r r� r r$ r� r� r� r$ r r r� r$ r� r r r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r r r r� r$ r r r r r$ r$ r r$ r� r� r r� r r r� r r r� r r r� r r r� r r r r r r r� r r r r� r r r r r r r r r r� r r� r r� r� r� r� r� r� r� r$ r$ r$ r� r r r$ r� r� r r r� r� r r r� r$ r� r� r r r� r r� r� r� r� r� r r� r� r� r� r$ r r� r r� r r� r r� r� r r� r r� r r r r r r r� r r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r r� r r� r r r r� r� r$ r$ r� r r� r� r r� r� r r r r� r r� r r� r r� r� r r� r r r� r r� r r r r� r r� r r r r� r r r r� r r� r� r� r r r� r� r� r� r$ r r$ r� r r� r� r� r� r� r� r� r� r r r� r r� r� r r� r� r r� r� r� r� r� r r� r� r� r� r� r r r� r� r r� r r� r� r r� r� r� r r r� r r� r r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r� r r$ r� r� r r� r r� r r$ r r$ r� r� r r$ r� r r r� r� r� r� r r� r r� r� r r r� r� r r r� r r r� r� r r� r� r r r� r r r r� r r� r� r� r� r r� r� r� r� r$ r r r� r� r r r� r� r� r� r� r� r$ r r r r� r� r� r� r� r r� r� r� r� r� r r� r r� r� r r� r� r� r� r� r� r r� r� r� r� r� r� r� r r� r� r� r r� r r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r� r r$ r r r r r r r r r� r r$ r r r r� r� r r r� r� r� r r r r$ r� r r r r� r r r r� r r r r r r r r� r� r� r� r r� r r r� r� r� r� r� r� r� r� r r r r$ r� r$ r$ r$ r r r r r r� r r� r r� r r r r� r� r r r r$ r r r r r� r� r r r r� r r r� r� r r r� r r r r r� r� r r� r� r� r r� r r� r r� r� r� r� r$ r$ r r� r� r$ r r� r� r� r� r� r� r$ r r r r� r� r r� r� r r� r� r� r� r� r r� r r� r� r r r r� r� r r� r r r� r� r r r� r� r r r r r r� r r� r� r� r� r� r� r� r� r� r$ r$ r r� r� r r� r� r� r� r r� r� r$ r$ r r r� r� r r� r� r r� r r� r� r� r r� r r� r� r� r r r� r� r r� r r r� r� r r r r r r� r r r r r r r� r� r r r� r� r� r� r$ r$ r r� r� r r r� r� r� r r r� r r r r$ r r� r r� r r r� r� r� r� r� r r� r r� r� r r r� r� r� r� r� r r� r� r r� r� r� r r r� r r� r r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r r� r� r� r r� r� r r� r� r r$ r r r� r� r r� r� r r� r� r� r r� r r� r r� r� r r r r r r r� r r r r� r� r r r� r r r r r r r r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r r r r r� r� r r r� r$ r$ r r r� r� r r� r� r r� r r� r r r r� r� r� r� r� r r r r r r� r r r� r r r r r� r� r� r r r r� r r� r� r� r r� r� r� r� r� r$ r$ r$ r� r r r$ r r� r� r r� r� r r$ r r� r� r� r� r� r� r r� r r� r� r� r r� r� r� r� r r r� r� r� r r� r� r r� r r r� r r� r r r r� r r� r� r� r� r� r� r� r� r� r� r� r$ r r$ r� r� r� r� r� r� r� r r� r� r r r r r� r� r r� r� r r� r� r� r� r� r r� r r� r� r� r r r r� r r� r r r r� r� r r r r r� r r� r r� r r� r� r� r r� r� r� r� r� r� r� r� r r r� r r r r r r r r� r� r r� r r� r� r r$ r� r� r� r� r r� r� r r r� r� r� r r� r r� r� r� r� r� r r r� r r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r r� r� r r$ r� r r$ r r r r� r r� r� r r� r r r r r r r� r� r r r r r r r� r r� r r� r r� r r r� r� r r r r r r r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r$ r$ r$ r� r r r r� r� r� r r� r� r$ r r� r r� r� r r� r� r r� r� r� r r r r� r r� r� r� r� r� r r� r r� r� r r� r� r� r� r r� r r� r r r r� r r� r� r� r� r� r� r� r� r� r� r� r� r r r� r r r r r� r r r r r r� r� r r r r r r� r r� r� r� r r r r r� r� r r r� r r r r� r r r r r r r r r� r r r r r� r r� r� r� r� r� r� r� r� r$ r r r� r� r r� r� r� r� r� r� r� r r r� r r� r� r r� r� r r� r� r� r� r� r r� r� r� r� r r r� r� r� r� r� r r� r� r� r� r� r� r� r r� r� r� r r� r r� r� r� r� r� r� r� r� r� r� r� r� r$ r r� r r r� r r r� r r� r� r r� r� r� r r� r r� r� r� r� r� r r� r� r� r� r r� r r� r r� r r r� r� r r r� r r� r r r� r� r r� r r� r r� r� r� r� r� r� r� r� r r r r� r r r� r� r� r r� r� r� r r r� r r� r� r r� r� r r� r� r� r� r r r� r r� r� r� r r� r� r� r r� r� r r� r� r� r� r� r� r r� r r� r r� r� r� r� r� r� r� r� r� r� r� r r r r r r� r r r r� r� r� r� r r r� r� r r� r� r� r r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r r r r� r r� r� r� r r� r r� r� r� r r� r� r r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r r� r� r� r� r� r r� r� r r r r� r r r r r r r r� r� r� r� r r� r� r r r� r� r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r r r r� r� r� r r� r� r� r� r� r� r r r r r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r� r� r� r r� r� r� r r� r� r� r� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r r� r r� r� r� r� r� r� r r r� r� r� r� r� r� r� r r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )Z Latin5_TurkishCharToOrderMapZTurkishLangModelZLatin5TurkishModel� r� r� �&/usr/lib/python3.6/langturkishmodel.py�<module>% s* pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.pyc 0000644 00000073220 14751155147 0020753 0 ustar 00 3
���e F � @ s� d�Z d�Zd�Zd�Zd�Zd�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zeed�d�d�d�d��Z eed�d�d�d�d��Z
eed�d�d�d�d��Z eed�d�d�d�d��Z d�S )�� � � � � � � � � � � � � � � �J � �K � � � � � � � � � � � � �G � �B � �A � �L � �@ � � �M �H � �E �C � �N �I � � �O � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �D �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � �
� �' � � � � � � � � � � � � � � � � �
� � � � � � � �6 �; �% �, �: �) �0 �5 �. �7 �* �< �$ �1 �& � �" �# �+ �- � �( �4 �8 �! �= �> �3 �9 �/ �? �2 �F � gl���P@�?FzKOI8-RZRussian)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1251z
ISO-8859-5Z MacCyrillicZIBM866ZIBM855N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv r r rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq r\ rr rs rt ru rv r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r� ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r� rj r\ rk rl rm rn ro rp rq rr rs rt ru rv r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv r r\ r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r\ r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rw r� r� r� rx r� ry r� rz r� r{ r� r| r� r} r� r~ r� rT rU rV rW rX rY rZ r r� r� r� r[ r] r^ r_ r� r� r` ra rb rc rd re rf r� r� rg rh ri rj rk rl rm rn r� r� r� r� r� r� r� r� r� ro rp rq rr r� r� rs r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rt ru r� r� r� r� r� r� r� r� r� r� r� r� rv r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r� rj r\ rk rl rm rn ro rp rq rr rs rt ru rv r r ( r� rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx r� r� rx rx rx rx r� rx rx rx r| rx r| rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx r� rx r| r| r| r| r| r� r� r| rx rx rx r| rx rx rx rx rx rx rx rx rx rx r| rx rx r� r� rx rx rx rx rx rx rx rx rx r| rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx r| r| rx rx rx rx rx rx rx rx rx r| rx rx r� r� rx rx rx rx rx rx rx rx r| rx rx r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx r| rx rx rx rx rx rx rx rx rx rx rx rx rx r� r� rx rx rx rx rx rx rx rx rx rx rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx rx rx rx r| rx rx r� r� rx rx rx rx rx rx rx rx rx rx rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx r| r| r| rx r� rx rx r� rx rx rx rx r| r| rx r� r| r| r| rx rx r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx rx rx rx r| r| rx r| rx rx rx r| r� r| r| r� r� r| r| r| r| r| r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx r| r| r| rx r� r| r| rx rx r| r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx r� r| rx r| r| rx r| rx rx rx rx r| r| rx r� rx r| r| rx r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx r| r| rx rx rx rx rx r| rx rx rx rx r| r| r| r� rx rx rx r| r| r| r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx r| rx r| rx rx rx rx rx rx r| rx r| r| r� r� rx r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx r| r� r� rx r� r� r� r� r� r| r� r� r� r| r| r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx r| r| r| r| r� rx r| rx r| rx r| r� r| r| r� r� r� r| r� r| r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx rx r| r| rx r| rx rx rx r| r| r| r| r� r| r| r| r| rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx r| rx r| r| rx rx rx rx rx rx rx rx rx r� rx r| r� r� rx rx rx rx r| rx rx rx rx r| rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx rx r| r| rx rx r� r| r� r� rx r| rx r| rx r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� rx r� r| rx rx rx rx r| rx rx rx rx r� r| r| r� r� r| rx r| r| r| rx r| rx r| r| rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx r� r| rx r| rx r� r� r| rx rx r| r� r| rx r� r� r| rx r| r| r� r� rx r� rx r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� rx r� r| rx rx rx rx rx rx rx rx r| r� rx r| r� r� r| r| rx rx rx r| rx rx r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| r| rx rx r| r| r| rx rx r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| r| rx rx rx rx rx rx rx r� rx r| rx rx r| rx r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx rx r| r| r| r| rx r� rx r| rx r� r� r| r� r� r| r| r| r| r� rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r| rx rx rx rx rx r� r| r| r� rx r� r� rx r� r� rx r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| r| r� r� rx rx rx r| r| r� r| r| rx r� r� r| r� r� r| r| r� rx r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx rx rx rx r� r| r| r| r� r| r� rx rx r� r� r| r� r| r� r| r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx rx r| r� rx r| r| rx r| r� rx r| r� rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx r| rx rx rx r| r| r| rx rx r� r| r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r� r| r� r| rx rx r| r| r� r| r| rx r� r| r� r� r� r| r| rx r| r� r| r| r| r| r| rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx r� r� r� r� r� r| r| r� r� rx r� r� r� rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� rx rx rx r| r� r� r� r| r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| rx r| r| r| r� r| r| r| r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx r� r� r� r� r� r� r� r� r� rx r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| rx r| r| r| rx r� r| r| r| r| r| r| r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx r| r| r| r| rx r| r| r� r� r| r| r| r| r� r� rx r� r| r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� rx r| r| r| r| r� r| r� r| r� r| r� r� r� r| r� r| r| r� r� r| r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| r| r| r� r� r� r| rx r� r� r� r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r| rx r| r� r| r| r| r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r� r� r� r| r| r| rx r| r| r| r| r| r| r| r� r� r� r| r� r| r� r� r� r| r| r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r| rx rx r| r� r� r� r� r� r� r� r� r| r� r� r� rx r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx r� r| r| r| r| r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx r| r� r� r� r� r| r| r� r� r� r| r� r� r� rx r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx r| r� r� r� r| r| r| r� r� r� r| r� r� r� r� r� r� r� r� r� rx r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r| r� r� r| r| r| r| r| r| r� r| r| r� r� r� r� r� r| r| r| r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx r| r| r� r� r� r| r| r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r| rx r| r� r� r� r� r� r� r� r� r� r| r� r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| r| r| r� r� r� r| r| r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r� r| r| r| r| r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r| r� r� r� r� rx r| r� r| r� r| r| r� r� r� r� r� r| r� r� r� r| r� r� r� r� r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r| r| r| r� rx r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| rx r| r| r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r� r� r| r� r| r| r| r| r| r� r| r| r� r� r� r� r� r� r| r| r| r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r| r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r| r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r� r� r| r� r| r� r� r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )
ZKOI8R_char_to_order_mapZwin1251_char_to_order_mapZlatin5_char_to_order_mapZ macCyrillic_char_to_order_mapZIBM855_char_to_order_mapZIBM866_char_to_order_mapZRussianLangModelZ
Koi8rModelZWin1251CyrillicModelZLatin5CyrillicModelZMacCyrillicModelZ Ibm866ModelZ Ibm855Model� r� r� �'/usr/lib/python3.6/langcyrillicmodel.py�<module> s
pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.pyc 0000644 00000002031 14751155147 0017571 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�EUCKRDistributionAnalysis)�EUCKR_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� EUCKRProberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/euckrprober.pyr # s
zEUCKRProber.__init__c C s dS )NzEUC-KRr )r
r r r
� charset_name) s zEUCKRProber.charset_namec C s dS )NZKoreanr )r
r r r
�language- s zEUCKRProber.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r " s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/version.cpython-36.opt-1.pyc 0000644 00000000550 14751155147 0017676 0 ustar 00 3
���e� � @ s d Z dZejd�ZdS )z�
This module exists only to simplify retrieving the version number of chardet
from within setup.py and from chardet subpackages.
:author: Dan Blanchard (dan.blanchard@gmail.com)
z3.0.4�.N)�__doc__� __version__�split�VERSION� r r � /usr/lib/python3.6/version.py�<module> s pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.pyc 0000644 00000042131 14751155147 0016537 0 ustar 00 3
���e�c � @ sl d dl mZ d ZejejejdejejejejejejejejejejejejejejejejejejejejfZd Zedeedd�Zd Z ejejdejejejddejd ejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejfFZ
d!Z e d
e
e dd�Z d"Z
ddddejejejejejejejejejejejejejejejejejejejejejejejejejejdejdejejejejejejejf(Zd#Ze
d eedd�Zd$ZejejdejejejejejejejejejejejejejfZd%Zedeedd�Zd&Zejejejddddejejejejejejejejejejejejejejejejejejejejejejejejejdejejejejejejejejejejejejejejejf0Zd'Zed
eedd�Zd(Zejejejejejejdejejejejejejejejejejejejejejejejejdejejejejejejejejejdejejejejejejejejejejejejejf0Zd)Zed
eedd�Z d*Z ejejejdejejejejejejejejejejejejejejejejejejejejfZ d+Z e d e e dd�Z d,Z!dd
d
ejddejejejejejejejejejejejejd d d d ejejd d d d d ejd d d d d d dd
d
ejdd d d ejd d d d d d d ejejejejf8Z"d-Z#e!d e"e#dd�Z$d.Z%d d d
d ddejejejejejejejejejejejejdddejejejdddejdejd d d
d d d dddejdddejejejdddddejdejejejf8Z&d/Z'e%d e&e'dd�Z(d0Z)ejejejejejejdd
d dd d
d dddejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejddddejejejejejejejejejejejejejdddejejejejejejejejejejejejd
d
d
d
ejejejejejejejejejejejejejejd
d
ejejejejejejejejejejejejd d d d ejejejejejejejejejejejejejejejd ejejejejejejejejejejejejddddejejejejejejejejejejejejejejejdejejejejejejejejejejejejdddejejejejejejejejejejejejejejejejejejejejejejejejejejejf�Z*d1Z+e)de*e+d d�Z,d S )2� )� MachineState� � � � � ZBig5)Z class_tableZ class_factorZ state_tableZchar_len_table�name� � � � �
ZCP949zEUC-JPzEUC-KRzx-euc-twZGB2312Z Shift_JISzUTF-16BEzUTF-16LE� � �
� � � zUTF-8N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r
r
r
r
r
r
r
r
r
r
r
r r r r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )
r r r r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r r r r r r r r r r r r r r
r r r r r r r r r r r r r r r )r r r r r r r r r r r r r r r r )-Zenumsr ZBIG5_CLSZERRORZSTARTZITS_MEZBIG5_STZBIG5_CHAR_LEN_TABLEZ
BIG5_SM_MODELZ CP949_CLSZCP949_STZCP949_CHAR_LEN_TABLEZCP949_SM_MODELZ EUCJP_CLSZEUCJP_STZEUCJP_CHAR_LEN_TABLEZEUCJP_SM_MODELZ EUCKR_CLSZEUCKR_STZEUCKR_CHAR_LEN_TABLEZEUCKR_SM_MODELZ EUCTW_CLSZEUCTW_STZEUCTW_CHAR_LEN_TABLEZEUCTW_SM_MODELZ
GB2312_CLSZ GB2312_STZGB2312_CHAR_LEN_TABLEZGB2312_SM_MODELZSJIS_CLSZSJIS_STZSJIS_CHAR_LEN_TABLEZ
SJIS_SM_MODELZ
UCS2BE_CLSZ UCS2BE_STZUCS2BE_CHAR_LEN_TABLEZUCS2BE_SM_MODELZ
UCS2LE_CLSZ UCS2LE_STZUCS2LE_CHAR_LEN_TABLEZUCS2LE_SM_MODELZUTF8_CLSZUTF8_STZUTF8_CHAR_LEN_TABLEZ
UTF8_SM_MODEL� r r � /usr/lib/python3.6/mbcssm.py�<module> sh $ (((((, " $ $ $ $ $ pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.pyc 0000644 00000002030 14751155147 0017327 0 ustar 00 3
���e? � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�EUCKRDistributionAnalysis)�CodingStateMachine)�MultiByteCharSetProber)�CP949_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� CP949Proberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �!/usr/lib/python3.6/cp949prober.pyr # s
zCP949Prober.__init__c C s dS )NZCP949r )r
r r r
� charset_name+ s zCP949Prober.charset_namec C s dS )NZKoreanr )r
r r r
�language/ s zCP949Prober.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r " s r N) Zchardistributionr Zcodingstatemachiner Zmbcharsetproberr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.opt-1.pyc 0000644 00000055445 14751155147 0021365 0 ustar 00 3
���eQ, � @ s d�Z d�Ze ed�d�d�d�d��Zd�S )�� � � � �E �[ �O �P �\ �Y �a �Z �D �o �p �R �I �_ �U �N �y �V �G �C �f �k �T �r �g �s �2 �J �< �= �* �L �F �@ �5 �i �] �8 �A �6 �1 �B �n �3 �+ �, �? �Q �M �b �K �l �| �� �� �� �� �( �: �� �� �� �� �� �� �� �� �� �� �S �4 �/ �. �H � �^ �� �q �� �m �� �� �� �� �" �t �� �v �d �� �� �u �w �h �} �� �� �W �c �� �j �z �{ �� �7 �� �� �e �� �� �x �� �0 �' �9 �� � �; �) �X �! �% �$ � � �# �� �> � �� �~ �� �� �& �- �� �� �� �� �� � �� � � � � � � � � � � � � � � � � � � � � � � � � �
� � � � � � �
� � � �` � g C��|�?Fz windows-1255ZHebrew)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguageN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r ( r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )ZWIN1255_CHAR_TO_ORDER_MAPZHEBREW_LANG_MODELZWin1255HebrewModel� r� r� �%/usr/lib/python3.6/langhebrewmodel.py�<module>& s*
pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.pyc 0000644 00000057637 14751155147 0020254 0 ustar 00 3
���e�1 � @ s4 d�Z d�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zd�S )�� � � � �R �d �h �^ �b �e �t �f �o � �u �\ �X �q �U �O �v �i �S �C �r �w �_ �c �m � �H �F �P �Q �< �` �] �Y �D �x �a �M �V �E �7 �N �s �A �B �: �L �j �g �W �k �p �� �Z �J � � �= �$ �. �G �I �6 �l �{ �n � �3 �+ �) �" �[ �( �4 �/ �, �5 �& �1 �; �' �# �0 � �% �! �- �8 �2 �T �9 �y � � � � �| � � � � � � �
� � � � �
� � � � � � � � � � � �* � �@ �K � � � � g���s�?Fz
ISO-8859-7ZGreek)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1253N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r9 r: r r r r r r r r r r r; r r r r r r r< r= r> r? r@ rA rB r rC r rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r( r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r9 r> r r r r r r r r r r r; r r r r r r r< r r r? r@ rA rB r rC r rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r( r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r ( r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj ry ry rj rj rj rj rj rj rj rj rf rj rj rj r� ry ry rj rj r� rj r� rj ry r� rj rj rj r� rj r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj r� rj rj r� rj ry rj rj r� rj ry rj rj rj r� r� rj r� rj r� rj rj ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� ry rj ry ry rj rj rj rj rj rj rj rj r� rj rj rj rj r� ry rj rj r� rj rj rj rj ry rj rj rj r� ry r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rj rj ry rj rj rj rj rj rj rj rj rj rj rj rj r� ry rf rj rj rj rj ry rj rj ry rj rj ry r� r� r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj r� rj rj rj rj rj rj r� rj rj r� rj rj rj rj rj rj rj rj rj rj r� rj ry rj rj r� ry r� rf r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry rj r� r� r� r� rj rj r� rj rf rj rj rj r� rj rj r� rj rj rj rj r� r� r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj r� rj r� rj rj rj rj rj r� rj ry ry ry rj r� ry rj rj rj rj rj ry rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj rj ry ry ry rj rj rj rj r� rj rf rj rj rj rj ry rj rj rj rj rj rj rj ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry r� rj r� r� r� rj rj ry rj rj rj rj rj r� r� rj ry rj r� ry rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj rj r� r� rj rj r� ry rj r� rj r� rj rj rj r� r� rj r� rj r� ry ry rj rj r� r� r� r� rf r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry r� rj ry rj rj rj rj r� rj rj rj rj rj r� rj rj ry rj ry rj rj ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj ry rj ry rj rj rj rj rj rj r� ry rj ry rj ry ry ry rj ry rj rj ry rj r� ry ry ry rj r� ry r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� r� rj rj rj ry rj rj r� r� rj r� rj r� r� r� rj ry r� rj r� rj r� r� ry r� ry r� r� r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj r� rj rj rj rj rj rj r� rj rj r� rj r� r� r� rj rj r� rj rj rj r� r� rf ry rj r� rj r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj ry r� r� rj ry ry rj rj r� rj rj rj rj rj ry rf rj r� rj ry rj rj ry rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj r� ry rj rj rj rj rj rj r� r� rj r� rj r� r� r� rj rj r� rj ry rj r� r� rj rj rj r� rj r� r� r� ry r� r� r� r� r� rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj r� rj rj rj rj rj rj r� r� rj r� rj r� r� r� rj ry r� rj ry rj r� r� rj ry rj r� ry r� r� r� r� r� r� r� r� r� rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rf ry ry rj rj rj rj rj rj r� ry rj r� rj r� r� r� rj rj r� rj r� ry r� r� ry rj rf r� ry r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj rj r� rj r� rj rj ry rj r� rj rj rj rj rj rj r� rj rj rj r� ry rj r� r� rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj r� r� rj r� r� r� rj rj r� rj r� ry rj rj r� r� rj r� rj r� rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� r� rj rj rj rj rj rj r� r� rj r� ry r� r� r� rj rj r� rj r� rj r� r� ry r� ry r� r� r� r� r� rf r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj rj r� rj r� ry r� rj ry r� rj ry rj ry rj r� r� rj ry rj ry rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� ry rj rj rj rj rj r� r� r� rj r� ry rf r� r� rj ry ry ry r� rj r� r� ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj ry r� rj r� rj r� rj rj r� ry rf ry rj rj r� r� rj r� rj r� rj rj r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rj rj rj r� rj rj rj rj rj rj r� ry rj r� rj r� r� r� ry rf r� ry ry rj r� r� ry ry ry r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� ry rj rj rj ry rj r� r� rf rj r� ry r� r� r� r� rj r� rf r� ry r� r� rf rf rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj rj rf r� rj r� r� r� rj ry r� rj ry rj rj rj r� r� rj r� rj ry ry ry rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� rj rj rj r� r� rj r� r� r� r� ry r� ry rj rj ry ry ry ry rj r� ry r� ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj rj rj rj ry r� r� r� r� r� r� ry rj r� ry r� ry rj ry r� r� rj r� rj r� rj rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj ry rj rj ry ry rj r� ry r� rj r� r� r� ry r� r� r� r� rf ry r� ry r� ry r� r� ry r� ry r� ry ry r� r� rf r� ry ry ry r� ry ry ry r� ry ry ry r� r� ry r� r� rf r� r� r� r� r� ry r� rj rj ry r� r� r� r� r� r� rf rj r� ry r� ry ry ry r� r� ry r� rj r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� ry rj ry r� ry ry r� ry r� ry ry r� ry r� ry ry ry r� r� r� r� r� r� ry rj r� r� r� ry r� rf ry r� r� r� r� ry ry r� r� r� ry rf r� ry ry r� r� r� r� r� r� rf r� ry r� r� r� r� r� r� r� r� ry rf r� ry rj ry ry rj ry rj ry r� r� rj rj rj r� r� rj ry r� r� r� rf rf r� ry r� ry ry r� ry r� ry r� ry ry r� r� ry r� ry ry ry r� ry ry ry ry r� r� ry r� r� r� ry r� rf r� r� r� r� r� rj r� rj rj ry ry r� rj r� r� r� ry ry r� ry ry ry rf ry r� r� rf ry ry r� r� rj r� r� r� ry r� rf ry r� r� r� rf ry r� r� r� r� r� r� r� ry ry r� rf r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rj rj ry ry r� r� r� ry r� ry rj rj r� ry r� r� r� r� r� r� ry ry ry r� ry ry r� ry r� ry r� ry ry r� r� ry ry ry ry rf r� r� ry ry r� ry r� r� ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� ry r� rj ry rj r� r� r� rj r� r� ry ry r� ry r� ry ry ry r� r� ry r� r� r� r� r� r� r� r� ry r� r� ry ry r� r� ry ry ry r� r� r� r� r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� rj ry r� ry ry ry ry ry r� r� r� ry r� r� r� r� ry r� rf r� r� ry r� rf r� r� r� r� ry ry ry r� ry ry r� rf ry r� ry ry ry r� ry ry ry ry rf ry ry r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� ry r� ry r� ry ry r� r� r� r� rf ry rf r� r� ry ry r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj ry rj r� r� ry r� r� r� ry ry r� ry r� r� r� rf r� r� ry r� ry r� ry ry r� r� r� r� r� r� ry r� r� r� r� ry ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� ry ry rj ry ry r� r� r� r� r� r� rf rj r� ry r� ry ry r� r� r� rf r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� ry r� rj ry r� ry r� r� r� r� r� r� ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� ry r� r� r� r� rf rf r� r� ry rf ry r� ry ry r� rf r� r� rf r� r� r� ry r� r� r� r� r� r� r� rj r� ry ry ry r� r� ry r� r� r� ry r� r� r� ry rj r� ry r� r� r� r� r� r� ry ry r� r� r� ry r� rf ry r� r� r� rf ry ry rf r� r� r� ry r� r� ry r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rj r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rf ry r� ry ry r� ry r� r� ry r� r� r� r� rf ry rf r� ry rf r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� rj rf ry ry r� ry r� r� r� r� ry r� r� r� ry r� r� rj r� r� r� r� ry ry ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry rf r� ry r� rf ry r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� rf r� r� r� r� r� r� ry r� ry ry r� r� ry ry ry ry ry r� rf ry r� r� r� ry ry r� rf r� ry r� r� ry ry r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� rj r� r� ry r� r� r� r� r� r� r� r� ry r� ry r� r� r� r� ry r� rf ry r� r� r� r� ry ry rf r� rf r� rf r� ry ry ry rf r� r� r� r� r� r� rf r� r� r� r� r� r� r� ry r� rf ry r� r� r� r� r� r� r� r� r� r� ry r� r� ry ry r� r� r� r� rf r� r� r� r� r� r� ry r� ry ry r� r� r� r� ry ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� ry r� r� ry r� r� r� r� ry ry ry ry r� r� r� rj r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� ry r� r� r� r� r� r� rf r� r� ry r� r� r� r� rf ry r� r� r� r� r� r� ry ry rf rf r� r� r� r� r� r� rf r� r� r� r� r� r� r� ry r� ry ry ry r� r� ry r� r� r� r� r� r� r� ry ry ry r� r� r� ry r� r� r� r� r� r� r� r� ry r� r� rf r� r� r� r� ry rf r� r� r� r� r� r� rf r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� rj r� ry r� r� r� r� r� r� r� r� ry r� r� r� r� r� ry r� r� r� r� r� r� r� ry r� r� r� r� ry r� r� ry r� r� r� r� ry ry r� r� r� r� rf r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� ry ry rf r� r� r� r� r� r� ry r� r� ry r� ry ry ry r� r� r� r� r� r� ry r� r� r� r� ry r� r� ry r� r� ry r� ry ry r� r� r� r� ry r� ry r� r� r� r� r� ry r� r� r� ry r� r� r� r� r� r� r� r� rj r� r� r� ry ry r� ry ry r� r� r� r� r� ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� ry r� r� r� r� r� r� ry ry ry ry ry r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� rf rf r� r� r� rf r� r� r� r� r� r� r� ry rf r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry ry r� r� r� r� r� ry r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� ry r� r� r� ry r� r� r� r� r� rf r� r� r� r� ry ry r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� rf r� ry r� r� r� r� ry r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� rf rf r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� r� r� r� r� r� r� r� r� r� rf r� r� r� r� rf r� r� ry r� ry r� r� r� r� r� r� r� r� r� r� r� ry rf r� r� r� r� r� r� ry r� r� r� rf ry r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )ZLatin7_char_to_order_mapZwin1253_char_to_order_mapZGreekLangModelZLatin7GreekModelZWin1253GreekModel� r� r� �$/usr/lib/python3.6/langgreekmodel.py�<module># sV
pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.opt-1.pyc 0000644 00000006456 14751155147 0021067 0 ustar 00 3
���e� � @ s0 d dl Z d dlZddlmZ G dd� de�ZdS )� N� )� ProbingStatec @ sn e Zd ZdZddd�Zdd� Zedd� �Zd d
� Zed d � �Z d
d� Z
e dd� �Z e dd� �Z
e dd� �ZdS )�
CharSetProbergffffff�?Nc C s d | _ || _tjt�| _d S )N)�_state� lang_filter�loggingZ getLogger�__name__Zlogger)�selfr � r
�#/usr/lib/python3.6/charsetprober.py�__init__' s zCharSetProber.__init__c C s t j| _d S )N)r Z DETECTINGr )r r
r
r �reset, s zCharSetProber.resetc C s d S )Nr
)r r
r
r � charset_name/ s zCharSetProber.charset_namec C s d S )Nr
)r �bufr
r
r �feed3 s zCharSetProber.feedc C s | j S )N)r )r r
r
r �state6 s zCharSetProber.statec C s dS )Ng r
)r r
r
r �get_confidence: s z CharSetProber.get_confidencec C s t jdd| �} | S )Ns ([ -])+� )�re�sub)r r
r
r �filter_high_byte_only= s z#CharSetProber.filter_high_byte_onlyc C sb t � }tjd| �}xJ|D ]B}|j|dd� � |dd� }|j� rP|dk rPd}|j|� qW |S )u9
We define three types of bytes:
alphabet: english alphabets [a-zA-Z]
international: international characters [-ÿ]
marker: everything else [^a-zA-Z-ÿ]
The input buffer can be thought to contain a series of words delimited
by markers. This function works to filter all words that contain at
least one international character. All contiguous sequences of markers
are replaced by a single space ascii character.
This filter applies to all scripts which do not use English characters.
s% [a-zA-Z]*[�-�]+[a-zA-Z]*[^a-zA-Z�-�]?Nr � �r ���r )� bytearrayr �findall�extend�isalpha)r �filteredZwordsZwordZ last_charr
r
r �filter_international_wordsB s
z(CharSetProber.filter_international_wordsc C s� t � }d}d}x�tt| ��D ]r}| ||d � }|dkr>d}n |dkrJd}|dk r |j� r ||kr�| r�|j| ||� � |jd� |d }q W |s�|j| |d � � |S )
a�
Returns a copy of ``buf`` that retains only the sequences of English
alphabet and high byte characters that are not between <> characters.
Also retains English alphabet and high byte characters immediately
before occurrences of >.
This filter can be applied to all scripts which contain both English
characters and extended ASCII characters, but is currently only used by
``Latin1Prober``.
Fr r � >� <Tr r N)r �range�lenr r )r r Zin_tag�prevZcurrZbuf_charr
r
r �filter_with_english_lettersg s"
z)CharSetProber.filter_with_english_letters)N)r �
__module__� __qualname__ZSHORTCUT_THRESHOLDr r
�propertyr r r r � staticmethodr r r$ r
r
r
r r # s
%r )r r Zenumsr �objectr r
r
r
r �<module> s pip/_vendor/chardet/__pycache__/escprober.cpython-36.pyc 0000644 00000004742 14751155147 0017245 0 ustar 00 3
���en � @ sX d dl mZ d dlmZ d dlmZmZmZ d dlm Z m
Z
m Z m Z G dd� de�Z
dS )� )�
CharSetProber)�CodingStateMachine)�LanguageFilter� ProbingState� MachineState)� HZ_SM_MODEL�ISO2022CN_SM_MODEL�ISO2022JP_SM_MODEL�ISO2022KR_SM_MODELc sV e Zd ZdZd� fdd� Z� fdd�Zedd� �Zed d
� �Zd d � Z d
d� Z
� Z S )�EscCharSetProberz�
This CharSetProber uses a "code scheme" approach for detecting encodings,
whereby easily recognizable escape or shift sequences are relied on to
identify these encodings.
Nc s� t t| �j|d� g | _| jtj@ rD| jjtt �� | jjtt
�� | jtj @ r`| jjtt �� | jtj
@ r|| jjtt�� d | _d | _d | _d | _| j� d S )N)� lang_filter)�superr �__init__� coding_smr r ZCHINESE_SIMPLIFIED�appendr r r ZJAPANESEr ZKOREANr
�active_sm_count�_detected_charset�_detected_language�_state�reset)�selfr )� __class__� � /usr/lib/python3.6/escprober.pyr * s zEscCharSetProber.__init__c sN t t| �j� x"| jD ]}|s qd|_|j� qW t| j�| _d | _d | _d S )NT) r
r r r �active�lenr r r )r r )r r r r : s zEscCharSetProber.resetc C s | j S )N)r )r r r r � charset_nameE s z EscCharSetProber.charset_namec C s | j S )N)r )r r r r �languageI s zEscCharSetProber.languagec C s | j r
dS dS d S )Ng�G�z��?g )r )r r r r �get_confidenceM s z EscCharSetProber.get_confidencec C s� x�|D ]�}x�| j D ]�}| s|j r&q|j|�}|tjkrhd|_| jd8 _| jdkr�tj| _| j S q|tj
krtj | _|j � | _
|j| _| j S qW qW | j S )NFr � )r r Z
next_stater ZERRORr r ZNOT_MEr �stateZITS_MEZFOUND_ITZget_coding_state_machiner r r )r Zbyte_str�cr Z coding_stater r r �feedS s"
zEscCharSetProber.feed)N) �__name__�
__module__� __qualname__�__doc__r r �propertyr r r r" �
__classcell__r r )r r r # s r N)Z
charsetproberr Zcodingstatemachiner Zenumsr r r Zescsmr r r r
r r r r r �<module> s pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.pyc 0000644 00000002041 14751155147 0017361 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�GB2312DistributionAnalysis)�GB2312_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� GB2312Proberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �"/usr/lib/python3.6/gb2312prober.pyr " s
zGB2312Prober.__init__c C s dS )NZGB2312r )r
r r r
� charset_name( s zGB2312Prober.charset_namec C s dS )NZChineser )r
r r r
�language, s zGB2312Prober.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r ! s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/big5prober.cpython-36.opt-1.pyc 0000644 00000002021 14751155147 0020244 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�Big5DistributionAnalysis)�
BIG5_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )�
Big5Proberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� � /usr/lib/python3.6/big5prober.pyr # s
zBig5Prober.__init__c C s dS )NZBig5r )r
r r r
� charset_name) s zBig5Prober.charset_namec C s dS )NZChineser )r
r r r
�language- s zBig5Prober.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r " s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.pyc 0000644 00000004151 14751155147 0020435 0 ustar 00 3
���eU
� @ s0 d dl mZ d dlmZmZ G dd� de�ZdS )� )�
CharSetProber)� ProbingState� MachineStatec sV e Zd ZdZd� fdd� Z� fdd�Zedd� �Zed d
� �Zd d � Z d
d� Z
� Z S )�MultiByteCharSetProberz
MultiByteCharSetProber
Nc s, t t| �j|d� d | _d | _ddg| _d S )N)� lang_filter� )�superr �__init__�distribution_analyzer� coding_sm�
_last_char)�selfr )� __class__� �%/usr/lib/python3.6/mbcharsetprober.pyr ' s z MultiByteCharSetProber.__init__c s< t t| �j� | jr | jj� | jr.| jj� ddg| _d S )Nr )r r �resetr r
r )r
)r r r r - s
z MultiByteCharSetProber.resetc C s t �d S )N)�NotImplementedError)r
r r r � charset_name5 s z#MultiByteCharSetProber.charset_namec C s t �d S )N)r )r
r r r �language9 s z MultiByteCharSetProber.languagec C s x�t t|��D ]�}| jj|| �}|tjkrN| jjd| j| j |� t
j | _ P q|tj
krdt
j| _ P q|tjkr| jj� }|dkr�|d | jd< | jj| j|� q| jj||d |d � |� qW |d | jd< | jt
jkr�| jj� r�| j� | jkr�t
j| _ | jS )Nz!%s %s prober hit error at byte %sr r ���)�range�lenr Z
next_stater ZERRORZlogger�debugr r r ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenr r
�feed�stateZ DETECTINGZgot_enough_data�get_confidenceZSHORTCUT_THRESHOLD)r
Zbyte_str�iZ coding_stateZchar_lenr r r r = s.
zMultiByteCharSetProber.feedc C s
| j j� S )N)r
r )r
r r r r Z s z%MultiByteCharSetProber.get_confidence)N) �__name__�
__module__� __qualname__�__doc__r r �propertyr r r r �
__classcell__r r )r r r " s r N)Z
charsetproberr Zenumsr r r r r r r �<module> s pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.pyc 0000644 00000004470 14751155147 0017441 0 ustar 00 3
���e� � @ s` d dl mZ d dlmZ d dlmZ d dlmZ d dlm Z d dl
m Z m Z G dd� de�Z
d S )
� )�MultiByteCharSetProber)�CodingStateMachine)�SJISDistributionAnalysis)�SJISContextAnalysis)�
SJIS_SM_MODEL)� ProbingState� MachineStatec sP e Zd Z� fdd�Z� fdd�Zedd� �Zedd� �Zd d
� Zd d � Z � Z
S )
�
SJISProberc s4 t t| �j� tt�| _t� | _t� | _ | j
� d S )N) �superr �__init__r r � coding_smr �distribution_analyzerr �context_analyzer�reset)�self)� __class__� � /usr/lib/python3.6/sjisprober.pyr % s
zSJISProber.__init__c s t t| �j� | jj� d S )N)r
r r r )r )r r r r , s zSJISProber.resetc C s | j jS )N)r � charset_name)r r r r r 0 s zSJISProber.charset_namec C s dS )NZJapaneser )r r r r �language4 s zSJISProber.languagec C sL �xt t|��D ]�}| jj|| �}|tjkrP| jjd| j| j |� t
j | _ P q|tj
krft
j| _ P q|tjkr| jj� }|dkr�|d | jd< | jj| jd| d � |� | jj| j|� q| jj||d | |d | � |� | jj||d |d � |� qW |d | jd< | jt
jk�rF| jj� �rF| j� | jk�rFt
j| _ | jS )Nz!%s %s prober hit error at byte %s� r � � ���)�range�lenr Z
next_stater ZERRORZlogger�debugr r r ZNOT_MEZ_stateZITS_MEZFOUND_ITZSTARTZget_current_charlenZ
_last_charr �feedr
�stateZ DETECTINGZgot_enough_data�get_confidenceZSHORTCUT_THRESHOLD)r Zbyte_str�iZ coding_stateZchar_lenr r r r 8 s6
zSJISProber.feedc C s | j j� }| jj� }t||�S )N)r r r
�max)r Z context_confZ distrib_confr r r r Y s
zSJISProber.get_confidence) �__name__�
__module__� __qualname__r r �propertyr r r r �
__classcell__r r )r r r $ s !r N)Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zjpcntxr Zmbcssmr Zenumsr r r r r r r �<module> s pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.pyc 0000644 00000005532 14751155147 0020447 0 ustar 00 3
���e � @ s4 d dl mZ d dlmZmZmZ G dd� de�ZdS )� )�
CharSetProber)�CharacterCategory� ProbingState�SequenceLikelihoodc sb e Zd ZdZdZdZdZd� fdd� Z� fd d
�Ze d d � �Z
e d
d� �Z dd� Z dd� Z
� ZS )�SingleByteCharSetProber�@ i gffffff�?g�������?FNc sJ t t| �j� || _|| _|| _d | _d | _d | _d | _ d | _
| j � d S )N) �superr �__init__�_model� _reversed� _name_prober� _last_order�
_seq_counters� _total_seqs� _total_char�
_freq_char�reset)�self�model�reversedZ name_prober)� __class__� �%/usr/lib/python3.6/sbcharsetprober.pyr ' s z SingleByteCharSetProber.__init__c s: t t| �j� d| _dgtj� | _d| _d| _d| _ d S )N� � )
r r r r
r Zget_num_categoriesr r r r )r )r r r r 5 s z SingleByteCharSetProber.resetc C s | j r| j jS | jd S d S )N� charset_name)r r r
)r r r r r ? s z$SingleByteCharSetProber.charset_namec C s | j r| j jS | jjd�S d S )N�language)r r r
�get)r r r r r F s z SingleByteCharSetProber.languagec C sn | j d s| j|�}|s | jS | j d }x�t|�D ]�\}}|| }|tjk rZ| jd7 _|| jk r�| jd7 _| j | jk r�| j
d7 _
| j s�| j | j | }| j d | }n || j | j }| j d | }| j | d7 < || _ q2W | j d }| jt
jk�rh| j
| jk�rh| j� }|| jk�r@| jjd||� t
j| _n(|| jk �rh| jjd||| j� t
j| _| jS )NZkeep_english_letter�char_to_order_mapr Zprecedence_matrixr z$%s confidence = %s, we have a winnerz9%s confidence = %s, below negative shortcut threshhold %s)r
Zfilter_international_words�state� enumerater ZCONTROLr � SAMPLE_SIZEr r
r r r r Z DETECTING�SB_ENOUGH_REL_THRESHOLD�get_confidence�POSITIVE_SHORTCUT_THRESHOLDZlogger�debugZFOUND_ITZ_state�NEGATIVE_SHORTCUT_THRESHOLDZNOT_ME) r Zbyte_strr �i�c�orderr r Z
confidencer r r �feedM sF
z SingleByteCharSetProber.feedc C sN d}| j dkrJd| jtj | j | jd }|| j | j }|dkrJd}|S )Ng{�G�z�?r g �?Ztypical_positive_ratiog�G�z��?)r r r ZPOSITIVEr
r r )r �rr r r r# | s
z&SingleByteCharSetProber.get_confidence)FN)�__name__�
__module__� __qualname__r! r" r$ r& r r �propertyr r r* r# �
__classcell__r r )r r r ! s
/r N)Z
charsetproberr Zenumsr r r r r r r r �<module> s pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.pyc 0000644 00000126637 14751155147 0016734 0 ustar 00 3
���e�d � @ s d Z dZ�dZ�dS ( g @i �( � � � � � �' �O � �} �� �� � � �] �
�
� ��
� � � �� � � � �� � � �� �X �} �� �� �k � �g
�
� �k � �� �� � � � � � � �% �& �0 �1 �, �- � � � � �� � � �� �� �< � � �p �� �� �� �� �� �� �g �� � �� �W �X �� �� �h
�" �� � � �� �
� � �\ �� � �
�/
� �� �� �� � �� �0
� �
�h � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 � �V �j �4 � � � �B � � �8 �9 �: �; �< �= �> �v � �� � �S � �e � �f � � �d �+ �� � �a �w �� � � �I �� �~ �� �
� �? �@ �A �B �C �D �
� �- � � �i �� �
� �E �^ �. �� �3 � �i
�F �/ �Y � �� � �� �j ��
� �G �H �I �J �q � �1
� �Y � �k �/ � �2 � � �# � � �� �* � � � � � � �[ � �\ �5 � �! �! � �% �@ �l � �' �A � � � �4 �
� �� � � � �< � � � �- � � �7 �S � �� �~ �K �= � �E � �; � � �7 �7 �8 �m �& � � �
� �O �K �= �~ �d � � �L �M �N �O �P �Q �R �S �T �U �V �Y �> �J �" �p �p � �� � � �T �_ � � �. �X � � �L �j �e � �9 �P � �l �y �� � � �D �� � � �) �h �� �F �? � �+ � � �g �c � �� �B �] �N �� � �8 �j �: �5 � � �7 � � �R �4 �G �d � �� � �n � �h �t �6 �3 �$ �W �C � � �:
�x �� � �* �V � �W �X �Y �Z �[ �\ �] �^ �_ �` � �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �
�u �v �w �x �y �z �{ �| � �� � �� �l �} � �~ � � � � �
� � �� �
�� �� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � �k � ��
�> ��
��
� � �
�j
�� � � �Z �[ �\ �] � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< �= �> �? �@ �A �B �C �D �E �F �G �H �I �J �K �L �M �N �O �P �Q �R �S �T �U �V �W �X �Y �Z �[ �\ �] �^ �_ �` �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �u �v �w �x �y �z �{ �| �} �~ � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< �= �> �? �@ �A �B �C �D �E �F �G �H �I �J �K �L �M �N �O �P �Q �R �S �T �U �V �W �X �Y �Z �[ �\ �] �^ �_ �` �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �u �v �w �x �y �z �{ �| �} �~ � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< �= �> �? �@ �A �B �C �D �E �F �G �H �I �J �K �L �M �N �O �P �Q �R �S �T �U �V �W �X �Y �Z �[ �\ �] �^ �_ �` �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �u �v �w �x �y �z �{ �| �} �~ � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � �
�� �� �� � � � �2
�� �� �{ �T �� �a
�
�^ �� �� �| � �= � �m �k
� �� � � �V �y � � �
�q � �� � �
� � � � �� �! � � �� � �� � � �C �O �3 � �� �� � � �r � � �n �� �+ � �� � �
�p �q �� �;
�A �� � �� �C �0 � �n �
� �� �T �C �o �
� �
�# � � �~ � �P �� � �� � �� �� � �� � �$ �z �� �� �& �� � �� �� � �� � � �� �_ � � �U �� �
�s �� � �� �I � � �� � � � �� �3
�� � �$ �W �1 �5 �P �� � � �� �� � �� �X � � � �l
�� � �H � � � � �� � � �
�
�W �� �~ �p � �$ � � � �@ �L �� �� � � �� �u � � �J �I �W �� � �_ �� � �< � �� � �] �D �� �� � � �h �� � � � � �� �f �- � �} �t � �� � �� �� � �, �� �
�b � �� �X � � �F � �{ �` �� � �+ �3 �q � �m � �4
�� � � � � �B �l �X �
� �%
� � �% �2 �u � � �� � �J � �| �r � �@ � �� � � �� �� �
� �� �L
� � � � � � �b
�J � �c � �� �� � � �� � �4 �R � �m
�T �� �� � � �� �� �� � �e �� � �? �
�� � � � �- � � �* �E � �� �+ � �� �& � �� � �/ �� �� �. �s �[ �� �+ � �
� �
�B �c
� �� �� � � � �) � �, �� �u � � � �9 �&
� � �� � � �v �� �Y �� �3 � �
�� � � �D � � � � �d � � �| �( �y � �� � � �< �8 �� �i � � � �d
�5
�B � �n � �� � �� �� �| �� �! �� �) �@ �n
�m � � �0 �a �� � �� �z �' �� � �� �W �� �[ �v �� �� � �� � � �o
� �� � �
� � �'
� � �" � � �9 � � � �� �J � � �h �� � �e
� � �\ �� � � �p
�@ � �Q �9 �� � �� � � � � �w �i �E � �J �I �� �� � � �� � �f � � � �
�� �1 �� �� �
�� � �' �r �
� �� �� �
� � �c �� �q � �x �� � �
�2 �� � � �� � �* � � �b �F � �v �� �d �
� �� �! �R � �� �Q � � � �P �� � � � � � �� �( �� � �_ � �` � � �f
� �6
�� �A � �� �a �� �� �u �T � �2 �� � � � � � �^ �C �� ��
� �[ �� ��
�v �% � �� �� �n �! �F � �Z �^ �� � �� �d � �� �� �x � � �] �� �B � �c ��
�� � � �P �q � � �H �Y � �� �(
�� �
�� �g �} �K � �� � �4 �� �W � � �� �C �g
�- �d �� �k � �4 �} � �q
�~ �+ � �� � �h �@ � � �@ �A �D �: � � �e ��
�� �q �w �� � � �� � �� � �d �� �Z � �* �M
�[ �� � �s �Z �
� �� �> � �' �- �� ��
� � �� �) � �� � �� �t �F �7
�� �t �# �� � � �� � �Y � � �f �k �b �1 � ��
� �6 �o �c � �q �� � � �� ��
�u � �: �� �� �N
�� �U �= �� �v �� �l �N �� �� � �] � �; �� �� ��
�� � �l �L � �} � �� � �� �B � �8
�Q �� �# �` �T �� � �x � �r �� � � � �� �� �� �� �3 �n � �� � �� � � �{ � � �@ �� �� � �� �9
� � � �5 �h
�d �Z �� � �i � � � � � �s �- �r
�� � � �� �[ �� �0 � � � �� �. �S � �R �O
�� � � �� �; � �4 �y �
�; � �z � �p � � � �� � �:
�( �| �
� �" �� �� �� � � � �O � �e � � � �
�C �t �)
� �6 �K � �� �8 � �P
� �h � �� �� � �� �3 �$ �� �� �*
�= �b �e � ��
�4 � �� �� �. �7 � �\ � � � �j � � � � � � �� � �/ � � �� � �= �� �^ �� �5 � �� � �\ �� � � �� �9 �# �+ �
�s
�, � �7 � � �Y �� � ��
�M �� �+
�i
�Q � � �6 �� �� �� � � �y � � �s �# �{ ��
�U �f �< �� � �v �� � �) ��
� � � � �� �m �< � � � �� �� �g � � �l �� � �D �b �u ��
� �D �B � � ��
�[ � � �8 �� � �> � � � � � �� �� � �] �� �D �� �� �� �6 �Z �� � �5 �� �
��
�< �m ��
�, � � �u �^ � � �� �g �� � �I � � �g �� � �\ �: �
�M �t � �� �E � �o �� �� � �� �E �R �� � � �E �j
�� �g �W � � �K � �C � �= �� �] �$ �! � � � �� � �` �K �v � � �0 �i � �^ �� � �3 �� �" � � �� �� � �a �k
� �;
�w � � � �� � � �
�y � � �� �� �P � � � �w � � �� �t
�� � �� � �� �� �J �a � � �] �� �� �� � � � � � �L �h � �� �� ��
�u
�j � � �# �C �� � � �a �� �! �s �| � � �Y � �
� � � �h �O �5 � � �z �i �
�S �� �L �� �. � �& � � �<
�7 �� �s �A � � �M ��
� �s �� �* �,
�% �
�� � �k �� �& �f �� �O �j �" � �( �- � �[ � �� �� � �- �= � �} � � �M �S � �� �� � � � � � �� �� �
�
� �
� �~ � �J �t �k �v �e �y � �� � �<
�� �f � �M �k ��
� � �o �� �� �� �w �v
�l �� �] � � �. ��
�� �� � �/ �f �q �$ �g � �G � � �n � �> �6 �=
� � � �� � �N �� �x � �e �* � �h � �� �� �$ � �� � �o �b �, � � � � �t �� � � �� � ��
�V � ��
�i � � � �� �w
� � �p �H �� �V � �i �< �Z � �8 �r �w � �& �� �� � �/ �� � � �� �> � �>
�E �x �� �& �e �� �w � �� � �5 �� �� �
� �\ � � � �S �i � � � �� �2 � �� � � �+ �' �� �% � �� �x
�O � �
�Q
� �� � � � �� �_ �H �� � � � �g � �� �y
� �
�0 �& �+ � � � � � �l
�' � �' �z � � � � �_ �� �� � �� � � �?
��
�� �� � �z
�� �m
�| �
� � �g �0 � �� � � �* � � �
�` �w � � �
�# �� �c �) �� �� �R
�� �� �� �T � �� �r � �V � �� � �_ � � � � �r � �� �
�` �x � � �
� � �f � � �n
�=
�* �A � �� �( �� �x � �S
� �{ �T
� �9 � � �M � �r �� � �; � �( � �% � �[ �a �b � � �D � � � �-
�\ � � � � �o
�E �m �) �� �! � � �c � �, �1 � �] � � � �> �I � � �� �T � �� �� � � � �y � �k �z �x �� �N � �� � � � �5 � �� �" �� �H �< �d � �
� � �h �� � �
�p
� � �: �L �1 �� � ��
� � �>
�� �q
�? �Z �M �I � � �B �K �D � �# �
�
�Y �> � �� � � �` � � � � � � �� � � � � � � � �� �c � � � � �� �� �T � �a � �2 �y �/ �� �" �U
�� �� �b � � � �/ � �� �� � �
�{ �
� �j � � � �5 �* �� � �� � �a �x �� � � � �F �� �� � �7 � �� � �? � �w �� � � �� �� �+ � �8 �� ��
�N ��
� �� �, �� �n � �
� � �o �s �_ �? �� � � � � �� � �� �? �0 �� � � �y �3 �f � �= � � �l � � � �v �] � � � �� �� �z ��
� �y �j � �u � �� �p �� �j � � �
�i �z � �� �r
� � �� �� �� � � � �F � �' �� �{
�n � �x �u �$ � � � �M � � �� �k � �p ��
�^ �q �
�` �| � � � �
�|
� ��
� � � �
� � �� � �G � � �- �� �Z �1 �Y �� �- � �e �� � �[ �C � � � �e � �. �- � � �� � � � �
�
�7 �b �l � � �� �� �{ �� �. � � �� �z � ��
�
� �?
�� � �9 � �
�� � � �} � �
�a � � �
�Q � �d �; �V
�� �/ �^ �D �� �? �m ��
��
�9 �I �
�� �� �
� �� ��
�{ �} � � � � � � �& �� �~ �� �X � � �}
��
�� �9 � �� �: � �" �\ � �� �
�_ �� �8 �W �~
�^ �% �P �s � �w � � � �8 � �L �� � �.
�� � ��
�� � �N �� �� �P � �S � �� �� �: �R �' �0 �b � � �
� �� � �� �z � � � � � � �K �� �� �� �
�r � �q �
�� �� �n �L � � � � � � � � �� �X �@
�� �g �i � � �4 � �: � � � �r � � �Q ��
� � �; �' � �> �� �b �m �� �w �� � � �s
�� � � �A
� �t
�9 � � � � � �o �^ � � �2 � �c �� � �� � � �r � � � �! � �t � �1 �{ �� �� � � � � �s � � � � � �� �x � �v �a �p � �� �
�� �L �O � � �U � �. � �� �) �. � �E � �" � �y � � � � �� � �( �
� � �q �E �6 �
��
�2 �u �6 � � � �� �. � �i � �� �V � � �s ��
� � �G �G �j �t � �W � � � � �` � � � �u �� � �
�� �{ �Q � � �O �C � � �
�� �J � � � �$ �� � �� �/ �� � �_ � �� � �j �R � �7 � � �/
� �3 �D �u
�6 �X �4 � �� � � � � �> � � � �0
�` �` �
�� � �� �U �� � �
�r � � �) �� �5 �� �H �� �
� � �~ �r � �
� �� � � � � � �] �� � � � � �� � �@
� �� �
�a �� �v � � � �/ �! �6 �� �� � �7 �w � � �3 �c �8 �x � � � �B
�� �� �M � � �F � �g � � � �( � �
�: � �� �H � ��
�f �� � �" ��
�~ � �� �� �
�y � � � �� � �! �N ��
�4 �A
�� �d �e �� � �z � � �� �� �� �� � �0 �� � � � � � � �� �{ �� �� � �
� �f �( �l �� �G � � �� �^ �B
�m �F �| � �U �� � �2 �R �� �� �# �� �
� �� �F �� � �U � � � �1 �� �c �k � �N �S � � �� ��
�� � �$ �O � � �Y � � � �
�� �G � � � �W
� �C
�? � � � �~ �� � �U �F �� � � � �� �� � �
�C
� � �� � �e �
�� � � � �/ �Q �_ �v
�; � � �P �) �� �G �m � � � �G �, �I �z �_ � �� � �9 �n � �
�A � �
�X
�� �# �V �) �< �% � �} � � �H �w
�5 � �p �. � �� � �m � � �� �
�# �h �| �b � � � �@ �( �^ �z �� � �A ��
� � �" � �g � �| �� �� � � �� �6 � �X � � �, �� �� � � �� �$ �# �I �k � � � � �: � � �Q � �o �h �V �$ �
�� �t � � � �Y
�, �� � �
� �D
� �� �~ ��
�
� � �% � � � � � � � �� ��
� �7 �/ �
� �� �� � �E �V �� ��
�E
�u � �& �� � � � �� �� �o � � �Z � �i � � � � � � � �! �� �n �8 �� �' � � � � �� � �� � � �G � �R �2 �� � �: � �, �� � �Z
�l � �( �X �P �? � � � �o � � � � �� � �W �* � �� �; �8 � �& �) � �� �
�o �� � � � �H �_ � � �0 �� �x
� �0 � �; � �
� � �X � � �� �� �1 � �Z �* �% �� � � �| �d �` � � �S �j �} �\ � �� � �G � � � �f �q �% �B � �1
�p � �" � � �� � � �| � �� � �� �� �l �2
� �
��
� � �@ �h � �; � � � � � � � � �& � � �� �} � �% � � � � �? � � �� �a �y
� �
�� � � � �= �1 � �< � �{ �# � �� �� � ��
�A � �
� �t � � � � �> �
�K �3
� � �= �� � �\ �� �� �' �A �+ �g �� �b �K � �� � �� �
�� �
�� �4
� �* � �m � � �
�o �N � �0 �( �i � �$ �4 � �{ � � � �Q �� � �U �� � � �, �` � �� � � ��
�j �) � �� �- �6 �� � �F
�2 �) � �
�* � �Y N( r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r )Z JIS_TYPICAL_DISTRIBUTION_RATIOZJIS_TABLE_SIZEZJIS_CHAR_TO_FREQ_ORDER� r r � /usr/lib/python3.6/jisfreq.py�<module>, s$ pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.opt-1.pyc 0000644 00000112637 14751155147 0020001 0 ustar 00 3
���e�P � � @ s d Z dZ�d�Z�d�S (� g�������?i� � �� � �< �T �� � �Q � �
�
�� �� �< �w � �9 �� � �� � �� �Z � �� �q � � �
�W
�y � � �e �o �� �v
� � � �� �� � � �L �B � �Q
� � �� �Q � �� �E � �f � � � � �� �� � �d �( �y � � �, � �� �
�E �e � �
�W �R �� � �| �R
� �
�� �
�X
��
�j �E � � �+ �P � � � � �� � �; �� �m �� �l �� �� � � � � �e �H � � �� � �^ �k �6 �� �" �F �� �
��
�
�^ �� �
� �� �� �? �` �u �$ �1 ��
�� �� � �U �� �1 �� � �g �l �� � � � �G �� �2 �� �q � � �P � �L �� �� � � �y � � ��
�� �M �� �k � �4 � � � �� � �
� �@ �` � �5 �� �� �N
� �7 �3 � �n � �u �G �& �b �h �0 � �M �N � �� �
�Y ��
�� � �
� � �
�& ��
�Q �
�7 �^ �h �� � �J � �P � � �� �r � � � � �� �� �T �- �G �, �u � �� �� �$ � � �< �B � �$ �> � �� �x �L �W � �� �n �
�� �T �� �Z � ��
�� �{ � � � � � � �
�? �
�0 �b �; �D �� � �� � �C �S � �U �> �| �g �� � � ��
�K �� �
� �� � �%
�5
� � � �� �l � �h �
� �� �? � � � �U � �� � � � �* �<
� �
�� �
� �
�� �� ��
� ��
�! �X
� � � � �Q �g � �� �� � �� �r �
� �� �q � �
�� �z
�� � �3 � �� �� � �
�
�] �c �z � � �7 �� �_ � � �C � �& �a �H �|
�l �
� �= � � �I �P ��
�� �~
�8 �` � �w � ��
�T � �
�� � � �� �
� � � � �� �[ �q � � �� �g � �| �C � � �� �N �I �� � �5 �
�( �� �/ �H �K
�
� � � � �9 � �I � � �| �� � �� ��
� � �W � � � � �^ �~ � � � �� � �= �X � �3 �
�I �� � �
� � � �� �3 �r � �� �� �o � �� �� �{ � �i �C �� �! �H �� �� �� � �f � �=
� �1 �[ �� �| �D � �% � �t � � �
� � � �. � � � �y � �T � � �9
��
� �# � � �J �� �n �� � � �
�� �> �B �" �� � �a �� �� �M �K �� � �W � �� � �!
�r �F �+ ��
�
� �� �x
�H �J �� �� �� � �2 �K �� �R
�$ � �9 �
�t
�� �
�� �� � � �� � � �� � � � �% �~ ��
�` � �� �� � �' �v � � �� � �| � �' � � �n
�* � � �� �F � �% � �) �~ � �
� � �J �& �� �
�! �D �� �w � �[ � � � �� � �' � �� �k � � � �
��
�� �� � � � �� � �h
�B �_ � �? � �g �h �� �' � � � � � � � �� � � � � �5 �] � � �� � � � �� � �� �1 � �) �a � �� �� � �; � �� �_ �� � �Q �/ �u
��
�
�j �[ �� �} � �
� �� �� � � � �Q �^
� �G � �z �� �� � �V �O �� � � � �� � �m �u � �6 �� �� �- �$ � � �R �� �} �
�p �r �]
�
�D � � � �� � �i � � � � � �1 �n �� �� � �t �Y �G � � �/ �| �t �0 �
� �� � � �\ ��
�� �� �v �� � � �c � � � �
�~ �A �" � �" �! �8 �C �8 � �� �j �
�1 � �l �> ��
� �]
� �
�~ � �L �( � �� �K �d � �v �D � �� �� �% �� �� �� �� �, � �2 �� �
� � �j �- �. �� �m �K � � �� �o � �; � � �� �d �@ �a � �M �1
�L �@ �2 � �w � �t �Q �
�/ � � �� �~ � � � � �
�/ �� ��
�_ �# �� �O � �O �G � � �k �[ �O �o � �� �-
�
� � � �! � � �I �� �� � �{ �r � �. �h �
� �T
� � � �' �L
�a � �
�@ � � �� � �� �
�T �/
� � �� �� � � �M �� �i
�l �� � ��
�{ �8 �# �
� �� �9 � �S �R � �w � �Z � �0
�E �g �g � � �
�� �L �� �� �p � �� �S �
� � �� �� � �@ � �I �L �;
�O �q �� � �) � �: �F � �5 �J �d �A
�� �
�)
�E �L �Y � � � ��
�m � �� �� �� �� �� �c � �R � �! � � � �
�� �( � �� �] �I � ��
�� �� �e � � � � � �� �� �` �� � �� � �
� �[ � �C
�( �P �, � �} �O �' �L �\
�
� � � � � �Z �� � �s �' � �U � �� � �� �N
� � � ��
� � �M �� �� � � �� � �� �� �i �� �g �' � �� � �� �
� �P �0 �s �i � �p � �n � � �� � �\ �
� � �
�! �h � �� �m �( �& �
�C � �B �) �5 � � � � � � �
�� �� �> � �� � � � � �� �{ �N �� � � �E �3 � �J �# � �c � �
� �$
�� �5 � �x � �] �� �� �k �� �� �� �� � �P
� �
� � �r �� �L � �z �d � � �# �
� �� �[ �S � �h � �G � � � � �
�U �+ �� �y � �w �" � �V �2
�& �z �� �� � �J
�P �� �� � �� � �% �Z �$ �o �T �K �1 �
� �` �V � � � �d � � � � �+ � �� �A � �� � �� � �$ � � �_ �3 �\ � �� �� �� � �b � �f � � �� � �
�A �n � � �x � �F �
�O �[ � �� �( � � �
�# �7 �2 �x � �f �� ��
�! �6 �{
�� � �Y � � � �+ � � � � � �� � �� � � �K �e �� � �
�T �$ � � � �h � � �R � � �" � � �Z �
�_ � �@ �� �a � �� � �3
�
�k �) �j � � � �e � �
�A �^ �� �
�W �� � �h �:
�z
�)
� �| � �� � � � �8 �j �� ��
� � �3 � �
�z �� �p �y � �� �2 �o �D �= �� �. � �9 �a �f � �* �_ � � �* � � ��
�
� � �- � �
�} � �
�� �� �* �
�t � �t �6
�q �� �� � �� �� �� � �S � � � �! �) � �y �
�� � � �j � � �� �V �I � � �g
� � �L �� � � �p �D � � � � �% � � �M � � � �$ �� �� � �E �" �U � �e
� �| �� �Q � � � � � � �
�1
� �� �� � �$ � �] �4 �& � � �z � �� �` �� �w �
� � � ��
�) �%
�& � �� � �* � � �8 �2 �>
�S �
�� � �1 �# � � �
�� �# � �
� �� � �� �F
� � �, �> �+ �
� � �Z �3 �q � ��
�$ � �
�V �� �; � � �N �� �m �K �W � � � �5 �
� �R �4 �� �I � �D �� �� �� �
�� �
�� � � � �% �K �| � � �
� � �� � �9 � �n � �� ��
�- �3 �2
�p � � �?
� �~ � � � �� �� �C � �[ � �
�� �� � �3 �> �� �l �
�` �x �� �� � � �#
� � � �0 �� � � �� �L
� � �Q �� �R � �? �( �m � �`
�� �3 � � � �&
�
� � �s �D � �0 �b �f �@ � � �� �
� �= � �
�< �� �� � ��
�� �6 � �� �s �� � �� �S �� � ��
�8 �Z
�� � � � � �� � � �
�� ��
�� � � �N �� � �
�L �
�J � �� � �b � �g � �� �[
� � � � � �~ � � � �� � �f � � � � �
� �` �4 �= � � �� �l �? � �c � � � � �i � � � �� � � � � �w � � � �% � � �d �^ �+ �� �� � �Z � �F �I
� �t � �� �/ �� � � �y �*
�s �& �+ � �� �) � � �� � � � �
� �e �� �� �Q �] � � �_ �7 � �0 �c �u �� � �L �k �
� �� � � �# � � � � �� � �� �? �� � � �
�n �
�� �� � � �� � �� �H � �Y � �u � ��
� � �J �� �_ �_ �& � �� � �� � � �Z �% � � �s �� �S � � � �V � �� �� � �� �1 �' �� � �F �\ �
�| � �W �� �� �| � �S �W �� �* � �R �l �P �# � � �- �q
� �� � � � �4 � � �� � � �a � � � � �@
�� �X �i �% �� � �8
�3 �, � �} � �� �� �d �x �� �� �# � �6 ��
��
�. � � �A ��
�� �r
��
� �R �d �� � �+
� �� �� �
�{ �{ �H � �
�� �� � � �� �c � �
� �� � �, � �I
�� �c � � � � � �= � �J �. �, �> � � � �L �e �] � �
�C � � �� �* �; �
� � � �p �
�� � �R �� �9 �
�
� �
�� � �? �: � �� �� �Q �' �s �� �w �[ ��
� �- �
�) � �� �M �� �� � � �] �} �6 �@ �
� �U � � � �/ � � �s
� � � �k �? �� �,
�=
�1 �M � � � �/ �S
�d �� �� �o
�6 �k �u � � � �W �{ � �x �W �� �� � �� � �x �^ �� � �[ �+ �7 �: �� �U � � �! � � ��
�. �H �T �� �Y � �� � � �@ �" �C �s � �� � �G
�b � �7 �~ �.
�U � �q � �� � � �{ �� � � �Y �/ �
�� � �A �
�� �* �: �8 �' �� � � �� � �A �_ �0 �� � �� � �i � �K ��
� � �t �* � � ��
� �� �� � � ��
�� � �D � �� � �> � �� �v � �
��
�' � �V � �� ��
�� � �k � � �\ � � � � �! � �� �* �U
� �� � � � �z � �\ �f
� � �� �
�� �� � �� �� � � �� �� � �B � � � � � �{ � �= �
�� �& �
�� �V �� � �" �! ��
� � �� ��
�( �= � �
��
�� �9 � �� �4 �a �� �� �- �Q � �
� ��
�m �� � � �� �C � � �7 �} �q �D �4 �� �u � �� �� �� �v � � �F �� �u �a
� �H �o ��
�
�l �K �A � �� �� �z �4 � �!
�H
� � �� �5 � �j �� �` � �
�B �: �O �a �� �# �� � � �d � � �( �
�&
� �^ �m �g
�E
� �o �� �( �G �$ �@ �
�I � � �A � � �` �X � �7 �� �/ � �$ � �� � �h � � � �� �U �" �T � �� � �� �m � �� �! � �� �� � � � � �M � �� � �� � �2 �q �� � �9 � �� � � � � �� �/ �� � �� � �p �@ �X � �j � �i
�^
�b ��
�� �n � �v � �� �� �o �o � � �v �� �� �0 �� �9 �� �$ �� �f �S �z �
� �D �{ �� �X � � �� �V �3 �Y �
�� ��
�A �� � � � � �q �U �
�: � �2 �j � � � �{ � � �F � �
� � � �� � �� �c �i �R �; �k �h �� � ��
� �Y �O �x � �z �Z �< �v � �
�
�
�� �I � � �4
�M �� �� �� � �b � � � � � � � �C �� ��
� �� �O � �8 �� �� �� �. �] � �V �c
�� � �� �
�H � �T �� � � � �>
�
� � �3 � � �� �, � �� �f � � � �l �T �W �H �. �' �> �p �� � � �" � � �J � ��
��
�v �2 � �� � �x � �2 �� �g � �4 � �� �
�
� � �{
�z � �� �
� �� � �� � � � �� �? � �� � � �J � �� �� �
� �8 � � �E �j
�\ � �8 �8
� � � � � �` � �> �b �S � �� � � �� � � �0 �� � � �E � �� �d � � � �1 � �� � �n �@ �� � �� �T � � �� �� �Q �� �C � � �K �; �k � �� �� �� � �_ �\ �e � �w �� �� � � �M � �. �r �a � �� �
�� � �
� � � �g � � �' �
� � � � �T � � �4 �o �� � �X �y � �x � �� ��
�
�U
�^ �: � � �� � � �" �# �� �� � � � �� �� � �N �U � � �p � �"
�- � � � � �: �� �
� �� �� �� � � � � �W �
�G
�L � �
�G �w �o �� � � �M �r � � � � �Q
�� �I �N �% �
�X � � � �7
��
�a � � � � � �'
�i �h � �} �N �y �? �t � � �D � � � � � �l � � � � � �� �e �J �s �2 �* �y �� � � � �� � �� �q � �� �5 �} �s �$ � �� � �5
�B �� �� � �# �d �s �} �� �~ �� � �b
� �O
�/ �] � � �� �] �2 �� � �f �7 � � �O �
�R � �#
� �[ � �E � � �f
�S
� �d �F � � � �C �V
�> � � �� �B � � � �1 �6 �m �� � � �� � �� �� �p
�� � ��
� �< �z �
�|
�X � � � �s �e �] � �� � �
��
� �O �� �+ �� � � �� � � �: � �A �� � �� �� � �(
�
�m � �4 �P � � �n � �
�o �o � � �m � �y � � �8 � �� �< �� � �< �c �C �� �� �& �w �
�� �$ �
�9 �& � �� �) �` � � � �� � �G �b �E � �: �Q �o �F �
�� �� � �
�F �| �; �
� � �3 �4 �% �� �: � �c � �p �6
�\ �C � �0 �9
� �� � � �� �~ � � �" �h � � �� �� �) � � ��
� � �*
� � �
�
�% � � �� � � �
�. �� � �9 � �� � ��
� � � � �" �! � �,
� �g �J �g �F
� � �� ��
�� �; �i �Z �E �^ �A
� � �l �5 �� �� �� �4 �'
� � �k � � � �2 �� �
� � �X �7 � � �
�{ �� �B �x �= �e �( � � �� �� �' � � � � �� � �� � � � � �D
�i �k � �� � �� �- �, ��
�e �7
�� � �� �� � �� � �n �}
�p �7 �j � � � �9 �� �
�� � � �� �0 �P �� �� � �� � �� �O
�
� �� �� �U �
� �� �<
� � ��
�J �� �t �N �� �) � �. �� � �* � �A �� �r
�] �) � � �� � �G � �_
�p �k
� � �
�% �
�� ��
�� �> �b �_ �^ �? � �: �Y �D �% � �� �
�� � � � � �Y � �
�� �� � � � �l
�A � �� ��
� �D �B � �
�� � �@
�( �v
�� �� � �g ��
� �} �v � � � �
�� � �� � � � �� � � � � �� � �- �~ � �y �% � ��
�_ � � � �� �� � �j �M � � �G �+ � � � �� �� �� �� � �3
�; �
�G �) � �
�� � � � � � � �
�
� �, �I � � �� � �X �A �\ �� � �� �P �v �� � �V � �= �
�
�6 �< �� �X � �
� � �8 �- �Y
� �� � � � � � �c � �� � �9 � �-
�u �� � � �
�R �
� � �6 � �� � �h �} � �?
�w
� �� �� �a �( � � �1 � �
�� �> � �� � � � �] ��
�X �r �P �0 �, � �+ �j � �` � � �� � �. � � �
� �& �W �B
� � �| �7 �U � �� � �W � �Y � �
�� �w
�
� � � � � � � �u �� �b � �q
�� � �b �� � � � �= �$
� �N �J � �� �U �� � � � � � �i �K �, � � �4 �r �{ �� � �H � �p �5 � � �= �� �� �E �9 � �; � �< � �5 ��
� �i � �\ � � � �p � � �� � �r � �N �� � �^ � � � � �K � �� �* � �{ �+
� � �* �8 � � � � � � � �� �j
� �@ �l �6 �� �2 �8 �� � �� � �� �' � �� �� �B
� � � �\ �� �� �S �V � �~ �� � � �� � ��
� �V ��
�z �� �^ � � � � �_
�}
�G �q � �I � �� � �8 �t �h �S � �} �R � �9 � �S �n
�P � �B � � �� �s �� �X �} �f �� � � � �� � �� � �� �� �n �I �^ � �T �� �x �� �r � �� �_ � �b � �O �P �Q �R �S N(� r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )Z!GB2312_TYPICAL_DISTRIBUTION_RATIOZGB2312_TABLE_SIZEZGB2312_CHAR_TO_FREQ_ORDER� r� r� � /usr/lib/python3.6/gb2312freq.py�<module>* s� pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.opt-1.pyc 0000644 00000002041 14751155147 0020320 0 ustar 00 3
���e� � @ sD d dl mZ d dlmZ d dlmZ d dlmZ G dd� de�ZdS )� )�MultiByteCharSetProber)�CodingStateMachine)�GB2312DistributionAnalysis)�GB2312_SM_MODELc s4 e Zd Z� fdd�Zedd� �Zedd� �Z� ZS )� GB2312Proberc s, t t| �j� tt�| _t� | _| j� d S )N) �superr �__init__r r Z coding_smr Zdistribution_analyzer�reset)�self)� __class__� �"/usr/lib/python3.6/gb2312prober.pyr " s
zGB2312Prober.__init__c C s dS )NZGB2312r )r
r r r
� charset_name( s zGB2312Prober.charset_namec C s dS )NZChineser )r
r r r
�language, s zGB2312Prober.language)�__name__�
__module__� __qualname__r �propertyr r �
__classcell__r r )r r
r ! s r N) Zmbcharsetproberr Zcodingstatemachiner Zchardistributionr Zmbcssmr r r r r r
�<module> s pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.pyc 0000644 00000055445 14751155147 0020426 0 ustar 00 3
���eQ, � @ s d�Z d�Ze ed�d�d�d�d��Zd�S )�� � � � �E �[ �O �P �\ �Y �a �Z �D �o �p �R �I �_ �U �N �y �V �G �C �f �k �T �r �g �s �2 �J �< �= �* �L �F �@ �5 �i �] �8 �A �6 �1 �B �n �3 �+ �, �? �Q �M �b �K �l �| �� �� �� �� �( �: �� �� �� �� �� �� �� �� �� �� �S �4 �/ �. �H � �^ �� �q �� �m �� �� �� �� �" �t �� �v �d �� �� �u �w �h �} �� �� �W �c �� �j �z �{ �� �7 �� �� �e �� �� �x �� �0 �' �9 �� � �; �) �X �! �% �$ � � �# �� �> � �� �~ �� �� �& �- �� �� �� �� �� � �� � � � � � � � � � � � � � � � � � � � � � � � � �
� � � � � � �
� � � �` � g C��|�?Fz windows-1255ZHebrew)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguageN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r ( r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )ZWIN1255_CHAR_TO_ORDER_MAPZHEBREW_LANG_MODELZWin1255HebrewModel� r� r� �%/usr/lib/python3.6/langhebrewmodel.py�<module>& s*
pip/_vendor/chardet/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000001375 14751155147 0017756 0 ustar 00 3
���e � @ s8 d dl mZmZ d dlmZ d dlmZmZ dd� ZdS )� )�PY2�PY3)�UniversalDetector)� __version__�VERSIONc C sH t | t�s0t | t�s(tdjt| ����nt| �} t� }|j| � |j� S )z�
Detect the encoding of the given byte string.
:param byte_str: The byte sequence to examine.
:type byte_str: ``bytes`` or ``bytearray``
z4Expected object of type bytes or bytearray, got: {0}) �
isinstance� bytearray�bytes� TypeError�format�typer Zfeed�close)Zbyte_strZdetector� r � /usr/lib/python3.6/__init__.py�detect s
r N) �compatr r Zuniversaldetectorr �versionr r r r r r r �<module> s pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.pyc 0000644 00000112637 14751155147 0017042 0 ustar 00 3
���e�P � � @ s d Z dZ�d�Z�d�S (� g�������?i� � �� � �< �T �� � �Q � �
�
�� �� �< �w � �9 �� � �� � �� �Z � �� �q � � �
�W
�y � � �e �o �� �v
� � � �� �� � � �L �B � �Q
� � �� �Q � �� �E � �f � � � � �� �� � �d �( �y � � �, � �� �
�E �e � �
�W �R �� � �| �R
� �
�� �
�X
��
�j �E � � �+ �P � � � � �� � �; �� �m �� �l �� �� � � � � �e �H � � �� � �^ �k �6 �� �" �F �� �
��
�
�^ �� �
� �� �� �? �` �u �$ �1 ��
�� �� � �U �� �1 �� � �g �l �� � � � �G �� �2 �� �q � � �P � �L �� �� � � �y � � ��
�� �M �� �k � �4 � � � �� � �
� �@ �` � �5 �� �� �N
� �7 �3 � �n � �u �G �& �b �h �0 � �M �N � �� �
�Y ��
�� � �
� � �
�& ��
�Q �
�7 �^ �h �� � �J � �P � � �� �r � � � � �� �� �T �- �G �, �u � �� �� �$ � � �< �B � �$ �> � �� �x �L �W � �� �n �
�� �T �� �Z � ��
�� �{ � � � � � � �
�? �
�0 �b �; �D �� � �� � �C �S � �U �> �| �g �� � � ��
�K �� �
� �� � �%
�5
� � � �� �l � �h �
� �� �? � � � �U � �� � � � �* �<
� �
�� �
� �
�� �� ��
� ��
�! �X
� � � � �Q �g � �� �� � �� �r �
� �� �q � �
�� �z
�� � �3 � �� �� � �
�
�] �c �z � � �7 �� �_ � � �C � �& �a �H �|
�l �
� �= � � �I �P ��
�� �~
�8 �` � �w � ��
�T � �
�� � � �� �
� � � � �� �[ �q � � �� �g � �| �C � � �� �N �I �� � �5 �
�( �� �/ �H �K
�
� � � � �9 � �I � � �| �� � �� ��
� � �W � � � � �^ �~ � � � �� � �= �X � �3 �
�I �� � �
� � � �� �3 �r � �� �� �o � �� �� �{ � �i �C �� �! �H �� �� �� � �f � �=
� �1 �[ �� �| �D � �% � �t � � �
� � � �. � � � �y � �T � � �9
��
� �# � � �J �� �n �� � � �
�� �> �B �" �� � �a �� �� �M �K �� � �W � �� � �!
�r �F �+ ��
�
� �� �x
�H �J �� �� �� � �2 �K �� �R
�$ � �9 �
�t
�� �
�� �� � � �� � � �� � � � �% �~ ��
�` � �� �� � �' �v � � �� � �| � �' � � �n
�* � � �� �F � �% � �) �~ � �
� � �J �& �� �
�! �D �� �w � �[ � � � �� � �' � �� �k � � � �
��
�� �� � � � �� � �h
�B �_ � �? � �g �h �� �' � � � � � � � �� � � � � �5 �] � � �� � � � �� � �� �1 � �) �a � �� �� � �; � �� �_ �� � �Q �/ �u
��
�
�j �[ �� �} � �
� �� �� � � � �Q �^
� �G � �z �� �� � �V �O �� � � � �� � �m �u � �6 �� �� �- �$ � � �R �� �} �
�p �r �]
�
�D � � � �� � �i � � � � � �1 �n �� �� � �t �Y �G � � �/ �| �t �0 �
� �� � � �\ ��
�� �� �v �� � � �c � � � �
�~ �A �" � �" �! �8 �C �8 � �� �j �
�1 � �l �> ��
� �]
� �
�~ � �L �( � �� �K �d � �v �D � �� �� �% �� �� �� �� �, � �2 �� �
� � �j �- �. �� �m �K � � �� �o � �; � � �� �d �@ �a � �M �1
�L �@ �2 � �w � �t �Q �
�/ � � �� �~ � � � � �
�/ �� ��
�_ �# �� �O � �O �G � � �k �[ �O �o � �� �-
�
� � � �! � � �I �� �� � �{ �r � �. �h �
� �T
� � � �' �L
�a � �
�@ � � �� � �� �
�T �/
� � �� �� � � �M �� �i
�l �� � ��
�{ �8 �# �
� �� �9 � �S �R � �w � �Z � �0
�E �g �g � � �
�� �L �� �� �p � �� �S �
� � �� �� � �@ � �I �L �;
�O �q �� � �) � �: �F � �5 �J �d �A
�� �
�)
�E �L �Y � � � ��
�m � �� �� �� �� �� �c � �R � �! � � � �
�� �( � �� �] �I � ��
�� �� �e � � � � � �� �� �` �� � �� � �
� �[ � �C
�( �P �, � �} �O �' �L �\
�
� � � � � �Z �� � �s �' � �U � �� � �� �N
� � � ��
� � �M �� �� � � �� � �� �� �i �� �g �' � �� � �� �
� �P �0 �s �i � �p � �n � � �� � �\ �
� � �
�! �h � �� �m �( �& �
�C � �B �) �5 � � � � � � �
�� �� �> � �� � � � � �� �{ �N �� � � �E �3 � �J �# � �c � �
� �$
�� �5 � �x � �] �� �� �k �� �� �� �� � �P
� �
� � �r �� �L � �z �d � � �# �
� �� �[ �S � �h � �G � � � � �
�U �+ �� �y � �w �" � �V �2
�& �z �� �� � �J
�P �� �� � �� � �% �Z �$ �o �T �K �1 �
� �` �V � � � �d � � � � �+ � �� �A � �� � �� � �$ � � �_ �3 �\ � �� �� �� � �b � �f � � �� � �
�A �n � � �x � �F �
�O �[ � �� �( � � �
�# �7 �2 �x � �f �� ��
�! �6 �{
�� � �Y � � � �+ � � � � � �� � �� � � �K �e �� � �
�T �$ � � � �h � � �R � � �" � � �Z �
�_ � �@ �� �a � �� � �3
�
�k �) �j � � � �e � �
�A �^ �� �
�W �� � �h �:
�z
�)
� �| � �� � � � �8 �j �� ��
� � �3 � �
�z �� �p �y � �� �2 �o �D �= �� �. � �9 �a �f � �* �_ � � �* � � ��
�
� � �- � �
�} � �
�� �� �* �
�t � �t �6
�q �� �� � �� �� �� � �S � � � �! �) � �y �
�� � � �j � � �� �V �I � � �g
� � �L �� � � �p �D � � � � �% � � �M � � � �$ �� �� � �E �" �U � �e
� �| �� �Q � � � � � � �
�1
� �� �� � �$ � �] �4 �& � � �z � �� �` �� �w �
� � � ��
�) �%
�& � �� � �* � � �8 �2 �>
�S �
�� � �1 �# � � �
�� �# � �
� �� � �� �F
� � �, �> �+ �
� � �Z �3 �q � ��
�$ � �
�V �� �; � � �N �� �m �K �W � � � �5 �
� �R �4 �� �I � �D �� �� �� �
�� �
�� � � � �% �K �| � � �
� � �� � �9 � �n � �� ��
�- �3 �2
�p � � �?
� �~ � � � �� �� �C � �[ � �
�� �� � �3 �> �� �l �
�` �x �� �� � � �#
� � � �0 �� � � �� �L
� � �Q �� �R � �? �( �m � �`
�� �3 � � � �&
�
� � �s �D � �0 �b �f �@ � � �� �
� �= � �
�< �� �� � ��
�� �6 � �� �s �� � �� �S �� � ��
�8 �Z
�� � � � � �� � � �
�� ��
�� � � �N �� � �
�L �
�J � �� � �b � �g � �� �[
� � � � � �~ � � � �� � �f � � � � �
� �` �4 �= � � �� �l �? � �c � � � � �i � � � �� � � � � �w � � � �% � � �d �^ �+ �� �� � �Z � �F �I
� �t � �� �/ �� � � �y �*
�s �& �+ � �� �) � � �� � � � �
� �e �� �� �Q �] � � �_ �7 � �0 �c �u �� � �L �k �
� �� � � �# � � � � �� � �� �? �� � � �
�n �
�� �� � � �� � �� �H � �Y � �u � ��
� � �J �� �_ �_ �& � �� � �� � � �Z �% � � �s �� �S � � � �V � �� �� � �� �1 �' �� � �F �\ �
�| � �W �� �� �| � �S �W �� �* � �R �l �P �# � � �- �q
� �� � � � �4 � � �� � � �a � � � � �@
�� �X �i �% �� � �8
�3 �, � �} � �� �� �d �x �� �� �# � �6 ��
��
�. � � �A ��
�� �r
��
� �R �d �� � �+
� �� �� �
�{ �{ �H � �
�� �� � � �� �c � �
� �� � �, � �I
�� �c � � � � � �= � �J �. �, �> � � � �L �e �] � �
�C � � �� �* �; �
� � � �p �
�� � �R �� �9 �
�
� �
�� � �? �: � �� �� �Q �' �s �� �w �[ ��
� �- �
�) � �� �M �� �� � � �] �} �6 �@ �
� �U � � � �/ � � �s
� � � �k �? �� �,
�=
�1 �M � � � �/ �S
�d �� �� �o
�6 �k �u � � � �W �{ � �x �W �� �� � �� � �x �^ �� � �[ �+ �7 �: �� �U � � �! � � ��
�. �H �T �� �Y � �� � � �@ �" �C �s � �� � �G
�b � �7 �~ �.
�U � �q � �� � � �{ �� � � �Y �/ �
�� � �A �
�� �* �: �8 �' �� � � �� � �A �_ �0 �� � �� � �i � �K ��
� � �t �* � � ��
� �� �� � � ��
�� � �D � �� � �> � �� �v � �
��
�' � �V � �� ��
�� � �k � � �\ � � � � �! � �� �* �U
� �� � � � �z � �\ �f
� � �� �
�� �� � �� �� � � �� �� � �B � � � � � �{ � �= �
�� �& �
�� �V �� � �" �! ��
� � �� ��
�( �= � �
��
�� �9 � �� �4 �a �� �� �- �Q � �
� ��
�m �� � � �� �C � � �7 �} �q �D �4 �� �u � �� �� �� �v � � �F �� �u �a
� �H �o ��
�
�l �K �A � �� �� �z �4 � �!
�H
� � �� �5 � �j �� �` � �
�B �: �O �a �� �# �� � � �d � � �( �
�&
� �^ �m �g
�E
� �o �� �( �G �$ �@ �
�I � � �A � � �` �X � �7 �� �/ � �$ � �� � �h � � � �� �U �" �T � �� � �� �m � �� �! � �� �� � � � � �M � �� � �� � �2 �q �� � �9 � �� � � � � �� �/ �� � �� � �p �@ �X � �j � �i
�^
�b ��
�� �n � �v � �� �� �o �o � � �v �� �� �0 �� �9 �� �$ �� �f �S �z �
� �D �{ �� �X � � �� �V �3 �Y �
�� ��
�A �� � � � � �q �U �
�: � �2 �j � � � �{ � � �F � �
� � � �� � �� �c �i �R �; �k �h �� � ��
� �Y �O �x � �z �Z �< �v � �
�
�
�� �I � � �4
�M �� �� �� � �b � � � � � � � �C �� ��
� �� �O � �8 �� �� �� �. �] � �V �c
�� � �� �
�H � �T �� � � � �>
�
� � �3 � � �� �, � �� �f � � � �l �T �W �H �. �' �> �p �� � � �" � � �J � ��
��
�v �2 � �� � �x � �2 �� �g � �4 � �� �
�
� � �{
�z � �� �
� �� � �� � � � �� �? � �� � � �J � �� �� �
� �8 � � �E �j
�\ � �8 �8
� � � � � �` � �> �b �S � �� � � �� � � �0 �� � � �E � �� �d � � � �1 � �� � �n �@ �� � �� �T � � �� �� �Q �� �C � � �K �; �k � �� �� �� � �_ �\ �e � �w �� �� � � �M � �. �r �a � �� �
�� � �
� � � �g � � �' �
� � � � �T � � �4 �o �� � �X �y � �x � �� ��
�
�U
�^ �: � � �� � � �" �# �� �� � � � �� �� � �N �U � � �p � �"
�- � � � � �: �� �
� �� �� �� � � � � �W �
�G
�L � �
�G �w �o �� � � �M �r � � � � �Q
�� �I �N �% �
�X � � � �7
��
�a � � � � � �'
�i �h � �} �N �y �? �t � � �D � � � � � �l � � � � � �� �e �J �s �2 �* �y �� � � � �� � �� �q � �� �5 �} �s �$ � �� � �5
�B �� �� � �# �d �s �} �� �~ �� � �b
� �O
�/ �] � � �� �] �2 �� � �f �7 � � �O �
�R � �#
� �[ � �E � � �f
�S
� �d �F � � � �C �V
�> � � �� �B � � � �1 �6 �m �� � � �� � �� �� �p
�� � ��
� �< �z �
�|
�X � � � �s �e �] � �� � �
��
� �O �� �+ �� � � �� � � �: � �A �� � �� �� � �(
�
�m � �4 �P � � �n � �
�o �o � � �m � �y � � �8 � �� �< �� � �< �c �C �� �� �& �w �
�� �$ �
�9 �& � �� �) �` � � � �� � �G �b �E � �: �Q �o �F �
�� �� � �
�F �| �; �
� � �3 �4 �% �� �: � �c � �p �6
�\ �C � �0 �9
� �� � � �� �~ � � �" �h � � �� �� �) � � ��
� � �*
� � �
�
�% � � �� � � �
�. �� � �9 � �� � ��
� � � � �" �! � �,
� �g �J �g �F
� � �� ��
�� �; �i �Z �E �^ �A
� � �l �5 �� �� �� �4 �'
� � �k � � � �2 �� �
� � �X �7 � � �
�{ �� �B �x �= �e �( � � �� �� �' � � � � �� � �� � � � � �D
�i �k � �� � �� �- �, ��
�e �7
�� � �� �� � �� � �n �}
�p �7 �j � � � �9 �� �
�� � � �� �0 �P �� �� � �� � �� �O
�
� �� �� �U �
� �� �<
� � ��
�J �� �t �N �� �) � �. �� � �* � �A �� �r
�] �) � � �� � �G � �_
�p �k
� � �
�% �
�� ��
�� �> �b �_ �^ �? � �: �Y �D �% � �� �
�� � � � � �Y � �
�� �� � � � �l
�A � �� ��
� �D �B � �
�� � �@
�( �v
�� �� � �g ��
� �} �v � � � �
�� � �� � � � �� � � � � �� � �- �~ � �y �% � ��
�_ � � � �� �� � �j �M � � �G �+ � � � �� �� �� �� � �3
�; �
�G �) � �
�� � � � � � � �
�
� �, �I � � �� � �X �A �\ �� � �� �P �v �� � �V � �= �
�
�6 �< �� �X � �
� � �8 �- �Y
� �� � � � � � �c � �� � �9 � �-
�u �� � � �
�R �
� � �6 � �� � �h �} � �?
�w
� �� �� �a �( � � �1 � �
�� �> � �� � � � �] ��
�X �r �P �0 �, � �+ �j � �` � � �� � �. � � �
� �& �W �B
� � �| �7 �U � �� � �W � �Y � �
�� �w
�
� � � � � � � �u �� �b � �q
�� � �b �� � � � �= �$
� �N �J � �� �U �� � � � � � �i �K �, � � �4 �r �{ �� � �H � �p �5 � � �= �� �� �E �9 � �; � �< � �5 ��
� �i � �\ � � � �p � � �� � �r � �N �� � �^ � � � � �K � �� �* � �{ �+
� � �* �8 � � � � � � � �� �j
� �@ �l �6 �� �2 �8 �� � �� � �� �' � �� �� �B
� � � �\ �� �� �S �V � �~ �� � � �� � ��
� �V ��
�z �� �^ � � � � �_
�}
�G �q � �I � �� � �8 �t �h �S � �} �R � �9 � �S �n
�P � �B � � �� �s �� �X �} �f �� � � � �� � �� � �� �� �n �I �^ � �T �� �x �� �r � �� �_ � �b � �O �P �Q �R �S N(� r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )Z!GB2312_TYPICAL_DISTRIBUTION_RATIOZGB2312_TABLE_SIZEZGB2312_CHAR_TO_FREQ_ORDER� r� r� � /usr/lib/python3.6/gb2312freq.py�<module>* s� pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.opt-1.pyc 0000644 00000126637 14751155147 0017673 0 ustar 00 3
���e�d � @ s d Z dZ�dZ�dS ( g @i �( � � � � � �' �O � �} �� �� � � �] �
�
� ��
� � � �� � � � �� � � �� �X �} �� �� �k � �g
�
� �k � �� �� � � � � � � �% �& �0 �1 �, �- � � � � �� � � �� �� �< � � �p �� �� �� �� �� �� �g �� � �� �W �X �� �� �h
�" �� � � �� �
� � �\ �� � �
�/
� �� �� �� � �� �0
� �
�h � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 � �V �j �4 � � � �B � � �8 �9 �: �; �< �= �> �v � �� � �S � �e � �f � � �d �+ �� � �a �w �� � � �I �� �~ �� �
� �? �@ �A �B �C �D �
� �- � � �i �� �
� �E �^ �. �� �3 � �i
�F �/ �Y � �� � �� �j ��
� �G �H �I �J �q � �1
� �Y � �k �/ � �2 � � �# � � �� �* � � � � � � �[ � �\ �5 � �! �! � �% �@ �l � �' �A � � � �4 �
� �� � � � �< � � � �- � � �7 �S � �� �~ �K �= � �E � �; � � �7 �7 �8 �m �& � � �
� �O �K �= �~ �d � � �L �M �N �O �P �Q �R �S �T �U �V �Y �> �J �" �p �p � �� � � �T �_ � � �. �X � � �L �j �e � �9 �P � �l �y �� � � �D �� � � �) �h �� �F �? � �+ � � �g �c � �� �B �] �N �� � �8 �j �: �5 � � �7 � � �R �4 �G �d � �� � �n � �h �t �6 �3 �$ �W �C � � �:
�x �� � �* �V � �W �X �Y �Z �[ �\ �] �^ �_ �` � �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �
�u �v �w �x �y �z �{ �| � �� � �� �l �} � �~ � � � � �
� � �� �
�� �� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � �k � ��
�> ��
��
� � �
�j
�� � � �Z �[ �\ �] � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< �= �> �? �@ �A �B �C �D �E �F �G �H �I �J �K �L �M �N �O �P �Q �R �S �T �U �V �W �X �Y �Z �[ �\ �] �^ �_ �` �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �u �v �w �x �y �z �{ �| �} �~ � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< �= �> �? �@ �A �B �C �D �E �F �G �H �I �J �K �L �M �N �O �P �Q �R �S �T �U �V �W �X �Y �Z �[ �\ �] �^ �_ �` �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �u �v �w �x �y �z �{ �| �} �~ � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � � � � � � � � � � � �
� � �
� � � � � � � � � � � � � � � � � � � �! �" �# �$ �% �& �' �( �) �* �+ �, �- �. �/ �0 �1 �2 �3 �4 �5 �6 �7 �8 �9 �: �; �< �= �> �? �@ �A �B �C �D �E �F �G �H �I �J �K �L �M �N �O �P �Q �R �S �T �U �V �W �X �Y �Z �[ �\ �] �^ �_ �` �a �b �c �d �e �f �g �h �i �j �k �l �m �n �o �p �q �r �s �t �u �v �w �x �y �z �{ �| �} �~ � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � �
�� �� �� � � � �2
�� �� �{ �T �� �a
�
�^ �� �� �| � �= � �m �k
� �� � � �V �y � � �
�q � �� � �
� � � � �� �! � � �� � �� � � �C �O �3 � �� �� � � �r � � �n �� �+ � �� � �
�p �q �� �;
�A �� � �� �C �0 � �n �
� �� �T �C �o �
� �
�# � � �~ � �P �� � �� � �� �� � �� � �$ �z �� �� �& �� � �� �� � �� � � �� �_ � � �U �� �
�s �� � �� �I � � �� � � � �� �3
�� � �$ �W �1 �5 �P �� � � �� �� � �� �X � � � �l
�� � �H � � � � �� � � �
�
�W �� �~ �p � �$ � � � �@ �L �� �� � � �� �u � � �J �I �W �� � �_ �� � �< � �� � �] �D �� �� � � �h �� � � � � �� �f �- � �} �t � �� � �� �� � �, �� �
�b � �� �X � � �F � �{ �` �� � �+ �3 �q � �m � �4
�� � � � � �B �l �X �
� �%
� � �% �2 �u � � �� � �J � �| �r � �@ � �� � � �� �� �
� �� �L
� � � � � � �b
�J � �c � �� �� � � �� � �4 �R � �m
�T �� �� � � �� �� �� � �e �� � �? �
�� � � � �- � � �* �E � �� �+ � �� �& � �� � �/ �� �� �. �s �[ �� �+ � �
� �
�B �c
� �� �� � � � �) � �, �� �u � � � �9 �&
� � �� � � �v �� �Y �� �3 � �
�� � � �D � � � � �d � � �| �( �y � �� � � �< �8 �� �i � � � �d
�5
�B � �n � �� � �� �� �| �� �! �� �) �@ �n
�m � � �0 �a �� � �� �z �' �� � �� �W �� �[ �v �� �� � �� � � �o
� �� � �
� � �'
� � �" � � �9 � � � �� �J � � �h �� � �e
� � �\ �� � � �p
�@ � �Q �9 �� � �� � � � � �w �i �E � �J �I �� �� � � �� � �f � � � �
�� �1 �� �� �
�� � �' �r �
� �� �� �
� � �c �� �q � �x �� � �
�2 �� � � �� � �* � � �b �F � �v �� �d �
� �� �! �R � �� �Q � � � �P �� � � � � � �� �( �� � �_ � �` � � �f
� �6
�� �A � �� �a �� �� �u �T � �2 �� � � � � � �^ �C �� ��
� �[ �� ��
�v �% � �� �� �n �! �F � �Z �^ �� � �� �d � �� �� �x � � �] �� �B � �c ��
�� � � �P �q � � �H �Y � �� �(
�� �
�� �g �} �K � �� � �4 �� �W � � �� �C �g
�- �d �� �k � �4 �} � �q
�~ �+ � �� � �h �@ � � �@ �A �D �: � � �e ��
�� �q �w �� � � �� � �� � �d �� �Z � �* �M
�[ �� � �s �Z �
� �� �> � �' �- �� ��
� � �� �) � �� � �� �t �F �7
�� �t �# �� � � �� � �Y � � �f �k �b �1 � ��
� �6 �o �c � �q �� � � �� ��
�u � �: �� �� �N
�� �U �= �� �v �� �l �N �� �� � �] � �; �� �� ��
�� � �l �L � �} � �� � �� �B � �8
�Q �� �# �` �T �� � �x � �r �� � � � �� �� �� �� �3 �n � �� � �� � � �{ � � �@ �� �� � �� �9
� � � �5 �h
�d �Z �� � �i � � � � � �s �- �r
�� � � �� �[ �� �0 � � � �� �. �S � �R �O
�� � � �� �; � �4 �y �
�; � �z � �p � � � �� � �:
�( �| �
� �" �� �� �� � � � �O � �e � � � �
�C �t �)
� �6 �K � �� �8 � �P
� �h � �� �� � �� �3 �$ �� �� �*
�= �b �e � ��
�4 � �� �� �. �7 � �\ � � � �j � � � � � � �� � �/ � � �� � �= �� �^ �� �5 � �� � �\ �� � � �� �9 �# �+ �
�s
�, � �7 � � �Y �� � ��
�M �� �+
�i
�Q � � �6 �� �� �� � � �y � � �s �# �{ ��
�U �f �< �� � �v �� � �) ��
� � � � �� �m �< � � � �� �� �g � � �l �� � �D �b �u ��
� �D �B � � ��
�[ � � �8 �� � �> � � � � � �� �� � �] �� �D �� �� �� �6 �Z �� � �5 �� �
��
�< �m ��
�, � � �u �^ � � �� �g �� � �I � � �g �� � �\ �: �
�M �t � �� �E � �o �� �� � �� �E �R �� � � �E �j
�� �g �W � � �K � �C � �= �� �] �$ �! � � � �� � �` �K �v � � �0 �i � �^ �� � �3 �� �" � � �� �� � �a �k
� �;
�w � � � �� � � �
�y � � �� �� �P � � � �w � � �� �t
�� � �� � �� �� �J �a � � �] �� �� �� � � � � � �L �h � �� �� ��
�u
�j � � �# �C �� � � �a �� �! �s �| � � �Y � �
� � � �h �O �5 � � �z �i �
�S �� �L �� �. � �& � � �<
�7 �� �s �A � � �M ��
� �s �� �* �,
�% �
�� � �k �� �& �f �� �O �j �" � �( �- � �[ � �� �� � �- �= � �} � � �M �S � �� �� � � � � � �� �� �
�
� �
� �~ � �J �t �k �v �e �y � �� � �<
�� �f � �M �k ��
� � �o �� �� �� �w �v
�l �� �] � � �. ��
�� �� � �/ �f �q �$ �g � �G � � �n � �> �6 �=
� � � �� � �N �� �x � �e �* � �h � �� �� �$ � �� � �o �b �, � � � � �t �� � � �� � ��
�V � ��
�i � � � �� �w
� � �p �H �� �V � �i �< �Z � �8 �r �w � �& �� �� � �/ �� � � �� �> � �>
�E �x �� �& �e �� �w � �� � �5 �� �� �
� �\ � � � �S �i � � � �� �2 � �� � � �+ �' �� �% � �� �x
�O � �
�Q
� �� � � � �� �_ �H �� � � � �g � �� �y
� �
�0 �& �+ � � � � � �l
�' � �' �z � � � � �_ �� �� � �� � � �?
��
�� �� � �z
�� �m
�| �
� � �g �0 � �� � � �* � � �
�` �w � � �
�# �� �c �) �� �� �R
�� �� �� �T � �� �r � �V � �� � �_ � � � � �r � �� �
�` �x � � �
� � �f � � �n
�=
�* �A � �� �( �� �x � �S
� �{ �T
� �9 � � �M � �r �� � �; � �( � �% � �[ �a �b � � �D � � � �-
�\ � � � � �o
�E �m �) �� �! � � �c � �, �1 � �] � � � �> �I � � �� �T � �� �� � � � �y � �k �z �x �� �N � �� � � � �5 � �� �" �� �H �< �d � �
� � �h �� � �
�p
� � �: �L �1 �� � ��
� � �>
�� �q
�? �Z �M �I � � �B �K �D � �# �
�
�Y �> � �� � � �` � � � � � � �� � � � � � � � �� �c � � � � �� �� �T � �a � �2 �y �/ �� �" �U
�� �� �b � � � �/ � �� �� � �
�{ �
� �j � � � �5 �* �� � �� � �a �x �� � � � �F �� �� � �7 � �� � �? � �w �� � � �� �� �+ � �8 �� ��
�N ��
� �� �, �� �n � �
� � �o �s �_ �? �� � � � � �� � �� �? �0 �� � � �y �3 �f � �= � � �l � � � �v �] � � � �� �� �z ��
� �y �j � �u � �� �p �� �j � � �
�i �z � �� �r
� � �� �� �� � � � �F � �' �� �{
�n � �x �u �$ � � � �M � � �� �k � �p ��
�^ �q �
�` �| � � � �
�|
� ��
� � � �
� � �� � �G � � �- �� �Z �1 �Y �� �- � �e �� � �[ �C � � � �e � �. �- � � �� � � � �
�
�7 �b �l � � �� �� �{ �� �. � � �� �z � ��
�
� �?
�� � �9 � �
�� � � �} � �
�a � � �
�Q � �d �; �V
�� �/ �^ �D �� �? �m ��
��
�9 �I �
�� �� �
� �� ��
�{ �} � � � � � � �& �� �~ �� �X � � �}
��
�� �9 � �� �: � �" �\ � �� �
�_ �� �8 �W �~
�^ �% �P �s � �w � � � �8 � �L �� � �.
�� � ��
�� � �N �� �� �P � �S � �� �� �: �R �' �0 �b � � �
� �� � �� �z � � � � � � �K �� �� �� �
�r � �q �
�� �� �n �L � � � � � � � � �� �X �@
�� �g �i � � �4 � �: � � � �r � � �Q ��
� � �; �' � �> �� �b �m �� �w �� � � �s
�� � � �A
� �t
�9 � � � � � �o �^ � � �2 � �c �� � �� � � �r � � � �! � �t � �1 �{ �� �� � � � � �s � � � � � �� �x � �v �a �p � �� �
�� �L �O � � �U � �. � �� �) �. � �E � �" � �y � � � � �� � �( �
� � �q �E �6 �
��
�2 �u �6 � � � �� �. � �i � �� �V � � �s ��
� � �G �G �j �t � �W � � � � �` � � � �u �� � �
�� �{ �Q � � �O �C � � �
�� �J � � � �$ �� � �� �/ �� � �_ � �� � �j �R � �7 � � �/
� �3 �D �u
�6 �X �4 � �� � � � � �> � � � �0
�` �` �
�� � �� �U �� � �
�r � � �) �� �5 �� �H �� �
� � �~ �r � �
� �� � � � � � �] �� � � � � �� � �@
� �� �
�a �� �v � � � �/ �! �6 �� �� � �7 �w � � �3 �c �8 �x � � � �B
�� �� �M � � �F � �g � � � �( � �
�: � �� �H � ��
�f �� � �" ��
�~ � �� �� �
�y � � � �� � �! �N ��
�4 �A
�� �d �e �� � �z � � �� �� �� �� � �0 �� � � � � � � �� �{ �� �� � �
� �f �( �l �� �G � � �� �^ �B
�m �F �| � �U �� � �2 �R �� �� �# �� �
� �� �F �� � �U � � � �1 �� �c �k � �N �S � � �� ��
�� � �$ �O � � �Y � � � �
�� �G � � � �W
� �C
�? � � � �~ �� � �U �F �� � � � �� �� � �
�C
� � �� � �e �
�� � � � �/ �Q �_ �v
�; � � �P �) �� �G �m � � � �G �, �I �z �_ � �� � �9 �n � �
�A � �
�X
�� �# �V �) �< �% � �} � � �H �w
�5 � �p �. � �� � �m � � �� �
�# �h �| �b � � � �@ �( �^ �z �� � �A ��
� � �" � �g � �| �� �� � � �� �6 � �X � � �, �� �� � � �� �$ �# �I �k � � � � �: � � �Q � �o �h �V �$ �
�� �t � � � �Y
�, �� � �
� �D
� �� �~ ��
�
� � �% � � � � � � � �� ��
� �7 �/ �
� �� �� � �E �V �� ��
�E
�u � �& �� � � � �� �� �o � � �Z � �i � � � � � � � �! �� �n �8 �� �' � � � � �� � �� � � �G � �R �2 �� � �: � �, �� � �Z
�l � �( �X �P �? � � � �o � � � � �� � �W �* � �� �; �8 � �& �) � �� �
�o �� � � � �H �_ � � �0 �� �x
� �0 � �; � �
� � �X � � �� �� �1 � �Z �* �% �� � � �| �d �` � � �S �j �} �\ � �� � �G � � � �f �q �% �B � �1
�p � �" � � �� � � �| � �� � �� �� �l �2
� �
��
� � �@ �h � �; � � � � � � � � �& � � �� �} � �% � � � � �? � � �� �a �y
� �
�� � � � �= �1 � �< � �{ �# � �� �� � ��
�A � �
� �t � � � � �> �
�K �3
� � �= �� � �\ �� �� �' �A �+ �g �� �b �K � �� � �� �
�� �
�� �4
� �* � �m � � �
�o �N � �0 �( �i � �$ �4 � �{ � � � �Q �� � �U �� � � �, �` � �� � � ��
�j �) � �� �- �6 �� � �F
�2 �) � �
�* � �Y N( r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r )Z JIS_TYPICAL_DISTRIBUTION_RATIOZJIS_TABLE_SIZEZJIS_CHAR_TO_FREQ_ORDER� r r � /usr/lib/python3.6/jisfreq.py�<module>, s$ pip/_vendor/chardet/__pycache__/big5freq.cpython-36.opt-1.pyc 0000644 00000152574 14751155147 0017733 0 ustar 00 3
���ez � @ s d Z dZ�dZ�dS ( g �?� � � �� � � �� � �R � � � �� �a �� � �n �� �! �� � �L �, �B � � � � � � � �{
�]
� � �
�j � � �. �N �i � � �� �: � � � �? � � �= �N �K �� � �k �q �� � ��
� �� � �b � �
� � � ��
�o �2 � �i � �� �c �8 � � � � � � � � �{ �| �� � �" ��
� �@ �\ � �� � � � �� � � �F � �|
�Q �H � � �P �v �� � �� � � �D �^
�� � �F �}
� �E � �O � �0 �� �s �� �4 �< �2 � � �& �M �� �� �~
� �� �G � � �[ � � �? � � �a � �K �* � �g �� �Z �
�: � � � �K � � � � � � � �� �` �l � � � � �
� �q � �~ � �� �
� � �� �� � �c � �u � � �* � � � ��
� �~ �m �� �� � �e � �G �^ � �n � � �U �C �� �C �� � � �� � � � �j �o �/ � � �P �7 �[ �� �� ��
�? � � � �o �S �( � � � �p �] � �6 �j � �@ � � �� � � �8 � �+ �3 �[ � � �\ � � �� � � �] �A � �� �� �1 �� � �H ��
��
�d � �� �+ � �2 � � � ��
�O �L � � �f �1 �� � � �� � � � �3 �9 �� �l �, �� � � �� � � � � � �e �z
�Q �M �& �� �X � � � � �� �
� � �� �k �p � �M � � �� �% � � � � � � �' �� � �\ � � �7 � �J � �! �� �� � � �� �N � �B �P �_
�q � � ��
� � ��
��
� � � � � �I �� �8 �� �
� �{
� �� �
� � � �m �� � �f � � �x � �� � � ��
� �
�� �g � �� �
� � � � � � � �& � �' � � � � � �. � �� � � �M � �� � � �$ �# �� �D �h �A � � �� �r � � �U �G � �� �� �
�
�Q �S �i � � �d � �0 �F �� �� �C � � � � � �� �J � �� �U � �� � �N �
� � �< � �
�: �A
��
� � � �9 �� �} � �� � � �W �P �
� �) �D � � � �4 ��
�� �) �� � �r � �s � �� �t � �9 �� � � �s �* � � � � � � �] � � � � � �D �j �(
�
�� � �
� �u �5 �Y �j � �l � �u � � ��
� � �`
�
�= �� � �� �� �� � � �5 � �! �� � �T �E �x � � �e � �� �� �O �P � �|
�6 �A �
�/ �k �� �
� �l �! � �� �B � �` � �
�� � �A � � � � � ��
�v � �� � �w � � �� �M �
� �� � � � �a
� � ��
�}
�� �x �, �} � � �B
� � � �� � � � � �F �k �m � �� �
�� � � ��
� �b � �)
�^ �P �
�, � �� �� �7 �5 �~
�y �| � �z � � �� ��
�C
�{ � � � � � �� � � � �1 �� �b � � ��
�� � �t �� �
� �_ �� � �� �� � � ��
��
�b
�� � � �5 �D � � �l � �| �[ �*
�� � �
� �% � �G �^ � �l � �� ��
� �` � �� � �p �� � �n �c �g �m � �� �' �2 � � �� �{ �� � �� � � � �D
�� �f � �� �| �: �� � � �� �
�� ��
�
�� �� � �n � �� �� �� �; �� �I �Y �} �� �
�X �" � �
�� �� � � �� �� �- � �l �� �� � �� � � � � �E � �~ � �> �] �� �, �� �� �� �v �L �B �i �& �� �� � �� � � �G �� �� � �B �� �
�+
� � � � � �� �� �� � �a � � � �
�a �� �} �E
� �D �� �= �� �0 � �� �
�6 �� � �� �v �! � � �� �� � � �� � �9 �H � � � � �
�F � �� �� �� � �" � �H �� �� �� �
�o � � �R �* � �. � �� � � � �I �3 � �,
� �* �S � � � �X �� �� �/ � �b �p � � � � �� �� �� �� �R � � � �7 � �2 �� � �� � �� �� �� � �_ �� �b � �
� �� � � � � � � � � �` �O � � �� �` �7 �
�
� � � � �� � �a �� �� �� �� �� �� �g � �� � � �
�_ � �~ �� � �� � � �
�a �� �
�b �� �� �� � �� � �� � �; �� � �- �
�� �Q �� �� � �q � �� �� �� �` �� �# �# �� � �� � �r �
�s � � �� �d �t ��
�� �c
�� � �k �w � �� � �� �� � � � � �� �g � �Q � �U �
� �� � � � �C �S � �c � � �5 � � �B �� �_ � �c �N �� �� �Y � �� �� �
� �L �d ��
�
� �K � �8 �a �G � � �
� � � �s �6 � �t �; �N � � � � �4 �� �: � �\ �q � � � �. �� � � �u ��
�� �� �� � ��
� �
�r �� � ��
�
�� �c � � � �@ � � �� � � � � �� �/ �9 � � � � �� �� � � �
�< �d
� �� � �8 �v � �C �� � �
�� �m � �
� �� �� � � �Z �� � �� �� �w �� �{ � � � �� �$ � � �M �d �0 �r � �� � �g � �V � � � � �: �Z �� � �{ �$ �e �0 � � �$ � �
�
� �5 � �[ �� �v � � �c � �V �R �$ �; � � � �f � � �� �d � �� �W �e
� � �� � � � �
� �J � � � � �u �� � � �
� � �
�K � �2 � �L � �. � � �2 �� � � � � �� � �% � �� �� � �
� �� � �� � � � �
��
�x � �M �� �} � � �T � � �� �d �
� � �� � �` � � � � � �3 � � �; � � � � �y �Y �L � � �� �� � � � � �U �\ �� � � � �� �V �N � � ��
� � �
� �" �x �% � �; �= � � �� �2 �E � �! � �� �� �^ �� �" �w ��
�# � �� �� � � �$ �< �Q � �� �r �% � �] �� �& � �< �' � �3 �6 �B � � �( �� � �� � �� � � �g �
�
�) �
� �* �+ �! � � �� � �: � �7 � �^ � � � � �( �
�, �+ � � �x �- � �/ �h �= �. �� �� � � �V � � � �h �� � �/ � � � � �< � �� �; �0 � � �� �
� �1 �z �� � �� �5 �6 �
�_ �) �2 �3 �� �4 �y �" � �� ��
� �^ �5 � �� �? �% �+ �f
� �6 �_ �W �� � �
�7 �> � �
�g
�# �� �u �8 � �� �9 �h
�F
�� �V �{ �� �O �� �I �w �~ �
�^ � � �: � � �� � �� �� � � �; �e �1 � � � �� �� � �� � �� �� � � �P �< �= �� �> �
�� �( �` �R �? �Y � �I �� �� �� � �7 �� �
�? �� �� �
�@ �� �o � �q �Y �n � � �l � � � � �� ��
�i
�E �P �V � �!
� �� � � � �n � �A �� �| �
� �
�B � � � � � �-
� �O ��
� �C � �D �W �T �T � �� �� � �
�} �E �� �& �
� � �� �� � � �
� � �~ �G
��
�� � �$ �W � � �� �o �� �
�F � �G �� � �"
�� �� �� �#
�� �� �D �- �Q �� �H �e �� � � �I � �� � �J �z �
� �K � � �L � �$
�
� � � � �H
� �� � � �� �� �M �: �� � �� �N �� �I
�� � �� �H �� � � � �O �� � � �P �Q �� � �k �R �R �� �� �� ��
�
� �� � �� � � � �� �S �T � �� � �%
� � �� �� �� �&
�S �U � �� �S � �C �� � �� �V �~ � �! �X �� � � � � �, �� � �� �� �O �� �| � � �� �P � �e � � � � � � � � � � � �� � �T � � �� � �W �� � � �X � �Y � �R �
�v � � �
� � �= � � �Z � �U �� � �[ �� � � �V �% �\ � � �] � � �^ �8 �T �.
�'
�_ � �v � � � � �w �t � �` �a �b �> � �� �" �{ � �� � � �c �� �d �9 � � � �� �[ �9 � � �d �h �
�e � � �� �J
�! � � �f �� �� � �� � � �T �g � � � �% � �W �M �h � � �i � �� � � � �� �� � � �(
�j
� �y �7 �m � �j �k � �? �W �" �� �� � � �B � �l �| � � �)
�z � �� �
�� � � �� � � � �m � �n �u �v �w �� � �*
� � �o �p � � �q �7 �. �r �� � �
� � �
� �f � � �� �s �& �y � � � � � �� � � �
� �> � � � �� � �Y � � �t � �u �/
�+
� �v � � � �@ �w � �� �� � � �3 � �� � �,
�x �� �6 �9 �
� � � �6 �� � � �! � � �y �� �Q �: �c �
� � �-
�o � � �F �X �
�� � �f �� � �z ��
� � � �� �� �{ �/ � � �' � �b � �� �` � � � �u � �v � � � � ��
�
�
� � � �� �0 �E � �S � �8 �[ �| �} �G � � �� �! �~ � � �F �U � �
� � � �e �s � � �� �w � � � �" � �a � �Z �& � � � �� � �
� � �� �A � � �
� �i � � � � � � � � � �
�o � � � � ��
�
� � � �A � �J �0 �� �x ��
� �� � �Y � � � � � �� �� � � �Z �8 �o � �� �Q � � � � �
� � �a �Q �� � �p �; � � �P � �b �� � � � � � �� �
� � � � � �� � � � � � � � � �� �] � �� � � �
� �� � �� � �' � � �.
�� �� �
�� � � � �� �L � �� � � � � � �/
� � � � �B �0
�[ � �8 � � � � �� � � �/ �3 � �� � � �
� �� � �0 �� �n �� �� �� � �� � �� � � �� � � � � � � � � �4 � � � � �< � � �
� �� �Y � � � �� �C �� � � �
�� � �� �� �} �1 � �
� � � �K � �� �� �0
�F �� �� � ��
� �# � �\ � � �� �f � �> �
� � �
� �� � � �� � ��
� �� �� � �j � � � � � �- �p �9 �@ �6 �y � �� �� � �
�1
�� � � � � � � �V �� �� �� �� �4 �� � � �K �1
�� ��
�D �� �� �� � � � �# � � � �� �2
� � � �� �Z �H �p � �� �g �� �� � �
�q �r �
�� �� � � � � � �K
�V �
�\ �, �
� �� � � �� �] � � �u � �
� � � �� �� �� � � �Z � � �
� � �� � �j �� � �0 �h �h � �� �� � � �E � � �
� � � � � � � �� �� �� � � �� �
� � � �2
� � �� � �� � �M �� �w �� � � �y �? �� � �� �
�t �m �( �� � �+ � � �� � �� � � � �i �
� � �� � �� �
�� �L
� �� �) �
� �
� � �f �� � � � � � � �� �R �" �A �3
�� � �- �1 � �$ �
�( �� �] �� �# � �$ ��
� �� �� � �* �� � � � �
�� � �
�= �k
� �! � �
�� �� �� �� �
� �� � �_ �� �� �� �� �^ �2 � ��
� �� �� �9 � �� �� �� �� �� �4
� �� �� �
� �b � � �� � � �� � � �5 �� �� �� � �" � �
� �� � �� � �4 �I � �� �# � � � � � � �� � �j � �� � �$ �k � � �
� �\ �
�g � �E �5
�� �� �� � �� �� �� � ��
� �� �6
� �� � � �� �% � �� �� �� � �[ � �� �� �� � � � �& �e �� �� �� �� �� �o �� �� �l � �} �� �� �� �z �� �+ �� �� � � �� �� �n �- � ��
�' � �i �
�� � �� �( �� �� �� �� � � �� �� �� � �
� �� �� �� �B �i �q �� � � �< � �* �j �) �" �* �� �> �) �7
�� �+ � �� � � �� � �� �z �� �, � � �� � �M
�) �r � �� �- � �� �� �� �� �� �� �T �� �p �� �� �# �# �� � � � �� �� �� �
� � �� � � �� � � �S �� �. �8
� �� �� �� �z �9
�= �� � � �m � �S � � � � �� �x �� �� �/ �� �� �q �� � �3 �� �5 �� �:
� �
� �� �� �� � �� �� �
�;
� �0 �1 �� � � � � �n �� �_ � �] � � �n �� �� �� �� �
�% �� �� � �� � �` � �� �� �� �z �T �s �2 �3
�� �
�{ � �5 �� � � ��
�g � � �k �� �� �� � ��
� � �3 �4 � � � �c � �� � �
�
�� � �a �: �1 � �� � �! �A �h � �o ��
�6 �" � � � �l
�- �� �
�a �5 � �� � �
� � �# �! � �$ � �
� �4
�f �� � �% �& �
�N
�
�� �W � � � � � �
�' � �$ �� � �<
� �N � � �W �k � �O
�� �� � � �� �� �X �, � �6 �& �t �� �P
� � �7 �
� ��
�- �j � � �
� �C �[ �p � � �' �8 �
�b �� �m
� �
� �{ �( � �� �� �� �9 �
�� � �: �
�
�^ �� �� �� �B �; � �� � � �� �
� �� �
�� � �� �) �< �= �
� �
� �> � � � � ��
�= �� � � �� � � � � � � �n
� �H �D �
�? �� �U �W �
�=
� �: � � �N � �K �E �@ �4 �c �
� �>
� �Q
�
�A � � �h �� � �
�
�( �] �� � �� �B �* �� � �l �� �C �D �� �E �h � � �� � � �� �X � � � � �+ �� �� � �+ �J �� �� �U �� � �
�� �m � �E � � � �F � �G �
�k � �n � �
�d � � � � � �� �� �F �! � � �r �@ �� �H �" �C �G � � �� �
� �^ �
�� � �8 �t �) �; � �?
�! � �o �I �� �" �# �# �$ � �J � �% ��
�& �r �K �' �5
�( �) � �o
�@
�} �A
� �, � �* �4 �1 �+ � � � � �� �" � �, � �
�C �� �u �r �D �- �
�- � �L �v �{ �� �| �M �. �. �N �Y �6
� � � �/ �0 �/ � �� �1 �$ � �2 �% �G �R �B
�� �_ � �� �C
�� � �D
�� �3 � � � � � �� � �. �� � �4 �@ �w � �5 � �6 �7 � �i �� �& �0 �� �8 � �& �� �* � �+ �G �O �u � �# �
�1 �P �R � �Q � � �� �) �� �� �= �9 � �l � �� �� � �E
�S � �k � �\ � � � �
�y �: � �; �< �F
�% �= � �R � � �> �d �' �, �? �e �$ � �2 �3 �- � �� �4 � �( �S �@ �A �B �� �. �T � �O �
� �� �� � � �
�& � � �� �
�< �
� � � �C � �D � � �U �� �p
�G
�e �
� � � �
�E �; �V �F �' �G �) �
�� �} �H �* �� �W � � �I � �T � �
�
� �� �� �� � � � �J �. �g �~ � �U � �j � � � �X � �� �8 � �* � �� � �K �~ �� � � �L � �H �
�� � �% �� �+ �f � � � �� �t �� �M �N �� � �� � � � �
� � �k �Y � �Y �� � � �* �/ �� �O �R
�Z �H
�� �# �I �
�� �� � �5 �S
�] �E �[ �\ �
�s �I
�+ �P �Q �, � �
�R � �S �T �� �, �� �U �] �V �� �� �L �- �! � �T
�\ �4 �W � � �X �Y �Z � �[ �> �w � � � �� �+ �^ � �J
�� �_ �$ � �\ � �� � �l �. �] �` � �^ �_ �q
�% � �` �a � � �� �
�6 �g �U
�b �c �d �a �
�q �x �
�e �
�b �y � �f �h �g �h � � �' �i � � �� � �j �r � �
�0 � �= �� �b �| � � �� � � � � � �h �k ��
�l � � �
�a � �c �m �� � � �n �
� �u � � �d �e �� �s �K
�/ �o �7 � �& � �J �8 �p �q �i �j �f � �� �g � � �� �( � �` �r �s � � � � �< �F �k �f �� �� � �� �] � � �I �t �> � �u � �v � �
�� � �
�0 � �- � �w �L
� � � � � � �G �a � �
�t � � �
�S �K �x � �y �z � � �V
�� � �O �� �1 � ��
�{ �
�� � �F �y � �9 �Z �� �| �} �~ �F �� � �� ��
� �: � � � � �2 �� � � �p � �; �G � � � �h � � � � �7
�� � � � �q � �� �M
�� � � � � � � �� �� ��
� � ��
�( �8
� �N
� � �3 �� � �O
�< � � � �T � �W
� � � � � �( �� � � �1 �� � � � � � �� �u �Z � �
� �c � �j �P
�p � � �
� �� �� � �v �i �j � �
� � � � �Q
�K � � �� �' � �� � � �� �9
� � �
�� �z � � �
� � �k � � � �� �� � �2 � � �l � �� �> �= �C �' � � �> �
� �Z � � � � �m �n � �� �b � �� � � �q �? � �
� � � � �" � �
�? �
�} �� � �o �@ �> � �A � �1 � �) � � � �? �
��
� � � �x � � � � � �3 � � �h � � �l � � � �) � ��
�p � �' � � � �4 � � �
�
� � � �A �_ � �B � �L � �
�P �q �� � � �r � � � � �X
� �c �s �!
� � � �H � � �w � � � �C �D �t � � � � � � �x �
� � �/ � � � �5 �
�4 �u � �r
� � �_ � � �/ � �< � �~ �7 �y �m � � �^ �5 �n �b �
�t � � �l � � �� �6 �� � �7 �� � � � � � �v � � � � �8 �:
� �
� �0 � �1 � �w � �I � � � � � �( �� � �B �� � �4 �s ��
� � � � �
��
� � �? �C � �x � �E �H � �� �F �y �z �G � � � � �{ � � � �| � �;
�} �9 �m �H �~ �� �z � � �s
� �� �M �� �� � � �� � �m �� �� �I �� �� � �o � �� � �� � � �� �_ � �� �� �� �2 �3 �H � �* � � �
� � � �<
� �i �: �� ��
�� � � �A � �� �� �R
�� �� � � � ��
�� �"
� �� � � � �� � �
� ��
� �� �
�� �� �Q � ��
�Y
� � � � � � � �{ �K �� � � �[ � �J �� �� �N � �S
� � � � �I � � �T
�@ � ��
�� � ��
� �@ � �R � � �� �t
� � �� �J �I �� �
�� � � �� �
�U
� �m � �� � �{ � �� � �
�; �V
� � �� � � �< � � ��
�d �� �� �� �X � �� �9 �� � �6 �� �� �U � �� � � �� �L �! �=
�� �) �� �
� � �� �� � � � �� �
� �= �$ �( �v �� � �& �� �c � � � �� � �
�� �> �� �� �� �{ �" � �� �� �� �# �� �� � �� �W
� � �� �� �� �� � �$ �
�% � �� �� � �� �& �^ � �� �[ � �� �' � �� � � �� � �� �( � �� � �2 �\ �J �
�p �p �n � �u
�q �) �� � �O �>
� �
�* �X
� �� �� �+ �� � �, ��
� �� �
� � � �� �K � �
� �� �I �- � � �! � � � � � �. �D � � �J �s �#
� � ��
�� �7 � � � �/ �w � �| � � � � � �" �4 �| �, � � �� � �� � � � � � � � � �? �Y
�P �0 � �1 �Z
�Z
�
� �
� �� ��
�# �@ �2 � �| � �z � � � � �A �' � �?
�� � �� �8 � � �y �� �L �V �
�3 � �� �� �$ �� � �� �M �� �% �� � � ��
� �
�. � �4 �N � � � � �
�� � �� � � ��
�5 �9 �% � �� �� �K �Q � �� �x �6 �7 � �B � �
�O �v
�[
� � �& � ��
� �
�� � �X � �* � �\
�P �� �
�N �+ �w
� � �� � �W �C � � � �Q �D � �? �]
�� � � �^
�o �R �
�� �E � �
� �F � �' � �X � �G � �S � � �T �R � �8 �x �� �k �S � �T � � � � �� �� �D � �9 �! � � � � �( � �L �" �# �$ �% �_
� �& �J �: �U � �} � �) � �
�; �< �
�E �+ �' �
� �H �= �V �* �H �y �, �+ �W �3 �> �� � �? �( �I �, �- �`
�q � �a
� �� � �
�� �) �* �X � �+ � �O �� �Y �, �- � �. � �/ �� �� �0 �. �� �� � �1 �
�J �r �2 �3 �$
� �4 � �5 �6 �7 ��
� �b
�� �� � �} � �f �� �K �� ��
��
� � �8 �Z �9 �� �: �� ��
�c
�� �: � � �; �s �J �@ �� �� �t �; �
�/ �< �d
� � � �� �U �� �0 � �e
�= �� �f
�u �M � �� � � ��
�> � �[ � �A �L � �i �? � �
��
� �@ �A �v �B �C �\ �� �j � �[
��
�g
�D �E �� � �F � �B � �G ��
� �H �� �( �� �M �C �h
�� �I �N �J � �K �L � � �M �� �1 �2 �N � � �d �O �d �V �D �` � �# �5 �P �] �Q �E �n �
�� � � �^ �R �_ �F �S �p �i
�� �T �U � �
� �V �� �� � � �G �� � � �e �H �O � � �P �` �W �w �j
�X � � �3 �
�a � �I �Y �J �x �7 � � �� �- ��
�4 �k
� �b �Z �- � � �. �c � �[ � �r �; �� �K �5 �L �X � � � �� � �\ �] � � �6 �%
�^ �_ � �� �~ �` �l
�y �a �z �~ �� �� �b �? � �c �7 �d �
� � �e � �z �� �� �M �f �g �/ �h �| � �@ �d � � �i �N � �� � �8 �f � � �j �k � �O �P � �� �l �m �@ �n �9 � �o � � �� �� �< �s � �\
�Q �. �R �N �@ ��
� �p � �S �{ �q � �A �� �� � � �� �T �
� � � �: � �� �r ��
�s �@
�W �; �t �u � �v �w �x �y �| � � � � �z �� �� �3 �Q � �� �m � �A �{ �| � �� � �} �O �R �� � �g � � �~ �Z �
� � � � � �� �\ �m
� �} �� �< �X �� �� � � ��
� � � �
�� �Y � �� � �0 �� �� �� � �= �� � � � �L �� � � � �h � � �� �i �> �> � �/ �? �U � � �� � � �e �) �x
�t � �f �S � ��
�y
��
�n
�
� � �T � �@ �� � � � � �� � �� � �� �� � �� �z �U �g � �V �� �o
� � �6 �p
�t � � � � � �� ��
�A �� �J �V �h �Z �� �� �W �� � � � N( r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r
r!
r"
r#
r$
r%
r&
r'
r(
r)
r*
r+
r,
r-
r.
r/
r0
r1
r2
r3
r4
r5
r6
r7
r8
r9
r:
r;
r<
r=
r>
r?
r@
rA
rB
rC
rD
rE
rF
rG
rH
rI
rJ
rK
rL
rM
rN
rO
rP
rQ
rR
rS
rT
rU
rV
rW
rX
rY
rZ
r[
r\
r]
r^
r_
r`
ra
rb
rc
rd
re
rf
rg
rh
ri
rj
rk
rl
rm
rn
ro
rp
rq
rr
rs
rt
ru
rv
rw
rx
ry
rz
r{
r|
r}
r~
r
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r�
r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r )Z BIG5_TYPICAL_DISTRIBUTION_RATIOZBIG5_TABLE_SIZEZBIG5_CHAR_TO_FREQ_ORDER� r r � /usr/lib/python3.6/big5freq.py�<module>+ s� pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.pyc 0000644 00000060341 14751155147 0021105 0 ustar 00 3
���e'2 � @ s4 d�Z d�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zd�S )�� � � � �M �Z �c �d �H �m �k �e �O � �Q �f �L �^ �R �n � �l �[ �J �w �T �` �o � �s �A �E �F �B �? �D �p �g �\ �� �h �_ �V �W �G �t �� �U �] �a �q �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �i �� �� �� �� �� �� �- �� �� � � �# �+ �% �, �7 �/ �( �; �! �. �& �$ �) � �' � �" �3 �0 �1 �5 �2 �6 �9 �= �� �C �� �< �8 � � � � � � � � � � � �
� � � �
� � � � � � � � � � � �K �4 �� �* � �> �� �� �� �: � �b � � � � � � �x �N �@ �S �y �u �X �z �Y �j �I �P �v �r � g! _B�?Fz
ISO-8859-5Z Bulgairan)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1251Z BulgarianN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r( r/ r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ r rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r> r? r@ rA rB rC rD rE r� rF rG rH rI rJ rK rL rM r� r� r� r� r� r� rW rN rO rP rQ rR rS rT rU r� rV rX rY rZ r� r� r� r[ r\ r] r_ r` r^ r| r~ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r� r} r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� ( r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )Z Latin5_BulgarianCharToOrderMapZ win1251BulgarianCharToOrderMapZBulgarianLangModelZLatin5BulgarianModelZWin1251BulgarianModel� r� r� �(/usr/lib/python3.6/langbulgarianmodel.py�<module>& sV
pip/_vendor/chardet/__pycache__/escsm.cpython-36.pyc 0000644 00000016167 14751155147 0016377 0 ustar 00 3
���e) � @ s� d dl mZ dZejejdejejejejejejejejejejejejejejejejejejejdejdejdejdddejdejdddejdejdejejejejejejejf0ZdZedeedd d
�ZdZ ejdejejejejejejejejejejejejejejejejejejejejejejejejejejejejdejejejejejejejejejddejejejejejejejejejejejejejejejejejejejejejejf@Z
dZ e d e
e d d d
�Z dZ
ejdejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejejdejejejdejejejejejdejejejejejejejejejejejejejejejejejejejejejejejejejejejejfHZdZe
deeddd
�ZdZejdejejejejejejejejejejejejejejejejejejejdejejejejejejdejejejejejejejejejejejf(Zd Zedeeddd
�ZdS ) � )� MachineState� � � � � � z
HZ-GB-2312ZChinese)Z class_tableZ class_factorZ state_tableZchar_len_table�nameZlanguage� z ISO-2022-CN� � �
z ISO-2022-JPZJapanesez ISO-2022-KRZKoreanN( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r ) r r r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )
r r r r r r r r r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )r r r r r r )Zenumsr ZHZ_CLSZSTARTZERRORZITS_MEZHZ_STZHZ_CHAR_LEN_TABLEZ HZ_SM_MODELZ
ISO2022CN_CLSZ ISO2022CN_STZISO2022CN_CHAR_LEN_TABLEZISO2022CN_SM_MODELZ
ISO2022JP_CLSZ ISO2022JP_STZISO2022JP_CHAR_LEN_TABLEZISO2022JP_SM_MODELZ
ISO2022KR_CLSZ ISO2022KR_STZISO2022KR_CHAR_LEN_TABLEZISO2022KR_SM_MODEL� r r �/usr/lib/python3.6/escsm.py�<module> sp " $ $ $ pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.opt-1.pyc 0000644 00000073220 14751155147 0021712 0 ustar 00 3
���e F � @ s� d�Z d�Zd�Zd�Zd�Zd�Zd�Ze ed�d�d�d�d��Zeed�d�d�d�d��Zeed�d�d�d�d��Z eed�d�d�d�d��Z
eed�d�d�d�d��Z eed�d�d�d�d��Z d�S )�� � � � � � � � � � � � � � � �J � �K � � � � � � � � � � � � �G � �B � �A � �L � �@ � � �M �H � �E �C � �N �I � � �O � � � � � � � �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �D �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� �� � � � � � � � � � � � �
� �' � � � � � � � � � � � � � � � � �
� � � � � � � �6 �; �% �, �: �) �0 �5 �. �7 �* �< �$ �1 �& � �" �# �+ �- � �( �4 �8 �! �= �> �3 �9 �/ �? �2 �F � gl���P@�?FzKOI8-RZRussian)Zchar_to_order_mapZprecedence_matrixZtypical_positive_ratioZkeep_english_letterZ charset_nameZlanguagez windows-1251z
ISO-8859-5Z MacCyrillicZIBM866ZIBM855N( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv r r rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq r\ rr rs rt ru rv r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r� ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r� rj r\ rk rl rm rn ro rp rq rr rs rt ru rv r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv r r\ r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r9 r: r; r< r\ r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rw r� r� r� rx r� ry r� rz r� r{ r� r| r� r} r� r~ r� rT rU rV rW rX rY rZ r r� r� r� r[ r] r^ r_ r� r� r` ra rb rc rd re rf r� r� rg rh ri rj rk rl rm rn r� r� r� r� r� r� r� r� r� ro rp rq rr r� r� rs r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rt ru r� r� r� r� r� r� r� r� r� r� r� r� rv r r ( r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r
r r r
r r r r r r r r r r r r r r r r r r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r r r r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx ry r� r~ r{ r| r� r� r� r� r� r� r� r� r� r� r9 r: r; r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r] r^ r_ r` ra rb rc rd re rf rg rh ri r� r� r� r� r} r rz r� r� r� r� r� r� r� rw r� rj r\ rk rl rm rn ro rp rq rr rs rt ru rv r r ( r� rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx r� r� rx rx rx rx r� rx rx rx r| rx r| rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx r� rx r| r| r| r| r| r� r� r| rx rx rx r| rx rx rx rx rx rx rx rx rx rx r| rx rx r� r� rx rx rx rx rx rx rx rx rx r| rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx r| r| rx rx rx rx rx rx rx rx rx r| rx rx r� r� rx rx rx rx rx rx rx rx r| rx rx r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx r| rx rx rx rx rx rx rx rx rx rx rx rx rx r� r� rx rx rx rx rx rx rx rx rx rx rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx rx rx rx r| rx rx r� r� rx rx rx rx rx rx rx rx rx rx rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx r| r| r| rx r� rx rx r� rx rx rx rx r| r| rx r� r| r| r| rx rx r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx rx rx rx r| r| rx r| rx rx rx r| r� r| r| r� r� r| r| r| r| r| r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx rx r| r| r| rx r� r| r| rx rx r| r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx r� r| rx r| r| rx r| rx rx rx rx r| r| rx r� rx r| r| rx r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx r| r| rx rx rx rx rx r| rx rx rx rx r| r| r| r� rx rx rx r| r| r| r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx r| rx r| rx rx rx rx rx rx r| rx r| r| r� r� rx r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx r| r� r� rx r� r� r� r� r� r| r� r� r� r| r| r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx r| r| r| r| r� rx r| rx r| rx r| r� r| r| r� r� r� r| r� r| r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx rx rx rx rx rx rx r| r| rx r| rx rx rx r| r| r| r| r� r| r| r| r| rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx r| rx r| r| rx rx rx rx rx rx rx rx rx r� rx r| r� r� rx rx rx rx r| rx rx rx rx r| rx r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx rx r| r| rx rx r� r| r� r� rx r| rx r| rx r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� rx r� r| rx rx rx rx r| rx rx rx rx r� r| r| r� r� r| rx r| r| r| rx r| rx r| r| rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx r� r| rx r| rx r� r� r| rx rx r| r� r| rx r� r� r| rx r| r| r� r� rx r� rx r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� rx r� r| rx rx rx rx rx rx rx rx r| r� rx r| r� r� r| r| rx rx rx r| rx rx r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| r| rx rx r| r| r| rx rx r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| r| rx rx rx rx rx rx rx r� rx r| rx rx r| rx r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� rx rx rx rx rx rx r| rx rx rx r| r| r| r| rx r� rx r| rx r� r� r| r� r� r| r| r| r| r� rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r| rx rx rx rx rx r� r| r| r� rx r� r� rx r� r� rx r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| r| r� r� rx rx rx r| r| r� r| r| rx r� r� r| r� r� r| r| r� rx r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx rx rx rx r� r| r| r| r� r| r� rx rx r� r� r| r� r| r� r| r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx rx r| r� rx r| r| rx r| r� rx r| r� rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx r| rx rx rx r| r| r| rx rx r� r| r� r| r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r� r| r� r| rx rx r| r| r� r| r| rx r� r| r� r� r� r| r| rx r| r� r| r| r| r| r| rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx rx rx r� r� r� r� r� r| r| r� r� rx r� r� r� rx r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� rx rx rx r| r� r� r� r| r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| rx r| r| r| r� r| r| r| r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx r� r� r� r� r� r� r� r� r� rx r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| rx r| r| r| rx r� r| r| r| r| r| r| r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx rx r| r| r| r| rx r| r| r� r� r| r| r| r| r� r� rx r� r| r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� rx r| r| r| r| r� r| r� r| r� r| r� r� r� r| r� r| r| r� r� r| r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r| r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| r| r| r� r� r� r| rx r� r� r� r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r| rx r| r� r| r| r| r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r� r� r� r| r| r| rx r| r| r| r| r| r| r| r� r� r� r| r� r| r� r� r� r| r| r� r� r� r� r| r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r| rx rx r| r� r� r� r� r� r� r� r� r| r� r� r� rx r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx rx r� r| r| r| r| r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx rx rx r| r� r� r� r� r| r| r� r� r� r| r� r� r� rx r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| rx r| r� r� r� r| r| r| r� r� r� r| r� r� r� r� r� r� r� r� r� rx r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r| r� r� r| r| r| r| r| r| r� r| r| r� r� r� r� r� r| r| r| r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx rx r| r| r� r� r� r| r| r� r� r� r� r| r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r| rx r| r� r� r� r� r� r� r� r� r� r| r� r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� rx r| r| r| r� r� r� r| r| r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| rx r� r| r| r| r| r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r| r� r� r� r� rx r| r� r| r� r| r| r� r� r� r� r� r| r� r� r� r| r� r� r� r� r� r| r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r| r| r| r� rx r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| rx r| r| r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r� r� r| r� r| r| r| r| r| r� r| r| r� r� r� r� r� r� r| r| r| r� r| r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r| r| r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r| r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r| r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r| r� r� r| r� r| r� r� r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r| r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )
ZKOI8R_char_to_order_mapZwin1251_char_to_order_mapZlatin5_char_to_order_mapZ macCyrillic_char_to_order_mapZIBM855_char_to_order_mapZIBM866_char_to_order_mapZRussianLangModelZ
Koi8rModelZWin1251CyrillicModelZLatin5CyrillicModelZMacCyrillicModelZ Ibm866ModelZ Ibm855Model� r� r� �'/usr/lib/python3.6/langcyrillicmodel.py�<module> s
pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.opt-1.pyc 0000644 00000014135 14751155147 0021572 0 ustar 00 3
���e�$ � @ s� d dl mZmZmZ d dlmZmZmZ d dlm Z m
Z
m Z d dl m
Z
mZmZ d dlmZmZmZ G dd� de�ZG dd � d e�ZG d
d � d e�ZG d d
� d
e�ZG dd� de�ZG dd� de�ZG dd� de�ZdS )� )�EUCTW_CHAR_TO_FREQ_ORDER�EUCTW_TABLE_SIZE� EUCTW_TYPICAL_DISTRIBUTION_RATIO)�EUCKR_CHAR_TO_FREQ_ORDER�EUCKR_TABLE_SIZE� EUCKR_TYPICAL_DISTRIBUTION_RATIO)�GB2312_CHAR_TO_FREQ_ORDER�GB2312_TABLE_SIZE�!GB2312_TYPICAL_DISTRIBUTION_RATIO)�BIG5_CHAR_TO_FREQ_ORDER�BIG5_TABLE_SIZE� BIG5_TYPICAL_DISTRIBUTION_RATIO)�JIS_CHAR_TO_FREQ_ORDER�JIS_TABLE_SIZE� JIS_TYPICAL_DISTRIBUTION_RATIOc @ sL e Zd ZdZdZdZdZdd� Zdd� Zd d
� Z d d � Z
d
d� Z dd� Z dS )�CharDistributionAnalysisi g�G�z��?g{�G�z�?� c C s0 d | _ d | _d | _d | _d | _d | _| j� d S )N)�_char_to_freq_order� _table_size�typical_distribution_ratio�_done� _total_chars� _freq_chars�reset)�self� r �&/usr/lib/python3.6/chardistribution.py�__init__. s z!CharDistributionAnalysis.__init__c C s d| _ d| _d| _dS )z reset analyser, clear any stateF� N)r r r )r r r r r = s z CharDistributionAnalysis.resetc C sX |dkr| j |�}nd}|dkrT| jd7 _|| jk rTd| j| krT| jd7 _dS )z"feed a character with known length� r r i N���)� get_orderr r r r )r �charZchar_len�orderr r r �feedF s
z CharDistributionAnalysis.feedc C sT | j dks| j| jkr | jS | j | jkrN| j| j | j | j }|| jk rN|S | jS )z(return confidence based on existing datar )r r �MINIMUM_DATA_THRESHOLD�SURE_NOr �SURE_YES)r �rr r r �get_confidenceT s
z'CharDistributionAnalysis.get_confidencec C s | j | jkS )N)r �ENOUGH_DATA_THRESHOLD)r r r r �got_enough_datad s z(CharDistributionAnalysis.got_enough_datac C s dS )Nr r r )r �byte_strr r r r! i s z"CharDistributionAnalysis.get_orderN)
�__name__�
__module__� __qualname__r* r' r& r% r r r$ r) r+ r! r r r r r ( s r c s$ e Zd Z� fdd�Zdd� Z� ZS )�EUCTWDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) �superr0 r r r r r r r )r )� __class__r r r r s z"EUCTWDistributionAnalysis.__init__c C s0 |d }|dkr(d|d |d d S dS d S )Nr �� �^ r � r r )r r, �
first_charr r r r! x s z#EUCTWDistributionAnalysis.get_order)r- r. r/ r r! �
__classcell__r r )r2 r r0 q s r0 c s$ e Zd Z� fdd�Zdd� Z� ZS )�EUCKRDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 r8 r r r r r r r )r )r2 r r r � s z"EUCKRDistributionAnalysis.__init__c C s0 |d }|dkr(d|d |d d S dS d S )Nr � r4 r r5 r r )r r, r6 r r r r! � s z#EUCKRDistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r r8 � s r8 c s$ e Zd Z� fdd�Zdd� Z� ZS )�GB2312DistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 r: r r r r r r
r )r )r2 r r r � s z#GB2312DistributionAnalysis.__init__c C s> |d |d }}|dkr6|dkr6d|d | d S dS d S )Nr r r9 r5 r4 r r )r r, r6 � second_charr r r r! � s z$GB2312DistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r r: � s r: c s$ e Zd Z� fdd�Zdd� Z� ZS )�Big5DistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 r< r r r r r r
r )r )r2 r r r � s z!Big5DistributionAnalysis.__init__c C sX |d |d }}|dkrP|dkr:d|d | d d S d|d | d S ndS d S ) Nr r � r5 � �? �@ r r )r r, r6 r; r r r r! � s z"Big5DistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r r< � s r< c s$ e Zd Z� fdd�Zdd� Z� ZS )�SJISDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 rA r r r r r r r )r )r2 r r r � s z!SJISDistributionAnalysis.__init__c C sr |d |d }}|dkr0|dkr0d|d }n&|dkrR|dkrRd|d d }nd S || d }|d
krnd }|S )
Nr r � � � �� �� � r@ � r r r )r r, r6 r; r# r r r r! � s z"SJISDistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r rA � s rA c s$ e Zd Z� fdd�Zdd� Z� ZS )�EUCJPDistributionAnalysisc s$ t t| �j� t| _t| _t| _d S )N) r1 rI r r r r r r r )r )r2 r r r � s z"EUCJPDistributionAnalysis.__init__c C s0 |d }|dkr(d|d |d d S dS d S )Nr � r4 r5 r r r )r r, r" r r r r! � s z#EUCJPDistributionAnalysis.get_order)r- r. r/ r r! r7 r r )r2 r rI � s rI N) Z euctwfreqr r r Z euckrfreqr r r Z
gb2312freqr r r
Zbig5freqr r r
Zjisfreqr r r �objectr r0 r8 r: r< rA rI r r r r �<module> s I pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.pyc 0000644 00000113272 14751155147 0016566 0 ustar 00 3
���e�L � � @ s8 d`Z G dd� de�ZG dd � d e�ZG d
d � d e�Zd S )a� � � � � � c @ sP e Zd ZdZdZdZdZdZdd� Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
dS )�JapaneseContextAnalysis� r �d i� r c C s* d | _ d | _d | _d | _d | _| j� d S )N)�
_total_rel� _rel_sample�_need_to_skip_char_num�_last_char_order�_done�reset)�self� r � /usr/lib/python3.6/jpcntx.py�__init__{ s z JapaneseContextAnalysis.__init__c C s* d| _ dg| j | _d| _d| _d| _d S )Nr r F���)r
�NUM_OF_CATEGORYr r r
r )r r r r r � s
z JapaneseContextAnalysis.resetc C s� | j r
d S | j}x�||k r�| j|||d � �\}}||7 }||krV|| | _d| _q|dkr�| jdkr�| jd7 _| j| jkr�d| _ P | jt| j | d7 < || _qW d S )Nr r Tr r r )r r � get_orderr
r
�MAX_REL_THRESHOLDr �jp2CharContext)r �byte_strZ num_bytes�i�order�char_lenr r r �feed� s
z JapaneseContextAnalysis.feedc C s | j | jkS )N)r
�ENOUGH_REL_THRESHOLD)r r r r �got_enough_data� s z'JapaneseContextAnalysis.got_enough_datac C s, | j | jkr"| j | jd | j S | jS d S )Nr )r
�MINIMUM_DATA_THRESHOLDr � DONT_KNOW)r r r r �get_confidence� s z&JapaneseContextAnalysis.get_confidencec C s dS )Nr r )r r r )r r r r r r � s z!JapaneseContextAnalysis.get_orderNr )�__name__�
__module__� __qualname__r r! r r r r r r r r" r r r r r r t s r c s0 e Zd Z� fdd�Zedd� �Zdd� Z� ZS )�SJISContextAnalysisc s t t| �j� d| _d S )NZ SHIFT_JIS)�superr& r �
_charset_name)r )� __class__r r r � s z SJISContextAnalysis.__init__c C s | j S )N)r( )r r r r � charset_name� s z SJISContextAnalysis.charset_namec C s� |sdS |d }d| ko"dkn s@d| ko:dkn rld}|dksdd | ko^dkn rpd
| _ nd}t|�dkr�|d }|d kr�d| ko�d kn r�|d |fS d|fS )Nr r � � �� � r � � ZCP932�� �� r )r r r )r( �len)r r �
first_charr � second_charr r r r � s 0 z SJISContextAnalysis.get_order)r# r$ r% r �propertyr* r �
__classcell__r r )r) r r& � s r& c @ s e Zd Zdd� ZdS )�EUCJPContextAnalysisc C s� |sd S |d }|dks0d| ko*dkn r6d}n|dkrDd}nd}t |�dkr�|d }|d kr�d| kovd
kn r�|d |fS d
|fS )Nr r � � � r � r � �� r )r r r )r3 )r r r4 r r5 r r r r � s z EUCJPContextAnalysis.get_orderN)r# r$ r% r r r r r r8 � s r8 N�Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r �Sr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r )Sr? r@ rA rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR rS rT rU rV rW rX rY rZ r[ r\ r] r^ r_ r` ra rb rc rd re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry rz r{ r| r} r~ r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )r �objectr r& r8 r r r r �<module> s� C pip/_vendor/chardet/chardistribution.py 0000644 00000022303 14751155147 0014343 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .euctwfreq import (EUCTW_CHAR_TO_FREQ_ORDER, EUCTW_TABLE_SIZE,
EUCTW_TYPICAL_DISTRIBUTION_RATIO)
from .euckrfreq import (EUCKR_CHAR_TO_FREQ_ORDER, EUCKR_TABLE_SIZE,
EUCKR_TYPICAL_DISTRIBUTION_RATIO)
from .gb2312freq import (GB2312_CHAR_TO_FREQ_ORDER, GB2312_TABLE_SIZE,
GB2312_TYPICAL_DISTRIBUTION_RATIO)
from .big5freq import (BIG5_CHAR_TO_FREQ_ORDER, BIG5_TABLE_SIZE,
BIG5_TYPICAL_DISTRIBUTION_RATIO)
from .jisfreq import (JIS_CHAR_TO_FREQ_ORDER, JIS_TABLE_SIZE,
JIS_TYPICAL_DISTRIBUTION_RATIO)
class CharDistributionAnalysis(object):
ENOUGH_DATA_THRESHOLD = 1024
SURE_YES = 0.99
SURE_NO = 0.01
MINIMUM_DATA_THRESHOLD = 3
def __init__(self):
# Mapping table to get frequency order from char order (get from
# GetOrder())
self._char_to_freq_order = None
self._table_size = None # Size of above table
# This is a constant value which varies from language to language,
# used in calculating confidence. See
# http://www.mozilla.org/projects/intl/UniversalCharsetDetection.html
# for further detail.
self.typical_distribution_ratio = None
self._done = None
self._total_chars = None
self._freq_chars = None
self.reset()
def reset(self):
"""reset analyser, clear any state"""
# If this flag is set to True, detection is done and conclusion has
# been made
self._done = False
self._total_chars = 0 # Total characters encountered
# The number of characters whose frequency order is less than 512
self._freq_chars = 0
def feed(self, char, char_len):
"""feed a character with known length"""
if char_len == 2:
# we only care about 2-bytes character in our distribution analysis
order = self.get_order(char)
else:
order = -1
if order >= 0:
self._total_chars += 1
# order is valid
if order < self._table_size:
if 512 > self._char_to_freq_order[order]:
self._freq_chars += 1
def get_confidence(self):
"""return confidence based on existing data"""
# if we didn't receive any character in our consideration range,
# return negative answer
if self._total_chars <= 0 or self._freq_chars <= self.MINIMUM_DATA_THRESHOLD:
return self.SURE_NO
if self._total_chars != self._freq_chars:
r = (self._freq_chars / ((self._total_chars - self._freq_chars)
* self.typical_distribution_ratio))
if r < self.SURE_YES:
return r
# normalize confidence (we don't want to be 100% sure)
return self.SURE_YES
def got_enough_data(self):
# It is not necessary to receive all data to draw conclusion.
# For charset detection, certain amount of data is enough
return self._total_chars > self.ENOUGH_DATA_THRESHOLD
def get_order(self, byte_str):
# We do not handle characters based on the original encoding string,
# but convert this encoding string to a number, here called order.
# This allows multiple encodings of a language to share one frequency
# table.
return -1
class EUCTWDistributionAnalysis(CharDistributionAnalysis):
def __init__(self):
super(EUCTWDistributionAnalysis, self).__init__()
self._char_to_freq_order = EUCTW_CHAR_TO_FREQ_ORDER
self._table_size = EUCTW_TABLE_SIZE
self.typical_distribution_ratio = EUCTW_TYPICAL_DISTRIBUTION_RATIO
def get_order(self, byte_str):
# for euc-TW encoding, we are interested
# first byte range: 0xc4 -- 0xfe
# second byte range: 0xa1 -- 0xfe
# no validation needed here. State machine has done that
first_char = byte_str[0]
if first_char >= 0xC4:
return 94 * (first_char - 0xC4) + byte_str[1] - 0xA1
else:
return -1
class EUCKRDistributionAnalysis(CharDistributionAnalysis):
def __init__(self):
super(EUCKRDistributionAnalysis, self).__init__()
self._char_to_freq_order = EUCKR_CHAR_TO_FREQ_ORDER
self._table_size = EUCKR_TABLE_SIZE
self.typical_distribution_ratio = EUCKR_TYPICAL_DISTRIBUTION_RATIO
def get_order(self, byte_str):
# for euc-KR encoding, we are interested
# first byte range: 0xb0 -- 0xfe
# second byte range: 0xa1 -- 0xfe
# no validation needed here. State machine has done that
first_char = byte_str[0]
if first_char >= 0xB0:
return 94 * (first_char - 0xB0) + byte_str[1] - 0xA1
else:
return -1
class GB2312DistributionAnalysis(CharDistributionAnalysis):
def __init__(self):
super(GB2312DistributionAnalysis, self).__init__()
self._char_to_freq_order = GB2312_CHAR_TO_FREQ_ORDER
self._table_size = GB2312_TABLE_SIZE
self.typical_distribution_ratio = GB2312_TYPICAL_DISTRIBUTION_RATIO
def get_order(self, byte_str):
# for GB2312 encoding, we are interested
# first byte range: 0xb0 -- 0xfe
# second byte range: 0xa1 -- 0xfe
# no validation needed here. State machine has done that
first_char, second_char = byte_str[0], byte_str[1]
if (first_char >= 0xB0) and (second_char >= 0xA1):
return 94 * (first_char - 0xB0) + second_char - 0xA1
else:
return -1
class Big5DistributionAnalysis(CharDistributionAnalysis):
def __init__(self):
super(Big5DistributionAnalysis, self).__init__()
self._char_to_freq_order = BIG5_CHAR_TO_FREQ_ORDER
self._table_size = BIG5_TABLE_SIZE
self.typical_distribution_ratio = BIG5_TYPICAL_DISTRIBUTION_RATIO
def get_order(self, byte_str):
# for big5 encoding, we are interested
# first byte range: 0xa4 -- 0xfe
# second byte range: 0x40 -- 0x7e , 0xa1 -- 0xfe
# no validation needed here. State machine has done that
first_char, second_char = byte_str[0], byte_str[1]
if first_char >= 0xA4:
if second_char >= 0xA1:
return 157 * (first_char - 0xA4) + second_char - 0xA1 + 63
else:
return 157 * (first_char - 0xA4) + second_char - 0x40
else:
return -1
class SJISDistributionAnalysis(CharDistributionAnalysis):
def __init__(self):
super(SJISDistributionAnalysis, self).__init__()
self._char_to_freq_order = JIS_CHAR_TO_FREQ_ORDER
self._table_size = JIS_TABLE_SIZE
self.typical_distribution_ratio = JIS_TYPICAL_DISTRIBUTION_RATIO
def get_order(self, byte_str):
# for sjis encoding, we are interested
# first byte range: 0x81 -- 0x9f , 0xe0 -- 0xfe
# second byte range: 0x40 -- 0x7e, 0x81 -- oxfe
# no validation needed here. State machine has done that
first_char, second_char = byte_str[0], byte_str[1]
if (first_char >= 0x81) and (first_char <= 0x9F):
order = 188 * (first_char - 0x81)
elif (first_char >= 0xE0) and (first_char <= 0xEF):
order = 188 * (first_char - 0xE0 + 31)
else:
return -1
order = order + second_char - 0x40
if second_char > 0x7F:
order = -1
return order
class EUCJPDistributionAnalysis(CharDistributionAnalysis):
def __init__(self):
super(EUCJPDistributionAnalysis, self).__init__()
self._char_to_freq_order = JIS_CHAR_TO_FREQ_ORDER
self._table_size = JIS_TABLE_SIZE
self.typical_distribution_ratio = JIS_TYPICAL_DISTRIBUTION_RATIO
def get_order(self, byte_str):
# for euc-JP encoding, we are interested
# first byte range: 0xa0 -- 0xfe
# second byte range: 0xa1 -- 0xfe
# no validation needed here. State machine has done that
char = byte_str[0]
if char >= 0xA0:
return 94 * (char - 0xA1) + byte_str[1] - 0xa1
else:
return -1
pip/_vendor/chardet/sbcsgroupprober.py 0000644 00000006732 14751155147 0014217 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetgroupprober import CharSetGroupProber
from .sbcharsetprober import SingleByteCharSetProber
from .langcyrillicmodel import (Win1251CyrillicModel, Koi8rModel,
Latin5CyrillicModel, MacCyrillicModel,
Ibm866Model, Ibm855Model)
from .langgreekmodel import Latin7GreekModel, Win1253GreekModel
from .langbulgarianmodel import Latin5BulgarianModel, Win1251BulgarianModel
# from .langhungarianmodel import Latin2HungarianModel, Win1250HungarianModel
from .langthaimodel import TIS620ThaiModel
from .langhebrewmodel import Win1255HebrewModel
from .hebrewprober import HebrewProber
from .langturkishmodel import Latin5TurkishModel
class SBCSGroupProber(CharSetGroupProber):
def __init__(self):
super(SBCSGroupProber, self).__init__()
self.probers = [
SingleByteCharSetProber(Win1251CyrillicModel),
SingleByteCharSetProber(Koi8rModel),
SingleByteCharSetProber(Latin5CyrillicModel),
SingleByteCharSetProber(MacCyrillicModel),
SingleByteCharSetProber(Ibm866Model),
SingleByteCharSetProber(Ibm855Model),
SingleByteCharSetProber(Latin7GreekModel),
SingleByteCharSetProber(Win1253GreekModel),
SingleByteCharSetProber(Latin5BulgarianModel),
SingleByteCharSetProber(Win1251BulgarianModel),
# TODO: Restore Hungarian encodings (iso-8859-2 and windows-1250)
# after we retrain model.
# SingleByteCharSetProber(Latin2HungarianModel),
# SingleByteCharSetProber(Win1250HungarianModel),
SingleByteCharSetProber(TIS620ThaiModel),
SingleByteCharSetProber(Latin5TurkishModel),
]
hebrew_prober = HebrewProber()
logical_hebrew_prober = SingleByteCharSetProber(Win1255HebrewModel,
False, hebrew_prober)
visual_hebrew_prober = SingleByteCharSetProber(Win1255HebrewModel, True,
hebrew_prober)
hebrew_prober.set_model_probers(logical_hebrew_prober, visual_hebrew_prober)
self.probers.extend([hebrew_prober, logical_hebrew_prober,
visual_hebrew_prober])
self.reset()
pip/_vendor/chardet/jisfreq.py 0000644 00000062261 14751155147 0012440 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# Sampling from about 20M text materials include literature and computer technology
#
# Japanese frequency table, applied to both S-JIS and EUC-JP
# They are sorted in order.
# 128 --> 0.77094
# 256 --> 0.85710
# 512 --> 0.92635
# 1024 --> 0.97130
# 2048 --> 0.99431
#
# Ideal Distribution Ratio = 0.92635 / (1-0.92635) = 12.58
# Random Distribution Ration = 512 / (2965+62+83+86-512) = 0.191
#
# Typical Distribution Ratio, 25% of IDR
JIS_TYPICAL_DISTRIBUTION_RATIO = 3.0
# Char to FreqOrder table ,
JIS_TABLE_SIZE = 4368
JIS_CHAR_TO_FREQ_ORDER = (
40, 1, 6, 182, 152, 180, 295,2127, 285, 381,3295,4304,3068,4606,3165,3510, # 16
3511,1822,2785,4607,1193,2226,5070,4608, 171,2996,1247, 18, 179,5071, 856,1661, # 32
1262,5072, 619, 127,3431,3512,3230,1899,1700, 232, 228,1294,1298, 284, 283,2041, # 48
2042,1061,1062, 48, 49, 44, 45, 433, 434,1040,1041, 996, 787,2997,1255,4305, # 64
2108,4609,1684,1648,5073,5074,5075,5076,5077,5078,3687,5079,4610,5080,3927,3928, # 80
5081,3296,3432, 290,2285,1471,2187,5082,2580,2825,1303,2140,1739,1445,2691,3375, # 96
1691,3297,4306,4307,4611, 452,3376,1182,2713,3688,3069,4308,5083,5084,5085,5086, # 112
5087,5088,5089,5090,5091,5092,5093,5094,5095,5096,5097,5098,5099,5100,5101,5102, # 128
5103,5104,5105,5106,5107,5108,5109,5110,5111,5112,4097,5113,5114,5115,5116,5117, # 144
5118,5119,5120,5121,5122,5123,5124,5125,5126,5127,5128,5129,5130,5131,5132,5133, # 160
5134,5135,5136,5137,5138,5139,5140,5141,5142,5143,5144,5145,5146,5147,5148,5149, # 176
5150,5151,5152,4612,5153,5154,5155,5156,5157,5158,5159,5160,5161,5162,5163,5164, # 192
5165,5166,5167,5168,5169,5170,5171,5172,5173,5174,5175,1472, 598, 618, 820,1205, # 208
1309,1412,1858,1307,1692,5176,5177,5178,5179,5180,5181,5182,1142,1452,1234,1172, # 224
1875,2043,2149,1793,1382,2973, 925,2404,1067,1241, 960,1377,2935,1491, 919,1217, # 240
1865,2030,1406,1499,2749,4098,5183,5184,5185,5186,5187,5188,2561,4099,3117,1804, # 256
2049,3689,4309,3513,1663,5189,3166,3118,3298,1587,1561,3433,5190,3119,1625,2998, # 272
3299,4613,1766,3690,2786,4614,5191,5192,5193,5194,2161, 26,3377, 2,3929, 20, # 288
3691, 47,4100, 50, 17, 16, 35, 268, 27, 243, 42, 155, 24, 154, 29, 184, # 304
4, 91, 14, 92, 53, 396, 33, 289, 9, 37, 64, 620, 21, 39, 321, 5, # 320
12, 11, 52, 13, 3, 208, 138, 0, 7, 60, 526, 141, 151,1069, 181, 275, # 336
1591, 83, 132,1475, 126, 331, 829, 15, 69, 160, 59, 22, 157, 55,1079, 312, # 352
109, 38, 23, 25, 10, 19, 79,5195, 61, 382,1124, 8, 30,5196,5197,5198, # 368
5199,5200,5201,5202,5203,5204,5205,5206, 89, 62, 74, 34,2416, 112, 139, 196, # 384
271, 149, 84, 607, 131, 765, 46, 88, 153, 683, 76, 874, 101, 258, 57, 80, # 400
32, 364, 121,1508, 169,1547, 68, 235, 145,2999, 41, 360,3027, 70, 63, 31, # 416
43, 259, 262,1383, 99, 533, 194, 66, 93, 846, 217, 192, 56, 106, 58, 565, # 432
280, 272, 311, 256, 146, 82, 308, 71, 100, 128, 214, 655, 110, 261, 104,1140, # 448
54, 51, 36, 87, 67,3070, 185,2618,2936,2020, 28,1066,2390,2059,5207,5208, # 464
5209,5210,5211,5212,5213,5214,5215,5216,4615,5217,5218,5219,5220,5221,5222,5223, # 480
5224,5225,5226,5227,5228,5229,5230,5231,5232,5233,5234,5235,5236,3514,5237,5238, # 496
5239,5240,5241,5242,5243,5244,2297,2031,4616,4310,3692,5245,3071,5246,3598,5247, # 512
4617,3231,3515,5248,4101,4311,4618,3808,4312,4102,5249,4103,4104,3599,5250,5251, # 528
5252,5253,5254,5255,5256,5257,5258,5259,5260,5261,5262,5263,5264,5265,5266,5267, # 544
5268,5269,5270,5271,5272,5273,5274,5275,5276,5277,5278,5279,5280,5281,5282,5283, # 560
5284,5285,5286,5287,5288,5289,5290,5291,5292,5293,5294,5295,5296,5297,5298,5299, # 576
5300,5301,5302,5303,5304,5305,5306,5307,5308,5309,5310,5311,5312,5313,5314,5315, # 592
5316,5317,5318,5319,5320,5321,5322,5323,5324,5325,5326,5327,5328,5329,5330,5331, # 608
5332,5333,5334,5335,5336,5337,5338,5339,5340,5341,5342,5343,5344,5345,5346,5347, # 624
5348,5349,5350,5351,5352,5353,5354,5355,5356,5357,5358,5359,5360,5361,5362,5363, # 640
5364,5365,5366,5367,5368,5369,5370,5371,5372,5373,5374,5375,5376,5377,5378,5379, # 656
5380,5381, 363, 642,2787,2878,2788,2789,2316,3232,2317,3434,2011, 165,1942,3930, # 672
3931,3932,3933,5382,4619,5383,4620,5384,5385,5386,5387,5388,5389,5390,5391,5392, # 688
5393,5394,5395,5396,5397,5398,5399,5400,5401,5402,5403,5404,5405,5406,5407,5408, # 704
5409,5410,5411,5412,5413,5414,5415,5416,5417,5418,5419,5420,5421,5422,5423,5424, # 720
5425,5426,5427,5428,5429,5430,5431,5432,5433,5434,5435,5436,5437,5438,5439,5440, # 736
5441,5442,5443,5444,5445,5446,5447,5448,5449,5450,5451,5452,5453,5454,5455,5456, # 752
5457,5458,5459,5460,5461,5462,5463,5464,5465,5466,5467,5468,5469,5470,5471,5472, # 768
5473,5474,5475,5476,5477,5478,5479,5480,5481,5482,5483,5484,5485,5486,5487,5488, # 784
5489,5490,5491,5492,5493,5494,5495,5496,5497,5498,5499,5500,5501,5502,5503,5504, # 800
5505,5506,5507,5508,5509,5510,5511,5512,5513,5514,5515,5516,5517,5518,5519,5520, # 816
5521,5522,5523,5524,5525,5526,5527,5528,5529,5530,5531,5532,5533,5534,5535,5536, # 832
5537,5538,5539,5540,5541,5542,5543,5544,5545,5546,5547,5548,5549,5550,5551,5552, # 848
5553,5554,5555,5556,5557,5558,5559,5560,5561,5562,5563,5564,5565,5566,5567,5568, # 864
5569,5570,5571,5572,5573,5574,5575,5576,5577,5578,5579,5580,5581,5582,5583,5584, # 880
5585,5586,5587,5588,5589,5590,5591,5592,5593,5594,5595,5596,5597,5598,5599,5600, # 896
5601,5602,5603,5604,5605,5606,5607,5608,5609,5610,5611,5612,5613,5614,5615,5616, # 912
5617,5618,5619,5620,5621,5622,5623,5624,5625,5626,5627,5628,5629,5630,5631,5632, # 928
5633,5634,5635,5636,5637,5638,5639,5640,5641,5642,5643,5644,5645,5646,5647,5648, # 944
5649,5650,5651,5652,5653,5654,5655,5656,5657,5658,5659,5660,5661,5662,5663,5664, # 960
5665,5666,5667,5668,5669,5670,5671,5672,5673,5674,5675,5676,5677,5678,5679,5680, # 976
5681,5682,5683,5684,5685,5686,5687,5688,5689,5690,5691,5692,5693,5694,5695,5696, # 992
5697,5698,5699,5700,5701,5702,5703,5704,5705,5706,5707,5708,5709,5710,5711,5712, # 1008
5713,5714,5715,5716,5717,5718,5719,5720,5721,5722,5723,5724,5725,5726,5727,5728, # 1024
5729,5730,5731,5732,5733,5734,5735,5736,5737,5738,5739,5740,5741,5742,5743,5744, # 1040
5745,5746,5747,5748,5749,5750,5751,5752,5753,5754,5755,5756,5757,5758,5759,5760, # 1056
5761,5762,5763,5764,5765,5766,5767,5768,5769,5770,5771,5772,5773,5774,5775,5776, # 1072
5777,5778,5779,5780,5781,5782,5783,5784,5785,5786,5787,5788,5789,5790,5791,5792, # 1088
5793,5794,5795,5796,5797,5798,5799,5800,5801,5802,5803,5804,5805,5806,5807,5808, # 1104
5809,5810,5811,5812,5813,5814,5815,5816,5817,5818,5819,5820,5821,5822,5823,5824, # 1120
5825,5826,5827,5828,5829,5830,5831,5832,5833,5834,5835,5836,5837,5838,5839,5840, # 1136
5841,5842,5843,5844,5845,5846,5847,5848,5849,5850,5851,5852,5853,5854,5855,5856, # 1152
5857,5858,5859,5860,5861,5862,5863,5864,5865,5866,5867,5868,5869,5870,5871,5872, # 1168
5873,5874,5875,5876,5877,5878,5879,5880,5881,5882,5883,5884,5885,5886,5887,5888, # 1184
5889,5890,5891,5892,5893,5894,5895,5896,5897,5898,5899,5900,5901,5902,5903,5904, # 1200
5905,5906,5907,5908,5909,5910,5911,5912,5913,5914,5915,5916,5917,5918,5919,5920, # 1216
5921,5922,5923,5924,5925,5926,5927,5928,5929,5930,5931,5932,5933,5934,5935,5936, # 1232
5937,5938,5939,5940,5941,5942,5943,5944,5945,5946,5947,5948,5949,5950,5951,5952, # 1248
5953,5954,5955,5956,5957,5958,5959,5960,5961,5962,5963,5964,5965,5966,5967,5968, # 1264
5969,5970,5971,5972,5973,5974,5975,5976,5977,5978,5979,5980,5981,5982,5983,5984, # 1280
5985,5986,5987,5988,5989,5990,5991,5992,5993,5994,5995,5996,5997,5998,5999,6000, # 1296
6001,6002,6003,6004,6005,6006,6007,6008,6009,6010,6011,6012,6013,6014,6015,6016, # 1312
6017,6018,6019,6020,6021,6022,6023,6024,6025,6026,6027,6028,6029,6030,6031,6032, # 1328
6033,6034,6035,6036,6037,6038,6039,6040,6041,6042,6043,6044,6045,6046,6047,6048, # 1344
6049,6050,6051,6052,6053,6054,6055,6056,6057,6058,6059,6060,6061,6062,6063,6064, # 1360
6065,6066,6067,6068,6069,6070,6071,6072,6073,6074,6075,6076,6077,6078,6079,6080, # 1376
6081,6082,6083,6084,6085,6086,6087,6088,6089,6090,6091,6092,6093,6094,6095,6096, # 1392
6097,6098,6099,6100,6101,6102,6103,6104,6105,6106,6107,6108,6109,6110,6111,6112, # 1408
6113,6114,2044,2060,4621, 997,1235, 473,1186,4622, 920,3378,6115,6116, 379,1108, # 1424
4313,2657,2735,3934,6117,3809, 636,3233, 573,1026,3693,3435,2974,3300,2298,4105, # 1440
854,2937,2463, 393,2581,2417, 539, 752,1280,2750,2480, 140,1161, 440, 708,1569, # 1456
665,2497,1746,1291,1523,3000, 164,1603, 847,1331, 537,1997, 486, 508,1693,2418, # 1472
1970,2227, 878,1220, 299,1030, 969, 652,2751, 624,1137,3301,2619, 65,3302,2045, # 1488
1761,1859,3120,1930,3694,3516, 663,1767, 852, 835,3695, 269, 767,2826,2339,1305, # 1504
896,1150, 770,1616,6118, 506,1502,2075,1012,2519, 775,2520,2975,2340,2938,4314, # 1520
3028,2086,1224,1943,2286,6119,3072,4315,2240,1273,1987,3935,1557, 175, 597, 985, # 1536
3517,2419,2521,1416,3029, 585, 938,1931,1007,1052,1932,1685,6120,3379,4316,4623, # 1552
804, 599,3121,1333,2128,2539,1159,1554,2032,3810, 687,2033,2904, 952, 675,1467, # 1568
3436,6121,2241,1096,1786,2440,1543,1924, 980,1813,2228, 781,2692,1879, 728,1918, # 1584
3696,4624, 548,1950,4625,1809,1088,1356,3303,2522,1944, 502, 972, 373, 513,2827, # 1600
586,2377,2391,1003,1976,1631,6122,2464,1084, 648,1776,4626,2141, 324, 962,2012, # 1616
2177,2076,1384, 742,2178,1448,1173,1810, 222, 102, 301, 445, 125,2420, 662,2498, # 1632
277, 200,1476,1165,1068, 224,2562,1378,1446, 450,1880, 659, 791, 582,4627,2939, # 1648
3936,1516,1274, 555,2099,3697,1020,1389,1526,3380,1762,1723,1787,2229, 412,2114, # 1664
1900,2392,3518, 512,2597, 427,1925,2341,3122,1653,1686,2465,2499, 697, 330, 273, # 1680
380,2162, 951, 832, 780, 991,1301,3073, 965,2270,3519, 668,2523,2636,1286, 535, # 1696
1407, 518, 671, 957,2658,2378, 267, 611,2197,3030,6123, 248,2299, 967,1799,2356, # 1712
850,1418,3437,1876,1256,1480,2828,1718,6124,6125,1755,1664,2405,6126,4628,2879, # 1728
2829, 499,2179, 676,4629, 557,2329,2214,2090, 325,3234, 464, 811,3001, 992,2342, # 1744
2481,1232,1469, 303,2242, 466,1070,2163, 603,1777,2091,4630,2752,4631,2714, 322, # 1760
2659,1964,1768, 481,2188,1463,2330,2857,3600,2092,3031,2421,4632,2318,2070,1849, # 1776
2598,4633,1302,2254,1668,1701,2422,3811,2905,3032,3123,2046,4106,1763,1694,4634, # 1792
1604, 943,1724,1454, 917, 868,2215,1169,2940, 552,1145,1800,1228,1823,1955, 316, # 1808
1080,2510, 361,1807,2830,4107,2660,3381,1346,1423,1134,4108,6127, 541,1263,1229, # 1824
1148,2540, 545, 465,1833,2880,3438,1901,3074,2482, 816,3937, 713,1788,2500, 122, # 1840
1575, 195,1451,2501,1111,6128, 859, 374,1225,2243,2483,4317, 390,1033,3439,3075, # 1856
2524,1687, 266, 793,1440,2599, 946, 779, 802, 507, 897,1081, 528,2189,1292, 711, # 1872
1866,1725,1167,1640, 753, 398,2661,1053, 246, 348,4318, 137,1024,3440,1600,2077, # 1888
2129, 825,4319, 698, 238, 521, 187,2300,1157,2423,1641,1605,1464,1610,1097,2541, # 1904
1260,1436, 759,2255,1814,2150, 705,3235, 409,2563,3304, 561,3033,2005,2564, 726, # 1920
1956,2343,3698,4109, 949,3812,3813,3520,1669, 653,1379,2525, 881,2198, 632,2256, # 1936
1027, 778,1074, 733,1957, 514,1481,2466, 554,2180, 702,3938,1606,1017,1398,6129, # 1952
1380,3521, 921, 993,1313, 594, 449,1489,1617,1166, 768,1426,1360, 495,1794,3601, # 1968
1177,3602,1170,4320,2344, 476, 425,3167,4635,3168,1424, 401,2662,1171,3382,1998, # 1984
1089,4110, 477,3169, 474,6130,1909, 596,2831,1842, 494, 693,1051,1028,1207,3076, # 2000
606,2115, 727,2790,1473,1115, 743,3522, 630, 805,1532,4321,2021, 366,1057, 838, # 2016
684,1114,2142,4322,2050,1492,1892,1808,2271,3814,2424,1971,1447,1373,3305,1090, # 2032
1536,3939,3523,3306,1455,2199, 336, 369,2331,1035, 584,2393, 902, 718,2600,6131, # 2048
2753, 463,2151,1149,1611,2467, 715,1308,3124,1268, 343,1413,3236,1517,1347,2663, # 2064
2093,3940,2022,1131,1553,2100,2941,1427,3441,2942,1323,2484,6132,1980, 872,2368, # 2080
2441,2943, 320,2369,2116,1082, 679,1933,3941,2791,3815, 625,1143,2023, 422,2200, # 2096
3816,6133, 730,1695, 356,2257,1626,2301,2858,2637,1627,1778, 937, 883,2906,2693, # 2112
3002,1769,1086, 400,1063,1325,3307,2792,4111,3077, 456,2345,1046, 747,6134,1524, # 2128
884,1094,3383,1474,2164,1059, 974,1688,2181,2258,1047, 345,1665,1187, 358, 875, # 2144
3170, 305, 660,3524,2190,1334,1135,3171,1540,1649,2542,1527, 927, 968,2793, 885, # 2160
1972,1850, 482, 500,2638,1218,1109,1085,2543,1654,2034, 876, 78,2287,1482,1277, # 2176
861,1675,1083,1779, 724,2754, 454, 397,1132,1612,2332, 893, 672,1237, 257,2259, # 2192
2370, 135,3384, 337,2244, 547, 352, 340, 709,2485,1400, 788,1138,2511, 540, 772, # 2208
1682,2260,2272,2544,2013,1843,1902,4636,1999,1562,2288,4637,2201,1403,1533, 407, # 2224
576,3308,1254,2071, 978,3385, 170, 136,1201,3125,2664,3172,2394, 213, 912, 873, # 2240
3603,1713,2202, 699,3604,3699, 813,3442, 493, 531,1054, 468,2907,1483, 304, 281, # 2256
4112,1726,1252,2094, 339,2319,2130,2639, 756,1563,2944, 748, 571,2976,1588,2425, # 2272
2715,1851,1460,2426,1528,1392,1973,3237, 288,3309, 685,3386, 296, 892,2716,2216, # 2288
1570,2245, 722,1747,2217, 905,3238,1103,6135,1893,1441,1965, 251,1805,2371,3700, # 2304
2601,1919,1078, 75,2182,1509,1592,1270,2640,4638,2152,6136,3310,3817, 524, 706, # 2320
1075, 292,3818,1756,2602, 317, 98,3173,3605,3525,1844,2218,3819,2502, 814, 567, # 2336
385,2908,1534,6137, 534,1642,3239, 797,6138,1670,1529, 953,4323, 188,1071, 538, # 2352
178, 729,3240,2109,1226,1374,2000,2357,2977, 731,2468,1116,2014,2051,6139,1261, # 2368
1593, 803,2859,2736,3443, 556, 682, 823,1541,6140,1369,2289,1706,2794, 845, 462, # 2384
2603,2665,1361, 387, 162,2358,1740, 739,1770,1720,1304,1401,3241,1049, 627,1571, # 2400
2427,3526,1877,3942,1852,1500, 431,1910,1503, 677, 297,2795, 286,1433,1038,1198, # 2416
2290,1133,1596,4113,4639,2469,1510,1484,3943,6141,2442, 108, 712,4640,2372, 866, # 2432
3701,2755,3242,1348, 834,1945,1408,3527,2395,3243,1811, 824, 994,1179,2110,1548, # 2448
1453, 790,3003, 690,4324,4325,2832,2909,3820,1860,3821, 225,1748, 310, 346,1780, # 2464
2470, 821,1993,2717,2796, 828, 877,3528,2860,2471,1702,2165,2910,2486,1789, 453, # 2480
359,2291,1676, 73,1164,1461,1127,3311, 421, 604, 314,1037, 589, 116,2487, 737, # 2496
837,1180, 111, 244, 735,6142,2261,1861,1362, 986, 523, 418, 581,2666,3822, 103, # 2512
855, 503,1414,1867,2488,1091, 657,1597, 979, 605,1316,4641,1021,2443,2078,2001, # 2528
1209, 96, 587,2166,1032, 260,1072,2153, 173, 94, 226,3244, 819,2006,4642,4114, # 2544
2203, 231,1744, 782, 97,2667, 786,3387, 887, 391, 442,2219,4326,1425,6143,2694, # 2560
633,1544,1202, 483,2015, 592,2052,1958,2472,1655, 419, 129,4327,3444,3312,1714, # 2576
1257,3078,4328,1518,1098, 865,1310,1019,1885,1512,1734, 469,2444, 148, 773, 436, # 2592
1815,1868,1128,1055,4329,1245,2756,3445,2154,1934,1039,4643, 579,1238, 932,2320, # 2608
353, 205, 801, 115,2428, 944,2321,1881, 399,2565,1211, 678, 766,3944, 335,2101, # 2624
1459,1781,1402,3945,2737,2131,1010, 844, 981,1326,1013, 550,1816,1545,2620,1335, # 2640
1008, 371,2881, 936,1419,1613,3529,1456,1395,2273,1834,2604,1317,2738,2503, 416, # 2656
1643,4330, 806,1126, 229, 591,3946,1314,1981,1576,1837,1666, 347,1790, 977,3313, # 2672
764,2861,1853, 688,2429,1920,1462, 77, 595, 415,2002,3034, 798,1192,4115,6144, # 2688
2978,4331,3035,2695,2582,2072,2566, 430,2430,1727, 842,1396,3947,3702, 613, 377, # 2704
278, 236,1417,3388,3314,3174, 757,1869, 107,3530,6145,1194, 623,2262, 207,1253, # 2720
2167,3446,3948, 492,1117,1935, 536,1838,2757,1246,4332, 696,2095,2406,1393,1572, # 2736
3175,1782, 583, 190, 253,1390,2230, 830,3126,3389, 934,3245,1703,1749,2979,1870, # 2752
2545,1656,2204, 869,2346,4116,3176,1817, 496,1764,4644, 942,1504, 404,1903,1122, # 2768
1580,3606,2945,1022, 515, 372,1735, 955,2431,3036,6146,2797,1110,2302,2798, 617, # 2784
6147, 441, 762,1771,3447,3607,3608,1904, 840,3037, 86, 939,1385, 572,1370,2445, # 2800
1336, 114,3703, 898, 294, 203,3315, 703,1583,2274, 429, 961,4333,1854,1951,3390, # 2816
2373,3704,4334,1318,1381, 966,1911,2322,1006,1155, 309, 989, 458,2718,1795,1372, # 2832
1203, 252,1689,1363,3177, 517,1936, 168,1490, 562, 193,3823,1042,4117,1835, 551, # 2848
470,4645, 395, 489,3448,1871,1465,2583,2641, 417,1493, 279,1295, 511,1236,1119, # 2864
72,1231,1982,1812,3004, 871,1564, 984,3449,1667,2696,2096,4646,2347,2833,1673, # 2880
3609, 695,3246,2668, 807,1183,4647, 890, 388,2333,1801,1457,2911,1765,1477,1031, # 2896
3316,3317,1278,3391,2799,2292,2526, 163,3450,4335,2669,1404,1802,6148,2323,2407, # 2912
1584,1728,1494,1824,1269, 298, 909,3318,1034,1632, 375, 776,1683,2061, 291, 210, # 2928
1123, 809,1249,1002,2642,3038, 206,1011,2132, 144, 975, 882,1565, 342, 667, 754, # 2944
1442,2143,1299,2303,2062, 447, 626,2205,1221,2739,2912,1144,1214,2206,2584, 760, # 2960
1715, 614, 950,1281,2670,2621, 810, 577,1287,2546,4648, 242,2168, 250,2643, 691, # 2976
123,2644, 647, 313,1029, 689,1357,2946,1650, 216, 771,1339,1306, 808,2063, 549, # 2992
913,1371,2913,2914,6149,1466,1092,1174,1196,1311,2605,2396,1783,1796,3079, 406, # 3008
2671,2117,3949,4649, 487,1825,2220,6150,2915, 448,2348,1073,6151,2397,1707, 130, # 3024
900,1598, 329, 176,1959,2527,1620,6152,2275,4336,3319,1983,2191,3705,3610,2155, # 3040
3706,1912,1513,1614,6153,1988, 646, 392,2304,1589,3320,3039,1826,1239,1352,1340, # 3056
2916, 505,2567,1709,1437,2408,2547, 906,6154,2672, 384,1458,1594,1100,1329, 710, # 3072
423,3531,2064,2231,2622,1989,2673,1087,1882, 333, 841,3005,1296,2882,2379, 580, # 3088
1937,1827,1293,2585, 601, 574, 249,1772,4118,2079,1120, 645, 901,1176,1690, 795, # 3104
2207, 478,1434, 516,1190,1530, 761,2080, 930,1264, 355, 435,1552, 644,1791, 987, # 3120
220,1364,1163,1121,1538, 306,2169,1327,1222, 546,2645, 218, 241, 610,1704,3321, # 3136
1984,1839,1966,2528, 451,6155,2586,3707,2568, 907,3178, 254,2947, 186,1845,4650, # 3152
745, 432,1757, 428,1633, 888,2246,2221,2489,3611,2118,1258,1265, 956,3127,1784, # 3168
4337,2490, 319, 510, 119, 457,3612, 274,2035,2007,4651,1409,3128, 970,2758, 590, # 3184
2800, 661,2247,4652,2008,3950,1420,1549,3080,3322,3951,1651,1375,2111, 485,2491, # 3200
1429,1156,6156,2548,2183,1495, 831,1840,2529,2446, 501,1657, 307,1894,3247,1341, # 3216
666, 899,2156,1539,2549,1559, 886, 349,2208,3081,2305,1736,3824,2170,2759,1014, # 3232
1913,1386, 542,1397,2948, 490, 368, 716, 362, 159, 282,2569,1129,1658,1288,1750, # 3248
2674, 276, 649,2016, 751,1496, 658,1818,1284,1862,2209,2087,2512,3451, 622,2834, # 3264
376, 117,1060,2053,1208,1721,1101,1443, 247,1250,3179,1792,3952,2760,2398,3953, # 3280
6157,2144,3708, 446,2432,1151,2570,3452,2447,2761,2835,1210,2448,3082, 424,2222, # 3296
1251,2449,2119,2836, 504,1581,4338, 602, 817, 857,3825,2349,2306, 357,3826,1470, # 3312
1883,2883, 255, 958, 929,2917,3248, 302,4653,1050,1271,1751,2307,1952,1430,2697, # 3328
2719,2359, 354,3180, 777, 158,2036,4339,1659,4340,4654,2308,2949,2248,1146,2232, # 3344
3532,2720,1696,2623,3827,6158,3129,1550,2698,1485,1297,1428, 637, 931,2721,2145, # 3360
914,2550,2587, 81,2450, 612, 827,2646,1242,4655,1118,2884, 472,1855,3181,3533, # 3376
3534, 569,1353,2699,1244,1758,2588,4119,2009,2762,2171,3709,1312,1531,6159,1152, # 3392
1938, 134,1830, 471,3710,2276,1112,1535,3323,3453,3535, 982,1337,2950, 488, 826, # 3408
674,1058,1628,4120,2017, 522,2399, 211, 568,1367,3454, 350, 293,1872,1139,3249, # 3424
1399,1946,3006,1300,2360,3324, 588, 736,6160,2606, 744, 669,3536,3828,6161,1358, # 3440
199, 723, 848, 933, 851,1939,1505,1514,1338,1618,1831,4656,1634,3613, 443,2740, # 3456
3829, 717,1947, 491,1914,6162,2551,1542,4121,1025,6163,1099,1223, 198,3040,2722, # 3472
370, 410,1905,2589, 998,1248,3182,2380, 519,1449,4122,1710, 947, 928,1153,4341, # 3488
2277, 344,2624,1511, 615, 105, 161,1212,1076,1960,3130,2054,1926,1175,1906,2473, # 3504
414,1873,2801,6164,2309, 315,1319,3325, 318,2018,2146,2157, 963, 631, 223,4342, # 3520
4343,2675, 479,3711,1197,2625,3712,2676,2361,6165,4344,4123,6166,2451,3183,1886, # 3536
2184,1674,1330,1711,1635,1506, 799, 219,3250,3083,3954,1677,3713,3326,2081,3614, # 3552
1652,2073,4657,1147,3041,1752, 643,1961, 147,1974,3955,6167,1716,2037, 918,3007, # 3568
1994, 120,1537, 118, 609,3184,4345, 740,3455,1219, 332,1615,3830,6168,1621,2980, # 3584
1582, 783, 212, 553,2350,3714,1349,2433,2082,4124, 889,6169,2310,1275,1410, 973, # 3600
166,1320,3456,1797,1215,3185,2885,1846,2590,2763,4658, 629, 822,3008, 763, 940, # 3616
1990,2862, 439,2409,1566,1240,1622, 926,1282,1907,2764, 654,2210,1607, 327,1130, # 3632
3956,1678,1623,6170,2434,2192, 686, 608,3831,3715, 903,3957,3042,6171,2741,1522, # 3648
1915,1105,1555,2552,1359, 323,3251,4346,3457, 738,1354,2553,2311,2334,1828,2003, # 3664
3832,1753,2351,1227,6172,1887,4125,1478,6173,2410,1874,1712,1847, 520,1204,2607, # 3680
264,4659, 836,2677,2102, 600,4660,3833,2278,3084,6174,4347,3615,1342, 640, 532, # 3696
543,2608,1888,2400,2591,1009,4348,1497, 341,1737,3616,2723,1394, 529,3252,1321, # 3712
983,4661,1515,2120, 971,2592, 924, 287,1662,3186,4349,2700,4350,1519, 908,1948, # 3728
2452, 156, 796,1629,1486,2223,2055, 694,4126,1259,1036,3392,1213,2249,2742,1889, # 3744
1230,3958,1015, 910, 408, 559,3617,4662, 746, 725, 935,4663,3959,3009,1289, 563, # 3760
867,4664,3960,1567,2981,2038,2626, 988,2263,2381,4351, 143,2374, 704,1895,6175, # 3776
1188,3716,2088, 673,3085,2362,4352, 484,1608,1921,2765,2918, 215, 904,3618,3537, # 3792
894, 509, 976,3043,2701,3961,4353,2837,2982, 498,6176,6177,1102,3538,1332,3393, # 3808
1487,1636,1637, 233, 245,3962, 383, 650, 995,3044, 460,1520,1206,2352, 749,3327, # 3824
530, 700, 389,1438,1560,1773,3963,2264, 719,2951,2724,3834, 870,1832,1644,1000, # 3840
839,2474,3717, 197,1630,3394, 365,2886,3964,1285,2133, 734, 922, 818,1106, 732, # 3856
480,2083,1774,3458, 923,2279,1350, 221,3086, 85,2233,2234,3835,1585,3010,2147, # 3872
1387,1705,2382,1619,2475, 133, 239,2802,1991,1016,2084,2383, 411,2838,1113, 651, # 3888
1985,1160,3328, 990,1863,3087,1048,1276,2647, 265,2627,1599,3253,2056, 150, 638, # 3904
2019, 656, 853, 326,1479, 680,1439,4354,1001,1759, 413,3459,3395,2492,1431, 459, # 3920
4355,1125,3329,2265,1953,1450,2065,2863, 849, 351,2678,3131,3254,3255,1104,1577, # 3936
227,1351,1645,2453,2193,1421,2887, 812,2121, 634, 95,2435, 201,2312,4665,1646, # 3952
1671,2743,1601,2554,2702,2648,2280,1315,1366,2089,3132,1573,3718,3965,1729,1189, # 3968
328,2679,1077,1940,1136, 558,1283, 964,1195, 621,2074,1199,1743,3460,3619,1896, # 3984
1916,1890,3836,2952,1154,2112,1064, 862, 378,3011,2066,2113,2803,1568,2839,6178, # 4000
3088,2919,1941,1660,2004,1992,2194, 142, 707,1590,1708,1624,1922,1023,1836,1233, # 4016
1004,2313, 789, 741,3620,6179,1609,2411,1200,4127,3719,3720,4666,2057,3721, 593, # 4032
2840, 367,2920,1878,6180,3461,1521, 628,1168, 692,2211,2649, 300, 720,2067,2571, # 4048
2953,3396, 959,2504,3966,3539,3462,1977, 701,6181, 954,1043, 800, 681, 183,3722, # 4064
1803,1730,3540,4128,2103, 815,2314, 174, 467, 230,2454,1093,2134, 755,3541,3397, # 4080
1141,1162,6182,1738,2039, 270,3256,2513,1005,1647,2185,3837, 858,1679,1897,1719, # 4096
2954,2324,1806, 402, 670, 167,4129,1498,2158,2104, 750,6183, 915, 189,1680,1551, # 4112
455,4356,1501,2455, 405,1095,2955, 338,1586,1266,1819, 570, 641,1324, 237,1556, # 4128
2650,1388,3723,6184,1368,2384,1343,1978,3089,2436, 879,3724, 792,1191, 758,3012, # 4144
1411,2135,1322,4357, 240,4667,1848,3725,1574,6185, 420,3045,1546,1391, 714,4358, # 4160
1967, 941,1864, 863, 664, 426, 560,1731,2680,1785,2864,1949,2363, 403,3330,1415, # 4176
1279,2136,1697,2335, 204, 721,2097,3838, 90,6186,2085,2505, 191,3967, 124,2148, # 4192
1376,1798,1178,1107,1898,1405, 860,4359,1243,1272,2375,2983,1558,2456,1638, 113, # 4208
3621, 578,1923,2609, 880, 386,4130, 784,2186,2266,1422,2956,2172,1722, 497, 263, # 4224
2514,1267,2412,2610, 177,2703,3542, 774,1927,1344, 616,1432,1595,1018, 172,4360, # 4240
2325, 911,4361, 438,1468,3622, 794,3968,2024,2173,1681,1829,2957, 945, 895,3090, # 4256
575,2212,2476, 475,2401,2681, 785,2744,1745,2293,2555,1975,3133,2865, 394,4668, # 4272
3839, 635,4131, 639, 202,1507,2195,2766,1345,1435,2572,3726,1908,1184,1181,2457, # 4288
3727,3134,4362, 843,2611, 437, 916,4669, 234, 769,1884,3046,3047,3623, 833,6187, # 4304
1639,2250,2402,1355,1185,2010,2047, 999, 525,1732,1290,1488,2612, 948,1578,3728, # 4320
2413,2477,1216,2725,2159, 334,3840,1328,3624,2921,1525,4132, 564,1056, 891,4363, # 4336
1444,1698,2385,2251,3729,1365,2281,2235,1717,6188, 864,3841,2515, 444, 527,2767, # 4352
2922,3625, 544, 461,6189, 566, 209,2437,3398,2098,1065,2068,3331,3626,3257,2137, # 4368 #last 512
)
pip/_vendor/chardet/euckrprober.py 0000644 00000003324 14751155147 0013313 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .mbcharsetprober import MultiByteCharSetProber
from .codingstatemachine import CodingStateMachine
from .chardistribution import EUCKRDistributionAnalysis
from .mbcssm import EUCKR_SM_MODEL
class EUCKRProber(MultiByteCharSetProber):
def __init__(self):
super(EUCKRProber, self).__init__()
self.coding_sm = CodingStateMachine(EUCKR_SM_MODEL)
self.distribution_analyzer = EUCKRDistributionAnalysis()
self.reset()
@property
def charset_name(self):
return "EUC-KR"
@property
def language(self):
return "Korean"
pip/_vendor/chardet/compat.py 0000644 00000002156 14751155147 0012255 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# Contributor(s):
# Dan Blanchard
# Ian Cordasco
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
import sys
if sys.version_info < (3, 0):
PY2 = True
PY3 = False
base_str = (str, unicode)
text_type = unicode
else:
PY2 = False
PY3 = True
base_str = (bytes, str)
text_type = str
pip/_vendor/chardet/langbulgarianmodel.py 0000644 00000031047 14751155147 0014622 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# 255: Control characters that usually does not exist in any text
# 254: Carriage/Return
# 253: symbol (punctuation) that does not belong to word
# 252: 0 - 9
# Character Mapping Table:
# this table is modified base on win1251BulgarianCharToOrderMap, so
# only number <64 is sure valid
Latin5_BulgarianCharToOrderMap = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 77, 90, 99,100, 72,109,107,101, 79,185, 81,102, 76, 94, 82, # 40
110,186,108, 91, 74,119, 84, 96,111,187,115,253,253,253,253,253, # 50
253, 65, 69, 70, 66, 63, 68,112,103, 92,194,104, 95, 86, 87, 71, # 60
116,195, 85, 93, 97,113,196,197,198,199,200,253,253,253,253,253, # 70
194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209, # 80
210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225, # 90
81,226,227,228,229,230,105,231,232,233,234,235,236, 45,237,238, # a0
31, 32, 35, 43, 37, 44, 55, 47, 40, 59, 33, 46, 38, 36, 41, 30, # b0
39, 28, 34, 51, 48, 49, 53, 50, 54, 57, 61,239, 67,240, 60, 56, # c0
1, 18, 9, 20, 11, 3, 23, 15, 2, 26, 12, 10, 14, 6, 4, 13, # d0
7, 8, 5, 19, 29, 25, 22, 21, 27, 24, 17, 75, 52,241, 42, 16, # e0
62,242,243,244, 58,245, 98,246,247,248,249,250,251, 91,252,253, # f0
)
win1251BulgarianCharToOrderMap = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 77, 90, 99,100, 72,109,107,101, 79,185, 81,102, 76, 94, 82, # 40
110,186,108, 91, 74,119, 84, 96,111,187,115,253,253,253,253,253, # 50
253, 65, 69, 70, 66, 63, 68,112,103, 92,194,104, 95, 86, 87, 71, # 60
116,195, 85, 93, 97,113,196,197,198,199,200,253,253,253,253,253, # 70
206,207,208,209,210,211,212,213,120,214,215,216,217,218,219,220, # 80
221, 78, 64, 83,121, 98,117,105,222,223,224,225,226,227,228,229, # 90
88,230,231,232,233,122, 89,106,234,235,236,237,238, 45,239,240, # a0
73, 80,118,114,241,242,243,244,245, 62, 58,246,247,248,249,250, # b0
31, 32, 35, 43, 37, 44, 55, 47, 40, 59, 33, 46, 38, 36, 41, 30, # c0
39, 28, 34, 51, 48, 49, 53, 50, 54, 57, 61,251, 67,252, 60, 56, # d0
1, 18, 9, 20, 11, 3, 23, 15, 2, 26, 12, 10, 14, 6, 4, 13, # e0
7, 8, 5, 19, 29, 25, 22, 21, 27, 24, 17, 75, 52,253, 42, 16, # f0
)
# Model Table:
# total sequences: 100%
# first 512 sequences: 96.9392%
# first 1024 sequences:3.0618%
# rest sequences: 0.2992%
# negative sequences: 0.0020%
BulgarianLangModel = (
0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,2,3,3,3,3,3,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,3,3,3,2,2,3,2,2,1,2,2,
3,1,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,0,3,3,3,3,3,3,3,3,3,3,0,3,0,1,
0,0,0,0,0,0,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,2,3,3,3,3,3,3,3,3,0,3,1,0,
0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
3,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,1,3,2,3,3,3,3,3,3,3,3,0,3,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,2,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,1,3,2,3,3,3,3,3,3,3,3,0,3,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,2,3,2,2,1,3,3,3,3,2,2,2,1,1,2,0,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,2,3,2,2,3,3,1,1,2,3,3,2,3,3,3,3,2,1,2,0,2,0,3,0,0,
0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,1,3,3,3,3,3,2,3,2,3,3,3,3,3,2,3,3,1,3,0,3,0,2,0,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,3,1,3,3,2,3,3,3,1,3,3,2,3,2,2,2,0,0,2,0,2,0,2,0,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,3,3,0,3,3,3,2,2,3,3,3,1,2,2,3,2,1,1,2,0,2,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,2,3,3,1,2,3,2,2,2,3,3,3,3,3,2,2,3,1,2,0,2,1,2,0,0,
0,0,0,0,0,0,0,0,0,0,3,0,0,1,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,1,3,3,3,3,3,2,3,3,3,2,3,3,2,3,2,2,2,3,1,2,0,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,3,3,3,3,1,1,1,2,2,1,3,1,3,2,2,3,0,0,1,0,1,0,1,0,0,
0,0,0,1,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,2,2,3,2,2,3,1,2,1,1,1,2,3,1,3,1,2,2,0,1,1,1,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,1,3,2,2,3,3,1,2,3,1,1,3,3,3,3,1,2,2,1,1,1,0,2,0,2,0,1,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,2,2,3,3,3,2,2,1,1,2,0,2,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,0,1,2,1,3,3,2,3,3,3,3,3,2,3,2,1,0,3,1,2,1,2,1,2,3,2,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,1,1,2,3,3,3,3,3,3,3,3,3,3,3,3,0,0,3,1,3,3,2,3,3,2,2,2,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,3,3,3,0,3,3,3,3,3,2,1,1,2,1,3,3,0,3,1,1,1,1,3,2,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,2,2,2,3,3,3,3,3,3,3,3,3,3,3,1,1,3,1,3,3,2,3,2,2,2,3,0,2,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,2,3,3,2,2,3,2,1,1,1,1,1,3,1,3,1,1,0,0,0,1,0,0,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,2,3,2,0,3,2,0,3,0,2,0,0,2,1,3,1,0,0,1,0,0,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,2,1,1,1,1,2,1,1,2,1,1,1,2,2,1,2,1,1,1,0,1,1,0,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,2,1,3,1,1,2,1,3,2,1,1,0,1,2,3,2,1,1,1,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,3,3,3,2,2,1,0,1,0,0,1,0,0,0,2,1,0,3,0,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,2,3,2,3,3,1,3,2,1,1,1,2,1,1,2,1,3,0,1,0,0,0,1,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,1,2,2,3,3,2,3,2,2,2,3,1,2,2,1,1,2,1,1,2,2,0,1,1,0,1,0,2,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,2,1,3,1,0,2,2,1,3,2,1,0,0,2,0,2,0,1,0,0,0,0,0,0,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,3,1,2,0,2,3,1,2,3,2,0,1,3,1,2,1,1,1,0,0,1,0,0,2,2,2,3,
2,2,2,2,1,2,1,1,2,2,1,1,2,0,1,1,1,0,0,1,1,0,0,1,1,0,0,0,1,1,0,1,
3,3,3,3,3,2,1,2,2,1,2,0,2,0,1,0,1,2,1,2,1,1,0,0,0,1,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
3,3,2,3,3,1,1,3,1,0,3,2,1,0,0,0,1,2,0,2,0,1,0,0,0,1,0,1,2,1,2,2,
1,1,1,1,1,1,1,2,2,2,1,1,1,1,1,1,1,0,1,2,1,1,1,0,0,0,0,0,1,1,0,0,
3,1,0,1,0,2,3,2,2,2,3,2,2,2,2,2,1,0,2,1,2,1,1,1,0,1,2,1,2,2,2,1,
1,1,2,2,2,2,1,2,1,1,0,1,2,1,2,2,2,1,1,1,0,1,1,1,1,2,0,1,0,0,0,0,
2,3,2,3,3,0,0,2,1,0,2,1,0,0,0,0,2,3,0,2,0,0,0,0,0,1,0,0,2,0,1,2,
2,1,2,1,2,2,1,1,1,2,1,1,1,0,1,2,2,1,1,1,1,1,0,1,1,1,0,0,1,2,0,0,
3,3,2,2,3,0,2,3,1,1,2,0,0,0,1,0,0,2,0,2,0,0,0,1,0,1,0,1,2,0,2,2,
1,1,1,1,2,1,0,1,2,2,2,1,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,1,0,0,
2,3,2,3,3,0,0,3,0,1,1,0,1,0,0,0,2,2,1,2,0,0,0,0,0,0,0,0,2,0,1,2,
2,2,1,1,1,1,1,2,2,2,1,0,2,0,1,0,1,0,0,1,0,1,0,0,1,0,0,0,0,1,0,0,
3,3,3,3,2,2,2,2,2,0,2,1,1,1,1,2,1,2,1,1,0,2,0,1,0,1,0,0,2,0,1,2,
1,1,1,1,1,1,1,2,2,1,1,0,2,0,1,0,2,0,0,1,1,1,0,0,2,0,0,0,1,1,0,0,
2,3,3,3,3,1,0,0,0,0,0,0,0,0,0,0,2,0,0,1,1,0,0,0,0,0,0,1,2,0,1,2,
2,2,2,1,1,2,1,1,2,2,2,1,2,0,1,1,1,1,1,1,0,1,1,1,1,0,0,1,1,1,0,0,
2,3,3,3,3,0,2,2,0,2,1,0,0,0,1,1,1,2,0,2,0,0,0,3,0,0,0,0,2,0,2,2,
1,1,1,2,1,2,1,1,2,2,2,1,2,0,1,1,1,0,1,1,1,1,0,2,1,0,0,0,1,1,0,0,
2,3,3,3,3,0,2,1,0,0,2,0,0,0,0,0,1,2,0,2,0,0,0,0,0,0,0,0,2,0,1,2,
1,1,1,2,1,1,1,1,2,2,2,0,1,0,1,1,1,0,0,1,1,1,0,0,1,0,0,0,0,1,0,0,
3,3,2,2,3,0,1,0,1,0,0,0,0,0,0,0,1,1,0,3,0,0,0,0,0,0,0,0,1,0,2,2,
1,1,1,1,1,2,1,1,2,2,1,2,2,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,0,0,
3,1,0,1,0,2,2,2,2,3,2,1,1,1,2,3,0,0,1,0,2,1,1,0,1,1,1,1,2,1,1,1,
1,2,2,1,2,1,2,2,1,1,0,1,2,1,2,2,1,1,1,0,0,1,1,1,2,1,0,1,0,0,0,0,
2,1,0,1,0,3,1,2,2,2,2,1,2,2,1,1,1,0,2,1,2,2,1,1,2,1,1,0,2,1,1,1,
1,2,2,2,2,2,2,2,1,2,0,1,1,0,2,1,1,1,1,1,0,0,1,1,1,1,0,1,0,0,0,0,
2,1,1,1,1,2,2,2,2,1,2,2,2,1,2,2,1,1,2,1,2,3,2,2,1,1,1,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,3,2,0,1,2,0,1,2,1,1,0,1,0,1,2,1,2,0,0,0,1,1,0,0,0,1,0,0,2,
1,1,0,0,1,1,0,1,1,1,1,0,2,0,1,1,1,0,0,1,1,0,0,0,0,1,0,0,0,1,0,0,
2,0,0,0,0,1,2,2,2,2,2,2,2,1,2,1,1,1,1,1,1,1,0,1,1,1,1,1,2,1,1,1,
1,2,2,2,2,1,1,2,1,2,1,1,1,0,2,1,2,1,1,1,0,2,1,1,1,1,0,1,0,0,0,0,
3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,
1,1,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,3,2,0,0,0,0,1,0,0,0,0,0,0,1,1,0,2,0,0,0,0,0,0,0,0,1,0,1,2,
1,1,1,1,1,1,0,0,2,2,2,2,2,0,1,1,0,1,1,1,1,1,0,0,1,0,0,0,1,1,0,1,
2,3,1,2,1,0,1,1,0,2,2,2,0,0,1,0,0,1,1,1,1,0,0,0,0,0,0,0,1,0,1,2,
1,1,1,1,2,1,1,1,1,1,1,1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,
2,2,2,2,2,0,0,2,0,0,2,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,2,0,2,2,
1,1,1,1,1,0,0,1,2,1,1,0,1,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
1,2,2,2,2,0,0,2,0,1,1,0,0,0,1,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,1,1,
0,0,0,1,1,1,1,1,1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
1,2,2,3,2,0,0,1,0,0,1,0,0,0,0,0,0,1,0,2,0,0,0,1,0,0,0,0,0,0,0,2,
1,1,0,0,1,0,0,0,1,1,0,0,1,0,1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
2,1,2,2,2,1,2,1,2,2,1,1,2,1,1,1,0,1,1,1,1,2,0,1,0,1,1,1,1,0,1,1,
1,1,2,1,1,1,1,1,1,0,0,1,2,1,1,1,1,1,1,0,0,1,1,1,0,0,0,0,0,0,0,0,
1,0,0,1,3,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,2,1,0,0,1,0,2,0,0,0,0,0,1,1,1,0,1,0,0,0,0,0,0,0,0,2,0,0,1,
0,2,0,1,0,0,1,1,2,0,1,0,1,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
1,2,2,2,2,0,1,1,0,2,1,0,1,1,1,0,0,1,0,2,0,1,0,0,0,0,0,0,0,0,0,1,
0,1,0,0,1,0,0,0,1,1,0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,2,2,0,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,1,
0,1,0,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
2,0,1,0,0,1,2,1,1,1,1,1,1,2,2,1,0,0,1,0,1,0,0,0,0,1,1,1,1,0,0,0,
1,1,2,1,1,1,1,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,1,2,1,0,0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,1,
0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
0,1,1,0,1,1,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,
1,0,1,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,1,0,2,0,0,2,0,1,0,0,1,0,0,1,
1,1,0,0,1,1,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,
1,1,1,1,1,1,1,2,0,0,0,0,0,0,2,1,0,1,1,0,0,1,1,1,0,1,0,0,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
)
Latin5BulgarianModel = {
'char_to_order_map': Latin5_BulgarianCharToOrderMap,
'precedence_matrix': BulgarianLangModel,
'typical_positive_ratio': 0.969392,
'keep_english_letter': False,
'charset_name': "ISO-8859-5",
'language': 'Bulgairan',
}
Win1251BulgarianModel = {
'char_to_order_map': win1251BulgarianCharToOrderMap,
'precedence_matrix': BulgarianLangModel,
'typical_positive_ratio': 0.969392,
'keep_english_letter': False,
'charset_name': "windows-1251",
'language': 'Bulgarian',
}
pip/_vendor/chardet/enums.py 0000644 00000003175 14751155147 0012123 0 ustar 00 """
All of the Enums that are used throughout the chardet package.
:author: Dan Blanchard (dan.blanchard@gmail.com)
"""
class InputState(object):
"""
This enum represents the different states a universal detector can be in.
"""
PURE_ASCII = 0
ESC_ASCII = 1
HIGH_BYTE = 2
class LanguageFilter(object):
"""
This enum represents the different language filters we can apply to a
``UniversalDetector``.
"""
CHINESE_SIMPLIFIED = 0x01
CHINESE_TRADITIONAL = 0x02
JAPANESE = 0x04
KOREAN = 0x08
NON_CJK = 0x10
ALL = 0x1F
CHINESE = CHINESE_SIMPLIFIED | CHINESE_TRADITIONAL
CJK = CHINESE | JAPANESE | KOREAN
class ProbingState(object):
"""
This enum represents the different states a prober can be in.
"""
DETECTING = 0
FOUND_IT = 1
NOT_ME = 2
class MachineState(object):
"""
This enum represents the different states a state machine can be in.
"""
START = 0
ERROR = 1
ITS_ME = 2
class SequenceLikelihood(object):
"""
This enum represents the likelihood of a character following the previous one.
"""
NEGATIVE = 0
UNLIKELY = 1
LIKELY = 2
POSITIVE = 3
@classmethod
def get_num_categories(cls):
""":returns: The number of likelihood categories in the enum."""
return 4
class CharacterCategory(object):
"""
This enum represents the different categories language models for
``SingleByteCharsetProber`` put characters into.
Anything less than CONTROL is considered a letter.
"""
UNDEFINED = 255
LINE_BREAK = 254
SYMBOL = 253
DIGIT = 252
CONTROL = 251
pip/_vendor/chardet/langturkishmodel.py 0000644 00000025536 14751155147 0014355 0 ustar 00 # -*- coding: utf-8 -*-
######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Özgür Baskın - Turkish Language Model
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# 255: Control characters that usually does not exist in any text
# 254: Carriage/Return
# 253: symbol (punctuation) that does not belong to word
# 252: 0 - 9
# Character Mapping Table:
Latin5_TurkishCharToOrderMap = (
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
255, 23, 37, 47, 39, 29, 52, 36, 45, 53, 60, 16, 49, 20, 46, 42,
48, 69, 44, 35, 31, 51, 38, 62, 65, 43, 56,255,255,255,255,255,
255, 1, 21, 28, 12, 2, 18, 27, 25, 3, 24, 10, 5, 13, 4, 15,
26, 64, 7, 8, 9, 14, 32, 57, 58, 11, 22,255,255,255,255,255,
180,179,178,177,176,175,174,173,172,171,170,169,168,167,166,165,
164,163,162,161,160,159,101,158,157,156,155,154,153,152,151,106,
150,149,148,147,146,145,144,100,143,142,141,140,139,138,137,136,
94, 80, 93,135,105,134,133, 63,132,131,130,129,128,127,126,125,
124,104, 73, 99, 79, 85,123, 54,122, 98, 92,121,120, 91,103,119,
68,118,117, 97,116,115, 50, 90,114,113,112,111, 55, 41, 40, 86,
89, 70, 59, 78, 71, 82, 88, 33, 77, 66, 84, 83,110, 75, 61, 96,
30, 67,109, 74, 87,102, 34, 95, 81,108, 76, 72, 17, 6, 19,107,
)
TurkishLangModel = (
3,2,3,3,3,1,3,3,3,3,3,3,3,3,2,1,1,3,3,1,3,3,0,3,3,3,3,3,0,3,1,3,
3,2,1,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,0,0,0,0,0,0,2,2,0,0,1,0,0,1,
3,2,2,3,3,0,3,3,3,3,3,3,3,2,3,1,0,3,3,1,3,3,0,3,3,3,3,3,0,3,0,3,
3,1,1,0,1,0,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,2,2,0,0,0,1,0,1,
3,3,2,3,3,0,3,3,3,3,3,3,3,2,3,1,1,3,3,0,3,3,1,2,3,3,3,3,0,3,0,3,
3,1,1,0,0,0,1,0,0,0,0,1,1,0,1,2,1,0,0,0,1,0,0,0,0,2,0,0,0,0,0,1,
3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,1,3,3,2,0,3,2,1,2,2,1,3,3,0,0,0,2,
2,2,0,1,0,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,0,1,0,0,1,
3,3,3,2,3,3,1,2,3,3,3,3,3,3,3,1,3,2,1,0,3,2,0,1,2,3,3,2,1,0,0,2,
2,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,
1,0,1,3,3,1,3,3,3,3,3,3,3,1,2,0,0,2,3,0,2,3,0,0,2,2,2,3,0,3,0,1,
2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,3,3,3,0,3,2,0,2,3,2,3,3,1,0,0,2,
3,2,0,0,1,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,0,2,0,0,1,
3,3,3,2,3,3,2,3,3,3,3,2,3,3,3,0,3,3,0,0,2,1,0,0,2,3,2,2,0,0,0,2,
2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,1,0,2,0,0,1,
3,3,3,2,3,3,3,3,3,3,3,2,3,3,3,0,3,2,0,1,3,2,1,1,3,2,3,2,1,0,0,2,
2,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,
3,3,3,2,3,3,3,3,3,3,3,2,3,3,3,0,3,2,2,0,2,3,0,0,2,2,2,2,0,0,0,2,
3,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,1,0,0,0,
3,3,3,3,3,3,3,2,2,2,2,3,2,3,3,0,3,3,1,1,2,2,0,0,2,2,3,2,0,0,1,3,
0,3,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,1,
3,3,3,2,3,3,3,2,1,2,2,3,2,3,3,0,3,2,0,0,1,1,0,1,1,2,1,2,0,0,0,1,
0,3,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,0,0,
3,3,3,2,3,3,2,3,2,2,2,3,3,3,3,1,3,1,1,0,3,2,1,1,3,3,2,3,1,0,0,1,
1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,0,1,
3,2,2,3,3,0,3,3,3,3,3,3,3,2,2,1,0,3,3,1,3,3,0,1,3,3,2,3,0,3,0,3,
2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
2,2,2,3,3,0,3,3,3,3,3,3,3,3,3,0,0,3,2,0,3,3,0,3,2,3,3,3,0,3,1,3,
2,0,0,0,0,0,0,0,0,0,0,1,0,1,2,0,1,0,0,0,0,0,0,0,2,2,0,0,1,0,0,1,
3,3,3,1,2,3,3,1,0,0,1,0,0,3,3,2,3,0,0,2,0,0,2,0,2,0,0,0,2,0,2,0,
0,3,1,0,1,0,0,0,2,2,1,0,1,1,2,1,2,2,2,0,2,1,1,0,0,0,2,0,0,0,0,0,
1,2,1,3,3,0,3,3,3,3,3,2,3,0,0,0,0,2,3,0,2,3,1,0,2,3,1,3,0,3,0,2,
3,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,1,3,3,2,2,3,2,2,0,1,2,3,0,1,2,1,0,1,0,0,0,1,0,2,2,0,0,0,1,
1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,0,
3,3,3,1,3,3,1,1,3,3,1,1,3,3,1,0,2,1,2,0,2,1,0,0,1,1,2,1,0,0,0,2,
2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,1,0,2,1,3,0,0,2,0,0,3,3,0,3,0,0,1,0,1,2,0,0,1,1,2,2,0,1,0,
0,1,2,1,1,0,1,0,1,1,1,1,1,0,1,1,1,2,2,1,2,0,1,0,0,0,0,0,0,1,0,0,
3,3,3,2,3,2,3,3,0,2,2,2,3,3,3,0,3,0,0,0,2,2,0,1,2,1,1,1,0,0,0,1,
0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
3,3,3,3,3,3,2,1,2,2,3,3,3,3,2,0,2,0,0,0,2,2,0,0,2,1,3,3,0,0,1,1,
1,1,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,
1,1,2,3,3,0,3,3,3,3,3,3,2,2,0,2,0,2,3,2,3,2,2,2,2,2,2,2,1,3,2,3,
2,0,2,1,2,2,2,2,1,1,2,2,1,2,2,1,2,0,0,2,1,1,0,2,1,0,0,1,0,0,0,1,
2,3,3,1,1,1,0,1,1,1,2,3,2,1,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,
0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,2,2,2,3,2,3,2,2,1,3,3,3,0,2,1,2,0,2,1,0,0,1,1,1,1,1,0,0,1,
2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,2,0,1,0,0,0,
3,3,3,2,3,3,3,3,3,2,3,1,2,3,3,1,2,0,0,0,0,0,0,0,3,2,1,1,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
3,3,3,2,2,3,3,2,1,1,1,1,1,3,3,0,3,1,0,0,1,1,0,0,3,1,2,1,0,0,0,0,
0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,
3,3,3,2,2,3,2,2,2,3,2,1,1,3,3,0,3,0,0,0,0,1,0,0,3,1,1,2,0,0,0,1,
1,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
1,1,1,3,3,0,3,3,3,3,3,2,2,2,1,2,0,2,1,2,2,1,1,0,1,2,2,2,2,2,2,2,
0,0,2,1,2,1,2,1,0,1,1,3,1,2,1,1,2,0,0,2,0,1,0,1,0,1,0,0,0,1,0,1,
3,3,3,1,3,3,3,0,1,1,0,2,2,3,1,0,3,0,0,0,1,0,0,0,1,0,0,1,0,1,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,2,0,0,2,2,1,0,0,1,0,0,3,3,1,3,0,0,1,1,0,2,0,3,0,0,0,2,0,1,1,
0,1,2,0,1,2,2,0,2,2,2,2,1,0,2,1,1,0,2,0,2,1,2,0,0,0,0,0,0,0,0,0,
3,3,3,1,3,2,3,2,0,2,2,2,1,3,2,0,2,1,2,0,1,2,0,0,1,0,2,2,0,0,0,2,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,
3,3,3,0,3,3,1,1,2,3,1,0,3,2,3,0,3,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,
1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,3,3,0,3,3,2,3,3,2,2,0,0,0,0,1,2,0,1,3,0,0,0,3,1,1,0,3,0,2,
2,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,1,2,2,1,0,3,1,1,1,1,3,3,2,3,0,0,1,0,1,2,0,2,2,0,2,2,0,2,1,
0,2,2,1,1,1,1,0,2,1,1,0,1,1,1,1,2,1,2,1,2,0,1,0,1,0,0,0,0,0,0,0,
3,3,3,0,1,1,3,0,0,1,1,0,0,2,2,0,3,0,0,1,1,0,1,0,0,0,0,0,2,0,0,0,
0,3,1,0,1,0,1,0,2,0,0,1,0,1,0,1,1,1,2,1,1,0,2,0,0,0,0,0,0,0,0,0,
3,3,3,0,2,0,2,0,1,1,1,0,0,3,3,0,2,0,0,1,0,0,2,1,1,0,1,0,1,0,1,0,
0,2,0,1,2,0,2,0,2,1,1,0,1,0,2,1,1,0,2,1,1,0,1,0,0,0,1,1,0,0,0,0,
3,2,3,0,1,0,0,0,0,0,0,0,0,1,2,0,1,0,0,1,0,0,1,0,0,0,0,0,2,0,0,0,
0,0,1,1,0,0,1,0,1,0,0,1,0,0,0,2,1,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,0,0,2,3,0,0,1,0,1,0,2,3,2,3,0,0,1,3,0,2,1,0,0,0,0,2,0,1,0,
0,2,1,0,0,1,1,0,2,1,0,0,1,0,0,1,1,0,1,1,2,0,1,0,0,0,0,1,0,0,0,0,
3,2,2,0,0,1,1,0,0,0,0,0,0,3,1,1,1,0,0,0,0,0,1,0,0,0,0,0,2,0,1,0,
0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,3,3,0,2,3,2,2,1,2,2,1,1,2,0,1,3,2,2,2,0,0,2,2,0,0,0,1,2,1,
3,0,2,1,1,0,1,1,1,0,1,2,2,2,1,1,2,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,
0,1,1,2,3,0,3,3,3,2,2,2,2,1,0,1,0,1,0,1,2,2,0,0,2,2,1,3,1,1,2,1,
0,0,1,1,2,0,1,1,0,0,1,2,0,2,1,1,2,0,0,1,0,0,0,1,0,1,0,1,0,0,0,0,
3,3,2,0,0,3,1,0,0,0,0,0,0,3,2,1,2,0,0,1,0,0,2,0,0,0,0,0,2,0,1,0,
0,2,1,1,0,0,1,0,1,2,0,0,1,1,0,0,2,1,1,1,1,0,2,0,0,0,0,0,0,0,0,0,
3,3,2,0,0,1,0,0,0,0,1,0,0,3,3,2,2,0,0,1,0,0,2,0,1,0,0,0,2,0,1,0,
0,0,1,1,0,0,2,0,2,1,0,0,1,1,2,1,2,0,2,1,2,1,1,1,0,0,1,1,0,0,0,0,
3,3,2,0,0,2,2,0,0,0,1,1,0,2,2,1,3,1,0,1,0,1,2,0,0,0,0,0,1,0,1,0,
0,1,1,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,2,0,0,0,1,0,0,1,0,0,2,3,1,2,0,0,1,0,0,2,0,0,0,1,0,2,0,2,0,
0,1,1,2,2,1,2,0,2,1,1,0,0,1,1,0,1,1,1,1,2,1,1,0,0,0,0,0,0,0,0,0,
3,3,3,0,2,1,2,1,0,0,1,1,0,3,3,1,2,0,0,1,0,0,2,0,2,0,1,1,2,0,0,0,
0,0,1,1,1,1,2,0,1,1,0,1,1,1,1,0,0,0,1,1,1,0,1,0,0,0,1,0,0,0,0,0,
3,3,3,0,2,2,3,2,0,0,1,0,0,2,3,1,0,0,0,0,0,0,2,0,2,0,0,0,2,0,0,0,
0,1,1,0,0,0,1,0,0,1,0,1,1,0,1,0,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,
3,2,3,0,0,0,0,0,0,0,1,0,0,2,2,2,2,0,0,1,0,0,2,0,0,0,0,0,2,0,1,0,
0,0,2,1,1,0,1,0,2,1,1,0,0,1,1,2,1,0,2,0,2,0,1,0,0,0,2,0,0,0,0,0,
0,0,0,2,2,0,2,1,1,1,1,2,2,0,0,1,0,1,0,0,1,3,0,0,0,0,1,0,0,2,1,0,
0,0,1,0,1,0,0,0,0,0,2,1,0,1,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
2,0,0,2,3,0,2,3,1,2,2,0,2,0,0,2,0,2,1,1,1,2,1,0,0,1,2,1,1,2,1,0,
1,0,2,0,1,0,1,1,0,0,2,2,1,2,1,1,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,0,2,1,2,0,0,0,1,0,0,3,2,0,1,0,0,1,0,0,2,0,0,0,1,2,1,0,1,0,
0,0,0,0,1,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,1,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,2,2,0,2,2,1,1,0,1,1,1,1,1,0,0,1,2,1,1,1,0,1,0,0,0,1,1,1,1,
0,0,2,1,0,1,1,1,0,1,1,2,1,2,1,1,2,0,1,1,2,1,0,2,0,0,0,0,0,0,0,0,
3,2,2,0,0,2,0,0,0,0,0,0,0,2,2,0,2,0,0,1,0,0,2,0,0,0,0,0,2,0,0,0,
0,2,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,3,2,0,2,2,0,1,1,0,1,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,
2,0,1,0,1,0,1,1,0,0,1,2,0,1,0,1,1,0,0,1,0,1,0,2,0,0,0,0,0,0,0,0,
2,2,2,0,1,1,0,0,0,1,0,0,0,1,2,0,1,0,0,1,0,0,1,0,0,0,0,1,2,0,1,0,
0,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,2,1,0,1,1,1,0,0,0,0,1,2,0,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
1,1,2,0,1,0,0,0,1,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,2,0,0,0,0,0,1,
0,0,1,2,2,0,2,1,2,1,1,2,2,0,0,0,0,1,0,0,1,1,0,0,2,0,0,0,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
2,2,2,0,0,0,1,0,0,0,0,0,0,2,2,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,1,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,0,1,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,1,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
)
Latin5TurkishModel = {
'char_to_order_map': Latin5_TurkishCharToOrderMap,
'precedence_matrix': TurkishLangModel,
'typical_positive_ratio': 0.970290,
'keep_english_letter': True,
'charset_name': "ISO-8859-9",
'language': 'Turkish',
}
pip/_vendor/chardet/mbcharsetprober.py 0000644 00000006525 14751155150 0014152 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
# Proofpoint, Inc.
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetprober import CharSetProber
from .enums import ProbingState, MachineState
class MultiByteCharSetProber(CharSetProber):
"""
MultiByteCharSetProber
"""
def __init__(self, lang_filter=None):
super(MultiByteCharSetProber, self).__init__(lang_filter=lang_filter)
self.distribution_analyzer = None
self.coding_sm = None
self._last_char = [0, 0]
def reset(self):
super(MultiByteCharSetProber, self).reset()
if self.coding_sm:
self.coding_sm.reset()
if self.distribution_analyzer:
self.distribution_analyzer.reset()
self._last_char = [0, 0]
@property
def charset_name(self):
raise NotImplementedError
@property
def language(self):
raise NotImplementedError
def feed(self, byte_str):
for i in range(len(byte_str)):
coding_state = self.coding_sm.next_state(byte_str[i])
if coding_state == MachineState.ERROR:
self.logger.debug('%s %s prober hit error at byte %s',
self.charset_name, self.language, i)
self._state = ProbingState.NOT_ME
break
elif coding_state == MachineState.ITS_ME:
self._state = ProbingState.FOUND_IT
break
elif coding_state == MachineState.START:
char_len = self.coding_sm.get_current_charlen()
if i == 0:
self._last_char[1] = byte_str[0]
self.distribution_analyzer.feed(self._last_char, char_len)
else:
self.distribution_analyzer.feed(byte_str[i - 1:i + 1],
char_len)
self._last_char[0] = byte_str[-1]
if self.state == ProbingState.DETECTING:
if (self.distribution_analyzer.got_enough_data() and
(self.get_confidence() > self.SHORTCUT_THRESHOLD)):
self._state = ProbingState.FOUND_IT
return self.state
def get_confidence(self):
return self.distribution_analyzer.get_confidence()
pip/_vendor/chardet/charsetprober.py 0000644 00000011766 14751155150 0013636 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
import logging
import re
from .enums import ProbingState
class CharSetProber(object):
SHORTCUT_THRESHOLD = 0.95
def __init__(self, lang_filter=None):
self._state = None
self.lang_filter = lang_filter
self.logger = logging.getLogger(__name__)
def reset(self):
self._state = ProbingState.DETECTING
@property
def charset_name(self):
return None
def feed(self, buf):
pass
@property
def state(self):
return self._state
def get_confidence(self):
return 0.0
@staticmethod
def filter_high_byte_only(buf):
buf = re.sub(b'([\x00-\x7F])+', b' ', buf)
return buf
@staticmethod
def filter_international_words(buf):
"""
We define three types of bytes:
alphabet: english alphabets [a-zA-Z]
international: international characters [\x80-\xFF]
marker: everything else [^a-zA-Z\x80-\xFF]
The input buffer can be thought to contain a series of words delimited
by markers. This function works to filter all words that contain at
least one international character. All contiguous sequences of markers
are replaced by a single space ascii character.
This filter applies to all scripts which do not use English characters.
"""
filtered = bytearray()
# This regex expression filters out only words that have at-least one
# international character. The word may include one marker character at
# the end.
words = re.findall(b'[a-zA-Z]*[\x80-\xFF]+[a-zA-Z]*[^a-zA-Z\x80-\xFF]?',
buf)
for word in words:
filtered.extend(word[:-1])
# If the last character in the word is a marker, replace it with a
# space as markers shouldn't affect our analysis (they are used
# similarly across all languages and may thus have similar
# frequencies).
last_char = word[-1:]
if not last_char.isalpha() and last_char < b'\x80':
last_char = b' '
filtered.extend(last_char)
return filtered
@staticmethod
def filter_with_english_letters(buf):
"""
Returns a copy of ``buf`` that retains only the sequences of English
alphabet and high byte characters that are not between <> characters.
Also retains English alphabet and high byte characters immediately
before occurrences of >.
This filter can be applied to all scripts which contain both English
characters and extended ASCII characters, but is currently only used by
``Latin1Prober``.
"""
filtered = bytearray()
in_tag = False
prev = 0
for curr in range(len(buf)):
# Slice here to get bytes instead of an int with Python 3
buf_char = buf[curr:curr + 1]
# Check if we're coming out of or entering an HTML tag
if buf_char == b'>':
in_tag = False
elif buf_char == b'<':
in_tag = True
# If current character is not extended-ASCII and not alphabetic...
if buf_char < b'\x80' and not buf_char.isalpha():
# ...and we're not in a tag
if curr > prev and not in_tag:
# Keep everything after last non-extended-ASCII,
# non-alphabetic character
filtered.extend(buf[prev:curr])
# Output a space to delimit stretch we kept
filtered.extend(b' ')
prev = curr + 1
# If we're not in a tag...
if not in_tag:
# Keep everything after last non-extended-ASCII, non-alphabetic
# character
filtered.extend(buf[prev:])
return filtered
pip/_vendor/chardet/charsetgroupprober.py 0000644 00000007313 14751155150 0014704 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .enums import ProbingState
from .charsetprober import CharSetProber
class CharSetGroupProber(CharSetProber):
def __init__(self, lang_filter=None):
super(CharSetGroupProber, self).__init__(lang_filter=lang_filter)
self._active_num = 0
self.probers = []
self._best_guess_prober = None
def reset(self):
super(CharSetGroupProber, self).reset()
self._active_num = 0
for prober in self.probers:
if prober:
prober.reset()
prober.active = True
self._active_num += 1
self._best_guess_prober = None
@property
def charset_name(self):
if not self._best_guess_prober:
self.get_confidence()
if not self._best_guess_prober:
return None
return self._best_guess_prober.charset_name
@property
def language(self):
if not self._best_guess_prober:
self.get_confidence()
if not self._best_guess_prober:
return None
return self._best_guess_prober.language
def feed(self, byte_str):
for prober in self.probers:
if not prober:
continue
if not prober.active:
continue
state = prober.feed(byte_str)
if not state:
continue
if state == ProbingState.FOUND_IT:
self._best_guess_prober = prober
return self.state
elif state == ProbingState.NOT_ME:
prober.active = False
self._active_num -= 1
if self._active_num <= 0:
self._state = ProbingState.NOT_ME
return self.state
return self.state
def get_confidence(self):
state = self.state
if state == ProbingState.FOUND_IT:
return 0.99
elif state == ProbingState.NOT_ME:
return 0.01
best_conf = 0.0
self._best_guess_prober = None
for prober in self.probers:
if not prober:
continue
if not prober.active:
self.logger.debug('%s not active', prober.charset_name)
continue
conf = prober.get_confidence()
self.logger.debug('%s %s confidence = %s', prober.charset_name, prober.language, conf)
if best_conf < conf:
best_conf = conf
self._best_guess_prober = prober
if not self._best_guess_prober:
return 0.0
return best_conf
pip/_vendor/chardet/codingstatemachine.py 0000644 00000007006 14751155150 0014614 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
import logging
from .enums import MachineState
class CodingStateMachine(object):
"""
A state machine to verify a byte sequence for a particular encoding. For
each byte the detector receives, it will feed that byte to every active
state machine available, one byte at a time. The state machine changes its
state based on its previous state and the byte it receives. There are 3
states in a state machine that are of interest to an auto-detector:
START state: This is the state to start with, or a legal byte sequence
(i.e. a valid code point) for character has been identified.
ME state: This indicates that the state machine identified a byte sequence
that is specific to the charset it is designed for and that
there is no other possible encoding which can contain this byte
sequence. This will to lead to an immediate positive answer for
the detector.
ERROR state: This indicates the state machine identified an illegal byte
sequence for that encoding. This will lead to an immediate
negative answer for this encoding. Detector will exclude this
encoding from consideration from here on.
"""
def __init__(self, sm):
self._model = sm
self._curr_byte_pos = 0
self._curr_char_len = 0
self._curr_state = None
self.logger = logging.getLogger(__name__)
self.reset()
def reset(self):
self._curr_state = MachineState.START
def next_state(self, c):
# for each byte we get its class
# if it is first byte, we also get byte length
byte_class = self._model['class_table'][c]
if self._curr_state == MachineState.START:
self._curr_byte_pos = 0
self._curr_char_len = self._model['char_len_table'][byte_class]
# from byte's class and state_table, we get its next state
curr_state = (self._curr_state * self._model['class_factor']
+ byte_class)
self._curr_state = self._model['state_table'][curr_state]
self._curr_byte_pos += 1
return self._curr_state
def get_current_charlen(self):
return self._curr_char_len
def get_coding_state_machine(self):
return self._model['name']
@property
def language(self):
return self._model['language']
pip/_vendor/chardet/sbcharsetprober.py 0000644 00000013031 14751155150 0014146 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetprober import CharSetProber
from .enums import CharacterCategory, ProbingState, SequenceLikelihood
class SingleByteCharSetProber(CharSetProber):
SAMPLE_SIZE = 64
SB_ENOUGH_REL_THRESHOLD = 1024 # 0.25 * SAMPLE_SIZE^2
POSITIVE_SHORTCUT_THRESHOLD = 0.95
NEGATIVE_SHORTCUT_THRESHOLD = 0.05
def __init__(self, model, reversed=False, name_prober=None):
super(SingleByteCharSetProber, self).__init__()
self._model = model
# TRUE if we need to reverse every pair in the model lookup
self._reversed = reversed
# Optional auxiliary prober for name decision
self._name_prober = name_prober
self._last_order = None
self._seq_counters = None
self._total_seqs = None
self._total_char = None
self._freq_char = None
self.reset()
def reset(self):
super(SingleByteCharSetProber, self).reset()
# char order of last character
self._last_order = 255
self._seq_counters = [0] * SequenceLikelihood.get_num_categories()
self._total_seqs = 0
self._total_char = 0
# characters that fall in our sampling range
self._freq_char = 0
@property
def charset_name(self):
if self._name_prober:
return self._name_prober.charset_name
else:
return self._model['charset_name']
@property
def language(self):
if self._name_prober:
return self._name_prober.language
else:
return self._model.get('language')
def feed(self, byte_str):
if not self._model['keep_english_letter']:
byte_str = self.filter_international_words(byte_str)
if not byte_str:
return self.state
char_to_order_map = self._model['char_to_order_map']
for i, c in enumerate(byte_str):
# XXX: Order is in range 1-64, so one would think we want 0-63 here,
# but that leads to 27 more test failures than before.
order = char_to_order_map[c]
# XXX: This was SYMBOL_CAT_ORDER before, with a value of 250, but
# CharacterCategory.SYMBOL is actually 253, so we use CONTROL
# to make it closer to the original intent. The only difference
# is whether or not we count digits and control characters for
# _total_char purposes.
if order < CharacterCategory.CONTROL:
self._total_char += 1
if order < self.SAMPLE_SIZE:
self._freq_char += 1
if self._last_order < self.SAMPLE_SIZE:
self._total_seqs += 1
if not self._reversed:
i = (self._last_order * self.SAMPLE_SIZE) + order
model = self._model['precedence_matrix'][i]
else: # reverse the order of the letters in the lookup
i = (order * self.SAMPLE_SIZE) + self._last_order
model = self._model['precedence_matrix'][i]
self._seq_counters[model] += 1
self._last_order = order
charset_name = self._model['charset_name']
if self.state == ProbingState.DETECTING:
if self._total_seqs > self.SB_ENOUGH_REL_THRESHOLD:
confidence = self.get_confidence()
if confidence > self.POSITIVE_SHORTCUT_THRESHOLD:
self.logger.debug('%s confidence = %s, we have a winner',
charset_name, confidence)
self._state = ProbingState.FOUND_IT
elif confidence < self.NEGATIVE_SHORTCUT_THRESHOLD:
self.logger.debug('%s confidence = %s, below negative '
'shortcut threshhold %s', charset_name,
confidence,
self.NEGATIVE_SHORTCUT_THRESHOLD)
self._state = ProbingState.NOT_ME
return self.state
def get_confidence(self):
r = 0.01
if self._total_seqs > 0:
r = ((1.0 * self._seq_counters[SequenceLikelihood.POSITIVE]) /
self._total_seqs / self._model['typical_positive_ratio'])
r = r * self._freq_char / self._total_char
if r >= 1.0:
r = 0.99
return r
pip/_vendor/chardet/langhungarianmodel.py 0000644 00000030460 14751155150 0014622 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# 255: Control characters that usually does not exist in any text
# 254: Carriage/Return
# 253: symbol (punctuation) that does not belong to word
# 252: 0 - 9
# Character Mapping Table:
Latin2_HungarianCharToOrderMap = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 28, 40, 54, 45, 32, 50, 49, 38, 39, 53, 36, 41, 34, 35, 47,
46, 71, 43, 33, 37, 57, 48, 64, 68, 55, 52,253,253,253,253,253,
253, 2, 18, 26, 17, 1, 27, 12, 20, 9, 22, 7, 6, 13, 4, 8,
23, 67, 10, 5, 3, 21, 19, 65, 62, 16, 11,253,253,253,253,253,
159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,
175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,
191,192,193,194,195,196,197, 75,198,199,200,201,202,203,204,205,
79,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,
221, 51, 81,222, 78,223,224,225,226, 44,227,228,229, 61,230,231,
232,233,234, 58,235, 66, 59,236,237,238, 60, 69, 63,239,240,241,
82, 14, 74,242, 70, 80,243, 72,244, 15, 83, 77, 84, 30, 76, 85,
245,246,247, 25, 73, 42, 24,248,249,250, 31, 56, 29,251,252,253,
)
win1250HungarianCharToOrderMap = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 28, 40, 54, 45, 32, 50, 49, 38, 39, 53, 36, 41, 34, 35, 47,
46, 72, 43, 33, 37, 57, 48, 64, 68, 55, 52,253,253,253,253,253,
253, 2, 18, 26, 17, 1, 27, 12, 20, 9, 22, 7, 6, 13, 4, 8,
23, 67, 10, 5, 3, 21, 19, 65, 62, 16, 11,253,253,253,253,253,
161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,
177,178,179,180, 78,181, 69,182,183,184,185,186,187,188,189,190,
191,192,193,194,195,196,197, 76,198,199,200,201,202,203,204,205,
81,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,
221, 51, 83,222, 80,223,224,225,226, 44,227,228,229, 61,230,231,
232,233,234, 58,235, 66, 59,236,237,238, 60, 70, 63,239,240,241,
84, 14, 75,242, 71, 82,243, 73,244, 15, 85, 79, 86, 30, 77, 87,
245,246,247, 25, 74, 42, 24,248,249,250, 31, 56, 29,251,252,253,
)
# Model Table:
# total sequences: 100%
# first 512 sequences: 94.7368%
# first 1024 sequences:5.2623%
# rest sequences: 0.8894%
# negative sequences: 0.0009%
HungarianLangModel = (
0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,2,2,3,3,1,1,2,2,2,2,2,1,2,
3,2,2,3,3,3,3,3,2,3,3,3,3,3,3,1,2,3,3,3,3,2,3,3,1,1,3,3,0,1,1,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,
3,2,1,3,3,3,3,3,2,3,3,3,3,3,1,1,2,3,3,3,3,3,3,3,1,1,3,2,0,1,1,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,1,1,2,3,3,3,1,3,3,3,3,3,1,3,3,2,2,0,3,2,3,
0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,3,3,3,2,3,3,2,3,3,3,3,3,2,3,3,2,2,3,2,3,2,0,3,2,2,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,
3,3,3,3,3,3,2,3,3,3,3,3,2,3,3,3,1,2,3,2,2,3,1,2,3,3,2,2,0,3,3,3,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,0,2,3,2,
0,0,0,1,1,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,1,1,1,3,3,2,1,3,2,2,3,2,1,3,2,2,1,0,3,3,1,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,2,2,3,3,3,3,3,1,2,3,3,3,3,1,2,1,3,3,3,3,2,2,3,1,1,3,2,0,1,1,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,2,1,3,3,3,3,3,2,2,1,3,3,3,0,1,1,2,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,0,3,2,3,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,1,0,
3,3,3,3,3,3,2,3,3,3,2,3,2,3,3,3,1,3,2,2,2,3,1,1,3,3,1,1,0,3,3,2,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,2,3,3,3,2,3,2,3,3,3,2,3,3,3,3,3,1,2,3,2,2,0,2,2,2,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,2,2,2,3,1,3,3,2,2,1,3,3,3,1,1,3,1,2,3,2,3,2,2,2,1,0,2,2,2,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
3,1,1,3,3,3,3,3,1,2,3,3,3,3,1,2,1,3,3,3,2,2,3,2,1,0,3,2,0,1,1,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,1,3,3,3,3,3,1,2,3,3,3,3,1,1,0,3,3,3,3,0,2,3,0,0,2,1,0,1,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,2,2,3,3,2,2,2,2,3,3,0,1,2,3,2,3,2,2,3,2,1,2,0,2,2,2,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
3,3,3,3,3,3,1,2,3,3,3,2,1,2,3,3,2,2,2,3,2,3,3,1,3,3,1,1,0,2,3,2,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,1,2,2,2,2,3,3,3,1,1,1,3,3,1,1,3,1,1,3,2,1,2,3,1,1,0,2,2,2,
0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,2,1,2,1,1,3,3,1,1,1,1,3,3,1,1,2,2,1,2,1,1,2,2,1,1,0,2,2,1,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,1,1,2,1,1,3,3,1,0,1,1,3,3,2,0,1,1,2,3,1,0,2,2,1,0,0,1,3,2,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,2,1,3,3,3,3,3,1,2,3,2,3,3,2,1,1,3,2,3,2,1,2,2,0,1,2,1,0,0,1,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,2,2,2,2,3,1,2,2,1,1,3,3,0,3,2,1,2,3,2,1,3,3,1,1,0,2,1,3,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,3,3,2,2,2,3,2,3,3,3,2,1,1,3,3,1,1,1,2,2,3,2,3,2,2,2,1,0,2,2,1,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
1,0,0,3,3,3,3,3,0,0,3,3,2,3,0,0,0,2,3,3,1,0,1,2,0,0,1,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,2,3,3,3,3,3,1,2,3,3,2,2,1,1,0,3,3,2,2,1,2,2,1,0,2,2,0,1,1,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,2,2,1,3,1,2,3,3,2,2,1,1,2,2,1,1,1,1,3,2,1,1,1,1,2,1,0,1,2,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
2,3,3,1,1,1,1,1,3,3,3,0,1,1,3,3,1,1,1,1,1,2,2,0,3,1,1,2,0,2,1,1,
0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
3,1,0,1,2,1,2,2,0,1,2,3,1,2,0,0,0,2,1,1,1,1,1,2,0,0,1,1,0,0,0,0,
1,2,1,2,2,2,1,2,1,2,0,2,0,2,2,1,1,2,1,1,2,1,1,1,0,1,0,0,0,1,1,0,
1,1,1,2,3,2,3,3,0,1,2,2,3,1,0,1,0,2,1,2,2,0,1,1,0,0,1,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,3,3,2,2,1,0,0,3,2,3,2,0,0,0,1,1,3,0,0,1,1,0,0,2,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,1,2,2,3,3,1,0,1,3,2,3,1,1,1,0,1,1,1,1,1,3,1,0,0,2,2,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,1,1,2,2,2,1,0,1,2,3,3,2,0,0,0,2,1,1,1,2,1,1,1,0,1,1,1,0,0,0,
1,2,2,2,2,2,1,1,1,2,0,2,1,1,1,1,1,2,1,1,1,1,1,1,0,1,1,1,0,0,1,1,
3,2,2,1,0,0,1,1,2,2,0,3,0,1,2,1,1,0,0,1,1,1,0,1,1,1,1,0,2,1,1,1,
2,2,1,1,1,2,1,2,1,1,1,1,1,1,1,2,1,1,1,2,3,1,1,1,1,1,1,1,1,1,0,1,
2,3,3,0,1,0,0,0,3,3,1,0,0,1,2,2,1,0,0,0,0,2,0,0,1,1,1,0,2,1,1,1,
2,1,1,1,1,1,1,2,1,1,0,1,1,0,1,1,1,0,1,2,1,1,0,1,1,1,1,1,1,1,0,1,
2,3,3,0,1,0,0,0,2,2,0,0,0,0,1,2,2,0,0,0,0,1,0,0,1,1,0,0,2,0,1,0,
2,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,0,1,1,1,1,1,0,1,
3,2,2,0,1,0,1,0,2,3,2,0,0,1,2,2,1,0,0,1,1,1,0,0,2,1,0,1,2,2,1,1,
2,1,1,1,1,1,1,2,1,1,1,1,1,1,0,2,1,0,1,1,0,1,1,1,0,1,1,2,1,1,0,1,
2,2,2,0,0,1,0,0,2,2,1,1,0,0,2,1,1,0,0,0,1,2,0,0,2,1,0,0,2,1,1,1,
2,1,1,1,1,2,1,2,1,1,1,2,2,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,0,1,
1,2,3,0,0,0,1,0,3,2,1,0,0,1,2,1,1,0,0,0,0,2,1,0,1,1,0,0,2,1,2,1,
1,1,0,0,0,1,0,1,1,1,1,1,2,0,0,1,0,0,0,2,0,0,1,1,1,1,1,1,1,1,0,1,
3,0,0,2,1,2,2,1,0,0,2,1,2,2,0,0,0,2,1,1,1,0,1,1,0,0,1,1,2,0,0,0,
1,2,1,2,2,1,1,2,1,2,0,1,1,1,1,1,1,1,1,1,2,1,1,0,0,1,1,1,1,0,0,1,
1,3,2,0,0,0,1,0,2,2,2,0,0,0,2,2,1,0,0,0,0,3,1,1,1,1,0,0,2,1,1,1,
2,1,0,1,1,1,0,1,1,1,1,1,1,1,0,2,1,0,0,1,0,1,1,0,1,1,1,1,1,1,0,1,
2,3,2,0,0,0,1,0,2,2,0,0,0,0,2,1,1,0,0,0,0,2,1,0,1,1,0,0,2,1,1,0,
2,1,1,1,1,2,1,2,1,2,0,1,1,1,0,2,1,1,1,2,1,1,1,1,0,1,1,1,1,1,0,1,
3,1,1,2,2,2,3,2,1,1,2,2,1,1,0,1,0,2,2,1,1,1,1,1,0,0,1,1,0,1,1,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,0,0,0,0,0,2,2,0,0,0,0,2,2,1,0,0,0,1,1,0,0,1,2,0,0,2,1,1,1,
2,2,1,1,1,2,1,2,1,1,0,1,1,1,1,2,1,1,1,2,1,1,1,1,0,1,2,1,1,1,0,1,
1,0,0,1,2,3,2,1,0,0,2,0,1,1,0,0,0,1,1,1,1,0,1,1,0,0,1,0,0,0,0,0,
1,2,1,2,1,2,1,1,1,2,0,2,1,1,1,0,1,2,0,0,1,1,1,0,0,0,0,0,0,0,0,0,
2,3,2,0,0,0,0,0,1,1,2,1,0,0,1,1,1,0,0,0,0,2,0,0,1,1,0,0,2,1,1,1,
2,1,1,1,1,1,1,2,1,0,1,1,1,1,0,2,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,
1,2,2,0,1,1,1,0,2,2,2,0,0,0,3,2,1,0,0,0,1,1,0,0,1,1,0,1,1,1,0,0,
1,1,0,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,0,0,1,1,1,0,1,0,1,
2,1,0,2,1,1,2,2,1,1,2,1,1,1,0,0,0,1,1,0,1,1,1,1,0,0,1,1,1,0,0,0,
1,2,2,2,2,2,1,1,1,2,0,2,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,1,0,
1,2,3,0,0,0,1,0,2,2,0,0,0,0,2,2,0,0,0,0,0,1,0,0,1,0,0,0,2,0,1,0,
2,1,1,1,1,1,0,2,0,0,0,1,2,1,1,1,1,0,1,2,0,1,0,1,0,1,1,1,0,1,0,1,
2,2,2,0,0,0,1,0,2,1,2,0,0,0,1,1,2,0,0,0,0,1,0,0,1,1,0,0,2,1,0,1,
2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,0,1,1,1,1,1,0,1,
1,2,2,0,0,0,1,0,2,2,2,0,0,0,1,1,0,0,0,0,0,1,1,0,2,0,0,1,1,1,0,1,
1,0,1,1,1,1,1,1,0,1,1,1,1,0,0,1,0,0,1,1,0,1,0,1,1,1,1,1,0,0,0,1,
1,0,0,1,0,1,2,1,0,0,1,1,1,2,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,0,0,
0,2,1,2,1,1,1,1,1,2,0,2,0,1,1,0,1,2,1,0,1,1,1,0,0,0,0,0,0,1,0,0,
2,1,1,0,1,2,0,0,1,1,1,0,0,0,1,1,0,0,0,0,0,1,0,0,1,0,0,0,2,1,0,1,
2,2,1,1,1,1,1,2,1,1,0,1,1,1,1,2,1,1,1,2,1,1,0,1,0,1,1,1,1,1,0,1,
1,2,2,0,0,0,0,0,1,1,0,0,0,0,2,1,0,0,0,0,0,2,0,0,2,2,0,0,2,0,0,1,
2,1,1,1,1,1,1,1,0,1,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,
1,1,2,0,0,3,1,0,2,1,1,1,0,0,1,1,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,
1,2,1,0,1,1,1,2,1,1,0,1,1,1,1,1,0,0,0,1,1,1,1,1,0,1,0,0,0,1,0,0,
2,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,2,0,0,0,
2,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,2,1,1,0,0,1,1,1,1,1,0,1,
2,1,1,1,2,1,1,1,0,1,1,2,1,0,0,0,0,1,1,1,1,0,1,0,0,0,0,1,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,1,0,1,1,1,1,1,0,0,1,1,2,1,0,0,0,1,1,0,0,0,1,1,0,0,1,0,1,0,0,0,
1,2,1,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,0,0,
2,0,0,0,1,1,1,1,0,0,1,1,0,0,0,0,0,1,1,1,2,0,0,1,0,0,1,0,1,0,0,0,
0,1,1,1,1,1,1,1,1,2,0,1,1,1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,
1,0,0,1,1,1,1,1,0,0,2,1,0,1,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,
0,1,1,1,1,1,1,0,1,1,0,1,0,1,1,0,1,1,0,0,1,1,1,0,0,0,0,0,0,0,0,0,
1,0,0,1,1,1,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
0,1,1,1,1,1,0,0,1,1,0,1,0,1,0,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,
0,0,0,1,0,0,0,0,0,0,1,1,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,1,1,1,0,1,0,0,1,1,0,1,0,1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,
2,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,0,0,1,0,0,1,0,1,0,1,1,1,0,0,1,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,1,1,1,1,0,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,
0,1,1,1,1,1,1,0,1,1,0,1,0,1,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
)
Latin2HungarianModel = {
'char_to_order_map': Latin2_HungarianCharToOrderMap,
'precedence_matrix': HungarianLangModel,
'typical_positive_ratio': 0.947368,
'keep_english_letter': True,
'charset_name': "ISO-8859-2",
'language': 'Hungarian',
}
Win1250HungarianModel = {
'char_to_order_map': win1250HungarianCharToOrderMap,
'precedence_matrix': HungarianLangModel,
'typical_positive_ratio': 0.947368,
'keep_english_letter': True,
'charset_name': "windows-1250",
'language': 'Hungarian',
}
pip/_vendor/chardet/langthaimodel.py 0000644 00000026032 14751155150 0013573 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# 255: Control characters that usually does not exist in any text
# 254: Carriage/Return
# 253: symbol (punctuation) that does not belong to word
# 252: 0 - 9
# The following result for thai was collected from a limited sample (1M).
# Character Mapping Table:
TIS620CharToOrderMap = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253,182,106,107,100,183,184,185,101, 94,186,187,108,109,110,111, # 40
188,189,190, 89, 95,112,113,191,192,193,194,253,253,253,253,253, # 50
253, 64, 72, 73,114, 74,115,116,102, 81,201,117, 90,103, 78, 82, # 60
96,202, 91, 79, 84,104,105, 97, 98, 92,203,253,253,253,253,253, # 70
209,210,211,212,213, 88,214,215,216,217,218,219,220,118,221,222,
223,224, 99, 85, 83,225,226,227,228,229,230,231,232,233,234,235,
236, 5, 30,237, 24,238, 75, 8, 26, 52, 34, 51,119, 47, 58, 57,
49, 53, 55, 43, 20, 19, 44, 14, 48, 3, 17, 25, 39, 62, 31, 54,
45, 9, 16, 2, 61, 15,239, 12, 42, 46, 18, 21, 76, 4, 66, 63,
22, 10, 1, 36, 23, 13, 40, 27, 32, 35, 86,240,241,242,243,244,
11, 28, 41, 29, 33,245, 50, 37, 6, 7, 67, 77, 38, 93,246,247,
68, 56, 59, 65, 69, 60, 70, 80, 71, 87,248,249,250,251,252,253,
)
# Model Table:
# total sequences: 100%
# first 512 sequences: 92.6386%
# first 1024 sequences:7.3177%
# rest sequences: 1.0230%
# negative sequences: 0.0436%
ThaiLangModel = (
0,1,3,3,3,3,0,0,3,3,0,3,3,0,3,3,3,3,3,3,3,3,0,0,3,3,3,0,3,3,3,3,
0,3,3,0,0,0,1,3,0,3,3,2,3,3,0,1,2,3,3,3,3,0,2,0,2,0,0,3,2,1,2,2,
3,0,3,3,2,3,0,0,3,3,0,3,3,0,3,3,3,3,3,3,3,3,3,0,3,2,3,0,2,2,2,3,
0,2,3,0,0,0,0,1,0,1,2,3,1,1,3,2,2,0,1,1,0,0,1,0,0,0,0,0,0,0,1,1,
3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,3,3,2,3,2,3,3,2,2,2,
3,1,2,3,0,3,3,2,2,1,2,3,3,1,2,0,1,3,0,1,0,0,1,0,0,0,0,0,0,0,1,1,
3,3,2,2,3,3,3,3,1,2,3,3,3,3,3,2,2,2,2,3,3,2,2,3,3,2,2,3,2,3,2,2,
3,3,1,2,3,1,2,2,3,3,1,0,2,1,0,0,3,1,2,1,0,0,1,0,0,0,0,0,0,1,0,1,
3,3,3,3,3,3,2,2,3,3,3,3,2,3,2,2,3,3,2,2,3,2,2,2,2,1,1,3,1,2,1,1,
3,2,1,0,2,1,0,1,0,1,1,0,1,1,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,
3,3,3,2,3,2,3,3,2,2,3,2,3,3,2,3,1,1,2,3,2,2,2,3,2,2,2,2,2,1,2,1,
2,2,1,1,3,3,2,1,0,1,2,2,0,1,3,0,0,0,1,1,0,0,0,0,0,2,3,0,0,2,1,1,
3,3,2,3,3,2,0,0,3,3,0,3,3,0,2,2,3,1,2,2,1,1,1,0,2,2,2,0,2,2,1,1,
0,2,1,0,2,0,0,2,0,1,0,0,1,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,2,3,3,2,0,0,3,3,0,2,3,0,2,1,2,2,2,2,1,2,0,0,2,2,2,0,2,2,1,1,
0,2,1,0,2,0,0,2,0,1,1,0,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,
3,3,2,3,2,3,2,0,2,2,1,3,2,1,3,2,1,2,3,2,2,3,0,2,3,2,2,1,2,2,2,2,
1,2,2,0,0,0,0,2,0,1,2,0,1,1,1,0,1,0,3,1,1,0,0,0,0,0,0,0,0,0,1,0,
3,3,2,3,3,2,3,2,2,2,3,2,2,3,2,2,1,2,3,2,2,3,1,3,2,2,2,3,2,2,2,3,
3,2,1,3,0,1,1,1,0,2,1,1,1,1,1,0,1,0,1,1,0,0,0,0,0,0,0,0,0,2,0,0,
1,0,0,3,0,3,3,3,3,3,0,0,3,0,2,2,3,3,3,3,3,0,0,0,1,1,3,0,0,0,0,2,
0,0,1,0,0,0,0,0,0,0,2,3,0,0,0,3,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,
2,0,3,3,3,3,0,0,2,3,0,0,3,0,3,3,2,3,3,3,3,3,0,0,3,3,3,0,0,0,3,3,
0,0,3,0,0,0,0,2,0,0,2,1,1,3,0,0,1,0,0,2,3,0,1,0,0,0,0,0,0,0,1,0,
3,3,3,3,2,3,3,3,3,3,3,3,1,2,1,3,3,2,2,1,2,2,2,3,1,1,2,0,2,1,2,1,
2,2,1,0,0,0,1,1,0,1,0,1,1,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,
3,0,2,1,2,3,3,3,0,2,0,2,2,0,2,1,3,2,2,1,2,1,0,0,2,2,1,0,2,1,2,2,
0,1,1,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,2,1,3,3,1,1,3,0,2,3,1,1,3,2,1,1,2,0,2,2,3,2,1,1,1,1,1,2,
3,0,0,1,3,1,2,1,2,0,3,0,0,0,1,0,3,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
3,3,1,1,3,2,3,3,3,1,3,2,1,3,2,1,3,2,2,2,2,1,3,3,1,2,1,3,1,2,3,0,
2,1,1,3,2,2,2,1,2,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,
3,3,2,3,2,3,3,2,3,2,3,2,3,3,2,1,0,3,2,2,2,1,2,2,2,1,2,2,1,2,1,1,
2,2,2,3,0,1,3,1,1,1,1,0,1,1,0,2,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,2,3,2,2,1,1,3,2,3,2,3,2,0,3,2,2,1,2,0,2,2,2,1,2,2,2,2,1,
3,2,1,2,2,1,0,2,0,1,0,0,1,1,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,1,
3,3,3,3,3,2,3,1,2,3,3,2,2,3,0,1,1,2,0,3,3,2,2,3,0,1,1,3,0,0,0,0,
3,1,0,3,3,0,2,0,2,1,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,2,3,2,3,3,0,1,3,1,1,2,1,2,1,1,3,1,1,0,2,3,1,1,1,1,1,1,1,1,
3,1,1,2,2,2,2,1,1,1,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
3,2,2,1,1,2,1,3,3,2,3,2,2,3,2,2,3,1,2,2,1,2,0,3,2,1,2,2,2,2,2,1,
3,2,1,2,2,2,1,1,1,1,0,0,1,1,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,1,3,3,0,2,1,0,3,2,0,0,3,1,0,1,1,0,1,0,0,0,0,0,1,
1,0,0,1,0,3,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,2,2,2,3,0,0,1,3,0,3,2,0,3,2,2,3,3,3,3,3,1,0,2,2,2,0,2,2,1,2,
0,2,3,0,0,0,0,1,0,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
3,0,2,3,1,3,3,2,3,3,0,3,3,0,3,2,2,3,2,3,3,3,0,0,2,2,3,0,1,1,1,3,
0,0,3,0,0,0,2,2,0,1,3,0,1,2,2,2,3,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,
3,2,3,3,2,0,3,3,2,2,3,1,3,2,1,3,2,0,1,2,2,0,2,3,2,1,0,3,0,0,0,0,
3,0,0,2,3,1,3,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,3,2,2,2,1,2,0,1,3,1,1,3,1,3,0,0,2,1,1,1,1,2,1,1,1,0,2,1,0,1,
1,2,0,0,0,3,1,1,0,0,0,0,1,0,1,0,0,1,0,1,0,0,0,0,0,3,1,0,0,0,1,0,
3,3,3,3,2,2,2,2,2,1,3,1,1,1,2,0,1,1,2,1,2,1,3,2,0,0,3,1,1,1,1,1,
3,1,0,2,3,0,0,0,3,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,2,3,0,3,3,0,2,0,0,0,0,0,0,0,3,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,2,3,1,3,0,0,1,2,0,0,2,0,3,3,2,3,3,3,2,3,0,0,2,2,2,0,0,0,2,2,
0,0,1,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
0,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,1,2,3,1,3,3,0,0,1,0,3,0,0,0,0,0,
0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,1,2,3,1,2,3,1,0,3,0,2,2,1,0,2,1,1,2,0,1,0,0,1,1,1,1,0,1,0,0,
1,0,0,0,0,1,1,0,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,2,1,0,1,1,1,3,1,2,2,2,2,2,2,1,1,1,1,0,3,1,0,1,3,1,1,1,1,
1,1,0,2,0,1,3,1,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,1,
3,0,2,2,1,3,3,2,3,3,0,1,1,0,2,2,1,2,1,3,3,1,0,0,3,2,0,0,0,0,2,1,
0,1,0,0,0,0,1,2,0,1,1,3,1,1,2,2,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
0,0,3,0,0,1,0,0,0,3,0,0,3,0,3,1,0,1,1,1,3,2,0,0,0,3,0,0,0,0,2,0,
0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,
3,3,1,3,2,1,3,3,1,2,2,0,1,2,1,0,1,2,0,0,0,0,0,3,0,0,0,3,0,0,0,0,
3,0,0,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,1,2,0,3,3,3,2,2,0,1,1,0,1,3,0,0,0,2,2,0,0,0,0,3,1,0,1,0,0,0,
0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,2,3,1,2,0,0,2,1,0,3,1,0,1,2,0,1,1,1,1,3,0,0,3,1,1,0,2,2,1,1,
0,2,0,0,0,0,0,1,0,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,0,3,1,2,0,0,2,2,0,1,2,0,1,0,1,3,1,2,1,0,0,0,2,0,3,0,0,0,1,0,
0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,1,1,2,2,0,0,0,2,0,2,1,0,1,1,0,1,1,1,2,1,0,0,1,1,1,0,2,1,1,1,
0,1,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,1,
0,0,0,2,0,1,3,1,1,1,1,0,0,0,0,3,2,0,1,0,0,0,1,2,0,0,0,1,0,0,0,0,
0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,3,3,3,3,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,2,3,2,2,0,0,0,1,0,0,0,0,2,3,2,1,2,2,3,0,0,0,2,3,1,0,0,0,1,1,
0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,
3,3,2,2,0,1,0,0,0,0,2,0,2,0,1,0,0,0,1,1,0,0,0,2,1,0,1,0,1,1,0,0,
0,1,0,2,0,0,1,0,3,0,1,0,0,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,1,0,0,1,0,0,0,0,0,1,1,2,0,0,0,0,1,0,0,1,3,1,0,0,0,0,1,1,0,0,
0,1,0,0,0,0,3,0,0,0,0,0,0,3,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,
3,3,1,1,1,1,2,3,0,0,2,1,1,1,1,1,0,2,1,1,0,0,0,2,1,0,1,2,1,1,0,1,
2,1,0,3,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,3,1,0,0,0,0,0,0,0,3,0,0,0,3,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,
0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,2,0,0,0,0,0,0,1,2,1,0,1,1,0,2,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,2,0,0,0,1,3,0,1,0,0,0,2,0,0,0,0,0,0,0,1,2,0,0,0,0,0,
3,3,0,0,1,1,2,0,0,1,2,1,0,1,1,1,0,1,1,0,0,2,1,1,0,1,0,0,1,1,1,0,
0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,1,0,0,0,0,1,0,0,0,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,
2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,0,0,1,1,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,1,0,1,2,0,1,2,0,0,1,1,0,2,0,1,0,0,1,0,0,0,0,1,0,0,0,2,0,0,0,0,
1,0,0,1,0,1,1,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,1,0,0,0,0,0,0,0,1,1,0,1,1,0,2,1,3,0,0,0,0,1,1,0,0,0,0,0,0,0,3,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,1,0,1,0,0,2,0,0,2,0,0,1,1,2,0,0,1,1,0,0,0,1,0,0,0,1,1,0,0,0,
1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
1,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,1,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,3,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,
1,0,0,0,0,0,0,0,0,1,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,1,1,0,0,2,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
)
TIS620ThaiModel = {
'char_to_order_map': TIS620CharToOrderMap,
'precedence_matrix': ThaiLangModel,
'typical_positive_ratio': 0.926386,
'keep_english_letter': False,
'charset_name': "TIS-620",
'language': 'Thai',
}
pip/_vendor/chardet/escprober.py 0000644 00000007556 14751155150 0012761 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetprober import CharSetProber
from .codingstatemachine import CodingStateMachine
from .enums import LanguageFilter, ProbingState, MachineState
from .escsm import (HZ_SM_MODEL, ISO2022CN_SM_MODEL, ISO2022JP_SM_MODEL,
ISO2022KR_SM_MODEL)
class EscCharSetProber(CharSetProber):
"""
This CharSetProber uses a "code scheme" approach for detecting encodings,
whereby easily recognizable escape or shift sequences are relied on to
identify these encodings.
"""
def __init__(self, lang_filter=None):
super(EscCharSetProber, self).__init__(lang_filter=lang_filter)
self.coding_sm = []
if self.lang_filter & LanguageFilter.CHINESE_SIMPLIFIED:
self.coding_sm.append(CodingStateMachine(HZ_SM_MODEL))
self.coding_sm.append(CodingStateMachine(ISO2022CN_SM_MODEL))
if self.lang_filter & LanguageFilter.JAPANESE:
self.coding_sm.append(CodingStateMachine(ISO2022JP_SM_MODEL))
if self.lang_filter & LanguageFilter.KOREAN:
self.coding_sm.append(CodingStateMachine(ISO2022KR_SM_MODEL))
self.active_sm_count = None
self._detected_charset = None
self._detected_language = None
self._state = None
self.reset()
def reset(self):
super(EscCharSetProber, self).reset()
for coding_sm in self.coding_sm:
if not coding_sm:
continue
coding_sm.active = True
coding_sm.reset()
self.active_sm_count = len(self.coding_sm)
self._detected_charset = None
self._detected_language = None
@property
def charset_name(self):
return self._detected_charset
@property
def language(self):
return self._detected_language
def get_confidence(self):
if self._detected_charset:
return 0.99
else:
return 0.00
def feed(self, byte_str):
for c in byte_str:
for coding_sm in self.coding_sm:
if not coding_sm or not coding_sm.active:
continue
coding_state = coding_sm.next_state(c)
if coding_state == MachineState.ERROR:
coding_sm.active = False
self.active_sm_count -= 1
if self.active_sm_count <= 0:
self._state = ProbingState.NOT_ME
return self.state
elif coding_state == MachineState.ITS_ME:
self._state = ProbingState.FOUND_IT
self._detected_charset = coding_sm.get_coding_state_machine()
self._detected_language = coding_sm.language
return self.state
return self.state
pip/_vendor/chardet/latin1prober.py 0000644 00000012372 14751155150 0013367 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 2001
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetprober import CharSetProber
from .enums import ProbingState
FREQ_CAT_NUM = 4
UDF = 0 # undefined
OTH = 1 # other
ASC = 2 # ascii capital letter
ASS = 3 # ascii small letter
ACV = 4 # accent capital vowel
ACO = 5 # accent capital other
ASV = 6 # accent small vowel
ASO = 7 # accent small other
CLASS_NUM = 8 # total classes
Latin1_CharToClass = (
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 00 - 07
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 08 - 0F
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 10 - 17
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 18 - 1F
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 20 - 27
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 28 - 2F
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 30 - 37
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 38 - 3F
OTH, ASC, ASC, ASC, ASC, ASC, ASC, ASC, # 40 - 47
ASC, ASC, ASC, ASC, ASC, ASC, ASC, ASC, # 48 - 4F
ASC, ASC, ASC, ASC, ASC, ASC, ASC, ASC, # 50 - 57
ASC, ASC, ASC, OTH, OTH, OTH, OTH, OTH, # 58 - 5F
OTH, ASS, ASS, ASS, ASS, ASS, ASS, ASS, # 60 - 67
ASS, ASS, ASS, ASS, ASS, ASS, ASS, ASS, # 68 - 6F
ASS, ASS, ASS, ASS, ASS, ASS, ASS, ASS, # 70 - 77
ASS, ASS, ASS, OTH, OTH, OTH, OTH, OTH, # 78 - 7F
OTH, UDF, OTH, ASO, OTH, OTH, OTH, OTH, # 80 - 87
OTH, OTH, ACO, OTH, ACO, UDF, ACO, UDF, # 88 - 8F
UDF, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # 90 - 97
OTH, OTH, ASO, OTH, ASO, UDF, ASO, ACO, # 98 - 9F
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # A0 - A7
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # A8 - AF
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # B0 - B7
OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH, # B8 - BF
ACV, ACV, ACV, ACV, ACV, ACV, ACO, ACO, # C0 - C7
ACV, ACV, ACV, ACV, ACV, ACV, ACV, ACV, # C8 - CF
ACO, ACO, ACV, ACV, ACV, ACV, ACV, OTH, # D0 - D7
ACV, ACV, ACV, ACV, ACV, ACO, ACO, ACO, # D8 - DF
ASV, ASV, ASV, ASV, ASV, ASV, ASO, ASO, # E0 - E7
ASV, ASV, ASV, ASV, ASV, ASV, ASV, ASV, # E8 - EF
ASO, ASO, ASV, ASV, ASV, ASV, ASV, OTH, # F0 - F7
ASV, ASV, ASV, ASV, ASV, ASO, ASO, ASO, # F8 - FF
)
# 0 : illegal
# 1 : very unlikely
# 2 : normal
# 3 : very likely
Latin1ClassModel = (
# UDF OTH ASC ASS ACV ACO ASV ASO
0, 0, 0, 0, 0, 0, 0, 0, # UDF
0, 3, 3, 3, 3, 3, 3, 3, # OTH
0, 3, 3, 3, 3, 3, 3, 3, # ASC
0, 3, 3, 3, 1, 1, 3, 3, # ASS
0, 3, 3, 3, 1, 2, 1, 2, # ACV
0, 3, 3, 3, 3, 3, 3, 3, # ACO
0, 3, 1, 3, 1, 1, 1, 3, # ASV
0, 3, 1, 3, 1, 1, 3, 3, # ASO
)
class Latin1Prober(CharSetProber):
def __init__(self):
super(Latin1Prober, self).__init__()
self._last_char_class = None
self._freq_counter = None
self.reset()
def reset(self):
self._last_char_class = OTH
self._freq_counter = [0] * FREQ_CAT_NUM
CharSetProber.reset(self)
@property
def charset_name(self):
return "ISO-8859-1"
@property
def language(self):
return ""
def feed(self, byte_str):
byte_str = self.filter_with_english_letters(byte_str)
for c in byte_str:
char_class = Latin1_CharToClass[c]
freq = Latin1ClassModel[(self._last_char_class * CLASS_NUM)
+ char_class]
if freq == 0:
self._state = ProbingState.NOT_ME
break
self._freq_counter[freq] += 1
self._last_char_class = char_class
return self.state
def get_confidence(self):
if self.state == ProbingState.NOT_ME:
return 0.01
total = sum(self._freq_counter)
if total < 0.01:
confidence = 0.0
else:
confidence = ((self._freq_counter[3] - self._freq_counter[1] * 20.0)
/ total)
if confidence < 0.0:
confidence = 0.0
# lower the confidence of latin1 so that other more accurate
# detector can take priority.
confidence = confidence * 0.73
return confidence
pip/_vendor/chardet/euctwfreq.py 0000644 00000075605 14751155150 0013002 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# EUCTW frequency table
# Converted from big5 work
# by Taiwan's Mandarin Promotion Council
# <http:#www.edu.tw:81/mandr/>
# 128 --> 0.42261
# 256 --> 0.57851
# 512 --> 0.74851
# 1024 --> 0.89384
# 2048 --> 0.97583
#
# Idea Distribution Ratio = 0.74851/(1-0.74851) =2.98
# Random Distribution Ration = 512/(5401-512)=0.105
#
# Typical Distribution Ratio about 25% of Ideal one, still much higher than RDR
EUCTW_TYPICAL_DISTRIBUTION_RATIO = 0.75
# Char to FreqOrder table ,
EUCTW_TABLE_SIZE = 5376
EUCTW_CHAR_TO_FREQ_ORDER = (
1,1800,1506, 255,1431, 198, 9, 82, 6,7310, 177, 202,3615,1256,2808, 110, # 2742
3735, 33,3241, 261, 76, 44,2113, 16,2931,2184,1176, 659,3868, 26,3404,2643, # 2758
1198,3869,3313,4060, 410,2211, 302, 590, 361,1963, 8, 204, 58,4296,7311,1931, # 2774
63,7312,7313, 317,1614, 75, 222, 159,4061,2412,1480,7314,3500,3068, 224,2809, # 2790
3616, 3, 10,3870,1471, 29,2774,1135,2852,1939, 873, 130,3242,1123, 312,7315, # 2806
4297,2051, 507, 252, 682,7316, 142,1914, 124, 206,2932, 34,3501,3173, 64, 604, # 2822
7317,2494,1976,1977, 155,1990, 645, 641,1606,7318,3405, 337, 72, 406,7319, 80, # 2838
630, 238,3174,1509, 263, 939,1092,2644, 756,1440,1094,3406, 449, 69,2969, 591, # 2854
179,2095, 471, 115,2034,1843, 60, 50,2970, 134, 806,1868, 734,2035,3407, 180, # 2870
995,1607, 156, 537,2893, 688,7320, 319,1305, 779,2144, 514,2374, 298,4298, 359, # 2886
2495, 90,2707,1338, 663, 11, 906,1099,2545, 20,2436, 182, 532,1716,7321, 732, # 2902
1376,4062,1311,1420,3175, 25,2312,1056, 113, 399, 382,1949, 242,3408,2467, 529, # 2918
3243, 475,1447,3617,7322, 117, 21, 656, 810,1297,2295,2329,3502,7323, 126,4063, # 2934
706, 456, 150, 613,4299, 71,1118,2036,4064, 145,3069, 85, 835, 486,2114,1246, # 2950
1426, 428, 727,1285,1015, 800, 106, 623, 303,1281,7324,2127,2354, 347,3736, 221, # 2966
3503,3110,7325,1955,1153,4065, 83, 296,1199,3070, 192, 624, 93,7326, 822,1897, # 2982
2810,3111, 795,2064, 991,1554,1542,1592, 27, 43,2853, 859, 139,1456, 860,4300, # 2998
437, 712,3871, 164,2392,3112, 695, 211,3017,2096, 195,3872,1608,3504,3505,3618, # 3014
3873, 234, 811,2971,2097,3874,2229,1441,3506,1615,2375, 668,2076,1638, 305, 228, # 3030
1664,4301, 467, 415,7327, 262,2098,1593, 239, 108, 300, 200,1033, 512,1247,2077, # 3046
7328,7329,2173,3176,3619,2673, 593, 845,1062,3244, 88,1723,2037,3875,1950, 212, # 3062
266, 152, 149, 468,1898,4066,4302, 77, 187,7330,3018, 37, 5,2972,7331,3876, # 3078
7332,7333, 39,2517,4303,2894,3177,2078, 55, 148, 74,4304, 545, 483,1474,1029, # 3094
1665, 217,1869,1531,3113,1104,2645,4067, 24, 172,3507, 900,3877,3508,3509,4305, # 3110
32,1408,2811,1312, 329, 487,2355,2247,2708, 784,2674, 4,3019,3314,1427,1788, # 3126
188, 109, 499,7334,3620,1717,1789, 888,1217,3020,4306,7335,3510,7336,3315,1520, # 3142
3621,3878, 196,1034, 775,7337,7338, 929,1815, 249, 439, 38,7339,1063,7340, 794, # 3158
3879,1435,2296, 46, 178,3245,2065,7341,2376,7342, 214,1709,4307, 804, 35, 707, # 3174
324,3622,1601,2546, 140, 459,4068,7343,7344,1365, 839, 272, 978,2257,2572,3409, # 3190
2128,1363,3623,1423, 697, 100,3071, 48, 70,1231, 495,3114,2193,7345,1294,7346, # 3206
2079, 462, 586,1042,3246, 853, 256, 988, 185,2377,3410,1698, 434,1084,7347,3411, # 3222
314,2615,2775,4308,2330,2331, 569,2280, 637,1816,2518, 757,1162,1878,1616,3412, # 3238
287,1577,2115, 768,4309,1671,2854,3511,2519,1321,3737, 909,2413,7348,4069, 933, # 3254
3738,7349,2052,2356,1222,4310, 765,2414,1322, 786,4311,7350,1919,1462,1677,2895, # 3270
1699,7351,4312,1424,2437,3115,3624,2590,3316,1774,1940,3413,3880,4070, 309,1369, # 3286
1130,2812, 364,2230,1653,1299,3881,3512,3882,3883,2646, 525,1085,3021, 902,2000, # 3302
1475, 964,4313, 421,1844,1415,1057,2281, 940,1364,3116, 376,4314,4315,1381, 7, # 3318
2520, 983,2378, 336,1710,2675,1845, 321,3414, 559,1131,3022,2742,1808,1132,1313, # 3334
265,1481,1857,7352, 352,1203,2813,3247, 167,1089, 420,2814, 776, 792,1724,3513, # 3350
4071,2438,3248,7353,4072,7354, 446, 229, 333,2743, 901,3739,1200,1557,4316,2647, # 3366
1920, 395,2744,2676,3740,4073,1835, 125, 916,3178,2616,4317,7355,7356,3741,7357, # 3382
7358,7359,4318,3117,3625,1133,2547,1757,3415,1510,2313,1409,3514,7360,2145, 438, # 3398
2591,2896,2379,3317,1068, 958,3023, 461, 311,2855,2677,4074,1915,3179,4075,1978, # 3414
383, 750,2745,2617,4076, 274, 539, 385,1278,1442,7361,1154,1964, 384, 561, 210, # 3430
98,1295,2548,3515,7362,1711,2415,1482,3416,3884,2897,1257, 129,7363,3742, 642, # 3446
523,2776,2777,2648,7364, 141,2231,1333, 68, 176, 441, 876, 907,4077, 603,2592, # 3462
710, 171,3417, 404, 549, 18,3118,2393,1410,3626,1666,7365,3516,4319,2898,4320, # 3478
7366,2973, 368,7367, 146, 366, 99, 871,3627,1543, 748, 807,1586,1185, 22,2258, # 3494
379,3743,3180,7368,3181, 505,1941,2618,1991,1382,2314,7369, 380,2357, 218, 702, # 3510
1817,1248,3418,3024,3517,3318,3249,7370,2974,3628, 930,3250,3744,7371, 59,7372, # 3526
585, 601,4078, 497,3419,1112,1314,4321,1801,7373,1223,1472,2174,7374, 749,1836, # 3542
690,1899,3745,1772,3885,1476, 429,1043,1790,2232,2116, 917,4079, 447,1086,1629, # 3558
7375, 556,7376,7377,2020,1654, 844,1090, 105, 550, 966,1758,2815,1008,1782, 686, # 3574
1095,7378,2282, 793,1602,7379,3518,2593,4322,4080,2933,2297,4323,3746, 980,2496, # 3590
544, 353, 527,4324, 908,2678,2899,7380, 381,2619,1942,1348,7381,1341,1252, 560, # 3606
3072,7382,3420,2856,7383,2053, 973, 886,2080, 143,4325,7384,7385, 157,3886, 496, # 3622
4081, 57, 840, 540,2038,4326,4327,3421,2117,1445, 970,2259,1748,1965,2081,4082, # 3638
3119,1234,1775,3251,2816,3629, 773,1206,2129,1066,2039,1326,3887,1738,1725,4083, # 3654
279,3120, 51,1544,2594, 423,1578,2130,2066, 173,4328,1879,7386,7387,1583, 264, # 3670
610,3630,4329,2439, 280, 154,7388,7389,7390,1739, 338,1282,3073, 693,2857,1411, # 3686
1074,3747,2440,7391,4330,7392,7393,1240, 952,2394,7394,2900,1538,2679, 685,1483, # 3702
4084,2468,1436, 953,4085,2054,4331, 671,2395, 79,4086,2441,3252, 608, 567,2680, # 3718
3422,4087,4088,1691, 393,1261,1791,2396,7395,4332,7396,7397,7398,7399,1383,1672, # 3734
3748,3182,1464, 522,1119, 661,1150, 216, 675,4333,3888,1432,3519, 609,4334,2681, # 3750
2397,7400,7401,7402,4089,3025, 0,7403,2469, 315, 231,2442, 301,3319,4335,2380, # 3766
7404, 233,4090,3631,1818,4336,4337,7405, 96,1776,1315,2082,7406, 257,7407,1809, # 3782
3632,2709,1139,1819,4091,2021,1124,2163,2778,1777,2649,7408,3074, 363,1655,3183, # 3798
7409,2975,7410,7411,7412,3889,1567,3890, 718, 103,3184, 849,1443, 341,3320,2934, # 3814
1484,7413,1712, 127, 67, 339,4092,2398, 679,1412, 821,7414,7415, 834, 738, 351, # 3830
2976,2146, 846, 235,1497,1880, 418,1992,3749,2710, 186,1100,2147,2746,3520,1545, # 3846
1355,2935,2858,1377, 583,3891,4093,2573,2977,7416,1298,3633,1078,2549,3634,2358, # 3862
78,3750,3751, 267,1289,2099,2001,1594,4094, 348, 369,1274,2194,2175,1837,4338, # 3878
1820,2817,3635,2747,2283,2002,4339,2936,2748, 144,3321, 882,4340,3892,2749,3423, # 3894
4341,2901,7417,4095,1726, 320,7418,3893,3026, 788,2978,7419,2818,1773,1327,2859, # 3910
3894,2819,7420,1306,4342,2003,1700,3752,3521,2359,2650, 787,2022, 506, 824,3636, # 3926
534, 323,4343,1044,3322,2023,1900, 946,3424,7421,1778,1500,1678,7422,1881,4344, # 3942
165, 243,4345,3637,2521, 123, 683,4096, 764,4346, 36,3895,1792, 589,2902, 816, # 3958
626,1667,3027,2233,1639,1555,1622,3753,3896,7423,3897,2860,1370,1228,1932, 891, # 3974
2083,2903, 304,4097,7424, 292,2979,2711,3522, 691,2100,4098,1115,4347, 118, 662, # 3990
7425, 611,1156, 854,2381,1316,2861, 2, 386, 515,2904,7426,7427,3253, 868,2234, # 4006
1486, 855,2651, 785,2212,3028,7428,1040,3185,3523,7429,3121, 448,7430,1525,7431, # 4022
2164,4348,7432,3754,7433,4099,2820,3524,3122, 503, 818,3898,3123,1568, 814, 676, # 4038
1444, 306,1749,7434,3755,1416,1030, 197,1428, 805,2821,1501,4349,7435,7436,7437, # 4054
1993,7438,4350,7439,7440,2195, 13,2779,3638,2980,3124,1229,1916,7441,3756,2131, # 4070
7442,4100,4351,2399,3525,7443,2213,1511,1727,1120,7444,7445, 646,3757,2443, 307, # 4086
7446,7447,1595,3186,7448,7449,7450,3639,1113,1356,3899,1465,2522,2523,7451, 519, # 4102
7452, 128,2132, 92,2284,1979,7453,3900,1512, 342,3125,2196,7454,2780,2214,1980, # 4118
3323,7455, 290,1656,1317, 789, 827,2360,7456,3758,4352, 562, 581,3901,7457, 401, # 4134
4353,2248, 94,4354,1399,2781,7458,1463,2024,4355,3187,1943,7459, 828,1105,4101, # 4150
1262,1394,7460,4102, 605,4356,7461,1783,2862,7462,2822, 819,2101, 578,2197,2937, # 4166
7463,1502, 436,3254,4103,3255,2823,3902,2905,3425,3426,7464,2712,2315,7465,7466, # 4182
2332,2067, 23,4357, 193, 826,3759,2102, 699,1630,4104,3075, 390,1793,1064,3526, # 4198
7467,1579,3076,3077,1400,7468,4105,1838,1640,2863,7469,4358,4359, 137,4106, 598, # 4214
3078,1966, 780, 104, 974,2938,7470, 278, 899, 253, 402, 572, 504, 493,1339,7471, # 4230
3903,1275,4360,2574,2550,7472,3640,3029,3079,2249, 565,1334,2713, 863, 41,7473, # 4246
7474,4361,7475,1657,2333, 19, 463,2750,4107, 606,7476,2981,3256,1087,2084,1323, # 4262
2652,2982,7477,1631,1623,1750,4108,2682,7478,2864, 791,2714,2653,2334, 232,2416, # 4278
7479,2983,1498,7480,2654,2620, 755,1366,3641,3257,3126,2025,1609, 119,1917,3427, # 4294
862,1026,4109,7481,3904,3760,4362,3905,4363,2260,1951,2470,7482,1125, 817,4110, # 4310
4111,3906,1513,1766,2040,1487,4112,3030,3258,2824,3761,3127,7483,7484,1507,7485, # 4326
2683, 733, 40,1632,1106,2865, 345,4113, 841,2524, 230,4364,2984,1846,3259,3428, # 4342
7486,1263, 986,3429,7487, 735, 879, 254,1137, 857, 622,1300,1180,1388,1562,3907, # 4358
3908,2939, 967,2751,2655,1349, 592,2133,1692,3324,2985,1994,4114,1679,3909,1901, # 4374
2185,7488, 739,3642,2715,1296,1290,7489,4115,2198,2199,1921,1563,2595,2551,1870, # 4390
2752,2986,7490, 435,7491, 343,1108, 596, 17,1751,4365,2235,3430,3643,7492,4366, # 4406
294,3527,2940,1693, 477, 979, 281,2041,3528, 643,2042,3644,2621,2782,2261,1031, # 4422
2335,2134,2298,3529,4367, 367,1249,2552,7493,3530,7494,4368,1283,3325,2004, 240, # 4438
1762,3326,4369,4370, 836,1069,3128, 474,7495,2148,2525, 268,3531,7496,3188,1521, # 4454
1284,7497,1658,1546,4116,7498,3532,3533,7499,4117,3327,2684,1685,4118, 961,1673, # 4470
2622, 190,2005,2200,3762,4371,4372,7500, 570,2497,3645,1490,7501,4373,2623,3260, # 4486
1956,4374, 584,1514, 396,1045,1944,7502,4375,1967,2444,7503,7504,4376,3910, 619, # 4502
7505,3129,3261, 215,2006,2783,2553,3189,4377,3190,4378, 763,4119,3763,4379,7506, # 4518
7507,1957,1767,2941,3328,3646,1174, 452,1477,4380,3329,3130,7508,2825,1253,2382, # 4534
2186,1091,2285,4120, 492,7509, 638,1169,1824,2135,1752,3911, 648, 926,1021,1324, # 4550
4381, 520,4382, 997, 847,1007, 892,4383,3764,2262,1871,3647,7510,2400,1784,4384, # 4566
1952,2942,3080,3191,1728,4121,2043,3648,4385,2007,1701,3131,1551, 30,2263,4122, # 4582
7511,2026,4386,3534,7512, 501,7513,4123, 594,3431,2165,1821,3535,3432,3536,3192, # 4598
829,2826,4124,7514,1680,3132,1225,4125,7515,3262,4387,4126,3133,2336,7516,4388, # 4614
4127,7517,3912,3913,7518,1847,2383,2596,3330,7519,4389, 374,3914, 652,4128,4129, # 4630
375,1140, 798,7520,7521,7522,2361,4390,2264, 546,1659, 138,3031,2445,4391,7523, # 4646
2250, 612,1848, 910, 796,3765,1740,1371, 825,3766,3767,7524,2906,2554,7525, 692, # 4662
444,3032,2624, 801,4392,4130,7526,1491, 244,1053,3033,4131,4132, 340,7527,3915, # 4678
1041,2987, 293,1168, 87,1357,7528,1539, 959,7529,2236, 721, 694,4133,3768, 219, # 4694
1478, 644,1417,3331,2656,1413,1401,1335,1389,3916,7530,7531,2988,2362,3134,1825, # 4710
730,1515, 184,2827, 66,4393,7532,1660,2943, 246,3332, 378,1457, 226,3433, 975, # 4726
3917,2944,1264,3537, 674, 696,7533, 163,7534,1141,2417,2166, 713,3538,3333,4394, # 4742
3918,7535,7536,1186, 15,7537,1079,1070,7538,1522,3193,3539, 276,1050,2716, 758, # 4758
1126, 653,2945,3263,7539,2337, 889,3540,3919,3081,2989, 903,1250,4395,3920,3434, # 4774
3541,1342,1681,1718, 766,3264, 286, 89,2946,3649,7540,1713,7541,2597,3334,2990, # 4790
7542,2947,2215,3194,2866,7543,4396,2498,2526, 181, 387,1075,3921, 731,2187,3335, # 4806
7544,3265, 310, 313,3435,2299, 770,4134, 54,3034, 189,4397,3082,3769,3922,7545, # 4822
1230,1617,1849, 355,3542,4135,4398,3336, 111,4136,3650,1350,3135,3436,3035,4137, # 4838
2149,3266,3543,7546,2784,3923,3924,2991, 722,2008,7547,1071, 247,1207,2338,2471, # 4854
1378,4399,2009, 864,1437,1214,4400, 373,3770,1142,2216, 667,4401, 442,2753,2555, # 4870
3771,3925,1968,4138,3267,1839, 837, 170,1107, 934,1336,1882,7548,7549,2118,4139, # 4886
2828, 743,1569,7550,4402,4140, 582,2384,1418,3437,7551,1802,7552, 357,1395,1729, # 4902
3651,3268,2418,1564,2237,7553,3083,3772,1633,4403,1114,2085,4141,1532,7554, 482, # 4918
2446,4404,7555,7556,1492, 833,1466,7557,2717,3544,1641,2829,7558,1526,1272,3652, # 4934
4142,1686,1794, 416,2556,1902,1953,1803,7559,3773,2785,3774,1159,2316,7560,2867, # 4950
4405,1610,1584,3036,2419,2754, 443,3269,1163,3136,7561,7562,3926,7563,4143,2499, # 4966
3037,4406,3927,3137,2103,1647,3545,2010,1872,4144,7564,4145, 431,3438,7565, 250, # 4982
97, 81,4146,7566,1648,1850,1558, 160, 848,7567, 866, 740,1694,7568,2201,2830, # 4998
3195,4147,4407,3653,1687, 950,2472, 426, 469,3196,3654,3655,3928,7569,7570,1188, # 5014
424,1995, 861,3546,4148,3775,2202,2685, 168,1235,3547,4149,7571,2086,1674,4408, # 5030
3337,3270, 220,2557,1009,7572,3776, 670,2992, 332,1208, 717,7573,7574,3548,2447, # 5046
3929,3338,7575, 513,7576,1209,2868,3339,3138,4409,1080,7577,7578,7579,7580,2527, # 5062
3656,3549, 815,1587,3930,3931,7581,3550,3439,3777,1254,4410,1328,3038,1390,3932, # 5078
1741,3933,3778,3934,7582, 236,3779,2448,3271,7583,7584,3657,3780,1273,3781,4411, # 5094
7585, 308,7586,4412, 245,4413,1851,2473,1307,2575, 430, 715,2136,2449,7587, 270, # 5110
199,2869,3935,7588,3551,2718,1753, 761,1754, 725,1661,1840,4414,3440,3658,7589, # 5126
7590, 587, 14,3272, 227,2598, 326, 480,2265, 943,2755,3552, 291, 650,1883,7591, # 5142
1702,1226, 102,1547, 62,3441, 904,4415,3442,1164,4150,7592,7593,1224,1548,2756, # 5158
391, 498,1493,7594,1386,1419,7595,2055,1177,4416, 813, 880,1081,2363, 566,1145, # 5174
4417,2286,1001,1035,2558,2599,2238, 394,1286,7596,7597,2068,7598, 86,1494,1730, # 5190
3936, 491,1588, 745, 897,2948, 843,3340,3937,2757,2870,3273,1768, 998,2217,2069, # 5206
397,1826,1195,1969,3659,2993,3341, 284,7599,3782,2500,2137,2119,1903,7600,3938, # 5222
2150,3939,4151,1036,3443,1904, 114,2559,4152, 209,1527,7601,7602,2949,2831,2625, # 5238
2385,2719,3139, 812,2560,7603,3274,7604,1559, 737,1884,3660,1210, 885, 28,2686, # 5254
3553,3783,7605,4153,1004,1779,4418,7606, 346,1981,2218,2687,4419,3784,1742, 797, # 5270
1642,3940,1933,1072,1384,2151, 896,3941,3275,3661,3197,2871,3554,7607,2561,1958, # 5286
4420,2450,1785,7608,7609,7610,3942,4154,1005,1308,3662,4155,2720,4421,4422,1528, # 5302
2600, 161,1178,4156,1982, 987,4423,1101,4157, 631,3943,1157,3198,2420,1343,1241, # 5318
1016,2239,2562, 372, 877,2339,2501,1160, 555,1934, 911,3944,7611, 466,1170, 169, # 5334
1051,2907,2688,3663,2474,2994,1182,2011,2563,1251,2626,7612, 992,2340,3444,1540, # 5350
2721,1201,2070,2401,1996,2475,7613,4424, 528,1922,2188,1503,1873,1570,2364,3342, # 5366
3276,7614, 557,1073,7615,1827,3445,2087,2266,3140,3039,3084, 767,3085,2786,4425, # 5382
1006,4158,4426,2341,1267,2176,3664,3199, 778,3945,3200,2722,1597,2657,7616,4427, # 5398
7617,3446,7618,7619,7620,3277,2689,1433,3278, 131, 95,1504,3946, 723,4159,3141, # 5414
1841,3555,2758,2189,3947,2027,2104,3665,7621,2995,3948,1218,7622,3343,3201,3949, # 5430
4160,2576, 248,1634,3785, 912,7623,2832,3666,3040,3786, 654, 53,7624,2996,7625, # 5446
1688,4428, 777,3447,1032,3950,1425,7626, 191, 820,2120,2833, 971,4429, 931,3202, # 5462
135, 664, 783,3787,1997, 772,2908,1935,3951,3788,4430,2909,3203, 282,2723, 640, # 5478
1372,3448,1127, 922, 325,3344,7627,7628, 711,2044,7629,7630,3952,2219,2787,1936, # 5494
3953,3345,2220,2251,3789,2300,7631,4431,3790,1258,3279,3954,3204,2138,2950,3955, # 5510
3956,7632,2221, 258,3205,4432, 101,1227,7633,3280,1755,7634,1391,3281,7635,2910, # 5526
2056, 893,7636,7637,7638,1402,4161,2342,7639,7640,3206,3556,7641,7642, 878,1325, # 5542
1780,2788,4433, 259,1385,2577, 744,1183,2267,4434,7643,3957,2502,7644, 684,1024, # 5558
4162,7645, 472,3557,3449,1165,3282,3958,3959, 322,2152, 881, 455,1695,1152,1340, # 5574
660, 554,2153,4435,1058,4436,4163, 830,1065,3346,3960,4437,1923,7646,1703,1918, # 5590
7647, 932,2268, 122,7648,4438, 947, 677,7649,3791,2627, 297,1905,1924,2269,4439, # 5606
2317,3283,7650,7651,4164,7652,4165, 84,4166, 112, 989,7653, 547,1059,3961, 701, # 5622
3558,1019,7654,4167,7655,3450, 942, 639, 457,2301,2451, 993,2951, 407, 851, 494, # 5638
4440,3347, 927,7656,1237,7657,2421,3348, 573,4168, 680, 921,2911,1279,1874, 285, # 5654
790,1448,1983, 719,2167,7658,7659,4441,3962,3963,1649,7660,1541, 563,7661,1077, # 5670
7662,3349,3041,3451, 511,2997,3964,3965,3667,3966,1268,2564,3350,3207,4442,4443, # 5686
7663, 535,1048,1276,1189,2912,2028,3142,1438,1373,2834,2952,1134,2012,7664,4169, # 5702
1238,2578,3086,1259,7665, 700,7666,2953,3143,3668,4170,7667,4171,1146,1875,1906, # 5718
4444,2601,3967, 781,2422, 132,1589, 203, 147, 273,2789,2402, 898,1786,2154,3968, # 5734
3969,7668,3792,2790,7669,7670,4445,4446,7671,3208,7672,1635,3793, 965,7673,1804, # 5750
2690,1516,3559,1121,1082,1329,3284,3970,1449,3794, 65,1128,2835,2913,2759,1590, # 5766
3795,7674,7675, 12,2658, 45, 976,2579,3144,4447, 517,2528,1013,1037,3209,7676, # 5782
3796,2836,7677,3797,7678,3452,7679,2602, 614,1998,2318,3798,3087,2724,2628,7680, # 5798
2580,4172, 599,1269,7681,1810,3669,7682,2691,3088, 759,1060, 489,1805,3351,3285, # 5814
1358,7683,7684,2386,1387,1215,2629,2252, 490,7685,7686,4173,1759,2387,2343,7687, # 5830
4448,3799,1907,3971,2630,1806,3210,4449,3453,3286,2760,2344, 874,7688,7689,3454, # 5846
3670,1858, 91,2914,3671,3042,3800,4450,7690,3145,3972,2659,7691,3455,1202,1403, # 5862
3801,2954,2529,1517,2503,4451,3456,2504,7692,4452,7693,2692,1885,1495,1731,3973, # 5878
2365,4453,7694,2029,7695,7696,3974,2693,1216, 237,2581,4174,2319,3975,3802,4454, # 5894
4455,2694,3560,3457, 445,4456,7697,7698,7699,7700,2761, 61,3976,3672,1822,3977, # 5910
7701, 687,2045, 935, 925, 405,2660, 703,1096,1859,2725,4457,3978,1876,1367,2695, # 5926
3352, 918,2105,1781,2476, 334,3287,1611,1093,4458, 564,3146,3458,3673,3353, 945, # 5942
2631,2057,4459,7702,1925, 872,4175,7703,3459,2696,3089, 349,4176,3674,3979,4460, # 5958
3803,4177,3675,2155,3980,4461,4462,4178,4463,2403,2046, 782,3981, 400, 251,4179, # 5974
1624,7704,7705, 277,3676, 299,1265, 476,1191,3804,2121,4180,4181,1109, 205,7706, # 5990
2582,1000,2156,3561,1860,7707,7708,7709,4464,7710,4465,2565, 107,2477,2157,3982, # 6006
3460,3147,7711,1533, 541,1301, 158, 753,4182,2872,3562,7712,1696, 370,1088,4183, # 6022
4466,3563, 579, 327, 440, 162,2240, 269,1937,1374,3461, 968,3043, 56,1396,3090, # 6038
2106,3288,3354,7713,1926,2158,4467,2998,7714,3564,7715,7716,3677,4468,2478,7717, # 6054
2791,7718,1650,4469,7719,2603,7720,7721,3983,2661,3355,1149,3356,3984,3805,3985, # 6070
7722,1076, 49,7723, 951,3211,3289,3290, 450,2837, 920,7724,1811,2792,2366,4184, # 6086
1908,1138,2367,3806,3462,7725,3212,4470,1909,1147,1518,2423,4471,3807,7726,4472, # 6102
2388,2604, 260,1795,3213,7727,7728,3808,3291, 708,7729,3565,1704,7730,3566,1351, # 6118
1618,3357,2999,1886, 944,4185,3358,4186,3044,3359,4187,7731,3678, 422, 413,1714, # 6134
3292, 500,2058,2345,4188,2479,7732,1344,1910, 954,7733,1668,7734,7735,3986,2404, # 6150
4189,3567,3809,4190,7736,2302,1318,2505,3091, 133,3092,2873,4473, 629, 31,2838, # 6166
2697,3810,4474, 850, 949,4475,3987,2955,1732,2088,4191,1496,1852,7737,3988, 620, # 6182
3214, 981,1242,3679,3360,1619,3680,1643,3293,2139,2452,1970,1719,3463,2168,7738, # 6198
3215,7739,7740,3361,1828,7741,1277,4476,1565,2047,7742,1636,3568,3093,7743, 869, # 6214
2839, 655,3811,3812,3094,3989,3000,3813,1310,3569,4477,7744,7745,7746,1733, 558, # 6230
4478,3681, 335,1549,3045,1756,4192,3682,1945,3464,1829,1291,1192, 470,2726,2107, # 6246
2793, 913,1054,3990,7747,1027,7748,3046,3991,4479, 982,2662,3362,3148,3465,3216, # 6262
3217,1946,2794,7749, 571,4480,7750,1830,7751,3570,2583,1523,2424,7752,2089, 984, # 6278
4481,3683,1959,7753,3684, 852, 923,2795,3466,3685, 969,1519, 999,2048,2320,1705, # 6294
7754,3095, 615,1662, 151, 597,3992,2405,2321,1049, 275,4482,3686,4193, 568,3687, # 6310
3571,2480,4194,3688,7755,2425,2270, 409,3218,7756,1566,2874,3467,1002, 769,2840, # 6326
194,2090,3149,3689,2222,3294,4195, 628,1505,7757,7758,1763,2177,3001,3993, 521, # 6342
1161,2584,1787,2203,2406,4483,3994,1625,4196,4197, 412, 42,3096, 464,7759,2632, # 6358
4484,3363,1760,1571,2875,3468,2530,1219,2204,3814,2633,2140,2368,4485,4486,3295, # 6374
1651,3364,3572,7760,7761,3573,2481,3469,7762,3690,7763,7764,2271,2091, 460,7765, # 6390
4487,7766,3002, 962, 588,3574, 289,3219,2634,1116, 52,7767,3047,1796,7768,7769, # 6406
7770,1467,7771,1598,1143,3691,4198,1984,1734,1067,4488,1280,3365, 465,4489,1572, # 6422
510,7772,1927,2241,1812,1644,3575,7773,4490,3692,7774,7775,2663,1573,1534,7776, # 6438
7777,4199, 536,1807,1761,3470,3815,3150,2635,7778,7779,7780,4491,3471,2915,1911, # 6454
2796,7781,3296,1122, 377,3220,7782, 360,7783,7784,4200,1529, 551,7785,2059,3693, # 6470
1769,2426,7786,2916,4201,3297,3097,2322,2108,2030,4492,1404, 136,1468,1479, 672, # 6486
1171,3221,2303, 271,3151,7787,2762,7788,2049, 678,2727, 865,1947,4493,7789,2013, # 6502
3995,2956,7790,2728,2223,1397,3048,3694,4494,4495,1735,2917,3366,3576,7791,3816, # 6518
509,2841,2453,2876,3817,7792,7793,3152,3153,4496,4202,2531,4497,2304,1166,1010, # 6534
552, 681,1887,7794,7795,2957,2958,3996,1287,1596,1861,3154, 358, 453, 736, 175, # 6550
478,1117, 905,1167,1097,7796,1853,1530,7797,1706,7798,2178,3472,2287,3695,3473, # 6566
3577,4203,2092,4204,7799,3367,1193,2482,4205,1458,2190,2205,1862,1888,1421,3298, # 6582
2918,3049,2179,3474, 595,2122,7800,3997,7801,7802,4206,1707,2636, 223,3696,1359, # 6598
751,3098, 183,3475,7803,2797,3003, 419,2369, 633, 704,3818,2389, 241,7804,7805, # 6614
7806, 838,3004,3697,2272,2763,2454,3819,1938,2050,3998,1309,3099,2242,1181,7807, # 6630
1136,2206,3820,2370,1446,4207,2305,4498,7808,7809,4208,1055,2605, 484,3698,7810, # 6646
3999, 625,4209,2273,3368,1499,4210,4000,7811,4001,4211,3222,2274,2275,3476,7812, # 6662
7813,2764, 808,2606,3699,3369,4002,4212,3100,2532, 526,3370,3821,4213, 955,7814, # 6678
1620,4214,2637,2427,7815,1429,3700,1669,1831, 994, 928,7816,3578,1260,7817,7818, # 6694
7819,1948,2288, 741,2919,1626,4215,2729,2455, 867,1184, 362,3371,1392,7820,7821, # 6710
4003,4216,1770,1736,3223,2920,4499,4500,1928,2698,1459,1158,7822,3050,3372,2877, # 6726
1292,1929,2506,2842,3701,1985,1187,2071,2014,2607,4217,7823,2566,2507,2169,3702, # 6742
2483,3299,7824,3703,4501,7825,7826, 666,1003,3005,1022,3579,4218,7827,4502,1813, # 6758
2253, 574,3822,1603, 295,1535, 705,3823,4219, 283, 858, 417,7828,7829,3224,4503, # 6774
4504,3051,1220,1889,1046,2276,2456,4004,1393,1599, 689,2567, 388,4220,7830,2484, # 6790
802,7831,2798,3824,2060,1405,2254,7832,4505,3825,2109,1052,1345,3225,1585,7833, # 6806
809,7834,7835,7836, 575,2730,3477, 956,1552,1469,1144,2323,7837,2324,1560,2457, # 6822
3580,3226,4005, 616,2207,3155,2180,2289,7838,1832,7839,3478,4506,7840,1319,3704, # 6838
3705,1211,3581,1023,3227,1293,2799,7841,7842,7843,3826, 607,2306,3827, 762,2878, # 6854
1439,4221,1360,7844,1485,3052,7845,4507,1038,4222,1450,2061,2638,4223,1379,4508, # 6870
2585,7846,7847,4224,1352,1414,2325,2921,1172,7848,7849,3828,3829,7850,1797,1451, # 6886
7851,7852,7853,7854,2922,4006,4007,2485,2346, 411,4008,4009,3582,3300,3101,4509, # 6902
1561,2664,1452,4010,1375,7855,7856, 47,2959, 316,7857,1406,1591,2923,3156,7858, # 6918
1025,2141,3102,3157, 354,2731, 884,2224,4225,2407, 508,3706, 726,3583, 996,2428, # 6934
3584, 729,7859, 392,2191,1453,4011,4510,3707,7860,7861,2458,3585,2608,1675,2800, # 6950
919,2347,2960,2348,1270,4511,4012, 73,7862,7863, 647,7864,3228,2843,2255,1550, # 6966
1346,3006,7865,1332, 883,3479,7866,7867,7868,7869,3301,2765,7870,1212, 831,1347, # 6982
4226,4512,2326,3830,1863,3053, 720,3831,4513,4514,3832,7871,4227,7872,7873,4515, # 6998
7874,7875,1798,4516,3708,2609,4517,3586,1645,2371,7876,7877,2924, 669,2208,2665, # 7014
2429,7878,2879,7879,7880,1028,3229,7881,4228,2408,7882,2256,1353,7883,7884,4518, # 7030
3158, 518,7885,4013,7886,4229,1960,7887,2142,4230,7888,7889,3007,2349,2350,3833, # 7046
516,1833,1454,4014,2699,4231,4519,2225,2610,1971,1129,3587,7890,2766,7891,2961, # 7062
1422, 577,1470,3008,1524,3373,7892,7893, 432,4232,3054,3480,7894,2586,1455,2508, # 7078
2226,1972,1175,7895,1020,2732,4015,3481,4520,7896,2733,7897,1743,1361,3055,3482, # 7094
2639,4016,4233,4521,2290, 895, 924,4234,2170, 331,2243,3056, 166,1627,3057,1098, # 7110
7898,1232,2880,2227,3374,4522, 657, 403,1196,2372, 542,3709,3375,1600,4235,3483, # 7126
7899,4523,2767,3230, 576, 530,1362,7900,4524,2533,2666,3710,4017,7901, 842,3834, # 7142
7902,2801,2031,1014,4018, 213,2700,3376, 665, 621,4236,7903,3711,2925,2430,7904, # 7158
2431,3302,3588,3377,7905,4237,2534,4238,4525,3589,1682,4239,3484,1380,7906, 724, # 7174
2277, 600,1670,7907,1337,1233,4526,3103,2244,7908,1621,4527,7909, 651,4240,7910, # 7190
1612,4241,2611,7911,2844,7912,2734,2307,3058,7913, 716,2459,3059, 174,1255,2701, # 7206
4019,3590, 548,1320,1398, 728,4020,1574,7914,1890,1197,3060,4021,7915,3061,3062, # 7222
3712,3591,3713, 747,7916, 635,4242,4528,7917,7918,7919,4243,7920,7921,4529,7922, # 7238
3378,4530,2432, 451,7923,3714,2535,2072,4244,2735,4245,4022,7924,1764,4531,7925, # 7254
4246, 350,7926,2278,2390,2486,7927,4247,4023,2245,1434,4024, 488,4532, 458,4248, # 7270
4025,3715, 771,1330,2391,3835,2568,3159,2159,2409,1553,2667,3160,4249,7928,2487, # 7286
2881,2612,1720,2702,4250,3379,4533,7929,2536,4251,7930,3231,4252,2768,7931,2015, # 7302
2736,7932,1155,1017,3716,3836,7933,3303,2308, 201,1864,4253,1430,7934,4026,7935, # 7318
7936,7937,7938,7939,4254,1604,7940, 414,1865, 371,2587,4534,4535,3485,2016,3104, # 7334
4536,1708, 960,4255, 887, 389,2171,1536,1663,1721,7941,2228,4027,2351,2926,1580, # 7350
7942,7943,7944,1744,7945,2537,4537,4538,7946,4539,7947,2073,7948,7949,3592,3380, # 7366
2882,4256,7950,4257,2640,3381,2802, 673,2703,2460, 709,3486,4028,3593,4258,7951, # 7382
1148, 502, 634,7952,7953,1204,4540,3594,1575,4541,2613,3717,7954,3718,3105, 948, # 7398
3232, 121,1745,3837,1110,7955,4259,3063,2509,3009,4029,3719,1151,1771,3838,1488, # 7414
4030,1986,7956,2433,3487,7957,7958,2093,7959,4260,3839,1213,1407,2803, 531,2737, # 7430
2538,3233,1011,1537,7960,2769,4261,3106,1061,7961,3720,3721,1866,2883,7962,2017, # 7446
120,4262,4263,2062,3595,3234,2309,3840,2668,3382,1954,4542,7963,7964,3488,1047, # 7462
2704,1266,7965,1368,4543,2845, 649,3383,3841,2539,2738,1102,2846,2669,7966,7967, # 7478
1999,7968,1111,3596,2962,7969,2488,3842,3597,2804,1854,3384,3722,7970,7971,3385, # 7494
2410,2884,3304,3235,3598,7972,2569,7973,3599,2805,4031,1460, 856,7974,3600,7975, # 7510
2885,2963,7976,2886,3843,7977,4264, 632,2510, 875,3844,1697,3845,2291,7978,7979, # 7526
4544,3010,1239, 580,4545,4265,7980, 914, 936,2074,1190,4032,1039,2123,7981,7982, # 7542
7983,3386,1473,7984,1354,4266,3846,7985,2172,3064,4033, 915,3305,4267,4268,3306, # 7558
1605,1834,7986,2739, 398,3601,4269,3847,4034, 328,1912,2847,4035,3848,1331,4270, # 7574
3011, 937,4271,7987,3602,4036,4037,3387,2160,4546,3388, 524, 742, 538,3065,1012, # 7590
7988,7989,3849,2461,7990, 658,1103, 225,3850,7991,7992,4547,7993,4548,7994,3236, # 7606
1243,7995,4038, 963,2246,4549,7996,2705,3603,3161,7997,7998,2588,2327,7999,4550, # 7622
8000,8001,8002,3489,3307, 957,3389,2540,2032,1930,2927,2462, 870,2018,3604,1746, # 7638
2770,2771,2434,2463,8003,3851,8004,3723,3107,3724,3490,3390,3725,8005,1179,3066, # 7654
8006,3162,2373,4272,3726,2541,3163,3108,2740,4039,8007,3391,1556,2542,2292, 977, # 7670
2887,2033,4040,1205,3392,8008,1765,3393,3164,2124,1271,1689, 714,4551,3491,8009, # 7686
2328,3852, 533,4273,3605,2181, 617,8010,2464,3308,3492,2310,8011,8012,3165,8013, # 7702
8014,3853,1987, 618, 427,2641,3493,3394,8015,8016,1244,1690,8017,2806,4274,4552, # 7718
8018,3494,8019,8020,2279,1576, 473,3606,4275,3395, 972,8021,3607,8022,3067,8023, # 7734
8024,4553,4554,8025,3727,4041,4042,8026, 153,4555, 356,8027,1891,2888,4276,2143, # 7750
408, 803,2352,8028,3854,8029,4277,1646,2570,2511,4556,4557,3855,8030,3856,4278, # 7766
8031,2411,3396, 752,8032,8033,1961,2964,8034, 746,3012,2465,8035,4279,3728, 698, # 7782
4558,1892,4280,3608,2543,4559,3609,3857,8036,3166,3397,8037,1823,1302,4043,2706, # 7798
3858,1973,4281,8038,4282,3167, 823,1303,1288,1236,2848,3495,4044,3398, 774,3859, # 7814
8039,1581,4560,1304,2849,3860,4561,8040,2435,2161,1083,3237,4283,4045,4284, 344, # 7830
1173, 288,2311, 454,1683,8041,8042,1461,4562,4046,2589,8043,8044,4563, 985, 894, # 7846
8045,3399,3168,8046,1913,2928,3729,1988,8047,2110,1974,8048,4047,8049,2571,1194, # 7862
425,8050,4564,3169,1245,3730,4285,8051,8052,2850,8053, 636,4565,1855,3861, 760, # 7878
1799,8054,4286,2209,1508,4566,4048,1893,1684,2293,8055,8056,8057,4287,4288,2210, # 7894
479,8058,8059, 832,8060,4049,2489,8061,2965,2490,3731, 990,3109, 627,1814,2642, # 7910
4289,1582,4290,2125,2111,3496,4567,8062, 799,4291,3170,8063,4568,2112,1737,3013, # 7926
1018, 543, 754,4292,3309,1676,4569,4570,4050,8064,1489,8065,3497,8066,2614,2889, # 7942
4051,8067,8068,2966,8069,8070,8071,8072,3171,4571,4572,2182,1722,8073,3238,3239, # 7958
1842,3610,1715, 481, 365,1975,1856,8074,8075,1962,2491,4573,8076,2126,3611,3240, # 7974
433,1894,2063,2075,8077, 602,2741,8078,8079,8080,8081,8082,3014,1628,3400,8083, # 7990
3172,4574,4052,2890,4575,2512,8084,2544,2772,8085,8086,8087,3310,4576,2891,8088, # 8006
4577,8089,2851,4578,4579,1221,2967,4053,2513,8090,8091,8092,1867,1989,8093,8094, # 8022
8095,1895,8096,8097,4580,1896,4054, 318,8098,2094,4055,4293,8099,8100, 485,8101, # 8038
938,3862, 553,2670, 116,8102,3863,3612,8103,3498,2671,2773,3401,3311,2807,8104, # 8054
3613,2929,4056,1747,2930,2968,8105,8106, 207,8107,8108,2672,4581,2514,8109,3015, # 8070
890,3614,3864,8110,1877,3732,3402,8111,2183,2353,3403,1652,8112,8113,8114, 941, # 8086
2294, 208,3499,4057,2019, 330,4294,3865,2892,2492,3733,4295,8115,8116,8117,8118, # 8102
)
pip/_vendor/chardet/eucjpprober.py 0000644 00000007245 14751155150 0013310 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .enums import ProbingState, MachineState
from .mbcharsetprober import MultiByteCharSetProber
from .codingstatemachine import CodingStateMachine
from .chardistribution import EUCJPDistributionAnalysis
from .jpcntx import EUCJPContextAnalysis
from .mbcssm import EUCJP_SM_MODEL
class EUCJPProber(MultiByteCharSetProber):
def __init__(self):
super(EUCJPProber, self).__init__()
self.coding_sm = CodingStateMachine(EUCJP_SM_MODEL)
self.distribution_analyzer = EUCJPDistributionAnalysis()
self.context_analyzer = EUCJPContextAnalysis()
self.reset()
def reset(self):
super(EUCJPProber, self).reset()
self.context_analyzer.reset()
@property
def charset_name(self):
return "EUC-JP"
@property
def language(self):
return "Japanese"
def feed(self, byte_str):
for i in range(len(byte_str)):
# PY3K: byte_str is a byte array, so byte_str[i] is an int, not a byte
coding_state = self.coding_sm.next_state(byte_str[i])
if coding_state == MachineState.ERROR:
self.logger.debug('%s %s prober hit error at byte %s',
self.charset_name, self.language, i)
self._state = ProbingState.NOT_ME
break
elif coding_state == MachineState.ITS_ME:
self._state = ProbingState.FOUND_IT
break
elif coding_state == MachineState.START:
char_len = self.coding_sm.get_current_charlen()
if i == 0:
self._last_char[1] = byte_str[0]
self.context_analyzer.feed(self._last_char, char_len)
self.distribution_analyzer.feed(self._last_char, char_len)
else:
self.context_analyzer.feed(byte_str[i - 1:i + 1],
char_len)
self.distribution_analyzer.feed(byte_str[i - 1:i + 1],
char_len)
self._last_char[0] = byte_str[-1]
if self.state == ProbingState.DETECTING:
if (self.context_analyzer.got_enough_data() and
(self.get_confidence() > self.SHORTCUT_THRESHOLD)):
self._state = ProbingState.FOUND_IT
return self.state
def get_confidence(self):
context_conf = self.context_analyzer.get_confidence()
distrib_conf = self.distribution_analyzer.get_confidence()
return max(context_conf, distrib_conf)
pip/_vendor/chardet/hebrewprober.py 0000644 00000033016 14751155150 0013451 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Shy Shalom
# Portions created by the Initial Developer are Copyright (C) 2005
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetprober import CharSetProber
from .enums import ProbingState
# This prober doesn't actually recognize a language or a charset.
# It is a helper prober for the use of the Hebrew model probers
### General ideas of the Hebrew charset recognition ###
#
# Four main charsets exist in Hebrew:
# "ISO-8859-8" - Visual Hebrew
# "windows-1255" - Logical Hebrew
# "ISO-8859-8-I" - Logical Hebrew
# "x-mac-hebrew" - ?? Logical Hebrew ??
#
# Both "ISO" charsets use a completely identical set of code points, whereas
# "windows-1255" and "x-mac-hebrew" are two different proper supersets of
# these code points. windows-1255 defines additional characters in the range
# 0x80-0x9F as some misc punctuation marks as well as some Hebrew-specific
# diacritics and additional 'Yiddish' ligature letters in the range 0xc0-0xd6.
# x-mac-hebrew defines similar additional code points but with a different
# mapping.
#
# As far as an average Hebrew text with no diacritics is concerned, all four
# charsets are identical with respect to code points. Meaning that for the
# main Hebrew alphabet, all four map the same values to all 27 Hebrew letters
# (including final letters).
#
# The dominant difference between these charsets is their directionality.
# "Visual" directionality means that the text is ordered as if the renderer is
# not aware of a BIDI rendering algorithm. The renderer sees the text and
# draws it from left to right. The text itself when ordered naturally is read
# backwards. A buffer of Visual Hebrew generally looks like so:
# "[last word of first line spelled backwards] [whole line ordered backwards
# and spelled backwards] [first word of first line spelled backwards]
# [end of line] [last word of second line] ... etc' "
# adding punctuation marks, numbers and English text to visual text is
# naturally also "visual" and from left to right.
#
# "Logical" directionality means the text is ordered "naturally" according to
# the order it is read. It is the responsibility of the renderer to display
# the text from right to left. A BIDI algorithm is used to place general
# punctuation marks, numbers and English text in the text.
#
# Texts in x-mac-hebrew are almost impossible to find on the Internet. From
# what little evidence I could find, it seems that its general directionality
# is Logical.
#
# To sum up all of the above, the Hebrew probing mechanism knows about two
# charsets:
# Visual Hebrew - "ISO-8859-8" - backwards text - Words and sentences are
# backwards while line order is natural. For charset recognition purposes
# the line order is unimportant (In fact, for this implementation, even
# word order is unimportant).
# Logical Hebrew - "windows-1255" - normal, naturally ordered text.
#
# "ISO-8859-8-I" is a subset of windows-1255 and doesn't need to be
# specifically identified.
# "x-mac-hebrew" is also identified as windows-1255. A text in x-mac-hebrew
# that contain special punctuation marks or diacritics is displayed with
# some unconverted characters showing as question marks. This problem might
# be corrected using another model prober for x-mac-hebrew. Due to the fact
# that x-mac-hebrew texts are so rare, writing another model prober isn't
# worth the effort and performance hit.
#
#### The Prober ####
#
# The prober is divided between two SBCharSetProbers and a HebrewProber,
# all of which are managed, created, fed data, inquired and deleted by the
# SBCSGroupProber. The two SBCharSetProbers identify that the text is in
# fact some kind of Hebrew, Logical or Visual. The final decision about which
# one is it is made by the HebrewProber by combining final-letter scores
# with the scores of the two SBCharSetProbers to produce a final answer.
#
# The SBCSGroupProber is responsible for stripping the original text of HTML
# tags, English characters, numbers, low-ASCII punctuation characters, spaces
# and new lines. It reduces any sequence of such characters to a single space.
# The buffer fed to each prober in the SBCS group prober is pure text in
# high-ASCII.
# The two SBCharSetProbers (model probers) share the same language model:
# Win1255Model.
# The first SBCharSetProber uses the model normally as any other
# SBCharSetProber does, to recognize windows-1255, upon which this model was
# built. The second SBCharSetProber is told to make the pair-of-letter
# lookup in the language model backwards. This in practice exactly simulates
# a visual Hebrew model using the windows-1255 logical Hebrew model.
#
# The HebrewProber is not using any language model. All it does is look for
# final-letter evidence suggesting the text is either logical Hebrew or visual
# Hebrew. Disjointed from the model probers, the results of the HebrewProber
# alone are meaningless. HebrewProber always returns 0.00 as confidence
# since it never identifies a charset by itself. Instead, the pointer to the
# HebrewProber is passed to the model probers as a helper "Name Prober".
# When the Group prober receives a positive identification from any prober,
# it asks for the name of the charset identified. If the prober queried is a
# Hebrew model prober, the model prober forwards the call to the
# HebrewProber to make the final decision. In the HebrewProber, the
# decision is made according to the final-letters scores maintained and Both
# model probers scores. The answer is returned in the form of the name of the
# charset identified, either "windows-1255" or "ISO-8859-8".
class HebrewProber(CharSetProber):
# windows-1255 / ISO-8859-8 code points of interest
FINAL_KAF = 0xea
NORMAL_KAF = 0xeb
FINAL_MEM = 0xed
NORMAL_MEM = 0xee
FINAL_NUN = 0xef
NORMAL_NUN = 0xf0
FINAL_PE = 0xf3
NORMAL_PE = 0xf4
FINAL_TSADI = 0xf5
NORMAL_TSADI = 0xf6
# Minimum Visual vs Logical final letter score difference.
# If the difference is below this, don't rely solely on the final letter score
# distance.
MIN_FINAL_CHAR_DISTANCE = 5
# Minimum Visual vs Logical model score difference.
# If the difference is below this, don't rely at all on the model score
# distance.
MIN_MODEL_DISTANCE = 0.01
VISUAL_HEBREW_NAME = "ISO-8859-8"
LOGICAL_HEBREW_NAME = "windows-1255"
def __init__(self):
super(HebrewProber, self).__init__()
self._final_char_logical_score = None
self._final_char_visual_score = None
self._prev = None
self._before_prev = None
self._logical_prober = None
self._visual_prober = None
self.reset()
def reset(self):
self._final_char_logical_score = 0
self._final_char_visual_score = 0
# The two last characters seen in the previous buffer,
# mPrev and mBeforePrev are initialized to space in order to simulate
# a word delimiter at the beginning of the data
self._prev = ' '
self._before_prev = ' '
# These probers are owned by the group prober.
def set_model_probers(self, logicalProber, visualProber):
self._logical_prober = logicalProber
self._visual_prober = visualProber
def is_final(self, c):
return c in [self.FINAL_KAF, self.FINAL_MEM, self.FINAL_NUN,
self.FINAL_PE, self.FINAL_TSADI]
def is_non_final(self, c):
# The normal Tsadi is not a good Non-Final letter due to words like
# 'lechotet' (to chat) containing an apostrophe after the tsadi. This
# apostrophe is converted to a space in FilterWithoutEnglishLetters
# causing the Non-Final tsadi to appear at an end of a word even
# though this is not the case in the original text.
# The letters Pe and Kaf rarely display a related behavior of not being
# a good Non-Final letter. Words like 'Pop', 'Winamp' and 'Mubarak'
# for example legally end with a Non-Final Pe or Kaf. However, the
# benefit of these letters as Non-Final letters outweighs the damage
# since these words are quite rare.
return c in [self.NORMAL_KAF, self.NORMAL_MEM,
self.NORMAL_NUN, self.NORMAL_PE]
def feed(self, byte_str):
# Final letter analysis for logical-visual decision.
# Look for evidence that the received buffer is either logical Hebrew
# or visual Hebrew.
# The following cases are checked:
# 1) A word longer than 1 letter, ending with a final letter. This is
# an indication that the text is laid out "naturally" since the
# final letter really appears at the end. +1 for logical score.
# 2) A word longer than 1 letter, ending with a Non-Final letter. In
# normal Hebrew, words ending with Kaf, Mem, Nun, Pe or Tsadi,
# should not end with the Non-Final form of that letter. Exceptions
# to this rule are mentioned above in isNonFinal(). This is an
# indication that the text is laid out backwards. +1 for visual
# score
# 3) A word longer than 1 letter, starting with a final letter. Final
# letters should not appear at the beginning of a word. This is an
# indication that the text is laid out backwards. +1 for visual
# score.
#
# The visual score and logical score are accumulated throughout the
# text and are finally checked against each other in GetCharSetName().
# No checking for final letters in the middle of words is done since
# that case is not an indication for either Logical or Visual text.
#
# We automatically filter out all 7-bit characters (replace them with
# spaces) so the word boundary detection works properly. [MAP]
if self.state == ProbingState.NOT_ME:
# Both model probers say it's not them. No reason to continue.
return ProbingState.NOT_ME
byte_str = self.filter_high_byte_only(byte_str)
for cur in byte_str:
if cur == ' ':
# We stand on a space - a word just ended
if self._before_prev != ' ':
# next-to-last char was not a space so self._prev is not a
# 1 letter word
if self.is_final(self._prev):
# case (1) [-2:not space][-1:final letter][cur:space]
self._final_char_logical_score += 1
elif self.is_non_final(self._prev):
# case (2) [-2:not space][-1:Non-Final letter][
# cur:space]
self._final_char_visual_score += 1
else:
# Not standing on a space
if ((self._before_prev == ' ') and
(self.is_final(self._prev)) and (cur != ' ')):
# case (3) [-2:space][-1:final letter][cur:not space]
self._final_char_visual_score += 1
self._before_prev = self._prev
self._prev = cur
# Forever detecting, till the end or until both model probers return
# ProbingState.NOT_ME (handled above)
return ProbingState.DETECTING
@property
def charset_name(self):
# Make the decision: is it Logical or Visual?
# If the final letter score distance is dominant enough, rely on it.
finalsub = self._final_char_logical_score - self._final_char_visual_score
if finalsub >= self.MIN_FINAL_CHAR_DISTANCE:
return self.LOGICAL_HEBREW_NAME
if finalsub <= -self.MIN_FINAL_CHAR_DISTANCE:
return self.VISUAL_HEBREW_NAME
# It's not dominant enough, try to rely on the model scores instead.
modelsub = (self._logical_prober.get_confidence()
- self._visual_prober.get_confidence())
if modelsub > self.MIN_MODEL_DISTANCE:
return self.LOGICAL_HEBREW_NAME
if modelsub < -self.MIN_MODEL_DISTANCE:
return self.VISUAL_HEBREW_NAME
# Still no good, back to final letter distance, maybe it'll save the
# day.
if finalsub < 0.0:
return self.VISUAL_HEBREW_NAME
# (finalsub > 0 - Logical) or (don't know what to do) default to
# Logical.
return self.LOGICAL_HEBREW_NAME
@property
def language(self):
return 'Hebrew'
@property
def state(self):
# Remain active as long as any of the model probers are active.
if (self._logical_prober.state == ProbingState.NOT_ME) and \
(self._visual_prober.state == ProbingState.NOT_ME):
return ProbingState.NOT_ME
return ProbingState.DETECTING
pip/_vendor/chardet/utf8prober.py 0000644 00000005316 14751155150 0013065 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .charsetprober import CharSetProber
from .enums import ProbingState, MachineState
from .codingstatemachine import CodingStateMachine
from .mbcssm import UTF8_SM_MODEL
class UTF8Prober(CharSetProber):
ONE_CHAR_PROB = 0.5
def __init__(self):
super(UTF8Prober, self).__init__()
self.coding_sm = CodingStateMachine(UTF8_SM_MODEL)
self._num_mb_chars = None
self.reset()
def reset(self):
super(UTF8Prober, self).reset()
self.coding_sm.reset()
self._num_mb_chars = 0
@property
def charset_name(self):
return "utf-8"
@property
def language(self):
return ""
def feed(self, byte_str):
for c in byte_str:
coding_state = self.coding_sm.next_state(c)
if coding_state == MachineState.ERROR:
self._state = ProbingState.NOT_ME
break
elif coding_state == MachineState.ITS_ME:
self._state = ProbingState.FOUND_IT
break
elif coding_state == MachineState.START:
if self.coding_sm.get_current_charlen() >= 2:
self._num_mb_chars += 1
if self.state == ProbingState.DETECTING:
if self.get_confidence() > self.SHORTCUT_THRESHOLD:
self._state = ProbingState.FOUND_IT
return self.state
def get_confidence(self):
unlike = 0.99
if self._num_mb_chars < 6:
unlike *= self.ONE_CHAR_PROB ** self._num_mb_chars
return 1.0 - unlike
else:
return unlike
pip/_vendor/chardet/__init__.py 0000644 00000003027 14751155150 0012521 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .compat import PY2, PY3
from .universaldetector import UniversalDetector
from .version import __version__, VERSION
def detect(byte_str):
"""
Detect the encoding of the given byte string.
:param byte_str: The byte sequence to examine.
:type byte_str: ``bytes`` or ``bytearray``
"""
if not isinstance(byte_str, bytearray):
if not isinstance(byte_str, bytes):
raise TypeError('Expected object of type bytes or bytearray, got: '
'{0}'.format(type(byte_str)))
else:
byte_str = bytearray(byte_str)
detector = UniversalDetector()
detector.feed(byte_str)
return detector.close()
pip/_vendor/chardet/langhebrewmodel.py 0000644 00000026121 14751155150 0014121 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Universal charset detector code.
#
# The Initial Developer of the Original Code is
# Simon Montagu
# Portions created by the Initial Developer are Copyright (C) 2005
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
# Shy Shalom - original C code
# Shoshannah Forbes - original C code (?)
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# 255: Control characters that usually does not exist in any text
# 254: Carriage/Return
# 253: symbol (punctuation) that does not belong to word
# 252: 0 - 9
# Windows-1255 language model
# Character Mapping Table:
WIN1255_CHAR_TO_ORDER_MAP = (
255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255, # 00
255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255, # 10
253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253, # 20
252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253, # 30
253, 69, 91, 79, 80, 92, 89, 97, 90, 68,111,112, 82, 73, 95, 85, # 40
78,121, 86, 71, 67,102,107, 84,114,103,115,253,253,253,253,253, # 50
253, 50, 74, 60, 61, 42, 76, 70, 64, 53,105, 93, 56, 65, 54, 49, # 60
66,110, 51, 43, 44, 63, 81, 77, 98, 75,108,253,253,253,253,253, # 70
124,202,203,204,205, 40, 58,206,207,208,209,210,211,212,213,214,
215, 83, 52, 47, 46, 72, 32, 94,216,113,217,109,218,219,220,221,
34,116,222,118,100,223,224,117,119,104,125,225,226, 87, 99,227,
106,122,123,228, 55,229,230,101,231,232,120,233, 48, 39, 57,234,
30, 59, 41, 88, 33, 37, 36, 31, 29, 35,235, 62, 28,236,126,237,
238, 38, 45,239,240,241,242,243,127,244,245,246,247,248,249,250,
9, 8, 20, 16, 3, 2, 24, 14, 22, 1, 25, 15, 4, 11, 6, 23,
12, 19, 13, 26, 18, 27, 21, 17, 7, 10, 5,251,252,128, 96,253,
)
# Model Table:
# total sequences: 100%
# first 512 sequences: 98.4004%
# first 1024 sequences: 1.5981%
# rest sequences: 0.087%
# negative sequences: 0.0015%
HEBREW_LANG_MODEL = (
0,3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,2,3,2,1,2,0,1,0,0,
3,0,3,1,0,0,1,3,2,0,1,1,2,0,2,2,2,1,1,1,1,2,1,1,1,2,0,0,2,2,0,1,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,
1,2,1,2,1,2,0,0,2,0,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,
1,2,1,3,1,1,0,0,2,0,0,0,1,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,0,1,2,2,1,3,
1,2,1,1,2,2,0,0,2,2,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,1,0,1,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,2,2,2,2,3,2,
1,2,1,2,2,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,2,3,2,2,3,2,2,2,1,2,2,2,2,
1,2,1,1,2,2,0,1,2,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,0,2,2,2,2,2,
0,2,0,2,2,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,0,2,2,2,
0,2,1,2,2,2,0,0,2,1,0,0,0,0,1,0,1,0,0,0,0,0,0,2,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,2,1,2,3,2,2,2,
1,2,1,2,2,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,
3,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,1,0,2,0,2,
0,2,1,2,2,2,0,0,1,2,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,2,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,2,3,2,2,3,2,1,2,1,1,1,
0,1,1,1,1,1,3,0,1,0,0,0,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,1,1,0,0,1,0,0,1,0,0,0,0,
0,0,1,0,0,0,0,0,2,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,
0,2,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,2,3,3,3,2,1,2,3,3,2,3,3,3,3,2,3,2,1,2,0,2,1,2,
0,2,0,2,2,2,0,0,1,2,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,
3,3,3,3,3,3,3,3,3,2,3,3,3,1,2,2,3,3,2,3,2,3,2,2,3,1,2,2,0,2,2,2,
0,2,1,2,2,2,0,0,1,2,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,1,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,2,2,2,3,3,3,3,1,3,2,2,2,
0,2,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,3,3,3,2,3,2,2,2,1,2,2,0,2,2,2,2,
0,2,0,2,2,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,2,3,3,2,3,3,2,2,1,2,2,2,2,2,2,
0,2,1,2,1,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,2,3,2,3,3,2,3,3,3,3,2,3,2,3,3,3,3,3,2,2,2,2,2,2,2,1,
0,2,0,1,2,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,3,3,3,2,1,2,3,3,3,3,3,3,3,2,3,2,3,2,1,2,3,0,2,1,2,2,
0,2,1,1,2,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,2,0,
3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,1,3,1,2,2,2,1,2,3,3,1,2,1,2,2,2,2,
0,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,
3,3,3,3,3,3,3,3,3,3,0,2,3,3,3,1,3,3,3,1,2,2,2,2,1,1,2,2,2,2,2,2,
0,2,0,1,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
3,3,3,3,3,3,2,3,3,3,2,2,3,3,3,2,1,2,3,2,3,2,2,2,2,1,2,1,1,1,2,2,
0,2,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,1,0,0,0,0,0,
1,0,1,0,0,0,0,0,2,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,3,3,3,3,2,3,3,2,3,1,2,2,2,2,3,2,3,1,1,2,2,1,2,2,1,1,0,2,2,2,2,
0,1,0,1,2,2,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
3,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2,0,
0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,1,0,1,0,1,1,0,1,1,0,0,0,1,1,0,1,1,1,0,0,0,0,0,0,1,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,0,0,0,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
3,2,2,1,2,2,2,2,2,2,2,1,2,2,1,2,2,1,1,1,1,1,1,1,1,2,1,1,0,3,3,3,
0,3,0,2,2,2,2,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,1,2,2,2,1,1,1,2,0,1,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,0,0,0,0,0,0,
0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,3,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,0,2,1,0,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
0,3,1,1,2,2,2,2,2,1,2,2,2,1,1,2,2,2,2,2,2,2,1,2,2,1,0,1,1,1,1,0,
0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
3,2,1,1,1,1,2,1,1,2,1,0,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,
0,0,2,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0,1,0,0,
2,1,1,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,1,2,1,2,1,1,1,1,0,0,0,0,
0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,2,1,2,2,2,2,2,2,2,2,2,2,1,2,1,2,1,1,2,1,1,1,2,1,2,1,2,0,1,0,1,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,3,1,2,2,2,1,2,2,2,2,2,2,2,2,1,2,1,1,1,1,1,1,2,1,2,1,1,0,1,0,1,
0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,1,2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,2,
0,2,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
3,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,1,1,1,1,1,1,1,0,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,2,0,1,1,1,0,1,0,0,0,1,1,0,1,1,0,0,0,0,0,1,1,0,0,
0,1,1,1,2,1,2,2,2,0,2,0,2,0,1,1,2,1,1,1,1,2,1,0,1,1,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,1,0,0,0,0,0,1,0,1,2,2,0,1,0,0,1,1,2,2,1,2,0,2,0,0,0,1,2,0,1,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,2,0,2,1,2,0,2,0,0,1,1,1,1,1,1,0,1,0,0,0,1,0,0,1,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,1,0,0,0,0,0,1,0,2,1,1,0,1,0,0,1,1,1,2,2,0,0,1,0,0,0,1,0,0,1,
1,1,2,1,0,1,1,1,0,1,0,1,1,1,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,2,2,1,
0,2,0,1,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,1,0,0,1,0,1,1,1,1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,1,1,1,1,1,1,1,1,2,1,0,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,1,0,0,0,1,1,0,1,
2,0,1,0,1,0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,0,1,1,2,1,1,2,0,1,0,0,0,1,1,0,1,
1,0,0,1,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,1,1,2,0,1,0,0,0,0,2,1,1,2,0,2,0,0,0,1,1,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,2,1,1,0,1,0,0,2,2,1,2,1,1,0,1,0,0,0,1,1,0,1,
2,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,2,2,0,0,0,0,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,2,2,0,0,0,0,2,1,1,1,0,2,1,1,0,0,0,2,1,0,1,
1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,1,1,2,0,1,0,0,1,1,0,2,1,1,0,1,0,0,0,1,1,0,1,
2,2,1,1,1,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,2,1,1,0,1,0,0,1,1,0,1,2,1,0,2,0,0,0,1,1,0,1,
2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,
0,1,0,0,2,0,2,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,1,0,1,1,2,0,1,0,0,1,1,1,0,1,0,0,1,0,0,0,1,0,0,1,
1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,0,0,0,0,0,1,0,1,1,0,0,1,0,0,2,1,1,1,1,1,0,1,0,0,0,0,1,0,1,
0,1,1,1,2,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,1,2,1,0,0,0,0,0,1,1,1,1,1,0,1,0,0,0,1,1,0,0,
)
Win1255HebrewModel = {
'char_to_order_map': WIN1255_CHAR_TO_ORDER_MAP,
'precedence_matrix': HEBREW_LANG_MODEL,
'typical_positive_ratio': 0.984004,
'keep_english_letter': False,
'charset_name': "windows-1255",
'language': 'Hebrew',
}
pip/_vendor/chardet/version.py 0000644 00000000362 14751155150 0012446 0 ustar 00 """
This module exists only to simplify retrieving the version number of chardet
from within setup.py and from chardet subpackages.
:author: Dan Blanchard (dan.blanchard@gmail.com)
"""
__version__ = "3.0.4"
VERSION = __version__.split('.')
pip/_vendor/chardet/mbcssm.py 0000644 00000061611 14751155150 0012251 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is mozilla.org code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
from .enums import MachineState
# BIG5
BIG5_CLS = (
1,1,1,1,1,1,1,1, # 00 - 07 #allow 0x00 as legal value
1,1,1,1,1,1,0,0, # 08 - 0f
1,1,1,1,1,1,1,1, # 10 - 17
1,1,1,0,1,1,1,1, # 18 - 1f
1,1,1,1,1,1,1,1, # 20 - 27
1,1,1,1,1,1,1,1, # 28 - 2f
1,1,1,1,1,1,1,1, # 30 - 37
1,1,1,1,1,1,1,1, # 38 - 3f
2,2,2,2,2,2,2,2, # 40 - 47
2,2,2,2,2,2,2,2, # 48 - 4f
2,2,2,2,2,2,2,2, # 50 - 57
2,2,2,2,2,2,2,2, # 58 - 5f
2,2,2,2,2,2,2,2, # 60 - 67
2,2,2,2,2,2,2,2, # 68 - 6f
2,2,2,2,2,2,2,2, # 70 - 77
2,2,2,2,2,2,2,1, # 78 - 7f
4,4,4,4,4,4,4,4, # 80 - 87
4,4,4,4,4,4,4,4, # 88 - 8f
4,4,4,4,4,4,4,4, # 90 - 97
4,4,4,4,4,4,4,4, # 98 - 9f
4,3,3,3,3,3,3,3, # a0 - a7
3,3,3,3,3,3,3,3, # a8 - af
3,3,3,3,3,3,3,3, # b0 - b7
3,3,3,3,3,3,3,3, # b8 - bf
3,3,3,3,3,3,3,3, # c0 - c7
3,3,3,3,3,3,3,3, # c8 - cf
3,3,3,3,3,3,3,3, # d0 - d7
3,3,3,3,3,3,3,3, # d8 - df
3,3,3,3,3,3,3,3, # e0 - e7
3,3,3,3,3,3,3,3, # e8 - ef
3,3,3,3,3,3,3,3, # f0 - f7
3,3,3,3,3,3,3,0 # f8 - ff
)
BIG5_ST = (
MachineState.ERROR,MachineState.START,MachineState.START, 3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,#08-0f
MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START#10-17
)
BIG5_CHAR_LEN_TABLE = (0, 1, 1, 2, 0)
BIG5_SM_MODEL = {'class_table': BIG5_CLS,
'class_factor': 5,
'state_table': BIG5_ST,
'char_len_table': BIG5_CHAR_LEN_TABLE,
'name': 'Big5'}
# CP949
CP949_CLS = (
1,1,1,1,1,1,1,1, 1,1,1,1,1,1,0,0, # 00 - 0f
1,1,1,1,1,1,1,1, 1,1,1,0,1,1,1,1, # 10 - 1f
1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1, # 20 - 2f
1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1, # 30 - 3f
1,4,4,4,4,4,4,4, 4,4,4,4,4,4,4,4, # 40 - 4f
4,4,5,5,5,5,5,5, 5,5,5,1,1,1,1,1, # 50 - 5f
1,5,5,5,5,5,5,5, 5,5,5,5,5,5,5,5, # 60 - 6f
5,5,5,5,5,5,5,5, 5,5,5,1,1,1,1,1, # 70 - 7f
0,6,6,6,6,6,6,6, 6,6,6,6,6,6,6,6, # 80 - 8f
6,6,6,6,6,6,6,6, 6,6,6,6,6,6,6,6, # 90 - 9f
6,7,7,7,7,7,7,7, 7,7,7,7,7,8,8,8, # a0 - af
7,7,7,7,7,7,7,7, 7,7,7,7,7,7,7,7, # b0 - bf
7,7,7,7,7,7,9,2, 2,3,2,2,2,2,2,2, # c0 - cf
2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2, # d0 - df
2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2, # e0 - ef
2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,0, # f0 - ff
)
CP949_ST = (
#cls= 0 1 2 3 4 5 6 7 8 9 # previous state =
MachineState.ERROR,MachineState.START, 3,MachineState.ERROR,MachineState.START,MachineState.START, 4, 5,MachineState.ERROR, 6, # MachineState.START
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, # MachineState.ERROR
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME, # MachineState.ITS_ME
MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START, # 3
MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START, # 4
MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START, # 5
MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START, # 6
)
CP949_CHAR_LEN_TABLE = (0, 1, 2, 0, 1, 1, 2, 2, 0, 2)
CP949_SM_MODEL = {'class_table': CP949_CLS,
'class_factor': 10,
'state_table': CP949_ST,
'char_len_table': CP949_CHAR_LEN_TABLE,
'name': 'CP949'}
# EUC-JP
EUCJP_CLS = (
4,4,4,4,4,4,4,4, # 00 - 07
4,4,4,4,4,4,5,5, # 08 - 0f
4,4,4,4,4,4,4,4, # 10 - 17
4,4,4,5,4,4,4,4, # 18 - 1f
4,4,4,4,4,4,4,4, # 20 - 27
4,4,4,4,4,4,4,4, # 28 - 2f
4,4,4,4,4,4,4,4, # 30 - 37
4,4,4,4,4,4,4,4, # 38 - 3f
4,4,4,4,4,4,4,4, # 40 - 47
4,4,4,4,4,4,4,4, # 48 - 4f
4,4,4,4,4,4,4,4, # 50 - 57
4,4,4,4,4,4,4,4, # 58 - 5f
4,4,4,4,4,4,4,4, # 60 - 67
4,4,4,4,4,4,4,4, # 68 - 6f
4,4,4,4,4,4,4,4, # 70 - 77
4,4,4,4,4,4,4,4, # 78 - 7f
5,5,5,5,5,5,5,5, # 80 - 87
5,5,5,5,5,5,1,3, # 88 - 8f
5,5,5,5,5,5,5,5, # 90 - 97
5,5,5,5,5,5,5,5, # 98 - 9f
5,2,2,2,2,2,2,2, # a0 - a7
2,2,2,2,2,2,2,2, # a8 - af
2,2,2,2,2,2,2,2, # b0 - b7
2,2,2,2,2,2,2,2, # b8 - bf
2,2,2,2,2,2,2,2, # c0 - c7
2,2,2,2,2,2,2,2, # c8 - cf
2,2,2,2,2,2,2,2, # d0 - d7
2,2,2,2,2,2,2,2, # d8 - df
0,0,0,0,0,0,0,0, # e0 - e7
0,0,0,0,0,0,0,0, # e8 - ef
0,0,0,0,0,0,0,0, # f0 - f7
0,0,0,0,0,0,0,5 # f8 - ff
)
EUCJP_ST = (
3, 4, 3, 5,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.START,MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#10-17
MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 3,MachineState.ERROR,#18-1f
3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START#20-27
)
EUCJP_CHAR_LEN_TABLE = (2, 2, 2, 3, 1, 0)
EUCJP_SM_MODEL = {'class_table': EUCJP_CLS,
'class_factor': 6,
'state_table': EUCJP_ST,
'char_len_table': EUCJP_CHAR_LEN_TABLE,
'name': 'EUC-JP'}
# EUC-KR
EUCKR_CLS = (
1,1,1,1,1,1,1,1, # 00 - 07
1,1,1,1,1,1,0,0, # 08 - 0f
1,1,1,1,1,1,1,1, # 10 - 17
1,1,1,0,1,1,1,1, # 18 - 1f
1,1,1,1,1,1,1,1, # 20 - 27
1,1,1,1,1,1,1,1, # 28 - 2f
1,1,1,1,1,1,1,1, # 30 - 37
1,1,1,1,1,1,1,1, # 38 - 3f
1,1,1,1,1,1,1,1, # 40 - 47
1,1,1,1,1,1,1,1, # 48 - 4f
1,1,1,1,1,1,1,1, # 50 - 57
1,1,1,1,1,1,1,1, # 58 - 5f
1,1,1,1,1,1,1,1, # 60 - 67
1,1,1,1,1,1,1,1, # 68 - 6f
1,1,1,1,1,1,1,1, # 70 - 77
1,1,1,1,1,1,1,1, # 78 - 7f
0,0,0,0,0,0,0,0, # 80 - 87
0,0,0,0,0,0,0,0, # 88 - 8f
0,0,0,0,0,0,0,0, # 90 - 97
0,0,0,0,0,0,0,0, # 98 - 9f
0,2,2,2,2,2,2,2, # a0 - a7
2,2,2,2,2,3,3,3, # a8 - af
2,2,2,2,2,2,2,2, # b0 - b7
2,2,2,2,2,2,2,2, # b8 - bf
2,2,2,2,2,2,2,2, # c0 - c7
2,3,2,2,2,2,2,2, # c8 - cf
2,2,2,2,2,2,2,2, # d0 - d7
2,2,2,2,2,2,2,2, # d8 - df
2,2,2,2,2,2,2,2, # e0 - e7
2,2,2,2,2,2,2,2, # e8 - ef
2,2,2,2,2,2,2,2, # f0 - f7
2,2,2,2,2,2,2,0 # f8 - ff
)
EUCKR_ST = (
MachineState.ERROR,MachineState.START, 3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START #08-0f
)
EUCKR_CHAR_LEN_TABLE = (0, 1, 2, 0)
EUCKR_SM_MODEL = {'class_table': EUCKR_CLS,
'class_factor': 4,
'state_table': EUCKR_ST,
'char_len_table': EUCKR_CHAR_LEN_TABLE,
'name': 'EUC-KR'}
# EUC-TW
EUCTW_CLS = (
2,2,2,2,2,2,2,2, # 00 - 07
2,2,2,2,2,2,0,0, # 08 - 0f
2,2,2,2,2,2,2,2, # 10 - 17
2,2,2,0,2,2,2,2, # 18 - 1f
2,2,2,2,2,2,2,2, # 20 - 27
2,2,2,2,2,2,2,2, # 28 - 2f
2,2,2,2,2,2,2,2, # 30 - 37
2,2,2,2,2,2,2,2, # 38 - 3f
2,2,2,2,2,2,2,2, # 40 - 47
2,2,2,2,2,2,2,2, # 48 - 4f
2,2,2,2,2,2,2,2, # 50 - 57
2,2,2,2,2,2,2,2, # 58 - 5f
2,2,2,2,2,2,2,2, # 60 - 67
2,2,2,2,2,2,2,2, # 68 - 6f
2,2,2,2,2,2,2,2, # 70 - 77
2,2,2,2,2,2,2,2, # 78 - 7f
0,0,0,0,0,0,0,0, # 80 - 87
0,0,0,0,0,0,6,0, # 88 - 8f
0,0,0,0,0,0,0,0, # 90 - 97
0,0,0,0,0,0,0,0, # 98 - 9f
0,3,4,4,4,4,4,4, # a0 - a7
5,5,1,1,1,1,1,1, # a8 - af
1,1,1,1,1,1,1,1, # b0 - b7
1,1,1,1,1,1,1,1, # b8 - bf
1,1,3,1,3,3,3,3, # c0 - c7
3,3,3,3,3,3,3,3, # c8 - cf
3,3,3,3,3,3,3,3, # d0 - d7
3,3,3,3,3,3,3,3, # d8 - df
3,3,3,3,3,3,3,3, # e0 - e7
3,3,3,3,3,3,3,3, # e8 - ef
3,3,3,3,3,3,3,3, # f0 - f7
3,3,3,3,3,3,3,0 # f8 - ff
)
EUCTW_ST = (
MachineState.ERROR,MachineState.ERROR,MachineState.START, 3, 3, 3, 4,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.START,MachineState.ERROR,#10-17
MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#18-1f
5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.START,MachineState.START,#20-27
MachineState.START,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START #28-2f
)
EUCTW_CHAR_LEN_TABLE = (0, 0, 1, 2, 2, 2, 3)
EUCTW_SM_MODEL = {'class_table': EUCTW_CLS,
'class_factor': 7,
'state_table': EUCTW_ST,
'char_len_table': EUCTW_CHAR_LEN_TABLE,
'name': 'x-euc-tw'}
# GB2312
GB2312_CLS = (
1,1,1,1,1,1,1,1, # 00 - 07
1,1,1,1,1,1,0,0, # 08 - 0f
1,1,1,1,1,1,1,1, # 10 - 17
1,1,1,0,1,1,1,1, # 18 - 1f
1,1,1,1,1,1,1,1, # 20 - 27
1,1,1,1,1,1,1,1, # 28 - 2f
3,3,3,3,3,3,3,3, # 30 - 37
3,3,1,1,1,1,1,1, # 38 - 3f
2,2,2,2,2,2,2,2, # 40 - 47
2,2,2,2,2,2,2,2, # 48 - 4f
2,2,2,2,2,2,2,2, # 50 - 57
2,2,2,2,2,2,2,2, # 58 - 5f
2,2,2,2,2,2,2,2, # 60 - 67
2,2,2,2,2,2,2,2, # 68 - 6f
2,2,2,2,2,2,2,2, # 70 - 77
2,2,2,2,2,2,2,4, # 78 - 7f
5,6,6,6,6,6,6,6, # 80 - 87
6,6,6,6,6,6,6,6, # 88 - 8f
6,6,6,6,6,6,6,6, # 90 - 97
6,6,6,6,6,6,6,6, # 98 - 9f
6,6,6,6,6,6,6,6, # a0 - a7
6,6,6,6,6,6,6,6, # a8 - af
6,6,6,6,6,6,6,6, # b0 - b7
6,6,6,6,6,6,6,6, # b8 - bf
6,6,6,6,6,6,6,6, # c0 - c7
6,6,6,6,6,6,6,6, # c8 - cf
6,6,6,6,6,6,6,6, # d0 - d7
6,6,6,6,6,6,6,6, # d8 - df
6,6,6,6,6,6,6,6, # e0 - e7
6,6,6,6,6,6,6,6, # e8 - ef
6,6,6,6,6,6,6,6, # f0 - f7
6,6,6,6,6,6,6,0 # f8 - ff
)
GB2312_ST = (
MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START, 3,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,#10-17
4,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#18-1f
MachineState.ERROR,MachineState.ERROR, 5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,#20-27
MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START #28-2f
)
# To be accurate, the length of class 6 can be either 2 or 4.
# But it is not necessary to discriminate between the two since
# it is used for frequency analysis only, and we are validating
# each code range there as well. So it is safe to set it to be
# 2 here.
GB2312_CHAR_LEN_TABLE = (0, 1, 1, 1, 1, 1, 2)
GB2312_SM_MODEL = {'class_table': GB2312_CLS,
'class_factor': 7,
'state_table': GB2312_ST,
'char_len_table': GB2312_CHAR_LEN_TABLE,
'name': 'GB2312'}
# Shift_JIS
SJIS_CLS = (
1,1,1,1,1,1,1,1, # 00 - 07
1,1,1,1,1,1,0,0, # 08 - 0f
1,1,1,1,1,1,1,1, # 10 - 17
1,1,1,0,1,1,1,1, # 18 - 1f
1,1,1,1,1,1,1,1, # 20 - 27
1,1,1,1,1,1,1,1, # 28 - 2f
1,1,1,1,1,1,1,1, # 30 - 37
1,1,1,1,1,1,1,1, # 38 - 3f
2,2,2,2,2,2,2,2, # 40 - 47
2,2,2,2,2,2,2,2, # 48 - 4f
2,2,2,2,2,2,2,2, # 50 - 57
2,2,2,2,2,2,2,2, # 58 - 5f
2,2,2,2,2,2,2,2, # 60 - 67
2,2,2,2,2,2,2,2, # 68 - 6f
2,2,2,2,2,2,2,2, # 70 - 77
2,2,2,2,2,2,2,1, # 78 - 7f
3,3,3,3,3,2,2,3, # 80 - 87
3,3,3,3,3,3,3,3, # 88 - 8f
3,3,3,3,3,3,3,3, # 90 - 97
3,3,3,3,3,3,3,3, # 98 - 9f
#0xa0 is illegal in sjis encoding, but some pages does
#contain such byte. We need to be more error forgiven.
2,2,2,2,2,2,2,2, # a0 - a7
2,2,2,2,2,2,2,2, # a8 - af
2,2,2,2,2,2,2,2, # b0 - b7
2,2,2,2,2,2,2,2, # b8 - bf
2,2,2,2,2,2,2,2, # c0 - c7
2,2,2,2,2,2,2,2, # c8 - cf
2,2,2,2,2,2,2,2, # d0 - d7
2,2,2,2,2,2,2,2, # d8 - df
3,3,3,3,3,3,3,3, # e0 - e7
3,3,3,3,3,4,4,4, # e8 - ef
3,3,3,3,3,3,3,3, # f0 - f7
3,3,3,3,3,0,0,0) # f8 - ff
SJIS_ST = (
MachineState.ERROR,MachineState.START,MachineState.START, 3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START #10-17
)
SJIS_CHAR_LEN_TABLE = (0, 1, 1, 2, 0, 0)
SJIS_SM_MODEL = {'class_table': SJIS_CLS,
'class_factor': 6,
'state_table': SJIS_ST,
'char_len_table': SJIS_CHAR_LEN_TABLE,
'name': 'Shift_JIS'}
# UCS2-BE
UCS2BE_CLS = (
0,0,0,0,0,0,0,0, # 00 - 07
0,0,1,0,0,2,0,0, # 08 - 0f
0,0,0,0,0,0,0,0, # 10 - 17
0,0,0,3,0,0,0,0, # 18 - 1f
0,0,0,0,0,0,0,0, # 20 - 27
0,3,3,3,3,3,0,0, # 28 - 2f
0,0,0,0,0,0,0,0, # 30 - 37
0,0,0,0,0,0,0,0, # 38 - 3f
0,0,0,0,0,0,0,0, # 40 - 47
0,0,0,0,0,0,0,0, # 48 - 4f
0,0,0,0,0,0,0,0, # 50 - 57
0,0,0,0,0,0,0,0, # 58 - 5f
0,0,0,0,0,0,0,0, # 60 - 67
0,0,0,0,0,0,0,0, # 68 - 6f
0,0,0,0,0,0,0,0, # 70 - 77
0,0,0,0,0,0,0,0, # 78 - 7f
0,0,0,0,0,0,0,0, # 80 - 87
0,0,0,0,0,0,0,0, # 88 - 8f
0,0,0,0,0,0,0,0, # 90 - 97
0,0,0,0,0,0,0,0, # 98 - 9f
0,0,0,0,0,0,0,0, # a0 - a7
0,0,0,0,0,0,0,0, # a8 - af
0,0,0,0,0,0,0,0, # b0 - b7
0,0,0,0,0,0,0,0, # b8 - bf
0,0,0,0,0,0,0,0, # c0 - c7
0,0,0,0,0,0,0,0, # c8 - cf
0,0,0,0,0,0,0,0, # d0 - d7
0,0,0,0,0,0,0,0, # d8 - df
0,0,0,0,0,0,0,0, # e0 - e7
0,0,0,0,0,0,0,0, # e8 - ef
0,0,0,0,0,0,0,0, # f0 - f7
0,0,0,0,0,0,4,5 # f8 - ff
)
UCS2BE_ST = (
5, 7, 7,MachineState.ERROR, 4, 3,MachineState.ERROR,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
MachineState.ITS_ME,MachineState.ITS_ME, 6, 6, 6, 6,MachineState.ERROR,MachineState.ERROR,#10-17
6, 6, 6, 6, 6,MachineState.ITS_ME, 6, 6,#18-1f
6, 6, 6, 6, 5, 7, 7,MachineState.ERROR,#20-27
5, 8, 6, 6,MachineState.ERROR, 6, 6, 6,#28-2f
6, 6, 6, 6,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START #30-37
)
UCS2BE_CHAR_LEN_TABLE = (2, 2, 2, 0, 2, 2)
UCS2BE_SM_MODEL = {'class_table': UCS2BE_CLS,
'class_factor': 6,
'state_table': UCS2BE_ST,
'char_len_table': UCS2BE_CHAR_LEN_TABLE,
'name': 'UTF-16BE'}
# UCS2-LE
UCS2LE_CLS = (
0,0,0,0,0,0,0,0, # 00 - 07
0,0,1,0,0,2,0,0, # 08 - 0f
0,0,0,0,0,0,0,0, # 10 - 17
0,0,0,3,0,0,0,0, # 18 - 1f
0,0,0,0,0,0,0,0, # 20 - 27
0,3,3,3,3,3,0,0, # 28 - 2f
0,0,0,0,0,0,0,0, # 30 - 37
0,0,0,0,0,0,0,0, # 38 - 3f
0,0,0,0,0,0,0,0, # 40 - 47
0,0,0,0,0,0,0,0, # 48 - 4f
0,0,0,0,0,0,0,0, # 50 - 57
0,0,0,0,0,0,0,0, # 58 - 5f
0,0,0,0,0,0,0,0, # 60 - 67
0,0,0,0,0,0,0,0, # 68 - 6f
0,0,0,0,0,0,0,0, # 70 - 77
0,0,0,0,0,0,0,0, # 78 - 7f
0,0,0,0,0,0,0,0, # 80 - 87
0,0,0,0,0,0,0,0, # 88 - 8f
0,0,0,0,0,0,0,0, # 90 - 97
0,0,0,0,0,0,0,0, # 98 - 9f
0,0,0,0,0,0,0,0, # a0 - a7
0,0,0,0,0,0,0,0, # a8 - af
0,0,0,0,0,0,0,0, # b0 - b7
0,0,0,0,0,0,0,0, # b8 - bf
0,0,0,0,0,0,0,0, # c0 - c7
0,0,0,0,0,0,0,0, # c8 - cf
0,0,0,0,0,0,0,0, # d0 - d7
0,0,0,0,0,0,0,0, # d8 - df
0,0,0,0,0,0,0,0, # e0 - e7
0,0,0,0,0,0,0,0, # e8 - ef
0,0,0,0,0,0,0,0, # f0 - f7
0,0,0,0,0,0,4,5 # f8 - ff
)
UCS2LE_ST = (
6, 6, 7, 6, 4, 3,MachineState.ERROR,MachineState.ERROR,#00-07
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
MachineState.ITS_ME,MachineState.ITS_ME, 5, 5, 5,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,#10-17
5, 5, 5,MachineState.ERROR, 5,MachineState.ERROR, 6, 6,#18-1f
7, 6, 8, 8, 5, 5, 5,MachineState.ERROR,#20-27
5, 5, 5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 5, 5,#28-2f
5, 5, 5,MachineState.ERROR, 5,MachineState.ERROR,MachineState.START,MachineState.START #30-37
)
UCS2LE_CHAR_LEN_TABLE = (2, 2, 2, 2, 2, 2)
UCS2LE_SM_MODEL = {'class_table': UCS2LE_CLS,
'class_factor': 6,
'state_table': UCS2LE_ST,
'char_len_table': UCS2LE_CHAR_LEN_TABLE,
'name': 'UTF-16LE'}
# UTF-8
UTF8_CLS = (
1,1,1,1,1,1,1,1, # 00 - 07 #allow 0x00 as a legal value
1,1,1,1,1,1,0,0, # 08 - 0f
1,1,1,1,1,1,1,1, # 10 - 17
1,1,1,0,1,1,1,1, # 18 - 1f
1,1,1,1,1,1,1,1, # 20 - 27
1,1,1,1,1,1,1,1, # 28 - 2f
1,1,1,1,1,1,1,1, # 30 - 37
1,1,1,1,1,1,1,1, # 38 - 3f
1,1,1,1,1,1,1,1, # 40 - 47
1,1,1,1,1,1,1,1, # 48 - 4f
1,1,1,1,1,1,1,1, # 50 - 57
1,1,1,1,1,1,1,1, # 58 - 5f
1,1,1,1,1,1,1,1, # 60 - 67
1,1,1,1,1,1,1,1, # 68 - 6f
1,1,1,1,1,1,1,1, # 70 - 77
1,1,1,1,1,1,1,1, # 78 - 7f
2,2,2,2,3,3,3,3, # 80 - 87
4,4,4,4,4,4,4,4, # 88 - 8f
4,4,4,4,4,4,4,4, # 90 - 97
4,4,4,4,4,4,4,4, # 98 - 9f
5,5,5,5,5,5,5,5, # a0 - a7
5,5,5,5,5,5,5,5, # a8 - af
5,5,5,5,5,5,5,5, # b0 - b7
5,5,5,5,5,5,5,5, # b8 - bf
0,0,6,6,6,6,6,6, # c0 - c7
6,6,6,6,6,6,6,6, # c8 - cf
6,6,6,6,6,6,6,6, # d0 - d7
6,6,6,6,6,6,6,6, # d8 - df
7,8,8,8,8,8,8,8, # e0 - e7
8,8,8,8,8,9,8,8, # e8 - ef
10,11,11,11,11,11,11,11, # f0 - f7
12,13,13,13,14,15,0,0 # f8 - ff
)
UTF8_ST = (
MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 12, 10,#00-07
9, 11, 8, 7, 6, 5, 4, 3,#08-0f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#10-17
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#18-1f
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#20-27
MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#28-2f
MachineState.ERROR,MachineState.ERROR, 5, 5, 5, 5,MachineState.ERROR,MachineState.ERROR,#30-37
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#38-3f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 5, 5, 5,MachineState.ERROR,MachineState.ERROR,#40-47
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#48-4f
MachineState.ERROR,MachineState.ERROR, 7, 7, 7, 7,MachineState.ERROR,MachineState.ERROR,#50-57
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#58-5f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 7, 7,MachineState.ERROR,MachineState.ERROR,#60-67
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#68-6f
MachineState.ERROR,MachineState.ERROR, 9, 9, 9, 9,MachineState.ERROR,MachineState.ERROR,#70-77
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#78-7f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 9,MachineState.ERROR,MachineState.ERROR,#80-87
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#88-8f
MachineState.ERROR,MachineState.ERROR, 12, 12, 12, 12,MachineState.ERROR,MachineState.ERROR,#90-97
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#98-9f
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, 12,MachineState.ERROR,MachineState.ERROR,#a0-a7
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#a8-af
MachineState.ERROR,MachineState.ERROR, 12, 12, 12,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#b0-b7
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#b8-bf
MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,#c0-c7
MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR #c8-cf
)
UTF8_CHAR_LEN_TABLE = (0, 1, 0, 0, 0, 0, 2, 3, 3, 3, 4, 4, 5, 5, 6, 6)
UTF8_SM_MODEL = {'class_table': UTF8_CLS,
'class_factor': 16,
'state_table': UTF8_ST,
'char_len_table': UTF8_CHAR_LEN_TABLE,
'name': 'UTF-8'}
pip/_vendor/chardet/euckrfreq.py 0000644 00000032352 14751155150 0012754 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# Sampling from about 20M text materials include literature and computer technology
# 128 --> 0.79
# 256 --> 0.92
# 512 --> 0.986
# 1024 --> 0.99944
# 2048 --> 0.99999
#
# Idea Distribution Ratio = 0.98653 / (1-0.98653) = 73.24
# Random Distribution Ration = 512 / (2350-512) = 0.279.
#
# Typical Distribution Ratio
EUCKR_TYPICAL_DISTRIBUTION_RATIO = 6.0
EUCKR_TABLE_SIZE = 2352
# Char to FreqOrder table ,
EUCKR_CHAR_TO_FREQ_ORDER = (
13, 130, 120,1396, 481,1719,1720, 328, 609, 212,1721, 707, 400, 299,1722, 87,
1397,1723, 104, 536,1117,1203,1724,1267, 685,1268, 508,1725,1726,1727,1728,1398,
1399,1729,1730,1731, 141, 621, 326,1057, 368,1732, 267, 488, 20,1733,1269,1734,
945,1400,1735, 47, 904,1270,1736,1737, 773, 248,1738, 409, 313, 786, 429,1739,
116, 987, 813,1401, 683, 75,1204, 145,1740,1741,1742,1743, 16, 847, 667, 622,
708,1744,1745,1746, 966, 787, 304, 129,1747, 60, 820, 123, 676,1748,1749,1750,
1751, 617,1752, 626,1753,1754,1755,1756, 653,1757,1758,1759,1760,1761,1762, 856,
344,1763,1764,1765,1766, 89, 401, 418, 806, 905, 848,1767,1768,1769, 946,1205,
709,1770,1118,1771, 241,1772,1773,1774,1271,1775, 569,1776, 999,1777,1778,1779,
1780, 337, 751,1058, 28, 628, 254,1781, 177, 906, 270, 349, 891,1079,1782, 19,
1783, 379,1784, 315,1785, 629, 754,1402, 559,1786, 636, 203,1206,1787, 710, 567,
1788, 935, 814,1789,1790,1207, 766, 528,1791,1792,1208,1793,1794,1795,1796,1797,
1403,1798,1799, 533,1059,1404,1405,1156,1406, 936, 884,1080,1800, 351,1801,1802,
1803,1804,1805, 801,1806,1807,1808,1119,1809,1157, 714, 474,1407,1810, 298, 899,
885,1811,1120, 802,1158,1812, 892,1813,1814,1408, 659,1815,1816,1121,1817,1818,
1819,1820,1821,1822, 319,1823, 594, 545,1824, 815, 937,1209,1825,1826, 573,1409,
1022,1827,1210,1828,1829,1830,1831,1832,1833, 556, 722, 807,1122,1060,1834, 697,
1835, 900, 557, 715,1836,1410, 540,1411, 752,1159, 294, 597,1211, 976, 803, 770,
1412,1837,1838, 39, 794,1413, 358,1839, 371, 925,1840, 453, 661, 788, 531, 723,
544,1023,1081, 869, 91,1841, 392, 430, 790, 602,1414, 677,1082, 457,1415,1416,
1842,1843, 475, 327,1024,1417, 795, 121,1844, 733, 403,1418,1845,1846,1847, 300,
119, 711,1212, 627,1848,1272, 207,1849,1850, 796,1213, 382,1851, 519,1852,1083,
893,1853,1854,1855, 367, 809, 487, 671,1856, 663,1857,1858, 956, 471, 306, 857,
1859,1860,1160,1084,1861,1862,1863,1864,1865,1061,1866,1867,1868,1869,1870,1871,
282, 96, 574,1872, 502,1085,1873,1214,1874, 907,1875,1876, 827, 977,1419,1420,
1421, 268,1877,1422,1878,1879,1880, 308,1881, 2, 537,1882,1883,1215,1884,1885,
127, 791,1886,1273,1423,1887, 34, 336, 404, 643,1888, 571, 654, 894, 840,1889,
0, 886,1274, 122, 575, 260, 908, 938,1890,1275, 410, 316,1891,1892, 100,1893,
1894,1123, 48,1161,1124,1025,1895, 633, 901,1276,1896,1897, 115, 816,1898, 317,
1899, 694,1900, 909, 734,1424, 572, 866,1425, 691, 85, 524,1010, 543, 394, 841,
1901,1902,1903,1026,1904,1905,1906,1907,1908,1909, 30, 451, 651, 988, 310,1910,
1911,1426, 810,1216, 93,1912,1913,1277,1217,1914, 858, 759, 45, 58, 181, 610,
269,1915,1916, 131,1062, 551, 443,1000, 821,1427, 957, 895,1086,1917,1918, 375,
1919, 359,1920, 687,1921, 822,1922, 293,1923,1924, 40, 662, 118, 692, 29, 939,
887, 640, 482, 174,1925, 69,1162, 728,1428, 910,1926,1278,1218,1279, 386, 870,
217, 854,1163, 823,1927,1928,1929,1930, 834,1931, 78,1932, 859,1933,1063,1934,
1935,1936,1937, 438,1164, 208, 595,1938,1939,1940,1941,1219,1125,1942, 280, 888,
1429,1430,1220,1431,1943,1944,1945,1946,1947,1280, 150, 510,1432,1948,1949,1950,
1951,1952,1953,1954,1011,1087,1955,1433,1043,1956, 881,1957, 614, 958,1064,1065,
1221,1958, 638,1001, 860, 967, 896,1434, 989, 492, 553,1281,1165,1959,1282,1002,
1283,1222,1960,1961,1962,1963, 36, 383, 228, 753, 247, 454,1964, 876, 678,1965,
1966,1284, 126, 464, 490, 835, 136, 672, 529, 940,1088,1435, 473,1967,1968, 467,
50, 390, 227, 587, 279, 378, 598, 792, 968, 240, 151, 160, 849, 882,1126,1285,
639,1044, 133, 140, 288, 360, 811, 563,1027, 561, 142, 523,1969,1970,1971, 7,
103, 296, 439, 407, 506, 634, 990,1972,1973,1974,1975, 645,1976,1977,1978,1979,
1980,1981, 236,1982,1436,1983,1984,1089, 192, 828, 618, 518,1166, 333,1127,1985,
818,1223,1986,1987,1988,1989,1990,1991,1992,1993, 342,1128,1286, 746, 842,1994,
1995, 560, 223,1287, 98, 8, 189, 650, 978,1288,1996,1437,1997, 17, 345, 250,
423, 277, 234, 512, 226, 97, 289, 42, 167,1998, 201,1999,2000, 843, 836, 824,
532, 338, 783,1090, 182, 576, 436,1438,1439, 527, 500,2001, 947, 889,2002,2003,
2004,2005, 262, 600, 314, 447,2006, 547,2007, 693, 738,1129,2008, 71,1440, 745,
619, 688,2009, 829,2010,2011, 147,2012, 33, 948,2013,2014, 74, 224,2015, 61,
191, 918, 399, 637,2016,1028,1130, 257, 902,2017,2018,2019,2020,2021,2022,2023,
2024,2025,2026, 837,2027,2028,2029,2030, 179, 874, 591, 52, 724, 246,2031,2032,
2033,2034,1167, 969,2035,1289, 630, 605, 911,1091,1168,2036,2037,2038,1441, 912,
2039, 623,2040,2041, 253,1169,1290,2042,1442, 146, 620, 611, 577, 433,2043,1224,
719,1170, 959, 440, 437, 534, 84, 388, 480,1131, 159, 220, 198, 679,2044,1012,
819,1066,1443, 113,1225, 194, 318,1003,1029,2045,2046,2047,2048,1067,2049,2050,
2051,2052,2053, 59, 913, 112,2054, 632,2055, 455, 144, 739,1291,2056, 273, 681,
499,2057, 448,2058,2059, 760,2060,2061, 970, 384, 169, 245,1132,2062,2063, 414,
1444,2064,2065, 41, 235,2066, 157, 252, 877, 568, 919, 789, 580,2067, 725,2068,
2069,1292,2070,2071,1445,2072,1446,2073,2074, 55, 588, 66,1447, 271,1092,2075,
1226,2076, 960,1013, 372,2077,2078,2079,2080,2081,1293,2082,2083,2084,2085, 850,
2086,2087,2088,2089,2090, 186,2091,1068, 180,2092,2093,2094, 109,1227, 522, 606,
2095, 867,1448,1093, 991,1171, 926, 353,1133,2096, 581,2097,2098,2099,1294,1449,
1450,2100, 596,1172,1014,1228,2101,1451,1295,1173,1229,2102,2103,1296,1134,1452,
949,1135,2104,2105,1094,1453,1454,1455,2106,1095,2107,2108,2109,2110,2111,2112,
2113,2114,2115,2116,2117, 804,2118,2119,1230,1231, 805,1456, 405,1136,2120,2121,
2122,2123,2124, 720, 701,1297, 992,1457, 927,1004,2125,2126,2127,2128,2129,2130,
22, 417,2131, 303,2132, 385,2133, 971, 520, 513,2134,1174, 73,1096, 231, 274,
962,1458, 673,2135,1459,2136, 152,1137,2137,2138,2139,2140,1005,1138,1460,1139,
2141,2142,2143,2144, 11, 374, 844,2145, 154,1232, 46,1461,2146, 838, 830, 721,
1233, 106,2147, 90, 428, 462, 578, 566,1175, 352,2148,2149, 538,1234, 124,1298,
2150,1462, 761, 565,2151, 686,2152, 649,2153, 72, 173,2154, 460, 415,2155,1463,
2156,1235, 305,2157,2158,2159,2160,2161,2162, 579,2163,2164,2165,2166,2167, 747,
2168,2169,2170,2171,1464, 669,2172,2173,2174,2175,2176,1465,2177, 23, 530, 285,
2178, 335, 729,2179, 397,2180,2181,2182,1030,2183,2184, 698,2185,2186, 325,2187,
2188, 369,2189, 799,1097,1015, 348,2190,1069, 680,2191, 851,1466,2192,2193, 10,
2194, 613, 424,2195, 979, 108, 449, 589, 27, 172, 81,1031, 80, 774, 281, 350,
1032, 525, 301, 582,1176,2196, 674,1045,2197,2198,1467, 730, 762,2199,2200,2201,
2202,1468,2203, 993,2204,2205, 266,1070, 963,1140,2206,2207,2208, 664,1098, 972,
2209,2210,2211,1177,1469,1470, 871,2212,2213,2214,2215,2216,1471,2217,2218,2219,
2220,2221,2222,2223,2224,2225,2226,2227,1472,1236,2228,2229,2230,2231,2232,2233,
2234,2235,1299,2236,2237, 200,2238, 477, 373,2239,2240, 731, 825, 777,2241,2242,
2243, 521, 486, 548,2244,2245,2246,1473,1300, 53, 549, 137, 875, 76, 158,2247,
1301,1474, 469, 396,1016, 278, 712,2248, 321, 442, 503, 767, 744, 941,1237,1178,
1475,2249, 82, 178,1141,1179, 973,2250,1302,2251, 297,2252,2253, 570,2254,2255,
2256, 18, 450, 206,2257, 290, 292,1142,2258, 511, 162, 99, 346, 164, 735,2259,
1476,1477, 4, 554, 343, 798,1099,2260,1100,2261, 43, 171,1303, 139, 215,2262,
2263, 717, 775,2264,1033, 322, 216,2265, 831,2266, 149,2267,1304,2268,2269, 702,
1238, 135, 845, 347, 309,2270, 484,2271, 878, 655, 238,1006,1478,2272, 67,2273,
295,2274,2275, 461,2276, 478, 942, 412,2277,1034,2278,2279,2280, 265,2281, 541,
2282,2283,2284,2285,2286, 70, 852,1071,2287,2288,2289,2290, 21, 56, 509, 117,
432,2291,2292, 331, 980, 552,1101, 148, 284, 105, 393,1180,1239, 755,2293, 187,
2294,1046,1479,2295, 340,2296, 63,1047, 230,2297,2298,1305, 763,1306, 101, 800,
808, 494,2299,2300,2301, 903,2302, 37,1072, 14, 5,2303, 79, 675,2304, 312,
2305,2306,2307,2308,2309,1480, 6,1307,2310,2311,2312, 1, 470, 35, 24, 229,
2313, 695, 210, 86, 778, 15, 784, 592, 779, 32, 77, 855, 964,2314, 259,2315,
501, 380,2316,2317, 83, 981, 153, 689,1308,1481,1482,1483,2318,2319, 716,1484,
2320,2321,2322,2323,2324,2325,1485,2326,2327, 128, 57, 68, 261,1048, 211, 170,
1240, 31,2328, 51, 435, 742,2329,2330,2331, 635,2332, 264, 456,2333,2334,2335,
425,2336,1486, 143, 507, 263, 943,2337, 363, 920,1487, 256,1488,1102, 243, 601,
1489,2338,2339,2340,2341,2342,2343,2344, 861,2345,2346,2347,2348,2349,2350, 395,
2351,1490,1491, 62, 535, 166, 225,2352,2353, 668, 419,1241, 138, 604, 928,2354,
1181,2355,1492,1493,2356,2357,2358,1143,2359, 696,2360, 387, 307,1309, 682, 476,
2361,2362, 332, 12, 222, 156,2363, 232,2364, 641, 276, 656, 517,1494,1495,1035,
416, 736,1496,2365,1017, 586,2366,2367,2368,1497,2369, 242,2370,2371,2372,1498,
2373, 965, 713,2374,2375,2376,2377, 740, 982,1499, 944,1500,1007,2378,2379,1310,
1501,2380,2381,2382, 785, 329,2383,2384,1502,2385,2386,2387, 932,2388,1503,2389,
2390,2391,2392,1242,2393,2394,2395,2396,2397, 994, 950,2398,2399,2400,2401,1504,
1311,2402,2403,2404,2405,1049, 749,2406,2407, 853, 718,1144,1312,2408,1182,1505,
2409,2410, 255, 516, 479, 564, 550, 214,1506,1507,1313, 413, 239, 444, 339,1145,
1036,1508,1509,1314,1037,1510,1315,2411,1511,2412,2413,2414, 176, 703, 497, 624,
593, 921, 302,2415, 341, 165,1103,1512,2416,1513,2417,2418,2419, 376,2420, 700,
2421,2422,2423, 258, 768,1316,2424,1183,2425, 995, 608,2426,2427,2428,2429, 221,
2430,2431,2432,2433,2434,2435,2436,2437, 195, 323, 726, 188, 897, 983,1317, 377,
644,1050, 879,2438, 452,2439,2440,2441,2442,2443,2444, 914,2445,2446,2447,2448,
915, 489,2449,1514,1184,2450,2451, 515, 64, 427, 495,2452, 583,2453, 483, 485,
1038, 562, 213,1515, 748, 666,2454,2455,2456,2457, 334,2458, 780, 996,1008, 705,
1243,2459,2460,2461,2462,2463, 114,2464, 493,1146, 366, 163,1516, 961,1104,2465,
291,2466,1318,1105,2467,1517, 365,2468, 355, 951,1244,2469,1319,2470, 631,2471,
2472, 218,1320, 364, 320, 756,1518,1519,1321,1520,1322,2473,2474,2475,2476, 997,
2477,2478,2479,2480, 665,1185,2481, 916,1521,2482,2483,2484, 584, 684,2485,2486,
797,2487,1051,1186,2488,2489,2490,1522,2491,2492, 370,2493,1039,1187, 65,2494,
434, 205, 463,1188,2495, 125, 812, 391, 402, 826, 699, 286, 398, 155, 781, 771,
585,2496, 590, 505,1073,2497, 599, 244, 219, 917,1018, 952, 646,1523,2498,1323,
2499,2500, 49, 984, 354, 741,2501, 625,2502,1324,2503,1019, 190, 357, 757, 491,
95, 782, 868,2504,2505,2506,2507,2508,2509, 134,1524,1074, 422,1525, 898,2510,
161,2511,2512,2513,2514, 769,2515,1526,2516,2517, 411,1325,2518, 472,1527,2519,
2520,2521,2522,2523,2524, 985,2525,2526,2527,2528,2529,2530, 764,2531,1245,2532,
2533, 25, 204, 311,2534, 496,2535,1052,2536,2537,2538,2539,2540,2541,2542, 199,
704, 504, 468, 758, 657,1528, 196, 44, 839,1246, 272, 750,2543, 765, 862,2544,
2545,1326,2546, 132, 615, 933,2547, 732,2548,2549,2550,1189,1529,2551, 283,1247,
1053, 607, 929,2552,2553,2554, 930, 183, 872, 616,1040,1147,2555,1148,1020, 441,
249,1075,2556,2557,2558, 466, 743,2559,2560,2561, 92, 514, 426, 420, 526,2562,
2563,2564,2565,2566,2567,2568, 185,2569,2570,2571,2572, 776,1530, 658,2573, 362,
2574, 361, 922,1076, 793,2575,2576,2577,2578,2579,2580,1531, 251,2581,2582,2583,
2584,1532, 54, 612, 237,1327,2585,2586, 275, 408, 647, 111,2587,1533,1106, 465,
3, 458, 9, 38,2588, 107, 110, 890, 209, 26, 737, 498,2589,1534,2590, 431,
202, 88,1535, 356, 287,1107, 660,1149,2591, 381,1536, 986,1150, 445,1248,1151,
974,2592,2593, 846,2594, 446, 953, 184,1249,1250, 727,2595, 923, 193, 883,2596,
2597,2598, 102, 324, 539, 817,2599, 421,1041,2600, 832,2601, 94, 175, 197, 406,
2602, 459,2603,2604,2605,2606,2607, 330, 555,2608,2609,2610, 706,1108, 389,2611,
2612,2613,2614, 233,2615, 833, 558, 931, 954,1251,2616,2617,1537, 546,2618,2619,
1009,2620,2621,2622,1538, 690,1328,2623, 955,2624,1539,2625,2626, 772,2627,2628,
2629,2630,2631, 924, 648, 863, 603,2632,2633, 934,1540, 864, 865,2634, 642,1042,
670,1190,2635,2636,2637,2638, 168,2639, 652, 873, 542,1054,1541,2640,2641,2642, # 512, 256
)
pip/_vendor/chardet/jpcntx.py 0000644 00000046273 14751155150 0012302 0 ustar 00 ######################## BEGIN LICENSE BLOCK ########################
# The Original Code is Mozilla Communicator client code.
#
# The Initial Developer of the Original Code is
# Netscape Communications Corporation.
# Portions created by the Initial Developer are Copyright (C) 1998
# the Initial Developer. All Rights Reserved.
#
# Contributor(s):
# Mark Pilgrim - port to Python
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Lesser General Public
# License as published by the Free Software Foundation; either
# version 2.1 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with this library; if not, write to the Free Software
# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
# 02110-1301 USA
######################### END LICENSE BLOCK #########################
# This is hiragana 2-char sequence table, the number in each cell represents its frequency category
jp2CharContext = (
(0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1),
(2,4,0,4,0,3,0,4,0,3,4,4,4,2,4,3,3,4,3,2,3,3,4,2,3,3,3,2,4,1,4,3,3,1,5,4,3,4,3,4,3,5,3,0,3,5,4,2,0,3,1,0,3,3,0,3,3,0,1,1,0,4,3,0,3,3,0,4,0,2,0,3,5,5,5,5,4,0,4,1,0,3,4),
(0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2),
(0,4,0,5,0,5,0,4,0,4,5,4,4,3,5,3,5,1,5,3,4,3,4,4,3,4,3,3,4,3,5,4,4,3,5,5,3,5,5,5,3,5,5,3,4,5,5,3,1,3,2,0,3,4,0,4,2,0,4,2,1,5,3,2,3,5,0,4,0,2,0,5,4,4,5,4,5,0,4,0,0,4,4),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
(0,3,0,4,0,3,0,3,0,4,5,4,3,3,3,3,4,3,5,4,4,3,5,4,4,3,4,3,4,4,4,4,5,3,4,4,3,4,5,5,4,5,5,1,4,5,4,3,0,3,3,1,3,3,0,4,4,0,3,3,1,5,3,3,3,5,0,4,0,3,0,4,4,3,4,3,3,0,4,1,1,3,4),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
(0,4,0,3,0,3,0,4,0,3,4,4,3,2,2,1,2,1,3,1,3,3,3,3,3,4,3,1,3,3,5,3,3,0,4,3,0,5,4,3,3,5,4,4,3,4,4,5,0,1,2,0,1,2,0,2,2,0,1,0,0,5,2,2,1,4,0,3,0,1,0,4,4,3,5,4,3,0,2,1,0,4,3),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
(0,3,0,5,0,4,0,2,1,4,4,2,4,1,4,2,4,2,4,3,3,3,4,3,3,3,3,1,4,2,3,3,3,1,4,4,1,1,1,4,3,3,2,0,2,4,3,2,0,3,3,0,3,1,1,0,0,0,3,3,0,4,2,2,3,4,0,4,0,3,0,4,4,5,3,4,4,0,3,0,0,1,4),
(1,4,0,4,0,4,0,4,0,3,5,4,4,3,4,3,5,4,3,3,4,3,5,4,4,4,4,3,4,2,4,3,3,1,5,4,3,2,4,5,4,5,5,4,4,5,4,4,0,3,2,2,3,3,0,4,3,1,3,2,1,4,3,3,4,5,0,3,0,2,0,4,5,5,4,5,4,0,4,0,0,5,4),
(0,5,0,5,0,4,0,3,0,4,4,3,4,3,3,3,4,0,4,4,4,3,4,3,4,3,3,1,4,2,4,3,4,0,5,4,1,4,5,4,4,5,3,2,4,3,4,3,2,4,1,3,3,3,2,3,2,0,4,3,3,4,3,3,3,4,0,4,0,3,0,4,5,4,4,4,3,0,4,1,0,1,3),
(0,3,1,4,0,3,0,2,0,3,4,4,3,1,4,2,3,3,4,3,4,3,4,3,4,4,3,2,3,1,5,4,4,1,4,4,3,5,4,4,3,5,5,4,3,4,4,3,1,2,3,1,2,2,0,3,2,0,3,1,0,5,3,3,3,4,3,3,3,3,4,4,4,4,5,4,2,0,3,3,2,4,3),
(0,2,0,3,0,1,0,1,0,0,3,2,0,0,2,0,1,0,2,1,3,3,3,1,2,3,1,0,1,0,4,2,1,1,3,3,0,4,3,3,1,4,3,3,0,3,3,2,0,0,0,0,1,0,0,2,0,0,0,0,0,4,1,0,2,3,2,2,2,1,3,3,3,4,4,3,2,0,3,1,0,3,3),
(0,4,0,4,0,3,0,3,0,4,4,4,3,3,3,3,3,3,4,3,4,2,4,3,4,3,3,2,4,3,4,5,4,1,4,5,3,5,4,5,3,5,4,0,3,5,5,3,1,3,3,2,2,3,0,3,4,1,3,3,2,4,3,3,3,4,0,4,0,3,0,4,5,4,4,5,3,0,4,1,0,3,4),
(0,2,0,3,0,3,0,0,0,2,2,2,1,0,1,0,0,0,3,0,3,0,3,0,1,3,1,0,3,1,3,3,3,1,3,3,3,0,1,3,1,3,4,0,0,3,1,1,0,3,2,0,0,0,0,1,3,0,1,0,0,3,3,2,0,3,0,0,0,0,0,3,4,3,4,3,3,0,3,0,0,2,3),
(2,3,0,3,0,2,0,1,0,3,3,4,3,1,3,1,1,1,3,1,4,3,4,3,3,3,0,0,3,1,5,4,3,1,4,3,2,5,5,4,4,4,4,3,3,4,4,4,0,2,1,1,3,2,0,1,2,0,0,1,0,4,1,3,3,3,0,3,0,1,0,4,4,4,5,5,3,0,2,0,0,4,4),
(0,2,0,1,0,3,1,3,0,2,3,3,3,0,3,1,0,0,3,0,3,2,3,1,3,2,1,1,0,0,4,2,1,0,2,3,1,4,3,2,0,4,4,3,1,3,1,3,0,1,0,0,1,0,0,0,1,0,0,0,0,4,1,1,1,2,0,3,0,0,0,3,4,2,4,3,2,0,1,0,0,3,3),
(0,1,0,4,0,5,0,4,0,2,4,4,2,3,3,2,3,3,5,3,3,3,4,3,4,2,3,0,4,3,3,3,4,1,4,3,2,1,5,5,3,4,5,1,3,5,4,2,0,3,3,0,1,3,0,4,2,0,1,3,1,4,3,3,3,3,0,3,0,1,0,3,4,4,4,5,5,0,3,0,1,4,5),
(0,2,0,3,0,3,0,0,0,2,3,1,3,0,4,0,1,1,3,0,3,4,3,2,3,1,0,3,3,2,3,1,3,0,2,3,0,2,1,4,1,2,2,0,0,3,3,0,0,2,0,0,0,1,0,0,0,0,2,2,0,3,2,1,3,3,0,2,0,2,0,0,3,3,1,2,4,0,3,0,2,2,3),
(2,4,0,5,0,4,0,4,0,2,4,4,4,3,4,3,3,3,1,2,4,3,4,3,4,4,5,0,3,3,3,3,2,0,4,3,1,4,3,4,1,4,4,3,3,4,4,3,1,2,3,0,4,2,0,4,1,0,3,3,0,4,3,3,3,4,0,4,0,2,0,3,5,3,4,5,2,0,3,0,0,4,5),
(0,3,0,4,0,1,0,1,0,1,3,2,2,1,3,0,3,0,2,0,2,0,3,0,2,0,0,0,1,0,1,1,0,0,3,1,0,0,0,4,0,3,1,0,2,1,3,0,0,0,0,0,0,3,0,0,0,0,0,0,0,4,2,2,3,1,0,3,0,0,0,1,4,4,4,3,0,0,4,0,0,1,4),
(1,4,1,5,0,3,0,3,0,4,5,4,4,3,5,3,3,4,4,3,4,1,3,3,3,3,2,1,4,1,5,4,3,1,4,4,3,5,4,4,3,5,4,3,3,4,4,4,0,3,3,1,2,3,0,3,1,0,3,3,0,5,4,4,4,4,4,4,3,3,5,4,4,3,3,5,4,0,3,2,0,4,4),
(0,2,0,3,0,1,0,0,0,1,3,3,3,2,4,1,3,0,3,1,3,0,2,2,1,1,0,0,2,0,4,3,1,0,4,3,0,4,4,4,1,4,3,1,1,3,3,1,0,2,0,0,1,3,0,0,0,0,2,0,0,4,3,2,4,3,5,4,3,3,3,4,3,3,4,3,3,0,2,1,0,3,3),
(0,2,0,4,0,3,0,2,0,2,5,5,3,4,4,4,4,1,4,3,3,0,4,3,4,3,1,3,3,2,4,3,0,3,4,3,0,3,4,4,2,4,4,0,4,5,3,3,2,2,1,1,1,2,0,1,5,0,3,3,2,4,3,3,3,4,0,3,0,2,0,4,4,3,5,5,0,0,3,0,2,3,3),
(0,3,0,4,0,3,0,1,0,3,4,3,3,1,3,3,3,0,3,1,3,0,4,3,3,1,1,0,3,0,3,3,0,0,4,4,0,1,5,4,3,3,5,0,3,3,4,3,0,2,0,1,1,1,0,1,3,0,1,2,1,3,3,2,3,3,0,3,0,1,0,1,3,3,4,4,1,0,1,2,2,1,3),
(0,1,0,4,0,4,0,3,0,1,3,3,3,2,3,1,1,0,3,0,3,3,4,3,2,4,2,0,1,0,4,3,2,0,4,3,0,5,3,3,2,4,4,4,3,3,3,4,0,1,3,0,0,1,0,0,1,0,0,0,0,4,2,3,3,3,0,3,0,0,0,4,4,4,5,3,2,0,3,3,0,3,5),
(0,2,0,3,0,0,0,3,0,1,3,0,2,0,0,0,1,0,3,1,1,3,3,0,0,3,0,0,3,0,2,3,1,0,3,1,0,3,3,2,0,4,2,2,0,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,2,1,2,0,1,0,1,0,0,0,1,3,1,2,0,0,0,1,0,0,1,4),
(0,3,0,3,0,5,0,1,0,2,4,3,1,3,3,2,1,1,5,2,1,0,5,1,2,0,0,0,3,3,2,2,3,2,4,3,0,0,3,3,1,3,3,0,2,5,3,4,0,3,3,0,1,2,0,2,2,0,3,2,0,2,2,3,3,3,0,2,0,1,0,3,4,4,2,5,4,0,3,0,0,3,5),
(0,3,0,3,0,3,0,1,0,3,3,3,3,0,3,0,2,0,2,1,1,0,2,0,1,0,0,0,2,1,0,0,1,0,3,2,0,0,3,3,1,2,3,1,0,3,3,0,0,1,0,0,0,0,0,2,0,0,0,0,0,2,3,1,2,3,0,3,0,1,0,3,2,1,0,4,3,0,1,1,0,3,3),
(0,4,0,5,0,3,0,3,0,4,5,5,4,3,5,3,4,3,5,3,3,2,5,3,4,4,4,3,4,3,4,5,5,3,4,4,3,4,4,5,4,4,4,3,4,5,5,4,2,3,4,2,3,4,0,3,3,1,4,3,2,4,3,3,5,5,0,3,0,3,0,5,5,5,5,4,4,0,4,0,1,4,4),
(0,4,0,4,0,3,0,3,0,3,5,4,4,2,3,2,5,1,3,2,5,1,4,2,3,2,3,3,4,3,3,3,3,2,5,4,1,3,3,5,3,4,4,0,4,4,3,1,1,3,1,0,2,3,0,2,3,0,3,0,0,4,3,1,3,4,0,3,0,2,0,4,4,4,3,4,5,0,4,0,0,3,4),
(0,3,0,3,0,3,1,2,0,3,4,4,3,3,3,0,2,2,4,3,3,1,3,3,3,1,1,0,3,1,4,3,2,3,4,4,2,4,4,4,3,4,4,3,2,4,4,3,1,3,3,1,3,3,0,4,1,0,2,2,1,4,3,2,3,3,5,4,3,3,5,4,4,3,3,0,4,0,3,2,2,4,4),
(0,2,0,1,0,0,0,0,0,1,2,1,3,0,0,0,0,0,2,0,1,2,1,0,0,1,0,0,0,0,3,0,0,1,0,1,1,3,1,0,0,0,1,1,0,1,1,0,0,0,0,0,2,0,0,0,0,0,0,0,0,1,1,2,2,0,3,4,0,0,0,1,1,0,0,1,0,0,0,0,0,1,1),
(0,1,0,0,0,1,0,0,0,0,4,0,4,1,4,0,3,0,4,0,3,0,4,0,3,0,3,0,4,1,5,1,4,0,0,3,0,5,0,5,2,0,1,0,0,0,2,1,4,0,1,3,0,0,3,0,0,3,1,1,4,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0),
(1,4,0,5,0,3,0,2,0,3,5,4,4,3,4,3,5,3,4,3,3,0,4,3,3,3,3,3,3,2,4,4,3,1,3,4,4,5,4,4,3,4,4,1,3,5,4,3,3,3,1,2,2,3,3,1,3,1,3,3,3,5,3,3,4,5,0,3,0,3,0,3,4,3,4,4,3,0,3,0,2,4,3),
(0,1,0,4,0,0,0,0,0,1,4,0,4,1,4,2,4,0,3,0,1,0,1,0,0,0,0,0,2,0,3,1,1,1,0,3,0,0,0,1,2,1,0,0,1,1,1,1,0,1,0,0,0,1,0,0,3,0,0,0,0,3,2,0,2,2,0,1,0,0,0,2,3,2,3,3,0,0,0,0,2,1,0),
(0,5,1,5,0,3,0,3,0,5,4,4,5,1,5,3,3,0,4,3,4,3,5,3,4,3,3,2,4,3,4,3,3,0,3,3,1,4,4,3,4,4,4,3,4,5,5,3,2,3,1,1,3,3,1,3,1,1,3,3,2,4,5,3,3,5,0,4,0,3,0,4,4,3,5,3,3,0,3,4,0,4,3),
(0,5,0,5,0,3,0,2,0,4,4,3,5,2,4,3,3,3,4,4,4,3,5,3,5,3,3,1,4,0,4,3,3,0,3,3,0,4,4,4,4,5,4,3,3,5,5,3,2,3,1,2,3,2,0,1,0,0,3,2,2,4,4,3,1,5,0,4,0,3,0,4,3,1,3,2,1,0,3,3,0,3,3),
(0,4,0,5,0,5,0,4,0,4,5,5,5,3,4,3,3,2,5,4,4,3,5,3,5,3,4,0,4,3,4,4,3,2,4,4,3,4,5,4,4,5,5,0,3,5,5,4,1,3,3,2,3,3,1,3,1,0,4,3,1,4,4,3,4,5,0,4,0,2,0,4,3,4,4,3,3,0,4,0,0,5,5),
(0,4,0,4,0,5,0,1,1,3,3,4,4,3,4,1,3,0,5,1,3,0,3,1,3,1,1,0,3,0,3,3,4,0,4,3,0,4,4,4,3,4,4,0,3,5,4,1,0,3,0,0,2,3,0,3,1,0,3,1,0,3,2,1,3,5,0,3,0,1,0,3,2,3,3,4,4,0,2,2,0,4,4),
(2,4,0,5,0,4,0,3,0,4,5,5,4,3,5,3,5,3,5,3,5,2,5,3,4,3,3,4,3,4,5,3,2,1,5,4,3,2,3,4,5,3,4,1,2,5,4,3,0,3,3,0,3,2,0,2,3,0,4,1,0,3,4,3,3,5,0,3,0,1,0,4,5,5,5,4,3,0,4,2,0,3,5),
(0,5,0,4,0,4,0,2,0,5,4,3,4,3,4,3,3,3,4,3,4,2,5,3,5,3,4,1,4,3,4,4,4,0,3,5,0,4,4,4,4,5,3,1,3,4,5,3,3,3,3,3,3,3,0,2,2,0,3,3,2,4,3,3,3,5,3,4,1,3,3,5,3,2,0,0,0,0,4,3,1,3,3),
(0,1,0,3,0,3,0,1,0,1,3,3,3,2,3,3,3,0,3,0,0,0,3,1,3,0,0,0,2,2,2,3,0,0,3,2,0,1,2,4,1,3,3,0,0,3,3,3,0,1,0,0,2,1,0,0,3,0,3,1,0,3,0,0,1,3,0,2,0,1,0,3,3,1,3,3,0,0,1,1,0,3,3),
(0,2,0,3,0,2,1,4,0,2,2,3,1,1,3,1,1,0,2,0,3,1,2,3,1,3,0,0,1,0,4,3,2,3,3,3,1,4,2,3,3,3,3,1,0,3,1,4,0,1,1,0,1,2,0,1,1,0,1,1,0,3,1,3,2,2,0,1,0,0,0,2,3,3,3,1,0,0,0,0,0,2,3),
(0,5,0,4,0,5,0,2,0,4,5,5,3,3,4,3,3,1,5,4,4,2,4,4,4,3,4,2,4,3,5,5,4,3,3,4,3,3,5,5,4,5,5,1,3,4,5,3,1,4,3,1,3,3,0,3,3,1,4,3,1,4,5,3,3,5,0,4,0,3,0,5,3,3,1,4,3,0,4,0,1,5,3),
(0,5,0,5,0,4,0,2,0,4,4,3,4,3,3,3,3,3,5,4,4,4,4,4,4,5,3,3,5,2,4,4,4,3,4,4,3,3,4,4,5,5,3,3,4,3,4,3,3,4,3,3,3,3,1,2,2,1,4,3,3,5,4,4,3,4,0,4,0,3,0,4,4,4,4,4,1,0,4,2,0,2,4),
(0,4,0,4,0,3,0,1,0,3,5,2,3,0,3,0,2,1,4,2,3,3,4,1,4,3,3,2,4,1,3,3,3,0,3,3,0,0,3,3,3,5,3,3,3,3,3,2,0,2,0,0,2,0,0,2,0,0,1,0,0,3,1,2,2,3,0,3,0,2,0,4,4,3,3,4,1,0,3,0,0,2,4),
(0,0,0,4,0,0,0,0,0,0,1,0,1,0,2,0,0,0,0,0,1,0,2,0,1,0,0,0,0,0,3,1,3,0,3,2,0,0,0,1,0,3,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,0,2,0,0,0,0,0,0,2),
(0,2,1,3,0,2,0,2,0,3,3,3,3,1,3,1,3,3,3,3,3,3,4,2,2,1,2,1,4,0,4,3,1,3,3,3,2,4,3,5,4,3,3,3,3,3,3,3,0,1,3,0,2,0,0,1,0,0,1,0,0,4,2,0,2,3,0,3,3,0,3,3,4,2,3,1,4,0,1,2,0,2,3),
(0,3,0,3,0,1,0,3,0,2,3,3,3,0,3,1,2,0,3,3,2,3,3,2,3,2,3,1,3,0,4,3,2,0,3,3,1,4,3,3,2,3,4,3,1,3,3,1,1,0,1,1,0,1,0,1,0,1,0,0,0,4,1,1,0,3,0,3,1,0,2,3,3,3,3,3,1,0,0,2,0,3,3),
(0,0,0,0,0,0,0,0,0,0,3,0,2,0,3,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,3,0,3,0,3,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,2,3,0,0,0,0,0,0,0,0,3),
(0,2,0,3,1,3,0,3,0,2,3,3,3,1,3,1,3,1,3,1,3,3,3,1,3,0,2,3,1,1,4,3,3,2,3,3,1,2,2,4,1,3,3,0,1,4,2,3,0,1,3,0,3,0,0,1,3,0,2,0,0,3,3,2,1,3,0,3,0,2,0,3,4,4,4,3,1,0,3,0,0,3,3),
(0,2,0,1,0,2,0,0,0,1,3,2,2,1,3,0,1,1,3,0,3,2,3,1,2,0,2,0,1,1,3,3,3,0,3,3,1,1,2,3,2,3,3,1,2,3,2,0,0,1,0,0,0,0,0,0,3,0,1,0,0,2,1,2,1,3,0,3,0,0,0,3,4,4,4,3,2,0,2,0,0,2,4),
(0,0,0,1,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,2,2,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,3,1,0,0,0,0,0,0,0,3),
(0,3,0,3,0,2,0,3,0,3,3,3,2,3,2,2,2,0,3,1,3,3,3,2,3,3,0,0,3,0,3,2,2,0,2,3,1,4,3,4,3,3,2,3,1,5,4,4,0,3,1,2,1,3,0,3,1,1,2,0,2,3,1,3,1,3,0,3,0,1,0,3,3,4,4,2,1,0,2,1,0,2,4),
(0,1,0,3,0,1,0,2,0,1,4,2,5,1,4,0,2,0,2,1,3,1,4,0,2,1,0,0,2,1,4,1,1,0,3,3,0,5,1,3,2,3,3,1,0,3,2,3,0,1,0,0,0,0,0,0,1,0,0,0,0,4,0,1,0,3,0,2,0,1,0,3,3,3,4,3,3,0,0,0,0,2,3),
(0,0,0,1,0,0,0,0,0,0,2,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,0,0,1,0,0,0,0,0,3),
(0,1,0,3,0,4,0,3,0,2,4,3,1,0,3,2,2,1,3,1,2,2,3,1,1,1,2,1,3,0,1,2,0,1,3,2,1,3,0,5,5,1,0,0,1,3,2,1,0,3,0,0,1,0,0,0,0,0,3,4,0,1,1,1,3,2,0,2,0,1,0,2,3,3,1,2,3,0,1,0,1,0,4),
(0,0,0,1,0,3,0,3,0,2,2,1,0,0,4,0,3,0,3,1,3,0,3,0,3,0,1,0,3,0,3,1,3,0,3,3,0,0,1,2,1,1,1,0,1,2,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,2,2,1,2,0,0,2,0,0,0,0,2,3,3,3,3,0,0,0,0,1,4),
(0,0,0,3,0,3,0,0,0,0,3,1,1,0,3,0,1,0,2,0,1,0,0,0,0,0,0,0,1,0,3,0,2,0,2,3,0,0,2,2,3,1,2,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,2,3),
(2,4,0,5,0,5,0,4,0,3,4,3,3,3,4,3,3,3,4,3,4,4,5,4,5,5,5,2,3,0,5,5,4,1,5,4,3,1,5,4,3,4,4,3,3,4,3,3,0,3,2,0,2,3,0,3,0,0,3,3,0,5,3,2,3,3,0,3,0,3,0,3,4,5,4,5,3,0,4,3,0,3,4),
(0,3,0,3,0,3,0,3,0,3,3,4,3,2,3,2,3,0,4,3,3,3,3,3,3,3,3,0,3,2,4,3,3,1,3,4,3,4,4,4,3,4,4,3,2,4,4,1,0,2,0,0,1,1,0,2,0,0,3,1,0,5,3,2,1,3,0,3,0,1,2,4,3,2,4,3,3,0,3,2,0,4,4),
(0,3,0,3,0,1,0,0,0,1,4,3,3,2,3,1,3,1,4,2,3,2,4,2,3,4,3,0,2,2,3,3,3,0,3,3,3,0,3,4,1,3,3,0,3,4,3,3,0,1,1,0,1,0,0,0,4,0,3,0,0,3,1,2,1,3,0,4,0,1,0,4,3,3,4,3,3,0,2,0,0,3,3),
(0,3,0,4,0,1,0,3,0,3,4,3,3,0,3,3,3,1,3,1,3,3,4,3,3,3,0,0,3,1,5,3,3,1,3,3,2,5,4,3,3,4,5,3,2,5,3,4,0,1,0,0,0,0,0,2,0,0,1,1,0,4,2,2,1,3,0,3,0,2,0,4,4,3,5,3,2,0,1,1,0,3,4),
(0,5,0,4,0,5,0,2,0,4,4,3,3,2,3,3,3,1,4,3,4,1,5,3,4,3,4,0,4,2,4,3,4,1,5,4,0,4,4,4,4,5,4,1,3,5,4,2,1,4,1,1,3,2,0,3,1,0,3,2,1,4,3,3,3,4,0,4,0,3,0,4,4,4,3,3,3,0,4,2,0,3,4),
(1,4,0,4,0,3,0,1,0,3,3,3,1,1,3,3,2,2,3,3,1,0,3,2,2,1,2,0,3,1,2,1,2,0,3,2,0,2,2,3,3,4,3,0,3,3,1,2,0,1,1,3,1,2,0,0,3,0,1,1,0,3,2,2,3,3,0,3,0,0,0,2,3,3,4,3,3,0,1,0,0,1,4),
(0,4,0,4,0,4,0,0,0,3,4,4,3,1,4,2,3,2,3,3,3,1,4,3,4,0,3,0,4,2,3,3,2,2,5,4,2,1,3,4,3,4,3,1,3,3,4,2,0,2,1,0,3,3,0,0,2,0,3,1,0,4,4,3,4,3,0,4,0,1,0,2,4,4,4,4,4,0,3,2,0,3,3),
(0,0,0,1,0,4,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,3,2,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,2),
(0,2,0,3,0,4,0,4,0,1,3,3,3,0,4,0,2,1,2,1,1,1,2,0,3,1,1,0,1,0,3,1,0,0,3,3,2,0,1,1,0,0,0,0,0,1,0,2,0,2,2,0,3,1,0,0,1,0,1,1,0,1,2,0,3,0,0,0,0,1,0,0,3,3,4,3,1,0,1,0,3,0,2),
(0,0,0,3,0,5,0,0,0,0,1,0,2,0,3,1,0,1,3,0,0,0,2,0,0,0,1,0,0,0,1,1,0,0,4,0,0,0,2,3,0,1,4,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,1,0,0,0,0,0,0,0,2,0,0,3,0,0,0,0,0,3),
(0,2,0,5,0,5,0,1,0,2,4,3,3,2,5,1,3,2,3,3,3,0,4,1,2,0,3,0,4,0,2,2,1,1,5,3,0,0,1,4,2,3,2,0,3,3,3,2,0,2,4,1,1,2,0,1,1,0,3,1,0,1,3,1,2,3,0,2,0,0,0,1,3,5,4,4,4,0,3,0,0,1,3),
(0,4,0,5,0,4,0,4,0,4,5,4,3,3,4,3,3,3,4,3,4,4,5,3,4,5,4,2,4,2,3,4,3,1,4,4,1,3,5,4,4,5,5,4,4,5,5,5,2,3,3,1,4,3,1,3,3,0,3,3,1,4,3,4,4,4,0,3,0,4,0,3,3,4,4,5,0,0,4,3,0,4,5),
(0,4,0,4,0,3,0,3,0,3,4,4,4,3,3,2,4,3,4,3,4,3,5,3,4,3,2,1,4,2,4,4,3,1,3,4,2,4,5,5,3,4,5,4,1,5,4,3,0,3,2,2,3,2,1,3,1,0,3,3,3,5,3,3,3,5,4,4,2,3,3,4,3,3,3,2,1,0,3,2,1,4,3),
(0,4,0,5,0,4,0,3,0,3,5,5,3,2,4,3,4,0,5,4,4,1,4,4,4,3,3,3,4,3,5,5,2,3,3,4,1,2,5,5,3,5,5,2,3,5,5,4,0,3,2,0,3,3,1,1,5,1,4,1,0,4,3,2,3,5,0,4,0,3,0,5,4,3,4,3,0,0,4,1,0,4,4),
(1,3,0,4,0,2,0,2,0,2,5,5,3,3,3,3,3,0,4,2,3,4,4,4,3,4,0,0,3,4,5,4,3,3,3,3,2,5,5,4,5,5,5,4,3,5,5,5,1,3,1,0,1,0,0,3,2,0,4,2,0,5,2,3,2,4,1,3,0,3,0,4,5,4,5,4,3,0,4,2,0,5,4),
(0,3,0,4,0,5,0,3,0,3,4,4,3,2,3,2,3,3,3,3,3,2,4,3,3,2,2,0,3,3,3,3,3,1,3,3,3,0,4,4,3,4,4,1,1,4,4,2,0,3,1,0,1,1,0,4,1,0,2,3,1,3,3,1,3,4,0,3,0,1,0,3,1,3,0,0,1,0,2,0,0,4,4),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
(0,3,0,3,0,2,0,3,0,1,5,4,3,3,3,1,4,2,1,2,3,4,4,2,4,4,5,0,3,1,4,3,4,0,4,3,3,3,2,3,2,5,3,4,3,2,2,3,0,0,3,0,2,1,0,1,2,0,0,0,0,2,1,1,3,1,0,2,0,4,0,3,4,4,4,5,2,0,2,0,0,1,3),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,0,0,1,1,0,0,0,4,2,1,1,0,1,0,3,2,0,0,3,1,1,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,1,0,0,0,2,0,0,0,1,4,0,4,2,1,0,0,0,0,0,1),
(0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,3,1,0,0,0,2,0,2,1,0,0,1,2,1,0,1,1,0,0,3,0,0,0,0,0,0,0,0,0,0,0,1,3,1,0,0,0,0,0,1,0,0,2,1,0,0,0,0,0,0,0,0,2),
(0,4,0,4,0,4,0,3,0,4,4,3,4,2,4,3,2,0,4,4,4,3,5,3,5,3,3,2,4,2,4,3,4,3,1,4,0,2,3,4,4,4,3,3,3,4,4,4,3,4,1,3,4,3,2,1,2,1,3,3,3,4,4,3,3,5,0,4,0,3,0,4,3,3,3,2,1,0,3,0,0,3,3),
(0,4,0,3,0,3,0,3,0,3,5,5,3,3,3,3,4,3,4,3,3,3,4,4,4,3,3,3,3,4,3,5,3,3,1,3,2,4,5,5,5,5,4,3,4,5,5,3,2,2,3,3,3,3,2,3,3,1,2,3,2,4,3,3,3,4,0,4,0,2,0,4,3,2,2,1,2,0,3,0,0,4,1),
)
class JapaneseContextAnalysis(object):
NUM_OF_CATEGORY = 6
DONT_KNOW = -1
ENOUGH_REL_THRESHOLD = 100
MAX_REL_THRESHOLD = 1000
MINIMUM_DATA_THRESHOLD = 4
def __init__(self):
self._total_rel = None
self._rel_sample = None
self._need_to_skip_char_num = None
self._last_char_order = None
self._done = None
self.reset()
def reset(self):
self._total_rel = 0 # total sequence received
# category counters, each integer counts sequence in its category
self._rel_sample = [0] * self.NUM_OF_CATEGORY
# if last byte in current buffer is not the last byte of a character,
# we need to know how many bytes to skip in next buffer
self._need_to_skip_char_num = 0
self._last_char_order = -1 # The order of previous char
# If this flag is set to True, detection is done and conclusion has
# been made
self._done = False
def feed(self, byte_str, num_bytes):
if self._done:
return
# The buffer we got is byte oriented, and a character may span in more than one
# buffers. In case the last one or two byte in last buffer is not
# complete, we record how many byte needed to complete that character
# and skip these bytes here. We can choose to record those bytes as
# well and analyse the character once it is complete, but since a
# character will not make much difference, by simply skipping
# this character will simply our logic and improve performance.
i = self._need_to_skip_char_num
while i < num_bytes:
order, char_len = self.get_order(byte_str[i:i + 2])
i += char_len
if i > num_bytes:
self._need_to_skip_char_num = i - num_bytes
self._last_char_order = -1
else:
if (order != -1) and (self._last_char_order != -1):
self._total_rel += 1
if self._total_rel > self.MAX_REL_THRESHOLD:
self._done = True
break
self._rel_sample[jp2CharContext[self._last_char_order][order]] += 1
self._last_char_order = order
def got_enough_data(self):
return self._total_rel > self.ENOUGH_REL_THRESHOLD
def get_confidence(self):
# This is just one way to calculate confidence. It works well for me.
if self._total_rel > self.MINIMUM_DATA_THRESHOLD:
return (self._total_rel - self._rel_sample[0]) / self._total_rel
else:
return self.DONT_KNOW
def get_order(self, byte_str):
return -1, 1
class SJISContextAnalysis(JapaneseContextAnalysis):
def __init__(self):
super(SJISContextAnalysis, self).__init__()
self._charset_name = "SHIFT_JIS"
@property
def charset_name(self):
return self._charset_name
def get_order(self, byte_str):
if not byte_str:
return -1, 1
# find out current char's byte length
first_char = byte_str[0]
if (0x81 <= first_char <= 0x9F) or (0xE0 <= first_char <= 0xFC):
char_len = 2
if (first_char == 0x87) or (0xFA <= first_char <= 0xFC):
self._charset_name = "CP932"
else:
char_len = 1
# return its order if it is hiragana
if len(byte_str) > 1:
second_char = byte_str[1]
if (first_char == 202) and (0x9F <= second_char <= 0xF1):
return second_char - 0x9F, char_len
return -1, char_len
class EUCJPContextAnalysis(JapaneseContextAnalysis):
def get_order(self, byte_str):
if not byte_str:
return -1, 1
# find out current char's byte length
first_char = byte_str[0]
if (first_char == 0x8E) or (0xA1 <= first_char <= 0xFE):
char_len = 2
elif first_char == 0x8F:
char_len = 3
else:
char_len = 1
# return its order if it is hiragana
if len(byte_str) > 1:
second_char = byte_str[1]
if (first_char == 0xA4) and (0xA1 <= second_char <= 0xF3):
return second_char - 0xA1, char_len
return -1, char_len
pip/_vendor/appdirs.py 0000644 00000053540 14751155150 0011017 0 ustar 00 #!/usr/bin/env python
# -*- coding: utf-8 -*-
# Copyright (c) 2005-2010 ActiveState Software Inc.
# Copyright (c) 2013 Eddy Petrișor
"""Utilities for determining application-specific dirs.
See <http://github.com/ActiveState/appdirs> for details and usage.
"""
# Dev Notes:
# - MSDN on where to store app data files:
# http://support.microsoft.com/default.aspx?scid=kb;en-us;310294#XSLTH3194121123120121120120
# - macOS: http://developer.apple.com/documentation/MacOSX/Conceptual/BPFileSystem/index.html
# - XDG spec for Un*x: http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html
__version_info__ = (1, 4, 0)
__version__ = '.'.join(map(str, __version_info__))
import sys
import os
PY3 = sys.version_info[0] == 3
if PY3:
unicode = str
if sys.platform.startswith('java'):
import platform
os_name = platform.java_ver()[3][0]
if os_name.startswith('Windows'): # "Windows XP", "Windows 7", etc.
system = 'win32'
elif os_name.startswith('Mac'): # "macOS", etc.
system = 'darwin'
else: # "Linux", "SunOS", "FreeBSD", etc.
# Setting this to "linux2" is not ideal, but only Windows or Mac
# are actually checked for and the rest of the module expects
# *sys.platform* style strings.
system = 'linux2'
else:
system = sys.platform
def user_data_dir(appname=None, appauthor=None, version=None, roaming=False):
r"""Return full path to the user-specific data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
macOS: ~/Library/Application Support/<AppName>
Unix: ~/.local/share/<AppName> # or in $XDG_DATA_HOME, if defined
Win XP (not roaming): C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
Win XP (roaming): C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
Win 7 (not roaming): C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
Win 7 (roaming): C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
That means, by default "~/.local/share/<AppName>".
"""
if system == "win32":
if appauthor is None:
appauthor = appname
const = roaming and "CSIDL_APPDATA" or "CSIDL_LOCAL_APPDATA"
path = os.path.normpath(_get_win_folder(const))
if appname:
if appauthor is not False:
path = os.path.join(path, appauthor, appname)
else:
path = os.path.join(path, appname)
elif system == 'darwin':
path = os.path.expanduser('~/Library/Application Support/')
if appname:
path = os.path.join(path, appname)
else:
path = os.getenv('XDG_DATA_HOME', os.path.expanduser("~/.local/share"))
if appname:
path = os.path.join(path, appname)
if appname and version:
path = os.path.join(path, version)
return path
def site_data_dir(appname=None, appauthor=None, version=None, multipath=False):
"""Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of data dirs should be
returned. By default, the first item from XDG_DATA_DIRS is
returned, or '/usr/local/share/<AppName>',
if XDG_DATA_DIRS is not set
Typical user data directories are:
macOS: /Library/Application Support/<AppName>
Unix: /usr/local/share/<AppName> or /usr/share/<AppName>
Win XP: C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
Win 7: C:\ProgramData\<AppAuthor>\<AppName> # Hidden, but writeable on Win 7.
For Unix, this is using the $XDG_DATA_DIRS[0] default.
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
"""
if system == "win32":
if appauthor is None:
appauthor = appname
path = os.path.normpath(_get_win_folder("CSIDL_COMMON_APPDATA"))
if appname:
if appauthor is not False:
path = os.path.join(path, appauthor, appname)
else:
path = os.path.join(path, appname)
elif system == 'darwin':
path = os.path.expanduser('/Library/Application Support')
if appname:
path = os.path.join(path, appname)
else:
# XDG default for $XDG_DATA_DIRS
# only first, if multipath is False
path = os.getenv('XDG_DATA_DIRS',
os.pathsep.join(['/usr/local/share', '/usr/share']))
pathlist = [os.path.expanduser(x.rstrip(os.sep)) for x in path.split(os.pathsep)]
if appname:
if version:
appname = os.path.join(appname, version)
pathlist = [os.sep.join([x, appname]) for x in pathlist]
if multipath:
path = os.pathsep.join(pathlist)
else:
path = pathlist[0]
return path
if appname and version:
path = os.path.join(path, version)
return path
def user_config_dir(appname=None, appauthor=None, version=None, roaming=False):
r"""Return full path to the user-specific config dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
macOS: same as user_data_dir
Unix: ~/.config/<AppName> # or in $XDG_CONFIG_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
That means, by deafult "~/.config/<AppName>".
"""
if system in ["win32", "darwin"]:
path = user_data_dir(appname, appauthor, None, roaming)
else:
path = os.getenv('XDG_CONFIG_HOME', os.path.expanduser("~/.config"))
if appname:
path = os.path.join(path, appname)
if appname and version:
path = os.path.join(path, version)
return path
def site_config_dir(appname=None, appauthor=None, version=None, multipath=False):
"""Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of config dirs should be
returned. By default, the first item from XDG_CONFIG_DIRS is
returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
Typical user data directories are:
macOS: same as site_data_dir
Unix: /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
$XDG_CONFIG_DIRS
Win *: same as site_data_dir
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
"""
if system in ["win32", "darwin"]:
path = site_data_dir(appname, appauthor)
if appname and version:
path = os.path.join(path, version)
else:
# XDG default for $XDG_CONFIG_DIRS
# only first, if multipath is False
path = os.getenv('XDG_CONFIG_DIRS', '/etc/xdg')
pathlist = [os.path.expanduser(x.rstrip(os.sep)) for x in path.split(os.pathsep)]
if appname:
if version:
appname = os.path.join(appname, version)
pathlist = [os.sep.join([x, appname]) for x in pathlist]
if multipath:
path = os.pathsep.join(pathlist)
else:
path = pathlist[0]
return path
def user_cache_dir(appname=None, appauthor=None, version=None, opinion=True):
r"""Return full path to the user-specific cache dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Cache" to the base app data dir for Windows. See
discussion below.
Typical user cache directories are:
macOS: ~/Library/Caches/<AppName>
Unix: ~/.cache/<AppName> (XDG default)
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
On Windows the only suggestion in the MSDN docs is that local settings go in
the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
app data dir (the default returned by `user_data_dir` above). Apps typically
put cache data somewhere *under* the given dir here. Some examples:
...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
...\Acme\SuperApp\Cache\1.0
OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
This can be disabled with the `opinion=False` option.
"""
if system == "win32":
if appauthor is None:
appauthor = appname
path = os.path.normpath(_get_win_folder("CSIDL_LOCAL_APPDATA"))
if appname:
if appauthor is not False:
path = os.path.join(path, appauthor, appname)
else:
path = os.path.join(path, appname)
if opinion:
path = os.path.join(path, "Cache")
elif system == 'darwin':
path = os.path.expanduser('~/Library/Caches')
if appname:
path = os.path.join(path, appname)
else:
path = os.getenv('XDG_CACHE_HOME', os.path.expanduser('~/.cache'))
if appname:
path = os.path.join(path, appname)
if appname and version:
path = os.path.join(path, version)
return path
def user_log_dir(appname=None, appauthor=None, version=None, opinion=True):
r"""Return full path to the user-specific log dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Logs" to the base app data dir for Windows, and "log" to the
base cache dir for Unix. See discussion below.
Typical user cache directories are:
macOS: ~/Library/Logs/<AppName>
Unix: ~/.cache/<AppName>/log # or under $XDG_CACHE_HOME if defined
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
On Windows the only suggestion in the MSDN docs is that local settings
go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
examples of what some windows apps use for a logs dir.)
OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
value for Windows and appends "log" to the user cache dir for Unix.
This can be disabled with the `opinion=False` option.
"""
if system == "darwin":
path = os.path.join(
os.path.expanduser('~/Library/Logs'),
appname)
elif system == "win32":
path = user_data_dir(appname, appauthor, version)
version = False
if opinion:
path = os.path.join(path, "Logs")
else:
path = user_cache_dir(appname, appauthor, version)
version = False
if opinion:
path = os.path.join(path, "log")
if appname and version:
path = os.path.join(path, version)
return path
class AppDirs(object):
"""Convenience wrapper for getting application dirs."""
def __init__(self, appname, appauthor=None, version=None, roaming=False,
multipath=False):
self.appname = appname
self.appauthor = appauthor
self.version = version
self.roaming = roaming
self.multipath = multipath
@property
def user_data_dir(self):
return user_data_dir(self.appname, self.appauthor,
version=self.version, roaming=self.roaming)
@property
def site_data_dir(self):
return site_data_dir(self.appname, self.appauthor,
version=self.version, multipath=self.multipath)
@property
def user_config_dir(self):
return user_config_dir(self.appname, self.appauthor,
version=self.version, roaming=self.roaming)
@property
def site_config_dir(self):
return site_config_dir(self.appname, self.appauthor,
version=self.version, multipath=self.multipath)
@property
def user_cache_dir(self):
return user_cache_dir(self.appname, self.appauthor,
version=self.version)
@property
def user_log_dir(self):
return user_log_dir(self.appname, self.appauthor,
version=self.version)
#---- internal support stuff
def _get_win_folder_from_registry(csidl_name):
"""This is a fallback technique at best. I'm not sure if using the
registry for this guarantees us the correct answer for all CSIDL_*
names.
"""
import _winreg
shell_folder_name = {
"CSIDL_APPDATA": "AppData",
"CSIDL_COMMON_APPDATA": "Common AppData",
"CSIDL_LOCAL_APPDATA": "Local AppData",
}[csidl_name]
key = _winreg.OpenKey(
_winreg.HKEY_CURRENT_USER,
r"Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders"
)
dir, type = _winreg.QueryValueEx(key, shell_folder_name)
return dir
def _get_win_folder_with_pywin32(csidl_name):
from win32com.shell import shellcon, shell
dir = shell.SHGetFolderPath(0, getattr(shellcon, csidl_name), 0, 0)
# Try to make this a unicode path because SHGetFolderPath does
# not return unicode strings when there is unicode data in the
# path.
try:
dir = unicode(dir)
# Downgrade to short path name if have highbit chars. See
# <http://bugs.activestate.com/show_bug.cgi?id=85099>.
has_high_char = False
for c in dir:
if ord(c) > 255:
has_high_char = True
break
if has_high_char:
try:
import win32api
dir = win32api.GetShortPathName(dir)
except ImportError:
pass
except UnicodeError:
pass
return dir
def _get_win_folder_with_ctypes(csidl_name):
import ctypes
csidl_const = {
"CSIDL_APPDATA": 26,
"CSIDL_COMMON_APPDATA": 35,
"CSIDL_LOCAL_APPDATA": 28,
}[csidl_name]
buf = ctypes.create_unicode_buffer(1024)
ctypes.windll.shell32.SHGetFolderPathW(None, csidl_const, None, 0, buf)
# Downgrade to short path name if have highbit chars. See
# <http://bugs.activestate.com/show_bug.cgi?id=85099>.
has_high_char = False
for c in buf:
if ord(c) > 255:
has_high_char = True
break
if has_high_char:
buf2 = ctypes.create_unicode_buffer(1024)
if ctypes.windll.kernel32.GetShortPathNameW(buf.value, buf2, 1024):
buf = buf2
return buf.value
def _get_win_folder_with_jna(csidl_name):
import array
from com.sun import jna
from com.sun.jna.platform import win32
buf_size = win32.WinDef.MAX_PATH * 2
buf = array.zeros('c', buf_size)
shell = win32.Shell32.INSTANCE
shell.SHGetFolderPath(None, getattr(win32.ShlObj, csidl_name), None, win32.ShlObj.SHGFP_TYPE_CURRENT, buf)
dir = jna.Native.toString(buf.tostring()).rstrip("\0")
# Downgrade to short path name if have highbit chars. See
# <http://bugs.activestate.com/show_bug.cgi?id=85099>.
has_high_char = False
for c in dir:
if ord(c) > 255:
has_high_char = True
break
if has_high_char:
buf = array.zeros('c', buf_size)
kernel = win32.Kernel32.INSTANCE
if kernal.GetShortPathName(dir, buf, buf_size):
dir = jna.Native.toString(buf.tostring()).rstrip("\0")
return dir
if system == "win32":
try:
import win32com.shell
_get_win_folder = _get_win_folder_with_pywin32
except ImportError:
try:
from ctypes import windll
_get_win_folder = _get_win_folder_with_ctypes
except ImportError:
try:
import com.sun.jna
_get_win_folder = _get_win_folder_with_jna
except ImportError:
_get_win_folder = _get_win_folder_from_registry
#---- self test code
if __name__ == "__main__":
appname = "MyApp"
appauthor = "MyCompany"
props = ("user_data_dir", "site_data_dir",
"user_config_dir", "site_config_dir",
"user_cache_dir", "user_log_dir")
print("-- app dirs (with optional 'version')")
dirs = AppDirs(appname, appauthor, version="1.0")
for prop in props:
print("%s: %s" % (prop, getattr(dirs, prop)))
print("\n-- app dirs (without optional 'version')")
dirs = AppDirs(appname, appauthor)
for prop in props:
print("%s: %s" % (prop, getattr(dirs, prop)))
print("\n-- app dirs (without optional 'appauthor')")
dirs = AppDirs(appname)
for prop in props:
print("%s: %s" % (prop, getattr(dirs, prop)))
print("\n-- app dirs (with disabled 'appauthor')")
dirs = AppDirs(appname, appauthor=False)
for prop in props:
print("%s: %s" % (prop, getattr(dirs, prop)))
pip/_vendor/packaging/__init__.py 0000644 00000001001 14751155150 0013021 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
from .__about__ import (
__author__, __copyright__, __email__, __license__, __summary__, __title__,
__uri__, __version__
)
__all__ = [
"__title__", "__summary__", "__uri__", "__version__", "__author__",
"__email__", "__license__", "__copyright__",
]
pip/_vendor/packaging/version.py 0000644 00000026444 14751155150 0012771 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
import collections
import itertools
import re
from ._structures import Infinity
__all__ = [
"parse", "Version", "LegacyVersion", "InvalidVersion", "VERSION_PATTERN"
]
_Version = collections.namedtuple(
"_Version",
["epoch", "release", "dev", "pre", "post", "local"],
)
def parse(version):
"""
Parse the given version string and return either a :class:`Version` object
or a :class:`LegacyVersion` object depending on if the given version is
a valid PEP 440 version or a legacy version.
"""
try:
return Version(version)
except InvalidVersion:
return LegacyVersion(version)
class InvalidVersion(ValueError):
"""
An invalid version was found, users should refer to PEP 440.
"""
class _BaseVersion(object):
def __hash__(self):
return hash(self._key)
def __lt__(self, other):
return self._compare(other, lambda s, o: s < o)
def __le__(self, other):
return self._compare(other, lambda s, o: s <= o)
def __eq__(self, other):
return self._compare(other, lambda s, o: s == o)
def __ge__(self, other):
return self._compare(other, lambda s, o: s >= o)
def __gt__(self, other):
return self._compare(other, lambda s, o: s > o)
def __ne__(self, other):
return self._compare(other, lambda s, o: s != o)
def _compare(self, other, method):
if not isinstance(other, _BaseVersion):
return NotImplemented
return method(self._key, other._key)
class LegacyVersion(_BaseVersion):
def __init__(self, version):
self._version = str(version)
self._key = _legacy_cmpkey(self._version)
def __str__(self):
return self._version
def __repr__(self):
return "<LegacyVersion({0})>".format(repr(str(self)))
@property
def public(self):
return self._version
@property
def base_version(self):
return self._version
@property
def local(self):
return None
@property
def is_prerelease(self):
return False
@property
def is_postrelease(self):
return False
_legacy_version_component_re = re.compile(
r"(\d+ | [a-z]+ | \.| -)", re.VERBOSE,
)
_legacy_version_replacement_map = {
"pre": "c", "preview": "c", "-": "final-", "rc": "c", "dev": "@",
}
def _parse_version_parts(s):
for part in _legacy_version_component_re.split(s):
part = _legacy_version_replacement_map.get(part, part)
if not part or part == ".":
continue
if part[:1] in "0123456789":
# pad for numeric comparison
yield part.zfill(8)
else:
yield "*" + part
# ensure that alpha/beta/candidate are before final
yield "*final"
def _legacy_cmpkey(version):
# We hardcode an epoch of -1 here. A PEP 440 version can only have a epoch
# greater than or equal to 0. This will effectively put the LegacyVersion,
# which uses the defacto standard originally implemented by setuptools,
# as before all PEP 440 versions.
epoch = -1
# This scheme is taken from pkg_resources.parse_version setuptools prior to
# it's adoption of the packaging library.
parts = []
for part in _parse_version_parts(version.lower()):
if part.startswith("*"):
# remove "-" before a prerelease tag
if part < "*final":
while parts and parts[-1] == "*final-":
parts.pop()
# remove trailing zeros from each series of numeric parts
while parts and parts[-1] == "00000000":
parts.pop()
parts.append(part)
parts = tuple(parts)
return epoch, parts
# Deliberately not anchored to the start and end of the string, to make it
# easier for 3rd party code to reuse
VERSION_PATTERN = r"""
v?
(?:
(?:(?P<epoch>[0-9]+)!)? # epoch
(?P<release>[0-9]+(?:\.[0-9]+)*) # release segment
(?P<pre> # pre-release
[-_\.]?
(?P<pre_l>(a|b|c|rc|alpha|beta|pre|preview))
[-_\.]?
(?P<pre_n>[0-9]+)?
)?
(?P<post> # post release
(?:-(?P<post_n1>[0-9]+))
|
(?:
[-_\.]?
(?P<post_l>post|rev|r)
[-_\.]?
(?P<post_n2>[0-9]+)?
)
)?
(?P<dev> # dev release
[-_\.]?
(?P<dev_l>dev)
[-_\.]?
(?P<dev_n>[0-9]+)?
)?
)
(?:\+(?P<local>[a-z0-9]+(?:[-_\.][a-z0-9]+)*))? # local version
"""
class Version(_BaseVersion):
_regex = re.compile(
r"^\s*" + VERSION_PATTERN + r"\s*$",
re.VERBOSE | re.IGNORECASE,
)
def __init__(self, version):
# Validate the version and parse it into pieces
match = self._regex.search(version)
if not match:
raise InvalidVersion("Invalid version: '{0}'".format(version))
# Store the parsed out pieces of the version
self._version = _Version(
epoch=int(match.group("epoch")) if match.group("epoch") else 0,
release=tuple(int(i) for i in match.group("release").split(".")),
pre=_parse_letter_version(
match.group("pre_l"),
match.group("pre_n"),
),
post=_parse_letter_version(
match.group("post_l"),
match.group("post_n1") or match.group("post_n2"),
),
dev=_parse_letter_version(
match.group("dev_l"),
match.group("dev_n"),
),
local=_parse_local_version(match.group("local")),
)
# Generate a key which will be used for sorting
self._key = _cmpkey(
self._version.epoch,
self._version.release,
self._version.pre,
self._version.post,
self._version.dev,
self._version.local,
)
def __repr__(self):
return "<Version({0})>".format(repr(str(self)))
def __str__(self):
parts = []
# Epoch
if self._version.epoch != 0:
parts.append("{0}!".format(self._version.epoch))
# Release segment
parts.append(".".join(str(x) for x in self._version.release))
# Pre-release
if self._version.pre is not None:
parts.append("".join(str(x) for x in self._version.pre))
# Post-release
if self._version.post is not None:
parts.append(".post{0}".format(self._version.post[1]))
# Development release
if self._version.dev is not None:
parts.append(".dev{0}".format(self._version.dev[1]))
# Local version segment
if self._version.local is not None:
parts.append(
"+{0}".format(".".join(str(x) for x in self._version.local))
)
return "".join(parts)
@property
def public(self):
return str(self).split("+", 1)[0]
@property
def base_version(self):
parts = []
# Epoch
if self._version.epoch != 0:
parts.append("{0}!".format(self._version.epoch))
# Release segment
parts.append(".".join(str(x) for x in self._version.release))
return "".join(parts)
@property
def local(self):
version_string = str(self)
if "+" in version_string:
return version_string.split("+", 1)[1]
@property
def is_prerelease(self):
return bool(self._version.dev or self._version.pre)
@property
def is_postrelease(self):
return bool(self._version.post)
def _parse_letter_version(letter, number):
if letter:
# We consider there to be an implicit 0 in a pre-release if there is
# not a numeral associated with it.
if number is None:
number = 0
# We normalize any letters to their lower case form
letter = letter.lower()
# We consider some words to be alternate spellings of other words and
# in those cases we want to normalize the spellings to our preferred
# spelling.
if letter == "alpha":
letter = "a"
elif letter == "beta":
letter = "b"
elif letter in ["c", "pre", "preview"]:
letter = "rc"
elif letter in ["rev", "r"]:
letter = "post"
return letter, int(number)
if not letter and number:
# We assume if we are given a number, but we are not given a letter
# then this is using the implicit post release syntax (e.g. 1.0-1)
letter = "post"
return letter, int(number)
_local_version_seperators = re.compile(r"[\._-]")
def _parse_local_version(local):
"""
Takes a string like abc.1.twelve and turns it into ("abc", 1, "twelve").
"""
if local is not None:
return tuple(
part.lower() if not part.isdigit() else int(part)
for part in _local_version_seperators.split(local)
)
def _cmpkey(epoch, release, pre, post, dev, local):
# When we compare a release version, we want to compare it with all of the
# trailing zeros removed. So we'll use a reverse the list, drop all the now
# leading zeros until we come to something non zero, then take the rest
# re-reverse it back into the correct order and make it a tuple and use
# that for our sorting key.
release = tuple(
reversed(list(
itertools.dropwhile(
lambda x: x == 0,
reversed(release),
)
))
)
# We need to "trick" the sorting algorithm to put 1.0.dev0 before 1.0a0.
# We'll do this by abusing the pre segment, but we _only_ want to do this
# if there is not a pre or a post segment. If we have one of those then
# the normal sorting rules will handle this case correctly.
if pre is None and post is None and dev is not None:
pre = -Infinity
# Versions without a pre-release (except as noted above) should sort after
# those with one.
elif pre is None:
pre = Infinity
# Versions without a post segment should sort before those with one.
if post is None:
post = -Infinity
# Versions without a development segment should sort after those with one.
if dev is None:
dev = Infinity
if local is None:
# Versions without a local segment should sort before those with one.
local = -Infinity
else:
# Versions with a local segment need that segment parsed to implement
# the sorting rules in PEP440.
# - Alpha numeric segments sort before numeric segments
# - Alpha numeric segments sort lexicographically
# - Numeric segments sort numerically
# - Shorter versions sort before longer versions when the prefixes
# match exactly
local = tuple(
(i, "") if isinstance(i, int) else (-Infinity, i)
for i in local
)
return epoch, release, pre, post, dev, local
pip/_vendor/packaging/requirements.py 0000644 00000010347 14751155150 0014022 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
import string
import re
from pip._vendor.pyparsing import (
stringStart, stringEnd, originalTextFor, ParseException
)
from pip._vendor.pyparsing import ZeroOrMore, Word, Optional, Regex, Combine
from pip._vendor.pyparsing import Literal as L # noqa
from pip._vendor.six.moves.urllib import parse as urlparse
from .markers import MARKER_EXPR, Marker
from .specifiers import LegacySpecifier, Specifier, SpecifierSet
class InvalidRequirement(ValueError):
"""
An invalid requirement was found, users should refer to PEP 508.
"""
ALPHANUM = Word(string.ascii_letters + string.digits)
LBRACKET = L("[").suppress()
RBRACKET = L("]").suppress()
LPAREN = L("(").suppress()
RPAREN = L(")").suppress()
COMMA = L(",").suppress()
SEMICOLON = L(";").suppress()
AT = L("@").suppress()
PUNCTUATION = Word("-_.")
IDENTIFIER_END = ALPHANUM | (ZeroOrMore(PUNCTUATION) + ALPHANUM)
IDENTIFIER = Combine(ALPHANUM + ZeroOrMore(IDENTIFIER_END))
NAME = IDENTIFIER("name")
EXTRA = IDENTIFIER
URI = Regex(r'[^ ]+')("url")
URL = (AT + URI)
EXTRAS_LIST = EXTRA + ZeroOrMore(COMMA + EXTRA)
EXTRAS = (LBRACKET + Optional(EXTRAS_LIST) + RBRACKET)("extras")
VERSION_PEP440 = Regex(Specifier._regex_str, re.VERBOSE | re.IGNORECASE)
VERSION_LEGACY = Regex(LegacySpecifier._regex_str, re.VERBOSE | re.IGNORECASE)
VERSION_ONE = VERSION_PEP440 ^ VERSION_LEGACY
VERSION_MANY = Combine(VERSION_ONE + ZeroOrMore(COMMA + VERSION_ONE),
joinString=",", adjacent=False)("_raw_spec")
_VERSION_SPEC = Optional(((LPAREN + VERSION_MANY + RPAREN) | VERSION_MANY))
_VERSION_SPEC.setParseAction(lambda s, l, t: t._raw_spec or '')
VERSION_SPEC = originalTextFor(_VERSION_SPEC)("specifier")
VERSION_SPEC.setParseAction(lambda s, l, t: t[1])
MARKER_EXPR = originalTextFor(MARKER_EXPR())("marker")
MARKER_EXPR.setParseAction(
lambda s, l, t: Marker(s[t._original_start:t._original_end])
)
MARKER_SEPERATOR = SEMICOLON
MARKER = MARKER_SEPERATOR + MARKER_EXPR
VERSION_AND_MARKER = VERSION_SPEC + Optional(MARKER)
URL_AND_MARKER = URL + Optional(MARKER)
NAMED_REQUIREMENT = \
NAME + Optional(EXTRAS) + (URL_AND_MARKER | VERSION_AND_MARKER)
REQUIREMENT = stringStart + NAMED_REQUIREMENT + stringEnd
class Requirement(object):
"""Parse a requirement.
Parse a given requirement string into its parts, such as name, specifier,
URL, and extras. Raises InvalidRequirement on a badly-formed requirement
string.
"""
# TODO: Can we test whether something is contained within a requirement?
# If so how do we do that? Do we need to test against the _name_ of
# the thing as well as the version? What about the markers?
# TODO: Can we normalize the name and extra name?
def __init__(self, requirement_string):
try:
req = REQUIREMENT.parseString(requirement_string)
except ParseException as e:
raise InvalidRequirement(
"Invalid requirement, parse error at \"{0!r}\"".format(
requirement_string[e.loc:e.loc + 8]))
self.name = req.name
if req.url:
parsed_url = urlparse.urlparse(req.url)
if not (parsed_url.scheme and parsed_url.netloc) or (
not parsed_url.scheme and not parsed_url.netloc):
raise InvalidRequirement("Invalid URL given")
self.url = req.url
else:
self.url = None
self.extras = set(req.extras.asList() if req.extras else [])
self.specifier = SpecifierSet(req.specifier)
self.marker = req.marker if req.marker else None
def __str__(self):
parts = [self.name]
if self.extras:
parts.append("[{0}]".format(",".join(sorted(self.extras))))
if self.specifier:
parts.append(str(self.specifier))
if self.url:
parts.append("@ {0}".format(self.url))
if self.marker:
parts.append("; {0}".format(self.marker))
return "".join(parts)
def __repr__(self):
return "<Requirement({0!r})>".format(str(self))
pip/_vendor/packaging/markers.py 0000644 00000020046 14751155150 0012740 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
import operator
import os
import platform
import sys
from pip._vendor.pyparsing import (
ParseException, ParseResults, stringStart, stringEnd,
)
from pip._vendor.pyparsing import ZeroOrMore, Group, Forward, QuotedString
from pip._vendor.pyparsing import Literal as L # noqa
from ._compat import string_types
from .specifiers import Specifier, InvalidSpecifier
__all__ = [
"InvalidMarker", "UndefinedComparison", "UndefinedEnvironmentName",
"Marker", "default_environment",
]
class InvalidMarker(ValueError):
"""
An invalid marker was found, users should refer to PEP 508.
"""
class UndefinedComparison(ValueError):
"""
An invalid operation was attempted on a value that doesn't support it.
"""
class UndefinedEnvironmentName(ValueError):
"""
A name was attempted to be used that does not exist inside of the
environment.
"""
class Node(object):
def __init__(self, value):
self.value = value
def __str__(self):
return str(self.value)
def __repr__(self):
return "<{0}({1!r})>".format(self.__class__.__name__, str(self))
def serialize(self):
raise NotImplementedError
class Variable(Node):
def serialize(self):
return str(self)
class Value(Node):
def serialize(self):
return '"{0}"'.format(self)
class Op(Node):
def serialize(self):
return str(self)
VARIABLE = (
L("implementation_version") |
L("platform_python_implementation") |
L("implementation_name") |
L("python_full_version") |
L("platform_release") |
L("platform_version") |
L("platform_machine") |
L("platform_system") |
L("python_version") |
L("sys_platform") |
L("os_name") |
L("os.name") | # PEP-345
L("sys.platform") | # PEP-345
L("platform.version") | # PEP-345
L("platform.machine") | # PEP-345
L("platform.python_implementation") | # PEP-345
L("python_implementation") | # undocumented setuptools legacy
L("extra")
)
ALIASES = {
'os.name': 'os_name',
'sys.platform': 'sys_platform',
'platform.version': 'platform_version',
'platform.machine': 'platform_machine',
'platform.python_implementation': 'platform_python_implementation',
'python_implementation': 'platform_python_implementation'
}
VARIABLE.setParseAction(lambda s, l, t: Variable(ALIASES.get(t[0], t[0])))
VERSION_CMP = (
L("===") |
L("==") |
L(">=") |
L("<=") |
L("!=") |
L("~=") |
L(">") |
L("<")
)
MARKER_OP = VERSION_CMP | L("not in") | L("in")
MARKER_OP.setParseAction(lambda s, l, t: Op(t[0]))
MARKER_VALUE = QuotedString("'") | QuotedString('"')
MARKER_VALUE.setParseAction(lambda s, l, t: Value(t[0]))
BOOLOP = L("and") | L("or")
MARKER_VAR = VARIABLE | MARKER_VALUE
MARKER_ITEM = Group(MARKER_VAR + MARKER_OP + MARKER_VAR)
MARKER_ITEM.setParseAction(lambda s, l, t: tuple(t[0]))
LPAREN = L("(").suppress()
RPAREN = L(")").suppress()
MARKER_EXPR = Forward()
MARKER_ATOM = MARKER_ITEM | Group(LPAREN + MARKER_EXPR + RPAREN)
MARKER_EXPR << MARKER_ATOM + ZeroOrMore(BOOLOP + MARKER_EXPR)
MARKER = stringStart + MARKER_EXPR + stringEnd
def _coerce_parse_result(results):
if isinstance(results, ParseResults):
return [_coerce_parse_result(i) for i in results]
else:
return results
def _format_marker(marker, first=True):
assert isinstance(marker, (list, tuple, string_types))
# Sometimes we have a structure like [[...]] which is a single item list
# where the single item is itself it's own list. In that case we want skip
# the rest of this function so that we don't get extraneous () on the
# outside.
if (isinstance(marker, list) and len(marker) == 1 and
isinstance(marker[0], (list, tuple))):
return _format_marker(marker[0])
if isinstance(marker, list):
inner = (_format_marker(m, first=False) for m in marker)
if first:
return " ".join(inner)
else:
return "(" + " ".join(inner) + ")"
elif isinstance(marker, tuple):
return " ".join([m.serialize() for m in marker])
else:
return marker
_operators = {
"in": lambda lhs, rhs: lhs in rhs,
"not in": lambda lhs, rhs: lhs not in rhs,
"<": operator.lt,
"<=": operator.le,
"==": operator.eq,
"!=": operator.ne,
">=": operator.ge,
">": operator.gt,
}
def _eval_op(lhs, op, rhs):
try:
spec = Specifier("".join([op.serialize(), rhs]))
except InvalidSpecifier:
pass
else:
return spec.contains(lhs)
oper = _operators.get(op.serialize())
if oper is None:
raise UndefinedComparison(
"Undefined {0!r} on {1!r} and {2!r}.".format(op, lhs, rhs)
)
return oper(lhs, rhs)
_undefined = object()
def _get_env(environment, name):
value = environment.get(name, _undefined)
if value is _undefined:
raise UndefinedEnvironmentName(
"{0!r} does not exist in evaluation environment.".format(name)
)
return value
def _evaluate_markers(markers, environment):
groups = [[]]
for marker in markers:
assert isinstance(marker, (list, tuple, string_types))
if isinstance(marker, list):
groups[-1].append(_evaluate_markers(marker, environment))
elif isinstance(marker, tuple):
lhs, op, rhs = marker
if isinstance(lhs, Variable):
lhs_value = _get_env(environment, lhs.value)
rhs_value = rhs.value
else:
lhs_value = lhs.value
rhs_value = _get_env(environment, rhs.value)
groups[-1].append(_eval_op(lhs_value, op, rhs_value))
else:
assert marker in ["and", "or"]
if marker == "or":
groups.append([])
return any(all(item) for item in groups)
def format_full_version(info):
version = '{0.major}.{0.minor}.{0.micro}'.format(info)
kind = info.releaselevel
if kind != 'final':
version += kind[0] + str(info.serial)
return version
def default_environment():
if hasattr(sys, 'implementation'):
iver = format_full_version(sys.implementation.version)
implementation_name = sys.implementation.name
else:
iver = '0'
implementation_name = ''
return {
"implementation_name": implementation_name,
"implementation_version": iver,
"os_name": os.name,
"platform_machine": platform.machine(),
"platform_release": platform.release(),
"platform_system": platform.system(),
"platform_version": platform.version(),
"python_full_version": platform.python_version(),
"platform_python_implementation": platform.python_implementation(),
"python_version": platform.python_version()[:3],
"sys_platform": sys.platform,
}
class Marker(object):
def __init__(self, marker):
try:
self._markers = _coerce_parse_result(MARKER.parseString(marker))
except ParseException as e:
err_str = "Invalid marker: {0!r}, parse error at {1!r}".format(
marker, marker[e.loc:e.loc + 8])
raise InvalidMarker(err_str)
def __str__(self):
return _format_marker(self._markers)
def __repr__(self):
return "<Marker({0!r})>".format(str(self))
def evaluate(self, environment=None):
"""Evaluate a marker.
Return the boolean from evaluating the given marker against the
environment. environment is an optional argument to override all or
part of the determined environment.
The environment is determined from the current Python process.
"""
current_environment = default_environment()
if environment is not None:
current_environment.update(environment)
return _evaluate_markers(self._markers, current_environment)
pip/_vendor/packaging/specifiers.py 0000644 00000066571 14751155150 0013445 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
import abc
import functools
import itertools
import re
from ._compat import string_types, with_metaclass
from .version import Version, LegacyVersion, parse
class InvalidSpecifier(ValueError):
"""
An invalid specifier was found, users should refer to PEP 440.
"""
class BaseSpecifier(with_metaclass(abc.ABCMeta, object)):
@abc.abstractmethod
def __str__(self):
"""
Returns the str representation of this Specifier like object. This
should be representative of the Specifier itself.
"""
@abc.abstractmethod
def __hash__(self):
"""
Returns a hash value for this Specifier like object.
"""
@abc.abstractmethod
def __eq__(self, other):
"""
Returns a boolean representing whether or not the two Specifier like
objects are equal.
"""
@abc.abstractmethod
def __ne__(self, other):
"""
Returns a boolean representing whether or not the two Specifier like
objects are not equal.
"""
@abc.abstractproperty
def prereleases(self):
"""
Returns whether or not pre-releases as a whole are allowed by this
specifier.
"""
@prereleases.setter
def prereleases(self, value):
"""
Sets whether or not pre-releases as a whole are allowed by this
specifier.
"""
@abc.abstractmethod
def contains(self, item, prereleases=None):
"""
Determines if the given item is contained within this specifier.
"""
@abc.abstractmethod
def filter(self, iterable, prereleases=None):
"""
Takes an iterable of items and filters them so that only items which
are contained within this specifier are allowed in it.
"""
class _IndividualSpecifier(BaseSpecifier):
_operators = {}
def __init__(self, spec="", prereleases=None):
match = self._regex.search(spec)
if not match:
raise InvalidSpecifier("Invalid specifier: '{0}'".format(spec))
self._spec = (
match.group("operator").strip(),
match.group("version").strip(),
)
# Store whether or not this Specifier should accept prereleases
self._prereleases = prereleases
def __repr__(self):
pre = (
", prereleases={0!r}".format(self.prereleases)
if self._prereleases is not None
else ""
)
return "<{0}({1!r}{2})>".format(
self.__class__.__name__,
str(self),
pre,
)
def __str__(self):
return "{0}{1}".format(*self._spec)
def __hash__(self):
return hash(self._spec)
def __eq__(self, other):
if isinstance(other, string_types):
try:
other = self.__class__(other)
except InvalidSpecifier:
return NotImplemented
elif not isinstance(other, self.__class__):
return NotImplemented
return self._spec == other._spec
def __ne__(self, other):
if isinstance(other, string_types):
try:
other = self.__class__(other)
except InvalidSpecifier:
return NotImplemented
elif not isinstance(other, self.__class__):
return NotImplemented
return self._spec != other._spec
def _get_operator(self, op):
return getattr(self, "_compare_{0}".format(self._operators[op]))
def _coerce_version(self, version):
if not isinstance(version, (LegacyVersion, Version)):
version = parse(version)
return version
@property
def operator(self):
return self._spec[0]
@property
def version(self):
return self._spec[1]
@property
def prereleases(self):
return self._prereleases
@prereleases.setter
def prereleases(self, value):
self._prereleases = value
def __contains__(self, item):
return self.contains(item)
def contains(self, item, prereleases=None):
# Determine if prereleases are to be allowed or not.
if prereleases is None:
prereleases = self.prereleases
# Normalize item to a Version or LegacyVersion, this allows us to have
# a shortcut for ``"2.0" in Specifier(">=2")
item = self._coerce_version(item)
# Determine if we should be supporting prereleases in this specifier
# or not, if we do not support prereleases than we can short circuit
# logic if this version is a prereleases.
if item.is_prerelease and not prereleases:
return False
# Actually do the comparison to determine if this item is contained
# within this Specifier or not.
return self._get_operator(self.operator)(item, self.version)
def filter(self, iterable, prereleases=None):
yielded = False
found_prereleases = []
kw = {"prereleases": prereleases if prereleases is not None else True}
# Attempt to iterate over all the values in the iterable and if any of
# them match, yield them.
for version in iterable:
parsed_version = self._coerce_version(version)
if self.contains(parsed_version, **kw):
# If our version is a prerelease, and we were not set to allow
# prereleases, then we'll store it for later incase nothing
# else matches this specifier.
if (parsed_version.is_prerelease and not
(prereleases or self.prereleases)):
found_prereleases.append(version)
# Either this is not a prerelease, or we should have been
# accepting prereleases from the begining.
else:
yielded = True
yield version
# Now that we've iterated over everything, determine if we've yielded
# any values, and if we have not and we have any prereleases stored up
# then we will go ahead and yield the prereleases.
if not yielded and found_prereleases:
for version in found_prereleases:
yield version
class LegacySpecifier(_IndividualSpecifier):
_regex_str = (
r"""
(?P<operator>(==|!=|<=|>=|<|>))
\s*
(?P<version>
[^,;\s)]* # Since this is a "legacy" specifier, and the version
# string can be just about anything, we match everything
# except for whitespace, a semi-colon for marker support,
# a closing paren since versions can be enclosed in
# them, and a comma since it's a version separator.
)
"""
)
_regex = re.compile(
r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
_operators = {
"==": "equal",
"!=": "not_equal",
"<=": "less_than_equal",
">=": "greater_than_equal",
"<": "less_than",
">": "greater_than",
}
def _coerce_version(self, version):
if not isinstance(version, LegacyVersion):
version = LegacyVersion(str(version))
return version
def _compare_equal(self, prospective, spec):
return prospective == self._coerce_version(spec)
def _compare_not_equal(self, prospective, spec):
return prospective != self._coerce_version(spec)
def _compare_less_than_equal(self, prospective, spec):
return prospective <= self._coerce_version(spec)
def _compare_greater_than_equal(self, prospective, spec):
return prospective >= self._coerce_version(spec)
def _compare_less_than(self, prospective, spec):
return prospective < self._coerce_version(spec)
def _compare_greater_than(self, prospective, spec):
return prospective > self._coerce_version(spec)
def _require_version_compare(fn):
@functools.wraps(fn)
def wrapped(self, prospective, spec):
if not isinstance(prospective, Version):
return False
return fn(self, prospective, spec)
return wrapped
class Specifier(_IndividualSpecifier):
_regex_str = (
r"""
(?P<operator>(~=|==|!=|<=|>=|<|>|===))
(?P<version>
(?:
# The identity operators allow for an escape hatch that will
# do an exact string match of the version you wish to install.
# This will not be parsed by PEP 440 and we cannot determine
# any semantic meaning from it. This operator is discouraged
# but included entirely as an escape hatch.
(?<====) # Only match for the identity operator
\s*
[^\s]* # We just match everything, except for whitespace
# since we are only testing for strict identity.
)
|
(?:
# The (non)equality operators allow for wild card and local
# versions to be specified so we have to define these two
# operators separately to enable that.
(?<===|!=) # Only match for equals and not equals
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)* # release
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
# You cannot use a wild card and a dev or local version
# together so group them with a | and make them optional.
(?:
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
(?:\+[a-z0-9]+(?:[-_\.][a-z0-9]+)*)? # local
|
\.\* # Wild card syntax of .*
)?
)
|
(?:
# The compatible operator requires at least two digits in the
# release segment.
(?<=~=) # Only match for the compatible operator
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)+ # release (We have a + instead of a *)
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
)
|
(?:
# All other operators only allow a sub set of what the
# (non)equality operators do. Specifically they do not allow
# local versions to be specified nor do they allow the prefix
# matching wild cards.
(?<!==|!=|~=) # We have special cases for these
# operators so we want to make sure they
# don't match here.
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)* # release
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
)
)
"""
)
_regex = re.compile(
r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
_operators = {
"~=": "compatible",
"==": "equal",
"!=": "not_equal",
"<=": "less_than_equal",
">=": "greater_than_equal",
"<": "less_than",
">": "greater_than",
"===": "arbitrary",
}
@_require_version_compare
def _compare_compatible(self, prospective, spec):
# Compatible releases have an equivalent combination of >= and ==. That
# is that ~=2.2 is equivalent to >=2.2,==2.*. This allows us to
# implement this in terms of the other specifiers instead of
# implementing it ourselves. The only thing we need to do is construct
# the other specifiers.
# We want everything but the last item in the version, but we want to
# ignore post and dev releases and we want to treat the pre-release as
# it's own separate segment.
prefix = ".".join(
list(
itertools.takewhile(
lambda x: (not x.startswith("post") and not
x.startswith("dev")),
_version_split(spec),
)
)[:-1]
)
# Add the prefix notation to the end of our string
prefix += ".*"
return (self._get_operator(">=")(prospective, spec) and
self._get_operator("==")(prospective, prefix))
@_require_version_compare
def _compare_equal(self, prospective, spec):
# We need special logic to handle prefix matching
if spec.endswith(".*"):
# In the case of prefix matching we want to ignore local segment.
prospective = Version(prospective.public)
# Split the spec out by dots, and pretend that there is an implicit
# dot in between a release segment and a pre-release segment.
spec = _version_split(spec[:-2]) # Remove the trailing .*
# Split the prospective version out by dots, and pretend that there
# is an implicit dot in between a release segment and a pre-release
# segment.
prospective = _version_split(str(prospective))
# Shorten the prospective version to be the same length as the spec
# so that we can determine if the specifier is a prefix of the
# prospective version or not.
prospective = prospective[:len(spec)]
# Pad out our two sides with zeros so that they both equal the same
# length.
spec, prospective = _pad_version(spec, prospective)
else:
# Convert our spec string into a Version
spec = Version(spec)
# If the specifier does not have a local segment, then we want to
# act as if the prospective version also does not have a local
# segment.
if not spec.local:
prospective = Version(prospective.public)
return prospective == spec
@_require_version_compare
def _compare_not_equal(self, prospective, spec):
return not self._compare_equal(prospective, spec)
@_require_version_compare
def _compare_less_than_equal(self, prospective, spec):
return prospective <= Version(spec)
@_require_version_compare
def _compare_greater_than_equal(self, prospective, spec):
return prospective >= Version(spec)
@_require_version_compare
def _compare_less_than(self, prospective, spec):
# Convert our spec to a Version instance, since we'll want to work with
# it as a version.
spec = Version(spec)
# Check to see if the prospective version is less than the spec
# version. If it's not we can short circuit and just return False now
# instead of doing extra unneeded work.
if not prospective < spec:
return False
# This special case is here so that, unless the specifier itself
# includes is a pre-release version, that we do not accept pre-release
# versions for the version mentioned in the specifier (e.g. <3.1 should
# not match 3.1.dev0, but should match 3.0.dev0).
if not spec.is_prerelease and prospective.is_prerelease:
if Version(prospective.base_version) == Version(spec.base_version):
return False
# If we've gotten to here, it means that prospective version is both
# less than the spec version *and* it's not a pre-release of the same
# version in the spec.
return True
@_require_version_compare
def _compare_greater_than(self, prospective, spec):
# Convert our spec to a Version instance, since we'll want to work with
# it as a version.
spec = Version(spec)
# Check to see if the prospective version is greater than the spec
# version. If it's not we can short circuit and just return False now
# instead of doing extra unneeded work.
if not prospective > spec:
return False
# This special case is here so that, unless the specifier itself
# includes is a post-release version, that we do not accept
# post-release versions for the version mentioned in the specifier
# (e.g. >3.1 should not match 3.0.post0, but should match 3.2.post0).
if not spec.is_postrelease and prospective.is_postrelease:
if Version(prospective.base_version) == Version(spec.base_version):
return False
# Ensure that we do not allow a local version of the version mentioned
# in the specifier, which is techincally greater than, to match.
if prospective.local is not None:
if Version(prospective.base_version) == Version(spec.base_version):
return False
# If we've gotten to here, it means that prospective version is both
# greater than the spec version *and* it's not a pre-release of the
# same version in the spec.
return True
def _compare_arbitrary(self, prospective, spec):
return str(prospective).lower() == str(spec).lower()
@property
def prereleases(self):
# If there is an explicit prereleases set for this, then we'll just
# blindly use that.
if self._prereleases is not None:
return self._prereleases
# Look at all of our specifiers and determine if they are inclusive
# operators, and if they are if they are including an explicit
# prerelease.
operator, version = self._spec
if operator in ["==", ">=", "<=", "~=", "==="]:
# The == specifier can include a trailing .*, if it does we
# want to remove before parsing.
if operator == "==" and version.endswith(".*"):
version = version[:-2]
# Parse the version, and if it is a pre-release than this
# specifier allows pre-releases.
if parse(version).is_prerelease:
return True
return False
@prereleases.setter
def prereleases(self, value):
self._prereleases = value
_prefix_regex = re.compile(r"^([0-9]+)((?:a|b|c|rc)[0-9]+)$")
def _version_split(version):
result = []
for item in version.split("."):
match = _prefix_regex.search(item)
if match:
result.extend(match.groups())
else:
result.append(item)
return result
def _pad_version(left, right):
left_split, right_split = [], []
# Get the release segment of our versions
left_split.append(list(itertools.takewhile(lambda x: x.isdigit(), left)))
right_split.append(list(itertools.takewhile(lambda x: x.isdigit(), right)))
# Get the rest of our versions
left_split.append(left[len(left_split[0]):])
right_split.append(right[len(right_split[0]):])
# Insert our padding
left_split.insert(
1,
["0"] * max(0, len(right_split[0]) - len(left_split[0])),
)
right_split.insert(
1,
["0"] * max(0, len(left_split[0]) - len(right_split[0])),
)
return (
list(itertools.chain(*left_split)),
list(itertools.chain(*right_split)),
)
class SpecifierSet(BaseSpecifier):
def __init__(self, specifiers="", prereleases=None):
# Split on , to break each indidivual specifier into it's own item, and
# strip each item to remove leading/trailing whitespace.
specifiers = [s.strip() for s in specifiers.split(",") if s.strip()]
# Parsed each individual specifier, attempting first to make it a
# Specifier and falling back to a LegacySpecifier.
parsed = set()
for specifier in specifiers:
try:
parsed.add(Specifier(specifier))
except InvalidSpecifier:
parsed.add(LegacySpecifier(specifier))
# Turn our parsed specifiers into a frozen set and save them for later.
self._specs = frozenset(parsed)
# Store our prereleases value so we can use it later to determine if
# we accept prereleases or not.
self._prereleases = prereleases
def __repr__(self):
pre = (
", prereleases={0!r}".format(self.prereleases)
if self._prereleases is not None
else ""
)
return "<SpecifierSet({0!r}{1})>".format(str(self), pre)
def __str__(self):
return ",".join(sorted(str(s) for s in self._specs))
def __hash__(self):
return hash(self._specs)
def __and__(self, other):
if isinstance(other, string_types):
other = SpecifierSet(other)
elif not isinstance(other, SpecifierSet):
return NotImplemented
specifier = SpecifierSet()
specifier._specs = frozenset(self._specs | other._specs)
if self._prereleases is None and other._prereleases is not None:
specifier._prereleases = other._prereleases
elif self._prereleases is not None and other._prereleases is None:
specifier._prereleases = self._prereleases
elif self._prereleases == other._prereleases:
specifier._prereleases = self._prereleases
else:
raise ValueError(
"Cannot combine SpecifierSets with True and False prerelease "
"overrides."
)
return specifier
def __eq__(self, other):
if isinstance(other, string_types):
other = SpecifierSet(other)
elif isinstance(other, _IndividualSpecifier):
other = SpecifierSet(str(other))
elif not isinstance(other, SpecifierSet):
return NotImplemented
return self._specs == other._specs
def __ne__(self, other):
if isinstance(other, string_types):
other = SpecifierSet(other)
elif isinstance(other, _IndividualSpecifier):
other = SpecifierSet(str(other))
elif not isinstance(other, SpecifierSet):
return NotImplemented
return self._specs != other._specs
def __len__(self):
return len(self._specs)
def __iter__(self):
return iter(self._specs)
@property
def prereleases(self):
# If we have been given an explicit prerelease modifier, then we'll
# pass that through here.
if self._prereleases is not None:
return self._prereleases
# If we don't have any specifiers, and we don't have a forced value,
# then we'll just return None since we don't know if this should have
# pre-releases or not.
if not self._specs:
return None
# Otherwise we'll see if any of the given specifiers accept
# prereleases, if any of them do we'll return True, otherwise False.
return any(s.prereleases for s in self._specs)
@prereleases.setter
def prereleases(self, value):
self._prereleases = value
def __contains__(self, item):
return self.contains(item)
def contains(self, item, prereleases=None):
# Ensure that our item is a Version or LegacyVersion instance.
if not isinstance(item, (LegacyVersion, Version)):
item = parse(item)
# Determine if we're forcing a prerelease or not, if we're not forcing
# one for this particular filter call, then we'll use whatever the
# SpecifierSet thinks for whether or not we should support prereleases.
if prereleases is None:
prereleases = self.prereleases
# We can determine if we're going to allow pre-releases by looking to
# see if any of the underlying items supports them. If none of them do
# and this item is a pre-release then we do not allow it and we can
# short circuit that here.
# Note: This means that 1.0.dev1 would not be contained in something
# like >=1.0.devabc however it would be in >=1.0.debabc,>0.0.dev0
if not prereleases and item.is_prerelease:
return False
# We simply dispatch to the underlying specs here to make sure that the
# given version is contained within all of them.
# Note: This use of all() here means that an empty set of specifiers
# will always return True, this is an explicit design decision.
return all(
s.contains(item, prereleases=prereleases)
for s in self._specs
)
def filter(self, iterable, prereleases=None):
# Determine if we're forcing a prerelease or not, if we're not forcing
# one for this particular filter call, then we'll use whatever the
# SpecifierSet thinks for whether or not we should support prereleases.
if prereleases is None:
prereleases = self.prereleases
# If we have any specifiers, then we want to wrap our iterable in the
# filter method for each one, this will act as a logical AND amongst
# each specifier.
if self._specs:
for spec in self._specs:
iterable = spec.filter(iterable, prereleases=bool(prereleases))
return iterable
# If we do not have any specifiers, then we need to have a rough filter
# which will filter out any pre-releases, unless there are no final
# releases, and which will filter out LegacyVersion in general.
else:
filtered = []
found_prereleases = []
for item in iterable:
# Ensure that we some kind of Version class for this item.
if not isinstance(item, (LegacyVersion, Version)):
parsed_version = parse(item)
else:
parsed_version = item
# Filter out any item which is parsed as a LegacyVersion
if isinstance(parsed_version, LegacyVersion):
continue
# Store any item which is a pre-release for later unless we've
# already found a final version or we are accepting prereleases
if parsed_version.is_prerelease and not prereleases:
if not filtered:
found_prereleases.append(item)
else:
filtered.append(item)
# If we've found no items except for pre-releases, then we'll go
# ahead and use the pre-releases
if not filtered and found_prereleases and prereleases is None:
return found_prereleases
return filtered
pip/_vendor/packaging/__pycache__/utils.cpython-36.opt-1.pyc 0000644 00000000630 14751155150 0017654 0 ustar 00 3
���e� � @ s2 d dl mZmZmZ d dlZejd�Zdd� ZdS )� )�absolute_import�division�print_functionNz[-_.]+c C s t jd| �j� S )N�-)�_canonicalize_regex�sub�lower)�name� r
�/usr/lib/python3.6/utils.py�canonicalize_name s r )Z
__future__r r r �re�compiler r r
r
r
r �<module> s
pip/_vendor/packaging/__pycache__/version.cpython-36.opt-1.pyc 0000644 00000024426 14751155150 0020212 0 ustar 00 3
���e$- � @ s� d dl mZmZmZ d dlZd dlZd dlZddlmZ ddddd gZ ej
d
d d d
dddg�Z dd� Z G dd� de
�ZG dd� de�ZG dd� de�Zejdej�Zdddddd�Zdd � Zd d � Zd ZG d d� de�Zd!d"� Zejd#�Zd$d%� Z d&d'� Z dS )(� )�absolute_import�division�print_functionN� )�Infinity�parse�Version�
LegacyVersion�InvalidVersion�VERSION_PATTERN�_Version�epoch�release�dev�pre�post�localc C s& yt | �S tk
r t| �S X dS )z�
Parse the given version string and return either a :class:`Version` object
or a :class:`LegacyVersion` object depending on if the given version is
a valid PEP 440 version or a legacy version.
N)r r
r )�version� r � /usr/lib/python3.6/version.pyr s c @ s e Zd ZdZdS )r
zF
An invalid version was found, users should refer to PEP 440.
N)�__name__�
__module__� __qualname__�__doc__r r r r r
$ s c @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )� _BaseVersionc C s
t | j�S )N)�hash�_key)�selfr r r �__hash__, s z_BaseVersion.__hash__c C s | j |dd� �S )Nc S s | |k S )Nr )�s�or r r �<lambda>0 s z%_BaseVersion.__lt__.<locals>.<lambda>)�_compare)r �otherr r r �__lt__/ s z_BaseVersion.__lt__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! 3 s z%_BaseVersion.__le__.<locals>.<lambda>)r" )r r# r r r �__le__2 s z_BaseVersion.__le__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! 6 s z%_BaseVersion.__eq__.<locals>.<lambda>)r" )r r# r r r �__eq__5 s z_BaseVersion.__eq__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! 9 s z%_BaseVersion.__ge__.<locals>.<lambda>)r" )r r# r r r �__ge__8 s z_BaseVersion.__ge__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! < s z%_BaseVersion.__gt__.<locals>.<lambda>)r" )r r# r r r �__gt__; s z_BaseVersion.__gt__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! ? s z%_BaseVersion.__ne__.<locals>.<lambda>)r" )r r# r r r �__ne__> s z_BaseVersion.__ne__c C s t |t�stS || j|j�S )N)�
isinstancer �NotImplementedr )r r# �methodr r r r" A s
z_BaseVersion._compareN) r r r r r$ r% r& r' r( r) r" r r r r r * s r c @ s` e Zd Zdd� Zdd� Zdd� Zedd� �Zed d
� �Zed d � �Z ed
d� �Z
edd� �Z dS )r c C s t |�| _t| j�| _d S )N)�str�_version�_legacy_cmpkeyr )r r r r r �__init__J s
zLegacyVersion.__init__c C s | j S )N)r. )r r r r �__str__N s zLegacyVersion.__str__c C s dj tt| ���S )Nz<LegacyVersion({0})>)�format�reprr- )r r r r �__repr__Q s zLegacyVersion.__repr__c C s | j S )N)r. )r r r r �publicT s zLegacyVersion.publicc C s | j S )N)r. )r r r r � base_versionX s zLegacyVersion.base_versionc C s d S )Nr )r r r r r \ s zLegacyVersion.localc C s dS )NFr )r r r r �
is_prerelease` s zLegacyVersion.is_prereleasec C s dS )NFr )r r r r �is_postreleased s z LegacyVersion.is_postreleaseN) r r r r0 r1 r4 �propertyr5 r6 r r7 r8 r r r r r H s z(\d+ | [a-z]+ | \.| -)�czfinal-�@)r �preview�-�rcr c c sb xVt j| �D ]H}tj||�}| s |dkr,q |d d� dkrJ|jd�V q d| V q W dV d S )N�.r �
0123456789� �*z*final)� _legacy_version_component_re�split� _legacy_version_replacement_map�get�zfill)r �partr r r �_parse_version_partsr s rI c C s� d}g }xlt | j� �D ]\}|jd�rh|dk rJx |rH|d dkrH|j� q.W x |rf|d dkrf|j� qLW |j|� qW t|�}||fS ) Nr rB z*finalz*final-Z00000000���rJ rJ )rI �lower�
startswith�pop�append�tuple)r r
�partsrH r r r r/ � s
r/ a�
v?
(?:
(?:(?P<epoch>[0-9]+)!)? # epoch
(?P<release>[0-9]+(?:\.[0-9]+)*) # release segment
(?P<pre> # pre-release
[-_\.]?
(?P<pre_l>(a|b|c|rc|alpha|beta|pre|preview))
[-_\.]?
(?P<pre_n>[0-9]+)?
)?
(?P<post> # post release
(?:-(?P<post_n1>[0-9]+))
|
(?:
[-_\.]?
(?P<post_l>post|rev|r)
[-_\.]?
(?P<post_n2>[0-9]+)?
)
)?
(?P<dev> # dev release
[-_\.]?
(?P<dev_l>dev)
[-_\.]?
(?P<dev_n>[0-9]+)?
)?
)
(?:\+(?P<local>[a-z0-9]+(?:[-_\.][a-z0-9]+)*))? # local version
c @ s| e Zd Zejde d ejejB �Zdd� Z dd� Z
dd� Z e d d
� �Z
e d d � �Ze d
d� �Ze dd� �Ze dd� �ZdS )r z^\s*z\s*$c C s� | j j|�}|s tdj|���t|jd�r8t|jd��ndtdd� |jd�jd�D ��t |jd�|jd ��t |jd
�|jd �p�|jd ��t |jd
�|jd��t
|jd��d�| _ t | j j
| j j| j j| j j| j j| j j�| _d S )NzInvalid version: '{0}'r
r c s s | ]}t |�V qd S )N)�int)�.0�ir r r � <genexpr>� s z#Version.__init__.<locals>.<genexpr>r r? Zpre_lZpre_nZpost_lZpost_n1Zpost_n2Zdev_lZdev_nr )r
r r r r r )�_regex�searchr
r2 r �grouprQ rO rD �_parse_letter_version�_parse_local_versionr. �_cmpkeyr
r r r r r r )r r �matchr r r r0 � s.
zVersion.__init__c C s dj tt| ���S )Nz<Version({0})>)r2 r3 r- )r r r r r4 � s zVersion.__repr__c C s� g }| j jdkr$|jdj| j j�� |jdjdd� | j jD ��� | j jd k rl|jdjdd� | j jD ��� | j jd k r�|jdj| j jd �� | j jd k r�|jd
j| j jd �� | j j d k r�|jd jdjd d� | j j D ���� dj|�S )
Nr z{0}!r? c s s | ]}t |�V qd S )N)r- )rR �xr r r rT � s z"Version.__str__.<locals>.<genexpr>� c s s | ]}t |�V qd S )N)r- )rR r\ r r r rT � s z.post{0}r z.dev{0}z+{0}c s s | ]}t |�V qd S )N)r- )rR r\ r r r rT s )
r. r
rN r2 �joinr r r r r )r rP r r r r1 � s zVersion.__str__c C s t | �jdd�d S )N�+r r )r- rD )r r r r r5
s zVersion.publicc C sL g }| j jdkr$|jdj| j j�� |jdjdd� | j jD ��� dj|�S )Nr z{0}!r? c s s | ]}t |�V qd S )N)r- )rR r\ r r r rT s z'Version.base_version.<locals>.<genexpr>r] )r. r
rN r2 r^ r )r rP r r r r6 s
zVersion.base_versionc C s$ t | �}d|kr |jdd�d S d S )Nr_ r )r- rD )r Zversion_stringr r r r s z
Version.localc C s t | jjp| jj�S )N)�boolr. r r )r r r r r7 ! s zVersion.is_prereleasec C s t | jj�S )N)r` r. r )r r r r r8 % s zVersion.is_postreleaseN)r r r �re�compiler �VERBOSE�
IGNORECASErU r0 r4 r1 r9 r5 r6 r r7 r8 r r r r r � s
#
c C sx | rZ|d krd}| j � } | dkr&d} n(| dkr4d} n| d
krBd } n | dkrNd } | t|�fS | rt|rtd } | t|�fS d S )Nr Zalpha�aZbeta�br: r r< r> �rev�rr )r: r r< )rg rh )rK rQ )ZletterZnumberr r r rX * s
rX z[\._-]c C s$ | dk r t dd� tj| �D ��S dS )zR
Takes a string like abc.1.twelve and turns it into ("abc", 1, "twelve").
Nc s s& | ] }|j � s|j� nt|�V qd S )N)�isdigitrK rQ )rR rH r r r rT R s z'_parse_local_version.<locals>.<genexpr>)rO �_local_version_seperatorsrD )r r r r rY L s rY c C s� t tttjdd� t|�����}|d kr@|d kr@|d k r@t }n |d krLt}|d krZt }|d krft}|d krvt }nt dd� |D ��}| |||||fS )Nc S s | dkS )Nr r )r\ r r r r! ` s z_cmpkey.<locals>.<lambda>c s s* | ]"}t |t�r|d fnt |fV qdS )r] N)r* rQ r )rR rS r r r rT � s z_cmpkey.<locals>.<genexpr>)rO �reversed�list� itertools� dropwhiler )r
r r r r r r r r rZ W s&
rZ ) Z
__future__r r r � collectionsrm ra Z _structuresr �__all__�
namedtupler r �
ValueErrorr
�objectr r rb rc rC rE rI r/ r r rX rj rY rZ r r r r �<module> s. !
9k
pip/_vendor/packaging/__pycache__/markers.cpython-36.pyc 0000644 00000021133 14751155150 0017222 0 ustar 00 3
���e& � @ s@ d dl mZmZmZ d dlZd dlZd dlZd dlZd dlm Z m
Z
m Z m Z d dlm
Z
mZmZmZ d dlmZ ddlmZ ddlmZmZ d d
d d d
gZG dd � d e�ZG dd
� d
e�ZG dd � d e�Z G dd� de �Z G dd� de �Z G dd� de �Z G dd� de �Z!ed�ed�B ed�B ed �B ed �B ed �B ed �B ed �B ed!�B ed"�B ed#�B ed$�B ed%�B ed&�B ed'�B ed(�B ed)�B ed*�B Z"d#d"d d ddd+�Z#e"j$d,d-� � ed.�ed/�B ed0�B ed1�B ed2�B ed3�B ed4�B ed5�B Z%e%ed6�B ed7�B Z&e&j$d8d-� � ed9�ed:�B Z'e'j$d;d-� � ed<�ed=�B Z(e"e'B Z)ee)e& e) �Z*e*j$d>d-� � ed?�j+� Z,ed@�j+� Z-e� Z.e*ee,e. e- �B Z/e.e/e
e(e. � > e e. e Z0dAdB� Z1dSdDdE�Z2dFd-� dGd-� ej3ej4ej5ej6ej7ej8dH�Z9dIdJ� Z:e � Z;dKdL� Z<dMdN� Z=dOdP� Z>dQd
� Z?G dRd � d e �Z@dS )T� )�absolute_import�division�print_functionN)�ParseException� ParseResults� stringStart� stringEnd)�
ZeroOrMore�Group�Forward� QuotedString)�Literal� )� string_types)� Specifier�InvalidSpecifier�
InvalidMarker�UndefinedComparison�UndefinedEnvironmentName�Marker�default_environmentc @ s e Zd ZdZdS )r zE
An invalid marker was found, users should refer to PEP 508.
N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/markers.pyr s c @ s e Zd ZdZdS )r zP
An invalid operation was attempted on a value that doesn't support it.
N)r r r r r r r r r ! s c @ s e Zd ZdZdS )r z\
A name was attempted to be used that does not exist inside of the
environment.
N)r r r r r r r r r ' s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�Nodec C s
|| _ d S )N)�value)�selfr r r r �__init__0 s z
Node.__init__c C s
t | j�S )N)�strr )r r r r �__str__3 s z Node.__str__c C s dj | jjt| ��S )Nz <{0}({1!r})>)�format� __class__r r! )r r r r �__repr__6 s z
Node.__repr__c C s t �d S )N)�NotImplementedError)r r r r � serialize9 s zNode.serializeN)r r r r r" r% r' r r r r r . s r c @ s e Zd Zdd� ZdS )�Variablec C s t | �S )N)r! )r r r r r' ? s zVariable.serializeN)r r r r' r r r r r( = s r( c @ s e Zd Zdd� ZdS )�Valuec C s
dj | �S )Nz"{0}")r# )r r r r r' E s zValue.serializeN)r r r r' r r r r r) C s r) c @ s e Zd Zdd� ZdS )�Opc C s t | �S )N)r! )r r r r r' K s z Op.serializeN)r r r r' r r r r r* I s r* �implementation_version� platform_python_implementation�implementation_name�python_full_version�platform_release�platform_version�platform_machine�platform_system�python_version� sys_platform�os_namezos.namez sys.platformzplatform.versionzplatform.machinez platform.python_implementation�python_implementationZextra)zos.namez sys.platformzplatform.versionzplatform.machinez platform.python_implementationr6 c C s t tj|d |d ��S )Nr )r( �ALIASES�get)�s�l�tr r r �<lambda>k s r< z===z==z>=z<=z!=z~=�>�<znot in�inc C s t |d �S )Nr )r* )r9 r: r; r r r r< y s �'�"c C s t |d �S )Nr )r) )r9 r: r; r r r r< | s �and�orc C s t |d �S )Nr )�tuple)r9 r: r; r r r r< � s �(�)c C s t | t�rdd� | D �S | S d S )Nc S s g | ] }t |��qS r )�_coerce_parse_result)�.0�ir r r �
<listcomp>� s z(_coerce_parse_result.<locals>.<listcomp>)�
isinstancer )�resultsr r r rG � s
rG Tc C s� t | tttf�st�t | t�rHt| �dkrHt | d ttf�rHt| d �S t | t�r�dd� | D �}|rndj|�S ddj|� d S n"t | t�r�djdd � | D ��S | S d S )
Nr r c s s | ]}t |d d�V qdS )F)�firstN)�_format_marker)rH �mr r r � <genexpr>� s z!_format_marker.<locals>.<genexpr>� rE rF c S s g | ] }|j � �qS r )r' )rH rO r r r rJ � s z"_format_marker.<locals>.<listcomp>)rK �listrD r �AssertionError�lenrN �join)�markerrM �innerr r r rN � s
rN c C s | |kS )Nr )�lhs�rhsr r r r< � s c C s | |kS )Nr )rX rY r r r r< � s )r? znot inr> z<=z==z!=z>=r= c
C sl yt dj|j� |g��}W n tk
r. Y n X |j| �S tj|j� �}|d krbtdj|| |���|| |�S )N� z#Undefined {0!r} on {1!r} and {2!r}.) r rU r' r �contains�
_operatorsr8 r r# )rX �oprY �specZoperr r r �_eval_op� s
r_ c C s& | j |t�}|tkr"tdj|���|S )Nz/{0!r} does not exist in evaluation environment.)r8 �
_undefinedr r# )� environment�namer r r r �_get_env� s
rc c C s� g g}x�| D ]�}t |tttf�s$t�t |t�rD|d jt||�� q t |t�r�|\}}}t |t�rvt||j �}|j }n|j }t||j �}|d jt
|||�� q |dks�t�|dkr |jg � q W t dd� |D ��S ) Nr rB rC c s s | ]}t |�V qd S )N)�all)rH �itemr r r rP � s z$_evaluate_markers.<locals>.<genexpr>���rf )rB rC ) rK rR rD r rS �append�_evaluate_markersr( rc r r_ �any) Zmarkersra �groupsrV rX r] rY Z lhs_valueZ rhs_valuer r r rh � s"
rh c C s2 dj | �}| j}|dkr.||d t| j� 7 }|S )Nz {0.major}.{0.minor}.{0.micro}�finalr )r# � releaselevelr! �serial)�info�versionZkindr r r �format_full_version� s
rp c C sl t td�r ttjj�} tjj}nd} d}|| tjtj� tj � tj
� tj� tj � tj � tj � d d� tjd� S )N�implementation�0rZ � ) r- r+ r5 r1 r/ r2 r0 r. r, r3 r4 )
�hasattr�sysrp rq ro rb �os�platform�machine�release�systemr3 r6 )Ziverr- r r r r � s
c @ s. e Zd Zdd� Zdd� Zdd� Zd
dd �ZdS ) r c C s` yt tj|��| _W nF tk
rZ } z*dj|||j|jd � �}t|��W Y d d }~X nX d S )Nz+Invalid marker: {0!r}, parse error at {1!r}� )rG �MARKERZ parseString�_markersr r# �locr )r rV �eZerr_strr r r r s zMarker.__init__c C s
t | j�S )N)rN r} )r r r r r" s zMarker.__str__c C s dj t| ��S )Nz<Marker({0!r})>)r# r! )r r r r r% s zMarker.__repr__Nc C s$ t � }|dk r|j|� t| j|�S )a$ Evaluate a marker.
Return the boolean from evaluating the given marker against the
environment. environment is an optional argument to override all or
part of the determined environment.
The environment is determined from the current Python process.
N)r �updaterh r} )r ra Zcurrent_environmentr r r �evaluate" s
zMarker.evaluate)N)r r r r r" r% r� r r r r r s )T)AZ
__future__r r r �operatorrv rw ru Zpip._vendor.pyparsingr r r r r r
r r r
�LZ_compatr Z
specifiersr r �__all__�
ValueErrorr r r �objectr r( r) r* ZVARIABLEr7 ZsetParseActionZ VERSION_CMPZ MARKER_OPZ MARKER_VALUEZBOOLOPZ
MARKER_VARZ MARKER_ITEM�suppressZLPARENZRPARENZ MARKER_EXPRZ MARKER_ATOMr| rG rN �lt�le�eq�ne�ge�gtr\ r_ r` rc rh rp r r r r r r �<module> sx �
6
pip/_vendor/packaging/__pycache__/__about__.cpython-36.opt-1.pyc 0000644 00000001177 14751155150 0020431 0 ustar 00 3
���e� � @ sP d dl mZmZmZ dddddddd gZd
Zd Zd Zd
ZdZ dZ
dZ de Z dS )� )�absolute_import�division�print_function� __title__� __summary__�__uri__� __version__�
__author__� __email__� __license__�
__copyright__Z packagingz"Core utilities for Python packagesz!https://github.com/pypa/packagingz16.8z)Donald Stufft and individual contributorszdonald@stufft.ioz"BSD or Apache License, Version 2.0zCopyright 2014-2016 %sN)
Z
__future__r r r �__all__r r r r r r
r r � r r � /usr/lib/python3.6/__about__.py�<module> s
pip/_vendor/packaging/__pycache__/__init__.cpython-36.pyc 0000644 00000000735 14751155150 0017322 0 ustar 00 3
���e � @ sT d dl mZmZmZ ddlmZmZmZmZm Z m
Z
m Z m Z dddddd d
d gZ
d S )
� )�absolute_import�division�print_function� )�
__author__�
__copyright__� __email__� __license__� __summary__� __title__�__uri__� __version__r r
r r
r r r r N)Z
__future__r r r � __about__r r r r r
r r r
�__all__� r r � /usr/lib/python3.6/__init__.py�<module> s (
pip/_vendor/packaging/__pycache__/_structures.cpython-36.opt-1.pyc 0000644 00000005335 14751155150 0021105 0 ustar 00 3
���e� � @ sD d dl mZmZmZ G dd� de�Ze� ZG dd� de�Ze� ZdS )� )�absolute_import�division�print_functionc @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )�Infinityc C s dS )Nr � )�selfr r �!/usr/lib/python3.6/_structures.py�__repr__ s zInfinity.__repr__c C s t t| ��S )N)�hash�repr)r r r r �__hash__ s zInfinity.__hash__c C s dS )NFr )r �otherr r r �__lt__ s zInfinity.__lt__c C s dS )NFr )r r
r r r �__le__ s zInfinity.__le__c C s t || j�S )N)�
isinstance� __class__)r r
r r r �__eq__ s zInfinity.__eq__c C s t || j� S )N)r r )r r
r r r �__ne__ s zInfinity.__ne__c C s dS )NTr )r r
r r r �__gt__ s zInfinity.__gt__c C s dS )NTr )r r
r r r �__ge__ s zInfinity.__ge__c C s t S )N)�NegativeInfinity)r r r r �__neg__! s zInfinity.__neg__N) �__name__�
__module__� __qualname__r r r r r r r r r r r r r r s r c @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )r c C s dS )Nz -Infinityr )r r r r r ) s zNegativeInfinity.__repr__c C s t t| ��S )N)r
r )r r r r r , s zNegativeInfinity.__hash__c C s dS )NTr )r r
r r r r / s zNegativeInfinity.__lt__c C s dS )NTr )r r
r r r r 2 s zNegativeInfinity.__le__c C s t || j�S )N)r r )r r
r r r r 5 s zNegativeInfinity.__eq__c C s t || j� S )N)r r )r r
r r r r 8 s zNegativeInfinity.__ne__c C s dS )NFr )r r
r r r r ; s zNegativeInfinity.__gt__c C s dS )NFr )r r
r r r r > s zNegativeInfinity.__ge__c C s t S )N)r )r r r r r A s zNegativeInfinity.__neg__N) r r r r r r r r r r r r r r r r r ' s r N)Z
__future__r r r �objectr r r r r r �<module> s pip/_vendor/packaging/__pycache__/_compat.cpython-36.opt-1.pyc 0000644 00000001634 14751155150 0020143 0 ustar 00 3
���e\ � @ sV d dl mZmZmZ d dlZejd dkZejd dkZerDefZ ne
fZ dd� Z dS )� )�absolute_import�division�print_functionN� � c s& G � �fdd�d��}t j|df i �S )z/
Create a base class with a metaclass.
c s e Zd Z� �fdd�ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )N� )�cls�nameZ
this_bases�d)�bases�metar � /usr/lib/python3.6/_compat.py�__new__ s z)with_metaclass.<locals>.metaclass.__new__N)�__name__�
__module__� __qualname__r r )r r r r
� metaclass s r Ztemporary_class)�typer )r r r r )r r r
�with_metaclass s r ) Z
__future__r r r �sys� version_infoZPY2ZPY3�strZ string_typesZ
basestringr r r r r
�<module> s pip/_vendor/packaging/__pycache__/utils.cpython-36.pyc 0000644 00000000630 14751155150 0016715 0 ustar 00 3
���e� � @ s2 d dl mZmZmZ d dlZejd�Zdd� ZdS )� )�absolute_import�division�print_functionNz[-_.]+c C s t jd| �j� S )N�-)�_canonicalize_regex�sub�lower)�name� r
�/usr/lib/python3.6/utils.py�canonicalize_name s r )Z
__future__r r r �re�compiler r r
r
r
r �<module> s
pip/_vendor/packaging/__pycache__/specifiers.cpython-36.opt-1.pyc 0000644 00000046437 14751155150 0020667 0 ustar 00 3
���eym � @ s� d dl mZmZmZ d dlZd dlZd dlZd dlZddlm Z m
Z
ddl m Z m
Z
mZ G dd� de�ZG dd � d e
eje��ZG d
d � d e�ZG d d
� d
e�Zdd� ZG dd� de�Zejd�Zdd� Zdd� ZG dd� de�Z dS )� )�absolute_import�division�print_functionN� )� string_types�with_metaclass)�Version�
LegacyVersion�parsec @ s e Zd ZdZdS )�InvalidSpecifierzH
An invalid specifier was found, users should refer to PEP 440.
N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/specifiers.pyr s r c @ s� e Zd Zejdd� �Zejdd� �Zejdd� �Zejdd� �Zej d d
� �Z
e
j d d
� �Z
ejdd
d��Z ejddd��Z
d S )�
BaseSpecifierc C s dS )z�
Returns the str representation of this Specifier like object. This
should be representative of the Specifier itself.
Nr )�selfr r r �__str__ s zBaseSpecifier.__str__c C s dS )zF
Returns a hash value for this Specifier like object.
Nr )r r r r �__hash__ s zBaseSpecifier.__hash__c C s dS )zq
Returns a boolean representing whether or not the two Specifier like
objects are equal.
Nr )r �otherr r r �__eq__$ s zBaseSpecifier.__eq__c C s dS )zu
Returns a boolean representing whether or not the two Specifier like
objects are not equal.
Nr )r r r r r �__ne__+ s zBaseSpecifier.__ne__c C s dS )zg
Returns whether or not pre-releases as a whole are allowed by this
specifier.
Nr )r r r r � prereleases2 s zBaseSpecifier.prereleasesc C s dS )zd
Sets whether or not pre-releases as a whole are allowed by this
specifier.
Nr )r �valuer r r r 9 s Nc C s dS )zR
Determines if the given item is contained within this specifier.
Nr )r �itemr r r r �contains@ s zBaseSpecifier.containsc C s dS )z�
Takes an iterable of items and filters them so that only items which
are contained within this specifier are allowed in it.
Nr )r �iterabler r r r �filterF s zBaseSpecifier.filter)N)N)r r
r �abc�abstractmethodr r r r �abstractpropertyr �setterr r r r r r r s r c @ s� e Zd Zi Zd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z e dd� �Z
e dd� �Ze dd� �Zejdd� �Zdd� Zd!d d �Zd"d d �ZdS )#�_IndividualSpecifier� Nc C sF | j j|�}|s tdj|���|jd�j� |jd�j� f| _|| _d S )NzInvalid specifier: '{0}'�operator�version)�_regex�searchr �format�group�strip�_spec� _prereleases)r �specr �matchr r r �__init__R s z _IndividualSpecifier.__init__c C s0 | j d k rdj| j�nd}dj| jjt| �|�S )Nz, prereleases={0!r}r$ z<{0}({1!r}{2})>)r- r) r � __class__r �str)r �prer r r �__repr___ s z _IndividualSpecifier.__repr__c C s dj | j� S )Nz{0}{1})r) r, )r r r r r l s z _IndividualSpecifier.__str__c C s
t | j�S )N)�hashr, )r r r r r o s z _IndividualSpecifier.__hash__c C sL t |t�r0y| j|�}W q@ tk
r, tS X nt || j�s@tS | j|jkS )N)�
isinstancer r1 r �NotImplementedr, )r r r r r r r s
z_IndividualSpecifier.__eq__c C sL t |t�r0y| j|�}W q@ tk
r, tS X nt || j�s@tS | j|jkS )N)r6 r r1 r r7 r, )r r r r r r } s
z_IndividualSpecifier.__ne__c C s t | dj| j| ��S )Nz _compare_{0})�getattrr) �
_operators)r �opr r r �
_get_operator� s z"_IndividualSpecifier._get_operatorc C s t |ttf�st|�}|S )N)r6 r r r
)r r& r r r �_coerce_version� s z$_IndividualSpecifier._coerce_versionc C s
| j d S )Nr )r, )r r r r r% � s z _IndividualSpecifier.operatorc C s
| j d S )Nr )r, )r r r r r& � s z _IndividualSpecifier.versionc C s | j S )N)r- )r r r r r � s z _IndividualSpecifier.prereleasesc C s
|| _ d S )N)r- )r r r r r r � s c C s
| j |�S )N)r )r r r r r � __contains__� s z!_IndividualSpecifier.__contains__c C s< |d kr| j }| j|�}|jr(| r(dS | j| j�|| j�S )NF)r r< �
is_prereleaser; r% r& )r r r r r r r � s
z _IndividualSpecifier.containsc c s� d}g }d|d k r|ndi}xL|D ]D}| j |�}| j|f|�r"|jr\|pL| j r\|j|� q"d}|V q"W | r�|r�x|D ]
}|V qzW d S )NFr T)r< r r> r �append)r r r Zyielded�found_prereleases�kwr& �parsed_versionr r r r � s
z_IndividualSpecifier.filter)r$ N)N)N)r r
r r9 r0 r4 r r r r r; r< �propertyr% r& r r" r= r r r r r r r# N s
r# c @ sv e Zd ZdZejde d ejejB �Zdddddd d
�Z d d � Z
d
d� Z dd� Z dd� Z
dd� Zdd� Zdd� ZdS )�LegacySpecifiera�
(?P<operator>(==|!=|<=|>=|<|>))
\s*
(?P<version>
[^,;\s)]* # Since this is a "legacy" specifier, and the version
# string can be just about anything, we match everything
# except for whitespace, a semi-colon for marker support,
# a closing paren since versions can be enclosed in
# them, and a comma since it's a version separator.
)
z^\s*z\s*$�equal� not_equal�less_than_equal�greater_than_equal� less_than� greater_than)z==z!=z<=z>=�<�>c C s t |t�stt|��}|S )N)r6 r r2 )r r& r r r r< � s
z LegacySpecifier._coerce_versionc C s || j |�kS )N)r< )r � prospectiver. r r r �_compare_equal� s z LegacySpecifier._compare_equalc C s || j |�kS )N)r< )r rM r. r r r �_compare_not_equal� s z"LegacySpecifier._compare_not_equalc C s || j |�kS )N)r< )r rM r. r r r �_compare_less_than_equal� s z(LegacySpecifier._compare_less_than_equalc C s || j |�kS )N)r< )r rM r. r r r �_compare_greater_than_equal s z+LegacySpecifier._compare_greater_than_equalc C s || j |�k S )N)r< )r rM r. r r r �_compare_less_than s z"LegacySpecifier._compare_less_thanc C s || j |�kS )N)r< )r rM r. r r r �_compare_greater_than s z%LegacySpecifier._compare_greater_thanN)r r
r �
_regex_str�re�compile�VERBOSE�
IGNORECASEr' r9 r< rN rO rP rQ rR rS r r r r rD � s
rD c s t j� �� fdd��}|S )Nc s t |t�sdS � | ||�S )NF)r6 r )r rM r. )�fnr r �wrapped s
z)_require_version_compare.<locals>.wrapped)� functools�wraps)rY rZ r )rY r �_require_version_compare
s r] c @ s� e Zd ZdZejde d ejejB �Zdddddd d
d d �Z e
d
d� �Z e
dd� �Z e
dd� �Z
e
dd� �Ze
dd� �Ze
dd� �Ze
dd� �Zdd � Zed d � �Zejd d � �Zd S )!� Specifiera
(?P<operator>(~=|==|!=|<=|>=|<|>|===))
(?P<version>
(?:
# The identity operators allow for an escape hatch that will
# do an exact string match of the version you wish to install.
# This will not be parsed by PEP 440 and we cannot determine
# any semantic meaning from it. This operator is discouraged
# but included entirely as an escape hatch.
(?<====) # Only match for the identity operator
\s*
[^\s]* # We just match everything, except for whitespace
# since we are only testing for strict identity.
)
|
(?:
# The (non)equality operators allow for wild card and local
# versions to be specified so we have to define these two
# operators separately to enable that.
(?<===|!=) # Only match for equals and not equals
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)* # release
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
# You cannot use a wild card and a dev or local version
# together so group them with a | and make them optional.
(?:
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
(?:\+[a-z0-9]+(?:[-_\.][a-z0-9]+)*)? # local
|
\.\* # Wild card syntax of .*
)?
)
|
(?:
# The compatible operator requires at least two digits in the
# release segment.
(?<=~=) # Only match for the compatible operator
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)+ # release (We have a + instead of a *)
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
)
|
(?:
# All other operators only allow a sub set of what the
# (non)equality operators do. Specifically they do not allow
# local versions to be specified nor do they allow the prefix
# matching wild cards.
(?<!==|!=|~=) # We have special cases for these
# operators so we want to make sure they
# don't match here.
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)* # release
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
)
)
z^\s*z\s*$Z
compatiblerE rF rG rH rI rJ Z arbitrary)z~=z==z!=z<=z>=rK rL z===c C sN dj ttjdd� t|���d d� �}|d7 }| jd�||�oL| jd�||�S ) N�.c S s | j d� o| j d� S )NZpostZdev)�
startswith)�xr r r �<lambda>� s z/Specifier._compare_compatible.<locals>.<lambda>r z.*z>=z==���)�join�list� itertools� takewhile�_version_splitr; )r rM r. �prefixr r r �_compare_compatible� s
z Specifier._compare_compatiblec C sp |j d�rPt|j�}t|d d� �}tt|��}|d t|�� }t||�\}}nt|�}|jsht|j�}||kS )Nz.*� ���)�endswithr Zpublicrh r2 �len� _pad_version�local)r rM r. r r r rN � s
zSpecifier._compare_equalc C s | j ||� S )N)rN )r rM r. r r r rO � s z Specifier._compare_not_equalc C s |t |�kS )N)r )r rM r. r r r rP � s z"Specifier._compare_less_than_equalc C s |t |�kS )N)r )r rM r. r r r rQ � s z%Specifier._compare_greater_than_equalc C s> t |�}||k sdS |j r:|jr:t |j�t |j�kr:dS dS )NFT)r r> � base_version)r rM r. r r r rR � s z Specifier._compare_less_thanc C s` t |�}||ksdS |j r:|jr:t |j�t |j�kr:dS |jd k r\t |j�t |j�kr\dS dS )NFT)r Zis_postreleaserq rp )r rM r. r r r rS � s
z Specifier._compare_greater_thanc C s t |�j� t |�j� kS )N)r2 �lower)r rM r. r r r �_compare_arbitrary s z Specifier._compare_arbitraryc C sR | j d k r| j S | j\}}|d
krN|dkr@|jd�r@|d d � }t|�jrNdS d S ) N�==�>=�<=�~=�===z.*rk TF)rt ru rv rw rx rl )r- r, rm r
r> )r r% r& r r r r s
zSpecifier.prereleasesc C s
|| _ d S )N)r- )r r r r r r s N)r r
r rT rU rV rW rX r' r9 r] rj rN rO rP rQ rR rS rs rC r r" r r r r r^ s* ^ # r^ z ^([0-9]+)((?:a|b|c|rc)[0-9]+)$c C sD g }x:| j d�D ],}tj|�}|r2|j|j� � q|j|� qW |S )Nr_ )�split�
_prefix_regexr( �extend�groupsr? )r& �resultr r/ r r r rh ' s
rh c C s� g g }}|j ttjdd� | ��� |j ttjdd� |��� |j | t|d �d � � |j |t|d �d � � |jddgtdt|d �t|d � � � |jddgtdt|d �t|d � � � ttj|� �ttj|� �fS )Nc S s | j � S )N)�isdigit)ra r r r rb 6 s z _pad_version.<locals>.<lambda>c S s | j � S )N)r~ )ra r r r rb 7 s r r �0)r? re rf rg rn �insert�max�chain)�left�rightZ
left_splitZ right_splitr r r ro 2 s
&& ro c @ s� e Zd Zd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z e dd� �Z
e
jdd� �Z
dd� Zd dd�Zd d d �ZdS )!� SpecifierSetr$ Nc C sr dd� |j d�D �}t� }xB|D ]:}y|jt|�� W q tk
rX |jt|�� Y q X q W t|�| _|| _d S )Nc S s g | ]}|j � r|j � �qS r )r+ )�.0�sr r r �
<listcomp>R s z)SpecifierSet.__init__.<locals>.<listcomp>�,) ry �set�addr^ r rD � frozenset�_specsr- )r Z
specifiersr Zparsed� specifierr r r r0 O s
zSpecifierSet.__init__c C s* | j d k rdj| j�nd}djt| �|�S )Nz, prereleases={0!r}r$ z<SpecifierSet({0!r}{1})>)r- r) r r2 )r r3 r r r r4 d s zSpecifierSet.__repr__c C s dj tdd� | jD ���S )Nr� c s s | ]}t |�V qd S )N)r2 )r� r� r r r � <genexpr>n s z'SpecifierSet.__str__.<locals>.<genexpr>)rd �sortedr� )r r r r r m s zSpecifierSet.__str__c C s
t | j�S )N)r5 r� )r r r r r p s zSpecifierSet.__hash__c C s� t |t�rt|�}nt |t�s"tS t� }t| j|jB �|_| jd krX|jd k rX|j|_n<| jd k rv|jd krv| j|_n | j|jkr�| j|_ntd��|S )NzFCannot combine SpecifierSets with True and False prerelease overrides.)r6 r r� r7 r� r� r- �
ValueError)r r r� r r r �__and__s s
zSpecifierSet.__and__c C sF t |t�rt|�}n&t |t�r,tt|��}nt |t�s:tS | j|jkS )N)r6 r r� r# r2 r7 r� )r r r r r r � s
zSpecifierSet.__eq__c C sF t |t�rt|�}n&t |t�r,tt|��}nt |t�s:tS | j|jkS )N)r6 r r� r# r2 r7 r� )r r r r r r � s
zSpecifierSet.__ne__c C s
t | j�S )N)rn r� )r r r r �__len__� s zSpecifierSet.__len__c C s
t | j�S )N)�iterr� )r r r r �__iter__� s zSpecifierSet.__iter__c C s. | j d k r| j S | jsd S tdd� | jD ��S )Nc s s | ] }|j V qd S )N)r )r� r� r r r r� � s z+SpecifierSet.prereleases.<locals>.<genexpr>)r- r� �any)r r r r r � s
zSpecifierSet.prereleasesc C s
|| _ d S )N)r- )r r r r r r � s c C s
| j |�S )N)r )r r r r r r= � s zSpecifierSet.__contains__c sN t � ttf�st� �� �d kr$| j�� r4� jr4dS t� �fdd�| jD ��S )NFc 3 s | ]}|j � �d �V qdS ))r N)r )r� r� )r r r r r� � s z(SpecifierSet.contains.<locals>.<genexpr>)r6 r r r
r r> �allr� )r r r r )r r r r � s zSpecifierSet.containsc C s� |d kr| j }| jr:x | jD ]}|j|t|�d�}q W |S g }g }xZ|D ]R}t|ttf�sdt|�}n|}t|t�rtqH|jr�| r�|s�|j |� qH|j |� qHW | r�|r�|d kr�|S |S d S )N)r )
r r� r �boolr6 r r r
r> r? )r r r r. Zfilteredr@ r rB r r r r � s*
zSpecifierSet.filter)r$ N)N)N)r r
r r0 r4 r r r� r r r� r� rC r r" r= r r r r r r r� M s
r� ) Z
__future__r r r r r[ rf rU Z_compatr r r& r r r
r� r �ABCMeta�objectr r# rD r] r^ rV rz rh ro r� r r r r �<module> s& 9 4
pip/_vendor/packaging/__pycache__/requirements.cpython-36.opt-1.pyc 0000644 00000007306 14751155150 0021246 0 ustar 00 3
���e� � @ sr d dl mZmZmZ d dlZd dlZd dlmZmZm Z m
Z
d dlm Z m Z m
Z
mZmZ d dlmZ d dlmZ ddlmZmZ dd lmZmZmZ G d
d � d e �Z e ej ej �Z ed �j!� Z"ed
�j!� Z#ed�j!� Z$ed�j!� Z%ed�j!� Z&ed�j!� Z'ed�j!� Z(e d�Z)e e e)�e B Z*ee e e*� �Z+e+d�Z,e+Z-ed�d�Z.e(e. Z/e-e e&e- � Z0e"e
e0� e# d�Z1eej2ej3ej4B �Z5eej2ej3ej4B �Z6e5e6A Z7ee7e e&e7 � ddd�d�Z8e
e$e8 e% e8B �Z9e9j:dd � � e e9�d �Z;e;j:d d � � e e� �d �Zej:d d � � e'Z<e<e Z=e;e
e=� Z>e/e
e=� Z?e,e
e1� e?e>B Z@ee@ e ZAG d!d"� d"eB�ZCdS )#� )�absolute_import�division�print_functionN)� stringStart� stringEnd�originalTextFor�ParseException)�
ZeroOrMore�Word�Optional�Regex�Combine)�Literal)�parse� )� MARKER_EXPR�Marker)�LegacySpecifier� Specifier� SpecifierSetc @ s e Zd ZdZdS )�InvalidRequirementzJ
An invalid requirement was found, users should refer to PEP 508.
N)�__name__�
__module__� __qualname__�__doc__� r r �"/usr/lib/python3.6/requirements.pyr s r �[�]�(�)�,�;�@z-_.�namez[^ ]+�url�extrasF)Z
joinStringZadjacent� _raw_specc C s
|j pdS )N� )r' )�s�l�tr r r �<lambda>8 s r, � specifierc C s |d S )Nr r )r) r* r+ r r r r, ; s �markerc C s t | |j|j� �S )N)r Z_original_startZ
_original_end)r) r* r+ r r r r, ? s c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � Requirementz�Parse a requirement.
Parse a given requirement string into its parts, such as name, specifier,
URL, and extras. Raises InvalidRequirement on a badly-formed requirement
string.
c C s� yt j|�}W n@ tk
rN } z$tdj||j|jd � ���W Y d d }~X nX |j| _|jr�tj|j�}|j ot|j
s�|j r�|j
r�td��|j| _nd | _t |j r�|j j
� ng �| _ t|j�| _|jr�|jnd | _d S )Nz+Invalid requirement, parse error at "{0!r}"� zInvalid URL given)� REQUIREMENTZ parseStringr r �format�locr$ r% �urlparse�schemeZnetloc�setr& ZasListr r- r. )�selfZrequirement_stringZreq�eZ
parsed_urlr r r �__init__Z s" *
zRequirement.__init__c C sz | j g}| jr*|jdjdjt| j���� | jr@|jt| j�� | jrX|jdj| j�� | j rp|jdj| j �� dj|�S )Nz[{0}]r! z@ {0}z; {0}r( )
r$ r& �appendr2 �join�sortedr- �strr% r. )r7 �partsr r r �__str__o s zRequirement.__str__c C s dj t| ��S )Nz<Requirement({0!r})>)r2 r= )r7 r r r �__repr__� s zRequirement.__repr__N)r r r r r9 r? r@ r r r r r/ M s r/ )DZ
__future__r r r �string�reZpip._vendor.pyparsingr r r r r r
r r r
r �LZ pip._vendor.six.moves.urllibr r4 Zmarkersr r Z
specifiersr r r �
ValueErrorr Z
ascii_lettersZdigitsZALPHANUM�suppressZLBRACKETZRBRACKETZLPARENZRPAREN�COMMAZ SEMICOLON�ATZ PUNCTUATIONZIDENTIFIER_ENDZ
IDENTIFIER�NAMEZEXTRAZURIZURLZ EXTRAS_LISTZEXTRASZ
_regex_str�VERBOSE�
IGNORECASEZVERSION_PEP440ZVERSION_LEGACYZ VERSION_ONEZ VERSION_MANYZ
_VERSION_SPECZsetParseActionZ VERSION_SPECZMARKER_SEPERATORZMARKERZVERSION_AND_MARKERZURL_AND_MARKERZNAMED_REQUIREMENTr1 �objectr/ r r r r �<module> sZ
pip/_vendor/packaging/__pycache__/_structures.cpython-36.pyc 0000644 00000005335 14751155150 0020146 0 ustar 00 3
���e� � @ sD d dl mZmZmZ G dd� de�Ze� ZG dd� de�Ze� ZdS )� )�absolute_import�division�print_functionc @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )�Infinityc C s dS )Nr � )�selfr r �!/usr/lib/python3.6/_structures.py�__repr__ s zInfinity.__repr__c C s t t| ��S )N)�hash�repr)r r r r �__hash__ s zInfinity.__hash__c C s dS )NFr )r �otherr r r �__lt__ s zInfinity.__lt__c C s dS )NFr )r r
r r r �__le__ s zInfinity.__le__c C s t || j�S )N)�
isinstance� __class__)r r
r r r �__eq__ s zInfinity.__eq__c C s t || j� S )N)r r )r r
r r r �__ne__ s zInfinity.__ne__c C s dS )NTr )r r
r r r �__gt__ s zInfinity.__gt__c C s dS )NTr )r r
r r r �__ge__ s zInfinity.__ge__c C s t S )N)�NegativeInfinity)r r r r �__neg__! s zInfinity.__neg__N) �__name__�
__module__� __qualname__r r r r r r r r r r r r r r s r c @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )r c C s dS )Nz -Infinityr )r r r r r ) s zNegativeInfinity.__repr__c C s t t| ��S )N)r
r )r r r r r , s zNegativeInfinity.__hash__c C s dS )NTr )r r
r r r r / s zNegativeInfinity.__lt__c C s dS )NTr )r r
r r r r 2 s zNegativeInfinity.__le__c C s t || j�S )N)r r )r r
r r r r 5 s zNegativeInfinity.__eq__c C s t || j� S )N)r r )r r
r r r r 8 s zNegativeInfinity.__ne__c C s dS )NFr )r r
r r r r ; s zNegativeInfinity.__gt__c C s dS )NFr )r r
r r r r > s zNegativeInfinity.__ge__c C s t S )N)r )r r r r r A s zNegativeInfinity.__neg__N) r r r r r r r r r r r r r r r r r ' s r N)Z
__future__r r r �objectr r r r r r �<module> s pip/_vendor/packaging/__pycache__/_compat.cpython-36.pyc 0000644 00000001634 14751155150 0017204 0 ustar 00 3
���e\ � @ sV d dl mZmZmZ d dlZejd dkZejd dkZerDefZ ne
fZ dd� Z dS )� )�absolute_import�division�print_functionN� � c s& G � �fdd�d��}t j|df i �S )z/
Create a base class with a metaclass.
c s e Zd Z� �fdd�ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )N� )�cls�nameZ
this_bases�d)�bases�metar � /usr/lib/python3.6/_compat.py�__new__ s z)with_metaclass.<locals>.metaclass.__new__N)�__name__�
__module__� __qualname__r r )r r r r
� metaclass s r Ztemporary_class)�typer )r r r r )r r r
�with_metaclass s r ) Z
__future__r r r �sys� version_infoZPY2ZPY3�strZ string_typesZ
basestringr r r r r
�<module> s pip/_vendor/packaging/__pycache__/requirements.cpython-36.pyc 0000644 00000007306 14751155150 0020307 0 ustar 00 3
���e� � @ sr d dl mZmZmZ d dlZd dlZd dlmZmZm Z m
Z
d dlm Z m Z m
Z
mZmZ d dlmZ d dlmZ ddlmZmZ dd lmZmZmZ G d
d � d e �Z e ej ej �Z ed �j!� Z"ed
�j!� Z#ed�j!� Z$ed�j!� Z%ed�j!� Z&ed�j!� Z'ed�j!� Z(e d�Z)e e e)�e B Z*ee e e*� �Z+e+d�Z,e+Z-ed�d�Z.e(e. Z/e-e e&e- � Z0e"e
e0� e# d�Z1eej2ej3ej4B �Z5eej2ej3ej4B �Z6e5e6A Z7ee7e e&e7 � ddd�d�Z8e
e$e8 e% e8B �Z9e9j:dd � � e e9�d �Z;e;j:d d � � e e� �d �Zej:d d � � e'Z<e<e Z=e;e
e=� Z>e/e
e=� Z?e,e
e1� e?e>B Z@ee@ e ZAG d!d"� d"eB�ZCdS )#� )�absolute_import�division�print_functionN)� stringStart� stringEnd�originalTextFor�ParseException)�
ZeroOrMore�Word�Optional�Regex�Combine)�Literal)�parse� )� MARKER_EXPR�Marker)�LegacySpecifier� Specifier� SpecifierSetc @ s e Zd ZdZdS )�InvalidRequirementzJ
An invalid requirement was found, users should refer to PEP 508.
N)�__name__�
__module__� __qualname__�__doc__� r r �"/usr/lib/python3.6/requirements.pyr s r �[�]�(�)�,�;�@z-_.�namez[^ ]+�url�extrasF)Z
joinStringZadjacent� _raw_specc C s
|j pdS )N� )r' )�s�l�tr r r �<lambda>8 s r, � specifierc C s |d S )Nr r )r) r* r+ r r r r, ; s �markerc C s t | |j|j� �S )N)r Z_original_startZ
_original_end)r) r* r+ r r r r, ? s c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � Requirementz�Parse a requirement.
Parse a given requirement string into its parts, such as name, specifier,
URL, and extras. Raises InvalidRequirement on a badly-formed requirement
string.
c C s� yt j|�}W n@ tk
rN } z$tdj||j|jd � ���W Y d d }~X nX |j| _|jr�tj|j�}|j ot|j
s�|j r�|j
r�td��|j| _nd | _t |j r�|j j
� ng �| _ t|j�| _|jr�|jnd | _d S )Nz+Invalid requirement, parse error at "{0!r}"� zInvalid URL given)� REQUIREMENTZ parseStringr r �format�locr$ r% �urlparse�schemeZnetloc�setr& ZasListr r- r. )�selfZrequirement_stringZreq�eZ
parsed_urlr r r �__init__Z s" *
zRequirement.__init__c C sz | j g}| jr*|jdjdjt| j���� | jr@|jt| j�� | jrX|jdj| j�� | j rp|jdj| j �� dj|�S )Nz[{0}]r! z@ {0}z; {0}r( )
r$ r& �appendr2 �join�sortedr- �strr% r. )r7 �partsr r r �__str__o s zRequirement.__str__c C s dj t| ��S )Nz<Requirement({0!r})>)r2 r= )r7 r r r �__repr__� s zRequirement.__repr__N)r r r r r9 r? r@ r r r r r/ M s r/ )DZ
__future__r r r �string�reZpip._vendor.pyparsingr r r r r r
r r r
r �LZ pip._vendor.six.moves.urllibr r4 Zmarkersr r Z
specifiersr r r �
ValueErrorr Z
ascii_lettersZdigitsZALPHANUM�suppressZLBRACKETZRBRACKETZLPARENZRPAREN�COMMAZ SEMICOLON�ATZ PUNCTUATIONZIDENTIFIER_ENDZ
IDENTIFIER�NAMEZEXTRAZURIZURLZ EXTRAS_LISTZEXTRASZ
_regex_str�VERBOSE�
IGNORECASEZVERSION_PEP440ZVERSION_LEGACYZ VERSION_ONEZ VERSION_MANYZ
_VERSION_SPECZsetParseActionZ VERSION_SPECZMARKER_SEPERATORZMARKERZVERSION_AND_MARKERZURL_AND_MARKERZNAMED_REQUIREMENTr1 �objectr/ r r r r �<module> sZ
pip/_vendor/packaging/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000735 14751155150 0020261 0 ustar 00 3
���e � @ sT d dl mZmZmZ ddlmZmZmZmZm Z m
Z
m Z m Z dddddd d
d gZ
d S )
� )�absolute_import�division�print_function� )�
__author__�
__copyright__� __email__� __license__� __summary__� __title__�__uri__� __version__r r
r r
r r r r N)Z
__future__r r r � __about__r r r r r
r r r
�__all__� r r � /usr/lib/python3.6/__init__.py�<module> s (
pip/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc 0000644 00000046437 14751155150 0017730 0 ustar 00 3
���eym � @ s� d dl mZmZmZ d dlZd dlZd dlZd dlZddlm Z m
Z
ddl m Z m
Z
mZ G dd� de�ZG dd � d e
eje��ZG d
d � d e�ZG d d
� d
e�Zdd� ZG dd� de�Zejd�Zdd� Zdd� ZG dd� de�Z dS )� )�absolute_import�division�print_functionN� )� string_types�with_metaclass)�Version�
LegacyVersion�parsec @ s e Zd ZdZdS )�InvalidSpecifierzH
An invalid specifier was found, users should refer to PEP 440.
N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/specifiers.pyr s r c @ s� e Zd Zejdd� �Zejdd� �Zejdd� �Zejdd� �Zej d d
� �Z
e
j d d
� �Z
ejdd
d��Z ejddd��Z
d S )�
BaseSpecifierc C s dS )z�
Returns the str representation of this Specifier like object. This
should be representative of the Specifier itself.
Nr )�selfr r r �__str__ s zBaseSpecifier.__str__c C s dS )zF
Returns a hash value for this Specifier like object.
Nr )r r r r �__hash__ s zBaseSpecifier.__hash__c C s dS )zq
Returns a boolean representing whether or not the two Specifier like
objects are equal.
Nr )r �otherr r r �__eq__$ s zBaseSpecifier.__eq__c C s dS )zu
Returns a boolean representing whether or not the two Specifier like
objects are not equal.
Nr )r r r r r �__ne__+ s zBaseSpecifier.__ne__c C s dS )zg
Returns whether or not pre-releases as a whole are allowed by this
specifier.
Nr )r r r r � prereleases2 s zBaseSpecifier.prereleasesc C s dS )zd
Sets whether or not pre-releases as a whole are allowed by this
specifier.
Nr )r �valuer r r r 9 s Nc C s dS )zR
Determines if the given item is contained within this specifier.
Nr )r �itemr r r r �contains@ s zBaseSpecifier.containsc C s dS )z�
Takes an iterable of items and filters them so that only items which
are contained within this specifier are allowed in it.
Nr )r �iterabler r r r �filterF s zBaseSpecifier.filter)N)N)r r
r �abc�abstractmethodr r r r �abstractpropertyr �setterr r r r r r r s r c @ s� e Zd Zi Zd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z e dd� �Z
e dd� �Ze dd� �Zejdd� �Zdd� Zd!d d �Zd"d d �ZdS )#�_IndividualSpecifier� Nc C sF | j j|�}|s tdj|���|jd�j� |jd�j� f| _|| _d S )NzInvalid specifier: '{0}'�operator�version)�_regex�searchr �format�group�strip�_spec� _prereleases)r �specr �matchr r r �__init__R s z _IndividualSpecifier.__init__c C s0 | j d k rdj| j�nd}dj| jjt| �|�S )Nz, prereleases={0!r}r$ z<{0}({1!r}{2})>)r- r) r � __class__r �str)r �prer r r �__repr___ s z _IndividualSpecifier.__repr__c C s dj | j� S )Nz{0}{1})r) r, )r r r r r l s z _IndividualSpecifier.__str__c C s
t | j�S )N)�hashr, )r r r r r o s z _IndividualSpecifier.__hash__c C sL t |t�r0y| j|�}W q@ tk
r, tS X nt || j�s@tS | j|jkS )N)�
isinstancer r1 r �NotImplementedr, )r r r r r r r s
z_IndividualSpecifier.__eq__c C sL t |t�r0y| j|�}W q@ tk
r, tS X nt || j�s@tS | j|jkS )N)r6 r r1 r r7 r, )r r r r r r } s
z_IndividualSpecifier.__ne__c C s t | dj| j| ��S )Nz _compare_{0})�getattrr) �
_operators)r �opr r r �
_get_operator� s z"_IndividualSpecifier._get_operatorc C s t |ttf�st|�}|S )N)r6 r r r
)r r& r r r �_coerce_version� s z$_IndividualSpecifier._coerce_versionc C s
| j d S )Nr )r, )r r r r r% � s z _IndividualSpecifier.operatorc C s
| j d S )Nr )r, )r r r r r& � s z _IndividualSpecifier.versionc C s | j S )N)r- )r r r r r � s z _IndividualSpecifier.prereleasesc C s
|| _ d S )N)r- )r r r r r r � s c C s
| j |�S )N)r )r r r r r � __contains__� s z!_IndividualSpecifier.__contains__c C s< |d kr| j }| j|�}|jr(| r(dS | j| j�|| j�S )NF)r r< �
is_prereleaser; r% r& )r r r r r r r � s
z _IndividualSpecifier.containsc c s� d}g }d|d k r|ndi}xL|D ]D}| j |�}| j|f|�r"|jr\|pL| j r\|j|� q"d}|V q"W | r�|r�x|D ]
}|V qzW d S )NFr T)r< r r> r �append)r r r Zyielded�found_prereleases�kwr& �parsed_versionr r r r � s
z_IndividualSpecifier.filter)r$ N)N)N)r r
r r9 r0 r4 r r r r r; r< �propertyr% r& r r" r= r r r r r r r# N s
r# c @ sv e Zd ZdZejde d ejejB �Zdddddd d
�Z d d � Z
d
d� Z dd� Z dd� Z
dd� Zdd� Zdd� ZdS )�LegacySpecifiera�
(?P<operator>(==|!=|<=|>=|<|>))
\s*
(?P<version>
[^,;\s)]* # Since this is a "legacy" specifier, and the version
# string can be just about anything, we match everything
# except for whitespace, a semi-colon for marker support,
# a closing paren since versions can be enclosed in
# them, and a comma since it's a version separator.
)
z^\s*z\s*$�equal� not_equal�less_than_equal�greater_than_equal� less_than� greater_than)z==z!=z<=z>=�<�>c C s t |t�stt|��}|S )N)r6 r r2 )r r& r r r r< � s
z LegacySpecifier._coerce_versionc C s || j |�kS )N)r< )r � prospectiver. r r r �_compare_equal� s z LegacySpecifier._compare_equalc C s || j |�kS )N)r< )r rM r. r r r �_compare_not_equal� s z"LegacySpecifier._compare_not_equalc C s || j |�kS )N)r< )r rM r. r r r �_compare_less_than_equal� s z(LegacySpecifier._compare_less_than_equalc C s || j |�kS )N)r< )r rM r. r r r �_compare_greater_than_equal s z+LegacySpecifier._compare_greater_than_equalc C s || j |�k S )N)r< )r rM r. r r r �_compare_less_than s z"LegacySpecifier._compare_less_thanc C s || j |�kS )N)r< )r rM r. r r r �_compare_greater_than s z%LegacySpecifier._compare_greater_thanN)r r
r �
_regex_str�re�compile�VERBOSE�
IGNORECASEr' r9 r< rN rO rP rQ rR rS r r r r rD � s
rD c s t j� �� fdd��}|S )Nc s t |t�sdS � | ||�S )NF)r6 r )r rM r. )�fnr r �wrapped s
z)_require_version_compare.<locals>.wrapped)� functools�wraps)rY rZ r )rY r �_require_version_compare
s r] c @ s� e Zd ZdZejde d ejejB �Zdddddd d
d d �Z e
d
d� �Z e
dd� �Z e
dd� �Z
e
dd� �Ze
dd� �Ze
dd� �Ze
dd� �Zdd � Zed d � �Zejd d � �Zd S )!� Specifiera
(?P<operator>(~=|==|!=|<=|>=|<|>|===))
(?P<version>
(?:
# The identity operators allow for an escape hatch that will
# do an exact string match of the version you wish to install.
# This will not be parsed by PEP 440 and we cannot determine
# any semantic meaning from it. This operator is discouraged
# but included entirely as an escape hatch.
(?<====) # Only match for the identity operator
\s*
[^\s]* # We just match everything, except for whitespace
# since we are only testing for strict identity.
)
|
(?:
# The (non)equality operators allow for wild card and local
# versions to be specified so we have to define these two
# operators separately to enable that.
(?<===|!=) # Only match for equals and not equals
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)* # release
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
# You cannot use a wild card and a dev or local version
# together so group them with a | and make them optional.
(?:
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
(?:\+[a-z0-9]+(?:[-_\.][a-z0-9]+)*)? # local
|
\.\* # Wild card syntax of .*
)?
)
|
(?:
# The compatible operator requires at least two digits in the
# release segment.
(?<=~=) # Only match for the compatible operator
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)+ # release (We have a + instead of a *)
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
)
|
(?:
# All other operators only allow a sub set of what the
# (non)equality operators do. Specifically they do not allow
# local versions to be specified nor do they allow the prefix
# matching wild cards.
(?<!==|!=|~=) # We have special cases for these
# operators so we want to make sure they
# don't match here.
\s*
v?
(?:[0-9]+!)? # epoch
[0-9]+(?:\.[0-9]+)* # release
(?: # pre release
[-_\.]?
(a|b|c|rc|alpha|beta|pre|preview)
[-_\.]?
[0-9]*
)?
(?: # post release
(?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
)?
(?:[-_\.]?dev[-_\.]?[0-9]*)? # dev release
)
)
z^\s*z\s*$Z
compatiblerE rF rG rH rI rJ Z arbitrary)z~=z==z!=z<=z>=rK rL z===c C sN dj ttjdd� t|���d d� �}|d7 }| jd�||�oL| jd�||�S ) N�.c S s | j d� o| j d� S )NZpostZdev)�
startswith)�xr r r �<lambda>� s z/Specifier._compare_compatible.<locals>.<lambda>r z.*z>=z==���)�join�list� itertools� takewhile�_version_splitr; )r rM r. �prefixr r r �_compare_compatible� s
z Specifier._compare_compatiblec C sp |j d�rPt|j�}t|d d� �}tt|��}|d t|�� }t||�\}}nt|�}|jsht|j�}||kS )Nz.*� ���)�endswithr Zpublicrh r2 �len� _pad_version�local)r rM r. r r r rN � s
zSpecifier._compare_equalc C s | j ||� S )N)rN )r rM r. r r r rO � s z Specifier._compare_not_equalc C s |t |�kS )N)r )r rM r. r r r rP � s z"Specifier._compare_less_than_equalc C s |t |�kS )N)r )r rM r. r r r rQ � s z%Specifier._compare_greater_than_equalc C s> t |�}||k sdS |j r:|jr:t |j�t |j�kr:dS dS )NFT)r r> � base_version)r rM r. r r r rR � s z Specifier._compare_less_thanc C s` t |�}||ksdS |j r:|jr:t |j�t |j�kr:dS |jd k r\t |j�t |j�kr\dS dS )NFT)r Zis_postreleaserq rp )r rM r. r r r rS � s
z Specifier._compare_greater_thanc C s t |�j� t |�j� kS )N)r2 �lower)r rM r. r r r �_compare_arbitrary s z Specifier._compare_arbitraryc C sR | j d k r| j S | j\}}|d
krN|dkr@|jd�r@|d d � }t|�jrNdS d S ) N�==�>=�<=�~=�===z.*rk TF)rt ru rv rw rx rl )r- r, rm r
r> )r r% r& r r r r s
zSpecifier.prereleasesc C s
|| _ d S )N)r- )r r r r r r s N)r r
r rT rU rV rW rX r' r9 r] rj rN rO rP rQ rR rS rs rC r r" r r r r r^ s* ^ # r^ z ^([0-9]+)((?:a|b|c|rc)[0-9]+)$c C sD g }x:| j d�D ],}tj|�}|r2|j|j� � q|j|� qW |S )Nr_ )�split�
_prefix_regexr( �extend�groupsr? )r& �resultr r/ r r r rh ' s
rh c C s� g g }}|j ttjdd� | ��� |j ttjdd� |��� |j | t|d �d � � |j |t|d �d � � |jddgtdt|d �t|d � � � |jddgtdt|d �t|d � � � ttj|� �ttj|� �fS )Nc S s | j � S )N)�isdigit)ra r r r rb 6 s z _pad_version.<locals>.<lambda>c S s | j � S )N)r~ )ra r r r rb 7 s r r �0)r? re rf rg rn �insert�max�chain)�left�rightZ
left_splitZ right_splitr r r ro 2 s
&& ro c @ s� e Zd Zd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z e dd� �Z
e
jdd� �Z
dd� Zd dd�Zd d d �ZdS )!� SpecifierSetr$ Nc C sr dd� |j d�D �}t� }xB|D ]:}y|jt|�� W q tk
rX |jt|�� Y q X q W t|�| _|| _d S )Nc S s g | ]}|j � r|j � �qS r )r+ )�.0�sr r r �
<listcomp>R s z)SpecifierSet.__init__.<locals>.<listcomp>�,) ry �set�addr^ r rD � frozenset�_specsr- )r Z
specifiersr Zparsed� specifierr r r r0 O s
zSpecifierSet.__init__c C s* | j d k rdj| j�nd}djt| �|�S )Nz, prereleases={0!r}r$ z<SpecifierSet({0!r}{1})>)r- r) r r2 )r r3 r r r r4 d s zSpecifierSet.__repr__c C s dj tdd� | jD ���S )Nr� c s s | ]}t |�V qd S )N)r2 )r� r� r r r � <genexpr>n s z'SpecifierSet.__str__.<locals>.<genexpr>)rd �sortedr� )r r r r r m s zSpecifierSet.__str__c C s
t | j�S )N)r5 r� )r r r r r p s zSpecifierSet.__hash__c C s� t |t�rt|�}nt |t�s"tS t� }t| j|jB �|_| jd krX|jd k rX|j|_n<| jd k rv|jd krv| j|_n | j|jkr�| j|_ntd��|S )NzFCannot combine SpecifierSets with True and False prerelease overrides.)r6 r r� r7 r� r� r- �
ValueError)r r r� r r r �__and__s s
zSpecifierSet.__and__c C sF t |t�rt|�}n&t |t�r,tt|��}nt |t�s:tS | j|jkS )N)r6 r r� r# r2 r7 r� )r r r r r r � s
zSpecifierSet.__eq__c C sF t |t�rt|�}n&t |t�r,tt|��}nt |t�s:tS | j|jkS )N)r6 r r� r# r2 r7 r� )r r r r r r � s
zSpecifierSet.__ne__c C s
t | j�S )N)rn r� )r r r r �__len__� s zSpecifierSet.__len__c C s
t | j�S )N)�iterr� )r r r r �__iter__� s zSpecifierSet.__iter__c C s. | j d k r| j S | jsd S tdd� | jD ��S )Nc s s | ] }|j V qd S )N)r )r� r� r r r r� � s z+SpecifierSet.prereleases.<locals>.<genexpr>)r- r� �any)r r r r r � s
zSpecifierSet.prereleasesc C s
|| _ d S )N)r- )r r r r r r � s c C s
| j |�S )N)r )r r r r r r= � s zSpecifierSet.__contains__c sN t � ttf�st� �� �d kr$| j�� r4� jr4dS t� �fdd�| jD ��S )NFc 3 s | ]}|j � �d �V qdS ))r N)r )r� r� )r r r r r� � s z(SpecifierSet.contains.<locals>.<genexpr>)r6 r r r
r r> �allr� )r r r r )r r r r � s zSpecifierSet.containsc C s� |d kr| j }| jr:x | jD ]}|j|t|�d�}q W |S g }g }xZ|D ]R}t|ttf�sdt|�}n|}t|t�rtqH|jr�| r�|s�|j |� qH|j |� qHW | r�|r�|d kr�|S |S d S )N)r )
r r� r �boolr6 r r r
r> r? )r r r r. Zfilteredr@ r rB r r r r � s*
zSpecifierSet.filter)r$ N)N)N)r r
r r0 r4 r r r� r r r� r� rC r r" r= r r r r r r r� M s
r� ) Z
__future__r r r r r[ rf rU Z_compatr r r& r r r
r� r �ABCMeta�objectr r# rD r] r^ rV rz rh ro r� r r r r �<module> s& 9 4
pip/_vendor/packaging/__pycache__/markers.cpython-36.opt-1.pyc 0000644 00000020761 14751155150 0020167 0 ustar 00 3
���e& � @ s@ d dl mZmZmZ d dlZd dlZd dlZd dlZd dlm Z m
Z
m Z m Z d dlm
Z
mZmZmZ d dlmZ ddlmZ ddlmZmZ d d
d d d
gZG dd � d e�ZG dd
� d
e�ZG dd � d e�Z G dd� de �Z G dd� de �Z G dd� de �Z G dd� de �Z!ed�ed�B ed�B ed �B ed �B ed �B ed �B ed �B ed!�B ed"�B ed#�B ed$�B ed%�B ed&�B ed'�B ed(�B ed)�B ed*�B Z"d#d"d d ddd+�Z#e"j$d,d-� � ed.�ed/�B ed0�B ed1�B ed2�B ed3�B ed4�B ed5�B Z%e%ed6�B ed7�B Z&e&j$d8d-� � ed9�ed:�B Z'e'j$d;d-� � ed<�ed=�B Z(e"e'B Z)ee)e& e) �Z*e*j$d>d-� � ed?�j+� Z,ed@�j+� Z-e� Z.e*ee,e. e- �B Z/e.e/e
e(e. � > e e. e Z0dAdB� Z1dSdDdE�Z2dFd-� dGd-� ej3ej4ej5ej6ej7ej8dH�Z9dIdJ� Z:e � Z;dKdL� Z<dMdN� Z=dOdP� Z>dQd
� Z?G dRd � d e �Z@dS )T� )�absolute_import�division�print_functionN)�ParseException� ParseResults� stringStart� stringEnd)�
ZeroOrMore�Group�Forward� QuotedString)�Literal� )� string_types)� Specifier�InvalidSpecifier�
InvalidMarker�UndefinedComparison�UndefinedEnvironmentName�Marker�default_environmentc @ s e Zd ZdZdS )r zE
An invalid marker was found, users should refer to PEP 508.
N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/markers.pyr s c @ s e Zd ZdZdS )r zP
An invalid operation was attempted on a value that doesn't support it.
N)r r r r r r r r r ! s c @ s e Zd ZdZdS )r z\
A name was attempted to be used that does not exist inside of the
environment.
N)r r r r r r r r r ' s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�Nodec C s
|| _ d S )N)�value)�selfr r r r �__init__0 s z
Node.__init__c C s
t | j�S )N)�strr )r r r r �__str__3 s z Node.__str__c C s dj | jjt| ��S )Nz <{0}({1!r})>)�format� __class__r r! )r r r r �__repr__6 s z
Node.__repr__c C s t �d S )N)�NotImplementedError)r r r r � serialize9 s zNode.serializeN)r r r r r" r% r' r r r r r . s r c @ s e Zd Zdd� ZdS )�Variablec C s t | �S )N)r! )r r r r r' ? s zVariable.serializeN)r r r r' r r r r r( = s r( c @ s e Zd Zdd� ZdS )�Valuec C s
dj | �S )Nz"{0}")r# )r r r r r' E s zValue.serializeN)r r r r' r r r r r) C s r) c @ s e Zd Zdd� ZdS )�Opc C s t | �S )N)r! )r r r r r' K s z Op.serializeN)r r r r' r r r r r* I s r* �implementation_version� platform_python_implementation�implementation_name�python_full_version�platform_release�platform_version�platform_machine�platform_system�python_version� sys_platform�os_namezos.namez sys.platformzplatform.versionzplatform.machinez platform.python_implementation�python_implementationZextra)zos.namez sys.platformzplatform.versionzplatform.machinez platform.python_implementationr6 c C s t tj|d |d ��S )Nr )r( �ALIASES�get)�s�l�tr r r �<lambda>k s r< z===z==z>=z<=z!=z~=�>�<znot in�inc C s t |d �S )Nr )r* )r9 r: r; r r r r< y s �'�"c C s t |d �S )Nr )r) )r9 r: r; r r r r< | s �and�orc C s t |d �S )Nr )�tuple)r9 r: r; r r r r< � s �(�)c C s t | t�rdd� | D �S | S d S )Nc S s g | ] }t |��qS r )�_coerce_parse_result)�.0�ir r r �
<listcomp>� s z(_coerce_parse_result.<locals>.<listcomp>)�
isinstancer )�resultsr r r rG � s
rG Tc C s� t | t�r4t| �dkr4t | d ttf�r4t| d �S t | t�rndd� | D �}|rZdj|�S ddj|� d S n"t | t�r�djdd � | D ��S | S d S )
Nr r c s s | ]}t |d d�V qdS )F)�firstN)�_format_marker)rH �mr r r � <genexpr>� s z!_format_marker.<locals>.<genexpr>� rE rF c S s g | ] }|j � �qS r )r' )rH rO r r r rJ � s z"_format_marker.<locals>.<listcomp>)rK �list�lenrD rN �join)�markerrM �innerr r r rN � s
rN c C s | |kS )Nr )�lhs�rhsr r r r< � s c C s | |kS )Nr )rW rX r r r r< � s )r? znot inr> z<=z==z!=z>=r= c
C sl yt dj|j� |g��}W n tk
r. Y n X |j| �S tj|j� �}|d krbtdj|| |���|| |�S )N� z#Undefined {0!r} on {1!r} and {2!r}.) r rT r' r �contains�
_operatorsr8 r r# )rW �oprX �specZoperr r r �_eval_op� s
r^ c C s& | j |t�}|tkr"tdj|���|S )Nz/{0!r} does not exist in evaluation environment.)r8 �
_undefinedr r# )� environment�namer r r r �_get_env� s
rb c C s� g g}x�| D ]�}t |t�r0|d jt||�� q t |t�r�|\}}}t |t�rbt||j�}|j}n|j}t||j�}|d jt|||�� q |dkr |jg � q W t dd� |D ��S )Nr rC c s s | ]}t |�V qd S )N)�all)rH �itemr r r rP � s z$_evaluate_markers.<locals>.<genexpr>���re )
rK rR �append�_evaluate_markersrD r( rb r r^ �any) Zmarkersr` �groupsrU rW r\ rX Z lhs_valueZ rhs_valuer r r rg � s
rg c C s2 dj | �}| j}|dkr.||d t| j� 7 }|S )Nz {0.major}.{0.minor}.{0.micro}�finalr )r# � releaselevelr! �serial)�info�versionZkindr r r �format_full_version� s
ro c C sl t td�r ttjj�} tjj}nd} d}|| tjtj� tj � tj
� tj� tj � tj � tj � d d� tjd� S )N�implementation�0rY � ) r- r+ r5 r1 r/ r2 r0 r. r, r3 r4 )
�hasattr�sysro rp rn ra �os�platform�machine�release�systemr3 r6 )Ziverr- r r r r � s
c @ s. e Zd Zdd� Zdd� Zdd� Zd
dd �ZdS ) r c C s` yt tj|��| _W nF tk
rZ } z*dj|||j|jd � �}t|��W Y d d }~X nX d S )Nz+Invalid marker: {0!r}, parse error at {1!r}� )rG �MARKERZ parseString�_markersr r# �locr )r rU �eZerr_strr r r r s zMarker.__init__c C s
t | j�S )N)rN r| )r r r r r" s zMarker.__str__c C s dj t| ��S )Nz<Marker({0!r})>)r# r! )r r r r r% s zMarker.__repr__Nc C s$ t � }|dk r|j|� t| j|�S )a$ Evaluate a marker.
Return the boolean from evaluating the given marker against the
environment. environment is an optional argument to override all or
part of the determined environment.
The environment is determined from the current Python process.
N)r �updaterg r| )r r` Zcurrent_environmentr r r �evaluate" s
zMarker.evaluate)N)r r r r r" r% r� r r r r r s )T)AZ
__future__r r r �operatorru rv rt Zpip._vendor.pyparsingr r r r r r
r r r
�LZ_compatr Z
specifiersr r �__all__�
ValueErrorr r r �objectr r( r) r* ZVARIABLEr7 ZsetParseActionZ VERSION_CMPZ MARKER_OPZ MARKER_VALUEZBOOLOPZ
MARKER_VARZ MARKER_ITEM�suppressZLPARENZRPARENZ MARKER_EXPRZ MARKER_ATOMr{ rG rN �lt�le�eq�ne�ge�gtr[ r^ r_ rb rg ro r r r r r r �<module> sx �
6
pip/_vendor/packaging/__pycache__/__about__.cpython-36.pyc 0000644 00000001177 14751155150 0017472 0 ustar 00 3
���e� � @ sP d dl mZmZmZ dddddddd gZd
Zd Zd Zd
ZdZ dZ
dZ de Z dS )� )�absolute_import�division�print_function� __title__� __summary__�__uri__� __version__�
__author__� __email__� __license__�
__copyright__Z packagingz"Core utilities for Python packagesz!https://github.com/pypa/packagingz16.8z)Donald Stufft and individual contributorszdonald@stufft.ioz"BSD or Apache License, Version 2.0zCopyright 2014-2016 %sN)
Z
__future__r r r �__all__r r r r r r
r r � r r � /usr/lib/python3.6/__about__.py�<module> s
pip/_vendor/packaging/__pycache__/version.cpython-36.pyc 0000644 00000024426 14751155150 0017253 0 ustar 00 3
���e$- � @ s� d dl mZmZmZ d dlZd dlZd dlZddlmZ ddddd gZ ej
d
d d d
dddg�Z dd� Z G dd� de
�ZG dd� de�ZG dd� de�Zejdej�Zdddddd�Zdd � Zd d � Zd ZG d d� de�Zd!d"� Zejd#�Zd$d%� Z d&d'� Z dS )(� )�absolute_import�division�print_functionN� )�Infinity�parse�Version�
LegacyVersion�InvalidVersion�VERSION_PATTERN�_Version�epoch�release�dev�pre�post�localc C s& yt | �S tk
r t| �S X dS )z�
Parse the given version string and return either a :class:`Version` object
or a :class:`LegacyVersion` object depending on if the given version is
a valid PEP 440 version or a legacy version.
N)r r
r )�version� r � /usr/lib/python3.6/version.pyr s c @ s e Zd ZdZdS )r
zF
An invalid version was found, users should refer to PEP 440.
N)�__name__�
__module__� __qualname__�__doc__r r r r r
$ s c @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )� _BaseVersionc C s
t | j�S )N)�hash�_key)�selfr r r �__hash__, s z_BaseVersion.__hash__c C s | j |dd� �S )Nc S s | |k S )Nr )�s�or r r �<lambda>0 s z%_BaseVersion.__lt__.<locals>.<lambda>)�_compare)r �otherr r r �__lt__/ s z_BaseVersion.__lt__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! 3 s z%_BaseVersion.__le__.<locals>.<lambda>)r" )r r# r r r �__le__2 s z_BaseVersion.__le__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! 6 s z%_BaseVersion.__eq__.<locals>.<lambda>)r" )r r# r r r �__eq__5 s z_BaseVersion.__eq__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! 9 s z%_BaseVersion.__ge__.<locals>.<lambda>)r" )r r# r r r �__ge__8 s z_BaseVersion.__ge__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! < s z%_BaseVersion.__gt__.<locals>.<lambda>)r" )r r# r r r �__gt__; s z_BaseVersion.__gt__c C s | j |dd� �S )Nc S s | |kS )Nr )r r r r r r! ? s z%_BaseVersion.__ne__.<locals>.<lambda>)r" )r r# r r r �__ne__> s z_BaseVersion.__ne__c C s t |t�stS || j|j�S )N)�
isinstancer �NotImplementedr )r r# �methodr r r r" A s
z_BaseVersion._compareN) r r r r r$ r% r& r' r( r) r" r r r r r * s r c @ s` e Zd Zdd� Zdd� Zdd� Zedd� �Zed d
� �Zed d � �Z ed
d� �Z
edd� �Z dS )r c C s t |�| _t| j�| _d S )N)�str�_version�_legacy_cmpkeyr )r r r r r �__init__J s
zLegacyVersion.__init__c C s | j S )N)r. )r r r r �__str__N s zLegacyVersion.__str__c C s dj tt| ���S )Nz<LegacyVersion({0})>)�format�reprr- )r r r r �__repr__Q s zLegacyVersion.__repr__c C s | j S )N)r. )r r r r �publicT s zLegacyVersion.publicc C s | j S )N)r. )r r r r � base_versionX s zLegacyVersion.base_versionc C s d S )Nr )r r r r r \ s zLegacyVersion.localc C s dS )NFr )r r r r �
is_prerelease` s zLegacyVersion.is_prereleasec C s dS )NFr )r r r r �is_postreleased s z LegacyVersion.is_postreleaseN) r r r r0 r1 r4 �propertyr5 r6 r r7 r8 r r r r r H s z(\d+ | [a-z]+ | \.| -)�czfinal-�@)r �preview�-�rcr c c sb xVt j| �D ]H}tj||�}| s |dkr,q |d d� dkrJ|jd�V q d| V q W dV d S )N�.r �
0123456789� �*z*final)� _legacy_version_component_re�split� _legacy_version_replacement_map�get�zfill)r �partr r r �_parse_version_partsr s rI c C s� d}g }xlt | j� �D ]\}|jd�rh|dk rJx |rH|d dkrH|j� q.W x |rf|d dkrf|j� qLW |j|� qW t|�}||fS ) Nr rB z*finalz*final-Z00000000���rJ rJ )rI �lower�
startswith�pop�append�tuple)r r
�partsrH r r r r/ � s
r/ a�
v?
(?:
(?:(?P<epoch>[0-9]+)!)? # epoch
(?P<release>[0-9]+(?:\.[0-9]+)*) # release segment
(?P<pre> # pre-release
[-_\.]?
(?P<pre_l>(a|b|c|rc|alpha|beta|pre|preview))
[-_\.]?
(?P<pre_n>[0-9]+)?
)?
(?P<post> # post release
(?:-(?P<post_n1>[0-9]+))
|
(?:
[-_\.]?
(?P<post_l>post|rev|r)
[-_\.]?
(?P<post_n2>[0-9]+)?
)
)?
(?P<dev> # dev release
[-_\.]?
(?P<dev_l>dev)
[-_\.]?
(?P<dev_n>[0-9]+)?
)?
)
(?:\+(?P<local>[a-z0-9]+(?:[-_\.][a-z0-9]+)*))? # local version
c @ s| e Zd Zejde d ejejB �Zdd� Z dd� Z
dd� Z e d d
� �Z
e d d � �Ze d
d� �Ze dd� �Ze dd� �ZdS )r z^\s*z\s*$c C s� | j j|�}|s tdj|���t|jd�r8t|jd��ndtdd� |jd�jd�D ��t |jd�|jd ��t |jd
�|jd �p�|jd ��t |jd
�|jd��t
|jd��d�| _ t | j j
| j j| j j| j j| j j| j j�| _d S )NzInvalid version: '{0}'r
r c s s | ]}t |�V qd S )N)�int)�.0�ir r r � <genexpr>� s z#Version.__init__.<locals>.<genexpr>r r? Zpre_lZpre_nZpost_lZpost_n1Zpost_n2Zdev_lZdev_nr )r
r r r r r )�_regex�searchr
r2 r �grouprQ rO rD �_parse_letter_version�_parse_local_versionr. �_cmpkeyr
r r r r r r )r r �matchr r r r0 � s.
zVersion.__init__c C s dj tt| ���S )Nz<Version({0})>)r2 r3 r- )r r r r r4 � s zVersion.__repr__c C s� g }| j jdkr$|jdj| j j�� |jdjdd� | j jD ��� | j jd k rl|jdjdd� | j jD ��� | j jd k r�|jdj| j jd �� | j jd k r�|jd
j| j jd �� | j j d k r�|jd jdjd d� | j j D ���� dj|�S )
Nr z{0}!r? c s s | ]}t |�V qd S )N)r- )rR �xr r r rT � s z"Version.__str__.<locals>.<genexpr>� c s s | ]}t |�V qd S )N)r- )rR r\ r r r rT � s z.post{0}r z.dev{0}z+{0}c s s | ]}t |�V qd S )N)r- )rR r\ r r r rT s )
r. r
rN r2 �joinr r r r r )r rP r r r r1 � s zVersion.__str__c C s t | �jdd�d S )N�+r r )r- rD )r r r r r5
s zVersion.publicc C sL g }| j jdkr$|jdj| j j�� |jdjdd� | j jD ��� dj|�S )Nr z{0}!r? c s s | ]}t |�V qd S )N)r- )rR r\ r r r rT s z'Version.base_version.<locals>.<genexpr>r] )r. r
rN r2 r^ r )r rP r r r r6 s
zVersion.base_versionc C s$ t | �}d|kr |jdd�d S d S )Nr_ r )r- rD )r Zversion_stringr r r r s z
Version.localc C s t | jjp| jj�S )N)�boolr. r r )r r r r r7 ! s zVersion.is_prereleasec C s t | jj�S )N)r` r. r )r r r r r8 % s zVersion.is_postreleaseN)r r r �re�compiler �VERBOSE�
IGNORECASErU r0 r4 r1 r9 r5 r6 r r7 r8 r r r r r � s
#
c C sx | rZ|d krd}| j � } | dkr&d} n(| dkr4d} n| d
krBd } n | dkrNd } | t|�fS | rt|rtd } | t|�fS d S )Nr Zalpha�aZbeta�br: r r< r> �rev�rr )r: r r< )rg rh )rK rQ )ZletterZnumberr r r rX * s
rX z[\._-]c C s$ | dk r t dd� tj| �D ��S dS )zR
Takes a string like abc.1.twelve and turns it into ("abc", 1, "twelve").
Nc s s& | ] }|j � s|j� nt|�V qd S )N)�isdigitrK rQ )rR rH r r r rT R s z'_parse_local_version.<locals>.<genexpr>)rO �_local_version_seperatorsrD )r r r r rY L s rY c C s� t tttjdd� t|�����}|d kr@|d kr@|d k r@t }n |d krLt}|d krZt }|d krft}|d krvt }nt dd� |D ��}| |||||fS )Nc S s | dkS )Nr r )r\ r r r r! ` s z_cmpkey.<locals>.<lambda>c s s* | ]"}t |t�r|d fnt |fV qdS )r] N)r* rQ r )rR rS r r r rT � s z_cmpkey.<locals>.<genexpr>)rO �reversed�list� itertools� dropwhiler )r
r r r r r r r r rZ W s&
rZ ) Z
__future__r r r � collectionsrm ra Z _structuresr �__all__�
namedtupler r �
ValueErrorr
�objectr r rb rc rC rE rI r/ r r rX rj rY rZ r r r r �<module> s. !
9k
pip/_vendor/packaging/_structures.py 0000644 00000002610 14751155150 0013653 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
class Infinity(object):
def __repr__(self):
return "Infinity"
def __hash__(self):
return hash(repr(self))
def __lt__(self, other):
return False
def __le__(self, other):
return False
def __eq__(self, other):
return isinstance(other, self.__class__)
def __ne__(self, other):
return not isinstance(other, self.__class__)
def __gt__(self, other):
return True
def __ge__(self, other):
return True
def __neg__(self):
return NegativeInfinity
Infinity = Infinity()
class NegativeInfinity(object):
def __repr__(self):
return "-Infinity"
def __hash__(self):
return hash(repr(self))
def __lt__(self, other):
return True
def __le__(self, other):
return True
def __eq__(self, other):
return isinstance(other, self.__class__)
def __ne__(self, other):
return not isinstance(other, self.__class__)
def __gt__(self, other):
return False
def __ge__(self, other):
return False
def __neg__(self):
return Infinity
NegativeInfinity = NegativeInfinity()
pip/_vendor/packaging/__about__.py 0000644 00000001320 14751155150 0013174 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
__all__ = [
"__title__", "__summary__", "__uri__", "__version__", "__author__",
"__email__", "__license__", "__copyright__",
]
__title__ = "packaging"
__summary__ = "Core utilities for Python packages"
__uri__ = "https://github.com/pypa/packaging"
__version__ = "16.8"
__author__ = "Donald Stufft and individual contributors"
__email__ = "donald@stufft.io"
__license__ = "BSD or Apache License, Version 2.0"
__copyright__ = "Copyright 2014-2016 %s" % __author__
pip/_vendor/packaging/utils.py 0000644 00000000645 14751155150 0012437 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
import re
_canonicalize_regex = re.compile(r"[-_.]+")
def canonicalize_name(name):
# This is taken from PEP 503.
return _canonicalize_regex.sub("-", name).lower()
pip/_vendor/packaging/_compat.py 0000644 00000001534 14751155150 0012717 0 ustar 00 # This file is dual licensed under the terms of the Apache License, Version
# 2.0, and the BSD License. See the LICENSE file in the root of this repository
# for complete details.
from __future__ import absolute_import, division, print_function
import sys
PY2 = sys.version_info[0] == 2
PY3 = sys.version_info[0] == 3
# flake8: noqa
if PY3:
string_types = str,
else:
string_types = basestring,
def with_metaclass(meta, *bases):
"""
Create a base class with a metaclass.
"""
# This requires a bit of explanation: the basic idea is to make a dummy
# metaclass for one level of class instantiation that replaces itself with
# the actual metaclass.
class metaclass(meta):
def __new__(cls, name, this_bases, d):
return meta(name, bases, d)
return type.__new__(metaclass, 'temporary_class', (), {})
pip/_vendor/urllib3/poolmanager.py 0000644 00000040664 14751155150 0013240 0 ustar 00 from __future__ import absolute_import
import collections
import functools
import logging
from ._collections import RecentlyUsedContainer
from .connectionpool import HTTPConnectionPool, HTTPSConnectionPool
from .connectionpool import port_by_scheme
from .exceptions import LocationValueError, MaxRetryError, ProxySchemeUnknown
from .packages.six.moves.urllib.parse import urljoin
from .request import RequestMethods
from .util.url import parse_url
from .util.retry import Retry
__all__ = ['PoolManager', 'ProxyManager', 'proxy_from_url']
log = logging.getLogger(__name__)
SSL_KEYWORDS = ('key_file', 'cert_file', 'cert_reqs', 'ca_certs',
'ssl_version', 'ca_cert_dir', 'ssl_context')
# All known keyword arguments that could be provided to the pool manager, its
# pools, or the underlying connections. This is used to construct a pool key.
_key_fields = (
'key_scheme', # str
'key_host', # str
'key_port', # int
'key_timeout', # int or float or Timeout
'key_retries', # int or Retry
'key_strict', # bool
'key_block', # bool
'key_source_address', # str
'key_key_file', # str
'key_cert_file', # str
'key_cert_reqs', # str
'key_ca_certs', # str
'key_ssl_version', # str
'key_ca_cert_dir', # str
'key_ssl_context', # instance of ssl.SSLContext or urllib3.util.ssl_.SSLContext
'key_maxsize', # int
'key_headers', # dict
'key__proxy', # parsed proxy url
'key__proxy_headers', # dict
'key_socket_options', # list of (level (int), optname (int), value (int or str)) tuples
'key__socks_options', # dict
'key_assert_hostname', # bool or string
'key_assert_fingerprint', # str
)
#: The namedtuple class used to construct keys for the connection pool.
#: All custom key schemes should include the fields in this key at a minimum.
PoolKey = collections.namedtuple('PoolKey', _key_fields)
def _default_key_normalizer(key_class, request_context):
"""
Create a pool key out of a request context dictionary.
According to RFC 3986, both the scheme and host are case-insensitive.
Therefore, this function normalizes both before constructing the pool
key for an HTTPS request. If you wish to change this behaviour, provide
alternate callables to ``key_fn_by_scheme``.
:param key_class:
The class to use when constructing the key. This should be a namedtuple
with the ``scheme`` and ``host`` keys at a minimum.
:type key_class: namedtuple
:param request_context:
A dictionary-like object that contain the context for a request.
:type request_context: dict
:return: A namedtuple that can be used as a connection pool key.
:rtype: PoolKey
"""
# Since we mutate the dictionary, make a copy first
context = request_context.copy()
context['scheme'] = context['scheme'].lower()
context['host'] = context['host'].lower()
# These are both dictionaries and need to be transformed into frozensets
for key in ('headers', '_proxy_headers', '_socks_options'):
if key in context and context[key] is not None:
context[key] = frozenset(context[key].items())
# The socket_options key may be a list and needs to be transformed into a
# tuple.
socket_opts = context.get('socket_options')
if socket_opts is not None:
context['socket_options'] = tuple(socket_opts)
# Map the kwargs to the names in the namedtuple - this is necessary since
# namedtuples can't have fields starting with '_'.
for key in list(context.keys()):
context['key_' + key] = context.pop(key)
# Default to ``None`` for keys missing from the context
for field in key_class._fields:
if field not in context:
context[field] = None
return key_class(**context)
#: A dictionary that maps a scheme to a callable that creates a pool key.
#: This can be used to alter the way pool keys are constructed, if desired.
#: Each PoolManager makes a copy of this dictionary so they can be configured
#: globally here, or individually on the instance.
key_fn_by_scheme = {
'http': functools.partial(_default_key_normalizer, PoolKey),
'https': functools.partial(_default_key_normalizer, PoolKey),
}
pool_classes_by_scheme = {
'http': HTTPConnectionPool,
'https': HTTPSConnectionPool,
}
class PoolManager(RequestMethods):
"""
Allows for arbitrary requests while transparently keeping track of
necessary connection pools for you.
:param num_pools:
Number of connection pools to cache before discarding the least
recently used pool.
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
:param \\**connection_pool_kw:
Additional parameters are used to create fresh
:class:`urllib3.connectionpool.ConnectionPool` instances.
Example::
>>> manager = PoolManager(num_pools=2)
>>> r = manager.request('GET', 'http://google.com/')
>>> r = manager.request('GET', 'http://google.com/mail')
>>> r = manager.request('GET', 'http://yahoo.com/')
>>> len(manager.pools)
2
"""
proxy = None
def __init__(self, num_pools=10, headers=None, **connection_pool_kw):
RequestMethods.__init__(self, headers)
self.connection_pool_kw = connection_pool_kw
self.pools = RecentlyUsedContainer(num_pools,
dispose_func=lambda p: p.close())
# Locally set the pool classes and keys so other PoolManagers can
# override them.
self.pool_classes_by_scheme = pool_classes_by_scheme
self.key_fn_by_scheme = key_fn_by_scheme.copy()
def __enter__(self):
return self
def __exit__(self, exc_type, exc_val, exc_tb):
self.clear()
# Return False to re-raise any potential exceptions
return False
def _new_pool(self, scheme, host, port, request_context=None):
"""
Create a new :class:`ConnectionPool` based on host, port, scheme, and
any additional pool keyword arguments.
If ``request_context`` is provided, it is provided as keyword arguments
to the pool class used. This method is used to actually create the
connection pools handed out by :meth:`connection_from_url` and
companion methods. It is intended to be overridden for customization.
"""
pool_cls = self.pool_classes_by_scheme[scheme]
if request_context is None:
request_context = self.connection_pool_kw.copy()
# Although the context has everything necessary to create the pool,
# this function has historically only used the scheme, host, and port
# in the positional args. When an API change is acceptable these can
# be removed.
for key in ('scheme', 'host', 'port'):
request_context.pop(key, None)
if scheme == 'http':
for kw in SSL_KEYWORDS:
request_context.pop(kw, None)
return pool_cls(host, port, **request_context)
def clear(self):
"""
Empty our store of pools and direct them all to close.
This will not affect in-flight connections, but they will not be
re-used after completion.
"""
self.pools.clear()
def connection_from_host(self, host, port=None, scheme='http', pool_kwargs=None):
"""
Get a :class:`ConnectionPool` based on the host, port, and scheme.
If ``port`` isn't given, it will be derived from the ``scheme`` using
``urllib3.connectionpool.port_by_scheme``. If ``pool_kwargs`` is
provided, it is merged with the instance's ``connection_pool_kw``
variable and used to create the new connection pool, if one is
needed.
"""
if not host:
raise LocationValueError("No host specified.")
request_context = self._merge_pool_kwargs(pool_kwargs)
request_context['scheme'] = scheme or 'http'
if not port:
port = port_by_scheme.get(request_context['scheme'].lower(), 80)
request_context['port'] = port
request_context['host'] = host
return self.connection_from_context(request_context)
def connection_from_context(self, request_context):
"""
Get a :class:`ConnectionPool` based on the request context.
``request_context`` must at least contain the ``scheme`` key and its
value must be a key in ``key_fn_by_scheme`` instance variable.
"""
scheme = request_context['scheme'].lower()
pool_key_constructor = self.key_fn_by_scheme[scheme]
pool_key = pool_key_constructor(request_context)
return self.connection_from_pool_key(pool_key, request_context=request_context)
def connection_from_pool_key(self, pool_key, request_context=None):
"""
Get a :class:`ConnectionPool` based on the provided pool key.
``pool_key`` should be a namedtuple that only contains immutable
objects. At a minimum it must have the ``scheme``, ``host``, and
``port`` fields.
"""
with self.pools.lock:
# If the scheme, host, or port doesn't match existing open
# connections, open a new ConnectionPool.
pool = self.pools.get(pool_key)
if pool:
return pool
# Make a fresh ConnectionPool of the desired type
scheme = request_context['scheme']
host = request_context['host']
port = request_context['port']
pool = self._new_pool(scheme, host, port, request_context=request_context)
self.pools[pool_key] = pool
return pool
def connection_from_url(self, url, pool_kwargs=None):
"""
Similar to :func:`urllib3.connectionpool.connection_from_url`.
If ``pool_kwargs`` is not provided and a new pool needs to be
constructed, ``self.connection_pool_kw`` is used to initialize
the :class:`urllib3.connectionpool.ConnectionPool`. If ``pool_kwargs``
is provided, it is used instead. Note that if a new pool does not
need to be created for the request, the provided ``pool_kwargs`` are
not used.
"""
u = parse_url(url)
return self.connection_from_host(u.host, port=u.port, scheme=u.scheme,
pool_kwargs=pool_kwargs)
def _merge_pool_kwargs(self, override):
"""
Merge a dictionary of override values for self.connection_pool_kw.
This does not modify self.connection_pool_kw and returns a new dict.
Any keys in the override dictionary with a value of ``None`` are
removed from the merged dictionary.
"""
base_pool_kwargs = self.connection_pool_kw.copy()
if override:
for key, value in override.items():
if value is None:
try:
del base_pool_kwargs[key]
except KeyError:
pass
else:
base_pool_kwargs[key] = value
return base_pool_kwargs
def urlopen(self, method, url, redirect=True, **kw):
"""
Same as :meth:`urllib3.connectionpool.HTTPConnectionPool.urlopen`
with custom cross-host redirect logic and only sends the request-uri
portion of the ``url``.
The given ``url`` parameter must be absolute, such that an appropriate
:class:`urllib3.connectionpool.ConnectionPool` can be chosen for it.
"""
u = parse_url(url)
conn = self.connection_from_host(u.host, port=u.port, scheme=u.scheme)
kw['assert_same_host'] = False
kw['redirect'] = False
if 'headers' not in kw:
kw['headers'] = self.headers.copy()
if self.proxy is not None and u.scheme == "http":
response = conn.urlopen(method, url, **kw)
else:
response = conn.urlopen(method, u.request_uri, **kw)
redirect_location = redirect and response.get_redirect_location()
if not redirect_location:
return response
# Support relative URLs for redirecting.
redirect_location = urljoin(url, redirect_location)
# RFC 7231, Section 6.4.4
if response.status == 303:
method = 'GET'
retries = kw.get('retries')
if not isinstance(retries, Retry):
retries = Retry.from_int(retries, redirect=redirect)
# Strip headers marked as unsafe to forward to the redirected location.
# Check remove_headers_on_redirect to avoid a potential network call within
# conn.is_same_host() which may use socket.gethostbyname() in the future.
if (retries.remove_headers_on_redirect
and not conn.is_same_host(redirect_location)):
for header in retries.remove_headers_on_redirect:
kw['headers'].pop(header, None)
try:
retries = retries.increment(method, url, response=response, _pool=conn)
except MaxRetryError:
if retries.raise_on_redirect:
raise
return response
kw['retries'] = retries
kw['redirect'] = redirect
log.info("Redirecting %s -> %s", url, redirect_location)
return self.urlopen(method, redirect_location, **kw)
class ProxyManager(PoolManager):
"""
Behaves just like :class:`PoolManager`, but sends all requests through
the defined proxy, using the CONNECT method for HTTPS URLs.
:param proxy_url:
The URL of the proxy to be used.
:param proxy_headers:
A dictionary contaning headers that will be sent to the proxy. In case
of HTTP they are being sent with each request, while in the
HTTPS/CONNECT case they are sent only once. Could be used for proxy
authentication.
Example:
>>> proxy = urllib3.ProxyManager('http://localhost:3128/')
>>> r1 = proxy.request('GET', 'http://google.com/')
>>> r2 = proxy.request('GET', 'http://httpbin.org/')
>>> len(proxy.pools)
1
>>> r3 = proxy.request('GET', 'https://httpbin.org/')
>>> r4 = proxy.request('GET', 'https://twitter.com/')
>>> len(proxy.pools)
3
"""
def __init__(self, proxy_url, num_pools=10, headers=None,
proxy_headers=None, **connection_pool_kw):
if isinstance(proxy_url, HTTPConnectionPool):
proxy_url = '%s://%s:%i' % (proxy_url.scheme, proxy_url.host,
proxy_url.port)
proxy = parse_url(proxy_url)
if not proxy.port:
port = port_by_scheme.get(proxy.scheme, 80)
proxy = proxy._replace(port=port)
if proxy.scheme not in ("http", "https"):
raise ProxySchemeUnknown(proxy.scheme)
self.proxy = proxy
self.proxy_headers = proxy_headers or {}
connection_pool_kw['_proxy'] = self.proxy
connection_pool_kw['_proxy_headers'] = self.proxy_headers
super(ProxyManager, self).__init__(
num_pools, headers, **connection_pool_kw)
def connection_from_host(self, host, port=None, scheme='http', pool_kwargs=None):
if scheme == "https":
return super(ProxyManager, self).connection_from_host(
host, port, scheme, pool_kwargs=pool_kwargs)
return super(ProxyManager, self).connection_from_host(
self.proxy.host, self.proxy.port, self.proxy.scheme, pool_kwargs=pool_kwargs)
def _set_proxy_headers(self, url, headers=None):
"""
Sets headers needed by proxies: specifically, the Accept and Host
headers. Only sets headers not provided by the user.
"""
headers_ = {'Accept': '*/*'}
netloc = parse_url(url).netloc
if netloc:
headers_['Host'] = netloc
if headers:
headers_.update(headers)
return headers_
def urlopen(self, method, url, redirect=True, **kw):
"Same as HTTP(S)ConnectionPool.urlopen, ``url`` must be absolute."
u = parse_url(url)
if u.scheme == "http":
# For proxied HTTPS requests, httplib sets the necessary headers
# on the CONNECT to the proxy. For HTTP, we'll definitely
# need to set 'Host' at the very least.
headers = kw.get('headers', self.headers)
kw['headers'] = self._set_proxy_headers(url, headers)
return super(ProxyManager, self).urlopen(method, url, redirect=redirect, **kw)
def proxy_from_url(url, **kw):
return ProxyManager(proxy_url=url, **kw)
pip/_vendor/urllib3/_collections.py 0000644 00000023734 14751155150 0013410 0 ustar 00 from __future__ import absolute_import
from collections import Mapping, MutableMapping
try:
from threading import RLock
except ImportError: # Platform-specific: No threads available
class RLock:
def __enter__(self):
pass
def __exit__(self, exc_type, exc_value, traceback):
pass
try: # Python 2.7+
from collections import OrderedDict
except ImportError:
from .packages.ordered_dict import OrderedDict
from .packages.six import iterkeys, itervalues, PY3
__all__ = ['RecentlyUsedContainer', 'HTTPHeaderDict']
_Null = object()
class RecentlyUsedContainer(MutableMapping):
"""
Provides a thread-safe dict-like container which maintains up to
``maxsize`` keys while throwing away the least-recently-used keys beyond
``maxsize``.
:param maxsize:
Maximum number of recent elements to retain.
:param dispose_func:
Every time an item is evicted from the container,
``dispose_func(value)`` is called. Callback which will get called
"""
ContainerCls = OrderedDict
def __init__(self, maxsize=10, dispose_func=None):
self._maxsize = maxsize
self.dispose_func = dispose_func
self._container = self.ContainerCls()
self.lock = RLock()
def __getitem__(self, key):
# Re-insert the item, moving it to the end of the eviction line.
with self.lock:
item = self._container.pop(key)
self._container[key] = item
return item
def __setitem__(self, key, value):
evicted_value = _Null
with self.lock:
# Possibly evict the existing value of 'key'
evicted_value = self._container.get(key, _Null)
self._container[key] = value
# If we didn't evict an existing value, we might have to evict the
# least recently used item from the beginning of the container.
if len(self._container) > self._maxsize:
_key, evicted_value = self._container.popitem(last=False)
if self.dispose_func and evicted_value is not _Null:
self.dispose_func(evicted_value)
def __delitem__(self, key):
with self.lock:
value = self._container.pop(key)
if self.dispose_func:
self.dispose_func(value)
def __len__(self):
with self.lock:
return len(self._container)
def __iter__(self):
raise NotImplementedError('Iteration over this class is unlikely to be threadsafe.')
def clear(self):
with self.lock:
# Copy pointers to all values, then wipe the mapping
values = list(itervalues(self._container))
self._container.clear()
if self.dispose_func:
for value in values:
self.dispose_func(value)
def keys(self):
with self.lock:
return list(iterkeys(self._container))
class HTTPHeaderDict(MutableMapping):
"""
:param headers:
An iterable of field-value pairs. Must not contain multiple field names
when compared case-insensitively.
:param kwargs:
Additional field-value pairs to pass in to ``dict.update``.
A ``dict`` like container for storing HTTP Headers.
Field names are stored and compared case-insensitively in compliance with
RFC 7230. Iteration provides the first case-sensitive key seen for each
case-insensitive pair.
Using ``__setitem__`` syntax overwrites fields that compare equal
case-insensitively in order to maintain ``dict``'s api. For fields that
compare equal, instead create a new ``HTTPHeaderDict`` and use ``.add``
in a loop.
If multiple fields that are equal case-insensitively are passed to the
constructor or ``.update``, the behavior is undefined and some will be
lost.
>>> headers = HTTPHeaderDict()
>>> headers.add('Set-Cookie', 'foo=bar')
>>> headers.add('set-cookie', 'baz=quxx')
>>> headers['content-length'] = '7'
>>> headers['SET-cookie']
'foo=bar, baz=quxx'
>>> headers['Content-Length']
'7'
"""
def __init__(self, headers=None, **kwargs):
super(HTTPHeaderDict, self).__init__()
self._container = OrderedDict()
if headers is not None:
if isinstance(headers, HTTPHeaderDict):
self._copy_from(headers)
else:
self.extend(headers)
if kwargs:
self.extend(kwargs)
def __setitem__(self, key, val):
self._container[key.lower()] = [key, val]
return self._container[key.lower()]
def __getitem__(self, key):
val = self._container[key.lower()]
return ', '.join(val[1:])
def __delitem__(self, key):
del self._container[key.lower()]
def __contains__(self, key):
return key.lower() in self._container
def __eq__(self, other):
if not isinstance(other, Mapping) and not hasattr(other, 'keys'):
return False
if not isinstance(other, type(self)):
other = type(self)(other)
return (dict((k.lower(), v) for k, v in self.itermerged()) ==
dict((k.lower(), v) for k, v in other.itermerged()))
def __ne__(self, other):
return not self.__eq__(other)
if not PY3: # Python 2
iterkeys = MutableMapping.iterkeys
itervalues = MutableMapping.itervalues
__marker = object()
def __len__(self):
return len(self._container)
def __iter__(self):
# Only provide the originally cased names
for vals in self._container.values():
yield vals[0]
def pop(self, key, default=__marker):
'''D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
'''
# Using the MutableMapping function directly fails due to the private marker.
# Using ordinary dict.pop would expose the internal structures.
# So let's reinvent the wheel.
try:
value = self[key]
except KeyError:
if default is self.__marker:
raise
return default
else:
del self[key]
return value
def discard(self, key):
try:
del self[key]
except KeyError:
pass
def add(self, key, val):
"""Adds a (name, value) pair, doesn't overwrite the value if it already
exists.
>>> headers = HTTPHeaderDict(foo='bar')
>>> headers.add('Foo', 'baz')
>>> headers['foo']
'bar, baz'
"""
key_lower = key.lower()
new_vals = [key, val]
# Keep the common case aka no item present as fast as possible
vals = self._container.setdefault(key_lower, new_vals)
if new_vals is not vals:
vals.append(val)
def extend(self, *args, **kwargs):
"""Generic import function for any type of header-like object.
Adapted version of MutableMapping.update in order to insert items
with self.add instead of self.__setitem__
"""
if len(args) > 1:
raise TypeError("extend() takes at most 1 positional "
"arguments ({0} given)".format(len(args)))
other = args[0] if len(args) >= 1 else ()
if isinstance(other, HTTPHeaderDict):
for key, val in other.iteritems():
self.add(key, val)
elif isinstance(other, Mapping):
for key in other:
self.add(key, other[key])
elif hasattr(other, "keys"):
for key in other.keys():
self.add(key, other[key])
else:
for key, value in other:
self.add(key, value)
for key, value in kwargs.items():
self.add(key, value)
def getlist(self, key, default=__marker):
"""Returns a list of all the values for the named field. Returns an
empty list if the key doesn't exist."""
try:
vals = self._container[key.lower()]
except KeyError:
if default is self.__marker:
return []
return default
else:
return vals[1:]
# Backwards compatibility for httplib
getheaders = getlist
getallmatchingheaders = getlist
iget = getlist
# Backwards compatibility for http.cookiejar
get_all = getlist
def __repr__(self):
return "%s(%s)" % (type(self).__name__, dict(self.itermerged()))
def _copy_from(self, other):
for key in other:
val = other.getlist(key)
if isinstance(val, list):
# Don't need to convert tuples
val = list(val)
self._container[key.lower()] = [key] + val
def copy(self):
clone = type(self)()
clone._copy_from(self)
return clone
def iteritems(self):
"""Iterate over all header lines, including duplicate ones."""
for key in self:
vals = self._container[key.lower()]
for val in vals[1:]:
yield vals[0], val
def itermerged(self):
"""Iterate over all headers, merging duplicate ones together."""
for key in self:
val = self._container[key.lower()]
yield val[0], ', '.join(val[1:])
def items(self):
return list(self.iteritems())
@classmethod
def from_httplib(cls, message): # Python 2
"""Read headers from a Python 2 httplib message object."""
# python2.7 does not expose a proper API for exporting multiheaders
# efficiently. This function re-reads raw lines from the message
# object and extracts the multiheaders properly.
headers = []
for line in message.headers:
if line.startswith((' ', '\t')):
key, value = headers[-1]
headers[-1] = (key, value + '\r\n' + line.rstrip())
continue
key, value = line.split(':', 1)
headers.append((key, value.strip()))
return cls(headers)
pip/_vendor/urllib3/__init__.py 0000644 00000005445 14751155150 0012471 0 ustar 00 """
urllib3 - Thread-safe connection pooling and re-using.
"""
from __future__ import absolute_import
import warnings
from .connectionpool import (
HTTPConnectionPool,
HTTPSConnectionPool,
connection_from_url
)
from . import exceptions
from .filepost import encode_multipart_formdata
from .poolmanager import PoolManager, ProxyManager, proxy_from_url
from .response import HTTPResponse
from .util.request import make_headers
from .util.url import get_host
from .util.timeout import Timeout
from .util.retry import Retry
# Set default logging handler to avoid "No handler found" warnings.
import logging
try: # Python 2.7+
from logging import NullHandler
except ImportError:
class NullHandler(logging.Handler):
def emit(self, record):
pass
__author__ = 'Andrey Petrov (andrey.petrov@shazow.net)'
__license__ = 'MIT'
__version__ = '1.22'
__all__ = (
'HTTPConnectionPool',
'HTTPSConnectionPool',
'PoolManager',
'ProxyManager',
'HTTPResponse',
'Retry',
'Timeout',
'add_stderr_logger',
'connection_from_url',
'disable_warnings',
'encode_multipart_formdata',
'get_host',
'make_headers',
'proxy_from_url',
)
logging.getLogger(__name__).addHandler(NullHandler())
def add_stderr_logger(level=logging.DEBUG):
"""
Helper for quickly adding a StreamHandler to the logger. Useful for
debugging.
Returns the handler after adding it.
"""
# This method needs to be in this __init__.py to get the __name__ correct
# even if urllib3 is vendored within another package.
logger = logging.getLogger(__name__)
handler = logging.StreamHandler()
handler.setFormatter(logging.Formatter('%(asctime)s %(levelname)s %(message)s'))
logger.addHandler(handler)
logger.setLevel(level)
logger.debug('Added a stderr logging handler to logger: %s', __name__)
return handler
# ... Clean up.
del NullHandler
# All warning filters *must* be appended unless you're really certain that they
# shouldn't be: otherwise, it's very hard for users to use most Python
# mechanisms to silence them.
# SecurityWarning's always go off by default.
warnings.simplefilter('always', exceptions.SecurityWarning, append=True)
# SubjectAltNameWarning's should go off once per host
warnings.simplefilter('default', exceptions.SubjectAltNameWarning, append=True)
# InsecurePlatformWarning's don't vary between requests, so we keep it default.
warnings.simplefilter('default', exceptions.InsecurePlatformWarning,
append=True)
# SNIMissingWarnings should go off only once.
warnings.simplefilter('default', exceptions.SNIMissingWarning, append=True)
def disable_warnings(category=exceptions.HTTPWarning):
"""
Helper for quickly disabling all urllib3 warnings.
"""
warnings.simplefilter('ignore', category)
pip/_vendor/urllib3/connection.py 0000644 00000031313 14751155150 0013062 0 ustar 00 from __future__ import absolute_import
import datetime
import logging
import os
import sys
import socket
from socket import error as SocketError, timeout as SocketTimeout
import warnings
from .packages import six
from .packages.six.moves.http_client import HTTPConnection as _HTTPConnection
from .packages.six.moves.http_client import HTTPException # noqa: F401
try: # Compiled with SSL?
import ssl
BaseSSLError = ssl.SSLError
except (ImportError, AttributeError): # Platform-specific: No SSL.
ssl = None
class BaseSSLError(BaseException):
pass
try: # Python 3:
# Not a no-op, we're adding this to the namespace so it can be imported.
ConnectionError = ConnectionError
except NameError: # Python 2:
class ConnectionError(Exception):
pass
from .exceptions import (
NewConnectionError,
ConnectTimeoutError,
SubjectAltNameWarning,
SystemTimeWarning,
)
from .packages.ssl_match_hostname import match_hostname, CertificateError
from .util.ssl_ import (
resolve_cert_reqs,
resolve_ssl_version,
assert_fingerprint,
create_urllib3_context,
ssl_wrap_socket
)
from .util import connection
from ._collections import HTTPHeaderDict
log = logging.getLogger(__name__)
port_by_scheme = {
'http': 80,
'https': 443,
}
# When updating RECENT_DATE, move it to
# within two years of the current date, and no
# earlier than 6 months ago.
RECENT_DATE = datetime.date(2016, 1, 1)
class DummyConnection(object):
"""Used to detect a failed ConnectionCls import."""
pass
class HTTPConnection(_HTTPConnection, object):
"""
Based on httplib.HTTPConnection but provides an extra constructor
backwards-compatibility layer between older and newer Pythons.
Additional keyword parameters are used to configure attributes of the connection.
Accepted parameters include:
- ``strict``: See the documentation on :class:`urllib3.connectionpool.HTTPConnectionPool`
- ``source_address``: Set the source address for the current connection.
.. note:: This is ignored for Python 2.6. It is only applied for 2.7 and 3.x
- ``socket_options``: Set specific options on the underlying socket. If not specified, then
defaults are loaded from ``HTTPConnection.default_socket_options`` which includes disabling
Nagle's algorithm (sets TCP_NODELAY to 1) unless the connection is behind a proxy.
For example, if you wish to enable TCP Keep Alive in addition to the defaults,
you might pass::
HTTPConnection.default_socket_options + [
(socket.SOL_SOCKET, socket.SO_KEEPALIVE, 1),
]
Or you may want to disable the defaults by passing an empty list (e.g., ``[]``).
"""
default_port = port_by_scheme['http']
#: Disable Nagle's algorithm by default.
#: ``[(socket.IPPROTO_TCP, socket.TCP_NODELAY, 1)]``
default_socket_options = [(socket.IPPROTO_TCP, socket.TCP_NODELAY, 1)]
#: Whether this connection verifies the host's certificate.
is_verified = False
def __init__(self, *args, **kw):
if six.PY3: # Python 3
kw.pop('strict', None)
# Pre-set source_address in case we have an older Python like 2.6.
self.source_address = kw.get('source_address')
if sys.version_info < (2, 7): # Python 2.6
# _HTTPConnection on Python 2.6 will balk at this keyword arg, but
# not newer versions. We can still use it when creating a
# connection though, so we pop it *after* we have saved it as
# self.source_address.
kw.pop('source_address', None)
#: The socket options provided by the user. If no options are
#: provided, we use the default options.
self.socket_options = kw.pop('socket_options', self.default_socket_options)
# Superclass also sets self.source_address in Python 2.7+.
_HTTPConnection.__init__(self, *args, **kw)
def _new_conn(self):
""" Establish a socket connection and set nodelay settings on it.
:return: New socket connection.
"""
extra_kw = {}
if self.source_address:
extra_kw['source_address'] = self.source_address
if self.socket_options:
extra_kw['socket_options'] = self.socket_options
try:
conn = connection.create_connection(
(self.host, self.port), self.timeout, **extra_kw)
except SocketTimeout as e:
raise ConnectTimeoutError(
self, "Connection to %s timed out. (connect timeout=%s)" %
(self.host, self.timeout))
except SocketError as e:
raise NewConnectionError(
self, "Failed to establish a new connection: %s" % e)
return conn
def _prepare_conn(self, conn):
self.sock = conn
# the _tunnel_host attribute was added in python 2.6.3 (via
# http://hg.python.org/cpython/rev/0f57b30a152f) so pythons 2.6(0-2) do
# not have them.
if getattr(self, '_tunnel_host', None):
# TODO: Fix tunnel so it doesn't depend on self.sock state.
self._tunnel()
# Mark this connection as not reusable
self.auto_open = 0
def connect(self):
conn = self._new_conn()
self._prepare_conn(conn)
def request_chunked(self, method, url, body=None, headers=None):
"""
Alternative to the common request method, which sends the
body with chunked encoding and not as one block
"""
headers = HTTPHeaderDict(headers if headers is not None else {})
skip_accept_encoding = 'accept-encoding' in headers
skip_host = 'host' in headers
self.putrequest(
method,
url,
skip_accept_encoding=skip_accept_encoding,
skip_host=skip_host
)
for header, value in headers.items():
self.putheader(header, value)
if 'transfer-encoding' not in headers:
self.putheader('Transfer-Encoding', 'chunked')
self.endheaders()
if body is not None:
stringish_types = six.string_types + (six.binary_type,)
if isinstance(body, stringish_types):
body = (body,)
for chunk in body:
if not chunk:
continue
if not isinstance(chunk, six.binary_type):
chunk = chunk.encode('utf8')
len_str = hex(len(chunk))[2:]
self.send(len_str.encode('utf-8'))
self.send(b'\r\n')
self.send(chunk)
self.send(b'\r\n')
# After the if clause, to always have a closed body
self.send(b'0\r\n\r\n')
class HTTPSConnection(HTTPConnection):
default_port = port_by_scheme['https']
ssl_version = None
def __init__(self, host, port=None, key_file=None, cert_file=None,
strict=None, timeout=socket._GLOBAL_DEFAULT_TIMEOUT,
ssl_context=None, **kw):
HTTPConnection.__init__(self, host, port, strict=strict,
timeout=timeout, **kw)
self.key_file = key_file
self.cert_file = cert_file
self.ssl_context = ssl_context
# Required property for Google AppEngine 1.9.0 which otherwise causes
# HTTPS requests to go out as HTTP. (See Issue #356)
self._protocol = 'https'
def connect(self):
conn = self._new_conn()
self._prepare_conn(conn)
if self.ssl_context is None:
self.ssl_context = create_urllib3_context(
ssl_version=resolve_ssl_version(None),
cert_reqs=resolve_cert_reqs(None),
)
self.sock = ssl_wrap_socket(
sock=conn,
keyfile=self.key_file,
certfile=self.cert_file,
ssl_context=self.ssl_context,
)
class VerifiedHTTPSConnection(HTTPSConnection):
"""
Based on httplib.HTTPSConnection but wraps the socket with
SSL certification.
"""
cert_reqs = None
ca_certs = None
ca_cert_dir = None
ssl_version = None
assert_fingerprint = None
def set_cert(self, key_file=None, cert_file=None,
cert_reqs=None, ca_certs=None,
assert_hostname=None, assert_fingerprint=None,
ca_cert_dir=None):
"""
This method should only be called once, before the connection is used.
"""
# If cert_reqs is not provided, we can try to guess. If the user gave
# us a cert database, we assume they want to use it: otherwise, if
# they gave us an SSL Context object we should use whatever is set for
# it.
if cert_reqs is None:
if ca_certs or ca_cert_dir:
cert_reqs = 'CERT_REQUIRED'
elif self.ssl_context is not None:
cert_reqs = self.ssl_context.verify_mode
self.key_file = key_file
self.cert_file = cert_file
self.cert_reqs = cert_reqs
self.assert_hostname = assert_hostname
self.assert_fingerprint = assert_fingerprint
self.ca_certs = ca_certs and os.path.expanduser(ca_certs)
self.ca_cert_dir = ca_cert_dir and os.path.expanduser(ca_cert_dir)
def connect(self):
# Add certificate verification
conn = self._new_conn()
hostname = self.host
if getattr(self, '_tunnel_host', None):
# _tunnel_host was added in Python 2.6.3
# (See: http://hg.python.org/cpython/rev/0f57b30a152f)
self.sock = conn
# Calls self._set_hostport(), so self.host is
# self._tunnel_host below.
self._tunnel()
# Mark this connection as not reusable
self.auto_open = 0
# Override the host with the one we're requesting data from.
hostname = self._tunnel_host
is_time_off = datetime.date.today() < RECENT_DATE
if is_time_off:
warnings.warn((
'System time is way off (before {0}). This will probably '
'lead to SSL verification errors').format(RECENT_DATE),
SystemTimeWarning
)
# Wrap socket using verification with the root certs in
# trusted_root_certs
if self.ssl_context is None:
self.ssl_context = create_urllib3_context(
ssl_version=resolve_ssl_version(self.ssl_version),
cert_reqs=resolve_cert_reqs(self.cert_reqs),
)
context = self.ssl_context
context.verify_mode = resolve_cert_reqs(self.cert_reqs)
self.sock = ssl_wrap_socket(
sock=conn,
keyfile=self.key_file,
certfile=self.cert_file,
ca_certs=self.ca_certs,
ca_cert_dir=self.ca_cert_dir,
server_hostname=hostname,
ssl_context=context)
if self.assert_fingerprint:
assert_fingerprint(self.sock.getpeercert(binary_form=True),
self.assert_fingerprint)
elif context.verify_mode != ssl.CERT_NONE \
and not getattr(context, 'check_hostname', False) \
and self.assert_hostname is not False:
# While urllib3 attempts to always turn off hostname matching from
# the TLS library, this cannot always be done. So we check whether
# the TLS Library still thinks it's matching hostnames.
cert = self.sock.getpeercert()
if not cert.get('subjectAltName', ()):
warnings.warn((
'Certificate for {0} has no `subjectAltName`, falling back to check for a '
'`commonName` for now. This feature is being removed by major browsers and '
'deprecated by RFC 2818. (See https://github.com/shazow/urllib3/issues/497 '
'for details.)'.format(hostname)),
SubjectAltNameWarning
)
_match_hostname(cert, self.assert_hostname or hostname)
self.is_verified = (
context.verify_mode == ssl.CERT_REQUIRED or
self.assert_fingerprint is not None
)
def _match_hostname(cert, asserted_hostname):
try:
match_hostname(cert, asserted_hostname)
except CertificateError as e:
log.error(
'Certificate did not match expected hostname: %s. '
'Certificate: %s', asserted_hostname, cert
)
# Add cert to exception and reraise so client code can inspect
# the cert when catching the exception, if they want to
e._peer_cert = cert
raise
if ssl:
# Make a copy for testing.
UnverifiedHTTPSConnection = HTTPSConnection
HTTPSConnection = VerifiedHTTPSConnection
else:
HTTPSConnection = DummyConnection
pip/_vendor/urllib3/fields.py 0000644 00000013467 14751155150 0012203 0 ustar 00 from __future__ import absolute_import
import email.utils
import mimetypes
from .packages import six
def guess_content_type(filename, default='application/octet-stream'):
"""
Guess the "Content-Type" of a file.
:param filename:
The filename to guess the "Content-Type" of using :mod:`mimetypes`.
:param default:
If no "Content-Type" can be guessed, default to `default`.
"""
if filename:
return mimetypes.guess_type(filename)[0] or default
return default
def format_header_param(name, value):
"""
Helper function to format and quote a single header parameter.
Particularly useful for header parameters which might contain
non-ASCII values, like file names. This follows RFC 2231, as
suggested by RFC 2388 Section 4.4.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
"""
if not any(ch in value for ch in '"\\\r\n'):
result = '%s="%s"' % (name, value)
try:
result.encode('ascii')
except (UnicodeEncodeError, UnicodeDecodeError):
pass
else:
return result
if not six.PY3 and isinstance(value, six.text_type): # Python 2:
value = value.encode('utf-8')
value = email.utils.encode_rfc2231(value, 'utf-8')
value = '%s*=%s' % (name, value)
return value
class RequestField(object):
"""
A data container for request body parameters.
:param name:
The name of this request field.
:param data:
The data/value body.
:param filename:
An optional filename of the request field.
:param headers:
An optional dict-like object of headers to initially use for the field.
"""
def __init__(self, name, data, filename=None, headers=None):
self._name = name
self._filename = filename
self.data = data
self.headers = {}
if headers:
self.headers = dict(headers)
@classmethod
def from_tuples(cls, fieldname, value):
"""
A :class:`~urllib3.fields.RequestField` factory from old-style tuple parameters.
Supports constructing :class:`~urllib3.fields.RequestField` from
parameter of key/value strings AND key/filetuple. A filetuple is a
(filename, data, MIME type) tuple where the MIME type is optional.
For example::
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
Field names and filenames must be unicode.
"""
if isinstance(value, tuple):
if len(value) == 3:
filename, data, content_type = value
else:
filename, data = value
content_type = guess_content_type(filename)
else:
filename = None
content_type = None
data = value
request_param = cls(fieldname, data, filename=filename)
request_param.make_multipart(content_type=content_type)
return request_param
def _render_part(self, name, value):
"""
Overridable helper function to format a single header parameter.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
"""
return format_header_param(name, value)
def _render_parts(self, header_parts):
"""
Helper function to format and quote a single header.
Useful for single headers that are composed of multiple items. E.g.,
'Content-Disposition' fields.
:param header_parts:
A sequence of (k, v) typles or a :class:`dict` of (k, v) to format
as `k1="v1"; k2="v2"; ...`.
"""
parts = []
iterable = header_parts
if isinstance(header_parts, dict):
iterable = header_parts.items()
for name, value in iterable:
if value is not None:
parts.append(self._render_part(name, value))
return '; '.join(parts)
def render_headers(self):
"""
Renders the headers for this request field.
"""
lines = []
sort_keys = ['Content-Disposition', 'Content-Type', 'Content-Location']
for sort_key in sort_keys:
if self.headers.get(sort_key, False):
lines.append('%s: %s' % (sort_key, self.headers[sort_key]))
for header_name, header_value in self.headers.items():
if header_name not in sort_keys:
if header_value:
lines.append('%s: %s' % (header_name, header_value))
lines.append('\r\n')
return '\r\n'.join(lines)
def make_multipart(self, content_disposition=None, content_type=None,
content_location=None):
"""
Makes this request field into a multipart request field.
This method overrides "Content-Disposition", "Content-Type" and
"Content-Location" headers to the request parameter.
:param content_type:
The 'Content-Type' of the request body.
:param content_location:
The 'Content-Location' of the request body.
"""
self.headers['Content-Disposition'] = content_disposition or 'form-data'
self.headers['Content-Disposition'] += '; '.join([
'', self._render_parts(
(('name', self._name), ('filename', self._filename))
)
])
self.headers['Content-Type'] = content_type
self.headers['Content-Location'] = content_location
pip/_vendor/urllib3/response.py 0000644 00000054567 14751155150 0012601 0 ustar 00 from __future__ import absolute_import
from contextlib import contextmanager
import zlib
import io
import logging
from socket import timeout as SocketTimeout
from socket import error as SocketError
from ._collections import HTTPHeaderDict
from .exceptions import (
BodyNotHttplibCompatible, ProtocolError, DecodeError, ReadTimeoutError,
ResponseNotChunked, IncompleteRead, InvalidHeader
)
from .packages.six import string_types as basestring, binary_type, PY3
from .packages.six.moves import http_client as httplib
from .connection import HTTPException, BaseSSLError
from .util.response import is_fp_closed, is_response_to_head
log = logging.getLogger(__name__)
class DeflateDecoder(object):
def __init__(self):
self._first_try = True
self._data = binary_type()
self._obj = zlib.decompressobj()
def __getattr__(self, name):
return getattr(self._obj, name)
def decompress(self, data):
if not data:
return data
if not self._first_try:
return self._obj.decompress(data)
self._data += data
try:
decompressed = self._obj.decompress(data)
if decompressed:
self._first_try = False
self._data = None
return decompressed
except zlib.error:
self._first_try = False
self._obj = zlib.decompressobj(-zlib.MAX_WBITS)
try:
return self.decompress(self._data)
finally:
self._data = None
class GzipDecoder(object):
def __init__(self):
self._obj = zlib.decompressobj(16 + zlib.MAX_WBITS)
def __getattr__(self, name):
return getattr(self._obj, name)
def decompress(self, data):
if not data:
return data
return self._obj.decompress(data)
def _get_decoder(mode):
if mode == 'gzip':
return GzipDecoder()
return DeflateDecoder()
class HTTPResponse(io.IOBase):
"""
HTTP Response container.
Backwards-compatible to httplib's HTTPResponse but the response ``body`` is
loaded and decoded on-demand when the ``data`` property is accessed. This
class is also compatible with the Python standard library's :mod:`io`
module, and can hence be treated as a readable object in the context of that
framework.
Extra parameters for behaviour not present in httplib.HTTPResponse:
:param preload_content:
If True, the response's body will be preloaded during construction.
:param decode_content:
If True, attempts to decode specific content-encoding's based on headers
(like 'gzip' and 'deflate') will be skipped and raw data will be used
instead.
:param original_response:
When this HTTPResponse wrapper is generated from an httplib.HTTPResponse
object, it's convenient to include the original for debug purposes. It's
otherwise unused.
:param retries:
The retries contains the last :class:`~urllib3.util.retry.Retry` that
was used during the request.
:param enforce_content_length:
Enforce content length checking. Body returned by server must match
value of Content-Length header, if present. Otherwise, raise error.
"""
CONTENT_DECODERS = ['gzip', 'deflate']
REDIRECT_STATUSES = [301, 302, 303, 307, 308]
def __init__(self, body='', headers=None, status=0, version=0, reason=None,
strict=0, preload_content=True, decode_content=True,
original_response=None, pool=None, connection=None,
retries=None, enforce_content_length=False, request_method=None):
if isinstance(headers, HTTPHeaderDict):
self.headers = headers
else:
self.headers = HTTPHeaderDict(headers)
self.status = status
self.version = version
self.reason = reason
self.strict = strict
self.decode_content = decode_content
self.retries = retries
self.enforce_content_length = enforce_content_length
self._decoder = None
self._body = None
self._fp = None
self._original_response = original_response
self._fp_bytes_read = 0
if body and isinstance(body, (basestring, binary_type)):
self._body = body
self._pool = pool
self._connection = connection
if hasattr(body, 'read'):
self._fp = body
# Are we using the chunked-style of transfer encoding?
self.chunked = False
self.chunk_left = None
tr_enc = self.headers.get('transfer-encoding', '').lower()
# Don't incur the penalty of creating a list and then discarding it
encodings = (enc.strip() for enc in tr_enc.split(","))
if "chunked" in encodings:
self.chunked = True
# Determine length of response
self.length_remaining = self._init_length(request_method)
# If requested, preload the body.
if preload_content and not self._body:
self._body = self.read(decode_content=decode_content)
def get_redirect_location(self):
"""
Should we redirect and where to?
:returns: Truthy redirect location string if we got a redirect status
code and valid location. ``None`` if redirect status and no
location. ``False`` if not a redirect status code.
"""
if self.status in self.REDIRECT_STATUSES:
return self.headers.get('location')
return False
def release_conn(self):
if not self._pool or not self._connection:
return
self._pool._put_conn(self._connection)
self._connection = None
@property
def data(self):
# For backwords-compat with earlier urllib3 0.4 and earlier.
if self._body:
return self._body
if self._fp:
return self.read(cache_content=True)
@property
def connection(self):
return self._connection
def tell(self):
"""
Obtain the number of bytes pulled over the wire so far. May differ from
the amount of content returned by :meth:``HTTPResponse.read`` if bytes
are encoded on the wire (e.g, compressed).
"""
return self._fp_bytes_read
def _init_length(self, request_method):
"""
Set initial length value for Response content if available.
"""
length = self.headers.get('content-length')
if length is not None and self.chunked:
# This Response will fail with an IncompleteRead if it can't be
# received as chunked. This method falls back to attempt reading
# the response before raising an exception.
log.warning("Received response with both Content-Length and "
"Transfer-Encoding set. This is expressly forbidden "
"by RFC 7230 sec 3.3.2. Ignoring Content-Length and "
"attempting to process response as Transfer-Encoding: "
"chunked.")
return None
elif length is not None:
try:
# RFC 7230 section 3.3.2 specifies multiple content lengths can
# be sent in a single Content-Length header
# (e.g. Content-Length: 42, 42). This line ensures the values
# are all valid ints and that as long as the `set` length is 1,
# all values are the same. Otherwise, the header is invalid.
lengths = set([int(val) for val in length.split(',')])
if len(lengths) > 1:
raise InvalidHeader("Content-Length contained multiple "
"unmatching values (%s)" % length)
length = lengths.pop()
except ValueError:
length = None
else:
if length < 0:
length = None
# Convert status to int for comparison
# In some cases, httplib returns a status of "_UNKNOWN"
try:
status = int(self.status)
except ValueError:
status = 0
# Check for responses that shouldn't include a body
if status in (204, 304) or 100 <= status < 200 or request_method == 'HEAD':
length = 0
return length
def _init_decoder(self):
"""
Set-up the _decoder attribute if necessary.
"""
# Note: content-encoding value should be case-insensitive, per RFC 7230
# Section 3.2
content_encoding = self.headers.get('content-encoding', '').lower()
if self._decoder is None and content_encoding in self.CONTENT_DECODERS:
self._decoder = _get_decoder(content_encoding)
def _decode(self, data, decode_content, flush_decoder):
"""
Decode the data passed in and potentially flush the decoder.
"""
try:
if decode_content and self._decoder:
data = self._decoder.decompress(data)
except (IOError, zlib.error) as e:
content_encoding = self.headers.get('content-encoding', '').lower()
raise DecodeError(
"Received response with content-encoding: %s, but "
"failed to decode it." % content_encoding, e)
if flush_decoder and decode_content:
data += self._flush_decoder()
return data
def _flush_decoder(self):
"""
Flushes the decoder. Should only be called if the decoder is actually
being used.
"""
if self._decoder:
buf = self._decoder.decompress(b'')
return buf + self._decoder.flush()
return b''
@contextmanager
def _error_catcher(self):
"""
Catch low-level python exceptions, instead re-raising urllib3
variants, so that low-level exceptions are not leaked in the
high-level api.
On exit, release the connection back to the pool.
"""
clean_exit = False
try:
try:
yield
except SocketTimeout:
# FIXME: Ideally we'd like to include the url in the ReadTimeoutError but
# there is yet no clean way to get at it from this context.
raise ReadTimeoutError(self._pool, None, 'Read timed out.')
except BaseSSLError as e:
# FIXME: Is there a better way to differentiate between SSLErrors?
if 'read operation timed out' not in str(e): # Defensive:
# This shouldn't happen but just in case we're missing an edge
# case, let's avoid swallowing SSL errors.
raise
raise ReadTimeoutError(self._pool, None, 'Read timed out.')
except (HTTPException, SocketError) as e:
# This includes IncompleteRead.
raise ProtocolError('Connection broken: %r' % e, e)
# If no exception is thrown, we should avoid cleaning up
# unnecessarily.
clean_exit = True
finally:
# If we didn't terminate cleanly, we need to throw away our
# connection.
if not clean_exit:
# The response may not be closed but we're not going to use it
# anymore so close it now to ensure that the connection is
# released back to the pool.
if self._original_response:
self._original_response.close()
# Closing the response may not actually be sufficient to close
# everything, so if we have a hold of the connection close that
# too.
if self._connection:
self._connection.close()
# If we hold the original response but it's closed now, we should
# return the connection back to the pool.
if self._original_response and self._original_response.isclosed():
self.release_conn()
def read(self, amt=None, decode_content=None, cache_content=False):
"""
Similar to :meth:`httplib.HTTPResponse.read`, but with two additional
parameters: ``decode_content`` and ``cache_content``.
:param amt:
How much of the content to read. If specified, caching is skipped
because it doesn't make sense to cache partial content as the full
response.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
:param cache_content:
If True, will save the returned data such that the same result is
returned despite of the state of the underlying file object. This
is useful if you want the ``.data`` property to continue working
after having ``.read()`` the file object. (Overridden if ``amt`` is
set.)
"""
self._init_decoder()
if decode_content is None:
decode_content = self.decode_content
if self._fp is None:
return
flush_decoder = False
data = None
with self._error_catcher():
if amt is None:
# cStringIO doesn't like amt=None
data = self._fp.read()
flush_decoder = True
else:
cache_content = False
data = self._fp.read(amt)
if amt != 0 and not data: # Platform-specific: Buggy versions of Python.
# Close the connection when no data is returned
#
# This is redundant to what httplib/http.client _should_
# already do. However, versions of python released before
# December 15, 2012 (http://bugs.python.org/issue16298) do
# not properly close the connection in all cases. There is
# no harm in redundantly calling close.
self._fp.close()
flush_decoder = True
if self.enforce_content_length and self.length_remaining not in (0, None):
# This is an edge case that httplib failed to cover due
# to concerns of backward compatibility. We're
# addressing it here to make sure IncompleteRead is
# raised during streaming, so all calls with incorrect
# Content-Length are caught.
raise IncompleteRead(self._fp_bytes_read, self.length_remaining)
if data:
self._fp_bytes_read += len(data)
if self.length_remaining is not None:
self.length_remaining -= len(data)
data = self._decode(data, decode_content, flush_decoder)
if cache_content:
self._body = data
return data
def stream(self, amt=2**16, decode_content=None):
"""
A generator wrapper for the read() method. A call will block until
``amt`` bytes have been read from the connection or until the
connection is closed.
:param amt:
How much of the content to read. The generator will return up to
much data per iteration, but may return less. This is particularly
likely when using compressed data. However, the empty string will
never be returned.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
"""
if self.chunked and self.supports_chunked_reads():
for line in self.read_chunked(amt, decode_content=decode_content):
yield line
else:
while not is_fp_closed(self._fp):
data = self.read(amt=amt, decode_content=decode_content)
if data:
yield data
@classmethod
def from_httplib(ResponseCls, r, **response_kw):
"""
Given an :class:`httplib.HTTPResponse` instance ``r``, return a
corresponding :class:`urllib3.response.HTTPResponse` object.
Remaining parameters are passed to the HTTPResponse constructor, along
with ``original_response=r``.
"""
headers = r.msg
if not isinstance(headers, HTTPHeaderDict):
if PY3: # Python 3
headers = HTTPHeaderDict(headers.items())
else: # Python 2
headers = HTTPHeaderDict.from_httplib(headers)
# HTTPResponse objects in Python 3 don't have a .strict attribute
strict = getattr(r, 'strict', 0)
resp = ResponseCls(body=r,
headers=headers,
status=r.status,
version=r.version,
reason=r.reason,
strict=strict,
original_response=r,
**response_kw)
return resp
# Backwards-compatibility methods for httplib.HTTPResponse
def getheaders(self):
return self.headers
def getheader(self, name, default=None):
return self.headers.get(name, default)
# Backwards compatibility for http.cookiejar
def info(self):
return self.headers
# Overrides from io.IOBase
def close(self):
if not self.closed:
self._fp.close()
if self._connection:
self._connection.close()
@property
def closed(self):
if self._fp is None:
return True
elif hasattr(self._fp, 'isclosed'):
return self._fp.isclosed()
elif hasattr(self._fp, 'closed'):
return self._fp.closed
else:
return True
def fileno(self):
if self._fp is None:
raise IOError("HTTPResponse has no file to get a fileno from")
elif hasattr(self._fp, "fileno"):
return self._fp.fileno()
else:
raise IOError("The file-like object this HTTPResponse is wrapped "
"around has no file descriptor")
def flush(self):
if self._fp is not None and hasattr(self._fp, 'flush'):
return self._fp.flush()
def readable(self):
# This method is required for `io` module compatibility.
return True
def readinto(self, b):
# This method is required for `io` module compatibility.
temp = self.read(len(b))
if len(temp) == 0:
return 0
else:
b[:len(temp)] = temp
return len(temp)
def supports_chunked_reads(self):
"""
Checks if the underlying file-like object looks like a
httplib.HTTPResponse object. We do this by testing for the fp
attribute. If it is present we assume it returns raw chunks as
processed by read_chunked().
"""
return hasattr(self._fp, 'fp')
def _update_chunk_length(self):
# First, we'll figure out length of a chunk and then
# we'll try to read it from socket.
if self.chunk_left is not None:
return
line = self._fp.fp.readline()
line = line.split(b';', 1)[0]
try:
self.chunk_left = int(line, 16)
except ValueError:
# Invalid chunked protocol response, abort.
self.close()
raise httplib.IncompleteRead(line)
def _handle_chunk(self, amt):
returned_chunk = None
if amt is None:
chunk = self._fp._safe_read(self.chunk_left)
returned_chunk = chunk
self._fp._safe_read(2) # Toss the CRLF at the end of the chunk.
self.chunk_left = None
elif amt < self.chunk_left:
value = self._fp._safe_read(amt)
self.chunk_left = self.chunk_left - amt
returned_chunk = value
elif amt == self.chunk_left:
value = self._fp._safe_read(amt)
self._fp._safe_read(2) # Toss the CRLF at the end of the chunk.
self.chunk_left = None
returned_chunk = value
else: # amt > self.chunk_left
returned_chunk = self._fp._safe_read(self.chunk_left)
self._fp._safe_read(2) # Toss the CRLF at the end of the chunk.
self.chunk_left = None
return returned_chunk
def read_chunked(self, amt=None, decode_content=None):
"""
Similar to :meth:`HTTPResponse.read`, but with an additional
parameter: ``decode_content``.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
"""
self._init_decoder()
# FIXME: Rewrite this method and make it a class with a better structured logic.
if not self.chunked:
raise ResponseNotChunked(
"Response is not chunked. "
"Header 'transfer-encoding: chunked' is missing.")
if not self.supports_chunked_reads():
raise BodyNotHttplibCompatible(
"Body should be httplib.HTTPResponse like. "
"It should have have an fp attribute which returns raw chunks.")
# Don't bother reading the body of a HEAD request.
if self._original_response and is_response_to_head(self._original_response):
self._original_response.close()
return
with self._error_catcher():
while True:
self._update_chunk_length()
if self.chunk_left == 0:
break
chunk = self._handle_chunk(amt)
decoded = self._decode(chunk, decode_content=decode_content,
flush_decoder=False)
if decoded:
yield decoded
if decode_content:
# On CPython and PyPy, we should never need to flush the
# decoder. However, on Jython we *might* need to, so
# lets defensively do it anyway.
decoded = self._flush_decoder()
if decoded: # Platform-specific: Jython.
yield decoded
# Chunk content ends with \r\n: discard it.
while True:
line = self._fp.fp.readline()
if not line:
# Some sites may not end with '\r\n'.
break
if line == b'\r\n':
break
# We read everything; close the "file".
if self._original_response:
self._original_response.close()
pip/_vendor/urllib3/packages/six.py 0000644 00000072622 14751155150 0013314 0 ustar 00 """Utilities for writing code that runs on Python 2 and 3"""
# Copyright (c) 2010-2015 Benjamin Peterson
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
from __future__ import absolute_import
import functools
import itertools
import operator
import sys
import types
__author__ = "Benjamin Peterson <benjamin@python.org>"
__version__ = "1.10.0"
# Useful for very coarse version differentiation.
PY2 = sys.version_info[0] == 2
PY3 = sys.version_info[0] == 3
PY34 = sys.version_info[0:2] >= (3, 4)
if PY3:
string_types = str,
integer_types = int,
class_types = type,
text_type = str
binary_type = bytes
MAXSIZE = sys.maxsize
else:
string_types = basestring,
integer_types = (int, long)
class_types = (type, types.ClassType)
text_type = unicode
binary_type = str
if sys.platform.startswith("java"):
# Jython always uses 32 bits.
MAXSIZE = int((1 << 31) - 1)
else:
# It's possible to have sizeof(long) != sizeof(Py_ssize_t).
class X(object):
def __len__(self):
return 1 << 31
try:
len(X())
except OverflowError:
# 32-bit
MAXSIZE = int((1 << 31) - 1)
else:
# 64-bit
MAXSIZE = int((1 << 63) - 1)
del X
def _add_doc(func, doc):
"""Add documentation to a function."""
func.__doc__ = doc
def _import_module(name):
"""Import module, returning the module after the last dot."""
__import__(name)
return sys.modules[name]
class _LazyDescr(object):
def __init__(self, name):
self.name = name
def __get__(self, obj, tp):
result = self._resolve()
setattr(obj, self.name, result) # Invokes __set__.
try:
# This is a bit ugly, but it avoids running this again by
# removing this descriptor.
delattr(obj.__class__, self.name)
except AttributeError:
pass
return result
class MovedModule(_LazyDescr):
def __init__(self, name, old, new=None):
super(MovedModule, self).__init__(name)
if PY3:
if new is None:
new = name
self.mod = new
else:
self.mod = old
def _resolve(self):
return _import_module(self.mod)
def __getattr__(self, attr):
_module = self._resolve()
value = getattr(_module, attr)
setattr(self, attr, value)
return value
class _LazyModule(types.ModuleType):
def __init__(self, name):
super(_LazyModule, self).__init__(name)
self.__doc__ = self.__class__.__doc__
def __dir__(self):
attrs = ["__doc__", "__name__"]
attrs += [attr.name for attr in self._moved_attributes]
return attrs
# Subclasses should override this
_moved_attributes = []
class MovedAttribute(_LazyDescr):
def __init__(self, name, old_mod, new_mod, old_attr=None, new_attr=None):
super(MovedAttribute, self).__init__(name)
if PY3:
if new_mod is None:
new_mod = name
self.mod = new_mod
if new_attr is None:
if old_attr is None:
new_attr = name
else:
new_attr = old_attr
self.attr = new_attr
else:
self.mod = old_mod
if old_attr is None:
old_attr = name
self.attr = old_attr
def _resolve(self):
module = _import_module(self.mod)
return getattr(module, self.attr)
class _SixMetaPathImporter(object):
"""
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
"""
def __init__(self, six_module_name):
self.name = six_module_name
self.known_modules = {}
def _add_module(self, mod, *fullnames):
for fullname in fullnames:
self.known_modules[self.name + "." + fullname] = mod
def _get_module(self, fullname):
return self.known_modules[self.name + "." + fullname]
def find_module(self, fullname, path=None):
if fullname in self.known_modules:
return self
return None
def __get_module(self, fullname):
try:
return self.known_modules[fullname]
except KeyError:
raise ImportError("This loader does not know module " + fullname)
def load_module(self, fullname):
try:
# in case of a reload
return sys.modules[fullname]
except KeyError:
pass
mod = self.__get_module(fullname)
if isinstance(mod, MovedModule):
mod = mod._resolve()
else:
mod.__loader__ = self
sys.modules[fullname] = mod
return mod
def is_package(self, fullname):
"""
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
"""
return hasattr(self.__get_module(fullname), "__path__")
def get_code(self, fullname):
"""Return None
Required, if is_package is implemented"""
self.__get_module(fullname) # eventually raises ImportError
return None
get_source = get_code # same as get_code
_importer = _SixMetaPathImporter(__name__)
class _MovedItems(_LazyModule):
"""Lazy loading of moved objects"""
__path__ = [] # mark as package
_moved_attributes = [
MovedAttribute("cStringIO", "cStringIO", "io", "StringIO"),
MovedAttribute("filter", "itertools", "builtins", "ifilter", "filter"),
MovedAttribute("filterfalse", "itertools", "itertools", "ifilterfalse", "filterfalse"),
MovedAttribute("input", "__builtin__", "builtins", "raw_input", "input"),
MovedAttribute("intern", "__builtin__", "sys"),
MovedAttribute("map", "itertools", "builtins", "imap", "map"),
MovedAttribute("getcwd", "os", "os", "getcwdu", "getcwd"),
MovedAttribute("getcwdb", "os", "os", "getcwd", "getcwdb"),
MovedAttribute("range", "__builtin__", "builtins", "xrange", "range"),
MovedAttribute("reload_module", "__builtin__", "importlib" if PY34 else "imp", "reload"),
MovedAttribute("reduce", "__builtin__", "functools"),
MovedAttribute("shlex_quote", "pipes", "shlex", "quote"),
MovedAttribute("StringIO", "StringIO", "io"),
MovedAttribute("UserDict", "UserDict", "collections"),
MovedAttribute("UserList", "UserList", "collections"),
MovedAttribute("UserString", "UserString", "collections"),
MovedAttribute("xrange", "__builtin__", "builtins", "xrange", "range"),
MovedAttribute("zip", "itertools", "builtins", "izip", "zip"),
MovedAttribute("zip_longest", "itertools", "itertools", "izip_longest", "zip_longest"),
MovedModule("builtins", "__builtin__"),
MovedModule("configparser", "ConfigParser"),
MovedModule("copyreg", "copy_reg"),
MovedModule("dbm_gnu", "gdbm", "dbm.gnu"),
MovedModule("_dummy_thread", "dummy_thread", "_dummy_thread"),
MovedModule("http_cookiejar", "cookielib", "http.cookiejar"),
MovedModule("http_cookies", "Cookie", "http.cookies"),
MovedModule("html_entities", "htmlentitydefs", "html.entities"),
MovedModule("html_parser", "HTMLParser", "html.parser"),
MovedModule("http_client", "httplib", "http.client"),
MovedModule("email_mime_multipart", "email.MIMEMultipart", "email.mime.multipart"),
MovedModule("email_mime_nonmultipart", "email.MIMENonMultipart", "email.mime.nonmultipart"),
MovedModule("email_mime_text", "email.MIMEText", "email.mime.text"),
MovedModule("email_mime_base", "email.MIMEBase", "email.mime.base"),
MovedModule("BaseHTTPServer", "BaseHTTPServer", "http.server"),
MovedModule("CGIHTTPServer", "CGIHTTPServer", "http.server"),
MovedModule("SimpleHTTPServer", "SimpleHTTPServer", "http.server"),
MovedModule("cPickle", "cPickle", "pickle"),
MovedModule("queue", "Queue"),
MovedModule("reprlib", "repr"),
MovedModule("socketserver", "SocketServer"),
MovedModule("_thread", "thread", "_thread"),
MovedModule("tkinter", "Tkinter"),
MovedModule("tkinter_dialog", "Dialog", "tkinter.dialog"),
MovedModule("tkinter_filedialog", "FileDialog", "tkinter.filedialog"),
MovedModule("tkinter_scrolledtext", "ScrolledText", "tkinter.scrolledtext"),
MovedModule("tkinter_simpledialog", "SimpleDialog", "tkinter.simpledialog"),
MovedModule("tkinter_tix", "Tix", "tkinter.tix"),
MovedModule("tkinter_ttk", "ttk", "tkinter.ttk"),
MovedModule("tkinter_constants", "Tkconstants", "tkinter.constants"),
MovedModule("tkinter_dnd", "Tkdnd", "tkinter.dnd"),
MovedModule("tkinter_colorchooser", "tkColorChooser",
"tkinter.colorchooser"),
MovedModule("tkinter_commondialog", "tkCommonDialog",
"tkinter.commondialog"),
MovedModule("tkinter_tkfiledialog", "tkFileDialog", "tkinter.filedialog"),
MovedModule("tkinter_font", "tkFont", "tkinter.font"),
MovedModule("tkinter_messagebox", "tkMessageBox", "tkinter.messagebox"),
MovedModule("tkinter_tksimpledialog", "tkSimpleDialog",
"tkinter.simpledialog"),
MovedModule("urllib_parse", __name__ + ".moves.urllib_parse", "urllib.parse"),
MovedModule("urllib_error", __name__ + ".moves.urllib_error", "urllib.error"),
MovedModule("urllib", __name__ + ".moves.urllib", __name__ + ".moves.urllib"),
MovedModule("urllib_robotparser", "robotparser", "urllib.robotparser"),
MovedModule("xmlrpc_client", "xmlrpclib", "xmlrpc.client"),
MovedModule("xmlrpc_server", "SimpleXMLRPCServer", "xmlrpc.server"),
]
# Add windows specific modules.
if sys.platform == "win32":
_moved_attributes += [
MovedModule("winreg", "_winreg"),
]
for attr in _moved_attributes:
setattr(_MovedItems, attr.name, attr)
if isinstance(attr, MovedModule):
_importer._add_module(attr, "moves." + attr.name)
del attr
_MovedItems._moved_attributes = _moved_attributes
moves = _MovedItems(__name__ + ".moves")
_importer._add_module(moves, "moves")
class Module_six_moves_urllib_parse(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_parse"""
_urllib_parse_moved_attributes = [
MovedAttribute("ParseResult", "urlparse", "urllib.parse"),
MovedAttribute("SplitResult", "urlparse", "urllib.parse"),
MovedAttribute("parse_qs", "urlparse", "urllib.parse"),
MovedAttribute("parse_qsl", "urlparse", "urllib.parse"),
MovedAttribute("urldefrag", "urlparse", "urllib.parse"),
MovedAttribute("urljoin", "urlparse", "urllib.parse"),
MovedAttribute("urlparse", "urlparse", "urllib.parse"),
MovedAttribute("urlsplit", "urlparse", "urllib.parse"),
MovedAttribute("urlunparse", "urlparse", "urllib.parse"),
MovedAttribute("urlunsplit", "urlparse", "urllib.parse"),
MovedAttribute("quote", "urllib", "urllib.parse"),
MovedAttribute("quote_plus", "urllib", "urllib.parse"),
MovedAttribute("unquote", "urllib", "urllib.parse"),
MovedAttribute("unquote_plus", "urllib", "urllib.parse"),
MovedAttribute("urlencode", "urllib", "urllib.parse"),
MovedAttribute("splitquery", "urllib", "urllib.parse"),
MovedAttribute("splittag", "urllib", "urllib.parse"),
MovedAttribute("splituser", "urllib", "urllib.parse"),
MovedAttribute("uses_fragment", "urlparse", "urllib.parse"),
MovedAttribute("uses_netloc", "urlparse", "urllib.parse"),
MovedAttribute("uses_params", "urlparse", "urllib.parse"),
MovedAttribute("uses_query", "urlparse", "urllib.parse"),
MovedAttribute("uses_relative", "urlparse", "urllib.parse"),
]
for attr in _urllib_parse_moved_attributes:
setattr(Module_six_moves_urllib_parse, attr.name, attr)
del attr
Module_six_moves_urllib_parse._moved_attributes = _urllib_parse_moved_attributes
_importer._add_module(Module_six_moves_urllib_parse(__name__ + ".moves.urllib_parse"),
"moves.urllib_parse", "moves.urllib.parse")
class Module_six_moves_urllib_error(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_error"""
_urllib_error_moved_attributes = [
MovedAttribute("URLError", "urllib2", "urllib.error"),
MovedAttribute("HTTPError", "urllib2", "urllib.error"),
MovedAttribute("ContentTooShortError", "urllib", "urllib.error"),
]
for attr in _urllib_error_moved_attributes:
setattr(Module_six_moves_urllib_error, attr.name, attr)
del attr
Module_six_moves_urllib_error._moved_attributes = _urllib_error_moved_attributes
_importer._add_module(Module_six_moves_urllib_error(__name__ + ".moves.urllib.error"),
"moves.urllib_error", "moves.urllib.error")
class Module_six_moves_urllib_request(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_request"""
_urllib_request_moved_attributes = [
MovedAttribute("urlopen", "urllib2", "urllib.request"),
MovedAttribute("install_opener", "urllib2", "urllib.request"),
MovedAttribute("build_opener", "urllib2", "urllib.request"),
MovedAttribute("pathname2url", "urllib", "urllib.request"),
MovedAttribute("url2pathname", "urllib", "urllib.request"),
MovedAttribute("getproxies", "urllib", "urllib.request"),
MovedAttribute("Request", "urllib2", "urllib.request"),
MovedAttribute("OpenerDirector", "urllib2", "urllib.request"),
MovedAttribute("HTTPDefaultErrorHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPRedirectHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPCookieProcessor", "urllib2", "urllib.request"),
MovedAttribute("ProxyHandler", "urllib2", "urllib.request"),
MovedAttribute("BaseHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPPasswordMgr", "urllib2", "urllib.request"),
MovedAttribute("HTTPPasswordMgrWithDefaultRealm", "urllib2", "urllib.request"),
MovedAttribute("AbstractBasicAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPBasicAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("ProxyBasicAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("AbstractDigestAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPDigestAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("ProxyDigestAuthHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPSHandler", "urllib2", "urllib.request"),
MovedAttribute("FileHandler", "urllib2", "urllib.request"),
MovedAttribute("FTPHandler", "urllib2", "urllib.request"),
MovedAttribute("CacheFTPHandler", "urllib2", "urllib.request"),
MovedAttribute("UnknownHandler", "urllib2", "urllib.request"),
MovedAttribute("HTTPErrorProcessor", "urllib2", "urllib.request"),
MovedAttribute("urlretrieve", "urllib", "urllib.request"),
MovedAttribute("urlcleanup", "urllib", "urllib.request"),
MovedAttribute("URLopener", "urllib", "urllib.request"),
MovedAttribute("FancyURLopener", "urllib", "urllib.request"),
MovedAttribute("proxy_bypass", "urllib", "urllib.request"),
]
for attr in _urllib_request_moved_attributes:
setattr(Module_six_moves_urllib_request, attr.name, attr)
del attr
Module_six_moves_urllib_request._moved_attributes = _urllib_request_moved_attributes
_importer._add_module(Module_six_moves_urllib_request(__name__ + ".moves.urllib.request"),
"moves.urllib_request", "moves.urllib.request")
class Module_six_moves_urllib_response(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_response"""
_urllib_response_moved_attributes = [
MovedAttribute("addbase", "urllib", "urllib.response"),
MovedAttribute("addclosehook", "urllib", "urllib.response"),
MovedAttribute("addinfo", "urllib", "urllib.response"),
MovedAttribute("addinfourl", "urllib", "urllib.response"),
]
for attr in _urllib_response_moved_attributes:
setattr(Module_six_moves_urllib_response, attr.name, attr)
del attr
Module_six_moves_urllib_response._moved_attributes = _urllib_response_moved_attributes
_importer._add_module(Module_six_moves_urllib_response(__name__ + ".moves.urllib.response"),
"moves.urllib_response", "moves.urllib.response")
class Module_six_moves_urllib_robotparser(_LazyModule):
"""Lazy loading of moved objects in six.moves.urllib_robotparser"""
_urllib_robotparser_moved_attributes = [
MovedAttribute("RobotFileParser", "robotparser", "urllib.robotparser"),
]
for attr in _urllib_robotparser_moved_attributes:
setattr(Module_six_moves_urllib_robotparser, attr.name, attr)
del attr
Module_six_moves_urllib_robotparser._moved_attributes = _urllib_robotparser_moved_attributes
_importer._add_module(Module_six_moves_urllib_robotparser(__name__ + ".moves.urllib.robotparser"),
"moves.urllib_robotparser", "moves.urllib.robotparser")
class Module_six_moves_urllib(types.ModuleType):
"""Create a six.moves.urllib namespace that resembles the Python 3 namespace"""
__path__ = [] # mark as package
parse = _importer._get_module("moves.urllib_parse")
error = _importer._get_module("moves.urllib_error")
request = _importer._get_module("moves.urllib_request")
response = _importer._get_module("moves.urllib_response")
robotparser = _importer._get_module("moves.urllib_robotparser")
def __dir__(self):
return ['parse', 'error', 'request', 'response', 'robotparser']
_importer._add_module(Module_six_moves_urllib(__name__ + ".moves.urllib"),
"moves.urllib")
def add_move(move):
"""Add an item to six.moves."""
setattr(_MovedItems, move.name, move)
def remove_move(name):
"""Remove item from six.moves."""
try:
delattr(_MovedItems, name)
except AttributeError:
try:
del moves.__dict__[name]
except KeyError:
raise AttributeError("no such move, %r" % (name,))
if PY3:
_meth_func = "__func__"
_meth_self = "__self__"
_func_closure = "__closure__"
_func_code = "__code__"
_func_defaults = "__defaults__"
_func_globals = "__globals__"
else:
_meth_func = "im_func"
_meth_self = "im_self"
_func_closure = "func_closure"
_func_code = "func_code"
_func_defaults = "func_defaults"
_func_globals = "func_globals"
try:
advance_iterator = next
except NameError:
def advance_iterator(it):
return it.next()
next = advance_iterator
try:
callable = callable
except NameError:
def callable(obj):
return any("__call__" in klass.__dict__ for klass in type(obj).__mro__)
if PY3:
def get_unbound_function(unbound):
return unbound
create_bound_method = types.MethodType
def create_unbound_method(func, cls):
return func
Iterator = object
else:
def get_unbound_function(unbound):
return unbound.im_func
def create_bound_method(func, obj):
return types.MethodType(func, obj, obj.__class__)
def create_unbound_method(func, cls):
return types.MethodType(func, None, cls)
class Iterator(object):
def next(self):
return type(self).__next__(self)
callable = callable
_add_doc(get_unbound_function,
"""Get the function out of a possibly unbound function""")
get_method_function = operator.attrgetter(_meth_func)
get_method_self = operator.attrgetter(_meth_self)
get_function_closure = operator.attrgetter(_func_closure)
get_function_code = operator.attrgetter(_func_code)
get_function_defaults = operator.attrgetter(_func_defaults)
get_function_globals = operator.attrgetter(_func_globals)
if PY3:
def iterkeys(d, **kw):
return iter(d.keys(**kw))
def itervalues(d, **kw):
return iter(d.values(**kw))
def iteritems(d, **kw):
return iter(d.items(**kw))
def iterlists(d, **kw):
return iter(d.lists(**kw))
viewkeys = operator.methodcaller("keys")
viewvalues = operator.methodcaller("values")
viewitems = operator.methodcaller("items")
else:
def iterkeys(d, **kw):
return d.iterkeys(**kw)
def itervalues(d, **kw):
return d.itervalues(**kw)
def iteritems(d, **kw):
return d.iteritems(**kw)
def iterlists(d, **kw):
return d.iterlists(**kw)
viewkeys = operator.methodcaller("viewkeys")
viewvalues = operator.methodcaller("viewvalues")
viewitems = operator.methodcaller("viewitems")
_add_doc(iterkeys, "Return an iterator over the keys of a dictionary.")
_add_doc(itervalues, "Return an iterator over the values of a dictionary.")
_add_doc(iteritems,
"Return an iterator over the (key, value) pairs of a dictionary.")
_add_doc(iterlists,
"Return an iterator over the (key, [values]) pairs of a dictionary.")
if PY3:
def b(s):
return s.encode("latin-1")
def u(s):
return s
unichr = chr
import struct
int2byte = struct.Struct(">B").pack
del struct
byte2int = operator.itemgetter(0)
indexbytes = operator.getitem
iterbytes = iter
import io
StringIO = io.StringIO
BytesIO = io.BytesIO
_assertCountEqual = "assertCountEqual"
if sys.version_info[1] <= 1:
_assertRaisesRegex = "assertRaisesRegexp"
_assertRegex = "assertRegexpMatches"
else:
_assertRaisesRegex = "assertRaisesRegex"
_assertRegex = "assertRegex"
else:
def b(s):
return s
# Workaround for standalone backslash
def u(s):
return unicode(s.replace(r'\\', r'\\\\'), "unicode_escape")
unichr = unichr
int2byte = chr
def byte2int(bs):
return ord(bs[0])
def indexbytes(buf, i):
return ord(buf[i])
iterbytes = functools.partial(itertools.imap, ord)
import StringIO
StringIO = BytesIO = StringIO.StringIO
_assertCountEqual = "assertItemsEqual"
_assertRaisesRegex = "assertRaisesRegexp"
_assertRegex = "assertRegexpMatches"
_add_doc(b, """Byte literal""")
_add_doc(u, """Text literal""")
def assertCountEqual(self, *args, **kwargs):
return getattr(self, _assertCountEqual)(*args, **kwargs)
def assertRaisesRegex(self, *args, **kwargs):
return getattr(self, _assertRaisesRegex)(*args, **kwargs)
def assertRegex(self, *args, **kwargs):
return getattr(self, _assertRegex)(*args, **kwargs)
if PY3:
exec_ = getattr(moves.builtins, "exec")
def reraise(tp, value, tb=None):
if value is None:
value = tp()
if value.__traceback__ is not tb:
raise value.with_traceback(tb)
raise value
else:
def exec_(_code_, _globs_=None, _locs_=None):
"""Execute code in a namespace."""
if _globs_ is None:
frame = sys._getframe(1)
_globs_ = frame.f_globals
if _locs_ is None:
_locs_ = frame.f_locals
del frame
elif _locs_ is None:
_locs_ = _globs_
exec("""exec _code_ in _globs_, _locs_""")
exec_("""def reraise(tp, value, tb=None):
raise tp, value, tb
""")
if sys.version_info[:2] == (3, 2):
exec_("""def raise_from(value, from_value):
if from_value is None:
raise value
raise value from from_value
""")
elif sys.version_info[:2] > (3, 2):
exec_("""def raise_from(value, from_value):
raise value from from_value
""")
else:
def raise_from(value, from_value):
raise value
print_ = getattr(moves.builtins, "print", None)
if print_ is None:
def print_(*args, **kwargs):
"""The new-style print function for Python 2.4 and 2.5."""
fp = kwargs.pop("file", sys.stdout)
if fp is None:
return
def write(data):
if not isinstance(data, basestring):
data = str(data)
# If the file has an encoding, encode unicode with it.
if (isinstance(fp, file) and
isinstance(data, unicode) and
fp.encoding is not None):
errors = getattr(fp, "errors", None)
if errors is None:
errors = "strict"
data = data.encode(fp.encoding, errors)
fp.write(data)
want_unicode = False
sep = kwargs.pop("sep", None)
if sep is not None:
if isinstance(sep, unicode):
want_unicode = True
elif not isinstance(sep, str):
raise TypeError("sep must be None or a string")
end = kwargs.pop("end", None)
if end is not None:
if isinstance(end, unicode):
want_unicode = True
elif not isinstance(end, str):
raise TypeError("end must be None or a string")
if kwargs:
raise TypeError("invalid keyword arguments to print()")
if not want_unicode:
for arg in args:
if isinstance(arg, unicode):
want_unicode = True
break
if want_unicode:
newline = unicode("\n")
space = unicode(" ")
else:
newline = "\n"
space = " "
if sep is None:
sep = space
if end is None:
end = newline
for i, arg in enumerate(args):
if i:
write(sep)
write(arg)
write(end)
if sys.version_info[:2] < (3, 3):
_print = print_
def print_(*args, **kwargs):
fp = kwargs.get("file", sys.stdout)
flush = kwargs.pop("flush", False)
_print(*args, **kwargs)
if flush and fp is not None:
fp.flush()
_add_doc(reraise, """Reraise an exception.""")
if sys.version_info[0:2] < (3, 4):
def wraps(wrapped, assigned=functools.WRAPPER_ASSIGNMENTS,
updated=functools.WRAPPER_UPDATES):
def wrapper(f):
f = functools.wraps(wrapped, assigned, updated)(f)
f.__wrapped__ = wrapped
return f
return wrapper
else:
wraps = functools.wraps
def with_metaclass(meta, *bases):
"""Create a base class with a metaclass."""
# This requires a bit of explanation: the basic idea is to make a dummy
# metaclass for one level of class instantiation that replaces itself with
# the actual metaclass.
class metaclass(meta):
def __new__(cls, name, this_bases, d):
return meta(name, bases, d)
return type.__new__(metaclass, 'temporary_class', (), {})
def add_metaclass(metaclass):
"""Class decorator for creating a class with a metaclass."""
def wrapper(cls):
orig_vars = cls.__dict__.copy()
slots = orig_vars.get('__slots__')
if slots is not None:
if isinstance(slots, str):
slots = [slots]
for slots_var in slots:
orig_vars.pop(slots_var)
orig_vars.pop('__dict__', None)
orig_vars.pop('__weakref__', None)
return metaclass(cls.__name__, cls.__bases__, orig_vars)
return wrapper
def python_2_unicode_compatible(klass):
"""
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
"""
if PY2:
if '__str__' not in klass.__dict__:
raise ValueError("@python_2_unicode_compatible cannot be applied "
"to %s because it doesn't define __str__()." %
klass.__name__)
klass.__unicode__ = klass.__str__
klass.__str__ = lambda self: self.__unicode__().encode('utf-8')
return klass
# Complete the moves implementation.
# This code is at the end of this module to speed up module loading.
# Turn this module into a package.
__path__ = [] # required for PEP 302 and PEP 451
__package__ = __name__ # see PEP 366 @ReservedAssignment
if globals().get("__spec__") is not None:
__spec__.submodule_search_locations = [] # PEP 451 @UndefinedVariable
# Remove other six meta path importers, since they cause problems. This can
# happen if six is removed from sys.modules and then reloaded. (Setuptools does
# this for some reason.)
if sys.meta_path:
for i, importer in enumerate(sys.meta_path):
# Here's some real nastiness: Another "instance" of the six module might
# be floating around. Therefore, we can't use isinstance() to check for
# the six meta path importer, since the other six instance will have
# inserted an importer with different class.
if (type(importer).__name__ == "_SixMetaPathImporter" and
importer.name == __name__):
del sys.meta_path[i]
break
del i, importer
# Finally, add the importer to the meta path import hook.
sys.meta_path.append(_importer)
pip/_vendor/urllib3/packages/__init__.py 0000644 00000000155 14751155150 0014240 0 ustar 00 from __future__ import absolute_import
from . import ssl_match_hostname
__all__ = ('ssl_match_hostname', )
pip/_vendor/urllib3/packages/ordered_dict.py 0000644 00000021347 14751155150 0015136 0 ustar 00 # Backport of OrderedDict() class that runs on Python 2.4, 2.5, 2.6, 2.7 and pypy.
# Passes Python2.7's test suite and incorporates all the latest updates.
# Copyright 2009 Raymond Hettinger, released under the MIT License.
# http://code.activestate.com/recipes/576693/
try:
from thread import get_ident as _get_ident
except ImportError:
from dummy_thread import get_ident as _get_ident
try:
from _abcoll import KeysView, ValuesView, ItemsView
except ImportError:
pass
class OrderedDict(dict):
'Dictionary that remembers insertion order'
# An inherited dict maps keys to values.
# The inherited dict provides __getitem__, __len__, __contains__, and get.
# The remaining methods are order-aware.
# Big-O running times for all methods are the same as for regular dictionaries.
# The internal self.__map dictionary maps keys to links in a doubly linked list.
# The circular doubly linked list starts and ends with a sentinel element.
# The sentinel element never gets deleted (this simplifies the algorithm).
# Each link is stored as a list of length three: [PREV, NEXT, KEY].
def __init__(self, *args, **kwds):
'''Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
'''
if len(args) > 1:
raise TypeError('expected at most 1 arguments, got %d' % len(args))
try:
self.__root
except AttributeError:
self.__root = root = [] # sentinel node
root[:] = [root, root, None]
self.__map = {}
self.__update(*args, **kwds)
def __setitem__(self, key, value, dict_setitem=dict.__setitem__):
'od.__setitem__(i, y) <==> od[i]=y'
# Setting a new item creates a new link which goes at the end of the linked
# list, and the inherited dictionary is updated with the new key/value pair.
if key not in self:
root = self.__root
last = root[0]
last[1] = root[0] = self.__map[key] = [last, root, key]
dict_setitem(self, key, value)
def __delitem__(self, key, dict_delitem=dict.__delitem__):
'od.__delitem__(y) <==> del od[y]'
# Deleting an existing item uses self.__map to find the link which is
# then removed by updating the links in the predecessor and successor nodes.
dict_delitem(self, key)
link_prev, link_next, key = self.__map.pop(key)
link_prev[1] = link_next
link_next[0] = link_prev
def __iter__(self):
'od.__iter__() <==> iter(od)'
root = self.__root
curr = root[1]
while curr is not root:
yield curr[2]
curr = curr[1]
def __reversed__(self):
'od.__reversed__() <==> reversed(od)'
root = self.__root
curr = root[0]
while curr is not root:
yield curr[2]
curr = curr[0]
def clear(self):
'od.clear() -> None. Remove all items from od.'
try:
for node in self.__map.itervalues():
del node[:]
root = self.__root
root[:] = [root, root, None]
self.__map.clear()
except AttributeError:
pass
dict.clear(self)
def popitem(self, last=True):
'''od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
'''
if not self:
raise KeyError('dictionary is empty')
root = self.__root
if last:
link = root[0]
link_prev = link[0]
link_prev[1] = root
root[0] = link_prev
else:
link = root[1]
link_next = link[1]
root[1] = link_next
link_next[0] = root
key = link[2]
del self.__map[key]
value = dict.pop(self, key)
return key, value
# -- the following methods do not depend on the internal structure --
def keys(self):
'od.keys() -> list of keys in od'
return list(self)
def values(self):
'od.values() -> list of values in od'
return [self[key] for key in self]
def items(self):
'od.items() -> list of (key, value) pairs in od'
return [(key, self[key]) for key in self]
def iterkeys(self):
'od.iterkeys() -> an iterator over the keys in od'
return iter(self)
def itervalues(self):
'od.itervalues -> an iterator over the values in od'
for k in self:
yield self[k]
def iteritems(self):
'od.iteritems -> an iterator over the (key, value) items in od'
for k in self:
yield (k, self[k])
def update(*args, **kwds):
'''od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
'''
if len(args) > 2:
raise TypeError('update() takes at most 2 positional '
'arguments (%d given)' % (len(args),))
elif not args:
raise TypeError('update() takes at least 1 argument (0 given)')
self = args[0]
# Make progressively weaker assumptions about "other"
other = ()
if len(args) == 2:
other = args[1]
if isinstance(other, dict):
for key in other:
self[key] = other[key]
elif hasattr(other, 'keys'):
for key in other.keys():
self[key] = other[key]
else:
for key, value in other:
self[key] = value
for key, value in kwds.items():
self[key] = value
__update = update # let subclasses override update without breaking __init__
__marker = object()
def pop(self, key, default=__marker):
'''od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
'''
if key in self:
result = self[key]
del self[key]
return result
if default is self.__marker:
raise KeyError(key)
return default
def setdefault(self, key, default=None):
'od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od'
if key in self:
return self[key]
self[key] = default
return default
def __repr__(self, _repr_running={}):
'od.__repr__() <==> repr(od)'
call_key = id(self), _get_ident()
if call_key in _repr_running:
return '...'
_repr_running[call_key] = 1
try:
if not self:
return '%s()' % (self.__class__.__name__,)
return '%s(%r)' % (self.__class__.__name__, self.items())
finally:
del _repr_running[call_key]
def __reduce__(self):
'Return state information for pickling'
items = [[k, self[k]] for k in self]
inst_dict = vars(self).copy()
for k in vars(OrderedDict()):
inst_dict.pop(k, None)
if inst_dict:
return (self.__class__, (items,), inst_dict)
return self.__class__, (items,)
def copy(self):
'od.copy() -> a shallow copy of od'
return self.__class__(self)
@classmethod
def fromkeys(cls, iterable, value=None):
'''OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
'''
d = cls()
for key in iterable:
d[key] = value
return d
def __eq__(self, other):
'''od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
'''
if isinstance(other, OrderedDict):
return len(self)==len(other) and self.items() == other.items()
return dict.__eq__(self, other)
def __ne__(self, other):
return not self == other
# -- the following methods are only used in Python 2.7 --
def viewkeys(self):
"od.viewkeys() -> a set-like object providing a view on od's keys"
return KeysView(self)
def viewvalues(self):
"od.viewvalues() -> an object providing a view on od's values"
return ValuesView(self)
def viewitems(self):
"od.viewitems() -> a set-like object providing a view on od's items"
return ItemsView(self)
pip/_vendor/urllib3/packages/backports/makefile.py 0000644 00000002665 14751155150 0016256 0 ustar 00 # -*- coding: utf-8 -*-
"""
backports.makefile
~~~~~~~~~~~~~~~~~~
Backports the Python 3 ``socket.makefile`` method for use with anything that
wants to create a "fake" socket object.
"""
import io
from socket import SocketIO
def backport_makefile(self, mode="r", buffering=None, encoding=None,
errors=None, newline=None):
"""
Backport of ``socket.makefile`` from Python 3.5.
"""
if not set(mode) <= set(["r", "w", "b"]):
raise ValueError(
"invalid mode %r (only r, w, b allowed)" % (mode,)
)
writing = "w" in mode
reading = "r" in mode or not writing
assert reading or writing
binary = "b" in mode
rawmode = ""
if reading:
rawmode += "r"
if writing:
rawmode += "w"
raw = SocketIO(self, rawmode)
self._makefile_refs += 1
if buffering is None:
buffering = -1
if buffering < 0:
buffering = io.DEFAULT_BUFFER_SIZE
if buffering == 0:
if not binary:
raise ValueError("unbuffered streams must be binary")
return raw
if reading and writing:
buffer = io.BufferedRWPair(raw, raw, buffering)
elif reading:
buffer = io.BufferedReader(raw, buffering)
else:
assert writing
buffer = io.BufferedWriter(raw, buffering)
if binary:
return buffer
text = io.TextIOWrapper(buffer, encoding, errors, newline)
text.mode = mode
return text
pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000161 14751155150 0023450 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.opt-1.pyc 0000644 00000002223 14751155150 0023467 0 ustar 00 3
���e� � @ s& d Z ddlZddlmZ ddd�ZdS )z�
backports.makefile
~~~~~~~~~~~~~~~~~~
Backports the Python 3 ``socket.makefile`` method for use with anything that
wants to create a "fake" socket object.
� N)�SocketIO�rc
C s t |�t dddg�ks$td|f ��d|k}d|kp8| }d|k}d} |rR| d7 } |r^| d7 } t| | �}
| jd7 _|dkr�d
}|dk r�tj}|dkr�|s�td ��|
S |r�|r�tj|
|
|�} n |r�tj|
|�} n tj|
|�} |r�| S tj | |||�} || _
| S ) z:
Backport of ``socket.makefile`` from Python 3.5.
r �w�bz&invalid mode %r (only r, w, b allowed)� � Nr z!unbuffered streams must be binary���) �set�
ValueErrorr Z_makefile_refs�io�DEFAULT_BUFFER_SIZE�BufferedRWPair�BufferedReader�BufferedWriter�
TextIOWrapper�mode)
�selfr � buffering�encoding�errors�newlineZwritingZreadingZbinaryZrawmode�raw�buffer�text� r � /usr/lib/python3.6/makefile.py�backport_makefile s>
r )r NNNN)�__doc__r Zsocketr r r r r r �<module> s pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.pyc 0000644 00000000161 14751155150 0022511 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.pyc 0000644 00000002275 14751155150 0022537 0 ustar 00 3
���e� � @ s& d Z ddlZddlmZ ddd�ZdS )z�
backports.makefile
~~~~~~~~~~~~~~~~~~
Backports the Python 3 ``socket.makefile`` method for use with anything that
wants to create a "fake" socket object.
� N)�SocketIO�rc
C s t |�t dddg�ks$td|f ��d|k}d|kp8| }|sF|sFt�d|k}d} |r^| d7 } |rj| d7 } t| | �}
| jd7 _|dkr�d
}|dk r�tj}|dkr�|s�td ��|
S |r�|r�tj|
|
|�} n&|r�tj|
|�} n|s�t�tj |
|�} |� r�| S tj
| |||�} || _ | S ) z:
Backport of ``socket.makefile`` from Python 3.5.
r �w�bz&invalid mode %r (only r, w, b allowed)� � Nr z!unbuffered streams must be binary���) �set�
ValueError�AssertionErrorr Z_makefile_refs�io�DEFAULT_BUFFER_SIZE�BufferedRWPair�BufferedReader�BufferedWriter�
TextIOWrapper�mode)
�selfr � buffering�encoding�errors�newlineZwritingZreadingZbinaryZrawmode�raw�buffer�text� r � /usr/lib/python3.6/makefile.py�backport_makefile sB
r )r NNNN)�__doc__r Zsocketr r r r r r �<module> s pip/_vendor/urllib3/packages/backports/__init__.py 0000644 00000000000 14751155150 0016215 0 ustar 00 pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000356 14751155150 0021466 0 ustar 00 3
���em � @ s d dl mZ ddlmZ dZdS )� )�absolute_import� )�ssl_match_hostnamer N)r )Z
__future__r � r �__all__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.opt-1.pyc 0000644 00000057532 14751155150 0020542 0 ustar 00 3
���e�u � I @ sr d Z ddlmZ ddlZddlZddlZddlZddlZdZdZ ej
d dkZ ej
d dkZ ej
dd� �dzkZ
e r�efZefZefZeZeZejZn�efZeefZeejfZe ZeZej j d �r�e�d|�ZnLG d d
� d
e �Z ye!e � � W n e"k
�r e�d~�ZY n X e�d��Z[ dd� Z#dd� Z$G dd� de �Z%G dd� de%�Z&G dd� dej'�Z(G dd� de%�Z)G dd � d e �Z*e*e+�Z,G d d � d e(�Z-e)d d d d!�e)d"d#d$d%d"�e)d&d#d#d'd&�e)d(d)d$d*d(�e)d+d)d,�e)d-d#d$d.d-�e)d/d0d0d1d/�e)d2d0d0d/d2�e)d3d)d$d4d3�e)d5d)e
�r d6nd7d8�e)d9d)d:�e)d;d<d=d>�e)d!d!d �e)d?d?d@�e)dAdAd@�e)dBdBd@�e)d4d)d$d4d3�e)dCd#d$dDdC�e)dEd#d#dFdE�e&d$d)�e&dGdH�e&dIdJ�e&dKdLdM�e&dNdOdN�e&dPdQdR�e&dSdTdU�e&dVdWdX�e&dYdZd[�e&d\d]d^�e&d_d`da�e&dbdcdd�e&dedfdg�e&dhdidj�e&dkdkdl�e&dmdmdl�e&dndndl�e&dododp�e&dqdr�e&dsdt�e&dudv�e&dwdxdw�e&dydz�e&d{d|d}�e&d~dd��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�e+d� d��e&d�e+d� d��e&d�e+d� e+d� �e&d�d�d��e&d�d�d��e&d�d�d��g>Z.ej d�k�rZe.e&d�d��g7 Z.x:e.D ]2Z/e0e-e/j1e/� e2e/e&��r`e,j3e/d�e/j1 � �q`W [/e.e-_.e-e+d� �Z4e,j3e4d�� G d�d�� d�e(�Z5e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d>d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��gZ6x e6D ]Z/e0e5e/j1e/� �q�W [/e6e5_.e,j3e5e+d� �d�dӃ G d�dՄ d�e(�Z7e)d�d�d��e)d�d�d��e)d�d�d��gZ8x e8D ]Z/e0e7e/j1e/� �q$W [/e8e7_.e,j3e7e+d� �d�d܃ G d�dބ d�e(�Z9e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)�d d�d�g!Z:x e:D ]Z/e0e9e/j1e/� �q�W [/e:e9_.e,j3e9e+�d ��d�d� G �d�d� �de(�Z;e)�dd��d�e)�dd��d�e)�d d��d�e)�d
d��d�gZ<x e<D ]Z/e0e;e/j1e/� �qTW [/e<e;_.e,j3e;e+�d ��d �d
� G �d�d� �de(�Z=e)�dd�d��gZ>x e>D ]Z/e0e=e/j1e/� �q�W [/e>e=_.e,j3e=e+�d ��d�d� G �d�d� �dej'�Z?e,j3e?e+d� ��d� �d�d� Z@�d�d� ZAe � rj�dZB�d ZC�d ZD�d ZE�d ZF�d ZGn$�d!ZB�d"ZC�d#ZD�d$ZE�d%ZF�d&ZGyeHZIW n" eJk
� r� �d'�d(� ZIY nX eIZHyeKZKW n" eJk
� r� �d)�d*� ZKY nX e �
r�d+�d,� ZLejMZN�d-�d.� ZOe ZPn>�d/�d,� ZL�d0�d1� ZN�d2�d.� ZOG �d3�d4� �d4e �ZPeKZKe#eL�d5� ejQeB�ZRejQeC�ZSejQeD�ZTejQeE�ZUejQeF�ZVejQeG�ZWe �
r��d6�d7� ZX�d8�d9� ZY�d:�d;� ZZ�d<�d=� Z[ej\�d>�Z]ej\�d?�Z^ej\�d@�Z_nT�dA�d7� ZX�dB�d9� ZY�dC�d;� ZZ�dD�d=� Z[ej\�dE�Z]ej\�dF�Z^ej\�dG�Z_e#eX�dH� e#eY�dI� e#eZ�dJ� e#e[�dK� e � r�dL�dM� Z`�dN�dO� ZaebZcddldZdedje�dP�jfZg[dejhd�ZiejjZkelZmddlnZnenjoZoenjpZp�dQZqej
d
d
k� r �dRZr�dSZsn �dTZr�dUZsnj�dV�dM� Z`�dW�dO� ZaecZcebZg�dX�dY� Zi�dZ�d[� Zkejtejuev�ZmddloZoeojo ZoZp�d\Zq�dRZr�dSZse#e`�d]� e#ea�d^� �d_�dQ� Zw�d`�dT� Zx�da�dU� Zye � r�eze4j{�db�Z|�d��dc�dd�Z}n�d��de�df�Z|e|�dg� ej
dd� �d�k�
re|�dh� n.ej
dd� �d�k�
r8e|�di� n �dj�dk� Z~eze4j{�dld�Zedk�
rj�dm�dn� Zej
dd� �d�k �
r�eZ��do�dn� Ze#e}�dp� ej
dd� �d�k �
r�ej�ej�f�dq�dr�Z�nej�Z��ds�dt� Z��du�dv� Z��dw�dx� Z�g Z�e+Z�e�� j��dy�dk �rg e�_�ej��rbx>e�ej��D ]0\Z�Z�ee��j+d k�r*e�j1e+k�r*ej�e�= P �q*W [�[�ej�j�e,� dS (� z6Utilities for writing code that runs on Python 2 and 3� )�absolute_importNz'Benjamin Peterson <benjamin@python.org>z1.10.0� � � �java� � c @ s e Zd Zdd� ZdS )�Xc C s dS )Nr r l � )�selfr
r
�/usr/lib/python3.6/six.py�__len__> s z X.__len__N)�__name__�
__module__� __qualname__r
r
r
r
r r < s r �? c C s
|| _ dS )z Add documentation to a function.N)�__doc__)�func�docr
r
r �_add_docK s r c C s t | � tj| S )z7Import module, returning the module after the last dot.)�
__import__�sys�modules)�namer
r
r �_import_moduleP s r c @ s e Zd Zdd� Zdd� ZdS )�
_LazyDescrc C s
|| _ d S )N)r )r r r
r
r �__init__X s z_LazyDescr.__init__c C sB | j � }t|| j|� yt|j| j� W n tk
r< Y nX |S )N)�_resolve�setattrr �delattr� __class__�AttributeError)r �obj�tp�resultr
r
r �__get__[ s z_LazyDescr.__get__N)r r r r r% r
r
r
r r V s r c s. e Zd Zd� fdd� Zdd� Zdd� Z� ZS ) � MovedModuleNc s2 t t| �j|� tr(|d kr |}|| _n|| _d S )N)�superr& r �PY3�mod)r r �old�new)r r
r r i s zMovedModule.__init__c C s
t | j�S )N)r r) )r r
r
r r r s zMovedModule._resolvec C s" | j � }t||�}t| ||� |S )N)r �getattrr )r �attr�_module�valuer
r
r � __getattr__u s
zMovedModule.__getattr__)N)r r r r r r0 �
__classcell__r
r
)r r r& g s r& c s( e Zd Z� fdd�Zdd� Zg Z� ZS )� _LazyModulec s t t| �j|� | jj| _d S )N)r' r2 r r r )r r )r r
r r ~ s z_LazyModule.__init__c C s ddg}|dd� | j D �7 }|S )Nr r c S s g | ]
}|j �qS r
)r )�.0r- r
r
r �
<listcomp>� s z'_LazyModule.__dir__.<locals>.<listcomp>)�_moved_attributes)r Zattrsr
r
r �__dir__� s z_LazyModule.__dir__)r r r r r6 r5 r1 r
r
)r r r2 | s r2 c s& e Zd Zd� fdd� Zdd� Z� ZS )�MovedAttributeNc sd t t| �j|� trH|d kr |}|| _|d kr@|d kr<|}n|}|| _n|| _|d krZ|}|| _d S )N)r' r7 r r( r) r- )r r Zold_modZnew_modZold_attrZnew_attr)r r
r r � s zMovedAttribute.__init__c C s t | j�}t|| j�S )N)r r) r, r- )r �moduler
r
r r � s
zMovedAttribute._resolve)NN)r r r r r r1 r
r
)r r r7 � s r7 c @ sV e Zd ZdZdd� Zdd� Zdd� Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z e Z dS )�_SixMetaPathImporterz�
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
c C s || _ i | _d S )N)r �
known_modules)r Zsix_module_namer
r
r r � s z _SixMetaPathImporter.__init__c G s& x |D ]}|| j | jd | < qW d S )N�.)r: r )r r) Z fullnames�fullnamer
r
r � _add_module� s
z _SixMetaPathImporter._add_modulec C s | j | jd | S )Nr; )r: r )r r< r
r
r � _get_module� s z _SixMetaPathImporter._get_moduleNc C s || j kr| S d S )N)r: )r r< �pathr
r
r � find_module� s
z _SixMetaPathImporter.find_modulec C s0 y
| j | S tk
r* td| ��Y nX d S )Nz!This loader does not know module )r: �KeyError� ImportError)r r< r
r
r Z __get_module� s
z!_SixMetaPathImporter.__get_modulec C sR y
t j| S tk
r Y nX | j|�}t|t�r>|j� }n| |_|t j|< |S )N)r r rA � _SixMetaPathImporter__get_module�
isinstancer& r �
__loader__)r r< r) r
r
r � load_module� s
z _SixMetaPathImporter.load_modulec C s t | j|�d�S )z�
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
�__path__)�hasattrrC )r r< r
r
r �
is_package� s z _SixMetaPathImporter.is_packagec C s | j |� dS )z;Return None
Required, if is_package is implementedN)rC )r r< r
r
r �get_code� s
z _SixMetaPathImporter.get_code)N)
r r r r r r= r> r@ rC rF rI rJ �
get_sourcer
r
r
r r9 � s
r9 c @ s e Zd ZdZg ZdS )� _MovedItemsz Lazy loading of moved objectsN)r r r r rG r
r
r
r rL � s rL Z cStringIO�io�StringIO�filter� itertools�builtinsZifilter� filterfalseZ ifilterfalse�inputZ __builtin__Z raw_input�internr �map�imap�getcwd�osZgetcwdu�getcwdb�rangeZxrangeZ
reload_module� importlibZimp�reload�reduce� functoolsZ shlex_quoteZpipesZshlexZquote�UserDict� collections�UserList�
UserString�zipZizip� zip_longestZ izip_longestZ configparserZ ConfigParser�copyregZcopy_regZdbm_gnuZgdbmzdbm.gnuZ
_dummy_threadZ dummy_threadZhttp_cookiejarZ cookielibzhttp.cookiejarZ http_cookiesZCookiez http.cookiesZ
html_entitiesZhtmlentitydefsz
html.entitiesZ html_parserZ
HTMLParserz html.parserZ http_clientZhttplibz http.clientZemail_mime_multipartzemail.MIMEMultipartzemail.mime.multipartZemail_mime_nonmultipartzemail.MIMENonMultipartzemail.mime.nonmultipartZemail_mime_textzemail.MIMETextzemail.mime.textZemail_mime_basezemail.MIMEBasezemail.mime.baseZBaseHTTPServerz http.serverZ
CGIHTTPServerZSimpleHTTPServerZcPickle�pickleZqueueZQueue�reprlib�reprZ socketserverZ SocketServer�_threadZthreadZtkinterZTkinterZtkinter_dialogZDialogztkinter.dialogZtkinter_filedialogZ
FileDialogztkinter.filedialogZtkinter_scrolledtextZ ScrolledTextztkinter.scrolledtextZtkinter_simpledialogZ SimpleDialogztkinter.simpledialogZ tkinter_tixZTixz tkinter.tixZ tkinter_ttkZttkz tkinter.ttkZtkinter_constantsZ Tkconstantsztkinter.constantsZ tkinter_dndZTkdndz tkinter.dndZtkinter_colorchooserZtkColorChooserztkinter.colorchooserZtkinter_commondialogZtkCommonDialogztkinter.commondialogZtkinter_tkfiledialogZ tkFileDialogZ tkinter_fontZtkFontz tkinter.fontZtkinter_messageboxZ tkMessageBoxztkinter.messageboxZtkinter_tksimpledialogZtkSimpleDialogZ urllib_parsez.moves.urllib_parsez urllib.parseZ urllib_errorz.moves.urllib_errorz urllib.errorZurllibz
.moves.urllibZurllib_robotparser� robotparserzurllib.robotparserZ
xmlrpc_clientZ xmlrpclibz
xmlrpc.clientZ
xmlrpc_serverZSimpleXMLRPCServerz
xmlrpc.serverZwin32�winreg�_winregzmoves.z.moves�movesc @ s e Zd ZdZdS )� Module_six_moves_urllib_parsez7Lazy loading of moved objects in six.moves.urllib_parseN)r r r r r
r
r
r rn @ s rn Z ParseResultZurlparseZ SplitResultZparse_qsZ parse_qslZ urldefragZurljoinZurlsplitZ
urlunparseZ
urlunsplitZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ
splitqueryZsplittagZ splituserZ
uses_fragmentZ uses_netlocZ uses_paramsZ
uses_queryZ
uses_relativezmoves.urllib_parsezmoves.urllib.parsec @ s e Zd ZdZdS )� Module_six_moves_urllib_errorz7Lazy loading of moved objects in six.moves.urllib_errorN)r r r r r
r
r
r ro h s ro ZURLErrorZurllib2Z HTTPErrorZContentTooShortErrorz.moves.urllib.errorzmoves.urllib_errorzmoves.urllib.errorc @ s e Zd ZdZdS )� Module_six_moves_urllib_requestz9Lazy loading of moved objects in six.moves.urllib_requestN)r r r r r
r
r
r rp | s rp Zurlopenzurllib.requestZinstall_openerZ build_openerZ pathname2urlZ url2pathnameZ
getproxiesZRequestZOpenerDirectorZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZ BaseHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZHTTPErrorProcessorZ urlretrieveZ
urlcleanupZ URLopenerZFancyURLopenerZ proxy_bypassz.moves.urllib.requestzmoves.urllib_requestzmoves.urllib.requestc @ s e Zd ZdZdS )� Module_six_moves_urllib_responsez:Lazy loading of moved objects in six.moves.urllib_responseN)r r r r r
r
r
r rq � s rq Zaddbasezurllib.responseZ addclosehookZaddinfoZ
addinfourlz.moves.urllib.responsezmoves.urllib_responsezmoves.urllib.responsec @ s e Zd ZdZdS )�#Module_six_moves_urllib_robotparserz=Lazy loading of moved objects in six.moves.urllib_robotparserN)r r r r r
r
r
r rr � s rr ZRobotFileParserz.moves.urllib.robotparserzmoves.urllib_robotparserzmoves.urllib.robotparserc @ sN e Zd ZdZg Zejd�Zejd�Zejd�Z ejd�Z
ejd�Z dd� Z d S )
�Module_six_moves_urllibzICreate a six.moves.urllib namespace that resembles the Python 3 namespacezmoves.urllib_parsezmoves.urllib_errorzmoves.urllib_requestzmoves.urllib_responsezmoves.urllib_robotparserc C s dddddgS )N�parse�error�request�responserj r
)r r
r
r r6 � s z Module_six_moves_urllib.__dir__N)
r r r r rG � _importerr> rt ru rv rw rj r6 r
r
r
r rs � s
rs z moves.urllibc C s t t| j| � dS )zAdd an item to six.moves.N)r rL r )Zmover
r
r �add_move� s ry c C sX yt t| � W nD tk
rR y tj| = W n" tk
rL td| f ��Y nX Y nX dS )zRemove item from six.moves.zno such move, %rN)r rL r! rm �__dict__rA )r r
r
r � remove_move� s r{ �__func__�__self__� __closure__�__code__� __defaults__� __globals__�im_funcZim_selfZ func_closureZ func_codeZ
func_defaultsZ func_globalsc C s | j � S )N)�next)�itr
r
r �advance_iterator s r� c C s t dd� t| �jD ��S )Nc s s | ]}d |j kV qdS )�__call__N)rz )r3 �klassr
r
r � <genexpr> s zcallable.<locals>.<genexpr>)�any�type�__mro__)r" r
r
r �callable s r� c C s | S )Nr
)�unboundr
r
r �get_unbound_function s r� c C s | S )Nr
)r �clsr
r
r �create_unbound_method s r� c C s | j S )N)r� )r� r
r
r r� " s c C s t j| ||j�S )N)�types�
MethodTyper )r r" r
r
r �create_bound_method% s r� c C s t j| d |�S )N)r� r� )r r� r
r
r r� ( s c @ s e Zd Zdd� ZdS )�Iteratorc C s t | �j| �S )N)r� �__next__)r r
r
r r� - s z
Iterator.nextN)r r r r� r
r
r
r r� + s r� z3Get the function out of a possibly unbound functionc K s t | jf |��S )N)�iter�keys)�d�kwr
r
r �iterkeys> s r� c K s t | jf |��S )N)r� �values)r� r� r
r
r �
itervaluesA s r� c K s t | jf |��S )N)r� �items)r� r� r
r
r � iteritemsD s r� c K s t | jf |��S )N)r� Zlists)r� r� r
r
r � iterlistsG s r� r� r� r� c K s | j f |�S )N)r� )r� r� r
r
r r� P s c K s | j f |�S )N)r� )r� r� r
r
r r� S s c K s | j f |�S )N)r� )r� r� r
r
r r� V s c K s | j f |�S )N)r� )r� r� r
r
r r� Y s �viewkeys�
viewvalues� viewitemsz1Return an iterator over the keys of a dictionary.z3Return an iterator over the values of a dictionary.z?Return an iterator over the (key, value) pairs of a dictionary.zBReturn an iterator over the (key, [values]) pairs of a dictionary.c C s
| j d�S )Nzlatin-1)�encode)�sr
r
r �bk s r� c C s | S )Nr
)r� r
r
r �un s r� z>B�assertCountEqualZassertRaisesRegexpZassertRegexpMatches�assertRaisesRegex� assertRegexc C s | S )Nr
)r� r
r
r r� � s c C s t | jdd�d�S )Nz\\z\\\\Zunicode_escape)�unicode�replace)r� r
r
r r� � s c C s t | d �S )Nr )�ord)Zbsr
r
r �byte2int� s r� c C s t | | �S )N)r� )Zbuf�ir
r
r �
indexbytes� s r� ZassertItemsEqualz Byte literalz Text literalc O s t | t�||�S )N)r, �_assertCountEqual)r �args�kwargsr
r
r r� � s c O s t | t�||�S )N)r, �_assertRaisesRegex)r r� r� r
r
r r� � s c O s t | t�||�S )N)r, � _assertRegex)r r� r� r
r
r r� � s �execc C s* |d kr| � }|j |k r"|j|��|�d S )N)�
__traceback__�with_traceback)r# r/ �tbr
r
r �reraise� s
r� c C sB |dkr*t jd�}|j}|dkr&|j}~n |dkr6|}td� dS )z Execute code in a namespace.Nr z exec _code_ in _globs_, _locs_)r � _getframe� f_globals�f_localsr� )Z_code_Z_globs_Z_locs_�framer
r
r �exec_� s
r� z9def reraise(tp, value, tb=None):
raise tp, value, tb
zrdef raise_from(value, from_value):
if from_value is None:
raise value
raise value from from_value
zCdef raise_from(value, from_value):
raise value from from_value
c C s | �d S )Nr
)r/ Z
from_valuer
r
r �
raise_from� s r� �printc
s6 |j dtj�� � dkrdS � fdd�}d}|j dd�}|dk r`t|t�rNd}nt|t�s`td��|j d d�}|dk r�t|t�r�d}nt|t�s�td
��|r�td ��|s�x | D ]}t|t�r�d}P q�W |r�td �}td
�}nd }d
}|dkr�|}|dk� r�|}x,t| �D ] \} }| �r ||� ||� �qW ||� dS )z4The new-style print function for Python 2.4 and 2.5.�fileNc sd t | t�st| �} t � t�rVt | t�rV� jd k rVt� dd �}|d krHd}| j� j|�} � j| � d S )N�errors�strict) rD �
basestring�strr� r� �encodingr, r� �write)�datar� )�fpr
r r� � s
zprint_.<locals>.writeF�sepTz sep must be None or a string�endz end must be None or a stringz$invalid keyword arguments to print()�
� )�popr �stdoutrD r� r� � TypeError� enumerate)
r� r� r� Z want_unicoder� r� �arg�newlineZspacer� r
)r� r �print_� sL
r� c O s< |j dtj�}|jdd�}t| |� |r8|d k r8|j� d S )Nr� �flushF)�getr r� r� �_printr� )r� r� r� r� r
r
r r� s
zReraise an exception.c s � ��fdd�}|S )Nc s t j�� ��| �} �| _| S )N)r^ �wraps� __wrapped__)�f)�assigned�updated�wrappedr
r �wrapper s zwraps.<locals>.wrapperr
)r� r� r� r� r
)r� r� r� r r� s r� c s& G � �fdd�d��}t j|df i �S )z%Create a base class with a metaclass.c s e Zd Z� �fdd�ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )Nr
)r� r Z
this_basesr� )�bases�metar
r �__new__' s z)with_metaclass.<locals>.metaclass.__new__N)r r r r� r
)r� r� r
r � metaclass% s r� Ztemporary_class)r� r� )r� r� r� r
)r� r� r �with_metaclass s r� c s � fdd�}|S )z6Class decorator for creating a class with a metaclass.c sl | j j� }|jd�}|d k rDt|t�r,|g}x|D ]}|j|� q2W |jdd � |jdd � � | j| j|�S )N� __slots__rz � __weakref__)rz �copyr� rD r� r� r � __bases__)r� Z orig_vars�slotsZ slots_var)r� r
r r� . s
z add_metaclass.<locals>.wrapperr
)r� r� r
)r� r �
add_metaclass, s r� c C s2 t r.d| jkr td| j ��| j| _dd� | _| S )a
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
�__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().c S s | j � jd�S )Nzutf-8)� __unicode__r� )r r
r
r �<lambda>J s z-python_2_unicode_compatible.<locals>.<lambda>)�PY2rz �
ValueErrorr r� r� )r� r
r
r �python_2_unicode_compatible< s
r� �__spec__)r r l i���l i���l l ���� )N)NN)r r )r r )r r )r r )�r Z
__future__r r^ rP �operatorr r� �
__author__� __version__� version_infor� r( ZPY34r� Z string_types�intZ
integer_typesr� Z class_typesZ text_type�bytesZ binary_type�maxsizeZMAXSIZEr� ZlongZ ClassTyper� �platform�
startswith�objectr �len�
OverflowErrorr r r r& �
ModuleTyper2 r7 r9 r rx rL r5 r- r r rD r= rm rn Z _urllib_parse_moved_attributesro Z _urllib_error_moved_attributesrp Z _urllib_request_moved_attributesrq Z!_urllib_response_moved_attributesrr Z$_urllib_robotparser_moved_attributesrs ry r{ Z
_meth_funcZ
_meth_selfZ
_func_closureZ
_func_codeZ_func_defaultsZ
_func_globalsr� r� � NameErrorr� r� r� r� r� r� �
attrgetterZget_method_functionZget_method_selfZget_function_closureZget_function_codeZget_function_defaultsZget_function_globalsr� r� r� r� � methodcallerr� r� r� r� r� �chrZunichr�struct�Struct�packZint2byte�
itemgetterr� �getitemr� r� Z iterbytesrM rN �BytesIOr� r� r� �partialrV r� r� r� r� r, rQ r� r� r� r� r� �WRAPPER_ASSIGNMENTS�WRAPPER_UPDATESr� r� r� r� rG � __package__�globalsr� r� �submodule_search_locations� meta_pathr� r� Zimporter�appendr
r
r
r �<module> s�
>
5 pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.pyc 0000644 00000000356 14751155150 0020527 0 ustar 00 3
���em � @ s d dl mZ ddlmZ dZdS )� )�absolute_import� )�ssl_match_hostnamer N)r )Z
__future__r � r �__all__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/packages/__pycache__/ordered_dict.cpython-36.opt-1.pyc 0000644 00000020173 14751155150 0022355 0 ustar 00 3
���e�" � @ st yd dl mZ W n ek
r0 d dlmZ Y nX yd dlmZmZmZ W n ek
r^ Y nX G dd� de �Z
dS )� )� get_ident)�KeysView�
ValuesView� ItemsViewc @ s e Zd ZdZdd� Zejfdd�Zejfdd�Zdd � Zd
d � Z d d
� Z
d6dd�Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd � Zd d � ZeZe� Zefd d �Zd7d"d#�Zi fd$d%�Zd&d'� Zd(d)� Zed8d*d+��Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z d4d5� Z!d!S )9� OrderedDictz)Dictionary that remembers insertion orderc O sn t |�dkr tdt |� ��y
| j W n6 tk
r\ g | _}||dg|dd�< i | _Y nX | j||� dS )z�Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
� z$expected at most 1 arguments, got %dN)�len� TypeError�_OrderedDict__root�AttributeError�_OrderedDict__map�_OrderedDict__update)�self�args�kwds�root� r �"/usr/lib/python3.6/ordered_dict.py�__init__ s
zOrderedDict.__init__c C sF || kr6| j }|d }|||g |d< |d< | j|< || ||� dS )z!od.__setitem__(i, y) <==> od[i]=yr r N)r
r )r �key�valueZ dict_setitemr �lastr r r � __setitem__, s
zOrderedDict.__setitem__c C s0 || |� | j j|�\}}}||d< ||d< dS )z od.__delitem__(y) <==> del od[y]r r N)r �pop)r r Z dict_delitem� link_prev� link_nextr r r � __delitem__6 s
zOrderedDict.__delitem__c c s2 | j }|d }x ||k r,|d V |d }qW dS )zod.__iter__() <==> iter(od)r � N)r
)r r �currr r r �__iter__? s
zOrderedDict.__iter__c c s2 | j }|d }x ||k r,|d V |d }qW dS )z#od.__reversed__() <==> reversed(od)r r N)r
)r r r r r r � __reversed__G s
zOrderedDict.__reversed__c C sh yDx | j j� D ]}|dd�= qW | j}||dg|dd�< | j j� W n tk
rX Y nX tj| � dS )z.od.clear() -> None. Remove all items from od.N)r �
itervaluesr
�clearr �dict)r Znoder r r r r" O s zOrderedDict.clearTc C s| | s t d��| j}|r8|d }|d }||d< ||d< n |d }|d }||d< ||d< |d }| j|= tj| |�}||fS )z�od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is emptyr r r )�KeyErrorr
r r# r )r r r �linkr r r r r r r �popitem[ s
zOrderedDict.popitemc C s t | �S )z od.keys() -> list of keys in od)�list)r r r r �keyst s zOrderedDict.keysc s � fdd�� D �S )z#od.values() -> list of values in odc s g | ] }� | �qS r r )�.0r )r r r �
<listcomp>z s z&OrderedDict.values.<locals>.<listcomp>r )r r )r r �valuesx s zOrderedDict.valuesc s � fdd�� D �S )z.od.items() -> list of (key, value) pairs in odc s g | ]}|� | f�qS r r )r) r )r r r r* ~ s z%OrderedDict.items.<locals>.<listcomp>r )r r )r r �items| s zOrderedDict.itemsc C s t | �S )z0od.iterkeys() -> an iterator over the keys in od)�iter)r r r r �iterkeys� s zOrderedDict.iterkeysc c s x| D ]}| | V qW dS )z2od.itervalues -> an iterator over the values in odNr )r �kr r r r! � s
zOrderedDict.itervaluesc c s x| D ]}|| | fV qW dS )z=od.iteritems -> an iterator over the (key, value) items in odNr )r r/ r r r � iteritems� s
zOrderedDict.iteritemsc O s� t | �dkr tdt | �f ��n | s,td��| d }f }t | �dkrL| d }t|t�rrx^|D ]}|| ||< q\W nDt|d�r�x8|j� D ]}|| ||< q�W nx|D ]\}}|||< q�W x |j� D ]\}}|||< q�W dS )a� od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
r z8update() takes at most 2 positional arguments (%d given)z,update() takes at least 1 argument (0 given)r r r( N)r r �
isinstancer# �hasattrr( r, )r r r �otherr r r r r �update� s&
zOrderedDict.updatec C s0 || kr| | }| |= |S || j kr,t|��|S )z�od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
)�_OrderedDict__markerr$ )r r �default�resultr r r r � s
zOrderedDict.popNc C s || kr| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r r6 r r r �
setdefault� s zOrderedDict.setdefaultc C sV t | �t� f}||krdS d||< z&| s6d| jjf S d| jj| j� f S ||= X dS )zod.__repr__() <==> repr(od)z...r z%s()z%s(%r)N)�id�
_get_ident� __class__�__name__r, )r Z
_repr_runningZcall_keyr r r �__repr__� s zOrderedDict.__repr__c s\ � fdd�� D �}t � �j� }x t t� �D ]}|j|d� q*W |rP� j|f|fS � j|ffS )z%Return state information for picklingc s g | ]}|� | g�qS r r )r) r/ )r r r r* � s z*OrderedDict.__reduce__.<locals>.<listcomp>N)�vars�copyr r r; )r r, Z inst_dictr/ r )r r �
__reduce__� s zOrderedDict.__reduce__c C s
| j | �S )z!od.copy() -> a shallow copy of od)r; )r r r r r? � s zOrderedDict.copyc C s | � }x|D ] }|||< q W |S )z�OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
r )�cls�iterabler �dr r r r �fromkeys� s
zOrderedDict.fromkeysc C s6 t |t�r*t| �t|�ko(| j� |j� kS tj| |�S )z�od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r1 r r r, r# �__eq__)r r3 r r r rE � s
zOrderedDict.__eq__c C s
| |k S )Nr )r r3 r r r �__ne__� s zOrderedDict.__ne__c C s t | �S )z@od.viewkeys() -> a set-like object providing a view on od's keys)r )r r r r �viewkeys� s zOrderedDict.viewkeysc C s t | �S )z<od.viewvalues() -> an object providing a view on od's values)r )r r r r �
viewvalues� s zOrderedDict.viewvaluesc C s t | �S )zBod.viewitems() -> a set-like object providing a view on od's items)r )r r r r � viewitems s zOrderedDict.viewitems)T)N)N)"r< �
__module__� __qualname__�__doc__r r# r r r r r" r& r( r+ r, r. r! r0 r4 r
�objectr5 r r8 r= r@ r? � classmethodrD rE rF rG rH rI r r r r r s:
r N) Zthreadr r: � ImportErrorZ dummy_threadZ_abcollr r r r# r r r r r �<module> s pip/_vendor/urllib3/packages/__pycache__/ordered_dict.cpython-36.pyc 0000644 00000020173 14751155150 0021416 0 ustar 00 3
���e�" � @ st yd dl mZ W n ek
r0 d dlmZ Y nX yd dlmZmZmZ W n ek
r^ Y nX G dd� de �Z
dS )� )� get_ident)�KeysView�
ValuesView� ItemsViewc @ s e Zd ZdZdd� Zejfdd�Zejfdd�Zdd � Zd
d � Z d d
� Z
d6dd�Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd � Zd d � ZeZe� Zefd d �Zd7d"d#�Zi fd$d%�Zd&d'� Zd(d)� Zed8d*d+��Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z d4d5� Z!d!S )9� OrderedDictz)Dictionary that remembers insertion orderc O sn t |�dkr tdt |� ��y
| j W n6 tk
r\ g | _}||dg|dd�< i | _Y nX | j||� dS )z�Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
� z$expected at most 1 arguments, got %dN)�len� TypeError�_OrderedDict__root�AttributeError�_OrderedDict__map�_OrderedDict__update)�self�args�kwds�root� r �"/usr/lib/python3.6/ordered_dict.py�__init__ s
zOrderedDict.__init__c C sF || kr6| j }|d }|||g |d< |d< | j|< || ||� dS )z!od.__setitem__(i, y) <==> od[i]=yr r N)r
r )r �key�valueZ dict_setitemr �lastr r r � __setitem__, s
zOrderedDict.__setitem__c C s0 || |� | j j|�\}}}||d< ||d< dS )z od.__delitem__(y) <==> del od[y]r r N)r �pop)r r Z dict_delitem� link_prev� link_nextr r r � __delitem__6 s
zOrderedDict.__delitem__c c s2 | j }|d }x ||k r,|d V |d }qW dS )zod.__iter__() <==> iter(od)r � N)r
)r r �currr r r �__iter__? s
zOrderedDict.__iter__c c s2 | j }|d }x ||k r,|d V |d }qW dS )z#od.__reversed__() <==> reversed(od)r r N)r
)r r r r r r � __reversed__G s
zOrderedDict.__reversed__c C sh yDx | j j� D ]}|dd�= qW | j}||dg|dd�< | j j� W n tk
rX Y nX tj| � dS )z.od.clear() -> None. Remove all items from od.N)r �
itervaluesr
�clearr �dict)r Znoder r r r r" O s zOrderedDict.clearTc C s| | s t d��| j}|r8|d }|d }||d< ||d< n |d }|d }||d< ||d< |d }| j|= tj| |�}||fS )z�od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
zdictionary is emptyr r r )�KeyErrorr
r r# r )r r r �linkr r r r r r r �popitem[ s
zOrderedDict.popitemc C s t | �S )z od.keys() -> list of keys in od)�list)r r r r �keyst s zOrderedDict.keysc s � fdd�� D �S )z#od.values() -> list of values in odc s g | ] }� | �qS r r )�.0r )r r r �
<listcomp>z s z&OrderedDict.values.<locals>.<listcomp>r )r r )r r �valuesx s zOrderedDict.valuesc s � fdd�� D �S )z.od.items() -> list of (key, value) pairs in odc s g | ]}|� | f�qS r r )r) r )r r r r* ~ s z%OrderedDict.items.<locals>.<listcomp>r )r r )r r �items| s zOrderedDict.itemsc C s t | �S )z0od.iterkeys() -> an iterator over the keys in od)�iter)r r r r �iterkeys� s zOrderedDict.iterkeysc c s x| D ]}| | V qW dS )z2od.itervalues -> an iterator over the values in odNr )r �kr r r r! � s
zOrderedDict.itervaluesc c s x| D ]}|| | fV qW dS )z=od.iteritems -> an iterator over the (key, value) items in odNr )r r/ r r r � iteritems� s
zOrderedDict.iteritemsc O s� t | �dkr tdt | �f ��n | s,td��| d }f }t | �dkrL| d }t|t�rrx^|D ]}|| ||< q\W nDt|d�r�x8|j� D ]}|| ||< q�W nx|D ]\}}|||< q�W x |j� D ]\}}|||< q�W dS )a� od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
r z8update() takes at most 2 positional arguments (%d given)z,update() takes at least 1 argument (0 given)r r r( N)r r �
isinstancer# �hasattrr( r, )r r r �otherr r r r r �update� s&
zOrderedDict.updatec C s0 || kr| | }| |= |S || j kr,t|��|S )z�od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
)�_OrderedDict__markerr$ )r r �default�resultr r r r � s
zOrderedDict.popNc C s || kr| | S || |< |S )zDod.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in odr )r r r6 r r r �
setdefault� s zOrderedDict.setdefaultc C sV t | �t� f}||krdS d||< z&| s6d| jjf S d| jj| j� f S ||= X dS )zod.__repr__() <==> repr(od)z...r z%s()z%s(%r)N)�id�
_get_ident� __class__�__name__r, )r Z
_repr_runningZcall_keyr r r �__repr__� s zOrderedDict.__repr__c s\ � fdd�� D �}t � �j� }x t t� �D ]}|j|d� q*W |rP� j|f|fS � j|ffS )z%Return state information for picklingc s g | ]}|� | g�qS r r )r) r/ )r r r r* � s z*OrderedDict.__reduce__.<locals>.<listcomp>N)�vars�copyr r r; )r r, Z inst_dictr/ r )r r �
__reduce__� s zOrderedDict.__reduce__c C s
| j | �S )z!od.copy() -> a shallow copy of od)r; )r r r r r? � s zOrderedDict.copyc C s | � }x|D ] }|||< q W |S )z�OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
r )�cls�iterabler �dr r r r �fromkeys� s
zOrderedDict.fromkeysc C s6 t |t�r*t| �t|�ko(| j� |j� kS tj| |�S )z�od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
)r1 r r r, r# �__eq__)r r3 r r r rE � s
zOrderedDict.__eq__c C s
| |k S )Nr )r r3 r r r �__ne__� s zOrderedDict.__ne__c C s t | �S )z@od.viewkeys() -> a set-like object providing a view on od's keys)r )r r r r �viewkeys� s zOrderedDict.viewkeysc C s t | �S )z<od.viewvalues() -> an object providing a view on od's values)r )r r r r �
viewvalues� s zOrderedDict.viewvaluesc C s t | �S )zBod.viewitems() -> a set-like object providing a view on od's items)r )r r r r � viewitems s zOrderedDict.viewitems)T)N)N)"r< �
__module__� __qualname__�__doc__r r# r r r r r" r& r( r+ r, r. r! r0 r4 r
�objectr5 r r8 r= r@ r? � classmethodrD rE rF rG rH rI r r r r r s:
r N) Zthreadr r: � ImportErrorZ dummy_threadZ_abcollr r r r# r r r r r �<module> s pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.pyc 0000644 00000057532 14751155150 0017603 0 ustar 00 3
���e�u � I @ sr d Z ddlmZ ddlZddlZddlZddlZddlZdZdZ ej
d dkZ ej
d dkZ ej
dd� �dzkZ
e r�efZefZefZeZeZejZn�efZeefZeejfZe ZeZej j d �r�e�d|�ZnLG d d
� d
e �Z ye!e � � W n e"k
�r e�d~�ZY n X e�d��Z[ dd� Z#dd� Z$G dd� de �Z%G dd� de%�Z&G dd� dej'�Z(G dd� de%�Z)G dd � d e �Z*e*e+�Z,G d d � d e(�Z-e)d d d d!�e)d"d#d$d%d"�e)d&d#d#d'd&�e)d(d)d$d*d(�e)d+d)d,�e)d-d#d$d.d-�e)d/d0d0d1d/�e)d2d0d0d/d2�e)d3d)d$d4d3�e)d5d)e
�r d6nd7d8�e)d9d)d:�e)d;d<d=d>�e)d!d!d �e)d?d?d@�e)dAdAd@�e)dBdBd@�e)d4d)d$d4d3�e)dCd#d$dDdC�e)dEd#d#dFdE�e&d$d)�e&dGdH�e&dIdJ�e&dKdLdM�e&dNdOdN�e&dPdQdR�e&dSdTdU�e&dVdWdX�e&dYdZd[�e&d\d]d^�e&d_d`da�e&dbdcdd�e&dedfdg�e&dhdidj�e&dkdkdl�e&dmdmdl�e&dndndl�e&dododp�e&dqdr�e&dsdt�e&dudv�e&dwdxdw�e&dydz�e&d{d|d}�e&d~dd��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�e+d� d��e&d�e+d� d��e&d�e+d� e+d� �e&d�d�d��e&d�d�d��e&d�d�d��g>Z.ej d�k�rZe.e&d�d��g7 Z.x:e.D ]2Z/e0e-e/j1e/� e2e/e&��r`e,j3e/d�e/j1 � �q`W [/e.e-_.e-e+d� �Z4e,j3e4d�� G d�d�� d�e(�Z5e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d>d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��gZ6x e6D ]Z/e0e5e/j1e/� �q�W [/e6e5_.e,j3e5e+d� �d�dӃ G d�dՄ d�e(�Z7e)d�d�d��e)d�d�d��e)d�d�d��gZ8x e8D ]Z/e0e7e/j1e/� �q$W [/e8e7_.e,j3e7e+d� �d�d܃ G d�dބ d�e(�Z9e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)�d d�d�g!Z:x e:D ]Z/e0e9e/j1e/� �q�W [/e:e9_.e,j3e9e+�d ��d�d� G �d�d� �de(�Z;e)�dd��d�e)�dd��d�e)�d d��d�e)�d
d��d�gZ<x e<D ]Z/e0e;e/j1e/� �qTW [/e<e;_.e,j3e;e+�d ��d �d
� G �d�d� �de(�Z=e)�dd�d��gZ>x e>D ]Z/e0e=e/j1e/� �q�W [/e>e=_.e,j3e=e+�d ��d�d� G �d�d� �dej'�Z?e,j3e?e+d� ��d� �d�d� Z@�d�d� ZAe � rj�dZB�d ZC�d ZD�d ZE�d ZF�d ZGn$�d!ZB�d"ZC�d#ZD�d$ZE�d%ZF�d&ZGyeHZIW n" eJk
� r� �d'�d(� ZIY nX eIZHyeKZKW n" eJk
� r� �d)�d*� ZKY nX e �
r�d+�d,� ZLejMZN�d-�d.� ZOe ZPn>�d/�d,� ZL�d0�d1� ZN�d2�d.� ZOG �d3�d4� �d4e �ZPeKZKe#eL�d5� ejQeB�ZRejQeC�ZSejQeD�ZTejQeE�ZUejQeF�ZVejQeG�ZWe �
r��d6�d7� ZX�d8�d9� ZY�d:�d;� ZZ�d<�d=� Z[ej\�d>�Z]ej\�d?�Z^ej\�d@�Z_nT�dA�d7� ZX�dB�d9� ZY�dC�d;� ZZ�dD�d=� Z[ej\�dE�Z]ej\�dF�Z^ej\�dG�Z_e#eX�dH� e#eY�dI� e#eZ�dJ� e#e[�dK� e � r�dL�dM� Z`�dN�dO� ZaebZcddldZdedje�dP�jfZg[dejhd�ZiejjZkelZmddlnZnenjoZoenjpZp�dQZqej
d
d
k� r �dRZr�dSZsn �dTZr�dUZsnj�dV�dM� Z`�dW�dO� ZaecZcebZg�dX�dY� Zi�dZ�d[� Zkejtejuev�ZmddloZoeojo ZoZp�d\Zq�dRZr�dSZse#e`�d]� e#ea�d^� �d_�dQ� Zw�d`�dT� Zx�da�dU� Zye � r�eze4j{�db�Z|�d��dc�dd�Z}n�d��de�df�Z|e|�dg� ej
dd� �d�k�
re|�dh� n.ej
dd� �d�k�
r8e|�di� n �dj�dk� Z~eze4j{�dld�Zedk�
rj�dm�dn� Zej
dd� �d�k �
r�eZ��do�dn� Ze#e}�dp� ej
dd� �d�k �
r�ej�ej�f�dq�dr�Z�nej�Z��ds�dt� Z��du�dv� Z��dw�dx� Z�g Z�e+Z�e�� j��dy�dk �rg e�_�ej��rbx>e�ej��D ]0\Z�Z�ee��j+d k�r*e�j1e+k�r*ej�e�= P �q*W [�[�ej�j�e,� dS (� z6Utilities for writing code that runs on Python 2 and 3� )�absolute_importNz'Benjamin Peterson <benjamin@python.org>z1.10.0� � � �java� � c @ s e Zd Zdd� ZdS )�Xc C s dS )Nr r l � )�selfr
r
�/usr/lib/python3.6/six.py�__len__> s z X.__len__N)�__name__�
__module__� __qualname__r
r
r
r
r r < s r �? c C s
|| _ dS )z Add documentation to a function.N)�__doc__)�func�docr
r
r �_add_docK s r c C s t | � tj| S )z7Import module, returning the module after the last dot.)�
__import__�sys�modules)�namer
r
r �_import_moduleP s r c @ s e Zd Zdd� Zdd� ZdS )�
_LazyDescrc C s
|| _ d S )N)r )r r r
r
r �__init__X s z_LazyDescr.__init__c C sB | j � }t|| j|� yt|j| j� W n tk
r< Y nX |S )N)�_resolve�setattrr �delattr� __class__�AttributeError)r �obj�tp�resultr
r
r �__get__[ s z_LazyDescr.__get__N)r r r r r% r
r
r
r r V s r c s. e Zd Zd� fdd� Zdd� Zdd� Z� ZS ) � MovedModuleNc s2 t t| �j|� tr(|d kr |}|| _n|| _d S )N)�superr& r �PY3�mod)r r �old�new)r r
r r i s zMovedModule.__init__c C s
t | j�S )N)r r) )r r
r
r r r s zMovedModule._resolvec C s" | j � }t||�}t| ||� |S )N)r �getattrr )r �attr�_module�valuer
r
r � __getattr__u s
zMovedModule.__getattr__)N)r r r r r r0 �
__classcell__r
r
)r r r& g s r& c s( e Zd Z� fdd�Zdd� Zg Z� ZS )� _LazyModulec s t t| �j|� | jj| _d S )N)r' r2 r r r )r r )r r
r r ~ s z_LazyModule.__init__c C s ddg}|dd� | j D �7 }|S )Nr r c S s g | ]
}|j �qS r
)r )�.0r- r
r
r �
<listcomp>� s z'_LazyModule.__dir__.<locals>.<listcomp>)�_moved_attributes)r Zattrsr
r
r �__dir__� s z_LazyModule.__dir__)r r r r r6 r5 r1 r
r
)r r r2 | s r2 c s& e Zd Zd� fdd� Zdd� Z� ZS )�MovedAttributeNc sd t t| �j|� trH|d kr |}|| _|d kr@|d kr<|}n|}|| _n|| _|d krZ|}|| _d S )N)r' r7 r r( r) r- )r r Zold_modZnew_modZold_attrZnew_attr)r r
r r � s zMovedAttribute.__init__c C s t | j�}t|| j�S )N)r r) r, r- )r �moduler
r
r r � s
zMovedAttribute._resolve)NN)r r r r r r1 r
r
)r r r7 � s r7 c @ sV e Zd ZdZdd� Zdd� Zdd� Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z e Z dS )�_SixMetaPathImporterz�
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
c C s || _ i | _d S )N)r �
known_modules)r Zsix_module_namer
r
r r � s z _SixMetaPathImporter.__init__c G s& x |D ]}|| j | jd | < qW d S )N�.)r: r )r r) Z fullnames�fullnamer
r
r � _add_module� s
z _SixMetaPathImporter._add_modulec C s | j | jd | S )Nr; )r: r )r r< r
r
r � _get_module� s z _SixMetaPathImporter._get_moduleNc C s || j kr| S d S )N)r: )r r< �pathr
r
r � find_module� s
z _SixMetaPathImporter.find_modulec C s0 y
| j | S tk
r* td| ��Y nX d S )Nz!This loader does not know module )r: �KeyError� ImportError)r r< r
r
r Z __get_module� s
z!_SixMetaPathImporter.__get_modulec C sR y
t j| S tk
r Y nX | j|�}t|t�r>|j� }n| |_|t j|< |S )N)r r rA � _SixMetaPathImporter__get_module�
isinstancer& r �
__loader__)r r< r) r
r
r � load_module� s
z _SixMetaPathImporter.load_modulec C s t | j|�d�S )z�
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
�__path__)�hasattrrC )r r< r
r
r �
is_package� s z _SixMetaPathImporter.is_packagec C s | j |� dS )z;Return None
Required, if is_package is implementedN)rC )r r< r
r
r �get_code� s
z _SixMetaPathImporter.get_code)N)
r r r r r r= r> r@ rC rF rI rJ �
get_sourcer
r
r
r r9 � s
r9 c @ s e Zd ZdZg ZdS )� _MovedItemsz Lazy loading of moved objectsN)r r r r rG r
r
r
r rL � s rL Z cStringIO�io�StringIO�filter� itertools�builtinsZifilter� filterfalseZ ifilterfalse�inputZ __builtin__Z raw_input�internr �map�imap�getcwd�osZgetcwdu�getcwdb�rangeZxrangeZ
reload_module� importlibZimp�reload�reduce� functoolsZ shlex_quoteZpipesZshlexZquote�UserDict� collections�UserList�
UserString�zipZizip� zip_longestZ izip_longestZ configparserZ ConfigParser�copyregZcopy_regZdbm_gnuZgdbmzdbm.gnuZ
_dummy_threadZ dummy_threadZhttp_cookiejarZ cookielibzhttp.cookiejarZ http_cookiesZCookiez http.cookiesZ
html_entitiesZhtmlentitydefsz
html.entitiesZ html_parserZ
HTMLParserz html.parserZ http_clientZhttplibz http.clientZemail_mime_multipartzemail.MIMEMultipartzemail.mime.multipartZemail_mime_nonmultipartzemail.MIMENonMultipartzemail.mime.nonmultipartZemail_mime_textzemail.MIMETextzemail.mime.textZemail_mime_basezemail.MIMEBasezemail.mime.baseZBaseHTTPServerz http.serverZ
CGIHTTPServerZSimpleHTTPServerZcPickle�pickleZqueueZQueue�reprlib�reprZ socketserverZ SocketServer�_threadZthreadZtkinterZTkinterZtkinter_dialogZDialogztkinter.dialogZtkinter_filedialogZ
FileDialogztkinter.filedialogZtkinter_scrolledtextZ ScrolledTextztkinter.scrolledtextZtkinter_simpledialogZ SimpleDialogztkinter.simpledialogZ tkinter_tixZTixz tkinter.tixZ tkinter_ttkZttkz tkinter.ttkZtkinter_constantsZ Tkconstantsztkinter.constantsZ tkinter_dndZTkdndz tkinter.dndZtkinter_colorchooserZtkColorChooserztkinter.colorchooserZtkinter_commondialogZtkCommonDialogztkinter.commondialogZtkinter_tkfiledialogZ tkFileDialogZ tkinter_fontZtkFontz tkinter.fontZtkinter_messageboxZ tkMessageBoxztkinter.messageboxZtkinter_tksimpledialogZtkSimpleDialogZ urllib_parsez.moves.urllib_parsez urllib.parseZ urllib_errorz.moves.urllib_errorz urllib.errorZurllibz
.moves.urllibZurllib_robotparser� robotparserzurllib.robotparserZ
xmlrpc_clientZ xmlrpclibz
xmlrpc.clientZ
xmlrpc_serverZSimpleXMLRPCServerz
xmlrpc.serverZwin32�winreg�_winregzmoves.z.moves�movesc @ s e Zd ZdZdS )� Module_six_moves_urllib_parsez7Lazy loading of moved objects in six.moves.urllib_parseN)r r r r r
r
r
r rn @ s rn Z ParseResultZurlparseZ SplitResultZparse_qsZ parse_qslZ urldefragZurljoinZurlsplitZ
urlunparseZ
urlunsplitZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ
splitqueryZsplittagZ splituserZ
uses_fragmentZ uses_netlocZ uses_paramsZ
uses_queryZ
uses_relativezmoves.urllib_parsezmoves.urllib.parsec @ s e Zd ZdZdS )� Module_six_moves_urllib_errorz7Lazy loading of moved objects in six.moves.urllib_errorN)r r r r r
r
r
r ro h s ro ZURLErrorZurllib2Z HTTPErrorZContentTooShortErrorz.moves.urllib.errorzmoves.urllib_errorzmoves.urllib.errorc @ s e Zd ZdZdS )� Module_six_moves_urllib_requestz9Lazy loading of moved objects in six.moves.urllib_requestN)r r r r r
r
r
r rp | s rp Zurlopenzurllib.requestZinstall_openerZ build_openerZ pathname2urlZ url2pathnameZ
getproxiesZRequestZOpenerDirectorZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZ BaseHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZHTTPErrorProcessorZ urlretrieveZ
urlcleanupZ URLopenerZFancyURLopenerZ proxy_bypassz.moves.urllib.requestzmoves.urllib_requestzmoves.urllib.requestc @ s e Zd ZdZdS )� Module_six_moves_urllib_responsez:Lazy loading of moved objects in six.moves.urllib_responseN)r r r r r
r
r
r rq � s rq Zaddbasezurllib.responseZ addclosehookZaddinfoZ
addinfourlz.moves.urllib.responsezmoves.urllib_responsezmoves.urllib.responsec @ s e Zd ZdZdS )�#Module_six_moves_urllib_robotparserz=Lazy loading of moved objects in six.moves.urllib_robotparserN)r r r r r
r
r
r rr � s rr ZRobotFileParserz.moves.urllib.robotparserzmoves.urllib_robotparserzmoves.urllib.robotparserc @ sN e Zd ZdZg Zejd�Zejd�Zejd�Z ejd�Z
ejd�Z dd� Z d S )
�Module_six_moves_urllibzICreate a six.moves.urllib namespace that resembles the Python 3 namespacezmoves.urllib_parsezmoves.urllib_errorzmoves.urllib_requestzmoves.urllib_responsezmoves.urllib_robotparserc C s dddddgS )N�parse�error�request�responserj r
)r r
r
r r6 � s z Module_six_moves_urllib.__dir__N)
r r r r rG � _importerr> rt ru rv rw rj r6 r
r
r
r rs � s
rs z moves.urllibc C s t t| j| � dS )zAdd an item to six.moves.N)r rL r )Zmover
r
r �add_move� s ry c C sX yt t| � W nD tk
rR y tj| = W n" tk
rL td| f ��Y nX Y nX dS )zRemove item from six.moves.zno such move, %rN)r rL r! rm �__dict__rA )r r
r
r � remove_move� s r{ �__func__�__self__� __closure__�__code__� __defaults__� __globals__�im_funcZim_selfZ func_closureZ func_codeZ
func_defaultsZ func_globalsc C s | j � S )N)�next)�itr
r
r �advance_iterator s r� c C s t dd� t| �jD ��S )Nc s s | ]}d |j kV qdS )�__call__N)rz )r3 �klassr
r
r � <genexpr> s zcallable.<locals>.<genexpr>)�any�type�__mro__)r" r
r
r �callable s r� c C s | S )Nr
)�unboundr
r
r �get_unbound_function s r� c C s | S )Nr
)r �clsr
r
r �create_unbound_method s r� c C s | j S )N)r� )r� r
r
r r� " s c C s t j| ||j�S )N)�types�
MethodTyper )r r" r
r
r �create_bound_method% s r� c C s t j| d |�S )N)r� r� )r r� r
r
r r� ( s c @ s e Zd Zdd� ZdS )�Iteratorc C s t | �j| �S )N)r� �__next__)r r
r
r r� - s z
Iterator.nextN)r r r r� r
r
r
r r� + s r� z3Get the function out of a possibly unbound functionc K s t | jf |��S )N)�iter�keys)�d�kwr
r
r �iterkeys> s r� c K s t | jf |��S )N)r� �values)r� r� r
r
r �
itervaluesA s r� c K s t | jf |��S )N)r� �items)r� r� r
r
r � iteritemsD s r� c K s t | jf |��S )N)r� Zlists)r� r� r
r
r � iterlistsG s r� r� r� r� c K s | j f |�S )N)r� )r� r� r
r
r r� P s c K s | j f |�S )N)r� )r� r� r
r
r r� S s c K s | j f |�S )N)r� )r� r� r
r
r r� V s c K s | j f |�S )N)r� )r� r� r
r
r r� Y s �viewkeys�
viewvalues� viewitemsz1Return an iterator over the keys of a dictionary.z3Return an iterator over the values of a dictionary.z?Return an iterator over the (key, value) pairs of a dictionary.zBReturn an iterator over the (key, [values]) pairs of a dictionary.c C s
| j d�S )Nzlatin-1)�encode)�sr
r
r �bk s r� c C s | S )Nr
)r� r
r
r �un s r� z>B�assertCountEqualZassertRaisesRegexpZassertRegexpMatches�assertRaisesRegex� assertRegexc C s | S )Nr
)r� r
r
r r� � s c C s t | jdd�d�S )Nz\\z\\\\Zunicode_escape)�unicode�replace)r� r
r
r r� � s c C s t | d �S )Nr )�ord)Zbsr
r
r �byte2int� s r� c C s t | | �S )N)r� )Zbuf�ir
r
r �
indexbytes� s r� ZassertItemsEqualz Byte literalz Text literalc O s t | t�||�S )N)r, �_assertCountEqual)r �args�kwargsr
r
r r� � s c O s t | t�||�S )N)r, �_assertRaisesRegex)r r� r� r
r
r r� � s c O s t | t�||�S )N)r, � _assertRegex)r r� r� r
r
r r� � s �execc C s* |d kr| � }|j |k r"|j|��|�d S )N)�
__traceback__�with_traceback)r# r/ �tbr
r
r �reraise� s
r� c C sB |dkr*t jd�}|j}|dkr&|j}~n |dkr6|}td� dS )z Execute code in a namespace.Nr z exec _code_ in _globs_, _locs_)r � _getframe� f_globals�f_localsr� )Z_code_Z_globs_Z_locs_�framer
r
r �exec_� s
r� z9def reraise(tp, value, tb=None):
raise tp, value, tb
zrdef raise_from(value, from_value):
if from_value is None:
raise value
raise value from from_value
zCdef raise_from(value, from_value):
raise value from from_value
c C s | �d S )Nr
)r/ Z
from_valuer
r
r �
raise_from� s r� �printc
s6 |j dtj�� � dkrdS � fdd�}d}|j dd�}|dk r`t|t�rNd}nt|t�s`td��|j d d�}|dk r�t|t�r�d}nt|t�s�td
��|r�td ��|s�x | D ]}t|t�r�d}P q�W |r�td �}td
�}nd }d
}|dkr�|}|dk� r�|}x,t| �D ] \} }| �r ||� ||� �qW ||� dS )z4The new-style print function for Python 2.4 and 2.5.�fileNc sd t | t�st| �} t � t�rVt | t�rV� jd k rVt� dd �}|d krHd}| j� j|�} � j| � d S )N�errors�strict) rD �
basestring�strr� r� �encodingr, r� �write)�datar� )�fpr
r r� � s
zprint_.<locals>.writeF�sepTz sep must be None or a string�endz end must be None or a stringz$invalid keyword arguments to print()�
� )�popr �stdoutrD r� r� � TypeError� enumerate)
r� r� r� Z want_unicoder� r� �arg�newlineZspacer� r
)r� r �print_� sL
r� c O s< |j dtj�}|jdd�}t| |� |r8|d k r8|j� d S )Nr� �flushF)�getr r� r� �_printr� )r� r� r� r� r
r
r r� s
zReraise an exception.c s � ��fdd�}|S )Nc s t j�� ��| �} �| _| S )N)r^ �wraps� __wrapped__)�f)�assigned�updated�wrappedr
r �wrapper s zwraps.<locals>.wrapperr
)r� r� r� r� r
)r� r� r� r r� s r� c s& G � �fdd�d��}t j|df i �S )z%Create a base class with a metaclass.c s e Zd Z� �fdd�ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )Nr
)r� r Z
this_basesr� )�bases�metar
r �__new__' s z)with_metaclass.<locals>.metaclass.__new__N)r r r r� r
)r� r� r
r � metaclass% s r� Ztemporary_class)r� r� )r� r� r� r
)r� r� r �with_metaclass s r� c s � fdd�}|S )z6Class decorator for creating a class with a metaclass.c sl | j j� }|jd�}|d k rDt|t�r,|g}x|D ]}|j|� q2W |jdd � |jdd � � | j| j|�S )N� __slots__rz � __weakref__)rz �copyr� rD r� r� r � __bases__)r� Z orig_vars�slotsZ slots_var)r� r
r r� . s
z add_metaclass.<locals>.wrapperr
)r� r� r
)r� r �
add_metaclass, s r� c C s2 t r.d| jkr td| j ��| j| _dd� | _| S )a
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
�__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().c S s | j � jd�S )Nzutf-8)� __unicode__r� )r r
r
r �<lambda>J s z-python_2_unicode_compatible.<locals>.<lambda>)�PY2rz �
ValueErrorr r� r� )r� r
r
r �python_2_unicode_compatible< s
r� �__spec__)r r l i���l i���l l ���� )N)NN)r r )r r )r r )r r )�r Z
__future__r r^ rP �operatorr r� �
__author__� __version__� version_infor� r( ZPY34r� Z string_types�intZ
integer_typesr� Z class_typesZ text_type�bytesZ binary_type�maxsizeZMAXSIZEr� ZlongZ ClassTyper� �platform�
startswith�objectr �len�
OverflowErrorr r r r& �
ModuleTyper2 r7 r9 r rx rL r5 r- r r rD r= rm rn Z _urllib_parse_moved_attributesro Z _urllib_error_moved_attributesrp Z _urllib_request_moved_attributesrq Z!_urllib_response_moved_attributesrr Z$_urllib_robotparser_moved_attributesrs ry r{ Z
_meth_funcZ
_meth_selfZ
_func_closureZ
_func_codeZ_func_defaultsZ
_func_globalsr� r� � NameErrorr� r� r� r� r� r� �
attrgetterZget_method_functionZget_method_selfZget_function_closureZget_function_codeZget_function_defaultsZget_function_globalsr� r� r� r� � methodcallerr� r� r� r� r� �chrZunichr�struct�Struct�packZint2byte�
itemgetterr� �getitemr� r� Z iterbytesrM rN �BytesIOr� r� r� �partialrV r� r� r� r� r, rQ r� r� r� r� r� �WRAPPER_ASSIGNMENTS�WRAPPER_UPDATESr� r� r� r� rG � __package__�globalsr� r� �submodule_search_locations� meta_pathr� r� Zimporter�appendr
r
r
r �<module> s�
>
5 pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.opt-1.pyc 0000644 00000006157 14751155150 0026773 0 ustar 00 3
���eF � @ st d Z ddlZddlZy ddlZW n ek
r8 dZY nX dZG dd� de�Zddd�Zd d
� Z d d � Z
d
d� Z dS )zJThe match_hostname() function from Python 3.3.3, essential when using SSL.� Nz3.5.0.1c @ s e Zd ZdS )�CertificateErrorN)�__name__�
__module__� __qualname__� r r �%/usr/lib/python3.6/_implementation.pyr s r � c
C s� g }| s dS | j d�}|d }|dd� }|jd�}||krLtdt| � ��|s`| j� |j� kS |dkrt|jd� n>|jd �s�|jd �r�|jtj|�� n|jtj|�j d
d �� x |D ]}|jtj|�� q�W tj
d d
j |� d tj �} | j
|�S )zhMatching according to RFC 6125, section 6.4.3
http://tools.ietf.org/html/rfc6125#section-6.4.3
F�.r r N�*z,too many wildcards in certificate DNS name: z[^.]+zxn--z\*z[^.]*z\Az\.z\Z)�split�countr �repr�lower�append�
startswith�re�escape�replace�compile�join�
IGNORECASE�match)
Zdn�hostnameZ
max_wildcardsZpats�partsZleftmostZ remainderZ wildcardsZfragZpatr r r �_dnsname_match s*
r c C s& t | t�r"tjdk r"t| ddd�} | S )N� �ascii�strict)�encoding�errors)r )�
isinstance�str�sys� version_infoZunicode)�objr r r � _to_unicodeO s r% c C s t jt| �j� �}||kS )z�Exact matching of IP addresses.
RFC 6125 explicitly doesn't define an algorithm for this
(section 1.7.2 - "Out of Scope").
)� ipaddress�
ip_addressr% �rstrip)Zipname�host_ipZipr r r �_ipaddress_matchT s r* c C s� | s t d��ytjt|��}W nP t k
r6 d}Y n: tk
rL d}Y n$ tk
rn tdkrhd}n� Y nX g }| jdf �}xb|D ]Z\}}|dkr�|dkr�t||�r�dS |j|� q�|dkr�|dk r�t ||�r�dS |j|� q�W |�s8xL| jdf �D ]<}x6|D ].\}}|dk�rt||��r$dS |j|� �qW q�W t
|�dk�rdt d |d
j t
t|��f ��n,t
|�dk�r�t d ||d f ��nt d
��dS )a) Verify that *cert* (in decoded format as returned by
SSLSocket.getpeercert()) matches the *hostname*. RFC 2818 and RFC 6125
rules are followed, but IP addresses are not accepted for *hostname*.
CertificateError is raised on failure. On success, the function
returns nothing.
ztempty or no certificate, match_hostname needs a SSL socket or SSL context with either CERT_OPTIONAL or CERT_REQUIREDNZsubjectAltNameZDNSz
IP AddressZsubjectZ
commonNamer z&hostname %r doesn't match either of %sz, z hostname %r doesn't match %rr z=no appropriate commonName or subjectAltName fields were found)�
ValueErrorr& r' r% � UnicodeError�AttributeError�getr r r* �lenr r �mapr
)Zcertr r) ZdnsnamesZsan�key�value�subr r r �match_hostname` sJ
r4 )r ) �__doc__r r" r& � ImportError� __version__r+ r r r% r* r4 r r r r �<module> s
5 pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.pyc 0000644 00000000740 14751155150 0024377 0 ustar 00 3
���e� � @ s� d dl Z y&e jd k r ed��d dlmZmZ W nN ek
r| yd dlmZmZ W n$ ek
rv ddlmZmZ Y nX Y nX d
ZdS ) � N� � zFallback to vendored code)�CertificateError�match_hostname� r r )r r )r r ) �sys� version_info� ImportErrorZsslr r Z backports.ssl_match_hostnameZ_implementation�__all__� r r � /usr/lib/python3.6/__init__.py�<module> s
pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.pyc 0000644 00000006157 14751155150 0026034 0 ustar 00 3
���eF � @ st d Z ddlZddlZy ddlZW n ek
r8 dZY nX dZG dd� de�Zddd�Zd d
� Z d d � Z
d
d� Z dS )zJThe match_hostname() function from Python 3.3.3, essential when using SSL.� Nz3.5.0.1c @ s e Zd ZdS )�CertificateErrorN)�__name__�
__module__� __qualname__� r r �%/usr/lib/python3.6/_implementation.pyr s r � c
C s� g }| s dS | j d�}|d }|dd� }|jd�}||krLtdt| � ��|s`| j� |j� kS |dkrt|jd� n>|jd �s�|jd �r�|jtj|�� n|jtj|�j d
d �� x |D ]}|jtj|�� q�W tj
d d
j |� d tj �} | j
|�S )zhMatching according to RFC 6125, section 6.4.3
http://tools.ietf.org/html/rfc6125#section-6.4.3
F�.r r N�*z,too many wildcards in certificate DNS name: z[^.]+zxn--z\*z[^.]*z\Az\.z\Z)�split�countr �repr�lower�append�
startswith�re�escape�replace�compile�join�
IGNORECASE�match)
Zdn�hostnameZ
max_wildcardsZpats�partsZleftmostZ remainderZ wildcardsZfragZpatr r r �_dnsname_match s*
r c C s& t | t�r"tjdk r"t| ddd�} | S )N� �ascii�strict)�encoding�errors)r )�
isinstance�str�sys� version_infoZunicode)�objr r r � _to_unicodeO s r% c C s t jt| �j� �}||kS )z�Exact matching of IP addresses.
RFC 6125 explicitly doesn't define an algorithm for this
(section 1.7.2 - "Out of Scope").
)� ipaddress�
ip_addressr% �rstrip)Zipname�host_ipZipr r r �_ipaddress_matchT s r* c C s� | s t d��ytjt|��}W nP t k
r6 d}Y n: tk
rL d}Y n$ tk
rn tdkrhd}n� Y nX g }| jdf �}xb|D ]Z\}}|dkr�|dkr�t||�r�dS |j|� q�|dkr�|dk r�t ||�r�dS |j|� q�W |�s8xL| jdf �D ]<}x6|D ].\}}|dk�rt||��r$dS |j|� �qW q�W t
|�dk�rdt d |d
j t
t|��f ��n,t
|�dk�r�t d ||d f ��nt d
��dS )a) Verify that *cert* (in decoded format as returned by
SSLSocket.getpeercert()) matches the *hostname*. RFC 2818 and RFC 6125
rules are followed, but IP addresses are not accepted for *hostname*.
CertificateError is raised on failure. On success, the function
returns nothing.
ztempty or no certificate, match_hostname needs a SSL socket or SSL context with either CERT_OPTIONAL or CERT_REQUIREDNZsubjectAltNameZDNSz
IP AddressZsubjectZ
commonNamer z&hostname %r doesn't match either of %sz, z hostname %r doesn't match %rr z=no appropriate commonName or subjectAltName fields were found)�
ValueErrorr& r' r% � UnicodeError�AttributeError�getr r r* �lenr r �mapr
)Zcertr r) ZdnsnamesZsan�key�value�subr r r �match_hostname` sJ
r4 )r ) �__doc__r r" r& � ImportError� __version__r+ r r r% r* r4 r r r r �<module> s
5 pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000740 14751155150 0025336 0 ustar 00 3
���e� � @ s� d dl Z y&e jd k r ed��d dlmZmZ W nN ek
r| yd dlmZmZ W n$ ek
rv ddlmZmZ Y nX Y nX d
ZdS ) � N� � zFallback to vendored code)�CertificateError�match_hostname� r r )r r )r r ) �sys� version_info� ImportErrorZsslr r Z backports.ssl_match_hostnameZ_implementation�__all__� r r � /usr/lib/python3.6/__init__.py�<module> s
pip/_vendor/urllib3/packages/ssl_match_hostname/_implementation.py 0000644 00000013106 14751155150 0021540 0 ustar 00 """The match_hostname() function from Python 3.3.3, essential when using SSL."""
# Note: This file is under the PSF license as the code comes from the python
# stdlib. http://docs.python.org/3/license.html
import re
import sys
# ipaddress has been backported to 2.6+ in pypi. If it is installed on the
# system, use it to handle IPAddress ServerAltnames (this was added in
# python-3.5) otherwise only do DNS matching. This allows
# backports.ssl_match_hostname to continue to be used all the way back to
# python-2.4.
try:
import ipaddress
except ImportError:
ipaddress = None
__version__ = '3.5.0.1'
class CertificateError(ValueError):
pass
def _dnsname_match(dn, hostname, max_wildcards=1):
"""Matching according to RFC 6125, section 6.4.3
http://tools.ietf.org/html/rfc6125#section-6.4.3
"""
pats = []
if not dn:
return False
# Ported from python3-syntax:
# leftmost, *remainder = dn.split(r'.')
parts = dn.split(r'.')
leftmost = parts[0]
remainder = parts[1:]
wildcards = leftmost.count('*')
if wildcards > max_wildcards:
# Issue #17980: avoid denials of service by refusing more
# than one wildcard per fragment. A survey of established
# policy among SSL implementations showed it to be a
# reasonable choice.
raise CertificateError(
"too many wildcards in certificate DNS name: " + repr(dn))
# speed up common case w/o wildcards
if not wildcards:
return dn.lower() == hostname.lower()
# RFC 6125, section 6.4.3, subitem 1.
# The client SHOULD NOT attempt to match a presented identifier in which
# the wildcard character comprises a label other than the left-most label.
if leftmost == '*':
# When '*' is a fragment by itself, it matches a non-empty dotless
# fragment.
pats.append('[^.]+')
elif leftmost.startswith('xn--') or hostname.startswith('xn--'):
# RFC 6125, section 6.4.3, subitem 3.
# The client SHOULD NOT attempt to match a presented identifier
# where the wildcard character is embedded within an A-label or
# U-label of an internationalized domain name.
pats.append(re.escape(leftmost))
else:
# Otherwise, '*' matches any dotless string, e.g. www*
pats.append(re.escape(leftmost).replace(r'\*', '[^.]*'))
# add the remaining fragments, ignore any wildcards
for frag in remainder:
pats.append(re.escape(frag))
pat = re.compile(r'\A' + r'\.'.join(pats) + r'\Z', re.IGNORECASE)
return pat.match(hostname)
def _to_unicode(obj):
if isinstance(obj, str) and sys.version_info < (3,):
obj = unicode(obj, encoding='ascii', errors='strict')
return obj
def _ipaddress_match(ipname, host_ip):
"""Exact matching of IP addresses.
RFC 6125 explicitly doesn't define an algorithm for this
(section 1.7.2 - "Out of Scope").
"""
# OpenSSL may add a trailing newline to a subjectAltName's IP address
# Divergence from upstream: ipaddress can't handle byte str
ip = ipaddress.ip_address(_to_unicode(ipname).rstrip())
return ip == host_ip
def match_hostname(cert, hostname):
"""Verify that *cert* (in decoded format as returned by
SSLSocket.getpeercert()) matches the *hostname*. RFC 2818 and RFC 6125
rules are followed, but IP addresses are not accepted for *hostname*.
CertificateError is raised on failure. On success, the function
returns nothing.
"""
if not cert:
raise ValueError("empty or no certificate, match_hostname needs a "
"SSL socket or SSL context with either "
"CERT_OPTIONAL or CERT_REQUIRED")
try:
# Divergence from upstream: ipaddress can't handle byte str
host_ip = ipaddress.ip_address(_to_unicode(hostname))
except ValueError:
# Not an IP address (common case)
host_ip = None
except UnicodeError:
# Divergence from upstream: Have to deal with ipaddress not taking
# byte strings. addresses should be all ascii, so we consider it not
# an ipaddress in this case
host_ip = None
except AttributeError:
# Divergence from upstream: Make ipaddress library optional
if ipaddress is None:
host_ip = None
else:
raise
dnsnames = []
san = cert.get('subjectAltName', ())
for key, value in san:
if key == 'DNS':
if host_ip is None and _dnsname_match(value, hostname):
return
dnsnames.append(value)
elif key == 'IP Address':
if host_ip is not None and _ipaddress_match(value, host_ip):
return
dnsnames.append(value)
if not dnsnames:
# The subject is only checked when there is no dNSName entry
# in subjectAltName
for sub in cert.get('subject', ()):
for key, value in sub:
# XXX according to RFC 2818, the most specific Common Name
# must be used.
if key == 'commonName':
if _dnsname_match(value, hostname):
return
dnsnames.append(value)
if len(dnsnames) > 1:
raise CertificateError("hostname %r "
"doesn't match either of %s"
% (hostname, ', '.join(map(repr, dnsnames))))
elif len(dnsnames) == 1:
raise CertificateError("hostname %r "
"doesn't match %r"
% (hostname, dnsnames[0]))
else:
raise CertificateError("no appropriate commonName or "
"subjectAltName fields were found")
pip/_vendor/urllib3/packages/ssl_match_hostname/__init__.py 0000644 00000001260 14751155150 0020111 0 ustar 00 import sys
try:
# Our match_hostname function is the same as 3.5's, so we only want to
# import the match_hostname function if it's at least that good.
if sys.version_info < (3, 5):
raise ImportError("Fallback to vendored code")
from ssl import CertificateError, match_hostname
except ImportError:
try:
# Backport of the function from a pypi module
from backports.ssl_match_hostname import CertificateError, match_hostname
except ImportError:
# Our vendored copy
from ._implementation import CertificateError, match_hostname
# Not needed, but documenting what we provide.
__all__ = ('CertificateError', 'match_hostname')
pip/_vendor/urllib3/connectionpool.py 0000644 00000105036 14751155150 0013760 0 ustar 00 from __future__ import absolute_import
import errno
import logging
import sys
import warnings
from socket import error as SocketError, timeout as SocketTimeout
import socket
from .exceptions import (
ClosedPoolError,
ProtocolError,
EmptyPoolError,
HeaderParsingError,
HostChangedError,
LocationValueError,
MaxRetryError,
ProxyError,
ReadTimeoutError,
SSLError,
TimeoutError,
InsecureRequestWarning,
NewConnectionError,
)
from .packages.ssl_match_hostname import CertificateError
from .packages import six
from .packages.six.moves import queue
from .connection import (
port_by_scheme,
DummyConnection,
HTTPConnection, HTTPSConnection, VerifiedHTTPSConnection,
HTTPException, BaseSSLError,
)
from .request import RequestMethods
from .response import HTTPResponse
from .util.connection import is_connection_dropped
from .util.request import set_file_position
from .util.response import assert_header_parsing
from .util.retry import Retry
from .util.timeout import Timeout
from .util.url import get_host, Url
if six.PY2:
# Queue is imported for side effects on MS Windows
import Queue as _unused_module_Queue # noqa: F401
xrange = six.moves.xrange
log = logging.getLogger(__name__)
_Default = object()
# Pool objects
class ConnectionPool(object):
"""
Base class for all connection pools, such as
:class:`.HTTPConnectionPool` and :class:`.HTTPSConnectionPool`.
"""
scheme = None
QueueCls = queue.LifoQueue
def __init__(self, host, port=None):
if not host:
raise LocationValueError("No host specified.")
self.host = _ipv6_host(host).lower()
self._proxy_host = host.lower()
self.port = port
def __str__(self):
return '%s(host=%r, port=%r)' % (type(self).__name__,
self.host, self.port)
def __enter__(self):
return self
def __exit__(self, exc_type, exc_val, exc_tb):
self.close()
# Return False to re-raise any potential exceptions
return False
def close(self):
"""
Close all pooled connections and disable the pool.
"""
pass
# This is taken from http://hg.python.org/cpython/file/7aaba721ebc0/Lib/socket.py#l252
_blocking_errnos = set([errno.EAGAIN, errno.EWOULDBLOCK])
class HTTPConnectionPool(ConnectionPool, RequestMethods):
"""
Thread-safe connection pool for one host.
:param host:
Host used for this HTTP Connection (e.g. "localhost"), passed into
:class:`httplib.HTTPConnection`.
:param port:
Port used for this HTTP Connection (None is equivalent to 80), passed
into :class:`httplib.HTTPConnection`.
:param strict:
Causes BadStatusLine to be raised if the status line can't be parsed
as a valid HTTP/1.0 or 1.1 status line, passed into
:class:`httplib.HTTPConnection`.
.. note::
Only works in Python 2. This parameter is ignored in Python 3.
:param timeout:
Socket timeout in seconds for each individual connection. This can
be a float or integer, which sets the timeout for the HTTP request,
or an instance of :class:`urllib3.util.Timeout` which gives you more
fine-grained control over request timeouts. After the constructor has
been parsed, this is always a `urllib3.util.Timeout` object.
:param maxsize:
Number of connections to save that can be reused. More than 1 is useful
in multithreaded situations. If ``block`` is set to False, more
connections will be created but they will not be saved once they've
been used.
:param block:
If set to True, no more than ``maxsize`` connections will be used at
a time. When no free connections are available, the call will block
until a connection has been released. This is a useful side effect for
particular multithreaded situations where one does not want to use more
than maxsize connections per host to prevent flooding.
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
:param retries:
Retry configuration to use by default with requests in this pool.
:param _proxy:
Parsed proxy URL, should not be used directly, instead, see
:class:`urllib3.connectionpool.ProxyManager`"
:param _proxy_headers:
A dictionary with proxy headers, should not be used directly,
instead, see :class:`urllib3.connectionpool.ProxyManager`"
:param \\**conn_kw:
Additional parameters are used to create fresh :class:`urllib3.connection.HTTPConnection`,
:class:`urllib3.connection.HTTPSConnection` instances.
"""
scheme = 'http'
ConnectionCls = HTTPConnection
ResponseCls = HTTPResponse
def __init__(self, host, port=None, strict=False,
timeout=Timeout.DEFAULT_TIMEOUT, maxsize=1, block=False,
headers=None, retries=None,
_proxy=None, _proxy_headers=None,
**conn_kw):
ConnectionPool.__init__(self, host, port)
RequestMethods.__init__(self, headers)
self.strict = strict
if not isinstance(timeout, Timeout):
timeout = Timeout.from_float(timeout)
if retries is None:
retries = Retry.DEFAULT
self.timeout = timeout
self.retries = retries
self.pool = self.QueueCls(maxsize)
self.block = block
self.proxy = _proxy
self.proxy_headers = _proxy_headers or {}
# Fill the queue up so that doing get() on it will block properly
for _ in xrange(maxsize):
self.pool.put(None)
# These are mostly for testing and debugging purposes.
self.num_connections = 0
self.num_requests = 0
self.conn_kw = conn_kw
if self.proxy:
# Enable Nagle's algorithm for proxies, to avoid packet fragmentation.
# We cannot know if the user has added default socket options, so we cannot replace the
# list.
self.conn_kw.setdefault('socket_options', [])
def _new_conn(self):
"""
Return a fresh :class:`HTTPConnection`.
"""
self.num_connections += 1
log.debug("Starting new HTTP connection (%d): %s",
self.num_connections, self.host)
conn = self.ConnectionCls(host=self.host, port=self.port,
timeout=self.timeout.connect_timeout,
strict=self.strict, **self.conn_kw)
return conn
def _get_conn(self, timeout=None):
"""
Get a connection. Will return a pooled connection if one is available.
If no connections are available and :prop:`.block` is ``False``, then a
fresh connection is returned.
:param timeout:
Seconds to wait before giving up and raising
:class:`urllib3.exceptions.EmptyPoolError` if the pool is empty and
:prop:`.block` is ``True``.
"""
conn = None
try:
conn = self.pool.get(block=self.block, timeout=timeout)
except AttributeError: # self.pool is None
raise ClosedPoolError(self, "Pool is closed.")
except queue.Empty:
if self.block:
raise EmptyPoolError(self,
"Pool reached maximum size and no more "
"connections are allowed.")
pass # Oh well, we'll create a new connection then
# If this is a persistent connection, check if it got disconnected
if conn and is_connection_dropped(conn):
log.debug("Resetting dropped connection: %s", self.host)
conn.close()
if getattr(conn, 'auto_open', 1) == 0:
# This is a proxied connection that has been mutated by
# httplib._tunnel() and cannot be reused (since it would
# attempt to bypass the proxy)
conn = None
return conn or self._new_conn()
def _put_conn(self, conn):
"""
Put a connection back into the pool.
:param conn:
Connection object for the current host and port as returned by
:meth:`._new_conn` or :meth:`._get_conn`.
If the pool is already full, the connection is closed and discarded
because we exceeded maxsize. If connections are discarded frequently,
then maxsize should be increased.
If the pool is closed, then the connection will be closed and discarded.
"""
try:
self.pool.put(conn, block=False)
return # Everything is dandy, done.
except AttributeError:
# self.pool is None.
pass
except queue.Full:
# This should never happen if self.block == True
log.warning(
"Connection pool is full, discarding connection: %s",
self.host)
# Connection never got put back into the pool, close it.
if conn:
conn.close()
def _validate_conn(self, conn):
"""
Called right before a request is made, after the socket is created.
"""
pass
def _prepare_proxy(self, conn):
# Nothing to do for HTTP connections.
pass
def _get_timeout(self, timeout):
""" Helper that always returns a :class:`urllib3.util.Timeout` """
if timeout is _Default:
return self.timeout.clone()
if isinstance(timeout, Timeout):
return timeout.clone()
else:
# User passed us an int/float. This is for backwards compatibility,
# can be removed later
return Timeout.from_float(timeout)
def _raise_timeout(self, err, url, timeout_value):
"""Is the error actually a timeout? Will raise a ReadTimeout or pass"""
if isinstance(err, SocketTimeout):
raise ReadTimeoutError(self, url, "Read timed out. (read timeout=%s)" % timeout_value)
# See the above comment about EAGAIN in Python 3. In Python 2 we have
# to specifically catch it and throw the timeout error
if hasattr(err, 'errno') and err.errno in _blocking_errnos:
raise ReadTimeoutError(self, url, "Read timed out. (read timeout=%s)" % timeout_value)
# Catch possible read timeouts thrown as SSL errors. If not the
# case, rethrow the original. We need to do this because of:
# http://bugs.python.org/issue10272
if 'timed out' in str(err) or 'did not complete (read)' in str(err): # Python 2.6
raise ReadTimeoutError(self, url, "Read timed out. (read timeout=%s)" % timeout_value)
def _make_request(self, conn, method, url, timeout=_Default, chunked=False,
**httplib_request_kw):
"""
Perform a request on a given urllib connection object taken from our
pool.
:param conn:
a connection from one of our connection pools
:param timeout:
Socket timeout in seconds for the request. This can be a
float or integer, which will set the same timeout value for
the socket connect and the socket read, or an instance of
:class:`urllib3.util.Timeout`, which gives you more fine-grained
control over your timeouts.
"""
self.num_requests += 1
timeout_obj = self._get_timeout(timeout)
timeout_obj.start_connect()
conn.timeout = timeout_obj.connect_timeout
# Trigger any extra validation we need to do.
try:
self._validate_conn(conn)
except (SocketTimeout, BaseSSLError) as e:
# Py2 raises this as a BaseSSLError, Py3 raises it as socket timeout.
self._raise_timeout(err=e, url=url, timeout_value=conn.timeout)
raise
# conn.request() calls httplib.*.request, not the method in
# urllib3.request. It also calls makefile (recv) on the socket.
if chunked:
conn.request_chunked(method, url, **httplib_request_kw)
else:
conn.request(method, url, **httplib_request_kw)
# Reset the timeout for the recv() on the socket
read_timeout = timeout_obj.read_timeout
# App Engine doesn't have a sock attr
if getattr(conn, 'sock', None):
# In Python 3 socket.py will catch EAGAIN and return None when you
# try and read into the file pointer created by http.client, which
# instead raises a BadStatusLine exception. Instead of catching
# the exception and assuming all BadStatusLine exceptions are read
# timeouts, check for a zero timeout before making the request.
if read_timeout == 0:
raise ReadTimeoutError(
self, url, "Read timed out. (read timeout=%s)" % read_timeout)
if read_timeout is Timeout.DEFAULT_TIMEOUT:
conn.sock.settimeout(socket.getdefaulttimeout())
else: # None or a value
conn.sock.settimeout(read_timeout)
# Receive the response from the server
try:
try: # Python 2.7, use buffering of HTTP responses
httplib_response = conn.getresponse(buffering=True)
except TypeError: # Python 2.6 and older, Python 3
try:
httplib_response = conn.getresponse()
except Exception as e:
# Remove the TypeError from the exception chain in Python 3;
# otherwise it looks like a programming error was the cause.
six.raise_from(e, None)
except (SocketTimeout, BaseSSLError, SocketError) as e:
self._raise_timeout(err=e, url=url, timeout_value=read_timeout)
raise
# AppEngine doesn't have a version attr.
http_version = getattr(conn, '_http_vsn_str', 'HTTP/?')
log.debug("%s://%s:%s \"%s %s %s\" %s %s", self.scheme, self.host, self.port,
method, url, http_version, httplib_response.status,
httplib_response.length)
try:
assert_header_parsing(httplib_response.msg)
except (HeaderParsingError, TypeError) as hpe: # Platform-specific: Python 3
log.warning(
'Failed to parse headers (url=%s): %s',
self._absolute_url(url), hpe, exc_info=True)
return httplib_response
def _absolute_url(self, path):
return Url(scheme=self.scheme, host=self.host, port=self.port, path=path).url
def close(self):
"""
Close all pooled connections and disable the pool.
"""
# Disable access to the pool
old_pool, self.pool = self.pool, None
try:
while True:
conn = old_pool.get(block=False)
if conn:
conn.close()
except queue.Empty:
pass # Done.
def is_same_host(self, url):
"""
Check if the given ``url`` is a member of the same host as this
connection pool.
"""
if url.startswith('/'):
return True
# TODO: Add optional support for socket.gethostbyname checking.
scheme, host, port = get_host(url)
host = _ipv6_host(host).lower()
# Use explicit default port for comparison when none is given
if self.port and not port:
port = port_by_scheme.get(scheme)
elif not self.port and port == port_by_scheme.get(scheme):
port = None
return (scheme, host, port) == (self.scheme, self.host, self.port)
def urlopen(self, method, url, body=None, headers=None, retries=None,
redirect=True, assert_same_host=True, timeout=_Default,
pool_timeout=None, release_conn=None, chunked=False,
body_pos=None, **response_kw):
"""
Get a connection from the pool and perform an HTTP request. This is the
lowest level call for making a request, so you'll need to specify all
the raw details.
.. note::
More commonly, it's appropriate to use a convenience method provided
by :class:`.RequestMethods`, such as :meth:`request`.
.. note::
`release_conn` will only behave as expected if
`preload_content=False` because we want to make
`preload_content=False` the default behaviour someday soon without
breaking backwards compatibility.
:param method:
HTTP request method (such as GET, POST, PUT, etc.)
:param body:
Data to send in the request body (useful for creating
POST requests, see HTTPConnectionPool.post_url for
more convenience).
:param headers:
Dictionary of custom headers to send, such as User-Agent,
If-None-Match, etc. If None, pool headers are used. If provided,
these headers completely replace any pool-specific headers.
:param retries:
Configure the number of retries to allow before raising a
:class:`~urllib3.exceptions.MaxRetryError` exception.
Pass ``None`` to retry until you receive a response. Pass a
:class:`~urllib3.util.retry.Retry` object for fine-grained control
over different types of retries.
Pass an integer number to retry connection errors that many times,
but no other types of errors. Pass zero to never retry.
If ``False``, then retries are disabled and any exception is raised
immediately. Also, instead of raising a MaxRetryError on redirects,
the redirect response will be returned.
:type retries: :class:`~urllib3.util.retry.Retry`, False, or an int.
:param redirect:
If True, automatically handle redirects (status codes 301, 302,
303, 307, 308). Each redirect counts as a retry. Disabling retries
will disable redirect, too.
:param assert_same_host:
If ``True``, will make sure that the host of the pool requests is
consistent else will raise HostChangedError. When False, you can
use the pool on an HTTP proxy and request foreign hosts.
:param timeout:
If specified, overrides the default timeout for this one
request. It may be a float (in seconds) or an instance of
:class:`urllib3.util.Timeout`.
:param pool_timeout:
If set and the pool is set to block=True, then this method will
block for ``pool_timeout`` seconds and raise EmptyPoolError if no
connection is available within the time period.
:param release_conn:
If False, then the urlopen call will not release the connection
back into the pool once a response is received (but will release if
you read the entire contents of the response such as when
`preload_content=True`). This is useful if you're not preloading
the response's content immediately. You will need to call
``r.release_conn()`` on the response ``r`` to return the connection
back into the pool. If None, it takes the value of
``response_kw.get('preload_content', True)``.
:param chunked:
If True, urllib3 will send the body using chunked transfer
encoding. Otherwise, urllib3 will send the body using the standard
content-length form. Defaults to False.
:param int body_pos:
Position to seek to in file-like body in the event of a retry or
redirect. Typically this won't need to be set because urllib3 will
auto-populate the value when needed.
:param \\**response_kw:
Additional parameters are passed to
:meth:`urllib3.response.HTTPResponse.from_httplib`
"""
if headers is None:
headers = self.headers
if not isinstance(retries, Retry):
retries = Retry.from_int(retries, redirect=redirect, default=self.retries)
if release_conn is None:
release_conn = response_kw.get('preload_content', True)
# Check host
if assert_same_host and not self.is_same_host(url):
raise HostChangedError(self, url, retries)
conn = None
# Track whether `conn` needs to be released before
# returning/raising/recursing. Update this variable if necessary, and
# leave `release_conn` constant throughout the function. That way, if
# the function recurses, the original value of `release_conn` will be
# passed down into the recursive call, and its value will be respected.
#
# See issue #651 [1] for details.
#
# [1] <https://github.com/shazow/urllib3/issues/651>
release_this_conn = release_conn
# Merge the proxy headers. Only do this in HTTP. We have to copy the
# headers dict so we can safely change it without those changes being
# reflected in anyone else's copy.
if self.scheme == 'http':
headers = headers.copy()
headers.update(self.proxy_headers)
# Must keep the exception bound to a separate variable or else Python 3
# complains about UnboundLocalError.
err = None
# Keep track of whether we cleanly exited the except block. This
# ensures we do proper cleanup in finally.
clean_exit = False
# Rewind body position, if needed. Record current position
# for future rewinds in the event of a redirect/retry.
body_pos = set_file_position(body, body_pos)
try:
# Request a connection from the queue.
timeout_obj = self._get_timeout(timeout)
conn = self._get_conn(timeout=pool_timeout)
conn.timeout = timeout_obj.connect_timeout
is_new_proxy_conn = self.proxy is not None and not getattr(conn, 'sock', None)
if is_new_proxy_conn:
self._prepare_proxy(conn)
# Make the request on the httplib connection object.
httplib_response = self._make_request(conn, method, url,
timeout=timeout_obj,
body=body, headers=headers,
chunked=chunked)
# If we're going to release the connection in ``finally:``, then
# the response doesn't need to know about the connection. Otherwise
# it will also try to release it and we'll have a double-release
# mess.
response_conn = conn if not release_conn else None
# Pass method to Response for length checking
response_kw['request_method'] = method
# Import httplib's response into our own wrapper object
response = self.ResponseCls.from_httplib(httplib_response,
pool=self,
connection=response_conn,
retries=retries,
**response_kw)
# Everything went great!
clean_exit = True
except queue.Empty:
# Timed out by queue.
raise EmptyPoolError(self, "No pool connections are available.")
except (TimeoutError, HTTPException, SocketError, ProtocolError,
BaseSSLError, SSLError, CertificateError) as e:
# Discard the connection for these exceptions. It will be
# replaced during the next _get_conn() call.
clean_exit = False
if isinstance(e, (BaseSSLError, CertificateError)):
e = SSLError(e)
elif isinstance(e, (SocketError, NewConnectionError)) and self.proxy:
e = ProxyError('Cannot connect to proxy.', e)
elif isinstance(e, (SocketError, HTTPException)):
e = ProtocolError('Connection aborted.', e)
retries = retries.increment(method, url, error=e, _pool=self,
_stacktrace=sys.exc_info()[2])
retries.sleep()
# Keep track of the error for the retry warning.
err = e
finally:
if not clean_exit:
# We hit some kind of exception, handled or otherwise. We need
# to throw the connection away unless explicitly told not to.
# Close the connection, set the variable to None, and make sure
# we put the None back in the pool to avoid leaking it.
conn = conn and conn.close()
release_this_conn = True
if release_this_conn:
# Put the connection back to be reused. If the connection is
# expired then it will be None, which will get replaced with a
# fresh connection during _get_conn.
self._put_conn(conn)
if not conn:
# Try again
log.warning("Retrying (%r) after connection "
"broken by '%r': %s", retries, err, url)
return self.urlopen(method, url, body, headers, retries,
redirect, assert_same_host,
timeout=timeout, pool_timeout=pool_timeout,
release_conn=release_conn, body_pos=body_pos,
**response_kw)
def drain_and_release_conn(response):
try:
# discard any remaining response body, the connection will be
# released back to the pool once the entire response is read
response.read()
except (TimeoutError, HTTPException, SocketError, ProtocolError,
BaseSSLError, SSLError) as e:
pass
# Handle redirect?
redirect_location = redirect and response.get_redirect_location()
if redirect_location:
if response.status == 303:
method = 'GET'
try:
retries = retries.increment(method, url, response=response, _pool=self)
except MaxRetryError:
if retries.raise_on_redirect:
# Drain and release the connection for this response, since
# we're not returning it to be released manually.
drain_and_release_conn(response)
raise
return response
# drain and return the connection to the pool before recursing
drain_and_release_conn(response)
retries.sleep_for_retry(response)
log.debug("Redirecting %s -> %s", url, redirect_location)
return self.urlopen(
method, redirect_location, body, headers,
retries=retries, redirect=redirect,
assert_same_host=assert_same_host,
timeout=timeout, pool_timeout=pool_timeout,
release_conn=release_conn, body_pos=body_pos,
**response_kw)
# Check if we should retry the HTTP response.
has_retry_after = bool(response.getheader('Retry-After'))
if retries.is_retry(method, response.status, has_retry_after):
try:
retries = retries.increment(method, url, response=response, _pool=self)
except MaxRetryError:
if retries.raise_on_status:
# Drain and release the connection for this response, since
# we're not returning it to be released manually.
drain_and_release_conn(response)
raise
return response
# drain and return the connection to the pool before recursing
drain_and_release_conn(response)
retries.sleep(response)
log.debug("Retry: %s", url)
return self.urlopen(
method, url, body, headers,
retries=retries, redirect=redirect,
assert_same_host=assert_same_host,
timeout=timeout, pool_timeout=pool_timeout,
release_conn=release_conn,
body_pos=body_pos, **response_kw)
return response
class HTTPSConnectionPool(HTTPConnectionPool):
"""
Same as :class:`.HTTPConnectionPool`, but HTTPS.
When Python is compiled with the :mod:`ssl` module, then
:class:`.VerifiedHTTPSConnection` is used, which *can* verify certificates,
instead of :class:`.HTTPSConnection`.
:class:`.VerifiedHTTPSConnection` uses one of ``assert_fingerprint``,
``assert_hostname`` and ``host`` in this order to verify connections.
If ``assert_hostname`` is False, no verification is done.
The ``key_file``, ``cert_file``, ``cert_reqs``, ``ca_certs``,
``ca_cert_dir``, and ``ssl_version`` are only used if :mod:`ssl` is
available and are fed into :meth:`urllib3.util.ssl_wrap_socket` to upgrade
the connection socket into an SSL socket.
"""
scheme = 'https'
ConnectionCls = HTTPSConnection
def __init__(self, host, port=None,
strict=False, timeout=Timeout.DEFAULT_TIMEOUT, maxsize=1,
block=False, headers=None, retries=None,
_proxy=None, _proxy_headers=None,
key_file=None, cert_file=None, cert_reqs=None,
ca_certs=None, ssl_version=None,
assert_hostname=None, assert_fingerprint=None,
ca_cert_dir=None, **conn_kw):
HTTPConnectionPool.__init__(self, host, port, strict, timeout, maxsize,
block, headers, retries, _proxy, _proxy_headers,
**conn_kw)
if ca_certs and cert_reqs is None:
cert_reqs = 'CERT_REQUIRED'
self.key_file = key_file
self.cert_file = cert_file
self.cert_reqs = cert_reqs
self.ca_certs = ca_certs
self.ca_cert_dir = ca_cert_dir
self.ssl_version = ssl_version
self.assert_hostname = assert_hostname
self.assert_fingerprint = assert_fingerprint
def _prepare_conn(self, conn):
"""
Prepare the ``connection`` for :meth:`urllib3.util.ssl_wrap_socket`
and establish the tunnel if proxy is used.
"""
if isinstance(conn, VerifiedHTTPSConnection):
conn.set_cert(key_file=self.key_file,
cert_file=self.cert_file,
cert_reqs=self.cert_reqs,
ca_certs=self.ca_certs,
ca_cert_dir=self.ca_cert_dir,
assert_hostname=self.assert_hostname,
assert_fingerprint=self.assert_fingerprint)
conn.ssl_version = self.ssl_version
return conn
def _prepare_proxy(self, conn):
"""
Establish tunnel connection early, because otherwise httplib
would improperly set Host: header to proxy's IP:port.
"""
# Python 2.7+
try:
set_tunnel = conn.set_tunnel
except AttributeError: # Platform-specific: Python 2.6
set_tunnel = conn._set_tunnel
if sys.version_info <= (2, 6, 4) and not self.proxy_headers: # Python 2.6.4 and older
set_tunnel(self._proxy_host, self.port)
else:
set_tunnel(self._proxy_host, self.port, self.proxy_headers)
conn.connect()
def _new_conn(self):
"""
Return a fresh :class:`httplib.HTTPSConnection`.
"""
self.num_connections += 1
log.debug("Starting new HTTPS connection (%d): %s",
self.num_connections, self.host)
if not self.ConnectionCls or self.ConnectionCls is DummyConnection:
raise SSLError("Can't connect to HTTPS URL because the SSL "
"module is not available.")
actual_host = self.host
actual_port = self.port
if self.proxy is not None:
actual_host = self.proxy.host
actual_port = self.proxy.port
conn = self.ConnectionCls(host=actual_host, port=actual_port,
timeout=self.timeout.connect_timeout,
strict=self.strict, **self.conn_kw)
return self._prepare_conn(conn)
def _validate_conn(self, conn):
"""
Called right before a request is made, after the socket is created.
"""
super(HTTPSConnectionPool, self)._validate_conn(conn)
# Force connect early to allow us to validate the connection.
if not getattr(conn, 'sock', None): # AppEngine might not have `.sock`
conn.connect()
if not conn.is_verified:
warnings.warn((
'Unverified HTTPS request is being made. '
'Adding certificate verification is strongly advised. See: '
'https://urllib3.readthedocs.io/en/latest/advanced-usage.html'
'#ssl-warnings'),
InsecureRequestWarning)
def connection_from_url(url, **kw):
"""
Given a url, return an :class:`.ConnectionPool` instance of its host.
This is a shortcut for not having to parse out the scheme, host, and port
of the url before creating an :class:`.ConnectionPool` instance.
:param url:
Absolute URL string that must include the scheme. Port is optional.
:param \\**kw:
Passes additional parameters to the constructor of the appropriate
:class:`.ConnectionPool`. Useful for specifying things like
timeout, maxsize, headers, etc.
Example::
>>> conn = connection_from_url('http://google.com/')
>>> r = conn.request('GET', '/')
"""
scheme, host, port = get_host(url)
port = port or port_by_scheme.get(scheme, 80)
if scheme == 'https':
return HTTPSConnectionPool(host, port=port, **kw)
else:
return HTTPConnectionPool(host, port=port, **kw)
def _ipv6_host(host):
"""
Process IPv6 address literals
"""
# httplib doesn't like it when we include brackets in IPv6 addresses
# Specifically, if we include brackets but also pass the port then
# httplib crazily doubles up the square brackets on the Host header.
# Instead, we need to make sure we never pass ``None`` as the port.
# However, for backward compatibility reasons we can't actually
# *assert* that. See http://bugs.python.org/issue28539
#
# Also if an IPv6 address literal has a zone identifier, the
# percent sign might be URIencoded, convert it back into ASCII
if host.startswith('[') and host.endswith(']'):
host = host.replace('%25', '%').strip('[]')
return host
pip/_vendor/urllib3/filepost.py 0000644 00000004421 14751155150 0012550 0 ustar 00 from __future__ import absolute_import
import codecs
from uuid import uuid4
from io import BytesIO
from .packages import six
from .packages.six import b
from .fields import RequestField
writer = codecs.lookup('utf-8')[3]
def choose_boundary():
"""
Our embarrassingly-simple replacement for mimetools.choose_boundary.
"""
return uuid4().hex
def iter_field_objects(fields):
"""
Iterate over fields.
Supports list of (k, v) tuples and dicts, and lists of
:class:`~urllib3.fields.RequestField`.
"""
if isinstance(fields, dict):
i = six.iteritems(fields)
else:
i = iter(fields)
for field in i:
if isinstance(field, RequestField):
yield field
else:
yield RequestField.from_tuples(*field)
def iter_fields(fields):
"""
.. deprecated:: 1.6
Iterate over fields.
The addition of :class:`~urllib3.fields.RequestField` makes this function
obsolete. Instead, use :func:`iter_field_objects`, which returns
:class:`~urllib3.fields.RequestField` objects.
Supports list of (k, v) tuples and dicts.
"""
if isinstance(fields, dict):
return ((k, v) for k, v in six.iteritems(fields))
return ((k, v) for k, v in fields)
def encode_multipart_formdata(fields, boundary=None):
"""
Encode a dictionary of ``fields`` using the multipart/form-data MIME format.
:param fields:
Dictionary of fields or list of (key, :class:`~urllib3.fields.RequestField`).
:param boundary:
If not specified, then a random boundary will be generated using
:func:`mimetools.choose_boundary`.
"""
body = BytesIO()
if boundary is None:
boundary = choose_boundary()
for field in iter_field_objects(fields):
body.write(b('--%s\r\n' % (boundary)))
writer(body).write(field.render_headers())
data = field.data
if isinstance(data, int):
data = str(data) # Backwards compatibility
if isinstance(data, six.text_type):
writer(body).write(data)
else:
body.write(data)
body.write(b'\r\n')
body.write(b('--%s--\r\n' % (boundary)))
content_type = str('multipart/form-data; boundary=%s' % boundary)
return body.getvalue(), content_type
pip/_vendor/urllib3/contrib/ntlmpool.py 0000644 00000010576 14751155150 0014237 0 ustar 00 """
NTLM authenticating pool, contributed by erikcederstran
Issue #10, see: http://code.google.com/p/urllib3/issues/detail?id=10
"""
from __future__ import absolute_import
from logging import getLogger
from ntlm import ntlm
from .. import HTTPSConnectionPool
from ..packages.six.moves.http_client import HTTPSConnection
log = getLogger(__name__)
class NTLMConnectionPool(HTTPSConnectionPool):
"""
Implements an NTLM authentication version of an urllib3 connection pool
"""
scheme = 'https'
def __init__(self, user, pw, authurl, *args, **kwargs):
"""
authurl is a random URL on the server that is protected by NTLM.
user is the Windows user, probably in the DOMAIN\\username format.
pw is the password for the user.
"""
super(NTLMConnectionPool, self).__init__(*args, **kwargs)
self.authurl = authurl
self.rawuser = user
user_parts = user.split('\\', 1)
self.domain = user_parts[0].upper()
self.user = user_parts[1]
self.pw = pw
def _new_conn(self):
# Performs the NTLM handshake that secures the connection. The socket
# must be kept open while requests are performed.
self.num_connections += 1
log.debug('Starting NTLM HTTPS connection no. %d: https://%s%s',
self.num_connections, self.host, self.authurl)
headers = {}
headers['Connection'] = 'Keep-Alive'
req_header = 'Authorization'
resp_header = 'www-authenticate'
conn = HTTPSConnection(host=self.host, port=self.port)
# Send negotiation message
headers[req_header] = (
'NTLM %s' % ntlm.create_NTLM_NEGOTIATE_MESSAGE(self.rawuser))
log.debug('Request headers: %s', headers)
conn.request('GET', self.authurl, None, headers)
res = conn.getresponse()
reshdr = dict(res.getheaders())
log.debug('Response status: %s %s', res.status, res.reason)
log.debug('Response headers: %s', reshdr)
log.debug('Response data: %s [...]', res.read(100))
# Remove the reference to the socket, so that it can not be closed by
# the response object (we want to keep the socket open)
res.fp = None
# Server should respond with a challenge message
auth_header_values = reshdr[resp_header].split(', ')
auth_header_value = None
for s in auth_header_values:
if s[:5] == 'NTLM ':
auth_header_value = s[5:]
if auth_header_value is None:
raise Exception('Unexpected %s response header: %s' %
(resp_header, reshdr[resp_header]))
# Send authentication message
ServerChallenge, NegotiateFlags = \
ntlm.parse_NTLM_CHALLENGE_MESSAGE(auth_header_value)
auth_msg = ntlm.create_NTLM_AUTHENTICATE_MESSAGE(ServerChallenge,
self.user,
self.domain,
self.pw,
NegotiateFlags)
headers[req_header] = 'NTLM %s' % auth_msg
log.debug('Request headers: %s', headers)
conn.request('GET', self.authurl, None, headers)
res = conn.getresponse()
log.debug('Response status: %s %s', res.status, res.reason)
log.debug('Response headers: %s', dict(res.getheaders()))
log.debug('Response data: %s [...]', res.read()[:100])
if res.status != 200:
if res.status == 401:
raise Exception('Server rejected request: wrong '
'username or password')
raise Exception('Wrong server response: %s %s' %
(res.status, res.reason))
res.fp = None
log.debug('Connection established')
return conn
def urlopen(self, method, url, body=None, headers=None, retries=3,
redirect=True, assert_same_host=True):
if headers is None:
headers = {}
headers['Connection'] = 'Keep-Alive'
return super(NTLMConnectionPool, self).urlopen(method, url, body,
headers, retries,
redirect,
assert_same_host)
pip/_vendor/urllib3/contrib/appengine.py 0000644 00000025161 14751155150 0014335 0 ustar 00 """
This module provides a pool manager that uses Google App Engine's
`URLFetch Service <https://cloud.google.com/appengine/docs/python/urlfetch>`_.
Example usage::
from urllib3 import PoolManager
from urllib3.contrib.appengine import AppEngineManager, is_appengine_sandbox
if is_appengine_sandbox():
# AppEngineManager uses AppEngine's URLFetch API behind the scenes
http = AppEngineManager()
else:
# PoolManager uses a socket-level API behind the scenes
http = PoolManager()
r = http.request('GET', 'https://google.com/')
There are `limitations <https://cloud.google.com/appengine/docs/python/\
urlfetch/#Python_Quotas_and_limits>`_ to the URLFetch service and it may not be
the best choice for your application. There are three options for using
urllib3 on Google App Engine:
1. You can use :class:`AppEngineManager` with URLFetch. URLFetch is
cost-effective in many circumstances as long as your usage is within the
limitations.
2. You can use a normal :class:`~urllib3.PoolManager` by enabling sockets.
Sockets also have `limitations and restrictions
<https://cloud.google.com/appengine/docs/python/sockets/\
#limitations-and-restrictions>`_ and have a lower free quota than URLFetch.
To use sockets, be sure to specify the following in your ``app.yaml``::
env_variables:
GAE_USE_SOCKETS_HTTPLIB : 'true'
3. If you are using `App Engine Flexible
<https://cloud.google.com/appengine/docs/flexible/>`_, you can use the standard
:class:`PoolManager` without any configuration or special environment variables.
"""
from __future__ import absolute_import
import logging
import os
import warnings
from ..packages.six.moves.urllib.parse import urljoin
from ..exceptions import (
HTTPError,
HTTPWarning,
MaxRetryError,
ProtocolError,
TimeoutError,
SSLError
)
from ..packages.six import BytesIO
from ..request import RequestMethods
from ..response import HTTPResponse
from ..util.timeout import Timeout
from ..util.retry import Retry
try:
from google.appengine.api import urlfetch
except ImportError:
urlfetch = None
log = logging.getLogger(__name__)
class AppEnginePlatformWarning(HTTPWarning):
pass
class AppEnginePlatformError(HTTPError):
pass
class AppEngineManager(RequestMethods):
"""
Connection manager for Google App Engine sandbox applications.
This manager uses the URLFetch service directly instead of using the
emulated httplib, and is subject to URLFetch limitations as described in
the App Engine documentation `here
<https://cloud.google.com/appengine/docs/python/urlfetch>`_.
Notably it will raise an :class:`AppEnginePlatformError` if:
* URLFetch is not available.
* If you attempt to use this on App Engine Flexible, as full socket
support is available.
* If a request size is more than 10 megabytes.
* If a response size is more than 32 megabtyes.
* If you use an unsupported request method such as OPTIONS.
Beyond those cases, it will raise normal urllib3 errors.
"""
def __init__(self, headers=None, retries=None, validate_certificate=True,
urlfetch_retries=True):
if not urlfetch:
raise AppEnginePlatformError(
"URLFetch is not available in this environment.")
if is_prod_appengine_mvms():
raise AppEnginePlatformError(
"Use normal urllib3.PoolManager instead of AppEngineManager"
"on Managed VMs, as using URLFetch is not necessary in "
"this environment.")
warnings.warn(
"urllib3 is using URLFetch on Google App Engine sandbox instead "
"of sockets. To use sockets directly instead of URLFetch see "
"https://urllib3.readthedocs.io/en/latest/reference/urllib3.contrib.html.",
AppEnginePlatformWarning)
RequestMethods.__init__(self, headers)
self.validate_certificate = validate_certificate
self.urlfetch_retries = urlfetch_retries
self.retries = retries or Retry.DEFAULT
def __enter__(self):
return self
def __exit__(self, exc_type, exc_val, exc_tb):
# Return False to re-raise any potential exceptions
return False
def urlopen(self, method, url, body=None, headers=None,
retries=None, redirect=True, timeout=Timeout.DEFAULT_TIMEOUT,
**response_kw):
retries = self._get_retries(retries, redirect)
try:
follow_redirects = (
redirect and
retries.redirect != 0 and
retries.total)
response = urlfetch.fetch(
url,
payload=body,
method=method,
headers=headers or {},
allow_truncated=False,
follow_redirects=self.urlfetch_retries and follow_redirects,
deadline=self._get_absolute_timeout(timeout),
validate_certificate=self.validate_certificate,
)
except urlfetch.DeadlineExceededError as e:
raise TimeoutError(self, e)
except urlfetch.InvalidURLError as e:
if 'too large' in str(e):
raise AppEnginePlatformError(
"URLFetch request too large, URLFetch only "
"supports requests up to 10mb in size.", e)
raise ProtocolError(e)
except urlfetch.DownloadError as e:
if 'Too many redirects' in str(e):
raise MaxRetryError(self, url, reason=e)
raise ProtocolError(e)
except urlfetch.ResponseTooLargeError as e:
raise AppEnginePlatformError(
"URLFetch response too large, URLFetch only supports"
"responses up to 32mb in size.", e)
except urlfetch.SSLCertificateError as e:
raise SSLError(e)
except urlfetch.InvalidMethodError as e:
raise AppEnginePlatformError(
"URLFetch does not support method: %s" % method, e)
http_response = self._urlfetch_response_to_http_response(
response, retries=retries, **response_kw)
# Handle redirect?
redirect_location = redirect and http_response.get_redirect_location()
if redirect_location:
# Check for redirect response
if (self.urlfetch_retries and retries.raise_on_redirect):
raise MaxRetryError(self, url, "too many redirects")
else:
if http_response.status == 303:
method = 'GET'
try:
retries = retries.increment(method, url, response=http_response, _pool=self)
except MaxRetryError:
if retries.raise_on_redirect:
raise MaxRetryError(self, url, "too many redirects")
return http_response
retries.sleep_for_retry(http_response)
log.debug("Redirecting %s -> %s", url, redirect_location)
redirect_url = urljoin(url, redirect_location)
return self.urlopen(
method, redirect_url, body, headers,
retries=retries, redirect=redirect,
timeout=timeout, **response_kw)
# Check if we should retry the HTTP response.
has_retry_after = bool(http_response.getheader('Retry-After'))
if retries.is_retry(method, http_response.status, has_retry_after):
retries = retries.increment(
method, url, response=http_response, _pool=self)
log.debug("Retry: %s", url)
retries.sleep(http_response)
return self.urlopen(
method, url,
body=body, headers=headers,
retries=retries, redirect=redirect,
timeout=timeout, **response_kw)
return http_response
def _urlfetch_response_to_http_response(self, urlfetch_resp, **response_kw):
if is_prod_appengine():
# Production GAE handles deflate encoding automatically, but does
# not remove the encoding header.
content_encoding = urlfetch_resp.headers.get('content-encoding')
if content_encoding == 'deflate':
del urlfetch_resp.headers['content-encoding']
transfer_encoding = urlfetch_resp.headers.get('transfer-encoding')
# We have a full response's content,
# so let's make sure we don't report ourselves as chunked data.
if transfer_encoding == 'chunked':
encodings = transfer_encoding.split(",")
encodings.remove('chunked')
urlfetch_resp.headers['transfer-encoding'] = ','.join(encodings)
return HTTPResponse(
# In order for decoding to work, we must present the content as
# a file-like object.
body=BytesIO(urlfetch_resp.content),
headers=urlfetch_resp.headers,
status=urlfetch_resp.status_code,
**response_kw
)
def _get_absolute_timeout(self, timeout):
if timeout is Timeout.DEFAULT_TIMEOUT:
return None # Defer to URLFetch's default.
if isinstance(timeout, Timeout):
if timeout._read is not None or timeout._connect is not None:
warnings.warn(
"URLFetch does not support granular timeout settings, "
"reverting to total or default URLFetch timeout.",
AppEnginePlatformWarning)
return timeout.total
return timeout
def _get_retries(self, retries, redirect):
if not isinstance(retries, Retry):
retries = Retry.from_int(
retries, redirect=redirect, default=self.retries)
if retries.connect or retries.read or retries.redirect:
warnings.warn(
"URLFetch only supports total retries and does not "
"recognize connect, read, or redirect retry parameters.",
AppEnginePlatformWarning)
return retries
def is_appengine():
return (is_local_appengine() or
is_prod_appengine() or
is_prod_appengine_mvms())
def is_appengine_sandbox():
return is_appengine() and not is_prod_appengine_mvms()
def is_local_appengine():
return ('APPENGINE_RUNTIME' in os.environ and
'Development/' in os.environ['SERVER_SOFTWARE'])
def is_prod_appengine():
return ('APPENGINE_RUNTIME' in os.environ and
'Google App Engine/' in os.environ['SERVER_SOFTWARE'] and
not is_prod_appengine_mvms())
def is_prod_appengine_mvms():
return os.environ.get('GAE_VM', False) == 'true'
pip/_vendor/urllib3/contrib/securetransport.py 0000644 00000073445 14751155150 0015642 0 ustar 00 """
SecureTranport support for urllib3 via ctypes.
This makes platform-native TLS available to urllib3 users on macOS without the
use of a compiler. This is an important feature because the Python Package
Index is moving to become a TLSv1.2-or-higher server, and the default OpenSSL
that ships with macOS is not capable of doing TLSv1.2. The only way to resolve
this is to give macOS users an alternative solution to the problem, and that
solution is to use SecureTransport.
We use ctypes here because this solution must not require a compiler. That's
because pip is not allowed to require a compiler either.
This is not intended to be a seriously long-term solution to this problem.
The hope is that PEP 543 will eventually solve this issue for us, at which
point we can retire this contrib module. But in the short term, we need to
solve the impending tire fire that is Python on Mac without this kind of
contrib module. So...here we are.
To use this module, simply import and inject it::
import urllib3.contrib.securetransport
urllib3.contrib.securetransport.inject_into_urllib3()
Happy TLSing!
"""
from __future__ import absolute_import
import contextlib
import ctypes
import errno
import os.path
import shutil
import socket
import ssl
import threading
import weakref
from .. import util
from ._securetransport.bindings import (
Security, SecurityConst, CoreFoundation
)
from ._securetransport.low_level import (
_assert_no_error, _cert_array_from_pem, _temporary_keychain,
_load_client_cert_chain
)
try: # Platform-specific: Python 2
from socket import _fileobject
except ImportError: # Platform-specific: Python 3
_fileobject = None
from ..packages.backports.makefile import backport_makefile
try:
memoryview(b'')
except NameError:
raise ImportError("SecureTransport only works on Pythons with memoryview")
__all__ = ['inject_into_urllib3', 'extract_from_urllib3']
# SNI always works
HAS_SNI = True
orig_util_HAS_SNI = util.HAS_SNI
orig_util_SSLContext = util.ssl_.SSLContext
# This dictionary is used by the read callback to obtain a handle to the
# calling wrapped socket. This is a pretty silly approach, but for now it'll
# do. I feel like I should be able to smuggle a handle to the wrapped socket
# directly in the SSLConnectionRef, but for now this approach will work I
# guess.
#
# We need to lock around this structure for inserts, but we don't do it for
# reads/writes in the callbacks. The reasoning here goes as follows:
#
# 1. It is not possible to call into the callbacks before the dictionary is
# populated, so once in the callback the id must be in the dictionary.
# 2. The callbacks don't mutate the dictionary, they only read from it, and
# so cannot conflict with any of the insertions.
#
# This is good: if we had to lock in the callbacks we'd drastically slow down
# the performance of this code.
_connection_refs = weakref.WeakValueDictionary()
_connection_ref_lock = threading.Lock()
# Limit writes to 16kB. This is OpenSSL's limit, but we'll cargo-cult it over
# for no better reason than we need *a* limit, and this one is right there.
SSL_WRITE_BLOCKSIZE = 16384
# This is our equivalent of util.ssl_.DEFAULT_CIPHERS, but expanded out to
# individual cipher suites. We need to do this becuase this is how
# SecureTransport wants them.
CIPHER_SUITES = [
SecurityConst.TLS_AES_256_GCM_SHA384,
SecurityConst.TLS_CHACHA20_POLY1305_SHA256,
SecurityConst.TLS_AES_128_GCM_SHA256,
SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384,
SecurityConst.TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384,
SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256,
SecurityConst.TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256,
SecurityConst.TLS_DHE_DSS_WITH_AES_256_GCM_SHA384,
SecurityConst.TLS_DHE_RSA_WITH_AES_256_GCM_SHA384,
SecurityConst.TLS_DHE_DSS_WITH_AES_128_GCM_SHA256,
SecurityConst.TLS_DHE_RSA_WITH_AES_128_GCM_SHA256,
SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384,
SecurityConst.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384,
SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA,
SecurityConst.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA,
SecurityConst.TLS_DHE_RSA_WITH_AES_256_CBC_SHA256,
SecurityConst.TLS_DHE_DSS_WITH_AES_256_CBC_SHA256,
SecurityConst.TLS_DHE_RSA_WITH_AES_256_CBC_SHA,
SecurityConst.TLS_DHE_DSS_WITH_AES_256_CBC_SHA,
SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256,
SecurityConst.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256,
SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA,
SecurityConst.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA,
SecurityConst.TLS_DHE_RSA_WITH_AES_128_CBC_SHA256,
SecurityConst.TLS_DHE_DSS_WITH_AES_128_CBC_SHA256,
SecurityConst.TLS_DHE_RSA_WITH_AES_128_CBC_SHA,
SecurityConst.TLS_DHE_DSS_WITH_AES_128_CBC_SHA,
SecurityConst.TLS_RSA_WITH_AES_256_GCM_SHA384,
SecurityConst.TLS_RSA_WITH_AES_128_GCM_SHA256,
SecurityConst.TLS_RSA_WITH_AES_256_CBC_SHA256,
SecurityConst.TLS_RSA_WITH_AES_128_CBC_SHA256,
SecurityConst.TLS_RSA_WITH_AES_256_CBC_SHA,
SecurityConst.TLS_RSA_WITH_AES_128_CBC_SHA,
]
# Basically this is simple: for PROTOCOL_SSLv23 we turn it into a low of
# TLSv1 and a high of TLSv1.2. For everything else, we pin to that version.
_protocol_to_min_max = {
ssl.PROTOCOL_SSLv23: (SecurityConst.kTLSProtocol1, SecurityConst.kTLSProtocol12),
}
if hasattr(ssl, "PROTOCOL_SSLv2"):
_protocol_to_min_max[ssl.PROTOCOL_SSLv2] = (
SecurityConst.kSSLProtocol2, SecurityConst.kSSLProtocol2
)
if hasattr(ssl, "PROTOCOL_SSLv3"):
_protocol_to_min_max[ssl.PROTOCOL_SSLv3] = (
SecurityConst.kSSLProtocol3, SecurityConst.kSSLProtocol3
)
if hasattr(ssl, "PROTOCOL_TLSv1"):
_protocol_to_min_max[ssl.PROTOCOL_TLSv1] = (
SecurityConst.kTLSProtocol1, SecurityConst.kTLSProtocol1
)
if hasattr(ssl, "PROTOCOL_TLSv1_1"):
_protocol_to_min_max[ssl.PROTOCOL_TLSv1_1] = (
SecurityConst.kTLSProtocol11, SecurityConst.kTLSProtocol11
)
if hasattr(ssl, "PROTOCOL_TLSv1_2"):
_protocol_to_min_max[ssl.PROTOCOL_TLSv1_2] = (
SecurityConst.kTLSProtocol12, SecurityConst.kTLSProtocol12
)
if hasattr(ssl, "PROTOCOL_TLS"):
_protocol_to_min_max[ssl.PROTOCOL_TLS] = _protocol_to_min_max[ssl.PROTOCOL_SSLv23]
def inject_into_urllib3():
"""
Monkey-patch urllib3 with SecureTransport-backed SSL-support.
"""
util.ssl_.SSLContext = SecureTransportContext
util.HAS_SNI = HAS_SNI
util.ssl_.HAS_SNI = HAS_SNI
util.IS_SECURETRANSPORT = True
util.ssl_.IS_SECURETRANSPORT = True
def extract_from_urllib3():
"""
Undo monkey-patching by :func:`inject_into_urllib3`.
"""
util.ssl_.SSLContext = orig_util_SSLContext
util.HAS_SNI = orig_util_HAS_SNI
util.ssl_.HAS_SNI = orig_util_HAS_SNI
util.IS_SECURETRANSPORT = False
util.ssl_.IS_SECURETRANSPORT = False
def _read_callback(connection_id, data_buffer, data_length_pointer):
"""
SecureTransport read callback. This is called by ST to request that data
be returned from the socket.
"""
wrapped_socket = None
try:
wrapped_socket = _connection_refs.get(connection_id)
if wrapped_socket is None:
return SecurityConst.errSSLInternal
base_socket = wrapped_socket.socket
requested_length = data_length_pointer[0]
timeout = wrapped_socket.gettimeout()
error = None
read_count = 0
buffer = (ctypes.c_char * requested_length).from_address(data_buffer)
buffer_view = memoryview(buffer)
try:
while read_count < requested_length:
if timeout is None or timeout >= 0:
readables = util.wait_for_read([base_socket], timeout)
if not readables:
raise socket.error(errno.EAGAIN, 'timed out')
# We need to tell ctypes that we have a buffer that can be
# written to. Upsettingly, we do that like this:
chunk_size = base_socket.recv_into(
buffer_view[read_count:requested_length]
)
read_count += chunk_size
if not chunk_size:
if not read_count:
return SecurityConst.errSSLClosedGraceful
break
except (socket.error) as e:
error = e.errno
if error is not None and error != errno.EAGAIN:
if error == errno.ECONNRESET:
return SecurityConst.errSSLClosedAbort
raise
data_length_pointer[0] = read_count
if read_count != requested_length:
return SecurityConst.errSSLWouldBlock
return 0
except Exception as e:
if wrapped_socket is not None:
wrapped_socket._exception = e
return SecurityConst.errSSLInternal
def _write_callback(connection_id, data_buffer, data_length_pointer):
"""
SecureTransport write callback. This is called by ST to request that data
actually be sent on the network.
"""
wrapped_socket = None
try:
wrapped_socket = _connection_refs.get(connection_id)
if wrapped_socket is None:
return SecurityConst.errSSLInternal
base_socket = wrapped_socket.socket
bytes_to_write = data_length_pointer[0]
data = ctypes.string_at(data_buffer, bytes_to_write)
timeout = wrapped_socket.gettimeout()
error = None
sent = 0
try:
while sent < bytes_to_write:
if timeout is None or timeout >= 0:
writables = util.wait_for_write([base_socket], timeout)
if not writables:
raise socket.error(errno.EAGAIN, 'timed out')
chunk_sent = base_socket.send(data)
sent += chunk_sent
# This has some needless copying here, but I'm not sure there's
# much value in optimising this data path.
data = data[chunk_sent:]
except (socket.error) as e:
error = e.errno
if error is not None and error != errno.EAGAIN:
if error == errno.ECONNRESET:
return SecurityConst.errSSLClosedAbort
raise
data_length_pointer[0] = sent
if sent != bytes_to_write:
return SecurityConst.errSSLWouldBlock
return 0
except Exception as e:
if wrapped_socket is not None:
wrapped_socket._exception = e
return SecurityConst.errSSLInternal
# We need to keep these two objects references alive: if they get GC'd while
# in use then SecureTransport could attempt to call a function that is in freed
# memory. That would be...uh...bad. Yeah, that's the word. Bad.
_read_callback_pointer = Security.SSLReadFunc(_read_callback)
_write_callback_pointer = Security.SSLWriteFunc(_write_callback)
class WrappedSocket(object):
"""
API-compatibility wrapper for Python's OpenSSL wrapped socket object.
Note: _makefile_refs, _drop(), and _reuse() are needed for the garbage
collector of PyPy.
"""
def __init__(self, socket):
self.socket = socket
self.context = None
self._makefile_refs = 0
self._closed = False
self._exception = None
self._keychain = None
self._keychain_dir = None
self._client_cert_chain = None
# We save off the previously-configured timeout and then set it to
# zero. This is done because we use select and friends to handle the
# timeouts, but if we leave the timeout set on the lower socket then
# Python will "kindly" call select on that socket again for us. Avoid
# that by forcing the timeout to zero.
self._timeout = self.socket.gettimeout()
self.socket.settimeout(0)
@contextlib.contextmanager
def _raise_on_error(self):
"""
A context manager that can be used to wrap calls that do I/O from
SecureTransport. If any of the I/O callbacks hit an exception, this
context manager will correctly propagate the exception after the fact.
This avoids silently swallowing those exceptions.
It also correctly forces the socket closed.
"""
self._exception = None
# We explicitly don't catch around this yield because in the unlikely
# event that an exception was hit in the block we don't want to swallow
# it.
yield
if self._exception is not None:
exception, self._exception = self._exception, None
self.close()
raise exception
def _set_ciphers(self):
"""
Sets up the allowed ciphers. By default this matches the set in
util.ssl_.DEFAULT_CIPHERS, at least as supported by macOS. This is done
custom and doesn't allow changing at this time, mostly because parsing
OpenSSL cipher strings is going to be a freaking nightmare.
"""
ciphers = (Security.SSLCipherSuite * len(CIPHER_SUITES))(*CIPHER_SUITES)
result = Security.SSLSetEnabledCiphers(
self.context, ciphers, len(CIPHER_SUITES)
)
_assert_no_error(result)
def _custom_validate(self, verify, trust_bundle):
"""
Called when we have set custom validation. We do this in two cases:
first, when cert validation is entirely disabled; and second, when
using a custom trust DB.
"""
# If we disabled cert validation, just say: cool.
if not verify:
return
# We want data in memory, so load it up.
if os.path.isfile(trust_bundle):
with open(trust_bundle, 'rb') as f:
trust_bundle = f.read()
cert_array = None
trust = Security.SecTrustRef()
try:
# Get a CFArray that contains the certs we want.
cert_array = _cert_array_from_pem(trust_bundle)
# Ok, now the hard part. We want to get the SecTrustRef that ST has
# created for this connection, shove our CAs into it, tell ST to
# ignore everything else it knows, and then ask if it can build a
# chain. This is a buuuunch of code.
result = Security.SSLCopyPeerTrust(
self.context, ctypes.byref(trust)
)
_assert_no_error(result)
if not trust:
raise ssl.SSLError("Failed to copy trust reference")
result = Security.SecTrustSetAnchorCertificates(trust, cert_array)
_assert_no_error(result)
result = Security.SecTrustSetAnchorCertificatesOnly(trust, True)
_assert_no_error(result)
trust_result = Security.SecTrustResultType()
result = Security.SecTrustEvaluate(
trust, ctypes.byref(trust_result)
)
_assert_no_error(result)
finally:
if trust:
CoreFoundation.CFRelease(trust)
if cert_array is None:
CoreFoundation.CFRelease(cert_array)
# Ok, now we can look at what the result was.
successes = (
SecurityConst.kSecTrustResultUnspecified,
SecurityConst.kSecTrustResultProceed
)
if trust_result.value not in successes:
raise ssl.SSLError(
"certificate verify failed, error code: %d" %
trust_result.value
)
def handshake(self,
server_hostname,
verify,
trust_bundle,
min_version,
max_version,
client_cert,
client_key,
client_key_passphrase):
"""
Actually performs the TLS handshake. This is run automatically by
wrapped socket, and shouldn't be needed in user code.
"""
# First, we do the initial bits of connection setup. We need to create
# a context, set its I/O funcs, and set the connection reference.
self.context = Security.SSLCreateContext(
None, SecurityConst.kSSLClientSide, SecurityConst.kSSLStreamType
)
result = Security.SSLSetIOFuncs(
self.context, _read_callback_pointer, _write_callback_pointer
)
_assert_no_error(result)
# Here we need to compute the handle to use. We do this by taking the
# id of self modulo 2**31 - 1. If this is already in the dictionary, we
# just keep incrementing by one until we find a free space.
with _connection_ref_lock:
handle = id(self) % 2147483647
while handle in _connection_refs:
handle = (handle + 1) % 2147483647
_connection_refs[handle] = self
result = Security.SSLSetConnection(self.context, handle)
_assert_no_error(result)
# If we have a server hostname, we should set that too.
if server_hostname:
if not isinstance(server_hostname, bytes):
server_hostname = server_hostname.encode('utf-8')
result = Security.SSLSetPeerDomainName(
self.context, server_hostname, len(server_hostname)
)
_assert_no_error(result)
# Setup the ciphers.
self._set_ciphers()
# Set the minimum and maximum TLS versions.
result = Security.SSLSetProtocolVersionMin(self.context, min_version)
_assert_no_error(result)
result = Security.SSLSetProtocolVersionMax(self.context, max_version)
_assert_no_error(result)
# If there's a trust DB, we need to use it. We do that by telling
# SecureTransport to break on server auth. We also do that if we don't
# want to validate the certs at all: we just won't actually do any
# authing in that case.
if not verify or trust_bundle is not None:
result = Security.SSLSetSessionOption(
self.context,
SecurityConst.kSSLSessionOptionBreakOnServerAuth,
True
)
_assert_no_error(result)
# If there's a client cert, we need to use it.
if client_cert:
self._keychain, self._keychain_dir = _temporary_keychain()
self._client_cert_chain = _load_client_cert_chain(
self._keychain, client_cert, client_key
)
result = Security.SSLSetCertificate(
self.context, self._client_cert_chain
)
_assert_no_error(result)
while True:
with self._raise_on_error():
result = Security.SSLHandshake(self.context)
if result == SecurityConst.errSSLWouldBlock:
raise socket.timeout("handshake timed out")
elif result == SecurityConst.errSSLServerAuthCompleted:
self._custom_validate(verify, trust_bundle)
continue
else:
_assert_no_error(result)
break
def fileno(self):
return self.socket.fileno()
# Copy-pasted from Python 3.5 source code
def _decref_socketios(self):
if self._makefile_refs > 0:
self._makefile_refs -= 1
if self._closed:
self.close()
def recv(self, bufsiz):
buffer = ctypes.create_string_buffer(bufsiz)
bytes_read = self.recv_into(buffer, bufsiz)
data = buffer[:bytes_read]
return data
def recv_into(self, buffer, nbytes=None):
# Read short on EOF.
if self._closed:
return 0
if nbytes is None:
nbytes = len(buffer)
buffer = (ctypes.c_char * nbytes).from_buffer(buffer)
processed_bytes = ctypes.c_size_t(0)
with self._raise_on_error():
result = Security.SSLRead(
self.context, buffer, nbytes, ctypes.byref(processed_bytes)
)
# There are some result codes that we want to treat as "not always
# errors". Specifically, those are errSSLWouldBlock,
# errSSLClosedGraceful, and errSSLClosedNoNotify.
if (result == SecurityConst.errSSLWouldBlock):
# If we didn't process any bytes, then this was just a time out.
# However, we can get errSSLWouldBlock in situations when we *did*
# read some data, and in those cases we should just read "short"
# and return.
if processed_bytes.value == 0:
# Timed out, no data read.
raise socket.timeout("recv timed out")
elif result in (SecurityConst.errSSLClosedGraceful, SecurityConst.errSSLClosedNoNotify):
# The remote peer has closed this connection. We should do so as
# well. Note that we don't actually return here because in
# principle this could actually be fired along with return data.
# It's unlikely though.
self.close()
else:
_assert_no_error(result)
# Ok, we read and probably succeeded. We should return whatever data
# was actually read.
return processed_bytes.value
def settimeout(self, timeout):
self._timeout = timeout
def gettimeout(self):
return self._timeout
def send(self, data):
processed_bytes = ctypes.c_size_t(0)
with self._raise_on_error():
result = Security.SSLWrite(
self.context, data, len(data), ctypes.byref(processed_bytes)
)
if result == SecurityConst.errSSLWouldBlock and processed_bytes.value == 0:
# Timed out
raise socket.timeout("send timed out")
else:
_assert_no_error(result)
# We sent, and probably succeeded. Tell them how much we sent.
return processed_bytes.value
def sendall(self, data):
total_sent = 0
while total_sent < len(data):
sent = self.send(data[total_sent:total_sent + SSL_WRITE_BLOCKSIZE])
total_sent += sent
def shutdown(self):
with self._raise_on_error():
Security.SSLClose(self.context)
def close(self):
# TODO: should I do clean shutdown here? Do I have to?
if self._makefile_refs < 1:
self._closed = True
if self.context:
CoreFoundation.CFRelease(self.context)
self.context = None
if self._client_cert_chain:
CoreFoundation.CFRelease(self._client_cert_chain)
self._client_cert_chain = None
if self._keychain:
Security.SecKeychainDelete(self._keychain)
CoreFoundation.CFRelease(self._keychain)
shutil.rmtree(self._keychain_dir)
self._keychain = self._keychain_dir = None
return self.socket.close()
else:
self._makefile_refs -= 1
def getpeercert(self, binary_form=False):
# Urgh, annoying.
#
# Here's how we do this:
#
# 1. Call SSLCopyPeerTrust to get hold of the trust object for this
# connection.
# 2. Call SecTrustGetCertificateAtIndex for index 0 to get the leaf.
# 3. To get the CN, call SecCertificateCopyCommonName and process that
# string so that it's of the appropriate type.
# 4. To get the SAN, we need to do something a bit more complex:
# a. Call SecCertificateCopyValues to get the data, requesting
# kSecOIDSubjectAltName.
# b. Mess about with this dictionary to try to get the SANs out.
#
# This is gross. Really gross. It's going to be a few hundred LoC extra
# just to repeat something that SecureTransport can *already do*. So my
# operating assumption at this time is that what we want to do is
# instead to just flag to urllib3 that it shouldn't do its own hostname
# validation when using SecureTransport.
if not binary_form:
raise ValueError(
"SecureTransport only supports dumping binary certs"
)
trust = Security.SecTrustRef()
certdata = None
der_bytes = None
try:
# Grab the trust store.
result = Security.SSLCopyPeerTrust(
self.context, ctypes.byref(trust)
)
_assert_no_error(result)
if not trust:
# Probably we haven't done the handshake yet. No biggie.
return None
cert_count = Security.SecTrustGetCertificateCount(trust)
if not cert_count:
# Also a case that might happen if we haven't handshaked.
# Handshook? Handshaken?
return None
leaf = Security.SecTrustGetCertificateAtIndex(trust, 0)
assert leaf
# Ok, now we want the DER bytes.
certdata = Security.SecCertificateCopyData(leaf)
assert certdata
data_length = CoreFoundation.CFDataGetLength(certdata)
data_buffer = CoreFoundation.CFDataGetBytePtr(certdata)
der_bytes = ctypes.string_at(data_buffer, data_length)
finally:
if certdata:
CoreFoundation.CFRelease(certdata)
if trust:
CoreFoundation.CFRelease(trust)
return der_bytes
def _reuse(self):
self._makefile_refs += 1
def _drop(self):
if self._makefile_refs < 1:
self.close()
else:
self._makefile_refs -= 1
if _fileobject: # Platform-specific: Python 2
def makefile(self, mode, bufsize=-1):
self._makefile_refs += 1
return _fileobject(self, mode, bufsize, close=True)
else: # Platform-specific: Python 3
def makefile(self, mode="r", buffering=None, *args, **kwargs):
# We disable buffering with SecureTransport because it conflicts with
# the buffering that ST does internally (see issue #1153 for more).
buffering = 0
return backport_makefile(self, mode, buffering, *args, **kwargs)
WrappedSocket.makefile = makefile
class SecureTransportContext(object):
"""
I am a wrapper class for the SecureTransport library, to translate the
interface of the standard library ``SSLContext`` object to calls into
SecureTransport.
"""
def __init__(self, protocol):
self._min_version, self._max_version = _protocol_to_min_max[protocol]
self._options = 0
self._verify = False
self._trust_bundle = None
self._client_cert = None
self._client_key = None
self._client_key_passphrase = None
@property
def check_hostname(self):
"""
SecureTransport cannot have its hostname checking disabled. For more,
see the comment on getpeercert() in this file.
"""
return True
@check_hostname.setter
def check_hostname(self, value):
"""
SecureTransport cannot have its hostname checking disabled. For more,
see the comment on getpeercert() in this file.
"""
pass
@property
def options(self):
# TODO: Well, crap.
#
# So this is the bit of the code that is the most likely to cause us
# trouble. Essentially we need to enumerate all of the SSL options that
# users might want to use and try to see if we can sensibly translate
# them, or whether we should just ignore them.
return self._options
@options.setter
def options(self, value):
# TODO: Update in line with above.
self._options = value
@property
def verify_mode(self):
return ssl.CERT_REQUIRED if self._verify else ssl.CERT_NONE
@verify_mode.setter
def verify_mode(self, value):
self._verify = True if value == ssl.CERT_REQUIRED else False
def set_default_verify_paths(self):
# So, this has to do something a bit weird. Specifically, what it does
# is nothing.
#
# This means that, if we had previously had load_verify_locations
# called, this does not undo that. We need to do that because it turns
# out that the rest of the urllib3 code will attempt to load the
# default verify paths if it hasn't been told about any paths, even if
# the context itself was sometime earlier. We resolve that by just
# ignoring it.
pass
def load_default_certs(self):
return self.set_default_verify_paths()
def set_ciphers(self, ciphers):
# For now, we just require the default cipher string.
if ciphers != util.ssl_.DEFAULT_CIPHERS:
raise ValueError(
"SecureTransport doesn't support custom cipher strings"
)
def load_verify_locations(self, cafile=None, capath=None, cadata=None):
# OK, we only really support cadata and cafile.
if capath is not None:
raise ValueError(
"SecureTransport does not support cert directories"
)
self._trust_bundle = cafile or cadata
def load_cert_chain(self, certfile, keyfile=None, password=None):
self._client_cert = certfile
self._client_key = keyfile
self._client_cert_passphrase = password
def wrap_socket(self, sock, server_side=False,
do_handshake_on_connect=True, suppress_ragged_eofs=True,
server_hostname=None):
# So, what do we do here? Firstly, we assert some properties. This is a
# stripped down shim, so there is some functionality we don't support.
# See PEP 543 for the real deal.
assert not server_side
assert do_handshake_on_connect
assert suppress_ragged_eofs
# Ok, we're good to go. Now we want to create the wrapped socket object
# and store it in the appropriate place.
wrapped_socket = WrappedSocket(sock)
# Now we can handshake
wrapped_socket.handshake(
server_hostname, self._verify, self._trust_bundle,
self._min_version, self._max_version, self._client_cert,
self._client_key, self._client_key_passphrase
)
return wrapped_socket
pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.opt-1.pyc 0000644 00000042703 14751155150 0023056 0 ustar 00 3
���e%w � 1 @ s� d Z ddlmZ ddlZddlZddlZddlZddlZddl Z ddl
Z
ddl Z ddl Z ddl
mZ ddlmZmZmZ ddlmZmZmZmZ ydd l mZ W n$ ek
r� dZdd
lmZ Y nX y e d � W n e k
r� ed ��Y nX d
dgZ dZ ej Z ej!j"Z#e j$� Z%e j&� Z'dZ(ej)ej*ej+ej,ej-ej.ej/ej0ej1ej2ej3ej4ej5ej6ej7ej8ej9ej:ej;ej<ej=ej>ej?ej@ejAejBejCejDejEejFejGejHejIg!ZJe
jKejLejMfiZNeOe
d��r�ejPejPfeNe
jQ< eOe
d��r�ejRejRfeNe
jS< eOe
d��rejLejLfeNe
jT< eOe
d��r0ejUejUfeNe
jV< eOe
d��rNejMejMfeNe
jW< eOe
d��rjeNe
jK eNe
jX< dd
� ZYdd� ZZdd� Z[dd � Z\ej]e[�Z^ej_e\�Z`G d d � d ea�Zbe�r�d&d d �Zcn
d'd"d �Zceceb_cG d#d$� d$ea�ZddS )(aU
SecureTranport support for urllib3 via ctypes.
This makes platform-native TLS available to urllib3 users on macOS without the
use of a compiler. This is an important feature because the Python Package
Index is moving to become a TLSv1.2-or-higher server, and the default OpenSSL
that ships with macOS is not capable of doing TLSv1.2. The only way to resolve
this is to give macOS users an alternative solution to the problem, and that
solution is to use SecureTransport.
We use ctypes here because this solution must not require a compiler. That's
because pip is not allowed to require a compiler either.
This is not intended to be a seriously long-term solution to this problem.
The hope is that PEP 543 will eventually solve this issue for us, at which
point we can retire this contrib module. But in the short term, we need to
solve the impending tire fire that is Python on Mac without this kind of
contrib module. So...here we are.
To use this module, simply import and inject it::
import urllib3.contrib.securetransport
urllib3.contrib.securetransport.inject_into_urllib3()
Happy TLSing!
� )�absolute_importN� )�util� )�Security�
SecurityConst�CoreFoundation)�_assert_no_error�_cert_array_from_pem�_temporary_keychain�_load_client_cert_chain)� _fileobject)�backport_makefile� z5SecureTransport only works on Pythons with memoryview�inject_into_urllib3�extract_from_urllib3Ti @ �PROTOCOL_SSLv2�PROTOCOL_SSLv3�PROTOCOL_TLSv1�PROTOCOL_TLSv1_1�PROTOCOL_TLSv1_2� PROTOCOL_TLSc C s( t tj_tt_ttj_dt_dtj_dS )zG
Monkey-patch urllib3 with SecureTransport-backed SSL-support.
TN)�SecureTransportContextr �ssl_�
SSLContext�HAS_SNI�IS_SECURETRANSPORT� r r �%/usr/lib/python3.6/securetransport.pyr � s
c C s( t tj_tt_ttj_dt_dtj_dS )z>
Undo monkey-patching by :func:`inject_into_urllib3`.
FN)�orig_util_SSLContextr r r �orig_util_HAS_SNIr r r r r r r � s
c C sl d}�y,t j| �}|dkr tjS |j}|d }|j� }d}d}tj| j|�} t | �}
ylxf||k r�|dksr|dkr�t
j |g|�} | s�tj t
jd��|j|
||� �} || 7 }| sZ|s�tjS P qZW W nT tj k
�r }
z4|
j
}|dk o�|t
jk�r|t
jk�rtjS � W Y dd}
~
X nX ||d< ||k�r0tjS dS tk
�rf }
z|dk �rV|
|_tjS d}
~
X nX dS )zs
SecureTransport read callback. This is called by ST to request that data
be returned from the socket.
Nr z timed out)�_connection_refs�getr �errSSLInternal�socket�
gettimeout�ctypes�c_charZ from_address�
memoryviewr Z
wait_for_read�error�errno�EAGAIN� recv_into�errSSLClosedGraceful�
ECONNRESET�errSSLClosedAbort�errSSLWouldBlock� Exception�
_exception)�
connection_id� data_buffer�data_length_pointer�wrapped_socket� base_socketZrequested_length�timeoutr) Z
read_count�bufferZ buffer_viewZ readablesZ
chunk_size�er r r �_read_callback� sN
r; c
C sN d}�yt j| �}|dkr tjS |j}|d }tj||�}|j� }d}d} y`xZ| |k r�|dksf|dkr�tj |g|�}
|
s�tj
t j d��|j
|�} | | 7 } || d� }qNW W nN tj
k
r� } z0| j }|dk r�|t j kr�|t jkr�tjS � W Y dd} ~ X nX | |d< | |k�rtjS dS tk
�rH } z|dk �r8| |_tjS d} ~ X nX dS )zx
SecureTransport write callback. This is called by ST to request that data
actually be sent on the network.
Nr z timed out)r! r" r r# r$ r& � string_atr% r Zwait_for_writer) r* r+ �sendr. r/ r0 r1 r2 )
r3 r4 r5 r6 r7 Zbytes_to_write�datar8 r) �sentZ writablesZ
chunk_sentr: r r r �_write_callback� sD
r@ c @ s� e Zd ZdZdd� Zejdd� �Zdd� Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
d(dd�Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd)d"d#�Zd$d%� Zd&d'� ZdS )*�
WrappedSocketz�
API-compatibility wrapper for Python's OpenSSL wrapped socket object.
Note: _makefile_refs, _drop(), and _reuse() are needed for the garbage
collector of PyPy.
c C sL || _ d | _d| _d| _d | _d | _d | _d | _| j j� | _ | j j
d� d S )Nr F) r$ �context�_makefile_refs�_closedr2 � _keychain�
_keychain_dir�_client_cert_chainr% �_timeout�
settimeout)�selfr$ r r r �__init__. s zWrappedSocket.__init__c c s4 d| _ dV | j dk r0| j d }| _ | j� |�dS )a]
A context manager that can be used to wrap calls that do I/O from
SecureTransport. If any of the I/O callbacks hit an exception, this
context manager will correctly propagate the exception after the fact.
This avoids silently swallowing those exceptions.
It also correctly forces the socket closed.
N)r2 �close)rJ Z exceptionr r r �_raise_on_error@ s
z WrappedSocket._raise_on_errorc C s2 t jtt� t� }t j| j|tt��}t|� dS )a4
Sets up the allowed ciphers. By default this matches the set in
util.ssl_.DEFAULT_CIPHERS, at least as supported by macOS. This is done
custom and doesn't allow changing at this time, mostly because parsing
OpenSSL cipher strings is going to be a freaking nightmare.
N)r ZSSLCipherSuite�len�
CIPHER_SUITESZSSLSetEnabledCiphersrB r )rJ �ciphers�resultr r r � _set_ciphersU s zWrappedSocket._set_ciphersc C s |sdS t jj|�r2t|d��}|j� }W dQ R X d}tj� }z�t|�}tj| j t
j |��}t |� |srt
jd��tj||�}t |� tj|d�}t |� tj� }tj|t
j |��}t |� W d|r�tj|� |dkr�tj|� X tjtjf}|j|k�r
t
jd|j ��dS )z�
Called when we have set custom validation. We do this in two cases:
first, when cert validation is entirely disabled; and second, when
using a custom trust DB.
N�rbz Failed to copy trust referenceTz)certificate verify failed, error code: %d)�os�path�isfile�open�readr � SecTrustRefr
�SSLCopyPeerTrustrB r& �byrefr �sslZSSLErrorZ SecTrustSetAnchorCertificatesZ!SecTrustSetAnchorCertificatesOnlyZSecTrustResultTypeZSecTrustEvaluater � CFReleaser ZkSecTrustResultUnspecifiedZkSecTrustResultProceed�value) rJ �verify� trust_bundle�fZ
cert_array�trustrQ Z trust_resultZ successesr r r �_custom_validateb s@
z WrappedSocket._custom_validatec C s� t jdtjtj�| _t j| jtt�} t | � t
�4 t | �d }
x|
t krV|
d d }
q@W | t |
< W dQ R X t j
| j|
�} t | � |r�t|t�s�|jd�}t j| j|t|��} t | � | j� t j| j|�} t | � t j| j|�} t | � | s�|dk �rt j| jtjd�} t | � |�rNt� \| _| _t| j||�| _ t j | j| j �} t | � xf| j � �R t j | j�} | tj k�r~t!j"d��n(| tj#k�r�| j$||� �wPn
t | � P W dQ R X �qPW dS )z�
Actually performs the TLS handshake. This is run automatically by
wrapped socket, and shouldn't be needed in user code.
Ni���r zutf-8Tzhandshake timed out)%r ZSSLCreateContextr ZkSSLClientSideZkSSLStreamTyperB Z
SSLSetIOFuncs�_read_callback_pointer�_write_callback_pointerr �_connection_ref_lock�idr! ZSSLSetConnection�
isinstance�bytes�encodeZSSLSetPeerDomainNamerN rR ZSSLSetProtocolVersionMinZSSLSetProtocolVersionMaxZSSLSetSessionOptionZ"kSSLSessionOptionBreakOnServerAuthr rE rF r rG ZSSLSetCertificaterM Z SSLHandshaker0 r$ r8 ZerrSSLServerAuthCompletedrc ) rJ �server_hostnamer_ r` Z min_versionZ max_versionZ client_certZ
client_keyZclient_key_passphraserQ Zhandler r r � handshake� s\
zWrappedSocket.handshakec C s
| j j� S )N)r$ �fileno)rJ r r r rm � s zWrappedSocket.filenoc C s* | j dkr| j d8 _ | jr&| j� d S )Nr r )rC rD rL )rJ r r r �_decref_socketios� s
z WrappedSocket._decref_socketiosc C s& t j|�}| j||�}|d |� }|S )N)r& Zcreate_string_bufferr, )rJ Zbufsizr9 Z
bytes_readr> r r r �recv s
zWrappedSocket.recvNc
C s� | j r
dS |d krt|�}tj| j|�}tjd�}| j� � tj| j ||tj
|��}W d Q R X |t j kr�|j
dkr�tjd��n"|t jt jfkr�| j� nt|� |j
S )Nr zrecv timed out)rD rN r& r' Z from_buffer�c_size_trM r ZSSLReadrB r[ r r0 r^ r$ r8 r- ZerrSSLClosedNoNotifyrL r )rJ r9 �nbytes�processed_bytesrQ r r r r,
s
zWrappedSocket.recv_intoc C s
|| _ d S )N)rH )rJ r8 r r r rI 2 s zWrappedSocket.settimeoutc C s | j S )N)rH )rJ r r r r% 5 s zWrappedSocket.gettimeoutc
C sh t jd�}| j� �" tj| j|t|�t j|��}W d Q R X |tj krZ|j
dkrZt j d��nt
|� |j
S )Nr zsend timed out)r& rp rM r ZSSLWriterB rN r[ r r0 r^ r$ r8 r )rJ r> rr rQ r r r r= 8 s
" zWrappedSocket.sendc C s8 d}x.|t |�k r2| j|||t � �}||7 }qW d S )Nr )rN r= �SSL_WRITE_BLOCKSIZE)rJ r> Z
total_sentr? r r r �sendallI s zWrappedSocket.sendallc C s$ | j � � tj| j� W d Q R X d S )N)rM r ZSSLCloserB )rJ r r r �shutdownO s
zWrappedSocket.shutdownc C s� | j dk r�d| _| jr(tj| j� d | _| jr@tj| j� d | _| jrvtj| j� tj| j� t j
| j � d | _| _ | j j
� S | j d8 _ d S )Nr T)rC rD rB r r] rG rE r ZSecKeychainDelete�shutilZrmtreerF r$ rL )rJ r r r rL S s
zWrappedSocket.closeFc
C s� |s t d��tj� }d }d }zptj| jtj|��}t|� |sBd S tj|�}|sTd S tj |d�}tj
|�}t j |�}t j
|�} tj| |�}W d |r�t j|� |r�t j|� X |S )Nz2SecureTransport only supports dumping binary certsr )�
ValueErrorr rY rZ rB r& r[ r ZSecTrustGetCertificateCountZ SecTrustGetCertificateAtIndexZSecCertificateCopyDatar ZCFDataGetLengthZCFDataGetBytePtrr< r] )
rJ Z binary_formrb ZcertdataZ der_bytesrQ Z
cert_countZleafZ data_lengthr4 r r r � getpeercertf s2
zWrappedSocket.getpeercertc C s | j d7 _ d S )Nr )rC )rJ r r r �_reuse� s zWrappedSocket._reusec C s& | j dk r| j� n| j d8 _ d S )Nr )rC rL )rJ r r r �_drop� s
zWrappedSocket._drop)N)F)�__name__�
__module__� __qualname__�__doc__rK �
contextlib�contextmanagerrM rR rc rl rm rn ro r, rI r% r= rt ru rL rx ry rz r r r r rA ' s&
>Z
(
>rA c C s | j d7 _ t| ||dd�S )Nr T)rL )rC r
)rJ �mode�bufsizer r r �makefile� s r� �rc O s d}t | ||f|�|�S )Nr )r )rJ r� � buffering�args�kwargsr r r r� � s c @ s� e Zd ZdZdd� Zedd� �Zejdd� �Zedd� �Zejd d� �Zed
d � �Z e jd d � �Z d
d� Z
dd� Z dd� Z d dd�Z
d dd�Zd dd�ZdS ) r z�
I am a wrapper class for the SecureTransport library, to translate the
interface of the standard library ``SSLContext`` object to calls into
SecureTransport.
c C s8 t | \| _| _d| _d| _d | _d | _d | _d | _d S )Nr F) �_protocol_to_min_max� _min_version� _max_version�_options�_verify�
_trust_bundle� _client_cert� _client_key�_client_key_passphrase)rJ Zprotocolr r r rK � s z SecureTransportContext.__init__c C s dS )z�
SecureTransport cannot have its hostname checking disabled. For more,
see the comment on getpeercert() in this file.
Tr )rJ r r r �check_hostname� s z%SecureTransportContext.check_hostnamec C s dS )z�
SecureTransport cannot have its hostname checking disabled. For more,
see the comment on getpeercert() in this file.
Nr )rJ r^ r r r r� � s c C s | j S )N)r� )rJ r r r �options� s z SecureTransportContext.optionsc C s
|| _ d S )N)r� )rJ r^ r r r r� � s c C s | j r tjS tjS )N)r� r\ �
CERT_REQUIREDZ CERT_NONE)rJ r r r � verify_mode� s z"SecureTransportContext.verify_modec C s |t jkrdnd| _d S )NTF)r\ r� r� )rJ r^ r r r r� � s c C s d S )Nr )rJ r r r �set_default_verify_paths� s
z/SecureTransportContext.set_default_verify_pathsc C s | j � S )N)r� )rJ r r r �load_default_certs� s z)SecureTransportContext.load_default_certsc C s |t jjkrtd��d S )Nz5SecureTransport doesn't support custom cipher strings)r r ZDEFAULT_CIPHERSrw )rJ rP r r r � set_ciphers s z"SecureTransportContext.set_ciphersNc C s |d k rt d��|p|| _d S )Nz1SecureTransport does not support cert directories)rw r� )rJ ZcafileZcapathZcadatar r r �load_verify_locations s z,SecureTransportContext.load_verify_locationsc C s || _ || _|| _d S )N)r� r� Z_client_cert_passphrase)rJ ZcertfileZkeyfileZpasswordr r r �load_cert_chain s z&SecureTransportContext.load_cert_chainFTc C s2 t |�}|j|| j| j| j| j| j| j| j� |S )N) rA rl r� r� r� r� r� r� r� )rJ ZsockZ server_sideZdo_handshake_on_connectZsuppress_ragged_eofsrk r6 r r r � wrap_socket s
z"SecureTransportContext.wrap_socket)NNN)NN)FTTN)r{ r| r} r~ rK �propertyr� �setterr� r� r� r� r� r� r� r� r r r r r � s
r ���)r� )r� N)er~ Z
__future__r r r& r* Zos.pathrT rv r$ r\ Z threading�weakref� r Z_securetransport.bindingsr r r Z_securetransport.low_levelr r
r r r
� ImportErrorZpackages.backports.makefiler r( � NameError�__all__r r r r r �WeakValueDictionaryr! ZLockrf rs ZTLS_AES_256_GCM_SHA384Z TLS_CHACHA20_POLY1305_SHA256ZTLS_AES_128_GCM_SHA256Z'TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384Z'TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256Z#TLS_DHE_DSS_WITH_AES_256_GCM_SHA384Z#TLS_DHE_RSA_WITH_AES_256_GCM_SHA384Z#TLS_DHE_DSS_WITH_AES_128_GCM_SHA256Z#TLS_DHE_RSA_WITH_AES_128_GCM_SHA256Z'TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384Z$TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_256_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_256_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_256_CBC_SHAZ TLS_DHE_DSS_WITH_AES_256_CBC_SHAZ'TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256Z$TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_128_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_128_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_128_CBC_SHAZ TLS_DHE_DSS_WITH_AES_128_CBC_SHAZ TLS_RSA_WITH_AES_256_GCM_SHA384Z TLS_RSA_WITH_AES_128_GCM_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHA256Z TLS_RSA_WITH_AES_128_CBC_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHAZ TLS_RSA_WITH_AES_128_CBC_SHArO ZPROTOCOL_SSLv23Z
kTLSProtocol1ZkTLSProtocol12r� �hasattrZ
kSSLProtocol2r Z
kSSLProtocol3r r ZkTLSProtocol11r r r r r r; r@ Z SSLReadFuncrd Z SSLWriteFuncre �objectrA r� r r r r r �<module> s� 95
pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.pyc 0000644 00000006131 14751155150 0020513 0 ustar 00 3
���e~ � @ s\ d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z ee
�Z G dd � d e�Z d
S ) z
NTLM authenticating pool, contributed by erikcederstran
Issue #10, see: http://code.google.com/p/urllib3/issues/detail?id=10
� )�absolute_import)� getLogger)�ntlm� )�HTTPSConnectionPool)�HTTPSConnectionc s: e Zd ZdZdZ� fdd�Zdd� Zd � fd
d � Z� ZS )
�NTLMConnectionPoolzQ
Implements an NTLM authentication version of an urllib3 connection pool
Zhttpsc sL t t| �j||� || _|| _|jdd�}|d j� | _|d | _|| _ dS )z�
authurl is a random URL on the server that is protected by NTLM.
user is the Windows user, probably in the DOMAIN\username format.
pw is the password for the user.
�\� r N)
�superr �__init__�authurl�rawuser�split�upper�domain�user�pw)�selfr r r
�args�kwargsZ
user_parts)� __class__� � /usr/lib/python3.6/ntlmpool.pyr s
zNTLMConnectionPool.__init__c
C s� | j d7 _ tjd| j | j| j� i }d|d< d}d}t| j| jd�}dtj| j � ||< tjd |� |j
d
| jd |� |j � }t |j
� �}tjd |j|j� tjd |� tjd
|jd�� d |_|| jd�}d }x(|D ] } | d d� dkr�| dd � }q�W |d k�r td||| f ��tj|�\}
} tj|
| j| j| j| �} d| ||< tjd |� |j
d
| jd |� |j � }tjd |j|j� tjd t |j
� �� tjd
|j� d d� � |jdk�r�|jdk�r�td��td|j|jf ��d |_tjd� |S )Nr
z3Starting NTLM HTTPS connection no. %d: https://%s%sz
Keep-Alive�
ConnectionZ
Authorizationzwww-authenticate)�host�portzNTLM %szRequest headers: %sZGETzResponse status: %s %szResponse headers: %szResponse data: %s [...]�d z, � zNTLM z!Unexpected %s response header: %s�� i� z3Server rejected request: wrong username or passwordz Wrong server response: %s %szConnection established)Znum_connections�log�debugr r
r r r Z create_NTLM_NEGOTIATE_MESSAGEr ZrequestZ getresponse�dictZ
getheadersZstatus�reason�read�fpr � ExceptionZ parse_NTLM_CHALLENGE_MESSAGEZ create_NTLM_AUTHENTICATE_MESSAGEr r r )
r �headersZ
req_headerZ resp_headerZconn�resZreshdrZauth_header_valuesZauth_header_value�sZServerChallengeZNegotiateFlagsZauth_msgr r r � _new_conn' s\
z NTLMConnectionPool._new_connN� Tc s0 |d kr i }d|d< t t| �j|||||||�S )Nz
Keep-Aliver )r r �urlopen)r �methodZurlZbodyr' ZretriesZredirectZassert_same_host)r r r r, h s zNTLMConnectionPool.urlopen)NNr+ TT) �__name__�
__module__� __qualname__�__doc__�schemer r* r, �
__classcell__r r )r r r s A r N)
r1 Z
__future__r Zloggingr r � r Z packages.six.moves.http_clientr r. r r r r r r �<module> s pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.pyc 0000644 00000021027 14751155150 0020616 0 ustar 00 3
���eq* � @ s d Z ddlmZ ddlZddlZddlZddlmZ ddlm Z m
Z
m Z m Z m
Z
mZ ddlmZ ddlmZ dd lmZ dd
lmZ dd lmZ ydd lmZ W n ek
r� dZY nX ej e �Z G d
d� de
�Z G dd� de �Z G dd� de�Z!dd� Z"dd� Z#dd� Z$dd� Z%dd � Z&dS ) aC
This module provides a pool manager that uses Google App Engine's
`URLFetch Service <https://cloud.google.com/appengine/docs/python/urlfetch>`_.
Example usage::
from urllib3 import PoolManager
from urllib3.contrib.appengine import AppEngineManager, is_appengine_sandbox
if is_appengine_sandbox():
# AppEngineManager uses AppEngine's URLFetch API behind the scenes
http = AppEngineManager()
else:
# PoolManager uses a socket-level API behind the scenes
http = PoolManager()
r = http.request('GET', 'https://google.com/')
There are `limitations <https://cloud.google.com/appengine/docs/python/urlfetch/#Python_Quotas_and_limits>`_ to the URLFetch service and it may not be
the best choice for your application. There are three options for using
urllib3 on Google App Engine:
1. You can use :class:`AppEngineManager` with URLFetch. URLFetch is
cost-effective in many circumstances as long as your usage is within the
limitations.
2. You can use a normal :class:`~urllib3.PoolManager` by enabling sockets.
Sockets also have `limitations and restrictions
<https://cloud.google.com/appengine/docs/python/sockets/ #limitations-and-restrictions>`_ and have a lower free quota than URLFetch.
To use sockets, be sure to specify the following in your ``app.yaml``::
env_variables:
GAE_USE_SOCKETS_HTTPLIB : 'true'
3. If you are using `App Engine Flexible
<https://cloud.google.com/appengine/docs/flexible/>`_, you can use the standard
:class:`PoolManager` without any configuration or special environment variables.
� )�absolute_importN� )�urljoin)� HTTPError� HTTPWarning�
MaxRetryError�
ProtocolError� TimeoutError�SSLError)�BytesIO)�RequestMethods)� HTTPResponse)�Timeout)�Retry)�urlfetchc @ s e Zd ZdS )�AppEnginePlatformWarningN)�__name__�
__module__� __qualname__� r r � /usr/lib/python3.6/appengine.pyr G s r c @ s e Zd ZdS )�AppEnginePlatformErrorN)r r r r r r r r K s r c @ sX e Zd ZdZddd�Zdd� Zdd � Zddddejfd
d �Z d d
� Z
dd� Z dd� Z dS )�AppEngineManagera
Connection manager for Google App Engine sandbox applications.
This manager uses the URLFetch service directly instead of using the
emulated httplib, and is subject to URLFetch limitations as described in
the App Engine documentation `here
<https://cloud.google.com/appengine/docs/python/urlfetch>`_.
Notably it will raise an :class:`AppEnginePlatformError` if:
* URLFetch is not available.
* If you attempt to use this on App Engine Flexible, as full socket
support is available.
* If a request size is more than 10 megabytes.
* If a response size is more than 32 megabtyes.
* If you use an unsupported request method such as OPTIONS.
Beyond those cases, it will raise normal urllib3 errors.
NTc C sN t s td��t� rtd��tjdt� tj| |� || _|| _ |pFt
j | _ d S )Nz.URLFetch is not available in this environment.z�Use normal urllib3.PoolManager instead of AppEngineManageron Managed VMs, as using URLFetch is not necessary in this environment.z�urllib3 is using URLFetch on Google App Engine sandbox instead of sockets. To use sockets directly instead of URLFetch see https://urllib3.readthedocs.io/en/latest/reference/urllib3.contrib.html.)
r r �is_prod_appengine_mvms�warnings�warnr r �__init__�validate_certificate�urlfetch_retriesr ZDEFAULT�retries)�self�headersr r r r r r r c s zAppEngineManager.__init__c C s | S )Nr )r r r r � __enter__{ s zAppEngineManager.__enter__c C s dS )NFr )r �exc_typeZexc_valZexc_tbr r r �__exit__~ s zAppEngineManager.__exit__c K s� | j ||�}yF|o |jdko |j} tj||||p2i d| jo<| | j|�| jd�}
W �nB tjk
r� } zt | | ��W Y d d } ~ X �n tj
k
r� } z$dt | �kr�t d| ��t
| ��W Y d d } ~ X n� tjk
�r } z(dt | �kr�t| || d��t
| ��W Y d d } ~ X n� tjk
�r6 } zt d| ��W Y d d } ~ X n` tjk
�rb } zt| ��W Y d d } ~ X n4 tjk
�r� } zt d | | ��W Y d d } ~ X nX | j|
fd
|i|��} |�o�| j� }
|
�rr| j�r�|j�r�t| |d ��n�| jd k�r�d
}y|j||| | d�}W n* tk
�r. |j�r*t| |d ��| S X |j| � tjd||
� t ||
�}| j ||||f|||d�|��S t | j d��}|j || j|��r�|j||| | d�}tjd|� |j!| � | j ||f|||||d�|��S | S )Nr F)Zpayload�methodr! Zallow_truncated�follow_redirectsZdeadliner z too largezOURLFetch request too large, URLFetch only supports requests up to 10mb in size.zToo many redirects)�reasonzPURLFetch response too large, URLFetch only supportsresponses up to 32mb in size.z$URLFetch does not support method: %sr ztoo many redirectsi/ ZGET)�responseZ_poolzRedirecting %s -> %s)r �redirect�timeoutz Retry-Afterz Retry: %s)�bodyr! r r) r* )"� _get_retriesr) �totalr Zfetchr �_get_absolute_timeoutr ZDeadlineExceededErrorr ZInvalidURLError�strr r Z
DownloadErrorr ZResponseTooLargeErrorZSSLCertificateErrorr
ZInvalidMethodError�#_urlfetch_response_to_http_responseZget_redirect_locationZraise_on_redirect�statusZ incrementZsleep_for_retry�log�debugr �urlopen�boolZ getheaderZis_retryZsleep)r r% Zurlr+ r! r r) r* � response_kwr& r( �eZ
http_responseZredirect_locationZ redirect_urlZhas_retry_afterr r r r4 � s�
zAppEngineManager.urlopenc K sz t � r"|jjd�}|dkr"|jd= |jjd�}|dkrZ|jd�}|jd� dj|�|jd< tf t|j�|j|j d�|��S )Nzcontent-encodingZdeflateztransfer-encodingZchunked�,)r+ r! r1 )
�is_prod_appenginer! �get�split�remove�joinr
r ZcontentZ status_code)r Z
urlfetch_respr6 Zcontent_encodingZtransfer_encodingZ encodingsr r r r0 � s
z4AppEngineManager._urlfetch_response_to_http_responsec C sB |t jkrd S t|t �r>|jd k s,|jd k r8tjdt� |jS |S )NzdURLFetch does not support granular timeout settings, reverting to total or default URLFetch timeout.) r �DEFAULT_TIMEOUT�
isinstanceZ_readZ_connectr r r r- )r r* r r r r. � s
z&AppEngineManager._get_absolute_timeoutc C s> t |t�s tj||| jd�}|js.|js.|jr:tjdt � |S )N)r) �defaultzhURLFetch only supports total retries and does not recognize connect, read, or redirect retry parameters.)
r? r Zfrom_intr Zconnect�readr) r r r )r r r) r r r r, s
z AppEngineManager._get_retries)NNTT)
r r r �__doc__r r" r$ r r> r4 r0 r. r, r r r r r O s
Z r c C s t � pt� pt� S )N)�is_local_appenginer9 r r r r r � is_appengine s rD c C s t � o t� S )N)rD r r r r r �is_appengine_sandbox s rE c C s dt jkodt jd kS )N�APPENGINE_RUNTIMEz Development/�SERVER_SOFTWARE)�os�environr r r r rC s
rC c C s dt jko dt jd ko t� S )NrF zGoogle App Engine/rG )rH rI r r r r r r9 ! s
r9 c C s t jjdd�dkS )NZGAE_VMF�true)rH rI r: r r r r r ' s r )'rB Z
__future__r ZloggingrH r Z packages.six.moves.urllib.parser �
exceptionsr r r r r r
Z packages.sixr Zrequestr r( r
Z util.timeoutr Z
util.retryr Zgoogle.appengine.apir � ImportErrorZ getLoggerr r2 r r r rD rE rC r9 r r r r r �<module>' s2
D pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.pyc 0000644 00000033337 14751155150 0020713 0 ustar 00 3
���e�; � @ s, d Z ddlmZ ddlZddlmZ ddlmZ ddl
m Z ddl m
Z
mZ ddlmZ ydd l mZ W n$ ek
r� dZd
d lmZ Y nX ddlZddlZd
d lmZ ddlZd
d
lm Z ddgZ dZ ej ej j!ej"ej j#iZ$e%ed�o�e%ej d��rej j&e$ej'< e%ed��r0e%ej d��r0ej j(e$ej)< ye$j*ej+ej j,i� W n e-k
�r^ Y nX ej.ej j/ej0ej j1ej2ej j1ej j3 iZ4e5dd� e4j6� D ��Z7dZ8e j Z9e j:j;Z<ej=e>�Z?dd� Z@dd� ZAdd� ZBd d � ZCd d � ZDG d d!� d!eE�ZFe�rd*d#d$�ZGneZGeGeF_GG d%d&� d&eE�ZHd'd(� ZIdS )+ab
SSL with SNI_-support for Python 2. Follow these instructions if you would
like to verify SSL certificates in Python 2. Note, the default libraries do
*not* do certificate checking; you need to do additional work to validate
certificates yourself.
This needs the following packages installed:
* pyOpenSSL (tested with 16.0.0)
* cryptography (minimum 1.3.4, from pyopenssl)
* idna (minimum 2.0, from cryptography)
However, pyopenssl depends on cryptography, which depends on idna, so while we
use all three directly here we end up having relatively few packages required.
You can install them with the following command:
pip install pyopenssl cryptography idna
To activate certificate checking, call
:func:`~urllib3.contrib.pyopenssl.inject_into_urllib3` from your Python code
before you begin making HTTP requests. This can be done in a ``sitecustomize``
module, or at any other time before your application begins using ``urllib3``,
like this::
try:
import urllib3.contrib.pyopenssl
urllib3.contrib.pyopenssl.inject_into_urllib3()
except ImportError:
pass
Now you can use :mod:`urllib3` as you normally would, and it will support SNI
when the required modules are installed.
Activating this module also has the positive side effect of disabling SSL/TLS
compression in Python 2 (see `CRIME attack`_).
If you want to configure the default list of supported cipher suites, you can
set the ``urllib3.contrib.pyopenssl.DEFAULT_SSL_CIPHER_LIST`` variable.
.. _sni: https://en.wikipedia.org/wiki/Server_Name_Indication
.. _crime attack: https://en.wikipedia.org/wiki/CRIME_(security_exploit)
� )�absolute_importN)�x509)�backend)� _Certificate)�timeout�error)�BytesIO)� _fileobject� )�backport_makefile)�six)�util�inject_into_urllib3�extract_from_urllib3T�PROTOCOL_TLSv1_1�TLSv1_1_METHOD�PROTOCOL_TLSv1_2�TLSv1_2_METHODc c s | ]\}}||fV qd S )N� )�.0�k�vr r � /usr/lib/python3.6/pyopenssl.py� <genexpr>` s r i @ c C s. t � ttj_tt_ttj_dt_dtj_dS )z7Monkey-patch urllib3 with PyOpenSSL-backed SSL-support.TN)�_validate_dependencies_met�PyOpenSSLContextr
�ssl_�
SSLContext�HAS_SNI� IS_PYOPENSSLr r r r r m s c C s( t tj_tt_ttj_dt_dtj_dS )z4Undo monkey-patching by :func:`inject_into_urllib3`.FN)�orig_util_SSLContextr
r r �orig_util_HAS_SNIr r r r r r r y s
c C sR ddl m} t| dd�dkr$td��ddlm} |� }t|dd�dkrNtd��dS ) z{
Verifies that PyOpenSSL's package-level dependencies have been met.
Throws `ImportError` if they are not met.
r )�
Extensions�get_extension_for_classNzX'cryptography' module missing required functionality. Try upgrading to v1.3.4 or newer.)�X509�_x509zS'pyOpenSSL' module missing required functionality. Try upgrading to v0.14 or newer.)Z cryptography.x509.extensionsr" �getattr� ImportErrorZOpenSSL.cryptor$ )r" r$ r r r r r � s r c C s( dd� }|| �} t jdkr$| jd�} | S )a�
Converts a dNSName SubjectAlternativeName field to the form used by the
standard library on the given Python version.
Cryptography produces a dNSName as a unicode string that was idna-decoded
from ASCII bytes. We need to idna-encode that string to get it back, and
then on Python 3 we also need to convert to unicode via UTF-8 (the stdlib
uses PyUnicode_FromStringAndSize on it, which decodes via UTF-8).
c S sN ddl }x:dD ]2}| j|�r| t|�d� } |jd�|j| � S qW |j| �S )z�
Borrowed wholesale from the Python Cryptography Project. It turns out
that we can't just safely call `idna.encode`: it can explode for
wildcard names. This avoids that problem.
r N�*.�.�ascii)r( r) )�idna�
startswith�len�encode)�namer+ �prefixr r r � idna_encode� s
z'_dnsname_to_stdlib.<locals>.idna_encode� r zutf-8)r2 r )�sys� version_info�decode)r/ r1 r r r �_dnsname_to_stdlib� s
r6 c C s� t | d�r| j� }n tt| j�}y|jjtj�j }W nN tj
k
rJ g S tj tj tj
tfk
r� } ztjd|� g S d}~X nX dd� |jtj�D �}|jdd� |jtj�D �� |S )zU
Given an PyOpenSSL certificate, provides all the subject alternative names.
�to_cryptographyz�A problem was encountered with the certificate that prevented urllib3 from finding the SubjectAlternativeName field. This can affect certificate validation. The error was %sNc S s g | ]}d t |�f�qS )ZDNS)r6 )r r/ r r r �
<listcomp>� s z%get_subj_alt_name.<locals>.<listcomp>c s s | ]}d t |�fV qdS )z
IP AddressN)�str)r r/ r r r r � s z$get_subj_alt_name.<locals>.<genexpr>)�hasattrr7 r �openssl_backendr% �
extensionsr# r ZSubjectAlternativeName�valueZExtensionNotFoundZDuplicateExtensionZUnsupportedExtensionZUnsupportedGeneralNameType� UnicodeError�logZwarningZget_values_for_typeZDNSName�extendZ IPAddress)Z peer_certZcertZext�e�namesr r r �get_subj_alt_name� s(
rC c @ s| e Zd ZdZd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
d dd�Zdd� Zd d � Zd S )!�
WrappedSocketz�API-compatibility wrapper for Python OpenSSL's Connection-class.
Note: _makefile_refs, _drop() and _reuse() are needed for the garbage
collector of pypy.
Tc C s" || _ || _|| _d| _d| _d S )Nr F)�
connection�socket�suppress_ragged_eofs�_makefile_refs�_closed)�selfrE rF rG r r r �__init__� s
zWrappedSocket.__init__c C s
| j j� S )N)rF �fileno)rJ r r r rL � s zWrappedSocket.filenoc C s* | j dkr| j d8 _ | jr&| j� d S )Nr � )rH rI �close)rJ r r r �_decref_socketios� s
z WrappedSocket._decref_socketiosc O s� y| j j||�}W n� tjjk
rX } z&| jr<|jdkr<dS tt|���W Y d d }~X n� tjj k
r� } z | j j
� tjj kr�dS � W Y d d }~X nJ tjj k
r� t
j| j| jj� �}|s�td��n | j||�S Y nX |S d S )NrM �Unexpected EOF� z The read operation timed out���)rR rP )rE �recv�OpenSSL�SSL� SysCallErrorrG �args� SocketErrorr9 �ZeroReturnError� get_shutdown�RECEIVED_SHUTDOWN�
WantReadErrorr
�
wait_for_readrF �
gettimeoutr )rJ rW �kwargs�datarA �rdr r r rS s
zWrappedSocket.recvc O s� y| j j||�S tjjk
rT } z&| jr8|jdkr8dS tt|���W Y d d }~X n� tjj k
r� } z | j j
� tjj kr~dS � W Y d d }~X nF tjj k
r� t
j| j| jj� �}|s�td��n | j||�S Y nX d S )NrM �Unexpected EOFr z The read operation timed outrR )rR rb )rE � recv_intorT rU rV rG rW rX r9 rY rZ r[ r\ r
r] rF r^ r )rJ rW r_ rA ra r r r rc s
zWrappedSocket.recv_intoc C s | j j|�S )N)rF �
settimeout)rJ r r r r rd * s zWrappedSocket.settimeoutc C s� xzy | j j|�S tjjk
rF tj| j| jj� �}|s@t � �wY q tjj
k
rv } zt t |���W Y d d }~X qX qW d S )N)
rE �sendrT rU ZWantWriteErrorr
Zwait_for_writerF r^ r rV rX r9 )rJ r` �wrrA r r r �_send_until_done- s z WrappedSocket._send_until_donec C s8 d}x.|t |�k r2| j|||t � �}||7 }qW d S )Nr )r- rg �SSL_WRITE_BLOCKSIZE)rJ r` Z
total_sentZsentr r r �sendall9 s zWrappedSocket.sendallc C s | j j� d S )N)rE �shutdown)rJ r r r rj ? s zWrappedSocket.shutdownc C sH | j dk r6yd| _| jj� S tjjk
r2 d S X n| j d8 _ d S )NrM T)rH rI rE rN rT rU �Error)rJ r r r rN C s
zWrappedSocket.closeFc C sD | j j� }|s|S |r(tjjtjj|�S d|j� jffft|�d�S )NZ
commonName)ZsubjectZsubjectAltName) rE Zget_peer_certificaterT ZcryptoZdump_certificateZ
FILETYPE_ASN1Z get_subjectZCNrC )rJ Z binary_formr r r r � getpeercertM s
zWrappedSocket.getpeercertc C s | j d7 _ d S )NrM )rH )rJ r r r �_reuse_ s zWrappedSocket._reusec C s& | j dk r| j� n| j d8 _ d S )NrM )rH rN )rJ r r r �_dropb s
zWrappedSocket._dropN)T)F)�__name__�
__module__� __qualname__�__doc__rK rL rO rS rc rd rg ri rj rN rl rm rn r r r r rD � s
rD rM c C s | j d7 _ t| ||dd�S )NrM T)rN )rH r )rJ �mode�bufsizer r r �makefilej s ru c @ sz e Zd ZdZdd� Zedd� �Zejdd� �Zedd� �Zejd d� �Zd
d � Z d d
� Z
ddd�Z ddd�Z ddd�Z
dS )r z�
I am a wrapper class for the PyOpenSSL ``Context`` object. I am responsible
for translating the interface of the standard library ``SSLContext`` object
to calls into PyOpenSSL.
c C s* t | | _tjj| j�| _d| _d| _d S )Nr F)�_openssl_versions�protocolrT rU ZContext�_ctx�_optionsZcheck_hostname)rJ rw r r r rK y s
zPyOpenSSLContext.__init__c C s | j S )N)ry )rJ r r r �options s zPyOpenSSLContext.optionsc C s || _ | jj|� d S )N)ry rx Z set_options)rJ r= r r r rz � s c C s t | jj� S )N)�_openssl_to_stdlib_verifyrx Zget_verify_mode)rJ r r r � verify_mode� s z PyOpenSSLContext.verify_modec C s | j jt| t� d S )N)rx Z
set_verify�_stdlib_to_openssl_verify�_verify_callback)rJ r= r r r r| � s c C s | j j� d S )N)rx �set_default_verify_paths)rJ r r r r � s z)PyOpenSSLContext.set_default_verify_pathsc C s& t |tj�r|jd�}| jj|� d S )Nzutf-8)�
isinstancer � text_typer. rx Zset_cipher_list)rJ Zciphersr r r � set_ciphers� s
z PyOpenSSLContext.set_ciphersNc C sN |d k r|j d�}|d k r$|j d�}| jj||� |d k rJ| jjt|�� d S )Nzutf-8)r. rx �load_verify_locationsr )rJ ZcafileZcapathZcadatar r r r� � s
z&PyOpenSSLContext.load_verify_locationsc s< | j j|� � d k r(| j j� fdd�� | j j|p4|� d S )Nc s � S )Nr )Z
max_lengthZ prompt_twiceZuserdata)�passwordr r �<lambda>� s z2PyOpenSSLContext.load_cert_chain.<locals>.<lambda>)rx Zuse_certificate_fileZ
set_passwd_cbZuse_privatekey_file)rJ ZcertfileZkeyfiler� r )r� r �load_cert_chain� s z PyOpenSSLContext.load_cert_chainFTc C s� t jj| j|�}t|tj�r&|jd�}|d k r8|j|� |j � x|y |j
� W nh t jj k
r� t j
||j� �}|s~td��wBY n4 t jjk
r� } ztjd| ��W Y d d }~X nX P qBW t||�S )Nzutf-8zselect timed outzbad handshake: %r)rT rU Z
Connectionrx r� r r� r. Zset_tlsext_host_nameZset_connect_stateZ do_handshaker\ r
r] r^ r rk �sslZSSLErrorrD ) rJ ZsockZ server_sideZdo_handshake_on_connectrG Zserver_hostname�cnxra rA r r r � wrap_socket� s$
z PyOpenSSLContext.wrap_socket)NNN)NN)FTTN)ro rp rq rr rK �propertyrz �setterr| r r� r� r� r� r r r r r s s
r c C s |dkS )Nr r )r� r Zerr_noZ err_depthZ return_coder r r r~ � s r~ rR )rR )Jrr Z
__future__r Z OpenSSL.SSLrT Z cryptographyr Z$cryptography.hazmat.backends.opensslr r; Z)cryptography.hazmat.backends.openssl.x509r rF r r rX �ior r r' Zpackages.backports.makefiler Zloggingr� Zpackagesr r3 � r
�__all__r ZPROTOCOL_SSLv23rU Z
SSLv23_METHODZPROTOCOL_TLSv1Z TLSv1_METHODrv r: r r r r �updateZPROTOCOL_SSLv3Z SSLv3_METHOD�AttributeErrorZ CERT_NONEZ VERIFY_NONEZ
CERT_OPTIONALZ VERIFY_PEERZ
CERT_REQUIREDZVERIFY_FAIL_IF_NO_PEER_CERTr} �dict�itemsr{ rh r! r r r Z getLoggerro r? r r r r6 rC �objectrD ru r r~ r r r r �<module>+ sh
3 S pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.pyc 0000644 00000000161 14751155150 0020403 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000161 14751155150 0021342 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.pyc 0000644 00000043014 14751155150 0022113 0 ustar 00 3
���e%w � 1 @ s� d Z ddlmZ ddlZddlZddlZddlZddlZddl Z ddl
Z
ddl Z ddl Z ddl
mZ ddlmZmZmZ ddlmZmZmZmZ ydd l mZ W n$ ek
r� dZdd
lmZ Y nX y e d � W n e k
r� ed ��Y nX d
dgZ dZ ej Z ej!j"Z#e j$� Z%e j&� Z'dZ(ej)ej*ej+ej,ej-ej.ej/ej0ej1ej2ej3ej4ej5ej6ej7ej8ej9ej:ej;ej<ej=ej>ej?ej@ejAejBejCejDejEejFejGejHejIg!ZJe
jKejLejMfiZNeOe
d��r�ejPejPfeNe
jQ< eOe
d��r�ejRejRfeNe
jS< eOe
d��rejLejLfeNe
jT< eOe
d��r0ejUejUfeNe
jV< eOe
d��rNejMejMfeNe
jW< eOe
d��rjeNe
jK eNe
jX< dd
� ZYdd� ZZdd� Z[dd � Z\ej]e[�Z^ej_e\�Z`G d d � d ea�Zbe�r�d&d d �Zcn
d'd"d �Zceceb_cG d#d$� d$ea�ZddS )(aU
SecureTranport support for urllib3 via ctypes.
This makes platform-native TLS available to urllib3 users on macOS without the
use of a compiler. This is an important feature because the Python Package
Index is moving to become a TLSv1.2-or-higher server, and the default OpenSSL
that ships with macOS is not capable of doing TLSv1.2. The only way to resolve
this is to give macOS users an alternative solution to the problem, and that
solution is to use SecureTransport.
We use ctypes here because this solution must not require a compiler. That's
because pip is not allowed to require a compiler either.
This is not intended to be a seriously long-term solution to this problem.
The hope is that PEP 543 will eventually solve this issue for us, at which
point we can retire this contrib module. But in the short term, we need to
solve the impending tire fire that is Python on Mac without this kind of
contrib module. So...here we are.
To use this module, simply import and inject it::
import urllib3.contrib.securetransport
urllib3.contrib.securetransport.inject_into_urllib3()
Happy TLSing!
� )�absolute_importN� )�util� )�Security�
SecurityConst�CoreFoundation)�_assert_no_error�_cert_array_from_pem�_temporary_keychain�_load_client_cert_chain)� _fileobject)�backport_makefile� z5SecureTransport only works on Pythons with memoryview�inject_into_urllib3�extract_from_urllib3Ti @ �PROTOCOL_SSLv2�PROTOCOL_SSLv3�PROTOCOL_TLSv1�PROTOCOL_TLSv1_1�PROTOCOL_TLSv1_2� PROTOCOL_TLSc C s( t tj_tt_ttj_dt_dtj_dS )zG
Monkey-patch urllib3 with SecureTransport-backed SSL-support.
TN)�SecureTransportContextr �ssl_�
SSLContext�HAS_SNI�IS_SECURETRANSPORT� r r �%/usr/lib/python3.6/securetransport.pyr � s
c C s( t tj_tt_ttj_dt_dtj_dS )z>
Undo monkey-patching by :func:`inject_into_urllib3`.
FN)�orig_util_SSLContextr r r �orig_util_HAS_SNIr r r r r r r � s
c C sl d}�y,t j| �}|dkr tjS |j}|d }|j� }d}d}tj| j|�} t | �}
ylxf||k r�|dksr|dkr�t
j |g|�} | s�tj t
jd��|j|
||� �} || 7 }| sZ|s�tjS P qZW W nT tj k
�r }
z4|
j
}|dk o�|t
jk�r|t
jk�rtjS � W Y dd}
~
X nX ||d< ||k�r0tjS dS tk
�rf }
z|dk �rV|
|_tjS d}
~
X nX dS )zs
SecureTransport read callback. This is called by ST to request that data
be returned from the socket.
Nr z timed out)�_connection_refs�getr �errSSLInternal�socket�
gettimeout�ctypes�c_charZ from_address�
memoryviewr Z
wait_for_read�error�errno�EAGAIN� recv_into�errSSLClosedGraceful�
ECONNRESET�errSSLClosedAbort�errSSLWouldBlock� Exception�
_exception)�
connection_id� data_buffer�data_length_pointer�wrapped_socket� base_socketZrequested_length�timeoutr) Z
read_count�bufferZ buffer_viewZ readablesZ
chunk_size�er r r �_read_callback� sN
r; c
C sN d}�yt j| �}|dkr tjS |j}|d }tj||�}|j� }d}d} y`xZ| |k r�|dksf|dkr�tj |g|�}
|
s�tj
t j d��|j
|�} | | 7 } || d� }qNW W nN tj
k
r� } z0| j }|dk r�|t j kr�|t jkr�tjS � W Y dd} ~ X nX | |d< | |k�rtjS dS tk
�rH } z|dk �r8| |_tjS d} ~ X nX dS )zx
SecureTransport write callback. This is called by ST to request that data
actually be sent on the network.
Nr z timed out)r! r" r r# r$ r& � string_atr% r Zwait_for_writer) r* r+ �sendr. r/ r0 r1 r2 )
r3 r4 r5 r6 r7 Zbytes_to_write�datar8 r) �sentZ writablesZ
chunk_sentr: r r r �_write_callback� sD
r@ c @ s� e Zd ZdZdd� Zejdd� �Zdd� Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
d(dd�Zdd� Zdd� Zdd� Zdd � Zd d � Zd d � Zd)d"d#�Zd$d%� Zd&d'� ZdS )*�
WrappedSocketz�
API-compatibility wrapper for Python's OpenSSL wrapped socket object.
Note: _makefile_refs, _drop(), and _reuse() are needed for the garbage
collector of PyPy.
c C sL || _ d | _d| _d| _d | _d | _d | _d | _| j j� | _ | j j
d� d S )Nr F) r$ �context�_makefile_refs�_closedr2 � _keychain�
_keychain_dir�_client_cert_chainr% �_timeout�
settimeout)�selfr$ r r r �__init__. s zWrappedSocket.__init__c c s4 d| _ dV | j dk r0| j d }| _ | j� |�dS )a]
A context manager that can be used to wrap calls that do I/O from
SecureTransport. If any of the I/O callbacks hit an exception, this
context manager will correctly propagate the exception after the fact.
This avoids silently swallowing those exceptions.
It also correctly forces the socket closed.
N)r2 �close)rJ Z exceptionr r r �_raise_on_error@ s
z WrappedSocket._raise_on_errorc C s2 t jtt� t� }t j| j|tt��}t|� dS )a4
Sets up the allowed ciphers. By default this matches the set in
util.ssl_.DEFAULT_CIPHERS, at least as supported by macOS. This is done
custom and doesn't allow changing at this time, mostly because parsing
OpenSSL cipher strings is going to be a freaking nightmare.
N)r ZSSLCipherSuite�len�
CIPHER_SUITESZSSLSetEnabledCiphersrB r )rJ �ciphers�resultr r r � _set_ciphersU s zWrappedSocket._set_ciphersc C s |sdS t jj|�r2t|d��}|j� }W dQ R X d}tj� }z�t|�}tj| j t
j |��}t |� |srt
jd��tj||�}t |� tj|d�}t |� tj� }tj|t
j |��}t |� W d|r�tj|� |dkr�tj|� X tjtjf}|j|k�r
t
jd|j ��dS )z�
Called when we have set custom validation. We do this in two cases:
first, when cert validation is entirely disabled; and second, when
using a custom trust DB.
N�rbz Failed to copy trust referenceTz)certificate verify failed, error code: %d)�os�path�isfile�open�readr � SecTrustRefr
�SSLCopyPeerTrustrB r& �byrefr �sslZSSLErrorZ SecTrustSetAnchorCertificatesZ!SecTrustSetAnchorCertificatesOnlyZSecTrustResultTypeZSecTrustEvaluater � CFReleaser ZkSecTrustResultUnspecifiedZkSecTrustResultProceed�value) rJ �verify� trust_bundle�fZ
cert_array�trustrQ Z trust_resultZ successesr r r �_custom_validateb s@
z WrappedSocket._custom_validatec C s� t jdtjtj�| _t j| jtt�} t | � t
�4 t | �d }
x|
t krV|
d d }
q@W | t |
< W dQ R X t j
| j|
�} t | � |r�t|t�s�|jd�}t j| j|t|��} t | � | j� t j| j|�} t | � t j| j|�} t | � | s�|dk �rt j| jtjd�} t | � |�rNt� \| _| _t| j||�| _ t j | j| j �} t | � xf| j � �R t j | j�} | tj k�r~t!j"d��n(| tj#k�r�| j$||� �wPn
t | � P W dQ R X �qPW dS )z�
Actually performs the TLS handshake. This is run automatically by
wrapped socket, and shouldn't be needed in user code.
Ni���r zutf-8Tzhandshake timed out)%r ZSSLCreateContextr ZkSSLClientSideZkSSLStreamTyperB Z
SSLSetIOFuncs�_read_callback_pointer�_write_callback_pointerr �_connection_ref_lock�idr! ZSSLSetConnection�
isinstance�bytes�encodeZSSLSetPeerDomainNamerN rR ZSSLSetProtocolVersionMinZSSLSetProtocolVersionMaxZSSLSetSessionOptionZ"kSSLSessionOptionBreakOnServerAuthr rE rF r rG ZSSLSetCertificaterM Z SSLHandshaker0 r$ r8 ZerrSSLServerAuthCompletedrc ) rJ �server_hostnamer_ r` Z min_versionZ max_versionZ client_certZ
client_keyZclient_key_passphraserQ Zhandler r r � handshake� s\
zWrappedSocket.handshakec C s
| j j� S )N)r$ �fileno)rJ r r r rm � s zWrappedSocket.filenoc C s* | j dkr| j d8 _ | jr&| j� d S )Nr r )rC rD rL )rJ r r r �_decref_socketios� s
z WrappedSocket._decref_socketiosc C s& t j|�}| j||�}|d |� }|S )N)r& Zcreate_string_bufferr, )rJ Zbufsizr9 Z
bytes_readr> r r r �recv s
zWrappedSocket.recvNc
C s� | j r
dS |d krt|�}tj| j|�}tjd�}| j� � tj| j ||tj
|��}W d Q R X |t j kr�|j
dkr�tjd��n"|t jt jfkr�| j� nt|� |j
S )Nr zrecv timed out)rD rN r& r' Z from_buffer�c_size_trM r ZSSLReadrB r[ r r0 r^ r$ r8 r- ZerrSSLClosedNoNotifyrL r )rJ r9 �nbytes�processed_bytesrQ r r r r,
s
zWrappedSocket.recv_intoc C s
|| _ d S )N)rH )rJ r8 r r r rI 2 s zWrappedSocket.settimeoutc C s | j S )N)rH )rJ r r r r% 5 s zWrappedSocket.gettimeoutc
C sh t jd�}| j� �" tj| j|t|�t j|��}W d Q R X |tj krZ|j
dkrZt j d��nt
|� |j
S )Nr zsend timed out)r& rp rM r ZSSLWriterB rN r[ r r0 r^ r$ r8 r )rJ r> rr rQ r r r r= 8 s
" zWrappedSocket.sendc C s8 d}x.|t |�k r2| j|||t � �}||7 }qW d S )Nr )rN r= �SSL_WRITE_BLOCKSIZE)rJ r> Z
total_sentr? r r r �sendallI s zWrappedSocket.sendallc C s$ | j � � tj| j� W d Q R X d S )N)rM r ZSSLCloserB )rJ r r r �shutdownO s
zWrappedSocket.shutdownc C s� | j dk r�d| _| jr(tj| j� d | _| jr@tj| j� d | _| jrvtj| j� tj| j� t j
| j � d | _| _ | j j
� S | j d8 _ d S )Nr T)rC rD rB r r] rG rE r ZSecKeychainDelete�shutilZrmtreerF r$ rL )rJ r r r rL S s
zWrappedSocket.closeFc
C s� |s t d��tj� }d }d }z�tj| jtj|��}t|� |sBd S tj|�}|sTd S tj |d�}|sht
�tj |�}|szt
�t j
|�}t j|�} tj| |�}W d |r�t j|� |r�t j|� X |S )Nz2SecureTransport only supports dumping binary certsr )�
ValueErrorr rY rZ rB r& r[ r ZSecTrustGetCertificateCountZ SecTrustGetCertificateAtIndex�AssertionErrorZSecCertificateCopyDatar ZCFDataGetLengthZCFDataGetBytePtrr< r] )
rJ Z binary_formrb ZcertdataZ der_bytesrQ Z
cert_countZleafZ data_lengthr4 r r r � getpeercertf s6
zWrappedSocket.getpeercertc C s | j d7 _ d S )Nr )rC )rJ r r r �_reuse� s zWrappedSocket._reusec C s& | j dk r| j� n| j d8 _ d S )Nr )rC rL )rJ r r r �_drop� s
zWrappedSocket._drop)N)F)�__name__�
__module__� __qualname__�__doc__rK �
contextlib�contextmanagerrM rR rc rl rm rn ro r, rI r% r= rt ru rL ry rz r{ r r r r rA ' s&
>Z
(
>rA c C s | j d7 _ t| ||dd�S )Nr T)rL )rC r
)rJ �mode�bufsizer r r �makefile� s r� �rc O s d}t | ||f|�|�S )Nr )r )rJ r� � buffering�args�kwargsr r r r� � s c @ s� e Zd ZdZdd� Zedd� �Zejdd� �Zedd� �Zejd d� �Zed
d � �Z e jd d � �Z d
d� Z
dd� Z dd� Z d dd�Z
d dd�Zd dd�ZdS ) r z�
I am a wrapper class for the SecureTransport library, to translate the
interface of the standard library ``SSLContext`` object to calls into
SecureTransport.
c C s8 t | \| _| _d| _d| _d | _d | _d | _d | _d S )Nr F) �_protocol_to_min_max� _min_version� _max_version�_options�_verify�
_trust_bundle� _client_cert� _client_key�_client_key_passphrase)rJ Zprotocolr r r rK � s z SecureTransportContext.__init__c C s dS )z�
SecureTransport cannot have its hostname checking disabled. For more,
see the comment on getpeercert() in this file.
Tr )rJ r r r �check_hostname� s z%SecureTransportContext.check_hostnamec C s dS )z�
SecureTransport cannot have its hostname checking disabled. For more,
see the comment on getpeercert() in this file.
Nr )rJ r^ r r r r� � s c C s | j S )N)r� )rJ r r r �options� s z SecureTransportContext.optionsc C s
|| _ d S )N)r� )rJ r^ r r r r� � s c C s | j r tjS tjS )N)r� r\ �
CERT_REQUIREDZ CERT_NONE)rJ r r r � verify_mode� s z"SecureTransportContext.verify_modec C s |t jkrdnd| _d S )NTF)r\ r� r� )rJ r^ r r r r� � s c C s d S )Nr )rJ r r r �set_default_verify_paths� s
z/SecureTransportContext.set_default_verify_pathsc C s | j � S )N)r� )rJ r r r �load_default_certs� s z)SecureTransportContext.load_default_certsc C s |t jjkrtd��d S )Nz5SecureTransport doesn't support custom cipher strings)r r ZDEFAULT_CIPHERSrw )rJ rP r r r � set_ciphers s z"SecureTransportContext.set_ciphersNc C s |d k rt d��|p|| _d S )Nz1SecureTransport does not support cert directories)rw r� )rJ ZcafileZcapathZcadatar r r �load_verify_locations s z,SecureTransportContext.load_verify_locationsc C s || _ || _|| _d S )N)r� r� Z_client_cert_passphrase)rJ ZcertfileZkeyfileZpasswordr r r �load_cert_chain s z&SecureTransportContext.load_cert_chainFTc C sL | s
t �|st �|st �t|�}|j|| j| j| j| j| j| j| j � |S )N)
rx rA rl r� r� r� r� r� r� r� )rJ ZsockZ server_sideZdo_handshake_on_connectZsuppress_ragged_eofsrk r6 r r r � wrap_socket s
z"SecureTransportContext.wrap_socket)NNN)NN)FTTN)r| r} r~ r rK �propertyr� �setterr� r� r� r� r� r� r� r� r r r r r � s
r ���)r� )r� N)er Z
__future__r r� r& r* Zos.pathrT rv r$ r\ Z threading�weakref� r Z_securetransport.bindingsr r r Z_securetransport.low_levelr r
r r r
� ImportErrorZpackages.backports.makefiler r( � NameError�__all__r r r r r �WeakValueDictionaryr! ZLockrf rs ZTLS_AES_256_GCM_SHA384Z TLS_CHACHA20_POLY1305_SHA256ZTLS_AES_128_GCM_SHA256Z'TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384Z'TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256Z#TLS_DHE_DSS_WITH_AES_256_GCM_SHA384Z#TLS_DHE_RSA_WITH_AES_256_GCM_SHA384Z#TLS_DHE_DSS_WITH_AES_128_GCM_SHA256Z#TLS_DHE_RSA_WITH_AES_128_GCM_SHA256Z'TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384Z$TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_256_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_256_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_256_CBC_SHAZ TLS_DHE_DSS_WITH_AES_256_CBC_SHAZ'TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256Z$TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_128_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_128_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_128_CBC_SHAZ TLS_DHE_DSS_WITH_AES_128_CBC_SHAZ TLS_RSA_WITH_AES_256_GCM_SHA384Z TLS_RSA_WITH_AES_128_GCM_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHA256Z TLS_RSA_WITH_AES_128_CBC_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHAZ TLS_RSA_WITH_AES_128_CBC_SHArO ZPROTOCOL_SSLv23Z
kTLSProtocol1ZkTLSProtocol12r� �hasattrZ
kSSLProtocol2r Z
kSSLProtocol3r r ZkTLSProtocol11r r r r r r; r@ Z SSLReadFuncrd Z SSLWriteFuncre �objectrA r� r r r r r �<module> s� 95
pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.opt-1.pyc 0000644 00000021027 14751155150 0021555 0 ustar 00 3
���eq* � @ s d Z ddlmZ ddlZddlZddlZddlmZ ddlm Z m
Z
m Z m Z m
Z
mZ ddlmZ ddlmZ dd lmZ dd
lmZ dd lmZ ydd lmZ W n ek
r� dZY nX ej e �Z G d
d� de
�Z G dd� de �Z G dd� de�Z!dd� Z"dd� Z#dd� Z$dd� Z%dd � Z&dS ) aC
This module provides a pool manager that uses Google App Engine's
`URLFetch Service <https://cloud.google.com/appengine/docs/python/urlfetch>`_.
Example usage::
from urllib3 import PoolManager
from urllib3.contrib.appengine import AppEngineManager, is_appengine_sandbox
if is_appengine_sandbox():
# AppEngineManager uses AppEngine's URLFetch API behind the scenes
http = AppEngineManager()
else:
# PoolManager uses a socket-level API behind the scenes
http = PoolManager()
r = http.request('GET', 'https://google.com/')
There are `limitations <https://cloud.google.com/appengine/docs/python/urlfetch/#Python_Quotas_and_limits>`_ to the URLFetch service and it may not be
the best choice for your application. There are three options for using
urllib3 on Google App Engine:
1. You can use :class:`AppEngineManager` with URLFetch. URLFetch is
cost-effective in many circumstances as long as your usage is within the
limitations.
2. You can use a normal :class:`~urllib3.PoolManager` by enabling sockets.
Sockets also have `limitations and restrictions
<https://cloud.google.com/appengine/docs/python/sockets/ #limitations-and-restrictions>`_ and have a lower free quota than URLFetch.
To use sockets, be sure to specify the following in your ``app.yaml``::
env_variables:
GAE_USE_SOCKETS_HTTPLIB : 'true'
3. If you are using `App Engine Flexible
<https://cloud.google.com/appengine/docs/flexible/>`_, you can use the standard
:class:`PoolManager` without any configuration or special environment variables.
� )�absolute_importN� )�urljoin)� HTTPError� HTTPWarning�
MaxRetryError�
ProtocolError� TimeoutError�SSLError)�BytesIO)�RequestMethods)� HTTPResponse)�Timeout)�Retry)�urlfetchc @ s e Zd ZdS )�AppEnginePlatformWarningN)�__name__�
__module__� __qualname__� r r � /usr/lib/python3.6/appengine.pyr G s r c @ s e Zd ZdS )�AppEnginePlatformErrorN)r r r r r r r r K s r c @ sX e Zd ZdZddd�Zdd� Zdd � Zddddejfd
d �Z d d
� Z
dd� Z dd� Z dS )�AppEngineManagera
Connection manager for Google App Engine sandbox applications.
This manager uses the URLFetch service directly instead of using the
emulated httplib, and is subject to URLFetch limitations as described in
the App Engine documentation `here
<https://cloud.google.com/appengine/docs/python/urlfetch>`_.
Notably it will raise an :class:`AppEnginePlatformError` if:
* URLFetch is not available.
* If you attempt to use this on App Engine Flexible, as full socket
support is available.
* If a request size is more than 10 megabytes.
* If a response size is more than 32 megabtyes.
* If you use an unsupported request method such as OPTIONS.
Beyond those cases, it will raise normal urllib3 errors.
NTc C sN t s td��t� rtd��tjdt� tj| |� || _|| _ |pFt
j | _ d S )Nz.URLFetch is not available in this environment.z�Use normal urllib3.PoolManager instead of AppEngineManageron Managed VMs, as using URLFetch is not necessary in this environment.z�urllib3 is using URLFetch on Google App Engine sandbox instead of sockets. To use sockets directly instead of URLFetch see https://urllib3.readthedocs.io/en/latest/reference/urllib3.contrib.html.)
r r �is_prod_appengine_mvms�warnings�warnr r �__init__�validate_certificate�urlfetch_retriesr ZDEFAULT�retries)�self�headersr r r r r r r c s zAppEngineManager.__init__c C s | S )Nr )r r r r � __enter__{ s zAppEngineManager.__enter__c C s dS )NFr )r �exc_typeZexc_valZexc_tbr r r �__exit__~ s zAppEngineManager.__exit__c K s� | j ||�}yF|o |jdko |j} tj||||p2i d| jo<| | j|�| jd�}
W �nB tjk
r� } zt | | ��W Y d d } ~ X �n tj
k
r� } z$dt | �kr�t d| ��t
| ��W Y d d } ~ X n� tjk
�r } z(dt | �kr�t| || d��t
| ��W Y d d } ~ X n� tjk
�r6 } zt d| ��W Y d d } ~ X n` tjk
�rb } zt| ��W Y d d } ~ X n4 tjk
�r� } zt d | | ��W Y d d } ~ X nX | j|
fd
|i|��} |�o�| j� }
|
�rr| j�r�|j�r�t| |d ��n�| jd k�r�d
}y|j||| | d�}W n* tk
�r. |j�r*t| |d ��| S X |j| � tjd||
� t ||
�}| j ||||f|||d�|��S t | j d��}|j || j|��r�|j||| | d�}tjd|� |j!| � | j ||f|||||d�|��S | S )Nr F)Zpayload�methodr! Zallow_truncated�follow_redirectsZdeadliner z too largezOURLFetch request too large, URLFetch only supports requests up to 10mb in size.zToo many redirects)�reasonzPURLFetch response too large, URLFetch only supportsresponses up to 32mb in size.z$URLFetch does not support method: %sr ztoo many redirectsi/ ZGET)�responseZ_poolzRedirecting %s -> %s)r �redirect�timeoutz Retry-Afterz Retry: %s)�bodyr! r r) r* )"� _get_retriesr) �totalr Zfetchr �_get_absolute_timeoutr ZDeadlineExceededErrorr ZInvalidURLError�strr r Z
DownloadErrorr ZResponseTooLargeErrorZSSLCertificateErrorr
ZInvalidMethodError�#_urlfetch_response_to_http_responseZget_redirect_locationZraise_on_redirect�statusZ incrementZsleep_for_retry�log�debugr �urlopen�boolZ getheaderZis_retryZsleep)r r% Zurlr+ r! r r) r* � response_kwr& r( �eZ
http_responseZredirect_locationZ redirect_urlZhas_retry_afterr r r r4 � s�
zAppEngineManager.urlopenc K sz t � r"|jjd�}|dkr"|jd= |jjd�}|dkrZ|jd�}|jd� dj|�|jd< tf t|j�|j|j d�|��S )Nzcontent-encodingZdeflateztransfer-encodingZchunked�,)r+ r! r1 )
�is_prod_appenginer! �get�split�remove�joinr
r ZcontentZ status_code)r Z
urlfetch_respr6 Zcontent_encodingZtransfer_encodingZ encodingsr r r r0 � s
z4AppEngineManager._urlfetch_response_to_http_responsec C sB |t jkrd S t|t �r>|jd k s,|jd k r8tjdt� |jS |S )NzdURLFetch does not support granular timeout settings, reverting to total or default URLFetch timeout.) r �DEFAULT_TIMEOUT�
isinstanceZ_readZ_connectr r r r- )r r* r r r r. � s
z&AppEngineManager._get_absolute_timeoutc C s> t |t�s tj||| jd�}|js.|js.|jr:tjdt � |S )N)r) �defaultzhURLFetch only supports total retries and does not recognize connect, read, or redirect retry parameters.)
r? r Zfrom_intr Zconnect�readr) r r r )r r r) r r r r, s
z AppEngineManager._get_retries)NNTT)
r r r �__doc__r r" r$ r r> r4 r0 r. r, r r r r r O s
Z r c C s t � pt� pt� S )N)�is_local_appenginer9 r r r r r � is_appengine s rD c C s t � o t� S )N)rD r r r r r �is_appengine_sandbox s rE c C s dt jkodt jd kS )N�APPENGINE_RUNTIMEz Development/�SERVER_SOFTWARE)�os�environr r r r rC s
rC c C s dt jko dt jd ko t� S )NrF zGoogle App Engine/rG )rH rI r r r r r r9 ! s
r9 c C s t jjdd�dkS )NZGAE_VMF�true)rH rI r: r r r r r ' s r )'rB Z
__future__r ZloggingrH r Z packages.six.moves.urllib.parser �
exceptionsr r r r r r
Z packages.sixr Zrequestr r( r
Z util.timeoutr Z
util.retryr Zgoogle.appengine.apir � ImportErrorZ getLoggerr r2 r r r rD rE rC r9 r r r r r �<module>' s2
D pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.opt-1.pyc 0000644 00000006131 14751155150 0021452 0 ustar 00 3
���e~ � @ s\ d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlm Z ee
�Z G dd � d e�Z d
S ) z
NTLM authenticating pool, contributed by erikcederstran
Issue #10, see: http://code.google.com/p/urllib3/issues/detail?id=10
� )�absolute_import)� getLogger)�ntlm� )�HTTPSConnectionPool)�HTTPSConnectionc s: e Zd ZdZdZ� fdd�Zdd� Zd � fd
d � Z� ZS )
�NTLMConnectionPoolzQ
Implements an NTLM authentication version of an urllib3 connection pool
Zhttpsc sL t t| �j||� || _|| _|jdd�}|d j� | _|d | _|| _ dS )z�
authurl is a random URL on the server that is protected by NTLM.
user is the Windows user, probably in the DOMAIN\username format.
pw is the password for the user.
�\� r N)
�superr �__init__�authurl�rawuser�split�upper�domain�user�pw)�selfr r r
�args�kwargsZ
user_parts)� __class__� � /usr/lib/python3.6/ntlmpool.pyr s
zNTLMConnectionPool.__init__c
C s� | j d7 _ tjd| j | j| j� i }d|d< d}d}t| j| jd�}dtj| j � ||< tjd |� |j
d
| jd |� |j � }t |j
� �}tjd |j|j� tjd |� tjd
|jd�� d |_|| jd�}d }x(|D ] } | d d� dkr�| dd � }q�W |d k�r td||| f ��tj|�\}
} tj|
| j| j| j| �} d| ||< tjd |� |j
d
| jd |� |j � }tjd |j|j� tjd t |j
� �� tjd
|j� d d� � |jdk�r�|jdk�r�td��td|j|jf ��d |_tjd� |S )Nr
z3Starting NTLM HTTPS connection no. %d: https://%s%sz
Keep-Alive�
ConnectionZ
Authorizationzwww-authenticate)�host�portzNTLM %szRequest headers: %sZGETzResponse status: %s %szResponse headers: %szResponse data: %s [...]�d z, � zNTLM z!Unexpected %s response header: %s�� i� z3Server rejected request: wrong username or passwordz Wrong server response: %s %szConnection established)Znum_connections�log�debugr r
r r r Z create_NTLM_NEGOTIATE_MESSAGEr ZrequestZ getresponse�dictZ
getheadersZstatus�reason�read�fpr � ExceptionZ parse_NTLM_CHALLENGE_MESSAGEZ create_NTLM_AUTHENTICATE_MESSAGEr r r )
r �headersZ
req_headerZ resp_headerZconn�resZreshdrZauth_header_valuesZauth_header_value�sZServerChallengeZNegotiateFlagsZauth_msgr r r � _new_conn' s\
z NTLMConnectionPool._new_connN� Tc s0 |d kr i }d|d< t t| �j|||||||�S )Nz
Keep-Aliver )r r �urlopen)r �methodZurlZbodyr' ZretriesZredirectZassert_same_host)r r r r, h s zNTLMConnectionPool.urlopen)NNr+ TT) �__name__�
__module__� __qualname__�__doc__�schemer r* r, �
__classcell__r r )r r r s A r N)
r1 Z
__future__r Zloggingr r � r Z packages.six.moves.http_clientr r. r r r r r r �<module> s pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.opt-1.pyc 0000644 00000033337 14751155150 0021652 0 ustar 00 3
���e�; � @ s, d Z ddlmZ ddlZddlmZ ddlmZ ddl
m Z ddl m
Z
mZ ddlmZ ydd l mZ W n$ ek
r� dZd
d lmZ Y nX ddlZddlZd
d lmZ ddlZd
d
lm Z ddgZ dZ ej ej j!ej"ej j#iZ$e%ed�o�e%ej d��rej j&e$ej'< e%ed��r0e%ej d��r0ej j(e$ej)< ye$j*ej+ej j,i� W n e-k
�r^ Y nX ej.ej j/ej0ej j1ej2ej j1ej j3 iZ4e5dd� e4j6� D ��Z7dZ8e j Z9e j:j;Z<ej=e>�Z?dd� Z@dd� ZAdd� ZBd d � ZCd d � ZDG d d!� d!eE�ZFe�rd*d#d$�ZGneZGeGeF_GG d%d&� d&eE�ZHd'd(� ZIdS )+ab
SSL with SNI_-support for Python 2. Follow these instructions if you would
like to verify SSL certificates in Python 2. Note, the default libraries do
*not* do certificate checking; you need to do additional work to validate
certificates yourself.
This needs the following packages installed:
* pyOpenSSL (tested with 16.0.0)
* cryptography (minimum 1.3.4, from pyopenssl)
* idna (minimum 2.0, from cryptography)
However, pyopenssl depends on cryptography, which depends on idna, so while we
use all three directly here we end up having relatively few packages required.
You can install them with the following command:
pip install pyopenssl cryptography idna
To activate certificate checking, call
:func:`~urllib3.contrib.pyopenssl.inject_into_urllib3` from your Python code
before you begin making HTTP requests. This can be done in a ``sitecustomize``
module, or at any other time before your application begins using ``urllib3``,
like this::
try:
import urllib3.contrib.pyopenssl
urllib3.contrib.pyopenssl.inject_into_urllib3()
except ImportError:
pass
Now you can use :mod:`urllib3` as you normally would, and it will support SNI
when the required modules are installed.
Activating this module also has the positive side effect of disabling SSL/TLS
compression in Python 2 (see `CRIME attack`_).
If you want to configure the default list of supported cipher suites, you can
set the ``urllib3.contrib.pyopenssl.DEFAULT_SSL_CIPHER_LIST`` variable.
.. _sni: https://en.wikipedia.org/wiki/Server_Name_Indication
.. _crime attack: https://en.wikipedia.org/wiki/CRIME_(security_exploit)
� )�absolute_importN)�x509)�backend)� _Certificate)�timeout�error)�BytesIO)� _fileobject� )�backport_makefile)�six)�util�inject_into_urllib3�extract_from_urllib3T�PROTOCOL_TLSv1_1�TLSv1_1_METHOD�PROTOCOL_TLSv1_2�TLSv1_2_METHODc c s | ]\}}||fV qd S )N� )�.0�k�vr r � /usr/lib/python3.6/pyopenssl.py� <genexpr>` s r i @ c C s. t � ttj_tt_ttj_dt_dtj_dS )z7Monkey-patch urllib3 with PyOpenSSL-backed SSL-support.TN)�_validate_dependencies_met�PyOpenSSLContextr
�ssl_�
SSLContext�HAS_SNI� IS_PYOPENSSLr r r r r m s c C s( t tj_tt_ttj_dt_dtj_dS )z4Undo monkey-patching by :func:`inject_into_urllib3`.FN)�orig_util_SSLContextr
r r �orig_util_HAS_SNIr r r r r r r y s
c C sR ddl m} t| dd�dkr$td��ddlm} |� }t|dd�dkrNtd��dS ) z{
Verifies that PyOpenSSL's package-level dependencies have been met.
Throws `ImportError` if they are not met.
r )�
Extensions�get_extension_for_classNzX'cryptography' module missing required functionality. Try upgrading to v1.3.4 or newer.)�X509�_x509zS'pyOpenSSL' module missing required functionality. Try upgrading to v0.14 or newer.)Z cryptography.x509.extensionsr" �getattr� ImportErrorZOpenSSL.cryptor$ )r" r$ r r r r r � s r c C s( dd� }|| �} t jdkr$| jd�} | S )a�
Converts a dNSName SubjectAlternativeName field to the form used by the
standard library on the given Python version.
Cryptography produces a dNSName as a unicode string that was idna-decoded
from ASCII bytes. We need to idna-encode that string to get it back, and
then on Python 3 we also need to convert to unicode via UTF-8 (the stdlib
uses PyUnicode_FromStringAndSize on it, which decodes via UTF-8).
c S sN ddl }x:dD ]2}| j|�r| t|�d� } |jd�|j| � S qW |j| �S )z�
Borrowed wholesale from the Python Cryptography Project. It turns out
that we can't just safely call `idna.encode`: it can explode for
wildcard names. This avoids that problem.
r N�*.�.�ascii)r( r) )�idna�
startswith�len�encode)�namer+ �prefixr r r � idna_encode� s
z'_dnsname_to_stdlib.<locals>.idna_encode� r zutf-8)r2 r )�sys� version_info�decode)r/ r1 r r r �_dnsname_to_stdlib� s
r6 c C s� t | d�r| j� }n tt| j�}y|jjtj�j }W nN tj
k
rJ g S tj tj tj
tfk
r� } ztjd|� g S d}~X nX dd� |jtj�D �}|jdd� |jtj�D �� |S )zU
Given an PyOpenSSL certificate, provides all the subject alternative names.
�to_cryptographyz�A problem was encountered with the certificate that prevented urllib3 from finding the SubjectAlternativeName field. This can affect certificate validation. The error was %sNc S s g | ]}d t |�f�qS )ZDNS)r6 )r r/ r r r �
<listcomp>� s z%get_subj_alt_name.<locals>.<listcomp>c s s | ]}d t |�fV qdS )z
IP AddressN)�str)r r/ r r r r � s z$get_subj_alt_name.<locals>.<genexpr>)�hasattrr7 r �openssl_backendr% �
extensionsr# r ZSubjectAlternativeName�valueZExtensionNotFoundZDuplicateExtensionZUnsupportedExtensionZUnsupportedGeneralNameType� UnicodeError�logZwarningZget_values_for_typeZDNSName�extendZ IPAddress)Z peer_certZcertZext�e�namesr r r �get_subj_alt_name� s(
rC c @ s| e Zd ZdZd dd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
d dd�Zdd� Zd d � Zd S )!�
WrappedSocketz�API-compatibility wrapper for Python OpenSSL's Connection-class.
Note: _makefile_refs, _drop() and _reuse() are needed for the garbage
collector of pypy.
Tc C s" || _ || _|| _d| _d| _d S )Nr F)�
connection�socket�suppress_ragged_eofs�_makefile_refs�_closed)�selfrE rF rG r r r �__init__� s
zWrappedSocket.__init__c C s
| j j� S )N)rF �fileno)rJ r r r rL � s zWrappedSocket.filenoc C s* | j dkr| j d8 _ | jr&| j� d S )Nr � )rH rI �close)rJ r r r �_decref_socketios� s
z WrappedSocket._decref_socketiosc O s� y| j j||�}W n� tjjk
rX } z&| jr<|jdkr<dS tt|���W Y d d }~X n� tjj k
r� } z | j j
� tjj kr�dS � W Y d d }~X nJ tjj k
r� t
j| j| jj� �}|s�td��n | j||�S Y nX |S d S )NrM �Unexpected EOF� z The read operation timed out���)rR rP )rE �recv�OpenSSL�SSL� SysCallErrorrG �args� SocketErrorr9 �ZeroReturnError� get_shutdown�RECEIVED_SHUTDOWN�
WantReadErrorr
�
wait_for_readrF �
gettimeoutr )rJ rW �kwargs�datarA �rdr r r rS s
zWrappedSocket.recvc O s� y| j j||�S tjjk
rT } z&| jr8|jdkr8dS tt|���W Y d d }~X n� tjj k
r� } z | j j
� tjj kr~dS � W Y d d }~X nF tjj k
r� t
j| j| jj� �}|s�td��n | j||�S Y nX d S )NrM �Unexpected EOFr z The read operation timed outrR )rR rb )rE � recv_intorT rU rV rG rW rX r9 rY rZ r[ r\ r
r] rF r^ r )rJ rW r_ rA ra r r r rc s
zWrappedSocket.recv_intoc C s | j j|�S )N)rF �
settimeout)rJ r r r r rd * s zWrappedSocket.settimeoutc C s� xzy | j j|�S tjjk
rF tj| j| jj� �}|s@t � �wY q tjj
k
rv } zt t |���W Y d d }~X qX qW d S )N)
rE �sendrT rU ZWantWriteErrorr
Zwait_for_writerF r^ r rV rX r9 )rJ r` �wrrA r r r �_send_until_done- s z WrappedSocket._send_until_donec C s8 d}x.|t |�k r2| j|||t � �}||7 }qW d S )Nr )r- rg �SSL_WRITE_BLOCKSIZE)rJ r` Z
total_sentZsentr r r �sendall9 s zWrappedSocket.sendallc C s | j j� d S )N)rE �shutdown)rJ r r r rj ? s zWrappedSocket.shutdownc C sH | j dk r6yd| _| jj� S tjjk
r2 d S X n| j d8 _ d S )NrM T)rH rI rE rN rT rU �Error)rJ r r r rN C s
zWrappedSocket.closeFc C sD | j j� }|s|S |r(tjjtjj|�S d|j� jffft|�d�S )NZ
commonName)ZsubjectZsubjectAltName) rE Zget_peer_certificaterT ZcryptoZdump_certificateZ
FILETYPE_ASN1Z get_subjectZCNrC )rJ Z binary_formr r r r � getpeercertM s
zWrappedSocket.getpeercertc C s | j d7 _ d S )NrM )rH )rJ r r r �_reuse_ s zWrappedSocket._reusec C s& | j dk r| j� n| j d8 _ d S )NrM )rH rN )rJ r r r �_dropb s
zWrappedSocket._dropN)T)F)�__name__�
__module__� __qualname__�__doc__rK rL rO rS rc rd rg ri rj rN rl rm rn r r r r rD � s
rD rM c C s | j d7 _ t| ||dd�S )NrM T)rN )rH r )rJ �mode�bufsizer r r �makefilej s ru c @ sz e Zd ZdZdd� Zedd� �Zejdd� �Zedd� �Zejd d� �Zd
d � Z d d
� Z
ddd�Z ddd�Z ddd�Z
dS )r z�
I am a wrapper class for the PyOpenSSL ``Context`` object. I am responsible
for translating the interface of the standard library ``SSLContext`` object
to calls into PyOpenSSL.
c C s* t | | _tjj| j�| _d| _d| _d S )Nr F)�_openssl_versions�protocolrT rU ZContext�_ctx�_optionsZcheck_hostname)rJ rw r r r rK y s
zPyOpenSSLContext.__init__c C s | j S )N)ry )rJ r r r �options s zPyOpenSSLContext.optionsc C s || _ | jj|� d S )N)ry rx Z set_options)rJ r= r r r rz � s c C s t | jj� S )N)�_openssl_to_stdlib_verifyrx Zget_verify_mode)rJ r r r � verify_mode� s z PyOpenSSLContext.verify_modec C s | j jt| t� d S )N)rx Z
set_verify�_stdlib_to_openssl_verify�_verify_callback)rJ r= r r r r| � s c C s | j j� d S )N)rx �set_default_verify_paths)rJ r r r r � s z)PyOpenSSLContext.set_default_verify_pathsc C s& t |tj�r|jd�}| jj|� d S )Nzutf-8)�
isinstancer � text_typer. rx Zset_cipher_list)rJ Zciphersr r r � set_ciphers� s
z PyOpenSSLContext.set_ciphersNc C sN |d k r|j d�}|d k r$|j d�}| jj||� |d k rJ| jjt|�� d S )Nzutf-8)r. rx �load_verify_locationsr )rJ ZcafileZcapathZcadatar r r r� � s
z&PyOpenSSLContext.load_verify_locationsc s< | j j|� � d k r(| j j� fdd�� | j j|p4|� d S )Nc s � S )Nr )Z
max_lengthZ prompt_twiceZuserdata)�passwordr r �<lambda>� s z2PyOpenSSLContext.load_cert_chain.<locals>.<lambda>)rx Zuse_certificate_fileZ
set_passwd_cbZuse_privatekey_file)rJ ZcertfileZkeyfiler� r )r� r �load_cert_chain� s z PyOpenSSLContext.load_cert_chainFTc C s� t jj| j|�}t|tj�r&|jd�}|d k r8|j|� |j � x|y |j
� W nh t jj k
r� t j
||j� �}|s~td��wBY n4 t jjk
r� } ztjd| ��W Y d d }~X nX P qBW t||�S )Nzutf-8zselect timed outzbad handshake: %r)rT rU Z
Connectionrx r� r r� r. Zset_tlsext_host_nameZset_connect_stateZ do_handshaker\ r
r] r^ r rk �sslZSSLErrorrD ) rJ ZsockZ server_sideZdo_handshake_on_connectrG Zserver_hostname�cnxra rA r r r � wrap_socket� s$
z PyOpenSSLContext.wrap_socket)NNN)NN)FTTN)ro rp rq rr rK �propertyrz �setterr| r r� r� r� r� r r r r r s s
r c C s |dkS )Nr r )r� r Zerr_noZ err_depthZ return_coder r r r~ � s r~ rR )rR )Jrr Z
__future__r Z OpenSSL.SSLrT Z cryptographyr Z$cryptography.hazmat.backends.opensslr r; Z)cryptography.hazmat.backends.openssl.x509r rF r r rX �ior r r' Zpackages.backports.makefiler Zloggingr� Zpackagesr r3 � r
�__all__r ZPROTOCOL_SSLv23rU Z
SSLv23_METHODZPROTOCOL_TLSv1Z TLSv1_METHODrv r: r r r r �updateZPROTOCOL_SSLv3Z SSLv3_METHOD�AttributeErrorZ CERT_NONEZ VERIFY_NONEZ
CERT_OPTIONALZ VERIFY_PEERZ
CERT_REQUIREDZVERIFY_FAIL_IF_NO_PEER_CERTr} �dict�itemsr{ rh r! r r r Z getLoggerro r? r r r r6 rC �objectrD ru r r~ r r r r �<module>+ sh
3 S pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.opt-1.pyc 0000644 00000011162 14751155150 0020730 0 ustar 00 3
���e3 � @ s( d Z ddlmZ y ddlZW n6 ek
rR ddlZddlmZ ejde� � Y nX ddl m
Z m Z
ddlmZmZ dd lmZmZ dd
lmZmZ dd lmZ dd lmZ y ddlZW n ek
r� dZY nX G d
d� de�ZG dd� dee�Z G dd� de�Z G dd� de�Z G dd� de�Z dS )a�
This module contains provisional support for SOCKS proxies from within
urllib3. This module supports SOCKS4 (specifically the SOCKS4A variant) and
SOCKS5. To enable its functionality, either install PySocks or install this
module with the ``socks`` extra.
The SOCKS implementation supports the full range of urllib3 features. It also
supports the following SOCKS features:
- SOCKS4
- SOCKS4a
- SOCKS5
- Usernames and passwords for the SOCKS proxy
Known Limitations:
- Currently PySocks does not support contacting remote websites via literal
IPv6 addresses. Any such connection attempt will fail. You must use a domain
name.
- Currently PySocks does not support IPv6 connections to the SOCKS proxy. Any
such connection attempt will fail.
� )�absolute_importN� )�DependencyWarningz�SOCKS support in urllib3 requires the installation of optional dependencies: specifically, PySocks. For more information, see https://urllib3.readthedocs.io/en/latest/contrib.html#socks-proxies)�error�timeout)�HTTPConnection�HTTPSConnection)�HTTPConnectionPool�HTTPSConnectionPool)�ConnectTimeoutError�NewConnectionError)� PoolManager)� parse_urlc s( e Zd ZdZ� fdd�Zdd� Z� ZS )�SOCKSConnectionzG
A plain-text HTTP connection that connects via a SOCKS proxy.
c s" |j d�| _tt| �j||� d S )N�_socks_options)�popr �superr �__init__)�self�args�kwargs)� __class__� �/usr/lib/python3.6/socks.pyr ? s zSOCKSConnection.__init__c C sX i }| j r| j |d< | jr$| j|d< yTtj| j| jff| jd | jd | jd | jd | jd | jd | jd �|��}W n� tk
r� } z t | d
| j| jf ��W Y d d }~X n� tj
k
�r" } zT|j �r|j }t |t�r�t | d
| j| jf ��nt
| d | ��nt
| d | ��W Y d d }~X n2 tk
�rR } zt
| d | ��W Y d d }~X nX |S )
zA
Establish a new connection via the SOCKS proxy.
�source_address�socket_options�
socks_version�
proxy_host�
proxy_port�username�password�rdns)Z
proxy_typeZ
proxy_addrr Zproxy_usernameZproxy_passwordZ
proxy_rdnsr z0Connection to %s timed out. (connect timeout=%s)Nz(Failed to establish a new connection: %s)r r �socksZcreate_connection�host�portr r �
SocketTimeoutr Z
ProxyErrorZ
socket_err�
isinstancer � SocketError)r Zextra_kwZconn�er r r r � _new_connC sL
zSOCKSConnection._new_conn)�__name__�
__module__� __qualname__�__doc__r r) �
__classcell__r r )r r r ; s r c @ s e Zd ZdS )�SOCKSHTTPSConnectionN)r* r+ r, r r r r r/ � s r/ c @ s e Zd ZeZdS )�SOCKSHTTPConnectionPoolN)r* r+ r, r �
ConnectionClsr r r r r0 � s r0 c @ s e Zd ZeZdS )�SOCKSHTTPSConnectionPoolN)r* r+ r, r/ r1 r r r r r2 � s r2 c s, e Zd ZdZeed�Zd� fdd� Z� ZS )�SOCKSProxyManagerzh
A version of the urllib3 ProxyManager that routes connections via the
defined SOCKS proxy.
)ZhttpZhttpsN�
c s� t |�}|jdkr tj}d} nN|jdkr4tj}d} n8|jdkrJtj}d} n"|jdkr`tj}d} n td| ��|| _||j|j||| d�}
|
|d < t t
| �j ||f|� t
j | _ d S )
NZsocks5FZsocks5hTZsocks4Zsocks4az)Unable to determine SOCKS version from %s)r r r r r r! r )
r �schemer" ZPROXY_TYPE_SOCKS5ZPROXY_TYPE_SOCKS4�
ValueError� proxy_urlr# r$ r r3 r �pool_classes_by_scheme) r r7 r r Z num_poolsZheadersZconnection_pool_kwZparsedr r! Z
socks_options)r r r r � s4
zSOCKSProxyManager.__init__)NNr4 N) r* r+ r, r- r0 r2 r8 r r. r r )r r r3 � s
r3 ) r- Z
__future__r r" � ImportError�warnings�
exceptionsr �warnZsocketr r' r r% Z
connectionr r Zconnectionpoolr r
r r Z poolmanagerr
Zutil.urlr Zsslr r/ r0 r2 r3 r r r r �<module> s2
F pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.pyc 0000644 00000011162 14751155150 0017771 0 ustar 00 3
���e3 � @ s( d Z ddlmZ y ddlZW n6 ek
rR ddlZddlmZ ejde� � Y nX ddl m
Z m Z
ddlmZmZ dd lmZmZ dd
lmZmZ dd lmZ dd lmZ y ddlZW n ek
r� dZY nX G d
d� de�ZG dd� dee�Z G dd� de�Z G dd� de�Z G dd� de�Z dS )a�
This module contains provisional support for SOCKS proxies from within
urllib3. This module supports SOCKS4 (specifically the SOCKS4A variant) and
SOCKS5. To enable its functionality, either install PySocks or install this
module with the ``socks`` extra.
The SOCKS implementation supports the full range of urllib3 features. It also
supports the following SOCKS features:
- SOCKS4
- SOCKS4a
- SOCKS5
- Usernames and passwords for the SOCKS proxy
Known Limitations:
- Currently PySocks does not support contacting remote websites via literal
IPv6 addresses. Any such connection attempt will fail. You must use a domain
name.
- Currently PySocks does not support IPv6 connections to the SOCKS proxy. Any
such connection attempt will fail.
� )�absolute_importN� )�DependencyWarningz�SOCKS support in urllib3 requires the installation of optional dependencies: specifically, PySocks. For more information, see https://urllib3.readthedocs.io/en/latest/contrib.html#socks-proxies)�error�timeout)�HTTPConnection�HTTPSConnection)�HTTPConnectionPool�HTTPSConnectionPool)�ConnectTimeoutError�NewConnectionError)� PoolManager)� parse_urlc s( e Zd ZdZ� fdd�Zdd� Z� ZS )�SOCKSConnectionzG
A plain-text HTTP connection that connects via a SOCKS proxy.
c s" |j d�| _tt| �j||� d S )N�_socks_options)�popr �superr �__init__)�self�args�kwargs)� __class__� �/usr/lib/python3.6/socks.pyr ? s zSOCKSConnection.__init__c C sX i }| j r| j |d< | jr$| j|d< yTtj| j| jff| jd | jd | jd | jd | jd | jd | jd �|��}W n� tk
r� } z t | d
| j| jf ��W Y d d }~X n� tj
k
�r" } zT|j �r|j }t |t�r�t | d
| j| jf ��nt
| d | ��nt
| d | ��W Y d d }~X n2 tk
�rR } zt
| d | ��W Y d d }~X nX |S )
zA
Establish a new connection via the SOCKS proxy.
�source_address�socket_options�
socks_version�
proxy_host�
proxy_port�username�password�rdns)Z
proxy_typeZ
proxy_addrr Zproxy_usernameZproxy_passwordZ
proxy_rdnsr z0Connection to %s timed out. (connect timeout=%s)Nz(Failed to establish a new connection: %s)r r �socksZcreate_connection�host�portr r �
SocketTimeoutr Z
ProxyErrorZ
socket_err�
isinstancer � SocketError)r Zextra_kwZconn�er r r r � _new_connC sL
zSOCKSConnection._new_conn)�__name__�
__module__� __qualname__�__doc__r r) �
__classcell__r r )r r r ; s r c @ s e Zd ZdS )�SOCKSHTTPSConnectionN)r* r+ r, r r r r r/ � s r/ c @ s e Zd ZeZdS )�SOCKSHTTPConnectionPoolN)r* r+ r, r �
ConnectionClsr r r r r0 � s r0 c @ s e Zd ZeZdS )�SOCKSHTTPSConnectionPoolN)r* r+ r, r/ r1 r r r r r2 � s r2 c s, e Zd ZdZeed�Zd� fdd� Z� ZS )�SOCKSProxyManagerzh
A version of the urllib3 ProxyManager that routes connections via the
defined SOCKS proxy.
)ZhttpZhttpsN�
c s� t |�}|jdkr tj}d} nN|jdkr4tj}d} n8|jdkrJtj}d} n"|jdkr`tj}d} n td| ��|| _||j|j||| d�}
|
|d < t t
| �j ||f|� t
j | _ d S )
NZsocks5FZsocks5hTZsocks4Zsocks4az)Unable to determine SOCKS version from %s)r r r r r r! r )
r �schemer" ZPROXY_TYPE_SOCKS5ZPROXY_TYPE_SOCKS4�
ValueError� proxy_urlr# r$ r r3 r �pool_classes_by_scheme) r r7 r r Z num_poolsZheadersZconnection_pool_kwZparsedr r! Z
socks_options)r r r r � s4
zSOCKSProxyManager.__init__)NNr4 N) r* r+ r, r- r0 r2 r8 r r. r r )r r r3 � s
r3 ) r- Z
__future__r r" � ImportError�warnings�
exceptionsr �warnZsocketr r' r r% Z
connectionr r Zconnectionpoolr r
r r Z poolmanagerr
Zutil.urlr Zsslr r/ r0 r2 r3 r r r r �<module> s2
F pip/_vendor/urllib3/contrib/socks.py 0000644 00000014063 14751155150 0013510 0 ustar 00 # -*- coding: utf-8 -*-
"""
This module contains provisional support for SOCKS proxies from within
urllib3. This module supports SOCKS4 (specifically the SOCKS4A variant) and
SOCKS5. To enable its functionality, either install PySocks or install this
module with the ``socks`` extra.
The SOCKS implementation supports the full range of urllib3 features. It also
supports the following SOCKS features:
- SOCKS4
- SOCKS4a
- SOCKS5
- Usernames and passwords for the SOCKS proxy
Known Limitations:
- Currently PySocks does not support contacting remote websites via literal
IPv6 addresses. Any such connection attempt will fail. You must use a domain
name.
- Currently PySocks does not support IPv6 connections to the SOCKS proxy. Any
such connection attempt will fail.
"""
from __future__ import absolute_import
try:
import socks
except ImportError:
import warnings
from ..exceptions import DependencyWarning
warnings.warn((
'SOCKS support in urllib3 requires the installation of optional '
'dependencies: specifically, PySocks. For more information, see '
'https://urllib3.readthedocs.io/en/latest/contrib.html#socks-proxies'
),
DependencyWarning
)
raise
from socket import error as SocketError, timeout as SocketTimeout
from ..connection import (
HTTPConnection, HTTPSConnection
)
from ..connectionpool import (
HTTPConnectionPool, HTTPSConnectionPool
)
from ..exceptions import ConnectTimeoutError, NewConnectionError
from ..poolmanager import PoolManager
from ..util.url import parse_url
try:
import ssl
except ImportError:
ssl = None
class SOCKSConnection(HTTPConnection):
"""
A plain-text HTTP connection that connects via a SOCKS proxy.
"""
def __init__(self, *args, **kwargs):
self._socks_options = kwargs.pop('_socks_options')
super(SOCKSConnection, self).__init__(*args, **kwargs)
def _new_conn(self):
"""
Establish a new connection via the SOCKS proxy.
"""
extra_kw = {}
if self.source_address:
extra_kw['source_address'] = self.source_address
if self.socket_options:
extra_kw['socket_options'] = self.socket_options
try:
conn = socks.create_connection(
(self.host, self.port),
proxy_type=self._socks_options['socks_version'],
proxy_addr=self._socks_options['proxy_host'],
proxy_port=self._socks_options['proxy_port'],
proxy_username=self._socks_options['username'],
proxy_password=self._socks_options['password'],
proxy_rdns=self._socks_options['rdns'],
timeout=self.timeout,
**extra_kw
)
except SocketTimeout as e:
raise ConnectTimeoutError(
self, "Connection to %s timed out. (connect timeout=%s)" %
(self.host, self.timeout))
except socks.ProxyError as e:
# This is fragile as hell, but it seems to be the only way to raise
# useful errors here.
if e.socket_err:
error = e.socket_err
if isinstance(error, SocketTimeout):
raise ConnectTimeoutError(
self,
"Connection to %s timed out. (connect timeout=%s)" %
(self.host, self.timeout)
)
else:
raise NewConnectionError(
self,
"Failed to establish a new connection: %s" % error
)
else:
raise NewConnectionError(
self,
"Failed to establish a new connection: %s" % e
)
except SocketError as e: # Defensive: PySocks should catch all these.
raise NewConnectionError(
self, "Failed to establish a new connection: %s" % e)
return conn
# We don't need to duplicate the Verified/Unverified distinction from
# urllib3/connection.py here because the HTTPSConnection will already have been
# correctly set to either the Verified or Unverified form by that module. This
# means the SOCKSHTTPSConnection will automatically be the correct type.
class SOCKSHTTPSConnection(SOCKSConnection, HTTPSConnection):
pass
class SOCKSHTTPConnectionPool(HTTPConnectionPool):
ConnectionCls = SOCKSConnection
class SOCKSHTTPSConnectionPool(HTTPSConnectionPool):
ConnectionCls = SOCKSHTTPSConnection
class SOCKSProxyManager(PoolManager):
"""
A version of the urllib3 ProxyManager that routes connections via the
defined SOCKS proxy.
"""
pool_classes_by_scheme = {
'http': SOCKSHTTPConnectionPool,
'https': SOCKSHTTPSConnectionPool,
}
def __init__(self, proxy_url, username=None, password=None,
num_pools=10, headers=None, **connection_pool_kw):
parsed = parse_url(proxy_url)
if parsed.scheme == 'socks5':
socks_version = socks.PROXY_TYPE_SOCKS5
rdns = False
elif parsed.scheme == 'socks5h':
socks_version = socks.PROXY_TYPE_SOCKS5
rdns = True
elif parsed.scheme == 'socks4':
socks_version = socks.PROXY_TYPE_SOCKS4
rdns = False
elif parsed.scheme == 'socks4a':
socks_version = socks.PROXY_TYPE_SOCKS4
rdns = True
else:
raise ValueError(
"Unable to determine SOCKS version from %s" % proxy_url
)
self.proxy_url = proxy_url
socks_options = {
'socks_version': socks_version,
'proxy_host': parsed.host,
'proxy_port': parsed.port,
'username': username,
'password': password,
'rdns': rdns
}
connection_pool_kw['_socks_options'] = socks_options
super(SOCKSProxyManager, self).__init__(
num_pools, headers, **connection_pool_kw
)
self.pool_classes_by_scheme = SOCKSProxyManager.pool_classes_by_scheme
pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.pyc 0000644 00000016271 14751155150 0024247 0 ustar 00 3
���e / � @ s� d Z ddlZddlZddlZddlZddlZddlZddlZddlm Z m
Z
m Z ej dej
�Zdd� Zdd � Zd
d � Zdd d
�Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� ZdS )a�
Low-level helpers for the SecureTransport bindings.
These are Python functions that are not directly related to the high-level APIs
but are necessary to get them to work. They include a whole bunch of low-level
CoreFoundation messing about and memory management. The concerns in this module
are almost entirely about trying to avoid memory leaks and providing
appropriate and useful assistance to the higher-level code.
� N� )�Security�CoreFoundation�CFConsts; -----BEGIN CERTIFICATE-----
(.*?)
-----END CERTIFICATE-----c C s t jt j| t| ��S )zv
Given a bytestring, create a CFData object from it. This CFData object must
be CFReleased by the caller.
)r � CFDataCreate�kCFAllocatorDefault�len)Z
bytestring� r � /usr/lib/python3.6/low_level.py�_cf_data_from_bytes s r c C sZ t | �}dd� | D �}dd� | D �}tj| |� }tj| |� }tjtj|||tjtj�S )zK
Given a list of Python tuples, create an associated CFDictionary.
c s s | ]}|d V qdS )r Nr )�.0�tr r r
� <genexpr>, s z-_cf_dictionary_from_tuples.<locals>.<genexpr>c s s | ]}|d V qdS )r Nr )r r
r r r
r - s )r r � CFTypeRefZCFDictionaryCreater Z kCFTypeDictionaryKeyCallBacksZ kCFTypeDictionaryValueCallBacks)ZtuplesZdictionary_size�keys�valuesZcf_keysZ cf_valuesr r r
�_cf_dictionary_from_tuples% s r c C sn t j| t jt j��}tj|tj�}|dkrXt jd�}tj ||dtj�}|sRt
d��|j }|dk rj|j d�}|S )z�
Creates a Unicode string from a CFString object. Used entirely for error
reporting.
Yes, it annoys me quite a lot that this function is this complex.
Ni z'Error copying C string from CFStringRefzutf-8)
�ctypes�castZPOINTERZc_void_pr ZCFStringGetCStringPtrr ZkCFStringEncodingUTF8Zcreate_string_bufferZCFStringGetCString�OSError�value�decode)r Zvalue_as_void_p�string�buffer�resultr r r
�_cf_string_to_unicode; s"
r c C s\ | dkr dS t j| d�}t|�}tj|� |dks:|dkrBd| }|dkrPtj}||��dS )z[
Checks the return code and throws an exception if there is an error to
report
r N� z OSStatus %s)r ZSecCopyErrorMessageStringr r � CFRelease�ssl�SSLError)�errorZexception_classZcf_error_string�outputr r r
�_assert_no_errorX s
r" c C s� dd� t j| �D �}|s"tjd��tjtjdtjtj ��}|sHtjd��ydx^|D ]V}t
|�}|sjtjd��t j tj|�}tj
|� |s�tjd��tj||� tj
|� qPW W n tk
r� tj
|� Y nX |S )z�
Given a bundle of certs in PEM format, turns them into a CFArray of certs
that can be used to validate a cert chain.
c S s g | ]}t j|jd ���qS )r )�base64Z b64decode�group)r �matchr r r
�
<listcomp>s s z(_cert_array_from_pem.<locals>.<listcomp>z No root certificates specifiedr zUnable to allocate memory!z Unable to build cert object!)�
_PEM_CERTS_RE�finditerr r r �CFArrayCreateMutabler r �byref�kCFTypeArrayCallBacksr r Z SecCertificateCreateWithDatar �CFArrayAppendValue� Exception)Z
pem_bundleZ der_certsZ
cert_arrayZ der_bytesZcertdataZcertr r r
�_cert_array_from_pemm s2
r. c C s t j� }tj| �|kS )z=
Returns True if a given CFTypeRef is a certificate.
)r ZSecCertificateGetTypeIDr � CFGetTypeID)�item�expectedr r r
�_is_cert� s r2 c C s t j� }tj| �|kS )z;
Returns True if a given CFTypeRef is an identity.
)r ZSecIdentityGetTypeIDr r/ )r0 r1 r r r
� _is_identity� s r3 c C s� t jd�} tj| dd� �jd�}tj| dd� �}tj� }t jj||�j d�}t
j � }t
j |t
|�|ddtj|��}t|� ||fS )a�
This function creates a temporary Mac keychain that we can use to work with
credentials. This keychain uses a one-time password and a temporary file to
store the data. We expect to have one keychain per socket. The returned
SecKeychainRef must be freed by the caller, including calling
SecKeychainDelete.
Returns a tuple of the SecKeychainRef and the path to the temporary
directory that contains it.
�( N� zutf-8F)�os�urandomr# Z b64encoder �tempfileZmkdtemp�path�join�encoder ZSecKeychainRefZSecKeychainCreater r r* r" )Z random_bytes�filenameZpasswordZ
tempdirectoryZ
keychain_path�keychain�statusr r r
�_temporary_keychain� s
r? c C s g }g }d}t |d��}|j� }W dQ R X z�tjtj|t|��}tj� }tj|ddddd| t j
|��}t |� tj |�} xdt
| �D ]X}
tj||
�} t j| tj�} t| �r�tj| � |j| � q�t| �r�tj| � |j| � q�W W d|r�tj|� tj|� X ||fS )z�
Given a single file, loads all the trust objects from it into arrays and
the keychain.
Returns a tuple of lists: the first list is a list of identities, the
second a list of certs.
N�rbr )�open�readr r r r Z
CFArrayRefr Z
SecItemImportr r* r" ZCFArrayGetCount�rangeZCFArrayGetValueAtIndexr r r2 ZCFRetain�appendr3 r ) r= r9 � certificates�
identitiesZ result_array�fZ raw_filedataZfiledatar Z result_count�indexr0 r r r
�_load_items_from_file� sH
rI c G s� g }g }dd� |D �}z�x.|D ]&}t | |�\}}|j|� |j|� q W |s�tj� }tj| |d tj|��}t|� |j|� t j
|j d�� t j t j
dtjt j��} x tj||�D ]}
t j| |
� q�W | S x tj||�D ]} t j
| � q�W X dS )z�
Load certificates and maybe keys from a number of files. Has the end goal
of returning a CFArray containing one SecIdentityRef, and then zero or more
SecCertificateRef objects, suitable for use as a client certificate trust
chain.
c s s | ]}|r|V qd S )Nr )r r9 r r r
r / s z*_load_client_cert_chain.<locals>.<genexpr>r N)rI �extendr ZSecIdentityRefZ SecIdentityCreateWithCertificater r* r" rD r r �popr) r r+ � itertools�chainr, ) r= �pathsrE rF Z file_pathZnew_identitiesZ new_certsZ new_identityr> Z trust_chainr0 �objr r r
�_load_client_cert_chain s6
rP )N)�__doc__r# r rL �rer6 r r8 Zbindingsr r r �compile�DOTALLr' r r r r" r. r2 r3 r? rI rP r r r r
�<module> s(
+(; pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.pyc 0000644 00000000161 14751155150 0024005 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000161 14751155150 0024744 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.opt-1.pyc 0000644 00000016271 14751155150 0025206 0 ustar 00 3
���e / � @ s� d Z ddlZddlZddlZddlZddlZddlZddlZddlm Z m
Z
m Z ej dej
�Zdd� Zdd � Zd
d � Zdd d
�Zdd� Zdd� Zdd� Zdd� Zdd� Zdd� ZdS )a�
Low-level helpers for the SecureTransport bindings.
These are Python functions that are not directly related to the high-level APIs
but are necessary to get them to work. They include a whole bunch of low-level
CoreFoundation messing about and memory management. The concerns in this module
are almost entirely about trying to avoid memory leaks and providing
appropriate and useful assistance to the higher-level code.
� N� )�Security�CoreFoundation�CFConsts; -----BEGIN CERTIFICATE-----
(.*?)
-----END CERTIFICATE-----c C s t jt j| t| ��S )zv
Given a bytestring, create a CFData object from it. This CFData object must
be CFReleased by the caller.
)r � CFDataCreate�kCFAllocatorDefault�len)Z
bytestring� r � /usr/lib/python3.6/low_level.py�_cf_data_from_bytes s r c C sZ t | �}dd� | D �}dd� | D �}tj| |� }tj| |� }tjtj|||tjtj�S )zK
Given a list of Python tuples, create an associated CFDictionary.
c s s | ]}|d V qdS )r Nr )�.0�tr r r
� <genexpr>, s z-_cf_dictionary_from_tuples.<locals>.<genexpr>c s s | ]}|d V qdS )r Nr )r r
r r r
r - s )r r � CFTypeRefZCFDictionaryCreater Z kCFTypeDictionaryKeyCallBacksZ kCFTypeDictionaryValueCallBacks)ZtuplesZdictionary_size�keys�valuesZcf_keysZ cf_valuesr r r
�_cf_dictionary_from_tuples% s r c C sn t j| t jt j��}tj|tj�}|dkrXt jd�}tj ||dtj�}|sRt
d��|j }|dk rj|j d�}|S )z�
Creates a Unicode string from a CFString object. Used entirely for error
reporting.
Yes, it annoys me quite a lot that this function is this complex.
Ni z'Error copying C string from CFStringRefzutf-8)
�ctypes�castZPOINTERZc_void_pr ZCFStringGetCStringPtrr ZkCFStringEncodingUTF8Zcreate_string_bufferZCFStringGetCString�OSError�value�decode)r Zvalue_as_void_p�string�buffer�resultr r r
�_cf_string_to_unicode; s"
r c C s\ | dkr dS t j| d�}t|�}tj|� |dks:|dkrBd| }|dkrPtj}||��dS )z[
Checks the return code and throws an exception if there is an error to
report
r N� z OSStatus %s)r ZSecCopyErrorMessageStringr r � CFRelease�ssl�SSLError)�errorZexception_classZcf_error_string�outputr r r
�_assert_no_errorX s
r" c C s� dd� t j| �D �}|s"tjd��tjtjdtjtj ��}|sHtjd��ydx^|D ]V}t
|�}|sjtjd��t j tj|�}tj
|� |s�tjd��tj||� tj
|� qPW W n tk
r� tj
|� Y nX |S )z�
Given a bundle of certs in PEM format, turns them into a CFArray of certs
that can be used to validate a cert chain.
c S s g | ]}t j|jd ���qS )r )�base64Z b64decode�group)r �matchr r r
�
<listcomp>s s z(_cert_array_from_pem.<locals>.<listcomp>z No root certificates specifiedr zUnable to allocate memory!z Unable to build cert object!)�
_PEM_CERTS_RE�finditerr r r �CFArrayCreateMutabler r �byref�kCFTypeArrayCallBacksr r Z SecCertificateCreateWithDatar �CFArrayAppendValue� Exception)Z
pem_bundleZ der_certsZ
cert_arrayZ der_bytesZcertdataZcertr r r
�_cert_array_from_pemm s2
r. c C s t j� }tj| �|kS )z=
Returns True if a given CFTypeRef is a certificate.
)r ZSecCertificateGetTypeIDr � CFGetTypeID)�item�expectedr r r
�_is_cert� s r2 c C s t j� }tj| �|kS )z;
Returns True if a given CFTypeRef is an identity.
)r ZSecIdentityGetTypeIDr r/ )r0 r1 r r r
� _is_identity� s r3 c C s� t jd�} tj| dd� �jd�}tj| dd� �}tj� }t jj||�j d�}t
j � }t
j |t
|�|ddtj|��}t|� ||fS )a�
This function creates a temporary Mac keychain that we can use to work with
credentials. This keychain uses a one-time password and a temporary file to
store the data. We expect to have one keychain per socket. The returned
SecKeychainRef must be freed by the caller, including calling
SecKeychainDelete.
Returns a tuple of the SecKeychainRef and the path to the temporary
directory that contains it.
�( N� zutf-8F)�os�urandomr# Z b64encoder �tempfileZmkdtemp�path�join�encoder ZSecKeychainRefZSecKeychainCreater r r* r" )Z random_bytes�filenameZpasswordZ
tempdirectoryZ
keychain_path�keychain�statusr r r
�_temporary_keychain� s
r? c C s g }g }d}t |d��}|j� }W dQ R X z�tjtj|t|��}tj� }tj|ddddd| t j
|��}t |� tj |�} xdt
| �D ]X}
tj||
�} t j| tj�} t| �r�tj| � |j| � q�t| �r�tj| � |j| � q�W W d|r�tj|� tj|� X ||fS )z�
Given a single file, loads all the trust objects from it into arrays and
the keychain.
Returns a tuple of lists: the first list is a list of identities, the
second a list of certs.
N�rbr )�open�readr r r r Z
CFArrayRefr Z
SecItemImportr r* r" ZCFArrayGetCount�rangeZCFArrayGetValueAtIndexr r r2 ZCFRetain�appendr3 r ) r= r9 � certificates�
identitiesZ result_array�fZ raw_filedataZfiledatar Z result_count�indexr0 r r r
�_load_items_from_file� sH
rI c G s� g }g }dd� |D �}z�x.|D ]&}t | |�\}}|j|� |j|� q W |s�tj� }tj| |d tj|��}t|� |j|� t j
|j d�� t j t j
dtjt j��} x tj||�D ]}
t j| |
� q�W | S x tj||�D ]} t j
| � q�W X dS )z�
Load certificates and maybe keys from a number of files. Has the end goal
of returning a CFArray containing one SecIdentityRef, and then zero or more
SecCertificateRef objects, suitable for use as a client certificate trust
chain.
c s s | ]}|r|V qd S )Nr )r r9 r r r
r / s z*_load_client_cert_chain.<locals>.<genexpr>r N)rI �extendr ZSecIdentityRefZ SecIdentityCreateWithCertificater r* r" rD r r �popr) r r+ � itertools�chainr, ) r= �pathsrE rF Z file_pathZnew_identitiesZ new_certsZ new_identityr> Z trust_chainr0 �objr r r
�_load_client_cert_chain s6
rP )N)�__doc__r# r rL �rer6 r r8 Zbindingsr r r �compile�DOTALLr' r r r r" r. r2 r3 r? rI rP r r r r
�<module> s(
+(; pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.opt-1.pyc 0000644 00000024130 14751155150 0025004 0 ustar 00 3
���e�D � @ s� d Z ddlmZ ddlZddlmZ ddlmZmZm Z m
Z
m Z m Z m
Z
mZmZ ddlmZmZmZ ed�Zesxed��ed �Zes�ed
��ej� d Zeeeejd ���Z e d k r�e de d e d f ��eedd�Z eedd�Z eZ eZ!e Z"eZ#eZ$eZ%eZ&eZ'eZ(eZ)e
Z*ee)�Z+eZ,eZ-ee#�Z.ee$�Z/ee%�Z0ee&�Z1ee'�Z2eZ3eZ4eZ5ee�Z6e Z7e Z8ee�Z9e Z:eZ;ee�Z<e Z=e Z>ee�Z?ee�Z@e ZAe ZBe ZCe ZDe ZEe ZF�y�e.e/ee7�ee8�e:ee;�e<ee0�ge jG_He-e jG_Ig e jJ_He*e jJ_Ig e jK_He*e jK_Ig e jL_He*e jL_Ie,e.ge jM_He6e jM_Ie6ge jN_He.e jN_Ie-ege jO_He/e jO_Ie+e6ee9�ge jP_He-e jP_Ie e ee eee<�ge jQ_He-e jQ_Ie<ge jR_He-e jR_Ie.e2ee0�ge jS_He-e jS_Iee-eAeee
��ZTee-eAee �ee
��ZUe?eTeUge jV_He-e jV_Ie?e e
ge jW_He-e jW_Ie?e0ge jX_He-e jX_Ie?e+e ge jY_He-e jY_Ie?eAge jZ_He-e jZ_Ie?e e
ge j[_He-e j[_Ie?ge j\_He-e j\_Ie?e e
ee
�ge j]_He-e j]_Ie?e e
ee
�ge j^_He-e j^_Ie?ge j__He-e j__Ie?ee
�ge j`_He-e j`_Ie?ee>�ee
�ge ja_He-e ja_Ie?ee>�e
ge jb_He-e jb_Ie?ee
�ge jc_de-e jc_Ie?ee>�ee
�ge je_He-e je_Ie?ee>�ge jf_He-e jf_Ie?ee=�ge jg_He-e jg_Ie?ee@�ge jh_He-e jh_Ie@e0ge ji_He-e ji_Ie@e ge jj_ke-e jj_Ie@eeB�ge jl_He-e jl_Ie@ge jm_He!e jm_Ie@e!ge jn_He6e jn_Ie,eDeEge jo_He?e jo_Ie?eFe ge jp_He-e jp_Ie?e=ge jq_He-e jq_Ie?e=ge jr_He-e jr_Ie-ege jO_He/e jO_IeTe _TeUe _Ue?e _?e=e _=e>e _>e9e _9e<e _<e@e _@eBe _Be7e _7e-e _-e/jse d�e _te/jse d�e _ue+ge jv_He+e jv_Ie+ge jw_Hde jw_Ie+ge jx_He*e jx_Ie,e e"ge jy_He/e jy_Ie/e"ge jz_He e jz_Ie/e e!e"ge j{_Hee j{_Ie,e e!ge j|_He.e j|_Ie.ge j}_He!e j}_Ie.ge j~_Hee j~_Ie,ee+�ee+�e!e4e5ge j_He2e j_Ie2e+ge j�_He+e j�_Ie,ee+�e!e3ge j�_He0e j�_Ie,e!e3ge j�_He1e j�_Ie1ege j�_Hde j�_Ie0ge j�_He!e j�_Ie0e!ge j�_Hee j�_Ie,jse d�e _�ejse d�e _�ejse d�e _�ejse d�e _�e+e _+e0e _0e/e _/e2e _2W n e�k
�rt ed��Y nX G dd� de��Z�G dd � d e��Z�dS ) ay
This module uses ctypes to bind a whole bunch of functions and constants from
SecureTransport. The goal here is to provide the low-level API to
SecureTransport. These are essentially the C-level functions and constants, and
they're pretty gross to work with.
This code is a bastardised version of the code found in Will Bond's oscrypto
library. An enormous debt is owed to him for blazing this trail for us. For
that reason, this code should be considered to be covered both by urllib3's
license and by oscrypto's:
Copyright (c) 2015-2016 Will Bond <will@wbond.net>
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
� )�absolute_importN)� find_library) �c_void_p�c_int32�c_char_p�c_size_t�c_byte�c_uint32�c_ulong�c_long�c_bool)�CDLL�POINTER� CFUNCTYPE�Securityz'The library Security could not be found�CoreFoundationz-The library CoreFoundation could not be found�.�
� z1Only OS X 10.8 and newer are supported, not %s.%s� T)Z use_errno�kSecImportExportPassphrase�kSecImportItemIdentity�kCFAllocatorDefault�kCFTypeArrayCallBacks� kCFTypeDictionaryKeyCallBacks� kCFTypeDictionaryValueCallBackszError initializing ctypesc @ s e Zd ZdZed�ZdS )�CFConstz_
A class object that acts as essentially a namespace for CoreFoundation
constants.
i N)�__name__�
__module__� __qualname__�__doc__�CFStringEncodingZkCFStringEncodingUTF8� r" r" � /usr/lib/python3.6/bindings.pyr � s r c @ s, e Zd ZdZdZdZdZdZdZdZ dZ
dZ dZ dZ
dZd ZdZd
Zd ZdZdDZdEZdFZdGZdHZdIZdJZdKZdLZ dMZ dNZ dOZ dPZ dQZ!dRZ"dSZ#dTZ$dUZ%dVZ&dWZ'dXZ(dYZ)d"Z*d#Z+d$Z,d%Z-d&Z.d'Z/d(Z0d)Z1d*Z2d+Z3d,Z4d-Z5d.Z6d/Z7d0Z8d1Z9d2Z:d3Z;d4Z<d5Z=d6Z>d7Z?d8Z@d9ZAd:ZBd;ZCd<ZDd=ZEd>ZFd?ZGd@ZHdAZIdBZJdCS )Z�
SecurityConstzU
A class object that acts as essentially a namespace for Security constants.
r r � � � r r � � � iH& iK& iM& iX& iN& iO& iQ& iR& iV& iW& iT& iU& is& i`& io& iz& iq& iw& i� i�b i�b i�b i,� i0� i+� i/� � � � � i$� i(� i
� i� �k �j �9 �8 i#� i'� i � i� �g �@ �3 �2 � � �= �< �5 �/ i i i Ni���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i ���iQ���i,���iR���)Kr r r r Z"kSSLSessionOptionBreakOnServerAuthZ
kSSLProtocol2Z
kSSLProtocol3Z
kTLSProtocol1ZkTLSProtocol11ZkTLSProtocol12ZkSSLClientSideZkSSLStreamTypeZkSecFormatPEMSequenceZkSecTrustResultInvalidZkSecTrustResultProceedZkSecTrustResultDenyZkSecTrustResultUnspecifiedZ&kSecTrustResultRecoverableTrustFailureZ kSecTrustResultFatalTrustFailureZkSecTrustResultOtherErrorZerrSSLProtocolZerrSSLWouldBlockZerrSSLClosedGracefulZerrSSLClosedNoNotifyZerrSSLClosedAbortZerrSSLXCertChainInvalidZ errSSLCryptoZerrSSLInternalZerrSSLCertExpiredZerrSSLCertNotYetValidZerrSSLUnknownRootCertZerrSSLNoRootCertZerrSSLHostNameMismatchZerrSSLPeerHandshakeFailZerrSSLPeerUserCancelledZ errSSLWeakPeerEphemeralDHKeyZerrSSLServerAuthCompletedZerrSSLRecordOverflowZerrSecVerifyFailedZerrSecNoTrustSettingsZerrSecItemNotFoundZerrSecInvalidTrustSettingsZ'TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384Z'TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256Z#TLS_DHE_DSS_WITH_AES_256_GCM_SHA384Z#TLS_DHE_RSA_WITH_AES_256_GCM_SHA384Z#TLS_DHE_DSS_WITH_AES_128_GCM_SHA256Z#TLS_DHE_RSA_WITH_AES_128_GCM_SHA256Z'TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384Z$TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_256_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_256_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_256_CBC_SHAZ TLS_DHE_DSS_WITH_AES_256_CBC_SHAZ'TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256Z$TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_128_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_128_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_128_CBC_SHAZ TLS_DHE_DSS_WITH_AES_128_CBC_SHAZ TLS_RSA_WITH_AES_256_GCM_SHA384Z TLS_RSA_WITH_AES_128_GCM_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHA256Z TLS_RSA_WITH_AES_128_CBC_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHAZ TLS_RSA_WITH_AES_128_CBC_SHAZTLS_AES_128_GCM_SHA256ZTLS_AES_256_GCM_SHA384Z TLS_CHACHA20_POLY1305_SHA256r" r" r" r# r$ � s� r$ )r r )�r Z
__future__r �platformZ ctypes.utilr Zctypesr r r r r r r
r r r
r r Z
security_path� ImportErrorZcore_foundation_pathZmac_ver�version�tuple�map�int�split� version_info�OSErrorr r ZBooleanZCFIndexr! ZCFDataZCFStringZCFArrayZCFMutableArrayZ CFDictionaryZCFErrorZCFTypeZCFTypeIDZ CFTypeRefZCFAllocatorRefZOSStatusZ CFDataRefZ CFStringRefZ
CFArrayRefZCFMutableArrayRefZCFDictionaryRefZCFArrayCallBacksZCFDictionaryKeyCallBacksZCFDictionaryValueCallBacksZSecCertificateRefZSecExternalFormatZSecExternalItemTypeZSecIdentityRefZSecItemImportExportFlagsZ SecItemImportExportKeyParametersZSecKeychainRefZ SSLProtocolZSSLCipherSuiteZ
SSLContextRefZ SecTrustRefZSSLConnectionRefZSecTrustResultTypeZSecTrustOptionFlagsZSSLProtocolSideZSSLConnectionTypeZSSLSessionOptionZ
SecItemImportZargtypesZrestypeZSecCertificateGetTypeIDZSecIdentityGetTypeIDZSecKeyGetTypeIDZ SecCertificateCreateWithDataZSecCertificateCopyDataZSecCopyErrorMessageStringZ SecIdentityCreateWithCertificateZSecKeychainCreateZSecKeychainDeleteZSecPKCS12ImportZ SSLReadFuncZ SSLWriteFuncZ
SSLSetIOFuncsZ SSLSetPeerIDZSSLSetCertificateZ SSLSetCertificateAuthoritiesZSSLSetConnectionZSSLSetPeerDomainNameZ SSLHandshakeZSSLReadZSSLWriteZSSLCloseZ SSLGetNumberSupportedCiphersZSSLGetSupportedCiphersZSSLSetEnabledCiphersZSSLGetNumberEnabledCiphersZargtypeZSSLGetEnabledCiphersZSSLGetNegotiatedCipherZ SSLGetNegotiatedProtocolVersionZSSLCopyPeerTrustZ SecTrustSetAnchorCertificatesZ!SecTrustSetAnchorCertificatesOnlyZ argstypesZSecTrustEvaluateZSecTrustGetCertificateCountZ SecTrustGetCertificateAtIndexZSSLCreateContextZSSLSetSessionOptionZSSLSetProtocolVersionMinZSSLSetProtocolVersionMaxZin_dllr r ZCFRetainZ CFReleaseZ CFGetTypeIDZCFStringCreateWithCStringZCFStringGetCStringPtrZCFStringGetCStringZ CFDataCreateZCFDataGetLengthZCFDataGetBytePtrZCFDictionaryCreateZCFDictionaryGetValueZ
CFArrayCreateZCFArrayCreateMutableZCFArrayAppendValueZCFArrayGetCountZCFArrayGetValueAtIndexr r r r �AttributeError�objectr r$ r" r" r" r# �<module> s, ,
pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.pyc 0000644 00000024130 14751155150 0024045 0 ustar 00 3
���e�D � @ s� d Z ddlmZ ddlZddlmZ ddlmZmZm Z m
Z
m Z m Z m
Z
mZmZ ddlmZmZmZ ed�Zesxed��ed �Zes�ed
��ej� d Zeeeejd ���Z e d k r�e de d e d f ��eedd�Z eedd�Z eZ eZ!e Z"eZ#eZ$eZ%eZ&eZ'eZ(eZ)e
Z*ee)�Z+eZ,eZ-ee#�Z.ee$�Z/ee%�Z0ee&�Z1ee'�Z2eZ3eZ4eZ5ee�Z6e Z7e Z8ee�Z9e Z:eZ;ee�Z<e Z=e Z>ee�Z?ee�Z@e ZAe ZBe ZCe ZDe ZEe ZF�y�e.e/ee7�ee8�e:ee;�e<ee0�ge jG_He-e jG_Ig e jJ_He*e jJ_Ig e jK_He*e jK_Ig e jL_He*e jL_Ie,e.ge jM_He6e jM_Ie6ge jN_He.e jN_Ie-ege jO_He/e jO_Ie+e6ee9�ge jP_He-e jP_Ie e ee eee<�ge jQ_He-e jQ_Ie<ge jR_He-e jR_Ie.e2ee0�ge jS_He-e jS_Iee-eAeee
��ZTee-eAee �ee
��ZUe?eTeUge jV_He-e jV_Ie?e e
ge jW_He-e jW_Ie?e0ge jX_He-e jX_Ie?e+e ge jY_He-e jY_Ie?eAge jZ_He-e jZ_Ie?e e
ge j[_He-e j[_Ie?ge j\_He-e j\_Ie?e e
ee
�ge j]_He-e j]_Ie?e e
ee
�ge j^_He-e j^_Ie?ge j__He-e j__Ie?ee
�ge j`_He-e j`_Ie?ee>�ee
�ge ja_He-e ja_Ie?ee>�e
ge jb_He-e jb_Ie?ee
�ge jc_de-e jc_Ie?ee>�ee
�ge je_He-e je_Ie?ee>�ge jf_He-e jf_Ie?ee=�ge jg_He-e jg_Ie?ee@�ge jh_He-e jh_Ie@e0ge ji_He-e ji_Ie@e ge jj_ke-e jj_Ie@eeB�ge jl_He-e jl_Ie@ge jm_He!e jm_Ie@e!ge jn_He6e jn_Ie,eDeEge jo_He?e jo_Ie?eFe ge jp_He-e jp_Ie?e=ge jq_He-e jq_Ie?e=ge jr_He-e jr_Ie-ege jO_He/e jO_IeTe _TeUe _Ue?e _?e=e _=e>e _>e9e _9e<e _<e@e _@eBe _Be7e _7e-e _-e/jse d�e _te/jse d�e _ue+ge jv_He+e jv_Ie+ge jw_Hde jw_Ie+ge jx_He*e jx_Ie,e e"ge jy_He/e jy_Ie/e"ge jz_He e jz_Ie/e e!e"ge j{_Hee j{_Ie,e e!ge j|_He.e j|_Ie.ge j}_He!e j}_Ie.ge j~_Hee j~_Ie,ee+�ee+�e!e4e5ge j_He2e j_Ie2e+ge j�_He+e j�_Ie,ee+�e!e3ge j�_He0e j�_Ie,e!e3ge j�_He1e j�_Ie1ege j�_Hde j�_Ie0ge j�_He!e j�_Ie0e!ge j�_Hee j�_Ie,jse d�e _�ejse d�e _�ejse d�e _�ejse d�e _�e+e _+e0e _0e/e _/e2e _2W n e�k
�rt ed��Y nX G dd� de��Z�G dd � d e��Z�dS ) ay
This module uses ctypes to bind a whole bunch of functions and constants from
SecureTransport. The goal here is to provide the low-level API to
SecureTransport. These are essentially the C-level functions and constants, and
they're pretty gross to work with.
This code is a bastardised version of the code found in Will Bond's oscrypto
library. An enormous debt is owed to him for blazing this trail for us. For
that reason, this code should be considered to be covered both by urllib3's
license and by oscrypto's:
Copyright (c) 2015-2016 Will Bond <will@wbond.net>
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
� )�absolute_importN)� find_library) �c_void_p�c_int32�c_char_p�c_size_t�c_byte�c_uint32�c_ulong�c_long�c_bool)�CDLL�POINTER� CFUNCTYPE�Securityz'The library Security could not be found�CoreFoundationz-The library CoreFoundation could not be found�.�
� z1Only OS X 10.8 and newer are supported, not %s.%s� T)Z use_errno�kSecImportExportPassphrase�kSecImportItemIdentity�kCFAllocatorDefault�kCFTypeArrayCallBacks� kCFTypeDictionaryKeyCallBacks� kCFTypeDictionaryValueCallBackszError initializing ctypesc @ s e Zd ZdZed�ZdS )�CFConstz_
A class object that acts as essentially a namespace for CoreFoundation
constants.
i N)�__name__�
__module__� __qualname__�__doc__�CFStringEncodingZkCFStringEncodingUTF8� r" r" � /usr/lib/python3.6/bindings.pyr � s r c @ s, e Zd ZdZdZdZdZdZdZdZ dZ
dZ dZ dZ
dZd ZdZd
Zd ZdZdDZdEZdFZdGZdHZdIZdJZdKZdLZ dMZ dNZ dOZ dPZ dQZ!dRZ"dSZ#dTZ$dUZ%dVZ&dWZ'dXZ(dYZ)d"Z*d#Z+d$Z,d%Z-d&Z.d'Z/d(Z0d)Z1d*Z2d+Z3d,Z4d-Z5d.Z6d/Z7d0Z8d1Z9d2Z:d3Z;d4Z<d5Z=d6Z>d7Z?d8Z@d9ZAd:ZBd;ZCd<ZDd=ZEd>ZFd?ZGd@ZHdAZIdBZJdCS )Z�
SecurityConstzU
A class object that acts as essentially a namespace for Security constants.
r r � � � r r � � � iH& iK& iM& iX& iN& iO& iQ& iR& iV& iW& iT& iU& is& i`& io& iz& iq& iw& i� i�b i�b i�b i,� i0� i+� i/� � � � � i$� i(� i
� i� �k �j �9 �8 i#� i'� i � i� �g �@ �3 �2 � � �= �< �5 �/ i i i Ni���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i���i ���iQ���i,���iR���)Kr r r r Z"kSSLSessionOptionBreakOnServerAuthZ
kSSLProtocol2Z
kSSLProtocol3Z
kTLSProtocol1ZkTLSProtocol11ZkTLSProtocol12ZkSSLClientSideZkSSLStreamTypeZkSecFormatPEMSequenceZkSecTrustResultInvalidZkSecTrustResultProceedZkSecTrustResultDenyZkSecTrustResultUnspecifiedZ&kSecTrustResultRecoverableTrustFailureZ kSecTrustResultFatalTrustFailureZkSecTrustResultOtherErrorZerrSSLProtocolZerrSSLWouldBlockZerrSSLClosedGracefulZerrSSLClosedNoNotifyZerrSSLClosedAbortZerrSSLXCertChainInvalidZ errSSLCryptoZerrSSLInternalZerrSSLCertExpiredZerrSSLCertNotYetValidZerrSSLUnknownRootCertZerrSSLNoRootCertZerrSSLHostNameMismatchZerrSSLPeerHandshakeFailZerrSSLPeerUserCancelledZ errSSLWeakPeerEphemeralDHKeyZerrSSLServerAuthCompletedZerrSSLRecordOverflowZerrSecVerifyFailedZerrSecNoTrustSettingsZerrSecItemNotFoundZerrSecInvalidTrustSettingsZ'TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384Z'TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256Z#TLS_DHE_DSS_WITH_AES_256_GCM_SHA384Z#TLS_DHE_RSA_WITH_AES_256_GCM_SHA384Z#TLS_DHE_DSS_WITH_AES_128_GCM_SHA256Z#TLS_DHE_RSA_WITH_AES_128_GCM_SHA256Z'TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384Z%TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384Z$TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_256_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_256_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_256_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_256_CBC_SHAZ TLS_DHE_DSS_WITH_AES_256_CBC_SHAZ'TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256Z%TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256Z$TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHAZ"TLS_ECDHE_RSA_WITH_AES_128_CBC_SHAZ#TLS_DHE_RSA_WITH_AES_128_CBC_SHA256Z#TLS_DHE_DSS_WITH_AES_128_CBC_SHA256Z TLS_DHE_RSA_WITH_AES_128_CBC_SHAZ TLS_DHE_DSS_WITH_AES_128_CBC_SHAZ TLS_RSA_WITH_AES_256_GCM_SHA384Z TLS_RSA_WITH_AES_128_GCM_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHA256Z TLS_RSA_WITH_AES_128_CBC_SHA256Z TLS_RSA_WITH_AES_256_CBC_SHAZ TLS_RSA_WITH_AES_128_CBC_SHAZTLS_AES_128_GCM_SHA256ZTLS_AES_256_GCM_SHA384Z TLS_CHACHA20_POLY1305_SHA256r" r" r" r# r$ � s� r$ )r r )�r Z
__future__r �platformZ ctypes.utilr Zctypesr r r r r r r
r r r
r r Z
security_path� ImportErrorZcore_foundation_pathZmac_ver�version�tuple�map�int�split� version_info�OSErrorr r ZBooleanZCFIndexr! ZCFDataZCFStringZCFArrayZCFMutableArrayZ CFDictionaryZCFErrorZCFTypeZCFTypeIDZ CFTypeRefZCFAllocatorRefZOSStatusZ CFDataRefZ CFStringRefZ
CFArrayRefZCFMutableArrayRefZCFDictionaryRefZCFArrayCallBacksZCFDictionaryKeyCallBacksZCFDictionaryValueCallBacksZSecCertificateRefZSecExternalFormatZSecExternalItemTypeZSecIdentityRefZSecItemImportExportFlagsZ SecItemImportExportKeyParametersZSecKeychainRefZ SSLProtocolZSSLCipherSuiteZ
SSLContextRefZ SecTrustRefZSSLConnectionRefZSecTrustResultTypeZSecTrustOptionFlagsZSSLProtocolSideZSSLConnectionTypeZSSLSessionOptionZ
SecItemImportZargtypesZrestypeZSecCertificateGetTypeIDZSecIdentityGetTypeIDZSecKeyGetTypeIDZ SecCertificateCreateWithDataZSecCertificateCopyDataZSecCopyErrorMessageStringZ SecIdentityCreateWithCertificateZSecKeychainCreateZSecKeychainDeleteZSecPKCS12ImportZ SSLReadFuncZ SSLWriteFuncZ
SSLSetIOFuncsZ SSLSetPeerIDZSSLSetCertificateZ SSLSetCertificateAuthoritiesZSSLSetConnectionZSSLSetPeerDomainNameZ SSLHandshakeZSSLReadZSSLWriteZSSLCloseZ SSLGetNumberSupportedCiphersZSSLGetSupportedCiphersZSSLSetEnabledCiphersZSSLGetNumberEnabledCiphersZargtypeZSSLGetEnabledCiphersZSSLGetNegotiatedCipherZ SSLGetNegotiatedProtocolVersionZSSLCopyPeerTrustZ SecTrustSetAnchorCertificatesZ!SecTrustSetAnchorCertificatesOnlyZ argstypesZSecTrustEvaluateZSecTrustGetCertificateCountZ SecTrustGetCertificateAtIndexZSSLCreateContextZSSLSetSessionOptionZSSLSetProtocolVersionMinZSSLSetProtocolVersionMaxZin_dllr r ZCFRetainZ CFReleaseZ CFGetTypeIDZCFStringCreateWithCStringZCFStringGetCStringPtrZCFStringGetCStringZ CFDataCreateZCFDataGetLengthZCFDataGetBytePtrZCFDictionaryCreateZCFDictionaryGetValueZ
CFArrayCreateZCFArrayCreateMutableZCFArrayAppendValueZCFArrayGetCountZCFArrayGetValueAtIndexr r r r �AttributeError�objectr r$ r" r" r" r# �<module> s, ,
pip/_vendor/urllib3/contrib/_securetransport/low_level.py 0000644 00000027436 14751155150 0017770 0 ustar 00 """
Low-level helpers for the SecureTransport bindings.
These are Python functions that are not directly related to the high-level APIs
but are necessary to get them to work. They include a whole bunch of low-level
CoreFoundation messing about and memory management. The concerns in this module
are almost entirely about trying to avoid memory leaks and providing
appropriate and useful assistance to the higher-level code.
"""
import base64
import ctypes
import itertools
import re
import os
import ssl
import tempfile
from .bindings import Security, CoreFoundation, CFConst
# This regular expression is used to grab PEM data out of a PEM bundle.
_PEM_CERTS_RE = re.compile(
b"-----BEGIN CERTIFICATE-----\n(.*?)\n-----END CERTIFICATE-----", re.DOTALL
)
def _cf_data_from_bytes(bytestring):
"""
Given a bytestring, create a CFData object from it. This CFData object must
be CFReleased by the caller.
"""
return CoreFoundation.CFDataCreate(
CoreFoundation.kCFAllocatorDefault, bytestring, len(bytestring)
)
def _cf_dictionary_from_tuples(tuples):
"""
Given a list of Python tuples, create an associated CFDictionary.
"""
dictionary_size = len(tuples)
# We need to get the dictionary keys and values out in the same order.
keys = (t[0] for t in tuples)
values = (t[1] for t in tuples)
cf_keys = (CoreFoundation.CFTypeRef * dictionary_size)(*keys)
cf_values = (CoreFoundation.CFTypeRef * dictionary_size)(*values)
return CoreFoundation.CFDictionaryCreate(
CoreFoundation.kCFAllocatorDefault,
cf_keys,
cf_values,
dictionary_size,
CoreFoundation.kCFTypeDictionaryKeyCallBacks,
CoreFoundation.kCFTypeDictionaryValueCallBacks,
)
def _cf_string_to_unicode(value):
"""
Creates a Unicode string from a CFString object. Used entirely for error
reporting.
Yes, it annoys me quite a lot that this function is this complex.
"""
value_as_void_p = ctypes.cast(value, ctypes.POINTER(ctypes.c_void_p))
string = CoreFoundation.CFStringGetCStringPtr(
value_as_void_p,
CFConst.kCFStringEncodingUTF8
)
if string is None:
buffer = ctypes.create_string_buffer(1024)
result = CoreFoundation.CFStringGetCString(
value_as_void_p,
buffer,
1024,
CFConst.kCFStringEncodingUTF8
)
if not result:
raise OSError('Error copying C string from CFStringRef')
string = buffer.value
if string is not None:
string = string.decode('utf-8')
return string
def _assert_no_error(error, exception_class=None):
"""
Checks the return code and throws an exception if there is an error to
report
"""
if error == 0:
return
cf_error_string = Security.SecCopyErrorMessageString(error, None)
output = _cf_string_to_unicode(cf_error_string)
CoreFoundation.CFRelease(cf_error_string)
if output is None or output == u'':
output = u'OSStatus %s' % error
if exception_class is None:
exception_class = ssl.SSLError
raise exception_class(output)
def _cert_array_from_pem(pem_bundle):
"""
Given a bundle of certs in PEM format, turns them into a CFArray of certs
that can be used to validate a cert chain.
"""
der_certs = [
base64.b64decode(match.group(1))
for match in _PEM_CERTS_RE.finditer(pem_bundle)
]
if not der_certs:
raise ssl.SSLError("No root certificates specified")
cert_array = CoreFoundation.CFArrayCreateMutable(
CoreFoundation.kCFAllocatorDefault,
0,
ctypes.byref(CoreFoundation.kCFTypeArrayCallBacks)
)
if not cert_array:
raise ssl.SSLError("Unable to allocate memory!")
try:
for der_bytes in der_certs:
certdata = _cf_data_from_bytes(der_bytes)
if not certdata:
raise ssl.SSLError("Unable to allocate memory!")
cert = Security.SecCertificateCreateWithData(
CoreFoundation.kCFAllocatorDefault, certdata
)
CoreFoundation.CFRelease(certdata)
if not cert:
raise ssl.SSLError("Unable to build cert object!")
CoreFoundation.CFArrayAppendValue(cert_array, cert)
CoreFoundation.CFRelease(cert)
except Exception:
# We need to free the array before the exception bubbles further.
# We only want to do that if an error occurs: otherwise, the caller
# should free.
CoreFoundation.CFRelease(cert_array)
return cert_array
def _is_cert(item):
"""
Returns True if a given CFTypeRef is a certificate.
"""
expected = Security.SecCertificateGetTypeID()
return CoreFoundation.CFGetTypeID(item) == expected
def _is_identity(item):
"""
Returns True if a given CFTypeRef is an identity.
"""
expected = Security.SecIdentityGetTypeID()
return CoreFoundation.CFGetTypeID(item) == expected
def _temporary_keychain():
"""
This function creates a temporary Mac keychain that we can use to work with
credentials. This keychain uses a one-time password and a temporary file to
store the data. We expect to have one keychain per socket. The returned
SecKeychainRef must be freed by the caller, including calling
SecKeychainDelete.
Returns a tuple of the SecKeychainRef and the path to the temporary
directory that contains it.
"""
# Unfortunately, SecKeychainCreate requires a path to a keychain. This
# means we cannot use mkstemp to use a generic temporary file. Instead,
# we're going to create a temporary directory and a filename to use there.
# This filename will be 8 random bytes expanded into base64. We also need
# some random bytes to password-protect the keychain we're creating, so we
# ask for 40 random bytes.
random_bytes = os.urandom(40)
filename = base64.b64encode(random_bytes[:8]).decode('utf-8')
password = base64.b64encode(random_bytes[8:]) # Must be valid UTF-8
tempdirectory = tempfile.mkdtemp()
keychain_path = os.path.join(tempdirectory, filename).encode('utf-8')
# We now want to create the keychain itself.
keychain = Security.SecKeychainRef()
status = Security.SecKeychainCreate(
keychain_path,
len(password),
password,
False,
None,
ctypes.byref(keychain)
)
_assert_no_error(status)
# Having created the keychain, we want to pass it off to the caller.
return keychain, tempdirectory
def _load_items_from_file(keychain, path):
"""
Given a single file, loads all the trust objects from it into arrays and
the keychain.
Returns a tuple of lists: the first list is a list of identities, the
second a list of certs.
"""
certificates = []
identities = []
result_array = None
with open(path, 'rb') as f:
raw_filedata = f.read()
try:
filedata = CoreFoundation.CFDataCreate(
CoreFoundation.kCFAllocatorDefault,
raw_filedata,
len(raw_filedata)
)
result_array = CoreFoundation.CFArrayRef()
result = Security.SecItemImport(
filedata, # cert data
None, # Filename, leaving it out for now
None, # What the type of the file is, we don't care
None, # what's in the file, we don't care
0, # import flags
None, # key params, can include passphrase in the future
keychain, # The keychain to insert into
ctypes.byref(result_array) # Results
)
_assert_no_error(result)
# A CFArray is not very useful to us as an intermediary
# representation, so we are going to extract the objects we want
# and then free the array. We don't need to keep hold of keys: the
# keychain already has them!
result_count = CoreFoundation.CFArrayGetCount(result_array)
for index in range(result_count):
item = CoreFoundation.CFArrayGetValueAtIndex(
result_array, index
)
item = ctypes.cast(item, CoreFoundation.CFTypeRef)
if _is_cert(item):
CoreFoundation.CFRetain(item)
certificates.append(item)
elif _is_identity(item):
CoreFoundation.CFRetain(item)
identities.append(item)
finally:
if result_array:
CoreFoundation.CFRelease(result_array)
CoreFoundation.CFRelease(filedata)
return (identities, certificates)
def _load_client_cert_chain(keychain, *paths):
"""
Load certificates and maybe keys from a number of files. Has the end goal
of returning a CFArray containing one SecIdentityRef, and then zero or more
SecCertificateRef objects, suitable for use as a client certificate trust
chain.
"""
# Ok, the strategy.
#
# This relies on knowing that macOS will not give you a SecIdentityRef
# unless you have imported a key into a keychain. This is a somewhat
# artificial limitation of macOS (for example, it doesn't necessarily
# affect iOS), but there is nothing inside Security.framework that lets you
# get a SecIdentityRef without having a key in a keychain.
#
# So the policy here is we take all the files and iterate them in order.
# Each one will use SecItemImport to have one or more objects loaded from
# it. We will also point at a keychain that macOS can use to work with the
# private key.
#
# Once we have all the objects, we'll check what we actually have. If we
# already have a SecIdentityRef in hand, fab: we'll use that. Otherwise,
# we'll take the first certificate (which we assume to be our leaf) and
# ask the keychain to give us a SecIdentityRef with that cert's associated
# key.
#
# We'll then return a CFArray containing the trust chain: one
# SecIdentityRef and then zero-or-more SecCertificateRef objects. The
# responsibility for freeing this CFArray will be with the caller. This
# CFArray must remain alive for the entire connection, so in practice it
# will be stored with a single SSLSocket, along with the reference to the
# keychain.
certificates = []
identities = []
# Filter out bad paths.
paths = (path for path in paths if path)
try:
for file_path in paths:
new_identities, new_certs = _load_items_from_file(
keychain, file_path
)
identities.extend(new_identities)
certificates.extend(new_certs)
# Ok, we have everything. The question is: do we have an identity? If
# not, we want to grab one from the first cert we have.
if not identities:
new_identity = Security.SecIdentityRef()
status = Security.SecIdentityCreateWithCertificate(
keychain,
certificates[0],
ctypes.byref(new_identity)
)
_assert_no_error(status)
identities.append(new_identity)
# We now want to release the original certificate, as we no longer
# need it.
CoreFoundation.CFRelease(certificates.pop(0))
# We now need to build a new CFArray that holds the trust chain.
trust_chain = CoreFoundation.CFArrayCreateMutable(
CoreFoundation.kCFAllocatorDefault,
0,
ctypes.byref(CoreFoundation.kCFTypeArrayCallBacks),
)
for item in itertools.chain(identities, certificates):
# ArrayAppendValue does a CFRetain on the item. That's fine,
# because the finally block will release our other refs to them.
CoreFoundation.CFArrayAppendValue(trust_chain, item)
return trust_chain
finally:
for obj in itertools.chain(identities, certificates):
CoreFoundation.CFRelease(obj)
pip/_vendor/urllib3/contrib/_securetransport/bindings.py 0000644 00000042230 14751155150 0017562 0 ustar 00 """
This module uses ctypes to bind a whole bunch of functions and constants from
SecureTransport. The goal here is to provide the low-level API to
SecureTransport. These are essentially the C-level functions and constants, and
they're pretty gross to work with.
This code is a bastardised version of the code found in Will Bond's oscrypto
library. An enormous debt is owed to him for blazing this trail for us. For
that reason, this code should be considered to be covered both by urllib3's
license and by oscrypto's:
Copyright (c) 2015-2016 Will Bond <will@wbond.net>
Permission is hereby granted, free of charge, to any person obtaining a
copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the
Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
DEALINGS IN THE SOFTWARE.
"""
from __future__ import absolute_import
import platform
from ctypes.util import find_library
from ctypes import (
c_void_p, c_int32, c_char_p, c_size_t, c_byte, c_uint32, c_ulong, c_long,
c_bool
)
from ctypes import CDLL, POINTER, CFUNCTYPE
security_path = find_library('Security')
if not security_path:
raise ImportError('The library Security could not be found')
core_foundation_path = find_library('CoreFoundation')
if not core_foundation_path:
raise ImportError('The library CoreFoundation could not be found')
version = platform.mac_ver()[0]
version_info = tuple(map(int, version.split('.')))
if version_info < (10, 8):
raise OSError(
'Only OS X 10.8 and newer are supported, not %s.%s' % (
version_info[0], version_info[1]
)
)
Security = CDLL(security_path, use_errno=True)
CoreFoundation = CDLL(core_foundation_path, use_errno=True)
Boolean = c_bool
CFIndex = c_long
CFStringEncoding = c_uint32
CFData = c_void_p
CFString = c_void_p
CFArray = c_void_p
CFMutableArray = c_void_p
CFDictionary = c_void_p
CFError = c_void_p
CFType = c_void_p
CFTypeID = c_ulong
CFTypeRef = POINTER(CFType)
CFAllocatorRef = c_void_p
OSStatus = c_int32
CFDataRef = POINTER(CFData)
CFStringRef = POINTER(CFString)
CFArrayRef = POINTER(CFArray)
CFMutableArrayRef = POINTER(CFMutableArray)
CFDictionaryRef = POINTER(CFDictionary)
CFArrayCallBacks = c_void_p
CFDictionaryKeyCallBacks = c_void_p
CFDictionaryValueCallBacks = c_void_p
SecCertificateRef = POINTER(c_void_p)
SecExternalFormat = c_uint32
SecExternalItemType = c_uint32
SecIdentityRef = POINTER(c_void_p)
SecItemImportExportFlags = c_uint32
SecItemImportExportKeyParameters = c_void_p
SecKeychainRef = POINTER(c_void_p)
SSLProtocol = c_uint32
SSLCipherSuite = c_uint32
SSLContextRef = POINTER(c_void_p)
SecTrustRef = POINTER(c_void_p)
SSLConnectionRef = c_uint32
SecTrustResultType = c_uint32
SecTrustOptionFlags = c_uint32
SSLProtocolSide = c_uint32
SSLConnectionType = c_uint32
SSLSessionOption = c_uint32
try:
Security.SecItemImport.argtypes = [
CFDataRef,
CFStringRef,
POINTER(SecExternalFormat),
POINTER(SecExternalItemType),
SecItemImportExportFlags,
POINTER(SecItemImportExportKeyParameters),
SecKeychainRef,
POINTER(CFArrayRef),
]
Security.SecItemImport.restype = OSStatus
Security.SecCertificateGetTypeID.argtypes = []
Security.SecCertificateGetTypeID.restype = CFTypeID
Security.SecIdentityGetTypeID.argtypes = []
Security.SecIdentityGetTypeID.restype = CFTypeID
Security.SecKeyGetTypeID.argtypes = []
Security.SecKeyGetTypeID.restype = CFTypeID
Security.SecCertificateCreateWithData.argtypes = [
CFAllocatorRef,
CFDataRef
]
Security.SecCertificateCreateWithData.restype = SecCertificateRef
Security.SecCertificateCopyData.argtypes = [
SecCertificateRef
]
Security.SecCertificateCopyData.restype = CFDataRef
Security.SecCopyErrorMessageString.argtypes = [
OSStatus,
c_void_p
]
Security.SecCopyErrorMessageString.restype = CFStringRef
Security.SecIdentityCreateWithCertificate.argtypes = [
CFTypeRef,
SecCertificateRef,
POINTER(SecIdentityRef)
]
Security.SecIdentityCreateWithCertificate.restype = OSStatus
Security.SecKeychainCreate.argtypes = [
c_char_p,
c_uint32,
c_void_p,
Boolean,
c_void_p,
POINTER(SecKeychainRef)
]
Security.SecKeychainCreate.restype = OSStatus
Security.SecKeychainDelete.argtypes = [
SecKeychainRef
]
Security.SecKeychainDelete.restype = OSStatus
Security.SecPKCS12Import.argtypes = [
CFDataRef,
CFDictionaryRef,
POINTER(CFArrayRef)
]
Security.SecPKCS12Import.restype = OSStatus
SSLReadFunc = CFUNCTYPE(OSStatus, SSLConnectionRef, c_void_p, POINTER(c_size_t))
SSLWriteFunc = CFUNCTYPE(OSStatus, SSLConnectionRef, POINTER(c_byte), POINTER(c_size_t))
Security.SSLSetIOFuncs.argtypes = [
SSLContextRef,
SSLReadFunc,
SSLWriteFunc
]
Security.SSLSetIOFuncs.restype = OSStatus
Security.SSLSetPeerID.argtypes = [
SSLContextRef,
c_char_p,
c_size_t
]
Security.SSLSetPeerID.restype = OSStatus
Security.SSLSetCertificate.argtypes = [
SSLContextRef,
CFArrayRef
]
Security.SSLSetCertificate.restype = OSStatus
Security.SSLSetCertificateAuthorities.argtypes = [
SSLContextRef,
CFTypeRef,
Boolean
]
Security.SSLSetCertificateAuthorities.restype = OSStatus
Security.SSLSetConnection.argtypes = [
SSLContextRef,
SSLConnectionRef
]
Security.SSLSetConnection.restype = OSStatus
Security.SSLSetPeerDomainName.argtypes = [
SSLContextRef,
c_char_p,
c_size_t
]
Security.SSLSetPeerDomainName.restype = OSStatus
Security.SSLHandshake.argtypes = [
SSLContextRef
]
Security.SSLHandshake.restype = OSStatus
Security.SSLRead.argtypes = [
SSLContextRef,
c_char_p,
c_size_t,
POINTER(c_size_t)
]
Security.SSLRead.restype = OSStatus
Security.SSLWrite.argtypes = [
SSLContextRef,
c_char_p,
c_size_t,
POINTER(c_size_t)
]
Security.SSLWrite.restype = OSStatus
Security.SSLClose.argtypes = [
SSLContextRef
]
Security.SSLClose.restype = OSStatus
Security.SSLGetNumberSupportedCiphers.argtypes = [
SSLContextRef,
POINTER(c_size_t)
]
Security.SSLGetNumberSupportedCiphers.restype = OSStatus
Security.SSLGetSupportedCiphers.argtypes = [
SSLContextRef,
POINTER(SSLCipherSuite),
POINTER(c_size_t)
]
Security.SSLGetSupportedCiphers.restype = OSStatus
Security.SSLSetEnabledCiphers.argtypes = [
SSLContextRef,
POINTER(SSLCipherSuite),
c_size_t
]
Security.SSLSetEnabledCiphers.restype = OSStatus
Security.SSLGetNumberEnabledCiphers.argtype = [
SSLContextRef,
POINTER(c_size_t)
]
Security.SSLGetNumberEnabledCiphers.restype = OSStatus
Security.SSLGetEnabledCiphers.argtypes = [
SSLContextRef,
POINTER(SSLCipherSuite),
POINTER(c_size_t)
]
Security.SSLGetEnabledCiphers.restype = OSStatus
Security.SSLGetNegotiatedCipher.argtypes = [
SSLContextRef,
POINTER(SSLCipherSuite)
]
Security.SSLGetNegotiatedCipher.restype = OSStatus
Security.SSLGetNegotiatedProtocolVersion.argtypes = [
SSLContextRef,
POINTER(SSLProtocol)
]
Security.SSLGetNegotiatedProtocolVersion.restype = OSStatus
Security.SSLCopyPeerTrust.argtypes = [
SSLContextRef,
POINTER(SecTrustRef)
]
Security.SSLCopyPeerTrust.restype = OSStatus
Security.SecTrustSetAnchorCertificates.argtypes = [
SecTrustRef,
CFArrayRef
]
Security.SecTrustSetAnchorCertificates.restype = OSStatus
Security.SecTrustSetAnchorCertificatesOnly.argstypes = [
SecTrustRef,
Boolean
]
Security.SecTrustSetAnchorCertificatesOnly.restype = OSStatus
Security.SecTrustEvaluate.argtypes = [
SecTrustRef,
POINTER(SecTrustResultType)
]
Security.SecTrustEvaluate.restype = OSStatus
Security.SecTrustGetCertificateCount.argtypes = [
SecTrustRef
]
Security.SecTrustGetCertificateCount.restype = CFIndex
Security.SecTrustGetCertificateAtIndex.argtypes = [
SecTrustRef,
CFIndex
]
Security.SecTrustGetCertificateAtIndex.restype = SecCertificateRef
Security.SSLCreateContext.argtypes = [
CFAllocatorRef,
SSLProtocolSide,
SSLConnectionType
]
Security.SSLCreateContext.restype = SSLContextRef
Security.SSLSetSessionOption.argtypes = [
SSLContextRef,
SSLSessionOption,
Boolean
]
Security.SSLSetSessionOption.restype = OSStatus
Security.SSLSetProtocolVersionMin.argtypes = [
SSLContextRef,
SSLProtocol
]
Security.SSLSetProtocolVersionMin.restype = OSStatus
Security.SSLSetProtocolVersionMax.argtypes = [
SSLContextRef,
SSLProtocol
]
Security.SSLSetProtocolVersionMax.restype = OSStatus
Security.SecCopyErrorMessageString.argtypes = [
OSStatus,
c_void_p
]
Security.SecCopyErrorMessageString.restype = CFStringRef
Security.SSLReadFunc = SSLReadFunc
Security.SSLWriteFunc = SSLWriteFunc
Security.SSLContextRef = SSLContextRef
Security.SSLProtocol = SSLProtocol
Security.SSLCipherSuite = SSLCipherSuite
Security.SecIdentityRef = SecIdentityRef
Security.SecKeychainRef = SecKeychainRef
Security.SecTrustRef = SecTrustRef
Security.SecTrustResultType = SecTrustResultType
Security.SecExternalFormat = SecExternalFormat
Security.OSStatus = OSStatus
Security.kSecImportExportPassphrase = CFStringRef.in_dll(
Security, 'kSecImportExportPassphrase'
)
Security.kSecImportItemIdentity = CFStringRef.in_dll(
Security, 'kSecImportItemIdentity'
)
# CoreFoundation time!
CoreFoundation.CFRetain.argtypes = [
CFTypeRef
]
CoreFoundation.CFRetain.restype = CFTypeRef
CoreFoundation.CFRelease.argtypes = [
CFTypeRef
]
CoreFoundation.CFRelease.restype = None
CoreFoundation.CFGetTypeID.argtypes = [
CFTypeRef
]
CoreFoundation.CFGetTypeID.restype = CFTypeID
CoreFoundation.CFStringCreateWithCString.argtypes = [
CFAllocatorRef,
c_char_p,
CFStringEncoding
]
CoreFoundation.CFStringCreateWithCString.restype = CFStringRef
CoreFoundation.CFStringGetCStringPtr.argtypes = [
CFStringRef,
CFStringEncoding
]
CoreFoundation.CFStringGetCStringPtr.restype = c_char_p
CoreFoundation.CFStringGetCString.argtypes = [
CFStringRef,
c_char_p,
CFIndex,
CFStringEncoding
]
CoreFoundation.CFStringGetCString.restype = c_bool
CoreFoundation.CFDataCreate.argtypes = [
CFAllocatorRef,
c_char_p,
CFIndex
]
CoreFoundation.CFDataCreate.restype = CFDataRef
CoreFoundation.CFDataGetLength.argtypes = [
CFDataRef
]
CoreFoundation.CFDataGetLength.restype = CFIndex
CoreFoundation.CFDataGetBytePtr.argtypes = [
CFDataRef
]
CoreFoundation.CFDataGetBytePtr.restype = c_void_p
CoreFoundation.CFDictionaryCreate.argtypes = [
CFAllocatorRef,
POINTER(CFTypeRef),
POINTER(CFTypeRef),
CFIndex,
CFDictionaryKeyCallBacks,
CFDictionaryValueCallBacks
]
CoreFoundation.CFDictionaryCreate.restype = CFDictionaryRef
CoreFoundation.CFDictionaryGetValue.argtypes = [
CFDictionaryRef,
CFTypeRef
]
CoreFoundation.CFDictionaryGetValue.restype = CFTypeRef
CoreFoundation.CFArrayCreate.argtypes = [
CFAllocatorRef,
POINTER(CFTypeRef),
CFIndex,
CFArrayCallBacks,
]
CoreFoundation.CFArrayCreate.restype = CFArrayRef
CoreFoundation.CFArrayCreateMutable.argtypes = [
CFAllocatorRef,
CFIndex,
CFArrayCallBacks
]
CoreFoundation.CFArrayCreateMutable.restype = CFMutableArrayRef
CoreFoundation.CFArrayAppendValue.argtypes = [
CFMutableArrayRef,
c_void_p
]
CoreFoundation.CFArrayAppendValue.restype = None
CoreFoundation.CFArrayGetCount.argtypes = [
CFArrayRef
]
CoreFoundation.CFArrayGetCount.restype = CFIndex
CoreFoundation.CFArrayGetValueAtIndex.argtypes = [
CFArrayRef,
CFIndex
]
CoreFoundation.CFArrayGetValueAtIndex.restype = c_void_p
CoreFoundation.kCFAllocatorDefault = CFAllocatorRef.in_dll(
CoreFoundation, 'kCFAllocatorDefault'
)
CoreFoundation.kCFTypeArrayCallBacks = c_void_p.in_dll(CoreFoundation, 'kCFTypeArrayCallBacks')
CoreFoundation.kCFTypeDictionaryKeyCallBacks = c_void_p.in_dll(
CoreFoundation, 'kCFTypeDictionaryKeyCallBacks'
)
CoreFoundation.kCFTypeDictionaryValueCallBacks = c_void_p.in_dll(
CoreFoundation, 'kCFTypeDictionaryValueCallBacks'
)
CoreFoundation.CFTypeRef = CFTypeRef
CoreFoundation.CFArrayRef = CFArrayRef
CoreFoundation.CFStringRef = CFStringRef
CoreFoundation.CFDictionaryRef = CFDictionaryRef
except (AttributeError):
raise ImportError('Error initializing ctypes')
class CFConst(object):
"""
A class object that acts as essentially a namespace for CoreFoundation
constants.
"""
kCFStringEncodingUTF8 = CFStringEncoding(0x08000100)
class SecurityConst(object):
"""
A class object that acts as essentially a namespace for Security constants.
"""
kSSLSessionOptionBreakOnServerAuth = 0
kSSLProtocol2 = 1
kSSLProtocol3 = 2
kTLSProtocol1 = 4
kTLSProtocol11 = 7
kTLSProtocol12 = 8
kSSLClientSide = 1
kSSLStreamType = 0
kSecFormatPEMSequence = 10
kSecTrustResultInvalid = 0
kSecTrustResultProceed = 1
# This gap is present on purpose: this was kSecTrustResultConfirm, which
# is deprecated.
kSecTrustResultDeny = 3
kSecTrustResultUnspecified = 4
kSecTrustResultRecoverableTrustFailure = 5
kSecTrustResultFatalTrustFailure = 6
kSecTrustResultOtherError = 7
errSSLProtocol = -9800
errSSLWouldBlock = -9803
errSSLClosedGraceful = -9805
errSSLClosedNoNotify = -9816
errSSLClosedAbort = -9806
errSSLXCertChainInvalid = -9807
errSSLCrypto = -9809
errSSLInternal = -9810
errSSLCertExpired = -9814
errSSLCertNotYetValid = -9815
errSSLUnknownRootCert = -9812
errSSLNoRootCert = -9813
errSSLHostNameMismatch = -9843
errSSLPeerHandshakeFail = -9824
errSSLPeerUserCancelled = -9839
errSSLWeakPeerEphemeralDHKey = -9850
errSSLServerAuthCompleted = -9841
errSSLRecordOverflow = -9847
errSecVerifyFailed = -67808
errSecNoTrustSettings = -25263
errSecItemNotFound = -25300
errSecInvalidTrustSettings = -25262
# Cipher suites. We only pick the ones our default cipher string allows.
TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 = 0xC02C
TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 = 0xC030
TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 = 0xC02B
TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 = 0xC02F
TLS_DHE_DSS_WITH_AES_256_GCM_SHA384 = 0x00A3
TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 = 0x009F
TLS_DHE_DSS_WITH_AES_128_GCM_SHA256 = 0x00A2
TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 = 0x009E
TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384 = 0xC024
TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 = 0xC028
TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA = 0xC00A
TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA = 0xC014
TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 = 0x006B
TLS_DHE_DSS_WITH_AES_256_CBC_SHA256 = 0x006A
TLS_DHE_RSA_WITH_AES_256_CBC_SHA = 0x0039
TLS_DHE_DSS_WITH_AES_256_CBC_SHA = 0x0038
TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256 = 0xC023
TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 = 0xC027
TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA = 0xC009
TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA = 0xC013
TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 = 0x0067
TLS_DHE_DSS_WITH_AES_128_CBC_SHA256 = 0x0040
TLS_DHE_RSA_WITH_AES_128_CBC_SHA = 0x0033
TLS_DHE_DSS_WITH_AES_128_CBC_SHA = 0x0032
TLS_RSA_WITH_AES_256_GCM_SHA384 = 0x009D
TLS_RSA_WITH_AES_128_GCM_SHA256 = 0x009C
TLS_RSA_WITH_AES_256_CBC_SHA256 = 0x003D
TLS_RSA_WITH_AES_128_CBC_SHA256 = 0x003C
TLS_RSA_WITH_AES_256_CBC_SHA = 0x0035
TLS_RSA_WITH_AES_128_CBC_SHA = 0x002F
TLS_AES_128_GCM_SHA256 = 0x1301
TLS_AES_256_GCM_SHA384 = 0x1302
TLS_CHACHA20_POLY1305_SHA256 = 0x1303
pip/_vendor/urllib3/contrib/_securetransport/__init__.py 0000644 00000000000 14751155150 0017511 0 ustar 00 pip/_vendor/urllib3/contrib/pyopenssl.py 0000644 00000035772 14751155150 0014434 0 ustar 00 """
SSL with SNI_-support for Python 2. Follow these instructions if you would
like to verify SSL certificates in Python 2. Note, the default libraries do
*not* do certificate checking; you need to do additional work to validate
certificates yourself.
This needs the following packages installed:
* pyOpenSSL (tested with 16.0.0)
* cryptography (minimum 1.3.4, from pyopenssl)
* idna (minimum 2.0, from cryptography)
However, pyopenssl depends on cryptography, which depends on idna, so while we
use all three directly here we end up having relatively few packages required.
You can install them with the following command:
pip install pyopenssl cryptography idna
To activate certificate checking, call
:func:`~urllib3.contrib.pyopenssl.inject_into_urllib3` from your Python code
before you begin making HTTP requests. This can be done in a ``sitecustomize``
module, or at any other time before your application begins using ``urllib3``,
like this::
try:
import urllib3.contrib.pyopenssl
urllib3.contrib.pyopenssl.inject_into_urllib3()
except ImportError:
pass
Now you can use :mod:`urllib3` as you normally would, and it will support SNI
when the required modules are installed.
Activating this module also has the positive side effect of disabling SSL/TLS
compression in Python 2 (see `CRIME attack`_).
If you want to configure the default list of supported cipher suites, you can
set the ``urllib3.contrib.pyopenssl.DEFAULT_SSL_CIPHER_LIST`` variable.
.. _sni: https://en.wikipedia.org/wiki/Server_Name_Indication
.. _crime attack: https://en.wikipedia.org/wiki/CRIME_(security_exploit)
"""
from __future__ import absolute_import
import OpenSSL.SSL
from cryptography import x509
from cryptography.hazmat.backends.openssl import backend as openssl_backend
from cryptography.hazmat.backends.openssl.x509 import _Certificate
from socket import timeout, error as SocketError
from io import BytesIO
try: # Platform-specific: Python 2
from socket import _fileobject
except ImportError: # Platform-specific: Python 3
_fileobject = None
from ..packages.backports.makefile import backport_makefile
import logging
import ssl
from ..packages import six
import sys
from .. import util
__all__ = ['inject_into_urllib3', 'extract_from_urllib3']
# SNI always works.
HAS_SNI = True
# Map from urllib3 to PyOpenSSL compatible parameter-values.
_openssl_versions = {
ssl.PROTOCOL_SSLv23: OpenSSL.SSL.SSLv23_METHOD,
ssl.PROTOCOL_TLSv1: OpenSSL.SSL.TLSv1_METHOD,
}
if hasattr(ssl, 'PROTOCOL_TLSv1_1') and hasattr(OpenSSL.SSL, 'TLSv1_1_METHOD'):
_openssl_versions[ssl.PROTOCOL_TLSv1_1] = OpenSSL.SSL.TLSv1_1_METHOD
if hasattr(ssl, 'PROTOCOL_TLSv1_2') and hasattr(OpenSSL.SSL, 'TLSv1_2_METHOD'):
_openssl_versions[ssl.PROTOCOL_TLSv1_2] = OpenSSL.SSL.TLSv1_2_METHOD
try:
_openssl_versions.update({ssl.PROTOCOL_SSLv3: OpenSSL.SSL.SSLv3_METHOD})
except AttributeError:
pass
_stdlib_to_openssl_verify = {
ssl.CERT_NONE: OpenSSL.SSL.VERIFY_NONE,
ssl.CERT_OPTIONAL: OpenSSL.SSL.VERIFY_PEER,
ssl.CERT_REQUIRED:
OpenSSL.SSL.VERIFY_PEER + OpenSSL.SSL.VERIFY_FAIL_IF_NO_PEER_CERT,
}
_openssl_to_stdlib_verify = dict(
(v, k) for k, v in _stdlib_to_openssl_verify.items()
)
# OpenSSL will only write 16K at a time
SSL_WRITE_BLOCKSIZE = 16384
orig_util_HAS_SNI = util.HAS_SNI
orig_util_SSLContext = util.ssl_.SSLContext
log = logging.getLogger(__name__)
def inject_into_urllib3():
'Monkey-patch urllib3 with PyOpenSSL-backed SSL-support.'
_validate_dependencies_met()
util.ssl_.SSLContext = PyOpenSSLContext
util.HAS_SNI = HAS_SNI
util.ssl_.HAS_SNI = HAS_SNI
util.IS_PYOPENSSL = True
util.ssl_.IS_PYOPENSSL = True
def extract_from_urllib3():
'Undo monkey-patching by :func:`inject_into_urllib3`.'
util.ssl_.SSLContext = orig_util_SSLContext
util.HAS_SNI = orig_util_HAS_SNI
util.ssl_.HAS_SNI = orig_util_HAS_SNI
util.IS_PYOPENSSL = False
util.ssl_.IS_PYOPENSSL = False
def _validate_dependencies_met():
"""
Verifies that PyOpenSSL's package-level dependencies have been met.
Throws `ImportError` if they are not met.
"""
# Method added in `cryptography==1.1`; not available in older versions
from cryptography.x509.extensions import Extensions
if getattr(Extensions, "get_extension_for_class", None) is None:
raise ImportError("'cryptography' module missing required functionality. "
"Try upgrading to v1.3.4 or newer.")
# pyOpenSSL 0.14 and above use cryptography for OpenSSL bindings. The _x509
# attribute is only present on those versions.
from OpenSSL.crypto import X509
x509 = X509()
if getattr(x509, "_x509", None) is None:
raise ImportError("'pyOpenSSL' module missing required functionality. "
"Try upgrading to v0.14 or newer.")
def _dnsname_to_stdlib(name):
"""
Converts a dNSName SubjectAlternativeName field to the form used by the
standard library on the given Python version.
Cryptography produces a dNSName as a unicode string that was idna-decoded
from ASCII bytes. We need to idna-encode that string to get it back, and
then on Python 3 we also need to convert to unicode via UTF-8 (the stdlib
uses PyUnicode_FromStringAndSize on it, which decodes via UTF-8).
"""
def idna_encode(name):
"""
Borrowed wholesale from the Python Cryptography Project. It turns out
that we can't just safely call `idna.encode`: it can explode for
wildcard names. This avoids that problem.
"""
import idna
for prefix in [u'*.', u'.']:
if name.startswith(prefix):
name = name[len(prefix):]
return prefix.encode('ascii') + idna.encode(name)
return idna.encode(name)
name = idna_encode(name)
if sys.version_info >= (3, 0):
name = name.decode('utf-8')
return name
def get_subj_alt_name(peer_cert):
"""
Given an PyOpenSSL certificate, provides all the subject alternative names.
"""
# Pass the cert to cryptography, which has much better APIs for this.
if hasattr(peer_cert, "to_cryptography"):
cert = peer_cert.to_cryptography()
else:
# This is technically using private APIs, but should work across all
# relevant versions before PyOpenSSL got a proper API for this.
cert = _Certificate(openssl_backend, peer_cert._x509)
# We want to find the SAN extension. Ask Cryptography to locate it (it's
# faster than looping in Python)
try:
ext = cert.extensions.get_extension_for_class(
x509.SubjectAlternativeName
).value
except x509.ExtensionNotFound:
# No such extension, return the empty list.
return []
except (x509.DuplicateExtension, x509.UnsupportedExtension,
x509.UnsupportedGeneralNameType, UnicodeError) as e:
# A problem has been found with the quality of the certificate. Assume
# no SAN field is present.
log.warning(
"A problem was encountered with the certificate that prevented "
"urllib3 from finding the SubjectAlternativeName field. This can "
"affect certificate validation. The error was %s",
e,
)
return []
# We want to return dNSName and iPAddress fields. We need to cast the IPs
# back to strings because the match_hostname function wants them as
# strings.
# Sadly the DNS names need to be idna encoded and then, on Python 3, UTF-8
# decoded. This is pretty frustrating, but that's what the standard library
# does with certificates, and so we need to attempt to do the same.
names = [
('DNS', _dnsname_to_stdlib(name))
for name in ext.get_values_for_type(x509.DNSName)
]
names.extend(
('IP Address', str(name))
for name in ext.get_values_for_type(x509.IPAddress)
)
return names
class WrappedSocket(object):
'''API-compatibility wrapper for Python OpenSSL's Connection-class.
Note: _makefile_refs, _drop() and _reuse() are needed for the garbage
collector of pypy.
'''
def __init__(self, connection, socket, suppress_ragged_eofs=True):
self.connection = connection
self.socket = socket
self.suppress_ragged_eofs = suppress_ragged_eofs
self._makefile_refs = 0
self._closed = False
def fileno(self):
return self.socket.fileno()
# Copy-pasted from Python 3.5 source code
def _decref_socketios(self):
if self._makefile_refs > 0:
self._makefile_refs -= 1
if self._closed:
self.close()
def recv(self, *args, **kwargs):
try:
data = self.connection.recv(*args, **kwargs)
except OpenSSL.SSL.SysCallError as e:
if self.suppress_ragged_eofs and e.args == (-1, 'Unexpected EOF'):
return b''
else:
raise SocketError(str(e))
except OpenSSL.SSL.ZeroReturnError as e:
if self.connection.get_shutdown() == OpenSSL.SSL.RECEIVED_SHUTDOWN:
return b''
else:
raise
except OpenSSL.SSL.WantReadError:
rd = util.wait_for_read(self.socket, self.socket.gettimeout())
if not rd:
raise timeout('The read operation timed out')
else:
return self.recv(*args, **kwargs)
else:
return data
def recv_into(self, *args, **kwargs):
try:
return self.connection.recv_into(*args, **kwargs)
except OpenSSL.SSL.SysCallError as e:
if self.suppress_ragged_eofs and e.args == (-1, 'Unexpected EOF'):
return 0
else:
raise SocketError(str(e))
except OpenSSL.SSL.ZeroReturnError as e:
if self.connection.get_shutdown() == OpenSSL.SSL.RECEIVED_SHUTDOWN:
return 0
else:
raise
except OpenSSL.SSL.WantReadError:
rd = util.wait_for_read(self.socket, self.socket.gettimeout())
if not rd:
raise timeout('The read operation timed out')
else:
return self.recv_into(*args, **kwargs)
def settimeout(self, timeout):
return self.socket.settimeout(timeout)
def _send_until_done(self, data):
while True:
try:
return self.connection.send(data)
except OpenSSL.SSL.WantWriteError:
wr = util.wait_for_write(self.socket, self.socket.gettimeout())
if not wr:
raise timeout()
continue
except OpenSSL.SSL.SysCallError as e:
raise SocketError(str(e))
def sendall(self, data):
total_sent = 0
while total_sent < len(data):
sent = self._send_until_done(data[total_sent:total_sent + SSL_WRITE_BLOCKSIZE])
total_sent += sent
def shutdown(self):
# FIXME rethrow compatible exceptions should we ever use this
self.connection.shutdown()
def close(self):
if self._makefile_refs < 1:
try:
self._closed = True
return self.connection.close()
except OpenSSL.SSL.Error:
return
else:
self._makefile_refs -= 1
def getpeercert(self, binary_form=False):
x509 = self.connection.get_peer_certificate()
if not x509:
return x509
if binary_form:
return OpenSSL.crypto.dump_certificate(
OpenSSL.crypto.FILETYPE_ASN1,
x509)
return {
'subject': (
(('commonName', x509.get_subject().CN),),
),
'subjectAltName': get_subj_alt_name(x509)
}
def _reuse(self):
self._makefile_refs += 1
def _drop(self):
if self._makefile_refs < 1:
self.close()
else:
self._makefile_refs -= 1
if _fileobject: # Platform-specific: Python 2
def makefile(self, mode, bufsize=-1):
self._makefile_refs += 1
return _fileobject(self, mode, bufsize, close=True)
else: # Platform-specific: Python 3
makefile = backport_makefile
WrappedSocket.makefile = makefile
class PyOpenSSLContext(object):
"""
I am a wrapper class for the PyOpenSSL ``Context`` object. I am responsible
for translating the interface of the standard library ``SSLContext`` object
to calls into PyOpenSSL.
"""
def __init__(self, protocol):
self.protocol = _openssl_versions[protocol]
self._ctx = OpenSSL.SSL.Context(self.protocol)
self._options = 0
self.check_hostname = False
@property
def options(self):
return self._options
@options.setter
def options(self, value):
self._options = value
self._ctx.set_options(value)
@property
def verify_mode(self):
return _openssl_to_stdlib_verify[self._ctx.get_verify_mode()]
@verify_mode.setter
def verify_mode(self, value):
self._ctx.set_verify(
_stdlib_to_openssl_verify[value],
_verify_callback
)
def set_default_verify_paths(self):
self._ctx.set_default_verify_paths()
def set_ciphers(self, ciphers):
if isinstance(ciphers, six.text_type):
ciphers = ciphers.encode('utf-8')
self._ctx.set_cipher_list(ciphers)
def load_verify_locations(self, cafile=None, capath=None, cadata=None):
if cafile is not None:
cafile = cafile.encode('utf-8')
if capath is not None:
capath = capath.encode('utf-8')
self._ctx.load_verify_locations(cafile, capath)
if cadata is not None:
self._ctx.load_verify_locations(BytesIO(cadata))
def load_cert_chain(self, certfile, keyfile=None, password=None):
self._ctx.use_certificate_file(certfile)
if password is not None:
self._ctx.set_passwd_cb(lambda max_length, prompt_twice, userdata: password)
self._ctx.use_privatekey_file(keyfile or certfile)
def wrap_socket(self, sock, server_side=False,
do_handshake_on_connect=True, suppress_ragged_eofs=True,
server_hostname=None):
cnx = OpenSSL.SSL.Connection(self._ctx, sock)
if isinstance(server_hostname, six.text_type): # Platform-specific: Python 3
server_hostname = server_hostname.encode('utf-8')
if server_hostname is not None:
cnx.set_tlsext_host_name(server_hostname)
cnx.set_connect_state()
while True:
try:
cnx.do_handshake()
except OpenSSL.SSL.WantReadError:
rd = util.wait_for_read(sock, sock.gettimeout())
if not rd:
raise timeout('select timed out')
continue
except OpenSSL.SSL.Error as e:
raise ssl.SSLError('bad handshake: %r' % e)
break
return WrappedSocket(cnx, sock)
def _verify_callback(cnx, x509, err_no, err_depth, return_code):
return err_no == 0
pip/_vendor/urllib3/contrib/__init__.py 0000644 00000000000 14751155150 0014107 0 ustar 00 pip/_vendor/urllib3/util/__init__.py 0000644 00000002024 14751155150 0013434 0 ustar 00 from __future__ import absolute_import
# For backwards compatibility, provide imports that used to be here.
from .connection import is_connection_dropped
from .request import make_headers
from .response import is_fp_closed
from .ssl_ import (
SSLContext,
HAS_SNI,
IS_PYOPENSSL,
IS_SECURETRANSPORT,
assert_fingerprint,
resolve_cert_reqs,
resolve_ssl_version,
ssl_wrap_socket,
)
from .timeout import (
current_time,
Timeout,
)
from .retry import Retry
from .url import (
get_host,
parse_url,
split_first,
Url,
)
from .wait import (
wait_for_read,
wait_for_write
)
__all__ = (
'HAS_SNI',
'IS_PYOPENSSL',
'IS_SECURETRANSPORT',
'SSLContext',
'Retry',
'Timeout',
'Url',
'assert_fingerprint',
'current_time',
'is_connection_dropped',
'is_fp_closed',
'get_host',
'parse_url',
'make_headers',
'resolve_cert_reqs',
'resolve_ssl_version',
'split_first',
'ssl_wrap_socket',
'wait_for_read',
'wait_for_write'
)
pip/_vendor/urllib3/util/response.py 0000644 00000004447 14751155150 0013546 0 ustar 00 from __future__ import absolute_import
from ..packages.six.moves import http_client as httplib
from ..exceptions import HeaderParsingError
def is_fp_closed(obj):
"""
Checks whether a given file-like object is closed.
:param obj:
The file-like object to check.
"""
try:
# Check `isclosed()` first, in case Python3 doesn't set `closed`.
# GH Issue #928
return obj.isclosed()
except AttributeError:
pass
try:
# Check via the official file-like-object way.
return obj.closed
except AttributeError:
pass
try:
# Check if the object is a container for another file-like object that
# gets released on exhaustion (e.g. HTTPResponse).
return obj.fp is None
except AttributeError:
pass
raise ValueError("Unable to determine whether fp is closed.")
def assert_header_parsing(headers):
"""
Asserts whether all headers have been successfully parsed.
Extracts encountered errors from the result of parsing headers.
Only works on Python 3.
:param headers: Headers to verify.
:type headers: `httplib.HTTPMessage`.
:raises urllib3.exceptions.HeaderParsingError:
If parsing errors are found.
"""
# This will fail silently if we pass in the wrong kind of parameter.
# To make debugging easier add an explicit check.
if not isinstance(headers, httplib.HTTPMessage):
raise TypeError('expected httplib.Message, got {0}.'.format(
type(headers)))
defects = getattr(headers, 'defects', None)
get_payload = getattr(headers, 'get_payload', None)
unparsed_data = None
if get_payload: # Platform-specific: Python 3.
unparsed_data = get_payload()
if defects or unparsed_data:
raise HeaderParsingError(defects=defects, unparsed_data=unparsed_data)
def is_response_to_head(response):
"""
Checks whether the request of a response has been a HEAD-request.
Handles the quirks of AppEngine.
:param conn:
:type conn: :class:`httplib.HTTPResponse`
"""
# FIXME: Can we do this somehow without accessing private httplib _method?
method = response._method
if isinstance(method, int): # Platform-specific: Appengine
return method == 3
return method.upper() == 'HEAD'
pip/_vendor/urllib3/util/wait.py 0000644 00000002653 14751155150 0012651 0 ustar 00 from .selectors import (
HAS_SELECT,
DefaultSelector,
EVENT_READ,
EVENT_WRITE
)
def _wait_for_io_events(socks, events, timeout=None):
""" Waits for IO events to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be interacted with immediately. """
if not HAS_SELECT:
raise ValueError('Platform does not have a selector')
if not isinstance(socks, list):
# Probably just a single socket.
if hasattr(socks, "fileno"):
socks = [socks]
# Otherwise it might be a non-list iterable.
else:
socks = list(socks)
with DefaultSelector() as selector:
for sock in socks:
selector.register(sock, events)
return [key[0].fileobj for key in
selector.select(timeout) if key[1] & events]
def wait_for_read(socks, timeout=None):
""" Waits for reading to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be read from immediately. """
return _wait_for_io_events(socks, EVENT_READ, timeout)
def wait_for_write(socks, timeout=None):
""" Waits for writing to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be written to immediately. """
return _wait_for_io_events(socks, EVENT_WRITE, timeout)
pip/_vendor/urllib3/util/selectors.py 0000644 00000051233 14751155150 0013706 0 ustar 00 # Backport of selectors.py from Python 3.5+ to support Python < 3.4
# Also has the behavior specified in PEP 475 which is to retry syscalls
# in the case of an EINTR error. This module is required because selectors34
# does not follow this behavior and instead returns that no dile descriptor
# events have occurred rather than retry the syscall. The decision to drop
# support for select.devpoll is made to maintain 100% test coverage.
import errno
import math
import select
import socket
import sys
import time
from collections import namedtuple, Mapping
try:
monotonic = time.monotonic
except (AttributeError, ImportError): # Python 3.3<
monotonic = time.time
EVENT_READ = (1 << 0)
EVENT_WRITE = (1 << 1)
HAS_SELECT = True # Variable that shows whether the platform has a selector.
_SYSCALL_SENTINEL = object() # Sentinel in case a system call returns None.
_DEFAULT_SELECTOR = None
class SelectorError(Exception):
def __init__(self, errcode):
super(SelectorError, self).__init__()
self.errno = errcode
def __repr__(self):
return "<SelectorError errno={0}>".format(self.errno)
def __str__(self):
return self.__repr__()
def _fileobj_to_fd(fileobj):
""" Return a file descriptor from a file object. If
given an integer will simply return that integer back. """
if isinstance(fileobj, int):
fd = fileobj
else:
try:
fd = int(fileobj.fileno())
except (AttributeError, TypeError, ValueError):
raise ValueError("Invalid file object: {0!r}".format(fileobj))
if fd < 0:
raise ValueError("Invalid file descriptor: {0}".format(fd))
return fd
# Determine which function to use to wrap system calls because Python 3.5+
# already handles the case when system calls are interrupted.
if sys.version_info >= (3, 5):
def _syscall_wrapper(func, _, *args, **kwargs):
""" This is the short-circuit version of the below logic
because in Python 3.5+ all system calls automatically restart
and recalculate their timeouts. """
try:
return func(*args, **kwargs)
except (OSError, IOError, select.error) as e:
errcode = None
if hasattr(e, "errno"):
errcode = e.errno
raise SelectorError(errcode)
else:
def _syscall_wrapper(func, recalc_timeout, *args, **kwargs):
""" Wrapper function for syscalls that could fail due to EINTR.
All functions should be retried if there is time left in the timeout
in accordance with PEP 475. """
timeout = kwargs.get("timeout", None)
if timeout is None:
expires = None
recalc_timeout = False
else:
timeout = float(timeout)
if timeout < 0.0: # Timeout less than 0 treated as no timeout.
expires = None
else:
expires = monotonic() + timeout
args = list(args)
if recalc_timeout and "timeout" not in kwargs:
raise ValueError(
"Timeout must be in args or kwargs to be recalculated")
result = _SYSCALL_SENTINEL
while result is _SYSCALL_SENTINEL:
try:
result = func(*args, **kwargs)
# OSError is thrown by select.select
# IOError is thrown by select.epoll.poll
# select.error is thrown by select.poll.poll
# Aren't we thankful for Python 3.x rework for exceptions?
except (OSError, IOError, select.error) as e:
# select.error wasn't a subclass of OSError in the past.
errcode = None
if hasattr(e, "errno"):
errcode = e.errno
elif hasattr(e, "args"):
errcode = e.args[0]
# Also test for the Windows equivalent of EINTR.
is_interrupt = (errcode == errno.EINTR or (hasattr(errno, "WSAEINTR") and
errcode == errno.WSAEINTR))
if is_interrupt:
if expires is not None:
current_time = monotonic()
if current_time > expires:
raise OSError(errno=errno.ETIMEDOUT)
if recalc_timeout:
if "timeout" in kwargs:
kwargs["timeout"] = expires - current_time
continue
if errcode:
raise SelectorError(errcode)
else:
raise
return result
SelectorKey = namedtuple('SelectorKey', ['fileobj', 'fd', 'events', 'data'])
class _SelectorMapping(Mapping):
""" Mapping of file objects to selector keys """
def __init__(self, selector):
self._selector = selector
def __len__(self):
return len(self._selector._fd_to_key)
def __getitem__(self, fileobj):
try:
fd = self._selector._fileobj_lookup(fileobj)
return self._selector._fd_to_key[fd]
except KeyError:
raise KeyError("{0!r} is not registered.".format(fileobj))
def __iter__(self):
return iter(self._selector._fd_to_key)
class BaseSelector(object):
""" Abstract Selector class
A selector supports registering file objects to be monitored
for specific I/O events.
A file object is a file descriptor or any object with a
`fileno()` method. An arbitrary object can be attached to the
file object which can be used for example to store context info,
a callback, etc.
A selector can use various implementations (select(), poll(), epoll(),
and kqueue()) depending on the platform. The 'DefaultSelector' class uses
the most efficient implementation for the current platform.
"""
def __init__(self):
# Maps file descriptors to keys.
self._fd_to_key = {}
# Read-only mapping returned by get_map()
self._map = _SelectorMapping(self)
def _fileobj_lookup(self, fileobj):
""" Return a file descriptor from a file object.
This wraps _fileobj_to_fd() to do an exhaustive
search in case the object is invalid but we still
have it in our map. Used by unregister() so we can
unregister an object that was previously registered
even if it is closed. It is also used by _SelectorMapping
"""
try:
return _fileobj_to_fd(fileobj)
except ValueError:
# Search through all our mapped keys.
for key in self._fd_to_key.values():
if key.fileobj is fileobj:
return key.fd
# Raise ValueError after all.
raise
def register(self, fileobj, events, data=None):
""" Register a file object for a set of events to monitor. """
if (not events) or (events & ~(EVENT_READ | EVENT_WRITE)):
raise ValueError("Invalid events: {0!r}".format(events))
key = SelectorKey(fileobj, self._fileobj_lookup(fileobj), events, data)
if key.fd in self._fd_to_key:
raise KeyError("{0!r} (FD {1}) is already registered"
.format(fileobj, key.fd))
self._fd_to_key[key.fd] = key
return key
def unregister(self, fileobj):
""" Unregister a file object from being monitored. """
try:
key = self._fd_to_key.pop(self._fileobj_lookup(fileobj))
except KeyError:
raise KeyError("{0!r} is not registered".format(fileobj))
# Getting the fileno of a closed socket on Windows errors with EBADF.
except socket.error as e: # Platform-specific: Windows.
if e.errno != errno.EBADF:
raise
else:
for key in self._fd_to_key.values():
if key.fileobj is fileobj:
self._fd_to_key.pop(key.fd)
break
else:
raise KeyError("{0!r} is not registered".format(fileobj))
return key
def modify(self, fileobj, events, data=None):
""" Change a registered file object monitored events and data. """
# NOTE: Some subclasses optimize this operation even further.
try:
key = self._fd_to_key[self._fileobj_lookup(fileobj)]
except KeyError:
raise KeyError("{0!r} is not registered".format(fileobj))
if events != key.events:
self.unregister(fileobj)
key = self.register(fileobj, events, data)
elif data != key.data:
# Use a shortcut to update the data.
key = key._replace(data=data)
self._fd_to_key[key.fd] = key
return key
def select(self, timeout=None):
""" Perform the actual selection until some monitored file objects
are ready or the timeout expires. """
raise NotImplementedError()
def close(self):
""" Close the selector. This must be called to ensure that all
underlying resources are freed. """
self._fd_to_key.clear()
self._map = None
def get_key(self, fileobj):
""" Return the key associated with a registered file object. """
mapping = self.get_map()
if mapping is None:
raise RuntimeError("Selector is closed")
try:
return mapping[fileobj]
except KeyError:
raise KeyError("{0!r} is not registered".format(fileobj))
def get_map(self):
""" Return a mapping of file objects to selector keys """
return self._map
def _key_from_fd(self, fd):
""" Return the key associated to a given file descriptor
Return None if it is not found. """
try:
return self._fd_to_key[fd]
except KeyError:
return None
def __enter__(self):
return self
def __exit__(self, *args):
self.close()
# Almost all platforms have select.select()
if hasattr(select, "select"):
class SelectSelector(BaseSelector):
""" Select-based selector. """
def __init__(self):
super(SelectSelector, self).__init__()
self._readers = set()
self._writers = set()
def register(self, fileobj, events, data=None):
key = super(SelectSelector, self).register(fileobj, events, data)
if events & EVENT_READ:
self._readers.add(key.fd)
if events & EVENT_WRITE:
self._writers.add(key.fd)
return key
def unregister(self, fileobj):
key = super(SelectSelector, self).unregister(fileobj)
self._readers.discard(key.fd)
self._writers.discard(key.fd)
return key
def _select(self, r, w, timeout=None):
""" Wrapper for select.select because timeout is a positional arg """
return select.select(r, w, [], timeout)
def select(self, timeout=None):
# Selecting on empty lists on Windows errors out.
if not len(self._readers) and not len(self._writers):
return []
timeout = None if timeout is None else max(timeout, 0.0)
ready = []
r, w, _ = _syscall_wrapper(self._select, True, self._readers,
self._writers, timeout)
r = set(r)
w = set(w)
for fd in r | w:
events = 0
if fd in r:
events |= EVENT_READ
if fd in w:
events |= EVENT_WRITE
key = self._key_from_fd(fd)
if key:
ready.append((key, events & key.events))
return ready
if hasattr(select, "poll"):
class PollSelector(BaseSelector):
""" Poll-based selector """
def __init__(self):
super(PollSelector, self).__init__()
self._poll = select.poll()
def register(self, fileobj, events, data=None):
key = super(PollSelector, self).register(fileobj, events, data)
event_mask = 0
if events & EVENT_READ:
event_mask |= select.POLLIN
if events & EVENT_WRITE:
event_mask |= select.POLLOUT
self._poll.register(key.fd, event_mask)
return key
def unregister(self, fileobj):
key = super(PollSelector, self).unregister(fileobj)
self._poll.unregister(key.fd)
return key
def _wrap_poll(self, timeout=None):
""" Wrapper function for select.poll.poll() so that
_syscall_wrapper can work with only seconds. """
if timeout is not None:
if timeout <= 0:
timeout = 0
else:
# select.poll.poll() has a resolution of 1 millisecond,
# round away from zero to wait *at least* timeout seconds.
timeout = math.ceil(timeout * 1e3)
result = self._poll.poll(timeout)
return result
def select(self, timeout=None):
ready = []
fd_events = _syscall_wrapper(self._wrap_poll, True, timeout=timeout)
for fd, event_mask in fd_events:
events = 0
if event_mask & ~select.POLLIN:
events |= EVENT_WRITE
if event_mask & ~select.POLLOUT:
events |= EVENT_READ
key = self._key_from_fd(fd)
if key:
ready.append((key, events & key.events))
return ready
if hasattr(select, "epoll"):
class EpollSelector(BaseSelector):
""" Epoll-based selector """
def __init__(self):
super(EpollSelector, self).__init__()
self._epoll = select.epoll()
def fileno(self):
return self._epoll.fileno()
def register(self, fileobj, events, data=None):
key = super(EpollSelector, self).register(fileobj, events, data)
events_mask = 0
if events & EVENT_READ:
events_mask |= select.EPOLLIN
if events & EVENT_WRITE:
events_mask |= select.EPOLLOUT
_syscall_wrapper(self._epoll.register, False, key.fd, events_mask)
return key
def unregister(self, fileobj):
key = super(EpollSelector, self).unregister(fileobj)
try:
_syscall_wrapper(self._epoll.unregister, False, key.fd)
except SelectorError:
# This can occur when the fd was closed since registry.
pass
return key
def select(self, timeout=None):
if timeout is not None:
if timeout <= 0:
timeout = 0.0
else:
# select.epoll.poll() has a resolution of 1 millisecond
# but luckily takes seconds so we don't need a wrapper
# like PollSelector. Just for better rounding.
timeout = math.ceil(timeout * 1e3) * 1e-3
timeout = float(timeout)
else:
timeout = -1.0 # epoll.poll() must have a float.
# We always want at least 1 to ensure that select can be called
# with no file descriptors registered. Otherwise will fail.
max_events = max(len(self._fd_to_key), 1)
ready = []
fd_events = _syscall_wrapper(self._epoll.poll, True,
timeout=timeout,
maxevents=max_events)
for fd, event_mask in fd_events:
events = 0
if event_mask & ~select.EPOLLIN:
events |= EVENT_WRITE
if event_mask & ~select.EPOLLOUT:
events |= EVENT_READ
key = self._key_from_fd(fd)
if key:
ready.append((key, events & key.events))
return ready
def close(self):
self._epoll.close()
super(EpollSelector, self).close()
if hasattr(select, "kqueue"):
class KqueueSelector(BaseSelector):
""" Kqueue / Kevent-based selector """
def __init__(self):
super(KqueueSelector, self).__init__()
self._kqueue = select.kqueue()
def fileno(self):
return self._kqueue.fileno()
def register(self, fileobj, events, data=None):
key = super(KqueueSelector, self).register(fileobj, events, data)
if events & EVENT_READ:
kevent = select.kevent(key.fd,
select.KQ_FILTER_READ,
select.KQ_EV_ADD)
_syscall_wrapper(self._kqueue.control, False, [kevent], 0, 0)
if events & EVENT_WRITE:
kevent = select.kevent(key.fd,
select.KQ_FILTER_WRITE,
select.KQ_EV_ADD)
_syscall_wrapper(self._kqueue.control, False, [kevent], 0, 0)
return key
def unregister(self, fileobj):
key = super(KqueueSelector, self).unregister(fileobj)
if key.events & EVENT_READ:
kevent = select.kevent(key.fd,
select.KQ_FILTER_READ,
select.KQ_EV_DELETE)
try:
_syscall_wrapper(self._kqueue.control, False, [kevent], 0, 0)
except SelectorError:
pass
if key.events & EVENT_WRITE:
kevent = select.kevent(key.fd,
select.KQ_FILTER_WRITE,
select.KQ_EV_DELETE)
try:
_syscall_wrapper(self._kqueue.control, False, [kevent], 0, 0)
except SelectorError:
pass
return key
def select(self, timeout=None):
if timeout is not None:
timeout = max(timeout, 0)
max_events = len(self._fd_to_key) * 2
ready_fds = {}
kevent_list = _syscall_wrapper(self._kqueue.control, True,
None, max_events, timeout)
for kevent in kevent_list:
fd = kevent.ident
event_mask = kevent.filter
events = 0
if event_mask == select.KQ_FILTER_READ:
events |= EVENT_READ
if event_mask == select.KQ_FILTER_WRITE:
events |= EVENT_WRITE
key = self._key_from_fd(fd)
if key:
if key.fd not in ready_fds:
ready_fds[key.fd] = (key, events & key.events)
else:
old_events = ready_fds[key.fd][1]
ready_fds[key.fd] = (key, (events | old_events) & key.events)
return list(ready_fds.values())
def close(self):
self._kqueue.close()
super(KqueueSelector, self).close()
if not hasattr(select, 'select'): # Platform-specific: AppEngine
HAS_SELECT = False
def _can_allocate(struct):
""" Checks that select structs can be allocated by the underlying
operating system, not just advertised by the select module. We don't
check select() because we'll be hopeful that most platforms that
don't have it available will not advertise it. (ie: GAE) """
try:
# select.poll() objects won't fail until used.
if struct == 'poll':
p = select.poll()
p.poll(0)
# All others will fail on allocation.
else:
getattr(select, struct)().close()
return True
except (OSError, AttributeError) as e:
return False
# Choose the best implementation, roughly:
# kqueue == epoll > poll > select. Devpoll not supported. (See above)
# select() also can't accept a FD > FD_SETSIZE (usually around 1024)
def DefaultSelector():
""" This function serves as a first call for DefaultSelector to
detect if the select module is being monkey-patched incorrectly
by eventlet, greenlet, and preserve proper behavior. """
global _DEFAULT_SELECTOR
if _DEFAULT_SELECTOR is None:
if _can_allocate('kqueue'):
_DEFAULT_SELECTOR = KqueueSelector
elif _can_allocate('epoll'):
_DEFAULT_SELECTOR = EpollSelector
elif _can_allocate('poll'):
_DEFAULT_SELECTOR = PollSelector
elif hasattr(select, 'select'):
_DEFAULT_SELECTOR = SelectSelector
else: # Platform-specific: AppEngine
raise ValueError('Platform does not have a selector')
return _DEFAULT_SELECTOR()
pip/_vendor/urllib3/util/connection.py 0000644 00000010215 14751155150 0014035 0 ustar 00 from __future__ import absolute_import
import socket
from .wait import wait_for_read
from .selectors import HAS_SELECT, SelectorError
def is_connection_dropped(conn): # Platform-specific
"""
Returns True if the connection is dropped and should be closed.
:param conn:
:class:`httplib.HTTPConnection` object.
Note: For platforms like AppEngine, this will always return ``False`` to
let the platform handle connection recycling transparently for us.
"""
sock = getattr(conn, 'sock', False)
if sock is False: # Platform-specific: AppEngine
return False
if sock is None: # Connection already closed (such as by httplib).
return True
if not HAS_SELECT:
return False
try:
return bool(wait_for_read(sock, timeout=0.0))
except SelectorError:
return True
# This function is copied from socket.py in the Python 2.7 standard
# library test suite. Added to its signature is only `socket_options`.
# One additional modification is that we avoid binding to IPv6 servers
# discovered in DNS if the system doesn't have IPv6 functionality.
def create_connection(address, timeout=socket._GLOBAL_DEFAULT_TIMEOUT,
source_address=None, socket_options=None):
"""Connect to *address* and return the socket object.
Convenience function. Connect to *address* (a 2-tuple ``(host,
port)``) and return the socket object. Passing the optional
*timeout* parameter will set the timeout on the socket instance
before attempting to connect. If no *timeout* is supplied, the
global default timeout setting returned by :func:`getdefaulttimeout`
is used. If *source_address* is set it must be a tuple of (host, port)
for the socket to bind as a source address before making the connection.
An host of '' or port 0 tells the OS to use the default.
"""
host, port = address
if host.startswith('['):
host = host.strip('[]')
err = None
# Using the value from allowed_gai_family() in the context of getaddrinfo lets
# us select whether to work with IPv4 DNS records, IPv6 records, or both.
# The original create_connection function always returns all records.
family = allowed_gai_family()
for res in socket.getaddrinfo(host, port, family, socket.SOCK_STREAM):
af, socktype, proto, canonname, sa = res
sock = None
try:
sock = socket.socket(af, socktype, proto)
# If provided, set socket level options before connecting.
_set_socket_options(sock, socket_options)
if timeout is not socket._GLOBAL_DEFAULT_TIMEOUT:
sock.settimeout(timeout)
if source_address:
sock.bind(source_address)
sock.connect(sa)
return sock
except socket.error as e:
err = e
if sock is not None:
sock.close()
sock = None
if err is not None:
raise err
raise socket.error("getaddrinfo returns an empty list")
def _set_socket_options(sock, options):
if options is None:
return
for opt in options:
sock.setsockopt(*opt)
def allowed_gai_family():
"""This function is designed to work in the context of
getaddrinfo, where family=socket.AF_UNSPEC is the default and
will perform a DNS search for both IPv6 and IPv4 records."""
family = socket.AF_INET
if HAS_IPV6:
family = socket.AF_UNSPEC
return family
def _has_ipv6(host):
""" Returns True if the system can bind an IPv6 address. """
sock = None
has_ipv6 = False
if socket.has_ipv6:
# has_ipv6 returns true if cPython was compiled with IPv6 support.
# It does not tell us if the system has IPv6 support enabled. To
# determine that we must bind to an IPv6 address.
# https://github.com/shazow/urllib3/pull/611
# https://bugs.python.org/issue658327
try:
sock = socket.socket(socket.AF_INET6)
sock.bind((host, 0))
has_ipv6 = True
except Exception:
pass
if sock:
sock.close()
return has_ipv6
HAS_IPV6 = _has_ipv6('::1')
pip/_vendor/urllib3/util/url.py 0000644 00000015216 14751155150 0012506 0 ustar 00 from __future__ import absolute_import
from collections import namedtuple
import re
from ..exceptions import LocationParseError
url_attrs = ['scheme', 'auth', 'host', 'port', 'path', 'query', 'fragment']
# We only want to normalize urls with an HTTP(S) scheme.
# urllib3 infers URLs without a scheme (None) to be http.
NORMALIZABLE_SCHEMES = ('http', 'https', None)
_contains_disallowed_url_pchar_re = re.compile('[\x00-\x20\x7f]')
from ..packages.six.moves.urllib.parse import quote
class Url(namedtuple('Url', url_attrs)):
"""
Datastructure for representing an HTTP URL. Used as a return value for
:func:`parse_url`. Both the scheme and host are normalized as they are
both case-insensitive according to RFC 3986.
"""
__slots__ = ()
def __new__(cls, scheme=None, auth=None, host=None, port=None, path=None,
query=None, fragment=None):
if path and not path.startswith('/'):
path = '/' + path
if scheme:
scheme = scheme.lower()
if host and scheme in NORMALIZABLE_SCHEMES:
host = host.lower()
return super(Url, cls).__new__(cls, scheme, auth, host, port, path,
query, fragment)
@property
def hostname(self):
"""For backwards-compatibility with urlparse. We're nice like that."""
return self.host
@property
def request_uri(self):
"""Absolute path including the query string."""
uri = self.path or '/'
if self.query is not None:
uri += '?' + self.query
return uri
@property
def netloc(self):
"""Network location including host and port"""
if self.port:
return '%s:%d' % (self.host, self.port)
return self.host
@property
def url(self):
"""
Convert self into a url
This function should more or less round-trip with :func:`.parse_url`. The
returned url may not be exactly the same as the url inputted to
:func:`.parse_url`, but it should be equivalent by the RFC (e.g., urls
with a blank port will have : removed).
Example: ::
>>> U = parse_url('http://google.com/mail/')
>>> U.url
'http://google.com/mail/'
>>> Url('http', 'username:password', 'host.com', 80,
... '/path', 'query', 'fragment').url
'http://username:password@host.com:80/path?query#fragment'
"""
scheme, auth, host, port, path, query, fragment = self
url = ''
# We use "is not None" we want things to happen with empty strings (or 0 port)
if scheme is not None:
url += scheme + '://'
if auth is not None:
url += auth + '@'
if host is not None:
url += host
if port is not None:
url += ':' + str(port)
if path is not None:
url += path
if query is not None:
url += '?' + query
if fragment is not None:
url += '#' + fragment
return url
def __str__(self):
return self.url
def split_first(s, delims):
"""
Given a string and an iterable of delimiters, split on the first found
delimiter. Return two split parts and the matched delimiter.
If not found, then the first part is the full input string.
Example::
>>> split_first('foo/bar?baz', '?/=')
('foo', 'bar?baz', '/')
>>> split_first('foo/bar?baz', '123')
('foo/bar?baz', '', None)
Scales linearly with number of delims. Not ideal for large number of delims.
"""
min_idx = None
min_delim = None
for d in delims:
idx = s.find(d)
if idx < 0:
continue
if min_idx is None or idx < min_idx:
min_idx = idx
min_delim = d
if min_idx is None or min_idx < 0:
return s, '', None
return s[:min_idx], s[min_idx + 1:], min_delim
def parse_url(url):
"""
Given a url, return a parsed :class:`.Url` namedtuple. Best-effort is
performed to parse incomplete urls. Fields not provided will be None.
Partly backwards-compatible with :mod:`urlparse`.
Example::
>>> parse_url('http://google.com/mail/')
Url(scheme='http', host='google.com', port=None, path='/mail/', ...)
>>> parse_url('google.com:80')
Url(scheme=None, host='google.com', port=80, path=None, ...)
>>> parse_url('/foo?bar')
Url(scheme=None, host=None, port=None, path='/foo', query='bar', ...)
"""
# While this code has overlap with stdlib's urlparse, it is much
# simplified for our needs and less annoying.
# Additionally, this implementations does silly things to be optimal
# on CPython.
if not url:
# Empty
return Url()
# Prevent CVE-2019-9740.
# adapted from https://github.com/python/cpython/pull/12755
url = _contains_disallowed_url_pchar_re.sub(lambda match: quote(match.group()), url)
scheme = None
auth = None
host = None
port = None
path = None
fragment = None
query = None
# Scheme
if '://' in url:
scheme, url = url.split('://', 1)
# Find the earliest Authority Terminator
# (http://tools.ietf.org/html/rfc3986#section-3.2)
url, path_, delim = split_first(url, ['/', '?', '#'])
if delim:
# Reassemble the path
path = delim + path_
# Auth
if '@' in url:
# Last '@' denotes end of auth part
auth, url = url.rsplit('@', 1)
# IPv6
if url and url[0] == '[':
host, url = url.split(']', 1)
host += ']'
# Port
if ':' in url:
_host, port = url.split(':', 1)
if not host:
host = _host
if port:
# If given, ports must be integers. No whitespace, no plus or
# minus prefixes, no non-integer digits such as ^2 (superscript).
if not port.isdigit():
raise LocationParseError(url)
try:
port = int(port)
except ValueError:
raise LocationParseError(url)
else:
# Blank ports are cool, too. (rfc3986#section-3.2.3)
port = None
elif not host and url:
host = url
if not path:
return Url(scheme, auth, host, port, path, query, fragment)
# Fragment
if '#' in path:
path, fragment = path.split('#', 1)
# Query
if '?' in path:
path, query = path.split('?', 1)
return Url(scheme, auth, host, port, path, query, fragment)
def get_host(url):
"""
Deprecated. Use :func:`parse_url` instead.
"""
p = parse_url(url)
return p.scheme or 'http', p.hostname, p.port
pip/_vendor/urllib3/util/__pycache__/url.cpython-36.opt-1.pyc 0000644 00000012430 14751155150 0017724 0 ustar 00 3
���e� � @ s� d dl mZ d dlmZ d dlZddlmZ dddd d
d d gZdZej d�Z
ddl m Z G dd� dede��Z
dd� Zdd� Zdd� ZdS )� )�absolute_import)�
namedtupleN� )�LocationParseError�scheme�auth�host�port�path�query�fragment�http�httpsz[ - ])�quotec s^ e Zd ZdZf Zd� fdd� Zedd� �Zedd� �Zed d
� �Z ed d � �Z
d
d� Z � Z S )�Urlz�
Datastructure for representing an HTTP URL. Used as a return value for
:func:`parse_url`. Both the scheme and host are normalized as they are
both case-insensitive according to RFC 3986.
Nc sV |r|j d� rd| }|r$|j� }|r8|tkr8|j� }tt| �j| |||||||�S )N�/)�
startswith�lower�NORMALIZABLE_SCHEMES�superr �__new__)�clsr r r r r
r r )� __class__� �/usr/lib/python3.6/url.pyr s z Url.__new__c C s | j S )z@For backwards-compatibility with urlparse. We're nice like that.)r )�selfr r r �hostname$ s z Url.hostnamec C s& | j pd}| jdk r"|d| j 7 }|S )z)Absolute path including the query string.r N�?)r
r )r Zurir r r � request_uri) s
zUrl.request_uric C s | j rd| j| j f S | jS )z(Network location including host and portz%s:%d)r r )r r r r �netloc3 s z
Url.netlocc C s� | \}}}}}}}d}|dk r*||d 7 }|dk r>||d 7 }|dk rN||7 }|dk rf|dt |� 7 }|dk rv||7 }|dk r�|d| 7 }|dk r�|d| 7 }|S )a�
Convert self into a url
This function should more or less round-trip with :func:`.parse_url`. The
returned url may not be exactly the same as the url inputted to
:func:`.parse_url`, but it should be equivalent by the RFC (e.g., urls
with a blank port will have : removed).
Example: ::
>>> U = parse_url('http://google.com/mail/')
>>> U.url
'http://google.com/mail/'
>>> Url('http', 'username:password', 'host.com', 80,
... '/path', 'query', 'fragment').url
'http://username:password@host.com:80/path?query#fragment'
� Nz://�@�:r �#)�str) r r r r r r
r r �urlr r r r% : s" zUrl.urlc C s | j S )N)r% )r r r r �__str__b s z Url.__str__)NNNNNNN)
�__name__�
__module__� __qualname__�__doc__� __slots__r �propertyr r r r% r& �
__classcell__r r )r r r s
(r c C sz d}d}x8|D ]0}| j |�}|dk r&q|dks6||k r|}|}qW |dksR|dk r\| ddfS | d|� | |d d� |fS )a�
Given a string and an iterable of delimiters, split on the first found
delimiter. Return two split parts and the matched delimiter.
If not found, then the first part is the full input string.
Example::
>>> split_first('foo/bar?baz', '?/=')
('foo', 'bar?baz', '/')
>>> split_first('foo/bar?baz', '123')
('foo/bar?baz', '', None)
Scales linearly with number of delims. Not ideal for large number of delims.
Nr r � )�find)�sZdelimsZmin_idxZ min_delim�d�idxr r r � split_firstf s
r3 c C s� | s
t � S tjdd� | �} d}d}d}d}d}d}d}d| krN| jdd�\}} t| dddg�\} }} | rp| | }d | kr�| jd d�\}} | r�| d
d kr�| jd d�\}} |d 7 }d
| k�r | jd
d�\}
}|s�|
}|�r|j� s�t| ��y t|�}W n t k
�r t| ��Y nX nd}n| �r.| �r.| }|�sHt |||||||�S d|k�rb|jdd�\}}d|k�r||jdd�\}}t |||||||�S )a:
Given a url, return a parsed :class:`.Url` namedtuple. Best-effort is
performed to parse incomplete urls. Fields not provided will be None.
Partly backwards-compatible with :mod:`urlparse`.
Example::
>>> parse_url('http://google.com/mail/')
Url(scheme='http', host='google.com', port=None, path='/mail/', ...)
>>> parse_url('google.com:80')
Url(scheme=None, host='google.com', port=80, path=None, ...)
>>> parse_url('/foo?bar')
Url(scheme=None, host=None, port=None, path='/foo', query='bar', ...)
c S s t | j� �S )N)r �group)�matchr r r �<lambda>� s zparse_url.<locals>.<lambda>Nz://r. r r r# r! r �[�]r" )
r �!_contains_disallowed_url_pchar_re�sub�splitr3 �rsplit�isdigitr �int�
ValueError) r% r r r r r
r r Zpath_ZdelimZ_hostr r r � parse_url� sR
r@ c C s t | �}|jpd|j|jfS )z4
Deprecated. Use :func:`parse_url` instead.
r
)r@ r r r )r% �pr r r �get_host� s rB )r
r N)Z
__future__r � collectionsr �re�
exceptionsr Z url_attrsr �compiler9 Z packages.six.moves.urllib.parser r r3 r@ rB r r r r �<module> s
U!a pip/_vendor/urllib3/util/__pycache__/response.cpython-36.opt-1.pyc 0000644 00000003433 14751155150 0020763 0 ustar 00 3
���e' � @ s@ d dl mZ ddlmZ ddlmZ dd� Zdd� Zd d
� Z d S ) � )�absolute_import� )� http_client)�HeaderParsingErrorc C sf y| j � S tk
r Y nX y| jS tk
r8 Y nX y
| jdkS tk
rX Y nX td��dS )zt
Checks whether a given file-like object is closed.
:param obj:
The file-like object to check.
Nz)Unable to determine whether fp is closed.)Zisclosed�AttributeError�closed�fp�
ValueError)�obj� r � /usr/lib/python3.6/response.py� is_fp_closed s
r
c C s\ t | tj�s tdjt| ����t| dd�}t| dd�}d}|rD|� }|sL|rXt||d��dS )aP
Asserts whether all headers have been successfully parsed.
Extracts encountered errors from the result of parsing headers.
Only works on Python 3.
:param headers: Headers to verify.
:type headers: `httplib.HTTPMessage`.
:raises urllib3.exceptions.HeaderParsingError:
If parsing errors are found.
z"expected httplib.Message, got {0}.�defectsN� get_payload)r �
unparsed_data)�
isinstance�httplibZ HTTPMessage� TypeError�format�type�getattrr )Zheadersr r r r r r �assert_header_parsing& s r c C s$ | j }t|t�r|dkS |j� dkS )z�
Checks whether the request of a response has been a HEAD-request.
Handles the quirks of AppEngine.
:param conn:
:type conn: :class:`httplib.HTTPResponse`
� ZHEAD)�_methodr �int�upper)Zresponse�methodr r r �is_response_to_headE s
r N)
Z
__future__r Zpackages.six.movesr r �
exceptionsr r
r r r r r r �<module> s
pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.opt-1.pyc 0000644 00000021265 14751155150 0020070 0 ustar 00 3
���e�/ � ! @ s� d dl mZ d dlZd dlZd dlZd dlmZmZ d dlm Z m
Z
m Z ddl m
Z
mZmZ dZdZdZdZe e
e d�Zd d
� Zeed e�Zy,d dlZd d lmZmZmZ d d
lmZ W n e k
r� Y nX yd dlm Z m Z m Z W n" e k
�r d0\Z Z dZ Y nX dj dddddddddd d d d d d!d"g�Z!yd d#lmZ W n. e k
�rr d dl"Z"G d$d%� d%e#�ZY nX d&d'� Z$d(d)� Z%d*d+� Z&d1d,d-�Z'd2d.d/�Z(dS )3� )�absolute_importN)�hexlify� unhexlify)�md5�sha1�sha256� )�SSLError�InsecurePlatformWarning�SNIMissingWarningF)� �( �@ c C sH t t| �t|� �}x*tt| �t|��D ]\}}|||A O }q(W |dkS )z�
Compare two digests of equal length in constant time.
The digests must be of type str/bytes.
Returns True if the digests match, and False otherwise.
r )�abs�len�zip� bytearray)�a�b�result�l�r� r �/usr/lib/python3.6/ssl_.py� _const_compare_digest_backport s r Zcompare_digest)� wrap_socket� CERT_NONE�PROTOCOL_SSLv23)�HAS_SNI)� OP_NO_SSLv2� OP_NO_SSLv3�OP_NO_COMPRESSION� � i �:zTLS13-AES-256-GCM-SHA384z TLS13-CHACHA20-POLY1305-SHA256zTLS13-AES-128-GCM-SHA256z ECDH+AESGCMz
ECDH+CHACHA20z DH+AESGCMz DH+CHACHA20z ECDH+AES256z DH+AES256z ECDH+AES128zDH+AESz
RSA+AESGCMzRSA+AESz!aNULLz!eNULLz!MD5)�
SSLContextc @ s\ e Zd Zdej ko dk n p*dejkZdd� Zdd� Zdd d
�Zd d � Z ddd�Z
dS )r% r � � c C s6 || _ d| _tj| _d | _d| _d | _d | _d | _ d S )NFr )
�protocol�check_hostname�sslr � verify_mode�ca_certs�options�certfile�keyfile�ciphers)�selfZprotocol_versionr r r �__init__c s zSSLContext.__init__c C s || _ || _d S )N)r. r/ )r1 r. r/ r r r �load_cert_chainn s zSSLContext.load_cert_chainNc C s || _ |d k rtd��d S )Nz-CA directories not supported in older Pythons)r, r )r1 ZcafileZcapathr r r �load_verify_locationsr s z SSLContext.load_verify_locationsc C s | j std��|| _d S )Nz�Your version of Python does not support setting a custom cipher suite. Please upgrade to Python 2.7, 3.2, or later if you need this functionality.)�supports_set_ciphers� TypeErrorr0 )r1 Z cipher_suiter r r � set_ciphersx s zSSLContext.set_ciphersFc C sT t jdt� | j| j| j| j| j|d�}| jrDt |fd| j
i|��S t |f|�S d S )Na2 A true SSLContext object is not available. This prevents urllib3 from configuring SSL appropriately and may cause certain SSL connections to fail. You can upgrade to a newer version of Python to solve this. For more information, see https://urllib3.readthedocs.io/en/latest/advanced-usage.html#ssl-warnings)r/ r. r, � cert_reqs� ssl_version� server_sider0 ) �warnings�warnr
r/ r. r, r+ r( r5 r r0 )r1 Zsocket�server_hostnamer: �kwargsr r r r � s zSSLContext.wrap_socket)r r& )r' )r' r )NN)NF) �__name__�
__module__� __qualname__�sys� version_infor5 r2 r3 r4 r7 r r r r r r% _ s
r% c C sn |j dd�j� }t|�}tj|�}|s4tdj|���t|j� �}|| �j � }t
||�sjtdj|t |����dS )z�
Checks if given fingerprint matches the supplied certificate.
:param cert:
Certificate as bytes object.
:param fingerprint:
Fingerprint as string of hexdigits, can be interspersed by colons.
r$ � z"Fingerprint of invalid length: {0}z6Fingerprints did not match. Expected "{0}", got "{1}".N) �replace�lowerr � HASHFUNC_MAP�getr �formatr �encodeZdigest�_const_compare_digestr )ZcertZ fingerprintZ
digest_lengthZhashfuncZfingerprint_bytesZ cert_digestr r r �assert_fingerprint� s
rL c C s@ | dkr t S t| t�r<tt| d�}|dkr8ttd| �}|S | S )a�
Resolves the argument to a numeric constant, which can be passed to
the wrap_socket function/method from the ssl module.
Defaults to :data:`ssl.CERT_NONE`.
If given a string it is assumed to be the name of the constant in the
:mod:`ssl` module or its abbrevation.
(So you can specify `REQUIRED` instead of `CERT_REQUIRED`.
If it's neither `None` nor a string we assume it is already the numeric
constant which can directly be passed to wrap_socket.
NZCERT_)r �
isinstance�str�getattrr* )� candidate�resr r r �resolve_cert_reqs� s
rR c C s@ | dkr t S t| t�r<tt| d�}|dkr8ttd| �}|S | S )z
like resolve_cert_reqs
NZ PROTOCOL_)r rM rN rO r* )rP rQ r r r �resolve_ssl_version� s
rS c C s� t | p
tj�}|dkr tjn|}|dkrDd}|tO }|tO }|tO }| j|O _t|dd�rl|j |pht
� ||_ t|dd�dk r�d|_ |S )a� All arguments have the same meaning as ``ssl_wrap_socket``.
By default, this function does a lot of the same work that
``ssl.create_default_context`` does on Python 3.4+. It:
- Disables SSLv2, SSLv3, and compression
- Sets a restricted set of server ciphers
If you wish to enable SSLv3, you can do::
from urllib3.util import ssl_
context = ssl_.create_urllib3_context()
context.options &= ~ssl_.OP_NO_SSLv3
You can do the same to enable compression (substituting ``COMPRESSION``
for ``SSLv3`` in the last line above).
:param ssl_version:
The desired protocol version to use. This will default to
PROTOCOL_SSLv23 which will negotiate the highest protocol that both
the server and your installation of OpenSSL support.
:param cert_reqs:
Whether to require the certificate verification. This defaults to
``ssl.CERT_REQUIRED``.
:param options:
Specific OpenSSL options. These default to ``ssl.OP_NO_SSLv2``,
``ssl.OP_NO_SSLv3``, ``ssl.OP_NO_COMPRESSION``.
:param ciphers:
Which cipher suites to allow the server to select.
:returns:
Constructed SSLContext object with specified options
:rtype: SSLContext
Nr r5 Tr) F)
r% r* r Z
CERT_REQUIREDr r r! r- rO r7 �DEFAULT_CIPHERSr+ r) )r9 r8 r- r0 �contextr r r �create_urllib3_context� s # rV c
C s� |}
|
dkrt |||d�}
|s"| r�y|
j|| � W q� tk
r\ } zt| ��W Y dd} ~ X q� tk
r� } z | jtjkr�t| ��� W Y dd} ~ X q�X n|dkr�t|
d�r�|
j� |r�|
j ||� t
r�|
j | |d�S t j
dt� |
j | �S )a
All arguments except for server_hostname, ssl_context, and ca_cert_dir have
the same meaning as they do when using :func:`ssl.wrap_socket`.
:param server_hostname:
When SNI is supported, the expected hostname of the certificate
:param ssl_context:
A pre-made :class:`SSLContext` object. If none is provided, one will
be created using :func:`create_urllib3_context`.
:param ciphers:
A string of ciphers we wish the client to support. This is not
supported on Python 2.6 as the ssl module does not support it.
:param ca_cert_dir:
A directory containing CA certificates in multiple separate files, as
supported by OpenSSL's -CApath flag or the capath argument to
SSLContext.load_verify_locations().
N)r0 �load_default_certs)r= a� An HTTPS request has been made, but the SNI (Subject Name Indication) extension to TLS is not available on this platform. This may cause the server to present an incorrect TLS certificate, which can cause validation failures. You can upgrade to a newer version of Python to solve this. For more information, see https://urllib3.readthedocs.io/en/latest/advanced-usage.html#ssl-warnings)rV r4 �IOErrorr �OSError�errno�ENOENT�hasattrrW r3 r r r; r< r ) Zsockr/ r. r8 r, r= r9 r0 Z ssl_contextZ ca_cert_dirrU �er r r �ssl_wrap_socket s. r^ )r" r# )NNNN) NNNNNNNNN))Z
__future__r rZ r; ZhmacZbinasciir r Zhashlibr r r �
exceptionsr r
r r% r Z IS_PYOPENSSLZIS_SECURETRANSPORTrG r rO rK r* r r r � ImportErrorr r r! �joinrT rB �objectrL rR rS rV r^ r r r r �<module> st
:
> pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.pyc 0000644 00000030433 14751155150 0017333 0 ustar 00 3
���e ; � @ s� d dl mZ d dlZd dlZd dlmZ d dlmZ d dlZd dl Z ddl
m Z m Z m
Z
mZmZmZ ddlmZ eje�Zedd d
d d d
g�ZG dd� de�Zed�e_dS )� )�absolute_importN)�
namedtuple)� takewhile� )�ConnectTimeoutError�
MaxRetryError�
ProtocolError�ReadTimeoutError�
ResponseError�
InvalidHeader)�six�RequestHistory�method�url�error�status�redirect_locationc
@ s� e Zd ZdZeddddddg�Zedg�Zed d
d g�Zd Zd
ddddeddddddef
dd�Z dd� Z
e d2dd��Z dd� Z
dd� Zdd � Zd3d d �Zd d � Zd4d!d"�Zd#d$� Zd%d&� Zd'd(� Zd5d*d+�Zd,d-� Zd6d.d/�Zd0d1� ZdS )7�Retrya2 Retry configuration.
Each retry attempt will create a new Retry object with updated values, so
they can be safely reused.
Retries can be defined as a default for a pool::
retries = Retry(connect=5, read=2, redirect=5)
http = PoolManager(retries=retries)
response = http.request('GET', 'http://example.com/')
Or per-request (which overrides the default for the pool)::
response = http.request('GET', 'http://example.com/', retries=Retry(10))
Retries can be disabled by passing ``False``::
response = http.request('GET', 'http://example.com/', retries=False)
Errors will be wrapped in :class:`~urllib3.exceptions.MaxRetryError` unless
retries are disabled, in which case the causing exception will be raised.
:param int total:
Total number of retries to allow. Takes precedence over other counts.
Set to ``None`` to remove this constraint and fall back on other
counts. It's a good idea to set this to some sensibly-high value to
account for unexpected edge cases and avoid infinite retry loops.
Set to ``0`` to fail on the first retry.
Set to ``False`` to disable and imply ``raise_on_redirect=False``.
:param int connect:
How many connection-related errors to retry on.
These are errors raised before the request is sent to the remote server,
which we assume has not triggered the server to process the request.
Set to ``0`` to fail on the first retry of this type.
:param int read:
How many times to retry on read errors.
These errors are raised after the request was sent to the server, so the
request may have side-effects.
Set to ``0`` to fail on the first retry of this type.
:param int redirect:
How many redirects to perform. Limit this to avoid infinite redirect
loops.
A redirect is a HTTP response with a status code 301, 302, 303, 307 or
308.
Set to ``0`` to fail on the first retry of this type.
Set to ``False`` to disable and imply ``raise_on_redirect=False``.
:param int status:
How many times to retry on bad status codes.
These are retries made on responses, where status code matches
``status_forcelist``.
Set to ``0`` to fail on the first retry of this type.
:param iterable method_whitelist:
Set of uppercased HTTP method verbs that we should retry on.
By default, we only retry on methods which are considered to be
idempotent (multiple requests with the same parameters end with the
same state). See :attr:`Retry.DEFAULT_METHOD_WHITELIST`.
Set to a ``False`` value to retry on any verb.
:param iterable status_forcelist:
A set of integer HTTP status codes that we should force a retry on.
A retry is initiated if the request method is in ``method_whitelist``
and the response status code is in ``status_forcelist``.
By default, this is disabled with ``None``.
:param float backoff_factor:
A backoff factor to apply between attempts after the second try
(most errors are resolved immediately by a second try without a
delay). urllib3 will sleep for::
{backoff factor} * (2 ^ ({number of total retries} - 1))
seconds. If the backoff_factor is 0.1, then :func:`.sleep` will sleep
for [0.0s, 0.2s, 0.4s, ...] between retries. It will never be longer
than :attr:`Retry.BACKOFF_MAX`.
By default, backoff is disabled (set to 0).
:param bool raise_on_redirect: Whether, if the number of redirects is
exhausted, to raise a MaxRetryError, or to return a response with a
response code in the 3xx range.
:param iterable remove_headers_on_redirect:
Sequence of headers to remove from the request when a response
indicating a redirect is returned before firing off the redirected
request
:param bool raise_on_status: Similar meaning to ``raise_on_redirect``:
whether we should raise an exception, or return a response,
if status falls in ``status_forcelist`` range and retries have
been exhausted.
:param tuple history: The history of the request encountered during
each call to :meth:`~Retry.increment`. The list is in the order
the requests occurred. Each list item is of class :class:`RequestHistory`.
:param bool respect_retry_after_header:
Whether to respect Retry-After header on status codes defined as
:attr:`Retry.RETRY_AFTER_STATUS_CODES` or not.
ZHEADZGETZPUTZDELETEZOPTIONSZTRACEZ
Authorizationi� i� i� �x �
Nr Tc C sv || _ || _|| _|| _|dks(|dkr0d}d} || _|p>t� | _|| _|| _| | _ |
| _
| pbt � | _ | | _
|
| _d S )NFr )�total�connect�readr �redirect�set�status_forcelist�method_whitelist�backoff_factor�raise_on_redirect�raise_on_status�tuple�history�respect_retry_after_header�remove_headers_on_redirect)�selfr r r r r r r r r r r! r" r# � r% �/usr/lib/python3.6/retry.py�__init__� s zRetry.__init__c K sP t | j| j| j| j| j| j| j| j| j | j
| j | j d� }|j
|� t| �f |�S )N) r r r r r r r r r r r! r# )�dictr r r r r r r r r r r! r# �update�type)r$ �kwZparamsr% r% r& �new� s
z Retry.newc C sR |dkr|dk r|n| j }t|t�r(|S t|�o2d}| ||d�}tjd||� |S )z4 Backwards-compatibility for the old retries format.N)r z!Converted retries value: %r -> %r)�DEFAULT�
isinstancer �bool�log�debug)�clsZretriesr �defaultZ new_retriesr% r% r& �from_int� s
zRetry.from_intc C sF t ttdd� t| j����}|dkr(dS | jd|d }t| j|�S )zJ Formula for computing the current backoff
:rtype: float
c S s
| j d kS )N)r )�xr% r% r& �<lambda>� s z(Retry.get_backoff_time.<locals>.<lambda>� r r )�len�listr �reversedr! r �min� BACKOFF_MAX)r$ Zconsecutive_errors_lenZ
backoff_valuer% r% r& �get_backoff_time� s zRetry.get_backoff_timec C s\ t jd|�rt|�}n6tjj|�}|d kr6td| ��tj|�}|tj� }|dk rXd}|S )Nz^\s*[0-9]+\s*$z Invalid Retry-After header: %sr ) �re�match�int�emailZutilsZ parsedater �timeZmktime)r$ � retry_afterZsecondsZretry_date_tupleZ
retry_dater% r% r& �parse_retry_after� s
zRetry.parse_retry_afterc C s |j d�}|dkrdS | j|�S )z* Get the value of Retry-After in seconds. z Retry-AfterN)Z getheaderrD )r$ �responserC r% r% r& �get_retry_after� s
zRetry.get_retry_afterc C s | j |�}|r tj|� dS dS )NTF)rF rB �sleep)r$ rE rC r% r% r& �sleep_for_retry� s
zRetry.sleep_for_retryc C s" | j � }|dkrd S tj|� d S )Nr )r= rB rG )r$ Zbackoffr% r% r& �_sleep_backoff s zRetry._sleep_backoffc C s" |r| j |�}|rdS | j� dS )aC Sleep between retry attempts.
This method will respect a server's ``Retry-After`` response header
and sleep the duration of the time requested. If that is not present, it
will use an exponential backoff. By default, the backoff factor is 0 and
this method will return immediately.
N)rH rI )r$ rE Zsleptr% r% r& rG s
z Retry.sleepc C s
t |t�S )z{ Errors when we're fairly sure that the server did not receive the
request, so it should be safe to retry.
)r. r )r$ �errr% r% r& �_is_connection_error s zRetry._is_connection_errorc C s t |ttf�S )z� Errors that occur after the request has been started, so we should
assume that the server began processing it.
)r. r r )r$ rJ r% r% r& �_is_read_error! s zRetry._is_read_errorc C s | j r|j� | j krdS dS )z| Checks if a given HTTP method should be retried upon, depending if
it is included on the method whitelist.
FT)r �upper)r$ r r% r% r& �_is_method_retryable' s zRetry._is_method_retryableFc C s< | j |�sdS | jr"|| jkr"dS | jo:| jo:|o:|| jkS )ax Is this method/status code retryable? (Based on whitelists and control
variables such as the number of total retries to allow, whether to
respect the Retry-After header, whether this header is present, and
whether the returned status code is on the list of status codes to
be retried upon on the presence of the aforementioned header)
FT)rN r r r" �RETRY_AFTER_STATUS_CODES)r$ r � status_codeZhas_retry_afterr% r% r& �is_retry0 s
zRetry.is_retryc C s: | j | j| j| j| jf}ttd|��}|s.dS t|�dk S )z Are we out of retries? NFr )r r r r r r9 �filterr; )r$ Z retry_countsr% r% r& � is_exhausted@ s
zRetry.is_exhaustedc C s� | j dkr |r tjt|�||��| j }|dk r6|d8 }| j}| j} | j}
| j} d} d}
d}|r�| j|�r�|dkr�tjt|�||��n|dk r�|d8 }n�|r�| j |�r�| dks�| j
|� r�tjt|�||��n| dk r�| d8 } nn|o�|j � �r|
dk r�|
d8 }
d} |j � }|j}
n<t j
} |�rL|j�rL| dk �r6| d8 } t jj|jd�} |j}
| jt||||
|�f }| j||| |
| |d�}|j� �r�t|||�p�t | ���tjd||� |S ) a� Return a new Retry object with incremented retry counters.
:param response: A response object, or None, if the server did not
return a response.
:type response: :class:`~urllib3.response.HTTPResponse`
:param Exception error: An error encountered during the request, or
None if the response was received successfully.
:return: A new ``Retry`` object.
FNr7 �unknownztoo many redirects)rP )r r r r r r! z$Incremented Retry for (url='%s'): %r)r r Zreraiser* r r r r rK rL rN Zget_redirect_locationr
Z
GENERIC_ERRORZSPECIFIC_ERROR�formatr! r
r, rS r r0 r1 )r$ r r rE r Z_poolZ _stacktracer r r r Z status_count�causer r r! Z new_retryr% r% r& � incrementI sX
zRetry.incrementc C s dj t| �| d�S )Nz|{cls.__name__}(total={self.total}, connect={self.connect}, read={self.read}, redirect={self.redirect}, status={self.status}))r2 r$ )rU r* )r$ r% r% r& �__repr__� s zRetry.__repr__)TN)N)N)F)NNNNNN)�__name__�
__module__� __qualname__�__doc__� frozensetZDEFAULT_METHOD_WHITELISTZ"DEFAULT_REDIRECT_HEADERS_BLACKLISTrO r< r' r, � classmethodr4 r= rD rF rH rI rG rK rL rN rQ rS rW rX r% r% r% r& r s8 x
Jr � )Z
__future__r rB Zlogging� collectionsr � itertoolsr rA r> �
exceptionsr r r r r
r Zpackagesr Z getLoggerrY r0 r
�objectr r- r% r% r% r& �<module> s
pip/_vendor/urllib3/util/__pycache__/selectors.cpython-36.pyc 0000644 00000037715 14751155150 0020203 0 ustar 00 3
���e�R � @ sz d dl Z d dlZd dlZd dlZd dlZd dlZd dlmZmZ y
ej Z W n e
e fk
rh ejZ Y nX d(Z d)Z
dZe� ZdaG dd� de�Zdd� Zejd*kr�d d � Znd
d � Zedddddg�ZG dd� de�ZG dd� de�Zeed��rG dd� de�Zeed��r G dd � d e�Z eed ��r:G d d � d e�Z eed ��rVG d!d"� d"e�Z eed��sfd#Zd$d%� Z d&d'� Z dS )+� N)�
namedtuple�Mapping� Tc s, e Zd Z� fdd�Zdd� Zdd� Z� ZS )�
SelectorErrorc s t t| �j� || _d S )N)�superr �__init__�errno)�self�errcode)� __class__� � /usr/lib/python3.6/selectors.pyr s zSelectorError.__init__c C s dj | j�S )Nz<SelectorError errno={0}>)�formatr )r r r r
�__repr__" s zSelectorError.__repr__c C s | j � S )N)r )r r r r
�__str__% s zSelectorError.__str__)�__name__�
__module__� __qualname__r r r �
__classcell__r r )r r
r s r c
C sd t | t�r| }n:yt| j� �}W n( tttfk
rH tdj| ���Y nX |dk r`tdj|���|S )zl Return a file descriptor from a file object. If
given an integer will simply return that integer back. zInvalid file object: {0!r}r z Invalid file descriptor: {0})�
isinstance�int�fileno�AttributeError� TypeError�
ValueErrorr )�fileobj�fdr r r
�_fileobj_to_fd) s
r � � c O sV y
| ||�S t ttjfk
rP } z"d}t|d�r8|j}t|��W Y dd}~X nX dS )z� This is the short-circuit version of the below logic
because in Python 3.5+ all system calls automatically restart
and recalculate their timeouts. Nr )�OSError�IOError�select�error�hasattrr r )�func�_�args�kwargs�er
r r r
�_syscall_wrapper; s
r* c O sR |j dd�}|dkr d}d}n t|�}|dk r4d}n
t� | }t|�}|rZd|krZtd��t}x�|tk�rLy| ||�}W q` tttj fk
�rH } z�d}t
|d�r�|j }nt
|d�r�|j d }|t j
kp�t
t d �o�|t jk} | �r&|dk �r$t� }
|
|k�rtt jd
��|�r$d|k�r$||
|d< w`|�r6t|��n� W Y dd}~X q`X q`W |S ) z� Wrapper function for syscalls that could fail due to EINTR.
All functions should be retried if there is time left in the timeout
in accordance with PEP 475. �timeoutNFg z4Timeout must be in args or kwargs to be recalculatedr r' r �WSAEINTR)r )�get�float� monotonic�listr �_SYSCALL_SENTINELr r! r" r# r$ r r' ZEINTRr, Z ETIMEDOUTr ) r% Zrecalc_timeoutr' r( r+ Zexpires�resultr) r
Z is_interruptZ current_timer r r
r* G sJ
� SelectorKeyr r �events�datac @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �_SelectorMappingz* Mapping of file objects to selector keys c C s
|| _ d S )N)� _selector)r Zselectorr r r
r � s z_SelectorMapping.__init__c C s t | jj�S )N)�lenr7 �
_fd_to_key)r r r r
�__len__� s z_SelectorMapping.__len__c C s@ y| j j|�}| j j| S tk
r: tdj|���Y nX d S )Nz{0!r} is not registered.)r7 �_fileobj_lookupr9 �KeyErrorr )r r r r r r
� __getitem__� s
z _SelectorMapping.__getitem__c C s t | jj�S )N)�iterr7 r9 )r r r r
�__iter__� s z_SelectorMapping.__iter__N)r r r �__doc__r r: r= r? r r r r
r6 � s
r6 c @ sv e Zd ZdZdd� Zdd� Zddd�Zd d
� Zd d d �Zd d
d�Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) � BaseSelectora/ Abstract Selector class
A selector supports registering file objects to be monitored
for specific I/O events.
A file object is a file descriptor or any object with a
`fileno()` method. An arbitrary object can be attached to the
file object which can be used for example to store context info,
a callback, etc.
A selector can use various implementations (select(), poll(), epoll(),
and kqueue()) depending on the platform. The 'DefaultSelector' class uses
the most efficient implementation for the current platform.
c C s i | _ t| �| _d S )N)r9 r6 �_map)r r r r
r � s zBaseSelector.__init__c C sH yt |�S tk
rB x"| jj� D ]}|j|kr$|jS q$W � Y nX dS )aa Return a file descriptor from a file object.
This wraps _fileobj_to_fd() to do an exhaustive
search in case the object is invalid but we still
have it in our map. Used by unregister() so we can
unregister an object that was previously registered
even if it is closed. It is also used by _SelectorMapping
N)r r r9 �valuesr r )r r �keyr r r
r; � s
z BaseSelector._fileobj_lookupNc C sd | s|t tB @ r"tdj|���t|| j|�||�}|j| jkrTtdj||j���|| j|j< |S )z8 Register a file object for a set of events to monitor. zInvalid events: {0!r}z${0!r} (FD {1}) is already registered) �
EVENT_READ� EVENT_WRITEr r r3 r; r r9 r< )r r r4 r5 rD r r r
�register� s zBaseSelector.registerc C s� y| j j| j|��}W n� tk
r8 tdj|���Y np tjk
r� } zR|jtjkrZ� n<x:| j j � D ] }|j
|krf| j j|j � P qfW tdj|���W Y dd}~X nX |S )z0 Unregister a file object from being monitored. z{0!r} is not registeredN) r9 �popr; r< r �socketr# r ZEBADFrC r r )r r rD r) r r r
�
unregister� s
zBaseSelector.unregisterc C s� y| j | j|� }W n" tk
r6 tdj|���Y nX ||jkr\| j|� | j|||�}n"||jkr~|j|d�}|| j |j < |S )z< Change a registered file object monitored events and data. z{0!r} is not registered)r5 )
r9 r; r< r r4 rJ rG r5 �_replacer )r r r4 r5 rD r r r
�modify� s
zBaseSelector.modifyc C s
t � �dS )zj Perform the actual selection until some monitored file objects
are ready or the timeout expires. N)�NotImplementedError)r r+ r r r
r" � s zBaseSelector.selectc C s | j j� d| _dS )zd Close the selector. This must be called to ensure that all
underlying resources are freed. N)r9 �clearrB )r r r r
�close� s
zBaseSelector.closec C sH | j � }|dkrtd��y|| S tk
rB tdj|���Y nX dS )z: Return the key associated with a registered file object. NzSelector is closedz{0!r} is not registered)�get_map� RuntimeErrorr< r )r r �mappingr r r
�get_key s zBaseSelector.get_keyc C s | j S )z3 Return a mapping of file objects to selector keys )rB )r r r r
rP
s zBaseSelector.get_mapc C s$ y
| j | S tk
r dS X dS )z_ Return the key associated to a given file descriptor
Return None if it is not found. N)r9 r< )r r r r r
� _key_from_fd s
zBaseSelector._key_from_fdc C s | S )Nr )r r r r
� __enter__ s zBaseSelector.__enter__c G s | j � d S )N)rO )r r' r r r
�__exit__ s zBaseSelector.__exit__)N)N)N)r r r r@ r r; rG rJ rL r" rO rS rP rT rU rV r r r r
rA � s
rA r" c sN e Zd ZdZ� fdd�Zd
� fdd� Z� fdd�Zdd d
�Zdd d �Z� Z S )�SelectSelectorz Select-based selector. c s" t t| �j� t� | _t� | _d S )N)r rW r �set�_readers�_writers)r )r r r
r ! s zSelectSelector.__init__Nc sD t t| �j|||�}|t@ r*| jj|j� |t@ r@| jj|j� |S )N) r rW rG rE rY �addr rF rZ )r r r4 r5 rD )r r r
rG & s zSelectSelector.registerc s0 t t| �j|�}| jj|j� | jj|j� |S )N)r rW rJ rY �discardr rZ )r r rD )r r r
rJ . s zSelectSelector.unregisterc C s t j ||g |�S )z? Wrapper for select.select because timeout is a positional arg )r" )r �r�wr+ r r r
�_select4 s zSelectSelector._selectc C s� t | j� r t | j� r g S |d kr(d nt|d�}g }t| jd| j| j|�\}}}t|�}t|�}xV||B D ]J}d}||kr�|tO }||kr�|tO }| j |�}|rl|j
|||j @ f� qlW |S )Ng Tr ) r8 rY rZ �maxr* r_ rX rE rF rT �appendr4 ) r r+ �readyr] r^ r& r r4 rD r r r
r" 8 s$
zSelectSelector.select)N)N)N)
r r r r@ r rG rJ r_ r" r r r )r r
rW s
rW �pollc sN e Zd ZdZ� fdd�Zd
� fdd� Z� fdd�Zdd d
�Zdd d �Z� Z S )� PollSelectorz Poll-based selector c s t t| �j� tj� | _d S )N)r rd r r" rc �_poll)r )r r r
r S s zPollSelector.__init__Nc sP t t| �j|||�}d}|t@ r*|tjO }|t@ r<|tjO }| jj|j |� |S )Nr )
r rd rG rE r" �POLLINrF �POLLOUTre r )r r r4 r5 rD �
event_mask)r r r
rG W s
zPollSelector.registerc s" t t| �j|�}| jj|j� |S )N)r rd rJ re r )r r rD )r r r
rJ a s zPollSelector.unregisterc C s4 |dk r$|dkrd}nt j|d �}| jj|�}|S )zj Wrapper function for select.poll.poll() so that
_syscall_wrapper can work with only seconds. Nr g @�@)�math�ceilre rc )r r+ r2 r r r
�
_wrap_pollf s zPollSelector._wrap_pollc C sx g }t | jd|d�}x^|D ]V\}}d}|tj @ r:|tO }|tj @ rN|tO }| j|�}|r|j|||j @ f� qW |S )NT)r+ r )
r* rk r" rf rF rg rE rT ra r4 )r r+ rb � fd_eventsr rh r4 rD r r r
r" t s
zPollSelector.select)N)N)N)
r r r r@ r rG rJ rk r" r r r )r r
rd Q s
rd �epollc sX e Zd ZdZ� fdd�Zdd� Zd� fdd� Z� fd d
�Zdd d �Z� fd
d�Z � Z
S )�
EpollSelectorz Epoll-based selector c s t t| �j� tj� | _d S )N)r rn r r" rm �_epoll)r )r r r
r � s zEpollSelector.__init__c C s
| j j� S )N)ro r )r r r r
r � s zEpollSelector.filenoNc sT t t| �j|||�}d}|t@ r*|tjO }|t@ r<|tjO }t| j jd|j
|� |S )Nr F) r rn rG rE r" �EPOLLINrF �EPOLLOUTr* ro r )r r r4 r5 rD Z events_mask)r r r
rG � s
zEpollSelector.registerc s@ t t| �j|�}yt| jjd|j� W n tk
r: Y nX |S )NF)r rn rJ r* ro r r )r r rD )r r r
rJ � s zEpollSelector.unregisterc C s� |d k r2|dkrd}nt j|d �d }t|�}nd }tt| j�d�}g }t| jjd||d�}x^|D ]V\}}d}|t j
@ r�|t O }|t j @ r�|t
O }| j|�}|rd|j|||j@ f� qdW |S )
Nr g g @�@g����MbP?g �?r T)r+ Z maxeventsg �)ri rj r. r` r8 r9 r* ro rc r" rp rF rq rE rT ra r4 ) r r+ �
max_eventsrb rl r rh r4 rD r r r
r" � s*
zEpollSelector.selectc s | j j� tt| �j� d S )N)ro rO r rn )r )r r r
rO � s
zEpollSelector.close)N)N) r r r r@ r r rG rJ r" rO r r r )r r
rn � s
!rn �kqueuec sX e Zd ZdZ� fdd�Zdd� Zd� fdd� Z� fd d
�Zdd d �Z� fd
d�Z � Z
S )�KqueueSelectorz Kqueue / Kevent-based selector c s t t| �j� tj� | _d S )N)r rt r r" rs �_kqueue)r )r r r
r � s zKqueueSelector.__init__c C s
| j j� S )N)ru r )r r r r
r � s zKqueueSelector.filenoNc s| t t| �j|||�}|t@ rFtj|jtjtj�}t | j
j d|gdd� |t @ rxtj|jtj
tj�}t | j
j d|gdd� |S )NFr )r rt rG rE r" �keventr �KQ_FILTER_READZ KQ_EV_ADDr* ru �controlrF �KQ_FILTER_WRITE)r r r4 r5 rD rv )r r r
rG � s zKqueueSelector.registerc s� t t| �j|�}|jt@ r^tj|jtjtj �}yt
| j j d|gdd� W n t
k
r\ Y nX |jt@ r�tj|jtjtj �}yt
| j j d|gdd� W n t
k
r� Y nX |S )NFr )r rt rJ r4 rE r" rv r rw Z KQ_EV_DELETEr* ru rx r rF ry )r r rD rv )r r r
rJ � s$
zKqueueSelector.unregisterc C s� |d k rt |d�}t| j�d }i }t| jjdd ||�}x�|D ]�}|j}|j}d}|tj krd|t
O }|tj krv|t O }| j
|�} | r>| j|kr�| || j@ f|| j< q>|| j d }
| ||
B | j@ f|| j< q>W t|j� �S )Nr � Tr )r` r8 r9 r* ru rx Zident�filterr" rw rE ry rF rT r r4 r0 rC ) r r+ rr Z ready_fdsZ kevent_listrv r rh r4 rD Z
old_eventsr r r
r" � s*
zKqueueSelector.selectc s | j j� tt| �j� d S )N)ru rO r rt )r )r r r
rO s
zKqueueSelector.close)N)N) r r r r@ r r rG rJ r" rO r r r )r r
rt � s
rt Fc C sZ y0| dkr t j� }|jd� ntt | �� j� dS ttfk
rT } zdS d}~X nX dS )a
Checks that select structs can be allocated by the underlying
operating system, not just advertised by the select module. We don't
check select() because we'll be hopeful that most platforms that
don't have it available will not advertise it. (ie: GAE) rc r TFN)r" rc �getattrrO r r )�struct�pr) r r r
�
_can_allocate s r c C sP t dkrJtd�rta n4td�r$ta n&td�r2ta nttd�rBta ntd��t � S )z� This function serves as a first call for DefaultSelector to
detect if the select module is being monkey-patched incorrectly
by eventlet, greenlet, and preserve proper behavior. Nrs rm rc r" z!Platform does not have a selector) �_DEFAULT_SELECTORr rt rn rd r$ r" rW r r r r r
�DefaultSelector5 s
r� r rz )r r )!r ri r" rI �sysZtime� collectionsr r r/ r � ImportErrorrE rF Z
HAS_SELECT�objectr1 r� � Exceptionr r � version_infor* r3 r6 rA r$ rW rd rn rt r r� r r r r
�<module> sH
8 1 4 B R pip/_vendor/urllib3/util/__pycache__/url.cpython-36.pyc 0000644 00000012430 14751155150 0016765 0 ustar 00 3
���e� � @ s� d dl mZ d dlmZ d dlZddlmZ dddd d
d d gZdZej d�Z
ddl m Z G dd� dede��Z
dd� Zdd� Zdd� ZdS )� )�absolute_import)�
namedtupleN� )�LocationParseError�scheme�auth�host�port�path�query�fragment�http�httpsz[ - ])�quotec s^ e Zd ZdZf Zd� fdd� Zedd� �Zedd� �Zed d
� �Z ed d � �Z
d
d� Z � Z S )�Urlz�
Datastructure for representing an HTTP URL. Used as a return value for
:func:`parse_url`. Both the scheme and host are normalized as they are
both case-insensitive according to RFC 3986.
Nc sV |r|j d� rd| }|r$|j� }|r8|tkr8|j� }tt| �j| |||||||�S )N�/)�
startswith�lower�NORMALIZABLE_SCHEMES�superr �__new__)�clsr r r r r
r r )� __class__� �/usr/lib/python3.6/url.pyr s z Url.__new__c C s | j S )z@For backwards-compatibility with urlparse. We're nice like that.)r )�selfr r r �hostname$ s z Url.hostnamec C s& | j pd}| jdk r"|d| j 7 }|S )z)Absolute path including the query string.r N�?)r
r )r Zurir r r � request_uri) s
zUrl.request_uric C s | j rd| j| j f S | jS )z(Network location including host and portz%s:%d)r r )r r r r �netloc3 s z
Url.netlocc C s� | \}}}}}}}d}|dk r*||d 7 }|dk r>||d 7 }|dk rN||7 }|dk rf|dt |� 7 }|dk rv||7 }|dk r�|d| 7 }|dk r�|d| 7 }|S )a�
Convert self into a url
This function should more or less round-trip with :func:`.parse_url`. The
returned url may not be exactly the same as the url inputted to
:func:`.parse_url`, but it should be equivalent by the RFC (e.g., urls
with a blank port will have : removed).
Example: ::
>>> U = parse_url('http://google.com/mail/')
>>> U.url
'http://google.com/mail/'
>>> Url('http', 'username:password', 'host.com', 80,
... '/path', 'query', 'fragment').url
'http://username:password@host.com:80/path?query#fragment'
� Nz://�@�:r �#)�str) r r r r r r
r r �urlr r r r% : s" zUrl.urlc C s | j S )N)r% )r r r r �__str__b s z Url.__str__)NNNNNNN)
�__name__�
__module__� __qualname__�__doc__� __slots__r �propertyr r r r% r& �
__classcell__r r )r r r s
(r c C sz d}d}x8|D ]0}| j |�}|dk r&q|dks6||k r|}|}qW |dksR|dk r\| ddfS | d|� | |d d� |fS )a�
Given a string and an iterable of delimiters, split on the first found
delimiter. Return two split parts and the matched delimiter.
If not found, then the first part is the full input string.
Example::
>>> split_first('foo/bar?baz', '?/=')
('foo', 'bar?baz', '/')
>>> split_first('foo/bar?baz', '123')
('foo/bar?baz', '', None)
Scales linearly with number of delims. Not ideal for large number of delims.
Nr r � )�find)�sZdelimsZmin_idxZ min_delim�d�idxr r r � split_firstf s
r3 c C s� | s
t � S tjdd� | �} d}d}d}d}d}d}d}d| krN| jdd�\}} t| dddg�\} }} | rp| | }d | kr�| jd d�\}} | r�| d
d kr�| jd d�\}} |d 7 }d
| k�r | jd
d�\}
}|s�|
}|�r|j� s�t| ��y t|�}W n t k
�r t| ��Y nX nd}n| �r.| �r.| }|�sHt |||||||�S d|k�rb|jdd�\}}d|k�r||jdd�\}}t |||||||�S )a:
Given a url, return a parsed :class:`.Url` namedtuple. Best-effort is
performed to parse incomplete urls. Fields not provided will be None.
Partly backwards-compatible with :mod:`urlparse`.
Example::
>>> parse_url('http://google.com/mail/')
Url(scheme='http', host='google.com', port=None, path='/mail/', ...)
>>> parse_url('google.com:80')
Url(scheme=None, host='google.com', port=80, path=None, ...)
>>> parse_url('/foo?bar')
Url(scheme=None, host=None, port=None, path='/foo', query='bar', ...)
c S s t | j� �S )N)r �group)�matchr r r �<lambda>� s zparse_url.<locals>.<lambda>Nz://r. r r r# r! r �[�]r" )
r �!_contains_disallowed_url_pchar_re�sub�splitr3 �rsplit�isdigitr �int�
ValueError) r% r r r r r
r r Zpath_ZdelimZ_hostr r r � parse_url� sR
r@ c C s t | �}|jpd|j|jfS )z4
Deprecated. Use :func:`parse_url` instead.
r
)r@ r r r )r% �pr r r �get_host� s rB )r
r N)Z
__future__r � collectionsr �re�
exceptionsr Z url_attrsr �compiler9 Z packages.six.moves.urllib.parser r r3 r@ rB r r r r �<module> s
U!a pip/_vendor/urllib3/util/__pycache__/selectors.cpython-36.opt-1.pyc 0000644 00000037715 14751155150 0021142 0 ustar 00 3
���e�R � @ sz d dl Z d dlZd dlZd dlZd dlZd dlZd dlmZmZ y
ej Z W n e
e fk
rh ejZ Y nX d(Z d)Z
dZe� ZdaG dd� de�Zdd� Zejd*kr�d d � Znd
d � Zedddddg�ZG dd� de�ZG dd� de�Zeed��rG dd� de�Zeed��r G dd � d e�Z eed ��r:G d d � d e�Z eed ��rVG d!d"� d"e�Z eed��sfd#Zd$d%� Z d&d'� Z dS )+� N)�
namedtuple�Mapping� Tc s, e Zd Z� fdd�Zdd� Zdd� Z� ZS )�
SelectorErrorc s t t| �j� || _d S )N)�superr �__init__�errno)�self�errcode)� __class__� � /usr/lib/python3.6/selectors.pyr s zSelectorError.__init__c C s dj | j�S )Nz<SelectorError errno={0}>)�formatr )r r r r
�__repr__" s zSelectorError.__repr__c C s | j � S )N)r )r r r r
�__str__% s zSelectorError.__str__)�__name__�
__module__� __qualname__r r r �
__classcell__r r )r r
r s r c
C sd t | t�r| }n:yt| j� �}W n( tttfk
rH tdj| ���Y nX |dk r`tdj|���|S )zl Return a file descriptor from a file object. If
given an integer will simply return that integer back. zInvalid file object: {0!r}r z Invalid file descriptor: {0})�
isinstance�int�fileno�AttributeError� TypeError�
ValueErrorr )�fileobj�fdr r r
�_fileobj_to_fd) s
r � � c O sV y
| ||�S t ttjfk
rP } z"d}t|d�r8|j}t|��W Y dd}~X nX dS )z� This is the short-circuit version of the below logic
because in Python 3.5+ all system calls automatically restart
and recalculate their timeouts. Nr )�OSError�IOError�select�error�hasattrr r )�func�_�args�kwargs�er
r r r
�_syscall_wrapper; s
r* c O sR |j dd�}|dkr d}d}n t|�}|dk r4d}n
t� | }t|�}|rZd|krZtd��t}x�|tk�rLy| ||�}W q` tttj fk
�rH } z�d}t
|d�r�|j }nt
|d�r�|j d }|t j
kp�t
t d �o�|t jk} | �r&|dk �r$t� }
|
|k�rtt jd
��|�r$d|k�r$||
|d< w`|�r6t|��n� W Y dd}~X q`X q`W |S ) z� Wrapper function for syscalls that could fail due to EINTR.
All functions should be retried if there is time left in the timeout
in accordance with PEP 475. �timeoutNFg z4Timeout must be in args or kwargs to be recalculatedr r' r �WSAEINTR)r )�get�float� monotonic�listr �_SYSCALL_SENTINELr r! r" r# r$ r r' ZEINTRr, Z ETIMEDOUTr ) r% Zrecalc_timeoutr' r( r+ Zexpires�resultr) r
Z is_interruptZ current_timer r r
r* G sJ
� SelectorKeyr r �events�datac @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �_SelectorMappingz* Mapping of file objects to selector keys c C s
|| _ d S )N)� _selector)r Zselectorr r r
r � s z_SelectorMapping.__init__c C s t | jj�S )N)�lenr7 �
_fd_to_key)r r r r
�__len__� s z_SelectorMapping.__len__c C s@ y| j j|�}| j j| S tk
r: tdj|���Y nX d S )Nz{0!r} is not registered.)r7 �_fileobj_lookupr9 �KeyErrorr )r r r r r r
� __getitem__� s
z _SelectorMapping.__getitem__c C s t | jj�S )N)�iterr7 r9 )r r r r
�__iter__� s z_SelectorMapping.__iter__N)r r r �__doc__r r: r= r? r r r r
r6 � s
r6 c @ sv e Zd ZdZdd� Zdd� Zddd�Zd d
� Zd d d �Zd d
d�Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) � BaseSelectora/ Abstract Selector class
A selector supports registering file objects to be monitored
for specific I/O events.
A file object is a file descriptor or any object with a
`fileno()` method. An arbitrary object can be attached to the
file object which can be used for example to store context info,
a callback, etc.
A selector can use various implementations (select(), poll(), epoll(),
and kqueue()) depending on the platform. The 'DefaultSelector' class uses
the most efficient implementation for the current platform.
c C s i | _ t| �| _d S )N)r9 r6 �_map)r r r r
r � s zBaseSelector.__init__c C sH yt |�S tk
rB x"| jj� D ]}|j|kr$|jS q$W � Y nX dS )aa Return a file descriptor from a file object.
This wraps _fileobj_to_fd() to do an exhaustive
search in case the object is invalid but we still
have it in our map. Used by unregister() so we can
unregister an object that was previously registered
even if it is closed. It is also used by _SelectorMapping
N)r r r9 �valuesr r )r r �keyr r r
r; � s
z BaseSelector._fileobj_lookupNc C sd | s|t tB @ r"tdj|���t|| j|�||�}|j| jkrTtdj||j���|| j|j< |S )z8 Register a file object for a set of events to monitor. zInvalid events: {0!r}z${0!r} (FD {1}) is already registered) �
EVENT_READ� EVENT_WRITEr r r3 r; r r9 r< )r r r4 r5 rD r r r
�register� s zBaseSelector.registerc C s� y| j j| j|��}W n� tk
r8 tdj|���Y np tjk
r� } zR|jtjkrZ� n<x:| j j � D ] }|j
|krf| j j|j � P qfW tdj|���W Y dd}~X nX |S )z0 Unregister a file object from being monitored. z{0!r} is not registeredN) r9 �popr; r< r �socketr# r ZEBADFrC r r )r r rD r) r r r
�
unregister� s
zBaseSelector.unregisterc C s� y| j | j|� }W n" tk
r6 tdj|���Y nX ||jkr\| j|� | j|||�}n"||jkr~|j|d�}|| j |j < |S )z< Change a registered file object monitored events and data. z{0!r} is not registered)r5 )
r9 r; r< r r4 rJ rG r5 �_replacer )r r r4 r5 rD r r r
�modify� s
zBaseSelector.modifyc C s
t � �dS )zj Perform the actual selection until some monitored file objects
are ready or the timeout expires. N)�NotImplementedError)r r+ r r r
r" � s zBaseSelector.selectc C s | j j� d| _dS )zd Close the selector. This must be called to ensure that all
underlying resources are freed. N)r9 �clearrB )r r r r
�close� s
zBaseSelector.closec C sH | j � }|dkrtd��y|| S tk
rB tdj|���Y nX dS )z: Return the key associated with a registered file object. NzSelector is closedz{0!r} is not registered)�get_map� RuntimeErrorr< r )r r �mappingr r r
�get_key s zBaseSelector.get_keyc C s | j S )z3 Return a mapping of file objects to selector keys )rB )r r r r
rP
s zBaseSelector.get_mapc C s$ y
| j | S tk
r dS X dS )z_ Return the key associated to a given file descriptor
Return None if it is not found. N)r9 r< )r r r r r
� _key_from_fd s
zBaseSelector._key_from_fdc C s | S )Nr )r r r r
� __enter__ s zBaseSelector.__enter__c G s | j � d S )N)rO )r r' r r r
�__exit__ s zBaseSelector.__exit__)N)N)N)r r r r@ r r; rG rJ rL r" rO rS rP rT rU rV r r r r
rA � s
rA r" c sN e Zd ZdZ� fdd�Zd
� fdd� Z� fdd�Zdd d
�Zdd d �Z� Z S )�SelectSelectorz Select-based selector. c s" t t| �j� t� | _t� | _d S )N)r rW r �set�_readers�_writers)r )r r r
r ! s zSelectSelector.__init__Nc sD t t| �j|||�}|t@ r*| jj|j� |t@ r@| jj|j� |S )N) r rW rG rE rY �addr rF rZ )r r r4 r5 rD )r r r
rG & s zSelectSelector.registerc s0 t t| �j|�}| jj|j� | jj|j� |S )N)r rW rJ rY �discardr rZ )r r rD )r r r
rJ . s zSelectSelector.unregisterc C s t j ||g |�S )z? Wrapper for select.select because timeout is a positional arg )r" )r �r�wr+ r r r
�_select4 s zSelectSelector._selectc C s� t | j� r t | j� r g S |d kr(d nt|d�}g }t| jd| j| j|�\}}}t|�}t|�}xV||B D ]J}d}||kr�|tO }||kr�|tO }| j |�}|rl|j
|||j @ f� qlW |S )Ng Tr ) r8 rY rZ �maxr* r_ rX rE rF rT �appendr4 ) r r+ �readyr] r^ r& r r4 rD r r r
r" 8 s$
zSelectSelector.select)N)N)N)
r r r r@ r rG rJ r_ r" r r r )r r
rW s
rW �pollc sN e Zd ZdZ� fdd�Zd
� fdd� Z� fdd�Zdd d
�Zdd d �Z� Z S )� PollSelectorz Poll-based selector c s t t| �j� tj� | _d S )N)r rd r r" rc �_poll)r )r r r
r S s zPollSelector.__init__Nc sP t t| �j|||�}d}|t@ r*|tjO }|t@ r<|tjO }| jj|j |� |S )Nr )
r rd rG rE r" �POLLINrF �POLLOUTre r )r r r4 r5 rD �
event_mask)r r r
rG W s
zPollSelector.registerc s" t t| �j|�}| jj|j� |S )N)r rd rJ re r )r r rD )r r r
rJ a s zPollSelector.unregisterc C s4 |dk r$|dkrd}nt j|d �}| jj|�}|S )zj Wrapper function for select.poll.poll() so that
_syscall_wrapper can work with only seconds. Nr g @�@)�math�ceilre rc )r r+ r2 r r r
�
_wrap_pollf s zPollSelector._wrap_pollc C sx g }t | jd|d�}x^|D ]V\}}d}|tj @ r:|tO }|tj @ rN|tO }| j|�}|r|j|||j @ f� qW |S )NT)r+ r )
r* rk r" rf rF rg rE rT ra r4 )r r+ rb � fd_eventsr rh r4 rD r r r
r" t s
zPollSelector.select)N)N)N)
r r r r@ r rG rJ rk r" r r r )r r
rd Q s
rd �epollc sX e Zd ZdZ� fdd�Zdd� Zd� fdd� Z� fd d
�Zdd d �Z� fd
d�Z � Z
S )�
EpollSelectorz Epoll-based selector c s t t| �j� tj� | _d S )N)r rn r r" rm �_epoll)r )r r r
r � s zEpollSelector.__init__c C s
| j j� S )N)ro r )r r r r
r � s zEpollSelector.filenoNc sT t t| �j|||�}d}|t@ r*|tjO }|t@ r<|tjO }t| j jd|j
|� |S )Nr F) r rn rG rE r" �EPOLLINrF �EPOLLOUTr* ro r )r r r4 r5 rD Z events_mask)r r r
rG � s
zEpollSelector.registerc s@ t t| �j|�}yt| jjd|j� W n tk
r: Y nX |S )NF)r rn rJ r* ro r r )r r rD )r r r
rJ � s zEpollSelector.unregisterc C s� |d k r2|dkrd}nt j|d �d }t|�}nd }tt| j�d�}g }t| jjd||d�}x^|D ]V\}}d}|t j
@ r�|t O }|t j @ r�|t
O }| j|�}|rd|j|||j@ f� qdW |S )
Nr g g @�@g����MbP?g �?r T)r+ Z maxeventsg �)ri rj r. r` r8 r9 r* ro rc r" rp rF rq rE rT ra r4 ) r r+ �
max_eventsrb rl r rh r4 rD r r r
r" � s*
zEpollSelector.selectc s | j j� tt| �j� d S )N)ro rO r rn )r )r r r
rO � s
zEpollSelector.close)N)N) r r r r@ r r rG rJ r" rO r r r )r r
rn � s
!rn �kqueuec sX e Zd ZdZ� fdd�Zdd� Zd� fdd� Z� fd d
�Zdd d �Z� fd
d�Z � Z
S )�KqueueSelectorz Kqueue / Kevent-based selector c s t t| �j� tj� | _d S )N)r rt r r" rs �_kqueue)r )r r r
r � s zKqueueSelector.__init__c C s
| j j� S )N)ru r )r r r r
r � s zKqueueSelector.filenoNc s| t t| �j|||�}|t@ rFtj|jtjtj�}t | j
j d|gdd� |t @ rxtj|jtj
tj�}t | j
j d|gdd� |S )NFr )r rt rG rE r" �keventr �KQ_FILTER_READZ KQ_EV_ADDr* ru �controlrF �KQ_FILTER_WRITE)r r r4 r5 rD rv )r r r
rG � s zKqueueSelector.registerc s� t t| �j|�}|jt@ r^tj|jtjtj �}yt
| j j d|gdd� W n t
k
r\ Y nX |jt@ r�tj|jtjtj �}yt
| j j d|gdd� W n t
k
r� Y nX |S )NFr )r rt rJ r4 rE r" rv r rw Z KQ_EV_DELETEr* ru rx r rF ry )r r rD rv )r r r
rJ � s$
zKqueueSelector.unregisterc C s� |d k rt |d�}t| j�d }i }t| jjdd ||�}x�|D ]�}|j}|j}d}|tj krd|t
O }|tj krv|t O }| j
|�} | r>| j|kr�| || j@ f|| j< q>|| j d }
| ||
B | j@ f|| j< q>W t|j� �S )Nr � Tr )r` r8 r9 r* ru rx Zident�filterr" rw rE ry rF rT r r4 r0 rC ) r r+ rr Z ready_fdsZ kevent_listrv r rh r4 rD Z
old_eventsr r r
r" � s*
zKqueueSelector.selectc s | j j� tt| �j� d S )N)ru rO r rt )r )r r r
rO s
zKqueueSelector.close)N)N) r r r r@ r r rG rJ r" rO r r r )r r
rt � s
rt Fc C sZ y0| dkr t j� }|jd� ntt | �� j� dS ttfk
rT } zdS d}~X nX dS )a
Checks that select structs can be allocated by the underlying
operating system, not just advertised by the select module. We don't
check select() because we'll be hopeful that most platforms that
don't have it available will not advertise it. (ie: GAE) rc r TFN)r" rc �getattrrO r r )�struct�pr) r r r
�
_can_allocate s r c C sP t dkrJtd�rta n4td�r$ta n&td�r2ta nttd�rBta ntd��t � S )z� This function serves as a first call for DefaultSelector to
detect if the select module is being monkey-patched incorrectly
by eventlet, greenlet, and preserve proper behavior. Nrs rm rc r" z!Platform does not have a selector) �_DEFAULT_SELECTORr rt rn rd r$ r" rW r r r r r
�DefaultSelector5 s
r� r rz )r r )!r ri r" rI �sysZtime� collectionsr r r/ r � ImportErrorrE rF Z
HAS_SELECT�objectr1 r� � Exceptionr r � version_infor* r3 r6 rA r$ rW rd rn rt r r� r r r r
�<module> sH
8 1 4 B R pip/_vendor/urllib3/util/__pycache__/response.cpython-36.pyc 0000644 00000003433 14751155150 0020024 0 ustar 00 3
���e' � @ s@ d dl mZ ddlmZ ddlmZ dd� Zdd� Zd d
� Z d S ) � )�absolute_import� )� http_client)�HeaderParsingErrorc C sf y| j � S tk
r Y nX y| jS tk
r8 Y nX y
| jdkS tk
rX Y nX td��dS )zt
Checks whether a given file-like object is closed.
:param obj:
The file-like object to check.
Nz)Unable to determine whether fp is closed.)Zisclosed�AttributeError�closed�fp�
ValueError)�obj� r � /usr/lib/python3.6/response.py� is_fp_closed s
r
c C s\ t | tj�s tdjt| ����t| dd�}t| dd�}d}|rD|� }|sL|rXt||d��dS )aP
Asserts whether all headers have been successfully parsed.
Extracts encountered errors from the result of parsing headers.
Only works on Python 3.
:param headers: Headers to verify.
:type headers: `httplib.HTTPMessage`.
:raises urllib3.exceptions.HeaderParsingError:
If parsing errors are found.
z"expected httplib.Message, got {0}.�defectsN� get_payload)r �
unparsed_data)�
isinstance�httplibZ HTTPMessage� TypeError�format�type�getattrr )Zheadersr r r r r r �assert_header_parsing& s r c C s$ | j }t|t�r|dkS |j� dkS )z�
Checks whether the request of a response has been a HEAD-request.
Handles the quirks of AppEngine.
:param conn:
:type conn: :class:`httplib.HTTPResponse`
� ZHEAD)�_methodr �int�upper)Zresponse�methodr r r �is_response_to_headE s
r N)
Z
__future__r Zpackages.six.movesr r �
exceptionsr r
r r r r r r �<module> s
pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.opt-1.pyc 0000644 00000003055 14751155150 0020071 0 ustar 00 3
���e� � @ s: d dl mZmZmZmZ d dd�Zd
dd�Zd dd�ZdS ) � )�
HAS_SELECT�DefaultSelector�
EVENT_READ� EVENT_WRITENc st t s td��t| t�s0t| d�r(| g} nt| �} t� �4}x| D ]}|j|� � q>W � fdd�|j|�D �S Q R X dS )z� Waits for IO events to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be interacted with immediately. z!Platform does not have a selector�filenoc s" g | ]}|d � @ r|d j �qS )r � )Zfileobj)�.0�key)�events� �/usr/lib/python3.6/wait.py�
<listcomp> s z'_wait_for_io_events.<locals>.<listcomp>N)r �
ValueError�
isinstance�list�hasattrr �registerZselect)�socksr
�timeoutZselectorZsockr )r
r �_wait_for_io_events s
r c C s t | t|�S )z� Waits for reading to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be read from immediately. )r r )r r r r r �
wait_for_read s r c C s t | t|�S )z� Waits for writing to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be written to immediately. )r r )r r r r r �wait_for_write$ s r )N)N)N)Z selectorsr r r r r r r r r r r �<module> s
pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.pyc 0000644 00000005744 14751155150 0020334 0 ustar 00 3
���e� � @ sn d dl mZ d dlZddlmZ ddlmZmZ dd� Zej ddfdd �Z
d
d � Z d d
� Z dd� Z
e
d�ZdS )� )�absolute_importN� )�
wait_for_read)�
HAS_SELECT�
SelectorErrorc C sV t | dd�}|dkrdS |dkr$dS ts,dS ytt|dd��S tk
rP dS X dS )a
Returns True if the connection is dropped and should be closed.
:param conn:
:class:`httplib.HTTPConnection` object.
Note: For platforms like AppEngine, this will always return ``False`` to
let the platform handle connection recycling transparently for us.
�sockFNTg )�timeout)�getattrr �boolr r )Zconnr � r � /usr/lib/python3.6/connection.py�is_connection_dropped s
r
c C s� | \}}|j d�r |jd�}d}t� }x�tj|||tj�D ]�}|\} }
} } }
d}yHtj| |
| �}t||� |tjk r~|j|� |r�|j |� |j
|
� |S tj k
r� } z |}|dk r�|j � d}W Y dd}~X q:X q:W |dk r�|�tj d��dS )ad Connect to *address* and return the socket object.
Convenience function. Connect to *address* (a 2-tuple ``(host,
port)``) and return the socket object. Passing the optional
*timeout* parameter will set the timeout on the socket instance
before attempting to connect. If no *timeout* is supplied, the
global default timeout setting returned by :func:`getdefaulttimeout`
is used. If *source_address* is set it must be a tuple of (host, port)
for the socket to bind as a source address before making the connection.
An host of '' or port 0 tells the OS to use the default.
�[z[]Nz!getaddrinfo returns an empty list)
�
startswith�strip�allowed_gai_family�socketZ getaddrinfoZ SOCK_STREAM�_set_socket_options�_GLOBAL_DEFAULT_TIMEOUTZ
settimeout�bindZconnect�error�close)Zaddressr Zsource_addressZsocket_options�hostZport�err�family�resZafZsocktype�protoZ canonnameZsar �er r r �create_connection$ s2
r c C s( |d kr d S x|D ]}| j |� qW d S )N)Z
setsockopt)r Zoptions�optr r r r X s
r c C s t j} trt j} | S )z�This function is designed to work in the context of
getaddrinfo, where family=socket.AF_UNSPEC is the default and
will perform a DNS search for both IPv6 and IPv4 records.)r ZAF_INET�HAS_IPV6Z AF_UNSPEC)r r r r r ` s r c C sV d}d}t jrFy"t j t j�}|j| df� d}W n tk
rD Y nX |rR|j� |S )z6 Returns True if the system can bind an IPv6 address. NFr T)r �has_ipv6ZAF_INET6r � Exceptionr )r r r! r r r � _has_ipv6k s r# z::1)Z
__future__r r �waitr Z selectorsr r r
r r r r r# r r r r r �<module> s 3 pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.opt-1.pyc 0000644 00000005744 14751155150 0021273 0 ustar 00 3
���e� � @ sn d dl mZ d dlZddlmZ ddlmZmZ dd� Zej ddfdd �Z
d
d � Z d d
� Z dd� Z
e
d�ZdS )� )�absolute_importN� )�
wait_for_read)�
HAS_SELECT�
SelectorErrorc C sV t | dd�}|dkrdS |dkr$dS ts,dS ytt|dd��S tk
rP dS X dS )a
Returns True if the connection is dropped and should be closed.
:param conn:
:class:`httplib.HTTPConnection` object.
Note: For platforms like AppEngine, this will always return ``False`` to
let the platform handle connection recycling transparently for us.
�sockFNTg )�timeout)�getattrr �boolr r )Zconnr � r � /usr/lib/python3.6/connection.py�is_connection_dropped s
r
c C s� | \}}|j d�r |jd�}d}t� }x�tj|||tj�D ]�}|\} }
} } }
d}yHtj| |
| �}t||� |tjk r~|j|� |r�|j |� |j
|
� |S tj k
r� } z |}|dk r�|j � d}W Y dd}~X q:X q:W |dk r�|�tj d��dS )ad Connect to *address* and return the socket object.
Convenience function. Connect to *address* (a 2-tuple ``(host,
port)``) and return the socket object. Passing the optional
*timeout* parameter will set the timeout on the socket instance
before attempting to connect. If no *timeout* is supplied, the
global default timeout setting returned by :func:`getdefaulttimeout`
is used. If *source_address* is set it must be a tuple of (host, port)
for the socket to bind as a source address before making the connection.
An host of '' or port 0 tells the OS to use the default.
�[z[]Nz!getaddrinfo returns an empty list)
�
startswith�strip�allowed_gai_family�socketZ getaddrinfoZ SOCK_STREAM�_set_socket_options�_GLOBAL_DEFAULT_TIMEOUTZ
settimeout�bindZconnect�error�close)Zaddressr Zsource_addressZsocket_options�hostZport�err�family�resZafZsocktype�protoZ canonnameZsar �er r r �create_connection$ s2
r c C s( |d kr d S x|D ]}| j |� qW d S )N)Z
setsockopt)r Zoptions�optr r r r X s
r c C s t j} trt j} | S )z�This function is designed to work in the context of
getaddrinfo, where family=socket.AF_UNSPEC is the default and
will perform a DNS search for both IPv6 and IPv4 records.)r ZAF_INET�HAS_IPV6Z AF_UNSPEC)r r r r r ` s r c C sV d}d}t jrFy"t j t j�}|j| df� d}W n tk
rD Y nX |rR|j� |S )z6 Returns True if the system can bind an IPv6 address. NFr T)r �has_ipv6ZAF_INET6r � Exceptionr )r r r! r r r � _has_ipv6k s r# z::1)Z
__future__r r �waitr Z selectorsr r r
r r r r r# r r r r r �<module> s 3 pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.pyc 0000644 00000003055 14751155150 0017132 0 ustar 00 3
���e� � @ s: d dl mZmZmZmZ d dd�Zd
dd�Zd dd�ZdS ) � )�
HAS_SELECT�DefaultSelector�
EVENT_READ� EVENT_WRITENc st t s td��t| t�s0t| d�r(| g} nt| �} t� �4}x| D ]}|j|� � q>W � fdd�|j|�D �S Q R X dS )z� Waits for IO events to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be interacted with immediately. z!Platform does not have a selector�filenoc s" g | ]}|d � @ r|d j �qS )r � )Zfileobj)�.0�key)�events� �/usr/lib/python3.6/wait.py�
<listcomp> s z'_wait_for_io_events.<locals>.<listcomp>N)r �
ValueError�
isinstance�list�hasattrr �registerZselect)�socksr
�timeoutZselectorZsockr )r
r �_wait_for_io_events s
r c C s t | t|�S )z� Waits for reading to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be read from immediately. )r r )r r r r r �
wait_for_read s r c C s t | t|�S )z� Waits for writing to be available from a list of sockets
or optionally a single socket if passed in. Returns a list of
sockets that can be written to immediately. )r r )r r r r r �wait_for_write$ s r )N)N)N)Z selectorsr r r r r r r r r r r �<module> s
pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.pyc 0000644 00000002026 14751155150 0017722 0 ustar 00 3
���e � @ s� d dl mZ ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z m Z m
Z
mZmZmZ ddlmZmZ ddlmZ dd lmZmZmZmZ dd
lm Z m Z d Z d S )!� )�absolute_import� )�is_connection_dropped)� make_headers)� is_fp_closed)�
SSLContext�HAS_SNI� IS_PYOPENSSL�IS_SECURETRANSPORT�assert_fingerprint�resolve_cert_reqs�resolve_ssl_version�ssl_wrap_socket)� current_time�Timeout)�Retry)�get_host� parse_url� split_first�Url)�
wait_for_read�wait_for_writer r r
r r r r r r r r r r r r r
r r r r N)r r r
r r r r r r r r r r r r r
r r r r ) Z
__future__r Z
connectionr Zrequestr Zresponser Zssl_r r r r
r r r
r Ztimeoutr r Zretryr Zurlr r r r �waitr r �__all__� r r � /usr/lib/python3.6/__init__.py�<module> s8 (
pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.pyc 0000644 00000021265 14751155150 0017131 0 ustar 00 3
���e�/ � ! @ s� d dl mZ d dlZd dlZd dlZd dlmZmZ d dlm Z m
Z
m Z ddl m
Z
mZmZ dZdZdZdZe e
e d�Zd d
� Zeed e�Zy,d dlZd d lmZmZmZ d d
lmZ W n e k
r� Y nX yd dlm Z m Z m Z W n" e k
�r d0\Z Z dZ Y nX dj dddddddddd d d d d d!d"g�Z!yd d#lmZ W n. e k
�rr d dl"Z"G d$d%� d%e#�ZY nX d&d'� Z$d(d)� Z%d*d+� Z&d1d,d-�Z'd2d.d/�Z(dS )3� )�absolute_importN)�hexlify� unhexlify)�md5�sha1�sha256� )�SSLError�InsecurePlatformWarning�SNIMissingWarningF)� �( �@ c C sH t t| �t|� �}x*tt| �t|��D ]\}}|||A O }q(W |dkS )z�
Compare two digests of equal length in constant time.
The digests must be of type str/bytes.
Returns True if the digests match, and False otherwise.
r )�abs�len�zip� bytearray)�a�b�result�l�r� r �/usr/lib/python3.6/ssl_.py� _const_compare_digest_backport s r Zcompare_digest)� wrap_socket� CERT_NONE�PROTOCOL_SSLv23)�HAS_SNI)� OP_NO_SSLv2� OP_NO_SSLv3�OP_NO_COMPRESSION� � i �:zTLS13-AES-256-GCM-SHA384z TLS13-CHACHA20-POLY1305-SHA256zTLS13-AES-128-GCM-SHA256z ECDH+AESGCMz
ECDH+CHACHA20z DH+AESGCMz DH+CHACHA20z ECDH+AES256z DH+AES256z ECDH+AES128zDH+AESz
RSA+AESGCMzRSA+AESz!aNULLz!eNULLz!MD5)�
SSLContextc @ s\ e Zd Zdej ko dk n p*dejkZdd� Zdd� Zdd d
�Zd d � Z ddd�Z
dS )r% r � � c C s6 || _ d| _tj| _d | _d| _d | _d | _d | _ d S )NFr )
�protocol�check_hostname�sslr � verify_mode�ca_certs�options�certfile�keyfile�ciphers)�selfZprotocol_versionr r r �__init__c s zSSLContext.__init__c C s || _ || _d S )N)r. r/ )r1 r. r/ r r r �load_cert_chainn s zSSLContext.load_cert_chainNc C s || _ |d k rtd��d S )Nz-CA directories not supported in older Pythons)r, r )r1 ZcafileZcapathr r r �load_verify_locationsr s z SSLContext.load_verify_locationsc C s | j std��|| _d S )Nz�Your version of Python does not support setting a custom cipher suite. Please upgrade to Python 2.7, 3.2, or later if you need this functionality.)�supports_set_ciphers� TypeErrorr0 )r1 Z cipher_suiter r r � set_ciphersx s zSSLContext.set_ciphersFc C sT t jdt� | j| j| j| j| j|d�}| jrDt |fd| j
i|��S t |f|�S d S )Na2 A true SSLContext object is not available. This prevents urllib3 from configuring SSL appropriately and may cause certain SSL connections to fail. You can upgrade to a newer version of Python to solve this. For more information, see https://urllib3.readthedocs.io/en/latest/advanced-usage.html#ssl-warnings)r/ r. r, � cert_reqs� ssl_version� server_sider0 ) �warnings�warnr
r/ r. r, r+ r( r5 r r0 )r1 Zsocket�server_hostnamer: �kwargsr r r r � s zSSLContext.wrap_socket)r r& )r' )r' r )NN)NF) �__name__�
__module__� __qualname__�sys� version_infor5 r2 r3 r4 r7 r r r r r r% _ s
r% c C sn |j dd�j� }t|�}tj|�}|s4tdj|���t|j� �}|| �j � }t
||�sjtdj|t |����dS )z�
Checks if given fingerprint matches the supplied certificate.
:param cert:
Certificate as bytes object.
:param fingerprint:
Fingerprint as string of hexdigits, can be interspersed by colons.
r$ � z"Fingerprint of invalid length: {0}z6Fingerprints did not match. Expected "{0}", got "{1}".N) �replace�lowerr � HASHFUNC_MAP�getr �formatr �encodeZdigest�_const_compare_digestr )ZcertZ fingerprintZ
digest_lengthZhashfuncZfingerprint_bytesZ cert_digestr r r �assert_fingerprint� s
rL c C s@ | dkr t S t| t�r<tt| d�}|dkr8ttd| �}|S | S )a�
Resolves the argument to a numeric constant, which can be passed to
the wrap_socket function/method from the ssl module.
Defaults to :data:`ssl.CERT_NONE`.
If given a string it is assumed to be the name of the constant in the
:mod:`ssl` module or its abbrevation.
(So you can specify `REQUIRED` instead of `CERT_REQUIRED`.
If it's neither `None` nor a string we assume it is already the numeric
constant which can directly be passed to wrap_socket.
NZCERT_)r �
isinstance�str�getattrr* )� candidate�resr r r �resolve_cert_reqs� s
rR c C s@ | dkr t S t| t�r<tt| d�}|dkr8ttd| �}|S | S )z
like resolve_cert_reqs
NZ PROTOCOL_)r rM rN rO r* )rP rQ r r r �resolve_ssl_version� s
rS c C s� t | p
tj�}|dkr tjn|}|dkrDd}|tO }|tO }|tO }| j|O _t|dd�rl|j |pht
� ||_ t|dd�dk r�d|_ |S )a� All arguments have the same meaning as ``ssl_wrap_socket``.
By default, this function does a lot of the same work that
``ssl.create_default_context`` does on Python 3.4+. It:
- Disables SSLv2, SSLv3, and compression
- Sets a restricted set of server ciphers
If you wish to enable SSLv3, you can do::
from urllib3.util import ssl_
context = ssl_.create_urllib3_context()
context.options &= ~ssl_.OP_NO_SSLv3
You can do the same to enable compression (substituting ``COMPRESSION``
for ``SSLv3`` in the last line above).
:param ssl_version:
The desired protocol version to use. This will default to
PROTOCOL_SSLv23 which will negotiate the highest protocol that both
the server and your installation of OpenSSL support.
:param cert_reqs:
Whether to require the certificate verification. This defaults to
``ssl.CERT_REQUIRED``.
:param options:
Specific OpenSSL options. These default to ``ssl.OP_NO_SSLv2``,
``ssl.OP_NO_SSLv3``, ``ssl.OP_NO_COMPRESSION``.
:param ciphers:
Which cipher suites to allow the server to select.
:returns:
Constructed SSLContext object with specified options
:rtype: SSLContext
Nr r5 Tr) F)
r% r* r Z
CERT_REQUIREDr r r! r- rO r7 �DEFAULT_CIPHERSr+ r) )r9 r8 r- r0 �contextr r r �create_urllib3_context� s # rV c
C s� |}
|
dkrt |||d�}
|s"| r�y|
j|| � W q� tk
r\ } zt| ��W Y dd} ~ X q� tk
r� } z | jtjkr�t| ��� W Y dd} ~ X q�X n|dkr�t|
d�r�|
j� |r�|
j ||� t
r�|
j | |d�S t j
dt� |
j | �S )a
All arguments except for server_hostname, ssl_context, and ca_cert_dir have
the same meaning as they do when using :func:`ssl.wrap_socket`.
:param server_hostname:
When SNI is supported, the expected hostname of the certificate
:param ssl_context:
A pre-made :class:`SSLContext` object. If none is provided, one will
be created using :func:`create_urllib3_context`.
:param ciphers:
A string of ciphers we wish the client to support. This is not
supported on Python 2.6 as the ssl module does not support it.
:param ca_cert_dir:
A directory containing CA certificates in multiple separate files, as
supported by OpenSSL's -CApath flag or the capath argument to
SSLContext.load_verify_locations().
N)r0 �load_default_certs)r= a� An HTTPS request has been made, but the SNI (Subject Name Indication) extension to TLS is not available on this platform. This may cause the server to present an incorrect TLS certificate, which can cause validation failures. You can upgrade to a newer version of Python to solve this. For more information, see https://urllib3.readthedocs.io/en/latest/advanced-usage.html#ssl-warnings)rV r4 �IOErrorr �OSError�errno�ENOENT�hasattrrW r3 r r r; r< r ) Zsockr/ r. r8 r, r= r9 r0 Z ssl_contextZ ca_cert_dirrU �er r r �ssl_wrap_socket s. r^ )r" r# )NNNN) NNNNNNNNN))Z
__future__r rZ r; ZhmacZbinasciir r Zhashlibr r r �
exceptionsr r
r r% r Z IS_PYOPENSSLZIS_SECURETRANSPORTrG r rO rK r* r r r � ImportErrorr r r! �joinrT rB �objectrL rR rS rV r^ r r r r �<module> st
:
> pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000002026 14751155150 0020661 0 ustar 00 3
���e � @ s� d dl mZ ddlmZ ddlmZ ddlmZ ddlm Z m
Z
m Z m Z m
Z
mZmZmZ ddlmZmZ ddlmZ dd lmZmZmZmZ dd
lm Z m Z d Z d S )!� )�absolute_import� )�is_connection_dropped)� make_headers)� is_fp_closed)�
SSLContext�HAS_SNI� IS_PYOPENSSL�IS_SECURETRANSPORT�assert_fingerprint�resolve_cert_reqs�resolve_ssl_version�ssl_wrap_socket)� current_time�Timeout)�Retry)�get_host� parse_url� split_first�Url)�
wait_for_read�wait_for_writer r r
r r r r r r r r r r r r r
r r r r N)r r r
r r r r r r r r r r r r r
r r r r ) Z
__future__r Z
connectionr Zrequestr Zresponser Zssl_r r r r
r r r
r Ztimeoutr r Zretryr Zurlr r r r �waitr r �__all__� r r � /usr/lib/python3.6/__init__.py�<module> s8 (
pip/_vendor/urllib3/util/__pycache__/request.cpython-36.pyc 0000644 00000006102 14751155150 0017652 0 ustar 00 3
���ey � @ s\ d dl mZ d dlmZ ddlmZmZ ddlmZ dZ e
� Z ddd �Z d
d � Z
d d
� ZdS )� )�absolute_import)� b64encode� )�b�
integer_types)�UnrewindableBodyErrorz gzip,deflateNc C s� i }|r6t |t�rnt |t�r*dj|�}nt}||d< |rB||d< | rNd|d< |rldtt|��jd� |d< |r�dtt|��jd� |d < |r�d
|d < |S ) a
Shortcuts for generating request headers.
:param keep_alive:
If ``True``, adds 'connection: keep-alive' header.
:param accept_encoding:
Can be a boolean, list, or string.
``True`` translates to 'gzip,deflate'.
List will get joined by comma.
String will be used as provided.
:param user_agent:
String representing the user-agent you want, such as
"python-urllib3/0.6"
:param basic_auth:
Colon-separated username:password string for 'authorization: basic ...'
auth header.
:param proxy_basic_auth:
Colon-separated username:password string for 'proxy-authorization: basic ...'
auth header.
:param disable_cache:
If ``True``, adds 'cache-control: no-cache' header.
Example::
>>> make_headers(keep_alive=True, user_agent="Batman/1.0")
{'connection': 'keep-alive', 'user-agent': 'Batman/1.0'}
>>> make_headers(accept_encoding=True)
{'accept-encoding': 'gzip,deflate'}
�,zaccept-encodingz
user-agentz
keep-aliveZ
connectionzBasic zutf-8Z
authorizationzproxy-authorizationzno-cachez
cache-control)�
isinstance�str�list�join�ACCEPT_ENCODINGr r �decode)Z
keep_aliveZaccept_encodingZ
user_agentZ
basic_authZproxy_basic_authZ
disable_cacheZheaders� r � /usr/lib/python3.6/request.py� make_headers s* $
r c C sR |dk rt | |� n:t| dd�dk rNy | j� }W n ttfk
rL t}Y nX |S )z
If a position is provided, move file to that point.
Otherwise, we'll attempt to record a position for future use.
N�tell)� rewind_body�getattrr �IOError�OSError� _FAILEDTELL)�body�posr r r �set_file_positionM s
r c C st t | dd�}|dk rNt|t�rNy ||� W qp ttfk
rJ td��Y qpX n"|tkr`td��ntdt|� ��dS )z�
Attempt to rewind body to a certain position.
Primarily used for request redirects and retries.
:param body:
File-like object that supports seek.
:param int pos:
Position to seek to in file.
�seekNzAAn error occurred when rewinding request body for redirect/retry.zRUnable to record file position for rewinding request body during a redirect/retry.z4body_pos must be of type integer, instead it was %s.) r r r r r r r �
ValueError�type)r Zbody_posZ body_seekr r r r _ s
r )NNNNNN)Z
__future__r �base64r Z packages.sixr r �
exceptionsr r
�objectr r r r r r r r �<module> s
A pip/_vendor/urllib3/util/__pycache__/request.cpython-36.opt-1.pyc 0000644 00000006102 14751155150 0020611 0 ustar 00 3
���ey � @ s\ d dl mZ d dlmZ ddlmZmZ ddlmZ dZ e
� Z ddd �Z d
d � Z
d d
� ZdS )� )�absolute_import)� b64encode� )�b�
integer_types)�UnrewindableBodyErrorz gzip,deflateNc C s� i }|r6t |t�rnt |t�r*dj|�}nt}||d< |rB||d< | rNd|d< |rldtt|��jd� |d< |r�dtt|��jd� |d < |r�d
|d < |S ) a
Shortcuts for generating request headers.
:param keep_alive:
If ``True``, adds 'connection: keep-alive' header.
:param accept_encoding:
Can be a boolean, list, or string.
``True`` translates to 'gzip,deflate'.
List will get joined by comma.
String will be used as provided.
:param user_agent:
String representing the user-agent you want, such as
"python-urllib3/0.6"
:param basic_auth:
Colon-separated username:password string for 'authorization: basic ...'
auth header.
:param proxy_basic_auth:
Colon-separated username:password string for 'proxy-authorization: basic ...'
auth header.
:param disable_cache:
If ``True``, adds 'cache-control: no-cache' header.
Example::
>>> make_headers(keep_alive=True, user_agent="Batman/1.0")
{'connection': 'keep-alive', 'user-agent': 'Batman/1.0'}
>>> make_headers(accept_encoding=True)
{'accept-encoding': 'gzip,deflate'}
�,zaccept-encodingz
user-agentz
keep-aliveZ
connectionzBasic zutf-8Z
authorizationzproxy-authorizationzno-cachez
cache-control)�
isinstance�str�list�join�ACCEPT_ENCODINGr r �decode)Z
keep_aliveZaccept_encodingZ
user_agentZ
basic_authZproxy_basic_authZ
disable_cacheZheaders� r � /usr/lib/python3.6/request.py� make_headers s* $
r c C sR |dk rt | |� n:t| dd�dk rNy | j� }W n ttfk
rL t}Y nX |S )z
If a position is provided, move file to that point.
Otherwise, we'll attempt to record a position for future use.
N�tell)� rewind_body�getattrr �IOError�OSError� _FAILEDTELL)�body�posr r r �set_file_positionM s
r c C st t | dd�}|dk rNt|t�rNy ||� W qp ttfk
rJ td��Y qpX n"|tkr`td��ntdt|� ��dS )z�
Attempt to rewind body to a certain position.
Primarily used for request redirects and retries.
:param body:
File-like object that supports seek.
:param int pos:
Position to seek to in file.
�seekNzAAn error occurred when rewinding request body for redirect/retry.zRUnable to record file position for rewinding request body during a redirect/retry.z4body_pos must be of type integer, instead it was %s.) r r r r r r r �
ValueError�type)r Zbody_posZ body_seekr r r r _ s
r )NNNNNN)Z
__future__r �base64r Z packages.sixr r �
exceptionsr r
�objectr r r r r r r r �<module> s
A pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.pyc 0000644 00000020757 14751155150 0017664 0 ustar 00 3
���e & � @ sT d dl mZ d dlmZ d dlZddlmZ e� Ze edej�Z
G dd� de�Z dS ) � )�absolute_import)�_GLOBAL_DEFAULT_TIMEOUTN� )�TimeoutStateErrorZ monotonicc @ st e Zd ZdZeZdeefdd�Zdd� Ze dd� �Z
e d d
� �Z d d � Z d
d� Z
dd� Zedd� �Zedd� �ZdS )�Timeouta� Timeout configuration.
Timeouts can be defined as a default for a pool::
timeout = Timeout(connect=2.0, read=7.0)
http = PoolManager(timeout=timeout)
response = http.request('GET', 'http://example.com/')
Or per-request (which overrides the default for the pool)::
response = http.request('GET', 'http://example.com/', timeout=Timeout(10))
Timeouts can be disabled by setting all the parameters to ``None``::
no_timeout = Timeout(connect=None, read=None)
response = http.request('GET', 'http://example.com/, timeout=no_timeout)
:param total:
This combines the connect and read timeouts into one; the read timeout
will be set to the time leftover from the connect attempt. In the
event that both a connect timeout and a total are specified, or a read
timeout and a total are specified, the shorter timeout will be applied.
Defaults to None.
:type total: integer, float, or None
:param connect:
The maximum amount of time to wait for a connection attempt to a server
to succeed. Omitting the parameter will default the connect timeout to
the system default, probably `the global default timeout in socket.py
<http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
None will set an infinite timeout for connection attempts.
:type connect: integer, float, or None
:param read:
The maximum amount of time to wait between consecutive
read operations for a response from the server. Omitting
the parameter will default the read timeout to the system
default, probably `the global default timeout in socket.py
<http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
None will set an infinite timeout.
:type read: integer, float, or None
.. note::
Many factors can affect the total amount of time for urllib3 to return
an HTTP response.
For example, Python's DNS resolver does not obey the timeout specified
on the socket. Other factors that can affect total request time include
high CPU load, high swap, the program running at a low priority level,
or other behaviors.
In addition, the read and total timeouts only measure the time between
read operations on the socket connecting the client and the server,
not the total amount of time for the request to return a complete
response. For most requests, the timeout is raised because the server
has not sent the first byte in the specified time. This is not always
the case; if a server streams one byte every fifteen seconds, a timeout
of 20 seconds will not trigger, even though the request will take
several minutes to complete.
If your goal is to cut off any request after a set amount of wall clock
time, consider having a second "watcher" thread to cut off a slow
request.
Nc C s4 | j |d�| _| j |d�| _| j |d�| _d | _d S )N�connect�read�total)�_validate_timeout�_connect�_readr �_start_connect)�selfr r r � r � /usr/lib/python3.6/timeout.py�__init__] s zTimeout.__init__c C s dt | �j| j| j| jf S )Nz!%s(connect=%r, read=%r, total=%r))�type�__name__r r r )r r r r �__str__c s zTimeout.__str__c C s� |t kr| jS |dks || jkr$|S t|t�r6td��y t|� W n( ttfk
rj td||f ��Y nX y |dkr�td||f ��W n$ tk
r� td||f ��Y nX |S )a� Check that a timeout attribute is valid.
:param value: The timeout value to validate
:param name: The name of the timeout attribute to validate. This is
used to specify in error messages.
:return: The validated and casted version of the given value.
:raises ValueError: If it is a numeric value less than or equal to
zero, or the type is not an integer, float, or None.
NzDTimeout cannot be a boolean value. It must be an int, float or None.z>Timeout value %s was %s, but it must be an int, float or None.r zdAttempted to set %s timeout to %s, but the timeout cannot be set to a value less than or equal to 0.)�_Default�DEFAULT_TIMEOUT�
isinstance�bool�
ValueError�float� TypeError)�cls�value�namer r r r
g s&
zTimeout._validate_timeoutc C s t ||d�S )a� Create a new Timeout from a legacy timeout value.
The timeout value used by httplib.py sets the same timeout on the
connect(), and recv() socket requests. This creates a :class:`Timeout`
object that sets the individual timeouts to the ``timeout`` value
passed to this function.
:param timeout: The legacy timeout value.
:type timeout: integer, float, sentinel default object, or None
:return: Timeout object
:rtype: :class:`Timeout`
)r r )r )r Ztimeoutr r r �
from_float� s zTimeout.from_floatc C s t | j| j| jd�S )a Create a copy of the timeout object
Timeout properties are stored per-pool but each request needs a fresh
Timeout object to ensure each one has its own start/stop configured.
:return: a copy of the timeout object
:rtype: :class:`Timeout`
)r r r )r r r r )r r r r �clone� s
z
Timeout.clonec C s | j dk rtd��t� | _ | j S )z� Start the timeout clock, used during a connect() attempt
:raises urllib3.exceptions.TimeoutStateError: if you attempt
to start a timer that has been started already.
Nz'Timeout timer has already been started.)r
r � current_time)r r r r �
start_connect� s
zTimeout.start_connectc C s | j dkrtd��t� | j S )a Gets the time elapsed since the call to :meth:`start_connect`.
:return: Elapsed time.
:rtype: float
:raises urllib3.exceptions.TimeoutStateError: if you attempt
to get duration for a timer that hasn't been started.
Nz:Can't get connect duration for timer that has not started.)r
r r! )r r r r �get_connect_duration� s
z Timeout.get_connect_durationc C s: | j dkr| jS | jdks&| j| jkr,| j S t| j| j �S )a" Get the value to use when setting a connection timeout.
This will be a positive float or integer, the value None
(never timeout), or the default system timeout.
:return: Connect timeout.
:rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
N)r r r �min)r r r r �connect_timeout� s
zTimeout.connect_timeoutc C s� | j dk rX| j | jk rX| jdk rX| j| jk rX| jdkr<| jS tdt| j | j� | j��S | j dk r�| j | jk r�td| j | j� �S | jS dS )a� Get the value for the read timeout.
This assumes some time has elapsed in the connection timeout and
computes the read timeout appropriately.
If self.total is set, the read timeout is dependent on the amount of
time taken by the connect timeout. If the connection time has not been
established, a :exc:`~urllib3.exceptions.TimeoutStateError` will be
raised.
:return: Value to use for the read timeout.
:rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
:raises urllib3.exceptions.TimeoutStateError: If :meth:`start_connect`
has not yet been called on this object.
Nr )r r r r
�maxr$ r# )r r r r � read_timeout� s
zTimeout.read_timeout)r �
__module__� __qualname__�__doc__r r r r r � classmethodr
r r r" r# �propertyr% r' r r r r r s F %
r ) Z
__future__r Zsocketr Ztime�
exceptionsr �objectr �getattrr! r r r r r �<module> s pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.opt-1.pyc 0000644 00000020757 14751155150 0020623 0 ustar 00 3
���e & � @ sT d dl mZ d dlmZ d dlZddlmZ e� Ze edej�Z
G dd� de�Z dS ) � )�absolute_import)�_GLOBAL_DEFAULT_TIMEOUTN� )�TimeoutStateErrorZ monotonicc @ st e Zd ZdZeZdeefdd�Zdd� Ze dd� �Z
e d d
� �Z d d � Z d
d� Z
dd� Zedd� �Zedd� �ZdS )�Timeouta� Timeout configuration.
Timeouts can be defined as a default for a pool::
timeout = Timeout(connect=2.0, read=7.0)
http = PoolManager(timeout=timeout)
response = http.request('GET', 'http://example.com/')
Or per-request (which overrides the default for the pool)::
response = http.request('GET', 'http://example.com/', timeout=Timeout(10))
Timeouts can be disabled by setting all the parameters to ``None``::
no_timeout = Timeout(connect=None, read=None)
response = http.request('GET', 'http://example.com/, timeout=no_timeout)
:param total:
This combines the connect and read timeouts into one; the read timeout
will be set to the time leftover from the connect attempt. In the
event that both a connect timeout and a total are specified, or a read
timeout and a total are specified, the shorter timeout will be applied.
Defaults to None.
:type total: integer, float, or None
:param connect:
The maximum amount of time to wait for a connection attempt to a server
to succeed. Omitting the parameter will default the connect timeout to
the system default, probably `the global default timeout in socket.py
<http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
None will set an infinite timeout for connection attempts.
:type connect: integer, float, or None
:param read:
The maximum amount of time to wait between consecutive
read operations for a response from the server. Omitting
the parameter will default the read timeout to the system
default, probably `the global default timeout in socket.py
<http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
None will set an infinite timeout.
:type read: integer, float, or None
.. note::
Many factors can affect the total amount of time for urllib3 to return
an HTTP response.
For example, Python's DNS resolver does not obey the timeout specified
on the socket. Other factors that can affect total request time include
high CPU load, high swap, the program running at a low priority level,
or other behaviors.
In addition, the read and total timeouts only measure the time between
read operations on the socket connecting the client and the server,
not the total amount of time for the request to return a complete
response. For most requests, the timeout is raised because the server
has not sent the first byte in the specified time. This is not always
the case; if a server streams one byte every fifteen seconds, a timeout
of 20 seconds will not trigger, even though the request will take
several minutes to complete.
If your goal is to cut off any request after a set amount of wall clock
time, consider having a second "watcher" thread to cut off a slow
request.
Nc C s4 | j |d�| _| j |d�| _| j |d�| _d | _d S )N�connect�read�total)�_validate_timeout�_connect�_readr �_start_connect)�selfr r r � r � /usr/lib/python3.6/timeout.py�__init__] s zTimeout.__init__c C s dt | �j| j| j| jf S )Nz!%s(connect=%r, read=%r, total=%r))�type�__name__r r r )r r r r �__str__c s zTimeout.__str__c C s� |t kr| jS |dks || jkr$|S t|t�r6td��y t|� W n( ttfk
rj td||f ��Y nX y |dkr�td||f ��W n$ tk
r� td||f ��Y nX |S )a� Check that a timeout attribute is valid.
:param value: The timeout value to validate
:param name: The name of the timeout attribute to validate. This is
used to specify in error messages.
:return: The validated and casted version of the given value.
:raises ValueError: If it is a numeric value less than or equal to
zero, or the type is not an integer, float, or None.
NzDTimeout cannot be a boolean value. It must be an int, float or None.z>Timeout value %s was %s, but it must be an int, float or None.r zdAttempted to set %s timeout to %s, but the timeout cannot be set to a value less than or equal to 0.)�_Default�DEFAULT_TIMEOUT�
isinstance�bool�
ValueError�float� TypeError)�cls�value�namer r r r
g s&
zTimeout._validate_timeoutc C s t ||d�S )a� Create a new Timeout from a legacy timeout value.
The timeout value used by httplib.py sets the same timeout on the
connect(), and recv() socket requests. This creates a :class:`Timeout`
object that sets the individual timeouts to the ``timeout`` value
passed to this function.
:param timeout: The legacy timeout value.
:type timeout: integer, float, sentinel default object, or None
:return: Timeout object
:rtype: :class:`Timeout`
)r r )r )r Ztimeoutr r r �
from_float� s zTimeout.from_floatc C s t | j| j| jd�S )a Create a copy of the timeout object
Timeout properties are stored per-pool but each request needs a fresh
Timeout object to ensure each one has its own start/stop configured.
:return: a copy of the timeout object
:rtype: :class:`Timeout`
)r r r )r r r r )r r r r �clone� s
z
Timeout.clonec C s | j dk rtd��t� | _ | j S )z� Start the timeout clock, used during a connect() attempt
:raises urllib3.exceptions.TimeoutStateError: if you attempt
to start a timer that has been started already.
Nz'Timeout timer has already been started.)r
r � current_time)r r r r �
start_connect� s
zTimeout.start_connectc C s | j dkrtd��t� | j S )a Gets the time elapsed since the call to :meth:`start_connect`.
:return: Elapsed time.
:rtype: float
:raises urllib3.exceptions.TimeoutStateError: if you attempt
to get duration for a timer that hasn't been started.
Nz:Can't get connect duration for timer that has not started.)r
r r! )r r r r �get_connect_duration� s
z Timeout.get_connect_durationc C s: | j dkr| jS | jdks&| j| jkr,| j S t| j| j �S )a" Get the value to use when setting a connection timeout.
This will be a positive float or integer, the value None
(never timeout), or the default system timeout.
:return: Connect timeout.
:rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
N)r r r �min)r r r r �connect_timeout� s
zTimeout.connect_timeoutc C s� | j dk rX| j | jk rX| jdk rX| j| jk rX| jdkr<| jS tdt| j | j� | j��S | j dk r�| j | jk r�td| j | j� �S | jS dS )a� Get the value for the read timeout.
This assumes some time has elapsed in the connection timeout and
computes the read timeout appropriately.
If self.total is set, the read timeout is dependent on the amount of
time taken by the connect timeout. If the connection time has not been
established, a :exc:`~urllib3.exceptions.TimeoutStateError` will be
raised.
:return: Value to use for the read timeout.
:rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
:raises urllib3.exceptions.TimeoutStateError: If :meth:`start_connect`
has not yet been called on this object.
Nr )r r r r
�maxr$ r# )r r r r � read_timeout� s
zTimeout.read_timeout)r �
__module__� __qualname__�__doc__r r r r r � classmethodr
r r r" r# �propertyr% r' r r r r r s F %
r ) Z
__future__r Zsocketr Ztime�
exceptionsr �objectr �getattrr! r r r r r �<module> s pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.opt-1.pyc 0000644 00000030433 14751155150 0020272 0 ustar 00 3
���e ; � @ s� d dl mZ d dlZd dlZd dlmZ d dlmZ d dlZd dl Z ddl
m Z m Z m
Z
mZmZmZ ddlmZ eje�Zedd d
d d d
g�ZG dd� de�Zed�e_dS )� )�absolute_importN)�
namedtuple)� takewhile� )�ConnectTimeoutError�
MaxRetryError�
ProtocolError�ReadTimeoutError�
ResponseError�
InvalidHeader)�six�RequestHistory�method�url�error�status�redirect_locationc
@ s� e Zd ZdZeddddddg�Zedg�Zed d
d g�Zd Zd
ddddeddddddef
dd�Z dd� Z
e d2dd��Z dd� Z
dd� Zdd � Zd3d d �Zd d � Zd4d!d"�Zd#d$� Zd%d&� Zd'd(� Zd5d*d+�Zd,d-� Zd6d.d/�Zd0d1� ZdS )7�Retrya2 Retry configuration.
Each retry attempt will create a new Retry object with updated values, so
they can be safely reused.
Retries can be defined as a default for a pool::
retries = Retry(connect=5, read=2, redirect=5)
http = PoolManager(retries=retries)
response = http.request('GET', 'http://example.com/')
Or per-request (which overrides the default for the pool)::
response = http.request('GET', 'http://example.com/', retries=Retry(10))
Retries can be disabled by passing ``False``::
response = http.request('GET', 'http://example.com/', retries=False)
Errors will be wrapped in :class:`~urllib3.exceptions.MaxRetryError` unless
retries are disabled, in which case the causing exception will be raised.
:param int total:
Total number of retries to allow. Takes precedence over other counts.
Set to ``None`` to remove this constraint and fall back on other
counts. It's a good idea to set this to some sensibly-high value to
account for unexpected edge cases and avoid infinite retry loops.
Set to ``0`` to fail on the first retry.
Set to ``False`` to disable and imply ``raise_on_redirect=False``.
:param int connect:
How many connection-related errors to retry on.
These are errors raised before the request is sent to the remote server,
which we assume has not triggered the server to process the request.
Set to ``0`` to fail on the first retry of this type.
:param int read:
How many times to retry on read errors.
These errors are raised after the request was sent to the server, so the
request may have side-effects.
Set to ``0`` to fail on the first retry of this type.
:param int redirect:
How many redirects to perform. Limit this to avoid infinite redirect
loops.
A redirect is a HTTP response with a status code 301, 302, 303, 307 or
308.
Set to ``0`` to fail on the first retry of this type.
Set to ``False`` to disable and imply ``raise_on_redirect=False``.
:param int status:
How many times to retry on bad status codes.
These are retries made on responses, where status code matches
``status_forcelist``.
Set to ``0`` to fail on the first retry of this type.
:param iterable method_whitelist:
Set of uppercased HTTP method verbs that we should retry on.
By default, we only retry on methods which are considered to be
idempotent (multiple requests with the same parameters end with the
same state). See :attr:`Retry.DEFAULT_METHOD_WHITELIST`.
Set to a ``False`` value to retry on any verb.
:param iterable status_forcelist:
A set of integer HTTP status codes that we should force a retry on.
A retry is initiated if the request method is in ``method_whitelist``
and the response status code is in ``status_forcelist``.
By default, this is disabled with ``None``.
:param float backoff_factor:
A backoff factor to apply between attempts after the second try
(most errors are resolved immediately by a second try without a
delay). urllib3 will sleep for::
{backoff factor} * (2 ^ ({number of total retries} - 1))
seconds. If the backoff_factor is 0.1, then :func:`.sleep` will sleep
for [0.0s, 0.2s, 0.4s, ...] between retries. It will never be longer
than :attr:`Retry.BACKOFF_MAX`.
By default, backoff is disabled (set to 0).
:param bool raise_on_redirect: Whether, if the number of redirects is
exhausted, to raise a MaxRetryError, or to return a response with a
response code in the 3xx range.
:param iterable remove_headers_on_redirect:
Sequence of headers to remove from the request when a response
indicating a redirect is returned before firing off the redirected
request
:param bool raise_on_status: Similar meaning to ``raise_on_redirect``:
whether we should raise an exception, or return a response,
if status falls in ``status_forcelist`` range and retries have
been exhausted.
:param tuple history: The history of the request encountered during
each call to :meth:`~Retry.increment`. The list is in the order
the requests occurred. Each list item is of class :class:`RequestHistory`.
:param bool respect_retry_after_header:
Whether to respect Retry-After header on status codes defined as
:attr:`Retry.RETRY_AFTER_STATUS_CODES` or not.
ZHEADZGETZPUTZDELETEZOPTIONSZTRACEZ
Authorizationi� i� i� �x �
Nr Tc C sv || _ || _|| _|| _|dks(|dkr0d}d} || _|p>t� | _|| _|| _| | _ |
| _
| pbt � | _ | | _
|
| _d S )NFr )�total�connect�readr �redirect�set�status_forcelist�method_whitelist�backoff_factor�raise_on_redirect�raise_on_status�tuple�history�respect_retry_after_header�remove_headers_on_redirect)�selfr r r r r r r r r r r! r" r# � r% �/usr/lib/python3.6/retry.py�__init__� s zRetry.__init__c K sP t | j| j| j| j| j| j| j| j| j | j
| j | j d� }|j
|� t| �f |�S )N) r r r r r r r r r r r! r# )�dictr r r r r r r r r r r! r# �update�type)r$ �kwZparamsr% r% r& �new� s
z Retry.newc C sR |dkr|dk r|n| j }t|t�r(|S t|�o2d}| ||d�}tjd||� |S )z4 Backwards-compatibility for the old retries format.N)r z!Converted retries value: %r -> %r)�DEFAULT�
isinstancer �bool�log�debug)�clsZretriesr �defaultZ new_retriesr% r% r& �from_int� s
zRetry.from_intc C sF t ttdd� t| j����}|dkr(dS | jd|d }t| j|�S )zJ Formula for computing the current backoff
:rtype: float
c S s
| j d kS )N)r )�xr% r% r& �<lambda>� s z(Retry.get_backoff_time.<locals>.<lambda>� r r )�len�listr �reversedr! r �min� BACKOFF_MAX)r$ Zconsecutive_errors_lenZ
backoff_valuer% r% r& �get_backoff_time� s zRetry.get_backoff_timec C s\ t jd|�rt|�}n6tjj|�}|d kr6td| ��tj|�}|tj� }|dk rXd}|S )Nz^\s*[0-9]+\s*$z Invalid Retry-After header: %sr ) �re�match�int�emailZutilsZ parsedater �timeZmktime)r$ � retry_afterZsecondsZretry_date_tupleZ
retry_dater% r% r& �parse_retry_after� s
zRetry.parse_retry_afterc C s |j d�}|dkrdS | j|�S )z* Get the value of Retry-After in seconds. z Retry-AfterN)Z getheaderrD )r$ �responserC r% r% r& �get_retry_after� s
zRetry.get_retry_afterc C s | j |�}|r tj|� dS dS )NTF)rF rB �sleep)r$ rE rC r% r% r& �sleep_for_retry� s
zRetry.sleep_for_retryc C s" | j � }|dkrd S tj|� d S )Nr )r= rB rG )r$ Zbackoffr% r% r& �_sleep_backoff s zRetry._sleep_backoffc C s" |r| j |�}|rdS | j� dS )aC Sleep between retry attempts.
This method will respect a server's ``Retry-After`` response header
and sleep the duration of the time requested. If that is not present, it
will use an exponential backoff. By default, the backoff factor is 0 and
this method will return immediately.
N)rH rI )r$ rE Zsleptr% r% r& rG s
z Retry.sleepc C s
t |t�S )z{ Errors when we're fairly sure that the server did not receive the
request, so it should be safe to retry.
)r. r )r$ �errr% r% r& �_is_connection_error s zRetry._is_connection_errorc C s t |ttf�S )z� Errors that occur after the request has been started, so we should
assume that the server began processing it.
)r. r r )r$ rJ r% r% r& �_is_read_error! s zRetry._is_read_errorc C s | j r|j� | j krdS dS )z| Checks if a given HTTP method should be retried upon, depending if
it is included on the method whitelist.
FT)r �upper)r$ r r% r% r& �_is_method_retryable' s zRetry._is_method_retryableFc C s< | j |�sdS | jr"|| jkr"dS | jo:| jo:|o:|| jkS )ax Is this method/status code retryable? (Based on whitelists and control
variables such as the number of total retries to allow, whether to
respect the Retry-After header, whether this header is present, and
whether the returned status code is on the list of status codes to
be retried upon on the presence of the aforementioned header)
FT)rN r r r" �RETRY_AFTER_STATUS_CODES)r$ r � status_codeZhas_retry_afterr% r% r& �is_retry0 s
zRetry.is_retryc C s: | j | j| j| j| jf}ttd|��}|s.dS t|�dk S )z Are we out of retries? NFr )r r r r r r9 �filterr; )r$ Z retry_countsr% r% r& � is_exhausted@ s
zRetry.is_exhaustedc C s� | j dkr |r tjt|�||��| j }|dk r6|d8 }| j}| j} | j}
| j} d} d}
d}|r�| j|�r�|dkr�tjt|�||��n|dk r�|d8 }n�|r�| j |�r�| dks�| j
|� r�tjt|�||��n| dk r�| d8 } nn|o�|j � �r|
dk r�|
d8 }
d} |j � }|j}
n<t j
} |�rL|j�rL| dk �r6| d8 } t jj|jd�} |j}
| jt||||
|�f }| j||| |
| |d�}|j� �r�t|||�p�t | ���tjd||� |S ) a� Return a new Retry object with incremented retry counters.
:param response: A response object, or None, if the server did not
return a response.
:type response: :class:`~urllib3.response.HTTPResponse`
:param Exception error: An error encountered during the request, or
None if the response was received successfully.
:return: A new ``Retry`` object.
FNr7 �unknownztoo many redirects)rP )r r r r r r! z$Incremented Retry for (url='%s'): %r)r r Zreraiser* r r r r rK rL rN Zget_redirect_locationr
Z
GENERIC_ERRORZSPECIFIC_ERROR�formatr! r
r, rS r r0 r1 )r$ r r rE r Z_poolZ _stacktracer r r r Z status_count�causer r r! Z new_retryr% r% r& � incrementI sX
zRetry.incrementc C s dj t| �| d�S )Nz|{cls.__name__}(total={self.total}, connect={self.connect}, read={self.read}, redirect={self.redirect}, status={self.status}))r2 r$ )rU r* )r$ r% r% r& �__repr__� s zRetry.__repr__)TN)N)N)F)NNNNNN)�__name__�
__module__� __qualname__�__doc__� frozensetZDEFAULT_METHOD_WHITELISTZ"DEFAULT_REDIRECT_HEADERS_BLACKLISTrO r< r' r, � classmethodr4 r= rD rF rH rI rG rK rL rN rQ rS rW rX r% r% r% r& r s8 x
Jr � )Z
__future__r rB Zlogging� collectionsr � itertoolsr rA r> �
exceptionsr r r r r
r Zpackagesr Z getLoggerrY r0 r
�objectr r- r% r% r% r& �<module> s
pip/_vendor/urllib3/util/request.py 0000644 00000007171 14751155150 0013375 0 ustar 00 from __future__ import absolute_import
from base64 import b64encode
from ..packages.six import b, integer_types
from ..exceptions import UnrewindableBodyError
ACCEPT_ENCODING = 'gzip,deflate'
_FAILEDTELL = object()
def make_headers(keep_alive=None, accept_encoding=None, user_agent=None,
basic_auth=None, proxy_basic_auth=None, disable_cache=None):
"""
Shortcuts for generating request headers.
:param keep_alive:
If ``True``, adds 'connection: keep-alive' header.
:param accept_encoding:
Can be a boolean, list, or string.
``True`` translates to 'gzip,deflate'.
List will get joined by comma.
String will be used as provided.
:param user_agent:
String representing the user-agent you want, such as
"python-urllib3/0.6"
:param basic_auth:
Colon-separated username:password string for 'authorization: basic ...'
auth header.
:param proxy_basic_auth:
Colon-separated username:password string for 'proxy-authorization: basic ...'
auth header.
:param disable_cache:
If ``True``, adds 'cache-control: no-cache' header.
Example::
>>> make_headers(keep_alive=True, user_agent="Batman/1.0")
{'connection': 'keep-alive', 'user-agent': 'Batman/1.0'}
>>> make_headers(accept_encoding=True)
{'accept-encoding': 'gzip,deflate'}
"""
headers = {}
if accept_encoding:
if isinstance(accept_encoding, str):
pass
elif isinstance(accept_encoding, list):
accept_encoding = ','.join(accept_encoding)
else:
accept_encoding = ACCEPT_ENCODING
headers['accept-encoding'] = accept_encoding
if user_agent:
headers['user-agent'] = user_agent
if keep_alive:
headers['connection'] = 'keep-alive'
if basic_auth:
headers['authorization'] = 'Basic ' + \
b64encode(b(basic_auth)).decode('utf-8')
if proxy_basic_auth:
headers['proxy-authorization'] = 'Basic ' + \
b64encode(b(proxy_basic_auth)).decode('utf-8')
if disable_cache:
headers['cache-control'] = 'no-cache'
return headers
def set_file_position(body, pos):
"""
If a position is provided, move file to that point.
Otherwise, we'll attempt to record a position for future use.
"""
if pos is not None:
rewind_body(body, pos)
elif getattr(body, 'tell', None) is not None:
try:
pos = body.tell()
except (IOError, OSError):
# This differentiates from None, allowing us to catch
# a failed `tell()` later when trying to rewind the body.
pos = _FAILEDTELL
return pos
def rewind_body(body, body_pos):
"""
Attempt to rewind body to a certain position.
Primarily used for request redirects and retries.
:param body:
File-like object that supports seek.
:param int pos:
Position to seek to in file.
"""
body_seek = getattr(body, 'seek', None)
if body_seek is not None and isinstance(body_pos, integer_types):
try:
body_seek(body_pos)
except (IOError, OSError):
raise UnrewindableBodyError("An error occurred when rewinding request "
"body for redirect/retry.")
elif body_pos is _FAILEDTELL:
raise UnrewindableBodyError("Unable to record file position for rewinding "
"request body during a redirect/retry.")
else:
raise ValueError("body_pos must be of type integer, "
"instead it was %s." % type(body_pos))
pip/_vendor/urllib3/util/timeout.py 0000644 00000023035 14751155150 0013370 0 ustar 00 from __future__ import absolute_import
# The default socket timeout, used by httplib to indicate that no timeout was
# specified by the user
from socket import _GLOBAL_DEFAULT_TIMEOUT
import time
from ..exceptions import TimeoutStateError
# A sentinel value to indicate that no timeout was specified by the user in
# urllib3
_Default = object()
# Use time.monotonic if available.
current_time = getattr(time, "monotonic", time.time)
class Timeout(object):
""" Timeout configuration.
Timeouts can be defined as a default for a pool::
timeout = Timeout(connect=2.0, read=7.0)
http = PoolManager(timeout=timeout)
response = http.request('GET', 'http://example.com/')
Or per-request (which overrides the default for the pool)::
response = http.request('GET', 'http://example.com/', timeout=Timeout(10))
Timeouts can be disabled by setting all the parameters to ``None``::
no_timeout = Timeout(connect=None, read=None)
response = http.request('GET', 'http://example.com/, timeout=no_timeout)
:param total:
This combines the connect and read timeouts into one; the read timeout
will be set to the time leftover from the connect attempt. In the
event that both a connect timeout and a total are specified, or a read
timeout and a total are specified, the shorter timeout will be applied.
Defaults to None.
:type total: integer, float, or None
:param connect:
The maximum amount of time to wait for a connection attempt to a server
to succeed. Omitting the parameter will default the connect timeout to
the system default, probably `the global default timeout in socket.py
<http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
None will set an infinite timeout for connection attempts.
:type connect: integer, float, or None
:param read:
The maximum amount of time to wait between consecutive
read operations for a response from the server. Omitting
the parameter will default the read timeout to the system
default, probably `the global default timeout in socket.py
<http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
None will set an infinite timeout.
:type read: integer, float, or None
.. note::
Many factors can affect the total amount of time for urllib3 to return
an HTTP response.
For example, Python's DNS resolver does not obey the timeout specified
on the socket. Other factors that can affect total request time include
high CPU load, high swap, the program running at a low priority level,
or other behaviors.
In addition, the read and total timeouts only measure the time between
read operations on the socket connecting the client and the server,
not the total amount of time for the request to return a complete
response. For most requests, the timeout is raised because the server
has not sent the first byte in the specified time. This is not always
the case; if a server streams one byte every fifteen seconds, a timeout
of 20 seconds will not trigger, even though the request will take
several minutes to complete.
If your goal is to cut off any request after a set amount of wall clock
time, consider having a second "watcher" thread to cut off a slow
request.
"""
#: A sentinel object representing the default timeout value
DEFAULT_TIMEOUT = _GLOBAL_DEFAULT_TIMEOUT
def __init__(self, total=None, connect=_Default, read=_Default):
self._connect = self._validate_timeout(connect, 'connect')
self._read = self._validate_timeout(read, 'read')
self.total = self._validate_timeout(total, 'total')
self._start_connect = None
def __str__(self):
return '%s(connect=%r, read=%r, total=%r)' % (
type(self).__name__, self._connect, self._read, self.total)
@classmethod
def _validate_timeout(cls, value, name):
""" Check that a timeout attribute is valid.
:param value: The timeout value to validate
:param name: The name of the timeout attribute to validate. This is
used to specify in error messages.
:return: The validated and casted version of the given value.
:raises ValueError: If it is a numeric value less than or equal to
zero, or the type is not an integer, float, or None.
"""
if value is _Default:
return cls.DEFAULT_TIMEOUT
if value is None or value is cls.DEFAULT_TIMEOUT:
return value
if isinstance(value, bool):
raise ValueError("Timeout cannot be a boolean value. It must "
"be an int, float or None.")
try:
float(value)
except (TypeError, ValueError):
raise ValueError("Timeout value %s was %s, but it must be an "
"int, float or None." % (name, value))
try:
if value <= 0:
raise ValueError("Attempted to set %s timeout to %s, but the "
"timeout cannot be set to a value less "
"than or equal to 0." % (name, value))
except TypeError: # Python 3
raise ValueError("Timeout value %s was %s, but it must be an "
"int, float or None." % (name, value))
return value
@classmethod
def from_float(cls, timeout):
""" Create a new Timeout from a legacy timeout value.
The timeout value used by httplib.py sets the same timeout on the
connect(), and recv() socket requests. This creates a :class:`Timeout`
object that sets the individual timeouts to the ``timeout`` value
passed to this function.
:param timeout: The legacy timeout value.
:type timeout: integer, float, sentinel default object, or None
:return: Timeout object
:rtype: :class:`Timeout`
"""
return Timeout(read=timeout, connect=timeout)
def clone(self):
""" Create a copy of the timeout object
Timeout properties are stored per-pool but each request needs a fresh
Timeout object to ensure each one has its own start/stop configured.
:return: a copy of the timeout object
:rtype: :class:`Timeout`
"""
# We can't use copy.deepcopy because that will also create a new object
# for _GLOBAL_DEFAULT_TIMEOUT, which socket.py uses as a sentinel to
# detect the user default.
return Timeout(connect=self._connect, read=self._read,
total=self.total)
def start_connect(self):
""" Start the timeout clock, used during a connect() attempt
:raises urllib3.exceptions.TimeoutStateError: if you attempt
to start a timer that has been started already.
"""
if self._start_connect is not None:
raise TimeoutStateError("Timeout timer has already been started.")
self._start_connect = current_time()
return self._start_connect
def get_connect_duration(self):
""" Gets the time elapsed since the call to :meth:`start_connect`.
:return: Elapsed time.
:rtype: float
:raises urllib3.exceptions.TimeoutStateError: if you attempt
to get duration for a timer that hasn't been started.
"""
if self._start_connect is None:
raise TimeoutStateError("Can't get connect duration for timer "
"that has not started.")
return current_time() - self._start_connect
@property
def connect_timeout(self):
""" Get the value to use when setting a connection timeout.
This will be a positive float or integer, the value None
(never timeout), or the default system timeout.
:return: Connect timeout.
:rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
"""
if self.total is None:
return self._connect
if self._connect is None or self._connect is self.DEFAULT_TIMEOUT:
return self.total
return min(self._connect, self.total)
@property
def read_timeout(self):
""" Get the value for the read timeout.
This assumes some time has elapsed in the connection timeout and
computes the read timeout appropriately.
If self.total is set, the read timeout is dependent on the amount of
time taken by the connect timeout. If the connection time has not been
established, a :exc:`~urllib3.exceptions.TimeoutStateError` will be
raised.
:return: Value to use for the read timeout.
:rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
:raises urllib3.exceptions.TimeoutStateError: If :meth:`start_connect`
has not yet been called on this object.
"""
if (self.total is not None and
self.total is not self.DEFAULT_TIMEOUT and
self._read is not None and
self._read is not self.DEFAULT_TIMEOUT):
# In case the connect timeout has not yet been established.
if self._start_connect is None:
return self._read
return max(0, min(self.total - self.get_connect_duration(),
self._read))
elif self.total is not None and self.total is not self.DEFAULT_TIMEOUT:
return max(0, self.total - self.get_connect_duration())
else:
return self._read
pip/_vendor/urllib3/util/ssl_.py 0000644 00000027666 14751155150 0012660 0 ustar 00 from __future__ import absolute_import
import errno
import warnings
import hmac
from binascii import hexlify, unhexlify
from hashlib import md5, sha1, sha256
from ..exceptions import SSLError, InsecurePlatformWarning, SNIMissingWarning
SSLContext = None
HAS_SNI = False
IS_PYOPENSSL = False
IS_SECURETRANSPORT = False
# Maps the length of a digest to a possible hash function producing this digest
HASHFUNC_MAP = {
32: md5,
40: sha1,
64: sha256,
}
def _const_compare_digest_backport(a, b):
"""
Compare two digests of equal length in constant time.
The digests must be of type str/bytes.
Returns True if the digests match, and False otherwise.
"""
result = abs(len(a) - len(b))
for l, r in zip(bytearray(a), bytearray(b)):
result |= l ^ r
return result == 0
_const_compare_digest = getattr(hmac, 'compare_digest',
_const_compare_digest_backport)
try: # Test for SSL features
import ssl
from ssl import wrap_socket, CERT_NONE, PROTOCOL_SSLv23
from ssl import HAS_SNI # Has SNI?
except ImportError:
pass
try:
from ssl import OP_NO_SSLv2, OP_NO_SSLv3, OP_NO_COMPRESSION
except ImportError:
OP_NO_SSLv2, OP_NO_SSLv3 = 0x1000000, 0x2000000
OP_NO_COMPRESSION = 0x20000
# A secure default.
# Sources for more information on TLS ciphers:
#
# - https://wiki.mozilla.org/Security/Server_Side_TLS
# - https://www.ssllabs.com/projects/best-practices/index.html
# - https://hynek.me/articles/hardening-your-web-servers-ssl-ciphers/
#
# The general intent is:
# - Prefer TLS 1.3 cipher suites
# - prefer cipher suites that offer perfect forward secrecy (DHE/ECDHE),
# - prefer ECDHE over DHE for better performance,
# - prefer any AES-GCM and ChaCha20 over any AES-CBC for better performance and
# security,
# - prefer AES-GCM over ChaCha20 because hardware-accelerated AES is common,
# - disable NULL authentication, MD5 MACs and DSS for security reasons.
DEFAULT_CIPHERS = ':'.join([
'TLS13-AES-256-GCM-SHA384',
'TLS13-CHACHA20-POLY1305-SHA256',
'TLS13-AES-128-GCM-SHA256',
'ECDH+AESGCM',
'ECDH+CHACHA20',
'DH+AESGCM',
'DH+CHACHA20',
'ECDH+AES256',
'DH+AES256',
'ECDH+AES128',
'DH+AES',
'RSA+AESGCM',
'RSA+AES',
'!aNULL',
'!eNULL',
'!MD5',
])
try:
from ssl import SSLContext # Modern SSL?
except ImportError:
import sys
class SSLContext(object): # Platform-specific: Python 2 & 3.1
supports_set_ciphers = ((2, 7) <= sys.version_info < (3,) or
(3, 2) <= sys.version_info)
def __init__(self, protocol_version):
self.protocol = protocol_version
# Use default values from a real SSLContext
self.check_hostname = False
self.verify_mode = ssl.CERT_NONE
self.ca_certs = None
self.options = 0
self.certfile = None
self.keyfile = None
self.ciphers = None
def load_cert_chain(self, certfile, keyfile):
self.certfile = certfile
self.keyfile = keyfile
def load_verify_locations(self, cafile=None, capath=None):
self.ca_certs = cafile
if capath is not None:
raise SSLError("CA directories not supported in older Pythons")
def set_ciphers(self, cipher_suite):
if not self.supports_set_ciphers:
raise TypeError(
'Your version of Python does not support setting '
'a custom cipher suite. Please upgrade to Python '
'2.7, 3.2, or later if you need this functionality.'
)
self.ciphers = cipher_suite
def wrap_socket(self, socket, server_hostname=None, server_side=False):
warnings.warn(
'A true SSLContext object is not available. This prevents '
'urllib3 from configuring SSL appropriately and may cause '
'certain SSL connections to fail. You can upgrade to a newer '
'version of Python to solve this. For more information, see '
'https://urllib3.readthedocs.io/en/latest/advanced-usage.html'
'#ssl-warnings',
InsecurePlatformWarning
)
kwargs = {
'keyfile': self.keyfile,
'certfile': self.certfile,
'ca_certs': self.ca_certs,
'cert_reqs': self.verify_mode,
'ssl_version': self.protocol,
'server_side': server_side,
}
if self.supports_set_ciphers: # Platform-specific: Python 2.7+
return wrap_socket(socket, ciphers=self.ciphers, **kwargs)
else: # Platform-specific: Python 2.6
return wrap_socket(socket, **kwargs)
def assert_fingerprint(cert, fingerprint):
"""
Checks if given fingerprint matches the supplied certificate.
:param cert:
Certificate as bytes object.
:param fingerprint:
Fingerprint as string of hexdigits, can be interspersed by colons.
"""
fingerprint = fingerprint.replace(':', '').lower()
digest_length = len(fingerprint)
hashfunc = HASHFUNC_MAP.get(digest_length)
if not hashfunc:
raise SSLError(
'Fingerprint of invalid length: {0}'.format(fingerprint))
# We need encode() here for py32; works on py2 and p33.
fingerprint_bytes = unhexlify(fingerprint.encode())
cert_digest = hashfunc(cert).digest()
if not _const_compare_digest(cert_digest, fingerprint_bytes):
raise SSLError('Fingerprints did not match. Expected "{0}", got "{1}".'
.format(fingerprint, hexlify(cert_digest)))
def resolve_cert_reqs(candidate):
"""
Resolves the argument to a numeric constant, which can be passed to
the wrap_socket function/method from the ssl module.
Defaults to :data:`ssl.CERT_NONE`.
If given a string it is assumed to be the name of the constant in the
:mod:`ssl` module or its abbrevation.
(So you can specify `REQUIRED` instead of `CERT_REQUIRED`.
If it's neither `None` nor a string we assume it is already the numeric
constant which can directly be passed to wrap_socket.
"""
if candidate is None:
return CERT_NONE
if isinstance(candidate, str):
res = getattr(ssl, candidate, None)
if res is None:
res = getattr(ssl, 'CERT_' + candidate)
return res
return candidate
def resolve_ssl_version(candidate):
"""
like resolve_cert_reqs
"""
if candidate is None:
return PROTOCOL_SSLv23
if isinstance(candidate, str):
res = getattr(ssl, candidate, None)
if res is None:
res = getattr(ssl, 'PROTOCOL_' + candidate)
return res
return candidate
def create_urllib3_context(ssl_version=None, cert_reqs=None,
options=None, ciphers=None):
"""All arguments have the same meaning as ``ssl_wrap_socket``.
By default, this function does a lot of the same work that
``ssl.create_default_context`` does on Python 3.4+. It:
- Disables SSLv2, SSLv3, and compression
- Sets a restricted set of server ciphers
If you wish to enable SSLv3, you can do::
from urllib3.util import ssl_
context = ssl_.create_urllib3_context()
context.options &= ~ssl_.OP_NO_SSLv3
You can do the same to enable compression (substituting ``COMPRESSION``
for ``SSLv3`` in the last line above).
:param ssl_version:
The desired protocol version to use. This will default to
PROTOCOL_SSLv23 which will negotiate the highest protocol that both
the server and your installation of OpenSSL support.
:param cert_reqs:
Whether to require the certificate verification. This defaults to
``ssl.CERT_REQUIRED``.
:param options:
Specific OpenSSL options. These default to ``ssl.OP_NO_SSLv2``,
``ssl.OP_NO_SSLv3``, ``ssl.OP_NO_COMPRESSION``.
:param ciphers:
Which cipher suites to allow the server to select.
:returns:
Constructed SSLContext object with specified options
:rtype: SSLContext
"""
context = SSLContext(ssl_version or ssl.PROTOCOL_SSLv23)
# Setting the default here, as we may have no ssl module on import
cert_reqs = ssl.CERT_REQUIRED if cert_reqs is None else cert_reqs
if options is None:
options = 0
# SSLv2 is easily broken and is considered harmful and dangerous
options |= OP_NO_SSLv2
# SSLv3 has several problems and is now dangerous
options |= OP_NO_SSLv3
# Disable compression to prevent CRIME attacks for OpenSSL 1.0+
# (issue #309)
options |= OP_NO_COMPRESSION
context.options |= options
if getattr(context, 'supports_set_ciphers', True): # Platform-specific: Python 2.6
context.set_ciphers(ciphers or DEFAULT_CIPHERS)
context.verify_mode = cert_reqs
if getattr(context, 'check_hostname', None) is not None: # Platform-specific: Python 3.2
# We do our own verification, including fingerprints and alternative
# hostnames. So disable it here
context.check_hostname = False
return context
def ssl_wrap_socket(sock, keyfile=None, certfile=None, cert_reqs=None,
ca_certs=None, server_hostname=None,
ssl_version=None, ciphers=None, ssl_context=None,
ca_cert_dir=None):
"""
All arguments except for server_hostname, ssl_context, and ca_cert_dir have
the same meaning as they do when using :func:`ssl.wrap_socket`.
:param server_hostname:
When SNI is supported, the expected hostname of the certificate
:param ssl_context:
A pre-made :class:`SSLContext` object. If none is provided, one will
be created using :func:`create_urllib3_context`.
:param ciphers:
A string of ciphers we wish the client to support. This is not
supported on Python 2.6 as the ssl module does not support it.
:param ca_cert_dir:
A directory containing CA certificates in multiple separate files, as
supported by OpenSSL's -CApath flag or the capath argument to
SSLContext.load_verify_locations().
"""
context = ssl_context
if context is None:
# Note: This branch of code and all the variables in it are no longer
# used by urllib3 itself. We should consider deprecating and removing
# this code.
context = create_urllib3_context(ssl_version, cert_reqs,
ciphers=ciphers)
if ca_certs or ca_cert_dir:
try:
context.load_verify_locations(ca_certs, ca_cert_dir)
except IOError as e: # Platform-specific: Python 2.6, 2.7, 3.2
raise SSLError(e)
# Py33 raises FileNotFoundError which subclasses OSError
# These are not equivalent unless we check the errno attribute
except OSError as e: # Platform-specific: Python 3.3 and beyond
if e.errno == errno.ENOENT:
raise SSLError(e)
raise
elif ssl_context is None and hasattr(context, 'load_default_certs'):
# try to load OS default certs; works well on Windows (require Python3.4+)
context.load_default_certs()
if certfile:
context.load_cert_chain(certfile, keyfile)
if HAS_SNI: # Platform-specific: OpenSSL with enabled SNI
return context.wrap_socket(sock, server_hostname=server_hostname)
warnings.warn(
'An HTTPS request has been made, but the SNI (Subject Name '
'Indication) extension to TLS is not available on this platform. '
'This may cause the server to present an incorrect TLS '
'certificate, which can cause validation failures. You can upgrade to '
'a newer version of Python to solve this. For more information, see '
'https://urllib3.readthedocs.io/en/latest/advanced-usage.html'
'#ssl-warnings',
SNIMissingWarning
)
return context.wrap_socket(sock)
pip/_vendor/urllib3/util/retry.py 0000644 00000035400 14751155150 0013046 0 ustar 00 from __future__ import absolute_import
import time
import logging
from collections import namedtuple
from itertools import takewhile
import email
import re
from ..exceptions import (
ConnectTimeoutError,
MaxRetryError,
ProtocolError,
ReadTimeoutError,
ResponseError,
InvalidHeader,
)
from ..packages import six
log = logging.getLogger(__name__)
# Data structure for representing the metadata of requests that result in a retry.
RequestHistory = namedtuple('RequestHistory', ["method", "url", "error",
"status", "redirect_location"])
class Retry(object):
""" Retry configuration.
Each retry attempt will create a new Retry object with updated values, so
they can be safely reused.
Retries can be defined as a default for a pool::
retries = Retry(connect=5, read=2, redirect=5)
http = PoolManager(retries=retries)
response = http.request('GET', 'http://example.com/')
Or per-request (which overrides the default for the pool)::
response = http.request('GET', 'http://example.com/', retries=Retry(10))
Retries can be disabled by passing ``False``::
response = http.request('GET', 'http://example.com/', retries=False)
Errors will be wrapped in :class:`~urllib3.exceptions.MaxRetryError` unless
retries are disabled, in which case the causing exception will be raised.
:param int total:
Total number of retries to allow. Takes precedence over other counts.
Set to ``None`` to remove this constraint and fall back on other
counts. It's a good idea to set this to some sensibly-high value to
account for unexpected edge cases and avoid infinite retry loops.
Set to ``0`` to fail on the first retry.
Set to ``False`` to disable and imply ``raise_on_redirect=False``.
:param int connect:
How many connection-related errors to retry on.
These are errors raised before the request is sent to the remote server,
which we assume has not triggered the server to process the request.
Set to ``0`` to fail on the first retry of this type.
:param int read:
How many times to retry on read errors.
These errors are raised after the request was sent to the server, so the
request may have side-effects.
Set to ``0`` to fail on the first retry of this type.
:param int redirect:
How many redirects to perform. Limit this to avoid infinite redirect
loops.
A redirect is a HTTP response with a status code 301, 302, 303, 307 or
308.
Set to ``0`` to fail on the first retry of this type.
Set to ``False`` to disable and imply ``raise_on_redirect=False``.
:param int status:
How many times to retry on bad status codes.
These are retries made on responses, where status code matches
``status_forcelist``.
Set to ``0`` to fail on the first retry of this type.
:param iterable method_whitelist:
Set of uppercased HTTP method verbs that we should retry on.
By default, we only retry on methods which are considered to be
idempotent (multiple requests with the same parameters end with the
same state). See :attr:`Retry.DEFAULT_METHOD_WHITELIST`.
Set to a ``False`` value to retry on any verb.
:param iterable status_forcelist:
A set of integer HTTP status codes that we should force a retry on.
A retry is initiated if the request method is in ``method_whitelist``
and the response status code is in ``status_forcelist``.
By default, this is disabled with ``None``.
:param float backoff_factor:
A backoff factor to apply between attempts after the second try
(most errors are resolved immediately by a second try without a
delay). urllib3 will sleep for::
{backoff factor} * (2 ^ ({number of total retries} - 1))
seconds. If the backoff_factor is 0.1, then :func:`.sleep` will sleep
for [0.0s, 0.2s, 0.4s, ...] between retries. It will never be longer
than :attr:`Retry.BACKOFF_MAX`.
By default, backoff is disabled (set to 0).
:param bool raise_on_redirect: Whether, if the number of redirects is
exhausted, to raise a MaxRetryError, or to return a response with a
response code in the 3xx range.
:param iterable remove_headers_on_redirect:
Sequence of headers to remove from the request when a response
indicating a redirect is returned before firing off the redirected
request
:param bool raise_on_status: Similar meaning to ``raise_on_redirect``:
whether we should raise an exception, or return a response,
if status falls in ``status_forcelist`` range and retries have
been exhausted.
:param tuple history: The history of the request encountered during
each call to :meth:`~Retry.increment`. The list is in the order
the requests occurred. Each list item is of class :class:`RequestHistory`.
:param bool respect_retry_after_header:
Whether to respect Retry-After header on status codes defined as
:attr:`Retry.RETRY_AFTER_STATUS_CODES` or not.
"""
DEFAULT_METHOD_WHITELIST = frozenset([
'HEAD', 'GET', 'PUT', 'DELETE', 'OPTIONS', 'TRACE'])
DEFAULT_REDIRECT_HEADERS_BLACKLIST = frozenset(['Authorization'])
RETRY_AFTER_STATUS_CODES = frozenset([413, 429, 503])
#: Maximum backoff time.
BACKOFF_MAX = 120
def __init__(self, total=10, connect=None, read=None, redirect=None, status=None,
method_whitelist=DEFAULT_METHOD_WHITELIST, status_forcelist=None,
backoff_factor=0, raise_on_redirect=True, raise_on_status=True,
history=None, respect_retry_after_header=True,
remove_headers_on_redirect=DEFAULT_REDIRECT_HEADERS_BLACKLIST):
self.total = total
self.connect = connect
self.read = read
self.status = status
if redirect is False or total is False:
redirect = 0
raise_on_redirect = False
self.redirect = redirect
self.status_forcelist = status_forcelist or set()
self.method_whitelist = method_whitelist
self.backoff_factor = backoff_factor
self.raise_on_redirect = raise_on_redirect
self.raise_on_status = raise_on_status
self.history = history or tuple()
self.respect_retry_after_header = respect_retry_after_header
self.remove_headers_on_redirect = remove_headers_on_redirect
def new(self, **kw):
params = dict(
total=self.total,
connect=self.connect, read=self.read, redirect=self.redirect, status=self.status,
method_whitelist=self.method_whitelist,
status_forcelist=self.status_forcelist,
backoff_factor=self.backoff_factor,
raise_on_redirect=self.raise_on_redirect,
raise_on_status=self.raise_on_status,
history=self.history,
remove_headers_on_redirect=self.remove_headers_on_redirect,
)
params.update(kw)
return type(self)(**params)
@classmethod
def from_int(cls, retries, redirect=True, default=None):
""" Backwards-compatibility for the old retries format."""
if retries is None:
retries = default if default is not None else cls.DEFAULT
if isinstance(retries, Retry):
return retries
redirect = bool(redirect) and None
new_retries = cls(retries, redirect=redirect)
log.debug("Converted retries value: %r -> %r", retries, new_retries)
return new_retries
def get_backoff_time(self):
""" Formula for computing the current backoff
:rtype: float
"""
# We want to consider only the last consecutive errors sequence (Ignore redirects).
consecutive_errors_len = len(list(takewhile(lambda x: x.redirect_location is None,
reversed(self.history))))
if consecutive_errors_len <= 1:
return 0
backoff_value = self.backoff_factor * (2 ** (consecutive_errors_len - 1))
return min(self.BACKOFF_MAX, backoff_value)
def parse_retry_after(self, retry_after):
# Whitespace: https://tools.ietf.org/html/rfc7230#section-3.2.4
if re.match(r"^\s*[0-9]+\s*$", retry_after):
seconds = int(retry_after)
else:
retry_date_tuple = email.utils.parsedate(retry_after)
if retry_date_tuple is None:
raise InvalidHeader("Invalid Retry-After header: %s" % retry_after)
retry_date = time.mktime(retry_date_tuple)
seconds = retry_date - time.time()
if seconds < 0:
seconds = 0
return seconds
def get_retry_after(self, response):
""" Get the value of Retry-After in seconds. """
retry_after = response.getheader("Retry-After")
if retry_after is None:
return None
return self.parse_retry_after(retry_after)
def sleep_for_retry(self, response=None):
retry_after = self.get_retry_after(response)
if retry_after:
time.sleep(retry_after)
return True
return False
def _sleep_backoff(self):
backoff = self.get_backoff_time()
if backoff <= 0:
return
time.sleep(backoff)
def sleep(self, response=None):
""" Sleep between retry attempts.
This method will respect a server's ``Retry-After`` response header
and sleep the duration of the time requested. If that is not present, it
will use an exponential backoff. By default, the backoff factor is 0 and
this method will return immediately.
"""
if response:
slept = self.sleep_for_retry(response)
if slept:
return
self._sleep_backoff()
def _is_connection_error(self, err):
""" Errors when we're fairly sure that the server did not receive the
request, so it should be safe to retry.
"""
return isinstance(err, ConnectTimeoutError)
def _is_read_error(self, err):
""" Errors that occur after the request has been started, so we should
assume that the server began processing it.
"""
return isinstance(err, (ReadTimeoutError, ProtocolError))
def _is_method_retryable(self, method):
""" Checks if a given HTTP method should be retried upon, depending if
it is included on the method whitelist.
"""
if self.method_whitelist and method.upper() not in self.method_whitelist:
return False
return True
def is_retry(self, method, status_code, has_retry_after=False):
""" Is this method/status code retryable? (Based on whitelists and control
variables such as the number of total retries to allow, whether to
respect the Retry-After header, whether this header is present, and
whether the returned status code is on the list of status codes to
be retried upon on the presence of the aforementioned header)
"""
if not self._is_method_retryable(method):
return False
if self.status_forcelist and status_code in self.status_forcelist:
return True
return (self.total and self.respect_retry_after_header and
has_retry_after and (status_code in self.RETRY_AFTER_STATUS_CODES))
def is_exhausted(self):
""" Are we out of retries? """
retry_counts = (self.total, self.connect, self.read, self.redirect, self.status)
retry_counts = list(filter(None, retry_counts))
if not retry_counts:
return False
return min(retry_counts) < 0
def increment(self, method=None, url=None, response=None, error=None,
_pool=None, _stacktrace=None):
""" Return a new Retry object with incremented retry counters.
:param response: A response object, or None, if the server did not
return a response.
:type response: :class:`~urllib3.response.HTTPResponse`
:param Exception error: An error encountered during the request, or
None if the response was received successfully.
:return: A new ``Retry`` object.
"""
if self.total is False and error:
# Disabled, indicate to re-raise the error.
raise six.reraise(type(error), error, _stacktrace)
total = self.total
if total is not None:
total -= 1
connect = self.connect
read = self.read
redirect = self.redirect
status_count = self.status
cause = 'unknown'
status = None
redirect_location = None
if error and self._is_connection_error(error):
# Connect retry?
if connect is False:
raise six.reraise(type(error), error, _stacktrace)
elif connect is not None:
connect -= 1
elif error and self._is_read_error(error):
# Read retry?
if read is False or not self._is_method_retryable(method):
raise six.reraise(type(error), error, _stacktrace)
elif read is not None:
read -= 1
elif response and response.get_redirect_location():
# Redirect retry?
if redirect is not None:
redirect -= 1
cause = 'too many redirects'
redirect_location = response.get_redirect_location()
status = response.status
else:
# Incrementing because of a server error like a 500 in
# status_forcelist and a the given method is in the whitelist
cause = ResponseError.GENERIC_ERROR
if response and response.status:
if status_count is not None:
status_count -= 1
cause = ResponseError.SPECIFIC_ERROR.format(
status_code=response.status)
status = response.status
history = self.history + (RequestHistory(method, url, error, status, redirect_location),)
new_retry = self.new(
total=total,
connect=connect, read=read, redirect=redirect, status=status_count,
history=history)
if new_retry.is_exhausted():
raise MaxRetryError(_pool, url, error or ResponseError(cause))
log.debug("Incremented Retry for (url='%s'): %r", url, new_retry)
return new_retry
def __repr__(self):
return ('{cls.__name__}(total={self.total}, connect={self.connect}, '
'read={self.read}, redirect={self.redirect}, status={self.status})').format(
cls=type(self), self=self)
# For backwards compatibility (equivalent to pre-v1.9):
Retry.DEFAULT = Retry(3)
pip/_vendor/urllib3/request.py 0000644 00000013472 14751155150 0012421 0 ustar 00 from __future__ import absolute_import
from .filepost import encode_multipart_formdata
from .packages.six.moves.urllib.parse import urlencode
__all__ = ['RequestMethods']
class RequestMethods(object):
"""
Convenience mixin for classes who implement a :meth:`urlopen` method, such
as :class:`~urllib3.connectionpool.HTTPConnectionPool` and
:class:`~urllib3.poolmanager.PoolManager`.
Provides behavior for making common types of HTTP request methods and
decides which type of request field encoding to use.
Specifically,
:meth:`.request_encode_url` is for sending requests whose fields are
encoded in the URL (such as GET, HEAD, DELETE).
:meth:`.request_encode_body` is for sending requests whose fields are
encoded in the *body* of the request using multipart or www-form-urlencoded
(such as for POST, PUT, PATCH).
:meth:`.request` is for making any kind of request, it will look up the
appropriate encoding format and use one of the above two methods to make
the request.
Initializer parameters:
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
"""
_encode_url_methods = set(['DELETE', 'GET', 'HEAD', 'OPTIONS'])
def __init__(self, headers=None):
self.headers = headers or {}
def urlopen(self, method, url, body=None, headers=None,
encode_multipart=True, multipart_boundary=None,
**kw): # Abstract
raise NotImplemented("Classes extending RequestMethods must implement "
"their own ``urlopen`` method.")
def request(self, method, url, fields=None, headers=None, **urlopen_kw):
"""
Make a request using :meth:`urlopen` with the appropriate encoding of
``fields`` based on the ``method`` used.
This is a convenience method that requires the least amount of manual
effort. It can be used in most situations, while still having the
option to drop down to more specific methods when necessary, such as
:meth:`request_encode_url`, :meth:`request_encode_body`,
or even the lowest level :meth:`urlopen`.
"""
method = method.upper()
if method in self._encode_url_methods:
return self.request_encode_url(method, url, fields=fields,
headers=headers,
**urlopen_kw)
else:
return self.request_encode_body(method, url, fields=fields,
headers=headers,
**urlopen_kw)
def request_encode_url(self, method, url, fields=None, headers=None,
**urlopen_kw):
"""
Make a request using :meth:`urlopen` with the ``fields`` encoded in
the url. This is useful for request methods like GET, HEAD, DELETE, etc.
"""
if headers is None:
headers = self.headers
extra_kw = {'headers': headers}
extra_kw.update(urlopen_kw)
if fields:
url += '?' + urlencode(fields)
return self.urlopen(method, url, **extra_kw)
def request_encode_body(self, method, url, fields=None, headers=None,
encode_multipart=True, multipart_boundary=None,
**urlopen_kw):
"""
Make a request using :meth:`urlopen` with the ``fields`` encoded in
the body. This is useful for request methods like POST, PUT, PATCH, etc.
When ``encode_multipart=True`` (default), then
:meth:`urllib3.filepost.encode_multipart_formdata` is used to encode
the payload with the appropriate content type. Otherwise
:meth:`urllib.urlencode` is used with the
'application/x-www-form-urlencoded' content type.
Multipart encoding must be used when posting files, and it's reasonably
safe to use it in other times too. However, it may break request
signing, such as with OAuth.
Supports an optional ``fields`` parameter of key/value strings AND
key/filetuple. A filetuple is a (filename, data, MIME type) tuple where
the MIME type is optional. For example::
fields = {
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(),
'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
}
When uploading a file, providing a filename (the first parameter of the
tuple) is optional but recommended to best mimick behavior of browsers.
Note that if ``headers`` are supplied, the 'Content-Type' header will
be overwritten because it depends on the dynamic random boundary string
which is used to compose the body of the request. The random boundary
string can be explicitly set with the ``multipart_boundary`` parameter.
"""
if headers is None:
headers = self.headers
extra_kw = {'headers': {}}
if fields:
if 'body' in urlopen_kw:
raise TypeError(
"request got values for both 'fields' and 'body', can only specify one.")
if encode_multipart:
body, content_type = encode_multipart_formdata(fields, boundary=multipart_boundary)
else:
body, content_type = urlencode(fields), 'application/x-www-form-urlencoded'
extra_kw['body'] = body
extra_kw['headers'] = {'Content-Type': content_type}
extra_kw['headers'].update(headers)
extra_kw.update(urlopen_kw)
return self.urlopen(method, url, **extra_kw)
pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.opt-1.pyc 0000644 00000031074 14751155150 0020456 0 ustar 00 3
���e�A � @ s d dl mZ d dlZd dlZd dlZddlmZ ddlmZm Z ddlm
Z
ddl m Z m
Z
mZ ddlmZ dd lmZ dd
lmZ dd lmZ d d
dgZeje�Zd4Zd5Z ej d-e �Z d.d/� Z ej e e �ej e e �d0�Z!ee d0�Z"G d1d � d e�Z#G d2d
� d
e#�Z$d3d� Z%dS )6� )�absolute_importN� )�RecentlyUsedContainer)�HTTPConnectionPool�HTTPSConnectionPool)�port_by_scheme)�LocationValueError�
MaxRetryError�ProxySchemeUnknown)�urljoin)�RequestMethods)� parse_url)�Retry� PoolManager� ProxyManager�proxy_from_url�key_file� cert_file� cert_reqs�ca_certs� ssl_version� ca_cert_dir� ssl_context�
key_scheme�key_host�key_port� key_timeout� key_retries�
key_strict� key_block�key_source_address� key_key_file�
key_cert_file�
key_cert_reqs� key_ca_certs�key_ssl_version�key_ca_cert_dir�key_ssl_context� key_maxsize� key_headers�
key__proxy�key__proxy_headers�key_socket_options�key__socks_options�key_assert_hostname�key_assert_fingerprint�PoolKeyc C s� |j � }|d j� |d< |d j� |d< x4d D ],}||kr.|| dk r.t|| j� �||< q.W |jd�}|dk r|t|�|d< x&t|j� �D ]}|j|�|d| < q�W x | j D ]}||kr�d||< q�W | f |�S )
a�
Create a pool key out of a request context dictionary.
According to RFC 3986, both the scheme and host are case-insensitive.
Therefore, this function normalizes both before constructing the pool
key for an HTTPS request. If you wish to change this behaviour, provide
alternate callables to ``key_fn_by_scheme``.
:param key_class:
The class to use when constructing the key. This should be a namedtuple
with the ``scheme`` and ``host`` keys at a minimum.
:type key_class: namedtuple
:param request_context:
A dictionary-like object that contain the context for a request.
:type request_context: dict
:return: A namedtuple that can be used as a connection pool key.
:rtype: PoolKey
�scheme�host�headers�_proxy_headers�_socks_optionsNZsocket_optionsZkey_)r3 r4 r5 )
�copy�lower� frozenset�items�get�tuple�list�keys�pop�_fields)Z key_class�request_context�context�keyZ socket_optsZfield� rC �!/usr/lib/python3.6/poolmanager.py�_default_key_normalizer9 s
rE )�http�httpsc @ sx e Zd ZdZdZd dd�Zdd� Zdd � Zd d
d �Zd d
� Z d dd�Z
dd� Z d dd�Z d dd�Z
dd� Zd!dd�ZdS )"r a$
Allows for arbitrary requests while transparently keeping track of
necessary connection pools for you.
:param num_pools:
Number of connection pools to cache before discarding the least
recently used pool.
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
:param \**connection_pool_kw:
Additional parameters are used to create fresh
:class:`urllib3.connectionpool.ConnectionPool` instances.
Example::
>>> manager = PoolManager(num_pools=2)
>>> r = manager.request('GET', 'http://google.com/')
>>> r = manager.request('GET', 'http://google.com/mail')
>>> r = manager.request('GET', 'http://yahoo.com/')
>>> len(manager.pools)
2
N�
c K s8 t j| |� || _t|dd� d�| _t| _tj� | _d S )Nc S s | j � S )N)�close)�prC rC rD �<lambda>� s z&PoolManager.__init__.<locals>.<lambda>)Z dispose_func)r �__init__�connection_pool_kwr �pools�pool_classes_by_scheme�key_fn_by_schemer6 )�self� num_poolsr3 rM rC rC rD rL � s zPoolManager.__init__c C s | S )NrC )rQ rC rC rD � __enter__� s zPoolManager.__enter__c C s | j � dS )NF)�clear)rQ �exc_typeZexc_valZexc_tbrC rC rD �__exit__� s zPoolManager.__exit__c C sf | j | }|dkr | jj� }xdD ]}|j|d� q"W |dkrXxtD ]}|j|d� qDW |||f|�S )a�
Create a new :class:`ConnectionPool` based on host, port, scheme, and
any additional pool keyword arguments.
If ``request_context`` is provided, it is provided as keyword arguments
to the pool class used. This method is used to actually create the
connection pools handed out by :meth:`connection_from_url` and
companion methods. It is intended to be overridden for customization.
Nr1 r2 �portrF )r1 r2 rW )rO rM r6 r> � SSL_KEYWORDS)rQ r1 r2 rW r@ Zpool_clsrB �kwrC rC rD � _new_pool� s
zPoolManager._new_poolc C s | j j� dS )z�
Empty our store of pools and direct them all to close.
This will not affect in-flight connections, but they will not be
re-used after completion.
N)rN rT )rQ rC rC rD rT � s zPoolManager.clearrF c C sT |s t d��| j|�}|p d|d< |s:tj|d j� d�}||d< ||d< | j|�S )a�
Get a :class:`ConnectionPool` based on the host, port, and scheme.
If ``port`` isn't given, it will be derived from the ``scheme`` using
``urllib3.connectionpool.port_by_scheme``. If ``pool_kwargs`` is
provided, it is merged with the instance's ``connection_pool_kw``
variable and used to create the new connection pool, if one is
needed.
zNo host specified.rF r1 �P rW r2 )r �_merge_pool_kwargsr r: r7 �connection_from_context)rQ r2 rW r1 � pool_kwargsr@ rC rC rD �connection_from_host� s
z PoolManager.connection_from_hostc C s, |d j � }| j| }||�}| j||d�S )z�
Get a :class:`ConnectionPool` based on the request context.
``request_context`` must at least contain the ``scheme`` key and its
value must be a key in ``key_fn_by_scheme`` instance variable.
r1 )r@ )r7 rP �connection_from_pool_key)rQ r@ r1 Zpool_key_constructor�pool_keyrC rC rD r] � s
z#PoolManager.connection_from_contextc
C s` | j j�N | j j|�}|r |S |d }|d }|d }| j||||d�}|| j |< W dQ R X |S )z�
Get a :class:`ConnectionPool` based on the provided pool key.
``pool_key`` should be a namedtuple that only contains immutable
objects. At a minimum it must have the ``scheme``, ``host``, and
``port`` fields.
r1 r2 rW )r@ N)rN �lockr: rZ )rQ ra r@ Zpoolr1 r2 rW rC rC rD r` � s
z$PoolManager.connection_from_pool_keyc C s t |�}| j|j|j|j|d�S )a�
Similar to :func:`urllib3.connectionpool.connection_from_url`.
If ``pool_kwargs`` is not provided and a new pool needs to be
constructed, ``self.connection_pool_kw`` is used to initialize
the :class:`urllib3.connectionpool.ConnectionPool`. If ``pool_kwargs``
is provided, it is used instead. Note that if a new pool does not
need to be created for the request, the provided ``pool_kwargs`` are
not used.
)rW r1 r^ )r
r_ r2 rW r1 )rQ �urlr^ �urC rC rD �connection_from_url
s z PoolManager.connection_from_urlc C sZ | j j� }|rVxF|j� D ]:\}}|dkrJy
||= W qR tk
rF Y qRX q|||< qW |S )a
Merge a dictionary of override values for self.connection_pool_kw.
This does not modify self.connection_pool_kw and returns a new dict.
Any keys in the override dictionary with a value of ``None`` are
removed from the merged dictionary.
N)rM r6 r9 �KeyError)rQ �overrideZbase_pool_kwargsrB �valuerC rC rD r\ s
z PoolManager._merge_pool_kwargsTc K sd t |�}| j|j|j|jd�}d|d< d|d< d|krD| jj� |d< | jdk rj|jdkrj|j||f|�}n|j||j f|�}|o�|j
� }|s�|S t ||�}|j dkr�d }|j
d
�} t| t�s�tj| |d �} | jo�|j|� � r�x | jD ]}
|d j|
d� q�W y| j||||d �} W n tk
�r4 | j�r0� |S X | |d
< ||d< tjd
||� | j||f|�S )a]
Same as :meth:`urllib3.connectionpool.HTTPConnectionPool.urlopen`
with custom cross-host redirect logic and only sends the request-uri
portion of the ``url``.
The given ``url`` parameter must be absolute, such that an appropriate
:class:`urllib3.connectionpool.ConnectionPool` can be chosen for it.
)rW r1 FZassert_same_host�redirectr3 NrF i/ ZGET�retries)ri )�responseZ_poolzRedirecting %s -> %s)r
r_ r2 rW r1 r3 r6 �proxy�urlopenZ request_uriZget_redirect_locationr Zstatusr: �
isinstancer Zfrom_intZremove_headers_on_redirectZ is_same_hostr> Z incrementr Zraise_on_redirect�log�info) rQ �methodrc ri rY rd Zconnrk Zredirect_locationrj �headerrC rC rD rm - s@
zPoolManager.urlopen)rH N)N)NrF N)N)N)T)�__name__�
__module__� __qualname__�__doc__rl rL rS rV rZ rT r_ r] r` re r\ rm rC rC rC rD r y s
c sH e Zd ZdZd� fdd� Zd� fdd� Zdd d
�Zd� fd d
� Z� ZS )r aw
Behaves just like :class:`PoolManager`, but sends all requests through
the defined proxy, using the CONNECT method for HTTPS URLs.
:param proxy_url:
The URL of the proxy to be used.
:param proxy_headers:
A dictionary contaning headers that will be sent to the proxy. In case
of HTTP they are being sent with each request, while in the
HTTPS/CONNECT case they are sent only once. Could be used for proxy
authentication.
Example:
>>> proxy = urllib3.ProxyManager('http://localhost:3128/')
>>> r1 = proxy.request('GET', 'http://google.com/')
>>> r2 = proxy.request('GET', 'http://httpbin.org/')
>>> len(proxy.pools)
1
>>> r3 = proxy.request('GET', 'https://httpbin.org/')
>>> r4 = proxy.request('GET', 'https://twitter.com/')
>>> len(proxy.pools)
3
rH Nc s� t |t�r d|j|j|jf }t|�}|jsFtj|jd�}|j|d�}|jdkrZt |j��|| _
|pfi | _ | j
|d< | j |d< t t
| �j||f|� d S ) Nz
%s://%s:%ir[ )rW rF rG �_proxyr4 )rF rG )rn r r1 r2 rW r
r r: �_replacer
rl �
proxy_headers�superr rL )rQ � proxy_urlrR r3 ry rM rl rW )� __class__rC rD rL � s
zProxyManager.__init__rF c sD |dkr t t| �j||||d�S t t| �j| jj| jj| jj|d�S )NrG )r^ )rz r r_ rl r2 rW r1 )rQ r2 rW r1 r^ )r| rC rD r_ � s
z!ProxyManager.connection_from_hostc C s0 ddi}t |�j}|r ||d< |r,|j|� |S )z�
Sets headers needed by proxies: specifically, the Accept and Host
headers. Only sets headers not provided by the user.
ZAcceptz*/*ZHost)r
�netloc�update)rQ rc r3 Zheaders_r} rC rC rD �_set_proxy_headers� s
z ProxyManager._set_proxy_headersTc sN t |�}|jdkr0|jd| j�}| j||�|d< tt| �j||fd|i|��S )z@Same as HTTP(S)ConnectionPool.urlopen, ``url`` must be absolute.rF r3 ri )r
r1 r: r3 r rz r rm )rQ rq rc ri rY rd r3 )r| rC rD rm � s
zProxyManager.urlopen)rH NN)NrF N)N)T) rs rt ru rv rL r_ r rm �
__classcell__rC rC )r| rD r i s
c K s t f d| i|��S )Nr{ )r )rc rY rC rC rD r � s )r r r r r r r )r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ )&Z
__future__r � collections� functoolsZlogging� _collectionsr Zconnectionpoolr r r �
exceptionsr r r
Z packages.six.moves.urllib.parser Zrequestr Zutil.urlr
Z
util.retryr �__all__Z getLoggerrs ro rX Z _key_fields�
namedtupler0 rE �partialrP rO r r r rC rC rC rD �<module> s`
6
qW pip/_vendor/urllib3/__pycache__/response.cpython-36.pyc 0000644 00000037433 14751155150 0017056 0 ustar 00 3
���ewY � @ s d dl mZ d dlmZ d dlZd dlZd dlZd dlmZ d dlm
Z ddl m
Z
ddlmZmZmZmZmZmZmZ dd lmZmZmZ dd
lm Z dd l m Z m Z dd l!m"Z"m#Z# ej$e%�Z&G d
d� de'�Z(G dd� de'�Z)dd� Z*G dd� dej+�Z,dS )� )�absolute_import)�contextmanagerN)�timeout)�error� )�HTTPHeaderDict)�BodyNotHttplibCompatible�
ProtocolError� DecodeError�ReadTimeoutError�ResponseNotChunked�IncompleteRead�
InvalidHeader)� string_types� binary_type�PY3)� http_client)�
HTTPException� BaseSSLError)� is_fp_closed�is_response_to_headc @ s$ e Zd Zdd� Zdd� Zdd� ZdS )�DeflateDecoderc C s d| _ t� | _tj� | _d S )NT)�
_first_tryr �_data�zlib�
decompressobj�_obj)�self� r � /usr/lib/python3.6/response.py�__init__ s zDeflateDecoder.__init__c C s t | j|�S )N)�getattrr )r �namer r r � __getattr__ s zDeflateDecoder.__getattr__c C s� |s|S | j s| jj|�S | j|7 _y | jj|�}|rFd| _ d | _|S tjk
r� d| _ tjtj �| _z | j| j�S d | _X Y nX d S )NF)r r �
decompressr r r r � MAX_WBITS)r �dataZ decompressedr r r r$ s" zDeflateDecoder.decompressN)�__name__�
__module__� __qualname__r r# r$ r r r r r s r c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )� GzipDecoderc C s t jdt j �| _d S )N� )r r r% r )r r r r r 9 s zGzipDecoder.__init__c C s t | j|�S )N)r! r )r r" r r r r# < s zGzipDecoder.__getattr__c C s |s|S | j j|�S )N)r r$ )r r& r r r r$ ? s zGzipDecoder.decompressN)r' r( r) r r# r$ r r r r r* 7 s r* c C s | dkrt � S t� S )N�gzip)r* r )�moder r r � _get_decoderE s r. c @ s e Zd ZdZddgZdddddgZdFdd�Zdd� Zdd� Ze dd� �Z
e dd� �Z dd� Z dd� Z
d d � Zd d � Zd d!� Zed"d#� �ZdGd$d%�ZdId(d)�Zed*d+� �Zd,d-� ZdJd.d/�Zd0d1� Zd2d3� Ze d4d5� �Zd6d7� Z d8d9� Z d:d;� Z d<d=� Z d>d?� Z d@dA� Z!dBdC� Z"dKdDdE�Z#d
S )L� HTTPResponsea
HTTP Response container.
Backwards-compatible to httplib's HTTPResponse but the response ``body`` is
loaded and decoded on-demand when the ``data`` property is accessed. This
class is also compatible with the Python standard library's :mod:`io`
module, and can hence be treated as a readable object in the context of that
framework.
Extra parameters for behaviour not present in httplib.HTTPResponse:
:param preload_content:
If True, the response's body will be preloaded during construction.
:param decode_content:
If True, attempts to decode specific content-encoding's based on headers
(like 'gzip' and 'deflate') will be skipped and raw data will be used
instead.
:param original_response:
When this HTTPResponse wrapper is generated from an httplib.HTTPResponse
object, it's convenient to include the original for debug purposes. It's
otherwise unused.
:param retries:
The retries contains the last :class:`~urllib3.util.retry.Retry` that
was used during the request.
:param enforce_content_length:
Enforce content length checking. Body returned by server must match
value of Content-Length header, if present. Otherwise, raise error.
r, Zdeflatei- i. i/ i3 i4 � Nr TFc C s t |t�r|| _n
t|�| _|| _|| _|| _|| _|| _| | _|
| _ d | _
d | _ d | _ | | _
d| _|r|t |ttf�r||| _ |
| _| | _t|d�r�|| _ d| _d | _| jjdd�j� }dd� |jd�D �}d |kr�d
| _| j|�| _|r�| j r�| j|d �| _ d S ) Nr �readFztransfer-encodingr0 c s s | ]}|j � V qd S )N)�strip)�.0�encr r r � <genexpr>� s z(HTTPResponse.__init__.<locals>.<genexpr>�,�chunkedT)�decode_content) �
isinstancer �headers�status�version�reason�strictr8 �retries�enforce_content_length�_decoder�_body�_fp�_original_response�_fp_bytes_read�
basestringr �_pool� _connection�hasattrr7 �
chunk_left�get�lower�split� _init_length�length_remainingr1 )r �bodyr: r; r< r= r> Zpreload_contentr8 �original_responseZpool�
connectionr? r@ �request_methodZtr_encZ encodingsr r r r q s<
zHTTPResponse.__init__c C s | j | jkr| jjd�S dS )a
Should we redirect and where to?
:returns: Truthy redirect location string if we got a redirect status
code and valid location. ``None`` if redirect status and no
location. ``False`` if not a redirect status code.
�locationF)r; �REDIRECT_STATUSESr: rK )r r r r �get_redirect_location� s z"HTTPResponse.get_redirect_locationc C s, | j s| j rd S | j j| j� d | _d S )N)rG rH Z _put_conn)r r r r � release_conn� s zHTTPResponse.release_connc C s" | j r | j S | jr | jdd�S d S )NT)�
cache_content)rB rC r1 )r r r r r& � s zHTTPResponse.datac C s | j S )N)rH )r r r r rR � s zHTTPResponse.connectionc C s | j S )z�
Obtain the number of bytes pulled over the wire so far. May differ from
the amount of content returned by :meth:``HTTPResponse.read`` if bytes
are encoded on the wire (e.g, compressed).
)rE )r r r r �tell� s zHTTPResponse.tellc C s� | j jd�}|dk r(| jr(tjd� dS |dk r�y<tdd� |jd�D ��}t|�dkrbtd| ��|j � }W n t
k
r� d}Y nX |d k r�d}yt | j �}W n t
k
r� d }Y nX |dks�d | ko�d
k n s�|dkr�d }|S )zM
Set initial length value for Response content if available.
zcontent-lengthNz�Received response with both Content-Length and Transfer-Encoding set. This is expressly forbidden by RFC 7230 sec 3.3.2. Ignoring Content-Length and attempting to process response as Transfer-Encoding: chunked.c S s g | ] }t |��qS r )�int)r3 �valr r r �
<listcomp>� s z-HTTPResponse._init_length.<locals>.<listcomp>r6 r z8Content-Length contained multiple unmatching values (%s)r �� �0 �d �� ZHEAD)r] r^ )
r: rK r7 �logZwarning�setrM �lenr �pop�
ValueErrorrZ r; )r rS ZlengthZlengthsr; r r r rN � s,
(zHTTPResponse._init_lengthc C s4 | j jdd�j� }| jdkr0|| jkr0t|�| _dS )z=
Set-up the _decoder attribute if necessary.
zcontent-encodingr0 N)r: rK rL rA �CONTENT_DECODERSr. )r �content_encodingr r r �
_init_decoder� s zHTTPResponse._init_decoderc C s| y|r| j r| j j|�}W nH ttjfk
rb } z&| jjdd�j� }td| |��W Y dd}~X nX |rx|rx|| j � 7 }|S )zN
Decode the data passed in and potentially flush the decoder.
zcontent-encodingr0 zEReceived response with content-encoding: %s, but failed to decode it.N)
rA r$ �IOErrorr r r: rK rL r
�_flush_decoder)r r& r8 �
flush_decoder�erg r r r �_decode s
zHTTPResponse._decodec C s$ | j r | j jd�}|| j j� S dS )zk
Flushes the decoder. Should only be called if the decoder is actually
being used.
� )rA r$ �flush)r Zbufr r r rj s zHTTPResponse._flush_decoderc c s� d}z�y
dV W n� t k
r2 t| jdd��Y np tk
rn } z"dt|�krP� t| jdd��W Y dd}~X n4 ttfk
r� } ztd| |��W Y dd}~X nX d}W d|s�| jr�| jj � | j
r�| j
j � | jr�| jj � r�| j � X dS )z�
Catch low-level python exceptions, instead re-raising urllib3
variants, so that low-level exceptions are not leaked in the
high-level api.
On exit, release the connection back to the pool.
FNzRead timed out.zread operation timed outzConnection broken: %rT)
�
SocketTimeoutr rG r �strr � SocketErrorr rD �closerH �isclosedrW )r Z
clean_exitrl r r r �_error_catcher! s(
zHTTPResponse._error_catcherc C s� | j � |dkr| j}| jdkr$dS d}d}| j� �h |dkrN| jj� }d}nJd}| jj|�}|dkr�| r�| jj� d}| jr�| jdkr�t| j | j��W dQ R X |r�| j t
|�7 _ | jdk r�| jt
|�8 _| j |||�}|r�|| _ |S )aP
Similar to :meth:`httplib.HTTPResponse.read`, but with two additional
parameters: ``decode_content`` and ``cache_content``.
:param amt:
How much of the content to read. If specified, caching is skipped
because it doesn't make sense to cache partial content as the full
response.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
:param cache_content:
If True, will save the returned data such that the same result is
returned despite of the state of the underlying file object. This
is useful if you want the ``.data`` property to continue working
after having ``.read()`` the file object. (Overridden if ``amt`` is
set.)
NFTr )r N)
rh r8 rC ru r1 rs r@ rO r
rE rc rm rB )r �amtr8 rX rk r& r r r r1 Z s4
zHTTPResponse.read� r+ c c sZ | j r.| j� r.xF| j||d�D ]
}|V q W n(x&t| j�sT| j||d�}|r0|V q0W dS )a_
A generator wrapper for the read() method. A call will block until
``amt`` bytes have been read from the connection or until the
connection is closed.
:param amt:
How much of the content to read. The generator will return up to
much data per iteration, but may return less. This is particularly
likely when using compressed data. However, the empty string will
never be returned.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
)r8 )rv r8 N)r7 �supports_chunked_reads� read_chunkedr rC r1 )r rv r8 �liner& r r r �stream� s zHTTPResponse.streamc
K s` |j }t|t�s,tr"t|j� �}n
tj|�}t|dd�}| f |||j|j|j ||d�|��}|S )a
Given an :class:`httplib.HTTPResponse` instance ``r``, return a
corresponding :class:`urllib3.response.HTTPResponse` object.
Remaining parameters are passed to the HTTPResponse constructor, along
with ``original_response=r``.
r> r )rP r: r; r< r= r> rQ )
�msgr9 r r �items� from_httplibr! r; r< r= )Z ResponseCls�rZ response_kwr: r> Zrespr r r r~ � s
zHTTPResponse.from_httplibc C s | j S )N)r: )r r r r �
getheaders� s zHTTPResponse.getheadersc C s | j j||�S )N)r: rK )r r" �defaultr r r � getheader� s zHTTPResponse.getheaderc C s | j S )N)r: )r r r r �info� s zHTTPResponse.infoc C s$ | j s| jj� | jr | jj� d S )N)�closedrC rs rH )r r r r rs � s
zHTTPResponse.closec C s@ | j d krdS t| j d�r$| j j� S t| j d�r8| j jS dS d S )NTrt r� )rC rI rt r� )r r r r r� � s
zHTTPResponse.closedc C s6 | j d krtd��n t| j d�r*| j j� S td��d S )Nz-HTTPResponse has no file to get a fileno from�filenozOThe file-like object this HTTPResponse is wrapped around has no file descriptor)rC ri rI r� )r r r r r� � s
zHTTPResponse.filenoc C s$ | j d k r t| j d�r | j j� S d S )Nro )rC rI ro )r r r r ro � s zHTTPResponse.flushc C s dS )NTr )r r r r �readable s zHTTPResponse.readablec C s: | j t|��}t|�dkr dS ||d t|��< t|�S d S )Nr )r1 rc )r �bZtempr r r �readinto s
zHTTPResponse.readintoc C s t | jd�S )z�
Checks if the underlying file-like object looks like a
httplib.HTTPResponse object. We do this by testing for the fp
attribute. If it is present we assume it returns raw chunks as
processed by read_chunked().
�fp)rI rC )r r r r rx s z#HTTPResponse.supports_chunked_readsc C sf | j d k rd S | jjj� }|jdd�d }yt|d�| _ W n& tk
r` | j� tj |��Y nX d S )N� ;r r r+ )
rJ rC r� �readlinerM rZ re rs �httplibr
)r rz r r r �_update_chunk_length s
z!HTTPResponse._update_chunk_lengthc C s� d }|d kr2| j j| j�}|}| j jd� d | _nv|| jk rZ| j j|�}| j| | _|}nN|| jkr�| j j|�}| j jd� d | _|}n | j j| j�}| j jd� d | _|S )Nrw )rC Z
_safe_readrJ )r rv Zreturned_chunk�chunk�valuer r r �
_handle_chunk% s&
zHTTPResponse._handle_chunkc c s� | j � | jstd��| j� s&td��| jrDt| j�rD| jj� dS | j� �� x<| j � | j
dkrdP | j |�}| j ||dd�}|rP|V qPW |r�| j
� }|r�|V x | jjj� }|s�P |dkr�P q�W | jr�| jj� W dQ R X dS )z�
Similar to :meth:`HTTPResponse.read`, but with an additional
parameter: ``decode_content``.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
zHResponse is not chunked. Header 'transfer-encoding: chunked' is missing.zgBody should be httplib.HTTPResponse like. It should have have an fp attribute which returns raw chunks.Nr F)r8 rk s
)rh r7 r rx r rD r rs ru r� rJ r� rm rj rC r� r� )r rv r8 r� Zdecodedrz r r r ry ; s@
zHTTPResponse.read_chunked)r0 Nr r Nr TTNNNNFN)NNF� )r� N)N)NN)$r' r( r) �__doc__rf rU r rV rW �propertyr& rR rY rN rh rm rj r ru r1 r{ � classmethodr~ r� r� r� rs r� r� ro r� r� rx r� r� ry r r r r r/ L sB
-
0
9
E
r/ )-Z
__future__r �
contextlibr r �ioZloggingZsocketr rp r rr � _collectionsr �
exceptionsr r r
r r r
r Z packages.sixr rF r r Zpackages.six.movesr r� rR r r Z
util.responser r Z getLoggerr' ra �objectr r* r. �IOBaser/ r r r r �<module> s" $
! pip/_vendor/urllib3/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000004576 14751155150 0017720 0 ustar 00 3
���e% � @ s` d Z ddlmZ ddlZddlmZmZmZ ddlm Z ddl
m Z ddl m
Z
mZmZ dd lmZ dd
lmZ dd lmZ dd lmZ dd
lmZ ddlZyddlmZ W n& e k
r� G dd� dej �ZY nX dZ dZ dZ d(Z!ej"e#�j$e� � ej%fd"d�Z&[ej'd#e j(d$d%� ej'd&e j)d$d%� ej'd&e j*d$d%� ej'd&e j+d$d%� e j,fd'd �Z-dS ))z8
urllib3 - Thread-safe connection pooling and re-using.
� )�absolute_importN� )�HTTPConnectionPool�HTTPSConnectionPool�connection_from_url)�
exceptions)�encode_multipart_formdata)� PoolManager� ProxyManager�proxy_from_url)� HTTPResponse)� make_headers)�get_host)�Timeout)�Retry)� NullHandlerc @ s e Zd Zdd� ZdS )r c C s d S )N� )�self�recordr r � /usr/lib/python3.6/__init__.py�emit s zNullHandler.emitN)�__name__�
__module__� __qualname__r r r r r r s r z(Andrey Petrov (andrey.petrov@shazow.net)ZMITz1.22r r r r
r r r �add_stderr_loggerr �disable_warningsr r r
r c C sF t jt�}t j� }|jt jd�� |j|� |j| � |jdt� |S )z�
Helper for quickly adding a StreamHandler to the logger. Useful for
debugging.
Returns the handler after adding it.
z%%(asctime)s %(levelname)s %(message)sz,Added a stderr logging handler to logger: %s) �logging� getLoggerr Z
StreamHandlerZ setFormatterZ Formatter�
addHandlerZsetLevel�debug)�levelZloggerZhandlerr r r r 9 s
�alwaysT)�append�defaultc C s t jd| � dS )z<
Helper for quickly disabling all urllib3 warnings.
�ignoreN)�warnings� simplefilter)�categoryr r r r ] s )r r r r
r r r r r r r r r
r ).�__doc__Z
__future__r r% Zconnectionpoolr r r � r Zfilepostr Z poolmanagerr r
r Zresponser Z util.requestr
Zutil.urlr Z util.timeoutr Z
util.retryr r r � ImportErrorZHandler�
__author__Z __license__� __version__�__all__r r r �DEBUGr r& ZSecurityWarningZSubjectAltNameWarningZInsecurePlatformWarningZSNIMissingWarningZ HTTPWarningr r r r r �<module> sT
pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.opt-1.pyc 0000644 00000056152 14751155150 0021207 0 ustar 00 3
���e � � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlmZm Z
d dlZddl m Z m
Z
mZmZmZmZmZmZmZmZmZmZmZ ddlmZ ddlm Z ddl m Z dd l m Z m!Z!m"Z"m#Z#m$Z$m%Z%m&Z& dd
l'm(Z( dd l)m*Z* dd l+m,Z, dd
l-m.Z. ddl/m0Z0 ddl1m2Z2 ddl3m4Z4 ddl5m6Z6m7Z7 e j8�r<d dl9Z:e j;j<Z<ej=e>�Z?e@� ZAG dd� de@�ZBeCejDejEg�ZFG dd� deBe(�ZGG dd� deG�ZHdd� ZIdd� ZJdS ) � )�absolute_importN)�error�timeout� )
�ClosedPoolError�
ProtocolError�EmptyPoolError�HeaderParsingError�HostChangedError�LocationValueError�
MaxRetryError�
ProxyError�ReadTimeoutError�SSLError� TimeoutError�InsecureRequestWarning�NewConnectionError)�CertificateError)�six)�queue)�port_by_scheme�DummyConnection�HTTPConnection�HTTPSConnection�VerifiedHTTPSConnection�
HTTPException� BaseSSLError)�RequestMethods)� HTTPResponse)�is_connection_dropped)�set_file_position)�assert_header_parsing)�Retry)�Timeout)�get_host�Urlc @ sD e Zd ZdZdZejZd
dd�Zdd� Z dd� Z
d d
� Z d d � Z dS )�ConnectionPoolzz
Base class for all connection pools, such as
:class:`.HTTPConnectionPool` and :class:`.HTTPSConnectionPool`.
Nc C s. |s t d��t|�j� | _|j� | _|| _d S )NzNo host specified.)r �
_ipv6_host�lower�host� _proxy_host�port)�selfr) r+ � r- �$/usr/lib/python3.6/connectionpool.py�__init__C s
zConnectionPool.__init__c C s dt | �j| j| jf S )Nz%s(host=%r, port=%r))�type�__name__r) r+ )r, r- r- r. �__str__K s
zConnectionPool.__str__c C s | S )Nr- )r, r- r- r. � __enter__O s zConnectionPool.__enter__c C s | j � dS )NF)�close)r, �exc_typeZexc_valZexc_tbr- r- r. �__exit__R s zConnectionPool.__exit__c C s dS )zD
Close all pooled connections and disable the pool.
Nr- )r, r- r- r. r4 W s zConnectionPool.close)N)
r1 �
__module__� __qualname__�__doc__�schemer Z LifoQueue�QueueClsr/ r2 r3 r6 r4 r- r- r- r. r& : s
r& c
@ s� e Zd ZdZdZeZeZdde j
ddddddf dd�Z dd � Z d!d
d �Z
d d
� Zdd� Zdd� Zdd� Zdd� Zedfdd�Zdd� Zdd� Zd d � Zdddd d eddddf
d d �ZdS )"�HTTPConnectionPoolaN
Thread-safe connection pool for one host.
:param host:
Host used for this HTTP Connection (e.g. "localhost"), passed into
:class:`httplib.HTTPConnection`.
:param port:
Port used for this HTTP Connection (None is equivalent to 80), passed
into :class:`httplib.HTTPConnection`.
:param strict:
Causes BadStatusLine to be raised if the status line can't be parsed
as a valid HTTP/1.0 or 1.1 status line, passed into
:class:`httplib.HTTPConnection`.
.. note::
Only works in Python 2. This parameter is ignored in Python 3.
:param timeout:
Socket timeout in seconds for each individual connection. This can
be a float or integer, which sets the timeout for the HTTP request,
or an instance of :class:`urllib3.util.Timeout` which gives you more
fine-grained control over request timeouts. After the constructor has
been parsed, this is always a `urllib3.util.Timeout` object.
:param maxsize:
Number of connections to save that can be reused. More than 1 is useful
in multithreaded situations. If ``block`` is set to False, more
connections will be created but they will not be saved once they've
been used.
:param block:
If set to True, no more than ``maxsize`` connections will be used at
a time. When no free connections are available, the call will block
until a connection has been released. This is a useful side effect for
particular multithreaded situations where one does not want to use more
than maxsize connections per host to prevent flooding.
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
:param retries:
Retry configuration to use by default with requests in this pool.
:param _proxy:
Parsed proxy URL, should not be used directly, instead, see
:class:`urllib3.connectionpool.ProxyManager`"
:param _proxy_headers:
A dictionary with proxy headers, should not be used directly,
instead, see :class:`urllib3.connectionpool.ProxyManager`"
:param \**conn_kw:
Additional parameters are used to create fresh :class:`urllib3.connection.HTTPConnection`,
:class:`urllib3.connection.HTTPSConnection` instances.
�httpNFr c
K s� t j| ||� tj| |� || _t|t�s4tj|�}|d krBtj}|| _ || _
| j |�| _ || _
| | _|
pli | _x t|�D ]} | j jd � qzW d| _d| _| | _| jr�| jjdg � d S )Nr Zsocket_options)r& r/ r �strict�
isinstancer# �
from_floatr" ZDEFAULTr �retriesr; �pool�block�proxy�
proxy_headers�xrange�put�num_connections� num_requests�conn_kw�
setdefault)
r, r) r+ r> r �maxsizerC �headersrA �_proxy�_proxy_headersrJ �_r- r- r. r/ � s(
zHTTPConnectionPool.__init__c C sJ | j d7 _ tjd| j | j� | jf | j| j| jj| jd�| j ��}|S )z9
Return a fresh :class:`HTTPConnection`.
r z%Starting new HTTP connection (%d): %s)r) r+ r r> )
rH �log�debugr) �
ConnectionClsr+ r �connect_timeoutr> rJ )r, �connr- r- r. � _new_conn� s z HTTPConnectionPool._new_connc C s� d}y| j j| j|d�}W nB tk
r8 t| d��Y n& tjk
r\ | jrXt| d��Y nX |r�t|�r�t j
d| j � |j � t
|dd�dkr�d}|p�| j� S ) a�
Get a connection. Will return a pooled connection if one is available.
If no connections are available and :prop:`.block` is ``False``, then a
fresh connection is returned.
:param timeout:
Seconds to wait before giving up and raising
:class:`urllib3.exceptions.EmptyPoolError` if the pool is empty and
:prop:`.block` is ``True``.
N)rC r zPool is closed.z>Pool reached maximum size and no more connections are allowed.z Resetting dropped connection: %sZ auto_openr r )rB �getrC �AttributeErrorr r �Emptyr r rQ rR r) r4 �getattrrV )r, r rU r- r- r. � _get_conn� s z HTTPConnectionPool._get_connc C s\ y| j j|dd� dS tk
r( Y n$ tjk
rJ tjd| j� Y nX |rX|j� dS )a�
Put a connection back into the pool.
:param conn:
Connection object for the current host and port as returned by
:meth:`._new_conn` or :meth:`._get_conn`.
If the pool is already full, the connection is closed and discarded
because we exceeded maxsize. If connections are discarded frequently,
then maxsize should be increased.
If the pool is closed, then the connection will be closed and discarded.
F)rC Nz2Connection pool is full, discarding connection: %s) rB rG rX r ZFullrQ �warningr) r4 )r, rU r- r- r. � _put_conn� s z HTTPConnectionPool._put_connc C s dS )zU
Called right before a request is made, after the socket is created.
Nr- )r, rU r- r- r. �_validate_conn s z!HTTPConnectionPool._validate_connc C s d S )Nr- )r, rU r- r- r. �_prepare_proxy! s z!HTTPConnectionPool._prepare_proxyc C s2 |t kr| jj� S t|t�r$|j� S tj|�S dS )z< Helper that always returns a :class:`urllib3.util.Timeout` N)�_Defaultr Zcloner? r# r@ )r, r r- r- r. � _get_timeout% s
z HTTPConnectionPool._get_timeoutc C sj t |t�rt| |d| ��t|d�r>|jtkr>t| |d| ��dt|�ksVdt|�krft| |d| ��dS )zAIs the error actually a timeout? Will raise a ReadTimeout or passz!Read timed out. (read timeout=%s)�errnoz timed outzdid not complete (read)N)r? �
SocketTimeoutr �hasattrrb �_blocking_errnos�str)r, �err�url�
timeout_valuer- r- r. �_raise_timeout1 s
z!HTTPConnectionPool._raise_timeoutc
: K s | j d7 _ | j|�}|j� |j|_y| j|� W n: ttfk
rp } z| j|||jd� � W Y dd}~X nX |r�|j ||f|� n|j
||f|� |j } t |dd�r�| dkr�t
| |d| ��| tjkr�|jjtj� � n |jj| � yjy|jdd�}
W nT tk
�rP y |j� }
W n0 tk
�rJ } ztj|d� W Y dd}~X nX Y nX W n< tttfk
�r� } z| j||| d� � W Y dd}~X nX t |d d
�} tjd | j | j | j ||| |
j |
j � yt!|
j"� W n@ t#tfk
�r } z tj$d | j%|�| dd
� W Y dd} ~ X nX |
S )a
Perform a request on a given urllib connection object taken from our
pool.
:param conn:
a connection from one of our connection pools
:param timeout:
Socket timeout in seconds for the request. This can be a
float or integer, which will set the same timeout value for
the socket connect and the socket read, or an instance of
:class:`urllib3.util.Timeout`, which gives you more fine-grained
control over your timeouts.
r )rg rh ri N�sockr z!Read timed out. (read timeout=%s)T)� bufferingZ
_http_vsn_strzHTTP/?z%s://%s:%s "%s %s %s" %s %sz$Failed to parse headers (url=%s): %s)�exc_info)&rI ra Z
start_connectrT r r^ rc r rj Zrequest_chunked�request� read_timeoutrZ r r# �DEFAULT_TIMEOUTrk Z
settimeout�socketZgetdefaulttimeoutZ getresponse� TypeError� Exceptionr Z
raise_from� SocketErrorrQ rR r: r) r+ �statusZlengthr! �msgr r\ �
_absolute_url)
r, rU �methodrh r �chunkedZhttplib_request_kw� timeout_obj�ero �httplib_responseZ http_versionZhper- r- r. �
_make_requestB sT
(
$z HTTPConnectionPool._make_requestc C s t | j| j| j|d�jS )N)r: r) r+ �path)r% r: r) r+ rh )r, r~ r- r- r. rw � s z HTTPConnectionPool._absolute_urlc C sL | j d }| _ y"x |jdd�}|r|j� qW W n tjk
rF Y nX dS )zD
Close all pooled connections and disable the pool.
NF)rC )rB rW r4 r rY )r, Zold_poolrU r- r- r. r4 � s zHTTPConnectionPool.closec C st |j d�rdS t|�\}}}t|�j� }| jr@| r@tj|�}n| j rZ|tj|�krZd}|||f| j| j| jfkS )zj
Check if the given ``url`` is a member of the same host as this
connection pool.
�/TN) �
startswithr$ r' r( r+ r rW r: r) )r, rh r: r) r+ r- r- r. � is_same_host� s
z HTTPConnectionPool.is_same_hostTc
. K s� |dkr| j }t|t�s*tj||| jd�}|
dkr>|
jdd�}
|rZ| j|� rZt| ||��d}|
}| jdkr�|j � }|j
| j � d}d}t || �} �zry�| j
|�}| j| d�}|j|_| jdk o�t|dd� }|r�| j|� | j||||||| d �}|
� s�|nd}||
d
< | jj|f| ||d �|
��}d}W n� tjk
�rN t| d ��Y n� ttt t t t t fk
�r } z�d}t|t t f��r�t |�}n>t|t t!f��r�| j�r�t"d
|�}nt|t tf��r�t d|�}|j#|||| t$j%� d d�}|j&� |}W Y dd}~X nX W d|�s |�o|j'� }d}|�r0| j(|� X |�spt)j*d|||� | j+|||||||f|| |
| d�|
��S dd� }|�o�|j,� }|�r$|j-dk�r�d}y|j#|||| d�}W n( t.k
�r� |j/�r�||� � |S X ||� |j0|� t)j1d||� | j+||||f||||| |
| d�|
��S t2|j3d��}|j4||j-|��r�y|j#|||| d�}W n( t.k
�r� |j5�r~||� � |S X ||� |j&|� t)j1d|� | j+||||f||||| |
| d�|
��S |S ) a�
Get a connection from the pool and perform an HTTP request. This is the
lowest level call for making a request, so you'll need to specify all
the raw details.
.. note::
More commonly, it's appropriate to use a convenience method provided
by :class:`.RequestMethods`, such as :meth:`request`.
.. note::
`release_conn` will only behave as expected if
`preload_content=False` because we want to make
`preload_content=False` the default behaviour someday soon without
breaking backwards compatibility.
:param method:
HTTP request method (such as GET, POST, PUT, etc.)
:param body:
Data to send in the request body (useful for creating
POST requests, see HTTPConnectionPool.post_url for
more convenience).
:param headers:
Dictionary of custom headers to send, such as User-Agent,
If-None-Match, etc. If None, pool headers are used. If provided,
these headers completely replace any pool-specific headers.
:param retries:
Configure the number of retries to allow before raising a
:class:`~urllib3.exceptions.MaxRetryError` exception.
Pass ``None`` to retry until you receive a response. Pass a
:class:`~urllib3.util.retry.Retry` object for fine-grained control
over different types of retries.
Pass an integer number to retry connection errors that many times,
but no other types of errors. Pass zero to never retry.
If ``False``, then retries are disabled and any exception is raised
immediately. Also, instead of raising a MaxRetryError on redirects,
the redirect response will be returned.
:type retries: :class:`~urllib3.util.retry.Retry`, False, or an int.
:param redirect:
If True, automatically handle redirects (status codes 301, 302,
303, 307, 308). Each redirect counts as a retry. Disabling retries
will disable redirect, too.
:param assert_same_host:
If ``True``, will make sure that the host of the pool requests is
consistent else will raise HostChangedError. When False, you can
use the pool on an HTTP proxy and request foreign hosts.
:param timeout:
If specified, overrides the default timeout for this one
request. It may be a float (in seconds) or an instance of
:class:`urllib3.util.Timeout`.
:param pool_timeout:
If set and the pool is set to block=True, then this method will
block for ``pool_timeout`` seconds and raise EmptyPoolError if no
connection is available within the time period.
:param release_conn:
If False, then the urlopen call will not release the connection
back into the pool once a response is received (but will release if
you read the entire contents of the response such as when
`preload_content=True`). This is useful if you're not preloading
the response's content immediately. You will need to call
``r.release_conn()`` on the response ``r`` to return the connection
back into the pool. If None, it takes the value of
``response_kw.get('preload_content', True)``.
:param chunked:
If True, urllib3 will send the body using chunked transfer
encoding. Otherwise, urllib3 will send the body using the standard
content-length form. Defaults to False.
:param int body_pos:
Position to seek to in file-like body in the event of a retry or
redirect. Typically this won't need to be set because urllib3 will
auto-populate the value when needed.
:param \**response_kw:
Additional parameters are passed to
:meth:`urllib3.response.HTTPResponse.from_httplib`
N)�redirect�defaultZpreload_contentTr= F)r rk )r �bodyrM ry Zrequest_method)rB �
connectionrA z"No pool connections are available.zCannot connect to proxy.zConnection aborted.� )r �_poolZ _stacktracez1Retrying (%r) after connection broken by '%r': %s)r � pool_timeout� release_conn�body_posc S s@ y | j � W n. ttttttfk
r: } zW Y d d }~X nX d S )N)�readr r rt r r r )�responser{ r- r- r. �drain_and_release_conn� s
z:HTTPConnectionPool.urlopen.<locals>.drain_and_release_conni/ ZGET)r� r� zRedirecting %s -> %s)rA r� �assert_same_hostr r� r� r� z Retry-Afterz Retry: %s)6rM r? r" Zfrom_intrA rW r� r
r: �copy�updaterE r ra r[ rT r rD rZ r_ r} � ResponseClsZ from_httplibr rY r r r rt r r r r r r
Z increment�sysrm Zsleepr4 r] rQ r\ �urlopenZget_redirect_locationru r Zraise_on_redirectZsleep_for_retryrR �boolZ getheaderZis_retryZraise_on_status)r, rx rh r� rM rA r� r� r r� r� ry r� Z response_kwrU Zrelease_this_connrg Z
clean_exitrz Zis_new_proxy_connr| Z
response_connr� r{ r� Zredirect_locationZhas_retry_afterr- r- r. r� � s� ^
zHTTPConnectionPool.urlopen)N)r1 r7 r8 r9 r: r rS r r� r# rp r/ rV r[ r] r^ r_ ra rj r` r} rw r4 r� r� r- r- r- r. r< b s. :%
& Ur< c sn e Zd ZdZdZeZddejddddddddddddddfdd�Z dd � Z
d
d � Z d d
� Z � fdd�Z
� ZS )�HTTPSConnectionPoola�
Same as :class:`.HTTPConnectionPool`, but HTTPS.
When Python is compiled with the :mod:`ssl` module, then
:class:`.VerifiedHTTPSConnection` is used, which *can* verify certificates,
instead of :class:`.HTTPSConnection`.
:class:`.VerifiedHTTPSConnection` uses one of ``assert_fingerprint``,
``assert_hostname`` and ``host`` in this order to verify connections.
If ``assert_hostname`` is False, no verification is done.
The ``key_file``, ``cert_file``, ``cert_reqs``, ``ca_certs``,
``ca_cert_dir``, and ``ssl_version`` are only used if :mod:`ssl` is
available and are fed into :meth:`urllib3.util.ssl_wrap_socket` to upgrade
the connection socket into an SSL socket.
�httpsNFr c K sf t j| ||||||||| |
f |� |r2|
d kr2d}
| | _| | _|
| _|| _|| _|| _|| _|| _ d S )NZ
CERT_REQUIRED)
r< r/ �key_file� cert_file� cert_reqs�ca_certs� ca_cert_dir� ssl_version�assert_hostname�assert_fingerprint)r, r) r+ r> r rL rC rM rA rN rO r� r� r� r� r� r� r� r� rJ r- r- r. r/ � s z HTTPSConnectionPool.__init__c C s< t |t�r8|j| j| j| j| j| j| j| j d� | j
|_
|S )z�
Prepare the ``connection`` for :meth:`urllib3.util.ssl_wrap_socket`
and establish the tunnel if proxy is used.
)r� r� r� r� r� r� r� ) r? r Zset_certr� r� r� r� r� r� r� r� )r, rU r- r- r. �
_prepare_conn s
z!HTTPSConnectionPool._prepare_connc C sf y
|j }W n tk
r$ |j}Y nX tjdkrH| j rH|| j| j� n|| j| j| j� |j� dS )z�
Establish tunnel connection early, because otherwise httplib
would improperly set Host: header to proxy's IP:port.
r� � � N)r� r� r� ) �
set_tunnelrX Z _set_tunnelr� � version_inforE r* r+ �connect)r, rU r� r- r- r. r_ s
z"HTTPSConnectionPool._prepare_proxyc C s� | j d7 _ tjd| j | j� | j s2| jtkr:td��| j}| j}| jdk r`| jj}| jj}| jf ||| j j
| j d�| j ��}| j
|�S )zB
Return a fresh :class:`httplib.HTTPSConnection`.
r z&Starting new HTTPS connection (%d): %szCCan't connect to HTTPS URL because the SSL module is not available.N)r) r+ r r> )rH rQ rR r) rS r r r+ rD r rT r> rJ r� )r, Z actual_hostZ actual_portrU r- r- r. rV 2 s
z HTTPSConnectionPool._new_connc s: t t| �j|� t|dd�s$|j� |js6tjdt� dS )zU
Called right before a request is made, after the socket is created.
rk Nz�Unverified HTTPS request is being made. Adding certificate verification is strongly advised. See: https://urllib3.readthedocs.io/en/latest/advanced-usage.html#ssl-warnings) �superr� r^ rZ r� Z is_verified�warnings�warnr )r, rU )� __class__r- r. r^ J s z"HTTPSConnectionPool._validate_conn)r1 r7 r8 r9 r: r rS r# rp r/ r� r_ rV r^ �
__classcell__r- r- )r� r. r� � s r� c K sR t | �\}}}|p tj|d�}|dkr:t|fd|i|��S t|fd|i|��S dS )a�
Given a url, return an :class:`.ConnectionPool` instance of its host.
This is a shortcut for not having to parse out the scheme, host, and port
of the url before creating an :class:`.ConnectionPool` instance.
:param url:
Absolute URL string that must include the scheme. Port is optional.
:param \**kw:
Passes additional parameters to the constructor of the appropriate
:class:`.ConnectionPool`. Useful for specifying things like
timeout, maxsize, headers, etc.
Example::
>>> conn = connection_from_url('http://google.com/')
>>> r = conn.request('GET', '/')
�P r� r+ N)r$ r rW r� r< )rh �kwr: r) r+ r- r- r. �connection_from_url] s
r� c C s* | j d�r&| jd�r&| jdd�jd�} | S )z'
Process IPv6 address literals
�[�]z%25�%z[])r� �endswith�replace�strip)r) r- r- r. r' y s r' )KZ
__future__r rb Zloggingr� r� rq r rt r rc �
exceptionsr r r r r
r r r
r r r r r Zpackages.ssl_match_hostnamer Zpackagesr Zpackages.six.movesr r� r r r r r r r rn r r� r Zutil.connectionr Z util.requestr Z
util.responser! Z
util.retryr" Z util.timeoutr# Zutil.urlr$ r% ZPY2ZQueueZ_unused_module_QueueZmovesrF Z getLoggerr1 rQ �objectr` r& �setZEAGAINZ EWOULDBLOCKre r< r� r� r' r- r- r- r. �<module> sF < $
% | pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.pyc 0000644 00000031074 14751155150 0017517 0 ustar 00 3
���e�A � @ s d dl mZ d dlZd dlZd dlZddlmZ ddlmZm Z ddlm
Z
ddl m Z m
Z
mZ ddlmZ dd lmZ dd
lmZ dd lmZ d d
dgZeje�Zd4Zd5Z ej d-e �Z d.d/� Z ej e e �ej e e �d0�Z!ee d0�Z"G d1d � d e�Z#G d2d
� d
e#�Z$d3d� Z%dS )6� )�absolute_importN� )�RecentlyUsedContainer)�HTTPConnectionPool�HTTPSConnectionPool)�port_by_scheme)�LocationValueError�
MaxRetryError�ProxySchemeUnknown)�urljoin)�RequestMethods)� parse_url)�Retry� PoolManager� ProxyManager�proxy_from_url�key_file� cert_file� cert_reqs�ca_certs� ssl_version� ca_cert_dir� ssl_context�
key_scheme�key_host�key_port� key_timeout� key_retries�
key_strict� key_block�key_source_address� key_key_file�
key_cert_file�
key_cert_reqs� key_ca_certs�key_ssl_version�key_ca_cert_dir�key_ssl_context� key_maxsize� key_headers�
key__proxy�key__proxy_headers�key_socket_options�key__socks_options�key_assert_hostname�key_assert_fingerprint�PoolKeyc C s� |j � }|d j� |d< |d j� |d< x4d D ],}||kr.|| dk r.t|| j� �||< q.W |jd�}|dk r|t|�|d< x&t|j� �D ]}|j|�|d| < q�W x | j D ]}||kr�d||< q�W | f |�S )
a�
Create a pool key out of a request context dictionary.
According to RFC 3986, both the scheme and host are case-insensitive.
Therefore, this function normalizes both before constructing the pool
key for an HTTPS request. If you wish to change this behaviour, provide
alternate callables to ``key_fn_by_scheme``.
:param key_class:
The class to use when constructing the key. This should be a namedtuple
with the ``scheme`` and ``host`` keys at a minimum.
:type key_class: namedtuple
:param request_context:
A dictionary-like object that contain the context for a request.
:type request_context: dict
:return: A namedtuple that can be used as a connection pool key.
:rtype: PoolKey
�scheme�host�headers�_proxy_headers�_socks_optionsNZsocket_optionsZkey_)r3 r4 r5 )
�copy�lower� frozenset�items�get�tuple�list�keys�pop�_fields)Z key_class�request_context�context�keyZ socket_optsZfield� rC �!/usr/lib/python3.6/poolmanager.py�_default_key_normalizer9 s
rE )�http�httpsc @ sx e Zd ZdZdZd dd�Zdd� Zdd � Zd d
d �Zd d
� Z d dd�Z
dd� Z d dd�Z d dd�Z
dd� Zd!dd�ZdS )"r a$
Allows for arbitrary requests while transparently keeping track of
necessary connection pools for you.
:param num_pools:
Number of connection pools to cache before discarding the least
recently used pool.
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
:param \**connection_pool_kw:
Additional parameters are used to create fresh
:class:`urllib3.connectionpool.ConnectionPool` instances.
Example::
>>> manager = PoolManager(num_pools=2)
>>> r = manager.request('GET', 'http://google.com/')
>>> r = manager.request('GET', 'http://google.com/mail')
>>> r = manager.request('GET', 'http://yahoo.com/')
>>> len(manager.pools)
2
N�
c K s8 t j| |� || _t|dd� d�| _t| _tj� | _d S )Nc S s | j � S )N)�close)�prC rC rD �<lambda>� s z&PoolManager.__init__.<locals>.<lambda>)Z dispose_func)r �__init__�connection_pool_kwr �pools�pool_classes_by_scheme�key_fn_by_schemer6 )�self� num_poolsr3 rM rC rC rD rL � s zPoolManager.__init__c C s | S )NrC )rQ rC rC rD � __enter__� s zPoolManager.__enter__c C s | j � dS )NF)�clear)rQ �exc_typeZexc_valZexc_tbrC rC rD �__exit__� s zPoolManager.__exit__c C sf | j | }|dkr | jj� }xdD ]}|j|d� q"W |dkrXxtD ]}|j|d� qDW |||f|�S )a�
Create a new :class:`ConnectionPool` based on host, port, scheme, and
any additional pool keyword arguments.
If ``request_context`` is provided, it is provided as keyword arguments
to the pool class used. This method is used to actually create the
connection pools handed out by :meth:`connection_from_url` and
companion methods. It is intended to be overridden for customization.
Nr1 r2 �portrF )r1 r2 rW )rO rM r6 r> � SSL_KEYWORDS)rQ r1 r2 rW r@ Zpool_clsrB �kwrC rC rD � _new_pool� s
zPoolManager._new_poolc C s | j j� dS )z�
Empty our store of pools and direct them all to close.
This will not affect in-flight connections, but they will not be
re-used after completion.
N)rN rT )rQ rC rC rD rT � s zPoolManager.clearrF c C sT |s t d��| j|�}|p d|d< |s:tj|d j� d�}||d< ||d< | j|�S )a�
Get a :class:`ConnectionPool` based on the host, port, and scheme.
If ``port`` isn't given, it will be derived from the ``scheme`` using
``urllib3.connectionpool.port_by_scheme``. If ``pool_kwargs`` is
provided, it is merged with the instance's ``connection_pool_kw``
variable and used to create the new connection pool, if one is
needed.
zNo host specified.rF r1 �P rW r2 )r �_merge_pool_kwargsr r: r7 �connection_from_context)rQ r2 rW r1 � pool_kwargsr@ rC rC rD �connection_from_host� s
z PoolManager.connection_from_hostc C s, |d j � }| j| }||�}| j||d�S )z�
Get a :class:`ConnectionPool` based on the request context.
``request_context`` must at least contain the ``scheme`` key and its
value must be a key in ``key_fn_by_scheme`` instance variable.
r1 )r@ )r7 rP �connection_from_pool_key)rQ r@ r1 Zpool_key_constructor�pool_keyrC rC rD r] � s
z#PoolManager.connection_from_contextc
C s` | j j�N | j j|�}|r |S |d }|d }|d }| j||||d�}|| j |< W dQ R X |S )z�
Get a :class:`ConnectionPool` based on the provided pool key.
``pool_key`` should be a namedtuple that only contains immutable
objects. At a minimum it must have the ``scheme``, ``host``, and
``port`` fields.
r1 r2 rW )r@ N)rN �lockr: rZ )rQ ra r@ Zpoolr1 r2 rW rC rC rD r` � s
z$PoolManager.connection_from_pool_keyc C s t |�}| j|j|j|j|d�S )a�
Similar to :func:`urllib3.connectionpool.connection_from_url`.
If ``pool_kwargs`` is not provided and a new pool needs to be
constructed, ``self.connection_pool_kw`` is used to initialize
the :class:`urllib3.connectionpool.ConnectionPool`. If ``pool_kwargs``
is provided, it is used instead. Note that if a new pool does not
need to be created for the request, the provided ``pool_kwargs`` are
not used.
)rW r1 r^ )r
r_ r2 rW r1 )rQ �urlr^ �urC rC rD �connection_from_url
s z PoolManager.connection_from_urlc C sZ | j j� }|rVxF|j� D ]:\}}|dkrJy
||= W qR tk
rF Y qRX q|||< qW |S )a
Merge a dictionary of override values for self.connection_pool_kw.
This does not modify self.connection_pool_kw and returns a new dict.
Any keys in the override dictionary with a value of ``None`` are
removed from the merged dictionary.
N)rM r6 r9 �KeyError)rQ �overrideZbase_pool_kwargsrB �valuerC rC rD r\ s
z PoolManager._merge_pool_kwargsTc K sd t |�}| j|j|j|jd�}d|d< d|d< d|krD| jj� |d< | jdk rj|jdkrj|j||f|�}n|j||j f|�}|o�|j
� }|s�|S t ||�}|j dkr�d }|j
d
�} t| t�s�tj| |d �} | jo�|j|� � r�x | jD ]}
|d j|
d� q�W y| j||||d �} W n tk
�r4 | j�r0� |S X | |d
< ||d< tjd
||� | j||f|�S )a]
Same as :meth:`urllib3.connectionpool.HTTPConnectionPool.urlopen`
with custom cross-host redirect logic and only sends the request-uri
portion of the ``url``.
The given ``url`` parameter must be absolute, such that an appropriate
:class:`urllib3.connectionpool.ConnectionPool` can be chosen for it.
)rW r1 FZassert_same_host�redirectr3 NrF i/ ZGET�retries)ri )�responseZ_poolzRedirecting %s -> %s)r
r_ r2 rW r1 r3 r6 �proxy�urlopenZ request_uriZget_redirect_locationr Zstatusr: �
isinstancer Zfrom_intZremove_headers_on_redirectZ is_same_hostr> Z incrementr Zraise_on_redirect�log�info) rQ �methodrc ri rY rd Zconnrk Zredirect_locationrj �headerrC rC rD rm - s@
zPoolManager.urlopen)rH N)N)NrF N)N)N)T)�__name__�
__module__� __qualname__�__doc__rl rL rS rV rZ rT r_ r] r` re r\ rm rC rC rC rD r y s
c sH e Zd ZdZd� fdd� Zd� fdd� Zdd d
�Zd� fd d
� Z� ZS )r aw
Behaves just like :class:`PoolManager`, but sends all requests through
the defined proxy, using the CONNECT method for HTTPS URLs.
:param proxy_url:
The URL of the proxy to be used.
:param proxy_headers:
A dictionary contaning headers that will be sent to the proxy. In case
of HTTP they are being sent with each request, while in the
HTTPS/CONNECT case they are sent only once. Could be used for proxy
authentication.
Example:
>>> proxy = urllib3.ProxyManager('http://localhost:3128/')
>>> r1 = proxy.request('GET', 'http://google.com/')
>>> r2 = proxy.request('GET', 'http://httpbin.org/')
>>> len(proxy.pools)
1
>>> r3 = proxy.request('GET', 'https://httpbin.org/')
>>> r4 = proxy.request('GET', 'https://twitter.com/')
>>> len(proxy.pools)
3
rH Nc s� t |t�r d|j|j|jf }t|�}|jsFtj|jd�}|j|d�}|jdkrZt |j��|| _
|pfi | _ | j
|d< | j |d< t t
| �j||f|� d S ) Nz
%s://%s:%ir[ )rW rF rG �_proxyr4 )rF rG )rn r r1 r2 rW r
r r: �_replacer
rl �
proxy_headers�superr rL )rQ � proxy_urlrR r3 ry rM rl rW )� __class__rC rD rL � s
zProxyManager.__init__rF c sD |dkr t t| �j||||d�S t t| �j| jj| jj| jj|d�S )NrG )r^ )rz r r_ rl r2 rW r1 )rQ r2 rW r1 r^ )r| rC rD r_ � s
z!ProxyManager.connection_from_hostc C s0 ddi}t |�j}|r ||d< |r,|j|� |S )z�
Sets headers needed by proxies: specifically, the Accept and Host
headers. Only sets headers not provided by the user.
ZAcceptz*/*ZHost)r
�netloc�update)rQ rc r3 Zheaders_r} rC rC rD �_set_proxy_headers� s
z ProxyManager._set_proxy_headersTc sN t |�}|jdkr0|jd| j�}| j||�|d< tt| �j||fd|i|��S )z@Same as HTTP(S)ConnectionPool.urlopen, ``url`` must be absolute.rF r3 ri )r
r1 r: r3 r rz r rm )rQ rq rc ri rY rd r3 )r| rC rD rm � s
zProxyManager.urlopen)rH NN)NrF N)N)T) rs rt ru rv rL r_ r rm �
__classcell__rC rC )r| rD r i s
c K s t f d| i|��S )Nr{ )r )rc rY rC rC rD r � s )r r r r r r r )r r r r r r r r r! r" r# r$ r% r& r' r( r) r* r+ r, r- r. r/ )&Z
__future__r � collections� functoolsZlogging� _collectionsr Zconnectionpoolr r r �
exceptionsr r r
Z packages.six.moves.urllib.parser Zrequestr Zutil.urlr
Z
util.retryr �__all__Z getLoggerrs ro rX Z _key_fields�
namedtupler0 rE �partialrP rO r r r rC rC rC rD �<module> s`
6
qW pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.opt-1.pyc 0000644 00000024121 14751155150 0020326 0 ustar 00 3
���e� � @ sL d dl mZ ddlmZ G dd� de�ZG dd� de�ZG dd � d e�Z G d
d � d e �Z
G d d
� d
e�Z G dd� de�Z G dd� de�Z
G dd� de�ZeZG dd� de
�ZG dd� de
�ZG dd� de�ZG dd� de�ZG d d � d ee
�ZG d d � d e�ZG d d!� d!ee �ZG d"d#� d#e �ZG d$d%� d%e �ZG d&d'� d'ee�ZG d(d)� d)e�ZG d*d+� d+e�Z G d,d-� d-e�Z G d.d/� d/e �Z G d0d1� d1e �Z G d2d3� d3e �Z G d4d5� d5e �Z!G d6d7� d7e�Z"G d8d9� d9e�Z#G d:d;� d;ee�Z$G d<d=� d=e�Z%G d>d?� d?ee�ZG d@dA� dAe�Z&G dBdC� dCe'e�Z(G dDdE� dEe�Z)G dFdG� dGe�Z*dHS )I� )�absolute_import� )�IncompleteReadc @ s e Zd ZdZdS )� HTTPErrorz#Base exception used by this module.N)�__name__�
__module__� __qualname__�__doc__� r
r
� /usr/lib/python3.6/exceptions.pyr s r c @ s e Zd ZdZdS )� HTTPWarningz!Base warning used by this module.N)r r r r r
r
r
r r
s r c @ s e Zd ZdZdd� Zdd� ZdS )� PoolErrorz/Base exception for errors caused within a pool.c C s || _ tj| d||f � d S )Nz%s: %s)�poolr �__init__)�selfr �messager
r
r r s zPoolError.__init__c C s
| j dfS )N)NN)� __class__)r r
r
r �
__reduce__ s zPoolError.__reduce__N)r r r r r r r
r
r
r r
s r
c @ s e Zd ZdZdd� Zdd� ZdS )� RequestErrorz8Base exception for PoolErrors that have associated URLs.c C s || _ tj| ||� d S )N)�urlr
r )r r r r r
r
r r s zRequestError.__init__c C s | j d | jd ffS )N)r r )r r
r
r r # s zRequestError.__reduce__N)r r r r r r r
r
r
r r s r c @ s e Zd ZdZdS )�SSLErrorz9Raised when SSL certificate fails in an HTTPS connection.N)r r r r r
r
r
r r ( s r c @ s e Zd ZdZdS )�
ProxyErrorz,Raised when the connection to a proxy fails.N)r r r r r
r
r
r r - s r c @ s e Zd ZdZdS )� DecodeErrorz;Raised when automatic decoding based on Content-Type fails.N)r r r r r
r
r
r r 2 s r c @ s e Zd ZdZdS )�
ProtocolErrorz>Raised when something unexpected happens mid-request/response.N)r r r r r
r
r
r r 7 s r c @ s e Zd ZdZddd�ZdS )�
MaxRetryErrora Raised when the maximum number of retries is exceeded.
:param pool: The connection pool
:type pool: :class:`~urllib3.connectionpool.HTTPConnectionPool`
:param string url: The requested Url
:param exceptions.Exception reason: The underlying error
Nc C s& || _ d||f }tj| |||� d S )Nz0Max retries exceeded with url: %s (Caused by %r))�reasonr r )r r r r r r
r
r r L s
zMaxRetryError.__init__)N)r r r r r r
r
r
r r B s r c @ s e Zd ZdZddd�ZdS )�HostChangedErrorz?Raised when an existing pool gets a request for a foreign host.� c C s" d| }t j| |||� || _d S )Nz)Tried to open a foreign host with url: %s)r r �retries)r r r r r r
r
r r X s zHostChangedError.__init__N)r )r r r r r r
r
r
r r U s r c @ s e Zd ZdZdS )�TimeoutStateErrorz3 Raised when passing an invalid state to a timeout N)r r r r r
r
r
r r ^ s r c @ s e Zd ZdZdS )� TimeoutErrorz� Raised when a socket timeout error occurs.
Catching this error will catch both :exc:`ReadTimeoutErrors
<ReadTimeoutError>` and :exc:`ConnectTimeoutErrors <ConnectTimeoutError>`.
N)r r r r r
r
r
r r c s r c @ s e Zd ZdZdS )�ReadTimeoutErrorzFRaised when a socket timeout occurs while receiving data from a serverN)r r r r r
r
r
r r! l s r! c @ s e Zd ZdZdS )�ConnectTimeoutErrorz@Raised when a socket timeout occurs while connecting to a serverN)r r r r r
r
r
r r" s s r" c @ s e Zd ZdZdS )�NewConnectionErrorzHRaised when we fail to establish a new connection. Usually ECONNREFUSED.N)r r r r r
r
r
r r# x s r# c @ s e Zd ZdZdS )�EmptyPoolErrorzCRaised when a pool runs out of connections and no more are allowed.N)r r r r r
r
r
r r$ } s r$ c @ s e Zd ZdZdS )�ClosedPoolErrorzCRaised when a request enters a pool after the pool has been closed.N)r r r r r
r
r
r r% � s r% c @ s e Zd ZdZdS )�LocationValueErrorz<Raised when there is something wrong with a given URL input.N)r r r r r
r
r
r r& � s r& c @ s e Zd ZdZdd� ZdS )�LocationParseErrorz=Raised when get_host or similar fails to parse the URL input.c C s d| }t j| |� || _d S )NzFailed to parse: %s)r r �location)r r( r r
r
r r � s zLocationParseError.__init__N)r r r r r r
r
r
r r' � s r' c @ s e Zd ZdZdZdZdS )�
ResponseErrorzDUsed as a container for an error reason supplied in a MaxRetryError.ztoo many error responsesz&too many {status_code} error responsesN)r r r r Z
GENERIC_ERRORZSPECIFIC_ERRORr
r
r
r r) � s r) c @ s e Zd ZdZdS )�SecurityWarningz/Warned when perfoming security reducing actionsN)r r r r r
r
r
r r* � s r* c @ s e Zd ZdZdS )�SubjectAltNameWarningzBWarned when connecting to a host with a certificate missing a SAN.N)r r r r r
r
r
r r+ � s r+ c @ s e Zd ZdZdS )�InsecureRequestWarningz/Warned when making an unverified HTTPS request.N)r r r r r
r
r
r r, � s r, c @ s e Zd ZdZdS )�SystemTimeWarningz0Warned when system time is suspected to be wrongN)r r r r r
r
r
r r- � s r- c @ s e Zd ZdZdS )�InsecurePlatformWarningzEWarned when certain SSL configuration is not available on a platform.N)r r r r r
r
r
r r. � s r. c @ s e Zd ZdZdS )�SNIMissingWarningz9Warned when making a HTTPS request without SNI available.N)r r r r r
r
r
r r/ � s r/ c @ s e Zd ZdZdS )�DependencyWarningzc
Warned when an attempt is made to import a module with missing optional
dependencies.
N)r r r r r
r
r
r r0 � s r0 c @ s e Zd ZdZdS )�ResponseNotChunkedz;Response needs to be chunked in order to read it as chunks.N)r r r r r
r
r
r r1 � s r1 c @ s e Zd ZdZdS )�BodyNotHttplibCompatiblezz
Body should be httplib.HTTPResponse like (have an fp attribute which
returns raw chunks) for read_chunked().
N)r r r r r
r
r
r r2 � s r2 c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r z�
Response length doesn't match expected Content-Length
Subclass of http_client.IncompleteRead to allow int value
for `partial` to avoid creating large objects on streamed
reads.
c s t t| �j||� d S )N)�superr r )r �partial�expected)r r
r r � s zIncompleteRead.__init__c C s d| j | jf S )Nz/IncompleteRead(%i bytes read, %i more expected))r4 r5 )r r
r
r �__repr__� s zIncompleteRead.__repr__)r r r r r r6 �
__classcell__r
r
)r r r � s r c @ s e Zd ZdZdS )�
InvalidHeaderz(The header provided was somehow invalid.N)r r r r r
r
r
r r8 � s r8 c s e Zd ZdZ� fdd�Z� ZS )�ProxySchemeUnknownz1ProxyManager does not support the supplied schemec s d| }t t| �j|� d S )Nz Not supported proxy scheme %s)r3 r9 r )r �schemer )r r
r r � s zProxySchemeUnknown.__init__)r r r r r r7 r
r
)r r r9 � s r9 c s e Zd ZdZ� fdd�Z� ZS )�HeaderParsingErrorzNRaised by assert_header_parsing, but we convert it to a log.warning statement.c s$ d|pd|f }t t| �j|� d S )Nz%s, unparsed data: %rZUnknown)r3 r; r )r ZdefectsZ
unparsed_datar )r r
r r � s zHeaderParsingError.__init__)r r r r r r7 r
r
)r r r; � s r; c @ s e Zd ZdZdS )�UnrewindableBodyErrorz9urllib3 encountered an error when trying to rewind a bodyN)r r r r r
r
r
r r< � s r< N)+Z
__future__r Z packages.six.moves.http_clientr Zhttplib_IncompleteRead� Exceptionr �Warningr r
r r r r r �ConnectionErrorr r r r r! r" r# r$ r% �
ValueErrorr& r' r) r* r+ r, r- r. r/ r0 r1 r2 r8 �AssertionErrorr9 r; r< r
r
r
r �<module> sH
pip/_vendor/urllib3/__pycache__/connection.cpython-36.pyc 0000644 00000021073 14751155150 0017350 0 ustar 00 3
���e�2 � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlZd dlmZm Z
d dl Z ddl m
Z
ddlmZ ddlmZ yd dlZejZW n, eefk
r� dZG dd � d e�ZY nX yeZW n$ ek
r� G d
d � d e�ZY nX dd lm Z m Z m Z m Z dd
l m!Z!m"Z" ddl#m$Z$m%Z%m&Z&m'Z'm(Z( ddl)m*Z* ddl+m,Z, ej-e.�Z/ddd�Z0ej1ddd�Z2G dd� de3�Z4G dd� dee3�ZG dd� de�Z5G dd � d e5�Z6d d � Z7e�r�e5Z8e6Z5ne4Z5dS ) � )�absolute_importN)�error�timeout� )�six)�HTTPConnection)�
HTTPExceptionc @ s e Zd ZdS )� BaseSSLErrorN)�__name__�
__module__� __qualname__� r
r
� /usr/lib/python3.6/connection.pyr s r c @ s e Zd ZdS )�ConnectionErrorN)r
r r r
r
r
r r s r )�NewConnectionError�ConnectTimeoutError�SubjectAltNameWarning�SystemTimeWarning)�match_hostname�CertificateError)�resolve_cert_reqs�resolve_ssl_version�assert_fingerprint�create_urllib3_context�ssl_wrap_socket)�
connection)�HTTPHeaderDict�P i� )�http�httpsi� c @ s e Zd ZdZdS )�DummyConnectionz-Used to detect a failed ConnectionCls import.N)r
r r �__doc__r
r
r
r r A s r c @ sV e Zd ZdZed ZejejdfgZ dZ
dd� Z dd� Z d d
� Z
d d � Zddd�Zd
S )r a{
Based on httplib.HTTPConnection but provides an extra constructor
backwards-compatibility layer between older and newer Pythons.
Additional keyword parameters are used to configure attributes of the connection.
Accepted parameters include:
- ``strict``: See the documentation on :class:`urllib3.connectionpool.HTTPConnectionPool`
- ``source_address``: Set the source address for the current connection.
.. note:: This is ignored for Python 2.6. It is only applied for 2.7 and 3.x
- ``socket_options``: Set specific options on the underlying socket. If not specified, then
defaults are loaded from ``HTTPConnection.default_socket_options`` which includes disabling
Nagle's algorithm (sets TCP_NODELAY to 1) unless the connection is behind a proxy.
For example, if you wish to enable TCP Keep Alive in addition to the defaults,
you might pass::
HTTPConnection.default_socket_options + [
(socket.SOL_SOCKET, socket.SO_KEEPALIVE, 1),
]
Or you may want to disable the defaults by passing an empty list (e.g., ``[]``).
r r Fc O sZ t jr|jdd � |jd�| _tjdk r4|jdd � |jd| j�| _t j
| f|�|� d S )N�strict�source_address� � �socket_options)r$ r% ) r ZPY3�pop�getr# �sys� version_info�default_socket_optionsr& �_HTTPConnection�__init__)�self�args�kwr
r
r r- j s
zHTTPConnection.__init__c C s� i }| j r| j |d< | jr$| j|d< y tj| j| jf| jf|�}W nf tk
rz } z t| d| j| jf ��W Y dd}~X n0 t k
r� } zt
| d| ��W Y dd}~X nX |S )zp Establish a socket connection and set nodelay settings on it.
:return: New socket connection.
r# r& z0Connection to %s timed out. (connect timeout=%s)Nz(Failed to establish a new connection: %s) r# r& r Zcreate_connection�host�portr �
SocketTimeoutr � SocketErrorr )r. Zextra_kw�conn�er
r
r � _new_conn s
zHTTPConnection._new_connc C s$ || _ t| dd �r | j� d| _d S )N� _tunnel_hostr )�sock�getattr�_tunnel� auto_open)r. r5 r
r
r �
_prepare_conn� s z HTTPConnection._prepare_connc C s | j � }| j|� d S )N)r7 r= )r. r5 r
r
r �connect� s zHTTPConnection.connectNc C s t |dk r|ni �}d|k}d|k}| j||||d� x |j� D ]\}}| j||� q@W d|krl| jdd� | j� |dk �rtjtjf } t|| �r�|f}xj|D ]b}
|
s�q�t|
tj�s�|
j d�}
t
t |
��d d� } | j | j d
�� | j d � | j |
� | j d � q�W | j d � dS )
z�
Alternative to the common request method, which sends the
body with chunked encoding and not as one block
Nzaccept-encodingr1 )�skip_accept_encoding� skip_hostztransfer-encodingzTransfer-EncodingZchunked�utf8r$ zutf-8s
s 0
)
r Z
putrequest�itemsZ putheaderZ
endheadersr Z string_typesZ binary_type�
isinstance�encode�hex�len�send) r. �methodZurlZbodyZheadersr? r@ �header�valueZstringish_types�chunkZlen_strr
r
r �request_chunked� s8
z HTTPConnection.request_chunked)NN)r
r r r! �port_by_scheme� default_port�socketZ IPPROTO_TCPZ TCP_NODELAYr+ � is_verifiedr- r7 r= r> rL r
r
r
r r F s r c @ s8 e Zd Zed ZdZddddejdfdd�Zdd� Z dS )�HTTPSConnectionr Nc K s8 t j| ||f||d�|�� || _|| _|| _d| _d S )N)r" r r )r r- �key_file� cert_file� ssl_contextZ _protocol) r. r1 r2 rR rS r" r rT r0 r
r
r r- � s zHTTPSConnection.__init__c C sN | j � }| j|� | jd kr2ttd �td �d�| _t|| j| j| jd�| _ d S )N)� ssl_version� cert_reqs)r9 �keyfile�certfilerT )
r7 r= rT r r r r rR rS r9 )r. r5 r
r
r r> � s
zHTTPSConnection.connect)
r
r r rM rN rU rO Z_GLOBAL_DEFAULT_TIMEOUTr- r> r
r
r
r rQ � s
rQ c @ s6 e Zd ZdZdZdZdZdZdZddd�Z dd� Z
dS )�VerifiedHTTPSConnectionz[
Based on httplib.HTTPSConnection but wraps the socket with
SSL certification.
Nc C sn |dkr(|s|rd}n| j dk r(| j j}|| _|| _|| _|| _|| _|oTtjj |�| _
|oftjj |�| _ dS )zX
This method should only be called once, before the connection is used.
N�
CERT_REQUIRED) rT � verify_moderR rS rV �assert_hostnamer �os�path�
expanduser�ca_certs� ca_cert_dir)r. rR rS rV r` r\ r ra r
r
r �set_cert s
z VerifiedHTTPSConnection.set_certc C sL | j � }| j}t| dd �r4|| _| j� d| _| j}tjj � t
k }|rXt j dj
t
�t� | jd kr|tt| j�t| j�d�| _| j}t| j�|_t|| j| j| j| j||d�| _| jr�t| jj dd�| j� nb|jt j ko�t|dd � o�| j d k �r.| jj � }|j d
f ��s t j d j
|�t!� t"|| j �p*|� |jt j#k�pD| jd k | _$d S ) Nr8 r zWSystem time is way off (before {0}). This will probably lead to SSL verification errors)rU rV )r9 rW rX r` ra Zserver_hostnamerT T)Z binary_formZcheck_hostnameFZsubjectAltNamez�Certificate for {0} has no `subjectAltName`, falling back to check for a `commonName` for now. This feature is being removed by major browsers and deprecated by RFC 2818. (See https://github.com/shazow/urllib3/issues/497 for details.))%r7 r1 r: r9 r; r< r8 �datetime�dateZtoday� RECENT_DATE�warnings�warn�formatr rT r r rU r rV r[ r rR rS r` ra r Z getpeercert�sslZ CERT_NONEr\ r( r �_match_hostnamerZ rP )r. r5 ZhostnameZ is_time_off�context�certr
r
r r> sT
z VerifiedHTTPSConnection.connect)NNNNNNN) r
r r r! rV r` ra rU r rb r> r
r
r
r rY � s
rY c C sL yt | |� W n8 tk
rF } z tjd|| � | |_� W Y d d }~X nX d S )Nz@Certificate did not match expected hostname: %s. Certificate: %s)r r �logr Z
_peer_cert)rl Zasserted_hostnamer6 r
r
r rj b s rj )9Z
__future__r rc Zloggingr] r) rO r r4 r r3 rf Zpackagesr Z packages.six.moves.http_clientr r, r ri ZSSLErrorr � ImportError�AttributeError�
BaseExceptionr � NameError� Exception�
exceptionsr r r r Zpackages.ssl_match_hostnamer r Z util.ssl_r r r r r �utilr � _collectionsr Z getLoggerr
rm rM rd re �objectr rQ rY rj ZUnverifiedHTTPSConnectionr
r
r
r �<module> sN
&l pip/_vendor/urllib3/__pycache__/request.cpython-36.opt-1.pyc 0000644 00000012556 14751155150 0017646 0 ustar 00 3
���e: � @ s> d dl mZ ddlmZ ddlmZ dgZG dd� de�ZdS )� )�absolute_import� )�encode_multipart_formdata)� urlencode�RequestMethodsc @ sR e Zd ZdZeddddg�Zddd�Zdd
d �Zdd d
�Zddd�Z ddd�Z
dS )r a�
Convenience mixin for classes who implement a :meth:`urlopen` method, such
as :class:`~urllib3.connectionpool.HTTPConnectionPool` and
:class:`~urllib3.poolmanager.PoolManager`.
Provides behavior for making common types of HTTP request methods and
decides which type of request field encoding to use.
Specifically,
:meth:`.request_encode_url` is for sending requests whose fields are
encoded in the URL (such as GET, HEAD, DELETE).
:meth:`.request_encode_body` is for sending requests whose fields are
encoded in the *body* of the request using multipart or www-form-urlencoded
(such as for POST, PUT, PATCH).
:meth:`.request` is for making any kind of request, it will look up the
appropriate encoding format and use one of the above two methods to make
the request.
Initializer parameters:
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
ZDELETEZGETZHEADZOPTIONSNc C s |pi | _ d S )N)�headers)�selfr � r � /usr/lib/python3.6/request.py�__init__) s zRequestMethods.__init__Tc K s t d��d S )NzMClasses extending RequestMethods must implement their own ``urlopen`` method.)�NotImplemented)r �method�url�bodyr �encode_multipart�multipart_boundary�kwr r r
�urlopen, s zRequestMethods.urlopenc K sJ |j � }|| jkr,| j||f||d�|��S | j||f||d�|��S dS )a�
Make a request using :meth:`urlopen` with the appropriate encoding of
``fields`` based on the ``method`` used.
This is a convenience method that requires the least amount of manual
effort. It can be used in most situations, while still having the
option to drop down to more specific methods when necessary, such as
:meth:`request_encode_url`, :meth:`request_encode_body`,
or even the lowest level :meth:`urlopen`.
)�fieldsr N)�upper�_encode_url_methods�request_encode_url�request_encode_body)r r
r r r �
urlopen_kwr r r
�request2 s
zRequestMethods.requestc K sD |dkr| j }d|i}|j|� |r4|dt|� 7 }| j||f|�S )z�
Make a request using :meth:`urlopen` with the ``fields`` encoded in
the url. This is useful for request methods like GET, HEAD, DELETE, etc.
Nr �?)r �updater r )r r
r r r r �extra_kwr r r
r H s
z!RequestMethods.request_encode_urlc K s� |dkr| j }di i}|rbd|kr*td��|r@t||d�\} }
nt|�d } }
| |d< d|
i|d< |d j|� |j|� | j||f|�S )a�
Make a request using :meth:`urlopen` with the ``fields`` encoded in
the body. This is useful for request methods like POST, PUT, PATCH, etc.
When ``encode_multipart=True`` (default), then
:meth:`urllib3.filepost.encode_multipart_formdata` is used to encode
the payload with the appropriate content type. Otherwise
:meth:`urllib.urlencode` is used with the
'application/x-www-form-urlencoded' content type.
Multipart encoding must be used when posting files, and it's reasonably
safe to use it in other times too. However, it may break request
signing, such as with OAuth.
Supports an optional ``fields`` parameter of key/value strings AND
key/filetuple. A filetuple is a (filename, data, MIME type) tuple where
the MIME type is optional. For example::
fields = {
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(),
'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
}
When uploading a file, providing a filename (the first parameter of the
tuple) is optional but recommended to best mimick behavior of browsers.
Note that if ``headers`` are supplied, the 'Content-Type' header will
be overwritten because it depends on the dynamic random boundary string
which is used to compose the body of the request. The random boundary
string can be explicitly set with the ``multipart_boundary`` parameter.
Nr r zFrequest got values for both 'fields' and 'body', can only specify one.)�boundaryz!application/x-www-form-urlencodedz Content-Type)r � TypeErrorr r r r ) r r
r r r r r r r r Z content_typer r r
r Y s &
z"RequestMethods.request_encode_body)N)NNTN)NN)NN)NNTN) �__name__�
__module__� __qualname__�__doc__�setr r r r r r r r r r
r
s
N) Z
__future__r Zfilepostr Z packages.six.moves.urllib.parser �__all__�objectr r r r r
�<module> s pip/_vendor/urllib3/__pycache__/fields.cpython-36.opt-1.pyc 0000644 00000013240 14751155150 0017413 0 ustar 00 3
���e7 � @ sN d dl mZ d dlZd dlZddlmZ d dd�Zdd � ZG d
d � d e �Z
dS )
� )�absolute_importN� )�six�application/octet-streamc C s | rt j| �d p|S |S )z�
Guess the "Content-Type" of a file.
:param filename:
The filename to guess the "Content-Type" of using :mod:`mimetypes`.
:param default:
If no "Content-Type" can be guessed, default to `default`.
r )� mimetypesZ
guess_type)�filename�default� r � /usr/lib/python3.6/fields.py�guess_content_type s r c s� t � fdd�dD ��sNd| � f }y|jd� W n ttfk
rH Y nX |S tj rlt� tj�rl� jd�� tj j
� d�� d| � f � � S )a�
Helper function to format and quote a single header parameter.
Particularly useful for header parameters which might contain
non-ASCII values, like file names. This follows RFC 2231, as
suggested by RFC 2388 Section 4.4.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
c 3 s | ]}|� kV qd S )Nr )�.0Zch)�valuer r
� <genexpr># s z&format_header_param.<locals>.<genexpr>z"\
z%s="%s"�asciizutf-8z%s*=%s) �any�encode�UnicodeEncodeError�UnicodeDecodeErrorr ZPY3�
isinstanceZ text_type�emailZutilsZencode_rfc2231)�namer
�resultr )r
r
�format_header_param s
r c @ sH e Zd ZdZddd�Zedd� �Zdd� Zd d
� Zd d � Z dd
d�Z
dS )� RequestFieldaK
A data container for request body parameters.
:param name:
The name of this request field.
:param data:
The data/value body.
:param filename:
An optional filename of the request field.
:param headers:
An optional dict-like object of headers to initially use for the field.
Nc C s* || _ || _|| _i | _|r&t|�| _d S )N)�_name� _filename�data�headers�dict)�selfr r r r r r r
�__init__? s zRequestField.__init__c C s^ t |t�r4t|�dkr"|\}}}q@|\}}t|�}n d}d}|}| |||d�}|j|d� |S )a�
A :class:`~urllib3.fields.RequestField` factory from old-style tuple parameters.
Supports constructing :class:`~urllib3.fields.RequestField` from
parameter of key/value strings AND key/filetuple. A filetuple is a
(filename, data, MIME type) tuple where the MIME type is optional.
For example::
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
Field names and filenames must be unicode.
� N)r )� content_type)r �tuple�lenr �make_multipart)�clsZ fieldnamer
r r r" Z
request_paramr r r
� from_tuplesG s
zRequestField.from_tuplesc C s
t ||�S )a
Overridable helper function to format a single header parameter.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
)r )r r r
r r r
� _render_parti s zRequestField._render_partc C sP g }|}t |t�r|j� }x*|D ]"\}}|dk r |j| j||�� q W dj|�S )aO
Helper function to format and quote a single header.
Useful for single headers that are composed of multiple items. E.g.,
'Content-Disposition' fields.
:param header_parts:
A sequence of (k, v) typles or a :class:`dict` of (k, v) to format
as `k1="v1"; k2="v2"; ...`.
Nz; )r r �items�appendr( �join)r Z header_parts�parts�iterabler r
r r r
�
_render_partst s
zRequestField._render_partsc C s� g }dddg}x2|D ]*}| j j|d�r|jd|| j | f � qW x4| j j� D ]&\}}||krN|rN|jd||f � qNW |jd� dj|�S )z=
Renders the headers for this request field.
zContent-Dispositionz Content-TypezContent-LocationFz%s: %sz
)r �getr* r) r+ )r �linesZ sort_keysZsort_keyZ header_nameZ header_valuer r r
�render_headers� s
zRequestField.render_headersc C sX |pd| j d< | j d djd| jd| jfd| jff�g�7 < || j d< || j d< d S )
a|
Makes this request field into a multipart request field.
This method overrides "Content-Disposition", "Content-Type" and
"Content-Location" headers to the request parameter.
:param content_type:
The 'Content-Type' of the request body.
:param content_location:
The 'Content-Location' of the request body.
z form-datazContent-Dispositionz; � r r z Content-TypezContent-LocationN)r r+ r. r r )r Zcontent_dispositionr" Zcontent_locationr r r
r% � s
zRequestField.make_multipart)NN)NNN) �__name__�
__module__� __qualname__�__doc__r � classmethodr' r( r. r1 r% r r r r
r 2 s
" r )r ) Z
__future__r Z email.utilsr r Zpackagesr r r �objectr r r r r
�<module> s
pip/_vendor/urllib3/__pycache__/_collections.cpython-36.pyc 0000644 00000024340 14751155150 0017666 0 ustar 00 3
���e�' � @ s� d dl mZ d dlmZmZ yd dlmZ W n" ek
rN G dd� d�ZY nX yd dlmZ W n ek
r� ddl mZ Y nX ddl
m Z m Z m
Z
d d
gZe� ZG d d � d e�ZG d d
� d
e�Zd
S )� )�absolute_import)�Mapping�MutableMapping)�RLockc @ s e Zd Zdd� Zdd� ZdS )r c C s d S )N� )�selfr r �"/usr/lib/python3.6/_collections.py� __enter__ s zRLock.__enter__c C s d S )Nr )r �exc_type� exc_value� tracebackr r r �__exit__
s zRLock.__exit__N)�__name__�
__module__� __qualname__r r
r r r r r s r )� OrderedDict� )�iterkeys�
itervalues�PY3�RecentlyUsedContainer�HTTPHeaderDictc @ sV e Zd ZdZeZddd�Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dS )r a�
Provides a thread-safe dict-like container which maintains up to
``maxsize`` keys while throwing away the least-recently-used keys beyond
``maxsize``.
:param maxsize:
Maximum number of recent elements to retain.
:param dispose_func:
Every time an item is evicted from the container,
``dispose_func(value)`` is called. Callback which will get called
�
Nc C s" || _ || _| j� | _t� | _d S )N)�_maxsize� dispose_func� ContainerCls�
_containerr �lock)r �maxsizer r r r �__init__+ s
z RecentlyUsedContainer.__init__c
C s, | j � | jj|�}|| j|< |S Q R X d S )N)r r �pop)r �key�itemr r r � __getitem__2 s
z!RecentlyUsedContainer.__getitem__c
C sl t }| j�@ | jj|t �}|| j|< t| j�| jkrF| jjdd�\}}W d Q R X | jrh|t k rh| j|� d S )NF)Zlast)�_Nullr r �get�lenr �popitemr )r r! �valueZ
evicted_valueZ_keyr r r � __setitem__9 s
z!RecentlyUsedContainer.__setitem__c C s2 | j � | jj|�}W d Q R X | jr.| j|� d S )N)r r r r )r r! r( r r r � __delitem__H s z!RecentlyUsedContainer.__delitem__c C s | j � t| j�S Q R X d S )N)r r& r )r r r r �__len__O s z RecentlyUsedContainer.__len__c C s t d��d S )Nz7Iteration over this class is unlikely to be threadsafe.)�NotImplementedError)r r r r �__iter__S s z RecentlyUsedContainer.__iter__c
C sL | j � tt| j��}| jj� W d Q R X | jrHx|D ]}| j|� q6W d S )N)r �listr r �clearr )r �valuesr( r r r r/ V s
zRecentlyUsedContainer.clearc
C s | j � tt| j��S Q R X d S )N)r r. r r )r r r r �keys` s zRecentlyUsedContainer.keys)r N)r r r �__doc__r r r r# r) r* r+ r- r/ r1 r r r r r s
c s� e Zd ZdZd-� fdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
e sZe j
Z
e jZe� Zdd� Zdd� Zefdd�Zdd� Zdd� Zdd � Zefd d �ZeZeZeZeZd d � Z d!d"� Z d#d$� Z d%d&� Z d'd(� Z d)d*� Z!e"d+d,� �Z#� Z$S ).r ap
:param headers:
An iterable of field-value pairs. Must not contain multiple field names
when compared case-insensitively.
:param kwargs:
Additional field-value pairs to pass in to ``dict.update``.
A ``dict`` like container for storing HTTP Headers.
Field names are stored and compared case-insensitively in compliance with
RFC 7230. Iteration provides the first case-sensitive key seen for each
case-insensitive pair.
Using ``__setitem__`` syntax overwrites fields that compare equal
case-insensitively in order to maintain ``dict``'s api. For fields that
compare equal, instead create a new ``HTTPHeaderDict`` and use ``.add``
in a loop.
If multiple fields that are equal case-insensitively are passed to the
constructor or ``.update``, the behavior is undefined and some will be
lost.
>>> headers = HTTPHeaderDict()
>>> headers.add('Set-Cookie', 'foo=bar')
>>> headers.add('set-cookie', 'baz=quxx')
>>> headers['content-length'] = '7'
>>> headers['SET-cookie']
'foo=bar, baz=quxx'
>>> headers['Content-Length']
'7'
Nc sP t t| �j� t� | _|d k r>t|t�r4| j|� n
| j|� |rL| j|� d S )N)�superr r r r �
isinstance�
_copy_from�extend)r �headers�kwargs)� __class__r r r � s
zHTTPHeaderDict.__init__c C s ||g| j |j� < | j |j� S )N)r �lower)r r! �valr r r r) � s zHTTPHeaderDict.__setitem__c C s | j |j� }dj|dd � �S )Nz, r )r r: �join)r r! r; r r r r# � s zHTTPHeaderDict.__getitem__c C s | j |j� = d S )N)r r: )r r! r r r r* � s zHTTPHeaderDict.__delitem__c C s |j � | jkS )N)r: r )r r! r r r � __contains__� s zHTTPHeaderDict.__contains__c C sb t |t� r t|d� r dS t |t| ��s6t| �|�}tdd� | j� D ��tdd� |j� D ��kS )Nr1 Fc s s | ]\}}|j � |fV qd S )N)r: )�.0�k�vr r r � <genexpr>� s z(HTTPHeaderDict.__eq__.<locals>.<genexpr>c s s | ]\}}|j � |fV qd S )N)r: )r> r? r@ r r r rA � s )r4 r �hasattr�type�dict�
itermerged)r �otherr r r �__eq__� s zHTTPHeaderDict.__eq__c C s | j |� S )N)rG )r rF r r r �__ne__� s zHTTPHeaderDict.__ne__c C s
t | j�S )N)r& r )r r r r r+ � s zHTTPHeaderDict.__len__c c s" x | j j� D ]}|d V q W d S )Nr )r r0 )r �valsr r r r- � s zHTTPHeaderDict.__iter__c C s< y | | }W n t k
r, || jkr(� |S X | |= |S dS )z�D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
N)�KeyError�_HTTPHeaderDict__marker)r r! �defaultr( r r r r � s
zHTTPHeaderDict.popc C s$ y
| |= W n t k
r Y nX d S )N)rJ )r r! r r r �discard� s
zHTTPHeaderDict.discardc C s4 |j � }||g}| jj||�}||k r0|j|� dS )z�Adds a (name, value) pair, doesn't overwrite the value if it already
exists.
>>> headers = HTTPHeaderDict(foo='bar')
>>> headers.add('Foo', 'baz')
>>> headers['foo']
'bar, baz'
N)r: r �
setdefault�append)r r! r; Z key_lowerZnew_valsrI r r r �add� s
zHTTPHeaderDict.addc O s t |�dkr tdjt |����t |�dkr2|d nf }t|t�rdx�|j� D ]\}}| j||� qJW nvt|t�r�xj|D ]}| j||| � qtW nLt|d�r�x@|j � D ]}| j||| � q�W n x |D ]\}}| j||� q�W x |j
� D ]\}}| j||� q�W dS )z�Generic import function for any type of header-like object.
Adapted version of MutableMapping.update in order to insert items
with self.add instead of self.__setitem__
r z9extend() takes at most 1 positional arguments ({0} given)r r1 N) r& � TypeError�formatr4 r � iteritemsrP r rB r1 �items)r �argsr8 rF r! r; r( r r r r6 � s"
zHTTPHeaderDict.extendc C sF y| j |j� }W n" tk
r4 || jkr0g S |S X |dd� S dS )zmReturns a list of all the values for the named field. Returns an
empty list if the key doesn't exist.r N)r r: rJ rK )r r! rL rI r r r �getlist� s
zHTTPHeaderDict.getlistc C s dt | �jt| j� �f S )Nz%s(%s))rC r rD rE )r r r r �__repr__ s zHTTPHeaderDict.__repr__c C sB x<|D ]4}|j |�}t|t�r&t|�}|g| | j|j� < qW d S )N)rV r4 r. r r: )r rF r! r; r r r r5 s
zHTTPHeaderDict._copy_fromc C s t | �� }|j| � |S )N)rC r5 )r Zcloner r r �copy s
zHTTPHeaderDict.copyc c sD x>| D ]6}| j |j� }x"|dd� D ]}|d |fV q&W qW dS )z8Iterate over all header lines, including duplicate ones.r Nr )r r: )r r! rI r; r r r rS s
zHTTPHeaderDict.iteritemsc c s< x6| D ].}| j |j� }|d dj|dd� �fV qW dS )z:Iterate over all headers, merging duplicate ones together.r z, r N)r r: r< )r r! r; r r r rE % s
zHTTPHeaderDict.itermergedc C s t | j� �S )N)r. rS )r r r r rT + s zHTTPHeaderDict.itemsc C sn g }x`|j D ]V}|jd�r@|d \}}||d |j� f|d< q |jdd�\}}|j||j� f� q W | |�S ) z4Read headers from a Python 2 httplib message object.� � r z
�:)rY rZ ���r\ )r7 �
startswith�rstrip�splitrO �strip)�cls�messager7 �liner! r( r r r � from_httplib. s
zHTTPHeaderDict.from_httplib)N)%r r r r2 r r) r# r* r= rG rH r r r r �objectrK r+ r- r rM rP r6 rV Z
getheadersZgetallmatchingheadersZigetZget_allrW r5 rX rS rE rT � classmethodrd �
__classcell__r r )r9 r r e s<
N)Z
__future__r � collectionsr r Z threadingr � ImportErrorr Zpackages.ordered_dictZ packages.sixr r r �__all__re r$ r r r r r r �<module> s J pip/_vendor/urllib3/__pycache__/_collections.cpython-36.opt-1.pyc 0000644 00000024340 14751155150 0020625 0 ustar 00 3
���e�' � @ s� d dl mZ d dlmZmZ yd dlmZ W n" ek
rN G dd� d�ZY nX yd dlmZ W n ek
r� ddl mZ Y nX ddl
m Z m Z m
Z
d d
gZe� ZG d d � d e�ZG d d
� d
e�Zd
S )� )�absolute_import)�Mapping�MutableMapping)�RLockc @ s e Zd Zdd� Zdd� ZdS )r c C s d S )N� )�selfr r �"/usr/lib/python3.6/_collections.py� __enter__ s zRLock.__enter__c C s d S )Nr )r �exc_type� exc_value� tracebackr r r �__exit__
s zRLock.__exit__N)�__name__�
__module__� __qualname__r r
r r r r r s r )� OrderedDict� )�iterkeys�
itervalues�PY3�RecentlyUsedContainer�HTTPHeaderDictc @ sV e Zd ZdZeZddd�Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dS )r a�
Provides a thread-safe dict-like container which maintains up to
``maxsize`` keys while throwing away the least-recently-used keys beyond
``maxsize``.
:param maxsize:
Maximum number of recent elements to retain.
:param dispose_func:
Every time an item is evicted from the container,
``dispose_func(value)`` is called. Callback which will get called
�
Nc C s" || _ || _| j� | _t� | _d S )N)�_maxsize� dispose_func� ContainerCls�
_containerr �lock)r �maxsizer r r r �__init__+ s
z RecentlyUsedContainer.__init__c
C s, | j � | jj|�}|| j|< |S Q R X d S )N)r r �pop)r �key�itemr r r � __getitem__2 s
z!RecentlyUsedContainer.__getitem__c
C sl t }| j�@ | jj|t �}|| j|< t| j�| jkrF| jjdd�\}}W d Q R X | jrh|t k rh| j|� d S )NF)Zlast)�_Nullr r �get�lenr �popitemr )r r! �valueZ
evicted_valueZ_keyr r r � __setitem__9 s
z!RecentlyUsedContainer.__setitem__c C s2 | j � | jj|�}W d Q R X | jr.| j|� d S )N)r r r r )r r! r( r r r � __delitem__H s z!RecentlyUsedContainer.__delitem__c C s | j � t| j�S Q R X d S )N)r r& r )r r r r �__len__O s z RecentlyUsedContainer.__len__c C s t d��d S )Nz7Iteration over this class is unlikely to be threadsafe.)�NotImplementedError)r r r r �__iter__S s z RecentlyUsedContainer.__iter__c
C sL | j � tt| j��}| jj� W d Q R X | jrHx|D ]}| j|� q6W d S )N)r �listr r �clearr )r �valuesr( r r r r/ V s
zRecentlyUsedContainer.clearc
C s | j � tt| j��S Q R X d S )N)r r. r r )r r r r �keys` s zRecentlyUsedContainer.keys)r N)r r r �__doc__r r r r# r) r* r+ r- r/ r1 r r r r r s
c s� e Zd ZdZd-� fdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
e sZe j
Z
e jZe� Zdd� Zdd� Zefdd�Zdd� Zdd� Zdd � Zefd d �ZeZeZeZeZd d � Z d!d"� Z d#d$� Z d%d&� Z d'd(� Z d)d*� Z!e"d+d,� �Z#� Z$S ).r ap
:param headers:
An iterable of field-value pairs. Must not contain multiple field names
when compared case-insensitively.
:param kwargs:
Additional field-value pairs to pass in to ``dict.update``.
A ``dict`` like container for storing HTTP Headers.
Field names are stored and compared case-insensitively in compliance with
RFC 7230. Iteration provides the first case-sensitive key seen for each
case-insensitive pair.
Using ``__setitem__`` syntax overwrites fields that compare equal
case-insensitively in order to maintain ``dict``'s api. For fields that
compare equal, instead create a new ``HTTPHeaderDict`` and use ``.add``
in a loop.
If multiple fields that are equal case-insensitively are passed to the
constructor or ``.update``, the behavior is undefined and some will be
lost.
>>> headers = HTTPHeaderDict()
>>> headers.add('Set-Cookie', 'foo=bar')
>>> headers.add('set-cookie', 'baz=quxx')
>>> headers['content-length'] = '7'
>>> headers['SET-cookie']
'foo=bar, baz=quxx'
>>> headers['Content-Length']
'7'
Nc sP t t| �j� t� | _|d k r>t|t�r4| j|� n
| j|� |rL| j|� d S )N)�superr r r r �
isinstance�
_copy_from�extend)r �headers�kwargs)� __class__r r r � s
zHTTPHeaderDict.__init__c C s ||g| j |j� < | j |j� S )N)r �lower)r r! �valr r r r) � s zHTTPHeaderDict.__setitem__c C s | j |j� }dj|dd � �S )Nz, r )r r: �join)r r! r; r r r r# � s zHTTPHeaderDict.__getitem__c C s | j |j� = d S )N)r r: )r r! r r r r* � s zHTTPHeaderDict.__delitem__c C s |j � | jkS )N)r: r )r r! r r r � __contains__� s zHTTPHeaderDict.__contains__c C sb t |t� r t|d� r dS t |t| ��s6t| �|�}tdd� | j� D ��tdd� |j� D ��kS )Nr1 Fc s s | ]\}}|j � |fV qd S )N)r: )�.0�k�vr r r � <genexpr>� s z(HTTPHeaderDict.__eq__.<locals>.<genexpr>c s s | ]\}}|j � |fV qd S )N)r: )r> r? r@ r r r rA � s )r4 r �hasattr�type�dict�
itermerged)r �otherr r r �__eq__� s zHTTPHeaderDict.__eq__c C s | j |� S )N)rG )r rF r r r �__ne__� s zHTTPHeaderDict.__ne__c C s
t | j�S )N)r& r )r r r r r+ � s zHTTPHeaderDict.__len__c c s" x | j j� D ]}|d V q W d S )Nr )r r0 )r �valsr r r r- � s zHTTPHeaderDict.__iter__c C s< y | | }W n t k
r, || jkr(� |S X | |= |S dS )z�D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
N)�KeyError�_HTTPHeaderDict__marker)r r! �defaultr( r r r r � s
zHTTPHeaderDict.popc C s$ y
| |= W n t k
r Y nX d S )N)rJ )r r! r r r �discard� s
zHTTPHeaderDict.discardc C s4 |j � }||g}| jj||�}||k r0|j|� dS )z�Adds a (name, value) pair, doesn't overwrite the value if it already
exists.
>>> headers = HTTPHeaderDict(foo='bar')
>>> headers.add('Foo', 'baz')
>>> headers['foo']
'bar, baz'
N)r: r �
setdefault�append)r r! r; Z key_lowerZnew_valsrI r r r �add� s
zHTTPHeaderDict.addc O s t |�dkr tdjt |����t |�dkr2|d nf }t|t�rdx�|j� D ]\}}| j||� qJW nvt|t�r�xj|D ]}| j||| � qtW nLt|d�r�x@|j � D ]}| j||| � q�W n x |D ]\}}| j||� q�W x |j
� D ]\}}| j||� q�W dS )z�Generic import function for any type of header-like object.
Adapted version of MutableMapping.update in order to insert items
with self.add instead of self.__setitem__
r z9extend() takes at most 1 positional arguments ({0} given)r r1 N) r& � TypeError�formatr4 r � iteritemsrP r rB r1 �items)r �argsr8 rF r! r; r( r r r r6 � s"
zHTTPHeaderDict.extendc C sF y| j |j� }W n" tk
r4 || jkr0g S |S X |dd� S dS )zmReturns a list of all the values for the named field. Returns an
empty list if the key doesn't exist.r N)r r: rJ rK )r r! rL rI r r r �getlist� s
zHTTPHeaderDict.getlistc C s dt | �jt| j� �f S )Nz%s(%s))rC r rD rE )r r r r �__repr__ s zHTTPHeaderDict.__repr__c C sB x<|D ]4}|j |�}t|t�r&t|�}|g| | j|j� < qW d S )N)rV r4 r. r r: )r rF r! r; r r r r5 s
zHTTPHeaderDict._copy_fromc C s t | �� }|j| � |S )N)rC r5 )r Zcloner r r �copy s
zHTTPHeaderDict.copyc c sD x>| D ]6}| j |j� }x"|dd� D ]}|d |fV q&W qW dS )z8Iterate over all header lines, including duplicate ones.r Nr )r r: )r r! rI r; r r r rS s
zHTTPHeaderDict.iteritemsc c s< x6| D ].}| j |j� }|d dj|dd� �fV qW dS )z:Iterate over all headers, merging duplicate ones together.r z, r N)r r: r< )r r! r; r r r rE % s
zHTTPHeaderDict.itermergedc C s t | j� �S )N)r. rS )r r r r rT + s zHTTPHeaderDict.itemsc C sn g }x`|j D ]V}|jd�r@|d \}}||d |j� f|d< q |jdd�\}}|j||j� f� q W | |�S ) z4Read headers from a Python 2 httplib message object.� � r z
�:)rY rZ ���r\ )r7 �
startswith�rstrip�splitrO �strip)�cls�messager7 �liner! r( r r r � from_httplib. s
zHTTPHeaderDict.from_httplib)N)%r r r r2 r r) r# r* r= rG rH r r r r �objectrK r+ r- r rM rP r6 rV Z
getheadersZgetallmatchingheadersZigetZget_allrW r5 rX rS rE rT � classmethodrd �
__classcell__r r )r9 r r e s<
N)Z
__future__r � collectionsr r Z threadingr � ImportErrorr Zpackages.ordered_dictZ packages.sixr r r �__all__re r$ r r r r r r �<module> s J pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.pyc 0000644 00000024121 14751155150 0017367 0 ustar 00 3
���e� � @ sL d dl mZ ddlmZ G dd� de�ZG dd� de�ZG dd � d e�Z G d
d � d e �Z
G d d
� d
e�Z G dd� de�Z G dd� de�Z
G dd� de�ZeZG dd� de
�ZG dd� de
�ZG dd� de�ZG dd� de�ZG d d � d ee
�ZG d d � d e�ZG d d!� d!ee �ZG d"d#� d#e �ZG d$d%� d%e �ZG d&d'� d'ee�ZG d(d)� d)e�ZG d*d+� d+e�Z G d,d-� d-e�Z G d.d/� d/e �Z G d0d1� d1e �Z G d2d3� d3e �Z G d4d5� d5e �Z!G d6d7� d7e�Z"G d8d9� d9e�Z#G d:d;� d;ee�Z$G d<d=� d=e�Z%G d>d?� d?ee�ZG d@dA� dAe�Z&G dBdC� dCe'e�Z(G dDdE� dEe�Z)G dFdG� dGe�Z*dHS )I� )�absolute_import� )�IncompleteReadc @ s e Zd ZdZdS )� HTTPErrorz#Base exception used by this module.N)�__name__�
__module__� __qualname__�__doc__� r
r
� /usr/lib/python3.6/exceptions.pyr s r c @ s e Zd ZdZdS )� HTTPWarningz!Base warning used by this module.N)r r r r r
r
r
r r
s r c @ s e Zd ZdZdd� Zdd� ZdS )� PoolErrorz/Base exception for errors caused within a pool.c C s || _ tj| d||f � d S )Nz%s: %s)�poolr �__init__)�selfr �messager
r
r r s zPoolError.__init__c C s
| j dfS )N)NN)� __class__)r r
r
r �
__reduce__ s zPoolError.__reduce__N)r r r r r r r
r
r
r r
s r
c @ s e Zd ZdZdd� Zdd� ZdS )� RequestErrorz8Base exception for PoolErrors that have associated URLs.c C s || _ tj| ||� d S )N)�urlr
r )r r r r r
r
r r s zRequestError.__init__c C s | j d | jd ffS )N)r r )r r
r
r r # s zRequestError.__reduce__N)r r r r r r r
r
r
r r s r c @ s e Zd ZdZdS )�SSLErrorz9Raised when SSL certificate fails in an HTTPS connection.N)r r r r r
r
r
r r ( s r c @ s e Zd ZdZdS )�
ProxyErrorz,Raised when the connection to a proxy fails.N)r r r r r
r
r
r r - s r c @ s e Zd ZdZdS )� DecodeErrorz;Raised when automatic decoding based on Content-Type fails.N)r r r r r
r
r
r r 2 s r c @ s e Zd ZdZdS )�
ProtocolErrorz>Raised when something unexpected happens mid-request/response.N)r r r r r
r
r
r r 7 s r c @ s e Zd ZdZddd�ZdS )�
MaxRetryErrora Raised when the maximum number of retries is exceeded.
:param pool: The connection pool
:type pool: :class:`~urllib3.connectionpool.HTTPConnectionPool`
:param string url: The requested Url
:param exceptions.Exception reason: The underlying error
Nc C s& || _ d||f }tj| |||� d S )Nz0Max retries exceeded with url: %s (Caused by %r))�reasonr r )r r r r r r
r
r r L s
zMaxRetryError.__init__)N)r r r r r r
r
r
r r B s r c @ s e Zd ZdZddd�ZdS )�HostChangedErrorz?Raised when an existing pool gets a request for a foreign host.� c C s" d| }t j| |||� || _d S )Nz)Tried to open a foreign host with url: %s)r r �retries)r r r r r r
r
r r X s zHostChangedError.__init__N)r )r r r r r r
r
r
r r U s r c @ s e Zd ZdZdS )�TimeoutStateErrorz3 Raised when passing an invalid state to a timeout N)r r r r r
r
r
r r ^ s r c @ s e Zd ZdZdS )� TimeoutErrorz� Raised when a socket timeout error occurs.
Catching this error will catch both :exc:`ReadTimeoutErrors
<ReadTimeoutError>` and :exc:`ConnectTimeoutErrors <ConnectTimeoutError>`.
N)r r r r r
r
r
r r c s r c @ s e Zd ZdZdS )�ReadTimeoutErrorzFRaised when a socket timeout occurs while receiving data from a serverN)r r r r r
r
r
r r! l s r! c @ s e Zd ZdZdS )�ConnectTimeoutErrorz@Raised when a socket timeout occurs while connecting to a serverN)r r r r r
r
r
r r" s s r" c @ s e Zd ZdZdS )�NewConnectionErrorzHRaised when we fail to establish a new connection. Usually ECONNREFUSED.N)r r r r r
r
r
r r# x s r# c @ s e Zd ZdZdS )�EmptyPoolErrorzCRaised when a pool runs out of connections and no more are allowed.N)r r r r r
r
r
r r$ } s r$ c @ s e Zd ZdZdS )�ClosedPoolErrorzCRaised when a request enters a pool after the pool has been closed.N)r r r r r
r
r
r r% � s r% c @ s e Zd ZdZdS )�LocationValueErrorz<Raised when there is something wrong with a given URL input.N)r r r r r
r
r
r r& � s r& c @ s e Zd ZdZdd� ZdS )�LocationParseErrorz=Raised when get_host or similar fails to parse the URL input.c C s d| }t j| |� || _d S )NzFailed to parse: %s)r r �location)r r( r r
r
r r � s zLocationParseError.__init__N)r r r r r r
r
r
r r' � s r' c @ s e Zd ZdZdZdZdS )�
ResponseErrorzDUsed as a container for an error reason supplied in a MaxRetryError.ztoo many error responsesz&too many {status_code} error responsesN)r r r r Z
GENERIC_ERRORZSPECIFIC_ERRORr
r
r
r r) � s r) c @ s e Zd ZdZdS )�SecurityWarningz/Warned when perfoming security reducing actionsN)r r r r r
r
r
r r* � s r* c @ s e Zd ZdZdS )�SubjectAltNameWarningzBWarned when connecting to a host with a certificate missing a SAN.N)r r r r r
r
r
r r+ � s r+ c @ s e Zd ZdZdS )�InsecureRequestWarningz/Warned when making an unverified HTTPS request.N)r r r r r
r
r
r r, � s r, c @ s e Zd ZdZdS )�SystemTimeWarningz0Warned when system time is suspected to be wrongN)r r r r r
r
r
r r- � s r- c @ s e Zd ZdZdS )�InsecurePlatformWarningzEWarned when certain SSL configuration is not available on a platform.N)r r r r r
r
r
r r. � s r. c @ s e Zd ZdZdS )�SNIMissingWarningz9Warned when making a HTTPS request without SNI available.N)r r r r r
r
r
r r/ � s r/ c @ s e Zd ZdZdS )�DependencyWarningzc
Warned when an attempt is made to import a module with missing optional
dependencies.
N)r r r r r
r
r
r r0 � s r0 c @ s e Zd ZdZdS )�ResponseNotChunkedz;Response needs to be chunked in order to read it as chunks.N)r r r r r
r
r
r r1 � s r1 c @ s e Zd ZdZdS )�BodyNotHttplibCompatiblezz
Body should be httplib.HTTPResponse like (have an fp attribute which
returns raw chunks) for read_chunked().
N)r r r r r
r
r
r r2 � s r2 c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r z�
Response length doesn't match expected Content-Length
Subclass of http_client.IncompleteRead to allow int value
for `partial` to avoid creating large objects on streamed
reads.
c s t t| �j||� d S )N)�superr r )r �partial�expected)r r
r r � s zIncompleteRead.__init__c C s d| j | jf S )Nz/IncompleteRead(%i bytes read, %i more expected))r4 r5 )r r
r
r �__repr__� s zIncompleteRead.__repr__)r r r r r r6 �
__classcell__r
r
)r r r � s r c @ s e Zd ZdZdS )�
InvalidHeaderz(The header provided was somehow invalid.N)r r r r r
r
r
r r8 � s r8 c s e Zd ZdZ� fdd�Z� ZS )�ProxySchemeUnknownz1ProxyManager does not support the supplied schemec s d| }t t| �j|� d S )Nz Not supported proxy scheme %s)r3 r9 r )r �schemer )r r
r r � s zProxySchemeUnknown.__init__)r r r r r r7 r
r
)r r r9 � s r9 c s e Zd ZdZ� fdd�Z� ZS )�HeaderParsingErrorzNRaised by assert_header_parsing, but we convert it to a log.warning statement.c s$ d|pd|f }t t| �j|� d S )Nz%s, unparsed data: %rZUnknown)r3 r; r )r ZdefectsZ
unparsed_datar )r r
r r � s zHeaderParsingError.__init__)r r r r r r7 r
r
)r r r; � s r; c @ s e Zd ZdZdS )�UnrewindableBodyErrorz9urllib3 encountered an error when trying to rewind a bodyN)r r r r r
r
r
r r< � s r< N)+Z
__future__r Z packages.six.moves.http_clientr Zhttplib_IncompleteRead� Exceptionr �Warningr r
r r r r r �ConnectionErrorr r r r r! r" r# r$ r% �
ValueErrorr& r' r) r* r+ r, r- r. r/ r0 r1 r2 r8 �AssertionErrorr9 r; r< r
r
r
r �<module> sH
pip/_vendor/urllib3/__pycache__/filepost.cpython-36.pyc 0000644 00000005037 14751155150 0017040 0 ustar 00 3
���e � @ s� d dl mZ d dlZd dlmZ d dlmZ ddlmZ ddl m
Z
ddl m Z ej
d �d
Zd d � Zd
d� Zdd� Zddd�ZdS )� )�absolute_importN)�uuid4)�BytesIO� )�six)�b)� RequestFieldzutf-8� c C s t � jS )zN
Our embarrassingly-simple replacement for mimetools.choose_boundary.
)r �hex� r r � /usr/lib/python3.6/filepost.py�choose_boundary s r
c c sN t | t�rtj| �}nt| �}x*|D ]"}t |t�r:|V q$tj|� V q$W dS )z�
Iterate over fields.
Supports list of (k, v) tuples and dicts, and lists of
:class:`~urllib3.fields.RequestField`.
N)�
isinstance�dictr � iteritems�iterr Z from_tuples)�fields�i�fieldr r r �iter_field_objects s
r c C s, t | t�r dd� tj| �D �S dd� | D �S )a-
.. deprecated:: 1.6
Iterate over fields.
The addition of :class:`~urllib3.fields.RequestField` makes this function
obsolete. Instead, use :func:`iter_field_objects`, which returns
:class:`~urllib3.fields.RequestField` objects.
Supports list of (k, v) tuples and dicts.
c s s | ]\}}||fV qd S )Nr )�.0�k�vr r r � <genexpr>6 s z iter_fields.<locals>.<genexpr>c s s | ]\}}||fV qd S )Nr )r r r r r r r 8 s )r r r r )r r r r � iter_fields) s
r c C s� t � }|dkrt� }x|t| �D ]p}|jtd| �� t|�j|j� � |j}t|t �r^t
|�}t|t j �rzt|�j|� n
|j|� |jd� q W |jtd| �� t
d| �}|j
� |fS )aJ
Encode a dictionary of ``fields`` using the multipart/form-data MIME format.
:param fields:
Dictionary of fields or list of (key, :class:`~urllib3.fields.RequestField`).
:param boundary:
If not specified, then a random boundary will be generated using
:func:`mimetools.choose_boundary`.
Nz--%s
s
z--%s--
z multipart/form-data; boundary=%s)r r
r �writer �writerZrender_headers�datar �int�strr Z text_type�getvalue)r �boundaryZbodyr r Z content_typer r r �encode_multipart_formdata; s
r" )N)Z
__future__r �codecsZuuidr �ior Zpackagesr Z packages.sixr r r �lookupr r
r r r" r r r r �<module> s pip/_vendor/urllib3/__pycache__/response.cpython-36.opt-1.pyc 0000644 00000037433 14751155150 0020015 0 ustar 00 3
���ewY � @ s d dl mZ d dlmZ d dlZd dlZd dlZd dlmZ d dlm
Z ddl m
Z
ddlmZmZmZmZmZmZmZ dd lmZmZmZ dd
lm Z dd l m Z m Z dd l!m"Z"m#Z# ej$e%�Z&G d
d� de'�Z(G dd� de'�Z)dd� Z*G dd� dej+�Z,dS )� )�absolute_import)�contextmanagerN)�timeout)�error� )�HTTPHeaderDict)�BodyNotHttplibCompatible�
ProtocolError� DecodeError�ReadTimeoutError�ResponseNotChunked�IncompleteRead�
InvalidHeader)� string_types� binary_type�PY3)� http_client)�
HTTPException� BaseSSLError)� is_fp_closed�is_response_to_headc @ s$ e Zd Zdd� Zdd� Zdd� ZdS )�DeflateDecoderc C s d| _ t� | _tj� | _d S )NT)�
_first_tryr �_data�zlib�
decompressobj�_obj)�self� r � /usr/lib/python3.6/response.py�__init__ s zDeflateDecoder.__init__c C s t | j|�S )N)�getattrr )r �namer r r � __getattr__ s zDeflateDecoder.__getattr__c C s� |s|S | j s| jj|�S | j|7 _y | jj|�}|rFd| _ d | _|S tjk
r� d| _ tjtj �| _z | j| j�S d | _X Y nX d S )NF)r r �
decompressr r r r � MAX_WBITS)r �dataZ decompressedr r r r$ s" zDeflateDecoder.decompressN)�__name__�
__module__� __qualname__r r# r$ r r r r r s r c @ s$ e Zd Zdd� Zdd� Zdd� ZdS )� GzipDecoderc C s t jdt j �| _d S )N� )r r r% r )r r r r r 9 s zGzipDecoder.__init__c C s t | j|�S )N)r! r )r r" r r r r# < s zGzipDecoder.__getattr__c C s |s|S | j j|�S )N)r r$ )r r& r r r r$ ? s zGzipDecoder.decompressN)r' r( r) r r# r$ r r r r r* 7 s r* c C s | dkrt � S t� S )N�gzip)r* r )�moder r r � _get_decoderE s r. c @ s e Zd ZdZddgZdddddgZdFdd�Zdd� Zdd� Ze dd� �Z
e dd� �Z dd� Z dd� Z
d d � Zd d � Zd d!� Zed"d#� �ZdGd$d%�ZdId(d)�Zed*d+� �Zd,d-� ZdJd.d/�Zd0d1� Zd2d3� Ze d4d5� �Zd6d7� Z d8d9� Z d:d;� Z d<d=� Z d>d?� Z d@dA� Z!dBdC� Z"dKdDdE�Z#d
S )L� HTTPResponsea
HTTP Response container.
Backwards-compatible to httplib's HTTPResponse but the response ``body`` is
loaded and decoded on-demand when the ``data`` property is accessed. This
class is also compatible with the Python standard library's :mod:`io`
module, and can hence be treated as a readable object in the context of that
framework.
Extra parameters for behaviour not present in httplib.HTTPResponse:
:param preload_content:
If True, the response's body will be preloaded during construction.
:param decode_content:
If True, attempts to decode specific content-encoding's based on headers
(like 'gzip' and 'deflate') will be skipped and raw data will be used
instead.
:param original_response:
When this HTTPResponse wrapper is generated from an httplib.HTTPResponse
object, it's convenient to include the original for debug purposes. It's
otherwise unused.
:param retries:
The retries contains the last :class:`~urllib3.util.retry.Retry` that
was used during the request.
:param enforce_content_length:
Enforce content length checking. Body returned by server must match
value of Content-Length header, if present. Otherwise, raise error.
r, Zdeflatei- i. i/ i3 i4 � Nr TFc C s t |t�r|| _n
t|�| _|| _|| _|| _|| _|| _| | _|
| _ d | _
d | _ d | _ | | _
d| _|r|t |ttf�r||| _ |
| _| | _t|d�r�|| _ d| _d | _| jjdd�j� }dd� |jd�D �}d |kr�d
| _| j|�| _|r�| j r�| j|d �| _ d S ) Nr �readFztransfer-encodingr0 c s s | ]}|j � V qd S )N)�strip)�.0�encr r r � <genexpr>� s z(HTTPResponse.__init__.<locals>.<genexpr>�,�chunkedT)�decode_content) �
isinstancer �headers�status�version�reason�strictr8 �retries�enforce_content_length�_decoder�_body�_fp�_original_response�_fp_bytes_read�
basestringr �_pool� _connection�hasattrr7 �
chunk_left�get�lower�split� _init_length�length_remainingr1 )r �bodyr: r; r< r= r> Zpreload_contentr8 �original_responseZpool�
connectionr? r@ �request_methodZtr_encZ encodingsr r r r q s<
zHTTPResponse.__init__c C s | j | jkr| jjd�S dS )a
Should we redirect and where to?
:returns: Truthy redirect location string if we got a redirect status
code and valid location. ``None`` if redirect status and no
location. ``False`` if not a redirect status code.
�locationF)r; �REDIRECT_STATUSESr: rK )r r r r �get_redirect_location� s z"HTTPResponse.get_redirect_locationc C s, | j s| j rd S | j j| j� d | _d S )N)rG rH Z _put_conn)r r r r � release_conn� s zHTTPResponse.release_connc C s" | j r | j S | jr | jdd�S d S )NT)�
cache_content)rB rC r1 )r r r r r& � s zHTTPResponse.datac C s | j S )N)rH )r r r r rR � s zHTTPResponse.connectionc C s | j S )z�
Obtain the number of bytes pulled over the wire so far. May differ from
the amount of content returned by :meth:``HTTPResponse.read`` if bytes
are encoded on the wire (e.g, compressed).
)rE )r r r r �tell� s zHTTPResponse.tellc C s� | j jd�}|dk r(| jr(tjd� dS |dk r�y<tdd� |jd�D ��}t|�dkrbtd| ��|j � }W n t
k
r� d}Y nX |d k r�d}yt | j �}W n t
k
r� d }Y nX |dks�d | ko�d
k n s�|dkr�d }|S )zM
Set initial length value for Response content if available.
zcontent-lengthNz�Received response with both Content-Length and Transfer-Encoding set. This is expressly forbidden by RFC 7230 sec 3.3.2. Ignoring Content-Length and attempting to process response as Transfer-Encoding: chunked.c S s g | ] }t |��qS r )�int)r3 �valr r r �
<listcomp>� s z-HTTPResponse._init_length.<locals>.<listcomp>r6 r z8Content-Length contained multiple unmatching values (%s)r �� �0 �d �� ZHEAD)r] r^ )
r: rK r7 �logZwarning�setrM �lenr �pop�
ValueErrorrZ r; )r rS ZlengthZlengthsr; r r r rN � s,
(zHTTPResponse._init_lengthc C s4 | j jdd�j� }| jdkr0|| jkr0t|�| _dS )z=
Set-up the _decoder attribute if necessary.
zcontent-encodingr0 N)r: rK rL rA �CONTENT_DECODERSr. )r �content_encodingr r r �
_init_decoder� s zHTTPResponse._init_decoderc C s| y|r| j r| j j|�}W nH ttjfk
rb } z&| jjdd�j� }td| |��W Y dd}~X nX |rx|rx|| j � 7 }|S )zN
Decode the data passed in and potentially flush the decoder.
zcontent-encodingr0 zEReceived response with content-encoding: %s, but failed to decode it.N)
rA r$ �IOErrorr r r: rK rL r
�_flush_decoder)r r& r8 �
flush_decoder�erg r r r �_decode s
zHTTPResponse._decodec C s$ | j r | j jd�}|| j j� S dS )zk
Flushes the decoder. Should only be called if the decoder is actually
being used.
� )rA r$ �flush)r Zbufr r r rj s zHTTPResponse._flush_decoderc c s� d}z�y
dV W n� t k
r2 t| jdd��Y np tk
rn } z"dt|�krP� t| jdd��W Y dd}~X n4 ttfk
r� } ztd| |��W Y dd}~X nX d}W d|s�| jr�| jj � | j
r�| j
j � | jr�| jj � r�| j � X dS )z�
Catch low-level python exceptions, instead re-raising urllib3
variants, so that low-level exceptions are not leaked in the
high-level api.
On exit, release the connection back to the pool.
FNzRead timed out.zread operation timed outzConnection broken: %rT)
�
SocketTimeoutr rG r �strr � SocketErrorr rD �closerH �isclosedrW )r Z
clean_exitrl r r r �_error_catcher! s(
zHTTPResponse._error_catcherc C s� | j � |dkr| j}| jdkr$dS d}d}| j� �h |dkrN| jj� }d}nJd}| jj|�}|dkr�| r�| jj� d}| jr�| jdkr�t| j | j��W dQ R X |r�| j t
|�7 _ | jdk r�| jt
|�8 _| j |||�}|r�|| _ |S )aP
Similar to :meth:`httplib.HTTPResponse.read`, but with two additional
parameters: ``decode_content`` and ``cache_content``.
:param amt:
How much of the content to read. If specified, caching is skipped
because it doesn't make sense to cache partial content as the full
response.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
:param cache_content:
If True, will save the returned data such that the same result is
returned despite of the state of the underlying file object. This
is useful if you want the ``.data`` property to continue working
after having ``.read()`` the file object. (Overridden if ``amt`` is
set.)
NFTr )r N)
rh r8 rC ru r1 rs r@ rO r
rE rc rm rB )r �amtr8 rX rk r& r r r r1 Z s4
zHTTPResponse.read� r+ c c sZ | j r.| j� r.xF| j||d�D ]
}|V q W n(x&t| j�sT| j||d�}|r0|V q0W dS )a_
A generator wrapper for the read() method. A call will block until
``amt`` bytes have been read from the connection or until the
connection is closed.
:param amt:
How much of the content to read. The generator will return up to
much data per iteration, but may return less. This is particularly
likely when using compressed data. However, the empty string will
never be returned.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
)r8 )rv r8 N)r7 �supports_chunked_reads� read_chunkedr rC r1 )r rv r8 �liner& r r r �stream� s zHTTPResponse.streamc
K s` |j }t|t�s,tr"t|j� �}n
tj|�}t|dd�}| f |||j|j|j ||d�|��}|S )a
Given an :class:`httplib.HTTPResponse` instance ``r``, return a
corresponding :class:`urllib3.response.HTTPResponse` object.
Remaining parameters are passed to the HTTPResponse constructor, along
with ``original_response=r``.
r> r )rP r: r; r< r= r> rQ )
�msgr9 r r �items� from_httplibr! r; r< r= )Z ResponseCls�rZ response_kwr: r> Zrespr r r r~ � s
zHTTPResponse.from_httplibc C s | j S )N)r: )r r r r �
getheaders� s zHTTPResponse.getheadersc C s | j j||�S )N)r: rK )r r" �defaultr r r � getheader� s zHTTPResponse.getheaderc C s | j S )N)r: )r r r r �info� s zHTTPResponse.infoc C s$ | j s| jj� | jr | jj� d S )N)�closedrC rs rH )r r r r rs � s
zHTTPResponse.closec C s@ | j d krdS t| j d�r$| j j� S t| j d�r8| j jS dS d S )NTrt r� )rC rI rt r� )r r r r r� � s
zHTTPResponse.closedc C s6 | j d krtd��n t| j d�r*| j j� S td��d S )Nz-HTTPResponse has no file to get a fileno from�filenozOThe file-like object this HTTPResponse is wrapped around has no file descriptor)rC ri rI r� )r r r r r� � s
zHTTPResponse.filenoc C s$ | j d k r t| j d�r | j j� S d S )Nro )rC rI ro )r r r r ro � s zHTTPResponse.flushc C s dS )NTr )r r r r �readable s zHTTPResponse.readablec C s: | j t|��}t|�dkr dS ||d t|��< t|�S d S )Nr )r1 rc )r �bZtempr r r �readinto s
zHTTPResponse.readintoc C s t | jd�S )z�
Checks if the underlying file-like object looks like a
httplib.HTTPResponse object. We do this by testing for the fp
attribute. If it is present we assume it returns raw chunks as
processed by read_chunked().
�fp)rI rC )r r r r rx s z#HTTPResponse.supports_chunked_readsc C sf | j d k rd S | jjj� }|jdd�d }yt|d�| _ W n& tk
r` | j� tj |��Y nX d S )N� ;r r r+ )
rJ rC r� �readlinerM rZ re rs �httplibr
)r rz r r r �_update_chunk_length s
z!HTTPResponse._update_chunk_lengthc C s� d }|d kr2| j j| j�}|}| j jd� d | _nv|| jk rZ| j j|�}| j| | _|}nN|| jkr�| j j|�}| j jd� d | _|}n | j j| j�}| j jd� d | _|S )Nrw )rC Z
_safe_readrJ )r rv Zreturned_chunk�chunk�valuer r r �
_handle_chunk% s&
zHTTPResponse._handle_chunkc c s� | j � | jstd��| j� s&td��| jrDt| j�rD| jj� dS | j� �� x<| j � | j
dkrdP | j |�}| j ||dd�}|rP|V qPW |r�| j
� }|r�|V x | jjj� }|s�P |dkr�P q�W | jr�| jj� W dQ R X dS )z�
Similar to :meth:`HTTPResponse.read`, but with an additional
parameter: ``decode_content``.
:param decode_content:
If True, will attempt to decode the body based on the
'content-encoding' header.
zHResponse is not chunked. Header 'transfer-encoding: chunked' is missing.zgBody should be httplib.HTTPResponse like. It should have have an fp attribute which returns raw chunks.Nr F)r8 rk s
)rh r7 r rx r rD r rs ru r� rJ r� rm rj rC r� r� )r rv r8 r� Zdecodedrz r r r ry ; s@
zHTTPResponse.read_chunked)r0 Nr r Nr TTNNNNFN)NNF� )r� N)N)NN)$r' r( r) �__doc__rf rU r rV rW �propertyr& rR rY rN rh rm rj r ru r1 r{ � classmethodr~ r� r� r� rs r� r� ro r� r� rx r� r� ry r r r r r/ L sB
-
0
9
E
r/ )-Z
__future__r �
contextlibr r �ioZloggingZsocketr rp r rr � _collectionsr �
exceptionsr r r
r r r
r Z packages.sixr rF r r Zpackages.six.movesr r� rR r r Z
util.responser r Z getLoggerr' ra �objectr r* r. �IOBaser/ r r r r �<module> s" $
! pip/_vendor/urllib3/__pycache__/filepost.cpython-36.opt-1.pyc 0000644 00000005037 14751155150 0017777 0 ustar 00 3
���e � @ s� d dl mZ d dlZd dlmZ d dlmZ ddlmZ ddl m
Z
ddl m Z ej
d �d
Zd d � Zd
d� Zdd� Zddd�ZdS )� )�absolute_importN)�uuid4)�BytesIO� )�six)�b)� RequestFieldzutf-8� c C s t � jS )zN
Our embarrassingly-simple replacement for mimetools.choose_boundary.
)r �hex� r r � /usr/lib/python3.6/filepost.py�choose_boundary s r
c c sN t | t�rtj| �}nt| �}x*|D ]"}t |t�r:|V q$tj|� V q$W dS )z�
Iterate over fields.
Supports list of (k, v) tuples and dicts, and lists of
:class:`~urllib3.fields.RequestField`.
N)�
isinstance�dictr � iteritems�iterr Z from_tuples)�fields�i�fieldr r r �iter_field_objects s
r c C s, t | t�r dd� tj| �D �S dd� | D �S )a-
.. deprecated:: 1.6
Iterate over fields.
The addition of :class:`~urllib3.fields.RequestField` makes this function
obsolete. Instead, use :func:`iter_field_objects`, which returns
:class:`~urllib3.fields.RequestField` objects.
Supports list of (k, v) tuples and dicts.
c s s | ]\}}||fV qd S )Nr )�.0�k�vr r r � <genexpr>6 s z iter_fields.<locals>.<genexpr>c s s | ]\}}||fV qd S )Nr )r r r r r r r 8 s )r r r r )r r r r � iter_fields) s
r c C s� t � }|dkrt� }x|t| �D ]p}|jtd| �� t|�j|j� � |j}t|t �r^t
|�}t|t j �rzt|�j|� n
|j|� |jd� q W |jtd| �� t
d| �}|j
� |fS )aJ
Encode a dictionary of ``fields`` using the multipart/form-data MIME format.
:param fields:
Dictionary of fields or list of (key, :class:`~urllib3.fields.RequestField`).
:param boundary:
If not specified, then a random boundary will be generated using
:func:`mimetools.choose_boundary`.
Nz--%s
s
z--%s--
z multipart/form-data; boundary=%s)r r
r �writer �writerZrender_headers�datar �int�strr Z text_type�getvalue)r �boundaryZbodyr r Z content_typer r r �encode_multipart_formdata; s
r" )N)Z
__future__r �codecsZuuidr �ior Zpackagesr Z packages.sixr r r �lookupr r
r r r" r r r r �<module> s pip/_vendor/urllib3/__pycache__/__init__.cpython-36.pyc 0000644 00000004576 14751155150 0016761 0 ustar 00 3
���e% � @ s` d Z ddlmZ ddlZddlmZmZmZ ddlm Z ddl
m Z ddl m
Z
mZmZ dd lmZ dd
lmZ dd lmZ dd lmZ dd
lmZ ddlZyddlmZ W n& e k
r� G dd� dej �ZY nX dZ dZ dZ d(Z!ej"e#�j$e� � ej%fd"d�Z&[ej'd#e j(d$d%� ej'd&e j)d$d%� ej'd&e j*d$d%� ej'd&e j+d$d%� e j,fd'd �Z-dS ))z8
urllib3 - Thread-safe connection pooling and re-using.
� )�absolute_importN� )�HTTPConnectionPool�HTTPSConnectionPool�connection_from_url)�
exceptions)�encode_multipart_formdata)� PoolManager� ProxyManager�proxy_from_url)� HTTPResponse)� make_headers)�get_host)�Timeout)�Retry)� NullHandlerc @ s e Zd Zdd� ZdS )r c C s d S )N� )�self�recordr r � /usr/lib/python3.6/__init__.py�emit s zNullHandler.emitN)�__name__�
__module__� __qualname__r r r r r r s r z(Andrey Petrov (andrey.petrov@shazow.net)ZMITz1.22r r r r
r r r �add_stderr_loggerr �disable_warningsr r r
r c C sF t jt�}t j� }|jt jd�� |j|� |j| � |jdt� |S )z�
Helper for quickly adding a StreamHandler to the logger. Useful for
debugging.
Returns the handler after adding it.
z%%(asctime)s %(levelname)s %(message)sz,Added a stderr logging handler to logger: %s) �logging� getLoggerr Z
StreamHandlerZ setFormatterZ Formatter�
addHandlerZsetLevel�debug)�levelZloggerZhandlerr r r r 9 s
�alwaysT)�append�defaultc C s t jd| � dS )z<
Helper for quickly disabling all urllib3 warnings.
�ignoreN)�warnings� simplefilter)�categoryr r r r ] s )r r r r
r r r r r r r r r
r ).�__doc__Z
__future__r r% Zconnectionpoolr r r � r Zfilepostr Z poolmanagerr r
r Zresponser Z util.requestr
Zutil.urlr Z util.timeoutr Z
util.retryr r r � ImportErrorZHandler�
__author__Z __license__� __version__�__all__r r r �DEBUGr r& ZSecurityWarningZSubjectAltNameWarningZInsecurePlatformWarningZSNIMissingWarningZ HTTPWarningr r r r r �<module> sT
pip/_vendor/urllib3/__pycache__/connection.cpython-36.opt-1.pyc 0000644 00000021073 14751155150 0020307 0 ustar 00 3
���e�2 � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlZd dlmZm Z
d dl Z ddl m
Z
ddlmZ ddlmZ yd dlZejZW n, eefk
r� dZG dd � d e�ZY nX yeZW n$ ek
r� G d
d � d e�ZY nX dd lm Z m Z m Z m Z dd
l m!Z!m"Z" ddl#m$Z$m%Z%m&Z&m'Z'm(Z( ddl)m*Z* ddl+m,Z, ej-e.�Z/ddd�Z0ej1ddd�Z2G dd� de3�Z4G dd� dee3�ZG dd� de�Z5G dd � d e5�Z6d d � Z7e�r�e5Z8e6Z5ne4Z5dS ) � )�absolute_importN)�error�timeout� )�six)�HTTPConnection)�
HTTPExceptionc @ s e Zd ZdS )� BaseSSLErrorN)�__name__�
__module__� __qualname__� r
r
� /usr/lib/python3.6/connection.pyr s r c @ s e Zd ZdS )�ConnectionErrorN)r
r r r
r
r
r r s r )�NewConnectionError�ConnectTimeoutError�SubjectAltNameWarning�SystemTimeWarning)�match_hostname�CertificateError)�resolve_cert_reqs�resolve_ssl_version�assert_fingerprint�create_urllib3_context�ssl_wrap_socket)�
connection)�HTTPHeaderDict�P i� )�http�httpsi� c @ s e Zd ZdZdS )�DummyConnectionz-Used to detect a failed ConnectionCls import.N)r
r r �__doc__r
r
r
r r A s r c @ sV e Zd ZdZed ZejejdfgZ dZ
dd� Z dd� Z d d
� Z
d d � Zddd�Zd
S )r a{
Based on httplib.HTTPConnection but provides an extra constructor
backwards-compatibility layer between older and newer Pythons.
Additional keyword parameters are used to configure attributes of the connection.
Accepted parameters include:
- ``strict``: See the documentation on :class:`urllib3.connectionpool.HTTPConnectionPool`
- ``source_address``: Set the source address for the current connection.
.. note:: This is ignored for Python 2.6. It is only applied for 2.7 and 3.x
- ``socket_options``: Set specific options on the underlying socket. If not specified, then
defaults are loaded from ``HTTPConnection.default_socket_options`` which includes disabling
Nagle's algorithm (sets TCP_NODELAY to 1) unless the connection is behind a proxy.
For example, if you wish to enable TCP Keep Alive in addition to the defaults,
you might pass::
HTTPConnection.default_socket_options + [
(socket.SOL_SOCKET, socket.SO_KEEPALIVE, 1),
]
Or you may want to disable the defaults by passing an empty list (e.g., ``[]``).
r r Fc O sZ t jr|jdd � |jd�| _tjdk r4|jdd � |jd| j�| _t j
| f|�|� d S )N�strict�source_address� � �socket_options)r$ r% ) r ZPY3�pop�getr# �sys� version_info�default_socket_optionsr& �_HTTPConnection�__init__)�self�args�kwr
r
r r- j s
zHTTPConnection.__init__c C s� i }| j r| j |d< | jr$| j|d< y tj| j| jf| jf|�}W nf tk
rz } z t| d| j| jf ��W Y dd}~X n0 t k
r� } zt
| d| ��W Y dd}~X nX |S )zp Establish a socket connection and set nodelay settings on it.
:return: New socket connection.
r# r& z0Connection to %s timed out. (connect timeout=%s)Nz(Failed to establish a new connection: %s) r# r& r Zcreate_connection�host�portr �
SocketTimeoutr � SocketErrorr )r. Zextra_kw�conn�er
r
r � _new_conn s
zHTTPConnection._new_connc C s$ || _ t| dd �r | j� d| _d S )N� _tunnel_hostr )�sock�getattr�_tunnel� auto_open)r. r5 r
r
r �
_prepare_conn� s z HTTPConnection._prepare_connc C s | j � }| j|� d S )N)r7 r= )r. r5 r
r
r �connect� s zHTTPConnection.connectNc C s t |dk r|ni �}d|k}d|k}| j||||d� x |j� D ]\}}| j||� q@W d|krl| jdd� | j� |dk �rtjtjf } t|| �r�|f}xj|D ]b}
|
s�q�t|
tj�s�|
j d�}
t
t |
��d d� } | j | j d
�� | j d � | j |
� | j d � q�W | j d � dS )
z�
Alternative to the common request method, which sends the
body with chunked encoding and not as one block
Nzaccept-encodingr1 )�skip_accept_encoding� skip_hostztransfer-encodingzTransfer-EncodingZchunked�utf8r$ zutf-8s
s 0
)
r Z
putrequest�itemsZ putheaderZ
endheadersr Z string_typesZ binary_type�
isinstance�encode�hex�len�send) r. �methodZurlZbodyZheadersr? r@ �header�valueZstringish_types�chunkZlen_strr
r
r �request_chunked� s8
z HTTPConnection.request_chunked)NN)r
r r r! �port_by_scheme� default_port�socketZ IPPROTO_TCPZ TCP_NODELAYr+ � is_verifiedr- r7 r= r> rL r
r
r
r r F s r c @ s8 e Zd Zed ZdZddddejdfdd�Zdd� Z dS )�HTTPSConnectionr Nc K s8 t j| ||f||d�|�� || _|| _|| _d| _d S )N)r" r r )r r- �key_file� cert_file� ssl_contextZ _protocol) r. r1 r2 rR rS r" r rT r0 r
r
r r- � s zHTTPSConnection.__init__c C sN | j � }| j|� | jd kr2ttd �td �d�| _t|| j| j| jd�| _ d S )N)� ssl_version� cert_reqs)r9 �keyfile�certfilerT )
r7 r= rT r r r r rR rS r9 )r. r5 r
r
r r> � s
zHTTPSConnection.connect)
r
r r rM rN rU rO Z_GLOBAL_DEFAULT_TIMEOUTr- r> r
r
r
r rQ � s
rQ c @ s6 e Zd ZdZdZdZdZdZdZddd�Z dd� Z
dS )�VerifiedHTTPSConnectionz[
Based on httplib.HTTPSConnection but wraps the socket with
SSL certification.
Nc C sn |dkr(|s|rd}n| j dk r(| j j}|| _|| _|| _|| _|| _|oTtjj |�| _
|oftjj |�| _ dS )zX
This method should only be called once, before the connection is used.
N�
CERT_REQUIRED) rT � verify_moderR rS rV �assert_hostnamer �os�path�
expanduser�ca_certs� ca_cert_dir)r. rR rS rV r` r\ r ra r
r
r �set_cert s
z VerifiedHTTPSConnection.set_certc C sL | j � }| j}t| dd �r4|| _| j� d| _| j}tjj � t
k }|rXt j dj
t
�t� | jd kr|tt| j�t| j�d�| _| j}t| j�|_t|| j| j| j| j||d�| _| jr�t| jj dd�| j� nb|jt j ko�t|dd � o�| j d k �r.| jj � }|j d
f ��s t j d j
|�t!� t"|| j �p*|� |jt j#k�pD| jd k | _$d S ) Nr8 r zWSystem time is way off (before {0}). This will probably lead to SSL verification errors)rU rV )r9 rW rX r` ra Zserver_hostnamerT T)Z binary_formZcheck_hostnameFZsubjectAltNamez�Certificate for {0} has no `subjectAltName`, falling back to check for a `commonName` for now. This feature is being removed by major browsers and deprecated by RFC 2818. (See https://github.com/shazow/urllib3/issues/497 for details.))%r7 r1 r: r9 r; r< r8 �datetime�dateZtoday� RECENT_DATE�warnings�warn�formatr rT r r rU r rV r[ r rR rS r` ra r Z getpeercert�sslZ CERT_NONEr\ r( r �_match_hostnamerZ rP )r. r5 ZhostnameZ is_time_off�context�certr
r
r r> sT
z VerifiedHTTPSConnection.connect)NNNNNNN) r
r r r! rV r` ra rU r rb r> r
r
r
r rY � s
rY c C sL yt | |� W n8 tk
rF } z tjd|| � | |_� W Y d d }~X nX d S )Nz@Certificate did not match expected hostname: %s. Certificate: %s)r r �logr Z
_peer_cert)rl Zasserted_hostnamer6 r
r
r rj b s rj )9Z
__future__r rc Zloggingr] r) rO r r4 r r3 rf Zpackagesr Z packages.six.moves.http_clientr r, r ri ZSSLErrorr � ImportError�AttributeError�
BaseExceptionr � NameError� Exception�
exceptionsr r r r Zpackages.ssl_match_hostnamer r Z util.ssl_r r r r r �utilr � _collectionsr Z getLoggerr
rm rM rd re �objectr rQ rY rj ZUnverifiedHTTPSConnectionr
r
r
r �<module> sN
&l pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.pyc 0000644 00000056152 14751155150 0020250 0 ustar 00 3
���e � � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlmZm Z
d dlZddl m Z m
Z
mZmZmZmZmZmZmZmZmZmZmZ ddlmZ ddlm Z ddl m Z dd l m Z m!Z!m"Z"m#Z#m$Z$m%Z%m&Z& dd
l'm(Z( dd l)m*Z* dd l+m,Z, dd
l-m.Z. ddl/m0Z0 ddl1m2Z2 ddl3m4Z4 ddl5m6Z6m7Z7 e j8�r<d dl9Z:e j;j<Z<ej=e>�Z?e@� ZAG dd� de@�ZBeCejDejEg�ZFG dd� deBe(�ZGG dd� deG�ZHdd� ZIdd� ZJdS ) � )�absolute_importN)�error�timeout� )
�ClosedPoolError�
ProtocolError�EmptyPoolError�HeaderParsingError�HostChangedError�LocationValueError�
MaxRetryError�
ProxyError�ReadTimeoutError�SSLError� TimeoutError�InsecureRequestWarning�NewConnectionError)�CertificateError)�six)�queue)�port_by_scheme�DummyConnection�HTTPConnection�HTTPSConnection�VerifiedHTTPSConnection�
HTTPException� BaseSSLError)�RequestMethods)� HTTPResponse)�is_connection_dropped)�set_file_position)�assert_header_parsing)�Retry)�Timeout)�get_host�Urlc @ sD e Zd ZdZdZejZd
dd�Zdd� Z dd� Z
d d
� Z d d � Z dS )�ConnectionPoolzz
Base class for all connection pools, such as
:class:`.HTTPConnectionPool` and :class:`.HTTPSConnectionPool`.
Nc C s. |s t d��t|�j� | _|j� | _|| _d S )NzNo host specified.)r �
_ipv6_host�lower�host� _proxy_host�port)�selfr) r+ � r- �$/usr/lib/python3.6/connectionpool.py�__init__C s
zConnectionPool.__init__c C s dt | �j| j| jf S )Nz%s(host=%r, port=%r))�type�__name__r) r+ )r, r- r- r. �__str__K s
zConnectionPool.__str__c C s | S )Nr- )r, r- r- r. � __enter__O s zConnectionPool.__enter__c C s | j � dS )NF)�close)r, �exc_typeZexc_valZexc_tbr- r- r. �__exit__R s zConnectionPool.__exit__c C s dS )zD
Close all pooled connections and disable the pool.
Nr- )r, r- r- r. r4 W s zConnectionPool.close)N)
r1 �
__module__� __qualname__�__doc__�schemer Z LifoQueue�QueueClsr/ r2 r3 r6 r4 r- r- r- r. r& : s
r& c
@ s� e Zd ZdZdZeZeZdde j
ddddddf dd�Z dd � Z d!d
d �Z
d d
� Zdd� Zdd� Zdd� Zdd� Zedfdd�Zdd� Zdd� Zd d � Zdddd d eddddf
d d �ZdS )"�HTTPConnectionPoolaN
Thread-safe connection pool for one host.
:param host:
Host used for this HTTP Connection (e.g. "localhost"), passed into
:class:`httplib.HTTPConnection`.
:param port:
Port used for this HTTP Connection (None is equivalent to 80), passed
into :class:`httplib.HTTPConnection`.
:param strict:
Causes BadStatusLine to be raised if the status line can't be parsed
as a valid HTTP/1.0 or 1.1 status line, passed into
:class:`httplib.HTTPConnection`.
.. note::
Only works in Python 2. This parameter is ignored in Python 3.
:param timeout:
Socket timeout in seconds for each individual connection. This can
be a float or integer, which sets the timeout for the HTTP request,
or an instance of :class:`urllib3.util.Timeout` which gives you more
fine-grained control over request timeouts. After the constructor has
been parsed, this is always a `urllib3.util.Timeout` object.
:param maxsize:
Number of connections to save that can be reused. More than 1 is useful
in multithreaded situations. If ``block`` is set to False, more
connections will be created but they will not be saved once they've
been used.
:param block:
If set to True, no more than ``maxsize`` connections will be used at
a time. When no free connections are available, the call will block
until a connection has been released. This is a useful side effect for
particular multithreaded situations where one does not want to use more
than maxsize connections per host to prevent flooding.
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
:param retries:
Retry configuration to use by default with requests in this pool.
:param _proxy:
Parsed proxy URL, should not be used directly, instead, see
:class:`urllib3.connectionpool.ProxyManager`"
:param _proxy_headers:
A dictionary with proxy headers, should not be used directly,
instead, see :class:`urllib3.connectionpool.ProxyManager`"
:param \**conn_kw:
Additional parameters are used to create fresh :class:`urllib3.connection.HTTPConnection`,
:class:`urllib3.connection.HTTPSConnection` instances.
�httpNFr c
K s� t j| ||� tj| |� || _t|t�s4tj|�}|d krBtj}|| _ || _
| j |�| _ || _
| | _|
pli | _x t|�D ]} | j jd � qzW d| _d| _| | _| jr�| jjdg � d S )Nr Zsocket_options)r& r/ r �strict�
isinstancer# �
from_floatr" ZDEFAULTr �retriesr; �pool�block�proxy�
proxy_headers�xrange�put�num_connections� num_requests�conn_kw�
setdefault)
r, r) r+ r> r �maxsizerC �headersrA �_proxy�_proxy_headersrJ �_r- r- r. r/ � s(
zHTTPConnectionPool.__init__c C sJ | j d7 _ tjd| j | j� | jf | j| j| jj| jd�| j ��}|S )z9
Return a fresh :class:`HTTPConnection`.
r z%Starting new HTTP connection (%d): %s)r) r+ r r> )
rH �log�debugr) �
ConnectionClsr+ r �connect_timeoutr> rJ )r, �connr- r- r. � _new_conn� s z HTTPConnectionPool._new_connc C s� d}y| j j| j|d�}W nB tk
r8 t| d��Y n& tjk
r\ | jrXt| d��Y nX |r�t|�r�t j
d| j � |j � t
|dd�dkr�d}|p�| j� S ) a�
Get a connection. Will return a pooled connection if one is available.
If no connections are available and :prop:`.block` is ``False``, then a
fresh connection is returned.
:param timeout:
Seconds to wait before giving up and raising
:class:`urllib3.exceptions.EmptyPoolError` if the pool is empty and
:prop:`.block` is ``True``.
N)rC r zPool is closed.z>Pool reached maximum size and no more connections are allowed.z Resetting dropped connection: %sZ auto_openr r )rB �getrC �AttributeErrorr r �Emptyr r rQ rR r) r4 �getattrrV )r, r rU r- r- r. � _get_conn� s z HTTPConnectionPool._get_connc C s\ y| j j|dd� dS tk
r( Y n$ tjk
rJ tjd| j� Y nX |rX|j� dS )a�
Put a connection back into the pool.
:param conn:
Connection object for the current host and port as returned by
:meth:`._new_conn` or :meth:`._get_conn`.
If the pool is already full, the connection is closed and discarded
because we exceeded maxsize. If connections are discarded frequently,
then maxsize should be increased.
If the pool is closed, then the connection will be closed and discarded.
F)rC Nz2Connection pool is full, discarding connection: %s) rB rG rX r ZFullrQ �warningr) r4 )r, rU r- r- r. � _put_conn� s z HTTPConnectionPool._put_connc C s dS )zU
Called right before a request is made, after the socket is created.
Nr- )r, rU r- r- r. �_validate_conn s z!HTTPConnectionPool._validate_connc C s d S )Nr- )r, rU r- r- r. �_prepare_proxy! s z!HTTPConnectionPool._prepare_proxyc C s2 |t kr| jj� S t|t�r$|j� S tj|�S dS )z< Helper that always returns a :class:`urllib3.util.Timeout` N)�_Defaultr Zcloner? r# r@ )r, r r- r- r. � _get_timeout% s
z HTTPConnectionPool._get_timeoutc C sj t |t�rt| |d| ��t|d�r>|jtkr>t| |d| ��dt|�ksVdt|�krft| |d| ��dS )zAIs the error actually a timeout? Will raise a ReadTimeout or passz!Read timed out. (read timeout=%s)�errnoz timed outzdid not complete (read)N)r? �
SocketTimeoutr �hasattrrb �_blocking_errnos�str)r, �err�url�
timeout_valuer- r- r. �_raise_timeout1 s
z!HTTPConnectionPool._raise_timeoutc
: K s | j d7 _ | j|�}|j� |j|_y| j|� W n: ttfk
rp } z| j|||jd� � W Y dd}~X nX |r�|j ||f|� n|j
||f|� |j } t |dd�r�| dkr�t
| |d| ��| tjkr�|jjtj� � n |jj| � yjy|jdd�}
W nT tk
�rP y |j� }
W n0 tk
�rJ } ztj|d� W Y dd}~X nX Y nX W n< tttfk
�r� } z| j||| d� � W Y dd}~X nX t |d d
�} tjd | j | j | j ||| |
j |
j � yt!|
j"� W n@ t#tfk
�r } z tj$d | j%|�| dd
� W Y dd} ~ X nX |
S )a
Perform a request on a given urllib connection object taken from our
pool.
:param conn:
a connection from one of our connection pools
:param timeout:
Socket timeout in seconds for the request. This can be a
float or integer, which will set the same timeout value for
the socket connect and the socket read, or an instance of
:class:`urllib3.util.Timeout`, which gives you more fine-grained
control over your timeouts.
r )rg rh ri N�sockr z!Read timed out. (read timeout=%s)T)� bufferingZ
_http_vsn_strzHTTP/?z%s://%s:%s "%s %s %s" %s %sz$Failed to parse headers (url=%s): %s)�exc_info)&rI ra Z
start_connectrT r r^ rc r rj Zrequest_chunked�request� read_timeoutrZ r r# �DEFAULT_TIMEOUTrk Z
settimeout�socketZgetdefaulttimeoutZ getresponse� TypeError� Exceptionr Z
raise_from� SocketErrorrQ rR r: r) r+ �statusZlengthr! �msgr r\ �
_absolute_url)
r, rU �methodrh r �chunkedZhttplib_request_kw� timeout_obj�ero �httplib_responseZ http_versionZhper- r- r. �
_make_requestB sT
(
$z HTTPConnectionPool._make_requestc C s t | j| j| j|d�jS )N)r: r) r+ �path)r% r: r) r+ rh )r, r~ r- r- r. rw � s z HTTPConnectionPool._absolute_urlc C sL | j d }| _ y"x |jdd�}|r|j� qW W n tjk
rF Y nX dS )zD
Close all pooled connections and disable the pool.
NF)rC )rB rW r4 r rY )r, Zold_poolrU r- r- r. r4 � s zHTTPConnectionPool.closec C st |j d�rdS t|�\}}}t|�j� }| jr@| r@tj|�}n| j rZ|tj|�krZd}|||f| j| j| jfkS )zj
Check if the given ``url`` is a member of the same host as this
connection pool.
�/TN) �
startswithr$ r' r( r+ r rW r: r) )r, rh r: r) r+ r- r- r. � is_same_host� s
z HTTPConnectionPool.is_same_hostTc
. K s� |dkr| j }t|t�s*tj||| jd�}|
dkr>|
jdd�}
|rZ| j|� rZt| ||��d}|
}| jdkr�|j � }|j
| j � d}d}t || �} �zry�| j
|�}| j| d�}|j|_| jdk o�t|dd� }|r�| j|� | j||||||| d �}|
� s�|nd}||
d
< | jj|f| ||d �|
��}d}W n� tjk
�rN t| d ��Y n� ttt t t t t fk
�r } z�d}t|t t f��r�t |�}n>t|t t!f��r�| j�r�t"d
|�}nt|t tf��r�t d|�}|j#|||| t$j%� d d�}|j&� |}W Y dd}~X nX W d|�s |�o|j'� }d}|�r0| j(|� X |�spt)j*d|||� | j+|||||||f|| |
| d�|
��S dd� }|�o�|j,� }|�r$|j-dk�r�d}y|j#|||| d�}W n( t.k
�r� |j/�r�||� � |S X ||� |j0|� t)j1d||� | j+||||f||||| |
| d�|
��S t2|j3d��}|j4||j-|��r�y|j#|||| d�}W n( t.k
�r� |j5�r~||� � |S X ||� |j&|� t)j1d|� | j+||||f||||| |
| d�|
��S |S ) a�
Get a connection from the pool and perform an HTTP request. This is the
lowest level call for making a request, so you'll need to specify all
the raw details.
.. note::
More commonly, it's appropriate to use a convenience method provided
by :class:`.RequestMethods`, such as :meth:`request`.
.. note::
`release_conn` will only behave as expected if
`preload_content=False` because we want to make
`preload_content=False` the default behaviour someday soon without
breaking backwards compatibility.
:param method:
HTTP request method (such as GET, POST, PUT, etc.)
:param body:
Data to send in the request body (useful for creating
POST requests, see HTTPConnectionPool.post_url for
more convenience).
:param headers:
Dictionary of custom headers to send, such as User-Agent,
If-None-Match, etc. If None, pool headers are used. If provided,
these headers completely replace any pool-specific headers.
:param retries:
Configure the number of retries to allow before raising a
:class:`~urllib3.exceptions.MaxRetryError` exception.
Pass ``None`` to retry until you receive a response. Pass a
:class:`~urllib3.util.retry.Retry` object for fine-grained control
over different types of retries.
Pass an integer number to retry connection errors that many times,
but no other types of errors. Pass zero to never retry.
If ``False``, then retries are disabled and any exception is raised
immediately. Also, instead of raising a MaxRetryError on redirects,
the redirect response will be returned.
:type retries: :class:`~urllib3.util.retry.Retry`, False, or an int.
:param redirect:
If True, automatically handle redirects (status codes 301, 302,
303, 307, 308). Each redirect counts as a retry. Disabling retries
will disable redirect, too.
:param assert_same_host:
If ``True``, will make sure that the host of the pool requests is
consistent else will raise HostChangedError. When False, you can
use the pool on an HTTP proxy and request foreign hosts.
:param timeout:
If specified, overrides the default timeout for this one
request. It may be a float (in seconds) or an instance of
:class:`urllib3.util.Timeout`.
:param pool_timeout:
If set and the pool is set to block=True, then this method will
block for ``pool_timeout`` seconds and raise EmptyPoolError if no
connection is available within the time period.
:param release_conn:
If False, then the urlopen call will not release the connection
back into the pool once a response is received (but will release if
you read the entire contents of the response such as when
`preload_content=True`). This is useful if you're not preloading
the response's content immediately. You will need to call
``r.release_conn()`` on the response ``r`` to return the connection
back into the pool. If None, it takes the value of
``response_kw.get('preload_content', True)``.
:param chunked:
If True, urllib3 will send the body using chunked transfer
encoding. Otherwise, urllib3 will send the body using the standard
content-length form. Defaults to False.
:param int body_pos:
Position to seek to in file-like body in the event of a retry or
redirect. Typically this won't need to be set because urllib3 will
auto-populate the value when needed.
:param \**response_kw:
Additional parameters are passed to
:meth:`urllib3.response.HTTPResponse.from_httplib`
N)�redirect�defaultZpreload_contentTr= F)r rk )r �bodyrM ry Zrequest_method)rB �
connectionrA z"No pool connections are available.zCannot connect to proxy.zConnection aborted.� )r �_poolZ _stacktracez1Retrying (%r) after connection broken by '%r': %s)r � pool_timeout� release_conn�body_posc S s@ y | j � W n. ttttttfk
r: } zW Y d d }~X nX d S )N)�readr r rt r r r )�responser{ r- r- r. �drain_and_release_conn� s
z:HTTPConnectionPool.urlopen.<locals>.drain_and_release_conni/ ZGET)r� r� zRedirecting %s -> %s)rA r� �assert_same_hostr r� r� r� z Retry-Afterz Retry: %s)6rM r? r" Zfrom_intrA rW r� r
r: �copy�updaterE r ra r[ rT r rD rZ r_ r} � ResponseClsZ from_httplibr rY r r r rt r r r r r r
Z increment�sysrm Zsleepr4 r] rQ r\ �urlopenZget_redirect_locationru r Zraise_on_redirectZsleep_for_retryrR �boolZ getheaderZis_retryZraise_on_status)r, rx rh r� rM rA r� r� r r� r� ry r� Z response_kwrU Zrelease_this_connrg Z
clean_exitrz Zis_new_proxy_connr| Z
response_connr� r{ r� Zredirect_locationZhas_retry_afterr- r- r. r� � s� ^
zHTTPConnectionPool.urlopen)N)r1 r7 r8 r9 r: r rS r r� r# rp r/ rV r[ r] r^ r_ ra rj r` r} rw r4 r� r� r- r- r- r. r< b s. :%
& Ur< c sn e Zd ZdZdZeZddejddddddddddddddfdd�Z dd � Z
d
d � Z d d
� Z � fdd�Z
� ZS )�HTTPSConnectionPoola�
Same as :class:`.HTTPConnectionPool`, but HTTPS.
When Python is compiled with the :mod:`ssl` module, then
:class:`.VerifiedHTTPSConnection` is used, which *can* verify certificates,
instead of :class:`.HTTPSConnection`.
:class:`.VerifiedHTTPSConnection` uses one of ``assert_fingerprint``,
``assert_hostname`` and ``host`` in this order to verify connections.
If ``assert_hostname`` is False, no verification is done.
The ``key_file``, ``cert_file``, ``cert_reqs``, ``ca_certs``,
``ca_cert_dir``, and ``ssl_version`` are only used if :mod:`ssl` is
available and are fed into :meth:`urllib3.util.ssl_wrap_socket` to upgrade
the connection socket into an SSL socket.
�httpsNFr c K sf t j| ||||||||| |
f |� |r2|
d kr2d}
| | _| | _|
| _|| _|| _|| _|| _|| _ d S )NZ
CERT_REQUIRED)
r< r/ �key_file� cert_file� cert_reqs�ca_certs� ca_cert_dir� ssl_version�assert_hostname�assert_fingerprint)r, r) r+ r> r rL rC rM rA rN rO r� r� r� r� r� r� r� r� rJ r- r- r. r/ � s z HTTPSConnectionPool.__init__c C s< t |t�r8|j| j| j| j| j| j| j| j d� | j
|_
|S )z�
Prepare the ``connection`` for :meth:`urllib3.util.ssl_wrap_socket`
and establish the tunnel if proxy is used.
)r� r� r� r� r� r� r� ) r? r Zset_certr� r� r� r� r� r� r� r� )r, rU r- r- r. �
_prepare_conn s
z!HTTPSConnectionPool._prepare_connc C sf y
|j }W n tk
r$ |j}Y nX tjdkrH| j rH|| j| j� n|| j| j| j� |j� dS )z�
Establish tunnel connection early, because otherwise httplib
would improperly set Host: header to proxy's IP:port.
r� � � N)r� r� r� ) �
set_tunnelrX Z _set_tunnelr� � version_inforE r* r+ �connect)r, rU r� r- r- r. r_ s
z"HTTPSConnectionPool._prepare_proxyc C s� | j d7 _ tjd| j | j� | j s2| jtkr:td��| j}| j}| jdk r`| jj}| jj}| jf ||| j j
| j d�| j ��}| j
|�S )zB
Return a fresh :class:`httplib.HTTPSConnection`.
r z&Starting new HTTPS connection (%d): %szCCan't connect to HTTPS URL because the SSL module is not available.N)r) r+ r r> )rH rQ rR r) rS r r r+ rD r rT r> rJ r� )r, Z actual_hostZ actual_portrU r- r- r. rV 2 s
z HTTPSConnectionPool._new_connc s: t t| �j|� t|dd�s$|j� |js6tjdt� dS )zU
Called right before a request is made, after the socket is created.
rk Nz�Unverified HTTPS request is being made. Adding certificate verification is strongly advised. See: https://urllib3.readthedocs.io/en/latest/advanced-usage.html#ssl-warnings) �superr� r^ rZ r� Z is_verified�warnings�warnr )r, rU )� __class__r- r. r^ J s z"HTTPSConnectionPool._validate_conn)r1 r7 r8 r9 r: r rS r# rp r/ r� r_ rV r^ �
__classcell__r- r- )r� r. r� � s r� c K sR t | �\}}}|p tj|d�}|dkr:t|fd|i|��S t|fd|i|��S dS )a�
Given a url, return an :class:`.ConnectionPool` instance of its host.
This is a shortcut for not having to parse out the scheme, host, and port
of the url before creating an :class:`.ConnectionPool` instance.
:param url:
Absolute URL string that must include the scheme. Port is optional.
:param \**kw:
Passes additional parameters to the constructor of the appropriate
:class:`.ConnectionPool`. Useful for specifying things like
timeout, maxsize, headers, etc.
Example::
>>> conn = connection_from_url('http://google.com/')
>>> r = conn.request('GET', '/')
�P r� r+ N)r$ r rW r� r< )rh �kwr: r) r+ r- r- r. �connection_from_url] s
r� c C s* | j d�r&| jd�r&| jdd�jd�} | S )z'
Process IPv6 address literals
�[�]z%25�%z[])r� �endswith�replace�strip)r) r- r- r. r' y s r' )KZ
__future__r rb Zloggingr� r� rq r rt r rc �
exceptionsr r r r r
r r r
r r r r r Zpackages.ssl_match_hostnamer Zpackagesr Zpackages.six.movesr r� r r r r r r r rn r r� r Zutil.connectionr Z util.requestr Z
util.responser! Z
util.retryr" Z util.timeoutr# Zutil.urlr$ r% ZPY2ZQueueZ_unused_module_QueueZmovesrF Z getLoggerr1 rQ �objectr` r& �setZEAGAINZ EWOULDBLOCKre r< r� r� r' r- r- r- r. �<module> sF < $
% | pip/_vendor/urllib3/__pycache__/fields.cpython-36.pyc 0000644 00000013240 14751155150 0016454 0 ustar 00 3
���e7 � @ sN d dl mZ d dlZd dlZddlmZ d dd�Zdd � ZG d
d � d e �Z
dS )
� )�absolute_importN� )�six�application/octet-streamc C s | rt j| �d p|S |S )z�
Guess the "Content-Type" of a file.
:param filename:
The filename to guess the "Content-Type" of using :mod:`mimetypes`.
:param default:
If no "Content-Type" can be guessed, default to `default`.
r )� mimetypesZ
guess_type)�filename�default� r � /usr/lib/python3.6/fields.py�guess_content_type s r c s� t � fdd�dD ��sNd| � f }y|jd� W n ttfk
rH Y nX |S tj rlt� tj�rl� jd�� tj j
� d�� d| � f � � S )a�
Helper function to format and quote a single header parameter.
Particularly useful for header parameters which might contain
non-ASCII values, like file names. This follows RFC 2231, as
suggested by RFC 2388 Section 4.4.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
c 3 s | ]}|� kV qd S )Nr )�.0Zch)�valuer r
� <genexpr># s z&format_header_param.<locals>.<genexpr>z"\
z%s="%s"�asciizutf-8z%s*=%s) �any�encode�UnicodeEncodeError�UnicodeDecodeErrorr ZPY3�
isinstanceZ text_type�emailZutilsZencode_rfc2231)�namer
�resultr )r
r
�format_header_param s
r c @ sH e Zd ZdZddd�Zedd� �Zdd� Zd d
� Zd d � Z dd
d�Z
dS )� RequestFieldaK
A data container for request body parameters.
:param name:
The name of this request field.
:param data:
The data/value body.
:param filename:
An optional filename of the request field.
:param headers:
An optional dict-like object of headers to initially use for the field.
Nc C s* || _ || _|| _i | _|r&t|�| _d S )N)�_name� _filename�data�headers�dict)�selfr r r r r r r
�__init__? s zRequestField.__init__c C s^ t |t�r4t|�dkr"|\}}}q@|\}}t|�}n d}d}|}| |||d�}|j|d� |S )a�
A :class:`~urllib3.fields.RequestField` factory from old-style tuple parameters.
Supports constructing :class:`~urllib3.fields.RequestField` from
parameter of key/value strings AND key/filetuple. A filetuple is a
(filename, data, MIME type) tuple where the MIME type is optional.
For example::
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
Field names and filenames must be unicode.
� N)r )� content_type)r �tuple�lenr �make_multipart)�clsZ fieldnamer
r r r" Z
request_paramr r r
� from_tuplesG s
zRequestField.from_tuplesc C s
t ||�S )a
Overridable helper function to format a single header parameter.
:param name:
The name of the parameter, a string expected to be ASCII only.
:param value:
The value of the parameter, provided as a unicode string.
)r )r r r
r r r
� _render_parti s zRequestField._render_partc C sP g }|}t |t�r|j� }x*|D ]"\}}|dk r |j| j||�� q W dj|�S )aO
Helper function to format and quote a single header.
Useful for single headers that are composed of multiple items. E.g.,
'Content-Disposition' fields.
:param header_parts:
A sequence of (k, v) typles or a :class:`dict` of (k, v) to format
as `k1="v1"; k2="v2"; ...`.
Nz; )r r �items�appendr( �join)r Z header_parts�parts�iterabler r
r r r
�
_render_partst s
zRequestField._render_partsc C s� g }dddg}x2|D ]*}| j j|d�r|jd|| j | f � qW x4| j j� D ]&\}}||krN|rN|jd||f � qNW |jd� dj|�S )z=
Renders the headers for this request field.
zContent-Dispositionz Content-TypezContent-LocationFz%s: %sz
)r �getr* r) r+ )r �linesZ sort_keysZsort_keyZ header_nameZ header_valuer r r
�render_headers� s
zRequestField.render_headersc C sX |pd| j d< | j d djd| jd| jfd| jff�g�7 < || j d< || j d< d S )
a|
Makes this request field into a multipart request field.
This method overrides "Content-Disposition", "Content-Type" and
"Content-Location" headers to the request parameter.
:param content_type:
The 'Content-Type' of the request body.
:param content_location:
The 'Content-Location' of the request body.
z form-datazContent-Dispositionz; � r r z Content-TypezContent-LocationN)r r+ r. r r )r Zcontent_dispositionr" Zcontent_locationr r r
r% � s
zRequestField.make_multipart)NN)NNN) �__name__�
__module__� __qualname__�__doc__r � classmethodr' r( r. r1 r% r r r r
r 2 s
" r )r ) Z
__future__r Z email.utilsr r Zpackagesr r r �objectr r r r r
�<module> s
pip/_vendor/urllib3/__pycache__/request.cpython-36.pyc 0000644 00000012556 14751155150 0016707 0 ustar 00 3
���e: � @ s> d dl mZ ddlmZ ddlmZ dgZG dd� de�ZdS )� )�absolute_import� )�encode_multipart_formdata)� urlencode�RequestMethodsc @ sR e Zd ZdZeddddg�Zddd�Zdd
d �Zdd d
�Zddd�Z ddd�Z
dS )r a�
Convenience mixin for classes who implement a :meth:`urlopen` method, such
as :class:`~urllib3.connectionpool.HTTPConnectionPool` and
:class:`~urllib3.poolmanager.PoolManager`.
Provides behavior for making common types of HTTP request methods and
decides which type of request field encoding to use.
Specifically,
:meth:`.request_encode_url` is for sending requests whose fields are
encoded in the URL (such as GET, HEAD, DELETE).
:meth:`.request_encode_body` is for sending requests whose fields are
encoded in the *body* of the request using multipart or www-form-urlencoded
(such as for POST, PUT, PATCH).
:meth:`.request` is for making any kind of request, it will look up the
appropriate encoding format and use one of the above two methods to make
the request.
Initializer parameters:
:param headers:
Headers to include with all requests, unless other headers are given
explicitly.
ZDELETEZGETZHEADZOPTIONSNc C s |pi | _ d S )N)�headers)�selfr � r � /usr/lib/python3.6/request.py�__init__) s zRequestMethods.__init__Tc K s t d��d S )NzMClasses extending RequestMethods must implement their own ``urlopen`` method.)�NotImplemented)r �method�url�bodyr �encode_multipart�multipart_boundary�kwr r r
�urlopen, s zRequestMethods.urlopenc K sJ |j � }|| jkr,| j||f||d�|��S | j||f||d�|��S dS )a�
Make a request using :meth:`urlopen` with the appropriate encoding of
``fields`` based on the ``method`` used.
This is a convenience method that requires the least amount of manual
effort. It can be used in most situations, while still having the
option to drop down to more specific methods when necessary, such as
:meth:`request_encode_url`, :meth:`request_encode_body`,
or even the lowest level :meth:`urlopen`.
)�fieldsr N)�upper�_encode_url_methods�request_encode_url�request_encode_body)r r
r r r �
urlopen_kwr r r
�request2 s
zRequestMethods.requestc K sD |dkr| j }d|i}|j|� |r4|dt|� 7 }| j||f|�S )z�
Make a request using :meth:`urlopen` with the ``fields`` encoded in
the url. This is useful for request methods like GET, HEAD, DELETE, etc.
Nr �?)r �updater r )r r
r r r r �extra_kwr r r
r H s
z!RequestMethods.request_encode_urlc K s� |dkr| j }di i}|rbd|kr*td��|r@t||d�\} }
nt|�d } }
| |d< d|
i|d< |d j|� |j|� | j||f|�S )a�
Make a request using :meth:`urlopen` with the ``fields`` encoded in
the body. This is useful for request methods like POST, PUT, PATCH, etc.
When ``encode_multipart=True`` (default), then
:meth:`urllib3.filepost.encode_multipart_formdata` is used to encode
the payload with the appropriate content type. Otherwise
:meth:`urllib.urlencode` is used with the
'application/x-www-form-urlencoded' content type.
Multipart encoding must be used when posting files, and it's reasonably
safe to use it in other times too. However, it may break request
signing, such as with OAuth.
Supports an optional ``fields`` parameter of key/value strings AND
key/filetuple. A filetuple is a (filename, data, MIME type) tuple where
the MIME type is optional. For example::
fields = {
'foo': 'bar',
'fakefile': ('foofile.txt', 'contents of foofile'),
'realfile': ('barfile.txt', open('realfile').read()),
'typedfile': ('bazfile.bin', open('bazfile').read(),
'image/jpeg'),
'nonamefile': 'contents of nonamefile field',
}
When uploading a file, providing a filename (the first parameter of the
tuple) is optional but recommended to best mimick behavior of browsers.
Note that if ``headers`` are supplied, the 'Content-Type' header will
be overwritten because it depends on the dynamic random boundary string
which is used to compose the body of the request. The random boundary
string can be explicitly set with the ``multipart_boundary`` parameter.
Nr r zFrequest got values for both 'fields' and 'body', can only specify one.)�boundaryz!application/x-www-form-urlencodedz Content-Type)r � TypeErrorr r r r ) r r
r r r r r r r r Z content_typer r r
r Y s &
z"RequestMethods.request_encode_body)N)NNTN)NN)NN)NNTN) �__name__�
__module__� __qualname__�__doc__�setr r r r r r r r r r
r
s
N) Z
__future__r Zfilepostr Z packages.six.moves.urllib.parser �__all__�objectr r r r r
�<module> s pip/_vendor/urllib3/exceptions.py 0000644 00000014713 14751155150 0013111 0 ustar 00 from __future__ import absolute_import
from .packages.six.moves.http_client import (
IncompleteRead as httplib_IncompleteRead
)
# Base Exceptions
class HTTPError(Exception):
"Base exception used by this module."
pass
class HTTPWarning(Warning):
"Base warning used by this module."
pass
class PoolError(HTTPError):
"Base exception for errors caused within a pool."
def __init__(self, pool, message):
self.pool = pool
HTTPError.__init__(self, "%s: %s" % (pool, message))
def __reduce__(self):
# For pickling purposes.
return self.__class__, (None, None)
class RequestError(PoolError):
"Base exception for PoolErrors that have associated URLs."
def __init__(self, pool, url, message):
self.url = url
PoolError.__init__(self, pool, message)
def __reduce__(self):
# For pickling purposes.
return self.__class__, (None, self.url, None)
class SSLError(HTTPError):
"Raised when SSL certificate fails in an HTTPS connection."
pass
class ProxyError(HTTPError):
"Raised when the connection to a proxy fails."
pass
class DecodeError(HTTPError):
"Raised when automatic decoding based on Content-Type fails."
pass
class ProtocolError(HTTPError):
"Raised when something unexpected happens mid-request/response."
pass
#: Renamed to ProtocolError but aliased for backwards compatibility.
ConnectionError = ProtocolError
# Leaf Exceptions
class MaxRetryError(RequestError):
"""Raised when the maximum number of retries is exceeded.
:param pool: The connection pool
:type pool: :class:`~urllib3.connectionpool.HTTPConnectionPool`
:param string url: The requested Url
:param exceptions.Exception reason: The underlying error
"""
def __init__(self, pool, url, reason=None):
self.reason = reason
message = "Max retries exceeded with url: %s (Caused by %r)" % (
url, reason)
RequestError.__init__(self, pool, url, message)
class HostChangedError(RequestError):
"Raised when an existing pool gets a request for a foreign host."
def __init__(self, pool, url, retries=3):
message = "Tried to open a foreign host with url: %s" % url
RequestError.__init__(self, pool, url, message)
self.retries = retries
class TimeoutStateError(HTTPError):
""" Raised when passing an invalid state to a timeout """
pass
class TimeoutError(HTTPError):
""" Raised when a socket timeout error occurs.
Catching this error will catch both :exc:`ReadTimeoutErrors
<ReadTimeoutError>` and :exc:`ConnectTimeoutErrors <ConnectTimeoutError>`.
"""
pass
class ReadTimeoutError(TimeoutError, RequestError):
"Raised when a socket timeout occurs while receiving data from a server"
pass
# This timeout error does not have a URL attached and needs to inherit from the
# base HTTPError
class ConnectTimeoutError(TimeoutError):
"Raised when a socket timeout occurs while connecting to a server"
pass
class NewConnectionError(ConnectTimeoutError, PoolError):
"Raised when we fail to establish a new connection. Usually ECONNREFUSED."
pass
class EmptyPoolError(PoolError):
"Raised when a pool runs out of connections and no more are allowed."
pass
class ClosedPoolError(PoolError):
"Raised when a request enters a pool after the pool has been closed."
pass
class LocationValueError(ValueError, HTTPError):
"Raised when there is something wrong with a given URL input."
pass
class LocationParseError(LocationValueError):
"Raised when get_host or similar fails to parse the URL input."
def __init__(self, location):
message = "Failed to parse: %s" % location
HTTPError.__init__(self, message)
self.location = location
class ResponseError(HTTPError):
"Used as a container for an error reason supplied in a MaxRetryError."
GENERIC_ERROR = 'too many error responses'
SPECIFIC_ERROR = 'too many {status_code} error responses'
class SecurityWarning(HTTPWarning):
"Warned when perfoming security reducing actions"
pass
class SubjectAltNameWarning(SecurityWarning):
"Warned when connecting to a host with a certificate missing a SAN."
pass
class InsecureRequestWarning(SecurityWarning):
"Warned when making an unverified HTTPS request."
pass
class SystemTimeWarning(SecurityWarning):
"Warned when system time is suspected to be wrong"
pass
class InsecurePlatformWarning(SecurityWarning):
"Warned when certain SSL configuration is not available on a platform."
pass
class SNIMissingWarning(HTTPWarning):
"Warned when making a HTTPS request without SNI available."
pass
class DependencyWarning(HTTPWarning):
"""
Warned when an attempt is made to import a module with missing optional
dependencies.
"""
pass
class ResponseNotChunked(ProtocolError, ValueError):
"Response needs to be chunked in order to read it as chunks."
pass
class BodyNotHttplibCompatible(HTTPError):
"""
Body should be httplib.HTTPResponse like (have an fp attribute which
returns raw chunks) for read_chunked().
"""
pass
class IncompleteRead(HTTPError, httplib_IncompleteRead):
"""
Response length doesn't match expected Content-Length
Subclass of http_client.IncompleteRead to allow int value
for `partial` to avoid creating large objects on streamed
reads.
"""
def __init__(self, partial, expected):
super(IncompleteRead, self).__init__(partial, expected)
def __repr__(self):
return ('IncompleteRead(%i bytes read, '
'%i more expected)' % (self.partial, self.expected))
class InvalidHeader(HTTPError):
"The header provided was somehow invalid."
pass
class ProxySchemeUnknown(AssertionError, ValueError):
"ProxyManager does not support the supplied scheme"
# TODO(t-8ch): Stop inheriting from AssertionError in v2.0.
def __init__(self, scheme):
message = "Not supported proxy scheme %s" % scheme
super(ProxySchemeUnknown, self).__init__(message)
class HeaderParsingError(HTTPError):
"Raised by assert_header_parsing, but we convert it to a log.warning statement."
def __init__(self, defects, unparsed_data):
message = '%s, unparsed data: %r' % (defects or 'Unknown', unparsed_data)
super(HeaderParsingError, self).__init__(message)
class UnrewindableBodyError(HTTPError):
"urllib3 encountered an error when trying to rewind a body"
pass
pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.pyc 0000644 00000000553 14751155150 0021577 0 ustar 00 3
���e� � @ sZ d dl mZmZmZ ddlmZ dgZyddlmZ W n ek
rJ Y n X ej d� dS )� )�absolute_import�division�unicode_literals� )�saxr )�genshir N)
Z
__future__r r r � r �__all__r � ImportError�append� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.opt-1.pyc 0000644 00000002640 14751155150 0022253 0 ustar 00 3
���e � @ sL d dl mZmZmZ d dlmZmZ d dlmZmZm Z m
Z
m Z dd� Z dS )� )�absolute_import�division�unicode_literals)�QName�Attrs)�START�END�TEXT�COMMENT�DOCTYPEc c sZ g }�x6| D �],}|d }|dkr2|j |d � n|rLtdj|�dfV g }|dkr�|d rrd
|d |d f }n|d }td d
� |d j� D ��}tt|�|fdfV |dkr�d}|dk� r�|d r�d
|d |d f }n|d }tt|�d fV q |dk�rt|d d fV q |dkr t |d |d |d fd#fV q q W |�rVtdj|�d&fV d S )'N�type�
Characters�SpaceCharacters�data� � �StartTag�EmptyTag� namespacez{%s}%s�namec S s4 g | ],\}}t |d dk r"d| n|d �|f�qS )r Nz{%s}%sr )r )�.0�attr�value� r � /usr/lib/python3.6/genshi.py�
<listcomp> s z to_genshi.<locals>.<listcomp>ZEndTag�CommentZDoctypeZpublicIdZsystemId)r
r ���r )Nr r )r r r r )Nr r r r )Nr r r r )Nr r r r )Nr r r r )Nr r )
�appendr �joinr �itemsr r r r
r )Zwalker�text�tokenr r Zattrsr r r � to_genshi s<
r# N)
Z
__future__r r r Z genshi.corer r r r r r
r r# r r r r �<module> s pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000553 14751155150 0022536 0 ustar 00 3
���e� � @ sZ d dl mZmZmZ ddlmZ dgZyddlmZ W n ek
rJ Y n X ej d� dS )� )�absolute_import�division�unicode_literals� )�saxr )�genshir N)
Z
__future__r r r � r �__all__r � ImportError�append� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.pyc 0000644 00000002640 14751155150 0021314 0 ustar 00 3
���e � @ sL d dl mZmZmZ d dlmZmZ d dlmZmZm Z m
Z
m Z dd� Z dS )� )�absolute_import�division�unicode_literals)�QName�Attrs)�START�END�TEXT�COMMENT�DOCTYPEc c sZ g }�x6| D �],}|d }|dkr2|j |d � n|rLtdj|�dfV g }|dkr�|d rrd
|d |d f }n|d }td d
� |d j� D ��}tt|�|fdfV |dkr�d}|dk� r�|d r�d
|d |d f }n|d }tt|�d fV q |dk�rt|d d fV q |dkr t |d |d |d fd#fV q q W |�rVtdj|�d&fV d S )'N�type�
Characters�SpaceCharacters�data� � �StartTag�EmptyTag� namespacez{%s}%s�namec S s4 g | ],\}}t |d dk r"d| n|d �|f�qS )r Nz{%s}%sr )r )�.0�attr�value� r � /usr/lib/python3.6/genshi.py�
<listcomp> s z to_genshi.<locals>.<listcomp>ZEndTag�CommentZDoctypeZpublicIdZsystemId)r
r ���r )Nr r )r r r r )Nr r r r )Nr r r r )Nr r r r )Nr r r r )Nr r )
�appendr �joinr �itemsr r r r
r )Zwalker�text�tokenr r Zattrsr r r � to_genshi s<
r# N)
Z
__future__r r r Z genshi.corer r r r r r
r r# r r r r �<module> s pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.opt-1.pyc 0000644 00000002335 14751155150 0021572 0 ustar 00 3
���e} � @ sh d dl mZmZmZ d dlmZ ddlmZmZ i Z x&ej
� D ]\Z Z Z
e dk r>e
e e < q>W dd� ZdS )� )�absolute_import�division�unicode_literals)�AttributesNSImpl� )�adjustForeignAttributes�unadjustForeignAttributesNc C s |j � x tj� D ]\}}|j||� qW x�| D ]�}|d }|dkrHq0q0|d
kr�t|d t�}|j|d |d f|d |� |dkr�|j|d |d f|d � q0|dkr�|j|d |d f|d � q0|dkr�|j|d � q0|d kr0q0q0W x tj� D ]\}}|j |� � q�W |j
� d S )z8Call SAX-like content handler based on treewalker walker�typeZDoctype�StartTag�EmptyTag�data� namespace�nameZEndTag�
Characters�SpaceCharacters�CommentN)r
r )r r ) Z
startDocument�prefix_mapping�itemsZstartPrefixMappingr r ZstartElementNSZ endElementNSZ
charactersZendPrefixMappingZ endDocument)ZwalkerZhandler�prefixr
�tokenr Zattrs� r �/usr/lib/python3.6/sax.py�to_sax
s6
r )Z
__future__r r r Zxml.sax.xmlreaderr Z constantsr r r �valuesr Z localNamer
r r r r r �<module> s pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.pyc 0000644 00000002416 14751155150 0020633 0 ustar 00 3
���e} � @ sh d dl mZmZmZ d dlmZ ddlmZmZ i Z x&ej
� D ]\Z Z Z
e dk r>e
e e < q>W dd� ZdS )� )�absolute_import�division�unicode_literals)�AttributesNSImpl� )�adjustForeignAttributes�unadjustForeignAttributesNc C s( |j � x tj� D ]\}}|j||� qW x�| D ]�}|d }|dkrHq0q0|dkr�t|d t�}|j|d |d f|d |� |dkr�|j|d |d f|d � q0|dkr�|j|d |d f|d � q0|dkr�|j|d � q0|d kr�q0d s0t d
��q0W x tj� D ]\}}|j
|� �qW |j � dS )z8Call SAX-like content handler based on treewalker walker�typeZDoctype�StartTag�EmptyTag�data� namespace�nameZEndTag�
Characters�SpaceCharacters�CommentFzUnknown token typeN)r
r )r r ) Z
startDocument�prefix_mapping�itemsZstartPrefixMappingr r ZstartElementNSZ endElementNSZ
characters�AssertionErrorZendPrefixMappingZ endDocument)ZwalkerZhandler�prefixr
�tokenr Zattrs� r �/usr/lib/python3.6/sax.py�to_sax
s6
r )Z
__future__r r r Zxml.sax.xmlreaderr Z constantsr r r �valuesr Z localNamer
r r r r r �<module> s pip/_vendor/html5lib/treeadapters/genshi.py 0000644 00000003023 14751155150 0015024 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from genshi.core import QName, Attrs
from genshi.core import START, END, TEXT, COMMENT, DOCTYPE
def to_genshi(walker):
text = []
for token in walker:
type = token["type"]
if type in ("Characters", "SpaceCharacters"):
text.append(token["data"])
elif text:
yield TEXT, "".join(text), (None, -1, -1)
text = []
if type in ("StartTag", "EmptyTag"):
if token["namespace"]:
name = "{%s}%s" % (token["namespace"], token["name"])
else:
name = token["name"]
attrs = Attrs([(QName("{%s}%s" % attr if attr[0] is not None else attr[1]), value)
for attr, value in token["data"].items()])
yield (START, (QName(name), attrs), (None, -1, -1))
if type == "EmptyTag":
type = "EndTag"
if type == "EndTag":
if token["namespace"]:
name = "{%s}%s" % (token["namespace"], token["name"])
else:
name = token["name"]
yield END, QName(name), (None, -1, -1)
elif type == "Comment":
yield COMMENT, token["data"], (None, -1, -1)
elif type == "Doctype":
yield DOCTYPE, (token["name"], token["publicId"],
token["systemId"]), (None, -1, -1)
else:
pass # FIXME: What to do?
if text:
yield TEXT, "".join(text), (None, -1, -1)
pip/_vendor/html5lib/treeadapters/__init__.py 0000644 00000000320 14751155150 0015303 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from . import sax
__all__ = ["sax"]
try:
from . import genshi # noqa
except ImportError:
pass
else:
__all__.append("genshi")
pip/_vendor/html5lib/treeadapters/sax.py 0000644 00000003175 14751155150 0014352 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from xml.sax.xmlreader import AttributesNSImpl
from ..constants import adjustForeignAttributes, unadjustForeignAttributes
prefix_mapping = {}
for prefix, localName, namespace in adjustForeignAttributes.values():
if prefix is not None:
prefix_mapping[prefix] = namespace
def to_sax(walker, handler):
"""Call SAX-like content handler based on treewalker walker"""
handler.startDocument()
for prefix, namespace in prefix_mapping.items():
handler.startPrefixMapping(prefix, namespace)
for token in walker:
type = token["type"]
if type == "Doctype":
continue
elif type in ("StartTag", "EmptyTag"):
attrs = AttributesNSImpl(token["data"],
unadjustForeignAttributes)
handler.startElementNS((token["namespace"], token["name"]),
token["name"],
attrs)
if type == "EmptyTag":
handler.endElementNS((token["namespace"], token["name"]),
token["name"])
elif type == "EndTag":
handler.endElementNS((token["namespace"], token["name"]),
token["name"])
elif type in ("Characters", "SpaceCharacters"):
handler.characters(token["data"])
elif type == "Comment":
pass
else:
assert False, "Unknown token type"
for prefix, namespace in prefix_mapping.items():
handler.endPrefixMapping(prefix)
handler.endDocument()
pip/_vendor/html5lib/treebuilders/etree_lxml.py 0000644 00000033521 14751155150 0015723 0 ustar 00 """Module for supporting the lxml.etree library. The idea here is to use as much
of the native library as possible, without using fragile hacks like custom element
names that break between releases. The downside of this is that we cannot represent
all possible trees; specifically the following are known to cause problems:
Text or comments as siblings of the root element
Docypes with no name
When any of these things occur, we emit a DataLossWarning
"""
from __future__ import absolute_import, division, unicode_literals
# pylint:disable=protected-access
import warnings
import re
import sys
from . import base
from ..constants import DataLossWarning
from .. import constants
from . import etree as etree_builders
from .. import _ihatexml
import lxml.etree as etree
fullTree = True
tag_regexp = re.compile("{([^}]*)}(.*)")
comment_type = etree.Comment("asd").tag
class DocumentType(object):
def __init__(self, name, publicId, systemId):
self.name = name
self.publicId = publicId
self.systemId = systemId
class Document(object):
def __init__(self):
self._elementTree = None
self._childNodes = []
def appendChild(self, element):
self._elementTree.getroot().addnext(element._element)
def _getChildNodes(self):
return self._childNodes
childNodes = property(_getChildNodes)
def testSerializer(element):
rv = []
infosetFilter = _ihatexml.InfosetFilter(preventDoubleDashComments=True)
def serializeElement(element, indent=0):
if not hasattr(element, "tag"):
if hasattr(element, "getroot"):
# Full tree case
rv.append("#document")
if element.docinfo.internalDTD:
if not (element.docinfo.public_id or
element.docinfo.system_url):
dtd_str = "<!DOCTYPE %s>" % element.docinfo.root_name
else:
dtd_str = """<!DOCTYPE %s "%s" "%s">""" % (
element.docinfo.root_name,
element.docinfo.public_id,
element.docinfo.system_url)
rv.append("|%s%s" % (' ' * (indent + 2), dtd_str))
next_element = element.getroot()
while next_element.getprevious() is not None:
next_element = next_element.getprevious()
while next_element is not None:
serializeElement(next_element, indent + 2)
next_element = next_element.getnext()
elif isinstance(element, str) or isinstance(element, bytes):
# Text in a fragment
assert isinstance(element, str) or sys.version_info[0] == 2
rv.append("|%s\"%s\"" % (' ' * indent, element))
else:
# Fragment case
rv.append("#document-fragment")
for next_element in element:
serializeElement(next_element, indent + 2)
elif element.tag == comment_type:
rv.append("|%s<!-- %s -->" % (' ' * indent, element.text))
if hasattr(element, "tail") and element.tail:
rv.append("|%s\"%s\"" % (' ' * indent, element.tail))
else:
assert isinstance(element, etree._Element)
nsmatch = etree_builders.tag_regexp.match(element.tag)
if nsmatch is not None:
ns = nsmatch.group(1)
tag = nsmatch.group(2)
prefix = constants.prefixes[ns]
rv.append("|%s<%s %s>" % (' ' * indent, prefix,
infosetFilter.fromXmlName(tag)))
else:
rv.append("|%s<%s>" % (' ' * indent,
infosetFilter.fromXmlName(element.tag)))
if hasattr(element, "attrib"):
attributes = []
for name, value in element.attrib.items():
nsmatch = tag_regexp.match(name)
if nsmatch is not None:
ns, name = nsmatch.groups()
name = infosetFilter.fromXmlName(name)
prefix = constants.prefixes[ns]
attr_string = "%s %s" % (prefix, name)
else:
attr_string = infosetFilter.fromXmlName(name)
attributes.append((attr_string, value))
for name, value in sorted(attributes):
rv.append('|%s%s="%s"' % (' ' * (indent + 2), name, value))
if element.text:
rv.append("|%s\"%s\"" % (' ' * (indent + 2), element.text))
indent += 2
for child in element:
serializeElement(child, indent)
if hasattr(element, "tail") and element.tail:
rv.append("|%s\"%s\"" % (' ' * (indent - 2), element.tail))
serializeElement(element, 0)
return "\n".join(rv)
def tostring(element):
"""Serialize an element and its child nodes to a string"""
rv = []
def serializeElement(element):
if not hasattr(element, "tag"):
if element.docinfo.internalDTD:
if element.docinfo.doctype:
dtd_str = element.docinfo.doctype
else:
dtd_str = "<!DOCTYPE %s>" % element.docinfo.root_name
rv.append(dtd_str)
serializeElement(element.getroot())
elif element.tag == comment_type:
rv.append("<!--%s-->" % (element.text,))
else:
# This is assumed to be an ordinary element
if not element.attrib:
rv.append("<%s>" % (element.tag,))
else:
attr = " ".join(["%s=\"%s\"" % (name, value)
for name, value in element.attrib.items()])
rv.append("<%s %s>" % (element.tag, attr))
if element.text:
rv.append(element.text)
for child in element:
serializeElement(child)
rv.append("</%s>" % (element.tag,))
if hasattr(element, "tail") and element.tail:
rv.append(element.tail)
serializeElement(element)
return "".join(rv)
class TreeBuilder(base.TreeBuilder):
documentClass = Document
doctypeClass = DocumentType
elementClass = None
commentClass = None
fragmentClass = Document
implementation = etree
def __init__(self, namespaceHTMLElements, fullTree=False):
builder = etree_builders.getETreeModule(etree, fullTree=fullTree)
infosetFilter = self.infosetFilter = _ihatexml.InfosetFilter(preventDoubleDashComments=True)
self.namespaceHTMLElements = namespaceHTMLElements
class Attributes(dict):
def __init__(self, element, value=None):
if value is None:
value = {}
self._element = element
dict.__init__(self, value) # pylint:disable=non-parent-init-called
for key, value in self.items():
if isinstance(key, tuple):
name = "{%s}%s" % (key[2], infosetFilter.coerceAttribute(key[1]))
else:
name = infosetFilter.coerceAttribute(key)
self._element._element.attrib[name] = value
def __setitem__(self, key, value):
dict.__setitem__(self, key, value)
if isinstance(key, tuple):
name = "{%s}%s" % (key[2], infosetFilter.coerceAttribute(key[1]))
else:
name = infosetFilter.coerceAttribute(key)
self._element._element.attrib[name] = value
class Element(builder.Element):
def __init__(self, name, namespace):
name = infosetFilter.coerceElement(name)
builder.Element.__init__(self, name, namespace=namespace)
self._attributes = Attributes(self)
def _setName(self, name):
self._name = infosetFilter.coerceElement(name)
self._element.tag = self._getETreeTag(
self._name, self._namespace)
def _getName(self):
return infosetFilter.fromXmlName(self._name)
name = property(_getName, _setName)
def _getAttributes(self):
return self._attributes
def _setAttributes(self, attributes):
self._attributes = Attributes(self, attributes)
attributes = property(_getAttributes, _setAttributes)
def insertText(self, data, insertBefore=None):
data = infosetFilter.coerceCharacters(data)
builder.Element.insertText(self, data, insertBefore)
def appendChild(self, child):
builder.Element.appendChild(self, child)
class Comment(builder.Comment):
def __init__(self, data):
data = infosetFilter.coerceComment(data)
builder.Comment.__init__(self, data)
def _setData(self, data):
data = infosetFilter.coerceComment(data)
self._element.text = data
def _getData(self):
return self._element.text
data = property(_getData, _setData)
self.elementClass = Element
self.commentClass = Comment
# self.fragmentClass = builder.DocumentFragment
base.TreeBuilder.__init__(self, namespaceHTMLElements)
def reset(self):
base.TreeBuilder.reset(self)
self.insertComment = self.insertCommentInitial
self.initial_comments = []
self.doctype = None
def testSerializer(self, element):
return testSerializer(element)
def getDocument(self):
if fullTree:
return self.document._elementTree
else:
return self.document._elementTree.getroot()
def getFragment(self):
fragment = []
element = self.openElements[0]._element
if element.text:
fragment.append(element.text)
fragment.extend(list(element))
if element.tail:
fragment.append(element.tail)
return fragment
def insertDoctype(self, token):
name = token["name"]
publicId = token["publicId"]
systemId = token["systemId"]
if not name:
warnings.warn("lxml cannot represent empty doctype", DataLossWarning)
self.doctype = None
else:
coercedName = self.infosetFilter.coerceElement(name)
if coercedName != name:
warnings.warn("lxml cannot represent non-xml doctype", DataLossWarning)
doctype = self.doctypeClass(coercedName, publicId, systemId)
self.doctype = doctype
def insertCommentInitial(self, data, parent=None):
assert parent is None or parent is self.document
assert self.document._elementTree is None
self.initial_comments.append(data)
def insertCommentMain(self, data, parent=None):
if (parent == self.document and
self.document._elementTree.getroot()[-1].tag == comment_type):
warnings.warn("lxml cannot represent adjacent comments beyond the root elements", DataLossWarning)
super(TreeBuilder, self).insertComment(data, parent)
def insertRoot(self, token):
"""Create the document root"""
# Because of the way libxml2 works, it doesn't seem to be possible to
# alter information like the doctype after the tree has been parsed.
# Therefore we need to use the built-in parser to create our initial
# tree, after which we can add elements like normal
docStr = ""
if self.doctype:
assert self.doctype.name
docStr += "<!DOCTYPE %s" % self.doctype.name
if (self.doctype.publicId is not None or
self.doctype.systemId is not None):
docStr += (' PUBLIC "%s" ' %
(self.infosetFilter.coercePubid(self.doctype.publicId or "")))
if self.doctype.systemId:
sysid = self.doctype.systemId
if sysid.find("'") >= 0 and sysid.find('"') >= 0:
warnings.warn("DOCTYPE system cannot contain single and double quotes", DataLossWarning)
sysid = sysid.replace("'", 'U00027')
if sysid.find("'") >= 0:
docStr += '"%s"' % sysid
else:
docStr += "'%s'" % sysid
else:
docStr += "''"
docStr += ">"
if self.doctype.name != token["name"]:
warnings.warn("lxml cannot represent doctype with a different name to the root element", DataLossWarning)
docStr += "<THIS_SHOULD_NEVER_APPEAR_PUBLICLY/>"
root = etree.fromstring(docStr)
# Append the initial comments:
for comment_token in self.initial_comments:
comment = self.commentClass(comment_token["data"])
root.addprevious(comment._element)
# Create the root document and add the ElementTree to it
self.document = self.documentClass()
self.document._elementTree = root.getroottree()
# Give the root element the right name
name = token["name"]
namespace = token.get("namespace", self.defaultNamespace)
if namespace is None:
etree_tag = name
else:
etree_tag = "{%s}%s" % (namespace, name)
root.tag = etree_tag
# Add the root element to the internal child/open data structures
root_element = self.elementClass(name, namespace)
root_element._element = root
self.document._childNodes.append(root_element)
self.openElements.append(root_element)
# Reset to the default insert comment function
self.insertComment = self.insertCommentMain
pip/_vendor/html5lib/treebuilders/__init__.py 0000644 00000006516 14751155150 0015326 0 ustar 00 """A collection of modules for building different kinds of tree from
HTML documents.
To create a treebuilder for a new type of tree, you need to do
implement several things:
1) A set of classes for various types of elements: Document, Doctype,
Comment, Element. These must implement the interface of
_base.treebuilders.Node (although comment nodes have a different
signature for their constructor, see treebuilders.etree.Comment)
Textual content may also be implemented as another node type, or not, as
your tree implementation requires.
2) A treebuilder object (called TreeBuilder by convention) that
inherits from treebuilders._base.TreeBuilder. This has 4 required attributes:
documentClass - the class to use for the bottommost node of a document
elementClass - the class to use for HTML Elements
commentClass - the class to use for comments
doctypeClass - the class to use for doctypes
It also has one required method:
getDocument - Returns the root node of the complete document tree
3) If you wish to run the unit tests, you must also create a
testSerializer method on your treebuilder which accepts a node and
returns a string containing Node and its children serialized according
to the format used in the unittests
"""
from __future__ import absolute_import, division, unicode_literals
from .._utils import default_etree
treeBuilderCache = {}
def getTreeBuilder(treeType, implementation=None, **kwargs):
"""Get a TreeBuilder class for various types of tree with built-in support
treeType - the name of the tree type required (case-insensitive). Supported
values are:
"dom" - A generic builder for DOM implementations, defaulting to
a xml.dom.minidom based implementation.
"etree" - A generic builder for tree implementations exposing an
ElementTree-like interface, defaulting to
xml.etree.cElementTree if available and
xml.etree.ElementTree if not.
"lxml" - A etree-based builder for lxml.etree, handling
limitations of lxml's implementation.
implementation - (Currently applies to the "etree" and "dom" tree types). A
module implementing the tree type e.g.
xml.etree.ElementTree or xml.etree.cElementTree."""
treeType = treeType.lower()
if treeType not in treeBuilderCache:
if treeType == "dom":
from . import dom
# Come up with a sane default (pref. from the stdlib)
if implementation is None:
from xml.dom import minidom
implementation = minidom
# NEVER cache here, caching is done in the dom submodule
return dom.getDomModule(implementation, **kwargs).TreeBuilder
elif treeType == "lxml":
from . import etree_lxml
treeBuilderCache[treeType] = etree_lxml.TreeBuilder
elif treeType == "etree":
from . import etree
if implementation is None:
implementation = default_etree
# NEVER cache here, caching is done in the etree submodule
return etree.getETreeModule(implementation, **kwargs).TreeBuilder
else:
raise ValueError("""Unrecognised treebuilder "%s" """ % treeType)
return treeBuilderCache.get(treeType)
pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.pyc 0000644 00000005742 14751155150 0021612 0 ustar 00 3
���eN
� @ s6 d Z ddlmZmZmZ ddlmZ i Zddd�ZdS ) a� A collection of modules for building different kinds of tree from
HTML documents.
To create a treebuilder for a new type of tree, you need to do
implement several things:
1) A set of classes for various types of elements: Document, Doctype,
Comment, Element. These must implement the interface of
_base.treebuilders.Node (although comment nodes have a different
signature for their constructor, see treebuilders.etree.Comment)
Textual content may also be implemented as another node type, or not, as
your tree implementation requires.
2) A treebuilder object (called TreeBuilder by convention) that
inherits from treebuilders._base.TreeBuilder. This has 4 required attributes:
documentClass - the class to use for the bottommost node of a document
elementClass - the class to use for HTML Elements
commentClass - the class to use for comments
doctypeClass - the class to use for doctypes
It also has one required method:
getDocument - Returns the root node of the complete document tree
3) If you wish to run the unit tests, you must also create a
testSerializer method on your treebuilder which accepts a node and
returns a string containing Node and its children serialized according
to the format used in the unittests
� )�absolute_import�division�unicode_literals� )�
default_etreeNc K s� | j � } | tkr�| dkrLddlm} |dkr<ddlm} |}|j|f|�jS | dkrlddlm} |jt| < n<| d kr�dd
lm } |dkr�t
}|j |f|�jS t d | ��tj
| �S ) a� Get a TreeBuilder class for various types of tree with built-in support
treeType - the name of the tree type required (case-insensitive). Supported
values are:
"dom" - A generic builder for DOM implementations, defaulting to
a xml.dom.minidom based implementation.
"etree" - A generic builder for tree implementations exposing an
ElementTree-like interface, defaulting to
xml.etree.cElementTree if available and
xml.etree.ElementTree if not.
"lxml" - A etree-based builder for lxml.etree, handling
limitations of lxml's implementation.
implementation - (Currently applies to the "etree" and "dom" tree types). A
module implementing the tree type e.g.
xml.etree.ElementTree or xml.etree.cElementTree.�dom� )r Nr )�minidomZlxml)�
etree_lxml�etree)r z Unrecognised treebuilder "%s" )�lower�treeBuilderCache� r Zxml.domr Z getDomModuleZ TreeBuilderr
r r ZgetETreeModule�
ValueError�get)ZtreeType�implementation�kwargsr r r
r � r � /usr/lib/python3.6/__init__.py�getTreeBuilder$ s$ r )N) �__doc__Z
__future__r r r Z_utilsr r
r r r r r �<module> s pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.pyc 0000644 00000021735 14751155150 0020632 0 ustar 00 3
���e�" � @ s| d dl mZmZmZ d dlmZ d dlmZmZ d dl Z ddl
m Z ddl
m Z dd l m
Z
dd
lmZ d d � Zee�ZdS )
� )�absolute_import�division�unicode_literals)�MutableMapping)�minidom�NodeN� )�base� )� constants)�
namespaces)�moduleFactoryFactoryc sV ��G dd� dt �� G � �fdd�dtj��G ����fdd�dtj�}dd� �t� S ) Nc @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z getDomBuilder.<locals>.AttrListc S s
|| _ d S )N)�element)�selfr � r �/usr/lib/python3.6/dom.py�__init__ s z(getDomBuilder.<locals>.AttrList.__init__c S s t | jjj� �S )N)�iterr �
attributes�keys)r r r r �__iter__ s z(getDomBuilder.<locals>.AttrList.__iter__c S s4 t |t�rt�n | jjj|�}||_|| jj|< d S )N)�
isinstance�tuple�NotImplementedErrorr �
ownerDocumentZcreateAttribute�valuer )r �namer �attrr r r � __setitem__ s
z+getDomBuilder.<locals>.AttrList.__setitem__c S s t | jj�S )N)�lenr r )r r r r �__len__ s z'getDomBuilder.<locals>.AttrList.__len__c S s t | jjj� �S )N)�listr r �items)r r r r r" # s z%getDomBuilder.<locals>.AttrList.itemsc S s t | jjj� �S )N)r! r r �values)r r r r r# & s z&getDomBuilder.<locals>.AttrList.valuesc S s" t |t�rt�n| jj| jS d S )N)r r r r r r )r r r r r � __getitem__) s
z+getDomBuilder.<locals>.AttrList.__getitem__c S s t |t�rt�n
| jj|= d S )N)r r r r r )r r r r r � __delitem__/ s
z+getDomBuilder.<locals>.AttrList.__delitem__N) �__name__�
__module__� __qualname__r r r r r" r# r$ r% r r r r �AttrList s r) c s� e Zd Zdd� Zedd� �Zdd� Zddd �Zd
d � Zd d
� Z dd� Z
� fdd�Z dd� Z ee e �Z
�fdd�Zdd� Zdd� Zee�ZdS )z"getDomBuilder.<locals>.NodeBuilderc S s t jj| |j� || _d S )N)r r r �nodeNamer )r r r r r r 6 s z+getDomBuilder.<locals>.NodeBuilder.__init__c S s t | jd�r| jjpd S )N� namespaceURI)�hasattrr r+ )r r r r �<lambda>: s z+getDomBuilder.<locals>.NodeBuilder.<lambda>c S s | |_ | jj|j� d S )N)�parentr � appendChild)r �noder r r r/ = s z.getDomBuilder.<locals>.NodeBuilder.appendChildNc S s4 | j jj|�}|r$| j j||j � n | j j|� d S )N)r r �createTextNode� insertBeforer/ )r �datar2 �textr r r �
insertTextA s z-getDomBuilder.<locals>.NodeBuilder.insertTextc S s | j j|j |j � | |_d S )N)r r2 r. )r r0 ZrefNoder r r r2 H s z/getDomBuilder.<locals>.NodeBuilder.insertBeforec S s& |j j| j kr | j j|j � d |_d S )N)r Z
parentNode� removeChildr. )r r0 r r r r6 L s z.getDomBuilder.<locals>.NodeBuilder.removeChildc S s: x.| j j� r.| j j}| j j|� |j j|� qW g | _d S )N)r �
hasChildNodesZ
firstChildr6 r/ �
childNodes)r Z newParent�childr r r �reparentChildrenQ s
z3getDomBuilder.<locals>.NodeBuilder.reparentChildrenc s
� | j �S )N)r )r )r) r r �
getAttributesX s z0getDomBuilder.<locals>.NodeBuilder.getAttributesc S sz |rvxpt |j� �D ]`\}}t|t�rd|d d k rF|d d |d }n|d }| jj|d ||� q| jj||� qW d S )Nr �:r r
)r! r" r r r ZsetAttributeNSZ setAttribute)r r r r Z
qualifiedNamer r r �
setAttributes[ s
z0getDomBuilder.<locals>.NodeBuilder.setAttributesc s � | j jd��S )NF)r � cloneNode)r )� NodeBuilderr r r> j s z,getDomBuilder.<locals>.NodeBuilder.cloneNodec S s
| j j� S )N)r r7 )r r r r �
hasContentm s z-getDomBuilder.<locals>.NodeBuilder.hasContentc S s( | j d krtd | jfS | j | jfS d S )NZhtml)� namespacer r )r r r r � getNameTuplep s
z/getDomBuilder.<locals>.NodeBuilder.getNameTuple)N)r& r' r( r �propertyrA r/ r5 r2 r6 r: r; r= r r> r@ rB Z nameTupler )r) r? r r r? 5 s
r? c s� e Zd Z� fdd�Z� �fdd�Zd�fdd� Z�fdd �Z�fd
d �Zd d
� Z�fdd�Z dd� Z
dd� Z ddd�Z �Z
dZdS )z"getDomBuilder.<locals>.TreeBuilderc s � j � jd d d �| _tj| �S )N)�getDOMImplementationZcreateDocument�dom�weakref�proxy)r )�Domr r �
documentClassy s z0getDomBuilder.<locals>.TreeBuilder.documentClassc sR |d }|d }|d }� j � }|j|||�}| jj�|�� � tkrN| j|_d S )Nr �publicId�systemId)rD ZcreateDocumentTypeZdocumentr/ r rE r )r �tokenr rJ rK ZdomimplZdoctype)rH r? r r �
insertDoctype} s z0getDomBuilder.<locals>.TreeBuilder.insertDoctypeNc s6 |d kr | j d kr | jj|�}n| jj||�}� |�S )N)ZdefaultNamespacerE Z
createElementZcreateElementNS)r r rA r0 )r? r r � elementClass� s z/getDomBuilder.<locals>.TreeBuilder.elementClassc s � | j j|��S )N)rE Z
createComment)r r3 )r? r r � commentClass� s z/getDomBuilder.<locals>.TreeBuilder.commentClassc s � | j j� �S )N)rE ZcreateDocumentFragment)r )r? r r �
fragmentClass� s z0getDomBuilder.<locals>.TreeBuilder.fragmentClassc S s | j j|j� d S )N)rE r/ r )r r0 r r r r/ � s z.getDomBuilder.<locals>.TreeBuilder.appendChildc s � |�S )Nr )r r )�testSerializerr r rQ � s z1getDomBuilder.<locals>.TreeBuilder.testSerializerc S s | j S )N)rE )r r r r � getDocument� s z.getDomBuilder.<locals>.TreeBuilder.getDocumentc S s t jj| �jS )N)r � TreeBuilder� getFragmentr )r r r r rT � s z.getDomBuilder.<locals>.TreeBuilder.getFragmentc S sp |}|| kr t jj| ||� nNt| jd�rXtj| jjkrXt| jj�| j_| jjj tj� | jj
| jj |�� d S )N�_child_node_types) r rS r5 r, rE r � TEXT_NODErU r! �appendr/ r1 )r r3 r. r r r r5 � s z-getDomBuilder.<locals>.TreeBuilder.insertText)N)N)r& r' r( rI rM rN rO rP r/ rQ rR rT r5 �implementationr r )rH �DomImplementationr? rQ r r rS x s
rS c s0 | j � g � d� �fdd� ��| d� dj� �S )Nr c s$ | j tjkr�| jrj| js | jrP| jp&d}| jp0d}� jdd| | j||f � q~� jdd| | jf � n� jdd| f � �nz| j tjkr�� jd� �n`| j tjkr�� jd� �nF| j tj krވ jdd| | j
f � �n | j tj k�r� jd d| | j
f � n�t | d
��r6| j
d k �r6d tj| j
| jf }n| j}� jd d| |f � | j� �r�g }xftt| j��D ]T}| jj|�}|j}|j}|j
} | �r�d tj| |jf }n|j}|j||f� �qpW x2t|�D ]&\}}� jd
d|d ||f � �q�W |d7 }x| jD ]}
�|
|� �q W d S )N� z|%s<!DOCTYPE %s "%s" "%s">� z|%s<!DOCTYPE %s>z|%s<!DOCTYPE >z #documentz#document-fragmentz|%s<!-- %s -->z|%s"%s"r+ z%s %sz|%s<%s>z
|%s%s="%s"r
)ZnodeTyper ZDOCUMENT_TYPE_NODEr rJ rK rW Z
DOCUMENT_NODEZDOCUMENT_FRAGMENT_NODEZ COMMENT_NODEZ nodeValuerV r, r+ r �prefixesr* Z
hasAttributes�ranger r �itemr Z localName�sortedr8 ) r �indentrJ rK r r �ir r �nsr9 )�rv�serializeElementr r rd � sN
" z?getDomBuilder.<locals>.testSerializer.<locals>.serializeElement�
)r )Z normalize�join)r r )rc rd r rQ � s
.
z%getDomBuilder.<locals>.testSerializer)r r r rS �locals)rY rS r )r) rH rY r? rQ r �
getDomBuilder s $C :6rh )Z
__future__r r r � collectionsr Zxml.domr r rF rZ r r r Z_utilsr
rh Z getDomModuler r r r �<module> s _ pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.pyc 0000644 00000026777 14751155150 0021172 0 ustar 00 3
���e�1 � @ s� d dl mZmZmZ d dlmZ d dlZddlmZ ddlm Z ddlm
Z
dd l
m Z dd
l m
Z
ejd �Zdd
d�Ze
e�ZdS )� )�absolute_import�division�unicode_literals)� text_typeN� )�base� )� _ihatexml)� constants)�
namespaces)�moduleFactoryFactoryz
{([^}]*)}(.*)Fc s� ���j d�j�G �fdd�dtj��G �fdd�d��� G �fdd�d���G �fdd �d ���G �fd
d �d ����fd d
�� ��fdd�}G � ������� fdd�dtj�}t� S )NZasdc s� e Zd Zd$� fdd� Zdd� Zdd� Zdd � Zeee�Zd
d � Z d d
� Z
ee
e �Z dd� Z dd� Z
ee e
�Zdd� Zdd� Zeee�Zdd� Zdd� Zdd� Zd d � Zd%d d �Zd d!� Zd"d#� ZdS )&z getETreeBuilder.<locals>.ElementNc s^ || _ || _� j| j||��| _|d kr:td | j f| _n| j| j f| _d | _g | _g | _ d S )N�html)
�_name�
_namespace�Element� _getETreeTag�_elementr Z nameTuple�parent� _childNodes�_flags)�self�name� namespace)� ElementTree� �/usr/lib/python3.6/etree.py�__init__ s
z)getETreeBuilder.<locals>.Element.__init__c S s |d kr|}n d||f }|S )Nz{%s}%sr )r r r Z etree_tagr r r r # s z-getETreeBuilder.<locals>.Element._getETreeTagc S s || _ | j| j | j�| j_d S )N)r r r r �tag)r r r r r �_setName* s z)getETreeBuilder.<locals>.Element._setNamec S s | j S )N)r )r r r r �_getName. s z)getETreeBuilder.<locals>.Element._getNamec S s || _ | j| j| j �| j_d S )N)r r r r r )r r r r r �
_setNamespace3 s z.getETreeBuilder.<locals>.Element._setNamespacec S s | j S )N)r )r r r r �
_getNamespace7 s z.getETreeBuilder.<locals>.Element._getNamespacec S s | j jS )N)r �attrib)r r r r �_getAttributes< s z/getETreeBuilder.<locals>.Element._getAttributesc S sp x"t | jjj� �D ]}| jj|= qW xF|j� D ]:\}}t|t�rVd|d |d f }n|}| jj||� q.W d S )Nz{%s}%sr r )�listr r" �keys�items�
isinstance�tuple�set)r �
attributes�key�valuer r r r �_setAttributes? s
z/getETreeBuilder.<locals>.Element._setAttributesc S s | j S )N)r )r r r r �_getChildNodesM s z/getETreeBuilder.<locals>.Element._getChildNodesc S s. | j d d �= g | _x|D ]}| j|� qW d S )N)r r Z insertChild)r r, �elementr r r �_setChildNodesP s
z/getETreeBuilder.<locals>.Element._setChildNodesc S s t | jjpt| j��S )z,Return true if the node has children or text)�boolr �text�len)r r r r �
hasContentX s z+getETreeBuilder.<locals>.Element.hasContentc S s$ | j j|� | jj|j� | |_d S )N)r �appendr r )r �noder r r � appendChild\ s z,getETreeBuilder.<locals>.Element.appendChildc S s, t | j�j|j�}| jj||j� | |_d S )N)r$ r �index�insertr )r r6 ZrefNoder8 r r r � insertBeforea s z-getETreeBuilder.<locals>.Element.insertBeforec S s$ | j j|� | jj|j� d |_d S )N)r �remover r )r r6 r r r � removeChildf s z,getETreeBuilder.<locals>.Element.removeChildc S s� t | j�s,| jjsd| j_| j j|7 _n�|d krb| jd jsLd| jd _| jd j|7 _nxt| j�}|j|j�}|dkr�| j|d js�d| j|d _| j|d j|7 _n | jjs�d| j_| j j|7 _d S )N� r r ���r> r> )r3 r r2 �tailr$ r8 )r �datar: Zchildrenr8 r r r �
insertTextk s"
z+getETreeBuilder.<locals>.Element.insertTextc S s8 t | �| j| j�}x | jj� D ]\}}||j|< q W |S )N)�typer r r* r& )r r/ r r, r r r � cloneNode� s z*getETreeBuilder.<locals>.Element.cloneNodec S sl |j r"|j d j j| jj7 _n0|jjs2d|j_| jjd k rR|j j| jj7 _d| j_tjj| |� d S )Nr r= r> )�
childNodesr r? r2 r �Node�reparentChildren)r Z newParentr r r rF � s z1getETreeBuilder.<locals>.Element.reparentChildren)N)N)�__name__�
__module__� __qualname__r r r r �propertyr r r! r r# r- r* r. r0 rD r4 r7 r: r< rA rC rF r )r r r r s*
r c s2 e Zd Z� fdd�Zdd� Zdd� Zeee�ZdS )z getETreeBuilder.<locals>.Commentc s" � j |�| _d | _g | _g | _d S )N)�Commentr r r r )r r@ )r r r r � s z)getETreeBuilder.<locals>.Comment.__init__c S s | j jS )N)r r2 )r r r r �_getData� s z)getETreeBuilder.<locals>.Comment._getDatac S s || j _d S )N)r r2 )r r, r r r �_setData� s z)getETreeBuilder.<locals>.Comment._setDataN)rG rH rI r rL rM rJ r@ r )r r r rK � s rK c sL e Zd Z� fdd�Zdd� Zdd� Zeee�Zdd� Zd d
� Z eee �Z
d S ) z%getETreeBuilder.<locals>.DocumentTypec s$ � j | d� || j_|| _|| _d S )Nz
<!DOCTYPE>)r r r2 �publicId�systemId)r r rN rO )r r r r � s z.getETreeBuilder.<locals>.DocumentType.__init__c S s | j jdd�S )NrN r= )r �get)r r r r � _getPublicId� s z2getETreeBuilder.<locals>.DocumentType._getPublicIdc S s |d k r| j jd|� d S )NrN )r r) )r r, r r r � _setPublicId� s z2getETreeBuilder.<locals>.DocumentType._setPublicIdc S s | j jdd�S )NrO r= )r rP )r r r r � _getSystemId� s z2getETreeBuilder.<locals>.DocumentType._getSystemIdc S s |d k r| j jd|� d S )NrO )r r) )r r, r r r � _setSystemId� s z2getETreeBuilder.<locals>.DocumentType._setSystemIdN) rG rH rI r rQ rR rJ rN rS rT rO r )r r r � DocumentType� s
rU c s e Zd Z� fdd�ZdS )z!getETreeBuilder.<locals>.Documentc s � j | d� d S )N�
DOCUMENT_ROOT)r )r )r r r r � s z*getETreeBuilder.<locals>.Document.__init__N)rG rH rI r r )r r r �Document� s rW c s e Zd Z� fdd�ZdS )z)getETreeBuilder.<locals>.DocumentFragmentc s � j | d� d S )NZDOCUMENT_FRAGMENT)r )r )r r r r � s z2getETreeBuilder.<locals>.DocumentFragment.__init__N)rG rH rI r r )r r r �DocumentFragment� s rX c s* g � d�� �fdd� ��| d� dj � �S )Nr c s� t | d�s| j� } | jdkrz| jd�s0| jd�rd| jd�p<d}| jd�pJd}�jd| j||f � n�jd| jf � �n�| jdkr�jd � | jd k r��jd
d |d | jf � | jd k r�td
��t | d�r�t| j �r�td���np| j� k�r�jdd | | jf � �nHt
| jt ��s4t dt
| j�| jf ��tj| j�}|d k�rR| j}n"|j� \}}tj| }d||f }�jdd | |f � t | d��r2g }xb| j j� D ]T\}} tj|�}|d k �r�|j� \}}tj| }d||f }
n|}
|j|
| f� �q�W x2t|�D ]&\}} �jdd |d || f � �qW | j�rV�jd
d |d | jf � |d 7 }x| D ]} �| |� �qdW | j�r��jd
d |d | jf � d S )Nr z
<!DOCTYPE>rN rO r= z<!DOCTYPE %s "%s" "%s">z
<!DOCTYPE %s>rV z #documentz|%s"%s"� r z Document node cannot have tailr" z$Document node cannot have attributesz|%s<!-- %s -->z Expected unicode, got %s, %sz%s %sz|%s<%s>z
|%s%s="%s")�hasattr�getrootr rP r5 r2 r? � TypeErrorr3 r" r' r �AssertionErrorrB �
tag_regexp�match�groupsr
�prefixesr& �sorted) r/ �indentrN rO Znsmatchr �ns�prefixr* r, Z attr_string�child)�ElementTreeCommentType�rv�serializeElementr r ri � s^
"
zAgetETreeBuilder.<locals>.testSerializer.<locals>.serializeElement�
)r )�join)r/ )rg )rh ri r �testSerializer� s 7
z'getETreeBuilder.<locals>.testSerializerc s2 g �t j� � ��� ��fdd���| � dj��S )z4Serialize an element and its child nodes to a stringc s� t | � j�r| j� } | jdkr|| jd�s2| jd�rf| jd�p>d}| jd�pLd}�jd| j||f � n�jd| jf � �n| jdkr�| jd k r��j| j� | jd k r�td��t | d �r�t
| j �r�td
��x�| D ] }�|� q�W n�| j�k�r�jd | jf � n�| j �s$�jd �j | j�f � n2d
j
�fdd�| j j� D ��}�jd| j|f � | j�rj�j| j� x| D ]}�|� �qpW �jd| jf � | j�r��j| j� d S )Nz
<!DOCTYPE>rN rO r= z <!DOCTYPE %s PUBLIC "%s" "%s">z
<!DOCTYPE %s>rV z Document node cannot have tailr" z$Document node cannot have attributesz <!--%s-->z<%s>rY c s" g | ]\}}d � j |�|f �qS )z%s="%s")� fromXmlName)�.0r r, )�filterr r �
<listcomp>& s zOgetETreeBuilder.<locals>.tostring.<locals>.serializeElement.<locals>.<listcomp>z<%s %s>z</%s>)r' r r[ r rP r5 r2 r? r\ rZ r3 r" rm rk r& )r/ rN rO rf �attr)r rg ro rh ri r r ri s@
z;getETreeBuilder.<locals>.tostring.<locals>.serializeElementr= )r Z
InfosetFilterrk )r/ )r rg )ro rh ri r �tostring s
-z!getETreeBuilder.<locals>.tostringc sD e Zd Z�Z�Z�Z� Z�Z�Z�fdd�Z �fdd�Z
dd� Z dS )z$getETreeBuilder.<locals>.TreeBuilderc s � |�S )Nr )r r/ )rl r r rl A s z3getETreeBuilder.<locals>.TreeBuilder.testSerializerc s< � r | j jS | jd k r*| j jjd| j �S | j jjd�S d S )Nz{%s}htmlr
)Zdocumentr ZdefaultNamespace�find)r )�fullTreer r � getDocumentD s
z0getETreeBuilder.<locals>.TreeBuilder.getDocumentc S s t jj| �jS )N)r � TreeBuilder� getFragmentr )r r r r rw N s z0getETreeBuilder.<locals>.TreeBuilder.getFragmentN) rG rH rI Z
documentClassZ doctypeClassZ elementClassZ commentClassZ
fragmentClass�implementationrl ru rw r )rK rW rX rU r �ElementTreeImplementationrt rl r r rv 9 s
rv )rK r r rE rv �locals)ry rt rr rv r )
rK rW rX rU r r rg ry rt rl r �getETreeBuilder s ~ >6$r{ )F)Z
__future__r r r Zpip._vendor.sixr �rer= r r r
r Z_utilsr �compiler^ r{ ZgetETreeModuler r r r �<module> s
E pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.opt-1.pyc 0000644 00000026630 14751155150 0022115 0 ustar 00 3
���e�1 � @ s� d dl mZmZmZ d dlmZ d dlZddlmZ ddlm Z ddlm
Z
dd l
m Z dd
l m
Z
ejd �Zdd
d�Ze
e�ZdS )� )�absolute_import�division�unicode_literals)� text_typeN� )�base� )� _ihatexml)� constants)�
namespaces)�moduleFactoryFactoryz
{([^}]*)}(.*)Fc s� ���j d�j�G �fdd�dtj��G �fdd�d��� G �fdd�d���G �fdd �d ���G �fd
d �d ����fd d
�� ��fdd�}G � ������� fdd�dtj�}t� S )NZasdc s� e Zd Zd$� fdd� Zdd� Zdd� Zdd � Zeee�Zd
d � Z d d
� Z
ee
e �Z dd� Z dd� Z
ee e
�Zdd� Zdd� Zeee�Zdd� Zdd� Zdd� Zd d � Zd%d d �Zd d!� Zd"d#� ZdS )&z getETreeBuilder.<locals>.ElementNc s^ || _ || _� j| j||��| _|d kr:td | j f| _n| j| j f| _d | _g | _g | _ d S )N�html)
�_name�
_namespace�Element� _getETreeTag�_elementr Z nameTuple�parent� _childNodes�_flags)�self�name� namespace)� ElementTree� �/usr/lib/python3.6/etree.py�__init__ s
z)getETreeBuilder.<locals>.Element.__init__c S s |d kr|}n d||f }|S )Nz{%s}%sr )r r r Z etree_tagr r r r # s z-getETreeBuilder.<locals>.Element._getETreeTagc S s || _ | j| j | j�| j_d S )N)r r r r �tag)r r r r r �_setName* s z)getETreeBuilder.<locals>.Element._setNamec S s | j S )N)r )r r r r �_getName. s z)getETreeBuilder.<locals>.Element._getNamec S s || _ | j| j| j �| j_d S )N)r r r r r )r r r r r �
_setNamespace3 s z.getETreeBuilder.<locals>.Element._setNamespacec S s | j S )N)r )r r r r �
_getNamespace7 s z.getETreeBuilder.<locals>.Element._getNamespacec S s | j jS )N)r �attrib)r r r r �_getAttributes< s z/getETreeBuilder.<locals>.Element._getAttributesc S sp x"t | jjj� �D ]}| jj|= qW xF|j� D ]:\}}t|t�rVd|d |d f }n|}| jj||� q.W d S )Nz{%s}%sr r )�listr r" �keys�items�
isinstance�tuple�set)r �
attributes�key�valuer r r r �_setAttributes? s
z/getETreeBuilder.<locals>.Element._setAttributesc S s | j S )N)r )r r r r �_getChildNodesM s z/getETreeBuilder.<locals>.Element._getChildNodesc S s. | j d d �= g | _x|D ]}| j|� qW d S )N)r r Z insertChild)r r, �elementr r r �_setChildNodesP s
z/getETreeBuilder.<locals>.Element._setChildNodesc S s t | jjpt| j��S )z,Return true if the node has children or text)�boolr �text�len)r r r r �
hasContentX s z+getETreeBuilder.<locals>.Element.hasContentc S s$ | j j|� | jj|j� | |_d S )N)r �appendr r )r �noder r r � appendChild\ s z,getETreeBuilder.<locals>.Element.appendChildc S s, t | j�j|j�}| jj||j� | |_d S )N)r$ r �index�insertr )r r6 ZrefNoder8 r r r � insertBeforea s z-getETreeBuilder.<locals>.Element.insertBeforec S s$ | j j|� | jj|j� d |_d S )N)r �remover r )r r6 r r r � removeChildf s z,getETreeBuilder.<locals>.Element.removeChildc S s� t | j�s,| jjsd| j_| j j|7 _n�|d krb| jd jsLd| jd _| jd j|7 _nxt| j�}|j|j�}|dkr�| j|d js�d| j|d _| j|d j|7 _n | jjs�d| j_| j j|7 _d S )N� r r ���r> r> )r3 r r2 �tailr$ r8 )r �datar: Zchildrenr8 r r r �
insertTextk s"
z+getETreeBuilder.<locals>.Element.insertTextc S s8 t | �| j| j�}x | jj� D ]\}}||j|< q W |S )N)�typer r r* r& )r r/ r r, r r r � cloneNode� s z*getETreeBuilder.<locals>.Element.cloneNodec S sl |j r"|j d j j| jj7 _n0|jjs2d|j_| jjd k rR|j j| jj7 _d| j_tjj| |� d S )Nr r= r> )�
childNodesr r? r2 r �Node�reparentChildren)r Z newParentr r r rF � s z1getETreeBuilder.<locals>.Element.reparentChildren)N)N)�__name__�
__module__� __qualname__r r r r �propertyr r r! r r# r- r* r. r0 rD r4 r7 r: r< rA rC rF r )r r r r s*
r c s2 e Zd Z� fdd�Zdd� Zdd� Zeee�ZdS )z getETreeBuilder.<locals>.Commentc s" � j |�| _d | _g | _g | _d S )N)�Commentr r r r )r r@ )r r r r � s z)getETreeBuilder.<locals>.Comment.__init__c S s | j jS )N)r r2 )r r r r �_getData� s z)getETreeBuilder.<locals>.Comment._getDatac S s || j _d S )N)r r2 )r r, r r r �_setData� s z)getETreeBuilder.<locals>.Comment._setDataN)rG rH rI r rL rM rJ r@ r )r r r rK � s rK c sL e Zd Z� fdd�Zdd� Zdd� Zeee�Zdd� Zd d
� Z eee �Z
d S ) z%getETreeBuilder.<locals>.DocumentTypec s$ � j | d� || j_|| _|| _d S )Nz
<!DOCTYPE>)r r r2 �publicId�systemId)r r rN rO )r r r r � s z.getETreeBuilder.<locals>.DocumentType.__init__c S s | j jdd�S )NrN r= )r �get)r r r r � _getPublicId� s z2getETreeBuilder.<locals>.DocumentType._getPublicIdc S s |d k r| j jd|� d S )NrN )r r) )r r, r r r � _setPublicId� s z2getETreeBuilder.<locals>.DocumentType._setPublicIdc S s | j jdd�S )NrO r= )r rP )r r r r � _getSystemId� s z2getETreeBuilder.<locals>.DocumentType._getSystemIdc S s |d k r| j jd|� d S )NrO )r r) )r r, r r r � _setSystemId� s z2getETreeBuilder.<locals>.DocumentType._setSystemIdN) rG rH rI r rQ rR rJ rN rS rT rO r )r r r � DocumentType� s
rU c s e Zd Z� fdd�ZdS )z!getETreeBuilder.<locals>.Documentc s � j | d� d S )N�
DOCUMENT_ROOT)r )r )r r r r � s z*getETreeBuilder.<locals>.Document.__init__N)rG rH rI r r )r r r �Document� s rW c s e Zd Z� fdd�ZdS )z)getETreeBuilder.<locals>.DocumentFragmentc s � j | d� d S )NZDOCUMENT_FRAGMENT)r )r )r r r r � s z2getETreeBuilder.<locals>.DocumentFragment.__init__N)rG rH rI r r )r r r �DocumentFragment� s rX c s* g � d�� �fdd� ��| d� dj � �S )Nr c sz t | d�s| j� } | jdkrz| jd�s0| jd�rd| jd�p<d}| jd�pJd}�jd| j||f � n�jd| jf � �n�| jdkr�jd � | jd k r��jd
d |d | jf � | jd k r�td
��t | d�r�t| j �r�td���nJ| j� k�r�jdd | | jf � �n"t
j | j�}|d k�r,| j}n"|j � \}}t
j| }d||f }�jdd | |f � t | d��r g }xb| j j� D ]T\}} t
j |�}|d k �r�|j � \}}t
j| }d||f }
n|}
|j|
| f� �q�W x2t|�D ]&\}} �jdd |d || f � �q�W | j�r0�jd
d |d | jf � |d 7 }x| D ]} �| |� �q>W | j�rv�jd
d |d | jf � d S )Nr z
<!DOCTYPE>rN rO r= z<!DOCTYPE %s "%s" "%s">z
<!DOCTYPE %s>rV z #documentz|%s"%s"� r z Document node cannot have tailr" z$Document node cannot have attributesz|%s<!-- %s -->z%s %sz|%s<%s>z
|%s%s="%s")�hasattr�getrootr rP r5 r2 r? � TypeErrorr3 r" �
tag_regexp�match�groupsr
�prefixesr& �sorted) r/ �indentrN rO Znsmatchr �ns�prefixr* r, Z attr_string�child)�ElementTreeCommentType�rv�serializeElementr r rh � sZ
"
zAgetETreeBuilder.<locals>.testSerializer.<locals>.serializeElement�
)r )�join)r/ )rf )rg rh r �testSerializer� s 7
z'getETreeBuilder.<locals>.testSerializerc s2 g �t j� � ��� ��fdd���| � dj��S )z4Serialize an element and its child nodes to a stringc s� t | � j�r| j� } | jdkr|| jd�s2| jd�rf| jd�p>d}| jd�pLd}�jd| j||f � n�jd| jf � �n| jdkr�| jd k r��j| j� | jd k r�td��t | d �r�t
| j �r�td
��x�| D ] }�|� q�W n�| j�k�r�jd | jf � n�| j �s$�jd �j | j�f � n2d
j
�fdd�| j j� D ��}�jd| j|f � | j�rj�j| j� x| D ]}�|� �qpW �jd| jf � | j�r��j| j� d S )Nz
<!DOCTYPE>rN rO r= z <!DOCTYPE %s PUBLIC "%s" "%s">z
<!DOCTYPE %s>rV z Document node cannot have tailr" z$Document node cannot have attributesz <!--%s-->z<%s>rY c s" g | ]\}}d � j |�|f �qS )z%s="%s")� fromXmlName)�.0r r, )�filterr r �
<listcomp>& s zOgetETreeBuilder.<locals>.tostring.<locals>.serializeElement.<locals>.<listcomp>z<%s %s>z</%s>)r' r r[ r rP r5 r2 r? r\ rZ r3 r" rl rj r& )r/ rN rO re �attr)r rf rn rg rh r r rh s@
z;getETreeBuilder.<locals>.tostring.<locals>.serializeElementr= )r Z
InfosetFilterrj )r/ )r rf )rn rg rh r �tostring s
-z!getETreeBuilder.<locals>.tostringc sD e Zd Z�Z�Z�Z� Z�Z�Z�fdd�Z �fdd�Z
dd� Z dS )z$getETreeBuilder.<locals>.TreeBuilderc s � |�S )Nr )r r/ )rk r r rk A s z3getETreeBuilder.<locals>.TreeBuilder.testSerializerc s< � r | j jS | jd k r*| j jjd| j �S | j jjd�S d S )Nz{%s}htmlr
)Zdocumentr ZdefaultNamespace�find)r )�fullTreer r � getDocumentD s
z0getETreeBuilder.<locals>.TreeBuilder.getDocumentc S s t jj| �jS )N)r � TreeBuilder� getFragmentr )r r r r rv N s z0getETreeBuilder.<locals>.TreeBuilder.getFragmentN) rG rH rI Z
documentClassZ doctypeClassZ elementClassZ commentClassZ
fragmentClass�implementationrk rt rv r )rK rW rX rU r �ElementTreeImplementationrs rk r r ru 9 s
ru )rK r r rE ru �locals)rx rs rq ru r )
rK rW rX rU r r rf rx rs rk r �getETreeBuilder s ~ >6$rz )F)Z
__future__r r r Zpip._vendor.sixr �rer= r r r
r Z_utilsr �compiler] rz ZgetETreeModuler r r r �<module> s
E pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.opt-1.pyc 0000644 00000021735 14751155150 0021571 0 ustar 00 3
���e�" � @ s| d dl mZmZmZ d dlmZ d dlmZmZ d dl Z ddl
m Z ddl
m Z dd l m
Z
dd
lmZ d d � Zee�ZdS )
� )�absolute_import�division�unicode_literals)�MutableMapping)�minidom�NodeN� )�base� )� constants)�
namespaces)�moduleFactoryFactoryc sV ��G dd� dt �� G � �fdd�dtj��G ����fdd�dtj�}dd� �t� S ) Nc @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z getDomBuilder.<locals>.AttrListc S s
|| _ d S )N)�element)�selfr � r �/usr/lib/python3.6/dom.py�__init__ s z(getDomBuilder.<locals>.AttrList.__init__c S s t | jjj� �S )N)�iterr �
attributes�keys)r r r r �__iter__ s z(getDomBuilder.<locals>.AttrList.__iter__c S s4 t |t�rt�n | jjj|�}||_|| jj|< d S )N)�
isinstance�tuple�NotImplementedErrorr �
ownerDocumentZcreateAttribute�valuer )r �namer �attrr r r � __setitem__ s
z+getDomBuilder.<locals>.AttrList.__setitem__c S s t | jj�S )N)�lenr r )r r r r �__len__ s z'getDomBuilder.<locals>.AttrList.__len__c S s t | jjj� �S )N)�listr r �items)r r r r r" # s z%getDomBuilder.<locals>.AttrList.itemsc S s t | jjj� �S )N)r! r r �values)r r r r r# & s z&getDomBuilder.<locals>.AttrList.valuesc S s" t |t�rt�n| jj| jS d S )N)r r r r r r )r r r r r � __getitem__) s
z+getDomBuilder.<locals>.AttrList.__getitem__c S s t |t�rt�n
| jj|= d S )N)r r r r r )r r r r r � __delitem__/ s
z+getDomBuilder.<locals>.AttrList.__delitem__N) �__name__�
__module__� __qualname__r r r r r" r# r$ r% r r r r �AttrList s r) c s� e Zd Zdd� Zedd� �Zdd� Zddd �Zd
d � Zd d
� Z dd� Z
� fdd�Z dd� Z ee e �Z
�fdd�Zdd� Zdd� Zee�ZdS )z"getDomBuilder.<locals>.NodeBuilderc S s t jj| |j� || _d S )N)r r r �nodeNamer )r r r r r r 6 s z+getDomBuilder.<locals>.NodeBuilder.__init__c S s t | jd�r| jjpd S )N� namespaceURI)�hasattrr r+ )r r r r �<lambda>: s z+getDomBuilder.<locals>.NodeBuilder.<lambda>c S s | |_ | jj|j� d S )N)�parentr � appendChild)r �noder r r r/ = s z.getDomBuilder.<locals>.NodeBuilder.appendChildNc S s4 | j jj|�}|r$| j j||j � n | j j|� d S )N)r r �createTextNode� insertBeforer/ )r �datar2 �textr r r �
insertTextA s z-getDomBuilder.<locals>.NodeBuilder.insertTextc S s | j j|j |j � | |_d S )N)r r2 r. )r r0 ZrefNoder r r r2 H s z/getDomBuilder.<locals>.NodeBuilder.insertBeforec S s& |j j| j kr | j j|j � d |_d S )N)r Z
parentNode� removeChildr. )r r0 r r r r6 L s z.getDomBuilder.<locals>.NodeBuilder.removeChildc S s: x.| j j� r.| j j}| j j|� |j j|� qW g | _d S )N)r �
hasChildNodesZ
firstChildr6 r/ �
childNodes)r Z newParent�childr r r �reparentChildrenQ s
z3getDomBuilder.<locals>.NodeBuilder.reparentChildrenc s
� | j �S )N)r )r )r) r r �
getAttributesX s z0getDomBuilder.<locals>.NodeBuilder.getAttributesc S sz |rvxpt |j� �D ]`\}}t|t�rd|d d k rF|d d |d }n|d }| jj|d ||� q| jj||� qW d S )Nr �:r r
)r! r" r r r ZsetAttributeNSZ setAttribute)r r r r Z
qualifiedNamer r r �
setAttributes[ s
z0getDomBuilder.<locals>.NodeBuilder.setAttributesc s � | j jd��S )NF)r � cloneNode)r )� NodeBuilderr r r> j s z,getDomBuilder.<locals>.NodeBuilder.cloneNodec S s
| j j� S )N)r r7 )r r r r �
hasContentm s z-getDomBuilder.<locals>.NodeBuilder.hasContentc S s( | j d krtd | jfS | j | jfS d S )NZhtml)� namespacer r )r r r r � getNameTuplep s
z/getDomBuilder.<locals>.NodeBuilder.getNameTuple)N)r& r' r( r �propertyrA r/ r5 r2 r6 r: r; r= r r> r@ rB Z nameTupler )r) r? r r r? 5 s
r? c s� e Zd Z� fdd�Z� �fdd�Zd�fdd� Z�fdd �Z�fd
d �Zd d
� Z�fdd�Z dd� Z
dd� Z ddd�Z �Z
dZdS )z"getDomBuilder.<locals>.TreeBuilderc s � j � jd d d �| _tj| �S )N)�getDOMImplementationZcreateDocument�dom�weakref�proxy)r )�Domr r �
documentClassy s z0getDomBuilder.<locals>.TreeBuilder.documentClassc sR |d }|d }|d }� j � }|j|||�}| jj�|�� � tkrN| j|_d S )Nr �publicId�systemId)rD ZcreateDocumentTypeZdocumentr/ r rE r )r �tokenr rJ rK ZdomimplZdoctype)rH r? r r �
insertDoctype} s z0getDomBuilder.<locals>.TreeBuilder.insertDoctypeNc s6 |d kr | j d kr | jj|�}n| jj||�}� |�S )N)ZdefaultNamespacerE Z
createElementZcreateElementNS)r r rA r0 )r? r r � elementClass� s z/getDomBuilder.<locals>.TreeBuilder.elementClassc s � | j j|��S )N)rE Z
createComment)r r3 )r? r r � commentClass� s z/getDomBuilder.<locals>.TreeBuilder.commentClassc s � | j j� �S )N)rE ZcreateDocumentFragment)r )r? r r �
fragmentClass� s z0getDomBuilder.<locals>.TreeBuilder.fragmentClassc S s | j j|j� d S )N)rE r/ r )r r0 r r r r/ � s z.getDomBuilder.<locals>.TreeBuilder.appendChildc s � |�S )Nr )r r )�testSerializerr r rQ � s z1getDomBuilder.<locals>.TreeBuilder.testSerializerc S s | j S )N)rE )r r r r � getDocument� s z.getDomBuilder.<locals>.TreeBuilder.getDocumentc S s t jj| �jS )N)r � TreeBuilder� getFragmentr )r r r r rT � s z.getDomBuilder.<locals>.TreeBuilder.getFragmentc S sp |}|| kr t jj| ||� nNt| jd�rXtj| jjkrXt| jj�| j_| jjj tj� | jj
| jj |�� d S )N�_child_node_types) r rS r5 r, rE r � TEXT_NODErU r! �appendr/ r1 )r r3 r. r r r r5 � s z-getDomBuilder.<locals>.TreeBuilder.insertText)N)N)r& r' r( rI rM rN rO rP r/ rQ rR rT r5 �implementationr r )rH �DomImplementationr? rQ r r rS x s
rS c s0 | j � g � d� �fdd� ��| d� dj� �S )Nr c s$ | j tjkr�| jrj| js | jrP| jp&d}| jp0d}� jdd| | j||f � q~� jdd| | jf � n� jdd| f � �nz| j tjkr�� jd� �n`| j tjkr�� jd� �nF| j tj krވ jdd| | j
f � �n | j tj k�r� jd d| | j
f � n�t | d
��r6| j
d k �r6d tj| j
| jf }n| j}� jd d| |f � | j� �r�g }xftt| j��D ]T}| jj|�}|j}|j}|j
} | �r�d tj| |jf }n|j}|j||f� �qpW x2t|�D ]&\}}� jd
d|d ||f � �q�W |d7 }x| jD ]}
�|
|� �q W d S )N� z|%s<!DOCTYPE %s "%s" "%s">� z|%s<!DOCTYPE %s>z|%s<!DOCTYPE >z #documentz#document-fragmentz|%s<!-- %s -->z|%s"%s"r+ z%s %sz|%s<%s>z
|%s%s="%s"r
)ZnodeTyper ZDOCUMENT_TYPE_NODEr rJ rK rW Z
DOCUMENT_NODEZDOCUMENT_FRAGMENT_NODEZ COMMENT_NODEZ nodeValuerV r, r+ r �prefixesr* Z
hasAttributes�ranger r �itemr Z localName�sortedr8 ) r �indentrJ rK r r �ir r �nsr9 )�rv�serializeElementr r rd � sN
" z?getDomBuilder.<locals>.testSerializer.<locals>.serializeElement�
)r )Z normalize�join)r r )rc rd r rQ � s
.
z%getDomBuilder.<locals>.testSerializer)r r r rS �locals)rY rS r )r) rH rY r? rQ r �
getDomBuilder s $C :6rh )Z
__future__r r r � collectionsr Zxml.domr r rF rZ r r r Z_utilsr
rh Z getDomModuler r r r �<module> s _ pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.pyc 0000644 00000026717 14751155150 0022220 0 ustar 00 3
���eQ7 � @ s� d Z ddlmZmZmZ ddlZddlZddlZddlm Z ddl
m Z ddlm
Z
dd lm Z
dd
lmZ ddlj Z d Zejd �Ze jd
�jZG dd� de�ZG dd� de�Zdd� Zdd� ZG dd� de j�ZdS )a� Module for supporting the lxml.etree library. The idea here is to use as much
of the native library as possible, without using fragile hacks like custom element
names that break between releases. The downside of this is that we cannot represent
all possible trees; specifically the following are known to cause problems:
Text or comments as siblings of the root element
Docypes with no name
When any of these things occur, we emit a DataLossWarning
� )�absolute_import�division�unicode_literalsN� )�base� )�DataLossWarning)� constants)�etree)� _ihatexmlTz
{([^}]*)}(.*)Zasdc @ s e Zd Zdd� ZdS )� DocumentTypec C s || _ || _|| _d S )N)�name�publicId�systemId)�selfr
r r � r � /usr/lib/python3.6/etree_lxml.py�__init__# s zDocumentType.__init__N)�__name__�
__module__� __qualname__r r r r r r " s r c @ s, e Zd Zdd� Zdd� Zdd� Zee�ZdS )�Documentc C s d | _ g | _d S )N)� _elementTree� _childNodes)r r r r r * s zDocument.__init__c C s | j j� j|j� d S )N)r �getrootZaddnext�_element)r �elementr r r � appendChild. s zDocument.appendChildc C s | j S )N)r )r r r r �_getChildNodes1 s zDocument._getChildNodesN)r r r r r r �propertyZ
childNodesr r r r r ) s r c s6 g �t jdd�� d� ��fdd� ��| d� dj��S )NT)�preventDoubleDashCommentsr c
sD t | d��s8t | d�rjd� | jjrz| jjp6| jjsFd| jj }nd| jj| jj| jjf }�jdd|d |f � | j� }x|j� d k r�|j� }q�W x�|d k r��||d � |j � }q�W nrt
| t �s�t
| t ��r t
| t �s�t
jd dks�t��jd
d| | f � n(�jd � x | D ]}�||d � �q W �n| jtk�r��jd d| | jf � t | d
��r@| j�r@�jd
d| | jf � �n�t
| tj��s�t�tjj| j�}|d k �r�|jd�}|jd�}tj| }�jdd| |� j |�f � n �jdd| � j | j�f � t | d��r�g }xr| j j � D ]d\} }
tj| �}|d k �rx|j � \}} � j | �} tj| }d|| f } n
� j | �} |j| |
f� �q.W x2t |�D ]&\} }
�jdd|d | |
f � �q�W | j�r�jd
d|d | jf � |d7 }x| D ]} �| |� �q�W t | d
��r@| j�r@�jd
d|d | jf � d S )N�tagr z #documentz
<!DOCTYPE %s>z<!DOCTYPE %s "%s" "%s">z|%s%s� r r z|%s"%s"z#document-fragmentz|%s<!-- %s -->�tailr z
|%s<%s %s>z|%s<%s>�attribz%s %sz
|%s%s="%s")!�hasattr�append�docinfo� internalDTDZ public_idZ
system_url� root_namer Z getpreviousZgetnext�
isinstance�str�bytes�sys� version_info�AssertionErrorr! � comment_type�textr# r
Z_Element�etree_builders�
tag_regexp�match�groupr �prefixes� fromXmlNamer$ �items�groups�sorted)
r �indent�dtd_strZ next_elementZnsmatch�nsr! �prefix�
attributesr
�valueZ attr_string�child)�
infosetFilter�rv�serializeElementr r rD ; st
"
z(testSerializer.<locals>.serializeElement�
)r )r �
InfosetFilter�join)r r )rB rC rD r �testSerializer7 s
F
rH c s$ g � � �fdd���| � dj � �S )z4Serialize an element and its child nodes to a stringc s
t | d�sH| jjr:| jjr$| jj}n d| jj }� j|� �| j� � n�| jtkrf� jd| j f � n�| j
s�� jd| jf � n.dj dd� | j
j � D ��}� jd| j|f � | j r�� j| j � x| D ] }�|� q�W � jd | jf � t | d
�o�| j
�r� j| j
� d S ) Nr! z
<!DOCTYPE %s>z <!--%s-->z<%s>r" c S s g | ]\}}d ||f �qS )z%s="%s"r )�.0r
r@ r r r �
<listcomp>� s z6tostring.<locals>.serializeElement.<locals>.<listcomp>z<%s %s>z</%s>r# )r% r' r( �doctyper) r& r r! r0 r1 r$ rG r8 r# )r r< �attrrA )rC rD r r rD � s*
z"tostring.<locals>.serializeElement� )rG )r r )rC rD r �tostring� s rN c sz e Zd ZeZeZdZdZeZ e
Z ddd�Z dd� Z
dd� Zd d
� Zd d � Zd
d� Zddd�Zd� fdd� Zdd� Z� ZS )� TreeBuilderNFc s� t jt|d��tjdd� �| _|| _G �fdd�dt�� G � ��fdd�d�j�}G ��fdd �d �j �}|| _
|| _ t j
j| |� d S )
N)�fullTreeT)r c s& e Zd Zd� fdd� Z� fdd�ZdS )z(TreeBuilder.__init__.<locals>.AttributesNc sv |d kr i }|| _ tj| |� xR| j� D ]F\}}t|t�rVd|d � j|d �f }n
� j|�}|| j j j|< q(W d S )Nz{%s}%sr r )r �dictr r8 r* �tuple�coerceAttributer$ )r r r@ �keyr
)rB r r r � s
z1TreeBuilder.__init__.<locals>.Attributes.__init__c sP t j| ||� t|t�r4d|d � j|d �f }n
� j|�}|| jjj|< d S )Nz{%s}%sr r )rQ � __setitem__r* rR rS r r$ )r rT r@ r
)rB r r rU � s
z4TreeBuilder.__init__.<locals>.Attributes.__setitem__)N)r r r r rU r )rB r r �
Attributes� s rV c sx e Zd Z� ��fdd�Z�fdd�Z�fdd�Zeee�Zdd� Z� fd d
�Z eee �Z
d��fd d
� Z �fdd�Z d S )z%TreeBuilder.__init__.<locals>.Elementc s* �j |�}�jj| ||d� � | �| _d S )N)� namespace)�
coerceElement�Elementr � _attributes)r r
rW )rV �builderrB r r r � s
z.TreeBuilder.__init__.<locals>.Element.__init__c s$ � j |�| _| j| j| j�| j_d S )N)rX �_nameZ _getETreeTagZ
_namespacer r! )r r
)rB r r �_setName� s z.TreeBuilder.__init__.<locals>.Element._setNamec s � j | j�S )N)r7 r\ )r )rB r r �_getName� s z.TreeBuilder.__init__.<locals>.Element._getNamec S s | j S )N)rZ )r r r r �_getAttributes� s z4TreeBuilder.__init__.<locals>.Element._getAttributesc s � | |�| _ d S )N)rZ )r r? )rV r r �_setAttributes� s z4TreeBuilder.__init__.<locals>.Element._setAttributesNc s �j |�}� jj| ||� d S )N)ZcoerceCharactersrY �
insertText)r �dataZ insertBefore)r[ rB r r ra � s
z0TreeBuilder.__init__.<locals>.Element.insertTextc s � j j| |� d S )N)rY r )r rA )r[ r r r � s z1TreeBuilder.__init__.<locals>.Element.appendChild)N)
r r r r r] r^ r r
r_ r` r? ra r r )rV r[ rB r r rY � s
rY c s8 e Zd Z� �fdd�Z�fdd�Zdd� Zeee�ZdS )z%TreeBuilder.__init__.<locals>.Commentc s �j |�}� jj| |� d S )N)�
coerceComment�Commentr )r rb )r[ rB r r r � s
z.TreeBuilder.__init__.<locals>.Comment.__init__c s � j |�}|| j_d S )N)rc r r1 )r rb )rB r r �_setData� s
z.TreeBuilder.__init__.<locals>.Comment._setDatac S s | j jS )N)r r1 )r r r r �_getData� s z.TreeBuilder.__init__.<locals>.Comment._getDataN)r r r r re rf r rb r )r[ rB r r rd � s rd )r2 ZgetETreeModuler
r rF rB �namespaceHTMLElementsrQ rY rd � elementClass� commentClassr rO r )r rg rP rY rd r )rV r[ rB r r � s zTreeBuilder.__init__c C s$ t jj| � | j| _g | _d | _d S )N)r rO �reset�insertCommentInitial�
insertComment�initial_commentsrK )r r r r rj s zTreeBuilder.resetc C s t |�S )N)rH )r r r r r rH s zTreeBuilder.testSerializerc C s t r | jjS | jjj� S d S )N)rP �documentr r )r r r r � getDocument s zTreeBuilder.getDocumentc C sF g }| j d j}|jr"|j|j� |jt|�� |jrB|j|j� |S )Nr )� openElementsr r1 r& �extend�listr# )r Zfragmentr r r r � getFragment s zTreeBuilder.getFragmentc C sh |d }|d }|d }|s0t jdt� d | _n4| jj|�}||krPt jdt� | j|||�}|| _d S )Nr
r r z#lxml cannot represent empty doctypez%lxml cannot represent non-xml doctype)�warnings�warnr rK rB rX � doctypeClass)r �tokenr
r r Z coercedNamerK r r r �
insertDoctype s zTreeBuilder.insertDoctypec C s6 |d ks|| j kst�| j jd ks&t�| jj|� d S )N)rn r/ r rm r& )r rb �parentr r r rk , s z TreeBuilder.insertCommentInitialc sB || j kr,| j jj� d jtkr,tjdt� tt | �j
||� d S )Nr z@lxml cannot represent adjacent comments beyond the root elements���) rn r r r! r0 rt ru r �superrO rl )r rb ry )� __class__r r �insertCommentMain1 s
z TreeBuilder.insertCommentMainc C s� d}| j r�| j jst�|d| j j 7 }| j jdk s>| j jdk r�|d| jj| j jpRd� 7 }| j jr�| j j}|jd�dkr�|jd�dkr�tj dt
� |j dd �}|jd�dkr�|d
| 7 }q�|d | 7 }n|d 7 }|d
7 }| j j|d kr�tj dt
� |d7 }t j
|�}x*| jD ] }| j|d �}|j|j� �qW | j� | _|j� | j_|d }|jd| j�}|dk�rn|} n d||f } | |_| j||�}
||
_| jjj|
� | j j|
� | j | _ dS )zCreate the document rootrM z <!DOCTYPE %sNz
PUBLIC "%s" �'r �"z6DOCTYPE system cannot contain single and double quotesZU00027z"%s"z'%s'z''�>r
zGlxml cannot represent doctype with a different name to the root elementz$<THIS_SHOULD_NEVER_APPEAR_PUBLICLY/>rb rW z{%s}%s) rK r
r/ r r rB Z coercePubid�findrt ru r �replacer
Z
fromstringrm ri Z addpreviousr �
documentClassrn Z getroottreer �getZdefaultNamespacer! rh r r& rp r} rl ) r rw ZdocStrZsysid�root�
comment_tokenZcommentr
rW Z etree_tagZ root_elementr r r �
insertRoot7 sL
zTreeBuilder.insertRoot)F)N)N)r r r r r� r rv rh ri Z
fragmentClassr
�implementationr rj rH ro rs rx rk r} r� �
__classcell__r r )r| r rO � s
L
rO ) �__doc__Z
__future__r r r rt �rer- rM r r r r
r2 r Z
lxml.etreerP �compiler3 rd r! r0 �objectr r rH rN rO r r r r �<module>
s$
O) pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000005742 14751155150 0022551 0 ustar 00 3
���eN
� @ s6 d Z ddlmZmZmZ ddlmZ i Zddd�ZdS ) a� A collection of modules for building different kinds of tree from
HTML documents.
To create a treebuilder for a new type of tree, you need to do
implement several things:
1) A set of classes for various types of elements: Document, Doctype,
Comment, Element. These must implement the interface of
_base.treebuilders.Node (although comment nodes have a different
signature for their constructor, see treebuilders.etree.Comment)
Textual content may also be implemented as another node type, or not, as
your tree implementation requires.
2) A treebuilder object (called TreeBuilder by convention) that
inherits from treebuilders._base.TreeBuilder. This has 4 required attributes:
documentClass - the class to use for the bottommost node of a document
elementClass - the class to use for HTML Elements
commentClass - the class to use for comments
doctypeClass - the class to use for doctypes
It also has one required method:
getDocument - Returns the root node of the complete document tree
3) If you wish to run the unit tests, you must also create a
testSerializer method on your treebuilder which accepts a node and
returns a string containing Node and its children serialized according
to the format used in the unittests
� )�absolute_import�division�unicode_literals� )�
default_etreeNc K s� | j � } | tkr�| dkrLddlm} |dkr<ddlm} |}|j|f|�jS | dkrlddlm} |jt| < n<| d kr�dd
lm } |dkr�t
}|j |f|�jS t d | ��tj
| �S ) a� Get a TreeBuilder class for various types of tree with built-in support
treeType - the name of the tree type required (case-insensitive). Supported
values are:
"dom" - A generic builder for DOM implementations, defaulting to
a xml.dom.minidom based implementation.
"etree" - A generic builder for tree implementations exposing an
ElementTree-like interface, defaulting to
xml.etree.cElementTree if available and
xml.etree.ElementTree if not.
"lxml" - A etree-based builder for lxml.etree, handling
limitations of lxml's implementation.
implementation - (Currently applies to the "etree" and "dom" tree types). A
module implementing the tree type e.g.
xml.etree.ElementTree or xml.etree.cElementTree.�dom� )r Nr )�minidomZlxml)�
etree_lxml�etree)r z Unrecognised treebuilder "%s" )�lower�treeBuilderCache� r Zxml.domr Z getDomModuleZ TreeBuilderr
r r ZgetETreeModule�
ValueError�get)ZtreeType�implementation�kwargsr r r
r � r � /usr/lib/python3.6/__init__.py�getTreeBuilder$ s$ r )N) �__doc__Z
__future__r r r Z_utilsr r
r r r r r �<module> s pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.opt-1.pyc 0000644 00000025337 14751155150 0021726 0 ustar 00 3
���ev6 � @ s� d dl mZmZmZ d dlmZ ddlmZmZm Z dZ
e e�dfe ee e d dfg�B �dfe ee e d d fe d d
fg�B �dfe e d dfe d d fg�dfe e d d fe d d
fg�dfd�Z
G dd� de�ZG dd� de�ZG dd� de�ZdS )� )�absolute_import�division�unicode_literals)� text_type� )�scopingElements�tableInsertModeElements�
namespacesNF�html�buttonZolZul�table�optgroup�optionT)Nr �listr Zselectc @ s^ e Zd Zdd� Zdd� Zdd� Zdd� Zdd
d �Zd d
� Zdd� Z dd� Z
dd� Z dd� Z d S )�Nodec C s( || _ d| _d| _i | _g | _g | _dS )a6 Node representing an item in the tree.
name - The tag name associated with the node
parent - The parent of the current node (or None for the document node)
value - The value of the current node (applies to text nodes and
comments
attributes - a dict holding name, value pairs for attributes of the node
childNodes - a list of child nodes of the current node. This must
include all elements but not necessarily other node types
_flags - A list of miscellaneous flags that can be set on the node
N)�name�parent�value�
attributes�
childNodesZ_flags)�selfr � r �/usr/lib/python3.6/base.py�__init__ s z
Node.__init__c C s: dj dd� | jj� D ��}|r,d| j|f S d| j S d S )N� c S s g | ]\}}d ||f �qS )z%s="%s"r )�.0r r r r r �
<listcomp>+ s z Node.__str__.<locals>.<listcomp>z<%s %s>z<%s>)�joinr �itemsr )r Z
attributesStrr r r �__str__* s
z Node.__str__c C s
d| j S )Nz<%s>)r )r r r r �__repr__3 s z
Node.__repr__c C s t �dS )z3Insert node as a child of the current node
N)�NotImplementedError)r �noder r r � appendChild6 s zNode.appendChildNc C s t �dS )z�Insert data as text in the current node, positioned before the
start of node insertBefore or to the end of the node's text.
N)r! )r �data� insertBeforer r r �
insertText; s zNode.insertTextc C s t �dS )z�Insert node as a child of the current node, before refNode in the
list of child nodes. Raises ValueError if refNode is not a child of
the current nodeN)r! )r r" ZrefNoder r r r% A s zNode.insertBeforec C s t �dS )z:Remove node from the children of the current node
N)r! )r r" r r r � removeChildG s zNode.removeChildc C s$ x| j D ]}|j|� qW g | _ dS )z�Move all the children of the current node to newParent.
This is needed so that trees that don't store text as nodes move the
text in the correct way
N)r r# )r Z newParentZchildr r r �reparentChildrenL s zNode.reparentChildrenc C s t �dS )z�Return a shallow copy of the current node i.e. a node with the same
name and attributes but with no parent or child nodes
N)r! )r r r r � cloneNodeV s zNode.cloneNodec C s t �dS )zFReturn true if the node has children or text, false otherwise
N)r! )r r r r �
hasContent\ s zNode.hasContent)N)
�__name__�
__module__� __qualname__r r r r# r& r% r' r( r) r* r r r r r s
r c @ s e Zd Zdd� Zdd� ZdS )�ActiveFormattingElementsc C sf d}|t krVxH| d d d� D ]6}|t kr*P | j||�r>|d7 }|dkr | j|� P q W tj| |� d S )Nr � � ���)�Marker�
nodesEqual�remover �append)r r" Z
equalCount�elementr r r r5 c s
z ActiveFormattingElements.appendc C s$ |j |j ksdS |j|jks dS dS )NFT)� nameTupler )r Znode1Znode2r r r r3 p s
z#ActiveFormattingElements.nodesEqualN)r+ r, r- r5 r3 r r r r r. b s
r. c @ s� e Zd ZdZdZdZdZdZdZdd� Z dd� Z
d+dd�Z d d
� Z d d � Z
d
d� Zdd� Zdd� Zd,dd�Zdd� Zdd� Zdd� Zeee�Zdd � Zd d � Zd-d d �Zd!d"� Zd.d#d$�Zd%d&� Z d'd(� Z d)d*� Z dS )/� TreeBuildera Base treebuilder implementation
documentClass - the class to use for the bottommost node of a document
elementClass - the class to use for HTML Elements
commentClass - the class to use for comments
doctypeClass - the class to use for doctypes
Nc C s |r d| _ nd | _ | j� d S )Nz http://www.w3.org/1999/xhtml)�defaultNamespace�reset)r ZnamespaceHTMLElementsr r r r � s zTreeBuilder.__init__c C s. g | _ t� | _d | _d | _d| _| j� | _d S )NF)� openElementsr. �activeFormattingElementsZ headPointerZ formPointer�insertFromTable�
documentClass�document)r r r r r: � s zTreeBuilder.resetc C s~ t |d�}|s$t|t�r$td |f}t| \}}xHt| j�D ]:}|rP||krPdS | rd|j|krddS ||j|kA r<dS q<W d S )Nr7 r
TF)�hasattr�
isinstancer r �listElementsMap�reversedr; r7 )r �targetZvariantZ exactNodeZ listElements�invertr" r r r �elementInScope� s
zTreeBuilder.elementInScopec C s� | j s
d S t| j �d }| j | }|tks4|| jkr8d S x6|tkrn|| jkrn|dkrZd}P |d8 }| j | }q:W xR|d7 }| j | }|j� }| jd|j|j|jd��}|| j |< || j d krrP qrW d S )Nr/ r ZStartTag)�typer � namespacer$ r1 r1 ) r< �lenr2 r; r) �
insertElementr rH r )r �i�entryZcloner6 r r r �#reconstructActiveFormattingElements� s.
z/TreeBuilder.reconstructActiveFormattingElementsc C s, | j j� }x | j r&|tkr&| j j� }q W d S )N)r< �popr2 )r rL r r r � clearActiveFormattingElements� s
z)TreeBuilder.clearActiveFormattingElementsc C s8 x2| j ddd� D ] }|tkr"P q|j|kr|S qW dS )z�Check if an element exists between the end of the active
formatting elements and the last marker. If it does, return it, else
return falseNr/ Fr1 )r< r2 r )r r �itemr r r �!elementInActiveFormattingElements� s
z-TreeBuilder.elementInActiveFormattingElementsc C s& | j |�}| jj|� | jj|� d S )N)�
createElementr; r5 r? r# )r �tokenr6 r r r �
insertRoot� s
zTreeBuilder.insertRootc C s6 |d }|d }|d }| j |||�}| jj|� d S )Nr �publicId�systemId)� doctypeClassr? r# )r rS r rU rV Zdoctyper r r �
insertDoctype s
zTreeBuilder.insertDoctypec C s* |d kr| j d }|j| j|d �� d S )Nr/ r$ r1 )r; r# � commentClass)r rS r r r r �
insertComment s
zTreeBuilder.insertCommentc C s0 |d }|j d| j�}| j||�}|d |_|S )z.Create an element but don't insert it anywherer rH r$ )�getr9 � elementClassr )r rS r rH r6 r r r rR s
zTreeBuilder.createElementc C s | j S )N)�_insertFromTable)r r r r �_getInsertFromTable s z TreeBuilder._getInsertFromTablec C s || _ |r| j| _n| j| _dS )zsSwitch the function used to insert an element from the
normal one to the misnested table one and back againN)r] �insertElementTablerJ �insertElementNormal)r r r r r �_setInsertFromTable s
z TreeBuilder._setInsertFromTablec C sL |d }|j d| j�}| j||�}|d |_| jd j|� | jj|� |S )Nr rH r$ r/ r1 )r[ r9 r\ r r; r# r5 )r rS r rH r6 r r r r` $ s
z TreeBuilder.insertElementNormalc C s` | j |�}| jd jtkr$| j|�S | j� \}}|dkrD|j|� n |j||� | jj|� |S )z-Create an element and insert it into the treer/ Nr1 ) rR r; r r r` � getTableMisnestedNodePositionr# r% r5 )r rS r6 r r% r r r r_ . s
z TreeBuilder.insertElementTablec C sX |dkr| j d }| j s0| jr<| j d jtkr<|j|� n| j� \}}|j||� dS )zInsert text data.Nr/ r1 r1 )r; r= r r r& rb )r r$ r r% r r r r& > s
zTreeBuilder.insertTextc C sv d}d}d}x(| j ddd� D ]}|jdkr |}P q W |rd|jrL|j}|}qn| j | j j|�d }n
| j d }||fS )zsGet the foster parent element, and sibling to insert before
(or None) when inserting a misnested table nodeNr/ r r r1 )r; r r �index)r Z lastTableZ fosterParentr% Zelmr r r rb M s
z)TreeBuilder.getTableMisnestedNodePositionc
C s8 | j d
j}|td �kr4||kr4| j j� | j|� d S ) Nr/ �dd�dt�lir r
�p�rp�rtr1 )rd re rf r r
rg rh ri )r; r � frozensetrN �generateImpliedEndTags)r �excluder r r r rk g s
z"TreeBuilder.generateImpliedEndTagsc C s | j S )zReturn the final tree)r? )r r r r � getDocumentq s zTreeBuilder.getDocumentc C s | j � }| jd j|� |S )zReturn the final fragmentr )�
fragmentClassr; r( )r Zfragmentr r r � getFragmentu s zTreeBuilder.getFragmentc C s t �dS )zzSerialize the subtree of node in the format required by unit tests
node - the node from which to start serializingN)r! )r r" r r r �testSerializer| s zTreeBuilder.testSerializer)N)N)N)N) r+ r, r- �__doc__r> r\ rY rW rn r r: rF rM rO rQ rT rX rZ rR r^ ra �propertyr= r` r_ r& rb rk rm ro rp r r r r r8 z s6
.
r8 )Z
__future__r r r Zpip._vendor.sixr Z constantsr r r r2 rj �setrB �objectr r r. r8 r r r r �<module> s
K pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.opt-1.pyc 0000644 00000026430 14751155150 0023147 0 ustar 00 3
���eQ7 � @ s� d Z ddlmZmZmZ ddlZddlZddlZddlm Z ddl
m Z ddlm
Z
dd lm Z
dd
lmZ ddlj Z d Zejd �Ze jd
�jZG dd� de�ZG dd� de�Zdd� Zdd� ZG dd� de j�ZdS )a� Module for supporting the lxml.etree library. The idea here is to use as much
of the native library as possible, without using fragile hacks like custom element
names that break between releases. The downside of this is that we cannot represent
all possible trees; specifically the following are known to cause problems:
Text or comments as siblings of the root element
Docypes with no name
When any of these things occur, we emit a DataLossWarning
� )�absolute_import�division�unicode_literalsN� )�base� )�DataLossWarning)� constants)�etree)� _ihatexmlTz
{([^}]*)}(.*)Zasdc @ s e Zd Zdd� ZdS )� DocumentTypec C s || _ || _|| _d S )N)�name�publicId�systemId)�selfr
r r � r � /usr/lib/python3.6/etree_lxml.py�__init__# s zDocumentType.__init__N)�__name__�
__module__� __qualname__r r r r r r " s r c @ s, e Zd Zdd� Zdd� Zdd� Zee�ZdS )�Documentc C s d | _ g | _d S )N)� _elementTree� _childNodes)r r r r r * s zDocument.__init__c C s | j j� j|j� d S )N)r �getrootZaddnext�_element)r �elementr r r � appendChild. s zDocument.appendChildc C s | j S )N)r )r r r r �_getChildNodes1 s zDocument._getChildNodesN)r r r r r r �propertyZ
childNodesr r r r r ) s r c s6 g �t jdd�� d� ��fdd� ��| d� dj��S )NT)�preventDoubleDashCommentsr c
s t | d��st | d�rjd� | jjrz| jjp6| jjsFd| jj }nd| jj| jj| jjf }�jdd|d |f � | j� }x|j� d k r�|j� }q�W xx|d k r��||d � |j � }q�W nTt
| t �s�t
| t �r�jd d| | f � n(�jd
� x | D ]}�||d � � q�W �n�| j
tk�rn�jd d| | jf � t | d ��r| j�r�jd d| | jf � �n�tjj| j
�}|d k �r�|jd
�}|jd�}tj| }�jdd| |� j|�f � n �jdd| � j| j
�f � t | d��r�g }xr| jj� D ]d\} }
tj| �}|d k �rH|j� \}} � j| �} tj| }d|| f } n
� j| �} |j| |
f� �q�W x2t|�D ]&\} }
�jdd|d | |
f � �qpW | j�r��jd d|d | jf � |d7 }x| D ]} �| |� �q�W t | d ��r| j�r�jd d|d | jf � d S )N�tagr z #documentz
<!DOCTYPE %s>z<!DOCTYPE %s "%s" "%s">z|%s%s� r z|%s"%s"z#document-fragmentz|%s<!-- %s -->�tailr z
|%s<%s %s>z|%s<%s>�attribz%s %sz
|%s%s="%s") �hasattr�append�docinfo� internalDTDZ public_idZ
system_url� root_namer Z getpreviousZgetnext�
isinstance�str�bytesr! � comment_type�textr# �etree_builders�
tag_regexp�match�groupr �prefixes� fromXmlNamer$ �items�groups�sorted)
r �indent�dtd_strZ next_elementZnsmatch�nsr! �prefix�
attributesr
�valueZ attr_string�child)�
infosetFilter�rv�serializeElementr r rA ; sp
"
z(testSerializer.<locals>.serializeElement�
)r )r �
InfosetFilter�join)r r )r? r@ rA r �testSerializer7 s
F
rE c s$ g � � �fdd���| � dj � �S )z4Serialize an element and its child nodes to a stringc s
t | d�sH| jjr:| jjr$| jj}n d| jj }� j|� �| j� � n�| jtkrf� jd| j f � n�| j
s�� jd| jf � n.dj dd� | j
j � D ��}� jd| j|f � | j r�� j| j � x| D ] }�|� q�W � jd | jf � t | d
�o�| j
�r� j| j
� d S ) Nr! z
<!DOCTYPE %s>z <!--%s-->z<%s>r" c S s g | ]\}}d ||f �qS )z%s="%s"r )�.0r
r= r r r �
<listcomp>� s z6tostring.<locals>.serializeElement.<locals>.<listcomp>z<%s %s>z</%s>r# )r% r' r( �doctyper) r& r r! r- r. r$ rD r5 r# )r r9 �attrr> )r@ rA r r rA � s*
z"tostring.<locals>.serializeElement� )rD )r r )r@ rA r �tostring� s rK c sz e Zd ZeZeZdZdZeZ e
Z ddd�Z dd� Z
dd� Zd d
� Zd d � Zd
d� Zddd�Zd� fdd� Zdd� Z� ZS )� TreeBuilderNFc s� t jt|d��tjdd� �| _|| _G �fdd�dt�� G � ��fdd�d�j�}G ��fdd �d �j �}|| _
|| _ t j
j| |� d S )
N)�fullTreeT)r c s& e Zd Zd� fdd� Z� fdd�ZdS )z(TreeBuilder.__init__.<locals>.AttributesNc sv |d kr i }|| _ tj| |� xR| j� D ]F\}}t|t�rVd|d � j|d �f }n
� j|�}|| j j j|< q(W d S )Nz{%s}%sr r )r �dictr r5 r* �tuple�coerceAttributer$ )r r r= �keyr
)r? r r r � s
z1TreeBuilder.__init__.<locals>.Attributes.__init__c sP t j| ||� t|t�r4d|d � j|d �f }n
� j|�}|| jjj|< d S )Nz{%s}%sr r )rN � __setitem__r* rO rP r r$ )r rQ r= r
)r? r r rR � s
z4TreeBuilder.__init__.<locals>.Attributes.__setitem__)N)r r r r rR r )r? r r �
Attributes� s rS c sx e Zd Z� ��fdd�Z�fdd�Z�fdd�Zeee�Zdd� Z� fd d
�Z eee �Z
d��fd d
� Z �fdd�Z d S )z%TreeBuilder.__init__.<locals>.Elementc s* �j |�}�jj| ||d� � | �| _d S )N)� namespace)�
coerceElement�Elementr � _attributes)r r
rT )rS �builderr? r r r � s
z.TreeBuilder.__init__.<locals>.Element.__init__c s$ � j |�| _| j| j| j�| j_d S )N)rU �_nameZ _getETreeTagZ
_namespacer r! )r r
)r? r r �_setName� s z.TreeBuilder.__init__.<locals>.Element._setNamec s � j | j�S )N)r4 rY )r )r? r r �_getName� s z.TreeBuilder.__init__.<locals>.Element._getNamec S s | j S )N)rW )r r r r �_getAttributes� s z4TreeBuilder.__init__.<locals>.Element._getAttributesc s � | |�| _ d S )N)rW )r r< )rS r r �_setAttributes� s z4TreeBuilder.__init__.<locals>.Element._setAttributesNc s �j |�}� jj| ||� d S )N)ZcoerceCharactersrV �
insertText)r �dataZ insertBefore)rX r? r r r^ � s
z0TreeBuilder.__init__.<locals>.Element.insertTextc s � j j| |� d S )N)rV r )r r> )rX r r r � s z1TreeBuilder.__init__.<locals>.Element.appendChild)N)
r r r r rZ r[ r r
r\ r] r< r^ r r )rS rX r? r r rV � s
rV c s8 e Zd Z� �fdd�Z�fdd�Zdd� Zeee�ZdS )z%TreeBuilder.__init__.<locals>.Commentc s �j |�}� jj| |� d S )N)�
coerceComment�Commentr )r r_ )rX r? r r r � s
z.TreeBuilder.__init__.<locals>.Comment.__init__c s � j |�}|| j_d S )N)r` r r. )r r_ )r? r r �_setData� s
z.TreeBuilder.__init__.<locals>.Comment._setDatac S s | j jS )N)r r. )r r r r �_getData� s z.TreeBuilder.__init__.<locals>.Comment._getDataN)r r r r rb rc r r_ r )rX r? r r ra � s ra )r/ ZgetETreeModuler
r rC r? �namespaceHTMLElementsrN rV ra � elementClass� commentClassr rL r )r rd rM rV ra r )rS rX r? r r � s zTreeBuilder.__init__c C s$ t jj| � | j| _g | _d | _d S )N)r rL �reset�insertCommentInitial�
insertComment�initial_commentsrH )r r r r rg s zTreeBuilder.resetc C s t |�S )N)rE )r r r r r rE s zTreeBuilder.testSerializerc C s t r | jjS | jjj� S d S )N)rM �documentr r )r r r r � getDocument s zTreeBuilder.getDocumentc C sF g }| j d j}|jr"|j|j� |jt|�� |jrB|j|j� |S )Nr )� openElementsr r. r& �extend�listr# )r Zfragmentr r r r � getFragment s zTreeBuilder.getFragmentc C sh |d }|d }|d }|s0t jdt� d | _n4| jj|�}||krPt jdt� | j|||�}|| _d S )Nr
r r z#lxml cannot represent empty doctypez%lxml cannot represent non-xml doctype)�warnings�warnr rH r? rU � doctypeClass)r �tokenr
r r Z coercedNamerH r r r �
insertDoctype s zTreeBuilder.insertDoctypec C s | j j|� d S )N)rj r& )r r_ �parentr r r rh , s z TreeBuilder.insertCommentInitialc sB || j kr,| j jj� d jtkr,tjdt� tt | �j
||� d S )Nr z@lxml cannot represent adjacent comments beyond the root elements���) rk r r r! r- rq rr r �superrL ri )r r_ rv )� __class__r r �insertCommentMain1 s
z TreeBuilder.insertCommentMainc C s� d}| j r�|d| j j 7 }| j jdk s2| j jdk r�|d| jj| j jpFd� 7 }| j jr�| j j}|jd�dkr�|jd�dkr�tjdt � |j
dd �}|jd�dkr�|d
| 7 }q�|d | 7 }n|d 7 }|d
7 }| j j|d kr�tjdt � |d7 }t j |�}x*| j
D ] }| j|d �}|j|j� �qW | j� | _|j� | j_|d }|jd| j�}|dk�rb|} n d||f } | |_| j||�}
||
_| jjj|
� | jj|
� | j | _ dS )zCreate the document rootrJ z <!DOCTYPE %sNz
PUBLIC "%s" �'r �"z6DOCTYPE system cannot contain single and double quotesZU00027z"%s"z'%s'z''�>r
zGlxml cannot represent doctype with a different name to the root elementz$<THIS_SHOULD_NEVER_APPEAR_PUBLICLY/>r_ rT z{%s}%s) rH r
r r r? Z coercePubid�findrq rr r �replacer
Z
fromstringrj rf Z addpreviousr �
documentClassrk Z getroottreer �getZdefaultNamespacer! re r r& rm rz ri ) r rt ZdocStrZsysid�root�
comment_tokenZcommentr
rT Z etree_tagZ root_elementr r r �
insertRoot7 sJ
zTreeBuilder.insertRoot)F)N)N)r r r r r� r rs re rf Z
fragmentClassr
�implementationr rg rE rl rp ru rh rz r� �
__classcell__r r )ry r rL � s
L
rL ) �__doc__Z
__future__r r r rq �re�sysrJ r r r r
r/ r Z
lxml.etreerM �compiler0 ra r! r- �objectr r rE rK rL r r r r �<module>
s$
O) pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.pyc 0000644 00000025515 14751155150 0020765 0 ustar 00 3
���ev6 � @ s� d dl mZmZmZ d dlmZ ddlmZmZm Z dZ
e e�dfe ee e d dfg�B �dfe ee e d d fe d d
fg�B �dfe e d dfe d d fg�dfe e d d fe d d
fg�dfd�Z
G dd� de�ZG dd� de�ZG dd� de�ZdS )� )�absolute_import�division�unicode_literals)� text_type� )�scopingElements�tableInsertModeElements�
namespacesNF�html�buttonZolZul�table�optgroup�optionT)Nr �listr Zselectc @ s^ e Zd Zdd� Zdd� Zdd� Zdd� Zdd
d �Zd d
� Zdd� Z dd� Z
dd� Z dd� Z d S )�Nodec C s( || _ d| _d| _i | _g | _g | _dS )a6 Node representing an item in the tree.
name - The tag name associated with the node
parent - The parent of the current node (or None for the document node)
value - The value of the current node (applies to text nodes and
comments
attributes - a dict holding name, value pairs for attributes of the node
childNodes - a list of child nodes of the current node. This must
include all elements but not necessarily other node types
_flags - A list of miscellaneous flags that can be set on the node
N)�name�parent�value�
attributes�
childNodesZ_flags)�selfr � r �/usr/lib/python3.6/base.py�__init__ s z
Node.__init__c C s: dj dd� | jj� D ��}|r,d| j|f S d| j S d S )N� c S s g | ]\}}d ||f �qS )z%s="%s"r )�.0r r r r r �
<listcomp>+ s z Node.__str__.<locals>.<listcomp>z<%s %s>z<%s>)�joinr �itemsr )r Z
attributesStrr r r �__str__* s
z Node.__str__c C s
d| j S )Nz<%s>)r )r r r r �__repr__3 s z
Node.__repr__c C s t �dS )z3Insert node as a child of the current node
N)�NotImplementedError)r �noder r r � appendChild6 s zNode.appendChildNc C s t �dS )z�Insert data as text in the current node, positioned before the
start of node insertBefore or to the end of the node's text.
N)r! )r �data� insertBeforer r r �
insertText; s zNode.insertTextc C s t �dS )z�Insert node as a child of the current node, before refNode in the
list of child nodes. Raises ValueError if refNode is not a child of
the current nodeN)r! )r r" ZrefNoder r r r% A s zNode.insertBeforec C s t �dS )z:Remove node from the children of the current node
N)r! )r r" r r r � removeChildG s zNode.removeChildc C s$ x| j D ]}|j|� qW g | _ dS )z�Move all the children of the current node to newParent.
This is needed so that trees that don't store text as nodes move the
text in the correct way
N)r r# )r Z newParentZchildr r r �reparentChildrenL s zNode.reparentChildrenc C s t �dS )z�Return a shallow copy of the current node i.e. a node with the same
name and attributes but with no parent or child nodes
N)r! )r r r r � cloneNodeV s zNode.cloneNodec C s t �dS )zFReturn true if the node has children or text, false otherwise
N)r! )r r r r �
hasContent\ s zNode.hasContent)N)
�__name__�
__module__� __qualname__r r r r# r& r% r' r( r) r* r r r r r s
r c @ s e Zd Zdd� Zdd� ZdS )�ActiveFormattingElementsc C sf d}|t krVxH| d d d� D ]6}|t kr*P | j||�r>|d7 }|dkr | j|� P q W tj| |� d S )Nr � � ���)�Marker�
nodesEqual�remover �append)r r" Z
equalCount�elementr r r r5 c s
z ActiveFormattingElements.appendc C s$ |j |j ksdS |j|jks dS dS )NFT)� nameTupler )r Znode1Znode2r r r r3 p s
z#ActiveFormattingElements.nodesEqualN)r+ r, r- r5 r3 r r r r r. b s
r. c @ s� e Zd ZdZdZdZdZdZdZdd� Z dd� Z
d+dd�Z d d
� Z d d � Z
d
d� Zdd� Zdd� Zd,dd�Zdd� Zdd� Zdd� Zeee�Zdd � Zd d � Zd-d d �Zd!d"� Zd.d#d$�Zd%d&� Z d'd(� Z d)d*� Z dS )/� TreeBuildera Base treebuilder implementation
documentClass - the class to use for the bottommost node of a document
elementClass - the class to use for HTML Elements
commentClass - the class to use for comments
doctypeClass - the class to use for doctypes
Nc C s |r d| _ nd | _ | j� d S )Nz http://www.w3.org/1999/xhtml)�defaultNamespace�reset)r ZnamespaceHTMLElementsr r r r � s zTreeBuilder.__init__c C s. g | _ t� | _d | _d | _d| _| j� | _d S )NF)� openElementsr. �activeFormattingElementsZ headPointerZ formPointer�insertFromTable�
documentClass�document)r r r r r: � s zTreeBuilder.resetc C s� t |d�}|s2t|t�r$td |f}t|t�s2t�t| \}}xHt| j�D ]:}|r^||kr^dS | rr|j |krrdS ||j |kA rJdS qJW ds�t�d S )Nr7 r
TF)
�hasattr�
isinstancer r �tuple�AssertionError�listElementsMap�reversedr; r7 )r �targetZvariantZ exactNodeZ listElements�invertr" r r r �elementInScope� s
zTreeBuilder.elementInScopec C s� | j s
d S t| j �d }| j | }|tks4|| jkr8d S x6|tkrn|| jkrn|dkrZd}P |d8 }| j | }q:W xR|d7 }| j | }|j� }| jd|j|j|jd��}|| j |< || j d krrP qrW d S )Nr/ r ZStartTag)�typer � namespacer$ r1 r1 ) r< �lenr2 r; r) �
insertElementr rJ r )r �i�entryZcloner6 r r r �#reconstructActiveFormattingElements� s.
z/TreeBuilder.reconstructActiveFormattingElementsc C s, | j j� }x | j r&|tkr&| j j� }q W d S )N)r< �popr2 )r rN r r r � clearActiveFormattingElements� s
z)TreeBuilder.clearActiveFormattingElementsc C s8 x2| j ddd� D ] }|tkr"P q|j|kr|S qW dS )z�Check if an element exists between the end of the active
formatting elements and the last marker. If it does, return it, else
return falseNr/ Fr1 )r< r2 r )r r �itemr r r �!elementInActiveFormattingElements� s
z-TreeBuilder.elementInActiveFormattingElementsc C s& | j |�}| jj|� | jj|� d S )N)�
createElementr; r5 r? r# )r �tokenr6 r r r �
insertRoot� s
zTreeBuilder.insertRootc C s6 |d }|d }|d }| j |||�}| jj|� d S )Nr �publicId�systemId)� doctypeClassr? r# )r rU r rW rX Zdoctyper r r �
insertDoctype s
zTreeBuilder.insertDoctypec C s* |d kr| j d }|j| j|d �� d S )Nr/ r$ r1 )r; r# � commentClass)r rU r r r r �
insertComment s
zTreeBuilder.insertCommentc C s0 |d }|j d| j�}| j||�}|d |_|S )z.Create an element but don't insert it anywherer rJ r$ )�getr9 � elementClassr )r rU r rJ r6 r r r rT s
zTreeBuilder.createElementc C s | j S )N)�_insertFromTable)r r r r �_getInsertFromTable s z TreeBuilder._getInsertFromTablec C s || _ |r| j| _n| j| _dS )zsSwitch the function used to insert an element from the
normal one to the misnested table one and back againN)r_ �insertElementTablerL �insertElementNormal)r r r r r �_setInsertFromTable s
z TreeBuilder._setInsertFromTablec C sb |d }t |t�s td| ��|jd| j�}| j||�}|d |_| jd j|� | jj |� |S )Nr zElement %s not unicoderJ r$ r/ r1 )
rA r rC r] r9 r^ r r; r# r5 )r rU r rJ r6 r r r rb $ s
z TreeBuilder.insertElementNormalc C s` | j |�}| jd jtkr$| j|�S | j� \}}|dkrD|j|� n |j||� | jj|� |S )z-Create an element and insert it into the treer/ Nr1 ) rT r; r r rb � getTableMisnestedNodePositionr# r% r5 )r rU r6 r r% r r r ra . s
z TreeBuilder.insertElementTablec C sX |dkr| j d }| j s0| jr<| j d jtkr<|j|� n| j� \}}|j||� dS )zInsert text data.Nr/ r1 r1 )r; r= r r r& rd )r r$ r r% r r r r& > s
zTreeBuilder.insertTextc C sv d}d}d}x(| j ddd� D ]}|jdkr |}P q W |rd|jrL|j}|}qn| j | j j|�d }n
| j d }||fS )zsGet the foster parent element, and sibling to insert before
(or None) when inserting a misnested table nodeNr/ r r r1 )r; r r �index)r Z lastTableZ fosterParentr% Zelmr r r rd M s
z)TreeBuilder.getTableMisnestedNodePositionc
C s8 | j d
j}|td �kr4||kr4| j j� | j|� d S ) Nr/ �dd�dt�lir r
�p�rp�rtr1 )rf rg rh r r
ri rj rk )r; r � frozensetrP �generateImpliedEndTags)r �excluder r r r rm g s
z"TreeBuilder.generateImpliedEndTagsc C s | j S )zReturn the final tree)r? )r r r r � getDocumentq s zTreeBuilder.getDocumentc C s | j � }| jd j|� |S )zReturn the final fragmentr )�
fragmentClassr; r( )r Zfragmentr r r � getFragmentu s zTreeBuilder.getFragmentc C s t �dS )zzSerialize the subtree of node in the format required by unit tests
node - the node from which to start serializingN)r! )r r" r r r �testSerializer| s zTreeBuilder.testSerializer)N)N)N)N) r+ r, r- �__doc__r> r^ r[ rY rp r r: rH rO rQ rS rV rZ r\ rT r` rc �propertyr= rb ra r& rd rm ro rq rr r r r r r8 z s6
.
r8 )Z
__future__r r r Zpip._vendor.sixr Z constantsr r r r2 rl �setrD �objectr r r. r8 r r r r �<module> s
K pip/_vendor/html5lib/treebuilders/dom.py 0000644 00000021203 14751155150 0014334 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from collections import MutableMapping
from xml.dom import minidom, Node
import weakref
from . import base
from .. import constants
from ..constants import namespaces
from .._utils import moduleFactoryFactory
def getDomBuilder(DomImplementation):
Dom = DomImplementation
class AttrList(MutableMapping):
def __init__(self, element):
self.element = element
def __iter__(self):
return iter(self.element.attributes.keys())
def __setitem__(self, name, value):
if isinstance(name, tuple):
raise NotImplementedError
else:
attr = self.element.ownerDocument.createAttribute(name)
attr.value = value
self.element.attributes[name] = attr
def __len__(self):
return len(self.element.attributes)
def items(self):
return list(self.element.attributes.items())
def values(self):
return list(self.element.attributes.values())
def __getitem__(self, name):
if isinstance(name, tuple):
raise NotImplementedError
else:
return self.element.attributes[name].value
def __delitem__(self, name):
if isinstance(name, tuple):
raise NotImplementedError
else:
del self.element.attributes[name]
class NodeBuilder(base.Node):
def __init__(self, element):
base.Node.__init__(self, element.nodeName)
self.element = element
namespace = property(lambda self: hasattr(self.element, "namespaceURI") and
self.element.namespaceURI or None)
def appendChild(self, node):
node.parent = self
self.element.appendChild(node.element)
def insertText(self, data, insertBefore=None):
text = self.element.ownerDocument.createTextNode(data)
if insertBefore:
self.element.insertBefore(text, insertBefore.element)
else:
self.element.appendChild(text)
def insertBefore(self, node, refNode):
self.element.insertBefore(node.element, refNode.element)
node.parent = self
def removeChild(self, node):
if node.element.parentNode == self.element:
self.element.removeChild(node.element)
node.parent = None
def reparentChildren(self, newParent):
while self.element.hasChildNodes():
child = self.element.firstChild
self.element.removeChild(child)
newParent.element.appendChild(child)
self.childNodes = []
def getAttributes(self):
return AttrList(self.element)
def setAttributes(self, attributes):
if attributes:
for name, value in list(attributes.items()):
if isinstance(name, tuple):
if name[0] is not None:
qualifiedName = (name[0] + ":" + name[1])
else:
qualifiedName = name[1]
self.element.setAttributeNS(name[2], qualifiedName,
value)
else:
self.element.setAttribute(
name, value)
attributes = property(getAttributes, setAttributes)
def cloneNode(self):
return NodeBuilder(self.element.cloneNode(False))
def hasContent(self):
return self.element.hasChildNodes()
def getNameTuple(self):
if self.namespace is None:
return namespaces["html"], self.name
else:
return self.namespace, self.name
nameTuple = property(getNameTuple)
class TreeBuilder(base.TreeBuilder): # pylint:disable=unused-variable
def documentClass(self):
self.dom = Dom.getDOMImplementation().createDocument(None, None, None)
return weakref.proxy(self)
def insertDoctype(self, token):
name = token["name"]
publicId = token["publicId"]
systemId = token["systemId"]
domimpl = Dom.getDOMImplementation()
doctype = domimpl.createDocumentType(name, publicId, systemId)
self.document.appendChild(NodeBuilder(doctype))
if Dom == minidom:
doctype.ownerDocument = self.dom
def elementClass(self, name, namespace=None):
if namespace is None and self.defaultNamespace is None:
node = self.dom.createElement(name)
else:
node = self.dom.createElementNS(namespace, name)
return NodeBuilder(node)
def commentClass(self, data):
return NodeBuilder(self.dom.createComment(data))
def fragmentClass(self):
return NodeBuilder(self.dom.createDocumentFragment())
def appendChild(self, node):
self.dom.appendChild(node.element)
def testSerializer(self, element):
return testSerializer(element)
def getDocument(self):
return self.dom
def getFragment(self):
return base.TreeBuilder.getFragment(self).element
def insertText(self, data, parent=None):
data = data
if parent != self:
base.TreeBuilder.insertText(self, data, parent)
else:
# HACK: allow text nodes as children of the document node
if hasattr(self.dom, '_child_node_types'):
# pylint:disable=protected-access
if Node.TEXT_NODE not in self.dom._child_node_types:
self.dom._child_node_types = list(self.dom._child_node_types)
self.dom._child_node_types.append(Node.TEXT_NODE)
self.dom.appendChild(self.dom.createTextNode(data))
implementation = DomImplementation
name = None
def testSerializer(element):
element.normalize()
rv = []
def serializeElement(element, indent=0):
if element.nodeType == Node.DOCUMENT_TYPE_NODE:
if element.name:
if element.publicId or element.systemId:
publicId = element.publicId or ""
systemId = element.systemId or ""
rv.append("""|%s<!DOCTYPE %s "%s" "%s">""" %
(' ' * indent, element.name, publicId, systemId))
else:
rv.append("|%s<!DOCTYPE %s>" % (' ' * indent, element.name))
else:
rv.append("|%s<!DOCTYPE >" % (' ' * indent,))
elif element.nodeType == Node.DOCUMENT_NODE:
rv.append("#document")
elif element.nodeType == Node.DOCUMENT_FRAGMENT_NODE:
rv.append("#document-fragment")
elif element.nodeType == Node.COMMENT_NODE:
rv.append("|%s<!-- %s -->" % (' ' * indent, element.nodeValue))
elif element.nodeType == Node.TEXT_NODE:
rv.append("|%s\"%s\"" % (' ' * indent, element.nodeValue))
else:
if (hasattr(element, "namespaceURI") and
element.namespaceURI is not None):
name = "%s %s" % (constants.prefixes[element.namespaceURI],
element.nodeName)
else:
name = element.nodeName
rv.append("|%s<%s>" % (' ' * indent, name))
if element.hasAttributes():
attributes = []
for i in range(len(element.attributes)):
attr = element.attributes.item(i)
name = attr.nodeName
value = attr.value
ns = attr.namespaceURI
if ns:
name = "%s %s" % (constants.prefixes[ns], attr.localName)
else:
name = attr.nodeName
attributes.append((name, value))
for name, value in sorted(attributes):
rv.append('|%s%s="%s"' % (' ' * (indent + 2), name, value))
indent += 2
for child in element.childNodes:
serializeElement(child, indent)
serializeElement(element, 0)
return "\n".join(rv)
return locals()
# The actual means to get a module!
getDomModule = moduleFactoryFactory(getDomBuilder)
pip/_vendor/html5lib/treebuilders/etree.py 0000644 00000030734 14751155150 0014672 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
# pylint:disable=protected-access
from pip._vendor.six import text_type
import re
from . import base
from .. import _ihatexml
from .. import constants
from ..constants import namespaces
from .._utils import moduleFactoryFactory
tag_regexp = re.compile("{([^}]*)}(.*)")
def getETreeBuilder(ElementTreeImplementation, fullTree=False):
ElementTree = ElementTreeImplementation
ElementTreeCommentType = ElementTree.Comment("asd").tag
class Element(base.Node):
def __init__(self, name, namespace=None):
self._name = name
self._namespace = namespace
self._element = ElementTree.Element(self._getETreeTag(name,
namespace))
if namespace is None:
self.nameTuple = namespaces["html"], self._name
else:
self.nameTuple = self._namespace, self._name
self.parent = None
self._childNodes = []
self._flags = []
def _getETreeTag(self, name, namespace):
if namespace is None:
etree_tag = name
else:
etree_tag = "{%s}%s" % (namespace, name)
return etree_tag
def _setName(self, name):
self._name = name
self._element.tag = self._getETreeTag(self._name, self._namespace)
def _getName(self):
return self._name
name = property(_getName, _setName)
def _setNamespace(self, namespace):
self._namespace = namespace
self._element.tag = self._getETreeTag(self._name, self._namespace)
def _getNamespace(self):
return self._namespace
namespace = property(_getNamespace, _setNamespace)
def _getAttributes(self):
return self._element.attrib
def _setAttributes(self, attributes):
# Delete existing attributes first
# XXX - there may be a better way to do this...
for key in list(self._element.attrib.keys()):
del self._element.attrib[key]
for key, value in attributes.items():
if isinstance(key, tuple):
name = "{%s}%s" % (key[2], key[1])
else:
name = key
self._element.set(name, value)
attributes = property(_getAttributes, _setAttributes)
def _getChildNodes(self):
return self._childNodes
def _setChildNodes(self, value):
del self._element[:]
self._childNodes = []
for element in value:
self.insertChild(element)
childNodes = property(_getChildNodes, _setChildNodes)
def hasContent(self):
"""Return true if the node has children or text"""
return bool(self._element.text or len(self._element))
def appendChild(self, node):
self._childNodes.append(node)
self._element.append(node._element)
node.parent = self
def insertBefore(self, node, refNode):
index = list(self._element).index(refNode._element)
self._element.insert(index, node._element)
node.parent = self
def removeChild(self, node):
self._childNodes.remove(node)
self._element.remove(node._element)
node.parent = None
def insertText(self, data, insertBefore=None):
if not(len(self._element)):
if not self._element.text:
self._element.text = ""
self._element.text += data
elif insertBefore is None:
# Insert the text as the tail of the last child element
if not self._element[-1].tail:
self._element[-1].tail = ""
self._element[-1].tail += data
else:
# Insert the text before the specified node
children = list(self._element)
index = children.index(insertBefore._element)
if index > 0:
if not self._element[index - 1].tail:
self._element[index - 1].tail = ""
self._element[index - 1].tail += data
else:
if not self._element.text:
self._element.text = ""
self._element.text += data
def cloneNode(self):
element = type(self)(self.name, self.namespace)
for name, value in self.attributes.items():
element.attributes[name] = value
return element
def reparentChildren(self, newParent):
if newParent.childNodes:
newParent.childNodes[-1]._element.tail += self._element.text
else:
if not newParent._element.text:
newParent._element.text = ""
if self._element.text is not None:
newParent._element.text += self._element.text
self._element.text = ""
base.Node.reparentChildren(self, newParent)
class Comment(Element):
def __init__(self, data):
# Use the superclass constructor to set all properties on the
# wrapper element
self._element = ElementTree.Comment(data)
self.parent = None
self._childNodes = []
self._flags = []
def _getData(self):
return self._element.text
def _setData(self, value):
self._element.text = value
data = property(_getData, _setData)
class DocumentType(Element):
def __init__(self, name, publicId, systemId):
Element.__init__(self, "<!DOCTYPE>")
self._element.text = name
self.publicId = publicId
self.systemId = systemId
def _getPublicId(self):
return self._element.get("publicId", "")
def _setPublicId(self, value):
if value is not None:
self._element.set("publicId", value)
publicId = property(_getPublicId, _setPublicId)
def _getSystemId(self):
return self._element.get("systemId", "")
def _setSystemId(self, value):
if value is not None:
self._element.set("systemId", value)
systemId = property(_getSystemId, _setSystemId)
class Document(Element):
def __init__(self):
Element.__init__(self, "DOCUMENT_ROOT")
class DocumentFragment(Element):
def __init__(self):
Element.__init__(self, "DOCUMENT_FRAGMENT")
def testSerializer(element):
rv = []
def serializeElement(element, indent=0):
if not(hasattr(element, "tag")):
element = element.getroot()
if element.tag == "<!DOCTYPE>":
if element.get("publicId") or element.get("systemId"):
publicId = element.get("publicId") or ""
systemId = element.get("systemId") or ""
rv.append("""<!DOCTYPE %s "%s" "%s">""" %
(element.text, publicId, systemId))
else:
rv.append("<!DOCTYPE %s>" % (element.text,))
elif element.tag == "DOCUMENT_ROOT":
rv.append("#document")
if element.text is not None:
rv.append("|%s\"%s\"" % (' ' * (indent + 2), element.text))
if element.tail is not None:
raise TypeError("Document node cannot have tail")
if hasattr(element, "attrib") and len(element.attrib):
raise TypeError("Document node cannot have attributes")
elif element.tag == ElementTreeCommentType:
rv.append("|%s<!-- %s -->" % (' ' * indent, element.text))
else:
assert isinstance(element.tag, text_type), \
"Expected unicode, got %s, %s" % (type(element.tag), element.tag)
nsmatch = tag_regexp.match(element.tag)
if nsmatch is None:
name = element.tag
else:
ns, name = nsmatch.groups()
prefix = constants.prefixes[ns]
name = "%s %s" % (prefix, name)
rv.append("|%s<%s>" % (' ' * indent, name))
if hasattr(element, "attrib"):
attributes = []
for name, value in element.attrib.items():
nsmatch = tag_regexp.match(name)
if nsmatch is not None:
ns, name = nsmatch.groups()
prefix = constants.prefixes[ns]
attr_string = "%s %s" % (prefix, name)
else:
attr_string = name
attributes.append((attr_string, value))
for name, value in sorted(attributes):
rv.append('|%s%s="%s"' % (' ' * (indent + 2), name, value))
if element.text:
rv.append("|%s\"%s\"" % (' ' * (indent + 2), element.text))
indent += 2
for child in element:
serializeElement(child, indent)
if element.tail:
rv.append("|%s\"%s\"" % (' ' * (indent - 2), element.tail))
serializeElement(element, 0)
return "\n".join(rv)
def tostring(element): # pylint:disable=unused-variable
"""Serialize an element and its child nodes to a string"""
rv = []
filter = _ihatexml.InfosetFilter()
def serializeElement(element):
if isinstance(element, ElementTree.ElementTree):
element = element.getroot()
if element.tag == "<!DOCTYPE>":
if element.get("publicId") or element.get("systemId"):
publicId = element.get("publicId") or ""
systemId = element.get("systemId") or ""
rv.append("""<!DOCTYPE %s PUBLIC "%s" "%s">""" %
(element.text, publicId, systemId))
else:
rv.append("<!DOCTYPE %s>" % (element.text,))
elif element.tag == "DOCUMENT_ROOT":
if element.text is not None:
rv.append(element.text)
if element.tail is not None:
raise TypeError("Document node cannot have tail")
if hasattr(element, "attrib") and len(element.attrib):
raise TypeError("Document node cannot have attributes")
for child in element:
serializeElement(child)
elif element.tag == ElementTreeCommentType:
rv.append("<!--%s-->" % (element.text,))
else:
# This is assumed to be an ordinary element
if not element.attrib:
rv.append("<%s>" % (filter.fromXmlName(element.tag),))
else:
attr = " ".join(["%s=\"%s\"" % (
filter.fromXmlName(name), value)
for name, value in element.attrib.items()])
rv.append("<%s %s>" % (element.tag, attr))
if element.text:
rv.append(element.text)
for child in element:
serializeElement(child)
rv.append("</%s>" % (element.tag,))
if element.tail:
rv.append(element.tail)
serializeElement(element)
return "".join(rv)
class TreeBuilder(base.TreeBuilder): # pylint:disable=unused-variable
documentClass = Document
doctypeClass = DocumentType
elementClass = Element
commentClass = Comment
fragmentClass = DocumentFragment
implementation = ElementTreeImplementation
def testSerializer(self, element):
return testSerializer(element)
def getDocument(self):
if fullTree:
return self.document._element
else:
if self.defaultNamespace is not None:
return self.document._element.find(
"{%s}html" % self.defaultNamespace)
else:
return self.document._element.find("html")
def getFragment(self):
return base.TreeBuilder.getFragment(self)._element
return locals()
getETreeModule = moduleFactoryFactory(getETreeBuilder)
pip/_vendor/html5lib/treebuilders/base.py 0000644 00000033166 14751155150 0014502 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import text_type
from ..constants import scopingElements, tableInsertModeElements, namespaces
# The scope markers are inserted when entering object elements,
# marquees, table cells, and table captions, and are used to prevent formatting
# from "leaking" into tables, object elements, and marquees.
Marker = None
listElementsMap = {
None: (frozenset(scopingElements), False),
"button": (frozenset(scopingElements | set([(namespaces["html"], "button")])), False),
"list": (frozenset(scopingElements | set([(namespaces["html"], "ol"),
(namespaces["html"], "ul")])), False),
"table": (frozenset([(namespaces["html"], "html"),
(namespaces["html"], "table")]), False),
"select": (frozenset([(namespaces["html"], "optgroup"),
(namespaces["html"], "option")]), True)
}
class Node(object):
def __init__(self, name):
"""Node representing an item in the tree.
name - The tag name associated with the node
parent - The parent of the current node (or None for the document node)
value - The value of the current node (applies to text nodes and
comments
attributes - a dict holding name, value pairs for attributes of the node
childNodes - a list of child nodes of the current node. This must
include all elements but not necessarily other node types
_flags - A list of miscellaneous flags that can be set on the node
"""
self.name = name
self.parent = None
self.value = None
self.attributes = {}
self.childNodes = []
self._flags = []
def __str__(self):
attributesStr = " ".join(["%s=\"%s\"" % (name, value)
for name, value in
self.attributes.items()])
if attributesStr:
return "<%s %s>" % (self.name, attributesStr)
else:
return "<%s>" % (self.name)
def __repr__(self):
return "<%s>" % (self.name)
def appendChild(self, node):
"""Insert node as a child of the current node
"""
raise NotImplementedError
def insertText(self, data, insertBefore=None):
"""Insert data as text in the current node, positioned before the
start of node insertBefore or to the end of the node's text.
"""
raise NotImplementedError
def insertBefore(self, node, refNode):
"""Insert node as a child of the current node, before refNode in the
list of child nodes. Raises ValueError if refNode is not a child of
the current node"""
raise NotImplementedError
def removeChild(self, node):
"""Remove node from the children of the current node
"""
raise NotImplementedError
def reparentChildren(self, newParent):
"""Move all the children of the current node to newParent.
This is needed so that trees that don't store text as nodes move the
text in the correct way
"""
# XXX - should this method be made more general?
for child in self.childNodes:
newParent.appendChild(child)
self.childNodes = []
def cloneNode(self):
"""Return a shallow copy of the current node i.e. a node with the same
name and attributes but with no parent or child nodes
"""
raise NotImplementedError
def hasContent(self):
"""Return true if the node has children or text, false otherwise
"""
raise NotImplementedError
class ActiveFormattingElements(list):
def append(self, node):
equalCount = 0
if node != Marker:
for element in self[::-1]:
if element == Marker:
break
if self.nodesEqual(element, node):
equalCount += 1
if equalCount == 3:
self.remove(element)
break
list.append(self, node)
def nodesEqual(self, node1, node2):
if not node1.nameTuple == node2.nameTuple:
return False
if not node1.attributes == node2.attributes:
return False
return True
class TreeBuilder(object):
"""Base treebuilder implementation
documentClass - the class to use for the bottommost node of a document
elementClass - the class to use for HTML Elements
commentClass - the class to use for comments
doctypeClass - the class to use for doctypes
"""
# pylint:disable=not-callable
# Document class
documentClass = None
# The class to use for creating a node
elementClass = None
# The class to use for creating comments
commentClass = None
# The class to use for creating doctypes
doctypeClass = None
# Fragment class
fragmentClass = None
def __init__(self, namespaceHTMLElements):
if namespaceHTMLElements:
self.defaultNamespace = "http://www.w3.org/1999/xhtml"
else:
self.defaultNamespace = None
self.reset()
def reset(self):
self.openElements = []
self.activeFormattingElements = ActiveFormattingElements()
# XXX - rename these to headElement, formElement
self.headPointer = None
self.formPointer = None
self.insertFromTable = False
self.document = self.documentClass()
def elementInScope(self, target, variant=None):
# If we pass a node in we match that. if we pass a string
# match any node with that name
exactNode = hasattr(target, "nameTuple")
if not exactNode:
if isinstance(target, text_type):
target = (namespaces["html"], target)
assert isinstance(target, tuple)
listElements, invert = listElementsMap[variant]
for node in reversed(self.openElements):
if exactNode and node == target:
return True
elif not exactNode and node.nameTuple == target:
return True
elif (invert ^ (node.nameTuple in listElements)):
return False
assert False # We should never reach this point
def reconstructActiveFormattingElements(self):
# Within this algorithm the order of steps described in the
# specification is not quite the same as the order of steps in the
# code. It should still do the same though.
# Step 1: stop the algorithm when there's nothing to do.
if not self.activeFormattingElements:
return
# Step 2 and step 3: we start with the last element. So i is -1.
i = len(self.activeFormattingElements) - 1
entry = self.activeFormattingElements[i]
if entry == Marker or entry in self.openElements:
return
# Step 6
while entry != Marker and entry not in self.openElements:
if i == 0:
# This will be reset to 0 below
i = -1
break
i -= 1
# Step 5: let entry be one earlier in the list.
entry = self.activeFormattingElements[i]
while True:
# Step 7
i += 1
# Step 8
entry = self.activeFormattingElements[i]
clone = entry.cloneNode() # Mainly to get a new copy of the attributes
# Step 9
element = self.insertElement({"type": "StartTag",
"name": clone.name,
"namespace": clone.namespace,
"data": clone.attributes})
# Step 10
self.activeFormattingElements[i] = element
# Step 11
if element == self.activeFormattingElements[-1]:
break
def clearActiveFormattingElements(self):
entry = self.activeFormattingElements.pop()
while self.activeFormattingElements and entry != Marker:
entry = self.activeFormattingElements.pop()
def elementInActiveFormattingElements(self, name):
"""Check if an element exists between the end of the active
formatting elements and the last marker. If it does, return it, else
return false"""
for item in self.activeFormattingElements[::-1]:
# Check for Marker first because if it's a Marker it doesn't have a
# name attribute.
if item == Marker:
break
elif item.name == name:
return item
return False
def insertRoot(self, token):
element = self.createElement(token)
self.openElements.append(element)
self.document.appendChild(element)
def insertDoctype(self, token):
name = token["name"]
publicId = token["publicId"]
systemId = token["systemId"]
doctype = self.doctypeClass(name, publicId, systemId)
self.document.appendChild(doctype)
def insertComment(self, token, parent=None):
if parent is None:
parent = self.openElements[-1]
parent.appendChild(self.commentClass(token["data"]))
def createElement(self, token):
"""Create an element but don't insert it anywhere"""
name = token["name"]
namespace = token.get("namespace", self.defaultNamespace)
element = self.elementClass(name, namespace)
element.attributes = token["data"]
return element
def _getInsertFromTable(self):
return self._insertFromTable
def _setInsertFromTable(self, value):
"""Switch the function used to insert an element from the
normal one to the misnested table one and back again"""
self._insertFromTable = value
if value:
self.insertElement = self.insertElementTable
else:
self.insertElement = self.insertElementNormal
insertFromTable = property(_getInsertFromTable, _setInsertFromTable)
def insertElementNormal(self, token):
name = token["name"]
assert isinstance(name, text_type), "Element %s not unicode" % name
namespace = token.get("namespace", self.defaultNamespace)
element = self.elementClass(name, namespace)
element.attributes = token["data"]
self.openElements[-1].appendChild(element)
self.openElements.append(element)
return element
def insertElementTable(self, token):
"""Create an element and insert it into the tree"""
element = self.createElement(token)
if self.openElements[-1].name not in tableInsertModeElements:
return self.insertElementNormal(token)
else:
# We should be in the InTable mode. This means we want to do
# special magic element rearranging
parent, insertBefore = self.getTableMisnestedNodePosition()
if insertBefore is None:
parent.appendChild(element)
else:
parent.insertBefore(element, insertBefore)
self.openElements.append(element)
return element
def insertText(self, data, parent=None):
"""Insert text data."""
if parent is None:
parent = self.openElements[-1]
if (not self.insertFromTable or (self.insertFromTable and
self.openElements[-1].name
not in tableInsertModeElements)):
parent.insertText(data)
else:
# We should be in the InTable mode. This means we want to do
# special magic element rearranging
parent, insertBefore = self.getTableMisnestedNodePosition()
parent.insertText(data, insertBefore)
def getTableMisnestedNodePosition(self):
"""Get the foster parent element, and sibling to insert before
(or None) when inserting a misnested table node"""
# The foster parent element is the one which comes before the most
# recently opened table element
# XXX - this is really inelegant
lastTable = None
fosterParent = None
insertBefore = None
for elm in self.openElements[::-1]:
if elm.name == "table":
lastTable = elm
break
if lastTable:
# XXX - we should really check that this parent is actually a
# node here
if lastTable.parent:
fosterParent = lastTable.parent
insertBefore = lastTable
else:
fosterParent = self.openElements[
self.openElements.index(lastTable) - 1]
else:
fosterParent = self.openElements[0]
return fosterParent, insertBefore
def generateImpliedEndTags(self, exclude=None):
name = self.openElements[-1].name
# XXX td, th and tr are not actually needed
if (name in frozenset(("dd", "dt", "li", "option", "optgroup", "p", "rp", "rt")) and
name != exclude):
self.openElements.pop()
# XXX This is not entirely what the specification says. We should
# investigate it more closely.
self.generateImpliedEndTags(exclude)
def getDocument(self):
"Return the final tree"
return self.document
def getFragment(self):
"Return the final fragment"
# assert self.innerHTML
fragment = self.fragmentClass()
self.openElements[0].reparentChildren(fragment)
return fragment
def testSerializer(self, node):
"""Serialize the subtree of node in the format required by unit tests
node - the node from which to start serializing"""
raise NotImplementedError
pip/_vendor/html5lib/_tokenizer.py 0000644 00000225444 14751155150 0013252 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import unichr as chr
from collections import deque
from .constants import spaceCharacters
from .constants import entities
from .constants import asciiLetters, asciiUpper2Lower
from .constants import digits, hexDigits, EOF
from .constants import tokenTypes, tagTokenTypes
from .constants import replacementCharacters
from ._inputstream import HTMLInputStream
from ._trie import Trie
entitiesTrie = Trie(entities)
class HTMLTokenizer(object):
""" This class takes care of tokenizing HTML.
* self.currentToken
Holds the token that is currently being processed.
* self.state
Holds a reference to the method to be invoked... XXX
* self.stream
Points to HTMLInputStream object.
"""
def __init__(self, stream, parser=None, **kwargs):
self.stream = HTMLInputStream(stream, **kwargs)
self.parser = parser
# Setup the initial tokenizer state
self.escapeFlag = False
self.lastFourChars = []
self.state = self.dataState
self.escape = False
# The current token being created
self.currentToken = None
super(HTMLTokenizer, self).__init__()
def __iter__(self):
""" This is where the magic happens.
We do our usually processing through the states and when we have a token
to return we yield the token which pauses processing until the next token
is requested.
"""
self.tokenQueue = deque([])
# Start processing. When EOF is reached self.state will return False
# instead of True and the loop will terminate.
while self.state():
while self.stream.errors:
yield {"type": tokenTypes["ParseError"], "data": self.stream.errors.pop(0)}
while self.tokenQueue:
yield self.tokenQueue.popleft()
def consumeNumberEntity(self, isHex):
"""This function returns either U+FFFD or the character based on the
decimal or hexadecimal representation. It also discards ";" if present.
If not present self.tokenQueue.append({"type": tokenTypes["ParseError"]}) is invoked.
"""
allowed = digits
radix = 10
if isHex:
allowed = hexDigits
radix = 16
charStack = []
# Consume all the characters that are in range while making sure we
# don't hit an EOF.
c = self.stream.char()
while c in allowed and c is not EOF:
charStack.append(c)
c = self.stream.char()
# Convert the set of characters consumed to an int.
charAsInt = int("".join(charStack), radix)
# Certain characters get replaced with others
if charAsInt in replacementCharacters:
char = replacementCharacters[charAsInt]
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"illegal-codepoint-for-numeric-entity",
"datavars": {"charAsInt": charAsInt}})
elif ((0xD800 <= charAsInt <= 0xDFFF) or
(charAsInt > 0x10FFFF)):
char = "\uFFFD"
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"illegal-codepoint-for-numeric-entity",
"datavars": {"charAsInt": charAsInt}})
else:
# Should speed up this check somehow (e.g. move the set to a constant)
if ((0x0001 <= charAsInt <= 0x0008) or
(0x000E <= charAsInt <= 0x001F) or
(0x007F <= charAsInt <= 0x009F) or
(0xFDD0 <= charAsInt <= 0xFDEF) or
charAsInt in frozenset([0x000B, 0xFFFE, 0xFFFF, 0x1FFFE,
0x1FFFF, 0x2FFFE, 0x2FFFF, 0x3FFFE,
0x3FFFF, 0x4FFFE, 0x4FFFF, 0x5FFFE,
0x5FFFF, 0x6FFFE, 0x6FFFF, 0x7FFFE,
0x7FFFF, 0x8FFFE, 0x8FFFF, 0x9FFFE,
0x9FFFF, 0xAFFFE, 0xAFFFF, 0xBFFFE,
0xBFFFF, 0xCFFFE, 0xCFFFF, 0xDFFFE,
0xDFFFF, 0xEFFFE, 0xEFFFF, 0xFFFFE,
0xFFFFF, 0x10FFFE, 0x10FFFF])):
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data":
"illegal-codepoint-for-numeric-entity",
"datavars": {"charAsInt": charAsInt}})
try:
# Try/except needed as UCS-2 Python builds' unichar only works
# within the BMP.
char = chr(charAsInt)
except ValueError:
v = charAsInt - 0x10000
char = chr(0xD800 | (v >> 10)) + chr(0xDC00 | (v & 0x3FF))
# Discard the ; if present. Otherwise, put it back on the queue and
# invoke parseError on parser.
if c != ";":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"numeric-entity-without-semicolon"})
self.stream.unget(c)
return char
def consumeEntity(self, allowedChar=None, fromAttribute=False):
# Initialise to the default output for when no entity is matched
output = "&"
charStack = [self.stream.char()]
if (charStack[0] in spaceCharacters or charStack[0] in (EOF, "<", "&") or
(allowedChar is not None and allowedChar == charStack[0])):
self.stream.unget(charStack[0])
elif charStack[0] == "#":
# Read the next character to see if it's hex or decimal
hex = False
charStack.append(self.stream.char())
if charStack[-1] in ("x", "X"):
hex = True
charStack.append(self.stream.char())
# charStack[-1] should be the first digit
if (hex and charStack[-1] in hexDigits) \
or (not hex and charStack[-1] in digits):
# At least one digit found, so consume the whole number
self.stream.unget(charStack[-1])
output = self.consumeNumberEntity(hex)
else:
# No digits found
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "expected-numeric-entity"})
self.stream.unget(charStack.pop())
output = "&" + "".join(charStack)
else:
# At this point in the process might have named entity. Entities
# are stored in the global variable "entities".
#
# Consume characters and compare to these to a substring of the
# entity names in the list until the substring no longer matches.
while (charStack[-1] is not EOF):
if not entitiesTrie.has_keys_with_prefix("".join(charStack)):
break
charStack.append(self.stream.char())
# At this point we have a string that starts with some characters
# that may match an entity
# Try to find the longest entity the string will match to take care
# of ¬i for instance.
try:
entityName = entitiesTrie.longest_prefix("".join(charStack[:-1]))
entityLength = len(entityName)
except KeyError:
entityName = None
if entityName is not None:
if entityName[-1] != ";":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"named-entity-without-semicolon"})
if (entityName[-1] != ";" and fromAttribute and
(charStack[entityLength] in asciiLetters or
charStack[entityLength] in digits or
charStack[entityLength] == "=")):
self.stream.unget(charStack.pop())
output = "&" + "".join(charStack)
else:
output = entities[entityName]
self.stream.unget(charStack.pop())
output += "".join(charStack[entityLength:])
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-named-entity"})
self.stream.unget(charStack.pop())
output = "&" + "".join(charStack)
if fromAttribute:
self.currentToken["data"][-1][1] += output
else:
if output in spaceCharacters:
tokenType = "SpaceCharacters"
else:
tokenType = "Characters"
self.tokenQueue.append({"type": tokenTypes[tokenType], "data": output})
def processEntityInAttribute(self, allowedChar):
"""This method replaces the need for "entityInAttributeValueState".
"""
self.consumeEntity(allowedChar=allowedChar, fromAttribute=True)
def emitCurrentToken(self):
"""This method is a generic handler for emitting the tags. It also sets
the state to "data" because that's what's needed after a token has been
emitted.
"""
token = self.currentToken
# Add token to the queue to be yielded
if (token["type"] in tagTokenTypes):
token["name"] = token["name"].translate(asciiUpper2Lower)
if token["type"] == tokenTypes["EndTag"]:
if token["data"]:
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "attributes-in-end-tag"})
if token["selfClosing"]:
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "self-closing-flag-on-end-tag"})
self.tokenQueue.append(token)
self.state = self.dataState
# Below are the various tokenizer states worked out.
def dataState(self):
data = self.stream.char()
if data == "&":
self.state = self.entityDataState
elif data == "<":
self.state = self.tagOpenState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\u0000"})
elif data is EOF:
# Tokenization ends.
return False
elif data in spaceCharacters:
# Directly after emitting a token you switch back to the "data
# state". At that point spaceCharacters are important so they are
# emitted separately.
self.tokenQueue.append({"type": tokenTypes["SpaceCharacters"], "data":
data + self.stream.charsUntil(spaceCharacters, True)})
# No need to update lastFourChars here, since the first space will
# have already been appended to lastFourChars and will have broken
# any <!-- or --> sequences
else:
chars = self.stream.charsUntil(("&", "<", "\u0000"))
self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
data + chars})
return True
def entityDataState(self):
self.consumeEntity()
self.state = self.dataState
return True
def rcdataState(self):
data = self.stream.char()
if data == "&":
self.state = self.characterReferenceInRcdata
elif data == "<":
self.state = self.rcdataLessThanSignState
elif data == EOF:
# Tokenization ends.
return False
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
elif data in spaceCharacters:
# Directly after emitting a token you switch back to the "data
# state". At that point spaceCharacters are important so they are
# emitted separately.
self.tokenQueue.append({"type": tokenTypes["SpaceCharacters"], "data":
data + self.stream.charsUntil(spaceCharacters, True)})
# No need to update lastFourChars here, since the first space will
# have already been appended to lastFourChars and will have broken
# any <!-- or --> sequences
else:
chars = self.stream.charsUntil(("&", "<", "\u0000"))
self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
data + chars})
return True
def characterReferenceInRcdata(self):
self.consumeEntity()
self.state = self.rcdataState
return True
def rawtextState(self):
data = self.stream.char()
if data == "<":
self.state = self.rawtextLessThanSignState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
elif data == EOF:
# Tokenization ends.
return False
else:
chars = self.stream.charsUntil(("<", "\u0000"))
self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
data + chars})
return True
def scriptDataState(self):
data = self.stream.char()
if data == "<":
self.state = self.scriptDataLessThanSignState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
elif data == EOF:
# Tokenization ends.
return False
else:
chars = self.stream.charsUntil(("<", "\u0000"))
self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
data + chars})
return True
def plaintextState(self):
data = self.stream.char()
if data == EOF:
# Tokenization ends.
return False
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
data + self.stream.charsUntil("\u0000")})
return True
def tagOpenState(self):
data = self.stream.char()
if data == "!":
self.state = self.markupDeclarationOpenState
elif data == "/":
self.state = self.closeTagOpenState
elif data in asciiLetters:
self.currentToken = {"type": tokenTypes["StartTag"],
"name": data, "data": [],
"selfClosing": False,
"selfClosingAcknowledged": False}
self.state = self.tagNameState
elif data == ">":
# XXX In theory it could be something besides a tag name. But
# do we really care?
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-tag-name-but-got-right-bracket"})
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<>"})
self.state = self.dataState
elif data == "?":
# XXX In theory it could be something besides a tag name. But
# do we really care?
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-tag-name-but-got-question-mark"})
self.stream.unget(data)
self.state = self.bogusCommentState
else:
# XXX
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-tag-name"})
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.stream.unget(data)
self.state = self.dataState
return True
def closeTagOpenState(self):
data = self.stream.char()
if data in asciiLetters:
self.currentToken = {"type": tokenTypes["EndTag"], "name": data,
"data": [], "selfClosing": False}
self.state = self.tagNameState
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-closing-tag-but-got-right-bracket"})
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-closing-tag-but-got-eof"})
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
self.state = self.dataState
else:
# XXX data can be _'_...
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-closing-tag-but-got-char",
"datavars": {"data": data}})
self.stream.unget(data)
self.state = self.bogusCommentState
return True
def tagNameState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.beforeAttributeNameState
elif data == ">":
self.emitCurrentToken()
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-tag-name"})
self.state = self.dataState
elif data == "/":
self.state = self.selfClosingStartTagState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["name"] += "\uFFFD"
else:
self.currentToken["name"] += data
# (Don't use charsUntil here, because tag names are
# very short and it's faster to not do anything fancy)
return True
def rcdataLessThanSignState(self):
data = self.stream.char()
if data == "/":
self.temporaryBuffer = ""
self.state = self.rcdataEndTagOpenState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.stream.unget(data)
self.state = self.rcdataState
return True
def rcdataEndTagOpenState(self):
data = self.stream.char()
if data in asciiLetters:
self.temporaryBuffer += data
self.state = self.rcdataEndTagNameState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
self.stream.unget(data)
self.state = self.rcdataState
return True
def rcdataEndTagNameState(self):
appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
data = self.stream.char()
if data in spaceCharacters and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.beforeAttributeNameState
elif data == "/" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.selfClosingStartTagState
elif data == ">" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.emitCurrentToken()
self.state = self.dataState
elif data in asciiLetters:
self.temporaryBuffer += data
else:
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "</" + self.temporaryBuffer})
self.stream.unget(data)
self.state = self.rcdataState
return True
def rawtextLessThanSignState(self):
data = self.stream.char()
if data == "/":
self.temporaryBuffer = ""
self.state = self.rawtextEndTagOpenState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.stream.unget(data)
self.state = self.rawtextState
return True
def rawtextEndTagOpenState(self):
data = self.stream.char()
if data in asciiLetters:
self.temporaryBuffer += data
self.state = self.rawtextEndTagNameState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
self.stream.unget(data)
self.state = self.rawtextState
return True
def rawtextEndTagNameState(self):
appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
data = self.stream.char()
if data in spaceCharacters and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.beforeAttributeNameState
elif data == "/" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.selfClosingStartTagState
elif data == ">" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.emitCurrentToken()
self.state = self.dataState
elif data in asciiLetters:
self.temporaryBuffer += data
else:
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "</" + self.temporaryBuffer})
self.stream.unget(data)
self.state = self.rawtextState
return True
def scriptDataLessThanSignState(self):
data = self.stream.char()
if data == "/":
self.temporaryBuffer = ""
self.state = self.scriptDataEndTagOpenState
elif data == "!":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<!"})
self.state = self.scriptDataEscapeStartState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.stream.unget(data)
self.state = self.scriptDataState
return True
def scriptDataEndTagOpenState(self):
data = self.stream.char()
if data in asciiLetters:
self.temporaryBuffer += data
self.state = self.scriptDataEndTagNameState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
self.stream.unget(data)
self.state = self.scriptDataState
return True
def scriptDataEndTagNameState(self):
appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
data = self.stream.char()
if data in spaceCharacters and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.beforeAttributeNameState
elif data == "/" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.selfClosingStartTagState
elif data == ">" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.emitCurrentToken()
self.state = self.dataState
elif data in asciiLetters:
self.temporaryBuffer += data
else:
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "</" + self.temporaryBuffer})
self.stream.unget(data)
self.state = self.scriptDataState
return True
def scriptDataEscapeStartState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
self.state = self.scriptDataEscapeStartDashState
else:
self.stream.unget(data)
self.state = self.scriptDataState
return True
def scriptDataEscapeStartDashState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
self.state = self.scriptDataEscapedDashDashState
else:
self.stream.unget(data)
self.state = self.scriptDataState
return True
def scriptDataEscapedState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
self.state = self.scriptDataEscapedDashState
elif data == "<":
self.state = self.scriptDataEscapedLessThanSignState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
elif data == EOF:
self.state = self.dataState
else:
chars = self.stream.charsUntil(("<", "-", "\u0000"))
self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
data + chars})
return True
def scriptDataEscapedDashState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
self.state = self.scriptDataEscapedDashDashState
elif data == "<":
self.state = self.scriptDataEscapedLessThanSignState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
self.state = self.scriptDataEscapedState
elif data == EOF:
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
self.state = self.scriptDataEscapedState
return True
def scriptDataEscapedDashDashState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
elif data == "<":
self.state = self.scriptDataEscapedLessThanSignState
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": ">"})
self.state = self.scriptDataState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
self.state = self.scriptDataEscapedState
elif data == EOF:
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
self.state = self.scriptDataEscapedState
return True
def scriptDataEscapedLessThanSignState(self):
data = self.stream.char()
if data == "/":
self.temporaryBuffer = ""
self.state = self.scriptDataEscapedEndTagOpenState
elif data in asciiLetters:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<" + data})
self.temporaryBuffer = data
self.state = self.scriptDataDoubleEscapeStartState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.stream.unget(data)
self.state = self.scriptDataEscapedState
return True
def scriptDataEscapedEndTagOpenState(self):
data = self.stream.char()
if data in asciiLetters:
self.temporaryBuffer = data
self.state = self.scriptDataEscapedEndTagNameState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
self.stream.unget(data)
self.state = self.scriptDataEscapedState
return True
def scriptDataEscapedEndTagNameState(self):
appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
data = self.stream.char()
if data in spaceCharacters and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.beforeAttributeNameState
elif data == "/" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.state = self.selfClosingStartTagState
elif data == ">" and appropriate:
self.currentToken = {"type": tokenTypes["EndTag"],
"name": self.temporaryBuffer,
"data": [], "selfClosing": False}
self.emitCurrentToken()
self.state = self.dataState
elif data in asciiLetters:
self.temporaryBuffer += data
else:
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "</" + self.temporaryBuffer})
self.stream.unget(data)
self.state = self.scriptDataEscapedState
return True
def scriptDataDoubleEscapeStartState(self):
data = self.stream.char()
if data in (spaceCharacters | frozenset(("/", ">"))):
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
if self.temporaryBuffer.lower() == "script":
self.state = self.scriptDataDoubleEscapedState
else:
self.state = self.scriptDataEscapedState
elif data in asciiLetters:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
self.temporaryBuffer += data
else:
self.stream.unget(data)
self.state = self.scriptDataEscapedState
return True
def scriptDataDoubleEscapedState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
self.state = self.scriptDataDoubleEscapedDashState
elif data == "<":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.state = self.scriptDataDoubleEscapedLessThanSignState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
elif data == EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-script-in-script"})
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
return True
def scriptDataDoubleEscapedDashState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
self.state = self.scriptDataDoubleEscapedDashDashState
elif data == "<":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.state = self.scriptDataDoubleEscapedLessThanSignState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
self.state = self.scriptDataDoubleEscapedState
elif data == EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-script-in-script"})
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
self.state = self.scriptDataDoubleEscapedState
return True
def scriptDataDoubleEscapedDashDashState(self):
data = self.stream.char()
if data == "-":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
elif data == "<":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
self.state = self.scriptDataDoubleEscapedLessThanSignState
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": ">"})
self.state = self.scriptDataState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": "\uFFFD"})
self.state = self.scriptDataDoubleEscapedState
elif data == EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-script-in-script"})
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
self.state = self.scriptDataDoubleEscapedState
return True
def scriptDataDoubleEscapedLessThanSignState(self):
data = self.stream.char()
if data == "/":
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "/"})
self.temporaryBuffer = ""
self.state = self.scriptDataDoubleEscapeEndState
else:
self.stream.unget(data)
self.state = self.scriptDataDoubleEscapedState
return True
def scriptDataDoubleEscapeEndState(self):
data = self.stream.char()
if data in (spaceCharacters | frozenset(("/", ">"))):
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
if self.temporaryBuffer.lower() == "script":
self.state = self.scriptDataEscapedState
else:
self.state = self.scriptDataDoubleEscapedState
elif data in asciiLetters:
self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
self.temporaryBuffer += data
else:
self.stream.unget(data)
self.state = self.scriptDataDoubleEscapedState
return True
def beforeAttributeNameState(self):
data = self.stream.char()
if data in spaceCharacters:
self.stream.charsUntil(spaceCharacters, True)
elif data in asciiLetters:
self.currentToken["data"].append([data, ""])
self.state = self.attributeNameState
elif data == ">":
self.emitCurrentToken()
elif data == "/":
self.state = self.selfClosingStartTagState
elif data in ("'", '"', "=", "<"):
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"invalid-character-in-attribute-name"})
self.currentToken["data"].append([data, ""])
self.state = self.attributeNameState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"].append(["\uFFFD", ""])
self.state = self.attributeNameState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-attribute-name-but-got-eof"})
self.state = self.dataState
else:
self.currentToken["data"].append([data, ""])
self.state = self.attributeNameState
return True
def attributeNameState(self):
data = self.stream.char()
leavingThisState = True
emitToken = False
if data == "=":
self.state = self.beforeAttributeValueState
elif data in asciiLetters:
self.currentToken["data"][-1][0] += data +\
self.stream.charsUntil(asciiLetters, True)
leavingThisState = False
elif data == ">":
# XXX If we emit here the attributes are converted to a dict
# without being checked and when the code below runs we error
# because data is a dict not a list
emitToken = True
elif data in spaceCharacters:
self.state = self.afterAttributeNameState
elif data == "/":
self.state = self.selfClosingStartTagState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"][-1][0] += "\uFFFD"
leavingThisState = False
elif data in ("'", '"', "<"):
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data":
"invalid-character-in-attribute-name"})
self.currentToken["data"][-1][0] += data
leavingThisState = False
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "eof-in-attribute-name"})
self.state = self.dataState
else:
self.currentToken["data"][-1][0] += data
leavingThisState = False
if leavingThisState:
# Attributes are not dropped at this stage. That happens when the
# start tag token is emitted so values can still be safely appended
# to attributes, but we do want to report the parse error in time.
self.currentToken["data"][-1][0] = (
self.currentToken["data"][-1][0].translate(asciiUpper2Lower))
for name, _ in self.currentToken["data"][:-1]:
if self.currentToken["data"][-1][0] == name:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"duplicate-attribute"})
break
# XXX Fix for above XXX
if emitToken:
self.emitCurrentToken()
return True
def afterAttributeNameState(self):
data = self.stream.char()
if data in spaceCharacters:
self.stream.charsUntil(spaceCharacters, True)
elif data == "=":
self.state = self.beforeAttributeValueState
elif data == ">":
self.emitCurrentToken()
elif data in asciiLetters:
self.currentToken["data"].append([data, ""])
self.state = self.attributeNameState
elif data == "/":
self.state = self.selfClosingStartTagState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"].append(["\uFFFD", ""])
self.state = self.attributeNameState
elif data in ("'", '"', "<"):
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"invalid-character-after-attribute-name"})
self.currentToken["data"].append([data, ""])
self.state = self.attributeNameState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-end-of-tag-but-got-eof"})
self.state = self.dataState
else:
self.currentToken["data"].append([data, ""])
self.state = self.attributeNameState
return True
def beforeAttributeValueState(self):
data = self.stream.char()
if data in spaceCharacters:
self.stream.charsUntil(spaceCharacters, True)
elif data == "\"":
self.state = self.attributeValueDoubleQuotedState
elif data == "&":
self.state = self.attributeValueUnQuotedState
self.stream.unget(data)
elif data == "'":
self.state = self.attributeValueSingleQuotedState
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-attribute-value-but-got-right-bracket"})
self.emitCurrentToken()
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"][-1][1] += "\uFFFD"
self.state = self.attributeValueUnQuotedState
elif data in ("=", "<", "`"):
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"equals-in-unquoted-attribute-value"})
self.currentToken["data"][-1][1] += data
self.state = self.attributeValueUnQuotedState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-attribute-value-but-got-eof"})
self.state = self.dataState
else:
self.currentToken["data"][-1][1] += data
self.state = self.attributeValueUnQuotedState
return True
def attributeValueDoubleQuotedState(self):
data = self.stream.char()
if data == "\"":
self.state = self.afterAttributeValueState
elif data == "&":
self.processEntityInAttribute('"')
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"][-1][1] += "\uFFFD"
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-attribute-value-double-quote"})
self.state = self.dataState
else:
self.currentToken["data"][-1][1] += data +\
self.stream.charsUntil(("\"", "&", "\u0000"))
return True
def attributeValueSingleQuotedState(self):
data = self.stream.char()
if data == "'":
self.state = self.afterAttributeValueState
elif data == "&":
self.processEntityInAttribute("'")
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"][-1][1] += "\uFFFD"
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-attribute-value-single-quote"})
self.state = self.dataState
else:
self.currentToken["data"][-1][1] += data +\
self.stream.charsUntil(("'", "&", "\u0000"))
return True
def attributeValueUnQuotedState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.beforeAttributeNameState
elif data == "&":
self.processEntityInAttribute(">")
elif data == ">":
self.emitCurrentToken()
elif data in ('"', "'", "=", "<", "`"):
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-character-in-unquoted-attribute-value"})
self.currentToken["data"][-1][1] += data
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"][-1][1] += "\uFFFD"
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-attribute-value-no-quotes"})
self.state = self.dataState
else:
self.currentToken["data"][-1][1] += data + self.stream.charsUntil(
frozenset(("&", ">", '"', "'", "=", "<", "`", "\u0000")) | spaceCharacters)
return True
def afterAttributeValueState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.beforeAttributeNameState
elif data == ">":
self.emitCurrentToken()
elif data == "/":
self.state = self.selfClosingStartTagState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-EOF-after-attribute-value"})
self.stream.unget(data)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-character-after-attribute-value"})
self.stream.unget(data)
self.state = self.beforeAttributeNameState
return True
def selfClosingStartTagState(self):
data = self.stream.char()
if data == ">":
self.currentToken["selfClosing"] = True
self.emitCurrentToken()
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data":
"unexpected-EOF-after-solidus-in-tag"})
self.stream.unget(data)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-character-after-solidus-in-tag"})
self.stream.unget(data)
self.state = self.beforeAttributeNameState
return True
def bogusCommentState(self):
# Make a new comment token and give it as value all the characters
# until the first > or EOF (charsUntil checks for EOF automatically)
# and emit it.
data = self.stream.charsUntil(">")
data = data.replace("\u0000", "\uFFFD")
self.tokenQueue.append(
{"type": tokenTypes["Comment"], "data": data})
# Eat the character directly after the bogus comment which is either a
# ">" or an EOF.
self.stream.char()
self.state = self.dataState
return True
def markupDeclarationOpenState(self):
charStack = [self.stream.char()]
if charStack[-1] == "-":
charStack.append(self.stream.char())
if charStack[-1] == "-":
self.currentToken = {"type": tokenTypes["Comment"], "data": ""}
self.state = self.commentStartState
return True
elif charStack[-1] in ('d', 'D'):
matched = True
for expected in (('o', 'O'), ('c', 'C'), ('t', 'T'),
('y', 'Y'), ('p', 'P'), ('e', 'E')):
charStack.append(self.stream.char())
if charStack[-1] not in expected:
matched = False
break
if matched:
self.currentToken = {"type": tokenTypes["Doctype"],
"name": "",
"publicId": None, "systemId": None,
"correct": True}
self.state = self.doctypeState
return True
elif (charStack[-1] == "[" and
self.parser is not None and
self.parser.tree.openElements and
self.parser.tree.openElements[-1].namespace != self.parser.tree.defaultNamespace):
matched = True
for expected in ["C", "D", "A", "T", "A", "["]:
charStack.append(self.stream.char())
if charStack[-1] != expected:
matched = False
break
if matched:
self.state = self.cdataSectionState
return True
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-dashes-or-doctype"})
while charStack:
self.stream.unget(charStack.pop())
self.state = self.bogusCommentState
return True
def commentStartState(self):
data = self.stream.char()
if data == "-":
self.state = self.commentStartDashState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"] += "\uFFFD"
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"incorrect-comment"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-comment"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["data"] += data
self.state = self.commentState
return True
def commentStartDashState(self):
data = self.stream.char()
if data == "-":
self.state = self.commentEndState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"] += "-\uFFFD"
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"incorrect-comment"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-comment"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["data"] += "-" + data
self.state = self.commentState
return True
def commentState(self):
data = self.stream.char()
if data == "-":
self.state = self.commentEndDashState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"] += "\uFFFD"
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "eof-in-comment"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["data"] += data + \
self.stream.charsUntil(("-", "\u0000"))
return True
def commentEndDashState(self):
data = self.stream.char()
if data == "-":
self.state = self.commentEndState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"] += "-\uFFFD"
self.state = self.commentState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-comment-end-dash"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["data"] += "-" + data
self.state = self.commentState
return True
def commentEndState(self):
data = self.stream.char()
if data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"] += "--\uFFFD"
self.state = self.commentState
elif data == "!":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-bang-after-double-dash-in-comment"})
self.state = self.commentEndBangState
elif data == "-":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-dash-after-double-dash-in-comment"})
self.currentToken["data"] += data
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-comment-double-dash"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
# XXX
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-comment"})
self.currentToken["data"] += "--" + data
self.state = self.commentState
return True
def commentEndBangState(self):
data = self.stream.char()
if data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data == "-":
self.currentToken["data"] += "--!"
self.state = self.commentEndDashState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["data"] += "--!\uFFFD"
self.state = self.commentState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-comment-end-bang-state"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["data"] += "--!" + data
self.state = self.commentState
return True
def doctypeState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.beforeDoctypeNameState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-doctype-name-but-got-eof"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"need-space-after-doctype"})
self.stream.unget(data)
self.state = self.beforeDoctypeNameState
return True
def beforeDoctypeNameState(self):
data = self.stream.char()
if data in spaceCharacters:
pass
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-doctype-name-but-got-right-bracket"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["name"] = "\uFFFD"
self.state = self.doctypeNameState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-doctype-name-but-got-eof"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["name"] = data
self.state = self.doctypeNameState
return True
def doctypeNameState(self):
data = self.stream.char()
if data in spaceCharacters:
self.currentToken["name"] = self.currentToken["name"].translate(asciiUpper2Lower)
self.state = self.afterDoctypeNameState
elif data == ">":
self.currentToken["name"] = self.currentToken["name"].translate(asciiUpper2Lower)
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["name"] += "\uFFFD"
self.state = self.doctypeNameState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype-name"})
self.currentToken["correct"] = False
self.currentToken["name"] = self.currentToken["name"].translate(asciiUpper2Lower)
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["name"] += data
return True
def afterDoctypeNameState(self):
data = self.stream.char()
if data in spaceCharacters:
pass
elif data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.currentToken["correct"] = False
self.stream.unget(data)
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
if data in ("p", "P"):
matched = True
for expected in (("u", "U"), ("b", "B"), ("l", "L"),
("i", "I"), ("c", "C")):
data = self.stream.char()
if data not in expected:
matched = False
break
if matched:
self.state = self.afterDoctypePublicKeywordState
return True
elif data in ("s", "S"):
matched = True
for expected in (("y", "Y"), ("s", "S"), ("t", "T"),
("e", "E"), ("m", "M")):
data = self.stream.char()
if data not in expected:
matched = False
break
if matched:
self.state = self.afterDoctypeSystemKeywordState
return True
# All the characters read before the current 'data' will be
# [a-zA-Z], so they're garbage in the bogus doctype and can be
# discarded; only the latest character might be '>' or EOF
# and needs to be ungetted
self.stream.unget(data)
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"expected-space-or-right-bracket-in-doctype", "datavars":
{"data": data}})
self.currentToken["correct"] = False
self.state = self.bogusDoctypeState
return True
def afterDoctypePublicKeywordState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.beforeDoctypePublicIdentifierState
elif data in ("'", '"'):
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.stream.unget(data)
self.state = self.beforeDoctypePublicIdentifierState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.stream.unget(data)
self.state = self.beforeDoctypePublicIdentifierState
return True
def beforeDoctypePublicIdentifierState(self):
data = self.stream.char()
if data in spaceCharacters:
pass
elif data == "\"":
self.currentToken["publicId"] = ""
self.state = self.doctypePublicIdentifierDoubleQuotedState
elif data == "'":
self.currentToken["publicId"] = ""
self.state = self.doctypePublicIdentifierSingleQuotedState
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-end-of-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["correct"] = False
self.state = self.bogusDoctypeState
return True
def doctypePublicIdentifierDoubleQuotedState(self):
data = self.stream.char()
if data == "\"":
self.state = self.afterDoctypePublicIdentifierState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["publicId"] += "\uFFFD"
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-end-of-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["publicId"] += data
return True
def doctypePublicIdentifierSingleQuotedState(self):
data = self.stream.char()
if data == "'":
self.state = self.afterDoctypePublicIdentifierState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["publicId"] += "\uFFFD"
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-end-of-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["publicId"] += data
return True
def afterDoctypePublicIdentifierState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.betweenDoctypePublicAndSystemIdentifiersState
elif data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data == '"':
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["systemId"] = ""
self.state = self.doctypeSystemIdentifierDoubleQuotedState
elif data == "'":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["systemId"] = ""
self.state = self.doctypeSystemIdentifierSingleQuotedState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["correct"] = False
self.state = self.bogusDoctypeState
return True
def betweenDoctypePublicAndSystemIdentifiersState(self):
data = self.stream.char()
if data in spaceCharacters:
pass
elif data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data == '"':
self.currentToken["systemId"] = ""
self.state = self.doctypeSystemIdentifierDoubleQuotedState
elif data == "'":
self.currentToken["systemId"] = ""
self.state = self.doctypeSystemIdentifierSingleQuotedState
elif data == EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["correct"] = False
self.state = self.bogusDoctypeState
return True
def afterDoctypeSystemKeywordState(self):
data = self.stream.char()
if data in spaceCharacters:
self.state = self.beforeDoctypeSystemIdentifierState
elif data in ("'", '"'):
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.stream.unget(data)
self.state = self.beforeDoctypeSystemIdentifierState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.stream.unget(data)
self.state = self.beforeDoctypeSystemIdentifierState
return True
def beforeDoctypeSystemIdentifierState(self):
data = self.stream.char()
if data in spaceCharacters:
pass
elif data == "\"":
self.currentToken["systemId"] = ""
self.state = self.doctypeSystemIdentifierDoubleQuotedState
elif data == "'":
self.currentToken["systemId"] = ""
self.state = self.doctypeSystemIdentifierSingleQuotedState
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.currentToken["correct"] = False
self.state = self.bogusDoctypeState
return True
def doctypeSystemIdentifierDoubleQuotedState(self):
data = self.stream.char()
if data == "\"":
self.state = self.afterDoctypeSystemIdentifierState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["systemId"] += "\uFFFD"
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-end-of-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["systemId"] += data
return True
def doctypeSystemIdentifierSingleQuotedState(self):
data = self.stream.char()
if data == "'":
self.state = self.afterDoctypeSystemIdentifierState
elif data == "\u0000":
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
self.currentToken["systemId"] += "\uFFFD"
elif data == ">":
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-end-of-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.currentToken["systemId"] += data
return True
def afterDoctypeSystemIdentifierState(self):
data = self.stream.char()
if data in spaceCharacters:
pass
elif data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"eof-in-doctype"})
self.currentToken["correct"] = False
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
"unexpected-char-in-doctype"})
self.state = self.bogusDoctypeState
return True
def bogusDoctypeState(self):
data = self.stream.char()
if data == ">":
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
elif data is EOF:
# XXX EMIT
self.stream.unget(data)
self.tokenQueue.append(self.currentToken)
self.state = self.dataState
else:
pass
return True
def cdataSectionState(self):
data = []
while True:
data.append(self.stream.charsUntil("]"))
data.append(self.stream.charsUntil(">"))
char = self.stream.char()
if char == EOF:
break
else:
assert char == ">"
if data[-1][-2:] == "]]":
data[-1] = data[-1][:-2]
break
else:
data.append(char)
data = "".join(data) # pylint:disable=redefined-variable-type
# Deal with null here rather than in the parser
nullCount = data.count("\u0000")
if nullCount > 0:
for _ in range(nullCount):
self.tokenQueue.append({"type": tokenTypes["ParseError"],
"data": "invalid-codepoint"})
data = data.replace("\u0000", "\uFFFD")
if data:
self.tokenQueue.append({"type": tokenTypes["Characters"],
"data": data})
self.state = self.dataState
return True
pip/_vendor/html5lib/html5parser.py 0000644 00000344662 14751155150 0013353 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import with_metaclass, viewkeys, PY3
import types
try:
from collections import OrderedDict
except ImportError:
from pip._vendor.ordereddict import OrderedDict
from . import _inputstream
from . import _tokenizer
from . import treebuilders
from .treebuilders.base import Marker
from . import _utils
from .constants import (
spaceCharacters, asciiUpper2Lower,
specialElements, headingElements, cdataElements, rcdataElements,
tokenTypes, tagTokenTypes,
namespaces,
htmlIntegrationPointElements, mathmlTextIntegrationPointElements,
adjustForeignAttributes as adjustForeignAttributesMap,
adjustMathMLAttributes, adjustSVGAttributes,
E,
ReparseException
)
def parse(doc, treebuilder="etree", namespaceHTMLElements=True, **kwargs):
"""Parse a string or file-like object into a tree"""
tb = treebuilders.getTreeBuilder(treebuilder)
p = HTMLParser(tb, namespaceHTMLElements=namespaceHTMLElements)
return p.parse(doc, **kwargs)
def parseFragment(doc, container="div", treebuilder="etree", namespaceHTMLElements=True, **kwargs):
tb = treebuilders.getTreeBuilder(treebuilder)
p = HTMLParser(tb, namespaceHTMLElements=namespaceHTMLElements)
return p.parseFragment(doc, container=container, **kwargs)
def method_decorator_metaclass(function):
class Decorated(type):
def __new__(meta, classname, bases, classDict):
for attributeName, attribute in classDict.items():
if isinstance(attribute, types.FunctionType):
attribute = function(attribute)
classDict[attributeName] = attribute
return type.__new__(meta, classname, bases, classDict)
return Decorated
class HTMLParser(object):
"""HTML parser. Generates a tree structure from a stream of (possibly
malformed) HTML"""
def __init__(self, tree=None, strict=False, namespaceHTMLElements=True, debug=False):
"""
strict - raise an exception when a parse error is encountered
tree - a treebuilder class controlling the type of tree that will be
returned. Built in treebuilders can be accessed through
html5lib.treebuilders.getTreeBuilder(treeType)
"""
# Raise an exception on the first error encountered
self.strict = strict
if tree is None:
tree = treebuilders.getTreeBuilder("etree")
self.tree = tree(namespaceHTMLElements)
self.errors = []
self.phases = dict([(name, cls(self, self.tree)) for name, cls in
getPhases(debug).items()])
def _parse(self, stream, innerHTML=False, container="div", scripting=False, **kwargs):
self.innerHTMLMode = innerHTML
self.container = container
self.scripting = scripting
self.tokenizer = _tokenizer.HTMLTokenizer(stream, parser=self, **kwargs)
self.reset()
try:
self.mainLoop()
except ReparseException:
self.reset()
self.mainLoop()
def reset(self):
self.tree.reset()
self.firstStartTag = False
self.errors = []
self.log = [] # only used with debug mode
# "quirks" / "limited quirks" / "no quirks"
self.compatMode = "no quirks"
if self.innerHTMLMode:
self.innerHTML = self.container.lower()
if self.innerHTML in cdataElements:
self.tokenizer.state = self.tokenizer.rcdataState
elif self.innerHTML in rcdataElements:
self.tokenizer.state = self.tokenizer.rawtextState
elif self.innerHTML == 'plaintext':
self.tokenizer.state = self.tokenizer.plaintextState
else:
# state already is data state
# self.tokenizer.state = self.tokenizer.dataState
pass
self.phase = self.phases["beforeHtml"]
self.phase.insertHtmlElement()
self.resetInsertionMode()
else:
self.innerHTML = False # pylint:disable=redefined-variable-type
self.phase = self.phases["initial"]
self.lastPhase = None
self.beforeRCDataPhase = None
self.framesetOK = True
@property
def documentEncoding(self):
"""The name of the character encoding
that was used to decode the input stream,
or :obj:`None` if that is not determined yet.
"""
if not hasattr(self, 'tokenizer'):
return None
return self.tokenizer.stream.charEncoding[0].name
def isHTMLIntegrationPoint(self, element):
if (element.name == "annotation-xml" and
element.namespace == namespaces["mathml"]):
return ("encoding" in element.attributes and
element.attributes["encoding"].translate(
asciiUpper2Lower) in
("text/html", "application/xhtml+xml"))
else:
return (element.namespace, element.name) in htmlIntegrationPointElements
def isMathMLTextIntegrationPoint(self, element):
return (element.namespace, element.name) in mathmlTextIntegrationPointElements
def mainLoop(self):
CharactersToken = tokenTypes["Characters"]
SpaceCharactersToken = tokenTypes["SpaceCharacters"]
StartTagToken = tokenTypes["StartTag"]
EndTagToken = tokenTypes["EndTag"]
CommentToken = tokenTypes["Comment"]
DoctypeToken = tokenTypes["Doctype"]
ParseErrorToken = tokenTypes["ParseError"]
for token in self.normalizedTokens():
prev_token = None
new_token = token
while new_token is not None:
prev_token = new_token
currentNode = self.tree.openElements[-1] if self.tree.openElements else None
currentNodeNamespace = currentNode.namespace if currentNode else None
currentNodeName = currentNode.name if currentNode else None
type = new_token["type"]
if type == ParseErrorToken:
self.parseError(new_token["data"], new_token.get("datavars", {}))
new_token = None
else:
if (len(self.tree.openElements) == 0 or
currentNodeNamespace == self.tree.defaultNamespace or
(self.isMathMLTextIntegrationPoint(currentNode) and
((type == StartTagToken and
token["name"] not in frozenset(["mglyph", "malignmark"])) or
type in (CharactersToken, SpaceCharactersToken))) or
(currentNodeNamespace == namespaces["mathml"] and
currentNodeName == "annotation-xml" and
type == StartTagToken and
token["name"] == "svg") or
(self.isHTMLIntegrationPoint(currentNode) and
type in (StartTagToken, CharactersToken, SpaceCharactersToken))):
phase = self.phase
else:
phase = self.phases["inForeignContent"]
if type == CharactersToken:
new_token = phase.processCharacters(new_token)
elif type == SpaceCharactersToken:
new_token = phase.processSpaceCharacters(new_token)
elif type == StartTagToken:
new_token = phase.processStartTag(new_token)
elif type == EndTagToken:
new_token = phase.processEndTag(new_token)
elif type == CommentToken:
new_token = phase.processComment(new_token)
elif type == DoctypeToken:
new_token = phase.processDoctype(new_token)
if (type == StartTagToken and prev_token["selfClosing"] and
not prev_token["selfClosingAcknowledged"]):
self.parseError("non-void-element-with-trailing-solidus",
{"name": prev_token["name"]})
# When the loop finishes it's EOF
reprocess = True
phases = []
while reprocess:
phases.append(self.phase)
reprocess = self.phase.processEOF()
if reprocess:
assert self.phase not in phases
def normalizedTokens(self):
for token in self.tokenizer:
yield self.normalizeToken(token)
def parse(self, stream, *args, **kwargs):
"""Parse a HTML document into a well-formed tree
stream - a filelike object or string containing the HTML to be parsed
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
scripting - treat noscript elements as if javascript was turned on
"""
self._parse(stream, False, None, *args, **kwargs)
return self.tree.getDocument()
def parseFragment(self, stream, *args, **kwargs):
"""Parse a HTML fragment into a well-formed tree fragment
container - name of the element we're setting the innerHTML property
if set to None, default to 'div'
stream - a filelike object or string containing the HTML to be parsed
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
scripting - treat noscript elements as if javascript was turned on
"""
self._parse(stream, True, *args, **kwargs)
return self.tree.getFragment()
def parseError(self, errorcode="XXX-undefined-error", datavars=None):
# XXX The idea is to make errorcode mandatory.
if datavars is None:
datavars = {}
self.errors.append((self.tokenizer.stream.position(), errorcode, datavars))
if self.strict:
raise ParseError(E[errorcode] % datavars)
def normalizeToken(self, token):
""" HTML5 specific normalizations to the token stream """
if token["type"] == tokenTypes["StartTag"]:
raw = token["data"]
token["data"] = OrderedDict(raw)
if len(raw) > len(token["data"]):
# we had some duplicated attribute, fix so first wins
token["data"].update(raw[::-1])
return token
def adjustMathMLAttributes(self, token):
adjust_attributes(token, adjustMathMLAttributes)
def adjustSVGAttributes(self, token):
adjust_attributes(token, adjustSVGAttributes)
def adjustForeignAttributes(self, token):
adjust_attributes(token, adjustForeignAttributesMap)
def reparseTokenNormal(self, token):
# pylint:disable=unused-argument
self.parser.phase()
def resetInsertionMode(self):
# The name of this method is mostly historical. (It's also used in the
# specification.)
last = False
newModes = {
"select": "inSelect",
"td": "inCell",
"th": "inCell",
"tr": "inRow",
"tbody": "inTableBody",
"thead": "inTableBody",
"tfoot": "inTableBody",
"caption": "inCaption",
"colgroup": "inColumnGroup",
"table": "inTable",
"head": "inBody",
"body": "inBody",
"frameset": "inFrameset",
"html": "beforeHead"
}
for node in self.tree.openElements[::-1]:
nodeName = node.name
new_phase = None
if node == self.tree.openElements[0]:
assert self.innerHTML
last = True
nodeName = self.innerHTML
# Check for conditions that should only happen in the innerHTML
# case
if nodeName in ("select", "colgroup", "head", "html"):
assert self.innerHTML
if not last and node.namespace != self.tree.defaultNamespace:
continue
if nodeName in newModes:
new_phase = self.phases[newModes[nodeName]]
break
elif last:
new_phase = self.phases["inBody"]
break
self.phase = new_phase
def parseRCDataRawtext(self, token, contentType):
"""Generic RCDATA/RAWTEXT Parsing algorithm
contentType - RCDATA or RAWTEXT
"""
assert contentType in ("RAWTEXT", "RCDATA")
self.tree.insertElement(token)
if contentType == "RAWTEXT":
self.tokenizer.state = self.tokenizer.rawtextState
else:
self.tokenizer.state = self.tokenizer.rcdataState
self.originalPhase = self.phase
self.phase = self.phases["text"]
@_utils.memoize
def getPhases(debug):
def log(function):
"""Logger that records which phase processes each token"""
type_names = dict((value, key) for key, value in
tokenTypes.items())
def wrapped(self, *args, **kwargs):
if function.__name__.startswith("process") and len(args) > 0:
token = args[0]
try:
info = {"type": type_names[token['type']]}
except:
raise
if token['type'] in tagTokenTypes:
info["name"] = token['name']
self.parser.log.append((self.parser.tokenizer.state.__name__,
self.parser.phase.__class__.__name__,
self.__class__.__name__,
function.__name__,
info))
return function(self, *args, **kwargs)
else:
return function(self, *args, **kwargs)
return wrapped
def getMetaclass(use_metaclass, metaclass_func):
if use_metaclass:
return method_decorator_metaclass(metaclass_func)
else:
return type
# pylint:disable=unused-argument
class Phase(with_metaclass(getMetaclass(debug, log))):
"""Base class for helper object that implements each phase of processing
"""
def __init__(self, parser, tree):
self.parser = parser
self.tree = tree
def processEOF(self):
raise NotImplementedError
def processComment(self, token):
# For most phases the following is correct. Where it's not it will be
# overridden.
self.tree.insertComment(token, self.tree.openElements[-1])
def processDoctype(self, token):
self.parser.parseError("unexpected-doctype")
def processCharacters(self, token):
self.tree.insertText(token["data"])
def processSpaceCharacters(self, token):
self.tree.insertText(token["data"])
def processStartTag(self, token):
return self.startTagHandler[token["name"]](token)
def startTagHtml(self, token):
if not self.parser.firstStartTag and token["name"] == "html":
self.parser.parseError("non-html-root")
# XXX Need a check here to see if the first start tag token emitted is
# this token... If it's not, invoke self.parser.parseError().
for attr, value in token["data"].items():
if attr not in self.tree.openElements[0].attributes:
self.tree.openElements[0].attributes[attr] = value
self.parser.firstStartTag = False
def processEndTag(self, token):
return self.endTagHandler[token["name"]](token)
class InitialPhase(Phase):
def processSpaceCharacters(self, token):
pass
def processComment(self, token):
self.tree.insertComment(token, self.tree.document)
def processDoctype(self, token):
name = token["name"]
publicId = token["publicId"]
systemId = token["systemId"]
correct = token["correct"]
if (name != "html" or publicId is not None or
systemId is not None and systemId != "about:legacy-compat"):
self.parser.parseError("unknown-doctype")
if publicId is None:
publicId = ""
self.tree.insertDoctype(token)
if publicId != "":
publicId = publicId.translate(asciiUpper2Lower)
if (not correct or token["name"] != "html" or
publicId.startswith(
("+//silmaril//dtd html pro v0r11 19970101//",
"-//advasoft ltd//dtd html 3.0 aswedit + extensions//",
"-//as//dtd html 3.0 aswedit + extensions//",
"-//ietf//dtd html 2.0 level 1//",
"-//ietf//dtd html 2.0 level 2//",
"-//ietf//dtd html 2.0 strict level 1//",
"-//ietf//dtd html 2.0 strict level 2//",
"-//ietf//dtd html 2.0 strict//",
"-//ietf//dtd html 2.0//",
"-//ietf//dtd html 2.1e//",
"-//ietf//dtd html 3.0//",
"-//ietf//dtd html 3.2 final//",
"-//ietf//dtd html 3.2//",
"-//ietf//dtd html 3//",
"-//ietf//dtd html level 0//",
"-//ietf//dtd html level 1//",
"-//ietf//dtd html level 2//",
"-//ietf//dtd html level 3//",
"-//ietf//dtd html strict level 0//",
"-//ietf//dtd html strict level 1//",
"-//ietf//dtd html strict level 2//",
"-//ietf//dtd html strict level 3//",
"-//ietf//dtd html strict//",
"-//ietf//dtd html//",
"-//metrius//dtd metrius presentational//",
"-//microsoft//dtd internet explorer 2.0 html strict//",
"-//microsoft//dtd internet explorer 2.0 html//",
"-//microsoft//dtd internet explorer 2.0 tables//",
"-//microsoft//dtd internet explorer 3.0 html strict//",
"-//microsoft//dtd internet explorer 3.0 html//",
"-//microsoft//dtd internet explorer 3.0 tables//",
"-//netscape comm. corp.//dtd html//",
"-//netscape comm. corp.//dtd strict html//",
"-//o'reilly and associates//dtd html 2.0//",
"-//o'reilly and associates//dtd html extended 1.0//",
"-//o'reilly and associates//dtd html extended relaxed 1.0//",
"-//softquad software//dtd hotmetal pro 6.0::19990601::extensions to html 4.0//",
"-//softquad//dtd hotmetal pro 4.0::19971010::extensions to html 4.0//",
"-//spyglass//dtd html 2.0 extended//",
"-//sq//dtd html 2.0 hotmetal + extensions//",
"-//sun microsystems corp.//dtd hotjava html//",
"-//sun microsystems corp.//dtd hotjava strict html//",
"-//w3c//dtd html 3 1995-03-24//",
"-//w3c//dtd html 3.2 draft//",
"-//w3c//dtd html 3.2 final//",
"-//w3c//dtd html 3.2//",
"-//w3c//dtd html 3.2s draft//",
"-//w3c//dtd html 4.0 frameset//",
"-//w3c//dtd html 4.0 transitional//",
"-//w3c//dtd html experimental 19960712//",
"-//w3c//dtd html experimental 970421//",
"-//w3c//dtd w3 html//",
"-//w3o//dtd w3 html 3.0//",
"-//webtechs//dtd mozilla html 2.0//",
"-//webtechs//dtd mozilla html//")) or
publicId in ("-//w3o//dtd w3 html strict 3.0//en//",
"-/w3c/dtd html 4.0 transitional/en",
"html") or
publicId.startswith(
("-//w3c//dtd html 4.01 frameset//",
"-//w3c//dtd html 4.01 transitional//")) and
systemId is None or
systemId and systemId.lower() == "http://www.ibm.com/data/dtd/v11/ibmxhtml1-transitional.dtd"):
self.parser.compatMode = "quirks"
elif (publicId.startswith(
("-//w3c//dtd xhtml 1.0 frameset//",
"-//w3c//dtd xhtml 1.0 transitional//")) or
publicId.startswith(
("-//w3c//dtd html 4.01 frameset//",
"-//w3c//dtd html 4.01 transitional//")) and
systemId is not None):
self.parser.compatMode = "limited quirks"
self.parser.phase = self.parser.phases["beforeHtml"]
def anythingElse(self):
self.parser.compatMode = "quirks"
self.parser.phase = self.parser.phases["beforeHtml"]
def processCharacters(self, token):
self.parser.parseError("expected-doctype-but-got-chars")
self.anythingElse()
return token
def processStartTag(self, token):
self.parser.parseError("expected-doctype-but-got-start-tag",
{"name": token["name"]})
self.anythingElse()
return token
def processEndTag(self, token):
self.parser.parseError("expected-doctype-but-got-end-tag",
{"name": token["name"]})
self.anythingElse()
return token
def processEOF(self):
self.parser.parseError("expected-doctype-but-got-eof")
self.anythingElse()
return True
class BeforeHtmlPhase(Phase):
# helper methods
def insertHtmlElement(self):
self.tree.insertRoot(impliedTagToken("html", "StartTag"))
self.parser.phase = self.parser.phases["beforeHead"]
# other
def processEOF(self):
self.insertHtmlElement()
return True
def processComment(self, token):
self.tree.insertComment(token, self.tree.document)
def processSpaceCharacters(self, token):
pass
def processCharacters(self, token):
self.insertHtmlElement()
return token
def processStartTag(self, token):
if token["name"] == "html":
self.parser.firstStartTag = True
self.insertHtmlElement()
return token
def processEndTag(self, token):
if token["name"] not in ("head", "body", "html", "br"):
self.parser.parseError("unexpected-end-tag-before-html",
{"name": token["name"]})
else:
self.insertHtmlElement()
return token
class BeforeHeadPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("head", self.startTagHead)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
(("head", "body", "html", "br"), self.endTagImplyHead)
])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
self.startTagHead(impliedTagToken("head", "StartTag"))
return True
def processSpaceCharacters(self, token):
pass
def processCharacters(self, token):
self.startTagHead(impliedTagToken("head", "StartTag"))
return token
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagHead(self, token):
self.tree.insertElement(token)
self.tree.headPointer = self.tree.openElements[-1]
self.parser.phase = self.parser.phases["inHead"]
def startTagOther(self, token):
self.startTagHead(impliedTagToken("head", "StartTag"))
return token
def endTagImplyHead(self, token):
self.startTagHead(impliedTagToken("head", "StartTag"))
return token
def endTagOther(self, token):
self.parser.parseError("end-tag-after-implied-root",
{"name": token["name"]})
class InHeadPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("title", self.startTagTitle),
(("noframes", "style"), self.startTagNoFramesStyle),
("noscript", self.startTagNoscript),
("script", self.startTagScript),
(("base", "basefont", "bgsound", "command", "link"),
self.startTagBaseLinkCommand),
("meta", self.startTagMeta),
("head", self.startTagHead)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("head", self.endTagHead),
(("br", "html", "body"), self.endTagHtmlBodyBr)
])
self.endTagHandler.default = self.endTagOther
# the real thing
def processEOF(self):
self.anythingElse()
return True
def processCharacters(self, token):
self.anythingElse()
return token
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagHead(self, token):
self.parser.parseError("two-heads-are-not-better-than-one")
def startTagBaseLinkCommand(self, token):
self.tree.insertElement(token)
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
def startTagMeta(self, token):
self.tree.insertElement(token)
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
attributes = token["data"]
if self.parser.tokenizer.stream.charEncoding[1] == "tentative":
if "charset" in attributes:
self.parser.tokenizer.stream.changeEncoding(attributes["charset"])
elif ("content" in attributes and
"http-equiv" in attributes and
attributes["http-equiv"].lower() == "content-type"):
# Encoding it as UTF-8 here is a hack, as really we should pass
# the abstract Unicode string, and just use the
# ContentAttrParser on that, but using UTF-8 allows all chars
# to be encoded and as a ASCII-superset works.
data = _inputstream.EncodingBytes(attributes["content"].encode("utf-8"))
parser = _inputstream.ContentAttrParser(data)
codec = parser.parse()
self.parser.tokenizer.stream.changeEncoding(codec)
def startTagTitle(self, token):
self.parser.parseRCDataRawtext(token, "RCDATA")
def startTagNoFramesStyle(self, token):
# Need to decide whether to implement the scripting-disabled case
self.parser.parseRCDataRawtext(token, "RAWTEXT")
def startTagNoscript(self, token):
if self.parser.scripting:
self.parser.parseRCDataRawtext(token, "RAWTEXT")
else:
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inHeadNoscript"]
def startTagScript(self, token):
self.tree.insertElement(token)
self.parser.tokenizer.state = self.parser.tokenizer.scriptDataState
self.parser.originalPhase = self.parser.phase
self.parser.phase = self.parser.phases["text"]
def startTagOther(self, token):
self.anythingElse()
return token
def endTagHead(self, token):
node = self.parser.tree.openElements.pop()
assert node.name == "head", "Expected head got %s" % node.name
self.parser.phase = self.parser.phases["afterHead"]
def endTagHtmlBodyBr(self, token):
self.anythingElse()
return token
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def anythingElse(self):
self.endTagHead(impliedTagToken("head"))
class InHeadNoscriptPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
(("basefont", "bgsound", "link", "meta", "noframes", "style"), self.startTagBaseLinkCommand),
(("head", "noscript"), self.startTagHeadNoscript),
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("noscript", self.endTagNoscript),
("br", self.endTagBr),
])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
self.parser.parseError("eof-in-head-noscript")
self.anythingElse()
return True
def processComment(self, token):
return self.parser.phases["inHead"].processComment(token)
def processCharacters(self, token):
self.parser.parseError("char-in-head-noscript")
self.anythingElse()
return token
def processSpaceCharacters(self, token):
return self.parser.phases["inHead"].processSpaceCharacters(token)
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagBaseLinkCommand(self, token):
return self.parser.phases["inHead"].processStartTag(token)
def startTagHeadNoscript(self, token):
self.parser.parseError("unexpected-start-tag", {"name": token["name"]})
def startTagOther(self, token):
self.parser.parseError("unexpected-inhead-noscript-tag", {"name": token["name"]})
self.anythingElse()
return token
def endTagNoscript(self, token):
node = self.parser.tree.openElements.pop()
assert node.name == "noscript", "Expected noscript got %s" % node.name
self.parser.phase = self.parser.phases["inHead"]
def endTagBr(self, token):
self.parser.parseError("unexpected-inhead-noscript-tag", {"name": token["name"]})
self.anythingElse()
return token
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def anythingElse(self):
# Caller must raise parse error first!
self.endTagNoscript(impliedTagToken("noscript"))
class AfterHeadPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("body", self.startTagBody),
("frameset", self.startTagFrameset),
(("base", "basefont", "bgsound", "link", "meta", "noframes", "script",
"style", "title"),
self.startTagFromHead),
("head", self.startTagHead)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([(("body", "html", "br"),
self.endTagHtmlBodyBr)])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
self.anythingElse()
return True
def processCharacters(self, token):
self.anythingElse()
return token
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagBody(self, token):
self.parser.framesetOK = False
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inBody"]
def startTagFrameset(self, token):
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inFrameset"]
def startTagFromHead(self, token):
self.parser.parseError("unexpected-start-tag-out-of-my-head",
{"name": token["name"]})
self.tree.openElements.append(self.tree.headPointer)
self.parser.phases["inHead"].processStartTag(token)
for node in self.tree.openElements[::-1]:
if node.name == "head":
self.tree.openElements.remove(node)
break
def startTagHead(self, token):
self.parser.parseError("unexpected-start-tag", {"name": token["name"]})
def startTagOther(self, token):
self.anythingElse()
return token
def endTagHtmlBodyBr(self, token):
self.anythingElse()
return token
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def anythingElse(self):
self.tree.insertElement(impliedTagToken("body", "StartTag"))
self.parser.phase = self.parser.phases["inBody"]
self.parser.framesetOK = True
class InBodyPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#parsing-main-inbody
# the really-really-really-very crazy mode
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
# Set this to the default handler
self.processSpaceCharacters = self.processSpaceCharactersNonPre
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
(("base", "basefont", "bgsound", "command", "link", "meta",
"script", "style", "title"),
self.startTagProcessInHead),
("body", self.startTagBody),
("frameset", self.startTagFrameset),
(("address", "article", "aside", "blockquote", "center", "details",
"dir", "div", "dl", "fieldset", "figcaption", "figure",
"footer", "header", "hgroup", "main", "menu", "nav", "ol", "p",
"section", "summary", "ul"),
self.startTagCloseP),
(headingElements, self.startTagHeading),
(("pre", "listing"), self.startTagPreListing),
("form", self.startTagForm),
(("li", "dd", "dt"), self.startTagListItem),
("plaintext", self.startTagPlaintext),
("a", self.startTagA),
(("b", "big", "code", "em", "font", "i", "s", "small", "strike",
"strong", "tt", "u"), self.startTagFormatting),
("nobr", self.startTagNobr),
("button", self.startTagButton),
(("applet", "marquee", "object"), self.startTagAppletMarqueeObject),
("xmp", self.startTagXmp),
("table", self.startTagTable),
(("area", "br", "embed", "img", "keygen", "wbr"),
self.startTagVoidFormatting),
(("param", "source", "track"), self.startTagParamSource),
("input", self.startTagInput),
("hr", self.startTagHr),
("image", self.startTagImage),
("isindex", self.startTagIsIndex),
("textarea", self.startTagTextarea),
("iframe", self.startTagIFrame),
("noscript", self.startTagNoscript),
(("noembed", "noframes"), self.startTagRawtext),
("select", self.startTagSelect),
(("rp", "rt"), self.startTagRpRt),
(("option", "optgroup"), self.startTagOpt),
(("math"), self.startTagMath),
(("svg"), self.startTagSvg),
(("caption", "col", "colgroup", "frame", "head",
"tbody", "td", "tfoot", "th", "thead",
"tr"), self.startTagMisplaced)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("body", self.endTagBody),
("html", self.endTagHtml),
(("address", "article", "aside", "blockquote", "button", "center",
"details", "dialog", "dir", "div", "dl", "fieldset", "figcaption", "figure",
"footer", "header", "hgroup", "listing", "main", "menu", "nav", "ol", "pre",
"section", "summary", "ul"), self.endTagBlock),
("form", self.endTagForm),
("p", self.endTagP),
(("dd", "dt", "li"), self.endTagListItem),
(headingElements, self.endTagHeading),
(("a", "b", "big", "code", "em", "font", "i", "nobr", "s", "small",
"strike", "strong", "tt", "u"), self.endTagFormatting),
(("applet", "marquee", "object"), self.endTagAppletMarqueeObject),
("br", self.endTagBr),
])
self.endTagHandler.default = self.endTagOther
def isMatchingFormattingElement(self, node1, node2):
return (node1.name == node2.name and
node1.namespace == node2.namespace and
node1.attributes == node2.attributes)
# helper
def addFormattingElement(self, token):
self.tree.insertElement(token)
element = self.tree.openElements[-1]
matchingElements = []
for node in self.tree.activeFormattingElements[::-1]:
if node is Marker:
break
elif self.isMatchingFormattingElement(node, element):
matchingElements.append(node)
assert len(matchingElements) <= 3
if len(matchingElements) == 3:
self.tree.activeFormattingElements.remove(matchingElements[-1])
self.tree.activeFormattingElements.append(element)
# the real deal
def processEOF(self):
allowed_elements = frozenset(("dd", "dt", "li", "p", "tbody", "td",
"tfoot", "th", "thead", "tr", "body",
"html"))
for node in self.tree.openElements[::-1]:
if node.name not in allowed_elements:
self.parser.parseError("expected-closing-tag-but-got-eof")
break
# Stop parsing
def processSpaceCharactersDropNewline(self, token):
# Sometimes (start of <pre>, <listing>, and <textarea> blocks) we
# want to drop leading newlines
data = token["data"]
self.processSpaceCharacters = self.processSpaceCharactersNonPre
if (data.startswith("\n") and
self.tree.openElements[-1].name in ("pre", "listing", "textarea") and
not self.tree.openElements[-1].hasContent()):
data = data[1:]
if data:
self.tree.reconstructActiveFormattingElements()
self.tree.insertText(data)
def processCharacters(self, token):
if token["data"] == "\u0000":
# The tokenizer should always emit null on its own
return
self.tree.reconstructActiveFormattingElements()
self.tree.insertText(token["data"])
# This must be bad for performance
if (self.parser.framesetOK and
any([char not in spaceCharacters
for char in token["data"]])):
self.parser.framesetOK = False
def processSpaceCharactersNonPre(self, token):
self.tree.reconstructActiveFormattingElements()
self.tree.insertText(token["data"])
def startTagProcessInHead(self, token):
return self.parser.phases["inHead"].processStartTag(token)
def startTagBody(self, token):
self.parser.parseError("unexpected-start-tag", {"name": "body"})
if (len(self.tree.openElements) == 1 or
self.tree.openElements[1].name != "body"):
assert self.parser.innerHTML
else:
self.parser.framesetOK = False
for attr, value in token["data"].items():
if attr not in self.tree.openElements[1].attributes:
self.tree.openElements[1].attributes[attr] = value
def startTagFrameset(self, token):
self.parser.parseError("unexpected-start-tag", {"name": "frameset"})
if (len(self.tree.openElements) == 1 or self.tree.openElements[1].name != "body"):
assert self.parser.innerHTML
elif not self.parser.framesetOK:
pass
else:
if self.tree.openElements[1].parent:
self.tree.openElements[1].parent.removeChild(self.tree.openElements[1])
while self.tree.openElements[-1].name != "html":
self.tree.openElements.pop()
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inFrameset"]
def startTagCloseP(self, token):
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
self.tree.insertElement(token)
def startTagPreListing(self, token):
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
self.tree.insertElement(token)
self.parser.framesetOK = False
self.processSpaceCharacters = self.processSpaceCharactersDropNewline
def startTagForm(self, token):
if self.tree.formPointer:
self.parser.parseError("unexpected-start-tag", {"name": "form"})
else:
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
self.tree.insertElement(token)
self.tree.formPointer = self.tree.openElements[-1]
def startTagListItem(self, token):
self.parser.framesetOK = False
stopNamesMap = {"li": ["li"],
"dt": ["dt", "dd"],
"dd": ["dt", "dd"]}
stopNames = stopNamesMap[token["name"]]
for node in reversed(self.tree.openElements):
if node.name in stopNames:
self.parser.phase.processEndTag(
impliedTagToken(node.name, "EndTag"))
break
if (node.nameTuple in specialElements and
node.name not in ("address", "div", "p")):
break
if self.tree.elementInScope("p", variant="button"):
self.parser.phase.processEndTag(
impliedTagToken("p", "EndTag"))
self.tree.insertElement(token)
def startTagPlaintext(self, token):
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
self.tree.insertElement(token)
self.parser.tokenizer.state = self.parser.tokenizer.plaintextState
def startTagHeading(self, token):
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
if self.tree.openElements[-1].name in headingElements:
self.parser.parseError("unexpected-start-tag", {"name": token["name"]})
self.tree.openElements.pop()
self.tree.insertElement(token)
def startTagA(self, token):
afeAElement = self.tree.elementInActiveFormattingElements("a")
if afeAElement:
self.parser.parseError("unexpected-start-tag-implies-end-tag",
{"startName": "a", "endName": "a"})
self.endTagFormatting(impliedTagToken("a"))
if afeAElement in self.tree.openElements:
self.tree.openElements.remove(afeAElement)
if afeAElement in self.tree.activeFormattingElements:
self.tree.activeFormattingElements.remove(afeAElement)
self.tree.reconstructActiveFormattingElements()
self.addFormattingElement(token)
def startTagFormatting(self, token):
self.tree.reconstructActiveFormattingElements()
self.addFormattingElement(token)
def startTagNobr(self, token):
self.tree.reconstructActiveFormattingElements()
if self.tree.elementInScope("nobr"):
self.parser.parseError("unexpected-start-tag-implies-end-tag",
{"startName": "nobr", "endName": "nobr"})
self.processEndTag(impliedTagToken("nobr"))
# XXX Need tests that trigger the following
self.tree.reconstructActiveFormattingElements()
self.addFormattingElement(token)
def startTagButton(self, token):
if self.tree.elementInScope("button"):
self.parser.parseError("unexpected-start-tag-implies-end-tag",
{"startName": "button", "endName": "button"})
self.processEndTag(impliedTagToken("button"))
return token
else:
self.tree.reconstructActiveFormattingElements()
self.tree.insertElement(token)
self.parser.framesetOK = False
def startTagAppletMarqueeObject(self, token):
self.tree.reconstructActiveFormattingElements()
self.tree.insertElement(token)
self.tree.activeFormattingElements.append(Marker)
self.parser.framesetOK = False
def startTagXmp(self, token):
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
self.tree.reconstructActiveFormattingElements()
self.parser.framesetOK = False
self.parser.parseRCDataRawtext(token, "RAWTEXT")
def startTagTable(self, token):
if self.parser.compatMode != "quirks":
if self.tree.elementInScope("p", variant="button"):
self.processEndTag(impliedTagToken("p"))
self.tree.insertElement(token)
self.parser.framesetOK = False
self.parser.phase = self.parser.phases["inTable"]
def startTagVoidFormatting(self, token):
self.tree.reconstructActiveFormattingElements()
self.tree.insertElement(token)
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
self.parser.framesetOK = False
def startTagInput(self, token):
framesetOK = self.parser.framesetOK
self.startTagVoidFormatting(token)
if ("type" in token["data"] and
token["data"]["type"].translate(asciiUpper2Lower) == "hidden"):
# input type=hidden doesn't change framesetOK
self.parser.framesetOK = framesetOK
def startTagParamSource(self, token):
self.tree.insertElement(token)
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
def startTagHr(self, token):
if self.tree.elementInScope("p", variant="button"):
self.endTagP(impliedTagToken("p"))
self.tree.insertElement(token)
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
self.parser.framesetOK = False
def startTagImage(self, token):
# No really...
self.parser.parseError("unexpected-start-tag-treated-as",
{"originalName": "image", "newName": "img"})
self.processStartTag(impliedTagToken("img", "StartTag",
attributes=token["data"],
selfClosing=token["selfClosing"]))
def startTagIsIndex(self, token):
self.parser.parseError("deprecated-tag", {"name": "isindex"})
if self.tree.formPointer:
return
form_attrs = {}
if "action" in token["data"]:
form_attrs["action"] = token["data"]["action"]
self.processStartTag(impliedTagToken("form", "StartTag",
attributes=form_attrs))
self.processStartTag(impliedTagToken("hr", "StartTag"))
self.processStartTag(impliedTagToken("label", "StartTag"))
# XXX Localization ...
if "prompt" in token["data"]:
prompt = token["data"]["prompt"]
else:
prompt = "This is a searchable index. Enter search keywords: "
self.processCharacters(
{"type": tokenTypes["Characters"], "data": prompt})
attributes = token["data"].copy()
if "action" in attributes:
del attributes["action"]
if "prompt" in attributes:
del attributes["prompt"]
attributes["name"] = "isindex"
self.processStartTag(impliedTagToken("input", "StartTag",
attributes=attributes,
selfClosing=token["selfClosing"]))
self.processEndTag(impliedTagToken("label"))
self.processStartTag(impliedTagToken("hr", "StartTag"))
self.processEndTag(impliedTagToken("form"))
def startTagTextarea(self, token):
self.tree.insertElement(token)
self.parser.tokenizer.state = self.parser.tokenizer.rcdataState
self.processSpaceCharacters = self.processSpaceCharactersDropNewline
self.parser.framesetOK = False
def startTagIFrame(self, token):
self.parser.framesetOK = False
self.startTagRawtext(token)
def startTagNoscript(self, token):
if self.parser.scripting:
self.startTagRawtext(token)
else:
self.startTagOther(token)
def startTagRawtext(self, token):
"""iframe, noembed noframes, noscript(if scripting enabled)"""
self.parser.parseRCDataRawtext(token, "RAWTEXT")
def startTagOpt(self, token):
if self.tree.openElements[-1].name == "option":
self.parser.phase.processEndTag(impliedTagToken("option"))
self.tree.reconstructActiveFormattingElements()
self.parser.tree.insertElement(token)
def startTagSelect(self, token):
self.tree.reconstructActiveFormattingElements()
self.tree.insertElement(token)
self.parser.framesetOK = False
if self.parser.phase in (self.parser.phases["inTable"],
self.parser.phases["inCaption"],
self.parser.phases["inColumnGroup"],
self.parser.phases["inTableBody"],
self.parser.phases["inRow"],
self.parser.phases["inCell"]):
self.parser.phase = self.parser.phases["inSelectInTable"]
else:
self.parser.phase = self.parser.phases["inSelect"]
def startTagRpRt(self, token):
if self.tree.elementInScope("ruby"):
self.tree.generateImpliedEndTags()
if self.tree.openElements[-1].name != "ruby":
self.parser.parseError()
self.tree.insertElement(token)
def startTagMath(self, token):
self.tree.reconstructActiveFormattingElements()
self.parser.adjustMathMLAttributes(token)
self.parser.adjustForeignAttributes(token)
token["namespace"] = namespaces["mathml"]
self.tree.insertElement(token)
# Need to get the parse error right for the case where the token
# has a namespace not equal to the xmlns attribute
if token["selfClosing"]:
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
def startTagSvg(self, token):
self.tree.reconstructActiveFormattingElements()
self.parser.adjustSVGAttributes(token)
self.parser.adjustForeignAttributes(token)
token["namespace"] = namespaces["svg"]
self.tree.insertElement(token)
# Need to get the parse error right for the case where the token
# has a namespace not equal to the xmlns attribute
if token["selfClosing"]:
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
def startTagMisplaced(self, token):
""" Elements that should be children of other elements that have a
different insertion mode; here they are ignored
"caption", "col", "colgroup", "frame", "frameset", "head",
"option", "optgroup", "tbody", "td", "tfoot", "th", "thead",
"tr", "noscript"
"""
self.parser.parseError("unexpected-start-tag-ignored", {"name": token["name"]})
def startTagOther(self, token):
self.tree.reconstructActiveFormattingElements()
self.tree.insertElement(token)
def endTagP(self, token):
if not self.tree.elementInScope("p", variant="button"):
self.startTagCloseP(impliedTagToken("p", "StartTag"))
self.parser.parseError("unexpected-end-tag", {"name": "p"})
self.endTagP(impliedTagToken("p", "EndTag"))
else:
self.tree.generateImpliedEndTags("p")
if self.tree.openElements[-1].name != "p":
self.parser.parseError("unexpected-end-tag", {"name": "p"})
node = self.tree.openElements.pop()
while node.name != "p":
node = self.tree.openElements.pop()
def endTagBody(self, token):
if not self.tree.elementInScope("body"):
self.parser.parseError()
return
elif self.tree.openElements[-1].name != "body":
for node in self.tree.openElements[2:]:
if node.name not in frozenset(("dd", "dt", "li", "optgroup",
"option", "p", "rp", "rt",
"tbody", "td", "tfoot",
"th", "thead", "tr", "body",
"html")):
# Not sure this is the correct name for the parse error
self.parser.parseError(
"expected-one-end-tag-but-got-another",
{"gotName": "body", "expectedName": node.name})
break
self.parser.phase = self.parser.phases["afterBody"]
def endTagHtml(self, token):
# We repeat the test for the body end tag token being ignored here
if self.tree.elementInScope("body"):
self.endTagBody(impliedTagToken("body"))
return token
def endTagBlock(self, token):
# Put us back in the right whitespace handling mode
if token["name"] == "pre":
self.processSpaceCharacters = self.processSpaceCharactersNonPre
inScope = self.tree.elementInScope(token["name"])
if inScope:
self.tree.generateImpliedEndTags()
if self.tree.openElements[-1].name != token["name"]:
self.parser.parseError("end-tag-too-early", {"name": token["name"]})
if inScope:
node = self.tree.openElements.pop()
while node.name != token["name"]:
node = self.tree.openElements.pop()
def endTagForm(self, token):
node = self.tree.formPointer
self.tree.formPointer = None
if node is None or not self.tree.elementInScope(node):
self.parser.parseError("unexpected-end-tag",
{"name": "form"})
else:
self.tree.generateImpliedEndTags()
if self.tree.openElements[-1] != node:
self.parser.parseError("end-tag-too-early-ignored",
{"name": "form"})
self.tree.openElements.remove(node)
def endTagListItem(self, token):
if token["name"] == "li":
variant = "list"
else:
variant = None
if not self.tree.elementInScope(token["name"], variant=variant):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
else:
self.tree.generateImpliedEndTags(exclude=token["name"])
if self.tree.openElements[-1].name != token["name"]:
self.parser.parseError(
"end-tag-too-early",
{"name": token["name"]})
node = self.tree.openElements.pop()
while node.name != token["name"]:
node = self.tree.openElements.pop()
def endTagHeading(self, token):
for item in headingElements:
if self.tree.elementInScope(item):
self.tree.generateImpliedEndTags()
break
if self.tree.openElements[-1].name != token["name"]:
self.parser.parseError("end-tag-too-early", {"name": token["name"]})
for item in headingElements:
if self.tree.elementInScope(item):
item = self.tree.openElements.pop()
while item.name not in headingElements:
item = self.tree.openElements.pop()
break
def endTagFormatting(self, token):
"""The much-feared adoption agency algorithm"""
# http://svn.whatwg.org/webapps/complete.html#adoptionAgency revision 7867
# XXX Better parseError messages appreciated.
# Step 1
outerLoopCounter = 0
# Step 2
while outerLoopCounter < 8:
# Step 3
outerLoopCounter += 1
# Step 4:
# Let the formatting element be the last element in
# the list of active formatting elements that:
# - is between the end of the list and the last scope
# marker in the list, if any, or the start of the list
# otherwise, and
# - has the same tag name as the token.
formattingElement = self.tree.elementInActiveFormattingElements(
token["name"])
if (not formattingElement or
(formattingElement in self.tree.openElements and
not self.tree.elementInScope(formattingElement.name))):
# If there is no such node, then abort these steps
# and instead act as described in the "any other
# end tag" entry below.
self.endTagOther(token)
return
# Otherwise, if there is such a node, but that node is
# not in the stack of open elements, then this is a
# parse error; remove the element from the list, and
# abort these steps.
elif formattingElement not in self.tree.openElements:
self.parser.parseError("adoption-agency-1.2", {"name": token["name"]})
self.tree.activeFormattingElements.remove(formattingElement)
return
# Otherwise, if there is such a node, and that node is
# also in the stack of open elements, but the element
# is not in scope, then this is a parse error; ignore
# the token, and abort these steps.
elif not self.tree.elementInScope(formattingElement.name):
self.parser.parseError("adoption-agency-4.4", {"name": token["name"]})
return
# Otherwise, there is a formatting element and that
# element is in the stack and is in scope. If the
# element is not the current node, this is a parse
# error. In any case, proceed with the algorithm as
# written in the following steps.
else:
if formattingElement != self.tree.openElements[-1]:
self.parser.parseError("adoption-agency-1.3", {"name": token["name"]})
# Step 5:
# Let the furthest block be the topmost node in the
# stack of open elements that is lower in the stack
# than the formatting element, and is an element in
# the special category. There might not be one.
afeIndex = self.tree.openElements.index(formattingElement)
furthestBlock = None
for element in self.tree.openElements[afeIndex:]:
if element.nameTuple in specialElements:
furthestBlock = element
break
# Step 6:
# If there is no furthest block, then the UA must
# first pop all the nodes from the bottom of the stack
# of open elements, from the current node up to and
# including the formatting element, then remove the
# formatting element from the list of active
# formatting elements, and finally abort these steps.
if furthestBlock is None:
element = self.tree.openElements.pop()
while element != formattingElement:
element = self.tree.openElements.pop()
self.tree.activeFormattingElements.remove(element)
return
# Step 7
commonAncestor = self.tree.openElements[afeIndex - 1]
# Step 8:
# The bookmark is supposed to help us identify where to reinsert
# nodes in step 15. We have to ensure that we reinsert nodes after
# the node before the active formatting element. Note the bookmark
# can move in step 9.7
bookmark = self.tree.activeFormattingElements.index(formattingElement)
# Step 9
lastNode = node = furthestBlock
innerLoopCounter = 0
index = self.tree.openElements.index(node)
while innerLoopCounter < 3:
innerLoopCounter += 1
# Node is element before node in open elements
index -= 1
node = self.tree.openElements[index]
if node not in self.tree.activeFormattingElements:
self.tree.openElements.remove(node)
continue
# Step 9.6
if node == formattingElement:
break
# Step 9.7
if lastNode == furthestBlock:
bookmark = self.tree.activeFormattingElements.index(node) + 1
# Step 9.8
clone = node.cloneNode()
# Replace node with clone
self.tree.activeFormattingElements[
self.tree.activeFormattingElements.index(node)] = clone
self.tree.openElements[
self.tree.openElements.index(node)] = clone
node = clone
# Step 9.9
# Remove lastNode from its parents, if any
if lastNode.parent:
lastNode.parent.removeChild(lastNode)
node.appendChild(lastNode)
# Step 9.10
lastNode = node
# Step 10
# Foster parent lastNode if commonAncestor is a
# table, tbody, tfoot, thead, or tr we need to foster
# parent the lastNode
if lastNode.parent:
lastNode.parent.removeChild(lastNode)
if commonAncestor.name in frozenset(("table", "tbody", "tfoot", "thead", "tr")):
parent, insertBefore = self.tree.getTableMisnestedNodePosition()
parent.insertBefore(lastNode, insertBefore)
else:
commonAncestor.appendChild(lastNode)
# Step 11
clone = formattingElement.cloneNode()
# Step 12
furthestBlock.reparentChildren(clone)
# Step 13
furthestBlock.appendChild(clone)
# Step 14
self.tree.activeFormattingElements.remove(formattingElement)
self.tree.activeFormattingElements.insert(bookmark, clone)
# Step 15
self.tree.openElements.remove(formattingElement)
self.tree.openElements.insert(
self.tree.openElements.index(furthestBlock) + 1, clone)
def endTagAppletMarqueeObject(self, token):
if self.tree.elementInScope(token["name"]):
self.tree.generateImpliedEndTags()
if self.tree.openElements[-1].name != token["name"]:
self.parser.parseError("end-tag-too-early", {"name": token["name"]})
if self.tree.elementInScope(token["name"]):
element = self.tree.openElements.pop()
while element.name != token["name"]:
element = self.tree.openElements.pop()
self.tree.clearActiveFormattingElements()
def endTagBr(self, token):
self.parser.parseError("unexpected-end-tag-treated-as",
{"originalName": "br", "newName": "br element"})
self.tree.reconstructActiveFormattingElements()
self.tree.insertElement(impliedTagToken("br", "StartTag"))
self.tree.openElements.pop()
def endTagOther(self, token):
for node in self.tree.openElements[::-1]:
if node.name == token["name"]:
self.tree.generateImpliedEndTags(exclude=token["name"])
if self.tree.openElements[-1].name != token["name"]:
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
while self.tree.openElements.pop() != node:
pass
break
else:
if node.nameTuple in specialElements:
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
break
class TextPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("script", self.endTagScript)])
self.endTagHandler.default = self.endTagOther
def processCharacters(self, token):
self.tree.insertText(token["data"])
def processEOF(self):
self.parser.parseError("expected-named-closing-tag-but-got-eof",
{"name": self.tree.openElements[-1].name})
self.tree.openElements.pop()
self.parser.phase = self.parser.originalPhase
return True
def startTagOther(self, token):
assert False, "Tried to process start tag %s in RCDATA/RAWTEXT mode" % token['name']
def endTagScript(self, token):
node = self.tree.openElements.pop()
assert node.name == "script"
self.parser.phase = self.parser.originalPhase
# The rest of this method is all stuff that only happens if
# document.write works
def endTagOther(self, token):
self.tree.openElements.pop()
self.parser.phase = self.parser.originalPhase
class InTablePhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-table
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("caption", self.startTagCaption),
("colgroup", self.startTagColgroup),
("col", self.startTagCol),
(("tbody", "tfoot", "thead"), self.startTagRowGroup),
(("td", "th", "tr"), self.startTagImplyTbody),
("table", self.startTagTable),
(("style", "script"), self.startTagStyleScript),
("input", self.startTagInput),
("form", self.startTagForm)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("table", self.endTagTable),
(("body", "caption", "col", "colgroup", "html", "tbody", "td",
"tfoot", "th", "thead", "tr"), self.endTagIgnore)
])
self.endTagHandler.default = self.endTagOther
# helper methods
def clearStackToTableContext(self):
# "clear the stack back to a table context"
while self.tree.openElements[-1].name not in ("table", "html"):
# self.parser.parseError("unexpected-implied-end-tag-in-table",
# {"name": self.tree.openElements[-1].name})
self.tree.openElements.pop()
# When the current node is <html> it's an innerHTML case
# processing methods
def processEOF(self):
if self.tree.openElements[-1].name != "html":
self.parser.parseError("eof-in-table")
else:
assert self.parser.innerHTML
# Stop parsing
def processSpaceCharacters(self, token):
originalPhase = self.parser.phase
self.parser.phase = self.parser.phases["inTableText"]
self.parser.phase.originalPhase = originalPhase
self.parser.phase.processSpaceCharacters(token)
def processCharacters(self, token):
originalPhase = self.parser.phase
self.parser.phase = self.parser.phases["inTableText"]
self.parser.phase.originalPhase = originalPhase
self.parser.phase.processCharacters(token)
def insertText(self, token):
# If we get here there must be at least one non-whitespace character
# Do the table magic!
self.tree.insertFromTable = True
self.parser.phases["inBody"].processCharacters(token)
self.tree.insertFromTable = False
def startTagCaption(self, token):
self.clearStackToTableContext()
self.tree.activeFormattingElements.append(Marker)
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inCaption"]
def startTagColgroup(self, token):
self.clearStackToTableContext()
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inColumnGroup"]
def startTagCol(self, token):
self.startTagColgroup(impliedTagToken("colgroup", "StartTag"))
return token
def startTagRowGroup(self, token):
self.clearStackToTableContext()
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inTableBody"]
def startTagImplyTbody(self, token):
self.startTagRowGroup(impliedTagToken("tbody", "StartTag"))
return token
def startTagTable(self, token):
self.parser.parseError("unexpected-start-tag-implies-end-tag",
{"startName": "table", "endName": "table"})
self.parser.phase.processEndTag(impliedTagToken("table"))
if not self.parser.innerHTML:
return token
def startTagStyleScript(self, token):
return self.parser.phases["inHead"].processStartTag(token)
def startTagInput(self, token):
if ("type" in token["data"] and
token["data"]["type"].translate(asciiUpper2Lower) == "hidden"):
self.parser.parseError("unexpected-hidden-input-in-table")
self.tree.insertElement(token)
# XXX associate with form
self.tree.openElements.pop()
else:
self.startTagOther(token)
def startTagForm(self, token):
self.parser.parseError("unexpected-form-in-table")
if self.tree.formPointer is None:
self.tree.insertElement(token)
self.tree.formPointer = self.tree.openElements[-1]
self.tree.openElements.pop()
def startTagOther(self, token):
self.parser.parseError("unexpected-start-tag-implies-table-voodoo", {"name": token["name"]})
# Do the table magic!
self.tree.insertFromTable = True
self.parser.phases["inBody"].processStartTag(token)
self.tree.insertFromTable = False
def endTagTable(self, token):
if self.tree.elementInScope("table", variant="table"):
self.tree.generateImpliedEndTags()
if self.tree.openElements[-1].name != "table":
self.parser.parseError("end-tag-too-early-named",
{"gotName": "table",
"expectedName": self.tree.openElements[-1].name})
while self.tree.openElements[-1].name != "table":
self.tree.openElements.pop()
self.tree.openElements.pop()
self.parser.resetInsertionMode()
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def endTagIgnore(self, token):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag-implies-table-voodoo", {"name": token["name"]})
# Do the table magic!
self.tree.insertFromTable = True
self.parser.phases["inBody"].processEndTag(token)
self.tree.insertFromTable = False
class InTableTextPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.originalPhase = None
self.characterTokens = []
def flushCharacters(self):
data = "".join([item["data"] for item in self.characterTokens])
if any([item not in spaceCharacters for item in data]):
token = {"type": tokenTypes["Characters"], "data": data}
self.parser.phases["inTable"].insertText(token)
elif data:
self.tree.insertText(data)
self.characterTokens = []
def processComment(self, token):
self.flushCharacters()
self.parser.phase = self.originalPhase
return token
def processEOF(self):
self.flushCharacters()
self.parser.phase = self.originalPhase
return True
def processCharacters(self, token):
if token["data"] == "\u0000":
return
self.characterTokens.append(token)
def processSpaceCharacters(self, token):
# pretty sure we should never reach here
self.characterTokens.append(token)
# assert False
def processStartTag(self, token):
self.flushCharacters()
self.parser.phase = self.originalPhase
return token
def processEndTag(self, token):
self.flushCharacters()
self.parser.phase = self.originalPhase
return token
class InCaptionPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-caption
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
(("caption", "col", "colgroup", "tbody", "td", "tfoot", "th",
"thead", "tr"), self.startTagTableElement)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("caption", self.endTagCaption),
("table", self.endTagTable),
(("body", "col", "colgroup", "html", "tbody", "td", "tfoot", "th",
"thead", "tr"), self.endTagIgnore)
])
self.endTagHandler.default = self.endTagOther
def ignoreEndTagCaption(self):
return not self.tree.elementInScope("caption", variant="table")
def processEOF(self):
self.parser.phases["inBody"].processEOF()
def processCharacters(self, token):
return self.parser.phases["inBody"].processCharacters(token)
def startTagTableElement(self, token):
self.parser.parseError()
# XXX Have to duplicate logic here to find out if the tag is ignored
ignoreEndTag = self.ignoreEndTagCaption()
self.parser.phase.processEndTag(impliedTagToken("caption"))
if not ignoreEndTag:
return token
def startTagOther(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def endTagCaption(self, token):
if not self.ignoreEndTagCaption():
# AT this code is quite similar to endTagTable in "InTable"
self.tree.generateImpliedEndTags()
if self.tree.openElements[-1].name != "caption":
self.parser.parseError("expected-one-end-tag-but-got-another",
{"gotName": "caption",
"expectedName": self.tree.openElements[-1].name})
while self.tree.openElements[-1].name != "caption":
self.tree.openElements.pop()
self.tree.openElements.pop()
self.tree.clearActiveFormattingElements()
self.parser.phase = self.parser.phases["inTable"]
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def endTagTable(self, token):
self.parser.parseError()
ignoreEndTag = self.ignoreEndTagCaption()
self.parser.phase.processEndTag(impliedTagToken("caption"))
if not ignoreEndTag:
return token
def endTagIgnore(self, token):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def endTagOther(self, token):
return self.parser.phases["inBody"].processEndTag(token)
class InColumnGroupPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-column
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("col", self.startTagCol)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("colgroup", self.endTagColgroup),
("col", self.endTagCol)
])
self.endTagHandler.default = self.endTagOther
def ignoreEndTagColgroup(self):
return self.tree.openElements[-1].name == "html"
def processEOF(self):
if self.tree.openElements[-1].name == "html":
assert self.parser.innerHTML
return
else:
ignoreEndTag = self.ignoreEndTagColgroup()
self.endTagColgroup(impliedTagToken("colgroup"))
if not ignoreEndTag:
return True
def processCharacters(self, token):
ignoreEndTag = self.ignoreEndTagColgroup()
self.endTagColgroup(impliedTagToken("colgroup"))
if not ignoreEndTag:
return token
def startTagCol(self, token):
self.tree.insertElement(token)
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
def startTagOther(self, token):
ignoreEndTag = self.ignoreEndTagColgroup()
self.endTagColgroup(impliedTagToken("colgroup"))
if not ignoreEndTag:
return token
def endTagColgroup(self, token):
if self.ignoreEndTagColgroup():
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
else:
self.tree.openElements.pop()
self.parser.phase = self.parser.phases["inTable"]
def endTagCol(self, token):
self.parser.parseError("no-end-tag", {"name": "col"})
def endTagOther(self, token):
ignoreEndTag = self.ignoreEndTagColgroup()
self.endTagColgroup(impliedTagToken("colgroup"))
if not ignoreEndTag:
return token
class InTableBodyPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-table0
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("tr", self.startTagTr),
(("td", "th"), self.startTagTableCell),
(("caption", "col", "colgroup", "tbody", "tfoot", "thead"),
self.startTagTableOther)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
(("tbody", "tfoot", "thead"), self.endTagTableRowGroup),
("table", self.endTagTable),
(("body", "caption", "col", "colgroup", "html", "td", "th",
"tr"), self.endTagIgnore)
])
self.endTagHandler.default = self.endTagOther
# helper methods
def clearStackToTableBodyContext(self):
while self.tree.openElements[-1].name not in ("tbody", "tfoot",
"thead", "html"):
# self.parser.parseError("unexpected-implied-end-tag-in-table",
# {"name": self.tree.openElements[-1].name})
self.tree.openElements.pop()
if self.tree.openElements[-1].name == "html":
assert self.parser.innerHTML
# the rest
def processEOF(self):
self.parser.phases["inTable"].processEOF()
def processSpaceCharacters(self, token):
return self.parser.phases["inTable"].processSpaceCharacters(token)
def processCharacters(self, token):
return self.parser.phases["inTable"].processCharacters(token)
def startTagTr(self, token):
self.clearStackToTableBodyContext()
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inRow"]
def startTagTableCell(self, token):
self.parser.parseError("unexpected-cell-in-table-body",
{"name": token["name"]})
self.startTagTr(impliedTagToken("tr", "StartTag"))
return token
def startTagTableOther(self, token):
# XXX AT Any ideas on how to share this with endTagTable?
if (self.tree.elementInScope("tbody", variant="table") or
self.tree.elementInScope("thead", variant="table") or
self.tree.elementInScope("tfoot", variant="table")):
self.clearStackToTableBodyContext()
self.endTagTableRowGroup(
impliedTagToken(self.tree.openElements[-1].name))
return token
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def startTagOther(self, token):
return self.parser.phases["inTable"].processStartTag(token)
def endTagTableRowGroup(self, token):
if self.tree.elementInScope(token["name"], variant="table"):
self.clearStackToTableBodyContext()
self.tree.openElements.pop()
self.parser.phase = self.parser.phases["inTable"]
else:
self.parser.parseError("unexpected-end-tag-in-table-body",
{"name": token["name"]})
def endTagTable(self, token):
if (self.tree.elementInScope("tbody", variant="table") or
self.tree.elementInScope("thead", variant="table") or
self.tree.elementInScope("tfoot", variant="table")):
self.clearStackToTableBodyContext()
self.endTagTableRowGroup(
impliedTagToken(self.tree.openElements[-1].name))
return token
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def endTagIgnore(self, token):
self.parser.parseError("unexpected-end-tag-in-table-body",
{"name": token["name"]})
def endTagOther(self, token):
return self.parser.phases["inTable"].processEndTag(token)
class InRowPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-row
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
(("td", "th"), self.startTagTableCell),
(("caption", "col", "colgroup", "tbody", "tfoot", "thead",
"tr"), self.startTagTableOther)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("tr", self.endTagTr),
("table", self.endTagTable),
(("tbody", "tfoot", "thead"), self.endTagTableRowGroup),
(("body", "caption", "col", "colgroup", "html", "td", "th"),
self.endTagIgnore)
])
self.endTagHandler.default = self.endTagOther
# helper methods (XXX unify this with other table helper methods)
def clearStackToTableRowContext(self):
while self.tree.openElements[-1].name not in ("tr", "html"):
self.parser.parseError("unexpected-implied-end-tag-in-table-row",
{"name": self.tree.openElements[-1].name})
self.tree.openElements.pop()
def ignoreEndTagTr(self):
return not self.tree.elementInScope("tr", variant="table")
# the rest
def processEOF(self):
self.parser.phases["inTable"].processEOF()
def processSpaceCharacters(self, token):
return self.parser.phases["inTable"].processSpaceCharacters(token)
def processCharacters(self, token):
return self.parser.phases["inTable"].processCharacters(token)
def startTagTableCell(self, token):
self.clearStackToTableRowContext()
self.tree.insertElement(token)
self.parser.phase = self.parser.phases["inCell"]
self.tree.activeFormattingElements.append(Marker)
def startTagTableOther(self, token):
ignoreEndTag = self.ignoreEndTagTr()
self.endTagTr(impliedTagToken("tr"))
# XXX how are we sure it's always ignored in the innerHTML case?
if not ignoreEndTag:
return token
def startTagOther(self, token):
return self.parser.phases["inTable"].processStartTag(token)
def endTagTr(self, token):
if not self.ignoreEndTagTr():
self.clearStackToTableRowContext()
self.tree.openElements.pop()
self.parser.phase = self.parser.phases["inTableBody"]
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def endTagTable(self, token):
ignoreEndTag = self.ignoreEndTagTr()
self.endTagTr(impliedTagToken("tr"))
# Reprocess the current tag if the tr end tag was not ignored
# XXX how are we sure it's always ignored in the innerHTML case?
if not ignoreEndTag:
return token
def endTagTableRowGroup(self, token):
if self.tree.elementInScope(token["name"], variant="table"):
self.endTagTr(impliedTagToken("tr"))
return token
else:
self.parser.parseError()
def endTagIgnore(self, token):
self.parser.parseError("unexpected-end-tag-in-table-row",
{"name": token["name"]})
def endTagOther(self, token):
return self.parser.phases["inTable"].processEndTag(token)
class InCellPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-cell
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
(("caption", "col", "colgroup", "tbody", "td", "tfoot", "th",
"thead", "tr"), self.startTagTableOther)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
(("td", "th"), self.endTagTableCell),
(("body", "caption", "col", "colgroup", "html"), self.endTagIgnore),
(("table", "tbody", "tfoot", "thead", "tr"), self.endTagImply)
])
self.endTagHandler.default = self.endTagOther
# helper
def closeCell(self):
if self.tree.elementInScope("td", variant="table"):
self.endTagTableCell(impliedTagToken("td"))
elif self.tree.elementInScope("th", variant="table"):
self.endTagTableCell(impliedTagToken("th"))
# the rest
def processEOF(self):
self.parser.phases["inBody"].processEOF()
def processCharacters(self, token):
return self.parser.phases["inBody"].processCharacters(token)
def startTagTableOther(self, token):
if (self.tree.elementInScope("td", variant="table") or
self.tree.elementInScope("th", variant="table")):
self.closeCell()
return token
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def startTagOther(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def endTagTableCell(self, token):
if self.tree.elementInScope(token["name"], variant="table"):
self.tree.generateImpliedEndTags(token["name"])
if self.tree.openElements[-1].name != token["name"]:
self.parser.parseError("unexpected-cell-end-tag",
{"name": token["name"]})
while True:
node = self.tree.openElements.pop()
if node.name == token["name"]:
break
else:
self.tree.openElements.pop()
self.tree.clearActiveFormattingElements()
self.parser.phase = self.parser.phases["inRow"]
else:
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def endTagIgnore(self, token):
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
def endTagImply(self, token):
if self.tree.elementInScope(token["name"], variant="table"):
self.closeCell()
return token
else:
# sometimes innerHTML case
self.parser.parseError()
def endTagOther(self, token):
return self.parser.phases["inBody"].processEndTag(token)
class InSelectPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("option", self.startTagOption),
("optgroup", self.startTagOptgroup),
("select", self.startTagSelect),
(("input", "keygen", "textarea"), self.startTagInput),
("script", self.startTagScript)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("option", self.endTagOption),
("optgroup", self.endTagOptgroup),
("select", self.endTagSelect)
])
self.endTagHandler.default = self.endTagOther
# http://www.whatwg.org/specs/web-apps/current-work/#in-select
def processEOF(self):
if self.tree.openElements[-1].name != "html":
self.parser.parseError("eof-in-select")
else:
assert self.parser.innerHTML
def processCharacters(self, token):
if token["data"] == "\u0000":
return
self.tree.insertText(token["data"])
def startTagOption(self, token):
# We need to imply </option> if <option> is the current node.
if self.tree.openElements[-1].name == "option":
self.tree.openElements.pop()
self.tree.insertElement(token)
def startTagOptgroup(self, token):
if self.tree.openElements[-1].name == "option":
self.tree.openElements.pop()
if self.tree.openElements[-1].name == "optgroup":
self.tree.openElements.pop()
self.tree.insertElement(token)
def startTagSelect(self, token):
self.parser.parseError("unexpected-select-in-select")
self.endTagSelect(impliedTagToken("select"))
def startTagInput(self, token):
self.parser.parseError("unexpected-input-in-select")
if self.tree.elementInScope("select", variant="select"):
self.endTagSelect(impliedTagToken("select"))
return token
else:
assert self.parser.innerHTML
def startTagScript(self, token):
return self.parser.phases["inHead"].processStartTag(token)
def startTagOther(self, token):
self.parser.parseError("unexpected-start-tag-in-select",
{"name": token["name"]})
def endTagOption(self, token):
if self.tree.openElements[-1].name == "option":
self.tree.openElements.pop()
else:
self.parser.parseError("unexpected-end-tag-in-select",
{"name": "option"})
def endTagOptgroup(self, token):
# </optgroup> implicitly closes <option>
if (self.tree.openElements[-1].name == "option" and
self.tree.openElements[-2].name == "optgroup"):
self.tree.openElements.pop()
# It also closes </optgroup>
if self.tree.openElements[-1].name == "optgroup":
self.tree.openElements.pop()
# But nothing else
else:
self.parser.parseError("unexpected-end-tag-in-select",
{"name": "optgroup"})
def endTagSelect(self, token):
if self.tree.elementInScope("select", variant="select"):
node = self.tree.openElements.pop()
while node.name != "select":
node = self.tree.openElements.pop()
self.parser.resetInsertionMode()
else:
# innerHTML case
assert self.parser.innerHTML
self.parser.parseError()
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag-in-select",
{"name": token["name"]})
class InSelectInTablePhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
(("caption", "table", "tbody", "tfoot", "thead", "tr", "td", "th"),
self.startTagTable)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
(("caption", "table", "tbody", "tfoot", "thead", "tr", "td", "th"),
self.endTagTable)
])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
self.parser.phases["inSelect"].processEOF()
def processCharacters(self, token):
return self.parser.phases["inSelect"].processCharacters(token)
def startTagTable(self, token):
self.parser.parseError("unexpected-table-element-start-tag-in-select-in-table", {"name": token["name"]})
self.endTagOther(impliedTagToken("select"))
return token
def startTagOther(self, token):
return self.parser.phases["inSelect"].processStartTag(token)
def endTagTable(self, token):
self.parser.parseError("unexpected-table-element-end-tag-in-select-in-table", {"name": token["name"]})
if self.tree.elementInScope(token["name"], variant="table"):
self.endTagOther(impliedTagToken("select"))
return token
def endTagOther(self, token):
return self.parser.phases["inSelect"].processEndTag(token)
class InForeignContentPhase(Phase):
breakoutElements = frozenset(["b", "big", "blockquote", "body", "br",
"center", "code", "dd", "div", "dl", "dt",
"em", "embed", "h1", "h2", "h3",
"h4", "h5", "h6", "head", "hr", "i", "img",
"li", "listing", "menu", "meta", "nobr",
"ol", "p", "pre", "ruby", "s", "small",
"span", "strong", "strike", "sub", "sup",
"table", "tt", "u", "ul", "var"])
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
def adjustSVGTagNames(self, token):
replacements = {"altglyph": "altGlyph",
"altglyphdef": "altGlyphDef",
"altglyphitem": "altGlyphItem",
"animatecolor": "animateColor",
"animatemotion": "animateMotion",
"animatetransform": "animateTransform",
"clippath": "clipPath",
"feblend": "feBlend",
"fecolormatrix": "feColorMatrix",
"fecomponenttransfer": "feComponentTransfer",
"fecomposite": "feComposite",
"feconvolvematrix": "feConvolveMatrix",
"fediffuselighting": "feDiffuseLighting",
"fedisplacementmap": "feDisplacementMap",
"fedistantlight": "feDistantLight",
"feflood": "feFlood",
"fefunca": "feFuncA",
"fefuncb": "feFuncB",
"fefuncg": "feFuncG",
"fefuncr": "feFuncR",
"fegaussianblur": "feGaussianBlur",
"feimage": "feImage",
"femerge": "feMerge",
"femergenode": "feMergeNode",
"femorphology": "feMorphology",
"feoffset": "feOffset",
"fepointlight": "fePointLight",
"fespecularlighting": "feSpecularLighting",
"fespotlight": "feSpotLight",
"fetile": "feTile",
"feturbulence": "feTurbulence",
"foreignobject": "foreignObject",
"glyphref": "glyphRef",
"lineargradient": "linearGradient",
"radialgradient": "radialGradient",
"textpath": "textPath"}
if token["name"] in replacements:
token["name"] = replacements[token["name"]]
def processCharacters(self, token):
if token["data"] == "\u0000":
token["data"] = "\uFFFD"
elif (self.parser.framesetOK and
any(char not in spaceCharacters for char in token["data"])):
self.parser.framesetOK = False
Phase.processCharacters(self, token)
def processStartTag(self, token):
currentNode = self.tree.openElements[-1]
if (token["name"] in self.breakoutElements or
(token["name"] == "font" and
set(token["data"].keys()) & set(["color", "face", "size"]))):
self.parser.parseError("unexpected-html-element-in-foreign-content",
{"name": token["name"]})
while (self.tree.openElements[-1].namespace !=
self.tree.defaultNamespace and
not self.parser.isHTMLIntegrationPoint(self.tree.openElements[-1]) and
not self.parser.isMathMLTextIntegrationPoint(self.tree.openElements[-1])):
self.tree.openElements.pop()
return token
else:
if currentNode.namespace == namespaces["mathml"]:
self.parser.adjustMathMLAttributes(token)
elif currentNode.namespace == namespaces["svg"]:
self.adjustSVGTagNames(token)
self.parser.adjustSVGAttributes(token)
self.parser.adjustForeignAttributes(token)
token["namespace"] = currentNode.namespace
self.tree.insertElement(token)
if token["selfClosing"]:
self.tree.openElements.pop()
token["selfClosingAcknowledged"] = True
def processEndTag(self, token):
nodeIndex = len(self.tree.openElements) - 1
node = self.tree.openElements[-1]
if node.name.translate(asciiUpper2Lower) != token["name"]:
self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
while True:
if node.name.translate(asciiUpper2Lower) == token["name"]:
# XXX this isn't in the spec but it seems necessary
if self.parser.phase == self.parser.phases["inTableText"]:
self.parser.phase.flushCharacters()
self.parser.phase = self.parser.phase.originalPhase
while self.tree.openElements.pop() != node:
assert self.tree.openElements
new_token = None
break
nodeIndex -= 1
node = self.tree.openElements[nodeIndex]
if node.namespace != self.tree.defaultNamespace:
continue
else:
new_token = self.parser.phase.processEndTag(token)
break
return new_token
class AfterBodyPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([("html", self.endTagHtml)])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
# Stop parsing
pass
def processComment(self, token):
# This is needed because data is to be appended to the <html> element
# here and not to whatever is currently open.
self.tree.insertComment(token, self.tree.openElements[0])
def processCharacters(self, token):
self.parser.parseError("unexpected-char-after-body")
self.parser.phase = self.parser.phases["inBody"]
return token
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagOther(self, token):
self.parser.parseError("unexpected-start-tag-after-body",
{"name": token["name"]})
self.parser.phase = self.parser.phases["inBody"]
return token
def endTagHtml(self, name):
if self.parser.innerHTML:
self.parser.parseError("unexpected-end-tag-after-body-innerhtml")
else:
self.parser.phase = self.parser.phases["afterAfterBody"]
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag-after-body",
{"name": token["name"]})
self.parser.phase = self.parser.phases["inBody"]
return token
class InFramesetPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#in-frameset
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("frameset", self.startTagFrameset),
("frame", self.startTagFrame),
("noframes", self.startTagNoframes)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("frameset", self.endTagFrameset)
])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
if self.tree.openElements[-1].name != "html":
self.parser.parseError("eof-in-frameset")
else:
assert self.parser.innerHTML
def processCharacters(self, token):
self.parser.parseError("unexpected-char-in-frameset")
def startTagFrameset(self, token):
self.tree.insertElement(token)
def startTagFrame(self, token):
self.tree.insertElement(token)
self.tree.openElements.pop()
def startTagNoframes(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagOther(self, token):
self.parser.parseError("unexpected-start-tag-in-frameset",
{"name": token["name"]})
def endTagFrameset(self, token):
if self.tree.openElements[-1].name == "html":
# innerHTML case
self.parser.parseError("unexpected-frameset-in-frameset-innerhtml")
else:
self.tree.openElements.pop()
if (not self.parser.innerHTML and
self.tree.openElements[-1].name != "frameset"):
# If we're not in innerHTML mode and the current node is not a
# "frameset" element (anymore) then switch.
self.parser.phase = self.parser.phases["afterFrameset"]
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag-in-frameset",
{"name": token["name"]})
class AfterFramesetPhase(Phase):
# http://www.whatwg.org/specs/web-apps/current-work/#after3
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("noframes", self.startTagNoframes)
])
self.startTagHandler.default = self.startTagOther
self.endTagHandler = _utils.MethodDispatcher([
("html", self.endTagHtml)
])
self.endTagHandler.default = self.endTagOther
def processEOF(self):
# Stop parsing
pass
def processCharacters(self, token):
self.parser.parseError("unexpected-char-after-frameset")
def startTagNoframes(self, token):
return self.parser.phases["inHead"].processStartTag(token)
def startTagOther(self, token):
self.parser.parseError("unexpected-start-tag-after-frameset",
{"name": token["name"]})
def endTagHtml(self, token):
self.parser.phase = self.parser.phases["afterAfterFrameset"]
def endTagOther(self, token):
self.parser.parseError("unexpected-end-tag-after-frameset",
{"name": token["name"]})
class AfterAfterBodyPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml)
])
self.startTagHandler.default = self.startTagOther
def processEOF(self):
pass
def processComment(self, token):
self.tree.insertComment(token, self.tree.document)
def processSpaceCharacters(self, token):
return self.parser.phases["inBody"].processSpaceCharacters(token)
def processCharacters(self, token):
self.parser.parseError("expected-eof-but-got-char")
self.parser.phase = self.parser.phases["inBody"]
return token
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagOther(self, token):
self.parser.parseError("expected-eof-but-got-start-tag",
{"name": token["name"]})
self.parser.phase = self.parser.phases["inBody"]
return token
def processEndTag(self, token):
self.parser.parseError("expected-eof-but-got-end-tag",
{"name": token["name"]})
self.parser.phase = self.parser.phases["inBody"]
return token
class AfterAfterFramesetPhase(Phase):
def __init__(self, parser, tree):
Phase.__init__(self, parser, tree)
self.startTagHandler = _utils.MethodDispatcher([
("html", self.startTagHtml),
("noframes", self.startTagNoFrames)
])
self.startTagHandler.default = self.startTagOther
def processEOF(self):
pass
def processComment(self, token):
self.tree.insertComment(token, self.tree.document)
def processSpaceCharacters(self, token):
return self.parser.phases["inBody"].processSpaceCharacters(token)
def processCharacters(self, token):
self.parser.parseError("expected-eof-but-got-char")
def startTagHtml(self, token):
return self.parser.phases["inBody"].processStartTag(token)
def startTagNoFrames(self, token):
return self.parser.phases["inHead"].processStartTag(token)
def startTagOther(self, token):
self.parser.parseError("expected-eof-but-got-start-tag",
{"name": token["name"]})
def processEndTag(self, token):
self.parser.parseError("expected-eof-but-got-end-tag",
{"name": token["name"]})
# pylint:enable=unused-argument
return {
"initial": InitialPhase,
"beforeHtml": BeforeHtmlPhase,
"beforeHead": BeforeHeadPhase,
"inHead": InHeadPhase,
"inHeadNoscript": InHeadNoscriptPhase,
"afterHead": AfterHeadPhase,
"inBody": InBodyPhase,
"text": TextPhase,
"inTable": InTablePhase,
"inTableText": InTableTextPhase,
"inCaption": InCaptionPhase,
"inColumnGroup": InColumnGroupPhase,
"inTableBody": InTableBodyPhase,
"inRow": InRowPhase,
"inCell": InCellPhase,
"inSelect": InSelectPhase,
"inSelectInTable": InSelectInTablePhase,
"inForeignContent": InForeignContentPhase,
"afterBody": AfterBodyPhase,
"inFrameset": InFramesetPhase,
"afterFrameset": AfterFramesetPhase,
"afterAfterBody": AfterAfterBodyPhase,
"afterAfterFrameset": AfterAfterFramesetPhase,
# XXX after after frameset
}
def adjust_attributes(token, replacements):
if PY3 or _utils.PY27:
needs_adjustment = viewkeys(token['data']) & viewkeys(replacements)
else:
needs_adjustment = frozenset(token['data']) & frozenset(replacements)
if needs_adjustment:
token['data'] = OrderedDict((replacements.get(k, k), v)
for k, v in token['data'].items())
def impliedTagToken(name, type="EndTag", attributes=None,
selfClosing=False):
if attributes is None:
attributes = {}
return {"type": tokenTypes[type], "name": name, "data": attributes,
"selfClosing": selfClosing}
class ParseError(Exception):
"""Error in parsed document"""
pass
pip/_vendor/html5lib/_ihatexml.py 0000644 00000040501 14751155150 0013040 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
import re
import warnings
from .constants import DataLossWarning
baseChar = """
[#x0041-#x005A] | [#x0061-#x007A] | [#x00C0-#x00D6] | [#x00D8-#x00F6] |
[#x00F8-#x00FF] | [#x0100-#x0131] | [#x0134-#x013E] | [#x0141-#x0148] |
[#x014A-#x017E] | [#x0180-#x01C3] | [#x01CD-#x01F0] | [#x01F4-#x01F5] |
[#x01FA-#x0217] | [#x0250-#x02A8] | [#x02BB-#x02C1] | #x0386 |
[#x0388-#x038A] | #x038C | [#x038E-#x03A1] | [#x03A3-#x03CE] |
[#x03D0-#x03D6] | #x03DA | #x03DC | #x03DE | #x03E0 | [#x03E2-#x03F3] |
[#x0401-#x040C] | [#x040E-#x044F] | [#x0451-#x045C] | [#x045E-#x0481] |
[#x0490-#x04C4] | [#x04C7-#x04C8] | [#x04CB-#x04CC] | [#x04D0-#x04EB] |
[#x04EE-#x04F5] | [#x04F8-#x04F9] | [#x0531-#x0556] | #x0559 |
[#x0561-#x0586] | [#x05D0-#x05EA] | [#x05F0-#x05F2] | [#x0621-#x063A] |
[#x0641-#x064A] | [#x0671-#x06B7] | [#x06BA-#x06BE] | [#x06C0-#x06CE] |
[#x06D0-#x06D3] | #x06D5 | [#x06E5-#x06E6] | [#x0905-#x0939] | #x093D |
[#x0958-#x0961] | [#x0985-#x098C] | [#x098F-#x0990] | [#x0993-#x09A8] |
[#x09AA-#x09B0] | #x09B2 | [#x09B6-#x09B9] | [#x09DC-#x09DD] |
[#x09DF-#x09E1] | [#x09F0-#x09F1] | [#x0A05-#x0A0A] | [#x0A0F-#x0A10] |
[#x0A13-#x0A28] | [#x0A2A-#x0A30] | [#x0A32-#x0A33] | [#x0A35-#x0A36] |
[#x0A38-#x0A39] | [#x0A59-#x0A5C] | #x0A5E | [#x0A72-#x0A74] |
[#x0A85-#x0A8B] | #x0A8D | [#x0A8F-#x0A91] | [#x0A93-#x0AA8] |
[#x0AAA-#x0AB0] | [#x0AB2-#x0AB3] | [#x0AB5-#x0AB9] | #x0ABD | #x0AE0 |
[#x0B05-#x0B0C] | [#x0B0F-#x0B10] | [#x0B13-#x0B28] | [#x0B2A-#x0B30] |
[#x0B32-#x0B33] | [#x0B36-#x0B39] | #x0B3D | [#x0B5C-#x0B5D] |
[#x0B5F-#x0B61] | [#x0B85-#x0B8A] | [#x0B8E-#x0B90] | [#x0B92-#x0B95] |
[#x0B99-#x0B9A] | #x0B9C | [#x0B9E-#x0B9F] | [#x0BA3-#x0BA4] |
[#x0BA8-#x0BAA] | [#x0BAE-#x0BB5] | [#x0BB7-#x0BB9] | [#x0C05-#x0C0C] |
[#x0C0E-#x0C10] | [#x0C12-#x0C28] | [#x0C2A-#x0C33] | [#x0C35-#x0C39] |
[#x0C60-#x0C61] | [#x0C85-#x0C8C] | [#x0C8E-#x0C90] | [#x0C92-#x0CA8] |
[#x0CAA-#x0CB3] | [#x0CB5-#x0CB9] | #x0CDE | [#x0CE0-#x0CE1] |
[#x0D05-#x0D0C] | [#x0D0E-#x0D10] | [#x0D12-#x0D28] | [#x0D2A-#x0D39] |
[#x0D60-#x0D61] | [#x0E01-#x0E2E] | #x0E30 | [#x0E32-#x0E33] |
[#x0E40-#x0E45] | [#x0E81-#x0E82] | #x0E84 | [#x0E87-#x0E88] | #x0E8A |
#x0E8D | [#x0E94-#x0E97] | [#x0E99-#x0E9F] | [#x0EA1-#x0EA3] | #x0EA5 |
#x0EA7 | [#x0EAA-#x0EAB] | [#x0EAD-#x0EAE] | #x0EB0 | [#x0EB2-#x0EB3] |
#x0EBD | [#x0EC0-#x0EC4] | [#x0F40-#x0F47] | [#x0F49-#x0F69] |
[#x10A0-#x10C5] | [#x10D0-#x10F6] | #x1100 | [#x1102-#x1103] |
[#x1105-#x1107] | #x1109 | [#x110B-#x110C] | [#x110E-#x1112] | #x113C |
#x113E | #x1140 | #x114C | #x114E | #x1150 | [#x1154-#x1155] | #x1159 |
[#x115F-#x1161] | #x1163 | #x1165 | #x1167 | #x1169 | [#x116D-#x116E] |
[#x1172-#x1173] | #x1175 | #x119E | #x11A8 | #x11AB | [#x11AE-#x11AF] |
[#x11B7-#x11B8] | #x11BA | [#x11BC-#x11C2] | #x11EB | #x11F0 | #x11F9 |
[#x1E00-#x1E9B] | [#x1EA0-#x1EF9] | [#x1F00-#x1F15] | [#x1F18-#x1F1D] |
[#x1F20-#x1F45] | [#x1F48-#x1F4D] | [#x1F50-#x1F57] | #x1F59 | #x1F5B |
#x1F5D | [#x1F5F-#x1F7D] | [#x1F80-#x1FB4] | [#x1FB6-#x1FBC] | #x1FBE |
[#x1FC2-#x1FC4] | [#x1FC6-#x1FCC] | [#x1FD0-#x1FD3] | [#x1FD6-#x1FDB] |
[#x1FE0-#x1FEC] | [#x1FF2-#x1FF4] | [#x1FF6-#x1FFC] | #x2126 |
[#x212A-#x212B] | #x212E | [#x2180-#x2182] | [#x3041-#x3094] |
[#x30A1-#x30FA] | [#x3105-#x312C] | [#xAC00-#xD7A3]"""
ideographic = """[#x4E00-#x9FA5] | #x3007 | [#x3021-#x3029]"""
combiningCharacter = """
[#x0300-#x0345] | [#x0360-#x0361] | [#x0483-#x0486] | [#x0591-#x05A1] |
[#x05A3-#x05B9] | [#x05BB-#x05BD] | #x05BF | [#x05C1-#x05C2] | #x05C4 |
[#x064B-#x0652] | #x0670 | [#x06D6-#x06DC] | [#x06DD-#x06DF] |
[#x06E0-#x06E4] | [#x06E7-#x06E8] | [#x06EA-#x06ED] | [#x0901-#x0903] |
#x093C | [#x093E-#x094C] | #x094D | [#x0951-#x0954] | [#x0962-#x0963] |
[#x0981-#x0983] | #x09BC | #x09BE | #x09BF | [#x09C0-#x09C4] |
[#x09C7-#x09C8] | [#x09CB-#x09CD] | #x09D7 | [#x09E2-#x09E3] | #x0A02 |
#x0A3C | #x0A3E | #x0A3F | [#x0A40-#x0A42] | [#x0A47-#x0A48] |
[#x0A4B-#x0A4D] | [#x0A70-#x0A71] | [#x0A81-#x0A83] | #x0ABC |
[#x0ABE-#x0AC5] | [#x0AC7-#x0AC9] | [#x0ACB-#x0ACD] | [#x0B01-#x0B03] |
#x0B3C | [#x0B3E-#x0B43] | [#x0B47-#x0B48] | [#x0B4B-#x0B4D] |
[#x0B56-#x0B57] | [#x0B82-#x0B83] | [#x0BBE-#x0BC2] | [#x0BC6-#x0BC8] |
[#x0BCA-#x0BCD] | #x0BD7 | [#x0C01-#x0C03] | [#x0C3E-#x0C44] |
[#x0C46-#x0C48] | [#x0C4A-#x0C4D] | [#x0C55-#x0C56] | [#x0C82-#x0C83] |
[#x0CBE-#x0CC4] | [#x0CC6-#x0CC8] | [#x0CCA-#x0CCD] | [#x0CD5-#x0CD6] |
[#x0D02-#x0D03] | [#x0D3E-#x0D43] | [#x0D46-#x0D48] | [#x0D4A-#x0D4D] |
#x0D57 | #x0E31 | [#x0E34-#x0E3A] | [#x0E47-#x0E4E] | #x0EB1 |
[#x0EB4-#x0EB9] | [#x0EBB-#x0EBC] | [#x0EC8-#x0ECD] | [#x0F18-#x0F19] |
#x0F35 | #x0F37 | #x0F39 | #x0F3E | #x0F3F | [#x0F71-#x0F84] |
[#x0F86-#x0F8B] | [#x0F90-#x0F95] | #x0F97 | [#x0F99-#x0FAD] |
[#x0FB1-#x0FB7] | #x0FB9 | [#x20D0-#x20DC] | #x20E1 | [#x302A-#x302F] |
#x3099 | #x309A"""
digit = """
[#x0030-#x0039] | [#x0660-#x0669] | [#x06F0-#x06F9] | [#x0966-#x096F] |
[#x09E6-#x09EF] | [#x0A66-#x0A6F] | [#x0AE6-#x0AEF] | [#x0B66-#x0B6F] |
[#x0BE7-#x0BEF] | [#x0C66-#x0C6F] | [#x0CE6-#x0CEF] | [#x0D66-#x0D6F] |
[#x0E50-#x0E59] | [#x0ED0-#x0ED9] | [#x0F20-#x0F29]"""
extender = """
#x00B7 | #x02D0 | #x02D1 | #x0387 | #x0640 | #x0E46 | #x0EC6 | #x3005 |
#[#x3031-#x3035] | [#x309D-#x309E] | [#x30FC-#x30FE]"""
letter = " | ".join([baseChar, ideographic])
# Without the
name = " | ".join([letter, digit, ".", "-", "_", combiningCharacter,
extender])
nameFirst = " | ".join([letter, "_"])
reChar = re.compile(r"#x([\d|A-F]{4,4})")
reCharRange = re.compile(r"\[#x([\d|A-F]{4,4})-#x([\d|A-F]{4,4})\]")
def charStringToList(chars):
charRanges = [item.strip() for item in chars.split(" | ")]
rv = []
for item in charRanges:
foundMatch = False
for regexp in (reChar, reCharRange):
match = regexp.match(item)
if match is not None:
rv.append([hexToInt(item) for item in match.groups()])
if len(rv[-1]) == 1:
rv[-1] = rv[-1] * 2
foundMatch = True
break
if not foundMatch:
assert len(item) == 1
rv.append([ord(item)] * 2)
rv = normaliseCharList(rv)
return rv
def normaliseCharList(charList):
charList = sorted(charList)
for item in charList:
assert item[1] >= item[0]
rv = []
i = 0
while i < len(charList):
j = 1
rv.append(charList[i])
while i + j < len(charList) and charList[i + j][0] <= rv[-1][1] + 1:
rv[-1][1] = charList[i + j][1]
j += 1
i += j
return rv
# We don't really support characters above the BMP :(
max_unicode = int("FFFF", 16)
def missingRanges(charList):
rv = []
if charList[0] != 0:
rv.append([0, charList[0][0] - 1])
for i, item in enumerate(charList[:-1]):
rv.append([item[1] + 1, charList[i + 1][0] - 1])
if charList[-1][1] != max_unicode:
rv.append([charList[-1][1] + 1, max_unicode])
return rv
def listToRegexpStr(charList):
rv = []
for item in charList:
if item[0] == item[1]:
rv.append(escapeRegexp(chr(item[0])))
else:
rv.append(escapeRegexp(chr(item[0])) + "-" +
escapeRegexp(chr(item[1])))
return "[%s]" % "".join(rv)
def hexToInt(hex_str):
return int(hex_str, 16)
def escapeRegexp(string):
specialCharacters = (".", "^", "$", "*", "+", "?", "{", "}",
"[", "]", "|", "(", ")", "-")
for char in specialCharacters:
string = string.replace(char, "\\" + char)
return string
# output from the above
nonXmlNameBMPRegexp = re.compile('[\x00-,/:-@\\[-\\^`\\{-\xb6\xb8-\xbf\xd7\xf7\u0132-\u0133\u013f-\u0140\u0149\u017f\u01c4-\u01cc\u01f1-\u01f3\u01f6-\u01f9\u0218-\u024f\u02a9-\u02ba\u02c2-\u02cf\u02d2-\u02ff\u0346-\u035f\u0362-\u0385\u038b\u038d\u03a2\u03cf\u03d7-\u03d9\u03db\u03dd\u03df\u03e1\u03f4-\u0400\u040d\u0450\u045d\u0482\u0487-\u048f\u04c5-\u04c6\u04c9-\u04ca\u04cd-\u04cf\u04ec-\u04ed\u04f6-\u04f7\u04fa-\u0530\u0557-\u0558\u055a-\u0560\u0587-\u0590\u05a2\u05ba\u05be\u05c0\u05c3\u05c5-\u05cf\u05eb-\u05ef\u05f3-\u0620\u063b-\u063f\u0653-\u065f\u066a-\u066f\u06b8-\u06b9\u06bf\u06cf\u06d4\u06e9\u06ee-\u06ef\u06fa-\u0900\u0904\u093a-\u093b\u094e-\u0950\u0955-\u0957\u0964-\u0965\u0970-\u0980\u0984\u098d-\u098e\u0991-\u0992\u09a9\u09b1\u09b3-\u09b5\u09ba-\u09bb\u09bd\u09c5-\u09c6\u09c9-\u09ca\u09ce-\u09d6\u09d8-\u09db\u09de\u09e4-\u09e5\u09f2-\u0a01\u0a03-\u0a04\u0a0b-\u0a0e\u0a11-\u0a12\u0a29\u0a31\u0a34\u0a37\u0a3a-\u0a3b\u0a3d\u0a43-\u0a46\u0a49-\u0a4a\u0a4e-\u0a58\u0a5d\u0a5f-\u0a65\u0a75-\u0a80\u0a84\u0a8c\u0a8e\u0a92\u0aa9\u0ab1\u0ab4\u0aba-\u0abb\u0ac6\u0aca\u0ace-\u0adf\u0ae1-\u0ae5\u0af0-\u0b00\u0b04\u0b0d-\u0b0e\u0b11-\u0b12\u0b29\u0b31\u0b34-\u0b35\u0b3a-\u0b3b\u0b44-\u0b46\u0b49-\u0b4a\u0b4e-\u0b55\u0b58-\u0b5b\u0b5e\u0b62-\u0b65\u0b70-\u0b81\u0b84\u0b8b-\u0b8d\u0b91\u0b96-\u0b98\u0b9b\u0b9d\u0ba0-\u0ba2\u0ba5-\u0ba7\u0bab-\u0bad\u0bb6\u0bba-\u0bbd\u0bc3-\u0bc5\u0bc9\u0bce-\u0bd6\u0bd8-\u0be6\u0bf0-\u0c00\u0c04\u0c0d\u0c11\u0c29\u0c34\u0c3a-\u0c3d\u0c45\u0c49\u0c4e-\u0c54\u0c57-\u0c5f\u0c62-\u0c65\u0c70-\u0c81\u0c84\u0c8d\u0c91\u0ca9\u0cb4\u0cba-\u0cbd\u0cc5\u0cc9\u0cce-\u0cd4\u0cd7-\u0cdd\u0cdf\u0ce2-\u0ce5\u0cf0-\u0d01\u0d04\u0d0d\u0d11\u0d29\u0d3a-\u0d3d\u0d44-\u0d45\u0d49\u0d4e-\u0d56\u0d58-\u0d5f\u0d62-\u0d65\u0d70-\u0e00\u0e2f\u0e3b-\u0e3f\u0e4f\u0e5a-\u0e80\u0e83\u0e85-\u0e86\u0e89\u0e8b-\u0e8c\u0e8e-\u0e93\u0e98\u0ea0\u0ea4\u0ea6\u0ea8-\u0ea9\u0eac\u0eaf\u0eba\u0ebe-\u0ebf\u0ec5\u0ec7\u0ece-\u0ecf\u0eda-\u0f17\u0f1a-\u0f1f\u0f2a-\u0f34\u0f36\u0f38\u0f3a-\u0f3d\u0f48\u0f6a-\u0f70\u0f85\u0f8c-\u0f8f\u0f96\u0f98\u0fae-\u0fb0\u0fb8\u0fba-\u109f\u10c6-\u10cf\u10f7-\u10ff\u1101\u1104\u1108\u110a\u110d\u1113-\u113b\u113d\u113f\u1141-\u114b\u114d\u114f\u1151-\u1153\u1156-\u1158\u115a-\u115e\u1162\u1164\u1166\u1168\u116a-\u116c\u116f-\u1171\u1174\u1176-\u119d\u119f-\u11a7\u11a9-\u11aa\u11ac-\u11ad\u11b0-\u11b6\u11b9\u11bb\u11c3-\u11ea\u11ec-\u11ef\u11f1-\u11f8\u11fa-\u1dff\u1e9c-\u1e9f\u1efa-\u1eff\u1f16-\u1f17\u1f1e-\u1f1f\u1f46-\u1f47\u1f4e-\u1f4f\u1f58\u1f5a\u1f5c\u1f5e\u1f7e-\u1f7f\u1fb5\u1fbd\u1fbf-\u1fc1\u1fc5\u1fcd-\u1fcf\u1fd4-\u1fd5\u1fdc-\u1fdf\u1fed-\u1ff1\u1ff5\u1ffd-\u20cf\u20dd-\u20e0\u20e2-\u2125\u2127-\u2129\u212c-\u212d\u212f-\u217f\u2183-\u3004\u3006\u3008-\u3020\u3030\u3036-\u3040\u3095-\u3098\u309b-\u309c\u309f-\u30a0\u30fb\u30ff-\u3104\u312d-\u4dff\u9fa6-\uabff\ud7a4-\uffff]') # noqa
nonXmlNameFirstBMPRegexp = re.compile('[\x00-@\\[-\\^`\\{-\xbf\xd7\xf7\u0132-\u0133\u013f-\u0140\u0149\u017f\u01c4-\u01cc\u01f1-\u01f3\u01f6-\u01f9\u0218-\u024f\u02a9-\u02ba\u02c2-\u0385\u0387\u038b\u038d\u03a2\u03cf\u03d7-\u03d9\u03db\u03dd\u03df\u03e1\u03f4-\u0400\u040d\u0450\u045d\u0482-\u048f\u04c5-\u04c6\u04c9-\u04ca\u04cd-\u04cf\u04ec-\u04ed\u04f6-\u04f7\u04fa-\u0530\u0557-\u0558\u055a-\u0560\u0587-\u05cf\u05eb-\u05ef\u05f3-\u0620\u063b-\u0640\u064b-\u0670\u06b8-\u06b9\u06bf\u06cf\u06d4\u06d6-\u06e4\u06e7-\u0904\u093a-\u093c\u093e-\u0957\u0962-\u0984\u098d-\u098e\u0991-\u0992\u09a9\u09b1\u09b3-\u09b5\u09ba-\u09db\u09de\u09e2-\u09ef\u09f2-\u0a04\u0a0b-\u0a0e\u0a11-\u0a12\u0a29\u0a31\u0a34\u0a37\u0a3a-\u0a58\u0a5d\u0a5f-\u0a71\u0a75-\u0a84\u0a8c\u0a8e\u0a92\u0aa9\u0ab1\u0ab4\u0aba-\u0abc\u0abe-\u0adf\u0ae1-\u0b04\u0b0d-\u0b0e\u0b11-\u0b12\u0b29\u0b31\u0b34-\u0b35\u0b3a-\u0b3c\u0b3e-\u0b5b\u0b5e\u0b62-\u0b84\u0b8b-\u0b8d\u0b91\u0b96-\u0b98\u0b9b\u0b9d\u0ba0-\u0ba2\u0ba5-\u0ba7\u0bab-\u0bad\u0bb6\u0bba-\u0c04\u0c0d\u0c11\u0c29\u0c34\u0c3a-\u0c5f\u0c62-\u0c84\u0c8d\u0c91\u0ca9\u0cb4\u0cba-\u0cdd\u0cdf\u0ce2-\u0d04\u0d0d\u0d11\u0d29\u0d3a-\u0d5f\u0d62-\u0e00\u0e2f\u0e31\u0e34-\u0e3f\u0e46-\u0e80\u0e83\u0e85-\u0e86\u0e89\u0e8b-\u0e8c\u0e8e-\u0e93\u0e98\u0ea0\u0ea4\u0ea6\u0ea8-\u0ea9\u0eac\u0eaf\u0eb1\u0eb4-\u0ebc\u0ebe-\u0ebf\u0ec5-\u0f3f\u0f48\u0f6a-\u109f\u10c6-\u10cf\u10f7-\u10ff\u1101\u1104\u1108\u110a\u110d\u1113-\u113b\u113d\u113f\u1141-\u114b\u114d\u114f\u1151-\u1153\u1156-\u1158\u115a-\u115e\u1162\u1164\u1166\u1168\u116a-\u116c\u116f-\u1171\u1174\u1176-\u119d\u119f-\u11a7\u11a9-\u11aa\u11ac-\u11ad\u11b0-\u11b6\u11b9\u11bb\u11c3-\u11ea\u11ec-\u11ef\u11f1-\u11f8\u11fa-\u1dff\u1e9c-\u1e9f\u1efa-\u1eff\u1f16-\u1f17\u1f1e-\u1f1f\u1f46-\u1f47\u1f4e-\u1f4f\u1f58\u1f5a\u1f5c\u1f5e\u1f7e-\u1f7f\u1fb5\u1fbd\u1fbf-\u1fc1\u1fc5\u1fcd-\u1fcf\u1fd4-\u1fd5\u1fdc-\u1fdf\u1fed-\u1ff1\u1ff5\u1ffd-\u2125\u2127-\u2129\u212c-\u212d\u212f-\u217f\u2183-\u3006\u3008-\u3020\u302a-\u3040\u3095-\u30a0\u30fb-\u3104\u312d-\u4dff\u9fa6-\uabff\ud7a4-\uffff]') # noqa
# Simpler things
nonPubidCharRegexp = re.compile("[^\x20\x0D\x0Aa-zA-Z0-9\-\'()+,./:=?;!*#@$_%]")
class InfosetFilter(object):
replacementRegexp = re.compile(r"U[\dA-F]{5,5}")
def __init__(self,
dropXmlnsLocalName=False,
dropXmlnsAttrNs=False,
preventDoubleDashComments=False,
preventDashAtCommentEnd=False,
replaceFormFeedCharacters=True,
preventSingleQuotePubid=False):
self.dropXmlnsLocalName = dropXmlnsLocalName
self.dropXmlnsAttrNs = dropXmlnsAttrNs
self.preventDoubleDashComments = preventDoubleDashComments
self.preventDashAtCommentEnd = preventDashAtCommentEnd
self.replaceFormFeedCharacters = replaceFormFeedCharacters
self.preventSingleQuotePubid = preventSingleQuotePubid
self.replaceCache = {}
def coerceAttribute(self, name, namespace=None):
if self.dropXmlnsLocalName and name.startswith("xmlns:"):
warnings.warn("Attributes cannot begin with xmlns", DataLossWarning)
return None
elif (self.dropXmlnsAttrNs and
namespace == "http://www.w3.org/2000/xmlns/"):
warnings.warn("Attributes cannot be in the xml namespace", DataLossWarning)
return None
else:
return self.toXmlName(name)
def coerceElement(self, name):
return self.toXmlName(name)
def coerceComment(self, data):
if self.preventDoubleDashComments:
while "--" in data:
warnings.warn("Comments cannot contain adjacent dashes", DataLossWarning)
data = data.replace("--", "- -")
if data.endswith("-"):
warnings.warn("Comments cannot end in a dash", DataLossWarning)
data += " "
return data
def coerceCharacters(self, data):
if self.replaceFormFeedCharacters:
for _ in range(data.count("\x0C")):
warnings.warn("Text cannot contain U+000C", DataLossWarning)
data = data.replace("\x0C", " ")
# Other non-xml characters
return data
def coercePubid(self, data):
dataOutput = data
for char in nonPubidCharRegexp.findall(data):
warnings.warn("Coercing non-XML pubid", DataLossWarning)
replacement = self.getReplacementCharacter(char)
dataOutput = dataOutput.replace(char, replacement)
if self.preventSingleQuotePubid and dataOutput.find("'") >= 0:
warnings.warn("Pubid cannot contain single quote", DataLossWarning)
dataOutput = dataOutput.replace("'", self.getReplacementCharacter("'"))
return dataOutput
def toXmlName(self, name):
nameFirst = name[0]
nameRest = name[1:]
m = nonXmlNameFirstBMPRegexp.match(nameFirst)
if m:
warnings.warn("Coercing non-XML name", DataLossWarning)
nameFirstOutput = self.getReplacementCharacter(nameFirst)
else:
nameFirstOutput = nameFirst
nameRestOutput = nameRest
replaceChars = set(nonXmlNameBMPRegexp.findall(nameRest))
for char in replaceChars:
warnings.warn("Coercing non-XML name", DataLossWarning)
replacement = self.getReplacementCharacter(char)
nameRestOutput = nameRestOutput.replace(char, replacement)
return nameFirstOutput + nameRestOutput
def getReplacementCharacter(self, char):
if char in self.replaceCache:
replacement = self.replaceCache[char]
else:
replacement = self.escapeChar(char)
return replacement
def fromXmlName(self, name):
for item in set(self.replacementRegexp.findall(name)):
name = name.replace(item, self.unescapeChar(item))
return name
def escapeChar(self, char):
replacement = "U%05X" % ord(char)
self.replaceCache[char] = replacement
return replacement
def unescapeChar(self, charcode):
return chr(int(charcode[1:], 16))
pip/_vendor/html5lib/_inputstream.py 0000644 00000077424 14751155150 0013616 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import text_type, binary_type
from pip._vendor.six.moves import http_client, urllib
import codecs
import re
from pip._vendor import webencodings
from .constants import EOF, spaceCharacters, asciiLetters, asciiUppercase
from .constants import ReparseException
from . import _utils
from io import StringIO
try:
from io import BytesIO
except ImportError:
BytesIO = StringIO
# Non-unicode versions of constants for use in the pre-parser
spaceCharactersBytes = frozenset([item.encode("ascii") for item in spaceCharacters])
asciiLettersBytes = frozenset([item.encode("ascii") for item in asciiLetters])
asciiUppercaseBytes = frozenset([item.encode("ascii") for item in asciiUppercase])
spacesAngleBrackets = spaceCharactersBytes | frozenset([b">", b"<"])
invalid_unicode_no_surrogate = "[\u0001-\u0008\u000B\u000E-\u001F\u007F-\u009F\uFDD0-\uFDEF\uFFFE\uFFFF\U0001FFFE\U0001FFFF\U0002FFFE\U0002FFFF\U0003FFFE\U0003FFFF\U0004FFFE\U0004FFFF\U0005FFFE\U0005FFFF\U0006FFFE\U0006FFFF\U0007FFFE\U0007FFFF\U0008FFFE\U0008FFFF\U0009FFFE\U0009FFFF\U000AFFFE\U000AFFFF\U000BFFFE\U000BFFFF\U000CFFFE\U000CFFFF\U000DFFFE\U000DFFFF\U000EFFFE\U000EFFFF\U000FFFFE\U000FFFFF\U0010FFFE\U0010FFFF]" # noqa
if _utils.supports_lone_surrogates:
# Use one extra step of indirection and create surrogates with
# eval. Not using this indirection would introduce an illegal
# unicode literal on platforms not supporting such lone
# surrogates.
assert invalid_unicode_no_surrogate[-1] == "]" and invalid_unicode_no_surrogate.count("]") == 1
invalid_unicode_re = re.compile(invalid_unicode_no_surrogate[:-1] +
eval('"\\uD800-\\uDFFF"') + # pylint:disable=eval-used
"]")
else:
invalid_unicode_re = re.compile(invalid_unicode_no_surrogate)
non_bmp_invalid_codepoints = set([0x1FFFE, 0x1FFFF, 0x2FFFE, 0x2FFFF, 0x3FFFE,
0x3FFFF, 0x4FFFE, 0x4FFFF, 0x5FFFE, 0x5FFFF,
0x6FFFE, 0x6FFFF, 0x7FFFE, 0x7FFFF, 0x8FFFE,
0x8FFFF, 0x9FFFE, 0x9FFFF, 0xAFFFE, 0xAFFFF,
0xBFFFE, 0xBFFFF, 0xCFFFE, 0xCFFFF, 0xDFFFE,
0xDFFFF, 0xEFFFE, 0xEFFFF, 0xFFFFE, 0xFFFFF,
0x10FFFE, 0x10FFFF])
ascii_punctuation_re = re.compile("[\u0009-\u000D\u0020-\u002F\u003A-\u0040\u005B-\u0060\u007B-\u007E]")
# Cache for charsUntil()
charsUntilRegEx = {}
class BufferedStream(object):
"""Buffering for streams that do not have buffering of their own
The buffer is implemented as a list of chunks on the assumption that
joining many strings will be slow since it is O(n**2)
"""
def __init__(self, stream):
self.stream = stream
self.buffer = []
self.position = [-1, 0] # chunk number, offset
def tell(self):
pos = 0
for chunk in self.buffer[:self.position[0]]:
pos += len(chunk)
pos += self.position[1]
return pos
def seek(self, pos):
assert pos <= self._bufferedBytes()
offset = pos
i = 0
while len(self.buffer[i]) < offset:
offset -= len(self.buffer[i])
i += 1
self.position = [i, offset]
def read(self, bytes):
if not self.buffer:
return self._readStream(bytes)
elif (self.position[0] == len(self.buffer) and
self.position[1] == len(self.buffer[-1])):
return self._readStream(bytes)
else:
return self._readFromBuffer(bytes)
def _bufferedBytes(self):
return sum([len(item) for item in self.buffer])
def _readStream(self, bytes):
data = self.stream.read(bytes)
self.buffer.append(data)
self.position[0] += 1
self.position[1] = len(data)
return data
def _readFromBuffer(self, bytes):
remainingBytes = bytes
rv = []
bufferIndex = self.position[0]
bufferOffset = self.position[1]
while bufferIndex < len(self.buffer) and remainingBytes != 0:
assert remainingBytes > 0
bufferedData = self.buffer[bufferIndex]
if remainingBytes <= len(bufferedData) - bufferOffset:
bytesToRead = remainingBytes
self.position = [bufferIndex, bufferOffset + bytesToRead]
else:
bytesToRead = len(bufferedData) - bufferOffset
self.position = [bufferIndex, len(bufferedData)]
bufferIndex += 1
rv.append(bufferedData[bufferOffset:bufferOffset + bytesToRead])
remainingBytes -= bytesToRead
bufferOffset = 0
if remainingBytes:
rv.append(self._readStream(remainingBytes))
return b"".join(rv)
def HTMLInputStream(source, **kwargs):
# Work around Python bug #20007: read(0) closes the connection.
# http://bugs.python.org/issue20007
if (isinstance(source, http_client.HTTPResponse) or
# Also check for addinfourl wrapping HTTPResponse
(isinstance(source, urllib.response.addbase) and
isinstance(source.fp, http_client.HTTPResponse))):
isUnicode = False
elif hasattr(source, "read"):
isUnicode = isinstance(source.read(0), text_type)
else:
isUnicode = isinstance(source, text_type)
if isUnicode:
encodings = [x for x in kwargs if x.endswith("_encoding")]
if encodings:
raise TypeError("Cannot set an encoding with a unicode input, set %r" % encodings)
return HTMLUnicodeInputStream(source, **kwargs)
else:
return HTMLBinaryInputStream(source, **kwargs)
class HTMLUnicodeInputStream(object):
"""Provides a unicode stream of characters to the HTMLTokenizer.
This class takes care of character encoding and removing or replacing
incorrect byte-sequences and also provides column and line tracking.
"""
_defaultChunkSize = 10240
def __init__(self, source):
"""Initialises the HTMLInputStream.
HTMLInputStream(source, [encoding]) -> Normalized stream from source
for use by html5lib.
source can be either a file-object, local filename or a string.
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
"""
if not _utils.supports_lone_surrogates:
# Such platforms will have already checked for such
# surrogate errors, so no need to do this checking.
self.reportCharacterErrors = None
elif len("\U0010FFFF") == 1:
self.reportCharacterErrors = self.characterErrorsUCS4
else:
self.reportCharacterErrors = self.characterErrorsUCS2
# List of where new lines occur
self.newLines = [0]
self.charEncoding = (lookupEncoding("utf-8"), "certain")
self.dataStream = self.openStream(source)
self.reset()
def reset(self):
self.chunk = ""
self.chunkSize = 0
self.chunkOffset = 0
self.errors = []
# number of (complete) lines in previous chunks
self.prevNumLines = 0
# number of columns in the last line of the previous chunk
self.prevNumCols = 0
# Deal with CR LF and surrogates split over chunk boundaries
self._bufferedCharacter = None
def openStream(self, source):
"""Produces a file object from source.
source can be either a file object, local filename or a string.
"""
# Already a file object
if hasattr(source, 'read'):
stream = source
else:
stream = StringIO(source)
return stream
def _position(self, offset):
chunk = self.chunk
nLines = chunk.count('\n', 0, offset)
positionLine = self.prevNumLines + nLines
lastLinePos = chunk.rfind('\n', 0, offset)
if lastLinePos == -1:
positionColumn = self.prevNumCols + offset
else:
positionColumn = offset - (lastLinePos + 1)
return (positionLine, positionColumn)
def position(self):
"""Returns (line, col) of the current position in the stream."""
line, col = self._position(self.chunkOffset)
return (line + 1, col)
def char(self):
""" Read one character from the stream or queue if available. Return
EOF when EOF is reached.
"""
# Read a new chunk from the input stream if necessary
if self.chunkOffset >= self.chunkSize:
if not self.readChunk():
return EOF
chunkOffset = self.chunkOffset
char = self.chunk[chunkOffset]
self.chunkOffset = chunkOffset + 1
return char
def readChunk(self, chunkSize=None):
if chunkSize is None:
chunkSize = self._defaultChunkSize
self.prevNumLines, self.prevNumCols = self._position(self.chunkSize)
self.chunk = ""
self.chunkSize = 0
self.chunkOffset = 0
data = self.dataStream.read(chunkSize)
# Deal with CR LF and surrogates broken across chunks
if self._bufferedCharacter:
data = self._bufferedCharacter + data
self._bufferedCharacter = None
elif not data:
# We have no more data, bye-bye stream
return False
if len(data) > 1:
lastv = ord(data[-1])
if lastv == 0x0D or 0xD800 <= lastv <= 0xDBFF:
self._bufferedCharacter = data[-1]
data = data[:-1]
if self.reportCharacterErrors:
self.reportCharacterErrors(data)
# Replace invalid characters
data = data.replace("\r\n", "\n")
data = data.replace("\r", "\n")
self.chunk = data
self.chunkSize = len(data)
return True
def characterErrorsUCS4(self, data):
for _ in range(len(invalid_unicode_re.findall(data))):
self.errors.append("invalid-codepoint")
def characterErrorsUCS2(self, data):
# Someone picked the wrong compile option
# You lose
skip = False
for match in invalid_unicode_re.finditer(data):
if skip:
continue
codepoint = ord(match.group())
pos = match.start()
# Pretty sure there should be endianness issues here
if _utils.isSurrogatePair(data[pos:pos + 2]):
# We have a surrogate pair!
char_val = _utils.surrogatePairToCodepoint(data[pos:pos + 2])
if char_val in non_bmp_invalid_codepoints:
self.errors.append("invalid-codepoint")
skip = True
elif (codepoint >= 0xD800 and codepoint <= 0xDFFF and
pos == len(data) - 1):
self.errors.append("invalid-codepoint")
else:
skip = False
self.errors.append("invalid-codepoint")
def charsUntil(self, characters, opposite=False):
""" Returns a string of characters from the stream up to but not
including any character in 'characters' or EOF. 'characters' must be
a container that supports the 'in' method and iteration over its
characters.
"""
# Use a cache of regexps to find the required characters
try:
chars = charsUntilRegEx[(characters, opposite)]
except KeyError:
if __debug__:
for c in characters:
assert(ord(c) < 128)
regex = "".join(["\\x%02x" % ord(c) for c in characters])
if not opposite:
regex = "^%s" % regex
chars = charsUntilRegEx[(characters, opposite)] = re.compile("[%s]+" % regex)
rv = []
while True:
# Find the longest matching prefix
m = chars.match(self.chunk, self.chunkOffset)
if m is None:
# If nothing matched, and it wasn't because we ran out of chunk,
# then stop
if self.chunkOffset != self.chunkSize:
break
else:
end = m.end()
# If not the whole chunk matched, return everything
# up to the part that didn't match
if end != self.chunkSize:
rv.append(self.chunk[self.chunkOffset:end])
self.chunkOffset = end
break
# If the whole remainder of the chunk matched,
# use it all and read the next chunk
rv.append(self.chunk[self.chunkOffset:])
if not self.readChunk():
# Reached EOF
break
r = "".join(rv)
return r
def unget(self, char):
# Only one character is allowed to be ungotten at once - it must
# be consumed again before any further call to unget
if char is not None:
if self.chunkOffset == 0:
# unget is called quite rarely, so it's a good idea to do
# more work here if it saves a bit of work in the frequently
# called char and charsUntil.
# So, just prepend the ungotten character onto the current
# chunk:
self.chunk = char + self.chunk
self.chunkSize += 1
else:
self.chunkOffset -= 1
assert self.chunk[self.chunkOffset] == char
class HTMLBinaryInputStream(HTMLUnicodeInputStream):
"""Provides a unicode stream of characters to the HTMLTokenizer.
This class takes care of character encoding and removing or replacing
incorrect byte-sequences and also provides column and line tracking.
"""
def __init__(self, source, override_encoding=None, transport_encoding=None,
same_origin_parent_encoding=None, likely_encoding=None,
default_encoding="windows-1252", useChardet=True):
"""Initialises the HTMLInputStream.
HTMLInputStream(source, [encoding]) -> Normalized stream from source
for use by html5lib.
source can be either a file-object, local filename or a string.
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
"""
# Raw Stream - for unicode objects this will encode to utf-8 and set
# self.charEncoding as appropriate
self.rawStream = self.openStream(source)
HTMLUnicodeInputStream.__init__(self, self.rawStream)
# Encoding Information
# Number of bytes to use when looking for a meta element with
# encoding information
self.numBytesMeta = 1024
# Number of bytes to use when using detecting encoding using chardet
self.numBytesChardet = 100
# Things from args
self.override_encoding = override_encoding
self.transport_encoding = transport_encoding
self.same_origin_parent_encoding = same_origin_parent_encoding
self.likely_encoding = likely_encoding
self.default_encoding = default_encoding
# Determine encoding
self.charEncoding = self.determineEncoding(useChardet)
assert self.charEncoding[0] is not None
# Call superclass
self.reset()
def reset(self):
self.dataStream = self.charEncoding[0].codec_info.streamreader(self.rawStream, 'replace')
HTMLUnicodeInputStream.reset(self)
def openStream(self, source):
"""Produces a file object from source.
source can be either a file object, local filename or a string.
"""
# Already a file object
if hasattr(source, 'read'):
stream = source
else:
stream = BytesIO(source)
try:
stream.seek(stream.tell())
except: # pylint:disable=bare-except
stream = BufferedStream(stream)
return stream
def determineEncoding(self, chardet=True):
# BOMs take precedence over everything
# This will also read past the BOM if present
charEncoding = self.detectBOM(), "certain"
if charEncoding[0] is not None:
return charEncoding
# If we've been overriden, we've been overriden
charEncoding = lookupEncoding(self.override_encoding), "certain"
if charEncoding[0] is not None:
return charEncoding
# Now check the transport layer
charEncoding = lookupEncoding(self.transport_encoding), "certain"
if charEncoding[0] is not None:
return charEncoding
# Look for meta elements with encoding information
charEncoding = self.detectEncodingMeta(), "tentative"
if charEncoding[0] is not None:
return charEncoding
# Parent document encoding
charEncoding = lookupEncoding(self.same_origin_parent_encoding), "tentative"
if charEncoding[0] is not None and not charEncoding[0].name.startswith("utf-16"):
return charEncoding
# "likely" encoding
charEncoding = lookupEncoding(self.likely_encoding), "tentative"
if charEncoding[0] is not None:
return charEncoding
# Guess with chardet, if available
if chardet:
try:
from chardet.universaldetector import UniversalDetector
except ImportError:
pass
else:
buffers = []
detector = UniversalDetector()
while not detector.done:
buffer = self.rawStream.read(self.numBytesChardet)
assert isinstance(buffer, bytes)
if not buffer:
break
buffers.append(buffer)
detector.feed(buffer)
detector.close()
encoding = lookupEncoding(detector.result['encoding'])
self.rawStream.seek(0)
if encoding is not None:
return encoding, "tentative"
# Try the default encoding
charEncoding = lookupEncoding(self.default_encoding), "tentative"
if charEncoding[0] is not None:
return charEncoding
# Fallback to html5lib's default if even that hasn't worked
return lookupEncoding("windows-1252"), "tentative"
def changeEncoding(self, newEncoding):
assert self.charEncoding[1] != "certain"
newEncoding = lookupEncoding(newEncoding)
if newEncoding is None:
return
if newEncoding.name in ("utf-16be", "utf-16le"):
newEncoding = lookupEncoding("utf-8")
assert newEncoding is not None
elif newEncoding == self.charEncoding[0]:
self.charEncoding = (self.charEncoding[0], "certain")
else:
self.rawStream.seek(0)
self.charEncoding = (newEncoding, "certain")
self.reset()
raise ReparseException("Encoding changed from %s to %s" % (self.charEncoding[0], newEncoding))
def detectBOM(self):
"""Attempts to detect at BOM at the start of the stream. If
an encoding can be determined from the BOM return the name of the
encoding otherwise return None"""
bomDict = {
codecs.BOM_UTF8: 'utf-8',
codecs.BOM_UTF16_LE: 'utf-16le', codecs.BOM_UTF16_BE: 'utf-16be',
codecs.BOM_UTF32_LE: 'utf-32le', codecs.BOM_UTF32_BE: 'utf-32be'
}
# Go to beginning of file and read in 4 bytes
string = self.rawStream.read(4)
assert isinstance(string, bytes)
# Try detecting the BOM using bytes from the string
encoding = bomDict.get(string[:3]) # UTF-8
seek = 3
if not encoding:
# Need to detect UTF-32 before UTF-16
encoding = bomDict.get(string) # UTF-32
seek = 4
if not encoding:
encoding = bomDict.get(string[:2]) # UTF-16
seek = 2
# Set the read position past the BOM if one was found, otherwise
# set it to the start of the stream
if encoding:
self.rawStream.seek(seek)
return lookupEncoding(encoding)
else:
self.rawStream.seek(0)
return None
def detectEncodingMeta(self):
"""Report the encoding declared by the meta element
"""
buffer = self.rawStream.read(self.numBytesMeta)
assert isinstance(buffer, bytes)
parser = EncodingParser(buffer)
self.rawStream.seek(0)
encoding = parser.getEncoding()
if encoding is not None and encoding.name in ("utf-16be", "utf-16le"):
encoding = lookupEncoding("utf-8")
return encoding
class EncodingBytes(bytes):
"""String-like object with an associated position and various extra methods
If the position is ever greater than the string length then an exception is
raised"""
def __new__(self, value):
assert isinstance(value, bytes)
return bytes.__new__(self, value.lower())
def __init__(self, value):
# pylint:disable=unused-argument
self._position = -1
def __iter__(self):
return self
def __next__(self):
p = self._position = self._position + 1
if p >= len(self):
raise StopIteration
elif p < 0:
raise TypeError
return self[p:p + 1]
def next(self):
# Py2 compat
return self.__next__()
def previous(self):
p = self._position
if p >= len(self):
raise StopIteration
elif p < 0:
raise TypeError
self._position = p = p - 1
return self[p:p + 1]
def setPosition(self, position):
if self._position >= len(self):
raise StopIteration
self._position = position
def getPosition(self):
if self._position >= len(self):
raise StopIteration
if self._position >= 0:
return self._position
else:
return None
position = property(getPosition, setPosition)
def getCurrentByte(self):
return self[self.position:self.position + 1]
currentByte = property(getCurrentByte)
def skip(self, chars=spaceCharactersBytes):
"""Skip past a list of characters"""
p = self.position # use property for the error-checking
while p < len(self):
c = self[p:p + 1]
if c not in chars:
self._position = p
return c
p += 1
self._position = p
return None
def skipUntil(self, chars):
p = self.position
while p < len(self):
c = self[p:p + 1]
if c in chars:
self._position = p
return c
p += 1
self._position = p
return None
def matchBytes(self, bytes):
"""Look for a sequence of bytes at the start of a string. If the bytes
are found return True and advance the position to the byte after the
match. Otherwise return False and leave the position alone"""
p = self.position
data = self[p:p + len(bytes)]
rv = data.startswith(bytes)
if rv:
self.position += len(bytes)
return rv
def jumpTo(self, bytes):
"""Look for the next sequence of bytes matching a given sequence. If
a match is found advance the position to the last byte of the match"""
newPosition = self[self.position:].find(bytes)
if newPosition > -1:
# XXX: This is ugly, but I can't see a nicer way to fix this.
if self._position == -1:
self._position = 0
self._position += (newPosition + len(bytes) - 1)
return True
else:
raise StopIteration
class EncodingParser(object):
"""Mini parser for detecting character encoding from meta elements"""
def __init__(self, data):
"""string - the data to work on for encoding detection"""
self.data = EncodingBytes(data)
self.encoding = None
def getEncoding(self):
methodDispatch = (
(b"<!--", self.handleComment),
(b"<meta", self.handleMeta),
(b"</", self.handlePossibleEndTag),
(b"<!", self.handleOther),
(b"<?", self.handleOther),
(b"<", self.handlePossibleStartTag))
for _ in self.data:
keepParsing = True
for key, method in methodDispatch:
if self.data.matchBytes(key):
try:
keepParsing = method()
break
except StopIteration:
keepParsing = False
break
if not keepParsing:
break
return self.encoding
def handleComment(self):
"""Skip over comments"""
return self.data.jumpTo(b"-->")
def handleMeta(self):
if self.data.currentByte not in spaceCharactersBytes:
# if we have <meta not followed by a space so just keep going
return True
# We have a valid meta element we want to search for attributes
hasPragma = False
pendingEncoding = None
while True:
# Try to find the next attribute after the current position
attr = self.getAttribute()
if attr is None:
return True
else:
if attr[0] == b"http-equiv":
hasPragma = attr[1] == b"content-type"
if hasPragma and pendingEncoding is not None:
self.encoding = pendingEncoding
return False
elif attr[0] == b"charset":
tentativeEncoding = attr[1]
codec = lookupEncoding(tentativeEncoding)
if codec is not None:
self.encoding = codec
return False
elif attr[0] == b"content":
contentParser = ContentAttrParser(EncodingBytes(attr[1]))
tentativeEncoding = contentParser.parse()
if tentativeEncoding is not None:
codec = lookupEncoding(tentativeEncoding)
if codec is not None:
if hasPragma:
self.encoding = codec
return False
else:
pendingEncoding = codec
def handlePossibleStartTag(self):
return self.handlePossibleTag(False)
def handlePossibleEndTag(self):
next(self.data)
return self.handlePossibleTag(True)
def handlePossibleTag(self, endTag):
data = self.data
if data.currentByte not in asciiLettersBytes:
# If the next byte is not an ascii letter either ignore this
# fragment (possible start tag case) or treat it according to
# handleOther
if endTag:
data.previous()
self.handleOther()
return True
c = data.skipUntil(spacesAngleBrackets)
if c == b"<":
# return to the first step in the overall "two step" algorithm
# reprocessing the < byte
data.previous()
else:
# Read all attributes
attr = self.getAttribute()
while attr is not None:
attr = self.getAttribute()
return True
def handleOther(self):
return self.data.jumpTo(b">")
def getAttribute(self):
"""Return a name,value pair for the next attribute in the stream,
if one is found, or None"""
data = self.data
# Step 1 (skip chars)
c = data.skip(spaceCharactersBytes | frozenset([b"/"]))
assert c is None or len(c) == 1
# Step 2
if c in (b">", None):
return None
# Step 3
attrName = []
attrValue = []
# Step 4 attribute name
while True:
if c == b"=" and attrName:
break
elif c in spaceCharactersBytes:
# Step 6!
c = data.skip()
break
elif c in (b"/", b">"):
return b"".join(attrName), b""
elif c in asciiUppercaseBytes:
attrName.append(c.lower())
elif c is None:
return None
else:
attrName.append(c)
# Step 5
c = next(data)
# Step 7
if c != b"=":
data.previous()
return b"".join(attrName), b""
# Step 8
next(data)
# Step 9
c = data.skip()
# Step 10
if c in (b"'", b'"'):
# 10.1
quoteChar = c
while True:
# 10.2
c = next(data)
# 10.3
if c == quoteChar:
next(data)
return b"".join(attrName), b"".join(attrValue)
# 10.4
elif c in asciiUppercaseBytes:
attrValue.append(c.lower())
# 10.5
else:
attrValue.append(c)
elif c == b">":
return b"".join(attrName), b""
elif c in asciiUppercaseBytes:
attrValue.append(c.lower())
elif c is None:
return None
else:
attrValue.append(c)
# Step 11
while True:
c = next(data)
if c in spacesAngleBrackets:
return b"".join(attrName), b"".join(attrValue)
elif c in asciiUppercaseBytes:
attrValue.append(c.lower())
elif c is None:
return None
else:
attrValue.append(c)
class ContentAttrParser(object):
def __init__(self, data):
assert isinstance(data, bytes)
self.data = data
def parse(self):
try:
# Check if the attr name is charset
# otherwise return
self.data.jumpTo(b"charset")
self.data.position += 1
self.data.skip()
if not self.data.currentByte == b"=":
# If there is no = sign keep looking for attrs
return None
self.data.position += 1
self.data.skip()
# Look for an encoding between matching quote marks
if self.data.currentByte in (b'"', b"'"):
quoteMark = self.data.currentByte
self.data.position += 1
oldPosition = self.data.position
if self.data.jumpTo(quoteMark):
return self.data[oldPosition:self.data.position]
else:
return None
else:
# Unquoted value
oldPosition = self.data.position
try:
self.data.skipUntil(spaceCharactersBytes)
return self.data[oldPosition:self.data.position]
except StopIteration:
# Return the whole remaining value
return self.data[oldPosition:]
except StopIteration:
return None
def lookupEncoding(encoding):
"""Return the python codec name corresponding to an encoding or None if the
string doesn't correspond to a valid encoding."""
if isinstance(encoding, binary_type):
try:
encoding = encoding.decode("ascii")
except UnicodeDecodeError:
return None
if encoding is not None:
try:
return webencodings.lookup(encoding)
except AttributeError:
return None
else:
return None
pip/_vendor/html5lib/treewalkers/etree.py 0000644 00000011114 14751155150 0014520 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
try:
from collections import OrderedDict
except ImportError:
try:
from ordereddict import OrderedDict
except ImportError:
OrderedDict = dict
import re
from pip._vendor.six import string_types
from . import base
from .._utils import moduleFactoryFactory
tag_regexp = re.compile("{([^}]*)}(.*)")
def getETreeBuilder(ElementTreeImplementation):
ElementTree = ElementTreeImplementation
ElementTreeCommentType = ElementTree.Comment("asd").tag
class TreeWalker(base.NonRecursiveTreeWalker): # pylint:disable=unused-variable
"""Given the particular ElementTree representation, this implementation,
to avoid using recursion, returns "nodes" as tuples with the following
content:
1. The current element
2. The index of the element relative to its parent
3. A stack of ancestor elements
4. A flag "text", "tail" or None to indicate if the current node is a
text node; either the text or tail of the current element (1)
"""
def getNodeDetails(self, node):
if isinstance(node, tuple): # It might be the root Element
elt, _, _, flag = node
if flag in ("text", "tail"):
return base.TEXT, getattr(elt, flag)
else:
node = elt
if not(hasattr(node, "tag")):
node = node.getroot()
if node.tag in ("DOCUMENT_ROOT", "DOCUMENT_FRAGMENT"):
return (base.DOCUMENT,)
elif node.tag == "<!DOCTYPE>":
return (base.DOCTYPE, node.text,
node.get("publicId"), node.get("systemId"))
elif node.tag == ElementTreeCommentType:
return base.COMMENT, node.text
else:
assert isinstance(node.tag, string_types), type(node.tag)
# This is assumed to be an ordinary element
match = tag_regexp.match(node.tag)
if match:
namespace, tag = match.groups()
else:
namespace = None
tag = node.tag
attrs = OrderedDict()
for name, value in list(node.attrib.items()):
match = tag_regexp.match(name)
if match:
attrs[(match.group(1), match.group(2))] = value
else:
attrs[(None, name)] = value
return (base.ELEMENT, namespace, tag,
attrs, len(node) or node.text)
def getFirstChild(self, node):
if isinstance(node, tuple):
element, key, parents, flag = node
else:
element, key, parents, flag = node, None, [], None
if flag in ("text", "tail"):
return None
else:
if element.text:
return element, key, parents, "text"
elif len(element):
parents.append(element)
return element[0], 0, parents, None
else:
return None
def getNextSibling(self, node):
if isinstance(node, tuple):
element, key, parents, flag = node
else:
return None
if flag == "text":
if len(element):
parents.append(element)
return element[0], 0, parents, None
else:
return None
else:
if element.tail and flag != "tail":
return element, key, parents, "tail"
elif key < len(parents[-1]) - 1:
return parents[-1][key + 1], key + 1, parents, None
else:
return None
def getParentNode(self, node):
if isinstance(node, tuple):
element, key, parents, flag = node
else:
return None
if flag == "text":
if not parents:
return element
else:
return element, key, parents, None
else:
parent = parents.pop()
if not parents:
return parent
else:
assert list(parents[-1]).count(parent) == 1
return parent, list(parents[-1]).index(parent), parents, None
return locals()
getETreeModule = moduleFactoryFactory(getETreeBuilder)
pip/_vendor/html5lib/treewalkers/base.py 0000644 00000011513 14751155150 0014331 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from xml.dom import Node
from ..constants import namespaces, voidElements, spaceCharacters
__all__ = ["DOCUMENT", "DOCTYPE", "TEXT", "ELEMENT", "COMMENT", "ENTITY", "UNKNOWN",
"TreeWalker", "NonRecursiveTreeWalker"]
DOCUMENT = Node.DOCUMENT_NODE
DOCTYPE = Node.DOCUMENT_TYPE_NODE
TEXT = Node.TEXT_NODE
ELEMENT = Node.ELEMENT_NODE
COMMENT = Node.COMMENT_NODE
ENTITY = Node.ENTITY_NODE
UNKNOWN = "<#UNKNOWN#>"
spaceCharacters = "".join(spaceCharacters)
class TreeWalker(object):
def __init__(self, tree):
self.tree = tree
def __iter__(self):
raise NotImplementedError
def error(self, msg):
return {"type": "SerializeError", "data": msg}
def emptyTag(self, namespace, name, attrs, hasChildren=False):
yield {"type": "EmptyTag", "name": name,
"namespace": namespace,
"data": attrs}
if hasChildren:
yield self.error("Void element has children")
def startTag(self, namespace, name, attrs):
return {"type": "StartTag",
"name": name,
"namespace": namespace,
"data": attrs}
def endTag(self, namespace, name):
return {"type": "EndTag",
"name": name,
"namespace": namespace}
def text(self, data):
data = data
middle = data.lstrip(spaceCharacters)
left = data[:len(data) - len(middle)]
if left:
yield {"type": "SpaceCharacters", "data": left}
data = middle
middle = data.rstrip(spaceCharacters)
right = data[len(middle):]
if middle:
yield {"type": "Characters", "data": middle}
if right:
yield {"type": "SpaceCharacters", "data": right}
def comment(self, data):
return {"type": "Comment", "data": data}
def doctype(self, name, publicId=None, systemId=None):
return {"type": "Doctype",
"name": name,
"publicId": publicId,
"systemId": systemId}
def entity(self, name):
return {"type": "Entity", "name": name}
def unknown(self, nodeType):
return self.error("Unknown node type: " + nodeType)
class NonRecursiveTreeWalker(TreeWalker):
def getNodeDetails(self, node):
raise NotImplementedError
def getFirstChild(self, node):
raise NotImplementedError
def getNextSibling(self, node):
raise NotImplementedError
def getParentNode(self, node):
raise NotImplementedError
def __iter__(self):
currentNode = self.tree
while currentNode is not None:
details = self.getNodeDetails(currentNode)
type, details = details[0], details[1:]
hasChildren = False
if type == DOCTYPE:
yield self.doctype(*details)
elif type == TEXT:
for token in self.text(*details):
yield token
elif type == ELEMENT:
namespace, name, attributes, hasChildren = details
if (not namespace or namespace == namespaces["html"]) and name in voidElements:
for token in self.emptyTag(namespace, name, attributes,
hasChildren):
yield token
hasChildren = False
else:
yield self.startTag(namespace, name, attributes)
elif type == COMMENT:
yield self.comment(details[0])
elif type == ENTITY:
yield self.entity(details[0])
elif type == DOCUMENT:
hasChildren = True
else:
yield self.unknown(details[0])
if hasChildren:
firstChild = self.getFirstChild(currentNode)
else:
firstChild = None
if firstChild is not None:
currentNode = firstChild
else:
while currentNode is not None:
details = self.getNodeDetails(currentNode)
type, details = details[0], details[1:]
if type == ELEMENT:
namespace, name, attributes, hasChildren = details
if (namespace and namespace != namespaces["html"]) or name not in voidElements:
yield self.endTag(namespace, name)
if self.tree is currentNode:
currentNode = None
break
nextSibling = self.getNextSibling(currentNode)
if nextSibling is not None:
currentNode = nextSibling
break
else:
currentNode = self.getParentNode(currentNode)
pip/_vendor/html5lib/treewalkers/__init__.py 0000644 00000012650 14751155150 0015161 0 ustar 00 """A collection of modules for iterating through different kinds of
tree, generating tokens identical to those produced by the tokenizer
module.
To create a tree walker for a new type of tree, you need to do
implement a tree walker object (called TreeWalker by convention) that
implements a 'serialize' method taking a tree as sole argument and
returning an iterator generating tokens.
"""
from __future__ import absolute_import, division, unicode_literals
from .. import constants
from .._utils import default_etree
__all__ = ["getTreeWalker", "pprint", "dom", "etree", "genshi", "etree_lxml"]
treeWalkerCache = {}
def getTreeWalker(treeType, implementation=None, **kwargs):
"""Get a TreeWalker class for various types of tree with built-in support
Args:
treeType (str): the name of the tree type required (case-insensitive).
Supported values are:
- "dom": The xml.dom.minidom DOM implementation
- "etree": A generic walker for tree implementations exposing an
elementtree-like interface (known to work with
ElementTree, cElementTree and lxml.etree).
- "lxml": Optimized walker for lxml.etree
- "genshi": a Genshi stream
Implementation: A module implementing the tree type e.g.
xml.etree.ElementTree or cElementTree (Currently applies to the
"etree" tree type only).
"""
treeType = treeType.lower()
if treeType not in treeWalkerCache:
if treeType == "dom":
from . import dom
treeWalkerCache[treeType] = dom.TreeWalker
elif treeType == "genshi":
from . import genshi
treeWalkerCache[treeType] = genshi.TreeWalker
elif treeType == "lxml":
from . import etree_lxml
treeWalkerCache[treeType] = etree_lxml.TreeWalker
elif treeType == "etree":
from . import etree
if implementation is None:
implementation = default_etree
# XXX: NEVER cache here, caching is done in the etree submodule
return etree.getETreeModule(implementation, **kwargs).TreeWalker
return treeWalkerCache.get(treeType)
def concatenateCharacterTokens(tokens):
pendingCharacters = []
for token in tokens:
type = token["type"]
if type in ("Characters", "SpaceCharacters"):
pendingCharacters.append(token["data"])
else:
if pendingCharacters:
yield {"type": "Characters", "data": "".join(pendingCharacters)}
pendingCharacters = []
yield token
if pendingCharacters:
yield {"type": "Characters", "data": "".join(pendingCharacters)}
def pprint(walker):
"""Pretty printer for tree walkers"""
output = []
indent = 0
for token in concatenateCharacterTokens(walker):
type = token["type"]
if type in ("StartTag", "EmptyTag"):
# tag name
if token["namespace"] and token["namespace"] != constants.namespaces["html"]:
if token["namespace"] in constants.prefixes:
ns = constants.prefixes[token["namespace"]]
else:
ns = token["namespace"]
name = "%s %s" % (ns, token["name"])
else:
name = token["name"]
output.append("%s<%s>" % (" " * indent, name))
indent += 2
# attributes (sorted for consistent ordering)
attrs = token["data"]
for (namespace, localname), value in sorted(attrs.items()):
if namespace:
if namespace in constants.prefixes:
ns = constants.prefixes[namespace]
else:
ns = namespace
name = "%s %s" % (ns, localname)
else:
name = localname
output.append("%s%s=\"%s\"" % (" " * indent, name, value))
# self-closing
if type == "EmptyTag":
indent -= 2
elif type == "EndTag":
indent -= 2
elif type == "Comment":
output.append("%s<!-- %s -->" % (" " * indent, token["data"]))
elif type == "Doctype":
if token["name"]:
if token["publicId"]:
output.append("""%s<!DOCTYPE %s "%s" "%s">""" %
(" " * indent,
token["name"],
token["publicId"],
token["systemId"] if token["systemId"] else ""))
elif token["systemId"]:
output.append("""%s<!DOCTYPE %s "" "%s">""" %
(" " * indent,
token["name"],
token["systemId"]))
else:
output.append("%s<!DOCTYPE %s>" % (" " * indent,
token["name"]))
else:
output.append("%s<!DOCTYPE >" % (" " * indent,))
elif type == "Characters":
output.append("%s\"%s\"" % (" " * indent, token["data"]))
elif type == "SpaceCharacters":
assert False, "concatenateCharacterTokens should have got rid of all Space tokens"
else:
raise ValueError("Unknown token type, %s" % type)
return "\n".join(output)
pip/_vendor/html5lib/treewalkers/etree_lxml.py 0000644 00000014245 14751155150 0015564 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import text_type
from lxml import etree
from ..treebuilders.etree import tag_regexp
from . import base
from .. import _ihatexml
def ensure_str(s):
if s is None:
return None
elif isinstance(s, text_type):
return s
else:
return s.decode("ascii", "strict")
class Root(object):
def __init__(self, et):
self.elementtree = et
self.children = []
try:
if et.docinfo.internalDTD:
self.children.append(Doctype(self,
ensure_str(et.docinfo.root_name),
ensure_str(et.docinfo.public_id),
ensure_str(et.docinfo.system_url)))
except AttributeError:
pass
try:
node = et.getroot()
except AttributeError:
node = et
while node.getprevious() is not None:
node = node.getprevious()
while node is not None:
self.children.append(node)
node = node.getnext()
self.text = None
self.tail = None
def __getitem__(self, key):
return self.children[key]
def getnext(self):
return None
def __len__(self):
return 1
class Doctype(object):
def __init__(self, root_node, name, public_id, system_id):
self.root_node = root_node
self.name = name
self.public_id = public_id
self.system_id = system_id
self.text = None
self.tail = None
def getnext(self):
return self.root_node.children[1]
class FragmentRoot(Root):
def __init__(self, children):
self.children = [FragmentWrapper(self, child) for child in children]
self.text = self.tail = None
def getnext(self):
return None
class FragmentWrapper(object):
def __init__(self, fragment_root, obj):
self.root_node = fragment_root
self.obj = obj
if hasattr(self.obj, 'text'):
self.text = ensure_str(self.obj.text)
else:
self.text = None
if hasattr(self.obj, 'tail'):
self.tail = ensure_str(self.obj.tail)
else:
self.tail = None
def __getattr__(self, name):
return getattr(self.obj, name)
def getnext(self):
siblings = self.root_node.children
idx = siblings.index(self)
if idx < len(siblings) - 1:
return siblings[idx + 1]
else:
return None
def __getitem__(self, key):
return self.obj[key]
def __bool__(self):
return bool(self.obj)
def getparent(self):
return None
def __str__(self):
return str(self.obj)
def __unicode__(self):
return str(self.obj)
def __len__(self):
return len(self.obj)
class TreeWalker(base.NonRecursiveTreeWalker):
def __init__(self, tree):
# pylint:disable=redefined-variable-type
if isinstance(tree, list):
self.fragmentChildren = set(tree)
tree = FragmentRoot(tree)
else:
self.fragmentChildren = set()
tree = Root(tree)
base.NonRecursiveTreeWalker.__init__(self, tree)
self.filter = _ihatexml.InfosetFilter()
def getNodeDetails(self, node):
if isinstance(node, tuple): # Text node
node, key = node
assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
return base.TEXT, ensure_str(getattr(node, key))
elif isinstance(node, Root):
return (base.DOCUMENT,)
elif isinstance(node, Doctype):
return base.DOCTYPE, node.name, node.public_id, node.system_id
elif isinstance(node, FragmentWrapper) and not hasattr(node, "tag"):
return base.TEXT, ensure_str(node.obj)
elif node.tag == etree.Comment:
return base.COMMENT, ensure_str(node.text)
elif node.tag == etree.Entity:
return base.ENTITY, ensure_str(node.text)[1:-1] # strip &;
else:
# This is assumed to be an ordinary element
match = tag_regexp.match(ensure_str(node.tag))
if match:
namespace, tag = match.groups()
else:
namespace = None
tag = ensure_str(node.tag)
attrs = {}
for name, value in list(node.attrib.items()):
name = ensure_str(name)
value = ensure_str(value)
match = tag_regexp.match(name)
if match:
attrs[(match.group(1), match.group(2))] = value
else:
attrs[(None, name)] = value
return (base.ELEMENT, namespace, self.filter.fromXmlName(tag),
attrs, len(node) > 0 or node.text)
def getFirstChild(self, node):
assert not isinstance(node, tuple), "Text nodes have no children"
assert len(node) or node.text, "Node has no children"
if node.text:
return (node, "text")
else:
return node[0]
def getNextSibling(self, node):
if isinstance(node, tuple): # Text node
node, key = node
assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
if key == "text":
# XXX: we cannot use a "bool(node) and node[0] or None" construct here
# because node[0] might evaluate to False if it has no child element
if len(node):
return node[0]
else:
return None
else: # tail
return node.getnext()
return (node, "tail") if node.tail else node.getnext()
def getParentNode(self, node):
if isinstance(node, tuple): # Text node
node, key = node
assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
if key == "text":
return node
# else: fallback to "normal" processing
elif node in self.fragmentChildren:
return None
return node.getparent()
pip/_vendor/html5lib/treewalkers/dom.py 0000644 00000002605 14751155150 0014200 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from xml.dom import Node
from . import base
class TreeWalker(base.NonRecursiveTreeWalker):
def getNodeDetails(self, node):
if node.nodeType == Node.DOCUMENT_TYPE_NODE:
return base.DOCTYPE, node.name, node.publicId, node.systemId
elif node.nodeType in (Node.TEXT_NODE, Node.CDATA_SECTION_NODE):
return base.TEXT, node.nodeValue
elif node.nodeType == Node.ELEMENT_NODE:
attrs = {}
for attr in list(node.attributes.keys()):
attr = node.getAttributeNode(attr)
if attr.namespaceURI:
attrs[(attr.namespaceURI, attr.localName)] = attr.value
else:
attrs[(None, attr.name)] = attr.value
return (base.ELEMENT, node.namespaceURI, node.nodeName,
attrs, node.hasChildNodes())
elif node.nodeType == Node.COMMENT_NODE:
return base.COMMENT, node.nodeValue
elif node.nodeType in (Node.DOCUMENT_NODE, Node.DOCUMENT_FRAGMENT_NODE):
return (base.DOCUMENT,)
else:
return base.UNKNOWN, node.nodeType
def getFirstChild(self, node):
return node.firstChild
def getNextSibling(self, node):
return node.nextSibling
def getParentNode(self, node):
return node.parentNode
pip/_vendor/html5lib/treewalkers/genshi.py 0000644 00000004405 14751155150 0014676 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from genshi.core import QName
from genshi.core import START, END, XML_NAMESPACE, DOCTYPE, TEXT
from genshi.core import START_NS, END_NS, START_CDATA, END_CDATA, PI, COMMENT
from . import base
from ..constants import voidElements, namespaces
class TreeWalker(base.TreeWalker):
def __iter__(self):
# Buffer the events so we can pass in the following one
previous = None
for event in self.tree:
if previous is not None:
for token in self.tokens(previous, event):
yield token
previous = event
# Don't forget the final event!
if previous is not None:
for token in self.tokens(previous, None):
yield token
def tokens(self, event, next):
kind, data, _ = event
if kind == START:
tag, attribs = data
name = tag.localname
namespace = tag.namespace
converted_attribs = {}
for k, v in attribs:
if isinstance(k, QName):
converted_attribs[(k.namespace, k.localname)] = v
else:
converted_attribs[(None, k)] = v
if namespace == namespaces["html"] and name in voidElements:
for token in self.emptyTag(namespace, name, converted_attribs,
not next or next[0] != END or
next[1] != tag):
yield token
else:
yield self.startTag(namespace, name, converted_attribs)
elif kind == END:
name = data.localname
namespace = data.namespace
if namespace != namespaces["html"] or name not in voidElements:
yield self.endTag(namespace, name)
elif kind == COMMENT:
yield self.comment(data)
elif kind == TEXT:
for token in self.text(data):
yield token
elif kind == DOCTYPE:
yield self.doctype(*data)
elif kind in (XML_NAMESPACE, DOCTYPE, START_NS, END_NS,
START_CDATA, END_CDATA, PI):
pass
else:
yield self.unknown(kind)
pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.opt-1.pyc 0000644 00000003137 14751155150 0021424 0 ustar 00 3
���e� � @ sB d dl mZmZmZ d dlmZ ddlmZ G dd� dej�Z dS )� )�absolute_import�division�unicode_literals)�Node� )�basec @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�
TreeWalkerc C s� |j tjkr tj|j|j|jfS |j tjtj fkr>tj
|j fS |j tj kr�i }xJt
|jj� �D ]8}|j|�}|jr�|j||j|jf< q^|j|d |jf< q^W tj|j|j||j� fS |j tjkr�tj|j fS |j tjtjfkr�tjfS tj |j fS d S )N) ZnodeTyper ZDOCUMENT_TYPE_NODEr ZDOCTYPE�nameZpublicIdZsystemIdZ TEXT_NODEZCDATA_SECTION_NODEZTEXTZ nodeValueZ ELEMENT_NODE�listZ
attributes�keysZgetAttributeNodeZ namespaceURI�valueZ localNameZELEMENTZnodeNameZ
hasChildNodesZ COMMENT_NODE�COMMENTZ
DOCUMENT_NODEZDOCUMENT_FRAGMENT_NODEZDOCUMENTZUNKNOWN)�self�nodeZattrs�attr� r �/usr/lib/python3.6/dom.py�getNodeDetails s$
zTreeWalker.getNodeDetailsc C s |j S )N)Z
firstChild)r r r r r �
getFirstChild$ s zTreeWalker.getFirstChildc C s |j S )N)Z nextSibling)r r r r r �getNextSibling' s zTreeWalker.getNextSiblingc C s |j S )N)Z
parentNode)r r r r r �
getParentNode* s zTreeWalker.getParentNodeN)�__name__�
__module__� __qualname__r r r r r r r r r s r N)
Z
__future__r r r Zxml.domr � r ZNonRecursiveTreeWalkerr r r r r �<module> s pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.pyc 0000644 00000010612 14751155150 0020614 0 ustar 00 3
���eK � @ s� d dl mZmZmZ d dlmZ ddlmZmZm Z ddddd d
d d d
g Z
ej Z ej
ZejZejZejZejZdZdje �Z G dd � d e�ZG dd
� d
e�ZdS )� )�absolute_import�division�unicode_literals)�Node� )�
namespaces� voidElements�spaceCharacters�DOCUMENT�DOCTYPE�TEXT�ELEMENT�COMMENT�ENTITY�UNKNOWN�
TreeWalker�NonRecursiveTreeWalkerz <#UNKNOWN#>� c @ sh e Zd Zdd� Zdd� Zdd� Zddd �Zd
d � Zd d
� Zdd� Z dd� Z
ddd�Z dd� Z dd� Z
dS )r c C s
|| _ d S )N)�tree)�selfr � r �/usr/lib/python3.6/base.py�__init__ s zTreeWalker.__init__c C s t �d S )N)�NotImplementedError)r r r r �__iter__ s zTreeWalker.__iter__c C s
d|d�S )NZSerializeError)�type�datar )r �msgr r r �error s zTreeWalker.errorFc c s$ d|||d�V |r | j d�V d S )NZEmptyTag)r �name� namespacer zVoid element has children)r )r r r �attrs� hasChildrenr r r �emptyTag s
zTreeWalker.emptyTagc C s d|||d�S )NZStartTag)r r r r r )r r r r! r r r �startTag% s zTreeWalker.startTagc C s d||d�S )NZEndTag)r r r r )r r r r r r �endTag+ s zTreeWalker.endTagc c sx |}|j t�}|d t|�t|� � }|r6d|d�V |}|jt�}|t|�d � }|rdd|d�V |rtd|d�V d S )NZSpaceCharacters)r r Z
Characters)�lstripr �len�rstrip)r r Zmiddle�left�rightr r r �text0 s
zTreeWalker.textc C s
d|d�S )N�Comment)r r r )r r r r r �comment> s zTreeWalker.commentNc C s d|||d�S )NZDoctype)r r �publicId�systemIdr )r r r. r/ r r r �doctypeA s zTreeWalker.doctypec C s
d|d�S )NZEntity)r r r )r r r r r �entityG s zTreeWalker.entityc C s | j d| �S )NzUnknown node type: )r )r ZnodeTyper r r �unknownJ s zTreeWalker.unknown)F)NN)�__name__�
__module__� __qualname__r r r r# r$ r% r+ r- r0 r1 r2 r r r r r s
c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) r c C s t �d S )N)r )r �noder r r �getNodeDetailsO s z%NonRecursiveTreeWalker.getNodeDetailsc C s t �d S )N)r )r r6 r r r �
getFirstChildR s z$NonRecursiveTreeWalker.getFirstChildc C s t �d S )N)r )r r6 r r r �getNextSiblingU s z%NonRecursiveTreeWalker.getNextSiblingc C s t �d S )N)r )r r6 r r r �
getParentNodeX s z$NonRecursiveTreeWalker.getParentNodec c s | j }�x�|d k �r| j|�}|d |dd � }}d}|tkrN| j|� V n�|tkrrx�| j|� D ]
}|V qbW n�|tkr�|\}}}}| s�|td kr�|tkr�x | j ||||�D ]
}|V q�W d}n| j
|||�V nV|t kr�| j |d �V n<|t
k�r| j|d �V n |tk�r d}n| j|d �V |�r@| j|�} nd } | d k �rT| }q
x�|d k �r�| j|�}|d |dd � }}|tk�r�|\}}}}|�r�|td k�s�|tk�r�| j||�V | j |k�r�d }P | j|�}
|
d k �r�|
}P n
| j|�}�qVW q
W d S )Nr � FZhtmlT)r r7 r r0 r r+ r
r r r# r$ r r- r r1 r
r2 r8 r% r9 r: ) r Z currentNodeZdetailsr r" �tokenr r Z
attributesZ
firstChildZ nextSiblingr r r r [ sZ
z NonRecursiveTreeWalker.__iter__N)r3 r4 r5 r7 r8 r9 r: r r r r r r N s
N) Z
__future__r r r Zxml.domr Z constantsr r r �__all__Z
DOCUMENT_NODEr
ZDOCUMENT_TYPE_NODEr Z TEXT_NODEr Z ELEMENT_NODEr
Z COMMENT_NODEr Z ENTITY_NODEr r �join�objectr r r r r r �<module> s
: pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.pyc 0000644 00000007001 14751155150 0021004 0 ustar 00 3
���eL � @ s� d dl mZmZmZ yd dlmZ W n> ek
rb yd dlmZ W n ek
r\ eZY nX Y nX d dl Z d dl
m Z ddl m
Z
ddlmZ e jd �Zd
d � Zee�ZdS ) � )�absolute_import�division�unicode_literals)� OrderedDictN)� string_types� )�base� )�moduleFactoryFactoryz
{([^}]*)}(.*)c s, | }|j d�j� G � fdd�dtj�}t� S )NZasdc s4 e Zd ZdZ� fdd�Zdd� Zdd� Zdd � Zd
S ) z#getETreeBuilder.<locals>.TreeWalkera� Given the particular ElementTree representation, this implementation,
to avoid using recursion, returns "nodes" as tuples with the following
content:
1. The current element
2. The index of the element relative to its parent
3. A stack of ancestor elements
4. A flag "text", "tail" or None to indicate if the current node is a
text node; either the text or tail of the current element (1)
c sL t |t�r2|\}}}}|d kr.tjt||�fS |}t|d�sD|j� }|jd krVtjfS |jdkr|tj |j
|j d�|j d�fS |j� kr�tj |j
fS t |jt
�s�tt|j���tj|j�}|r�|j� \}}n
d }|j}t� }xPt|jj� �D ]>\} }
tj| �}|�r |
||jd �|jd
�f< q�|
|d | f< q�W tj|||t|��pD|j
fS d S )
N�text�tail�tag�
DOCUMENT_ROOT�DOCUMENT_FRAGMENTz
<!DOCTYPE>ZpublicIdZsystemIdr r )r r )r r )�
isinstance�tupler ZTEXT�getattr�hasattrZgetrootr
ZDOCUMENTZDOCTYPEr �get�COMMENTr �AssertionError�type�
tag_regexp�match�groupsr �listZattrib�items�groupZELEMENT�len) �self�nodeZelt�_�flagr � namespacer
Zattrs�name�value)�ElementTreeCommentType� �/usr/lib/python3.6/etree.py�getNodeDetails' s8
z2getETreeBuilder.<locals>.TreeWalker.getNodeDetailsc S st t |t�r|\}}}}n|d g d f\}}}}|dkr8d S |jrJ|||dfS t|�rl|j|� |d d|d fS d S d S )Nr r r )r r )r r r r �append)r r �element�key�parentsr" r' r' r( �
getFirstChildO s
z1getETreeBuilder.<locals>.TreeWalker.getFirstChildc S s� t |t�r|\}}}}nd S |dkrLt|�rF|j|� |d d|d fS d S nN|jrf|dkrf|||dfS |t|d �d k r�|d |d |d |d fS d S d S )Nr r r r ���r/ )r r r r* r )r r r+ r, r- r" r' r' r( �getNextSibling` s
z2getETreeBuilder.<locals>.TreeWalker.getNextSiblingc S s� t |t�r|\}}}}nd S |dkr:|s,|S |||d fS nD|j� }|sJ|S t|d �j|�dksdt�|t|d �j|�|d fS d S )Nr r r/ r/ )r r �popr �countr �index)r r r+ r, r- r" �parentr' r' r( �
getParentNodet s
z1getETreeBuilder.<locals>.TreeWalker.getParentNodeN)�__name__�
__module__� __qualname__�__doc__r) r. r0 r5 r' )r& r' r( �
TreeWalker s
(r: )�Commentr
r ZNonRecursiveTreeWalker�locals)ZElementTreeImplementationZ ElementTreer: r' )r& r( �getETreeBuilder s nr= )Z
__future__r r r � collectionsr � ImportErrorZ ordereddict�dict�reZpip._vendor.sixr � r Z_utilsr
�compiler r= ZgetETreeModuler' r' r' r( �<module> s
t pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.pyc 0000644 00000014646 14751155150 0022055 0 ustar 00 3
���e� � @ s� d dl mZmZmZ d dlmZ d dlmZ ddlm Z ddl
m Z ddl
m Z d d
� Z
G d d � d e�ZG d
d� de�ZG dd� de�ZG dd� de�ZG dd� de j�ZdS )� )�absolute_import�division�unicode_literals)� text_type)�etree� )�
tag_regexp� )�base)� _ihatexmlc C s* | d kr d S t | t�r| S | jdd�S d S )N�ascii�strict)�
isinstancer �decode)�s� r � /usr/lib/python3.6/etree_lxml.py�
ensure_str s
r c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�Rootc C s� || _ g | _y:|jjrD| jjt| t|jj�t|jj�t|jj ��� W n t
k
rZ Y nX y |j � }W n t
k
r� |}Y nX x|j � d k r�|j � }q�W x |d k r�| jj|� |j
� }q�W d | _d | _d S )N)Z elementtree�childrenZdocinfoZ internalDTD�append�Doctyper Z root_name� public_idZ
system_url�AttributeErrorZgetrootZ getprevious�getnext�text�tail)�selfZet�noder r r �__init__ s*
z
Root.__init__c C s
| j | S )N)r )r �keyr r r � __getitem__1 s zRoot.__getitem__c C s d S )Nr )r r r r r 4 s z Root.getnextc C s dS )Nr r )r r r r �__len__7 s z Root.__len__N)�__name__�
__module__� __qualname__r r! r r" r r r r r s r c @ s e Zd Zdd� Zdd� ZdS )r c C s( || _ || _|| _|| _d | _d | _d S )N)� root_node�namer � system_idr r )r r& r' r r( r r r r < s zDoctype.__init__c C s | j jd S )Nr )r& r )r r r r r E s zDoctype.getnextN)r# r$ r% r r r r r r r ; s r c @ s e Zd Zdd� Zdd� ZdS )� FragmentRootc s$ � fdd�|D �� _ d � _� _d S )Nc s g | ]}t � |��qS r )�FragmentWrapper)�.0Zchild)r r r �
<listcomp>K s z)FragmentRoot.__init__.<locals>.<listcomp>)r r r )r r r )r r r J s zFragmentRoot.__init__c C s d S )Nr )r r r r r N s zFragmentRoot.getnextN)r# r$ r% r r r r r r r) I s r) c @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )r* c C sT || _ || _t| jd�r(t| jj�| _nd | _t| jd�rJt| jj�| _nd | _d S )Nr r )r& �obj�hasattrr r r )r Z
fragment_rootr- r r r r S s zFragmentWrapper.__init__c C s t | j|�S )N)�getattrr- )r r' r r r � __getattr___ s zFragmentWrapper.__getattr__c C s6 | j j}|j| �}|t|�d k r.||d S d S d S )Nr )r& r �index�len)r Zsiblings�idxr r r r b s
zFragmentWrapper.getnextc C s
| j | S )N)r- )r r r r r r! j s zFragmentWrapper.__getitem__c C s
t | j�S )N)�boolr- )r r r r �__bool__m s zFragmentWrapper.__bool__c C s d S )Nr )r r r r � getparentp s zFragmentWrapper.getparentc C s
t | j�S )N)�strr- )r r r r �__str__s s zFragmentWrapper.__str__c C s
t | j�S )N)r7 r- )r r r r � __unicode__v s zFragmentWrapper.__unicode__c C s
t | j�S )N)r2 r- )r r r r r" y s zFragmentWrapper.__len__N) r# r$ r% r r0 r r! r5 r6 r8 r9 r" r r r r r* R s r* c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) �
TreeWalkerc C sJ t |t�r t|�| _t|�}nt� | _t|�}tjj| |� t j
� | _ d S )N) r �list�set�fragmentChildrenr) r r
�NonRecursiveTreeWalkerr r Z
InfosetFilter�filter)r Ztreer r r r ~ s
zTreeWalker.__init__c C s� t |t�r:|\}}|dks&td| ��tjtt||��fS t |t�rLtjfS t |t �rjtj
|j |j |j
fS t |t�r�t|d� r�tjt|j�fS |jtjkr�tjt|j�fS |jtjkr�tjt|j�dd � fS tjt|j��}|� r�|j� \}}nd }t|j�}i }xbt|j j � �D ]P\}}t|�}t|�}tj|�}|�rX|||j d�|j d�f< n ||d |f< �qW tj || j j!|�|t"|�dk�p�|jfS d S )
Nr r z%Text nodes are text or tail, found %s�tagr r r )r r ���)#r �tuple�AssertionErrorr
ZTEXTr r/ r ZDOCUMENTr ZDOCTYPEr' r r( r* r. r- r@ r �Comment�COMMENTr ZEntityZENTITYr �match�groupsr; Zattrib�items�groupZELEMENTr? Z fromXmlNamer2 ) r r r rF � namespacer@ Zattrsr' �valuer r r �getNodeDetails� s:
zTreeWalker.getNodeDetailsc C sD t |t� std��t|�s*|js*td��|jr8|dfS |d S d S )NzText nodes have no childrenzNode has no childrenr r )r rB rC r2 r )r r r r r �
getFirstChild� s
zTreeWalker.getFirstChildc C sb t |t�rL|\}}|dks&td| ��|dkrDt|�r>|d S d S n|j� S |jrZ|dfS |j� S )Nr r z%Text nodes are text or tail, found %sr )r r )r rB rC r2 r r )r r r r r r �getNextSibling� s
zTreeWalker.getNextSiblingc C sJ t |t�r4|\}}|dks&td| ��|dkrB|S n|| jkrBd S |j� S )Nr r z%Text nodes are text or tail, found %s)r r )r rB rC r= r6 )r r r r r r �
getParentNode� s
zTreeWalker.getParentNodeN)r# r$ r% r rL rM rN rO r r r r r: } s
) r: N)Z
__future__r r r Zpip._vendor.sixr Zlxmlr Ztreebuilders.etreer � r
r r �objectr r r) r* r> r: r r r r �<module> s & + pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.pyc 0000644 00000003415 14751155150 0021162 0 ustar 00 3
���e � @ s� d dl mZmZmZ d dlmZ d dlmZmZmZm Z m
Z
d dlm Z m Z m
Z
mZmZmZ ddlmZ ddlmZmZ G d d
� d
ej�Zd S ) � )�absolute_import�division�unicode_literals)�QName)�START�END�
XML_NAMESPACE�DOCTYPE�TEXT)�START_NS�END_NS� START_CDATA� END_CDATA�PI�COMMENT� )�base� )� voidElements�
namespacesc @ s e Zd Zdd� Zdd� ZdS )�
TreeWalkerc c sd d }x6| j D ],}|d k r4x| j||�D ]
}|V q&W |}q W |d k r`x| j|d �D ]
}|V qRW d S )N)Ztree�tokens)�selfZprevious�event�token� r � /usr/lib/python3.6/genshi.py�__iter__
s
zTreeWalker.__iter__c c s� |\}}}|t kr�|\}}|j}|j} i }
x8|D ]0\} } t| t�rT| |
| j| jf< q0| |
d | f< q0W | td kr�|tkr�xJ| j| ||
| p�|d tkp�|d |k�D ]
}
|
V q�W n| j | ||
�V n�|tkr�|j}|j} | td ks�|tkr�| j
| |�V n~|t k�r| j |�V nf|t
k�r>xZ| j|�D ] }
|
V �q,W n>|tk�rV| j|� V n&|tttttttfk�rpn | j|�V d S )NZhtmlr r )r Z localname� namespace�
isinstancer r r ZemptyTagr ZstartTagZendTagr Zcommentr
�textr Zdoctyper r r r
r r �unknown)r r �nextZkind�data�_�tagZattribs�namer Zconverted_attribs�k�vr r r r r s@
zTreeWalker.tokensN)�__name__�
__module__� __qualname__r r r r r r r s r N)Z
__future__r r r Z genshi.corer r r r r r
r r r
r r r � r Z constantsr r r r r r r �<module> s pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.pyc 0000644 00000007226 14751155150 0021450 0 ustar 00 3
���e� � @ sb d Z ddlmZmZmZ ddlmZ ddlmZ dddd d
d gZ i Z
dd
d�Z dd� Z dd� Z
d S )a� A collection of modules for iterating through different kinds of
tree, generating tokens identical to those produced by the tokenizer
module.
To create a tree walker for a new type of tree, you need to do
implement a tree walker object (called TreeWalker by convention) that
implements a 'serialize' method taking a tree as sole argument and
returning an iterator generating tokens.
� )�absolute_import�division�unicode_literals� )� constants)�
default_etree�
getTreeWalker�pprint�dom�etree�genshi�
etree_lxmlNc K s� | j � } | tkr�| dkr0ddlm} |jt| < np| dkrPddlm} |jt| < nP| dkrpddlm} |jt| < n0| dkr�dd lm} |d
kr�t}|j |f|�jS tj
| �S ) a� Get a TreeWalker class for various types of tree with built-in support
Args:
treeType (str): the name of the tree type required (case-insensitive).
Supported values are:
- "dom": The xml.dom.minidom DOM implementation
- "etree": A generic walker for tree implementations exposing an
elementtree-like interface (known to work with
ElementTree, cElementTree and lxml.etree).
- "lxml": Optimized walker for lxml.etree
- "genshi": a Genshi stream
Implementation: A module implementing the tree type e.g.
xml.etree.ElementTree or cElementTree (Currently applies to the
"etree" tree type only).
r
� )r
r )r Zlxml)r
r )r N) �lower�treeWalkerCache� r
Z
TreeWalkerr r
r r ZgetETreeModule�get)ZtreeType�implementation�kwargsr
r r
r � r � /usr/lib/python3.6/__init__.pyr s" c c sl g }xL| D ]D}|d }|dkr.|j |d � q
|rHddj|�d�V g }|V q
W |rhddj|�d�V d S )N�type�
Characters�SpaceCharacters�datar )r r )r r )�append�join)�tokensZpendingCharacters�tokenr r r r �concatenateCharacterTokens< s
r c C sl g }d}�xVt | �D �]H}|d }|d k�r&|d r~|d tjd kr~|d tjkrdtj|d }n|d }d||d f }n|d }|jd d
| |f � |d 7 }|d }xdt|j� �D ]T\\}} }
|r�|tjkr�tj| }n|}d|| f }n| }|jd
d
| ||
f � q�W |dk�r^|d 8 }q|dk�r:|d 8 }q|dk�r`|jdd
| |d f � q|dk�r|d �r�|d �r�|jdd
| |d |d |d �r�|d ndf � nF|d �r�|jdd
| |d |d f � n|jdd
| |d f � n|jdd
| f � q|dk�r8|jdd
| |d f � q|dk�rRd �s^td ��qtd | ��qW d j |�S )!z Pretty printer for tree walkersr r �StartTag�EmptyTag� namespaceZhtmlz%s %s�namez%s<%s>� r r z %s%s="%s"ZEndTag�Commentz
%s<!-- %s -->ZDoctypeZpublicIdz%s<!DOCTYPE %s "%s" "%s">ZsystemIdr z%s<!DOCTYPE %s "" "%s">z%s<!DOCTYPE %s>z
%s<!DOCTYPE >r z%s"%s"r FzBconcatenateCharacterTokens should have got rid of all Space tokenszUnknown token type, %s�
)r r! )
r r Z
namespaces�prefixesr �sorted�items�AssertionError�
ValueErrorr ) Zwalker�output�indentr r �nsr# Zattrsr" Z localname�valuer r r r K sd
)N)�__doc__Z
__future__r r r r r Z_utilsr �__all__r r r r r r r r �<module> s
' pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.opt-1.pyc 0000644 00000006635 14751155150 0021757 0 ustar 00 3
���eL � @ s� d dl mZmZmZ yd dlmZ W n> ek
rb yd dlmZ W n ek
r\ eZY nX Y nX d dl Z d dl
m Z ddl m
Z
ddlmZ e jd �Zd
d � Zee�ZdS ) � )�absolute_import�division�unicode_literals)� OrderedDictN)� string_types� )�base� )�moduleFactoryFactoryz
{([^}]*)}(.*)c s, | }|j d�j� G � fdd�dtj�}t� S )NZasdc s4 e Zd ZdZ� fdd�Zdd� Zdd� Zdd � Zd
S ) z#getETreeBuilder.<locals>.TreeWalkera� Given the particular ElementTree representation, this implementation,
to avoid using recursion, returns "nodes" as tuples with the following
content:
1. The current element
2. The index of the element relative to its parent
3. A stack of ancestor elements
4. A flag "text", "tail" or None to indicate if the current node is a
text node; either the text or tail of the current element (1)
c s2 t |t�r2|\}}}}|d kr.tjt||�fS |}t|d�sD|j� }|jd krVtjfS |jdkr|tj |j
|j d�|j d�fS |j� kr�tj |j
fS t
j|j�}|r�|j� \}}n
d }|j}t� }xPt|jj� �D ]>\} }
t
j| �}|�r|
||jd �|jd
�f< q�|
|d | f< q�W tj|||t|��p*|j
fS d S )
N�text�tail�tag�
DOCUMENT_ROOT�DOCUMENT_FRAGMENTz
<!DOCTYPE>ZpublicIdZsystemIdr r )r r )r r )�
isinstance�tupler ZTEXT�getattr�hasattrZgetrootr
ZDOCUMENTZDOCTYPEr �get�COMMENT�
tag_regexp�match�groupsr �listZattrib�items�groupZELEMENT�len) �self�nodeZelt�_�flagr � namespacer
Zattrs�name�value)�ElementTreeCommentType� �/usr/lib/python3.6/etree.py�getNodeDetails' s6
z2getETreeBuilder.<locals>.TreeWalker.getNodeDetailsc S st t |t�r|\}}}}n|d g d f\}}}}|dkr8d S |jrJ|||dfS t|�rl|j|� |d d|d fS d S d S )Nr r r )r r )r r r r �append)r r �element�key�parentsr r% r% r& �
getFirstChildO s
z1getETreeBuilder.<locals>.TreeWalker.getFirstChildc S s� t |t�r|\}}}}nd S |dkrLt|�rF|j|� |d d|d fS d S nN|jrf|dkrf|||dfS |t|d �d k r�|d |d |d |d fS d S d S )Nr r r r ���r- )r r r r( r )r r r) r* r+ r r% r% r& �getNextSibling` s
z2getETreeBuilder.<locals>.TreeWalker.getNextSiblingc S sh t |t�r|\}}}}nd S |dkr:|s,|S |||d fS n*|j� }|sJ|S |t|d �j|�|d fS d S )Nr r r- )r r �popr �index)r r r) r* r+ r �parentr% r% r& �
getParentNodet s
z1getETreeBuilder.<locals>.TreeWalker.getParentNodeN)�__name__�
__module__� __qualname__�__doc__r' r, r. r2 r% )r$ r% r& �
TreeWalker s
(r7 )�Commentr
r ZNonRecursiveTreeWalker�locals)ZElementTreeImplementationZ ElementTreer7 r% )r$ r& �getETreeBuilder s nr: )Z
__future__r r r � collectionsr � ImportErrorZ ordereddict�dict�reZpip._vendor.sixr � r Z_utilsr
�compiler r: ZgetETreeModuler% r% r% r& �<module> s
t pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.pyc 0000644 00000003137 14751155150 0020465 0 ustar 00 3
���e� � @ sB d dl mZmZmZ d dlmZ ddlmZ G dd� dej�Z dS )� )�absolute_import�division�unicode_literals)�Node� )�basec @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�
TreeWalkerc C s� |j tjkr tj|j|j|jfS |j tjtj fkr>tj
|j fS |j tj kr�i }xJt
|jj� �D ]8}|j|�}|jr�|j||j|jf< q^|j|d |jf< q^W tj|j|j||j� fS |j tjkr�tj|j fS |j tjtjfkr�tjfS tj |j fS d S )N) ZnodeTyper ZDOCUMENT_TYPE_NODEr ZDOCTYPE�nameZpublicIdZsystemIdZ TEXT_NODEZCDATA_SECTION_NODEZTEXTZ nodeValueZ ELEMENT_NODE�listZ
attributes�keysZgetAttributeNodeZ namespaceURI�valueZ localNameZELEMENTZnodeNameZ
hasChildNodesZ COMMENT_NODE�COMMENTZ
DOCUMENT_NODEZDOCUMENT_FRAGMENT_NODEZDOCUMENTZUNKNOWN)�self�nodeZattrs�attr� r �/usr/lib/python3.6/dom.py�getNodeDetails s$
zTreeWalker.getNodeDetailsc C s |j S )N)Z
firstChild)r r r r r �
getFirstChild$ s zTreeWalker.getFirstChildc C s |j S )N)Z nextSibling)r r r r r �getNextSibling' s zTreeWalker.getNextSiblingc C s |j S )N)Z
parentNode)r r r r r �
getParentNode* s zTreeWalker.getParentNodeN)�__name__�
__module__� __qualname__r r r r r r r r r s r N)
Z
__future__r r r Zxml.domr � r ZNonRecursiveTreeWalkerr r r r r �<module> s pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.opt-1.pyc 0000644 00000003415 14751155150 0022121 0 ustar 00 3
���e � @ s� d dl mZmZmZ d dlmZ d dlmZmZmZm Z m
Z
d dlm Z m Z m
Z
mZmZmZ ddlmZ ddlmZmZ G d d
� d
ej�Zd S ) � )�absolute_import�division�unicode_literals)�QName)�START�END�
XML_NAMESPACE�DOCTYPE�TEXT)�START_NS�END_NS� START_CDATA� END_CDATA�PI�COMMENT� )�base� )� voidElements�
namespacesc @ s e Zd Zdd� Zdd� ZdS )�
TreeWalkerc c sd d }x6| j D ],}|d k r4x| j||�D ]
}|V q&W |}q W |d k r`x| j|d �D ]
}|V qRW d S )N)Ztree�tokens)�selfZprevious�event�token� r � /usr/lib/python3.6/genshi.py�__iter__
s
zTreeWalker.__iter__c c s� |\}}}|t kr�|\}}|j}|j} i }
x8|D ]0\} } t| t�rT| |
| j| jf< q0| |
d | f< q0W | td kr�|tkr�xJ| j| ||
| p�|d tkp�|d |k�D ]
}
|
V q�W n| j | ||
�V n�|tkr�|j}|j} | td ks�|tkr�| j
| |�V n~|t k�r| j |�V nf|t
k�r>xZ| j|�D ] }
|
V �q,W n>|tk�rV| j|� V n&|tttttttfk�rpn | j|�V d S )NZhtmlr r )r Z localname� namespace�
isinstancer r r ZemptyTagr ZstartTagZendTagr Zcommentr
�textr Zdoctyper r r r
r r �unknown)r r �nextZkind�data�_�tagZattribs�namer Zconverted_attribs�k�vr r r r r s@
zTreeWalker.tokensN)�__name__�
__module__� __qualname__r r r r r r r s r N)Z
__future__r r r Z genshi.corer r r r r r
r r r
r r r � r Z constantsr r r r r r r �<module> s pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.opt-1.pyc 0000644 00000014053 14751155150 0023004 0 ustar 00 3
���e� � @ s� d dl mZmZmZ d dlmZ d dlmZ ddlm Z ddl
m Z ddl
m Z d d
� Z
G d d � d e�ZG d
d� de�ZG dd� de�ZG dd� de�ZG dd� de j�ZdS )� )�absolute_import�division�unicode_literals)� text_type)�etree� )�
tag_regexp� )�base)� _ihatexmlc C s* | d kr d S t | t�r| S | jdd�S d S )N�ascii�strict)�
isinstancer �decode)�s� r � /usr/lib/python3.6/etree_lxml.py�
ensure_str s
r c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�Rootc C s� || _ g | _y:|jjrD| jjt| t|jj�t|jj�t|jj ��� W n t
k
rZ Y nX y |j � }W n t
k
r� |}Y nX x|j � d k r�|j � }q�W x |d k r�| jj|� |j
� }q�W d | _d | _d S )N)Z elementtree�childrenZdocinfoZ internalDTD�append�Doctyper Z root_name� public_idZ
system_url�AttributeErrorZgetrootZ getprevious�getnext�text�tail)�selfZet�noder r r �__init__ s*
z
Root.__init__c C s
| j | S )N)r )r �keyr r r � __getitem__1 s zRoot.__getitem__c C s d S )Nr )r r r r r 4 s z Root.getnextc C s dS )Nr r )r r r r �__len__7 s z Root.__len__N)�__name__�
__module__� __qualname__r r! r r" r r r r r s r c @ s e Zd Zdd� Zdd� ZdS )r c C s( || _ || _|| _|| _d | _d | _d S )N)� root_node�namer � system_idr r )r r& r' r r( r r r r < s zDoctype.__init__c C s | j jd S )Nr )r& r )r r r r r E s zDoctype.getnextN)r# r$ r% r r r r r r r ; s r c @ s e Zd Zdd� Zdd� ZdS )� FragmentRootc s$ � fdd�|D �� _ d � _� _d S )Nc s g | ]}t � |��qS r )�FragmentWrapper)�.0Zchild)r r r �
<listcomp>K s z)FragmentRoot.__init__.<locals>.<listcomp>)r r r )r r r )r r r J s zFragmentRoot.__init__c C s d S )Nr )r r r r r N s zFragmentRoot.getnextN)r# r$ r% r r r r r r r) I s r) c @ sT e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )r* c C sT || _ || _t| jd�r(t| jj�| _nd | _t| jd�rJt| jj�| _nd | _d S )Nr r )r& �obj�hasattrr r r )r Z
fragment_rootr- r r r r S s zFragmentWrapper.__init__c C s t | j|�S )N)�getattrr- )r r' r r r � __getattr___ s zFragmentWrapper.__getattr__c C s6 | j j}|j| �}|t|�d k r.||d S d S d S )Nr )r& r �index�len)r Zsiblings�idxr r r r b s
zFragmentWrapper.getnextc C s
| j | S )N)r- )r r r r r r! j s zFragmentWrapper.__getitem__c C s
t | j�S )N)�boolr- )r r r r �__bool__m s zFragmentWrapper.__bool__c C s d S )Nr )r r r r � getparentp s zFragmentWrapper.getparentc C s
t | j�S )N)�strr- )r r r r �__str__s s zFragmentWrapper.__str__c C s
t | j�S )N)r7 r- )r r r r � __unicode__v s zFragmentWrapper.__unicode__c C s
t | j�S )N)r2 r- )r r r r r" y s zFragmentWrapper.__len__N) r# r$ r% r r0 r r! r5 r6 r8 r9 r" r r r r r* R s r* c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) �
TreeWalkerc C sJ t |t�r t|�| _t|�}nt� | _t|�}tjj| |� t j
� | _ d S )N) r �list�set�fragmentChildrenr) r r
�NonRecursiveTreeWalkerr r Z
InfosetFilter�filter)r Ztreer r r r ~ s
zTreeWalker.__init__c C s� t |t�r&|\}}tjtt||��fS t |t�r8tjfS t |t�rVtj |j
|j |j fS t |t
�r|t|d� r|tjt|j�fS |jtjkr�tjt|j�fS |jtjkr�tjt|j�dd� fS tjt|j��}|r�|j� \}}nd }t|j�}i }xbt|jj � �D ]P\}}t|�}t|�}tj|�}|�rB|||j d�|j d�f< n ||d |f< �q W tj || j j |�|t!|�dk�px|jfS d S )N�tagr r r ���)"r �tupler
ZTEXTr r/ r ZDOCUMENTr ZDOCTYPEr' r r( r* r. r- r@ r �Comment�COMMENTr ZEntityZENTITYr �match�groupsr; Zattrib�items�groupZELEMENTr? Z fromXmlNamer2 ) r r r rE � namespacer@ Zattrsr' �valuer r r �getNodeDetails� s8
zTreeWalker.getNodeDetailsc C s |j r|dfS |d S d S )Nr r )r )r r r r r �
getFirstChild� s zTreeWalker.getFirstChildc C sN t |t�r8|\}}|dkr0t|�r*|d S d S n|j� S |jrF|dfS |j� S )Nr r r )r rB r2 r r )r r r r r r �getNextSibling� s
zTreeWalker.getNextSiblingc C s6 t |t�r |\}}|dkr.|S n|| jkr.d S |j� S )Nr )r rB r= r6 )r r r r r r �
getParentNode� s
zTreeWalker.getParentNodeN)r# r$ r% r rK rL rM rN r r r r r: } s
) r: N)Z
__future__r r r Zpip._vendor.sixr Zlxmlr Ztreebuilders.etreer � r
r r �objectr r r) r* r> r: r r r r �<module> s & + pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.opt-1.pyc 0000644 00000010612 14751155150 0021553 0 ustar 00 3
���eK � @ s� d dl mZmZmZ d dlmZ ddlmZmZm Z ddddd d
d d d
g Z
ej Z ej
ZejZejZejZejZdZdje �Z G dd � d e�ZG dd
� d
e�ZdS )� )�absolute_import�division�unicode_literals)�Node� )�
namespaces� voidElements�spaceCharacters�DOCUMENT�DOCTYPE�TEXT�ELEMENT�COMMENT�ENTITY�UNKNOWN�
TreeWalker�NonRecursiveTreeWalkerz <#UNKNOWN#>� c @ sh e Zd Zdd� Zdd� Zdd� Zddd �Zd
d � Zd d
� Zdd� Z dd� Z
ddd�Z dd� Z dd� Z
dS )r c C s
|| _ d S )N)�tree)�selfr � r �/usr/lib/python3.6/base.py�__init__ s zTreeWalker.__init__c C s t �d S )N)�NotImplementedError)r r r r �__iter__ s zTreeWalker.__iter__c C s
d|d�S )NZSerializeError)�type�datar )r �msgr r r �error s zTreeWalker.errorFc c s$ d|||d�V |r | j d�V d S )NZEmptyTag)r �name� namespacer zVoid element has children)r )r r r �attrs� hasChildrenr r r �emptyTag s
zTreeWalker.emptyTagc C s d|||d�S )NZStartTag)r r r r r )r r r r! r r r �startTag% s zTreeWalker.startTagc C s d||d�S )NZEndTag)r r r r )r r r r r r �endTag+ s zTreeWalker.endTagc c sx |}|j t�}|d t|�t|� � }|r6d|d�V |}|jt�}|t|�d � }|rdd|d�V |rtd|d�V d S )NZSpaceCharacters)r r Z
Characters)�lstripr �len�rstrip)r r Zmiddle�left�rightr r r �text0 s
zTreeWalker.textc C s
d|d�S )N�Comment)r r r )r r r r r �comment> s zTreeWalker.commentNc C s d|||d�S )NZDoctype)r r �publicId�systemIdr )r r r. r/ r r r �doctypeA s zTreeWalker.doctypec C s
d|d�S )NZEntity)r r r )r r r r r �entityG s zTreeWalker.entityc C s | j d| �S )NzUnknown node type: )r )r ZnodeTyper r r �unknownJ s zTreeWalker.unknown)F)NN)�__name__�
__module__� __qualname__r r r r# r$ r% r+ r- r0 r1 r2 r r r r r s
c @ s4 e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd S ) r c C s t �d S )N)r )r �noder r r �getNodeDetailsO s z%NonRecursiveTreeWalker.getNodeDetailsc C s t �d S )N)r )r r6 r r r �
getFirstChildR s z$NonRecursiveTreeWalker.getFirstChildc C s t �d S )N)r )r r6 r r r �getNextSiblingU s z%NonRecursiveTreeWalker.getNextSiblingc C s t �d S )N)r )r r6 r r r �
getParentNodeX s z$NonRecursiveTreeWalker.getParentNodec c s | j }�x�|d k �r| j|�}|d |dd � }}d}|tkrN| j|� V n�|tkrrx�| j|� D ]
}|V qbW n�|tkr�|\}}}}| s�|td kr�|tkr�x | j ||||�D ]
}|V q�W d}n| j
|||�V nV|t kr�| j |d �V n<|t
k�r| j|d �V n |tk�r d}n| j|d �V |�r@| j|�} nd } | d k �rT| }q
x�|d k �r�| j|�}|d |dd � }}|tk�r�|\}}}}|�r�|td k�s�|tk�r�| j||�V | j |k�r�d }P | j|�}
|
d k �r�|
}P n
| j|�}�qVW q
W d S )Nr � FZhtmlT)r r7 r r0 r r+ r
r r r# r$ r r- r r1 r
r2 r8 r% r9 r: ) r Z currentNodeZdetailsr r" �tokenr r Z
attributesZ
firstChildZ nextSiblingr r r r [ sZ
z NonRecursiveTreeWalker.__iter__N)r3 r4 r5 r7 r8 r9 r: r r r r r r N s
N) Z
__future__r r r Zxml.domr Z constantsr r r �__all__Z
DOCUMENT_NODEr
ZDOCUMENT_TYPE_NODEr Z TEXT_NODEr Z ELEMENT_NODEr
Z COMMENT_NODEr Z ENTITY_NODEr r �join�objectr r r r r r �<module> s
: pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000007063 14751155150 0022406 0 ustar 00 3
���e� � @ sb d Z ddlmZmZmZ ddlmZ ddlmZ dddd d
d gZ i Z
dd
d�Z dd� Z dd� Z
d S )a� A collection of modules for iterating through different kinds of
tree, generating tokens identical to those produced by the tokenizer
module.
To create a tree walker for a new type of tree, you need to do
implement a tree walker object (called TreeWalker by convention) that
implements a 'serialize' method taking a tree as sole argument and
returning an iterator generating tokens.
� )�absolute_import�division�unicode_literals� )� constants)�
default_etree�
getTreeWalker�pprint�dom�etree�genshi�
etree_lxmlNc K s� | j � } | tkr�| dkr0ddlm} |jt| < np| dkrPddlm} |jt| < nP| dkrpddlm} |jt| < n0| dkr�dd lm} |d
kr�t}|j |f|�jS tj
| �S ) a� Get a TreeWalker class for various types of tree with built-in support
Args:
treeType (str): the name of the tree type required (case-insensitive).
Supported values are:
- "dom": The xml.dom.minidom DOM implementation
- "etree": A generic walker for tree implementations exposing an
elementtree-like interface (known to work with
ElementTree, cElementTree and lxml.etree).
- "lxml": Optimized walker for lxml.etree
- "genshi": a Genshi stream
Implementation: A module implementing the tree type e.g.
xml.etree.ElementTree or cElementTree (Currently applies to the
"etree" tree type only).
r
� )r
r )r Zlxml)r
r )r N) �lower�treeWalkerCache� r
Z
TreeWalkerr r
r r ZgetETreeModule�get)ZtreeType�implementation�kwargsr
r r
r � r � /usr/lib/python3.6/__init__.pyr s" c c sl g }xL| D ]D}|d }|dkr.|j |d � q
|rHddj|�d�V g }|V q
W |rhddj|�d�V d S )N�type�
Characters�SpaceCharacters�datar )r r )r r )�append�join)�tokensZpendingCharacters�tokenr r r r �concatenateCharacterTokens< s
r c C s^ g }d}�xHt | �D �]:}|d }|d k�r&|d r~|d tjd kr~|d tjkrdtj|d }n|d }d||d f }n|d }|jd d
| |f � |d 7 }|d }xdt|j� �D ]T\\}} }
|r�|tjkr�tj| }n|}d|| f }n| }|jd
d
| ||
f � q�W |dk�rP|d 8 }q|dk�r:|d 8 }q|dk�r`|jdd
| |d f � q|dk�r|d �r�|d �r�|jdd
| |d |d |d �r�|d ndf � nF|d �r�|jdd
| |d |d f � n|jdd
| |d f � n|jdd
| f � q|dk�r8|jdd
| |d f � q|dk�rDqtd | ��qW d j|�S ) z Pretty printer for tree walkersr r �StartTag�EmptyTag� namespaceZhtmlz%s %s�namez%s<%s>� r r z %s%s="%s"ZEndTag�Commentz
%s<!-- %s -->ZDoctypeZpublicIdz%s<!DOCTYPE %s "%s" "%s">ZsystemIdr z%s<!DOCTYPE %s "" "%s">z%s<!DOCTYPE %s>z
%s<!DOCTYPE >r z%s"%s"r zUnknown token type, %s�
)r r! ) r r Z
namespaces�prefixesr �sorted�items�
ValueErrorr ) Zwalker�output�indentr r �nsr# Zattrsr" Z localname�valuer r r r K sd
)N)�__doc__Z
__future__r r r r r Z_utilsr �__all__r r r r r r r r �<module> s
' pip/_vendor/html5lib/__pycache__/constants.cpython-36.opt-1.pyc 0000644 00000201300 14751155150 0020321 0 ustar 00 3
���e�E � � @ s�- d dl mZmZmZ d dlZdZddddddd d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d,d,d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrdsdtdudvdwdxdydzd{d|d}d~dd�d�d�d���Zd�d�d�d�d�d�d��Zeed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fg�Z eed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fg�Z
eed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fgN�Z eed� d�fed� d�fed� d�fed� d�fg�Z eed� d�fed� d�fed� d�fed� d�fed� d�fg�Z
d�d�d�d�d�d�d�d�d�d�d�d�d�d�d��d �d�d�d�d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�d/�>Z�d0�d1iZ�d2�d3e�d2 f�d2�d4e�d2 f�d2�d5e�d2 f�d2�d6e�d2 f�d2�d7e�d2 f�d2d�e�d2 f�d2�d8e�d2 f�d9d�e�d9 f�d9�d:e�d9 f�d9�d;e�d9 fd�d<e�d< f�d<�d2e�d< f�d=� Ze�d>�d?� ej� D ��Ze�d@�dA�dB�dC�dDg�Zed�d�d�d�d�g�Zeej�Zeej�Zeej�Zeej �Z eej �Z e�dE�d?� ejD ��Z �d|Z ed�d��dFd�d�d�d�d�d�d�d�d�dԐdG�dHg�Z!ed�d�g�Z"ed�d�d�d�d�d�d�g�Z#e�dIg�e�dJg�e�dKg�e�dL�dMg�e�dL�dMg�e�dN�dOg�e�dPg�e�dQ�dRg�e�dS�dR�dT�dUg�e�dVg�e�dWg�e�dR�dXg�e�dR�dX�dYg�e�dR�dXg�e�dR�dZg�e�dR�dX�d[�dZ�dT�dKg�e�dR�dX�dZ�dQg�e�dR�dXg��d\�Z$�d}Z%e�dy�dz�d{�d|�d}g�Z&�d~�d~�d�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d͐dΐdϐdАdѐdҐdӐd��dѐdԐdՐddÐdאdؐdِdڐdېdܐdݐdސdߐd�d�d�d�d�d�d�d�d�d�d�d�dԐd�d�d�d�d�d�d�d�d�d�d�d�d��d��d��d��d��d��d��d��d��d��d��d��d �d�d�d�d�d�d�d�d�d�d �d
�d �d �d
�d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d(�d+�d��d,�d-�d.�d/�d0�d0�d1�d1�d2�d3�d4�d5�d5�d4�d6�d7�dڐd8�d9�d:�d;�d<�d=�d>�d?�d@�dA�dB�dC�dC�dD�dE�dF�dG�dH�dI�dJ�dK�dL�dM�dN�dO�dP�dQ�dR�dS�dT�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d`�da�db�dc�dd�de�df�dg�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dr�ds�dt�dՐddu�dv�dw�dx�dy�dz�d{�d|�d}�d~�d�d��d��dאdؐdِd��d��d��dX�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d"�d��dA�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d͐dΐdϐdϐdАdѐdҐdҐdӐdӐdԐdՐddאdאdؐdِdڐdېdܐdݐdސdߐd�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d'�d�d�d�d�d�d�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d �d�d�d�d�d�d�d�d�d �d�d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �dڐd!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�d/�d0�dߐd^�d �d1�d2�d3�d4�d5�d6�d7�d8�d9�d:�d;�d<�d=�d>�d?�d?�d@�dA�dB�dC�dD�d�dE�dF�dG�dH�dF�dI�dI�dJ�dK�dL�d@�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d^�d_�d`�da�db�dc�dc�dd�de�df�dg�dg�dh�di�dj�dk�dl�dm�dn�do�dp�d1�dq�dr�ds�dt�du�dv�dܐdݐdw�dx�dy�dz�d{�d|�d}�d~�d~�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��dɐdɐd��d��d��d��d��d��d��d��d��d��d��d��d�d�d��d��d��d��d��d��d��d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d��d͐dΐdϐdY�dАdѐdҐdӐdԐdY�dҐdՐdՐddאdY�d��dؐdؐdِdِd��dڐdېdܐdݐdސdߐd�d�d�d�dk�d�dܐd�d�d��d��d�dݐd��d�d�d�d�d:�d�dm�d�d�d�d�d�d�d�d�d��d��d�d��d
�d��d��d��d��d��d��d��d��d��d��d �d�d�du�du�d�d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d*�d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�dސd��d/�d/�d0�d1�dߐd�d2�d3�d4�d5�d5�d��d6�d,�d,�d7�d8�d9�d:�d;�d<�d=�d>�d?�d$�d@�dA�dB�dB�dC�dD�dE�dF�d��d��dG�dH�dH�d��dI�dJ�dK�dK�dL�dM�dN�dO�dP�dQ�dR�d��dS�dT�dU�dV�dP�dW�dX�dY�dZ�dZ�d[�d��d��d\�d]�d^�d3�d^�d��dX�d_�d��d`�d��d��d��da�db�dc�dd�de�df�dg�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dr�ds�dt�du�dv�dw�dx�dl�dm�dy�dz�d{�d{�dn�dw�dy�dz�d��d|�d}�dԐd~�d�d��dߐd��di�d��dːd��d��dϐd��d��d��d��d��d��d��d��d��dd�d�dΐdΐd��d��dѐd��d��d��d��d��d��d��d��d��d��d��d��dʐdӐd��d��d��d��d��dߐd��dd�d�d��d��d��d��d��d��d��d��d��d��d�d �d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��ddÐdĐdĐdŐd��d��d��d��d��dƐdǐd��dȐdɐdʐdːd̐dӐd��d͐dΐdΐdϐdϐdАdѐd�d�d�d��dҐdӐdԐdՐddאdؐdِdڐdېdܐdݐdސd �dߐd�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d�d��d��d��d��d��d��d��d��d�d�d�d �d �d �d��d��d��d��d �d�d�d"�d�d�d�d �d�d�d�d�d �d �d
�d
�d�d �d �d̐d
�d �d�d�d�d�d�d�d�d�d�d��d�d�d�d�d �d �d�d�dd��d�d(�d�dg�d�d�d�d�d �d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d�d)�d*�d��d+�d+�d;�d,�d,�d-�d.�d/�d/�dd0�d1�d1�d7�d2�d3�d4�d5�d6�d7�d4�d@�d4�d8�d9�d:�d��d;�d<�d=�d8�d9�d>�d��d>�d?�d@�dA�dB�dC�dD�d@�dE�dE�dF�d��dG�dH�dI�dJ�d��d<�dK�dL�dM�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d}�dՐd`�da�dv�db�dc�dd�de�dX�df�d]�dg�d]�dh�di�di�d^�d_�dj�dk�d$�dl�dm�dn�do�dp�dq�dr�ds�dt�du�dv�dw�dx�dy�dz�d{�d|�da�dv�d}�d~�dܐd�d�d��d��d��d^�do�d�ds�d��dg�d`�d�d�d��du�d��dv�dy�dy�d��d��d��d��d��d��dh�d��du�db�dw�dz�d��df�d��dw�d��d�ds�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��db�d�d��d��d��dl�d��d��d��d��d��d��di�d��d��d��d��d��d`�d��d�d��d��d��d��d��d��dz�d��d��dw�dݐd��d��dT�dT�d��d��d��d��d��d��d��d��d��dn�d��d��d��d��d��d��d��d��d��d��d��d�d�d�dj�dv�d��d��d��d��d��d��ddÐdÐd��dאdĐd��d��dŐd!�d��dƐdǐd �d��dȐdɐd��dʐd��dːd̐d̐d͐dΐd��dϐdАdѐdҐd��dӐdԐdՐdƐddאd̐dؐdِdڐd̐dېdېd��d��d��d��d��dܐdݐdސdːdߐd�d�d�d��d�d�dx�dx�d�d��d�d��d��d��d�d��d��d��d��d��d��d��d��d��dАd�d�d�d�d�d�d�dϐd�d�d�d��d�d�d��d�d��d��d��d��d��d��d��d͐d�d�d�d��d�d�d��d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��dӐd��d��d��d��d��d��dÐdŐdĐd��d͐d��dɐdʐdʐd͐d��d��d��d��d �dd��dd �dÐdĐd�d�dȐdǐdȐd�d��d�d�d��d��d��d��d��d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�dw�dw�d�dS�d�d�dT�dU�d�d�d�dV�d �d �d��d �d �d �d!�d"�d#�d#�d$�d%�dِd��dQ�d&�d'�d�d(�d)�d*�d+�d,�d��d-�d.�d/�d��d0�dR�d1�d2�d2�d3�d3�d4�d4�d5�d6�d7�d8�d2�d9�d9�d:�d;�d;�d��d<�d=�d=�d>�dސd?�d?�dސd@�dA�d�dB�dC�dD�dE�du�dF�dG�dH�dI�d��dJ�dK�dߐdL�d�dM�d�dN�dO�d"�dP�d��dQ�dR�d�d�dS�dT�d�dU�dV�dW�dW�d�dX�dY�d�d�d�dY�d�d�dZ�d[�d\�d�d]�d�d[�dZ�d\�d��d^�d_�d`�d��d��d�da�db�dc�dd�de�d2�df�dg�dh�d)�di�dj�dǐd��d��d#�dڐdk�d��dl�dm�dn�d5�do�d �dp�dq�d �dr�dr�d �ds�d
�dt�du�dv�d%�d��dw�dx�dy�dz�d{�d|�d��d�d}�d~�d�d��d��d��d��d��d�d~�d��d��d��d��d��d��d�d$�d�d!�d��d��d��d��d�d��d�d �d��d��d��d �dy�d�d �d�d �d��dz�d��d��dʐd�d �d��d��d��d��d��d��d�d��d��d��d��d��d��d��d��d��d��d%�d�d��d��d��d��d��d�d��d��d��d��d��d��dA�d��d��d��dC�dB�d��d��d��d��d��d��dD�d��d��d��d��d��d �d��d��d��d��d��d��d��d��d��d��d�d��d��d��d��dސd��d��d��d��d��dV�d��dW�dW�d��d��d��ddÐdĐdŐd^�d��dƐdǐd��dȐdɐdʐdːd̐d͐dΐdϐdАdѐdѐdސd7�dҐd<�dӐd8�d9�d8�d9�d:�d;�d:�d;�d6�d6�d
�d
�d �dԐd��dȐd>�dՐd�dŐdI�d��ddאdؐd@�dِdڐdېdܐdݐdސdd@�dאdܐdېdߐd�d�dA�d��dC�dB�d��d��d��dD�dE�d�d�d�d�d�d�d�dG�d�d�d�dH�d�d�d�d�d�d�d�d�dG�dH�d�d�d�d�d�d�d�d!�d��d��d��d��d��d��d��d�d��d��d��d[�d��d��dR�dR�d��d��d��dY�dV�dU�dY�dV�d �d �d͐d�d�d#�d�d�d3�d�d�d�d�d�d�d��d�dJ�d �d��d��dn�d
�d��d�d �d
�d �d
�d�d�d�d�d�d�d�d�dY�d�dܐd�d�d�d1�d�d�d�d�d�dr�d�dt�d �d �d �d �dq�d �d �d �d �d!�d"�d#�dѐdѐd$�d%�d1�ds�dq�d �dn�d&�dy�d&�d'�d(�d(�d)�d*�d+�d,�d-�d.�d �d��d'�d/�d/�d0�dݐd1�d2�dېd3�dŐdW�d��dI�dL�d��ds�d��d��d4�d5�d6�d7�d��dl�d�d8�d�d0�d9�d:�d;�d��d��d<�dl�d��dǐd=�d��d�d>�d5�d4�d7�d6�d?�d@�dA�d��dB�dC�dD�dE�dC�d��d��dF�d:�d�dm�d�dG�dؐd��dH�dאd�d��dI�d�dJ�d�d�dِd��dK�d�d�d�d��d��dL�dL�dM�dN�dO�dP�dP�dQ�dR�dS�dT�dU�dV�dV�dW�dX�dY�dZ�d��d[�d\�d]�d^�d_�d`�da�db�dc���Z'�dd�dD�dАde�d��dݐd�d �d�d��dO�dE�d,�d��dѐdf�d��dg�dh�dݐd��dܐd��d5�d�d��d͐dJ�d��d��d �di�dX�d��dj�"Z(d �dk�dl�dm�dn�do�dp�dq�dr�Z)ee)�ds e)�dt e)�du g�Z*e�dv�d?� ej� D ��Z+�dwe+d�< G �dx�dy� �dye,�Z-G �dz�d{� �d{e.�Z/dS (~ � )�absolute_import�division�unicode_literalsNz5Null character in input stream, replaced with U+FFFD.z Invalid codepoint in stream.z&Solidus (/) incorrectly placed in tag.z.Incorrect CR newline entity, replaced with LF.z9Entity used with illegal number (windows-1252 reference).zPNumeric entity couldn't be converted to character (codepoint U+%(charAsInt)08x).zBNumeric entity represents an illegal codepoint: U+%(charAsInt)08x.z#Numeric entity didn't end with ';'.z1Numeric entity expected. Got end of file instead.z'Numeric entity expected but none found.z!Named entity didn't end with ';'.z Named entity expected. Got none.z'End tag contains unexpected attributes.z.End tag contains unexpected self-closing flag.z#Expected tag name. Got '>' instead.zSExpected tag name. Got '?' instead. (HTML doesn't support processing instructions.)z-Expected tag name. Got something else insteadz6Expected closing tag. Got '>' instead. Ignoring '</>'.z-Expected closing tag. Unexpected end of file.z<Expected closing tag. Unexpected character '%(data)s' found.z'Unexpected end of file in the tag name.z8Unexpected end of file. Expected attribute name instead.z)Unexpected end of file in attribute name.z#Invalid character in attribute namez#Dropped duplicate attribute on tag.z1Unexpected end of file. Expected = or end of tag.z1Unexpected end of file. Expected attribute value.z*Expected attribute value. Got '>' instead.z"Unexpected = in unquoted attributez*Unexpected character in unquoted attributez*Unexpected character after attribute name.z+Unexpected character after attribute value.z.Unexpected end of file in attribute value (").z.Unexpected end of file in attribute value (').z*Unexpected end of file in attribute value.z)Unexpected end of file in tag. Expected >z/Unexpected character after / in tag. Expected >z&Expected '--' or 'DOCTYPE'. Not found.z Unexpected ! after -- in commentz$Unexpected space after -- in commentzIncorrect comment.z"Unexpected end of file in comment.z%Unexpected end of file in comment (-)z+Unexpected '-' after '--' found in comment.z'Unexpected end of file in comment (--).z&Unexpected character in comment found.z(No space after literal string 'DOCTYPE'.z.Unexpected > character. Expected DOCTYPE name.z.Unexpected end of file. Expected DOCTYPE name.z'Unexpected end of file in DOCTYPE name.z"Unexpected end of file in DOCTYPE.z%Expected space or '>'. Got '%(data)s'zUnexpected end of DOCTYPE.z Unexpected character in DOCTYPE.zXXX innerHTML EOFz Unexpected DOCTYPE. Ignored.z%html needs to be the first start tag.z)Unexpected End of file. Expected DOCTYPE.zErroneous DOCTYPE.z2Unexpected non-space characters. Expected DOCTYPE.z2Unexpected start tag (%(name)s). Expected DOCTYPE.z0Unexpected end tag (%(name)s). Expected DOCTYPE.z?Unexpected end tag (%(name)s) after the (implied) root element.z4Unexpected end of file. Expected end tag (%(name)s).z4Unexpected start tag head in existing head. Ignored.z'Unexpected end tag (%(name)s). Ignored.z;Unexpected start tag (%(name)s) that can be in head. Moved.z Unexpected start tag (%(name)s).zMissing end tag (%(name)s).z Missing end tags (%(name)s).zCUnexpected start tag (%(startName)s) implies end tag (%(endName)s).z@Unexpected start tag (%(originalName)s). Treated as %(newName)s.z,Unexpected start tag %(name)s. Don't use it!z'Unexpected start tag %(name)s. Ignored.zEUnexpected end tag (%(gotName)s). Missing end tag (%(expectedName)s).z:End tag (%(name)s) seen too early. Expected other end tag.zFUnexpected end tag (%(gotName)s). Expected end tag (%(expectedName)s).z+End tag (%(name)s) seen too early. Ignored.zQEnd tag (%(name)s) violates step 1, paragraph 1 of the adoption agency algorithm.zQEnd tag (%(name)s) violates step 1, paragraph 2 of the adoption agency algorithm.zQEnd tag (%(name)s) violates step 1, paragraph 3 of the adoption agency algorithm.zQEnd tag (%(name)s) violates step 4, paragraph 4 of the adoption agency algorithm.z>Unexpected end tag (%(originalName)s). Treated as %(newName)s.z'This element (%(name)s) has no end tag.z9Unexpected implied end tag (%(name)s) in the table phase.z>Unexpected implied end tag (%(name)s) in the table body phase.zDUnexpected non-space characters in table context caused voodoo mode.z3Unexpected input with type hidden in table context.z!Unexpected form in table context.zDUnexpected start tag (%(name)s) in table context caused voodoo mode.zBUnexpected end tag (%(name)s) in table context caused voodoo mode.zCUnexpected table cell start tag (%(name)s) in the table body phase.zFGot table cell end tag (%(name)s) while required end tags are missing.z?Unexpected end tag (%(name)s) in the table body phase. Ignored.z=Unexpected implied end tag (%(name)s) in the table row phase.z>Unexpected end tag (%(name)s) in the table row phase. Ignored.zJUnexpected select start tag in the select phase treated as select end tag.z/Unexpected input start tag in the select phase.zBUnexpected start tag token (%(name)s in the select phase. Ignored.z;Unexpected end tag (%(name)s) in the select phase. Ignored.zKUnexpected table element start tag (%(name)s) in the select in table phase.zIUnexpected table element end tag (%(name)s) in the select in table phase.z8Unexpected non-space characters in the after body phase.z>Unexpected start tag token (%(name)s) in the after body phase.z<Unexpected end tag token (%(name)s) in the after body phase.z@Unexpected characters in the frameset phase. Characters ignored.zEUnexpected start tag token (%(name)s) in the frameset phase. Ignored.zFUnexpected end tag token (frameset) in the frameset phase (innerHTML).zCUnexpected end tag token (%(name)s) in the frameset phase. Ignored.zEUnexpected non-space characters in the after frameset phase. Ignored.zEUnexpected start tag (%(name)s) in the after frameset phase. Ignored.zCUnexpected end tag (%(name)s) in the after frameset phase. Ignored.z(Unexpected end tag after body(innerHtml)z6Unexpected non-space characters. Expected end of file.z6Unexpected start tag (%(name)s). Expected end of file.z4Unexpected end tag (%(name)s). Expected end of file.z/Unexpected end of file. Expected table content.z0Unexpected end of file. Expected select content.z2Unexpected end of file. Expected frameset content.z0Unexpected end of file. Expected script content.z0Unexpected end of file. Expected foreign contentz0Trailing solidus not allowed on element %(name)sz2Element %(name)s not allowed in a non-html contextz*Unexpected end tag (%(name)s) before html.z9Element %(name)s not allowed in a inhead-noscript contextz8Unexpected end of file. Expected inhead-noscript contentz@Unexpected non-space character. Expected inhead-noscript contentz0Undefined error (this sucks and should be fixed))�znull-characterzinvalid-codepointzincorrectly-placed-soliduszincorrect-cr-newline-entityzillegal-windows-1252-entityzcant-convert-numeric-entityz$illegal-codepoint-for-numeric-entityz numeric-entity-without-semicolonz#expected-numeric-entity-but-got-eofzexpected-numeric-entityz named-entity-without-semicolonzexpected-named-entityzattributes-in-end-tagz self-closing-flag-on-end-tagz'expected-tag-name-but-got-right-bracketz'expected-tag-name-but-got-question-markzexpected-tag-namez*expected-closing-tag-but-got-right-bracketz expected-closing-tag-but-got-eofz!expected-closing-tag-but-got-charzeof-in-tag-namez#expected-attribute-name-but-got-eofzeof-in-attribute-namez#invalid-character-in-attribute-namezduplicate-attributez$expected-end-of-tag-name-but-got-eofz$expected-attribute-value-but-got-eofz.expected-attribute-value-but-got-right-bracketz"equals-in-unquoted-attribute-valuez0unexpected-character-in-unquoted-attribute-valuez&invalid-character-after-attribute-namez*unexpected-character-after-attribute-valuez#eof-in-attribute-value-double-quotez#eof-in-attribute-value-single-quotez eof-in-attribute-value-no-quotesz#unexpected-EOF-after-solidus-in-tagz)unexpected-character-after-solidus-in-tagzexpected-dashes-or-doctypez,unexpected-bang-after-double-dash-in-commentz-unexpected-space-after-double-dash-in-commentzincorrect-commentzeof-in-commentzeof-in-comment-end-dashz,unexpected-dash-after-double-dash-in-commentzeof-in-comment-double-dashz eof-in-comment-end-space-statez eof-in-comment-end-bang-statezunexpected-char-in-commentzneed-space-after-doctypez+expected-doctype-name-but-got-right-bracketz!expected-doctype-name-but-got-eofzeof-in-doctype-namezeof-in-doctypez*expected-space-or-right-bracket-in-doctypezunexpected-end-of-doctypezunexpected-char-in-doctypezeof-in-innerhtmlzunexpected-doctypez
non-html-rootz expected-doctype-but-got-eofzunknown-doctypez expected-doctype-but-got-charsz"expected-doctype-but-got-start-tagz expected-doctype-but-got-end-tagzend-tag-after-implied-rootz&expected-named-closing-tag-but-got-eofz!two-heads-are-not-better-than-onezunexpected-end-tagz#unexpected-start-tag-out-of-my-headzunexpected-start-tagzmissing-end-tagzmissing-end-tagsz$unexpected-start-tag-implies-end-tagz unexpected-start-tag-treated-aszdeprecated-tagz unexpected-start-tag-ignoredz$expected-one-end-tag-but-got-anotherzend-tag-too-earlyzend-tag-too-early-namedzend-tag-too-early-ignoredzadoption-agency-1.1zadoption-agency-1.2zadoption-agency-1.3zadoption-agency-4.4z unexpected-end-tag-treated-asz
no-end-tagz#unexpected-implied-end-tag-in-tablez(unexpected-implied-end-tag-in-table-bodyz$unexpected-char-implies-table-voodooz unexpected-hidden-input-in-tablezunexpected-form-in-tablez)unexpected-start-tag-implies-table-voodooz'unexpected-end-tag-implies-table-voodooz unexpected-cell-in-table-bodyzunexpected-cell-end-tagz unexpected-end-tag-in-table-bodyz'unexpected-implied-end-tag-in-table-rowz unexpected-end-tag-in-table-rowzunexpected-select-in-selectzunexpected-input-in-selectz unexpected-start-tag-in-selectz unexpected-end-tag-in-selectz5unexpected-table-element-start-tag-in-select-in-tablez3unexpected-table-element-end-tag-in-select-in-tablezunexpected-char-after-bodyz unexpected-start-tag-after-bodyz unexpected-end-tag-after-bodyzunexpected-char-in-framesetz unexpected-start-tag-in-framesetz)unexpected-frameset-in-frameset-innerhtmlz unexpected-end-tag-in-framesetz unexpected-char-after-framesetz#unexpected-start-tag-after-framesetz!unexpected-end-tag-after-framesetz'unexpected-end-tag-after-body-innerhtmlzexpected-eof-but-got-charz expected-eof-but-got-start-tagz expected-eof-but-got-end-tagz eof-in-tablez
eof-in-selectzeof-in-framesetzeof-in-script-in-scriptzeof-in-foreign-landsz&non-void-element-with-trailing-solidusz*unexpected-html-element-in-foreign-contentz unexpected-end-tag-before-htmlz unexpected-inhead-noscript-tagzeof-in-head-noscriptzchar-in-head-noscriptzXXX-undefined-errorz http://www.w3.org/1999/xhtmlz"http://www.w3.org/1998/Math/MathMLzhttp://www.w3.org/2000/svgz http://www.w3.org/1999/xlinkz$http://www.w3.org/XML/1998/namespacez http://www.w3.org/2000/xmlns/)�html�mathml�svg�xlink�xml�xmlnsr ZappletZcaptionZmarquee�object�tableZtdZthr Zmi�moZmnZmsZmtextzannotation-xmlr Z
foreignObjectZdesc�title�a�bZbig�codeZemZfont�iZnobr�sZsmallZstrikeZstrongZtt�uZaddressZareaZarticleZaside�baseZbasefontZbgsoundZ
blockquoteZbody�br�button�center�colZcolgroup�commandZdd�details�dirZdivZdlZdtZembed�fieldsetZfigureZfooterZform�frameZframeset�h1�h2�h3�h4�h5�h6�head�header�hrZiframeZimage�img�inputZisindexZli�linkZlisting�menu�metaZnavZnoembedZnoframesZnoscriptZol�pZparamZ plaintextZpre�scriptZsection�select�styleZtbodyZtextareaZtfootZtheadZtrZulZwbrZxmpz
annotaion-xmlZ
attributeNameZ
attributeTypeZ
baseFrequencyZ baseProfileZcalcModeZ
clipPathUnitsZcontentScriptTypeZcontentStyleTypeZdiffuseConstantZedgeModeZexternalResourcesRequiredZ filterResZ filterUnitsZglyphRefZgradientTransformZ
gradientUnitsZ kernelMatrixZkernelUnitLengthZ keyPointsZ
keySplinesZkeyTimesZ lengthAdjustZlimitingConeAngleZ markerHeightZ markerUnitsZ markerWidthZmaskContentUnitsZ maskUnitsZ
numOctavesZ
pathLengthZpatternContentUnitsZpatternTransformZ patternUnitsZ pointsAtXZ pointsAtYZ pointsAtZZ
preserveAlphaZpreserveAspectRatioZprimitiveUnitsZrefXZrefYZ repeatCountZ repeatDurZrequiredExtensionsZrequiredFeaturesZspecularConstantZspecularExponentZ spreadMethodZ startOffsetZ stdDeviationZ stitchTilesZ surfaceScaleZsystemLanguageZ tableValuesZtargetXZtargetYZ
textLengthZviewBoxZ
viewTargetZxChannelSelectorZyChannelSelectorZ
zoomAndPan)>Z
attributenameZ
attributetypeZ
basefrequencyZ baseprofileZcalcmodeZ
clippathunitsZcontentscripttypeZcontentstyletypeZdiffuseconstantZedgemodeZexternalresourcesrequiredZ filterresZ filterunitsZglyphrefZgradienttransformZ
gradientunitsZ kernelmatrixZkernelunitlengthZ keypointsZ
keysplinesZkeytimesZ lengthadjustZlimitingconeangleZ markerheightZ markerunitsZ markerwidthZmaskcontentunitsZ maskunitsZ
numoctavesZ
pathlengthZpatterncontentunitsZpatterntransformZ patternunitsZ pointsatxZ pointsatyZ pointsatzZ
preservealphaZpreserveaspectratioZprimitiveunitsZrefxZrefyZ repeatcountZ repeatdurZrequiredextensionsZrequiredfeaturesZspecularconstantZspecularexponentZ spreadmethodZ startoffsetZ stddeviationZ stitchtilesZ surfacescaleZsystemlanguageZ tablevaluesZtargetxZtargetyZ
textlengthZviewboxZ
viewtargetZxchannelselectorZychannelselectorZ
zoomandpanZ
definitionurlZ
definitionURLr ZactuateZarcroleZhrefZroleZshow�typer ZlangZspacer
) z
xlink:actuatez
xlink:arcrolez
xlink:hrefz
xlink:rolez
xlink:showz xlink:titlez
xlink:typezxml:basezxml:langz xml:spacer
z xmlns:xlinkc C s" g | ]\}\}}}||f|f�qS � r2 )�.0Zqname�prefixZlocal�nsr2 r2 � /usr/lib/python3.6/constants.py�
<listcomp>
s r7 � �
� � �
c C s g | ]}t |�t |j� �f�qS r2 )�ord�lower)r3 �cr2 r2 r6 r7 # s z event-source�sourceZtrackZ
irrelevantZscopedZismapZautoplayZcontrolsZdefer�async�openZmultipleZdisabledZhiddenZchecked�defaultZnoshadeZ
autosubmit�readonlyZselectedZ autofocusZrequired)� r0 r( ZaudioZvideor. r Zdatagridr r' r+ r ZoptionZoptgroupr r) r/ �output� � � � � �& � �! �� �0 �` �9 �R �} � � � � �" � � �� �"! �a �: �S �~ �x zlt;zgt;zamp;zapos;zquot;� Æ�&� Áu Ă� Âu Аu 𝔄� Àu Αu Āu ⩓u Ąu 𝔸u � Åu 𝒜u ≔� Ã� Äu ∖u ⫧u ⌆u Бu ∵u ℬu Βu 𝔅u 𝔹u ˘u ≎u Ч� ©u Ću ⋒u ⅅu ℭu Č� Çu Ĉu ∰u Ċ� ¸� ·u Χu ⊙u ⊖u ⊕u ⊗u ∲u ”u ’u ∷u ⩴u ≡u ∯u ∮u ℂu ∐u ∳u ⨯u 𝒞u ⋓u ≍u ⤑u Ђu Ѕu Џu ‡u ↡u ⫤u Ďu Дu ∇u Δu 𝔇� ´u ˙u ˝�`u ˜u ⋄u ⅆu 𝔻� ¨u ⃜u ≐u ⇓u ⇐u ⇔u ⟸u ⟺u ⟹u ⇒u ⊨u ⇑u ⇕u ∥u ↓u ⤓u ⇵u ̑u ⥐u ⥞u ↽u ⥖u ⥟u ⇁u ⥗u ⊤u ↧u 𝒟u Đu Ŋ� Ð� Éu Ě� Êu Эu Ėu 𝔈� Èu ∈u Ēu ◻u ▫u Ęu 𝔼u Εu ⩵u ≂u ⇌u ℰu ⩳u Η� Ëu ∃u ⅇu Фu 𝔉u ◼u ▪u 𝔽u ∀u ℱu Ѓ�>u Γu Ϝu Ğu Ģu Ĝu Гu Ġu 𝔊u ⋙u 𝔾u ≥u ⋛u ≧u ⪢u ≷u ⩾u ≳u 𝒢u ≫u Ъu ˇ�^u Ĥu ℌu ℋu ℍu ─u Ħu ≏u Еu IJu Ё� Í� Îu Иu İu ℑ� Ìu Īu ⅈu ∬u ∫u ⋂u u u Įu 𝕀u Ιu ℐu Ĩu І� Ïu Ĵu Йu 𝔍u 𝕁u 𝒥u Јu Єu Хu Ќu Κu Ķu Кu 𝔎u 𝕂u 𝒦u Љ�<u Ĺu Λu ⟪u ℒu ↞u Ľu Ļu Лu ⟨u ←u ⇤u ⇆u ⌈u ⟦u ⥡u ⇃u ⥙u ⌊u ↔u ⥎u ⊣u ↤u ⥚u ⊲u ⧏u ⊴u ⥑u ⥠u ↿u ⥘u ↼u ⥒u ⋚u ≦u ≶u ⪡u ⩽u ≲u 𝔏u ⋘u ⇚u Ŀu ⟵u ⟷u ⟶u 𝕃u ↙u ↘u ↰u Łu ≪u ⤅u Мu u ℳu 𝔐u ∓u 𝕄u Μu Њu Ńu Ňu Ņu Нu u 𝔑u � u ℕu ⫬u ≢u ≭u ∦u ∉u ≠u ≂̸u ∄u ≯u ≱u ≧̸u ≫̸u ≹u ⩾̸u ≵u ≎̸u ≏̸u ⋪u ⧏̸u ⋬u ≮u ≰u ≸u ≪̸u ⩽̸u ≴u ⪢̸u ⪡̸u ⊀u ⪯̸u ⋠u ∌u ⋫u ⧐̸u ⋭u ⊏̸u ⋢u ⊐̸u ⋣u ⊂⃒u ⊈u ⊁u ⪰̸u ⋡u ≿̸u ⊃⃒u ⊉u ≁u ≄u ≇u ≉u ∤u 𝒩� Ñu Νu Œ� Ó� Ôu Оu Őu 𝔒� Òu Ōu Ωu Οu 𝕆u “u ‘u ⩔u 𝒪� Ø� Õu ⨷� Öu ‾u ⏞u ⎴u ⏜u ∂u Пu 𝔓u Φu Π� ±u ℙu ⪻u ≺u ⪯u ≼u ≾u ″u ∏u ∝u 𝒫u Ψ�"u 𝔔u ℚu 𝒬u ⤐� ®u Ŕu ⟫u ↠u ⤖u Řu Ŗu Рu ℜu ∋u ⇋u ⥯u Ρu ⟩u →u ⇥u ⇄u ⌉u ⟧u ⥝u ⇂u ⥕u ⌋u ⊢u ↦u ⥛u ⊳u ⧐u ⊵u ⥏u ⥜u ↾u ⥔u ⇀u ⥓u ℝu ⥰u ⇛u ℛu ↱u ⧴u Щu Шu Ьu Śu ⪼u Šu Şu Ŝu Сu 𝔖u ↑u Σu ∘u 𝕊u √u □u ⊓u ⊏u ⊑u ⊐u ⊒u ⊔u 𝒮u ⋆u ⋐u ⊆u ≻u ⪰u ≽u ≿u ∑u ⋑u ⊃u ⊇� Þu ™u Ћu Цu Τu Ťu Ţu Тu 𝔗u ∴u Θu u u ∼u ≃u ≅u ≈u 𝕋u ⃛u 𝒯u Ŧ� Úu ↟u ⥉u Ўu Ŭ� Ûu Уu Űu 𝔘� Ùu Ū�_u ⏟u ⎵u ⏝u ⋃u ⊎u Ųu 𝕌u ⤒u ⇅u ↕u ⥮u ⊥u ↥u ↖u ↗u ϒu Υu Ůu 𝒰u Ũ� Üu ⊫u ⫫u Вu ⊩u ⫦u ⋁u ‖u ∣�|u ❘u ≀u u 𝔙u 𝕍u 𝒱u ⊪u Ŵu ⋀u 𝔚u 𝕎u 𝒲u 𝔛u Ξu 𝕏u 𝒳u Яu Їu Ю� Ýu Ŷu Ыu 𝔜u 𝕐u 𝒴u Ÿu Жu Źu Žu Зu Żu Ζu ℨu ℤu 𝒵� áu ău ∾u ∾̳u ∿� âu а� æu 𝔞� àu ℵu αu āu ⨿u ∧u ⩕u ⩜u ⩘u ⩚u ∠u ⦤u ∡u ⦨u ⦩u ⦪u ⦫u ⦬u ⦭u ⦮u ⦯u ∟u ⊾u ⦝u ∢u ⍼u ąu 𝕒u ⩰u ⩯u ≊u ≋�'� åu 𝒶�*� ã� äu ⨑u ⫭u ≌u ϶u ‵u ∽u ⋍u ⊽u ⌅u ⎶u бu „u ⦰u βu ℶu ≬u 𝔟u ◯u ⨀u ⨁u ⨂u ⨆u ★u ▽u △u ⨄u ⤍u ⧫u ▴u ▾u ◂u ▸u ␣u ▒u ░u ▓u █u =⃥u ≡⃥u ⌐u 𝕓u ⋈u ╗u ╔u ╖u ╓u ═u ╦u ╩u ╤u ╧u ╝u ╚u ╜u ╙u ║u ╬u ╣u ╠u ╫u ╢u ╟u ⧉u ╕u ╒u ┐u ┌u ╥u ╨u ┬u ┴u ⊟u ⊞u ⊠u ╛u ╘u ┘u └u │u ╪u ╡u ╞u ┼u ┤u ├� ¦u 𝒷u ⁏�\u ⧅u ⟈u •u ⪮u ću ∩u ⩄u ⩉u ⩋u ⩇u ⩀u ∩︀u ⁁u ⩍u č� çu ĉu ⩌u ⩐u ċu ⦲� ¢u 𝔠u чu ✓u χu ○u ⧃u ˆu ≗u ↺u ↻u Ⓢu ⊛u ⊚u ⊝u ⨐u ⫯u ⧂u ♣�:�,�@u ∁u ⩭u 𝕔u ℗u ↵u ✗u 𝒸u ⫏u ⫑u ⫐u ⫒u ⋯u ⤸u ⤵u ⋞u ⋟u ↶u ⤽u ∪u ⩈u ⩆u ⩊u ⊍u ⩅u ∪︀u ↷u ⤼u ⋎u ⋏� ¤u ∱u ⌭u ⥥u †u ℸu ‐u ⤏u ďu дu ⇊u ⩷� °u δu ⦱u ⥿u 𝔡u ♦u ϝu ⋲� ÷u ⋇u ђu ⌞u ⌍�$u 𝕕u ≑u ∸u ∔u ⊡u ⌟u ⌌u 𝒹u ѕu ⧶u đu ⋱u ▿u ⦦u џu ⟿� éu ⩮u ěu ≖� êu ≕u эu ėu ≒u 𝔢u ⪚� èu ⪖u ⪘u ⪙u ⏧u ℓu ⪕u ⪗u ēu ∅u u u u ŋu u ęu 𝕖u ⋕u ⧣u ⩱u εu ϵ�=u ≟u ⩸u ⧥u ≓u ⥱u ℯu η� ð� ëu €�!u фu ♀u ffiu ffu fflu 𝔣u fiZfju ♭u flu ▱u ƒu 𝕗u ⋔u ⫙u ⨍� ½u ⅓� ¼u ⅕u ⅙u ⅛u ⅔u ⅖� ¾u ⅗u ⅜u ⅘u ⅚u ⅝u ⅞u ⁄u ⌢u 𝒻u ⪌u ǵu γu ⪆u ğu ĝu гu ġu ⪩u ⪀u ⪂u ⪄u ⋛︀u ⪔u 𝔤u ℷu ѓu ⪒u ⪥u ⪤u ≩u ⪊u ⪈u ⋧u 𝕘u ℊu ⪎u ⪐u ⪧u ⩺u ⋗u ⦕u ⩼u ⥸u ≩︀u ъu ⥈u ↭u ℏu ĥu ♥u …u ⊹u 𝔥u ⤥u ⤦u ⇿u ∻u ↩u ↪u 𝕙u ―u 𝒽u ħu ⁃� í� îu иu е� ¡u 𝔦� ìu ⨌u ∭u ⧜u ℩u iju īu ıu ⊷u Ƶu ℅u ∞u ⧝u ⊺u ⨗u ⨼u ёu įu 𝕚u ι� ¿u 𝒾u ⋹u ⋵u ⋴u ⋳u ĩu і� ïu ĵu йu 𝔧u ȷu 𝕛u 𝒿u јu єu κu ϰu ķu кu 𝔨u ĸu хu ќu 𝕜u 𝓀u ⤛u ⤎u ⪋u ⥢u ĺu ⦴u λu ⦑u ⪅� «u ⤟u ⤝u ↫u ⤹u ⥳u ↢u ⪫u ⤙u ⪭u ⪭︀u ⤌u ❲�{�[u ⦋u ⦏u ⦍u ľu ļu лu ⤶u ⥧u ⥋u ↲u ≤u ⇇u ⋋u ⪨u ⩿u ⪁u ⪃u ⋚︀u ⪓u ⋖u ⥼u 𝔩u ⪑u ⥪u ▄u љu ⥫u ◺u ŀu ⎰u ≨u ⪉u ⪇u ⋦u ⟬u ⇽u ⟼u ↬u ⦅u 𝕝u ⨭u ⨴u ∗u ◊�(u ⦓u ⥭u u ⊿u ‹u 𝓁u ⪍u ⪏u ‚u łu ⪦u ⩹u ⋉u ⥶u ⩻u ⦖u ◃u ⥊u ⥦u ≨︀u ∺� ¯u ♂u ✠u ▮u ⨩u мu —u 𝔪u ℧� µu ⫰u −u ⨪u ⫛u ⊧u 𝕞u 𝓂u μu ⊸u ⋙̸u ≫⃒u ⇍u ⇎u ⋘̸u ≪⃒u ⇏u ⊯u ⊮u ńu ∠⃒u ⩰̸u ≋̸u ʼnu ♮u ⩃u ňu ņu ⩭̸u ⩂u нu –u ⇗u ⤤u ≐̸u ⤨u 𝔫u ↮u ⫲u ⋼u ⋺u њu ≦̸u ↚u ‥u 𝕟� ¬u ⋹̸u ⋵̸u ⋷u ⋶u ⋾u ⋽u ⫽⃥u ∂̸u ⨔u ↛u ⤳̸u ↝̸u 𝓃u ⊄u ⫅̸u ⊅u ⫆̸� ñu ν�#u №u u ⊭u ⤄u ≍⃒u ⊬u ≥⃒u >⃒u ⧞u ⤂u ≤⃒u <⃒u ⊴⃒u ⤃u ⊵⃒u ∼⃒u ⇖u ⤣u ⤧� ó� ôu оu őu ⨸u ⦼u œu ⦿u 𝔬u ˛� òu ⧁u ⦵u ⦾u ⦻u ⧀u ōu ωu οu ⦶u 𝕠u ⦷u ⦹u ∨u ⩝u ℴ� ª� ºu ⊶u ⩖u ⩗u ⩛� øu ⊘� õu ⨶� öu ⌽� ¶u ⫳u ⫽u п�%�.u ‰u ‱u 𝔭u φu ϕu ☎u πu ϖu ℎ�+u ⨣u ⨢u ⨥u ⩲u ⨦u ⨧u ⨕u 𝕡� £u ⪳u ⪷u ⪹u ⪵u ⋨u ′u ⌮u ⌒u ⌓u ⊰u 𝓅u ψu u 𝔮u 𝕢u ⁗u 𝓆u ⨖�?u ⤜u ⥤u ∽̱u ŕu ⦳u ⦒u ⦥� »u ⥵u ⤠u ⤳u ⤞u ⥅u ⥴u ↣u ↝u ⤚u ∶u ❳�}�]u ⦌u ⦎u ⦐u řu ŗu рu ⤷u ⥩u ↳u ▭u ⥽u 𝔯u ⥬u ρu ϱu ⇉u ⋌u ˚u u ⎱u ⫮u ⟭u ⇾u ⦆u 𝕣u ⨮u ⨵�)u ⦔u ⨒u ›u 𝓇u ⋊u ▹u ⧎u ⥨u ℞u śu ⪴u ⪸u šu şu ŝu ⪶u ⪺u ⋩u ⨓u сu ⋅u ⩦u ⇘� §�;u ⤩u ✶u 𝔰u ♯u щu ш� u σu ςu ⩪u ⪞u ⪠u ⪝u ⪟u ≆u ⨤u ⥲u ⨳u ⧤u ⌣u ⪪u ⪬u ⪬︀u ь�/u ⧄u ⌿u 𝕤u ♠u ⊓︀u ⊔︀u 𝓈u ☆u ⊂u ⫅u ⪽u ⫃u ⫁u ⫋u ⊊u ⪿u ⥹u ⫇u ⫕u ⫓u ♪� ¹� ²� ³u ⫆u ⪾u ⫘u ⫄u ⟉u ⫗u ⥻u ⫂u ⫌u ⊋u ⫀u ⫈u ⫔u ⫖u ⇙u ⤪� ßu ⌖u τu ťu ţu тu ⌕u 𝔱u θu ϑ� þ� ×u ⨱u ⨰u ⌶u ⫱u 𝕥u ⫚u ‴u ▵u ≜u ◬u ⨺u ⨹u ⧍u ⨻u ⏢u 𝓉u цu ћu ŧu ⥣� úu ўu ŭ� ûu уu űu ⥾u 𝔲� ùu ▀u ⌜u ⌏u ◸u ūu ųu 𝕦u υu ⇈u ⌝u ⌎u ůu ◹u 𝓊u ⋰u ũ� üu ⦧u ⫨u ⫩u ⦜u ⊊︀u ⫋︀u ⊋︀u ⫌︀u вu ⊻u ≚u ⋮u 𝔳u 𝕧u 𝓋u ⦚u ŵu ⩟u ≙u ℘u 𝔴u 𝕨u 𝓌u 𝔵u ξu ⋻u 𝕩u 𝓍� ýu яu ŷu ы� ¥u 𝔶u їu 𝕪u 𝓎u ю� ÿu źu žu зu żu ζu 𝔷u жu ⇝u 𝕫u 𝓏u u (� ZAEligzAElig;ZAMPzAMP;ZAacutezAacute;zAbreve;ZAcirczAcirc;zAcy;zAfr;ZAgravezAgrave;zAlpha;zAmacr;zAnd;zAogon;zAopf;zApplyFunction;ZAringzAring;zAscr;zAssign;ZAtildezAtilde;ZAumlzAuml;z
Backslash;zBarv;zBarwed;zBcy;zBecause;z Bernoullis;zBeta;zBfr;zBopf;zBreve;zBscr;zBumpeq;zCHcy;ZCOPYzCOPY;zCacute;zCap;zCapitalDifferentialD;zCayleys;zCcaron;ZCcedilzCcedil;zCcirc;zCconint;zCdot;zCedilla;z
CenterDot;zCfr;zChi;z
CircleDot;z CircleMinus;z CirclePlus;z CircleTimes;zClockwiseContourIntegral;zCloseCurlyDoubleQuote;zCloseCurlyQuote;zColon;zColone;z
Congruent;zConint;zContourIntegral;zCopf;z
Coproduct;z CounterClockwiseContourIntegral;zCross;zCscr;zCup;zCupCap;zDD;z DDotrahd;zDJcy;zDScy;zDZcy;zDagger;zDarr;zDashv;zDcaron;zDcy;zDel;zDelta;zDfr;zDiacriticalAcute;zDiacriticalDot;zDiacriticalDoubleAcute;zDiacriticalGrave;zDiacriticalTilde;zDiamond;zDifferentialD;zDopf;zDot;zDotDot;z DotEqual;zDoubleContourIntegral;z
DoubleDot;zDoubleDownArrow;zDoubleLeftArrow;zDoubleLeftRightArrow;zDoubleLeftTee;zDoubleLongLeftArrow;zDoubleLongLeftRightArrow;zDoubleLongRightArrow;zDoubleRightArrow;zDoubleRightTee;zDoubleUpArrow;zDoubleUpDownArrow;zDoubleVerticalBar;z
DownArrow;z
DownArrowBar;zDownArrowUpArrow;z
DownBreve;zDownLeftRightVector;zDownLeftTeeVector;zDownLeftVector;zDownLeftVectorBar;zDownRightTeeVector;zDownRightVector;zDownRightVectorBar;zDownTee;z
DownTeeArrow;z
Downarrow;zDscr;zDstrok;zENG;ZETHzETH;ZEacutezEacute;zEcaron;ZEcirczEcirc;zEcy;zEdot;zEfr;ZEgravezEgrave;zElement;zEmacr;zEmptySmallSquare;zEmptyVerySmallSquare;zEogon;zEopf;zEpsilon;zEqual;z EqualTilde;z Equilibrium;zEscr;zEsim;zEta;ZEumlzEuml;zExists;z
ExponentialE;zFcy;zFfr;zFilledSmallSquare;zFilledVerySmallSquare;zFopf;zForAll;z Fouriertrf;zFscr;zGJcy;ZGTzGT;zGamma;zGammad;zGbreve;zGcedil;zGcirc;zGcy;zGdot;zGfr;zGg;zGopf;z
GreaterEqual;zGreaterEqualLess;zGreaterFullEqual;zGreaterGreater;z GreaterLess;zGreaterSlantEqual;z
GreaterTilde;zGscr;zGt;zHARDcy;zHacek;zHat;zHcirc;zHfr;z
HilbertSpace;zHopf;zHorizontalLine;zHscr;zHstrok;z
HumpDownHump;z
HumpEqual;zIEcy;zIJlig;zIOcy;ZIacutezIacute;ZIcirczIcirc;zIcy;zIdot;zIfr;ZIgravezIgrave;zIm;zImacr;z ImaginaryI;zImplies;zInt;z Integral;z
Intersection;zInvisibleComma;zInvisibleTimes;zIogon;zIopf;zIota;zIscr;zItilde;zIukcy;ZIumlzIuml;zJcirc;zJcy;zJfr;zJopf;zJscr;zJsercy;zJukcy;zKHcy;zKJcy;zKappa;zKcedil;zKcy;zKfr;zKopf;zKscr;zLJcy;ZLTzLT;zLacute;zLambda;zLang;z Laplacetrf;zLarr;zLcaron;zLcedil;zLcy;zLeftAngleBracket;z
LeftArrow;z
LeftArrowBar;zLeftArrowRightArrow;z LeftCeiling;zLeftDoubleBracket;zLeftDownTeeVector;zLeftDownVector;zLeftDownVectorBar;z
LeftFloor;zLeftRightArrow;zLeftRightVector;zLeftTee;z
LeftTeeArrow;zLeftTeeVector;z
LeftTriangle;zLeftTriangleBar;zLeftTriangleEqual;zLeftUpDownVector;zLeftUpTeeVector;z
LeftUpVector;zLeftUpVectorBar;z LeftVector;zLeftVectorBar;z
Leftarrow;zLeftrightarrow;zLessEqualGreater;zLessFullEqual;z LessGreater;z LessLess;zLessSlantEqual;z
LessTilde;zLfr;zLl;z Lleftarrow;zLmidot;zLongLeftArrow;zLongLeftRightArrow;zLongRightArrow;zLongleftarrow;zLongleftrightarrow;zLongrightarrow;zLopf;zLowerLeftArrow;zLowerRightArrow;zLscr;zLsh;zLstrok;zLt;zMap;zMcy;z MediumSpace;z
Mellintrf;zMfr;z
MinusPlus;zMopf;zMscr;zMu;zNJcy;zNacute;zNcaron;zNcedil;zNcy;zNegativeMediumSpace;zNegativeThickSpace;zNegativeThinSpace;zNegativeVeryThinSpace;zNestedGreaterGreater;zNestedLessLess;zNewLine;zNfr;zNoBreak;zNonBreakingSpace;zNopf;zNot;z
NotCongruent;z
NotCupCap;zNotDoubleVerticalBar;z NotElement;z NotEqual;zNotEqualTilde;z
NotExists;z NotGreater;zNotGreaterEqual;zNotGreaterFullEqual;zNotGreaterGreater;zNotGreaterLess;zNotGreaterSlantEqual;zNotGreaterTilde;zNotHumpDownHump;z
NotHumpEqual;zNotLeftTriangle;zNotLeftTriangleBar;zNotLeftTriangleEqual;zNotLess;z
NotLessEqual;zNotLessGreater;z NotLessLess;zNotLessSlantEqual;z
NotLessTilde;zNotNestedGreaterGreater;zNotNestedLessLess;z NotPrecedes;zNotPrecedesEqual;zNotPrecedesSlantEqual;zNotReverseElement;zNotRightTriangle;zNotRightTriangleBar;zNotRightTriangleEqual;zNotSquareSubset;zNotSquareSubsetEqual;zNotSquareSuperset;zNotSquareSupersetEqual;z
NotSubset;zNotSubsetEqual;z NotSucceeds;zNotSucceedsEqual;zNotSucceedsSlantEqual;zNotSucceedsTilde;z NotSuperset;zNotSupersetEqual;z NotTilde;zNotTildeEqual;zNotTildeFullEqual;zNotTildeTilde;zNotVerticalBar;zNscr;ZNtildezNtilde;zNu;zOElig;ZOacutezOacute;ZOcirczOcirc;zOcy;zOdblac;zOfr;ZOgravezOgrave;zOmacr;zOmega;zOmicron;zOopf;zOpenCurlyDoubleQuote;zOpenCurlyQuote;zOr;zOscr;ZOslashzOslash;ZOtildezOtilde;zOtimes;ZOumlzOuml;zOverBar;z
OverBrace;z OverBracket;zOverParenthesis;z PartialD;zPcy;zPfr;zPhi;zPi;z
PlusMinus;zPoincareplane;zPopf;zPr;z Precedes;zPrecedesEqual;zPrecedesSlantEqual;zPrecedesTilde;zPrime;zProduct;z Proportion;z
Proportional;zPscr;zPsi;ZQUOTzQUOT;zQfr;zQopf;zQscr;zRBarr;ZREGzREG;zRacute;zRang;zRarr;zRarrtl;zRcaron;zRcedil;zRcy;zRe;zReverseElement;zReverseEquilibrium;zReverseUpEquilibrium;zRfr;zRho;zRightAngleBracket;z RightArrow;zRightArrowBar;zRightArrowLeftArrow;z
RightCeiling;zRightDoubleBracket;zRightDownTeeVector;zRightDownVector;zRightDownVectorBar;z RightFloor;z RightTee;zRightTeeArrow;zRightTeeVector;zRightTriangle;zRightTriangleBar;zRightTriangleEqual;zRightUpDownVector;zRightUpTeeVector;zRightUpVector;zRightUpVectorBar;z RightVector;zRightVectorBar;z Rightarrow;zRopf;z
RoundImplies;z Rrightarrow;zRscr;zRsh;z RuleDelayed;zSHCHcy;zSHcy;zSOFTcy;zSacute;zSc;zScaron;zScedil;zScirc;zScy;zSfr;zShortDownArrow;zShortLeftArrow;zShortRightArrow;z
ShortUpArrow;zSigma;z SmallCircle;zSopf;zSqrt;zSquare;zSquareIntersection;z
SquareSubset;zSquareSubsetEqual;zSquareSuperset;zSquareSupersetEqual;z SquareUnion;zSscr;zStar;zSub;zSubset;z SubsetEqual;z Succeeds;zSucceedsEqual;zSucceedsSlantEqual;zSucceedsTilde;z SuchThat;zSum;zSup;z Superset;zSupersetEqual;zSupset;ZTHORNzTHORN;zTRADE;zTSHcy;zTScy;zTab;zTau;zTcaron;zTcedil;zTcy;zTfr;z
Therefore;zTheta;z ThickSpace;z
ThinSpace;zTilde;z TildeEqual;zTildeFullEqual;z TildeTilde;zTopf;z
TripleDot;zTscr;zTstrok;ZUacutezUacute;zUarr;z Uarrocir;zUbrcy;zUbreve;ZUcirczUcirc;zUcy;zUdblac;zUfr;ZUgravezUgrave;zUmacr;z UnderBar;z UnderBrace;z
UnderBracket;zUnderParenthesis;zUnion;z
UnionPlus;zUogon;zUopf;zUpArrow;z UpArrowBar;zUpArrowDownArrow;z UpDownArrow;zUpEquilibrium;zUpTee;z UpTeeArrow;zUparrow;z Updownarrow;zUpperLeftArrow;zUpperRightArrow;zUpsi;zUpsilon;zUring;zUscr;zUtilde;ZUumlzUuml;zVDash;zVbar;zVcy;zVdash;zVdashl;zVee;zVerbar;zVert;z VerticalBar;z
VerticalLine;zVerticalSeparator;zVerticalTilde;zVeryThinSpace;zVfr;zVopf;zVscr;zVvdash;zWcirc;zWedge;zWfr;zWopf;zWscr;zXfr;zXi;zXopf;zXscr;zYAcy;zYIcy;zYUcy;ZYacutezYacute;zYcirc;zYcy;zYfr;zYopf;zYscr;zYuml;zZHcy;zZacute;zZcaron;zZcy;zZdot;zZeroWidthSpace;zZeta;zZfr;zZopf;zZscr;Zaacutezaacute;zabreve;zac;zacE;zacd;Zacirczacirc;Zacutezacute;zacy;Zaeligzaelig;zaf;zafr;Zagravezagrave;zalefsym;zaleph;zalpha;zamacr;zamalg;Zampzamp;zand;zandand;zandd;z andslope;zandv;zang;zange;zangle;zangmsd;z angmsdaa;z angmsdab;z angmsdac;z angmsdad;z angmsdae;z angmsdaf;z angmsdag;z angmsdah;zangrt;zangrtvb;z angrtvbd;zangsph;zangst;zangzarr;zaogon;zaopf;zap;zapE;zapacir;zape;zapid;zapos;zapprox;z approxeq;Zaringzaring;zascr;zast;zasymp;zasympeq;Zatildezatilde;Zaumlzauml;z awconint;zawint;zbNot;z backcong;z backepsilon;z
backprime;zbacksim;z
backsimeq;zbarvee;zbarwed;z barwedge;zbbrk;z bbrktbrk;zbcong;zbcy;zbdquo;zbecaus;zbecause;zbemptyv;zbepsi;zbernou;zbeta;zbeth;zbetween;zbfr;zbigcap;zbigcirc;zbigcup;zbigodot;z bigoplus;z
bigotimes;z bigsqcup;zbigstar;zbigtriangledown;zbigtriangleup;z biguplus;zbigvee;z bigwedge;zbkarow;z
blacklozenge;z blacksquare;zblacktriangle;zblacktriangledown;zblacktriangleleft;zblacktriangleright;zblank;zblk12;zblk14;zblk34;zblock;zbne;zbnequiv;zbnot;zbopf;zbot;zbottom;zbowtie;zboxDL;zboxDR;zboxDl;zboxDr;zboxH;zboxHD;zboxHU;zboxHd;zboxHu;zboxUL;zboxUR;zboxUl;zboxUr;zboxV;zboxVH;zboxVL;zboxVR;zboxVh;zboxVl;zboxVr;zboxbox;zboxdL;zboxdR;zboxdl;zboxdr;zboxh;zboxhD;zboxhU;zboxhd;zboxhu;z boxminus;zboxplus;z boxtimes;zboxuL;zboxuR;zboxul;zboxur;zboxv;zboxvH;zboxvL;zboxvR;zboxvh;zboxvl;zboxvr;zbprime;zbreve;Zbrvbarzbrvbar;zbscr;zbsemi;zbsim;zbsime;zbsol;zbsolb;z bsolhsub;zbull;zbullet;zbump;zbumpE;zbumpe;zbumpeq;zcacute;zcap;zcapand;z capbrcup;zcapcap;zcapcup;zcapdot;zcaps;zcaret;zcaron;zccaps;zccaron;Zccedilzccedil;zccirc;zccups;zccupssm;zcdot;Zcedilzcedil;zcemptyv;Zcentzcent;z
centerdot;zcfr;zchcy;zcheck;z
checkmark;zchi;zcir;zcirE;zcirc;zcirceq;zcirclearrowleft;zcirclearrowright;z circledR;z circledS;z circledast;z circledcirc;z circleddash;zcire;z cirfnint;zcirmid;zcirscir;zclubs;z clubsuit;zcolon;zcolone;zcoloneq;zcomma;zcommat;zcomp;zcompfn;z complement;z
complexes;zcong;zcongdot;zconint;zcopf;zcoprod;�copyzcopy;zcopysr;zcrarr;zcross;zcscr;zcsub;zcsube;zcsup;zcsupe;zctdot;zcudarrl;zcudarrr;zcuepr;zcuesc;zcularr;zcularrp;zcup;z cupbrcap;zcupcap;zcupcup;zcupdot;zcupor;zcups;zcurarr;zcurarrm;z curlyeqprec;z curlyeqsucc;z curlyvee;z curlywedge;Zcurrenzcurren;zcurvearrowleft;zcurvearrowright;zcuvee;zcuwed;z cwconint;zcwint;zcylcty;zdArr;zdHar;zdagger;zdaleth;zdarr;zdash;zdashv;zdbkarow;zdblac;zdcaron;zdcy;zdd;zddagger;zddarr;zddotseq;Zdegzdeg;zdelta;zdemptyv;zdfisht;zdfr;zdharl;zdharr;zdiam;zdiamond;z diamondsuit;zdiams;zdie;zdigamma;zdisin;zdiv;Zdividezdivide;zdivideontimes;zdivonx;zdjcy;zdlcorn;zdlcrop;zdollar;zdopf;zdot;zdoteq;z doteqdot;z dotminus;zdotplus;z
dotsquare;zdoublebarwedge;z
downarrow;zdowndownarrows;zdownharpoonleft;zdownharpoonright;z drbkarow;zdrcorn;zdrcrop;zdscr;zdscy;zdsol;zdstrok;zdtdot;zdtri;zdtrif;zduarr;zduhar;zdwangle;zdzcy;z dzigrarr;zeDDot;zeDot;Zeacutezeacute;zeaster;zecaron;zecir;Zecirczecirc;zecolon;zecy;zedot;zee;zefDot;zefr;zeg;Zegravezegrave;zegs;zegsdot;zel;z elinters;zell;zels;zelsdot;zemacr;zempty;z emptyset;zemptyv;zemsp13;zemsp14;zemsp;zeng;zensp;zeogon;zeopf;zepar;zeparsl;zeplus;zepsi;zepsilon;zepsiv;zeqcirc;zeqcolon;zeqsim;z eqslantgtr;z eqslantless;zequals;zequest;zequiv;zequivDD;z eqvparsl;zerDot;zerarr;zescr;zesdot;zesim;zeta;Zethzeth;Zeumlzeuml;zeuro;zexcl;zexist;z expectation;z
exponentiale;zfallingdotseq;zfcy;zfemale;zffilig;zfflig;zffllig;zffr;zfilig;zfjlig;zflat;zfllig;zfltns;zfnof;zfopf;zforall;zfork;zforkv;z fpartint;Zfrac12zfrac12;zfrac13;Zfrac14zfrac14;zfrac15;zfrac16;zfrac18;zfrac23;zfrac25;Zfrac34zfrac34;zfrac35;zfrac38;zfrac45;zfrac56;zfrac58;zfrac78;zfrasl;zfrown;zfscr;zgE;zgEl;zgacute;zgamma;zgammad;zgap;zgbreve;zgcirc;zgcy;zgdot;zge;zgel;zgeq;zgeqq;z geqslant;zges;zgescc;zgesdot;zgesdoto;z gesdotol;zgesl;zgesles;zgfr;zgg;zggg;zgimel;zgjcy;zgl;zglE;zgla;zglj;zgnE;zgnap;z gnapprox;zgne;zgneq;zgneqq;zgnsim;zgopf;zgrave;zgscr;zgsim;zgsime;zgsiml;�gtzgt;zgtcc;zgtcir;zgtdot;zgtlPar;zgtquest;z
gtrapprox;zgtrarr;zgtrdot;z
gtreqless;z gtreqqless;zgtrless;zgtrsim;z
gvertneqq;zgvnE;zhArr;zhairsp;zhalf;zhamilt;zhardcy;zharr;zharrcir;zharrw;zhbar;zhcirc;zhearts;z
heartsuit;zhellip;zhercon;zhfr;z hksearow;z hkswarow;zhoarr;zhomtht;zhookleftarrow;zhookrightarrow;zhopf;zhorbar;zhscr;zhslash;zhstrok;zhybull;zhyphen;Ziacuteziacute;zic;Zicirczicirc;zicy;ziecy;Ziexclziexcl;ziff;zifr;Zigravezigrave;zii;ziiiint;ziiint;ziinfin;ziiota;zijlig;zimacr;zimage;z imagline;z imagpart;zimath;zimof;zimped;zin;zincare;zinfin;z infintie;zinodot;zint;zintcal;z integers;z intercal;z intlarhk;zintprod;ziocy;ziogon;ziopf;ziota;ziprod;Ziquestziquest;ziscr;zisin;zisinE;zisindot;zisins;zisinsv;zisinv;zit;zitilde;ziukcy;Ziumlziuml;zjcirc;zjcy;zjfr;zjmath;zjopf;zjscr;zjsercy;zjukcy;zkappa;zkappav;zkcedil;zkcy;zkfr;zkgreen;zkhcy;zkjcy;zkopf;zkscr;zlAarr;zlArr;zlAtail;zlBarr;zlE;zlEg;zlHar;zlacute;z laemptyv;zlagran;zlambda;zlang;zlangd;zlangle;zlap;Zlaquozlaquo;zlarr;zlarrb;zlarrbfs;zlarrfs;zlarrhk;zlarrlp;zlarrpl;zlarrsim;zlarrtl;zlat;zlatail;zlate;zlates;zlbarr;zlbbrk;zlbrace;zlbrack;zlbrke;zlbrksld;zlbrkslu;zlcaron;zlcedil;zlceil;zlcub;zlcy;zldca;zldquo;zldquor;zldrdhar;z ldrushar;zldsh;zle;z
leftarrow;zleftarrowtail;zleftharpoondown;zleftharpoonup;zleftleftarrows;zleftrightarrow;zleftrightarrows;zleftrightharpoons;zleftrightsquigarrow;zleftthreetimes;zleg;zleq;zleqq;z leqslant;zles;zlescc;zlesdot;zlesdoto;z lesdotor;zlesg;zlesges;z lessapprox;zlessdot;z
lesseqgtr;z lesseqqgtr;zlessgtr;zlesssim;zlfisht;zlfloor;zlfr;zlg;zlgE;zlhard;zlharu;zlharul;zlhblk;zljcy;zll;zllarr;z llcorner;zllhard;zlltri;zlmidot;zlmoust;z lmoustache;zlnE;zlnap;z lnapprox;zlne;zlneq;zlneqq;zlnsim;zloang;zloarr;zlobrk;zlongleftarrow;zlongleftrightarrow;z longmapsto;zlongrightarrow;zlooparrowleft;zlooparrowright;zlopar;zlopf;zloplus;zlotimes;zlowast;zlowbar;zloz;zlozenge;zlozf;zlpar;zlparlt;zlrarr;z lrcorner;zlrhar;zlrhard;zlrm;zlrtri;zlsaquo;zlscr;zlsh;zlsim;zlsime;zlsimg;zlsqb;zlsquo;zlsquor;zlstrok;�ltzlt;zltcc;zltcir;zltdot;zlthree;zltimes;zltlarr;zltquest;zltrPar;zltri;zltrie;zltrif;z lurdshar;zluruhar;z
lvertneqq;zlvnE;zmDDot;Zmacrzmacr;zmale;zmalt;zmaltese;zmap;zmapsto;z mapstodown;z mapstoleft;z mapstoup;zmarker;zmcomma;zmcy;zmdash;zmeasuredangle;zmfr;zmho;�microzmicro;zmid;zmidast;zmidcir;Zmiddotzmiddot;zminus;zminusb;zminusd;zminusdu;zmlcp;zmldr;zmnplus;zmodels;zmopf;zmp;zmscr;zmstpos;zmu;z multimap;zmumap;znGg;znGt;znGtv;z nLeftarrow;znLeftrightarrow;znLl;znLt;znLtv;z nRightarrow;znVDash;znVdash;znabla;znacute;znang;znap;znapE;znapid;znapos;znapprox;znatur;znatural;z naturals;Znbspznbsp;znbump;znbumpe;zncap;zncaron;zncedil;zncong;z ncongdot;zncup;zncy;zndash;zne;zneArr;znearhk;znearr;znearrow;znedot;znequiv;znesear;znesim;znexist;znexists;znfr;zngE;znge;zngeq;zngeqq;z
ngeqslant;znges;zngsim;zngt;zngtr;znhArr;znharr;znhpar;zni;znis;znisd;zniv;znjcy;znlArr;znlE;znlarr;znldr;znle;z nleftarrow;znleftrightarrow;znleq;znleqq;z
nleqslant;znles;znless;znlsim;znlt;znltri;znltrie;znmid;znopf;�notznot;znotin;znotinE;z notindot;znotinva;znotinvb;znotinvc;znotni;znotniva;znotnivb;znotnivc;znpar;z
nparallel;znparsl;znpart;znpolint;znpr;znprcue;znpre;znprec;znpreceq;znrArr;znrarr;znrarrc;znrarrw;z nrightarrow;znrtri;znrtrie;znsc;znsccue;znsce;znscr;z
nshortmid;znshortparallel;znsim;znsime;znsimeq;znsmid;znspar;znsqsube;znsqsupe;znsub;znsubE;znsube;znsubset;z
nsubseteq;z nsubseteqq;znsucc;znsucceq;znsup;znsupE;znsupe;znsupset;z
nsupseteq;z nsupseteqq;zntgl;Zntildezntilde;zntlg;zntriangleleft;zntrianglelefteq;zntriangleright;zntrianglerighteq;znu;znum;znumero;znumsp;znvDash;znvHarr;znvap;znvdash;znvge;znvgt;znvinfin;znvlArr;znvle;znvlt;znvltrie;znvrArr;znvrtrie;znvsim;znwArr;znwarhk;znwarr;znwarrow;znwnear;zoS;Zoacutezoacute;zoast;zocir;Zocirczocirc;zocy;zodash;zodblac;zodiv;zodot;zodsold;zoelig;zofcir;zofr;zogon;Zogravezograve;zogt;zohbar;zohm;zoint;zolarr;zolcir;zolcross;zoline;zolt;zomacr;zomega;zomicron;zomid;zominus;zoopf;zopar;zoperp;zoplus;zor;zorarr;zord;zorder;zorderof;Zordfzordf;Zordmzordm;zorigof;zoror;zorslope;zorv;zoscr;Zoslashzoslash;zosol;Zotildezotilde;zotimes;z otimesas;Zoumlzouml;zovbar;zpar;Zparazpara;z parallel;zparsim;zparsl;zpart;zpcy;zpercnt;zperiod;zpermil;zperp;zpertenk;zpfr;zphi;zphiv;zphmmat;zphone;zpi;z
pitchfork;zpiv;zplanck;zplanckh;zplankv;zplus;z plusacir;zplusb;zpluscir;zplusdo;zplusdu;zpluse;Zplusmnzplusmn;zplussim;zplustwo;zpm;z pointint;zpopf;Zpoundzpound;zpr;zprE;zprap;zprcue;zpre;zprec;z precapprox;z preccurlyeq;zpreceq;z precnapprox;z precneqq;z precnsim;zprecsim;zprime;zprimes;zprnE;zprnap;zprnsim;zprod;z profalar;z profline;z profsurf;zprop;zpropto;zprsim;zprurel;zpscr;zpsi;zpuncsp;zqfr;zqint;zqopf;zqprime;zqscr;z quaternions;zquatint;zquest;zquesteq;Zquotzquot;zrAarr;zrArr;zrAtail;zrBarr;zrHar;zrace;zracute;zradic;z raemptyv;zrang;zrangd;zrange;zrangle;Zraquozraquo;zrarr;zrarrap;zrarrb;zrarrbfs;zrarrc;zrarrfs;zrarrhk;zrarrlp;zrarrpl;zrarrsim;zrarrtl;zrarrw;zratail;zratio;z
rationals;zrbarr;zrbbrk;zrbrace;zrbrack;zrbrke;zrbrksld;zrbrkslu;zrcaron;zrcedil;zrceil;zrcub;zrcy;zrdca;zrdldhar;zrdquo;zrdquor;zrdsh;zreal;zrealine;z realpart;zreals;zrect;Zregzreg;zrfisht;zrfloor;zrfr;zrhard;zrharu;zrharul;zrho;zrhov;z rightarrow;zrightarrowtail;zrightharpoondown;zrightharpoonup;zrightleftarrows;zrightleftharpoons;zrightrightarrows;zrightsquigarrow;zrightthreetimes;zring;z
risingdotseq;zrlarr;zrlhar;zrlm;zrmoust;z rmoustache;zrnmid;zroang;zroarr;zrobrk;zropar;zropf;zroplus;zrotimes;zrpar;zrpargt;z rppolint;zrrarr;zrsaquo;zrscr;zrsh;zrsqb;zrsquo;zrsquor;zrthree;zrtimes;zrtri;zrtrie;zrtrif;z rtriltri;zruluhar;zrx;zsacute;zsbquo;zsc;zscE;zscap;zscaron;zsccue;zsce;zscedil;zscirc;zscnE;zscnap;zscnsim;z scpolint;zscsim;zscy;zsdot;zsdotb;zsdote;zseArr;zsearhk;zsearr;zsearrow;Zsectzsect;zsemi;zseswar;z setminus;zsetmn;zsext;zsfr;zsfrown;zsharp;zshchcy;zshcy;z shortmid;zshortparallel;Zshyzshy;zsigma;zsigmaf;zsigmav;zsim;zsimdot;zsime;zsimeq;zsimg;zsimgE;zsiml;zsimlE;zsimne;zsimplus;zsimrarr;zslarr;zsmallsetminus;zsmashp;z smeparsl;zsmid;zsmile;zsmt;zsmte;zsmtes;zsoftcy;zsol;zsolb;zsolbar;zsopf;zspades;z
spadesuit;zspar;zsqcap;zsqcaps;zsqcup;zsqcups;zsqsub;zsqsube;z sqsubset;z sqsubseteq;zsqsup;zsqsupe;z sqsupset;z sqsupseteq;zsqu;zsquare;zsquarf;zsquf;zsrarr;zsscr;zssetmn;zssmile;zsstarf;zstar;zstarf;zstraightepsilon;z straightphi;zstrns;zsub;zsubE;zsubdot;zsube;zsubedot;zsubmult;zsubnE;zsubne;zsubplus;zsubrarr;zsubset;z subseteq;z
subseteqq;z
subsetneq;z subsetneqq;zsubsim;zsubsub;zsubsup;zsucc;z succapprox;z succcurlyeq;zsucceq;z succnapprox;z succneqq;z succnsim;zsuccsim;zsum;zsung;Zsup1zsup1;Zsup2zsup2;Zsup3zsup3;zsup;zsupE;zsupdot;zsupdsub;zsupe;zsupedot;zsuphsol;zsuphsub;zsuplarr;zsupmult;zsupnE;zsupne;zsupplus;zsupset;z supseteq;z
supseteqq;z
supsetneq;z supsetneqq;zsupsim;zsupsub;zsupsup;zswArr;zswarhk;zswarr;zswarrow;zswnwar;Zszligzszlig;ztarget;ztau;ztbrk;ztcaron;ztcedil;ztcy;ztdot;ztelrec;ztfr;zthere4;z
therefore;ztheta;z thetasym;zthetav;z thickapprox;z thicksim;zthinsp;zthkap;zthksim;Zthornzthorn;ztilde;�timesztimes;ztimesb;z timesbar;ztimesd;ztint;ztoea;ztop;ztopbot;ztopcir;ztopf;ztopfork;ztosa;ztprime;ztrade;z triangle;z
triangledown;z
triangleleft;ztrianglelefteq;z
triangleq;ztriangleright;ztrianglerighteq;ztridot;ztrie;z triminus;ztriplus;ztrisb;ztritime;z trpezium;ztscr;ztscy;ztshcy;ztstrok;ztwixt;ztwoheadleftarrow;ztwoheadrightarrow;zuArr;zuHar;Zuacutezuacute;zuarr;zubrcy;zubreve;Zucirczucirc;zucy;zudarr;zudblac;zudhar;zufisht;zufr;Zugravezugrave;zuharl;zuharr;zuhblk;zulcorn;z ulcorner;zulcrop;zultri;zumacr;Zumlzuml;zuogon;zuopf;zuparrow;z updownarrow;zupharpoonleft;zupharpoonright;zuplus;zupsi;zupsih;zupsilon;z upuparrows;zurcorn;z urcorner;zurcrop;zuring;zurtri;zuscr;zutdot;zutilde;zutri;zutrif;zuuarr;Zuumlzuuml;zuwangle;zvArr;zvBar;zvBarv;zvDash;zvangrt;z varepsilon;z varkappa;z varnothing;zvarphi;zvarpi;z
varpropto;zvarr;zvarrho;z varsigma;z
varsubsetneq;zvarsubsetneqq;z
varsupsetneq;zvarsupsetneqq;z vartheta;zvartriangleleft;zvartriangleright;zvcy;zvdash;zvee;zveebar;zveeeq;zvellip;zverbar;zvert;zvfr;zvltri;zvnsub;zvnsup;zvopf;zvprop;zvrtri;zvscr;zvsubnE;zvsubne;zvsupnE;zvsupne;zvzigzag;zwcirc;zwedbar;zwedge;zwedgeq;zweierp;zwfr;zwopf;zwp;zwr;zwreath;zwscr;zxcap;zxcirc;zxcup;zxdtri;zxfr;zxhArr;zxharr;zxi;zxlArr;zxlarr;zxmap;zxnis;zxodot;zxopf;zxoplus;zxotime;zxrArr;zxrarr;zxscr;zxsqcup;zxuplus;zxutri;zxvee;zxwedge;Zyacutezyacute;zyacy;zycirc;zycy;Zyenzyen;zyfr;zyicy;zyopf;zyscr;zyucy;Zyumlzyuml;zzacute;zzcaron;zzcy;zzdot;zzeetrf;zzeta;zzfr;zzhcy;zzigrarr;zzopf;zzscr;zzwj;zzwnj;u �� � � � � )"r �
� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � )ZDoctypeZ
CharactersZSpaceCharacters�StartTag�EndTag�EmptyTag�CommentZ
ParseErrorr r r c C s g | ]\}}||f�qS r2 r2 )r3 �k�vr2 r2 r6 r7 x s Zmathc @ s e Zd ZdS )�DataLossWarningN)�__name__�
__module__� __qualname__r2 r2 r2 r6 r | s r c @ s e Zd ZdS )�ReparseExceptionN)r r r r2 r2 r2 r6 r � s r )r r r! r" r# r$ ) rG rH rI rJ rK rL rM rN rO rP rQ rR rS rH rT rH rH rU rV rW rX rY rZ r[ r\ r] r^ r_ r` rH ra rb )0Z
__future__r r r �stringZEOF�EZ
namespaces� frozensetZscopingElementsZformattingElementsZspecialElementsZ htmlIntegrationPointElementsZ"mathmlTextIntegrationPointElementsZadjustSVGAttributesZadjustMathMLAttributesZadjustForeignAttributes�dict�itemsZunadjustForeignAttributesZspaceCharactersZtableInsertModeElementsZascii_lowercaseZasciiLowercaseZascii_uppercaseZasciiUppercaseZ
ascii_lettersZ asciiLettersZdigitsZ hexdigitsZ hexDigitsZasciiUpper2LowerZheadingElementsZ voidElementsZ
cdataElementsZrcdataElementsZbooleanAttributesZentitiesWindows1252Z xmlEntitiesZentitiesZreplacementCharactersZ
tokenTypesZ
tagTokenTypes�prefixes� UserWarningr � Exceptionr r2 r2 r2 r6 �<module> s<
pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.opt-1.pyc 0000644 00000122103 14751155150 0020461 0 ustar 00 3
���e$+ � @ s� d dl mZmZmZ d dlmZ d dlmZ ddl m
Z
ddl m Z ddl m Z m
Z
ddl mZmZmZ dd l mZmZ dd
l mZ dd lmZ dd lmZ ee �ZG d
d� de�ZdS )� )�absolute_import�division�unicode_literals)�unichr)�deque� )�spaceCharacters)�entities)� asciiLetters�asciiUpper2Lower)�digits� hexDigits�EOF)�
tokenTypes�
tagTokenTypes)�replacementCharacters)�HTMLInputStream)�Triec sd e Zd ZdZd�� fdd� Zdd� Zdd� Zd�d
d �Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Zd2d3� Zd4d5� Z d6d7� Z d8d9� Z d:d;� Z d<d=� Z d>d?� Z!d@dA� Z"dBdC� Z#dDdE� Z$dFdG� Z%dHdI� Z&dJdK� Z'dLdM� Z(dNdO� Z)dPdQ� Z*dRdS� Z+dTdU� Z,dVdW� Z-dXdY� Z.dZd[� Z/d\d]� Z0d^d_� Z1d`da� Z2dbdc� Z3ddde� Z4dfdg� Z5dhdi� Z6djdk� Z7dldm� Z8dndo� Z9dpdq� Z:drds� Z;dtdu� Z<dvdw� Z=dxdy� Z>dzd{� Z?d|d}� Z@d~d� ZAd�d�� ZBd�d�� ZCd�d�� ZDd�d�� ZEd�d�� ZFd�d�� ZGd�d�� ZHd�d�� ZId�d�� ZJd�d�� ZKd�d�� ZL� ZMS )��
HTMLTokenizera This class takes care of tokenizing HTML.
* self.currentToken
Holds the token that is currently being processed.
* self.state
Holds a reference to the method to be invoked... XXX
* self.stream
Points to HTMLInputStream object.
Nc sF t |f|�| _|| _d| _g | _| j| _d| _d | _t t
| �j � d S )NF) r �stream�parserZ
escapeFlagZ
lastFourChars� dataState�state�escape� currentToken�superr �__init__)�selfr r �kwargs)� __class__� � /usr/lib/python3.6/_tokenizer.pyr " s zHTMLTokenizer.__init__c c s\ t g �| _xL| j� rVx&| jjr:td | jjjd�d�V qW x| jrR| jj� V q>W q W dS )z� This is where the magic happens.
We do our usually processing through the states and when we have a token
to return we yield the token which pauses processing until the next token
is requested.
�
ParseErrorr )�type�dataN)r �
tokenQueuer r �errorsr �pop�popleft)r r r r! �__iter__1 s
zHTMLTokenizer.__iter__c % C s( t }d}|rt}d}g }| jj� }x(||krJ|tk rJ|j|� | jj� }q$W tdj|�|�}|tkr�t| }| j jt
d dd|id�� �nld| ko�d kn s�|d
kr�d }| j jt
d dd|id�� �n(d | ko�d
kn �s�d| ko�dkn �s�d| k�odkn �s�d| k�o4dkn �s�|t ddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d
g#�k�r�| j jt
d dd|id�� y t |�}W n> t
k
�r� |d6 }t d|d? B �t d7|d8@ B � }Y nX |d9k�r$| j jt
d d:d;�� | jj|� |S )<z�This function returns either U+FFFD or the character based on the
decimal or hexadecimal representation. It also discards ";" if present.
If not present self.tokenQueue.append({"type": tokenTypes["ParseError"]}) is invoked.
�
� � r" z$illegal-codepoint-for-numeric-entity� charAsInt)r# r$ �datavarsi � i�� i�� u �r � � � � � i� i� � i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i�� i i � i� �;z numeric-entity-without-semicolon)r# r$ )r r
r �charr �append�int�joinr r% r � frozenset�chr�
ValueError�unget) r ZisHexZallowed�radix� charStack�cr- r6 �vr r r! �consumeNumberEntityA s`
&
z!HTMLTokenizer.consumeNumberEntityFc
C s� d}| j j� g}|d tksB|d tddfksB|d k rV||d krV| j j|d � �n"|d dk�rd}|j| j j� � |d dkr�d }|j| j j� � |r�|d tks�| r�|d tkr�| j j|d � | j|�}n4| j jt
d
d d �� | j j|j � � dd
j |� }�njx8|d tk �rFt
jd
j |���s2P |j| j j� � �qW y$t
jd
j |d d� ��}t|�}W n tk
�r� d }Y nX |d k �rD|d dk�r�| j jt
d
dd �� |d dk�r|�r|| tk�s�|| tk�s�|| dk�r| j j|j � � dd
j |� }n.t| }| j j|j � � |d
j ||d � �7 }n4| j jt
d
dd �� | j j|j � � dd
j |� }|�r�| jd d d |7 < n*|tk�r�d}nd}| j jt
| |d �� d S ) N�&r �<�#Fr �x�XTr" zexpected-numeric-entity)r# r$ r, r5 z named-entity-without-semicolon�=zexpected-named-entityr$ �SpaceCharacters�
Characters���)rF rG rK rK rK rK rK rK rK rK )r r6 r r r= r7 r
r rB r% r r' r9 � entitiesTrieZhas_keys_with_prefixZlongest_prefix�len�KeyErrorr
r r ) r � allowedChar�
fromAttribute�outputr? �hexZ
entityNameZ entityLengthZ tokenTyper r r! �
consumeEntity� sf
zHTMLTokenizer.consumeEntityc C s | j |dd� dS )zIThis method replaces the need for "entityInAttributeValueState".
T)rO rP N)rS )r rO r r r! �processEntityInAttribute� s z&HTMLTokenizer.processEntityInAttributec C s� | j }|d tkrp|d jt�|d< |d td krp|d rR| jjtd dd�� |d rp| jjtd d d�� | jj|� | j| _d
S ) z�This method is a generic handler for emitting the tags. It also sets
the state to "data" because that's what's needed after a token has been
emitted.
r# �name�EndTagr$ r" zattributes-in-end-tag)r# r$ � selfClosingz self-closing-flag-on-end-tagN) r r � translater r r% r7 r r )r �tokenr r r! �emitCurrentToken� s
z HTMLTokenizer.emitCurrentTokenc C s� | j j� }|dkr | j| _n�|dkr.| j| _n�|dkrd| jjtd dd�� | jjtd dd�� n`|tkrpdS |t kr�| jjtd || j j
t d
� d�� n&| j j
d �}| jjtd || d�� d
S ) NrC rD � r" zinvalid-codepoint)r# r$ rJ FrI T)rC rD r[ ) r r6 �entityDataStater � tagOpenStater% r7 r r r �
charsUntil)r r$ �charsr r r! r � s&
zHTMLTokenizer.dataStatec C s | j � | j| _dS )NT)rS r r )r r r r! r\ s z HTMLTokenizer.entityDataStatec C s� | j j� }|dkr | j| _n�|dkr.| j| _n�|tkr:dS |dkrp| jjtd dd�� | jjtd d d�� nT|t kr�| jjtd
|| j j
t d � d�� n&| j j
d �}| jjtd || d�� d S )
NrC rD Fr[ r" zinvalid-codepoint)r# r$ rJ u �rI T)rC rD r[ ) r r6 �characterReferenceInRcdatar �rcdataLessThanSignStater r% r7 r r r^ )r r$ r_ r r r! � rcdataState s&
zHTMLTokenizer.rcdataStatec C s | j � | j| _dS )NT)rS rb r )r r r r! r` 1 s z(HTMLTokenizer.characterReferenceInRcdatac C s� | j j� }|dkr | j| _nh|dkrR| jjtd dd�� | jjtd dd�� n2|tkr^dS | j jd
�}| jjtd || d�� d S ) NrD r[ r" zinvalid-codepoint)r# r$ rJ u �FT)rD r[ ) r r6 �rawtextLessThanSignStater r% r7 r r r^ )r r$ r_ r r r! � rawtextState6 s
zHTMLTokenizer.rawtextStatec C s� | j j� }|dkr | j| _nh|dkrR| jjtd dd�� | jjtd dd�� n2|tkr^dS | j jd
�}| jjtd || d�� d S ) NrD r[ r" zinvalid-codepoint)r# r$ rJ u �FT)rD r[ ) r r6 �scriptDataLessThanSignStater r% r7 r r r^ )r r$ r_ r r r! �scriptDataStateH s
z HTMLTokenizer.scriptDataStatec C sr | j j� }|tkrdS |dkrL| jjtd dd�� | jjtd dd�� n"| jjtd || j jd� d�� dS ) NFr[ r" zinvalid-codepoint)r# r$ rJ u �T)r r6 r r% r7 r r^ )r r$ r r r! �plaintextStateZ s
z HTMLTokenizer.plaintextStatec C s | j j� }|dkr | j| _n�|dkr.| j| _n�|tkrVtd |g ddd�| _| j| _n�|dkr�| j j
td dd �� | j j
td
d d �� | j | _nt|d kr�| j j
td d
d �� | j j |� | j
| _n@| j j
td dd �� | j j
td
dd �� | j j |� | j | _dS )N�!�/ZStartTagF)r# rU r$ rW ZselfClosingAcknowledged�>r" z'expected-tag-name-but-got-right-bracket)r# r$ rJ z<>�?z'expected-tag-name-but-got-question-markzexpected-tag-namerD T)r r6 �markupDeclarationOpenStater �closeTagOpenStater
r r � tagNameStater% r7 r r= �bogusCommentState)r r$ r r r! r] i s6
zHTMLTokenizer.tagOpenStatec C s� | j j� }|tkr0td |g dd�| _| j| _n�|dkrX| jjtd dd�� | j | _nn|t
kr�| jjtd dd�� | jjtd d
d�� | j | _n0| jjtd d d |id
�� | j j |� | j | _dS )NrV F)r# rU r$ rW rj r" z*expected-closing-tag-but-got-right-bracket)r# r$ z expected-closing-tag-but-got-eofrJ z</z!expected-closing-tag-but-got-charr$ )r# r$ r. T)
r r6 r
r r rn r r% r7 r r r= ro )r r$ r r r! rm � s(
z HTMLTokenizer.closeTagOpenStatec C s� | j j� }|tkr | j| _n�|dkr.| j� n~|tkrV| jjt d dd�� | j
| _nV|dkrh| j | _nD|dkr�| jjt d dd�� | j d d 7 < n| j d |7 < d
S ) Nrj r" zeof-in-tag-name)r# r$ ri r[ zinvalid-codepointrU u �T)
r r6 r �beforeAttributeNameStater rZ r r% r7 r r �selfClosingStartTagStater )r r$ r r r! rn � s"
zHTMLTokenizer.tagNameStatec C sP | j j� }|dkr"d| _| j| _n*| jjtd dd�� | j j|� | j | _dS )Nri r, rJ rD )r# r$ T)
r r6 �temporaryBuffer�rcdataEndTagOpenStater r% r7 r r= rb )r r$ r r r! ra � s
z%HTMLTokenizer.rcdataLessThanSignStatec C sX | j j� }|tkr*| j|7 _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr �rcdataEndTagNameStater r% r7 r r= rb )r r$ r r r! rs � s
z#HTMLTokenizer.rcdataEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r �lowerrr r r6 r r rp r rq rZ r r
r% r7 r= rb )r � appropriater$ r r r! rt � s2
z#HTMLTokenizer.rcdataEndTagNameStatec C sP | j j� }|dkr"d| _| j| _n*| jjtd dd�� | j j|� | j | _dS )Nri r, rJ rD )r# r$ T)
r r6 rr �rawtextEndTagOpenStater r% r7 r r= rd )r r$ r r r! rc � s
z&HTMLTokenizer.rawtextLessThanSignStatec C sX | j j� }|tkr*| j|7 _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr �rawtextEndTagNameStater r% r7 r r= rd )r r$ r r r! rw � s
z$HTMLTokenizer.rawtextEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r ru rr r r6 r r rp r rq rZ r r
r% r7 r= rd )r rv r$ r r r! rx s2
z$HTMLTokenizer.rawtextEndTagNameStatec C sx | j j� }|dkr"d| _| j| _nR|dkrJ| jjtd dd�� | j| _n*| jjtd dd�� | j j |� | j
| _dS ) Nri r, rh rJ z<!)r# r$ rD T) r r6 rr �scriptDataEndTagOpenStater r% r7 r �scriptDataEscapeStartStater= rf )r r$ r r r! re s
z)HTMLTokenizer.scriptDataLessThanSignStatec C sX | j j� }|tkr*| j|7 _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr �scriptDataEndTagNameStater r% r7 r r= rf )r r$ r r r! ry , s
z'HTMLTokenizer.scriptDataEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r ru rr r r6 r r rp r rq rZ r r
r% r7 r= rf )r rv r$ r r r! r{ 7 s2
z'HTMLTokenizer.scriptDataEndTagNameStatec C sJ | j j� }|dkr2| jjtd dd�� | j| _n| j j|� | j| _dS )N�-rJ )r# r$ T) r r6 r% r7 r � scriptDataEscapeStartDashStater r= rf )r r$ r r r! rz S s
z(HTMLTokenizer.scriptDataEscapeStartStatec C sJ | j j� }|dkr2| jjtd dd�� | j| _n| j j|� | j| _dS )Nr| rJ )r# r$ T) r r6 r% r7 r � scriptDataEscapedDashDashStater r= rf )r r$ r r r! r} ] s
z,HTMLTokenizer.scriptDataEscapeStartDashStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrD| j| _nn|dkrz| jjtd dd�� | jjtd dd�� n8|tkr�| j | _n&| j j
d
�}| jjtd || d�� d S ) Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �T)rD r| r[ ) r r6 r% r7 r �scriptDataEscapedDashStater �"scriptDataEscapedLessThanSignStater r r^ )r r$ r_ r r r! �scriptDataEscapedStateg s"
z$HTMLTokenizer.scriptDataEscapedStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrD| j| _nn|dkr�| jjtd dd�� | jjtd dd�� | j| _n0|t kr�| j
| _n | jjtd |d�� | j| _d S )
Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �T) r r6 r% r7 r r~ r r� r� r r )r r$ r r r! r { s"
z(HTMLTokenizer.scriptDataEscapedDashStatec C s� | j j� }|dkr*| jjtd dd�� n�|dkr<| j| _n�|dkrd| jjtd dd�� | j| _nn|dkr�| jjtd dd�� | jjtd d d�� | j| _n0|t kr�| j
| _n | jjtd |d�� | j| _d
S ) Nr| rJ )r# r$ rD rj r[ r" zinvalid-codepointu �T) r r6 r% r7 r r� r rf r� r r )r r$ r r r! r~ � s&
z,HTMLTokenizer.scriptDataEscapedDashDashStatec C s� | j j� }|dkr"d| _| j| _n\|tkrT| jjtd d| d�� || _| j | _n*| jjtd dd�� | j j
|� | j | _dS )Nri r, rJ rD )r# r$ T) r r6 rr � scriptDataEscapedEndTagOpenStater r
r% r7 r � scriptDataDoubleEscapeStartStater= r� )r r$ r r r! r� � s
z0HTMLTokenizer.scriptDataEscapedLessThanSignStatec C sP | j j� }|tkr"|| _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr � scriptDataEscapedEndTagNameStater r% r7 r r= r� )r r$ r r r! r� � s
z.HTMLTokenizer.scriptDataEscapedEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r ru rr r r6 r r rp r rq rZ r r
r% r7 r= r� )r rv r$ r r r! r� � s2
z.HTMLTokenizer.scriptDataEscapedEndTagNameStatec C s� | j j� }|ttd�B krR| jjtd |d�� | jj� dkrH| j | _
q�| j | _
nB|t kr�| jjtd |d�� | j|7 _n| j j
|� | j | _
dS )Nri rj rJ )r# r$ �scriptT)ri rj )r r6 r r: r% r7 r rr ru � scriptDataDoubleEscapedStater r� r
r= )r r$ r r r! r� � s
z.HTMLTokenizer.scriptDataDoubleEscapeStartStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrZ| jjtd dd�� | j| _nt|dkr�| jjtd dd�� | jjtd dd�� n>|tkr�| jjtd d d�� | j | _n| jjtd |d�� d
S ) Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �zeof-in-script-in-scriptT)
r r6 r% r7 r � scriptDataDoubleEscapedDashStater �(scriptDataDoubleEscapedLessThanSignStater r )r r$ r r r! r� � s$
z*HTMLTokenizer.scriptDataDoubleEscapedStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrZ| jjtd dd�� | j| _n�|dkr�| jjtd dd�� | jjtd dd�� | j| _nF|t kr�| jjtd d d�� | j
| _n | jjtd |d�� | j| _d
S ) Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �zeof-in-script-in-scriptT) r r6 r% r7 r �$scriptDataDoubleEscapedDashDashStater r� r� r r )r r$ r r r! r� s(
z.HTMLTokenizer.scriptDataDoubleEscapedDashStatec C s | j j� }|dkr*| jjtd dd�� n�|dkrR| jjtd dd�� | j| _n�|dkrz| jjtd dd�� | j| _n�|dkr�| jjtd dd�� | jjtd d d�� | j| _nF|t kr�| jjtd d
d�� | j
| _n | jjtd |d�� | j| _d S ) Nr| rJ )r# r$ rD rj r[ r" zinvalid-codepointu �zeof-in-script-in-scriptT) r r6 r% r7 r r� r rf r� r r )r r$ r r r! r� s,
z2HTMLTokenizer.scriptDataDoubleEscapedDashDashStatec C sP | j j� }|dkr8| jjtd dd�� d| _| j| _n| j j|� | j | _dS )Nri rJ )r# r$ r, T)
r r6 r% r7 r rr � scriptDataDoubleEscapeEndStater r= r� )r r$ r r r! r� 0 s
z6HTMLTokenizer.scriptDataDoubleEscapedLessThanSignStatec C s� | j j� }|ttd�B krR| jjtd |d�� | jj� dkrH| j | _
q�| j | _
nB|t kr�| jjtd |d�� | j|7 _n| j j
|� | j | _
dS )Nri rj rJ )r# r$ r� T)ri rj )r r6 r r: r% r7 r rr ru r� r r� r
r= )r r$ r r r! r� ; s
z,HTMLTokenizer.scriptDataDoubleEscapeEndStatec C s0 | j j� }|tkr$| j jtd� �n|tkrJ| jd j|dg� | j| _n�|dkr\| j � n�|dkrn| j
| _n�|dkr�| j jt d
d d �� | jd j|dg� | j| _n�|d
kr�| j jt d
dd �� | jd jddg� | j| _nF|t
k�r| j jt d
dd �� | j| _n | jd j|dg� | j| _dS )NTr$ r, rj ri �'�"rH rD r" z#invalid-character-in-attribute-name)r# r$ r[ zinvalid-codepointu �z#expected-attribute-name-but-got-eof)r� r� rH rD )r r6 r r^ r
r r7 �attributeNameStater rZ rq r% r r r )r r$ r r r! rp K s6
z&HTMLTokenizer.beforeAttributeNameStatec C s� | j j� }d}d}|dkr&| j| _�n0|tkr^| jd d d || j jtd� 7 < d}� n�|dkrld}n�|tkr~| j| _n�|dkr�| j | _n�|d kr�| j
j t d
d d �� | jd d d d
7 < d}n�|dk�r| j
j t d
dd �� | jd d d |7 < d}nH|t
k�r8| j
j t d
dd �� | j| _n | jd d d |7 < d}|�r�| jd d d jt�| jd d d< xP| jd d d� D ]:\}}| jd d d |k�r�| j
j t d
dd �� P �q�W |�r�| j� dS ) NTFrH r$ r r rj ri r[ r" zinvalid-codepoint)r# r$ u �r� r� rD z#invalid-character-in-attribute-namezeof-in-attribute-namezduplicate-attributerK rK )r� r� rD rK rK rK rK rK rK )r r6 �beforeAttributeValueStater r
r r^ r �afterAttributeNameStaterq r% r7 r r r rX r rZ )r r$ ZleavingThisStateZ emitTokenrU �_r r r! r� i sR
&
z HTMLTokenizer.attributeNameStatec C sF | j j� }|tkr$| j jtd� �n |dkr8| j| _�n
|dkrJ| j� n�|tkrp| jd j |dg� | j
| _n�|dkr�| j | _n�|dkr�| j j t
d d d
�� | jd j d dg� | j
| _n�|dk� r�| j j t
d dd
�� | jd j |dg� | j
| _nF|tk�r&| j j t
d dd
�� | j| _n | jd j |dg� | j
| _dS )NTrH rj r$ r, ri r[ r" zinvalid-codepoint)r# r$ u �r� r� rD z&invalid-character-after-attribute-namez expected-end-of-tag-but-got-eof)r� r� rD )r r6 r r^ r� r rZ r
r r7 r� rq r% r r r )r r$ r r r! r� � s:
z%HTMLTokenizer.afterAttributeNameStatec C sj | j j� }|tkr$| j jtd� �nB|dkr8| j| _�n.|dkrX| j| _| j j|� �n|dkrl| j| _� n�|dkr�| j j
t d dd�� | j � n�|d kr�| j j
t d d
d�� | j
d d d d
7 < | j| _n�|dk�r| j j
t d dd�� | j
d d d |7 < | j| _nL|tk�rD| j j
t d dd�� | j| _n"| j
d d d |7 < | j| _dS )NTr� rC r� rj r" z.expected-attribute-value-but-got-right-bracket)r# r$ r[ zinvalid-codepointr$ r u �rH rD �`z"equals-in-unquoted-attribute-valuez$expected-attribute-value-but-got-eofrK )rH rD r� rK rK )r r6 r r^ � attributeValueDoubleQuotedStater �attributeValueUnQuotedStater= � attributeValueSingleQuotedStater% r7 r rZ r r r )r r$ r r r! r� � s>
z'HTMLTokenizer.beforeAttributeValueStatec C s� | j j� }|dkr | j| _n�|dkr0| jd� n�|dkrj| jjtd dd�� | jd d d d 7 < nN|t kr�| jjtd d
d�� | j
| _n&| jd d
d || j j d� 7 < d S )Nr� rC r[ r" zinvalid-codepoint)r# r$ r$ r u �z#eof-in-attribute-value-double-quoteTrK rK )r� rC r[ ) r r6 �afterAttributeValueStater rT r% r7 r r r r r^ )r r$ r r r! r� � s
z-HTMLTokenizer.attributeValueDoubleQuotedStatec C s� | j j� }|dkr | j| _n�|dkr0| jd� n�|dkrj| jjtd dd�� | jd d d d 7 < nN|t kr�| jjtd d
d�� | j
| _n&| jd d
d || j j d� 7 < d S )Nr� rC r[ r" zinvalid-codepoint)r# r$ r$ r u �z#eof-in-attribute-value-single-quoteTrK rK )r� rC r[ ) r r6 r� r rT r% r7 r r r r r^ )r r$ r r r! r� � s
z-HTMLTokenizer.attributeValueSingleQuotedStatec C s | j j� }|tkr | j| _� n�|dkr2| jd� n�|dkrD| j� n�|dkr~| jjt d d d
�� | j
d d d |7 < n�|d
kr�| jjt d dd
�� | j
d d d d7 < nV|t kr�| jjt d dd
�� | j | _n.| j
d d d || j j
td�tB � 7 < dS )NrC rj r� r� rH rD r� r" z0unexpected-character-in-unquoted-attribute-value)r# r$ r$ r r[ zinvalid-codepointu �z eof-in-attribute-value-no-quotesT)r� r� rH rD r� rK rK rK )rC rj r� r� rH rD r� r[ )r r6 r rp r rT rZ r% r7 r r r r r^ r: )r r$ r r r! r� s,
z)HTMLTokenizer.attributeValueUnQuotedStatec C s� | j j� }|tkr | j| _n�|dkr.| j� np|dkr@| j| _n^|tkrt| jj t
d dd�� | j j |� | j | _n*| jj t
d dd�� | j j |� | j| _dS )Nrj ri r" z$unexpected-EOF-after-attribute-value)r# r$ z*unexpected-character-after-attribute-valueT)
r r6 r rp r rZ rq r r% r7 r r= r )r r$ r r r! r� s"
z&HTMLTokenizer.afterAttributeValueStatec C s� | j j� }|dkr&d| jd< | j� n^|tkrZ| jjtd dd�� | j j|� | j | _
n*| jjtd dd�� | j j|� | j | _
dS )Nrj TrW r" z#unexpected-EOF-after-solidus-in-tag)r# r$ z)unexpected-character-after-solidus-in-tag) r r6 r rZ r r% r7 r r= r r rp )r r$ r r r! rq 4 s
z&HTMLTokenizer.selfClosingStartTagStatec C sD | j jd�}|jdd�}| jjtd |d�� | j j� | j| _dS )Nrj r[ u ��Comment)r# r$ T) r r^ �replacer% r7 r r6 r r )r r$ r r r! ro F s
z HTMLTokenizer.bogusCommentStatec C s� | j j� g}|d dkrT|j| j j� � |d dkrPtd dd�| _| j| _dS � n�|d d kr�d}x.d&D ]&}|j| j j� � |d' |krjd}P qjW |r�td dd d dd�| _| j| _dS n�|d( dk�rH| jd k �rH| jj j
�rH| jj j
d) j | jj j k�rHd}x2d*D ]*}|j| j j� � |d+ |k�rd}P �qW |�rH| j
| _dS | jjtd dd�� x |�rz| j j|j� � �q`W | j| _dS ),Nr r| r� r, )r# r$ T�d�D�o�Or@ �C�t�T�y�Y�p�P�e�EFZDoctype)r# rU �publicId�systemId�correct�[�Ar" zexpected-dashes-or-doctyperK rK rK )r� r� �r� r� �r@ r� �r� r� �r� r� �r� r� �r� r� )r� r� r� r� r� r� rK rK rK )r� r� r� r� r� r� rK )r r6 r7 r r �commentStartStater � doctypeStater ZtreeZ openElements� namespaceZdefaultNamespace�cdataSectionStater% r= r' ro )r r? �matched�expectedr r r! rl U sR
z(HTMLTokenizer.markupDeclarationOpenStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� | jj| j� | j| _nP|t kr�| jjtd d
d�� | jj| j� | j| _n| jd |7 < | j
| _d S ) Nr| r[ r" zinvalid-codepoint)r# r$ r$ u �rj zincorrect-commentzeof-in-commentT) r r6 �commentStartDashStater r% r7 r r r r � commentState)r r$ r r r! r� � s(
z HTMLTokenizer.commentStartStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� | jj| j� | j| _nT|t kr�| jjtd d
d�� | jj| j� | j| _n | jd d| 7 < | j
| _d S ) Nr| r[ r" zinvalid-codepoint)r# r$ r$ u -�rj zincorrect-commentzeof-in-commentT) r r6 �commentEndStater r% r7 r r r r r� )r r$ r r r! r� � s(
z#HTMLTokenizer.commentStartDashStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < nT|tkr�| jjtd dd�� | jj| j� | j | _n | jd || j j
d
� 7 < d S ) Nr| r[ r" zinvalid-codepoint)r# r$ r$ u �zeof-in-commentT)r| r[ ) r r6 �commentEndDashStater r% r7 r r r r r^ )r r$ r r r! r� � s
zHTMLTokenizer.commentStatec C s� | j j� }|dkr | j| _n�|dkrV| jjtd dd�� | jd d7 < | j| _nT|t kr�| jjtd dd�� | jj| j� | j
| _n | jd d| 7 < | j| _d S )
Nr| r[ r" zinvalid-codepoint)r# r$ r$ u -�zeof-in-comment-end-dashT) r r6 r� r r% r7 r r r� r r )r r$ r r r! r� � s
z!HTMLTokenizer.commentEndDashStatec C s, | j j� }|dkr*| jj| j� | j| _n�|dkrd| jjtd dd�� | jd d7 < | j| _n�|dkr�| jjtd d d�� | j | _n�|d
kr�| jjtd d d�� | jd |7 < nj|t
kr�| jjtd d d�� | jj| j� | j| _n4| jjtd d
d�� | jd d| 7 < | j| _dS )Nrj r[ r" zinvalid-codepoint)r# r$ r$ u --�rh z,unexpected-bang-after-double-dash-in-commentr| z,unexpected-dash-after-double-dash-in-commentzeof-in-comment-double-dashzunexpected-char-in-commentz--T) r r6 r% r7 r r r r r� �commentEndBangStater )r r$ r r r! r� � s6
z HTMLTokenizer.commentEndStatec C s� | j j� }|dkr*| jj| j� | j| _n�|dkrN| jd d7 < | j| _n�|dkr�| jjtd dd�� | jd d 7 < | j | _nT|t
kr�| jjtd d
d�� | jj| j� | j| _n | jd d| 7 < | j | _d S ) Nrj r| r$ z--!r[ r" zinvalid-codepoint)r# r$ u --!�z eof-in-comment-end-bang-stateT) r r6 r% r7 r r r r� r r� r )r r$ r r r! r� � s(
z!HTMLTokenizer.commentEndBangStatec C s� | j j� }|tkr | j| _nj|tkr\| jjtd dd�� d| j d< | jj| j � | j
| _n*| jjtd dd�� | j j |� | j| _dS )Nr" z!expected-doctype-name-but-got-eof)r# r$ Fr� zneed-space-after-doctypeT) r r6 r �beforeDoctypeNameStater r r% r7 r r r r= )r r$ r r r! r� s
zHTMLTokenizer.doctypeStatec C s� | j j� }|tkrn�|dkrT| jjtd dd�� d| jd< | jj| j� | j| _n�|dkr�| jjtd dd�� d | jd
< | j | _nR|t
kr�| jjtd d d�� d| jd< | jj| j� | j| _n|| jd
< | j | _d S )
Nrj r" z+expected-doctype-name-but-got-right-bracket)r# r$ Fr� r[ zinvalid-codepointu �rU z!expected-doctype-name-but-got-eofT) r r6 r r% r7 r r r r �doctypeNameStater )r r$ r r r! r� s.
z$HTMLTokenizer.beforeDoctypeNameStatec C s | j j� }|tkr2| jd jt�| jd< | j| _n�|dkrh| jd jt�| jd< | jj | j� | j
| _n�|dkr�| jj t d dd�� | jd d7 < | j | _nh|t
kr�| jj t d dd�� d | jd
< | jd jt�| jd< | jj | j� | j
| _n| jd |7 < d S ) NrU rj r[ r" zinvalid-codepoint)r# r$ u �zeof-in-doctype-nameFr� T)r r6 r r rX r �afterDoctypeNameStater r% r7 r r r� r )r r$ r r r! r� 6 s,
z HTMLTokenizer.doctypeNameStatec C sR | j j� }|tkr�n8|dkr8| jj| j� | j| _�n|tkr�d| jd< | j j |� | jjt
d dd�� | jj| j� | j| _� n�|d!kr�d }x$d'D ] }| j j� }||kr�d}P q�W |r�| j | _d S nJ|d(k�rd }x(d.D ] }| j j� }||k� r�d}P � q�W |�r| j | _d S | j j |� | jjt
d d d |id �� d| jd< | j
| _d S )/Nrj Fr� r" zeof-in-doctype)r# r$ r� r� T�u�U�b�B�l�L�i�Ir@ r� �s�Sr� r� r� r� r� r� �m�Mz*expected-space-or-right-bracket-in-doctyper$ )r# r$ r. )r� r� �r� r� �r� r� �r� r� �r� r� �r@ r� )r� r� r� r� r� )r� r� �r� r� �r� r� �r� r� �r� r� �r� r� )r� r� r� r� r� )r r6 r r% r7 r r r r r= r � afterDoctypePublicKeywordState� afterDoctypeSystemKeywordState�bogusDoctypeState)r r$ r� r� r r r! r� O sT
z#HTMLTokenizer.afterDoctypeNameStatec C s� | j j� }|tkr | j| _n�|d
krP| jjtd dd�� | j j|� | j| _nT|t kr�| jjtd dd�� d| j
d< | jj| j
� | j | _n| j j|� | j| _d S ) Nr� r� r" zunexpected-char-in-doctype)r# r$ zeof-in-doctypeFr� T)r� r� ) r r6 r �"beforeDoctypePublicIdentifierStater r% r7 r r= r r r )r r$ r r r! r� � s"
z,HTMLTokenizer.afterDoctypePublicKeywordStatec C s� | j j� }|tkrn�|dkr0d| jd< | j| _n�|dkrLd| jd< | j| _n�|dkr�| jjt d dd�� d | jd
< | jj| j� | j
| _nh|t kr�| jjt d d d�� d | jd
< | jj| j� | j
| _n(| jjt d d d�� d | jd
< | j | _d
S )Nr� r, r� r� rj r" zunexpected-end-of-doctype)r# r$ Fr� zeof-in-doctypezunexpected-char-in-doctypeT)
r r6 r r �(doctypePublicIdentifierDoubleQuotedStater �(doctypePublicIdentifierSingleQuotedStater% r7 r r r r� )r r$ r r r! r� � s4
z0HTMLTokenizer.beforeDoctypePublicIdentifierStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 �!afterDoctypePublicIdentifierStater r% r7 r r r r )r r$ r r r! r� � s*
z6HTMLTokenizer.doctypePublicIdentifierDoubleQuotedStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 r� r r% r7 r r r r )r r$ r r r! r� � s*
z6HTMLTokenizer.doctypePublicIdentifierSingleQuotedStatec C s | j j� }|tkr | j| _n�|dkr<| jj| j� | j| _n�|dkrn| jjt d dd�� d| jd< | j
| _n�|dkr�| jjt d dd�� d| jd< | j | _nh|t kr�| jjt d d d�� d
| jd < | jj| j� | j| _n(| jjt d dd�� d
| jd < | j
| _d S )
Nrj r� r" zunexpected-char-in-doctype)r# r$ r, r� r� zeof-in-doctypeFr� T)r r6 r �-betweenDoctypePublicAndSystemIdentifiersStater r% r7 r r r �(doctypeSystemIdentifierDoubleQuotedState�(doctypeSystemIdentifierSingleQuotedStater r� )r r$ r r r! r� � s6
z/HTMLTokenizer.afterDoctypePublicIdentifierStatec C s� | j j� }|tkrn�|dkr4| jj| j� | j| _n�|dkrPd| jd< | j| _n�|dkrld| jd< | j | _nh|t
kr�| jjt d dd�� d | jd
< | jj| j� | j| _n(| jjt d d d�� d | jd
< | j | _d S )
Nrj r� r, r� r� r" zeof-in-doctype)r# r$ Fr� zunexpected-char-in-doctypeT)
r r6 r r% r7 r r r r� r� r r r� )r r$ r r r! r� s.
z;HTMLTokenizer.betweenDoctypePublicAndSystemIdentifiersStatec C s� | j j� }|tkr | j| _n�|d
krP| jjtd dd�� | j j|� | j| _nT|t kr�| jjtd dd�� d| j
d< | jj| j
� | j | _n| j j|� | j| _d S ) Nr� r� r" zunexpected-char-in-doctype)r# r$ zeof-in-doctypeFr� T)r� r� ) r r6 r �"beforeDoctypeSystemIdentifierStater r% r7 r r= r r r )r r$ r r r! r� s"
z,HTMLTokenizer.afterDoctypeSystemKeywordStatec C s� | j j� }|tkrn�|dkr0d| jd< | j| _n�|dkrLd| jd< | j| _n�|dkr�| jjt d dd�� d | jd
< | jj| j� | j
| _nh|t kr�| jjt d d d�� d | jd
< | jj| j� | j
| _n(| jjt d dd�� d | jd
< | j | _d S )
Nr� r, r� r� rj r" zunexpected-char-in-doctype)r# r$ Fr� zeof-in-doctypeT)
r r6 r r r� r r� r% r7 r r r r� )r r$ r r r! r� / s4
z0HTMLTokenizer.beforeDoctypeSystemIdentifierStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 �!afterDoctypeSystemIdentifierStater r% r7 r r r r )r r$ r r r! r� L s*
z6HTMLTokenizer.doctypeSystemIdentifierDoubleQuotedStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 r� r r% r7 r r r r )r r$ r r r! r� d s*
z6HTMLTokenizer.doctypeSystemIdentifierSingleQuotedStatec C s� | j j� }|tkrn~|dkr4| jj| j� | j| _n^|tkrt| jjt d dd�� d| jd< | jj| j� | j| _n | jjt d dd�� | j
| _dS ) Nrj r" zeof-in-doctype)r# r$ Fr� zunexpected-char-in-doctypeT) r r6 r r% r7 r r r r r r� )r r$ r r r! r� | s
z/HTMLTokenizer.afterDoctypeSystemIdentifierStatec C sZ | j j� }|dkr*| jj| j� | j| _n,|tkrV| j j|� | jj| j� | j| _n dS )Nrj T) r r6 r% r7 r r r r r= )r r$ r r r! r� � s
z HTMLTokenizer.bogusDoctypeStatec C s� g }xt|j | jjd�� |j | jjd�� | jj� }|tkr@P q|d dd � dkrl|d d d� |d< P q|j |� qW dj|�}|jd�}|dkr�x&t|�D ]}| jj t d d
d �� q�W |j
dd �}|r�| jj t d
|d �� | j | _ dS )N�]rj r � z]]r, r[ r r" zinvalid-codepoint)r# r$ u �rJ TrK ���rK r� rK )
r7 r r^ r6 r r9 �count�ranger% r r� r r )r r$ r6 Z nullCountr� r r r! r� � s.
z HTMLTokenizer.cdataSectionState)N)NF)N�__name__�
__module__� __qualname__�__doc__r r) rB rS rT rZ r r\ rb r` rd rf rg r] rm rn ra rs rt rc rw rx re ry r{ rz r} r� r r~ r� r� r� r� r� r� r� r� r� rp r� r� r� r� r� r� r� rq ro rl r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__r r )r r! r s� H
P #
6 "- 3 r N)Z
__future__r r r Zpip._vendor.sixr r; � collectionsr Z constantsr r r
r r r
r r r r Z _inputstreamr Z_trier rL �objectr r r r r! �<module> s pip/_vendor/html5lib/__pycache__/serializer.cpython-36.pyc 0000644 00000022106 14751155150 0017524 0 ustar 00 3
���ea7 � @ s� d dl mZmZmZ d dlmZ d dlZd dlmZm Z ddl
m Z m Z m
Z
ddl
mZmZmZ ddlmZmZ d d lmZ d
je
�d Zejd e d
�Zejd e d �Zi Ze d�dkZ x�e ej � �D ]p\Z Z!e r�e e!�dks�e r�e e!�dkr�q�e!dkr�e e!�dk�rej"e!�Z!ne#e!�Z!e!ek�s4e j$� r�e ee!< q�W dd� Z%ede%� d dd�Z&G dd� de'�Z(G dd� de)�Z*dS ) � )�absolute_import�division�unicode_literals)� text_typeN)�register_error�xmlcharrefreplace_errors� )� voidElements�booleanAttributes�spaceCharacters)�rcdataElements�entities� xmlEntities)� treewalkers�_utils)�escape� z"'=<>`�[�]u_
/` ᠏
]u � �&c
C s" t | ttf��rg }g }d}x�t| j| j| j� �D ]n\}}|rFd}q4|| j }tj| j|t | j|d g�� �r�tj
| j||d � �}d}nt |�}|j |� q4W x^|D ]V}t
j|�} | r�|j d� |j | � | jd�s�|j d� q�|j dt|�dd � � q�W dj|�| jfS t| �S d S )NFr Tr �;z&#x%s;r )�
isinstance�UnicodeEncodeError�UnicodeTranslateError� enumerate�object�start�endr ZisSurrogatePair�min�surrogatePairToCodepoint�ord�append�_encode_entity_map�get�endswith�hex�joinr )
�exc�resZ
codepoints�skip�i�c�indexZ codepointZcp�e� r/ � /usr/lib/python3.6/serializer.py�htmlentityreplace_errors* s0
"
r1 �htmlentityreplace�etreec K s$ t j|�}tf |�}|j|| �|�S )N)r Z
getTreeWalker�HTMLSerializer�render)�inputZtree�encodingZserializer_optsZwalker�sr/ r/ r0 � serializeJ s
r9 c @ s~ e Zd ZdZdZdZdZdZdZdZ dZ
dZ dZ dZ
dZdZdZd!Zdd� Zdd� Zdd� Zd"dd�Zd#d d �Zd$d d �ZdS )%r4 �legacy�"TF�quote_attr_values�
quote_char�use_best_quote_char�omit_optional_tags�minimize_boolean_attributes�use_trailing_solidus� space_before_trailing_solidus�escape_lt_in_attrs�
escape_rcdata�resolve_entities�alphabetical_attributes�inject_meta_charset�strip_whitespace�sanitizec K sz t |�t | j� }t|�dkr2tdtt|�� ��d|kr@d| _x(| jD ] }t| ||j|t | |��� qHW g | _
d| _ dS )a6 Initialize HTMLSerializer.
Keyword options (default given first unless specified) include:
inject_meta_charset=True|False
Whether it insert a meta element to define the character set of the
document.
quote_attr_values="legacy"|"spec"|"always"
Whether to quote attribute values that don't require quoting
per legacy browser behaviour, when required by the standard, or always.
quote_char=u'"'|u"'"
Use given quote character for attribute quoting. Default is to
use double quote unless attribute value contains a double quote,
in which case single quotes are used instead.
escape_lt_in_attrs=False|True
Whether to escape < in attribute values.
escape_rcdata=False|True
Whether to escape characters that need to be escaped within normal
elements within rcdata elements such as style.
resolve_entities=True|False
Whether to resolve named character entities that appear in the
source tree. The XML predefined entities < > & " '
are unaffected by this setting.
strip_whitespace=False|True
Whether to remove semantically meaningless whitespace. (This
compresses all whitespace to a single space except within pre.)
minimize_boolean_attributes=True|False
Shortens boolean attributes to give just the attribute value,
for example <input disabled="disabled"> becomes <input disabled>.
use_trailing_solidus=False|True
Includes a close-tag slash at the end of the start tag of void
elements (empty elements whose end tag is forbidden). E.g. <hr/>.
space_before_trailing_solidus=True|False
Places a space immediately before the closing slash in a tag
using a trailing solidus. E.g. <hr />. Requires use_trailing_solidus.
sanitize=False|True
Strip all unsafe or unknown constructs from output.
See `html5lib user documentation`_
omit_optional_tags=True|False
Omit start/end tags that are optional.
alphabetical_attributes=False|True
Reorder attributes to be in alphabetical order.
.. _html5lib user documentation: http://code.google.com/p/html5lib/wiki/UserDocumentation
r z2__init__() got an unexpected keyword argument '%s'r= FN) � frozenset�options�len� TypeError�next�iterr> �setattrr$ �getattr�errors�strict)�self�kwargsZunexpected_args�attrr/ r/ r0 �__init__p s . zHTMLSerializer.__init__c C s* t |t�st�| jr"|j| jd�S |S d S )Nr2 )r r �AssertionErrorr7 �encode)rT �stringr/ r/ r0 rY � s zHTMLSerializer.encodec C s* t |t�st�| jr"|j| jd�S |S d S )NrS )r r rX r7 rY )rT rZ r/ r/ r0 � encodeStrict� s zHTMLSerializer.encodeStrictNc c s� || _ d}g | _|r0| jr0ddlm} |||�}| jrJddlm} ||�}| jrdddlm} ||�}| j r~ddl
m} ||�}| j r�ddl m} ||�}�xR|D �]H}|d }|dk�r`d|d }|d r�|d |d 7 }n|d
r�|d 7 }|d
�rJ|d
j
d �d
k�r0|d
j
d�d
k�r*| jd� d}nd }|d||d
|f 7 }|d7 }| j|�V q�|d5k�r�|dk�sz|�r�|�r�|d j
d�d
k�r�| jd� | j|d �V n| jt|d ��V q�|d6k�r�|d } | jd| �V | tk�r| j �rd}n|�r| jd� �x�|d j� D �]�\\}
} } | }
| }| jd �V | j|
�V | j �s�|
tj| t� �k�r"|
tjd t� �k�r"| jd �V | jd k�s�t|�d
k�r�d}n@| jd k�r�tj |�d k }n$| jd!k�r�t j |�d k }nt d"��|j d#d$�}| j �r|j d%d&�}|�r�| j!}| j"�rTd|k�r<d |k�r<d }nd |k�rTd|k�rTd}|dk�rl|j dd'�}n |j d d(�}| j|�V | j|�V | j|�V n | j|�V �q"W | t#k�r�| j$�r�| j%�r�| jd)�V n | jd*�V | jd�V q�|d+k�r6|d } | tk�rd}n|�r$| jd� | jd,| �V q�|d-k�rx|d }|j
d.�d
k�rb| jd/� | jd0|d �V q�|d1k�r�|d } | d2 }|t&k�r�| jd3| � | j'�r�|t(k�r�t&| }nd4| }| j|�V q�| j|d � q�W d S )7NFr )�Filter�typeZDoctypez <!DOCTYPE %s�nameZpublicIdz PUBLIC "%s"ZsystemIdz SYSTEMr; r �'zASystem identifer contains both single and double quote charactersz %s%s%s�>�
Characters�SpaceCharacters�dataz</zUnexpected </ in CDATA�StartTag�EmptyTagz<%sTz+Unexpected child element of a CDATA element� r �=�always�specr: z?quote_attr_values must be one of: 'always', 'spec', or 'legacy'r z&�<z<z'z"z /�/ZEndTagz</%s>�Commentz--zComment contains --z <!--%s-->ZEntityr zEntity %s not recognizedz&%s;)ra rb )rd re ))r7 rR rG Zfilters.inject_meta_charsetr\ rF Z filters.alphabeticalattributesrH Zfilters.whitespacerI Zfilters.sanitizerr? Zfilters.optionaltags�find�serializeErrorr[ rY r r rD �itemsr@ r
r$ �tupler< rL �_quoteAttributeSpec�search�_quoteAttributeLegacy�
ValueError�replacerC r= r> r rA rB r
rE r )rT �
treewalkerr7 Zin_cdatar\ �tokenr] Zdoctyper= r^ �_Z attr_nameZ
attr_value�k�vZ
quote_attrrc �keyr/ r/ r0 r9 � s�
zHTMLSerializer.serializec C s2 |rdj t| j||���S dj t| j|���S d S )N� r )r' �listr9 )rT rv r7 r/ r/ r0 r5 ? s zHTMLSerializer.render�XXX ERROR MESSAGE NEEDEDc C s | j j|� | jrt�d S )N)rR r" rS �SerializeError)rT rc r/ r/ r0 rn E s z HTMLSerializer.serializeError)r< r= r> r? r@ rA rB rC rD rE rF rG rH rI )N)N)r~ )�__name__�
__module__� __qualname__r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rK rW rY r[ r9 r5 rn r/ r/ r/ r0 r4 Q s6 8
r4 c @ s e Zd ZdZdS )r zError in serialized treeN)r� r� r� �__doc__r/ r/ r/ r0 r L s r )r3 N)+Z
__future__r r r Zpip._vendor.sixr �re�codecsr r Z constantsr r
r r r
r r r r Zxml.sax.saxutilsr r' Z_quoteAttributeSpecChars�compilerq rs r# rL Z_is_ucs4r} ro ry rz r r! �islowerr1 r9 r r4 � Exceptionr r/ r/ r/ r0 �<module> s:
| pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.pyc 0000644 00000122141 14751155150 0017524 0 ustar 00 3
���e$+ � @ s� d dl mZmZmZ d dlmZ d dlmZ ddl m
Z
ddl m Z ddl m Z m
Z
ddl mZmZmZ dd l mZmZ dd
l mZ dd lmZ dd lmZ ee �ZG d
d� de�ZdS )� )�absolute_import�division�unicode_literals)�unichr)�deque� )�spaceCharacters)�entities)� asciiLetters�asciiUpper2Lower)�digits� hexDigits�EOF)�
tokenTypes�
tagTokenTypes)�replacementCharacters)�HTMLInputStream)�Triec sd e Zd ZdZd�� fdd� Zdd� Zdd� Zd�d
d �Zd d
� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zd d � Zd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd*d+� Zd,d-� Zd.d/� Zd0d1� Zd2d3� Zd4d5� Z d6d7� Z d8d9� Z d:d;� Z d<d=� Z d>d?� Z!d@dA� Z"dBdC� Z#dDdE� Z$dFdG� Z%dHdI� Z&dJdK� Z'dLdM� Z(dNdO� Z)dPdQ� Z*dRdS� Z+dTdU� Z,dVdW� Z-dXdY� Z.dZd[� Z/d\d]� Z0d^d_� Z1d`da� Z2dbdc� Z3ddde� Z4dfdg� Z5dhdi� Z6djdk� Z7dldm� Z8dndo� Z9dpdq� Z:drds� Z;dtdu� Z<dvdw� Z=dxdy� Z>dzd{� Z?d|d}� Z@d~d� ZAd�d�� ZBd�d�� ZCd�d�� ZDd�d�� ZEd�d�� ZFd�d�� ZGd�d�� ZHd�d�� ZId�d�� ZJd�d�� ZKd�d�� ZL� ZMS )��
HTMLTokenizera This class takes care of tokenizing HTML.
* self.currentToken
Holds the token that is currently being processed.
* self.state
Holds a reference to the method to be invoked... XXX
* self.stream
Points to HTMLInputStream object.
Nc sF t |f|�| _|| _d| _g | _| j| _d| _d | _t t
| �j � d S )NF) r �stream�parserZ
escapeFlagZ
lastFourChars� dataState�state�escape� currentToken�superr �__init__)�selfr r �kwargs)� __class__� � /usr/lib/python3.6/_tokenizer.pyr " s zHTMLTokenizer.__init__c c s\ t g �| _xL| j� rVx&| jjr:td | jjjd�d�V qW x| jrR| jj� V q>W q W dS )z� This is where the magic happens.
We do our usually processing through the states and when we have a token
to return we yield the token which pauses processing until the next token
is requested.
�
ParseErrorr )�type�dataN)r �
tokenQueuer r �errorsr �pop�popleft)r r r r! �__iter__1 s
zHTMLTokenizer.__iter__c % C s( t }d}|rt}d}g }| jj� }x(||krJ|tk rJ|j|� | jj� }q$W tdj|�|�}|tkr�t| }| j jt
d dd|id�� �nld| ko�d kn s�|d
kr�d }| j jt
d dd|id�� �n(d | ko�d
kn �s�d| ko�dkn �s�d| k�odkn �s�d| k�o4dkn �s�|t ddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d
g#�k�r�| j jt
d dd|id�� y t |�}W n> t
k
�r� |d6 }t d|d? B �t d7|d8@ B � }Y nX |d9k�r$| j jt
d d:d;�� | jj|� |S )<z�This function returns either U+FFFD or the character based on the
decimal or hexadecimal representation. It also discards ";" if present.
If not present self.tokenQueue.append({"type": tokenTypes["ParseError"]}) is invoked.
�
� � r" z$illegal-codepoint-for-numeric-entity� charAsInt)r# r$ �datavarsi � i�� i�� u �r � � � � � i� i� � i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i�� i i � i� �;z numeric-entity-without-semicolon)r# r$ )r r
r �charr �append�int�joinr r% r � frozenset�chr�
ValueError�unget) r ZisHexZallowed�radix� charStack�cr- r6 �vr r r! �consumeNumberEntityA s`
&
z!HTMLTokenizer.consumeNumberEntityFc
C s� d}| j j� g}|d tksB|d tddfksB|d k rV||d krV| j j|d � �n"|d dk�rd}|j| j j� � |d dkr�d }|j| j j� � |r�|d tks�| r�|d tkr�| j j|d � | j|�}n4| j jt
d
d d �� | j j|j � � dd
j |� }�njx8|d tk �rFt
jd
j |���s2P |j| j j� � �qW y$t
jd
j |d d� ��}t|�}W n tk
�r� d }Y nX |d k �rD|d dk�r�| j jt
d
dd �� |d dk�r|�r|| tk�s�|| tk�s�|| dk�r| j j|j � � dd
j |� }n.t| }| j j|j � � |d
j ||d � �7 }n4| j jt
d
dd �� | j j|j � � dd
j |� }|�r�| jd d d |7 < n*|tk�r�d}nd}| j jt
| |d �� d S ) N�&r �<�#Fr �x�XTr" zexpected-numeric-entity)r# r$ r, r5 z named-entity-without-semicolon�=zexpected-named-entityr$ �SpaceCharacters�
Characters���)rF rG rK rK rK rK rK rK rK rK )r r6 r r r= r7 r
r rB r% r r' r9 � entitiesTrieZhas_keys_with_prefixZlongest_prefix�len�KeyErrorr
r r ) r � allowedChar�
fromAttribute�outputr? �hexZ
entityNameZ entityLengthZ tokenTyper r r! �
consumeEntity� sf
zHTMLTokenizer.consumeEntityc C s | j |dd� dS )zIThis method replaces the need for "entityInAttributeValueState".
T)rO rP N)rS )r rO r r r! �processEntityInAttribute� s z&HTMLTokenizer.processEntityInAttributec C s� | j }|d tkrp|d jt�|d< |d td krp|d rR| jjtd dd�� |d rp| jjtd d d�� | jj|� | j| _d
S ) z�This method is a generic handler for emitting the tags. It also sets
the state to "data" because that's what's needed after a token has been
emitted.
r# �name�EndTagr$ r" zattributes-in-end-tag)r# r$ � selfClosingz self-closing-flag-on-end-tagN) r r � translater r r% r7 r r )r �tokenr r r! �emitCurrentToken� s
z HTMLTokenizer.emitCurrentTokenc C s� | j j� }|dkr | j| _n�|dkr.| j| _n�|dkrd| jjtd dd�� | jjtd dd�� n`|tkrpdS |t kr�| jjtd || j j
t d
� d�� n&| j j
d �}| jjtd || d�� d
S ) NrC rD � r" zinvalid-codepoint)r# r$ rJ FrI T)rC rD r[ ) r r6 �entityDataStater � tagOpenStater% r7 r r r �
charsUntil)r r$ �charsr r r! r � s&
zHTMLTokenizer.dataStatec C s | j � | j| _dS )NT)rS r r )r r r r! r\ s z HTMLTokenizer.entityDataStatec C s� | j j� }|dkr | j| _n�|dkr.| j| _n�|tkr:dS |dkrp| jjtd dd�� | jjtd d d�� nT|t kr�| jjtd
|| j j
t d � d�� n&| j j
d �}| jjtd || d�� d S )
NrC rD Fr[ r" zinvalid-codepoint)r# r$ rJ u �rI T)rC rD r[ ) r r6 �characterReferenceInRcdatar �rcdataLessThanSignStater r% r7 r r r^ )r r$ r_ r r r! � rcdataState s&
zHTMLTokenizer.rcdataStatec C s | j � | j| _dS )NT)rS rb r )r r r r! r` 1 s z(HTMLTokenizer.characterReferenceInRcdatac C s� | j j� }|dkr | j| _nh|dkrR| jjtd dd�� | jjtd dd�� n2|tkr^dS | j jd
�}| jjtd || d�� d S ) NrD r[ r" zinvalid-codepoint)r# r$ rJ u �FT)rD r[ ) r r6 �rawtextLessThanSignStater r% r7 r r r^ )r r$ r_ r r r! � rawtextState6 s
zHTMLTokenizer.rawtextStatec C s� | j j� }|dkr | j| _nh|dkrR| jjtd dd�� | jjtd dd�� n2|tkr^dS | j jd
�}| jjtd || d�� d S ) NrD r[ r" zinvalid-codepoint)r# r$ rJ u �FT)rD r[ ) r r6 �scriptDataLessThanSignStater r% r7 r r r^ )r r$ r_ r r r! �scriptDataStateH s
z HTMLTokenizer.scriptDataStatec C sr | j j� }|tkrdS |dkrL| jjtd dd�� | jjtd dd�� n"| jjtd || j jd� d�� dS ) NFr[ r" zinvalid-codepoint)r# r$ rJ u �T)r r6 r r% r7 r r^ )r r$ r r r! �plaintextStateZ s
z HTMLTokenizer.plaintextStatec C s | j j� }|dkr | j| _n�|dkr.| j| _n�|tkrVtd |g ddd�| _| j| _n�|dkr�| j j
td dd �� | j j
td
d d �� | j | _nt|d kr�| j j
td d
d �� | j j |� | j
| _n@| j j
td dd �� | j j
td
dd �� | j j |� | j | _dS )N�!�/ZStartTagF)r# rU r$ rW ZselfClosingAcknowledged�>r" z'expected-tag-name-but-got-right-bracket)r# r$ rJ z<>�?z'expected-tag-name-but-got-question-markzexpected-tag-namerD T)r r6 �markupDeclarationOpenStater �closeTagOpenStater
r r � tagNameStater% r7 r r= �bogusCommentState)r r$ r r r! r] i s6
zHTMLTokenizer.tagOpenStatec C s� | j j� }|tkr0td |g dd�| _| j| _n�|dkrX| jjtd dd�� | j | _nn|t
kr�| jjtd dd�� | jjtd d
d�� | j | _n0| jjtd d d |id
�� | j j |� | j | _dS )NrV F)r# rU r$ rW rj r" z*expected-closing-tag-but-got-right-bracket)r# r$ z expected-closing-tag-but-got-eofrJ z</z!expected-closing-tag-but-got-charr$ )r# r$ r. T)
r r6 r
r r rn r r% r7 r r r= ro )r r$ r r r! rm � s(
z HTMLTokenizer.closeTagOpenStatec C s� | j j� }|tkr | j| _n�|dkr.| j� n~|tkrV| jjt d dd�� | j
| _nV|dkrh| j | _nD|dkr�| jjt d dd�� | j d d 7 < n| j d |7 < d
S ) Nrj r" zeof-in-tag-name)r# r$ ri r[ zinvalid-codepointrU u �T)
r r6 r �beforeAttributeNameStater rZ r r% r7 r r �selfClosingStartTagStater )r r$ r r r! rn � s"
zHTMLTokenizer.tagNameStatec C sP | j j� }|dkr"d| _| j| _n*| jjtd dd�� | j j|� | j | _dS )Nri r, rJ rD )r# r$ T)
r r6 �temporaryBuffer�rcdataEndTagOpenStater r% r7 r r= rb )r r$ r r r! ra � s
z%HTMLTokenizer.rcdataLessThanSignStatec C sX | j j� }|tkr*| j|7 _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr �rcdataEndTagNameStater r% r7 r r= rb )r r$ r r r! rs � s
z#HTMLTokenizer.rcdataEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r �lowerrr r r6 r r rp r rq rZ r r
r% r7 r= rb )r � appropriater$ r r r! rt � s2
z#HTMLTokenizer.rcdataEndTagNameStatec C sP | j j� }|dkr"d| _| j| _n*| jjtd dd�� | j j|� | j | _dS )Nri r, rJ rD )r# r$ T)
r r6 rr �rawtextEndTagOpenStater r% r7 r r= rd )r r$ r r r! rc � s
z&HTMLTokenizer.rawtextLessThanSignStatec C sX | j j� }|tkr*| j|7 _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr �rawtextEndTagNameStater r% r7 r r= rd )r r$ r r r! rw � s
z$HTMLTokenizer.rawtextEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r ru rr r r6 r r rp r rq rZ r r
r% r7 r= rd )r rv r$ r r r! rx s2
z$HTMLTokenizer.rawtextEndTagNameStatec C sx | j j� }|dkr"d| _| j| _nR|dkrJ| jjtd dd�� | j| _n*| jjtd dd�� | j j |� | j
| _dS ) Nri r, rh rJ z<!)r# r$ rD T) r r6 rr �scriptDataEndTagOpenStater r% r7 r �scriptDataEscapeStartStater= rf )r r$ r r r! re s
z)HTMLTokenizer.scriptDataLessThanSignStatec C sX | j j� }|tkr*| j|7 _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr �scriptDataEndTagNameStater r% r7 r r= rf )r r$ r r r! ry , s
z'HTMLTokenizer.scriptDataEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r ru rr r r6 r r rp r rq rZ r r
r% r7 r= rf )r rv r$ r r r! r{ 7 s2
z'HTMLTokenizer.scriptDataEndTagNameStatec C sJ | j j� }|dkr2| jjtd dd�� | j| _n| j j|� | j| _dS )N�-rJ )r# r$ T) r r6 r% r7 r � scriptDataEscapeStartDashStater r= rf )r r$ r r r! rz S s
z(HTMLTokenizer.scriptDataEscapeStartStatec C sJ | j j� }|dkr2| jjtd dd�� | j| _n| j j|� | j| _dS )Nr| rJ )r# r$ T) r r6 r% r7 r � scriptDataEscapedDashDashStater r= rf )r r$ r r r! r} ] s
z,HTMLTokenizer.scriptDataEscapeStartDashStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrD| j| _nn|dkrz| jjtd dd�� | jjtd dd�� n8|tkr�| j | _n&| j j
d
�}| jjtd || d�� d S ) Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �T)rD r| r[ ) r r6 r% r7 r �scriptDataEscapedDashStater �"scriptDataEscapedLessThanSignStater r r^ )r r$ r_ r r r! �scriptDataEscapedStateg s"
z$HTMLTokenizer.scriptDataEscapedStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrD| j| _nn|dkr�| jjtd dd�� | jjtd dd�� | j| _n0|t kr�| j
| _n | jjtd |d�� | j| _d S )
Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �T) r r6 r% r7 r r~ r r� r� r r )r r$ r r r! r { s"
z(HTMLTokenizer.scriptDataEscapedDashStatec C s� | j j� }|dkr*| jjtd dd�� n�|dkr<| j| _n�|dkrd| jjtd dd�� | j| _nn|dkr�| jjtd dd�� | jjtd d d�� | j| _n0|t kr�| j
| _n | jjtd |d�� | j| _d
S ) Nr| rJ )r# r$ rD rj r[ r" zinvalid-codepointu �T) r r6 r% r7 r r� r rf r� r r )r r$ r r r! r~ � s&
z,HTMLTokenizer.scriptDataEscapedDashDashStatec C s� | j j� }|dkr"d| _| j| _n\|tkrT| jjtd d| d�� || _| j | _n*| jjtd dd�� | j j
|� | j | _dS )Nri r, rJ rD )r# r$ T) r r6 rr � scriptDataEscapedEndTagOpenStater r
r% r7 r � scriptDataDoubleEscapeStartStater= r� )r r$ r r r! r� � s
z0HTMLTokenizer.scriptDataEscapedLessThanSignStatec C sP | j j� }|tkr"|| _| j| _n*| jjtd dd�� | j j |� | j
| _dS )NrJ z</)r# r$ T) r r6 r
rr � scriptDataEscapedEndTagNameStater r% r7 r r= r� )r r$ r r r! r� � s
z.HTMLTokenizer.scriptDataEscapedEndTagOpenStatec C s | j o | j d j� | jj� k}| jj� }|tkrT|rTtd | jg dd�| _ | j| _n�|dkr�|r�td | jg dd�| _ | j | _n||dkr�|r�td | jg dd�| _ | j
� | j | _nH|t kr�| j|7 _n0| j
jtd d| j d �� | jj|� | j| _d
S ) NrU rV F)r# rU r$ rW ri rj rJ z</)r# r$ T)r ru rr r r6 r r rp r rq rZ r r
r% r7 r= r� )r rv r$ r r r! r� � s2
z.HTMLTokenizer.scriptDataEscapedEndTagNameStatec C s� | j j� }|ttd�B krR| jjtd |d�� | jj� dkrH| j | _
q�| j | _
nB|t kr�| jjtd |d�� | j|7 _n| j j
|� | j | _
dS )Nri rj rJ )r# r$ �scriptT)ri rj )r r6 r r: r% r7 r rr ru � scriptDataDoubleEscapedStater r� r
r= )r r$ r r r! r� � s
z.HTMLTokenizer.scriptDataDoubleEscapeStartStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrZ| jjtd dd�� | j| _nt|dkr�| jjtd dd�� | jjtd dd�� n>|tkr�| jjtd d d�� | j | _n| jjtd |d�� d
S ) Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �zeof-in-script-in-scriptT)
r r6 r% r7 r � scriptDataDoubleEscapedDashStater �(scriptDataDoubleEscapedLessThanSignStater r )r r$ r r r! r� � s$
z*HTMLTokenizer.scriptDataDoubleEscapedStatec C s� | j j� }|dkr2| jjtd dd�� | j| _n�|dkrZ| jjtd dd�� | j| _n�|dkr�| jjtd dd�� | jjtd dd�� | j| _nF|t kr�| jjtd d d�� | j
| _n | jjtd |d�� | j| _d
S ) Nr| rJ )r# r$ rD r[ r" zinvalid-codepointu �zeof-in-script-in-scriptT) r r6 r% r7 r �$scriptDataDoubleEscapedDashDashStater r� r� r r )r r$ r r r! r� s(
z.HTMLTokenizer.scriptDataDoubleEscapedDashStatec C s | j j� }|dkr*| jjtd dd�� n�|dkrR| jjtd dd�� | j| _n�|dkrz| jjtd dd�� | j| _n�|dkr�| jjtd dd�� | jjtd d d�� | j| _nF|t kr�| jjtd d
d�� | j
| _n | jjtd |d�� | j| _d S ) Nr| rJ )r# r$ rD rj r[ r" zinvalid-codepointu �zeof-in-script-in-scriptT) r r6 r% r7 r r� r rf r� r r )r r$ r r r! r� s,
z2HTMLTokenizer.scriptDataDoubleEscapedDashDashStatec C sP | j j� }|dkr8| jjtd dd�� d| _| j| _n| j j|� | j | _dS )Nri rJ )r# r$ r, T)
r r6 r% r7 r rr � scriptDataDoubleEscapeEndStater r= r� )r r$ r r r! r� 0 s
z6HTMLTokenizer.scriptDataDoubleEscapedLessThanSignStatec C s� | j j� }|ttd�B krR| jjtd |d�� | jj� dkrH| j | _
q�| j | _
nB|t kr�| jjtd |d�� | j|7 _n| j j
|� | j | _
dS )Nri rj rJ )r# r$ r� T)ri rj )r r6 r r: r% r7 r rr ru r� r r� r
r= )r r$ r r r! r� ; s
z,HTMLTokenizer.scriptDataDoubleEscapeEndStatec C s0 | j j� }|tkr$| j jtd� �n|tkrJ| jd j|dg� | j| _n�|dkr\| j � n�|dkrn| j
| _n�|dkr�| j jt d
d d �� | jd j|dg� | j| _n�|d
kr�| j jt d
dd �� | jd jddg� | j| _nF|t
k�r| j jt d
dd �� | j| _n | jd j|dg� | j| _dS )NTr$ r, rj ri �'�"rH rD r" z#invalid-character-in-attribute-name)r# r$ r[ zinvalid-codepointu �z#expected-attribute-name-but-got-eof)r� r� rH rD )r r6 r r^ r
r r7 �attributeNameStater rZ rq r% r r r )r r$ r r r! rp K s6
z&HTMLTokenizer.beforeAttributeNameStatec C s� | j j� }d}d}|dkr&| j| _�n0|tkr^| jd d d || j jtd� 7 < d}� n�|dkrld}n�|tkr~| j| _n�|dkr�| j | _n�|d kr�| j
j t d
d d �� | jd d d d
7 < d}n�|dk�r| j
j t d
dd �� | jd d d |7 < d}nH|t
k�r8| j
j t d
dd �� | j| _n | jd d d |7 < d}|�r�| jd d d jt�| jd d d< xP| jd d d� D ]:\}}| jd d d |k�r�| j
j t d
dd �� P �q�W |�r�| j� dS ) NTFrH r$ r r rj ri r[ r" zinvalid-codepoint)r# r$ u �r� r� rD z#invalid-character-in-attribute-namezeof-in-attribute-namezduplicate-attributerK rK )r� r� rD rK rK rK rK rK rK )r r6 �beforeAttributeValueStater r
r r^ r �afterAttributeNameStaterq r% r7 r r r rX r rZ )r r$ ZleavingThisStateZ emitTokenrU �_r r r! r� i sR
&
z HTMLTokenizer.attributeNameStatec C sF | j j� }|tkr$| j jtd� �n |dkr8| j| _�n
|dkrJ| j� n�|tkrp| jd j |dg� | j
| _n�|dkr�| j | _n�|dkr�| j j t
d d d
�� | jd j d dg� | j
| _n�|dk� r�| j j t
d dd
�� | jd j |dg� | j
| _nF|tk�r&| j j t
d dd
�� | j| _n | jd j |dg� | j
| _dS )NTrH rj r$ r, ri r[ r" zinvalid-codepoint)r# r$ u �r� r� rD z&invalid-character-after-attribute-namez expected-end-of-tag-but-got-eof)r� r� rD )r r6 r r^ r� r rZ r
r r7 r� rq r% r r r )r r$ r r r! r� � s:
z%HTMLTokenizer.afterAttributeNameStatec C sj | j j� }|tkr$| j jtd� �nB|dkr8| j| _�n.|dkrX| j| _| j j|� �n|dkrl| j| _� n�|dkr�| j j
t d dd�� | j � n�|d kr�| j j
t d d
d�� | j
d d d d
7 < | j| _n�|dk�r| j j
t d dd�� | j
d d d |7 < | j| _nL|tk�rD| j j
t d dd�� | j| _n"| j
d d d |7 < | j| _dS )NTr� rC r� rj r" z.expected-attribute-value-but-got-right-bracket)r# r$ r[ zinvalid-codepointr$ r u �rH rD �`z"equals-in-unquoted-attribute-valuez$expected-attribute-value-but-got-eofrK )rH rD r� rK rK )r r6 r r^ � attributeValueDoubleQuotedStater �attributeValueUnQuotedStater= � attributeValueSingleQuotedStater% r7 r rZ r r r )r r$ r r r! r� � s>
z'HTMLTokenizer.beforeAttributeValueStatec C s� | j j� }|dkr | j| _n�|dkr0| jd� n�|dkrj| jjtd dd�� | jd d d d 7 < nN|t kr�| jjtd d
d�� | j
| _n&| jd d
d || j j d� 7 < d S )Nr� rC r[ r" zinvalid-codepoint)r# r$ r$ r u �z#eof-in-attribute-value-double-quoteTrK rK )r� rC r[ ) r r6 �afterAttributeValueStater rT r% r7 r r r r r^ )r r$ r r r! r� � s
z-HTMLTokenizer.attributeValueDoubleQuotedStatec C s� | j j� }|dkr | j| _n�|dkr0| jd� n�|dkrj| jjtd dd�� | jd d d d 7 < nN|t kr�| jjtd d
d�� | j
| _n&| jd d
d || j j d� 7 < d S )Nr� rC r[ r" zinvalid-codepoint)r# r$ r$ r u �z#eof-in-attribute-value-single-quoteTrK rK )r� rC r[ ) r r6 r� r rT r% r7 r r r r r^ )r r$ r r r! r� � s
z-HTMLTokenizer.attributeValueSingleQuotedStatec C s | j j� }|tkr | j| _� n�|dkr2| jd� n�|dkrD| j� n�|dkr~| jjt d d d
�� | j
d d d |7 < n�|d
kr�| jjt d dd
�� | j
d d d d7 < nV|t kr�| jjt d dd
�� | j | _n.| j
d d d || j j
td�tB � 7 < dS )NrC rj r� r� rH rD r� r" z0unexpected-character-in-unquoted-attribute-value)r# r$ r$ r r[ zinvalid-codepointu �z eof-in-attribute-value-no-quotesT)r� r� rH rD r� rK rK rK )rC rj r� r� rH rD r� r[ )r r6 r rp r rT rZ r% r7 r r r r r^ r: )r r$ r r r! r� s,
z)HTMLTokenizer.attributeValueUnQuotedStatec C s� | j j� }|tkr | j| _n�|dkr.| j� np|dkr@| j| _n^|tkrt| jj t
d dd�� | j j |� | j | _n*| jj t
d dd�� | j j |� | j| _dS )Nrj ri r" z$unexpected-EOF-after-attribute-value)r# r$ z*unexpected-character-after-attribute-valueT)
r r6 r rp r rZ rq r r% r7 r r= r )r r$ r r r! r� s"
z&HTMLTokenizer.afterAttributeValueStatec C s� | j j� }|dkr&d| jd< | j� n^|tkrZ| jjtd dd�� | j j|� | j | _
n*| jjtd dd�� | j j|� | j | _
dS )Nrj TrW r" z#unexpected-EOF-after-solidus-in-tag)r# r$ z)unexpected-character-after-solidus-in-tag) r r6 r rZ r r% r7 r r= r r rp )r r$ r r r! rq 4 s
z&HTMLTokenizer.selfClosingStartTagStatec C sD | j jd�}|jdd�}| jjtd |d�� | j j� | j| _dS )Nrj r[ u ��Comment)r# r$ T) r r^ �replacer% r7 r r6 r r )r r$ r r r! ro F s
z HTMLTokenizer.bogusCommentStatec C s� | j j� g}|d dkrT|j| j j� � |d dkrPtd dd�| _| j| _dS � n�|d d kr�d}x.d&D ]&}|j| j j� � |d' |krjd}P qjW |r�td dd d dd�| _| j| _dS n�|d( dk�rH| jd k �rH| jj j
�rH| jj j
d) j | jj j k�rHd}x2d*D ]*}|j| j j� � |d+ |k�rd}P �qW |�rH| j
| _dS | jjtd dd�� x |�rz| j j|j� � �q`W | j| _dS ),Nr r| r� r, )r# r$ T�d�D�o�Or@ �C�t�T�y�Y�p�P�e�EFZDoctype)r# rU �publicId�systemId�correct�[�Ar" zexpected-dashes-or-doctyperK rK rK )r� r� �r� r� �r@ r� �r� r� �r� r� �r� r� �r� r� )r� r� r� r� r� r� rK rK rK )r� r� r� r� r� r� rK )r r6 r7 r r �commentStartStater � doctypeStater ZtreeZ openElements� namespaceZdefaultNamespace�cdataSectionStater% r= r' ro )r r? �matched�expectedr r r! rl U sR
z(HTMLTokenizer.markupDeclarationOpenStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� | jj| j� | j| _nP|t kr�| jjtd d
d�� | jj| j� | j| _n| jd |7 < | j
| _d S ) Nr| r[ r" zinvalid-codepoint)r# r$ r$ u �rj zincorrect-commentzeof-in-commentT) r r6 �commentStartDashStater r% r7 r r r r � commentState)r r$ r r r! r� � s(
z HTMLTokenizer.commentStartStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� | jj| j� | j| _nT|t kr�| jjtd d
d�� | jj| j� | j| _n | jd d| 7 < | j
| _d S ) Nr| r[ r" zinvalid-codepoint)r# r$ r$ u -�rj zincorrect-commentzeof-in-commentT) r r6 �commentEndStater r% r7 r r r r r� )r r$ r r r! r� � s(
z#HTMLTokenizer.commentStartDashStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < nT|tkr�| jjtd dd�� | jj| j� | j | _n | jd || j j
d
� 7 < d S ) Nr| r[ r" zinvalid-codepoint)r# r$ r$ u �zeof-in-commentT)r| r[ ) r r6 �commentEndDashStater r% r7 r r r r r^ )r r$ r r r! r� � s
zHTMLTokenizer.commentStatec C s� | j j� }|dkr | j| _n�|dkrV| jjtd dd�� | jd d7 < | j| _nT|t kr�| jjtd dd�� | jj| j� | j
| _n | jd d| 7 < | j| _d S )
Nr| r[ r" zinvalid-codepoint)r# r$ r$ u -�zeof-in-comment-end-dashT) r r6 r� r r% r7 r r r� r r )r r$ r r r! r� � s
z!HTMLTokenizer.commentEndDashStatec C s, | j j� }|dkr*| jj| j� | j| _n�|dkrd| jjtd dd�� | jd d7 < | j| _n�|dkr�| jjtd d d�� | j | _n�|d
kr�| jjtd d d�� | jd |7 < nj|t
kr�| jjtd d d�� | jj| j� | j| _n4| jjtd d
d�� | jd d| 7 < | j| _dS )Nrj r[ r" zinvalid-codepoint)r# r$ r$ u --�rh z,unexpected-bang-after-double-dash-in-commentr| z,unexpected-dash-after-double-dash-in-commentzeof-in-comment-double-dashzunexpected-char-in-commentz--T) r r6 r% r7 r r r r r� �commentEndBangStater )r r$ r r r! r� � s6
z HTMLTokenizer.commentEndStatec C s� | j j� }|dkr*| jj| j� | j| _n�|dkrN| jd d7 < | j| _n�|dkr�| jjtd dd�� | jd d 7 < | j | _nT|t
kr�| jjtd d
d�� | jj| j� | j| _n | jd d| 7 < | j | _d S ) Nrj r| r$ z--!r[ r" zinvalid-codepoint)r# r$ u --!�z eof-in-comment-end-bang-stateT) r r6 r% r7 r r r r� r r� r )r r$ r r r! r� � s(
z!HTMLTokenizer.commentEndBangStatec C s� | j j� }|tkr | j| _nj|tkr\| jjtd dd�� d| j d< | jj| j � | j
| _n*| jjtd dd�� | j j |� | j| _dS )Nr" z!expected-doctype-name-but-got-eof)r# r$ Fr� zneed-space-after-doctypeT) r r6 r �beforeDoctypeNameStater r r% r7 r r r r= )r r$ r r r! r� s
zHTMLTokenizer.doctypeStatec C s� | j j� }|tkrn�|dkrT| jjtd dd�� d| jd< | jj| j� | j| _n�|dkr�| jjtd dd�� d | jd
< | j | _nR|t
kr�| jjtd d d�� d| jd< | jj| j� | j| _n|| jd
< | j | _d S )
Nrj r" z+expected-doctype-name-but-got-right-bracket)r# r$ Fr� r[ zinvalid-codepointu �rU z!expected-doctype-name-but-got-eofT) r r6 r r% r7 r r r r �doctypeNameStater )r r$ r r r! r� s.
z$HTMLTokenizer.beforeDoctypeNameStatec C s | j j� }|tkr2| jd jt�| jd< | j| _n�|dkrh| jd jt�| jd< | jj | j� | j
| _n�|dkr�| jj t d dd�� | jd d7 < | j | _nh|t
kr�| jj t d dd�� d | jd
< | jd jt�| jd< | jj | j� | j
| _n| jd |7 < d S ) NrU rj r[ r" zinvalid-codepoint)r# r$ u �zeof-in-doctype-nameFr� T)r r6 r r rX r �afterDoctypeNameStater r% r7 r r r� r )r r$ r r r! r� 6 s,
z HTMLTokenizer.doctypeNameStatec C sR | j j� }|tkr�n8|dkr8| jj| j� | j| _�n|tkr�d| jd< | j j |� | jjt
d dd�� | jj| j� | j| _� n�|d!kr�d }x$d'D ] }| j j� }||kr�d}P q�W |r�| j | _d S nJ|d(k�rd }x(d.D ] }| j j� }||k� r�d}P � q�W |�r| j | _d S | j j |� | jjt
d d d |id �� d| jd< | j
| _d S )/Nrj Fr� r" zeof-in-doctype)r# r$ r� r� T�u�U�b�B�l�L�i�Ir@ r� �s�Sr� r� r� r� r� r� �m�Mz*expected-space-or-right-bracket-in-doctyper$ )r# r$ r. )r� r� �r� r� �r� r� �r� r� �r� r� �r@ r� )r� r� r� r� r� )r� r� �r� r� �r� r� �r� r� �r� r� �r� r� )r� r� r� r� r� )r r6 r r% r7 r r r r r= r � afterDoctypePublicKeywordState� afterDoctypeSystemKeywordState�bogusDoctypeState)r r$ r� r� r r r! r� O sT
z#HTMLTokenizer.afterDoctypeNameStatec C s� | j j� }|tkr | j| _n�|d
krP| jjtd dd�� | j j|� | j| _nT|t kr�| jjtd dd�� d| j
d< | jj| j
� | j | _n| j j|� | j| _d S ) Nr� r� r" zunexpected-char-in-doctype)r# r$ zeof-in-doctypeFr� T)r� r� ) r r6 r �"beforeDoctypePublicIdentifierStater r% r7 r r= r r r )r r$ r r r! r� � s"
z,HTMLTokenizer.afterDoctypePublicKeywordStatec C s� | j j� }|tkrn�|dkr0d| jd< | j| _n�|dkrLd| jd< | j| _n�|dkr�| jjt d dd�� d | jd
< | jj| j� | j
| _nh|t kr�| jjt d d d�� d | jd
< | jj| j� | j
| _n(| jjt d d d�� d | jd
< | j | _d
S )Nr� r, r� r� rj r" zunexpected-end-of-doctype)r# r$ Fr� zeof-in-doctypezunexpected-char-in-doctypeT)
r r6 r r �(doctypePublicIdentifierDoubleQuotedStater �(doctypePublicIdentifierSingleQuotedStater% r7 r r r r� )r r$ r r r! r� � s4
z0HTMLTokenizer.beforeDoctypePublicIdentifierStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 �!afterDoctypePublicIdentifierStater r% r7 r r r r )r r$ r r r! r� � s*
z6HTMLTokenizer.doctypePublicIdentifierDoubleQuotedStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 r� r r% r7 r r r r )r r$ r r r! r� � s*
z6HTMLTokenizer.doctypePublicIdentifierSingleQuotedStatec C s | j j� }|tkr | j| _n�|dkr<| jj| j� | j| _n�|dkrn| jjt d dd�� d| jd< | j
| _n�|dkr�| jjt d dd�� d| jd< | j | _nh|t kr�| jjt d d d�� d
| jd < | jj| j� | j| _n(| jjt d dd�� d
| jd < | j
| _d S )
Nrj r� r" zunexpected-char-in-doctype)r# r$ r, r� r� zeof-in-doctypeFr� T)r r6 r �-betweenDoctypePublicAndSystemIdentifiersStater r% r7 r r r �(doctypeSystemIdentifierDoubleQuotedState�(doctypeSystemIdentifierSingleQuotedStater r� )r r$ r r r! r� � s6
z/HTMLTokenizer.afterDoctypePublicIdentifierStatec C s� | j j� }|tkrn�|dkr4| jj| j� | j| _n�|dkrPd| jd< | j| _n�|dkrld| jd< | j | _nh|t
kr�| jjt d dd�� d | jd
< | jj| j� | j| _n(| jjt d d d�� d | jd
< | j | _d S )
Nrj r� r, r� r� r" zeof-in-doctype)r# r$ Fr� zunexpected-char-in-doctypeT)
r r6 r r% r7 r r r r� r� r r r� )r r$ r r r! r� s.
z;HTMLTokenizer.betweenDoctypePublicAndSystemIdentifiersStatec C s� | j j� }|tkr | j| _n�|d
krP| jjtd dd�� | j j|� | j| _nT|t kr�| jjtd dd�� d| j
d< | jj| j
� | j | _n| j j|� | j| _d S ) Nr� r� r" zunexpected-char-in-doctype)r# r$ zeof-in-doctypeFr� T)r� r� ) r r6 r �"beforeDoctypeSystemIdentifierStater r% r7 r r= r r r )r r$ r r r! r� s"
z,HTMLTokenizer.afterDoctypeSystemKeywordStatec C s� | j j� }|tkrn�|dkr0d| jd< | j| _n�|dkrLd| jd< | j| _n�|dkr�| jjt d dd�� d | jd
< | jj| j� | j
| _nh|t kr�| jjt d d d�� d | jd
< | jj| j� | j
| _n(| jjt d dd�� d | jd
< | j | _d S )
Nr� r, r� r� rj r" zunexpected-char-in-doctype)r# r$ Fr� zeof-in-doctypeT)
r r6 r r r� r r� r% r7 r r r r� )r r$ r r r! r� / s4
z0HTMLTokenizer.beforeDoctypeSystemIdentifierStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 �!afterDoctypeSystemIdentifierStater r% r7 r r r r )r r$ r r r! r� L s*
z6HTMLTokenizer.doctypeSystemIdentifierDoubleQuotedStatec C s� | j j� }|dkr | j| _n�|dkrN| jjtd dd�� | jd d7 < n�|dkr�| jjtd d d�� d
| jd < | jj| j� | j| _nR|t kr�| jjtd d d�� d
| jd < | jj| j� | j| _n| jd |7 < d
S )Nr� r[ r" zinvalid-codepoint)r# r$ r� u �rj zunexpected-end-of-doctypeFr� zeof-in-doctypeT)
r r6 r� r r% r7 r r r r )r r$ r r r! r� d s*
z6HTMLTokenizer.doctypeSystemIdentifierSingleQuotedStatec C s� | j j� }|tkrn~|dkr4| jj| j� | j| _n^|tkrt| jjt d dd�� d| jd< | jj| j� | j| _n | jjt d dd�� | j
| _dS ) Nrj r" zeof-in-doctype)r# r$ Fr� zunexpected-char-in-doctypeT) r r6 r r% r7 r r r r r r� )r r$ r r r! r� | s
z/HTMLTokenizer.afterDoctypeSystemIdentifierStatec C sZ | j j� }|dkr*| jj| j� | j| _n,|tkrV| j j|� | jj| j� | j| _n dS )Nrj T) r r6 r% r7 r r r r r= )r r$ r r r! r� � s
z HTMLTokenizer.bogusDoctypeStatec C s� g }x�|j | jjd�� |j | jjd�� | jj� }|tkr@P q|dksLt�|d dd � dkrx|d d d� |d< P q|j |� qW dj|�}|jd�}|dkr�x&t|�D ]}| j j t
d d
d �� q�W |j dd �}|r�| j j t
d
|d �� | j | _
dS )N�]rj r � z]]r, r[ r r" zinvalid-codepoint)r# r$ u �rJ TrK ���rK r� rK )r7 r r^ r6 r �AssertionErrorr9 �count�ranger% r r� r r )r r$ r6 Z nullCountr� r r r! r� � s0
z HTMLTokenizer.cdataSectionState)N)NF)N�__name__�
__module__� __qualname__�__doc__r r) rB rS rT rZ r r\ rb r` rd rf rg r] rm rn ra rs rt rc rw rx re ry r{ rz r} r� r r~ r� r� r� r� r� r� r� r� r� rp r� r� r� r� r� r� r� rq ro rl r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__r r )r r! r s� H
P #
6 "- 3 r N)Z
__future__r r r Zpip._vendor.sixr r; � collectionsr Z constantsr r r
r r r
r r r r Z _inputstreamr Z_trier rL �objectr r r r r! �<module> s pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.opt-1.pyc 0000644 00000053240 14751155150 0021027 0 ustar 00 3
���e � ) @ s� d dl mZmZmZ d dlmZmZ d dlmZm Z d dl
Z
d dl Z d dl m
Z
ddlmZmZmZmZ ddlmZ dd lmZ d d
lmZ yd d lmZ W n ek
r� eZY nX ed d
� eD ��Zedd
� eD ��Z edd
� eD ��Z eeddg�B Z dZ ej �r(e j!e ddF� e"d� d �Z#n
e j!e �Z#e$dddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4g �Z%e j!d5�Z&i Z'G d6d7� d7e(�Z)d8d9� Z*G d:d;� d;e(�Z+G d<d=� d=e+�Z,G d>d?� d?e-�Z.G d@dA� dAe(�Z/G dBdC� dCe(�Z0dDdE� Z1dS )G� )�absolute_import�division�unicode_literals)� text_type� binary_type)� http_client�urllibN)� webencodings� )�EOF�spaceCharacters� asciiLetters�asciiUppercase)�ReparseException)�_utils)�StringIO)�BytesIOc C s g | ]}|j d ��qS )�ascii)�encode)�.0�item� r �"/usr/lib/python3.6/_inputstream.py�
<listcomp> s r c C s g | ]}|j d ��qS )r )r )r r r r r r s c C s g | ]}|j d ��qS )r )r )r r r r r r s � >� <u� [- - --]z"\uD800-\uDFFF"�]i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i�� i�� z[ -
-/:-@[-`{-~]c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )�BufferedStreamz�Buffering for streams that do not have buffering of their own
The buffer is implemented as a list of chunks on the assumption that
joining many strings will be slow since it is O(n**2)
c C s || _ g | _ddg| _d S )Nr
r ���)�stream�buffer�position)�selfr r r r �__init__@ s zBufferedStream.__init__c C s@ d}x(| j d | jd � D ]}|t|�7 }qW || jd 7 }|S )Nr r
)r r! �len)r" �pos�chunkr r r �tellE s
zBufferedStream.tellc C sH |}d}x0t | j| �|k r8|t | j| �8 }|d7 }q
W ||g| _d S )Nr r
)r$ r r! )r" r% �offset�ir r r �seekL s zBufferedStream.seekc C sT | j s| j|�S | jd t| j �krF| jd t| j d �krF| j|�S | j|�S d S )Nr r
r )r � _readStreamr! r$ �_readFromBuffer)r" �bytesr r r �readU s
zBufferedStream.readc C s t dd� | jD ��S )Nc S s g | ] }t |��qS r )r$ )r r r r r r _ s z1BufferedStream._bufferedBytes.<locals>.<listcomp>)�sumr )r" r r r �_bufferedBytes^ s z BufferedStream._bufferedBytesc C s< | j j|�}| jj|� | jd d7 < t|�| jd< |S )Nr r
)r r. r �appendr! r$ )r" r- �datar r r r+ a s
zBufferedStream._readStreamc C s� |}g }| j d }| j d }x�|t| j�k r�|dkr�| j| }|t|�| krb|}||| g| _ n"t|�| }|t|�g| _ |d7 }|j|||| � � ||8 }d}q W |r�|j| j|�� dj|�S )Nr r
� )r! r$ r r1 r+ �join)r" r- ZremainingBytes�rvZ bufferIndexZ bufferOffsetZ bufferedDataZ bytesToReadr r r r, h s$
z BufferedStream._readFromBufferN) �__name__�
__module__� __qualname__�__doc__r# r' r* r. r0 r+ r, r r r r r 9 s r c K s� t | tj�s(t | tjj�r.t | jtj�r.d}n&t| d�rJt | jd�t �}n
t | t �}|r�dd� |D �}|rvt
d| ��t | f|�S t | f|�S d S )NFr. r c S s g | ]}|j d �r|�qS )Z _encoding)�endswith)r �xr r r r � s z#HTMLInputStream.<locals>.<listcomp>z3Cannot set an encoding with a unicode input, set %r)
�
isinstancer Z HTTPResponser ZresponseZaddbase�fp�hasattrr. r � TypeError�HTMLUnicodeInputStream�HTMLBinaryInputStream)�source�kwargsZ isUnicodeZ encodingsr r r �HTMLInputStream� s
rD c @ sp e Zd ZdZdZdd� Zdd� Zdd� Zd d
� Zd d � Z d
d� Z
ddd�Z dd� Z dd� Z
d dd�Zdd� ZdS ) r@ z�Provides a unicode stream of characters to the HTMLTokenizer.
This class takes care of character encoding and removing or replacing
incorrect byte-sequences and also provides column and line tracking.
i ( c C sZ t jsd| _n td�dkr$| j| _n| j| _dg| _td�df| _| j |�| _
| j � dS )a� Initialises the HTMLInputStream.
HTMLInputStream(source, [encoding]) -> Normalized stream from source
for use by html5lib.
source can be either a file-object, local filename or a string.
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
Nu r
r zutf-8�certain) r �supports_lone_surrogates�reportCharacterErrorsr$ �characterErrorsUCS4�characterErrorsUCS2ZnewLines�lookupEncoding� charEncoding�
openStream�
dataStream�reset)r" rB r r r r# � s
z HTMLUnicodeInputStream.__init__c C s. d| _ d| _d| _g | _d| _d| _d | _d S )N� r )r& � chunkSize� chunkOffset�errors� prevNumLines� prevNumCols�_bufferedCharacter)r" r r r rN � s z HTMLUnicodeInputStream.resetc C s t |d�r|}nt|�}|S )zvProduces a file object from source.
source can be either a file object, local filename or a string.
r. )r> r )r" rB r r r r rL � s
z!HTMLUnicodeInputStream.openStreamc C sT | j }|jdd|�}| j| }|jdd|�}|dkr@| j| }n ||d }||fS )N�
r r
r )r& �countrS �rfindrT )r" r( r& ZnLinesZ positionLineZ lastLinePosZpositionColumnr r r � _position� s
z HTMLUnicodeInputStream._positionc C s | j | j�\}}|d |fS )z:Returns (line, col) of the current position in the stream.r
)rY rQ )r" �line�colr r r r! � s z HTMLUnicodeInputStream.positionc C s6 | j | jkr| j� stS | j }| j| }|d | _ |S )zo Read one character from the stream or queue if available. Return
EOF when EOF is reached.
r
)rQ rP � readChunkr r& )r" rQ �charr r r r] � s
zHTMLUnicodeInputStream.charNc C s� |d kr| j }| j| j�\| _| _d| _d| _d| _| jj|�}| j rX| j | }d | _ n|s`dS t
|�dkr�t |d �}|dks�d| ko�dkn r�|d
| _ |d d� }| j r�| j |� |j
dd �}|j
d
d �}|| _t
|�| _d S )NrO r Fr
�
i � i�� z
rV �
Tr r r )�_defaultChunkSizerY rP rS rT r& rQ rM r. rU r$ �ordrG �replace)r" rP r2 Zlastvr r r r\ � s0
z HTMLUnicodeInputStream.readChunkc C s, x&t ttj|���D ]}| jjd� qW d S )Nzinvalid-codepoint)�ranger$ �invalid_unicode_re�findallrR r1 )r" r2 �_r r r rH % s z*HTMLUnicodeInputStream.characterErrorsUCS4c C s� d}x�t j|�D ]�}|rqt|j� �}|j� }tj|||d � �rttj|||d � �}|tkrn| j j
d� d}q|dkr�|dkr�|t |�d kr�| j j
d� qd}| j j
d� qW d S )NF� zinvalid-codepointTi � i�� r
) rd �finditerra �group�startr ZisSurrogatePairZsurrogatePairToCodepoint�non_bmp_invalid_codepointsrR r1 r$ )r" r2 �skip�matchZ codepointr% Zchar_valr r r rI ) s z*HTMLUnicodeInputStream.characterErrorsUCS2Fc C s� yt ||f }W nN tk
r^ djdd� |D ��}|s@d| }tjd| � }t ||f< Y nX g }x||j| j| j�}|dkr�| j| jkr�P n0|j � }|| jkr�|j
| j| j|� � || _P |j
| j| jd� � | j � sfP qfW dj|�}|S )z� Returns a string of characters from the stream up to but not
including any character in 'characters' or EOF. 'characters' must be
a container that supports the 'in' method and iteration over its
characters.
rO c S s g | ]}d t |� �qS )z\x%02x)ra )r �cr r r r N s z5HTMLUnicodeInputStream.charsUntil.<locals>.<listcomp>z^%sz[%s]+N) �charsUntilRegEx�KeyErrorr4 �re�compilerm r& rQ rP �endr1 r\ ) r" Z
charactersZopposite�charsZregexr5 �mrs �rr r r �
charsUntil@ s.
z!HTMLUnicodeInputStream.charsUntilc C s@ |d k r<| j dkr.|| j | _| jd7 _n| j d8 _ d S )Nr r
)rQ r& rP )r" r] r r r �ungeto s
z HTMLUnicodeInputStream.unget)N)F)r6 r7 r8 r9 r` r# rN rL rY r! r] r\ rH rI rw rx r r r r r@ � s
&
/r@ c @ sL e Zd ZdZddd�Zdd� Zd d
� Zdd d �Zd
d� Zdd� Z dd� Z
dS )rA z�Provides a unicode stream of characters to the HTMLTokenizer.
This class takes care of character encoding and removing or replacing
incorrect byte-sequences and also provides column and line tracking.
N� windows-1252Tc C s\ | j |�| _tj| | j� d| _d| _|| _|| _|| _|| _ || _
| j |�| _ | j
� dS )a� Initialises the HTMLInputStream.
HTMLInputStream(source, [encoding]) -> Normalized stream from source
for use by html5lib.
source can be either a file-object, local filename or a string.
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
i �d N)rL � rawStreamr@ r# � numBytesMeta�numBytesChardet�override_encoding�transport_encoding�same_origin_parent_encoding�likely_encoding�default_encoding�determineEncodingrK rN )r" rB r~ r r� r� r� Z
useChardetr r r r# � s z HTMLBinaryInputStream.__init__c C s& | j d jj| jd�| _tj| � d S )Nr rb )rK Z
codec_info� streamreaderr{ rM r@ rN )r" r r r rN � s zHTMLBinaryInputStream.resetc C sD t |d�r|}nt|�}y|j|j� � W n t|�}Y nX |S )zvProduces a file object from source.
source can be either a file object, local filename or a string.
r. )r> r r* r' r )r" rB r r r r rL � s
z HTMLBinaryInputStream.openStreamc C s� | j � df}|d d k r |S t| j�df}|d d k r:|S t| j�df}|d d k rX|S | j� df}|d d k rt|S t| j�df}|d d k r�|d jjd� r�|S t| j�df}|d d k r�|S |�rdyddl m
} W n t k
r� Y nxX g }|� }x6|j �s.| j
j| j�}|�sP |j|� |j|� q�W |j� t|jd �}| j
jd� |d k �rd|dfS t| j�df}|d d k �r�|S td�dfS )NrE r Z tentativezutf-16)�UniversalDetector�encodingz windows-1252)� detectBOMrJ r~ r �detectEncodingMetar� �name�
startswithr� Zchardet.universaldetectorr� � ImportError�doner{ r. r} r1 Zfeed�close�resultr* r� )r" ZchardetrK r� ZbuffersZdetectorr r� r r r r� � sP
z'HTMLBinaryInputStream.determineEncodingc C s� t |�}|d krd S |jdkr(t d�}nT|| jd krH| jd df| _n4| jjd� |df| _| j� td| jd |f ��d S )N�utf-16be�utf-16lezutf-8r rE z Encoding changed from %s to %s)r� r� )rJ r� rK r{ r* rN r )r" Z newEncodingr r r �changeEncoding s
z$HTMLBinaryInputStream.changeEncodingc
C s� t jdt jdt jdt jdt jdi}| jjd�}|j|dd� �}d}|sp|j|�}d}|sp|j|dd � �}d }|r�| jj |� t
|�S | jj d
� dS dS ) z�Attempts to detect at BOM at the start of the stream. If
an encoding can be determined from the BOM return the name of the
encoding otherwise return Nonezutf-8zutf-16lezutf-16bezutf-32lezutf-32be� N� rg r ) �codecs�BOM_UTF8� BOM_UTF16_LE� BOM_UTF16_BE� BOM_UTF32_LE� BOM_UTF32_BEr{ r. �getr* rJ )r" ZbomDict�stringr� r* r r r r� s"
z HTMLBinaryInputStream.detectBOMc C sH | j j| j�}t|�}| j jd� |j� }|dk rD|jdkrDtd�}|S )z9Report the encoding declared by the meta element
r N�utf-16be�utf-16lezutf-8)r� r� )r{ r. r| �EncodingParserr* � getEncodingr� rJ )r" r �parserr� r r r r� 9 s z(HTMLBinaryInputStream.detectEncodingMeta)NNNNry T)T) r6 r7 r8 r9 r# rN rL r� r� r� r� r r r r rA � s
(
>"rA c @ s� e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z e e e
�Z
dd� Ze e�Zefdd�Zdd� Zdd� Zdd� Zd S ) �
EncodingBytesz�String-like object with an associated position and various extra methods
If the position is ever greater than the string length then an exception is
raisedc C s t j| |j� �S )N)r- �__new__�lower)r" �valuer r r r� L s zEncodingBytes.__new__c C s
d| _ d S )Nr
r )rY )r" r� r r r r# P s zEncodingBytes.__init__c C s | S )Nr )r" r r r �__iter__T s zEncodingBytes.__iter__c C s> | j d }| _ |t| �kr"t�n |dk r.t�| ||d � S )Nr
r )rY r$ �
StopIterationr? )r" �pr r r �__next__W s zEncodingBytes.__next__c C s | j � S )N)r� )r" r r r �next_ s zEncodingBytes.nextc C sB | j }|t| �krt�n |dk r$t�|d | _ }| ||d � S )Nr r
)rY r$ r� r? )r" r� r r r �previousc s zEncodingBytes.previousc C s | j t| �krt�|| _ d S )N)rY r$ r� )r" r! r r r � setPositionl s zEncodingBytes.setPositionc C s* | j t| �krt�| j dkr"| j S d S d S )Nr )rY r$ r� )r" r r r � getPositionq s
zEncodingBytes.getPositionc C s | | j | j d � S )Nr
)r! )r" r r r �getCurrentByte{ s z EncodingBytes.getCurrentBytec C sL | j }x:|t| �k r@| ||d � }||kr6|| _|S |d7 }qW || _dS )z Skip past a list of charactersr
N)r! r$ rY )r" rt r� rn r r r rl � s zEncodingBytes.skipc C sL | j }x:|t| �k r@| ||d � }||kr6|| _|S |d7 }qW || _d S )Nr
)r! r$ rY )r" rt r� rn r r r � skipUntil� s zEncodingBytes.skipUntilc C s> | j }| ||t|� � }|j|�}|r:| j t|�7 _ |S )z�Look for a sequence of bytes at the start of a string. If the bytes
are found return True and advance the position to the byte after the
match. Otherwise return False and leave the position alone)r! r$ r� )r" r- r� r2 r5 r r r �
matchBytes� s
zEncodingBytes.matchBytesc C sR | | j d� j|�}|dkrJ| jdkr,d| _| j|t|� d 7 _dS t�dS )z�Look for the next sequence of bytes matching a given sequence. If
a match is found advance the position to the last byte of the matchNr
r Tr r )r! �findrY r$ r� )r" r- Z newPositionr r r �jumpTo� s
zEncodingBytes.jumpToN)r6 r7 r8 r9 r� r# r� r� r� r� r� r� �propertyr! r� � currentByte�spaceCharactersBytesrl r� r� r� r r r r r� H s
r� c @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dS )r� z?Mini parser for detecting character encoding from meta elementsc C s t |�| _d| _dS )z3string - the data to work on for encoding detectionN)r� r2 r� )r" r2 r r r r# � s
zEncodingParser.__init__c
C s� d| j fd| jfd| jfd| jfd| jfd| jff}x^| jD ]T}d}xD|D ]<\}}| jj|�rJy |� }P W qJ tk
r� d}P Y qJX qJW |s<P q<W | jS ) Ns <!--s <metas </s <!s <?r TF) �
handleComment�
handleMeta�handlePossibleEndTag� handleOther�handlePossibleStartTagr2 r� r� r� )r" ZmethodDispatchrf Z keepParsing�key�methodr r r r� � s& zEncodingParser.getEncodingc C s | j jd�S )zSkip over commentss -->)r2 r� )r" r r r r� � s z EncodingParser.handleCommentc C s� | j jtkrdS d}d }x�| j� }|d kr.dS |d dkr^|d dk}|r�|d k r�|| _dS q|d dkr�|d }t|�}|d k r�|| _dS q|d dkrtt|d ��}|j� }|d k rt|�}|d k r|r�|| _dS |}qW d S ) NTFr s
http-equivr
s content-types charsets content) r2 r� r� � getAttributer� rJ �ContentAttrParserr� �parse)r" Z hasPragmaZpendingEncoding�attrZtentativeEncoding�codecZ
contentParserr r r r� � s: zEncodingParser.handleMetac C s
| j d�S )NF)�handlePossibleTag)r" r r r r� � s z%EncodingParser.handlePossibleStartTagc C s t | j� | jd�S )NT)r� r2 r� )r" r r r r� � s
z#EncodingParser.handlePossibleEndTagc C sf | j }|jtkr(|r$|j� | j� dS |jt�}|dkrD|j� n | j� }x|d k r`| j� }qNW dS )NTr )r2 r� �asciiLettersBytesr� r� r� �spacesAngleBracketsr� )r" ZendTagr2 rn r� r r r r� � s
z EncodingParser.handlePossibleTagc C s | j jd�S )Nr )r2 r� )r" r r r r� s zEncodingParser.handleOtherc C s� | j }|jttdg�B �}|dkr&dS g }g }xt|dkr@|r@P nX|tkrT|j� }P nD|d krjdj|�dfS |tkr�|j|j� � n|dkr�dS |j|� t|�}q0W |dkr�|j � dj|�dfS t|� |j� }|d
k�r:|}x�t|�}||k�rt|� dj|�dj|�fS |tk�r*|j|j� � q�|j|� q�W nJ|dk�rRdj|�dfS |tk�rl|j|j� � n|dk�rzdS |j|� x^t|�}|t
k�r�dj|�dj|�fS |tk�r�|j|j� � n|dk�r�dS |j|� �q�W dS ) z_Return a name,value pair for the next attribute in the stream,
if one is found, or None� /r N� =r3 � '� ")r N)r� r )r� r� ) r2 rl r� � frozensetr4 �asciiUppercaseBytesr1 r� r� r� r� )r" r2 rn ZattrNameZ attrValueZ quoteCharr r r r� sf
zEncodingParser.getAttributeN)
r6 r7 r8 r9 r# r� r� r� r� r� r� r� r� r r r r r� � s $r� c @ s e Zd Zdd� Zdd� ZdS )r� c C s
|| _ d S )N)r2 )r" r2 r r r r# f s zContentAttrParser.__init__c C s y�| j jd� | j jd7 _| j j� | j jdks8d S | j jd7 _| j j� | j jdkr�| j j}| j jd7 _| j j}| j j|�r�| j || j j� S d S nF| j j}y | j jt� | j || j j� S tk
r� | j |d � S X W n tk
�r d S X d S )Ns charsetr
r� r� r� )r� r� )r2 r� r! rl r� r� r� r� )r" Z quoteMarkZ oldPositionr r r r� j s.
zContentAttrParser.parseN)r6 r7 r8 r# r� r r r r r� e s r� c C s` t | t�r.y| jd�} W n tk
r, dS X | dk rXy
tj| �S tk
rT dS X ndS dS )z{Return the python codec name corresponding to an encoding or None if the
string doesn't correspond to a valid encoding.r N)r< r �decode�UnicodeDecodeErrorr �lookup�AttributeError)r� r r r rJ � s
rJ r )2Z
__future__r r r Zpip._vendor.sixr r Zpip._vendor.six.movesr r r� rq Z pip._vendorr Z constantsr r r
r r rO r �ior r r� r� r� r� r� r� Z invalid_unicode_no_surrogaterF rr �evalrd �setrk Zascii_punctuation_rero �objectr rD r@ rA r- r� r� r� rJ r r r r �<module> sV
J g Ih 6' pip/_vendor/html5lib/__pycache__/constants.cpython-36.pyc 0000644 00000201300 14751155150 0017362 0 ustar 00 3
���e�E � � @ s�- d dl mZmZmZ d dlZdZddddddd d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d,d,d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrdsdtdudvdwdxdydzd{d|d}d~dd�d�d�d���Zd�d�d�d�d�d�d��Zeed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fg�Z eed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fg�Z
eed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fgN�Z eed� d�fed� d�fed� d�fed� d�fg�Z eed� d�fed� d�fed� d�fed� d�fed� d�fg�Z
d�d�d�d�d�d�d�d�d�d�d�d�d�d�d��d �d�d�d�d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�d/�>Z�d0�d1iZ�d2�d3e�d2 f�d2�d4e�d2 f�d2�d5e�d2 f�d2�d6e�d2 f�d2�d7e�d2 f�d2d�e�d2 f�d2�d8e�d2 f�d9d�e�d9 f�d9�d:e�d9 f�d9�d;e�d9 fd�d<e�d< f�d<�d2e�d< f�d=� Ze�d>�d?� ej� D ��Ze�d@�dA�dB�dC�dDg�Zed�d�d�d�d�g�Zeej�Zeej�Zeej�Zeej �Z eej �Z e�dE�d?� ejD ��Z �d|Z ed�d��dFd�d�d�d�d�d�d�d�d�dԐdG�dHg�Z!ed�d�g�Z"ed�d�d�d�d�d�d�g�Z#e�dIg�e�dJg�e�dKg�e�dL�dMg�e�dL�dMg�e�dN�dOg�e�dPg�e�dQ�dRg�e�dS�dR�dT�dUg�e�dVg�e�dWg�e�dR�dXg�e�dR�dX�dYg�e�dR�dXg�e�dR�dZg�e�dR�dX�d[�dZ�dT�dKg�e�dR�dX�dZ�dQg�e�dR�dXg��d\�Z$�d}Z%e�dy�dz�d{�d|�d}g�Z&�d~�d~�d�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d͐dΐdϐdАdѐdҐdӐd��dѐdԐdՐddÐdאdؐdِdڐdېdܐdݐdސdߐd�d�d�d�d�d�d�d�d�d�d�d�dԐd�d�d�d�d�d�d�d�d�d�d�d�d��d��d��d��d��d��d��d��d��d��d��d��d �d�d�d�d�d�d�d�d�d�d �d
�d �d �d
�d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d(�d+�d��d,�d-�d.�d/�d0�d0�d1�d1�d2�d3�d4�d5�d5�d4�d6�d7�dڐd8�d9�d:�d;�d<�d=�d>�d?�d@�dA�dB�dC�dC�dD�dE�dF�dG�dH�dI�dJ�dK�dL�dM�dN�dO�dP�dQ�dR�dS�dT�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d`�da�db�dc�dd�de�df�dg�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dr�ds�dt�dՐddu�dv�dw�dx�dy�dz�d{�d|�d}�d~�d�d��d��dאdؐdِd��d��d��dX�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d"�d��dA�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d͐dΐdϐdϐdАdѐdҐdҐdӐdӐdԐdՐddאdאdؐdِdڐdېdܐdݐdސdߐd�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d'�d�d�d�d�d�d�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d �d�d�d�d�d�d�d�d�d �d�d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �dڐd!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�d/�d0�dߐd^�d �d1�d2�d3�d4�d5�d6�d7�d8�d9�d:�d;�d<�d=�d>�d?�d?�d@�dA�dB�dC�dD�d�dE�dF�dG�dH�dF�dI�dI�dJ�dK�dL�d@�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d^�d_�d`�da�db�dc�dc�dd�de�df�dg�dg�dh�di�dj�dk�dl�dm�dn�do�dp�d1�dq�dr�ds�dt�du�dv�dܐdݐdw�dx�dy�dz�d{�d|�d}�d~�d~�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��dɐdɐd��d��d��d��d��d��d��d��d��d��d��d��d�d�d��d��d��d��d��d��d��d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d��d͐dΐdϐdY�dАdѐdҐdӐdԐdY�dҐdՐdՐddאdY�d��dؐdؐdِdِd��dڐdېdܐdݐdސdߐd�d�d�d�dk�d�dܐd�d�d��d��d�dݐd��d�d�d�d�d:�d�dm�d�d�d�d�d�d�d�d�d��d��d�d��d
�d��d��d��d��d��d��d��d��d��d��d �d�d�du�du�d�d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d*�d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�dސd��d/�d/�d0�d1�dߐd�d2�d3�d4�d5�d5�d��d6�d,�d,�d7�d8�d9�d:�d;�d<�d=�d>�d?�d$�d@�dA�dB�dB�dC�dD�dE�dF�d��d��dG�dH�dH�d��dI�dJ�dK�dK�dL�dM�dN�dO�dP�dQ�dR�d��dS�dT�dU�dV�dP�dW�dX�dY�dZ�dZ�d[�d��d��d\�d]�d^�d3�d^�d��dX�d_�d��d`�d��d��d��da�db�dc�dd�de�df�dg�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dr�ds�dt�du�dv�dw�dx�dl�dm�dy�dz�d{�d{�dn�dw�dy�dz�d��d|�d}�dԐd~�d�d��dߐd��di�d��dːd��d��dϐd��d��d��d��d��d��d��d��d��dd�d�dΐdΐd��d��dѐd��d��d��d��d��d��d��d��d��d��d��d��dʐdӐd��d��d��d��d��dߐd��dd�d�d��d��d��d��d��d��d��d��d��d��d�d �d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��ddÐdĐdĐdŐd��d��d��d��d��dƐdǐd��dȐdɐdʐdːd̐dӐd��d͐dΐdΐdϐdϐdАdѐd�d�d�d��dҐdӐdԐdՐddאdؐdِdڐdېdܐdݐdސd �dߐd�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d�d��d��d��d��d��d��d��d��d�d�d�d �d �d �d��d��d��d��d �d�d�d"�d�d�d�d �d�d�d�d�d �d �d
�d
�d�d �d �d̐d
�d �d�d�d�d�d�d�d�d�d�d��d�d�d�d�d �d �d�d�dd��d�d(�d�dg�d�d�d�d�d �d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d�d)�d*�d��d+�d+�d;�d,�d,�d-�d.�d/�d/�dd0�d1�d1�d7�d2�d3�d4�d5�d6�d7�d4�d@�d4�d8�d9�d:�d��d;�d<�d=�d8�d9�d>�d��d>�d?�d@�dA�dB�dC�dD�d@�dE�dE�dF�d��dG�dH�dI�dJ�d��d<�dK�dL�dM�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d}�dՐd`�da�dv�db�dc�dd�de�dX�df�d]�dg�d]�dh�di�di�d^�d_�dj�dk�d$�dl�dm�dn�do�dp�dq�dr�ds�dt�du�dv�dw�dx�dy�dz�d{�d|�da�dv�d}�d~�dܐd�d�d��d��d��d^�do�d�ds�d��dg�d`�d�d�d��du�d��dv�dy�dy�d��d��d��d��d��d��dh�d��du�db�dw�dz�d��df�d��dw�d��d�ds�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��db�d�d��d��d��dl�d��d��d��d��d��d��di�d��d��d��d��d��d`�d��d�d��d��d��d��d��d��dz�d��d��dw�dݐd��d��dT�dT�d��d��d��d��d��d��d��d��d��dn�d��d��d��d��d��d��d��d��d��d��d��d�d�d�dj�dv�d��d��d��d��d��d��ddÐdÐd��dאdĐd��d��dŐd!�d��dƐdǐd �d��dȐdɐd��dʐd��dːd̐d̐d͐dΐd��dϐdАdѐdҐd��dӐdԐdՐdƐddאd̐dؐdِdڐd̐dېdېd��d��d��d��d��dܐdݐdސdːdߐd�d�d�d��d�d�dx�dx�d�d��d�d��d��d��d�d��d��d��d��d��d��d��d��d��dАd�d�d�d�d�d�d�dϐd�d�d�d��d�d�d��d�d��d��d��d��d��d��d��d͐d�d�d�d��d�d�d��d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��dӐd��d��d��d��d��d��dÐdŐdĐd��d͐d��dɐdʐdʐd͐d��d��d��d��d �dd��dd �dÐdĐd�d�dȐdǐdȐd�d��d�d�d��d��d��d��d��d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�dw�dw�d�dS�d�d�dT�dU�d�d�d�dV�d �d �d��d �d �d �d!�d"�d#�d#�d$�d%�dِd��dQ�d&�d'�d�d(�d)�d*�d+�d,�d��d-�d.�d/�d��d0�dR�d1�d2�d2�d3�d3�d4�d4�d5�d6�d7�d8�d2�d9�d9�d:�d;�d;�d��d<�d=�d=�d>�dސd?�d?�dސd@�dA�d�dB�dC�dD�dE�du�dF�dG�dH�dI�d��dJ�dK�dߐdL�d�dM�d�dN�dO�d"�dP�d��dQ�dR�d�d�dS�dT�d�dU�dV�dW�dW�d�dX�dY�d�d�d�dY�d�d�dZ�d[�d\�d�d]�d�d[�dZ�d\�d��d^�d_�d`�d��d��d�da�db�dc�dd�de�d2�df�dg�dh�d)�di�dj�dǐd��d��d#�dڐdk�d��dl�dm�dn�d5�do�d �dp�dq�d �dr�dr�d �ds�d
�dt�du�dv�d%�d��dw�dx�dy�dz�d{�d|�d��d�d}�d~�d�d��d��d��d��d��d�d~�d��d��d��d��d��d��d�d$�d�d!�d��d��d��d��d�d��d�d �d��d��d��d �dy�d�d �d�d �d��dz�d��d��dʐd�d �d��d��d��d��d��d��d�d��d��d��d��d��d��d��d��d��d��d%�d�d��d��d��d��d��d�d��d��d��d��d��d��dA�d��d��d��dC�dB�d��d��d��d��d��d��dD�d��d��d��d��d��d �d��d��d��d��d��d��d��d��d��d��d�d��d��d��d��dސd��d��d��d��d��dV�d��dW�dW�d��d��d��ddÐdĐdŐd^�d��dƐdǐd��dȐdɐdʐdːd̐d͐dΐdϐdАdѐdѐdސd7�dҐd<�dӐd8�d9�d8�d9�d:�d;�d:�d;�d6�d6�d
�d
�d �dԐd��dȐd>�dՐd�dŐdI�d��ddאdؐd@�dِdڐdېdܐdݐdސdd@�dאdܐdېdߐd�d�dA�d��dC�dB�d��d��d��dD�dE�d�d�d�d�d�d�d�dG�d�d�d�dH�d�d�d�d�d�d�d�d�dG�dH�d�d�d�d�d�d�d�d!�d��d��d��d��d��d��d��d�d��d��d��d[�d��d��dR�dR�d��d��d��dY�dV�dU�dY�dV�d �d �d͐d�d�d#�d�d�d3�d�d�d�d�d�d�d��d�dJ�d �d��d��dn�d
�d��d�d �d
�d �d
�d�d�d�d�d�d�d�d�dY�d�dܐd�d�d�d1�d�d�d�d�d�dr�d�dt�d �d �d �d �dq�d �d �d �d �d!�d"�d#�dѐdѐd$�d%�d1�ds�dq�d �dn�d&�dy�d&�d'�d(�d(�d)�d*�d+�d,�d-�d.�d �d��d'�d/�d/�d0�dݐd1�d2�dېd3�dŐdW�d��dI�dL�d��ds�d��d��d4�d5�d6�d7�d��dl�d�d8�d�d0�d9�d:�d;�d��d��d<�dl�d��dǐd=�d��d�d>�d5�d4�d7�d6�d?�d@�dA�d��dB�dC�dD�dE�dC�d��d��dF�d:�d�dm�d�dG�dؐd��dH�dאd�d��dI�d�dJ�d�d�dِd��dK�d�d�d�d��d��dL�dL�dM�dN�dO�dP�dP�dQ�dR�dS�dT�dU�dV�dV�dW�dX�dY�dZ�d��d[�d\�d]�d^�d_�d`�da�db�dc���Z'�dd�dD�dАde�d��dݐd�d �d�d��dO�dE�d,�d��dѐdf�d��dg�dh�dݐd��dܐd��d5�d�d��d͐dJ�d��d��d �di�dX�d��dj�"Z(d �dk�dl�dm�dn�do�dp�dq�dr�Z)ee)�ds e)�dt e)�du g�Z*e�dv�d?� ej� D ��Z+�dwe+d�< G �dx�dy� �dye,�Z-G �dz�d{� �d{e.�Z/dS (~ � )�absolute_import�division�unicode_literalsNz5Null character in input stream, replaced with U+FFFD.z Invalid codepoint in stream.z&Solidus (/) incorrectly placed in tag.z.Incorrect CR newline entity, replaced with LF.z9Entity used with illegal number (windows-1252 reference).zPNumeric entity couldn't be converted to character (codepoint U+%(charAsInt)08x).zBNumeric entity represents an illegal codepoint: U+%(charAsInt)08x.z#Numeric entity didn't end with ';'.z1Numeric entity expected. Got end of file instead.z'Numeric entity expected but none found.z!Named entity didn't end with ';'.z Named entity expected. Got none.z'End tag contains unexpected attributes.z.End tag contains unexpected self-closing flag.z#Expected tag name. Got '>' instead.zSExpected tag name. Got '?' instead. (HTML doesn't support processing instructions.)z-Expected tag name. Got something else insteadz6Expected closing tag. Got '>' instead. Ignoring '</>'.z-Expected closing tag. Unexpected end of file.z<Expected closing tag. Unexpected character '%(data)s' found.z'Unexpected end of file in the tag name.z8Unexpected end of file. Expected attribute name instead.z)Unexpected end of file in attribute name.z#Invalid character in attribute namez#Dropped duplicate attribute on tag.z1Unexpected end of file. Expected = or end of tag.z1Unexpected end of file. Expected attribute value.z*Expected attribute value. Got '>' instead.z"Unexpected = in unquoted attributez*Unexpected character in unquoted attributez*Unexpected character after attribute name.z+Unexpected character after attribute value.z.Unexpected end of file in attribute value (").z.Unexpected end of file in attribute value (').z*Unexpected end of file in attribute value.z)Unexpected end of file in tag. Expected >z/Unexpected character after / in tag. Expected >z&Expected '--' or 'DOCTYPE'. Not found.z Unexpected ! after -- in commentz$Unexpected space after -- in commentzIncorrect comment.z"Unexpected end of file in comment.z%Unexpected end of file in comment (-)z+Unexpected '-' after '--' found in comment.z'Unexpected end of file in comment (--).z&Unexpected character in comment found.z(No space after literal string 'DOCTYPE'.z.Unexpected > character. Expected DOCTYPE name.z.Unexpected end of file. Expected DOCTYPE name.z'Unexpected end of file in DOCTYPE name.z"Unexpected end of file in DOCTYPE.z%Expected space or '>'. Got '%(data)s'zUnexpected end of DOCTYPE.z Unexpected character in DOCTYPE.zXXX innerHTML EOFz Unexpected DOCTYPE. Ignored.z%html needs to be the first start tag.z)Unexpected End of file. Expected DOCTYPE.zErroneous DOCTYPE.z2Unexpected non-space characters. Expected DOCTYPE.z2Unexpected start tag (%(name)s). Expected DOCTYPE.z0Unexpected end tag (%(name)s). Expected DOCTYPE.z?Unexpected end tag (%(name)s) after the (implied) root element.z4Unexpected end of file. Expected end tag (%(name)s).z4Unexpected start tag head in existing head. Ignored.z'Unexpected end tag (%(name)s). Ignored.z;Unexpected start tag (%(name)s) that can be in head. Moved.z Unexpected start tag (%(name)s).zMissing end tag (%(name)s).z Missing end tags (%(name)s).zCUnexpected start tag (%(startName)s) implies end tag (%(endName)s).z@Unexpected start tag (%(originalName)s). Treated as %(newName)s.z,Unexpected start tag %(name)s. Don't use it!z'Unexpected start tag %(name)s. Ignored.zEUnexpected end tag (%(gotName)s). Missing end tag (%(expectedName)s).z:End tag (%(name)s) seen too early. Expected other end tag.zFUnexpected end tag (%(gotName)s). Expected end tag (%(expectedName)s).z+End tag (%(name)s) seen too early. Ignored.zQEnd tag (%(name)s) violates step 1, paragraph 1 of the adoption agency algorithm.zQEnd tag (%(name)s) violates step 1, paragraph 2 of the adoption agency algorithm.zQEnd tag (%(name)s) violates step 1, paragraph 3 of the adoption agency algorithm.zQEnd tag (%(name)s) violates step 4, paragraph 4 of the adoption agency algorithm.z>Unexpected end tag (%(originalName)s). Treated as %(newName)s.z'This element (%(name)s) has no end tag.z9Unexpected implied end tag (%(name)s) in the table phase.z>Unexpected implied end tag (%(name)s) in the table body phase.zDUnexpected non-space characters in table context caused voodoo mode.z3Unexpected input with type hidden in table context.z!Unexpected form in table context.zDUnexpected start tag (%(name)s) in table context caused voodoo mode.zBUnexpected end tag (%(name)s) in table context caused voodoo mode.zCUnexpected table cell start tag (%(name)s) in the table body phase.zFGot table cell end tag (%(name)s) while required end tags are missing.z?Unexpected end tag (%(name)s) in the table body phase. Ignored.z=Unexpected implied end tag (%(name)s) in the table row phase.z>Unexpected end tag (%(name)s) in the table row phase. Ignored.zJUnexpected select start tag in the select phase treated as select end tag.z/Unexpected input start tag in the select phase.zBUnexpected start tag token (%(name)s in the select phase. Ignored.z;Unexpected end tag (%(name)s) in the select phase. Ignored.zKUnexpected table element start tag (%(name)s) in the select in table phase.zIUnexpected table element end tag (%(name)s) in the select in table phase.z8Unexpected non-space characters in the after body phase.z>Unexpected start tag token (%(name)s) in the after body phase.z<Unexpected end tag token (%(name)s) in the after body phase.z@Unexpected characters in the frameset phase. Characters ignored.zEUnexpected start tag token (%(name)s) in the frameset phase. Ignored.zFUnexpected end tag token (frameset) in the frameset phase (innerHTML).zCUnexpected end tag token (%(name)s) in the frameset phase. Ignored.zEUnexpected non-space characters in the after frameset phase. Ignored.zEUnexpected start tag (%(name)s) in the after frameset phase. Ignored.zCUnexpected end tag (%(name)s) in the after frameset phase. Ignored.z(Unexpected end tag after body(innerHtml)z6Unexpected non-space characters. Expected end of file.z6Unexpected start tag (%(name)s). Expected end of file.z4Unexpected end tag (%(name)s). Expected end of file.z/Unexpected end of file. Expected table content.z0Unexpected end of file. Expected select content.z2Unexpected end of file. Expected frameset content.z0Unexpected end of file. Expected script content.z0Unexpected end of file. Expected foreign contentz0Trailing solidus not allowed on element %(name)sz2Element %(name)s not allowed in a non-html contextz*Unexpected end tag (%(name)s) before html.z9Element %(name)s not allowed in a inhead-noscript contextz8Unexpected end of file. Expected inhead-noscript contentz@Unexpected non-space character. Expected inhead-noscript contentz0Undefined error (this sucks and should be fixed))�znull-characterzinvalid-codepointzincorrectly-placed-soliduszincorrect-cr-newline-entityzillegal-windows-1252-entityzcant-convert-numeric-entityz$illegal-codepoint-for-numeric-entityz numeric-entity-without-semicolonz#expected-numeric-entity-but-got-eofzexpected-numeric-entityz named-entity-without-semicolonzexpected-named-entityzattributes-in-end-tagz self-closing-flag-on-end-tagz'expected-tag-name-but-got-right-bracketz'expected-tag-name-but-got-question-markzexpected-tag-namez*expected-closing-tag-but-got-right-bracketz expected-closing-tag-but-got-eofz!expected-closing-tag-but-got-charzeof-in-tag-namez#expected-attribute-name-but-got-eofzeof-in-attribute-namez#invalid-character-in-attribute-namezduplicate-attributez$expected-end-of-tag-name-but-got-eofz$expected-attribute-value-but-got-eofz.expected-attribute-value-but-got-right-bracketz"equals-in-unquoted-attribute-valuez0unexpected-character-in-unquoted-attribute-valuez&invalid-character-after-attribute-namez*unexpected-character-after-attribute-valuez#eof-in-attribute-value-double-quotez#eof-in-attribute-value-single-quotez eof-in-attribute-value-no-quotesz#unexpected-EOF-after-solidus-in-tagz)unexpected-character-after-solidus-in-tagzexpected-dashes-or-doctypez,unexpected-bang-after-double-dash-in-commentz-unexpected-space-after-double-dash-in-commentzincorrect-commentzeof-in-commentzeof-in-comment-end-dashz,unexpected-dash-after-double-dash-in-commentzeof-in-comment-double-dashz eof-in-comment-end-space-statez eof-in-comment-end-bang-statezunexpected-char-in-commentzneed-space-after-doctypez+expected-doctype-name-but-got-right-bracketz!expected-doctype-name-but-got-eofzeof-in-doctype-namezeof-in-doctypez*expected-space-or-right-bracket-in-doctypezunexpected-end-of-doctypezunexpected-char-in-doctypezeof-in-innerhtmlzunexpected-doctypez
non-html-rootz expected-doctype-but-got-eofzunknown-doctypez expected-doctype-but-got-charsz"expected-doctype-but-got-start-tagz expected-doctype-but-got-end-tagzend-tag-after-implied-rootz&expected-named-closing-tag-but-got-eofz!two-heads-are-not-better-than-onezunexpected-end-tagz#unexpected-start-tag-out-of-my-headzunexpected-start-tagzmissing-end-tagzmissing-end-tagsz$unexpected-start-tag-implies-end-tagz unexpected-start-tag-treated-aszdeprecated-tagz unexpected-start-tag-ignoredz$expected-one-end-tag-but-got-anotherzend-tag-too-earlyzend-tag-too-early-namedzend-tag-too-early-ignoredzadoption-agency-1.1zadoption-agency-1.2zadoption-agency-1.3zadoption-agency-4.4z unexpected-end-tag-treated-asz
no-end-tagz#unexpected-implied-end-tag-in-tablez(unexpected-implied-end-tag-in-table-bodyz$unexpected-char-implies-table-voodooz unexpected-hidden-input-in-tablezunexpected-form-in-tablez)unexpected-start-tag-implies-table-voodooz'unexpected-end-tag-implies-table-voodooz unexpected-cell-in-table-bodyzunexpected-cell-end-tagz unexpected-end-tag-in-table-bodyz'unexpected-implied-end-tag-in-table-rowz unexpected-end-tag-in-table-rowzunexpected-select-in-selectzunexpected-input-in-selectz unexpected-start-tag-in-selectz unexpected-end-tag-in-selectz5unexpected-table-element-start-tag-in-select-in-tablez3unexpected-table-element-end-tag-in-select-in-tablezunexpected-char-after-bodyz unexpected-start-tag-after-bodyz unexpected-end-tag-after-bodyzunexpected-char-in-framesetz unexpected-start-tag-in-framesetz)unexpected-frameset-in-frameset-innerhtmlz unexpected-end-tag-in-framesetz unexpected-char-after-framesetz#unexpected-start-tag-after-framesetz!unexpected-end-tag-after-framesetz'unexpected-end-tag-after-body-innerhtmlzexpected-eof-but-got-charz expected-eof-but-got-start-tagz expected-eof-but-got-end-tagz eof-in-tablez
eof-in-selectzeof-in-framesetzeof-in-script-in-scriptzeof-in-foreign-landsz&non-void-element-with-trailing-solidusz*unexpected-html-element-in-foreign-contentz unexpected-end-tag-before-htmlz unexpected-inhead-noscript-tagzeof-in-head-noscriptzchar-in-head-noscriptzXXX-undefined-errorz http://www.w3.org/1999/xhtmlz"http://www.w3.org/1998/Math/MathMLzhttp://www.w3.org/2000/svgz http://www.w3.org/1999/xlinkz$http://www.w3.org/XML/1998/namespacez http://www.w3.org/2000/xmlns/)�html�mathml�svg�xlink�xml�xmlnsr ZappletZcaptionZmarquee�object�tableZtdZthr Zmi�moZmnZmsZmtextzannotation-xmlr Z
foreignObjectZdesc�title�a�bZbig�codeZemZfont�iZnobr�sZsmallZstrikeZstrongZtt�uZaddressZareaZarticleZaside�baseZbasefontZbgsoundZ
blockquoteZbody�br�button�center�colZcolgroup�commandZdd�details�dirZdivZdlZdtZembed�fieldsetZfigureZfooterZform�frameZframeset�h1�h2�h3�h4�h5�h6�head�header�hrZiframeZimage�img�inputZisindexZli�linkZlisting�menu�metaZnavZnoembedZnoframesZnoscriptZol�pZparamZ plaintextZpre�scriptZsection�select�styleZtbodyZtextareaZtfootZtheadZtrZulZwbrZxmpz
annotaion-xmlZ
attributeNameZ
attributeTypeZ
baseFrequencyZ baseProfileZcalcModeZ
clipPathUnitsZcontentScriptTypeZcontentStyleTypeZdiffuseConstantZedgeModeZexternalResourcesRequiredZ filterResZ filterUnitsZglyphRefZgradientTransformZ
gradientUnitsZ kernelMatrixZkernelUnitLengthZ keyPointsZ
keySplinesZkeyTimesZ lengthAdjustZlimitingConeAngleZ markerHeightZ markerUnitsZ markerWidthZmaskContentUnitsZ maskUnitsZ
numOctavesZ
pathLengthZpatternContentUnitsZpatternTransformZ patternUnitsZ pointsAtXZ pointsAtYZ pointsAtZZ
preserveAlphaZpreserveAspectRatioZprimitiveUnitsZrefXZrefYZ repeatCountZ repeatDurZrequiredExtensionsZrequiredFeaturesZspecularConstantZspecularExponentZ spreadMethodZ startOffsetZ stdDeviationZ stitchTilesZ surfaceScaleZsystemLanguageZ tableValuesZtargetXZtargetYZ
textLengthZviewBoxZ
viewTargetZxChannelSelectorZyChannelSelectorZ
zoomAndPan)>Z
attributenameZ
attributetypeZ
basefrequencyZ baseprofileZcalcmodeZ
clippathunitsZcontentscripttypeZcontentstyletypeZdiffuseconstantZedgemodeZexternalresourcesrequiredZ filterresZ filterunitsZglyphrefZgradienttransformZ
gradientunitsZ kernelmatrixZkernelunitlengthZ keypointsZ
keysplinesZkeytimesZ lengthadjustZlimitingconeangleZ markerheightZ markerunitsZ markerwidthZmaskcontentunitsZ maskunitsZ
numoctavesZ
pathlengthZpatterncontentunitsZpatterntransformZ patternunitsZ pointsatxZ pointsatyZ pointsatzZ
preservealphaZpreserveaspectratioZprimitiveunitsZrefxZrefyZ repeatcountZ repeatdurZrequiredextensionsZrequiredfeaturesZspecularconstantZspecularexponentZ spreadmethodZ startoffsetZ stddeviationZ stitchtilesZ surfacescaleZsystemlanguageZ tablevaluesZtargetxZtargetyZ
textlengthZviewboxZ
viewtargetZxchannelselectorZychannelselectorZ
zoomandpanZ
definitionurlZ
definitionURLr ZactuateZarcroleZhrefZroleZshow�typer ZlangZspacer
) z
xlink:actuatez
xlink:arcrolez
xlink:hrefz
xlink:rolez
xlink:showz xlink:titlez
xlink:typezxml:basezxml:langz xml:spacer
z xmlns:xlinkc C s" g | ]\}\}}}||f|f�qS � r2 )�.0Zqname�prefixZlocal�nsr2 r2 � /usr/lib/python3.6/constants.py�
<listcomp>
s r7 � �
� � �
c C s g | ]}t |�t |j� �f�qS r2 )�ord�lower)r3 �cr2 r2 r6 r7 # s z event-source�sourceZtrackZ
irrelevantZscopedZismapZautoplayZcontrolsZdefer�async�openZmultipleZdisabledZhiddenZchecked�defaultZnoshadeZ
autosubmit�readonlyZselectedZ autofocusZrequired)� r0 r( ZaudioZvideor. r Zdatagridr r' r+ r ZoptionZoptgroupr r) r/ �output� � � � � �& � �! �� �0 �` �9 �R �} � � � � �" � � �� �"! �a �: �S �~ �x zlt;zgt;zamp;zapos;zquot;� Æ�&� Áu Ă� Âu Аu 𝔄� Àu Αu Āu ⩓u Ąu 𝔸u � Åu 𝒜u ≔� Ã� Äu ∖u ⫧u ⌆u Бu ∵u ℬu Βu 𝔅u 𝔹u ˘u ≎u Ч� ©u Ću ⋒u ⅅu ℭu Č� Çu Ĉu ∰u Ċ� ¸� ·u Χu ⊙u ⊖u ⊕u ⊗u ∲u ”u ’u ∷u ⩴u ≡u ∯u ∮u ℂu ∐u ∳u ⨯u 𝒞u ⋓u ≍u ⤑u Ђu Ѕu Џu ‡u ↡u ⫤u Ďu Дu ∇u Δu 𝔇� ´u ˙u ˝�`u ˜u ⋄u ⅆu 𝔻� ¨u ⃜u ≐u ⇓u ⇐u ⇔u ⟸u ⟺u ⟹u ⇒u ⊨u ⇑u ⇕u ∥u ↓u ⤓u ⇵u ̑u ⥐u ⥞u ↽u ⥖u ⥟u ⇁u ⥗u ⊤u ↧u 𝒟u Đu Ŋ� Ð� Éu Ě� Êu Эu Ėu 𝔈� Èu ∈u Ēu ◻u ▫u Ęu 𝔼u Εu ⩵u ≂u ⇌u ℰu ⩳u Η� Ëu ∃u ⅇu Фu 𝔉u ◼u ▪u 𝔽u ∀u ℱu Ѓ�>u Γu Ϝu Ğu Ģu Ĝu Гu Ġu 𝔊u ⋙u 𝔾u ≥u ⋛u ≧u ⪢u ≷u ⩾u ≳u 𝒢u ≫u Ъu ˇ�^u Ĥu ℌu ℋu ℍu ─u Ħu ≏u Еu IJu Ё� Í� Îu Иu İu ℑ� Ìu Īu ⅈu ∬u ∫u ⋂u u u Įu 𝕀u Ιu ℐu Ĩu І� Ïu Ĵu Йu 𝔍u 𝕁u 𝒥u Јu Єu Хu Ќu Κu Ķu Кu 𝔎u 𝕂u 𝒦u Љ�<u Ĺu Λu ⟪u ℒu ↞u Ľu Ļu Лu ⟨u ←u ⇤u ⇆u ⌈u ⟦u ⥡u ⇃u ⥙u ⌊u ↔u ⥎u ⊣u ↤u ⥚u ⊲u ⧏u ⊴u ⥑u ⥠u ↿u ⥘u ↼u ⥒u ⋚u ≦u ≶u ⪡u ⩽u ≲u 𝔏u ⋘u ⇚u Ŀu ⟵u ⟷u ⟶u 𝕃u ↙u ↘u ↰u Łu ≪u ⤅u Мu u ℳu 𝔐u ∓u 𝕄u Μu Њu Ńu Ňu Ņu Нu u 𝔑u � u ℕu ⫬u ≢u ≭u ∦u ∉u ≠u ≂̸u ∄u ≯u ≱u ≧̸u ≫̸u ≹u ⩾̸u ≵u ≎̸u ≏̸u ⋪u ⧏̸u ⋬u ≮u ≰u ≸u ≪̸u ⩽̸u ≴u ⪢̸u ⪡̸u ⊀u ⪯̸u ⋠u ∌u ⋫u ⧐̸u ⋭u ⊏̸u ⋢u ⊐̸u ⋣u ⊂⃒u ⊈u ⊁u ⪰̸u ⋡u ≿̸u ⊃⃒u ⊉u ≁u ≄u ≇u ≉u ∤u 𝒩� Ñu Νu Œ� Ó� Ôu Оu Őu 𝔒� Òu Ōu Ωu Οu 𝕆u “u ‘u ⩔u 𝒪� Ø� Õu ⨷� Öu ‾u ⏞u ⎴u ⏜u ∂u Пu 𝔓u Φu Π� ±u ℙu ⪻u ≺u ⪯u ≼u ≾u ″u ∏u ∝u 𝒫u Ψ�"u 𝔔u ℚu 𝒬u ⤐� ®u Ŕu ⟫u ↠u ⤖u Řu Ŗu Рu ℜu ∋u ⇋u ⥯u Ρu ⟩u →u ⇥u ⇄u ⌉u ⟧u ⥝u ⇂u ⥕u ⌋u ⊢u ↦u ⥛u ⊳u ⧐u ⊵u ⥏u ⥜u ↾u ⥔u ⇀u ⥓u ℝu ⥰u ⇛u ℛu ↱u ⧴u Щu Шu Ьu Śu ⪼u Šu Şu Ŝu Сu 𝔖u ↑u Σu ∘u 𝕊u √u □u ⊓u ⊏u ⊑u ⊐u ⊒u ⊔u 𝒮u ⋆u ⋐u ⊆u ≻u ⪰u ≽u ≿u ∑u ⋑u ⊃u ⊇� Þu ™u Ћu Цu Τu Ťu Ţu Тu 𝔗u ∴u Θu u u ∼u ≃u ≅u ≈u 𝕋u ⃛u 𝒯u Ŧ� Úu ↟u ⥉u Ўu Ŭ� Ûu Уu Űu 𝔘� Ùu Ū�_u ⏟u ⎵u ⏝u ⋃u ⊎u Ųu 𝕌u ⤒u ⇅u ↕u ⥮u ⊥u ↥u ↖u ↗u ϒu Υu Ůu 𝒰u Ũ� Üu ⊫u ⫫u Вu ⊩u ⫦u ⋁u ‖u ∣�|u ❘u ≀u u 𝔙u 𝕍u 𝒱u ⊪u Ŵu ⋀u 𝔚u 𝕎u 𝒲u 𝔛u Ξu 𝕏u 𝒳u Яu Їu Ю� Ýu Ŷu Ыu 𝔜u 𝕐u 𝒴u Ÿu Жu Źu Žu Зu Żu Ζu ℨu ℤu 𝒵� áu ău ∾u ∾̳u ∿� âu а� æu 𝔞� àu ℵu αu āu ⨿u ∧u ⩕u ⩜u ⩘u ⩚u ∠u ⦤u ∡u ⦨u ⦩u ⦪u ⦫u ⦬u ⦭u ⦮u ⦯u ∟u ⊾u ⦝u ∢u ⍼u ąu 𝕒u ⩰u ⩯u ≊u ≋�'� åu 𝒶�*� ã� äu ⨑u ⫭u ≌u ϶u ‵u ∽u ⋍u ⊽u ⌅u ⎶u бu „u ⦰u βu ℶu ≬u 𝔟u ◯u ⨀u ⨁u ⨂u ⨆u ★u ▽u △u ⨄u ⤍u ⧫u ▴u ▾u ◂u ▸u ␣u ▒u ░u ▓u █u =⃥u ≡⃥u ⌐u 𝕓u ⋈u ╗u ╔u ╖u ╓u ═u ╦u ╩u ╤u ╧u ╝u ╚u ╜u ╙u ║u ╬u ╣u ╠u ╫u ╢u ╟u ⧉u ╕u ╒u ┐u ┌u ╥u ╨u ┬u ┴u ⊟u ⊞u ⊠u ╛u ╘u ┘u └u │u ╪u ╡u ╞u ┼u ┤u ├� ¦u 𝒷u ⁏�\u ⧅u ⟈u •u ⪮u ću ∩u ⩄u ⩉u ⩋u ⩇u ⩀u ∩︀u ⁁u ⩍u č� çu ĉu ⩌u ⩐u ċu ⦲� ¢u 𝔠u чu ✓u χu ○u ⧃u ˆu ≗u ↺u ↻u Ⓢu ⊛u ⊚u ⊝u ⨐u ⫯u ⧂u ♣�:�,�@u ∁u ⩭u 𝕔u ℗u ↵u ✗u 𝒸u ⫏u ⫑u ⫐u ⫒u ⋯u ⤸u ⤵u ⋞u ⋟u ↶u ⤽u ∪u ⩈u ⩆u ⩊u ⊍u ⩅u ∪︀u ↷u ⤼u ⋎u ⋏� ¤u ∱u ⌭u ⥥u †u ℸu ‐u ⤏u ďu дu ⇊u ⩷� °u δu ⦱u ⥿u 𝔡u ♦u ϝu ⋲� ÷u ⋇u ђu ⌞u ⌍�$u 𝕕u ≑u ∸u ∔u ⊡u ⌟u ⌌u 𝒹u ѕu ⧶u đu ⋱u ▿u ⦦u џu ⟿� éu ⩮u ěu ≖� êu ≕u эu ėu ≒u 𝔢u ⪚� èu ⪖u ⪘u ⪙u ⏧u ℓu ⪕u ⪗u ēu ∅u u u u ŋu u ęu 𝕖u ⋕u ⧣u ⩱u εu ϵ�=u ≟u ⩸u ⧥u ≓u ⥱u ℯu η� ð� ëu €�!u фu ♀u ffiu ffu fflu 𝔣u fiZfju ♭u flu ▱u ƒu 𝕗u ⋔u ⫙u ⨍� ½u ⅓� ¼u ⅕u ⅙u ⅛u ⅔u ⅖� ¾u ⅗u ⅜u ⅘u ⅚u ⅝u ⅞u ⁄u ⌢u 𝒻u ⪌u ǵu γu ⪆u ğu ĝu гu ġu ⪩u ⪀u ⪂u ⪄u ⋛︀u ⪔u 𝔤u ℷu ѓu ⪒u ⪥u ⪤u ≩u ⪊u ⪈u ⋧u 𝕘u ℊu ⪎u ⪐u ⪧u ⩺u ⋗u ⦕u ⩼u ⥸u ≩︀u ъu ⥈u ↭u ℏu ĥu ♥u …u ⊹u 𝔥u ⤥u ⤦u ⇿u ∻u ↩u ↪u 𝕙u ―u 𝒽u ħu ⁃� í� îu иu е� ¡u 𝔦� ìu ⨌u ∭u ⧜u ℩u iju īu ıu ⊷u Ƶu ℅u ∞u ⧝u ⊺u ⨗u ⨼u ёu įu 𝕚u ι� ¿u 𝒾u ⋹u ⋵u ⋴u ⋳u ĩu і� ïu ĵu йu 𝔧u ȷu 𝕛u 𝒿u јu єu κu ϰu ķu кu 𝔨u ĸu хu ќu 𝕜u 𝓀u ⤛u ⤎u ⪋u ⥢u ĺu ⦴u λu ⦑u ⪅� «u ⤟u ⤝u ↫u ⤹u ⥳u ↢u ⪫u ⤙u ⪭u ⪭︀u ⤌u ❲�{�[u ⦋u ⦏u ⦍u ľu ļu лu ⤶u ⥧u ⥋u ↲u ≤u ⇇u ⋋u ⪨u ⩿u ⪁u ⪃u ⋚︀u ⪓u ⋖u ⥼u 𝔩u ⪑u ⥪u ▄u љu ⥫u ◺u ŀu ⎰u ≨u ⪉u ⪇u ⋦u ⟬u ⇽u ⟼u ↬u ⦅u 𝕝u ⨭u ⨴u ∗u ◊�(u ⦓u ⥭u u ⊿u ‹u 𝓁u ⪍u ⪏u ‚u łu ⪦u ⩹u ⋉u ⥶u ⩻u ⦖u ◃u ⥊u ⥦u ≨︀u ∺� ¯u ♂u ✠u ▮u ⨩u мu —u 𝔪u ℧� µu ⫰u −u ⨪u ⫛u ⊧u 𝕞u 𝓂u μu ⊸u ⋙̸u ≫⃒u ⇍u ⇎u ⋘̸u ≪⃒u ⇏u ⊯u ⊮u ńu ∠⃒u ⩰̸u ≋̸u ʼnu ♮u ⩃u ňu ņu ⩭̸u ⩂u нu –u ⇗u ⤤u ≐̸u ⤨u 𝔫u ↮u ⫲u ⋼u ⋺u њu ≦̸u ↚u ‥u 𝕟� ¬u ⋹̸u ⋵̸u ⋷u ⋶u ⋾u ⋽u ⫽⃥u ∂̸u ⨔u ↛u ⤳̸u ↝̸u 𝓃u ⊄u ⫅̸u ⊅u ⫆̸� ñu ν�#u №u u ⊭u ⤄u ≍⃒u ⊬u ≥⃒u >⃒u ⧞u ⤂u ≤⃒u <⃒u ⊴⃒u ⤃u ⊵⃒u ∼⃒u ⇖u ⤣u ⤧� ó� ôu оu őu ⨸u ⦼u œu ⦿u 𝔬u ˛� òu ⧁u ⦵u ⦾u ⦻u ⧀u ōu ωu οu ⦶u 𝕠u ⦷u ⦹u ∨u ⩝u ℴ� ª� ºu ⊶u ⩖u ⩗u ⩛� øu ⊘� õu ⨶� öu ⌽� ¶u ⫳u ⫽u п�%�.u ‰u ‱u 𝔭u φu ϕu ☎u πu ϖu ℎ�+u ⨣u ⨢u ⨥u ⩲u ⨦u ⨧u ⨕u 𝕡� £u ⪳u ⪷u ⪹u ⪵u ⋨u ′u ⌮u ⌒u ⌓u ⊰u 𝓅u ψu u 𝔮u 𝕢u ⁗u 𝓆u ⨖�?u ⤜u ⥤u ∽̱u ŕu ⦳u ⦒u ⦥� »u ⥵u ⤠u ⤳u ⤞u ⥅u ⥴u ↣u ↝u ⤚u ∶u ❳�}�]u ⦌u ⦎u ⦐u řu ŗu рu ⤷u ⥩u ↳u ▭u ⥽u 𝔯u ⥬u ρu ϱu ⇉u ⋌u ˚u u ⎱u ⫮u ⟭u ⇾u ⦆u 𝕣u ⨮u ⨵�)u ⦔u ⨒u ›u 𝓇u ⋊u ▹u ⧎u ⥨u ℞u śu ⪴u ⪸u šu şu ŝu ⪶u ⪺u ⋩u ⨓u сu ⋅u ⩦u ⇘� §�;u ⤩u ✶u 𝔰u ♯u щu ш� u σu ςu ⩪u ⪞u ⪠u ⪝u ⪟u ≆u ⨤u ⥲u ⨳u ⧤u ⌣u ⪪u ⪬u ⪬︀u ь�/u ⧄u ⌿u 𝕤u ♠u ⊓︀u ⊔︀u 𝓈u ☆u ⊂u ⫅u ⪽u ⫃u ⫁u ⫋u ⊊u ⪿u ⥹u ⫇u ⫕u ⫓u ♪� ¹� ²� ³u ⫆u ⪾u ⫘u ⫄u ⟉u ⫗u ⥻u ⫂u ⫌u ⊋u ⫀u ⫈u ⫔u ⫖u ⇙u ⤪� ßu ⌖u τu ťu ţu тu ⌕u 𝔱u θu ϑ� þ� ×u ⨱u ⨰u ⌶u ⫱u 𝕥u ⫚u ‴u ▵u ≜u ◬u ⨺u ⨹u ⧍u ⨻u ⏢u 𝓉u цu ћu ŧu ⥣� úu ўu ŭ� ûu уu űu ⥾u 𝔲� ùu ▀u ⌜u ⌏u ◸u ūu ųu 𝕦u υu ⇈u ⌝u ⌎u ůu ◹u 𝓊u ⋰u ũ� üu ⦧u ⫨u ⫩u ⦜u ⊊︀u ⫋︀u ⊋︀u ⫌︀u вu ⊻u ≚u ⋮u 𝔳u 𝕧u 𝓋u ⦚u ŵu ⩟u ≙u ℘u 𝔴u 𝕨u 𝓌u 𝔵u ξu ⋻u 𝕩u 𝓍� ýu яu ŷu ы� ¥u 𝔶u їu 𝕪u 𝓎u ю� ÿu źu žu зu żu ζu 𝔷u жu ⇝u 𝕫u 𝓏u u (� ZAEligzAElig;ZAMPzAMP;ZAacutezAacute;zAbreve;ZAcirczAcirc;zAcy;zAfr;ZAgravezAgrave;zAlpha;zAmacr;zAnd;zAogon;zAopf;zApplyFunction;ZAringzAring;zAscr;zAssign;ZAtildezAtilde;ZAumlzAuml;z
Backslash;zBarv;zBarwed;zBcy;zBecause;z Bernoullis;zBeta;zBfr;zBopf;zBreve;zBscr;zBumpeq;zCHcy;ZCOPYzCOPY;zCacute;zCap;zCapitalDifferentialD;zCayleys;zCcaron;ZCcedilzCcedil;zCcirc;zCconint;zCdot;zCedilla;z
CenterDot;zCfr;zChi;z
CircleDot;z CircleMinus;z CirclePlus;z CircleTimes;zClockwiseContourIntegral;zCloseCurlyDoubleQuote;zCloseCurlyQuote;zColon;zColone;z
Congruent;zConint;zContourIntegral;zCopf;z
Coproduct;z CounterClockwiseContourIntegral;zCross;zCscr;zCup;zCupCap;zDD;z DDotrahd;zDJcy;zDScy;zDZcy;zDagger;zDarr;zDashv;zDcaron;zDcy;zDel;zDelta;zDfr;zDiacriticalAcute;zDiacriticalDot;zDiacriticalDoubleAcute;zDiacriticalGrave;zDiacriticalTilde;zDiamond;zDifferentialD;zDopf;zDot;zDotDot;z DotEqual;zDoubleContourIntegral;z
DoubleDot;zDoubleDownArrow;zDoubleLeftArrow;zDoubleLeftRightArrow;zDoubleLeftTee;zDoubleLongLeftArrow;zDoubleLongLeftRightArrow;zDoubleLongRightArrow;zDoubleRightArrow;zDoubleRightTee;zDoubleUpArrow;zDoubleUpDownArrow;zDoubleVerticalBar;z
DownArrow;z
DownArrowBar;zDownArrowUpArrow;z
DownBreve;zDownLeftRightVector;zDownLeftTeeVector;zDownLeftVector;zDownLeftVectorBar;zDownRightTeeVector;zDownRightVector;zDownRightVectorBar;zDownTee;z
DownTeeArrow;z
Downarrow;zDscr;zDstrok;zENG;ZETHzETH;ZEacutezEacute;zEcaron;ZEcirczEcirc;zEcy;zEdot;zEfr;ZEgravezEgrave;zElement;zEmacr;zEmptySmallSquare;zEmptyVerySmallSquare;zEogon;zEopf;zEpsilon;zEqual;z EqualTilde;z Equilibrium;zEscr;zEsim;zEta;ZEumlzEuml;zExists;z
ExponentialE;zFcy;zFfr;zFilledSmallSquare;zFilledVerySmallSquare;zFopf;zForAll;z Fouriertrf;zFscr;zGJcy;ZGTzGT;zGamma;zGammad;zGbreve;zGcedil;zGcirc;zGcy;zGdot;zGfr;zGg;zGopf;z
GreaterEqual;zGreaterEqualLess;zGreaterFullEqual;zGreaterGreater;z GreaterLess;zGreaterSlantEqual;z
GreaterTilde;zGscr;zGt;zHARDcy;zHacek;zHat;zHcirc;zHfr;z
HilbertSpace;zHopf;zHorizontalLine;zHscr;zHstrok;z
HumpDownHump;z
HumpEqual;zIEcy;zIJlig;zIOcy;ZIacutezIacute;ZIcirczIcirc;zIcy;zIdot;zIfr;ZIgravezIgrave;zIm;zImacr;z ImaginaryI;zImplies;zInt;z Integral;z
Intersection;zInvisibleComma;zInvisibleTimes;zIogon;zIopf;zIota;zIscr;zItilde;zIukcy;ZIumlzIuml;zJcirc;zJcy;zJfr;zJopf;zJscr;zJsercy;zJukcy;zKHcy;zKJcy;zKappa;zKcedil;zKcy;zKfr;zKopf;zKscr;zLJcy;ZLTzLT;zLacute;zLambda;zLang;z Laplacetrf;zLarr;zLcaron;zLcedil;zLcy;zLeftAngleBracket;z
LeftArrow;z
LeftArrowBar;zLeftArrowRightArrow;z LeftCeiling;zLeftDoubleBracket;zLeftDownTeeVector;zLeftDownVector;zLeftDownVectorBar;z
LeftFloor;zLeftRightArrow;zLeftRightVector;zLeftTee;z
LeftTeeArrow;zLeftTeeVector;z
LeftTriangle;zLeftTriangleBar;zLeftTriangleEqual;zLeftUpDownVector;zLeftUpTeeVector;z
LeftUpVector;zLeftUpVectorBar;z LeftVector;zLeftVectorBar;z
Leftarrow;zLeftrightarrow;zLessEqualGreater;zLessFullEqual;z LessGreater;z LessLess;zLessSlantEqual;z
LessTilde;zLfr;zLl;z Lleftarrow;zLmidot;zLongLeftArrow;zLongLeftRightArrow;zLongRightArrow;zLongleftarrow;zLongleftrightarrow;zLongrightarrow;zLopf;zLowerLeftArrow;zLowerRightArrow;zLscr;zLsh;zLstrok;zLt;zMap;zMcy;z MediumSpace;z
Mellintrf;zMfr;z
MinusPlus;zMopf;zMscr;zMu;zNJcy;zNacute;zNcaron;zNcedil;zNcy;zNegativeMediumSpace;zNegativeThickSpace;zNegativeThinSpace;zNegativeVeryThinSpace;zNestedGreaterGreater;zNestedLessLess;zNewLine;zNfr;zNoBreak;zNonBreakingSpace;zNopf;zNot;z
NotCongruent;z
NotCupCap;zNotDoubleVerticalBar;z NotElement;z NotEqual;zNotEqualTilde;z
NotExists;z NotGreater;zNotGreaterEqual;zNotGreaterFullEqual;zNotGreaterGreater;zNotGreaterLess;zNotGreaterSlantEqual;zNotGreaterTilde;zNotHumpDownHump;z
NotHumpEqual;zNotLeftTriangle;zNotLeftTriangleBar;zNotLeftTriangleEqual;zNotLess;z
NotLessEqual;zNotLessGreater;z NotLessLess;zNotLessSlantEqual;z
NotLessTilde;zNotNestedGreaterGreater;zNotNestedLessLess;z NotPrecedes;zNotPrecedesEqual;zNotPrecedesSlantEqual;zNotReverseElement;zNotRightTriangle;zNotRightTriangleBar;zNotRightTriangleEqual;zNotSquareSubset;zNotSquareSubsetEqual;zNotSquareSuperset;zNotSquareSupersetEqual;z
NotSubset;zNotSubsetEqual;z NotSucceeds;zNotSucceedsEqual;zNotSucceedsSlantEqual;zNotSucceedsTilde;z NotSuperset;zNotSupersetEqual;z NotTilde;zNotTildeEqual;zNotTildeFullEqual;zNotTildeTilde;zNotVerticalBar;zNscr;ZNtildezNtilde;zNu;zOElig;ZOacutezOacute;ZOcirczOcirc;zOcy;zOdblac;zOfr;ZOgravezOgrave;zOmacr;zOmega;zOmicron;zOopf;zOpenCurlyDoubleQuote;zOpenCurlyQuote;zOr;zOscr;ZOslashzOslash;ZOtildezOtilde;zOtimes;ZOumlzOuml;zOverBar;z
OverBrace;z OverBracket;zOverParenthesis;z PartialD;zPcy;zPfr;zPhi;zPi;z
PlusMinus;zPoincareplane;zPopf;zPr;z Precedes;zPrecedesEqual;zPrecedesSlantEqual;zPrecedesTilde;zPrime;zProduct;z Proportion;z
Proportional;zPscr;zPsi;ZQUOTzQUOT;zQfr;zQopf;zQscr;zRBarr;ZREGzREG;zRacute;zRang;zRarr;zRarrtl;zRcaron;zRcedil;zRcy;zRe;zReverseElement;zReverseEquilibrium;zReverseUpEquilibrium;zRfr;zRho;zRightAngleBracket;z RightArrow;zRightArrowBar;zRightArrowLeftArrow;z
RightCeiling;zRightDoubleBracket;zRightDownTeeVector;zRightDownVector;zRightDownVectorBar;z RightFloor;z RightTee;zRightTeeArrow;zRightTeeVector;zRightTriangle;zRightTriangleBar;zRightTriangleEqual;zRightUpDownVector;zRightUpTeeVector;zRightUpVector;zRightUpVectorBar;z RightVector;zRightVectorBar;z Rightarrow;zRopf;z
RoundImplies;z Rrightarrow;zRscr;zRsh;z RuleDelayed;zSHCHcy;zSHcy;zSOFTcy;zSacute;zSc;zScaron;zScedil;zScirc;zScy;zSfr;zShortDownArrow;zShortLeftArrow;zShortRightArrow;z
ShortUpArrow;zSigma;z SmallCircle;zSopf;zSqrt;zSquare;zSquareIntersection;z
SquareSubset;zSquareSubsetEqual;zSquareSuperset;zSquareSupersetEqual;z SquareUnion;zSscr;zStar;zSub;zSubset;z SubsetEqual;z Succeeds;zSucceedsEqual;zSucceedsSlantEqual;zSucceedsTilde;z SuchThat;zSum;zSup;z Superset;zSupersetEqual;zSupset;ZTHORNzTHORN;zTRADE;zTSHcy;zTScy;zTab;zTau;zTcaron;zTcedil;zTcy;zTfr;z
Therefore;zTheta;z ThickSpace;z
ThinSpace;zTilde;z TildeEqual;zTildeFullEqual;z TildeTilde;zTopf;z
TripleDot;zTscr;zTstrok;ZUacutezUacute;zUarr;z Uarrocir;zUbrcy;zUbreve;ZUcirczUcirc;zUcy;zUdblac;zUfr;ZUgravezUgrave;zUmacr;z UnderBar;z UnderBrace;z
UnderBracket;zUnderParenthesis;zUnion;z
UnionPlus;zUogon;zUopf;zUpArrow;z UpArrowBar;zUpArrowDownArrow;z UpDownArrow;zUpEquilibrium;zUpTee;z UpTeeArrow;zUparrow;z Updownarrow;zUpperLeftArrow;zUpperRightArrow;zUpsi;zUpsilon;zUring;zUscr;zUtilde;ZUumlzUuml;zVDash;zVbar;zVcy;zVdash;zVdashl;zVee;zVerbar;zVert;z VerticalBar;z
VerticalLine;zVerticalSeparator;zVerticalTilde;zVeryThinSpace;zVfr;zVopf;zVscr;zVvdash;zWcirc;zWedge;zWfr;zWopf;zWscr;zXfr;zXi;zXopf;zXscr;zYAcy;zYIcy;zYUcy;ZYacutezYacute;zYcirc;zYcy;zYfr;zYopf;zYscr;zYuml;zZHcy;zZacute;zZcaron;zZcy;zZdot;zZeroWidthSpace;zZeta;zZfr;zZopf;zZscr;Zaacutezaacute;zabreve;zac;zacE;zacd;Zacirczacirc;Zacutezacute;zacy;Zaeligzaelig;zaf;zafr;Zagravezagrave;zalefsym;zaleph;zalpha;zamacr;zamalg;Zampzamp;zand;zandand;zandd;z andslope;zandv;zang;zange;zangle;zangmsd;z angmsdaa;z angmsdab;z angmsdac;z angmsdad;z angmsdae;z angmsdaf;z angmsdag;z angmsdah;zangrt;zangrtvb;z angrtvbd;zangsph;zangst;zangzarr;zaogon;zaopf;zap;zapE;zapacir;zape;zapid;zapos;zapprox;z approxeq;Zaringzaring;zascr;zast;zasymp;zasympeq;Zatildezatilde;Zaumlzauml;z awconint;zawint;zbNot;z backcong;z backepsilon;z
backprime;zbacksim;z
backsimeq;zbarvee;zbarwed;z barwedge;zbbrk;z bbrktbrk;zbcong;zbcy;zbdquo;zbecaus;zbecause;zbemptyv;zbepsi;zbernou;zbeta;zbeth;zbetween;zbfr;zbigcap;zbigcirc;zbigcup;zbigodot;z bigoplus;z
bigotimes;z bigsqcup;zbigstar;zbigtriangledown;zbigtriangleup;z biguplus;zbigvee;z bigwedge;zbkarow;z
blacklozenge;z blacksquare;zblacktriangle;zblacktriangledown;zblacktriangleleft;zblacktriangleright;zblank;zblk12;zblk14;zblk34;zblock;zbne;zbnequiv;zbnot;zbopf;zbot;zbottom;zbowtie;zboxDL;zboxDR;zboxDl;zboxDr;zboxH;zboxHD;zboxHU;zboxHd;zboxHu;zboxUL;zboxUR;zboxUl;zboxUr;zboxV;zboxVH;zboxVL;zboxVR;zboxVh;zboxVl;zboxVr;zboxbox;zboxdL;zboxdR;zboxdl;zboxdr;zboxh;zboxhD;zboxhU;zboxhd;zboxhu;z boxminus;zboxplus;z boxtimes;zboxuL;zboxuR;zboxul;zboxur;zboxv;zboxvH;zboxvL;zboxvR;zboxvh;zboxvl;zboxvr;zbprime;zbreve;Zbrvbarzbrvbar;zbscr;zbsemi;zbsim;zbsime;zbsol;zbsolb;z bsolhsub;zbull;zbullet;zbump;zbumpE;zbumpe;zbumpeq;zcacute;zcap;zcapand;z capbrcup;zcapcap;zcapcup;zcapdot;zcaps;zcaret;zcaron;zccaps;zccaron;Zccedilzccedil;zccirc;zccups;zccupssm;zcdot;Zcedilzcedil;zcemptyv;Zcentzcent;z
centerdot;zcfr;zchcy;zcheck;z
checkmark;zchi;zcir;zcirE;zcirc;zcirceq;zcirclearrowleft;zcirclearrowright;z circledR;z circledS;z circledast;z circledcirc;z circleddash;zcire;z cirfnint;zcirmid;zcirscir;zclubs;z clubsuit;zcolon;zcolone;zcoloneq;zcomma;zcommat;zcomp;zcompfn;z complement;z
complexes;zcong;zcongdot;zconint;zcopf;zcoprod;�copyzcopy;zcopysr;zcrarr;zcross;zcscr;zcsub;zcsube;zcsup;zcsupe;zctdot;zcudarrl;zcudarrr;zcuepr;zcuesc;zcularr;zcularrp;zcup;z cupbrcap;zcupcap;zcupcup;zcupdot;zcupor;zcups;zcurarr;zcurarrm;z curlyeqprec;z curlyeqsucc;z curlyvee;z curlywedge;Zcurrenzcurren;zcurvearrowleft;zcurvearrowright;zcuvee;zcuwed;z cwconint;zcwint;zcylcty;zdArr;zdHar;zdagger;zdaleth;zdarr;zdash;zdashv;zdbkarow;zdblac;zdcaron;zdcy;zdd;zddagger;zddarr;zddotseq;Zdegzdeg;zdelta;zdemptyv;zdfisht;zdfr;zdharl;zdharr;zdiam;zdiamond;z diamondsuit;zdiams;zdie;zdigamma;zdisin;zdiv;Zdividezdivide;zdivideontimes;zdivonx;zdjcy;zdlcorn;zdlcrop;zdollar;zdopf;zdot;zdoteq;z doteqdot;z dotminus;zdotplus;z
dotsquare;zdoublebarwedge;z
downarrow;zdowndownarrows;zdownharpoonleft;zdownharpoonright;z drbkarow;zdrcorn;zdrcrop;zdscr;zdscy;zdsol;zdstrok;zdtdot;zdtri;zdtrif;zduarr;zduhar;zdwangle;zdzcy;z dzigrarr;zeDDot;zeDot;Zeacutezeacute;zeaster;zecaron;zecir;Zecirczecirc;zecolon;zecy;zedot;zee;zefDot;zefr;zeg;Zegravezegrave;zegs;zegsdot;zel;z elinters;zell;zels;zelsdot;zemacr;zempty;z emptyset;zemptyv;zemsp13;zemsp14;zemsp;zeng;zensp;zeogon;zeopf;zepar;zeparsl;zeplus;zepsi;zepsilon;zepsiv;zeqcirc;zeqcolon;zeqsim;z eqslantgtr;z eqslantless;zequals;zequest;zequiv;zequivDD;z eqvparsl;zerDot;zerarr;zescr;zesdot;zesim;zeta;Zethzeth;Zeumlzeuml;zeuro;zexcl;zexist;z expectation;z
exponentiale;zfallingdotseq;zfcy;zfemale;zffilig;zfflig;zffllig;zffr;zfilig;zfjlig;zflat;zfllig;zfltns;zfnof;zfopf;zforall;zfork;zforkv;z fpartint;Zfrac12zfrac12;zfrac13;Zfrac14zfrac14;zfrac15;zfrac16;zfrac18;zfrac23;zfrac25;Zfrac34zfrac34;zfrac35;zfrac38;zfrac45;zfrac56;zfrac58;zfrac78;zfrasl;zfrown;zfscr;zgE;zgEl;zgacute;zgamma;zgammad;zgap;zgbreve;zgcirc;zgcy;zgdot;zge;zgel;zgeq;zgeqq;z geqslant;zges;zgescc;zgesdot;zgesdoto;z gesdotol;zgesl;zgesles;zgfr;zgg;zggg;zgimel;zgjcy;zgl;zglE;zgla;zglj;zgnE;zgnap;z gnapprox;zgne;zgneq;zgneqq;zgnsim;zgopf;zgrave;zgscr;zgsim;zgsime;zgsiml;�gtzgt;zgtcc;zgtcir;zgtdot;zgtlPar;zgtquest;z
gtrapprox;zgtrarr;zgtrdot;z
gtreqless;z gtreqqless;zgtrless;zgtrsim;z
gvertneqq;zgvnE;zhArr;zhairsp;zhalf;zhamilt;zhardcy;zharr;zharrcir;zharrw;zhbar;zhcirc;zhearts;z
heartsuit;zhellip;zhercon;zhfr;z hksearow;z hkswarow;zhoarr;zhomtht;zhookleftarrow;zhookrightarrow;zhopf;zhorbar;zhscr;zhslash;zhstrok;zhybull;zhyphen;Ziacuteziacute;zic;Zicirczicirc;zicy;ziecy;Ziexclziexcl;ziff;zifr;Zigravezigrave;zii;ziiiint;ziiint;ziinfin;ziiota;zijlig;zimacr;zimage;z imagline;z imagpart;zimath;zimof;zimped;zin;zincare;zinfin;z infintie;zinodot;zint;zintcal;z integers;z intercal;z intlarhk;zintprod;ziocy;ziogon;ziopf;ziota;ziprod;Ziquestziquest;ziscr;zisin;zisinE;zisindot;zisins;zisinsv;zisinv;zit;zitilde;ziukcy;Ziumlziuml;zjcirc;zjcy;zjfr;zjmath;zjopf;zjscr;zjsercy;zjukcy;zkappa;zkappav;zkcedil;zkcy;zkfr;zkgreen;zkhcy;zkjcy;zkopf;zkscr;zlAarr;zlArr;zlAtail;zlBarr;zlE;zlEg;zlHar;zlacute;z laemptyv;zlagran;zlambda;zlang;zlangd;zlangle;zlap;Zlaquozlaquo;zlarr;zlarrb;zlarrbfs;zlarrfs;zlarrhk;zlarrlp;zlarrpl;zlarrsim;zlarrtl;zlat;zlatail;zlate;zlates;zlbarr;zlbbrk;zlbrace;zlbrack;zlbrke;zlbrksld;zlbrkslu;zlcaron;zlcedil;zlceil;zlcub;zlcy;zldca;zldquo;zldquor;zldrdhar;z ldrushar;zldsh;zle;z
leftarrow;zleftarrowtail;zleftharpoondown;zleftharpoonup;zleftleftarrows;zleftrightarrow;zleftrightarrows;zleftrightharpoons;zleftrightsquigarrow;zleftthreetimes;zleg;zleq;zleqq;z leqslant;zles;zlescc;zlesdot;zlesdoto;z lesdotor;zlesg;zlesges;z lessapprox;zlessdot;z
lesseqgtr;z lesseqqgtr;zlessgtr;zlesssim;zlfisht;zlfloor;zlfr;zlg;zlgE;zlhard;zlharu;zlharul;zlhblk;zljcy;zll;zllarr;z llcorner;zllhard;zlltri;zlmidot;zlmoust;z lmoustache;zlnE;zlnap;z lnapprox;zlne;zlneq;zlneqq;zlnsim;zloang;zloarr;zlobrk;zlongleftarrow;zlongleftrightarrow;z longmapsto;zlongrightarrow;zlooparrowleft;zlooparrowright;zlopar;zlopf;zloplus;zlotimes;zlowast;zlowbar;zloz;zlozenge;zlozf;zlpar;zlparlt;zlrarr;z lrcorner;zlrhar;zlrhard;zlrm;zlrtri;zlsaquo;zlscr;zlsh;zlsim;zlsime;zlsimg;zlsqb;zlsquo;zlsquor;zlstrok;�ltzlt;zltcc;zltcir;zltdot;zlthree;zltimes;zltlarr;zltquest;zltrPar;zltri;zltrie;zltrif;z lurdshar;zluruhar;z
lvertneqq;zlvnE;zmDDot;Zmacrzmacr;zmale;zmalt;zmaltese;zmap;zmapsto;z mapstodown;z mapstoleft;z mapstoup;zmarker;zmcomma;zmcy;zmdash;zmeasuredangle;zmfr;zmho;�microzmicro;zmid;zmidast;zmidcir;Zmiddotzmiddot;zminus;zminusb;zminusd;zminusdu;zmlcp;zmldr;zmnplus;zmodels;zmopf;zmp;zmscr;zmstpos;zmu;z multimap;zmumap;znGg;znGt;znGtv;z nLeftarrow;znLeftrightarrow;znLl;znLt;znLtv;z nRightarrow;znVDash;znVdash;znabla;znacute;znang;znap;znapE;znapid;znapos;znapprox;znatur;znatural;z naturals;Znbspznbsp;znbump;znbumpe;zncap;zncaron;zncedil;zncong;z ncongdot;zncup;zncy;zndash;zne;zneArr;znearhk;znearr;znearrow;znedot;znequiv;znesear;znesim;znexist;znexists;znfr;zngE;znge;zngeq;zngeqq;z
ngeqslant;znges;zngsim;zngt;zngtr;znhArr;znharr;znhpar;zni;znis;znisd;zniv;znjcy;znlArr;znlE;znlarr;znldr;znle;z nleftarrow;znleftrightarrow;znleq;znleqq;z
nleqslant;znles;znless;znlsim;znlt;znltri;znltrie;znmid;znopf;�notznot;znotin;znotinE;z notindot;znotinva;znotinvb;znotinvc;znotni;znotniva;znotnivb;znotnivc;znpar;z
nparallel;znparsl;znpart;znpolint;znpr;znprcue;znpre;znprec;znpreceq;znrArr;znrarr;znrarrc;znrarrw;z nrightarrow;znrtri;znrtrie;znsc;znsccue;znsce;znscr;z
nshortmid;znshortparallel;znsim;znsime;znsimeq;znsmid;znspar;znsqsube;znsqsupe;znsub;znsubE;znsube;znsubset;z
nsubseteq;z nsubseteqq;znsucc;znsucceq;znsup;znsupE;znsupe;znsupset;z
nsupseteq;z nsupseteqq;zntgl;Zntildezntilde;zntlg;zntriangleleft;zntrianglelefteq;zntriangleright;zntrianglerighteq;znu;znum;znumero;znumsp;znvDash;znvHarr;znvap;znvdash;znvge;znvgt;znvinfin;znvlArr;znvle;znvlt;znvltrie;znvrArr;znvrtrie;znvsim;znwArr;znwarhk;znwarr;znwarrow;znwnear;zoS;Zoacutezoacute;zoast;zocir;Zocirczocirc;zocy;zodash;zodblac;zodiv;zodot;zodsold;zoelig;zofcir;zofr;zogon;Zogravezograve;zogt;zohbar;zohm;zoint;zolarr;zolcir;zolcross;zoline;zolt;zomacr;zomega;zomicron;zomid;zominus;zoopf;zopar;zoperp;zoplus;zor;zorarr;zord;zorder;zorderof;Zordfzordf;Zordmzordm;zorigof;zoror;zorslope;zorv;zoscr;Zoslashzoslash;zosol;Zotildezotilde;zotimes;z otimesas;Zoumlzouml;zovbar;zpar;Zparazpara;z parallel;zparsim;zparsl;zpart;zpcy;zpercnt;zperiod;zpermil;zperp;zpertenk;zpfr;zphi;zphiv;zphmmat;zphone;zpi;z
pitchfork;zpiv;zplanck;zplanckh;zplankv;zplus;z plusacir;zplusb;zpluscir;zplusdo;zplusdu;zpluse;Zplusmnzplusmn;zplussim;zplustwo;zpm;z pointint;zpopf;Zpoundzpound;zpr;zprE;zprap;zprcue;zpre;zprec;z precapprox;z preccurlyeq;zpreceq;z precnapprox;z precneqq;z precnsim;zprecsim;zprime;zprimes;zprnE;zprnap;zprnsim;zprod;z profalar;z profline;z profsurf;zprop;zpropto;zprsim;zprurel;zpscr;zpsi;zpuncsp;zqfr;zqint;zqopf;zqprime;zqscr;z quaternions;zquatint;zquest;zquesteq;Zquotzquot;zrAarr;zrArr;zrAtail;zrBarr;zrHar;zrace;zracute;zradic;z raemptyv;zrang;zrangd;zrange;zrangle;Zraquozraquo;zrarr;zrarrap;zrarrb;zrarrbfs;zrarrc;zrarrfs;zrarrhk;zrarrlp;zrarrpl;zrarrsim;zrarrtl;zrarrw;zratail;zratio;z
rationals;zrbarr;zrbbrk;zrbrace;zrbrack;zrbrke;zrbrksld;zrbrkslu;zrcaron;zrcedil;zrceil;zrcub;zrcy;zrdca;zrdldhar;zrdquo;zrdquor;zrdsh;zreal;zrealine;z realpart;zreals;zrect;Zregzreg;zrfisht;zrfloor;zrfr;zrhard;zrharu;zrharul;zrho;zrhov;z rightarrow;zrightarrowtail;zrightharpoondown;zrightharpoonup;zrightleftarrows;zrightleftharpoons;zrightrightarrows;zrightsquigarrow;zrightthreetimes;zring;z
risingdotseq;zrlarr;zrlhar;zrlm;zrmoust;z rmoustache;zrnmid;zroang;zroarr;zrobrk;zropar;zropf;zroplus;zrotimes;zrpar;zrpargt;z rppolint;zrrarr;zrsaquo;zrscr;zrsh;zrsqb;zrsquo;zrsquor;zrthree;zrtimes;zrtri;zrtrie;zrtrif;z rtriltri;zruluhar;zrx;zsacute;zsbquo;zsc;zscE;zscap;zscaron;zsccue;zsce;zscedil;zscirc;zscnE;zscnap;zscnsim;z scpolint;zscsim;zscy;zsdot;zsdotb;zsdote;zseArr;zsearhk;zsearr;zsearrow;Zsectzsect;zsemi;zseswar;z setminus;zsetmn;zsext;zsfr;zsfrown;zsharp;zshchcy;zshcy;z shortmid;zshortparallel;Zshyzshy;zsigma;zsigmaf;zsigmav;zsim;zsimdot;zsime;zsimeq;zsimg;zsimgE;zsiml;zsimlE;zsimne;zsimplus;zsimrarr;zslarr;zsmallsetminus;zsmashp;z smeparsl;zsmid;zsmile;zsmt;zsmte;zsmtes;zsoftcy;zsol;zsolb;zsolbar;zsopf;zspades;z
spadesuit;zspar;zsqcap;zsqcaps;zsqcup;zsqcups;zsqsub;zsqsube;z sqsubset;z sqsubseteq;zsqsup;zsqsupe;z sqsupset;z sqsupseteq;zsqu;zsquare;zsquarf;zsquf;zsrarr;zsscr;zssetmn;zssmile;zsstarf;zstar;zstarf;zstraightepsilon;z straightphi;zstrns;zsub;zsubE;zsubdot;zsube;zsubedot;zsubmult;zsubnE;zsubne;zsubplus;zsubrarr;zsubset;z subseteq;z
subseteqq;z
subsetneq;z subsetneqq;zsubsim;zsubsub;zsubsup;zsucc;z succapprox;z succcurlyeq;zsucceq;z succnapprox;z succneqq;z succnsim;zsuccsim;zsum;zsung;Zsup1zsup1;Zsup2zsup2;Zsup3zsup3;zsup;zsupE;zsupdot;zsupdsub;zsupe;zsupedot;zsuphsol;zsuphsub;zsuplarr;zsupmult;zsupnE;zsupne;zsupplus;zsupset;z supseteq;z
supseteqq;z
supsetneq;z supsetneqq;zsupsim;zsupsub;zsupsup;zswArr;zswarhk;zswarr;zswarrow;zswnwar;Zszligzszlig;ztarget;ztau;ztbrk;ztcaron;ztcedil;ztcy;ztdot;ztelrec;ztfr;zthere4;z
therefore;ztheta;z thetasym;zthetav;z thickapprox;z thicksim;zthinsp;zthkap;zthksim;Zthornzthorn;ztilde;�timesztimes;ztimesb;z timesbar;ztimesd;ztint;ztoea;ztop;ztopbot;ztopcir;ztopf;ztopfork;ztosa;ztprime;ztrade;z triangle;z
triangledown;z
triangleleft;ztrianglelefteq;z
triangleq;ztriangleright;ztrianglerighteq;ztridot;ztrie;z triminus;ztriplus;ztrisb;ztritime;z trpezium;ztscr;ztscy;ztshcy;ztstrok;ztwixt;ztwoheadleftarrow;ztwoheadrightarrow;zuArr;zuHar;Zuacutezuacute;zuarr;zubrcy;zubreve;Zucirczucirc;zucy;zudarr;zudblac;zudhar;zufisht;zufr;Zugravezugrave;zuharl;zuharr;zuhblk;zulcorn;z ulcorner;zulcrop;zultri;zumacr;Zumlzuml;zuogon;zuopf;zuparrow;z updownarrow;zupharpoonleft;zupharpoonright;zuplus;zupsi;zupsih;zupsilon;z upuparrows;zurcorn;z urcorner;zurcrop;zuring;zurtri;zuscr;zutdot;zutilde;zutri;zutrif;zuuarr;Zuumlzuuml;zuwangle;zvArr;zvBar;zvBarv;zvDash;zvangrt;z varepsilon;z varkappa;z varnothing;zvarphi;zvarpi;z
varpropto;zvarr;zvarrho;z varsigma;z
varsubsetneq;zvarsubsetneqq;z
varsupsetneq;zvarsupsetneqq;z vartheta;zvartriangleleft;zvartriangleright;zvcy;zvdash;zvee;zveebar;zveeeq;zvellip;zverbar;zvert;zvfr;zvltri;zvnsub;zvnsup;zvopf;zvprop;zvrtri;zvscr;zvsubnE;zvsubne;zvsupnE;zvsupne;zvzigzag;zwcirc;zwedbar;zwedge;zwedgeq;zweierp;zwfr;zwopf;zwp;zwr;zwreath;zwscr;zxcap;zxcirc;zxcup;zxdtri;zxfr;zxhArr;zxharr;zxi;zxlArr;zxlarr;zxmap;zxnis;zxodot;zxopf;zxoplus;zxotime;zxrArr;zxrarr;zxscr;zxsqcup;zxuplus;zxutri;zxvee;zxwedge;Zyacutezyacute;zyacy;zycirc;zycy;Zyenzyen;zyfr;zyicy;zyopf;zyscr;zyucy;Zyumlzyuml;zzacute;zzcaron;zzcy;zzdot;zzeetrf;zzeta;zzfr;zzhcy;zzigrarr;zzopf;zzscr;zzwj;zzwnj;u �� � � � � )"r �
� � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � � )ZDoctypeZ
CharactersZSpaceCharacters�StartTag�EndTag�EmptyTag�CommentZ
ParseErrorr r r c C s g | ]\}}||f�qS r2 r2 )r3 �k�vr2 r2 r6 r7 x s Zmathc @ s e Zd ZdS )�DataLossWarningN)�__name__�
__module__� __qualname__r2 r2 r2 r6 r | s r c @ s e Zd ZdS )�ReparseExceptionN)r r r r2 r2 r2 r6 r � s r )r r r! r" r# r$ ) rG rH rI rJ rK rL rM rN rO rP rQ rR rS rH rT rH rH rU rV rW rX rY rZ r[ r\ r] r^ r_ r` rH ra rb )0Z
__future__r r r �stringZEOF�EZ
namespaces� frozensetZscopingElementsZformattingElementsZspecialElementsZ htmlIntegrationPointElementsZ"mathmlTextIntegrationPointElementsZadjustSVGAttributesZadjustMathMLAttributesZadjustForeignAttributes�dict�itemsZunadjustForeignAttributesZspaceCharactersZtableInsertModeElementsZascii_lowercaseZasciiLowercaseZascii_uppercaseZasciiUppercaseZ
ascii_lettersZ asciiLettersZdigitsZ hexdigitsZ hexDigitsZasciiUpper2LowerZheadingElementsZ voidElementsZ
cdataElementsZrcdataElementsZbooleanAttributesZentitiesWindows1252Z xmlEntitiesZentitiesZreplacementCharactersZ
tokenTypesZ
tagTokenTypes�prefixes� UserWarningr � Exceptionr r2 r2 r2 r6 �<module> s<
pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.pyc 0000644 00000054147 14751155150 0020077 0 ustar 00 3
���e � ) @ s d dl mZmZmZ d dlmZmZ d dlmZm Z d dl
Z
d dl Z d dl m
Z
ddlmZmZmZmZ ddlmZ dd lmZ d d
lmZ yd d lmZ W n ek
r� eZY nX ed d
� eD ��Zedd
� eD ��Z edd
� eD ��Z eeddg�B Z dZ ej �rJe dF dk�r&e j!d�dk�s*t"�e j#e ddG� e$d� d �Z%n
e j#e �Z%e&dddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4g �Z'e j#d5�Z(i Z)G d6d7� d7e*�Z+d8d9� Z,G d:d;� d;e*�Z-G d<d=� d=e-�Z.G d>d?� d?e/�Z0G d@dA� dAe*�Z1G dBdC� dCe*�Z2dDdE� Z3dS )H� )�absolute_import�division�unicode_literals)� text_type� binary_type)� http_client�urllibN)� webencodings� )�EOF�spaceCharacters� asciiLetters�asciiUppercase)�ReparseException)�_utils)�StringIO)�BytesIOc C s g | ]}|j d ��qS )�ascii)�encode)�.0�item� r �"/usr/lib/python3.6/_inputstream.py�
<listcomp> s r c C s g | ]}|j d ��qS )r )r )r r r r r r s c C s g | ]}|j d ��qS )r )r )r r r r r r s � >� <u� [- - --]�]z"\uD800-\uDFFF"i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i��
i��
i�� i�� i�� i�� i�� i�� z[ -
-/:-@[-`{-~]c @ sH e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dS )�BufferedStreamz�Buffering for streams that do not have buffering of their own
The buffer is implemented as a list of chunks on the assumption that
joining many strings will be slow since it is O(n**2)
c C s || _ g | _ddg| _d S )Nr
r ���)�stream�buffer�position)�selfr r r r �__init__@ s zBufferedStream.__init__c C s@ d}x(| j d | jd � D ]}|t|�7 }qW || jd 7 }|S )Nr r
)r r! �len)r" �pos�chunkr r r �tellE s
zBufferedStream.tellc C sX || j � kst�|}d}x0t| j| �|k rH|t| j| �8 }|d7 }qW ||g| _d S )Nr r
)�_bufferedBytes�AssertionErrorr$ r r! )r" r% �offset�ir r r �seekL s zBufferedStream.seekc C sT | j s| j|�S | jd t| j �krF| jd t| j d �krF| j|�S | j|�S d S )Nr r
r )r � _readStreamr! r$ �_readFromBuffer)r" �bytesr r r �readU s
zBufferedStream.readc C s t dd� | jD ��S )Nc S s g | ] }t |��qS r )r$ )r r r r r r _ s z1BufferedStream._bufferedBytes.<locals>.<listcomp>)�sumr )r" r r r r( ^ s z BufferedStream._bufferedBytesc C s< | j j|�}| jj|� | jd d7 < t|�| jd< |S )Nr r
)r r0 r �appendr! r$ )r" r/ �datar r r r- a s
zBufferedStream._readStreamc C s� |}g }| j d }| j d }x�|t| j�k r�|dkr�|dks@t�| j| }|t|�| krn|}||| g| _ n"t|�| }|t|�g| _ |d7 }|j|||| � � ||8 }d}q W |r�|j| j|�� dj|�S )Nr r
� )r! r$ r r) r2 r- �join)r" r/ ZremainingBytes�rvZ bufferIndexZ bufferOffsetZ bufferedDataZ bytesToReadr r r r. h s&
z BufferedStream._readFromBufferN) �__name__�
__module__� __qualname__�__doc__r# r' r, r0 r( r- r. r r r r r 9 s r c K s� t | tj�s(t | tjj�r.t | jtj�r.d}n&t| d�rJt | jd�t �}n
t | t �}|r�dd� |D �}|rvt
d| ��t | f|�S t | f|�S d S )NFr0 r c S s g | ]}|j d �r|�qS )Z _encoding)�endswith)r �xr r r r � s z#HTMLInputStream.<locals>.<listcomp>z3Cannot set an encoding with a unicode input, set %r)
�
isinstancer Z HTTPResponser ZresponseZaddbase�fp�hasattrr0 r � TypeError�HTMLUnicodeInputStream�HTMLBinaryInputStream)�source�kwargsZ isUnicodeZ encodingsr r r �HTMLInputStream� s
rE c @ sp e Zd ZdZdZdd� Zdd� Zdd� Zd d
� Zd d � Z d
d� Z
ddd�Z dd� Z dd� Z
d dd�Zdd� ZdS ) rA z�Provides a unicode stream of characters to the HTMLTokenizer.
This class takes care of character encoding and removing or replacing
incorrect byte-sequences and also provides column and line tracking.
i ( c C sZ t jsd| _n td�dkr$| j| _n| j| _dg| _td�df| _| j |�| _
| j � dS )a� Initialises the HTMLInputStream.
HTMLInputStream(source, [encoding]) -> Normalized stream from source
for use by html5lib.
source can be either a file-object, local filename or a string.
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
Nu r
r zutf-8�certain) r �supports_lone_surrogates�reportCharacterErrorsr$ �characterErrorsUCS4�characterErrorsUCS2ZnewLines�lookupEncoding� charEncoding�
openStream�
dataStream�reset)r" rC r r r r# � s
z HTMLUnicodeInputStream.__init__c C s. d| _ d| _d| _g | _d| _d| _d | _d S )N� r )r& � chunkSize� chunkOffset�errors� prevNumLines� prevNumCols�_bufferedCharacter)r" r r r rO � s z HTMLUnicodeInputStream.resetc C s t |d�r|}nt|�}|S )zvProduces a file object from source.
source can be either a file object, local filename or a string.
r0 )r? r )r" rC r r r r rM � s
z!HTMLUnicodeInputStream.openStreamc C sT | j }|jdd|�}| j| }|jdd|�}|dkr@| j| }n ||d }||fS )N�
r r
r )r& �countrT �rfindrU )r" r* r& ZnLinesZ positionLineZ lastLinePosZpositionColumnr r r � _position� s
z HTMLUnicodeInputStream._positionc C s | j | j�\}}|d |fS )z:Returns (line, col) of the current position in the stream.r
)rZ rR )r" �line�colr r r r! � s z HTMLUnicodeInputStream.positionc C s6 | j | jkr| j� stS | j }| j| }|d | _ |S )zo Read one character from the stream or queue if available. Return
EOF when EOF is reached.
r
)rR rQ � readChunkr r& )r" rR �charr r r r^ � s
zHTMLUnicodeInputStream.charNc C s� |d kr| j }| j| j�\| _| _d| _d| _d| _| jj|�}| j rX| j | }d | _ n|s`dS t
|�dkr�t |d �}|dks�d| ko�dkn r�|d
| _ |d d� }| j r�| j |� |j
dd �}|j
d
d �}|| _t
|�| _d S )NrP r Fr
�
i � i�� z
rW �
Tr r r )�_defaultChunkSizerZ rQ rT rU r& rR rN r0 rV r$ �ordrH �replace)r" rQ r3 Zlastvr r r r] � s0
z HTMLUnicodeInputStream.readChunkc C s, x&t ttj|���D ]}| jjd� qW d S )Nzinvalid-codepoint)�ranger$ �invalid_unicode_re�findallrS r2 )r" r3 �_r r r rI % s z*HTMLUnicodeInputStream.characterErrorsUCS4c C s� d}x�t j|�D ]�}|rqt|j� �}|j� }tj|||d � �rttj|||d � �}|tkrn| j j
d� d}q|dkr�|dkr�|t |�d kr�| j j
d� qd}| j j
d� qW d S )NF� zinvalid-codepointTi � i�� r
) re �finditerrb �group�startr ZisSurrogatePairZsurrogatePairToCodepoint�non_bmp_invalid_codepointsrS r2 r$ )r" r3 �skip�matchZ codepointr% Zchar_valr r r rJ ) s z*HTMLUnicodeInputStream.characterErrorsUCS2Fc
C s yt ||f }W nl tk
r| x |D ]}t|�dk s&t�q&W djdd� |D ��}|s^d| }tjd| � }t ||f< Y nX g }x||j| j| j �}|dkr�| j | j
kr�P n0|j � }|| j
kr�|j | j| j |� � || _ P |j | j| j d� � | j
� s�P q�W dj|�} | S )z� Returns a string of characters from the stream up to but not
including any character in 'characters' or EOF. 'characters' must be
a container that supports the 'in' method and iteration over its
characters.
� rP c S s g | ]}d t |� �qS )z\x%02x)rb )r �cr r r r N s z5HTMLUnicodeInputStream.charsUntil.<locals>.<listcomp>z^%sz[%s]+N)�charsUntilRegEx�KeyErrorrb r) r5 �re�compilern r& rR rQ �endr2 r] )
r" Z
charactersZopposite�charsrp Zregexr6 �mru �rr r r �
charsUntil@ s2
z!HTMLUnicodeInputStream.charsUntilc C sT |d k rP| j dkr.|| j | _| jd7 _n"| j d8 _ | j| j |ksPt�d S )Nr r
)rR r& rQ r) )r" r^ r r r �ungeto s
z HTMLUnicodeInputStream.unget)N)F)r7 r8 r9 r: ra r# rO rM rZ r! r^ r] rI rJ ry rz r r r r rA � s
&
/rA c @ sL e Zd ZdZddd�Zdd� Zd d
� Zdd d �Zd
d� Zdd� Z dd� Z
dS )rB z�Provides a unicode stream of characters to the HTMLTokenizer.
This class takes care of character encoding and removing or replacing
incorrect byte-sequences and also provides column and line tracking.
N� windows-1252Tc C sn | j |�| _tj| | j� d| _d| _|| _|| _|| _|| _ || _
| j |�| _ | j d dk sbt
�| j� dS )a� Initialises the HTMLInputStream.
HTMLInputStream(source, [encoding]) -> Normalized stream from source
for use by html5lib.
source can be either a file-object, local filename or a string.
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
i �d r N)rM � rawStreamrA r# � numBytesMeta�numBytesChardet�override_encoding�transport_encoding�same_origin_parent_encoding�likely_encoding�default_encoding�determineEncodingrL r) rO )r" rC r� r� r� r� r� Z
useChardetr r r r# � s z HTMLBinaryInputStream.__init__c C s& | j d jj| jd�| _tj| � d S )Nr rc )rL Z
codec_info� streamreaderr} rN rA rO )r" r r r rO � s zHTMLBinaryInputStream.resetc C sD t |d�r|}nt|�}y|j|j� � W n t|�}Y nX |S )zvProduces a file object from source.
source can be either a file object, local filename or a string.
r0 )r? r r, r' r )r" rC r r r r rM � s
z HTMLBinaryInputStream.openStreamc C s� | j � df}|d d k r |S t| j�df}|d d k r:|S t| j�df}|d d k rX|S | j� df}|d d k rt|S t| j�df}|d d k r�|d jjd� r�|S t| j�df}|d d k r�|S |�rtyddl m
} W n t k
r� Y n�X g }|� }xF|j �s>| j
j| j�}t|t��s t�|�s(P |j|� |j|� q�W |j� t|jd �}| j
jd� |d k �rt|dfS t| j�df}|d d k �r�|S td�dfS )NrF r Z tentativezutf-16)�UniversalDetector�encodingz windows-1252)� detectBOMrK r� r� �detectEncodingMetar� �name�
startswithr� Zchardet.universaldetectorr� � ImportError�doner} r0 r r= r/ r) r2 Zfeed�close�resultr, r� )r" ZchardetrL r� ZbuffersZdetectorr r� r r r r� � sR
z'HTMLBinaryInputStream.determineEncodingc C s� | j d dkst�t|�}|d kr&d S |jdkrFtd�}|d k s�t�nT|| j d krf| j d df| _ n4| jjd� |df| _ | j� td| j d |f ��d S ) Nr
rF �utf-16be�utf-16lezutf-8r z Encoding changed from %s to %s)r� r� )rL r) rK r� r} r, rO r )r" Z newEncodingr r r �changeEncoding s
z$HTMLBinaryInputStream.changeEncodingc
C s� t jdt jdt jdt jdt jdi}| jjd�}t|t �s<t
�|j |dd� �}d}|s~|j |�}d}|s~|j |dd � �}d }|r�| jj |� t
|�S | jj d
� dS dS ) z�Attempts to detect at BOM at the start of the stream. If
an encoding can be determined from the BOM return the name of the
encoding otherwise return Nonezutf-8zutf-16lezutf-16bezutf-32lezutf-32be� N� rh r )�codecs�BOM_UTF8� BOM_UTF16_LE� BOM_UTF16_BE� BOM_UTF32_LE� BOM_UTF32_BEr} r0 r= r/ r) �getr, rK )r" ZbomDict�stringr� r, r r r r� s$
z HTMLBinaryInputStream.detectBOMc C sV | j j| j�}t|t�s t�t|�}| j jd� |j� }|dk rR|j dkrRt
d�}|S )z9Report the encoding declared by the meta element
r N�utf-16be�utf-16lezutf-8)r� r� ) r} r0 r~ r= r/ r) �EncodingParserr, � getEncodingr� rK )r" r �parserr� r r r r� 9 s z(HTMLBinaryInputStream.detectEncodingMeta)NNNNr{ T)T) r7 r8 r9 r: r# rO rM r� r� r� r� r r r r rB � s
(
>"rB c @ s� e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z e e e
�Z
dd� Ze e�Zefdd�Zdd� Zdd� Zdd� Zd S ) �
EncodingBytesz�String-like object with an associated position and various extra methods
If the position is ever greater than the string length then an exception is
raisedc C s t |t�st�tj| |j� �S )N)r= r/ r) �__new__�lower)r" �valuer r r r� L s zEncodingBytes.__new__c C s
d| _ d S )Nr
r )rZ )r" r� r r r r# P s zEncodingBytes.__init__c C s | S )Nr )r" r r r �__iter__T s zEncodingBytes.__iter__c C s> | j d }| _ |t| �kr"t�n |dk r.t�| ||d � S )Nr
r )rZ r$ �
StopIterationr@ )r" �pr r r �__next__W s zEncodingBytes.__next__c C s | j � S )N)r� )r" r r r �next_ s zEncodingBytes.nextc C sB | j }|t| �krt�n |dk r$t�|d | _ }| ||d � S )Nr r
)rZ r$ r� r@ )r" r� r r r �previousc s zEncodingBytes.previousc C s | j t| �krt�|| _ d S )N)rZ r$ r� )r" r! r r r � setPositionl s zEncodingBytes.setPositionc C s* | j t| �krt�| j dkr"| j S d S d S )Nr )rZ r$ r� )r" r r r � getPositionq s
zEncodingBytes.getPositionc C s | | j | j d � S )Nr
)r! )r" r r r �getCurrentByte{ s z EncodingBytes.getCurrentBytec C sL | j }x:|t| �k r@| ||d � }||kr6|| _|S |d7 }qW || _dS )z Skip past a list of charactersr
N)r! r$ rZ )r" rv r� rp r r r rm � s zEncodingBytes.skipc C sL | j }x:|t| �k r@| ||d � }||kr6|| _|S |d7 }qW || _d S )Nr
)r! r$ rZ )r" rv r� rp r r r � skipUntil� s zEncodingBytes.skipUntilc C s> | j }| ||t|� � }|j|�}|r:| j t|�7 _ |S )z�Look for a sequence of bytes at the start of a string. If the bytes
are found return True and advance the position to the byte after the
match. Otherwise return False and leave the position alone)r! r$ r� )r" r/ r� r3 r6 r r r �
matchBytes� s
zEncodingBytes.matchBytesc C sR | | j d� j|�}|dkrJ| jdkr,d| _| j|t|� d 7 _dS t�dS )z�Look for the next sequence of bytes matching a given sequence. If
a match is found advance the position to the last byte of the matchNr
r Tr r )r! �findrZ r$ r� )r" r/ Z newPositionr r r �jumpTo� s
zEncodingBytes.jumpToN)r7 r8 r9 r: r� r# r� r� r� r� r� r� �propertyr! r� � currentByte�spaceCharactersBytesrm r� r� r� r r r r r� H s
r� c @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dS )r� z?Mini parser for detecting character encoding from meta elementsc C s t |�| _d| _dS )z3string - the data to work on for encoding detectionN)r� r3 r� )r" r3 r r r r# � s
zEncodingParser.__init__c
C s� d| j fd| jfd| jfd| jfd| jfd| jff}x^| jD ]T}d}xD|D ]<\}}| jj|�rJy |� }P W qJ tk
r� d}P Y qJX qJW |s<P q<W | jS ) Ns <!--s <metas </s <!s <?r TF) �
handleComment�
handleMeta�handlePossibleEndTag� handleOther�handlePossibleStartTagr3 r� r� r� )r" ZmethodDispatchrg Z keepParsing�key�methodr r r r� � s& zEncodingParser.getEncodingc C s | j jd�S )zSkip over commentss -->)r3 r� )r" r r r r� � s z EncodingParser.handleCommentc C s� | j jtkrdS d}d }x�| j� }|d kr.dS |d dkr^|d dk}|r�|d k r�|| _dS q|d dkr�|d }t|�}|d k r�|| _dS q|d dkrtt|d ��}|j� }|d k rt|�}|d k r|r�|| _dS |}qW d S ) NTFr s
http-equivr
s content-types charsets content) r3 r� r� � getAttributer� rK �ContentAttrParserr� �parse)r" Z hasPragmaZpendingEncoding�attrZtentativeEncoding�codecZ
contentParserr r r r� � s: zEncodingParser.handleMetac C s
| j d�S )NF)�handlePossibleTag)r" r r r r� � s z%EncodingParser.handlePossibleStartTagc C s t | j� | jd�S )NT)r� r3 r� )r" r r r r� � s
z#EncodingParser.handlePossibleEndTagc C sf | j }|jtkr(|r$|j� | j� dS |jt�}|dkrD|j� n | j� }x|d k r`| j� }qNW dS )NTr )r3 r� �asciiLettersBytesr� r� r� �spacesAngleBracketsr� )r" ZendTagr3 rp r� r r r r� � s
z EncodingParser.handlePossibleTagc C s | j jd�S )Nr )r3 r� )r" r r r r� s zEncodingParser.handleOtherc C s | j }|jttdg�B �}|dks2t|�dks2t�|d kr>dS g }g }xt|dkrX|rXP nX|tkrl|j� }P nD|d
kr�dj|�dfS |tkr�|j|j � � n|dkr�dS |j|� t
|�}qHW |dkr�|j � dj|�dfS t
|� |j� }|d k�rT|}x�t
|�}||k�r(t
|� dj|�dj|�fS |tk�rB|j|j � � n
|j|� � q�W nJ|dk�rldj|�dfS |tk�r�|j|j � � n|dk�r�dS |j|� x^t
|�}|t k�r�dj|�dj|�fS |tk�r�|j|j � � n|dk�r�dS |j|� �q�W dS ) z_Return a name,value pair for the next attribute in the stream,
if one is found, or None� /Nr
r � =r4 � '� ")r N)r� r )r� r� )
r3 rm r� � frozensetr$ r) r5 �asciiUppercaseBytesr2 r� r� r� r� )r" r3 rp ZattrNameZ attrValueZ quoteCharr r r r� sh
zEncodingParser.getAttributeN)
r7 r8 r9 r: r# r� r� r� r� r� r� r� r� r r r r r� � s $r� c @ s e Zd Zdd� Zdd� ZdS )r� c C s t |t�st�|| _d S )N)r= r/ r) r3 )r" r3 r r r r# f s zContentAttrParser.__init__c C s y�| j jd� | j jd7 _| j j� | j jdks8d S | j jd7 _| j j� | j jdkr�| j j}| j jd7 _| j j}| j j|�r�| j || j j� S d S nF| j j}y | j jt� | j || j j� S tk
r� | j |d � S X W n tk
�r d S X d S )Ns charsetr
r� r� r� )r� r� )r3 r� r! rm r� r� r� r� )r" Z quoteMarkZ oldPositionr r r r� j s.
zContentAttrParser.parseN)r7 r8 r9 r# r� r r r r r� e s r� c C s` t | t�r.y| jd�} W n tk
r, dS X | dk rXy
tj| �S tk
rT dS X ndS dS )z{Return the python codec name corresponding to an encoding or None if the
string doesn't correspond to a valid encoding.r N)r= r �decode�UnicodeDecodeErrorr �lookup�AttributeError)r� r r r rK � s
rK r r )4Z
__future__r r r Zpip._vendor.sixr r Zpip._vendor.six.movesr r r� rs Z pip._vendorr Z constantsr r r
r r rP r �ior r r� r� r� r� r� r� Z invalid_unicode_no_surrogaterG rX r) rt �evalre �setrl Zascii_punctuation_rerq �objectr rE rA rB r/ r� r� r� rK r r r r �<module> sX
"
J g Ih 6' pip/_vendor/html5lib/__pycache__/__init__.cpython-36.pyc 0000644 00000001563 14751155150 0017116 0 ustar 00 3
���e � @ sh d Z ddlmZmZmZ ddlmZmZmZ ddl m
Z
ddl m Z ddl
mZ dd d
d d d
gZdZdS )aM
HTML parsing library based on the WHATWG "HTML5"
specification. The parser is designed to be compatible with existing
HTML found in the wild and implements well-defined error recovery that
is largely compatible with modern desktop web browsers.
Example usage:
import html5lib
f = open("my_document.html")
tree = html5lib.parse(f)
� )�absolute_import�division�unicode_literals� )�
HTMLParser�parse�
parseFragment)�getTreeBuilder)�
getTreeWalker)� serializer r r r r
r z1.0b10N)�__doc__Z
__future__r r r Z html5parserr r r Z treebuildersr Z treewalkersr
Z
serializerr �__all__� __version__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.pyc 0000644 00000277205 14751155150 0017635 0 ustar 00 3
���e�� � @ sF d dl mZmZmZ d dlmZmZmZ d dlZyd dl m
Z
W n e k
r` d dl m
Z
Y nX ddl
mZ ddl
mZ ddl
mZ dd lmZ dd
l
mZ dd lmZmZmZmZmZmZmZm Z m Z m Z m Z m Z!m"Z"m#Z#m$Z$m%Z% d!dd�Z&d"dd�Z'dd� Z(G dd� de)�Z*ej+dd� �Z,dd� Z-d#d d �Z.G d d � d e/�Z0dS )$� )�absolute_import�division�unicode_literals)�with_metaclass�viewkeys�PY3N)� OrderedDict� )� _inputstream)�
_tokenizer)� treebuilders)�Marker)�_utils)�spaceCharacters�asciiUpper2Lower�specialElements�headingElements�
cdataElements�rcdataElements�
tokenTypes�
tagTokenTypes�
namespaces� htmlIntegrationPointElements�"mathmlTextIntegrationPointElements�adjustForeignAttributes�adjustMathMLAttributes�adjustSVGAttributes�E�ReparseException�etreeTc K s$ t j|�}t||d�}|j| f|�S )z.Parse a string or file-like object into a tree)�namespaceHTMLElements)r �getTreeBuilder�
HTMLParser�parse)�doc� treebuilderr �kwargs�tb�p� r) �!/usr/lib/python3.6/html5parser.pyr# s
r# �divc K s, t j|�}t||d�}|j| fd|i|��S )N)r � container)r r! r" �
parseFragment)r$ r, r% r r& r' r( r) r) r* r- & s
r- c s G � fdd�dt �}|S )Nc s e Zd Z� fdd�ZdS )z-method_decorator_metaclass.<locals>.Decoratedc sB x0|j � D ]$\}}t|tj�r&� |�}|||< q
W tj| |||�S )N)�items�
isinstance�types� FunctionType�type�__new__)�metaZ classname�basesZ classDictZ
attributeNameZ attribute)�functionr) r* r3 . s
z5method_decorator_metaclass.<locals>.Decorated.__new__N)�__name__�
__module__� __qualname__r3 r) )r6 r) r* � Decorated- s r: )r2 )r6 r: r) )r6 r* �method_decorator_metaclass, s r; c @ s� e Zd ZdZd+dd�Zd,dd �Zd
d � Zed d
� �Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zd-dd �Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� ZdS ).r" zZHTML parser. Generates a tree structure from a stream of (possibly
malformed) HTMLNFTc sL |� _ |dkrtjd�}||�� _g � _t� fdd�t|�j� D ��� _dS )a
strict - raise an exception when a parse error is encountered
tree - a treebuilder class controlling the type of tree that will be
returned. Built in treebuilders can be accessed through
html5lib.treebuilders.getTreeBuilder(treeType)
Nr c s g | ]\}}||� � j �f�qS r) )�tree)�.0�name�cls)�selfr) r* �
<listcomp>M s z'HTMLParser.__init__.<locals>.<listcomp>) �strictr r! r< �errors�dict� getPhasesr. �phases)r@ r< rB r �debugr) )r@ r* �__init__< s
zHTMLParser.__init__r+ c K sh || _ || _|| _tj|fd| i|��| _| j� y | j� W n$ tk
rb | j� | j� Y nX d S )N�parser) �
innerHTMLModer, � scriptingr Z
HTMLTokenizer� tokenizer�reset�mainLoopr )r@ �stream� innerHTMLr, rK r& r) r) r* �_parseP s zHTMLParser._parsec C s� | j j� d| _g | _g | _d| _| jr�| jj� | _ | j t
krL| j j | j _
n0| j tkrd| j j| j _
n| j dkr|| j j| j _
n | jd | _| jj� | j� nd| _ | jd | _d | _d | _d| _d S )NFz no quirks� plaintext�
beforeHtml�initialT)r< rM �
firstStartTagrC �log�
compatModerJ r, �lowerrP r rL � rcdataState�stater � rawtextState�plaintextStaterF �phase�insertHtmlElement�resetInsertionModeZ lastPhaseZbeforeRCDataPhase�
framesetOK)r@ r) r) r* rM ^ s*
zHTMLParser.resetc C s t | d�sdS | jjjd jS )z�The name of the character encoding
that was used to decode the input stream,
or :obj:`None` if that is not determined yet.
rL Nr )�hasattrrL rO � charEncodingr> )r@ r) r) r* �documentEncoding� s
zHTMLParser.documentEncodingc C sJ |j dkr6|jtd kr6d|jko4|jd jt�dkS |j|j ftkS d S )Nzannotation-xml�mathml�encoding� text/html�application/xhtml+xml)rf rg )r> � namespacer �
attributes� translater r )r@ �elementr) r) r* �isHTMLIntegrationPoint� s
z!HTMLParser.isHTMLIntegrationPointc C s |j |jftkS )N)rh r> r )r@ rk r) r) r* � isMathMLTextIntegrationPoint� s z'HTMLParser.isMathMLTextIntegrationPointc C sz t d }t d }t d }t d }t d }t d }t d }�x�| j� D �]�}d } |}
�x�|
d k �r |
} | jjrx| jjd nd } | r�| jnd } | r�| jnd }
|
d }||kr�| j|
d
|
jd i �� d }
qVt| jj�d k�sl| | jj k�sl| j
| ��r ||k�r|d
t ddg�k�sl|||fk�sl| t d k�rP|
dk�rP||k�rP|d
dk�sl| j
| ��rt||||fk�rt| j}n
| jd }||k�r�|j|
�}
qV||k�r�|j|
�}
qV||k�r�|j|
�}
qV||k�r�|j|
�}
qV||k�r�|j|
�}
qV||krV|j|
�}
qVW ||krD| d rD| d rD| jdd
| d
i� qDW d}g }x8|�rt|j| j� | jj� }|�r>| j|k�s>t��q>W d S )N�
CharactersZSpaceCharacters�StartTag�EndTag�CommentZDoctype�
ParseErrorr r2 �data�datavarsr r> ZmglyphZ
malignmarkrd zannotation-xml�svg�inForeignContent� selfClosing�selfClosingAcknowledgedz&non-void-element-with-trailing-solidusT���)r �normalizedTokensr< � openElementsrh r> �
parseError�get�len�defaultNamespacerm � frozensetr rl r] rF �processCharacters�processSpaceCharacters�processStartTag�
processEndTag�processComment�processDoctype�append�
processEOF�AssertionError)r@ ZCharactersTokenZSpaceCharactersTokenZ
StartTagTokenZ EndTagTokenZ CommentTokenZ DoctypeTokenZParseErrorToken�tokenZ
prev_token� new_token� currentNodeZcurrentNodeNamespaceZcurrentNodeNamer2 r] Z reprocessrF r) r) r* rN � sp
zHTMLParser.mainLoopc c s x| j D ]}| j|�V qW d S )N)rL �normalizeToken)r@ r� r) r) r* rz � s zHTMLParser.normalizedTokensc O s | j |ddf|�|� | jj� S )a� Parse a HTML document into a well-formed tree
stream - a filelike object or string containing the HTML to be parsed
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
scripting - treat noscript elements as if javascript was turned on
FN)rQ r< Z getDocument)r@ rO �argsr& r) r) r* r# � s zHTMLParser.parsec O s | j |df|�|� | jj� S )a2 Parse a HTML fragment into a well-formed tree fragment
container - name of the element we're setting the innerHTML property
if set to None, default to 'div'
stream - a filelike object or string containing the HTML to be parsed
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
scripting - treat noscript elements as if javascript was turned on
T)rQ r< Z getFragment)r@ rO r� r& r) r) r* r- � s zHTMLParser.parseFragment�XXX-undefined-errorc C s@ |d kr i }| j j| jjj� ||f� | jr<tt| | ��d S )N)rC r� rL rO ZpositionrB rr r )r@ � errorcodert r) r) r* r| s
zHTMLParser.parseErrorc C sT |d t d krP|d }t|�|d< t|�t|d �krP|d j|ddd� � |S )z3 HTML5 specific normalizations to the token stream r2 ro rs Nr ry )r r r~ �update)r@ r� �rawr) r) r* r� s zHTMLParser.normalizeTokenc C s t |t� d S )N)�adjust_attributesr )r@ r� r) r) r* r s z!HTMLParser.adjustMathMLAttributesc C s t |t� d S )N)r� r )r@ r� r) r) r* r s z HTMLParser.adjustSVGAttributesc C s t |t� d S )N)r� �adjustForeignAttributesMap)r@ r� r) r) r* r s z"HTMLParser.adjustForeignAttributesc C s | j j� d S )N)rI r] )r@ r� r) r) r* �reparseTokenNormal s z HTMLParser.reparseTokenNormalc C s� d}ddddddddddd d d
d d �}x�| j jd d d� D ]�}|j}d }|| j jd krl| jsbt�d}| j}|dkr~| js~t�| r�|j| j jkr�q:||kr�| j|| }P q:|r:| jd }P q:W || _d S )NF�inSelect�inCell�inRow� inTableBody� inCaption�
inColumnGroup�inTable�inBody�
inFrameset�
beforeHead)�select�td�th�tr�tbody�thead�tfoot�caption�colgroup�table�head�body�frameset�htmlr r Tr� r� r� r� ry )r� r� r� r� ) r< r{ r> rP r� rh r rF r] )r@ ZlastZnewModes�nodeZnodeNameZ new_phaser) r) r* r_ ! sB
z HTMLParser.resetInsertionModec C sR |dks t �| jj|� |dkr.| jj| j_n | jj| j_| j| _| j d | _dS )zYGeneric RCDATA/RAWTEXT Parsing algorithm
contentType - RCDATA or RAWTEXT
�RAWTEXT�RCDATA�textN)r� r� )
r� r< �
insertElementrL r[ rZ rY r] �
originalPhaserF )r@ r� Z contentTyper) r) r* �parseRCDataRawtextM s z HTMLParser.parseRCDataRawtext)NFTF)Fr+ F)r� N)r7 r8 r9 �__doc__rH rQ rM �propertyrc rl rm rN rz r# r- r| r� r r r r� r_ r� r) r) r) r* r" 8 s&
"
C
,r" c s" dd� }dd� }G dd� dt || |���� G dd� d� �}G d d
� d
� �}G � fd d �d � �}G � fd
d�d� �}G � fdd�d� �}G � fdd�d� �}G � fdd�d� �} G � fdd�d� �}
G � fdd�d� �} G � fdd�d� �} G � fdd �d � �}
G � fd d �d � �}G � fd d �d � �}G � fd!d"�d"� �}G � fd#d$�d$� �}G � fd%d&�d&� �}G � fd'd(�d(� �}G � fd)d*�d*� �}G � fd+d,�d,� �}G � fd-d.�d.� �}G � fd/d0�d0� �}G � fd1d2�d2� �}G � fd3d4�d4� �}||||||| |
| | |
||||||||||||d5�S )6Nc s( t dd� tj� D ���� �fdd�}|S )z4Logger that records which phase processes each tokenc s s | ]\}}||fV qd S )Nr) )r= �key�valuer) r) r* � <genexpr>c s z)getPhases.<locals>.log.<locals>.<genexpr>c s� � j jd�r�t|�dkr�|d }yd�|d i}W n � Y nX |d tkr\|d |d< | jjj| jjjj | jj j
j | j
j � j |f� � | f|�|�S � | f|�|�S d S )NZprocessr r2 r> ) r7 �
startswithr~ r rI rV r� rL rZ r] � __class__)r@ r� r& r� �info)r6 �
type_namesr) r* �wrappedf s
z'getPhases.<locals>.log.<locals>.wrapped)rD r r. )r6 r� r) )r6 r� r* rV a s zgetPhases.<locals>.logc S s | r t |�S tS d S )N)r; r2 )Z
use_metaclassZmetaclass_funcr) r) r* � getMetaclassz s z getPhases.<locals>.getMetaclassc @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dS )zgetPhases.<locals>.PhasezNBase class for helper object that implements each phase of processing
c S s || _ || _d S )N)rI r< )r@ rI r< r) r) r* rH � s z!getPhases.<locals>.Phase.__init__c S s t �d S )N)�NotImplementedError)r@ r) r) r* r� � s z#getPhases.<locals>.Phase.processEOFc S s | j j|| j jd � d S )Nr ry )r< �
insertCommentr{ )r@ r� r) r) r* r� � s z'getPhases.<locals>.Phase.processCommentc S s | j jd� d S )Nzunexpected-doctype)rI r| )r@ r� r) r) r* r� � s z'getPhases.<locals>.Phase.processDoctypec S s | j j|d � d S )Nrs )r< �
insertText)r@ r� r) r) r* r� � s z*getPhases.<locals>.Phase.processCharactersc S s | j j|d � d S )Nrs )r< r� )r@ r� r) r) r* r� � s z/getPhases.<locals>.Phase.processSpaceCharactersc S s | j |d |�S )Nr> )�startTagHandler)r@ r� r) r) r* r� � s z(getPhases.<locals>.Phase.processStartTagc S sl | j j r"|d dkr"| j jd� x<|d j� D ],\}}|| jjd jkr0|| jjd j|< q0W d| j _d S )Nr> r� z
non-html-rootrs r F)rI rU r| r. r< r{ ri )r@ r� �attrr� r) r) r* � startTagHtml� s z%getPhases.<locals>.Phase.startTagHtmlc S s | j |d |�S )Nr> )�
endTagHandler)r@ r� r) r) r* r� � s z&getPhases.<locals>.Phase.processEndTagN)
r7 r8 r9 r� rH r� r� r� r� r� r� r� r� r) r) r) r* �Phase� s
r� c @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z getPhases.<locals>.InitialPhasec S s d S )Nr) )r@ r� r) r) r* r� � s z6getPhases.<locals>.InitialPhase.processSpaceCharactersc S s | j j|| j j� d S )N)r< r� �document)r@ r� r) r) r* r� � s z.getPhases.<locals>.InitialPhase.processCommentc 8 S s |d }|d }|d }|d }|dks@|d k s@|d k rL|dkrL| j jd� |d krXd}| jj|� |dkrv|jt�}| � s�|d dk� s�|jdJ�� s�|dKk� s�|jdL�� r�|d k� s�|� r�|j� dDk� r�dE| j _n*|jdM�� s�|jdN��r |d k �r dH| j _| j j dI | j _
d S )ONr> �publicId�systemId�correctr� zabout:legacy-compatzunknown-doctype� �*+//silmaril//dtd html pro v0r11 19970101//�4-//advasoft ltd//dtd html 3.0 aswedit + extensions//�*-//as//dtd html 3.0 aswedit + extensions//� -//ietf//dtd html 2.0 level 1//� -//ietf//dtd html 2.0 level 2//�&-//ietf//dtd html 2.0 strict level 1//�&-//ietf//dtd html 2.0 strict level 2//� -//ietf//dtd html 2.0 strict//�-//ietf//dtd html 2.0//�-//ietf//dtd html 2.1e//�-//ietf//dtd html 3.0//� -//ietf//dtd html 3.2 final//�-//ietf//dtd html 3.2//�-//ietf//dtd html 3//�-//ietf//dtd html level 0//�-//ietf//dtd html level 1//�-//ietf//dtd html level 2//�-//ietf//dtd html level 3//�"-//ietf//dtd html strict level 0//�"-//ietf//dtd html strict level 1//�"-//ietf//dtd html strict level 2//�"-//ietf//dtd html strict level 3//�-//ietf//dtd html strict//�-//ietf//dtd html//�(-//metrius//dtd metrius presentational//�5-//microsoft//dtd internet explorer 2.0 html strict//�.-//microsoft//dtd internet explorer 2.0 html//�0-//microsoft//dtd internet explorer 2.0 tables//�5-//microsoft//dtd internet explorer 3.0 html strict//�.-//microsoft//dtd internet explorer 3.0 html//�0-//microsoft//dtd internet explorer 3.0 tables//�#-//netscape comm. corp.//dtd html//�*-//netscape comm. corp.//dtd strict html//�*-//o'reilly and associates//dtd html 2.0//�3-//o'reilly and associates//dtd html extended 1.0//�;-//o'reilly and associates//dtd html extended relaxed 1.0//�N-//softquad software//dtd hotmetal pro 6.0::19990601::extensions to html 4.0//�E-//softquad//dtd hotmetal pro 4.0::19971010::extensions to html 4.0//�$-//spyglass//dtd html 2.0 extended//�+-//sq//dtd html 2.0 hotmetal + extensions//�--//sun microsystems corp.//dtd hotjava html//�4-//sun microsystems corp.//dtd hotjava strict html//� -//w3c//dtd html 3 1995-03-24//� -//w3c//dtd html 3.2 draft//� -//w3c//dtd html 3.2 final//�-//w3c//dtd html 3.2//� -//w3c//dtd html 3.2s draft//� -//w3c//dtd html 4.0 frameset//�#-//w3c//dtd html 4.0 transitional//�(-//w3c//dtd html experimental 19960712//�&-//w3c//dtd html experimental 970421//�-//w3c//dtd w3 html//�-//w3o//dtd w3 html 3.0//�#-//webtechs//dtd mozilla html 2.0//� -//webtechs//dtd mozilla html//�$-//w3o//dtd w3 html strict 3.0//en//�"-/w3c/dtd html 4.0 transitional/en� -//w3c//dtd html 4.01 frameset//�$-//w3c//dtd html 4.01 transitional//z:http://www.ibm.com/data/dtd/v11/ibmxhtml1-transitional.dtd�quirks� -//w3c//dtd xhtml 1.0 frameset//�$-//w3c//dtd xhtml 1.0 transitional//zlimited quirksrS )7r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r )r r r� )r r )r r
)r r ) rI r| r< Z
insertDoctyperj r r� rX rW rF r] )r@ r� r> r� r� r� r) r) r* r� � s�
z.getPhases.<locals>.InitialPhase.processDoctypec S s d| j _| j jd | j _d S )Nr rS )rI rW rF r] )r@ r) r) r* � anythingElse s z,getPhases.<locals>.InitialPhase.anythingElsec S s | j jd� | j� |S )Nz expected-doctype-but-got-chars)rI r| r )r@ r� r) r) r* r� s z1getPhases.<locals>.InitialPhase.processCharactersc S s" | j jdd|d i� | j� |S )Nz"expected-doctype-but-got-start-tagr> )rI r| r )r@ r� r) r) r* r� s z/getPhases.<locals>.InitialPhase.processStartTagc S s" | j jdd|d i� | j� |S )Nz expected-doctype-but-got-end-tagr> )rI r| r )r@ r� r) r) r* r� s z-getPhases.<locals>.InitialPhase.processEndTagc S s | j jd� | j� dS )Nz expected-doctype-but-got-eofT)rI r| r )r@ r) r) r* r� % s z*getPhases.<locals>.InitialPhase.processEOFN) r7 r8 r9 r� r� r� r r� r� r� r� r) r) r) r* � InitialPhase� s _r c @ sD e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )z"getPhases.<locals>.BeforeHtmlPhasec S s& | j jtdd�� | jjd | j_d S )Nr� ro r� )r< Z
insertRoot�impliedTagTokenrI rF r] )r@ r) r) r* r^ , s z4getPhases.<locals>.BeforeHtmlPhase.insertHtmlElementc S s | j � dS )NT)r^ )r@ r) r) r* r� 1 s z-getPhases.<locals>.BeforeHtmlPhase.processEOFc S s | j j|| j j� d S )N)r< r� r� )r@ r� r) r) r* r� 5 s z1getPhases.<locals>.BeforeHtmlPhase.processCommentc S s d S )Nr) )r@ r� r) r) r* r� 8 s z9getPhases.<locals>.BeforeHtmlPhase.processSpaceCharactersc S s | j � |S )N)r^ )r@ r� r) r) r* r� ; s z4getPhases.<locals>.BeforeHtmlPhase.processCharactersc S s |d dkrd| j _| j� |S )Nr> r� T)rI rU r^ )r@ r� r) r) r* r� ? s z2getPhases.<locals>.BeforeHtmlPhase.processStartTagc S s4 |d dkr$| j jdd|d i� n | j� |S d S )Nr> r� r� r� �brz unexpected-end-tag-before-html)r� r� r� r )rI r| r^ )r@ r� r) r) r* r� E s
z0getPhases.<locals>.BeforeHtmlPhase.processEndTagN)
r7 r8 r9 r^ r� r� r� r� r� r� r) r) r) r* �BeforeHtmlPhase* s r c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z"getPhases.<locals>.BeforeHeadPhasec sV � j | ||� tjd| jfd| jfg�| _| j| j_tjd| jfg�| _ | j
| j _d S )Nr� r� r� r )r� r� r� r ) rH r �MethodDispatcherr� � startTagHeadr� �
startTagOther�default�endTagImplyHeadr� � endTagOther)r@ rI r< )r� r) r* rH N s
z+getPhases.<locals>.BeforeHeadPhase.__init__c S s | j tdd�� dS )Nr� ro T)r r
)r@ r) r) r* r� \ s z-getPhases.<locals>.BeforeHeadPhase.processEOFc S s d S )Nr) )r@ r� r) r) r* r� ` s z9getPhases.<locals>.BeforeHeadPhase.processSpaceCharactersc S s | j tdd�� |S )Nr� ro )r r
)r@ r� r) r) r* r� c s z4getPhases.<locals>.BeforeHeadPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� g s z/getPhases.<locals>.BeforeHeadPhase.startTagHtmlc S s0 | j j|� | j jd | j _| jjd | j_d S )Nr �inHeadry )r< r� r{ � headPointerrI rF r] )r@ r� r) r) r* r j s z/getPhases.<locals>.BeforeHeadPhase.startTagHeadc S s | j tdd�� |S )Nr� ro )r r
)r@ r� r) r) r* r o s z0getPhases.<locals>.BeforeHeadPhase.startTagOtherc S s | j tdd�� |S )Nr� ro )r r
)r@ r� r) r) r* r s s z2getPhases.<locals>.BeforeHeadPhase.endTagImplyHeadc S s | j jdd|d i� d S )Nzend-tag-after-implied-rootr> )rI r| )r@ r� r) r) r* r w s z.getPhases.<locals>.BeforeHeadPhase.endTagOtherN) r7 r8 r9 rH r� r� r� r� r r r r r) )r� r) r* �BeforeHeadPhaseM s r c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!S )"z getPhases.<locals>.InHeadPhasec s� � j | ||� tjd| jfd| jfd| jfd| jfd| jfd| jfd | j fd
| j
fg�| _ | j | j _
tjd
| jfd| jfg�| _| j| j_
d S )Nr� �title�noframes�style�noscript�script�base�basefont�bgsound�command�linkr4 r� r r� )r r )r r r r! r" )r r� r� )rH r r r� �
startTagTitle�startTagNoFramesStyle�startTagNoscript�startTagScript�startTagBaseLinkCommand� startTagMetar r� r r �
endTagHead�endTagHtmlBodyBrr� r )r@ rI r< )r� r) r* rH | s
z'getPhases.<locals>.InHeadPhase.__init__c S s | j � dS )NT)r )r@ r) r) r* r� � s z)getPhases.<locals>.InHeadPhase.processEOFc S s | j � |S )N)r )r@ r� r) r) r* r� � s z0getPhases.<locals>.InHeadPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z+getPhases.<locals>.InHeadPhase.startTagHtmlc S s | j jd� d S )Nz!two-heads-are-not-better-than-one)rI r| )r@ r� r) r) r* r � s z+getPhases.<locals>.InHeadPhase.startTagHeadc S s$ | j j|� | j jj� d|d< d S )NTrx )r< r� r{ �pop)r@ r� r) r) r* r' � s z6getPhases.<locals>.InHeadPhase.startTagBaseLinkCommandc S s� | j j|� | j jj� d|d< |d }| jjjjd dkr�d|krZ| jjjj|d � nVd|kr�d|kr�|d j � d kr�t
j |d j d
��}t
j
|�}|j� }| jjjj|� d S ) NTrx rs r Z tentative�charsetZcontentz
http-equivz content-typezutf-8)r< r� r{ r+ rI rL rO rb ZchangeEncodingrX r
Z
EncodingBytes�encodeZContentAttrParserr# )r@ r� ri rs rI �codecr) r) r* r( � s
z+getPhases.<locals>.InHeadPhase.startTagMetac S s | j j|d� d S )Nr� )rI r� )r@ r� r) r) r* r# � s z,getPhases.<locals>.InHeadPhase.startTagTitlec S s | j j|d� d S )Nr� )rI r� )r@ r� r) r) r* r$ � s z4getPhases.<locals>.InHeadPhase.startTagNoFramesStylec S s8 | j jr| j j|d� n | jj|� | j jd | j _d S )Nr� �inHeadNoscript)rI rK r� r< r� rF r] )r@ r� r) r) r* r% � s z/getPhases.<locals>.InHeadPhase.startTagNoscriptc S s< | j j|� | jjj| jj_| jj| j_| jjd | j_d S )Nr� ) r< r� rI rL ZscriptDataStaterZ r] r� rF )r@ r� r) r) r* r& � s z-getPhases.<locals>.InHeadPhase.startTagScriptc S s | j � |S )N)r )r@ r� r) r) r* r � s z,getPhases.<locals>.InHeadPhase.startTagOtherc S s: | j jjj� }|jdks&td|j ��| j jd | j _d S )Nr� zExpected head got %s� afterHead)rI r< r{ r+ r> r� rF r] )r@ r� r� r) r) r* r) � s z)getPhases.<locals>.InHeadPhase.endTagHeadc S s | j � |S )N)r )r@ r� r) r) r* r* � s z/getPhases.<locals>.InHeadPhase.endTagHtmlBodyBrc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r � s z*getPhases.<locals>.InHeadPhase.endTagOtherc S s | j td�� d S )Nr� )r) r
)r@ r) r) r* r � s z+getPhases.<locals>.InHeadPhase.anythingElseN)r7 r8 r9 rH r� r� r� r r' r( r# r$ r% r& r r) r* r r r) )r� r) r* � InHeadPhase{ s r1 c sx e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) z&getPhases.<locals>.InHeadNoscriptPhasec sf � j | ||� tjd| jfd | jfd | jfg�| _| j| j_tjd | j fd
| j
fg�| _ | j | j _d S )
Nr� r r r" r4 r r r� r r )r r r" r4 r r )r� r )
rH r r r� r' �startTagHeadNoscriptr� r r �endTagNoscript�endTagBrr� r )r@ rI r< )r� r) r* rH � s
z/getPhases.<locals>.InHeadNoscriptPhase.__init__c S s | j jd� | j� dS )Nzeof-in-head-noscriptT)rI r| r )r@ r) r) r* r� � s z1getPhases.<locals>.InHeadNoscriptPhase.processEOFc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r� � s z5getPhases.<locals>.InHeadNoscriptPhase.processCommentc S s | j jd� | j� |S )Nzchar-in-head-noscript)rI r| r )r@ r� r) r) r* r� � s z8getPhases.<locals>.InHeadNoscriptPhase.processCharactersc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r� s z=getPhases.<locals>.InHeadNoscriptPhase.processSpaceCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� s z3getPhases.<locals>.InHeadNoscriptPhase.startTagHtmlc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r' s z>getPhases.<locals>.InHeadNoscriptPhase.startTagBaseLinkCommandc S s | j jdd|d i� d S )Nzunexpected-start-tagr> )rI r| )r@ r� r) r) r* r2 s z;getPhases.<locals>.InHeadNoscriptPhase.startTagHeadNoscriptc S s" | j jdd|d i� | j� |S )Nz unexpected-inhead-noscript-tagr> )rI r| r )r@ r� r) r) r* r s z4getPhases.<locals>.InHeadNoscriptPhase.startTagOtherc S s: | j jjj� }|jdks&td|j ��| j jd | j _d S )Nr zExpected noscript got %sr )rI r< r{ r+ r> r� rF r] )r@ r� r� r) r) r* r3 s z5getPhases.<locals>.InHeadNoscriptPhase.endTagNoscriptc S s" | j jdd|d i� | j� |S )Nz unexpected-inhead-noscript-tagr> )rI r| r )r@ r� r) r) r* r4 s z/getPhases.<locals>.InHeadNoscriptPhase.endTagBrc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r s z2getPhases.<locals>.InHeadNoscriptPhase.endTagOtherc S s | j td�� d S )Nr )r3 r
)r@ r) r) r* r s z3getPhases.<locals>.InHeadNoscriptPhase.anythingElseN)r7 r8 r9 rH r� r� r� r� r� r' r2 r r3 r4 r r r) )r� r) r* �InHeadNoscriptPhase� s r5 c sp e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� ZdS )z!getPhases.<locals>.AfterHeadPhasec
sn � j | ||� tjd| jfd| jfd| jfd| jfd
| jfg�| _| j | j_
tjd| j fg�| _ | j
| j _
d S )Nr� r� r� r r r r" r4 r r r r r� r ) r r r r" r4 r r r r )r� r� r )rH r r r� � startTagBody�startTagFrameset�startTagFromHeadr r� r r r* r� r )r@ rI r< )r� r) r* rH # s
z*getPhases.<locals>.AfterHeadPhase.__init__c S s | j � dS )NT)r )r@ r) r) r* r� 4 s z,getPhases.<locals>.AfterHeadPhase.processEOFc S s | j � |S )N)r )r@ r� r) r) r* r� 8 s z3getPhases.<locals>.AfterHeadPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� < s z.getPhases.<locals>.AfterHeadPhase.startTagHtmlc S s( d| j _| jj|� | j jd | j _d S )NFr� )rI r` r< r� rF r] )r@ r� r) r) r* r6 ? s z.getPhases.<locals>.AfterHeadPhase.startTagBodyc S s | j j|� | jjd | j_d S )Nr� )r< r� rI rF r] )r@ r� r) r) r* r7 D s z2getPhases.<locals>.AfterHeadPhase.startTagFramesetc S st | j jdd|d i� | jjj| jj� | j jd j|� x4| jjd d d� D ] }|jdkrN| jjj |� P qNW d S )Nz#unexpected-start-tag-out-of-my-headr> r r r� ry )
rI r| r< r{ r� r rF r� r> �remove)r@ r� r� r) r) r* r8 H s
z2getPhases.<locals>.AfterHeadPhase.startTagFromHeadc S s | j jdd|d i� d S )Nzunexpected-start-tagr> )rI r| )r@ r� r) r) r* r R s z.getPhases.<locals>.AfterHeadPhase.startTagHeadc S s | j � |S )N)r )r@ r� r) r) r* r U s z/getPhases.<locals>.AfterHeadPhase.startTagOtherc S s | j � |S )N)r )r@ r� r) r) r* r* Y s z2getPhases.<locals>.AfterHeadPhase.endTagHtmlBodyBrc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r ] s z-getPhases.<locals>.AfterHeadPhase.endTagOtherc S s. | j jtdd�� | jjd | j_d| j_d S )Nr� ro r� T)r< r� r
rI rF r] r` )r@ r) r) r* r ` s z.getPhases.<locals>.AfterHeadPhase.anythingElseN)r7 r8 r9 rH r� r� r� r6 r7 r8 r r r* r r r) )r� r) r* �AfterHeadPhase" s
r: c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Zd3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z d=d>� Z!d?d@� Z"dAdB� Z#dCdD� Z$dEdF� Z%dGdH� Z&dIdJ� Z'dKdL� Z(dMdN� Z)dOdP� Z*dQdR� Z+dSdT� Z,dUdV� Z-dWdX� Z.dYdZ� Z/d[d\� Z0d]d^� Z1d_d`� Z2dadb� Z3dcdd� Z4dedf� Z5dgS )hz getPhases.<locals>.InBodyPhasec , s� � j | ||� | j| _tjd| jfdd| jfd | jfd | jfde| j ft
| j fdf| j fd&| j
fdg| jfd*| jfd+| jfdh| jfd8| jfd9| jfdi| jfd=| jfd>| jfdj| jfdk| jfdH| jfdI| jfdJ| jfdK| j fdL| j fdM| j fdN| j fdl| j fdQ| j!fdm| j"fdn| j#fdV| j$fdW| j%fdo| j&fg!�| _'| j(| j'_)tjd | j*fd| j+fdp| j,fd&| j-fd | j.fdq| j/ft
| j0fdr| j1fds| j2fd@| j3fg
�| _4| j5| j4_)d S )tNr� r r r r! r" r4 r r r r� r� �address�article�aside�
blockquote�center�details�dirr+ �dl�fieldset�
figcaption�figure�footer�header�hgroup�main�menu�nav�olr( �section�summary�ul�pre�listing�form�li�dd�dtrR �a�b�big�code�em�font�i�s�small�strike�strong�tt�u�nobr�button�applet�marquee�objectZxmpr� �arear �embed�img�keygen�wbr�param�source�track�input�hr�image�isindex�textareaZiframer �noembedr r� �rp�rt�option�optgroupZmathru r� �colr� �framer� r� r� r� r� r� r� �dialog) r r r r! r" r4 r r r )r; r< r= r> r? r@ rA r+ rB rC rD rE rF rG rH rI rJ rK rL r( rM rN rO )rP rQ )rS rT rU ) rW rX rY rZ r[ r\ r] r^ r_ r` ra rb )re rf rg )rh r ri rj rk rl )rm rn ro )ru r )rv rw )rx ry ) r� rz r� r{ r� r� r� r� r� r� r� )r; r< r= r> rd r? r@ r| rA r+ rB rC rD rE rF rG rH rQ rI rJ rK rL rP rM rN rO )rT rU rS )rV rW rX rY rZ r[ r\ rc r] r^ r_ r` ra rb )re rf rg )6rH � processSpaceCharactersNonPrer� r r r� �startTagProcessInHeadr6 r7 �startTagClosePr �startTagHeading�startTagPreListing� startTagForm�startTagListItem�startTagPlaintext� startTagA�startTagFormatting� startTagNobr�startTagButton�startTagAppletMarqueeObject� startTagXmp�
startTagTable�startTagVoidFormatting�startTagParamSource�
startTagInput�
startTagHr�
startTagImage�startTagIsIndex�startTagTextarea�startTagIFramer% �startTagRawtext�startTagSelect� startTagRpRt� startTagOpt� startTagMath� startTagSvg�startTagMisplacedr� r r �
endTagBody�
endTagHtml� endTagBlock�
endTagForm�endTagP�endTagListItem�
endTagHeading�endTagFormatting�endTagAppletMarqueeObjectr4 r� r )r@ rI r< )r� r) r* rH h s~
z'getPhases.<locals>.InBodyPhase.__init__c S s$ |j |j ko"|j|jko"|j|jkS )N)r> rh ri )r@ Znode1Znode2r) r) r* �isMatchingFormattingElement� s z:getPhases.<locals>.InBodyPhase.isMatchingFormattingElementc S s� | j j|� | j jd }g }x<| j jd d d� D ]&}|tkr@P q0| j||�r0|j|� q0W t|�dksjt�t|�dkr�| j jj |d � | j jj|� d S )Nr � ry ry ry )
r< r� r{ �activeFormattingElementsr
r� r� r~ r� r9 )r@ r� rk ZmatchingElementsr� r) r) r* �addFormattingElement� s z3getPhases.<locals>.InBodyPhase.addFormattingElementc
S s@ t d�}x2| jjd d d� D ] }|j|kr | jjd� P q W d S )NrT rU rS r( r� r� r� r� r� r� r� r� r z expected-closing-tag-but-got-eof) rT rU rS r( r� r� r� r� r� r� r� r� ry )r� r< r{ r> rI r| )r@ Zallowed_elementsr� r) r) r* r� � s
z)getPhases.<locals>.InBodyPhase.processEOFc S sh |d }| j | _|jd�rJ| jjd jdkrJ| jjd j� rJ|dd � }|rd| jj� | jj|� d S )
Nrs �
r rP rQ rt ry )rP rQ rt ry ) r} r� r� r< r{ r> Z
hasContent�#reconstructActiveFormattingElementsr� )r@ r� rs r) r) r* �!processSpaceCharactersDropNewline� s
z@getPhases.<locals>.InBodyPhase.processSpaceCharactersDropNewlinec S sT |d dkrd S | j j� | j j|d � | jjrPtdd� |d D ��rPd| j_d S )Nrs � c S s g | ] }|t k�qS r) )r )r= �charr) r) r* rA � s zDgetPhases.<locals>.InBodyPhase.processCharacters.<locals>.<listcomp>F)r< r� r� rI r` �any)r@ r� r) r) r* r� � s
z0getPhases.<locals>.InBodyPhase.processCharactersc S s | j j� | j j|d � d S )Nrs )r< r� r� )r@ r� r) r) r* r} � s
z;getPhases.<locals>.InBodyPhase.processSpaceCharactersNonPrec S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r~ � s z4getPhases.<locals>.InBodyPhase.startTagProcessInHeadc S s� | j jdddi� t| jj�dks4| jjd jdkrB| j js�t�nFd| j _x<|d j � D ],\}}|| jjd j
krX|| jjd j
|< qXW d S )Nzunexpected-start-tagr> r� r Frs ) rI r| r~ r< r{ r> rP r� r` r. ri )r@ r� r� r� r) r) r* r6 � s z+getPhases.<locals>.InBodyPhase.startTagBodyc S s� | j jdddi� t| jj�dks4| jjd jdkrB| j js�t�nt| j jsLnj| jjd j rv| jjd j j
| jjd � x"| jjd jdkr�| jjj � qxW | jj |� | j j
d | j _d S ) Nzunexpected-start-tagr> r� r r� r� r� ry )rI r| r~ r< r{ r> rP r� r` �parent� removeChildr+ r� rF r] )r@ r� r) r) r* r7 � s " z/getPhases.<locals>.InBodyPhase.startTagFramesetc S s. | j jddd�r | jtd�� | j j|� d S )Nr( rd )�variant)r< �elementInScoper� r
r� )r@ r� r) r) r* r s z-getPhases.<locals>.InBodyPhase.startTagClosePc S s> | j jddd�r | jtd�� | j j|� d| j_| j| _d S )Nr( rd )r� F) r< r� r� r
r� rI r` r� r� )r@ r� r) r) r* r� s
z1getPhases.<locals>.InBodyPhase.startTagPreListingc S sZ | j jr | jjdddi� n:| j jddd�r:| jtd�� | j j|� | j jd | j _d S ) Nzunexpected-start-tagr> rR r( rd )r� r ry ) r< � formPointerrI r| r� r� r
r� r{ )r@ r� r) r) r* r� s z+getPhases.<locals>.InBodyPhase.startTagFormc S s� d| j _dgddgddgd�}||d }xLt| jj�D ]<}|j|kr^| j jjt|jd�� P |j t
kr8|jd
kr8P q8W | jj d
d d �r�| j jjtd
d�� | jj |� d S )NFrS rU rT )rS rU rT r> rp r; r+ r( rd )r� )r; r+ r( )
rI r` �reversedr< r{ r> r] r� r
� nameTupler r� r� )r@ r� Z stopNamesMapZ stopNamesr� r) r) r* r� s"
z/getPhases.<locals>.InBodyPhase.startTagListItemc S s> | j jddd�r | jtd�� | j j|� | jjj| jj_d S )Nr( rd )r� ) r< r� r� r
r� rI rL r\ rZ )r@ r� r) r) r* r� 4 s z0getPhases.<locals>.InBodyPhase.startTagPlaintextc S sb | j jddd�r | jtd�� | j jd jtkrR| jjdd|d i� | j jj � | j j
|� d S )Nr( rd )r� r zunexpected-start-tagr> ry ) r< r� r� r
r{ r> r rI r| r+ r� )r@ r� r) r) r* r� : s z.getPhases.<locals>.InBodyPhase.startTagHeadingc S s~ | j jd�}|rf| jjdddd�� | jtd�� || j jkrL| j jj|� || j jkrf| j jj|� | j j � | j
|� d S )NrV z$unexpected-start-tag-implies-end-tag)� startName�endName) r< �!elementInActiveFormattingElementsrI r| r� r
r{ r9 r� r� r� )r@ r� Z afeAElementr) r) r* r� B s
z(getPhases.<locals>.InBodyPhase.startTagAc S s | j j� | j|� d S )N)r< r� r� )r@ r� r) r) r* r� O s
z1getPhases.<locals>.InBodyPhase.startTagFormattingc S sP | j j� | j jd�rB| jjdddd�� | jtd�� | j j� | j|� d S )Nrc z$unexpected-start-tag-implies-end-tag)r� r� )r< r� r� rI r| r� r
r� )r@ r� r) r) r* r� S s
z+getPhases.<locals>.InBodyPhase.startTagNobrc S sT | j jd�r2| jjdddd�� | jtd�� |S | j j� | j j|� d| j_d S )Nrd z$unexpected-start-tag-implies-end-tag)r� r� F) r< r� rI r| r� r
r� r� r` )r@ r� r) r) r* r� ] s
z-getPhases.<locals>.InBodyPhase.startTagButtonc S s0 | j j� | j j|� | j jjt� d| j_d S )NF)r< r� r� r� r� r
rI r` )r@ r� r) r) r* r� h s
z:getPhases.<locals>.InBodyPhase.startTagAppletMarqueeObjectc S sB | j jddd�r | jtd�� | j j� d| j_| jj|d� d S )Nr( rd )r� Fr� )r< r� r� r
r� rI r` r� )r@ r� r) r) r* r� n s
z*getPhases.<locals>.InBodyPhase.startTagXmpc S sR | j jdkr*| jjddd�r*| jtd�� | jj|� d| j _| j jd | j _ d S )Nr r( rd )r� Fr� )
rI rW r< r� r� r
r� r` rF r] )r@ r� r) r) r* r� u s z,getPhases.<locals>.InBodyPhase.startTagTablec S s6 | j j� | j j|� | j jj� d|d< d| j_d S )NTrx F)r< r� r� r{ r+ rI r` )r@ r� r) r) r* r� } s
z5getPhases.<locals>.InBodyPhase.startTagVoidFormattingc S s@ | j j}| j|� d|d kr<|d d jt�dkr<|| j _d S )Nr2 rs �hidden)rI r` r� rj r )r@ r� r` r) r) r* r� � s
z,getPhases.<locals>.InBodyPhase.startTagInputc S s$ | j j|� | j jj� d|d< d S )NTrx )r< r� r{ r+ )r@ r� r) r) r* r� � s z2getPhases.<locals>.InBodyPhase.startTagParamSourcec S sJ | j jddd�r | jtd�� | j j|� | j jj� d|d< d| j_d S )Nr( rd )r� Trx F) r< r� r� r
r� r{ r+ rI r` )r@ r� r) r) r* r� � s z)getPhases.<locals>.InBodyPhase.startTagHrc S s6 | j jdddd�� | jtdd|d |d d�� d S ) Nz unexpected-start-tag-treated-asrr rj )� originalName�newNamero rs rw )ri rw )rI r| r� r
)r@ r� r) r) r* r� � s
z,getPhases.<locals>.InBodyPhase.startTagImagec S s | j jdddi� | jjr d S i }d|d kr>|d d |d< | jtdd|d�� | jtd d�� | jtd
d�� d |d kr�|d d }nd }| jtd
|d�� |d j� }d|kr�|d= d |kr�|d = d|d< | jtdd||d d�� | j td
�� | jtd d�� | j td�� d S )Nzdeprecated-tagr> rs �actionrs rR ro )ri rq Zlabel�promptz3This is a searchable index. Enter search keywords: rn )r2 rs rp rw )ri rw )
rI r| r< r� r� r
r� r �copyr� )r@ r� Z
form_attrsr� ri r) r) r* r� � s6
z.getPhases.<locals>.InBodyPhase.startTagIsIndexc S s0 | j j|� | jjj| jj_| j| _d| j_d S )NF) r< r� rI rL rY rZ r� r� r` )r@ r� r) r) r* r� � s z/getPhases.<locals>.InBodyPhase.startTagTextareac S s d| j _| j|� d S )NF)rI r` r� )r@ r� r) r) r* r� � s z-getPhases.<locals>.InBodyPhase.startTagIFramec S s" | j jr| j|� n
| j|� d S )N)rI rK r� r )r@ r� r) r) r* r% � s z/getPhases.<locals>.InBodyPhase.startTagNoscriptc S s | j j|d� dS )z8iframe, noembed noframes, noscript(if scripting enabled)r� N)rI r� )r@ r� r) r) r* r� � s z.getPhases.<locals>.InBodyPhase.startTagRawtextc S s@ | j jd jdkr$| jjjtd�� | j j� | jj j|� d S )Nr rx ry ) r< r{ r> rI r] r� r
r� r� )r@ r� r) r) r* r� � s
z*getPhases.<locals>.InBodyPhase.startTagOptc S s� | j j� | j j|� d| j_| jj| jjd | jjd | jjd | jjd | jjd | jjd fkrx| jjd | j_n| jjd | j_d S )
NFr� r� r� r� r� r� �inSelectInTabler� )r< r� r� rI r` r] rF )r@ r� r) r) r* r� � s
z-getPhases.<locals>.InBodyPhase.startTagSelectc S sB | j jd�r2| j j� | j jd jdkr2| jj� | j j|� d S )N�rubyr ry )r< r� �generateImpliedEndTagsr{ r> rI r| r� )r@ r� r) r) r* r� � s
z+getPhases.<locals>.InBodyPhase.startTagRpRtc S sZ | j j� | jj|� | jj|� td |d< | j j|� |d rV| j jj� d|d< d S )Nrd rh rw Trx ) r< r� rI r r r r� r{ r+ )r@ r� r) r) r* r� � s
z+getPhases.<locals>.InBodyPhase.startTagMathc S sZ | j j� | jj|� | jj|� td |d< | j j|� |d rV| j jj� d|d< d S )Nru rh rw Trx ) r< r� rI r r r r� r{ r+ )r@ r� r) r) r* r� � s
z*getPhases.<locals>.InBodyPhase.startTagSvgc S s | j jdd|d i� dS )a5 Elements that should be children of other elements that have a
different insertion mode; here they are ignored
"caption", "col", "colgroup", "frame", "frameset", "head",
"option", "optgroup", "tbody", "td", "tfoot", "th", "thead",
"tr", "noscript"
z unexpected-start-tag-ignoredr> N)rI r| )r@ r� r) r) r* r� s z0getPhases.<locals>.InBodyPhase.startTagMisplacedc S s | j j� | j j|� d S )N)r< r� r� )r@ r� r) r) r* r s
z,getPhases.<locals>.InBodyPhase.startTagOtherc S s� | j jddd�sD| jtdd�� | jjdddi� | jtdd�� nX| j jd� | j jd j dkrt| jjdddi� | j jj
� }x|j dkr�| j jj
� }q�W d S )
Nr( rd )r� ro zunexpected-end-tagr> rp r ry ) r< r� r r
rI r| r� r� r{ r> r+ )r@ r� r� r) r) r* r� s z&getPhases.<locals>.InBodyPhase.endTagPc S s� | j jd�s| jj� d S | j jd jdkrlx>| j jdd � D ]*}|jtd�kr>| jjdd|jd�� P q>W | jjd | j_d S )Nr� r � rT rU rS ry rx r( rv rw r� r� r� r� r� r� r� z$expected-one-end-tag-but-got-another)�gotName� expectedName� afterBodyry )rT rU rS ry rx r( rv rw r� r� r� r� r� r� r� r� ) r< r� rI r| r{ r> r� rF r] )r@ r� r� r) r) r* r� ! s
z)getPhases.<locals>.InBodyPhase.endTagBodyc S s" | j jd�r | jtd�� |S d S )Nr� )r< r� r� r
)r@ r� r) r) r* r� 3 s z)getPhases.<locals>.InBodyPhase.endTagHtmlc S s� |d dkr| j | _| jj|d �}|r2| jj� | jjd j|d kr^| jjdd|d i� |r�| jjj � }x |j|d kr�| jjj � }qpW d S )Nr> rP r zend-tag-too-earlyry )
r} r� r< r� r� r{ r> rI r| r+ )r@ r� ZinScoper� r) r) r* r� 9 s
z*getPhases.<locals>.InBodyPhase.endTagBlockc S sx | j j}d | j _|d ks&| j j|� r:| jjdddi� n:| j j� | j jd |krf| jjdddi� | j jj|� d S )Nzunexpected-end-tagr> rR r zend-tag-too-early-ignoredry )r< r� r� rI r| r� r{ r9 )r@ r� r� r) r) r* r� G s
z)getPhases.<locals>.InBodyPhase.endTagFormc S s� |d dkrd}nd }| j j|d |d�sB| jjdd|d i� nj| j j|d d� | j jd j|d kr�| jjdd|d i� | j jj� }x |j|d kr�| j jj� }q�W d S )
Nr> rS �list)r� zunexpected-end-tag)�excluder zend-tag-too-earlyry )r< r� rI r| r� r{ r> r+ )r@ r� r� r� r) r) r* r� T s z-getPhases.<locals>.InBodyPhase.endTagListItemc S s� x$t D ] }| jj|�r| jj� P qW | jjd j|d krR| jjdd|d i� xBt D ]:}| jj|�rX| jjj� }x|jt kr�| jjj� }qvW P qXW d S )Nr r> zend-tag-too-earlyry ) r r< r� r� r{ r> rI r| r+ )r@ r� �itemr) r) r* r� e s
z,getPhases.<locals>.InBodyPhase.endTagHeadingc S s" d}�x|dk �r |d7 }| j j|d �}| sL|| j jkrZ| j j|j� rZ| j|� dS || j jkr�| jjdd|d i� | j jj |� dS | j j|j�s�| jjdd|d i� dS || j jd kr�| jjdd|d i� | j jj
|�}d}x,| j j|d� D ]}|j t k�r |}P �q W |dk�rb| j jj
� }x ||k�rN| j jj
� }�q4W | j jj |� dS | j j|d }| j jj
|�}| } }
d} | j jj
|
�} x�| d k �rh| d7 } | d8 } | j j| }
|
| j jk�r�| j jj |
� �q�|
|k�r�P | |k�r
| j jj
|
�d }|
j� }
|
| j j| j jj
|
�< |
| j j| j jj
|
�< |
}
| j�rV| jj| � |
j| � |
} �q�W | j�r~| jj| � |jtd�k�r�| j j� \}}|j| |� n
|j| � |j� }
|j|
� |j|
� | j jj |� | j jj||
� | j jj |� | j jj| j jj
|�d |
� qW dS )z)The much-feared adoption agency algorithmr � r r> Nzadoption-agency-1.2zadoption-agency-4.4zadoption-agency-1.3r� r� r� r� r� r� ry )r� r� r� r� r� )r< r� r{ r� r> r rI r| r� r9 �indexr� r r+ Z cloneNoder� r� Z appendChildr� Z getTableMisnestedNodePosition� insertBeforeZreparentChildren�insert)r@ r� ZouterLoopCounterZformattingElementZafeIndexZ
furthestBlockrk ZcommonAncestorZbookmarkZlastNoder� ZinnerLoopCounterr� Zcloner� r� r) r) r* r� t s�
z/getPhases.<locals>.InBodyPhase.endTagFormattingc S s� | j j|d �r| j j� | j jd j|d krF| jjdd|d i� | j j|d �r�| j jj� }x |j|d kr�| j jj� }qdW | j j� d S )Nr> r zend-tag-too-earlyry ) r< r� r� r{ r> rI r| r+ � clearActiveFormattingElements)r@ r� rk r) r) r* r� s
z8getPhases.<locals>.InBodyPhase.endTagAppletMarqueeObjectc S s@ | j jdddd�� | jj� | jjtdd�� | jjj� d S )Nz unexpected-end-tag-treated-asr z
br element)r� r� ro )rI r| r< r� r� r
r{ r+ )r@ r� r) r) r* r4 # s
z'getPhases.<locals>.InBodyPhase.endTagBrc S s� x�| j jd d d� D ]�}|j|d kr~| j j|d d� | j jd j|d krd| jjdd|d i� x| j jj� |krxqfW P q|jtkr| jjdd|d i� P qW d S )Nr r> )r� zunexpected-end-tagry ry ) r< r{ r> r� rI r| r+ r� r )r@ r� r� r) r) r* r * s
z*getPhases.<locals>.InBodyPhase.endTagOtherN)6r7 r8 r9 rH r� r� r� r� r� r} r~ r6 r7 r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r% r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r4 r r) )r� r) r* � InBodyPhasee sh G
$ r� c s@ e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
S )z getPhases.<locals>.TextPhasec sF � j | ||� tjg �| _| j| j_tjd| jfg�| _| j| j_d S )Nr ) rH r r r� r r � endTagScriptr� r )r@ rI r< )r� r) r* rH 9 s
z%getPhases.<locals>.TextPhase.__init__c S s | j j|d � d S )Nrs )r< r� )r@ r� r) r) r* r� A s z.getPhases.<locals>.TextPhase.processCharactersc S s8 | j jdd| jjd ji� | jjj� | j j| j _dS )Nz&expected-named-closing-tag-but-got-eofr> r Try )rI r| r< r{ r> r+ r� r] )r@ r) r) r* r� D s
z'getPhases.<locals>.TextPhase.processEOFc S s dst d|d ��d S )NFz4Tried to process start tag %s in RCDATA/RAWTEXT moder> )r� )r@ r� r) r) r* r K s z*getPhases.<locals>.TextPhase.startTagOtherc S s* | j jj� }|jdkst�| jj| j_d S )Nr )r< r{ r+ r> r� rI r� r] )r@ r� r� r) r) r* r� N s z)getPhases.<locals>.TextPhase.endTagScriptc S s | j jj� | jj| j_d S )N)r< r{ r+ rI r� r] )r@ r� r) r) r* r U s z(getPhases.<locals>.TextPhase.endTagOtherN) r7 r8 r9 rH r� r� r r� r r) )r� r) r* � TextPhase8 s r� c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'S )(z getPhases.<locals>.InTablePhasec
s� � j | ||� tjd| jfd| jfd| jfd| jfd| jfd| jfd | j fd| j
fd| j fd| j fg
�| _
| j| j
_tjd | jfd| jfg�| _| j| j_d S )Nr� r� r� rz r� r� r� r� r� r� r� r r rp rR r� )r� r� r� )r� r� r� )r r ) r� r� rz r� r� r� r� r� r� r� r� )rH r r r� �startTagCaption�startTagColgroup� startTagCol�startTagRowGroup�startTagImplyTbodyr� �startTagStyleScriptr� r� r� r r � endTagTable� endTagIgnorer� r )r@ rI r< )r� r) r* rH [ s$
z(getPhases.<locals>.InTablePhase.__init__c S s( x"| j jd jdkr"| j jj� qW d S )Nr r� r� ry )r� r� )r< r{ r> r+ )r@ r) r) r* �clearStackToTableContexts s z8getPhases.<locals>.InTablePhase.clearStackToTableContextc S s0 | j jd jdkr | jjd� n | jjs,t�d S )Nr r� z eof-in-tablery )r< r{ r> rI r| rP r� )r@ r) r) r* r� | s z*getPhases.<locals>.InTablePhase.processEOFc S s4 | j j}| j jd | j _|| j j_| j jj|� d S )N� inTableText)rI r] rF r� r� )r@ r� r� r) r) r* r� � s
z6getPhases.<locals>.InTablePhase.processSpaceCharactersc S s4 | j j}| j jd | j _|| j j_| j jj|� d S )Nr� )rI r] rF r� r� )r@ r� r� r) r) r* r� � s
z1getPhases.<locals>.InTablePhase.processCharactersc S s& d| j _| jjd j|� d| j _d S )NTr� F)r< �insertFromTablerI rF r� )r@ r� r) r) r* r� � s z*getPhases.<locals>.InTablePhase.insertTextc S s6 | j � | jjjt� | jj|� | jjd | j_d S )Nr� ) r� r< r� r� r
r� rI rF r] )r@ r� r) r) r* r� � s z/getPhases.<locals>.InTablePhase.startTagCaptionc S s( | j � | jj|� | jjd | j_d S )Nr� )r� r< r� rI rF r] )r@ r� r) r) r* r� � s z0getPhases.<locals>.InTablePhase.startTagColgroupc S s | j tdd�� |S )Nr� ro )r� r
)r@ r� r) r) r* r� � s z+getPhases.<locals>.InTablePhase.startTagColc S s( | j � | jj|� | jjd | j_d S )Nr� )r� r< r� rI rF r] )r@ r� r) r) r* r� � s z0getPhases.<locals>.InTablePhase.startTagRowGroupc S s | j tdd�� |S )Nr� ro )r� r
)r@ r� r) r) r* r� � s z2getPhases.<locals>.InTablePhase.startTagImplyTbodyc S s6 | j jdddd�� | j jjtd�� | j js2|S d S )Nz$unexpected-start-tag-implies-end-tagr� )r� r� )rI r| r] r� r
rP )r@ r� r) r) r* r� � s
z-getPhases.<locals>.InTablePhase.startTagTablec S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r� � s z3getPhases.<locals>.InTablePhase.startTagStyleScriptc S sV d|d krH|d d j t�dkrH| jjd� | jj|� | jjj� n
| j|� d S )Nr2 rs r� z unexpected-hidden-input-in-table) rj r rI r| r< r� r{ r+ r )r@ r� r) r) r* r� � s z-getPhases.<locals>.InTablePhase.startTagInputc S sD | j jd� | jjd kr@| jj|� | jjd | j_| jjj� d S )Nzunexpected-form-in-tabler ry )rI r| r< r� r� r{ r+ )r@ r� r) r) r* r� � s
z,getPhases.<locals>.InTablePhase.startTagFormc S s< | j jdd|d i� d| j_| j jd j|� d| j_d S )Nz)unexpected-start-tag-implies-table-voodoor> Tr� F)rI r| r< r� rF r� )r@ r� r) r) r* r � s z-getPhases.<locals>.InTablePhase.startTagOtherc S s� | j jddd�r�| j j� | j jd jdkrJ| jjdd| j jd jd�� x"| j jd jdkrl| j jj� qLW | j jj� | jj� n| jj s�t
�| jj� d S ) Nr� )r� r zend-tag-too-early-named)r� r� ry ry ry ) r< r� r� r{ r> rI r| r+ r_ rP r� )r@ r� r) r) r* r� � s
z+getPhases.<locals>.InTablePhase.endTagTablec S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r� � s z,getPhases.<locals>.InTablePhase.endTagIgnorec S s< | j jdd|d i� d| j_| j jd j|� d| j_d S )Nz'unexpected-end-tag-implies-table-voodoor> Tr� F)rI r| r< r� rF r� )r@ r� r) r) r* r � s z+getPhases.<locals>.InTablePhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r r) )r� r) r* � InTablePhaseY s&
r� c sP e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z#getPhases.<locals>.InTableTextPhasec s � j | ||� d | _g | _d S )N)rH r� �characterTokens)r@ rI r< )r� r) r* rH � s z,getPhases.<locals>.InTableTextPhase.__init__c S sd dj dd� | jD ��}tdd� |D ��rJtd |d�}| jjd j|� n|rZ| jj|� g | _d S )Nr� c S s g | ] }|d �qS )rs r) )r= r� r) r) r* rA � s zGgetPhases.<locals>.InTableTextPhase.flushCharacters.<locals>.<listcomp>c S s g | ] }|t k�qS r) )r )r= r� r) r) r* rA � s rn )r2 rs r� )�joinr� r� r rI rF r� r< )r@ rs r� r) r) r* �flushCharacters� s z3getPhases.<locals>.InTableTextPhase.flushCharactersc S s | j � | j| j_|S )N)r� r� rI r] )r@ r� r) r) r* r� � s
z2getPhases.<locals>.InTableTextPhase.processCommentc S s | j � | j| j_dS )NT)r� r� rI r] )r@ r) r) r* r� � s
z.getPhases.<locals>.InTableTextPhase.processEOFc S s |d dkrd S | j j|� d S )Nrs r� )r� r� )r@ r� r) r) r* r� s z5getPhases.<locals>.InTableTextPhase.processCharactersc S s | j j|� d S )N)r� r� )r@ r� r) r) r* r� s z:getPhases.<locals>.InTableTextPhase.processSpaceCharactersc S s | j � | j| j_|S )N)r� r� rI r] )r@ r� r) r) r* r�
s
z3getPhases.<locals>.InTableTextPhase.processStartTagc S s | j � | j| j_|S )N)r� r� rI r] )r@ r� r) r) r* r� s
z1getPhases.<locals>.InTableTextPhase.processEndTagN) r7 r8 r9 rH r� r� r� r� r� r� r� r) )r� r) r* �InTableTextPhase� s r� c s` e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dS )z!getPhases.<locals>.InCaptionPhasec
sf � j | ||� tjd| jfd
| jfg�| _| j| j_tjd| jfd | j fd| j
fg�| _ | j | j _d S )Nr� r� rz r� r� r� r� r� r� r� r� r� ) r� rz r� r� r� r� r� r� r� )
r� rz r� r� r� r� r� r� r� r� )
rH r r r� �startTagTableElementr� r r �
endTagCaptionr� r� r� r )r@ rI r< )r� r) r* rH s
z*getPhases.<locals>.InCaptionPhase.__init__c S s | j jddd� S )Nr� r� )r� )r< r� )r@ r) r) r* �ignoreEndTagCaption+ s z5getPhases.<locals>.InCaptionPhase.ignoreEndTagCaptionc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� . s z,getPhases.<locals>.InCaptionPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� 1 s z3getPhases.<locals>.InCaptionPhase.processCharactersc S s0 | j j� | j� }| j jjtd�� |s,|S d S )Nr� )rI r| r� r] r� r
)r@ r� � ignoreEndTagr) r) r* r� 4 s
z6getPhases.<locals>.InCaptionPhase.startTagTableElementc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r < s z/getPhases.<locals>.InCaptionPhase.startTagOtherc S s� | j � s�| jj� | jjd jdkrB| jjdd| jjd jd�� x"| jjd jdkrd| jjj� qDW | jjj� | jj� | jj d | j_
n| jj s�t �| jj� d S ) Nr r� z$expected-one-end-tag-but-got-another)r� r� r� ry ry ry )
r� r< r� r{ r> rI r| r+ r� rF r] rP r� )r@ r� r) r) r* r� ? s
z/getPhases.<locals>.InCaptionPhase.endTagCaptionc S s0 | j j� | j� }| j jjtd�� |s,|S d S )Nr� )rI r| r� r] r� r
)r@ r� r� r) r) r* r� Q s
z-getPhases.<locals>.InCaptionPhase.endTagTablec S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r� X s z.getPhases.<locals>.InCaptionPhase.endTagIgnorec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r [ s z-getPhases.<locals>.InCaptionPhase.endTagOtherN)
r7 r8 r9 rH r� r� r� r� r r� r� r� r r) )r� r) r* �InCaptionPhase s r� c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z%getPhases.<locals>.InColumnGroupPhasec s^ � j | ||� tjd| jfd| jfg�| _| j| j_tjd| jfd| j fg�| _
| j | j
_d S )Nr� rz r� ) rH r r r� r� r� r r �endTagColgroup� endTagColr� r )r@ rI r< )r� r) r* rH a s
z.getPhases.<locals>.InColumnGroupPhase.__init__c S s | j jd jdkS )Nr r� ry )r< r{ r> )r@ r) r) r* �ignoreEndTagColgroupp s z:getPhases.<locals>.InColumnGroupPhase.ignoreEndTagColgroupc S sD | j jd jdkr"| jjs t�d S | j� }| jtd�� |s@dS d S )Nr r� r� Try ) r< r{ r> rI rP r� r� r� r
)r@ r� r) r) r* r� s s z0getPhases.<locals>.InColumnGroupPhase.processEOFc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r
)r@ r� r� r) r) r* r� } s z7getPhases.<locals>.InColumnGroupPhase.processCharactersc S s$ | j j|� | j jj� d|d< d S )NTrx )r< r� r{ r+ )r@ r� r) r) r* r� � s z1getPhases.<locals>.InColumnGroupPhase.startTagColc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r
)r@ r� r� r) r) r* r � s z3getPhases.<locals>.InColumnGroupPhase.startTagOtherc S s@ | j � r | jjst�| jj� n | jjj� | jjd | j_ d S )Nr� )
r� rI rP r� r| r< r{ r+ rF r] )r@ r� r) r) r* r� � s
z4getPhases.<locals>.InColumnGroupPhase.endTagColgroupc S s | j jdddi� d S )Nz
no-end-tagr> rz )rI r| )r@ r� r) r) r* r� � s z/getPhases.<locals>.InColumnGroupPhase.endTagColc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r
)r@ r� r� r) r) r* r � s z1getPhases.<locals>.InColumnGroupPhase.endTagOtherN) r7 r8 r9 rH r� r� r� r� r r� r� r r) )r� r) r* �InColumnGroupPhase^ s
r� c sx e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) z#getPhases.<locals>.InTableBodyPhasec sv � j | ||� tjd| jfd| jfd
| jfd| jfg�| _| j| j_ tjd| j
fd | j fd| j fg�| _
| j| j
_ d S )Nr� r� r� r� r� rz r� r� r� r� r� r� )r� r� )r� rz r� r� r� r� )r� r� r� )r� r� rz r� r� r� r� r� )rH r r r� �
startTagTr�startTagTableCell�startTagTableOtherr� r r �endTagTableRowGroupr� r� r� r )r@ rI r< )r� r) r* rH � s
z,getPhases.<locals>.InTableBodyPhase.__init__c S sF x"| j jd jdkr"| j jj� qW | j jd jdkrB| jjsBt�d S ) Nr r� r� r� r� ry )r� r� r� r� ry )r< r{ r> r+ rI rP r� )r@ r) r) r* � clearStackToTableBodyContext� s
z@getPhases.<locals>.InTableBodyPhase.clearStackToTableBodyContextc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� � s z.getPhases.<locals>.InTableBodyPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z:getPhases.<locals>.InTableBodyPhase.processSpaceCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z5getPhases.<locals>.InTableBodyPhase.processCharactersc S s( | j � | jj|� | jjd | j_d S )Nr� )r� r< r� rI rF r] )r@ r� r) r) r* r� � s z.getPhases.<locals>.InTableBodyPhase.startTagTrc S s* | j jdd|d i� | jtdd�� |S )Nz unexpected-cell-in-table-bodyr> r� ro )rI r| r� r
)r@ r� r) r) r* r� � s z5getPhases.<locals>.InTableBodyPhase.startTagTableCellc S sn | j jddd�s0| j jddd�s0| j jddd�rT| j� | jt| j jd j�� |S | jjs`t �| jj
� d S )Nr� r� )r� r� r� r ry ) r< r� r� r� r
r{ r> rI rP r� r| )r@ r� r) r) r* r� � s z6getPhases.<locals>.InTableBodyPhase.startTagTableOtherc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z1getPhases.<locals>.InTableBodyPhase.startTagOtherc S sT | j j|d dd�r:| j� | j jj� | jjd | j_n| jjdd|d i� d S )Nr> r� )r� r� z unexpected-end-tag-in-table-body) r< r� r� r{ r+ rI rF r] r| )r@ r� r) r) r* r� � s z7getPhases.<locals>.InTableBodyPhase.endTagTableRowGroupc S sn | j jddd�s0| j jddd�s0| j jddd�rT| j� | jt| j jd j�� |S | jjs`t �| jj
� d S )Nr� r� )r� r� r� r ry ) r< r� r� r� r
r{ r> rI rP r� r| )r@ r� r) r) r* r� � s z/getPhases.<locals>.InTableBodyPhase.endTagTablec S s | j jdd|d i� d S )Nz unexpected-end-tag-in-table-bodyr> )rI r| )r@ r� r) r) r* r� � s z0getPhases.<locals>.InTableBodyPhase.endTagIgnorec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z/getPhases.<locals>.InTableBodyPhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r� r r� r� r� r r) )r� r) r* �InTableBodyPhase� s
r� c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd S ) z getPhases.<locals>.InRowPhasec sv � j | ||� tjd| jfd
| jfd| jfg�| _| j| j_tjd
| j fd | j
fd| j fd| j fg�| _
| j| j
_d S )Nr� r� r� r� rz r� r� r� r� r� r� r� )r� r� )r� rz r� r� r� r� r� )r� r� r� )r� r� rz r� r� r� r� )rH r r r� r� r� r� r r �endTagTrr� r� r� r� r )r@ rI r< )r� r) r* rH s
z&getPhases.<locals>.InRowPhase.__init__c S sD x>| j jd jdkr>| jjdd| j jd ji� | j jj� qW d S ) Nr r� r� z'unexpected-implied-end-tag-in-table-rowr> ry )r� r� ry )r< r{ r> rI r| r+ )r@ r) r) r* �clearStackToTableRowContext s z9getPhases.<locals>.InRowPhase.clearStackToTableRowContextc S s | j jddd� S )Nr� r� )r� )r< r� )r@ r) r) r* �ignoreEndTagTr s z,getPhases.<locals>.InRowPhase.ignoreEndTagTrc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� " s z(getPhases.<locals>.InRowPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� % s z4getPhases.<locals>.InRowPhase.processSpaceCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� ( s z/getPhases.<locals>.InRowPhase.processCharactersc S s6 | j � | jj|� | jjd | j_| jjjt� d S )Nr� ) r� r< r� rI rF r] r� r� r
)r@ r� r) r) r* r� + s z/getPhases.<locals>.InRowPhase.startTagTableCellc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r
)r@ r� r� r) r) r* r� 1 s z0getPhases.<locals>.InRowPhase.startTagTableOtherc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r 8 s z+getPhases.<locals>.InRowPhase.startTagOtherc S sH | j � s.| j� | jjj� | jjd | j_n| jjs:t �| jj
� d S )Nr� ) r� r� r< r{ r+ rI rF r] rP r� r| )r@ r� r) r) r* r� ; s z&getPhases.<locals>.InRowPhase.endTagTrc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r
)r@ r� r� r) r) r* r� E s z)getPhases.<locals>.InRowPhase.endTagTablec S s4 | j j|d dd�r&| jtd�� |S | jj� d S )Nr> r� )r� r� )r< r� r� r
rI r| )r@ r� r) r) r* r� M s z1getPhases.<locals>.InRowPhase.endTagTableRowGroupc S s | j jdd|d i� d S )Nz unexpected-end-tag-in-table-rowr> )rI r| )r@ r� r) r) r* r� T s z*getPhases.<locals>.InRowPhase.endTagIgnorec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r X s z)getPhases.<locals>.InRowPhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r� r r� r� r� r� r r) )r� r) r* �
InRowPhase s
r� c s` e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dS )z getPhases.<locals>.InCellPhasec sf � j | ||� tjd| jfd
| jfg�| _| j| j_tjd| jfd| j fd| j
fg�| _ | j | j _d S )Nr� r� rz r� r� r� r� r� r� r� r� r� ) r� rz r� r� r� r� r� r� r� )r� r� )r� r� rz r� r� )r� r� r� r� r� )
rH r r r� r� r� r r �endTagTableCellr� � endTagImplyr� r )r@ rI r< )r� r) r* rH ] s
z'getPhases.<locals>.InCellPhase.__init__c S sB | j jddd�r | jtd�� n | j jddd�r>| jtd�� d S )Nr� r� )r� r� )r< r� r� r
)r@ r) r) r* � closeCelln s z(getPhases.<locals>.InCellPhase.closeCellc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� u s z)getPhases.<locals>.InCellPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� x s z0getPhases.<locals>.InCellPhase.processCharactersc S sF | j jddd�s | j jddd�r,| j� |S | jjs8t�| jj� d S )Nr� r� )r� r� )r< r� r� rI rP r� r| )r@ r� r) r) r* r� { s z1getPhases.<locals>.InCellPhase.startTagTableOtherc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z,getPhases.<locals>.InCellPhase.startTagOtherc S s� | j j|d dd�r�| j j|d � | j jd j|d krt| jjdd|d i� x.| j jj� }|j|d krRP qRW n | j jj� | j j� | jj d | j_
n| jjdd|d i� d S ) Nr> r� )r� r zunexpected-cell-end-tagr� zunexpected-end-tagry ) r< r� r� r{ r> rI r| r+ r� rF r] )r@ r� r� r) r) r* r� � s
z.getPhases.<locals>.InCellPhase.endTagTableCellc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r� � s z+getPhases.<locals>.InCellPhase.endTagIgnorec S s. | j j|d dd�r | j� |S | jj� d S )Nr> r� )r� )r< r� r� rI r| )r@ r� r) r) r* r� � s z*getPhases.<locals>.InCellPhase.endTagImplyc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z*getPhases.<locals>.InCellPhase.endTagOtherN)
r7 r8 r9 rH r� r� r� r� r r� r� r� r r) )r� r) r* � InCellPhase[ s
r� c sx e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) z getPhases.<locals>.InSelectPhasec s� � j | ||� tjd| jfd| jfd| jfd| jfd | jfd| jfg�| _ | j
| j _ tjd| j fd| j
fd| jfg�| _| j| j_ d S )
Nr� rx ry r� rp rk rt r )rp rk rt )rH r r r� �startTagOption�startTagOptgroupr� r� r& r� r r � endTagOption�endTagOptgroup� endTagSelectr� r )r@ rI r< )r� r) r* rH � s
z)getPhases.<locals>.InSelectPhase.__init__c S s0 | j jd jdkr | jjd� n | jjs,t�d S )Nr r� z
eof-in-selectry )r< r{ r> rI r| rP r� )r@ r) r) r* r� � s z+getPhases.<locals>.InSelectPhase.processEOFc S s$ |d dkrd S | j j|d � d S )Nrs r� )r< r� )r@ r� r) r) r* r� � s z2getPhases.<locals>.InSelectPhase.processCharactersc S s. | j jd jdkr | j jj� | j j|� d S )Nr rx ry )r< r{ r> r+ r� )r@ r� r) r) r* r� � s z/getPhases.<locals>.InSelectPhase.startTagOptionc S sL | j jd jdkr | j jj� | j jd jdkr<| j jj� | j j|� d S )Nr rx ry ry ry )r< r{ r> r+ r� )r@ r� r) r) r* r� � s
z1getPhases.<locals>.InSelectPhase.startTagOptgroupc S s | j jd� | jtd�� d S )Nzunexpected-select-in-selectr� )rI r| r� r
)r@ r� r) r) r* r� � s z/getPhases.<locals>.InSelectPhase.startTagSelectc S s> | j jd� | jjddd�r.| jtd�� |S | j js:t�d S )Nzunexpected-input-in-selectr� )r� )rI r| r< r� r� r
rP r� )r@ r� r) r) r* r� � s
z.getPhases.<locals>.InSelectPhase.startTagInputc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r& � s z/getPhases.<locals>.InSelectPhase.startTagScriptc S s | j jdd|d i� d S )Nz unexpected-start-tag-in-selectr> )rI r| )r@ r� r) r) r* r � s z.getPhases.<locals>.InSelectPhase.startTagOtherc S s6 | j jd jdkr | j jj� n| jjdddi� d S )Nr rx z unexpected-end-tag-in-selectr> ry )r< r{ r> r+ rI r| )r@ r� r) r) r* r� � s z-getPhases.<locals>.InSelectPhase.endTagOptionc S sf | j jd jdkr0| j jd jdkr0| j jj� | j jd jdkrP| j jj� n| jjdddi� d S )
Nr rx r� ry z unexpected-end-tag-in-selectr> ry ���ry )r< r{ r> r+ rI r| )r@ r� r) r) r* r� � s z/getPhases.<locals>.InSelectPhase.endTagOptgroupc S s^ | j jddd�rD| j jj� }x|jdkr6| j jj� }q W | jj� n| jjsPt�| jj � d S )Nr� )r� )
r< r� r{ r+ r> rI r_ rP r� r| )r@ r� r� r) r) r* r� � s z-getPhases.<locals>.InSelectPhase.endTagSelectc S s | j jdd|d i� d S )Nz unexpected-end-tag-in-selectr> )rI r| )r@ r� r) r) r* r s z,getPhases.<locals>.InSelectPhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r& r r� r� r� r r) )r� r) r* �
InSelectPhase� s
r� c sH e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )z'getPhases.<locals>.InSelectInTablePhasec sN � j | ||� tjd | jfg�| _| j| j_tjd
| jfg�| _| j | j_d S ) Nr� r� r� r� r� r� r� r� )r� r� r� r� r� r� r� r� )r� r� r� r� r� r� r� r� )
rH r r r� r� r r r� r� r )r@ rI r< )r� r) r* rH s
z0getPhases.<locals>.InSelectInTablePhase.__init__c S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� s z2getPhases.<locals>.InSelectInTablePhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� s z9getPhases.<locals>.InSelectInTablePhase.processCharactersc S s( | j jdd|d i� | jtd�� |S )Nz5unexpected-table-element-start-tag-in-select-in-tabler> r� )rI r| r r
)r@ r� r) r) r* r� ! s z5getPhases.<locals>.InSelectInTablePhase.startTagTablec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r & s z5getPhases.<locals>.InSelectInTablePhase.startTagOtherc S s@ | j jdd|d i� | jj|d dd�r<| jtd�� |S d S )Nz3unexpected-table-element-end-tag-in-select-in-tabler> r� )r� r� )rI r| r< r� r r
)r@ r� r) r) r* r� ) s z3getPhases.<locals>.InSelectInTablePhase.endTagTablec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r / s z3getPhases.<locals>.InSelectInTablePhase.endTagOtherN)
r7 r8 r9 rH r� r� r� r r� r r) )r� r) r* �InSelectInTablePhase s r� c - s� e Zd Zeddddddddd d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,g,�Z� fd-d.�Zd/d0� Z� fd1d2�Zd3d4� Zd5d6� Z d7S )8z(getPhases.<locals>.InForeignContentPhaserW rX r> r� r r? rY rT r+ rB rU rZ ri Zh1Zh2Zh3Zh4Zh5Zh6r� rq r\ rj rS rQ rJ r4 rc rL r( rP r� r] r^ �spanr` r_ �subZsupr� ra rb rO �varc s � j | ||� d S )N)rH )r@ rI r< )r� r) r* rH < s z1getPhases.<locals>.InForeignContentPhase.__init__c % S sn ddddddddd d
d d d
ddddddddddddddd d d d d d!d"d#d$d%�$}|d& |krj||d& |d&< d S )'NZaltGlyphZ altGlyphDefZ altGlyphItemZ animateColorZ
animateMotionZanimateTransformZclipPathZfeBlendZ
feColorMatrixZfeComponentTransferZ feCompositeZfeConvolveMatrixZfeDiffuseLightingZfeDisplacementMapZfeDistantLightZfeFloodZfeFuncAZfeFuncBZfeFuncGZfeFuncRZfeGaussianBlurZfeImageZfeMergeZ feMergeNodeZ feMorphologyZfeOffsetZ fePointLightZfeSpecularLightingZ feSpotLightZfeTileZ feTurbulenceZ
foreignObjectZglyphRefZlinearGradientZradialGradientZtextPath)$ZaltglyphZ altglyphdefZ altglyphitemZ animatecolorZ
animatemotionZanimatetransformZclippathZfeblendZ
fecolormatrixZfecomponenttransferZ fecompositeZfeconvolvematrixZfediffuselightingZfedisplacementmapZfedistantlightZfefloodZfefuncaZfefuncbZfefuncgZfefuncrZfegaussianblurZfeimageZfemergeZ femergenodeZ femorphologyZfeoffsetZ fepointlightZfespecularlightingZ fespotlightZfetileZ feturbulenceZ
foreignobjectZglyphrefZlineargradientZradialgradientZtextpathr> r) )r@ r� � replacementsr) r) r* �adjustSVGTagNames? sL z:getPhases.<locals>.InForeignContentPhase.adjustSVGTagNamesc sL |d dkrd|d< n&| j jr<tdd� |d D ��r<d| j _� j| |� d S )Nrs r� u �c s s | ]}|t kV qd S )N)r )r= r� r) r) r* r� l s zMgetPhases.<locals>.InForeignContentPhase.processCharacters.<locals>.<genexpr>F)rI r` r� r� )r@ r� )r� r) r* r� h s
z:getPhases.<locals>.InForeignContentPhase.processCharactersc S s6 | j jd }|d | jksD|d dkr�t|d j� �tdddg�@ r�| jjdd|d i� xR| j jd j| j jkr�| jj | j jd � r�| jj
| j jd � r�| j jj � q\W |S |jt d kr�| jj
|� n$|jt d
kr�| j|� | jj|� | jj|� |j|d < | j j|� |d �r2| j jj � d
|d< d S )Nr r> r[ rs ZcolorZface�sizez*unexpected-html-element-in-foreign-contentrd ru rh rw Trx ry ry ry ry )r< r{ �breakoutElements�set�keysrI r| rh r rl rm r+ r r r r r r� )r@ r� r� r) r) r* r� p s.
z8getPhases.<locals>.InForeignContentPhase.processStartTagc S s� t | jj�d }| jjd }|jjt�|d krF| jjdd|d i� x�|jjt�|d kr�| jj| jj d kr�| jjj
� | jjj | j_x | jjj � |kr�| jjs�t
�q�W d }P |d8 }| jj| }|j| jjkr�qHqH| jjj|�}P qHW |S )Nr r> zunexpected-end-tagr� ry )r~ r< r{ r> rj r rI r| r] rF r� r� r+ r� rh r r� )r@ r� Z nodeIndexr� r� r) r) r* r� � s( z6getPhases.<locals>.InForeignContentPhase.processEndTagN)
r7 r8 r9 r� r rH r r� r� r� r) )r� r) r* �InForeignContentPhase2 s
) r c sP e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z!getPhases.<locals>.AfterBodyPhasec sN � j | ||� tjd| jfg�| _| j| j_tjd| jfg�| _| j | j_d S )Nr� )
rH r r r� r� r r r� r� r )r@ rI r< )r� r) r* rH � s
z*getPhases.<locals>.AfterBodyPhase.__init__c S s d S )Nr) )r@ r) r) r* r� � s z,getPhases.<locals>.AfterBodyPhase.processEOFc S s | j j|| j jd � d S )Nr )r< r� r{ )r@ r� r) r) r* r� � s z0getPhases.<locals>.AfterBodyPhase.processCommentc S s | j jd� | j jd | j _|S )Nzunexpected-char-after-bodyr� )rI r| rF r] )r@ r� r) r) r* r� � s z3getPhases.<locals>.AfterBodyPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z.getPhases.<locals>.AfterBodyPhase.startTagHtmlc S s* | j jdd|d i� | j jd | j _|S )Nz unexpected-start-tag-after-bodyr> r� )rI r| rF r] )r@ r� r) r) r* r � s z/getPhases.<locals>.AfterBodyPhase.startTagOtherc S s* | j jr| j jd� n| j jd | j _d S )Nz'unexpected-end-tag-after-body-innerhtml�afterAfterBody)rI rP r| rF r] )r@ r> r) r) r* r� � s z,getPhases.<locals>.AfterBodyPhase.endTagHtmlc S s* | j jdd|d i� | j jd | j _|S )Nz unexpected-end-tag-after-bodyr> r� )rI r| rF r] )r@ r� r) r) r* r � s z-getPhases.<locals>.AfterBodyPhase.endTagOtherN) r7 r8 r9 rH r� r� r� r� r r� r r) )r� r) r* �AfterBodyPhase� s r
c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z"getPhases.<locals>.InFramesetPhasec sf � j | ||� tjd| jfd| jfd| jfd| jfg�| _| j| j_ tjd| j
fg�| _ | j | j _ d S )Nr� r� r{ r )
rH r r r� r7 �
startTagFrame�startTagNoframesr� r r �endTagFramesetr� r )r@ rI r< )r� r) r* rH � s
z+getPhases.<locals>.InFramesetPhase.__init__c S s0 | j jd jdkr | jjd� n | jjs,t�d S )Nr r� zeof-in-framesetry )r< r{ r> rI r| rP r� )r@ r) r) r* r� � s z-getPhases.<locals>.InFramesetPhase.processEOFc S s | j jd� d S )Nzunexpected-char-in-frameset)rI r| )r@ r� r) r) r* r� � s z4getPhases.<locals>.InFramesetPhase.processCharactersc S s | j j|� d S )N)r< r� )r@ r� r) r) r* r7 � s z3getPhases.<locals>.InFramesetPhase.startTagFramesetc S s | j j|� | j jj� d S )N)r< r� r{ r+ )r@ r� r) r) r* r � s z0getPhases.<locals>.InFramesetPhase.startTagFramec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z3getPhases.<locals>.InFramesetPhase.startTagNoframesc S s | j jdd|d i� d S )Nz unexpected-start-tag-in-framesetr> )rI r| )r@ r� r) r) r* r � s z0getPhases.<locals>.InFramesetPhase.startTagOtherc S s\ | j jd jdkr | jjd� n | j jj� | jj rX| j jd jdkrX| jjd | j_d S )Nr r� z)unexpected-frameset-in-frameset-innerhtmlr� �
afterFramesetry ry ) r< r{ r> rI r| r+ rP rF r] )r@ r� r) r) r* r
� s
z1getPhases.<locals>.InFramesetPhase.endTagFramesetc S s | j jdd|d i� d S )Nz unexpected-end-tag-in-framesetr> )rI r| )r@ r� r) r) r* r
s z.getPhases.<locals>.InFramesetPhase.endTagOtherN) r7 r8 r9 rH r� r� r7 r r r r
r r) )r� r) r* �InFramesetPhase� s r c sH e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )z%getPhases.<locals>.AfterFramesetPhasec sV � j | ||� tjd| jfd| jfg�| _| j| j_tjd| jfg�| _ | j
| j _d S )Nr� r ) rH r r r� r r� r r r� r� r )r@ rI r< )r� r) r* rH
s
z.getPhases.<locals>.AfterFramesetPhase.__init__c S s d S )Nr) )r@ r) r) r* r�
s z0getPhases.<locals>.AfterFramesetPhase.processEOFc S s | j jd� d S )Nz unexpected-char-after-frameset)rI r| )r@ r� r) r) r* r� !
s z7getPhases.<locals>.AfterFramesetPhase.processCharactersc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r $
s z6getPhases.<locals>.AfterFramesetPhase.startTagNoframesc S s | j jdd|d i� d S )Nz#unexpected-start-tag-after-framesetr> )rI r| )r@ r� r) r) r* r '
s z3getPhases.<locals>.AfterFramesetPhase.startTagOtherc S s | j jd | j _d S )N�afterAfterFrameset)rI rF r] )r@ r� r) r) r* r� +
s z0getPhases.<locals>.AfterFramesetPhase.endTagHtmlc S s | j jdd|d i� d S )Nz!unexpected-end-tag-after-framesetr> )rI r| )r@ r� r) r) r* r .
s z1getPhases.<locals>.AfterFramesetPhase.endTagOtherN)
r7 r8 r9 rH r� r� r r r� r r) )r� r) r* �AfterFramesetPhase
s r c sP e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z&getPhases.<locals>.AfterAfterBodyPhasec s0 � j | ||� tjd| jfg�| _| j| j_d S )Nr� )rH r r r� r� r r )r@ rI r< )r� r) r* rH 3
s z/getPhases.<locals>.AfterAfterBodyPhase.__init__c S s d S )Nr) )r@ r) r) r* r� ;
s z1getPhases.<locals>.AfterAfterBodyPhase.processEOFc S s | j j|| j j� d S )N)r< r� r� )r@ r� r) r) r* r� >
s z5getPhases.<locals>.AfterAfterBodyPhase.processCommentc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� A
s z=getPhases.<locals>.AfterAfterBodyPhase.processSpaceCharactersc S s | j jd� | j jd | j _|S )Nzexpected-eof-but-got-charr� )rI r| rF r] )r@ r� r) r) r* r� D
s z8getPhases.<locals>.AfterAfterBodyPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� I
s z3getPhases.<locals>.AfterAfterBodyPhase.startTagHtmlc S s* | j jdd|d i� | j jd | j _|S )Nz expected-eof-but-got-start-tagr> r� )rI r| rF r] )r@ r� r) r) r* r L
s z4getPhases.<locals>.AfterAfterBodyPhase.startTagOtherc S s* | j jdd|d i� | j jd | j _|S )Nz expected-eof-but-got-end-tagr> r� )rI r| rF r] )r@ r� r) r) r* r� R
s z4getPhases.<locals>.AfterAfterBodyPhase.processEndTagN) r7 r8 r9 rH r� r� r� r� r� r r� r) )r� r) r* �AfterAfterBodyPhase2
s r c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z*getPhases.<locals>.AfterAfterFramesetPhasec s8 � j | ||� tjd| jfd| jfg�| _| j| j_d S )Nr� r )rH r r r� �startTagNoFramesr� r r )r@ rI r< )r� r) r* rH Y
s
z3getPhases.<locals>.AfterAfterFramesetPhase.__init__c S s d S )Nr) )r@ r) r) r* r� b
s z5getPhases.<locals>.AfterAfterFramesetPhase.processEOFc S s | j j|| j j� d S )N)r< r� r� )r@ r� r) r) r* r� e
s z9getPhases.<locals>.AfterAfterFramesetPhase.processCommentc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� h
s zAgetPhases.<locals>.AfterAfterFramesetPhase.processSpaceCharactersc S s | j jd� d S )Nzexpected-eof-but-got-char)rI r| )r@ r� r) r) r* r� k
s z<getPhases.<locals>.AfterAfterFramesetPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� n
s z7getPhases.<locals>.AfterAfterFramesetPhase.startTagHtmlc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r q
s z;getPhases.<locals>.AfterAfterFramesetPhase.startTagNoFramesc S s | j jdd|d i� d S )Nz expected-eof-but-got-start-tagr> )rI r| )r@ r� r) r) r* r t
s z8getPhases.<locals>.AfterAfterFramesetPhase.startTagOtherc S s | j jdd|d i� d S )Nz expected-eof-but-got-end-tagr> )rI r| )r@ r� r) r) r* r� x
s z8getPhases.<locals>.AfterAfterFramesetPhase.processEndTagN) r7 r8 r9 rH r� r� r� r� r� r r r� r) )r� r) r* �AfterAfterFramesetPhaseX
s r )rT rS r� r r/ r0 r� r� r� r� r� r� r� r� r� r� r� rv r� r� r r r )r )rG rV r� r r r r1 r5 r: r� r� r� r� r� r� r� r� r� r� r� r r
r r r r r) )r� r* rE _ sp ) #.g@C X! -GBbYLd's/9%&&rE c s^ t s
tjr t| d �t� �@ }nt| d �t� �@ }|rZt� fdd�| d j� D ��| d< d S )Nrs c 3 s" | ]\}}� j ||�|fV qd S )N)r} )r= �k�v)r r) r* r� �
s z$adjust_attributes.<locals>.<genexpr>)r r ZPY27r r� r r. )r� r Zneeds_adjustmentr) )r r* r� �
s
r� rp Fc C s |d kr i }t | | ||d�S )N)r2 r> rs rw )r )r> r2 ri rw r) r) r* r
�
s
r
c @ s e Zd ZdZdS )rr zError in parsed documentN)r7 r8 r9 r� r) r) r) r* rr �
s rr )r T)r+ r T)rp NF)1Z
__future__r r r Zpip._vendor.sixr r r r0 � collectionsr � ImportErrorZpip._vendor.ordereddictr� r
r r Ztreebuilders.baser
r Z constantsr r r r r r r r r r r r r� r r r r r# r- r; rg r" ZmemoizerE r� r
� Exceptionrr r) r) r) r* �<module> sR H
) L
pip/_vendor/html5lib/__pycache__/serializer.cpython-36.opt-1.pyc 0000644 00000021775 14751155150 0020476 0 ustar 00 3
���ea7 � @ s� d dl mZmZmZ d dlmZ d dlZd dlmZm Z ddl
m Z m Z m
Z
ddl
mZmZmZ ddlmZmZ d d lmZ d
je
�d Zejd e d
�Zejd e d �Zi Ze d�dkZ x�e ej � �D ]p\Z Z!e r�e e!�dks�e r�e e!�dkr�q�e!dkr�e e!�dk�rej"e!�Z!ne#e!�Z!e!ek�s4e j$� r�e ee!< q�W dd� Z%ede%� d dd�Z&G dd� de'�Z(G dd� de)�Z*dS ) � )�absolute_import�division�unicode_literals)� text_typeN)�register_error�xmlcharrefreplace_errors� )� voidElements�booleanAttributes�spaceCharacters)�rcdataElements�entities� xmlEntities)� treewalkers�_utils)�escape� z"'=<>`�[�]u_
/` ᠏
]u � �&c
C s" t | ttf��rg }g }d}x�t| j| j| j� �D ]n\}}|rFd}q4|| j }tj| j|t | j|d g�� �r�tj
| j||d � �}d}nt |�}|j |� q4W x^|D ]V}t
j|�} | r�|j d� |j | � | jd�s�|j d� q�|j dt|�dd � � q�W dj|�| jfS t| �S d S )NFr Tr �;z&#x%s;r )�
isinstance�UnicodeEncodeError�UnicodeTranslateError� enumerate�object�start�endr ZisSurrogatePair�min�surrogatePairToCodepoint�ord�append�_encode_entity_map�get�endswith�hex�joinr )
�exc�resZ
codepoints�skip�i�c�indexZ codepointZcp�e� r/ � /usr/lib/python3.6/serializer.py�htmlentityreplace_errors* s0
"
r1 �htmlentityreplace�etreec K s$ t j|�}tf |�}|j|| �|�S )N)r Z
getTreeWalker�HTMLSerializer�render)�inputZtree�encodingZserializer_optsZwalker�sr/ r/ r0 � serializeJ s
r9 c @ s~ e Zd ZdZdZdZdZdZdZdZ dZ
dZ dZ dZ
dZdZdZd!Zdd� Zdd� Zdd� Zd"dd�Zd#d d �Zd$d d �ZdS )%r4 �legacy�"TF�quote_attr_values�
quote_char�use_best_quote_char�omit_optional_tags�minimize_boolean_attributes�use_trailing_solidus� space_before_trailing_solidus�escape_lt_in_attrs�
escape_rcdata�resolve_entities�alphabetical_attributes�inject_meta_charset�strip_whitespace�sanitizec K sz t |�t | j� }t|�dkr2tdtt|�� ��d|kr@d| _x(| jD ] }t| ||j|t | |��� qHW g | _
d| _ dS )a6 Initialize HTMLSerializer.
Keyword options (default given first unless specified) include:
inject_meta_charset=True|False
Whether it insert a meta element to define the character set of the
document.
quote_attr_values="legacy"|"spec"|"always"
Whether to quote attribute values that don't require quoting
per legacy browser behaviour, when required by the standard, or always.
quote_char=u'"'|u"'"
Use given quote character for attribute quoting. Default is to
use double quote unless attribute value contains a double quote,
in which case single quotes are used instead.
escape_lt_in_attrs=False|True
Whether to escape < in attribute values.
escape_rcdata=False|True
Whether to escape characters that need to be escaped within normal
elements within rcdata elements such as style.
resolve_entities=True|False
Whether to resolve named character entities that appear in the
source tree. The XML predefined entities < > & " '
are unaffected by this setting.
strip_whitespace=False|True
Whether to remove semantically meaningless whitespace. (This
compresses all whitespace to a single space except within pre.)
minimize_boolean_attributes=True|False
Shortens boolean attributes to give just the attribute value,
for example <input disabled="disabled"> becomes <input disabled>.
use_trailing_solidus=False|True
Includes a close-tag slash at the end of the start tag of void
elements (empty elements whose end tag is forbidden). E.g. <hr/>.
space_before_trailing_solidus=True|False
Places a space immediately before the closing slash in a tag
using a trailing solidus. E.g. <hr />. Requires use_trailing_solidus.
sanitize=False|True
Strip all unsafe or unknown constructs from output.
See `html5lib user documentation`_
omit_optional_tags=True|False
Omit start/end tags that are optional.
alphabetical_attributes=False|True
Reorder attributes to be in alphabetical order.
.. _html5lib user documentation: http://code.google.com/p/html5lib/wiki/UserDocumentation
r z2__init__() got an unexpected keyword argument '%s'r= FN) � frozenset�options�len� TypeError�next�iterr> �setattrr$ �getattr�errors�strict)�self�kwargsZunexpected_args�attrr/ r/ r0 �__init__p s . zHTMLSerializer.__init__c C s | j r|j| j d�S |S d S )Nr2 )r7 �encode)rT �stringr/ r/ r0 rX � s zHTMLSerializer.encodec C s | j r|j| j d�S |S d S )NrS )r7 rX )rT rY r/ r/ r0 � encodeStrict� s zHTMLSerializer.encodeStrictNc c s� || _ d}g | _|r0| jr0ddlm} |||�}| jrJddlm} ||�}| jrdddlm} ||�}| j r~ddl
m} ||�}| j r�ddl m} ||�}�xR|D �]H}|d }|dk�r`d|d }|d r�|d |d 7 }n|d
r�|d 7 }|d
�rJ|d
j
d �d
k�r0|d
j
d�d
k�r*| jd� d}nd }|d||d
|f 7 }|d7 }| j|�V q�|d5k�r�|dk�sz|�r�|�r�|d j
d�d
k�r�| jd� | j|d �V n| jt|d ��V q�|d6k�r�|d } | jd| �V | tk�r| j �rd}n|�r| jd� �x�|d j� D �]�\\}
} } | }
| }| jd �V | j|
�V | j �s�|
tj| t� �k�r"|
tjd t� �k�r"| jd �V | jd k�s�t|�d
k�r�d}n@| jd k�r�tj |�d k }n$| jd!k�r�t j |�d k }nt d"��|j d#d$�}| j �r|j d%d&�}|�r�| j!}| j"�rTd|k�r<d |k�r<d }nd |k�rTd|k�rTd}|dk�rl|j dd'�}n |j d d(�}| j|�V | j|�V | j|�V n | j|�V �q"W | t#k�r�| j$�r�| j%�r�| jd)�V n | jd*�V | jd�V q�|d+k�r6|d } | tk�rd}n|�r$| jd� | jd,| �V q�|d-k�rx|d }|j
d.�d
k�rb| jd/� | jd0|d �V q�|d1k�r�|d } | d2 }|t&k�r�| jd3| � | j'�r�|t(k�r�t&| }nd4| }| j|�V q�| j|d � q�W d S )7NFr )�Filter�typeZDoctypez <!DOCTYPE %s�nameZpublicIdz PUBLIC "%s"ZsystemIdz SYSTEMr; r �'zASystem identifer contains both single and double quote charactersz %s%s%s�>�
Characters�SpaceCharacters�dataz</zUnexpected </ in CDATA�StartTag�EmptyTagz<%sTz+Unexpected child element of a CDATA element� r �=�always�specr: z?quote_attr_values must be one of: 'always', 'spec', or 'legacy'r z&�<z<z'z"z /�/ZEndTagz</%s>�Commentz--zComment contains --z <!--%s-->ZEntityr zEntity %s not recognizedz&%s;)r` ra )rc rd ))r7 rR rG Zfilters.inject_meta_charsetr[ rF Z filters.alphabeticalattributesrH Zfilters.whitespacerI Zfilters.sanitizerr? Zfilters.optionaltags�find�serializeErrorrZ rX r r rD �itemsr@ r
r$ �tupler< rL �_quoteAttributeSpec�search�_quoteAttributeLegacy�
ValueError�replacerC r= r> r rA rB r
rE r )rT �
treewalkerr7 Zin_cdatar[ �tokenr\ Zdoctyper= r] �_Z attr_nameZ
attr_value�k�vZ
quote_attrrb �keyr/ r/ r0 r9 � s�
zHTMLSerializer.serializec C s2 |rdj t| j||���S dj t| j|���S d S )N� r )r' �listr9 )rT ru r7 r/ r/ r0 r5 ? s zHTMLSerializer.render�XXX ERROR MESSAGE NEEDEDc C s | j j|� | jrt�d S )N)rR r" rS �SerializeError)rT rb r/ r/ r0 rm E s z HTMLSerializer.serializeError)r< r= r> r? r@ rA rB rC rD rE rF rG rH rI )N)N)r} )�__name__�
__module__� __qualname__r< r= r> r? r@ rA rB rC rD rE rF rG rH rI rK rW rX rZ r9 r5 rm r/ r/ r/ r0 r4 Q s6 8
r4 c @ s e Zd ZdZdS )r~ zError in serialized treeN)r r� r� �__doc__r/ r/ r/ r0 r~ L s r~ )r3 N)+Z
__future__r r r Zpip._vendor.sixr �re�codecsr r Z constantsr r
r r r
r r r r Zxml.sax.saxutilsr r' Z_quoteAttributeSpecChars�compilerp rr r# rL Z_is_ucs4r| rn rx ry r r! �islowerr1 r9 r r4 � Exceptionr~ r/ r/ r/ r0 �<module> s:
| pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.opt-1.pyc 0000644 00000032626 14751155150 0020274 0 ustar 00 3
���eAA � @ s� d dl mZmZmZ d dlZd dlZddlmZ dZdZ dZ
dZ d Z d
j
ee g�Zd
j
ee d d d
e
e g�Zd
j
ed
g�Zejd�Zejd�Zdd� Zdd� Zedd�Zdd� Zdd� Zdd� Zd d � Zejd �Z ejd �Z ejd �Z G d!d"� d"e �Z dS )#� )�absolute_import�division�unicode_literalsN� )�DataLossWarninga^
[#x0041-#x005A] | [#x0061-#x007A] | [#x00C0-#x00D6] | [#x00D8-#x00F6] |
[#x00F8-#x00FF] | [#x0100-#x0131] | [#x0134-#x013E] | [#x0141-#x0148] |
[#x014A-#x017E] | [#x0180-#x01C3] | [#x01CD-#x01F0] | [#x01F4-#x01F5] |
[#x01FA-#x0217] | [#x0250-#x02A8] | [#x02BB-#x02C1] | #x0386 |
[#x0388-#x038A] | #x038C | [#x038E-#x03A1] | [#x03A3-#x03CE] |
[#x03D0-#x03D6] | #x03DA | #x03DC | #x03DE | #x03E0 | [#x03E2-#x03F3] |
[#x0401-#x040C] | [#x040E-#x044F] | [#x0451-#x045C] | [#x045E-#x0481] |
[#x0490-#x04C4] | [#x04C7-#x04C8] | [#x04CB-#x04CC] | [#x04D0-#x04EB] |
[#x04EE-#x04F5] | [#x04F8-#x04F9] | [#x0531-#x0556] | #x0559 |
[#x0561-#x0586] | [#x05D0-#x05EA] | [#x05F0-#x05F2] | [#x0621-#x063A] |
[#x0641-#x064A] | [#x0671-#x06B7] | [#x06BA-#x06BE] | [#x06C0-#x06CE] |
[#x06D0-#x06D3] | #x06D5 | [#x06E5-#x06E6] | [#x0905-#x0939] | #x093D |
[#x0958-#x0961] | [#x0985-#x098C] | [#x098F-#x0990] | [#x0993-#x09A8] |
[#x09AA-#x09B0] | #x09B2 | [#x09B6-#x09B9] | [#x09DC-#x09DD] |
[#x09DF-#x09E1] | [#x09F0-#x09F1] | [#x0A05-#x0A0A] | [#x0A0F-#x0A10] |
[#x0A13-#x0A28] | [#x0A2A-#x0A30] | [#x0A32-#x0A33] | [#x0A35-#x0A36] |
[#x0A38-#x0A39] | [#x0A59-#x0A5C] | #x0A5E | [#x0A72-#x0A74] |
[#x0A85-#x0A8B] | #x0A8D | [#x0A8F-#x0A91] | [#x0A93-#x0AA8] |
[#x0AAA-#x0AB0] | [#x0AB2-#x0AB3] | [#x0AB5-#x0AB9] | #x0ABD | #x0AE0 |
[#x0B05-#x0B0C] | [#x0B0F-#x0B10] | [#x0B13-#x0B28] | [#x0B2A-#x0B30] |
[#x0B32-#x0B33] | [#x0B36-#x0B39] | #x0B3D | [#x0B5C-#x0B5D] |
[#x0B5F-#x0B61] | [#x0B85-#x0B8A] | [#x0B8E-#x0B90] | [#x0B92-#x0B95] |
[#x0B99-#x0B9A] | #x0B9C | [#x0B9E-#x0B9F] | [#x0BA3-#x0BA4] |
[#x0BA8-#x0BAA] | [#x0BAE-#x0BB5] | [#x0BB7-#x0BB9] | [#x0C05-#x0C0C] |
[#x0C0E-#x0C10] | [#x0C12-#x0C28] | [#x0C2A-#x0C33] | [#x0C35-#x0C39] |
[#x0C60-#x0C61] | [#x0C85-#x0C8C] | [#x0C8E-#x0C90] | [#x0C92-#x0CA8] |
[#x0CAA-#x0CB3] | [#x0CB5-#x0CB9] | #x0CDE | [#x0CE0-#x0CE1] |
[#x0D05-#x0D0C] | [#x0D0E-#x0D10] | [#x0D12-#x0D28] | [#x0D2A-#x0D39] |
[#x0D60-#x0D61] | [#x0E01-#x0E2E] | #x0E30 | [#x0E32-#x0E33] |
[#x0E40-#x0E45] | [#x0E81-#x0E82] | #x0E84 | [#x0E87-#x0E88] | #x0E8A |
#x0E8D | [#x0E94-#x0E97] | [#x0E99-#x0E9F] | [#x0EA1-#x0EA3] | #x0EA5 |
#x0EA7 | [#x0EAA-#x0EAB] | [#x0EAD-#x0EAE] | #x0EB0 | [#x0EB2-#x0EB3] |
#x0EBD | [#x0EC0-#x0EC4] | [#x0F40-#x0F47] | [#x0F49-#x0F69] |
[#x10A0-#x10C5] | [#x10D0-#x10F6] | #x1100 | [#x1102-#x1103] |
[#x1105-#x1107] | #x1109 | [#x110B-#x110C] | [#x110E-#x1112] | #x113C |
#x113E | #x1140 | #x114C | #x114E | #x1150 | [#x1154-#x1155] | #x1159 |
[#x115F-#x1161] | #x1163 | #x1165 | #x1167 | #x1169 | [#x116D-#x116E] |
[#x1172-#x1173] | #x1175 | #x119E | #x11A8 | #x11AB | [#x11AE-#x11AF] |
[#x11B7-#x11B8] | #x11BA | [#x11BC-#x11C2] | #x11EB | #x11F0 | #x11F9 |
[#x1E00-#x1E9B] | [#x1EA0-#x1EF9] | [#x1F00-#x1F15] | [#x1F18-#x1F1D] |
[#x1F20-#x1F45] | [#x1F48-#x1F4D] | [#x1F50-#x1F57] | #x1F59 | #x1F5B |
#x1F5D | [#x1F5F-#x1F7D] | [#x1F80-#x1FB4] | [#x1FB6-#x1FBC] | #x1FBE |
[#x1FC2-#x1FC4] | [#x1FC6-#x1FCC] | [#x1FD0-#x1FD3] | [#x1FD6-#x1FDB] |
[#x1FE0-#x1FEC] | [#x1FF2-#x1FF4] | [#x1FF6-#x1FFC] | #x2126 |
[#x212A-#x212B] | #x212E | [#x2180-#x2182] | [#x3041-#x3094] |
[#x30A1-#x30FA] | [#x3105-#x312C] | [#xAC00-#xD7A3]z*[#x4E00-#x9FA5] | #x3007 | [#x3021-#x3029]a�
[#x0300-#x0345] | [#x0360-#x0361] | [#x0483-#x0486] | [#x0591-#x05A1] |
[#x05A3-#x05B9] | [#x05BB-#x05BD] | #x05BF | [#x05C1-#x05C2] | #x05C4 |
[#x064B-#x0652] | #x0670 | [#x06D6-#x06DC] | [#x06DD-#x06DF] |
[#x06E0-#x06E4] | [#x06E7-#x06E8] | [#x06EA-#x06ED] | [#x0901-#x0903] |
#x093C | [#x093E-#x094C] | #x094D | [#x0951-#x0954] | [#x0962-#x0963] |
[#x0981-#x0983] | #x09BC | #x09BE | #x09BF | [#x09C0-#x09C4] |
[#x09C7-#x09C8] | [#x09CB-#x09CD] | #x09D7 | [#x09E2-#x09E3] | #x0A02 |
#x0A3C | #x0A3E | #x0A3F | [#x0A40-#x0A42] | [#x0A47-#x0A48] |
[#x0A4B-#x0A4D] | [#x0A70-#x0A71] | [#x0A81-#x0A83] | #x0ABC |
[#x0ABE-#x0AC5] | [#x0AC7-#x0AC9] | [#x0ACB-#x0ACD] | [#x0B01-#x0B03] |
#x0B3C | [#x0B3E-#x0B43] | [#x0B47-#x0B48] | [#x0B4B-#x0B4D] |
[#x0B56-#x0B57] | [#x0B82-#x0B83] | [#x0BBE-#x0BC2] | [#x0BC6-#x0BC8] |
[#x0BCA-#x0BCD] | #x0BD7 | [#x0C01-#x0C03] | [#x0C3E-#x0C44] |
[#x0C46-#x0C48] | [#x0C4A-#x0C4D] | [#x0C55-#x0C56] | [#x0C82-#x0C83] |
[#x0CBE-#x0CC4] | [#x0CC6-#x0CC8] | [#x0CCA-#x0CCD] | [#x0CD5-#x0CD6] |
[#x0D02-#x0D03] | [#x0D3E-#x0D43] | [#x0D46-#x0D48] | [#x0D4A-#x0D4D] |
#x0D57 | #x0E31 | [#x0E34-#x0E3A] | [#x0E47-#x0E4E] | #x0EB1 |
[#x0EB4-#x0EB9] | [#x0EBB-#x0EBC] | [#x0EC8-#x0ECD] | [#x0F18-#x0F19] |
#x0F35 | #x0F37 | #x0F39 | #x0F3E | #x0F3F | [#x0F71-#x0F84] |
[#x0F86-#x0F8B] | [#x0F90-#x0F95] | #x0F97 | [#x0F99-#x0FAD] |
[#x0FB1-#x0FB7] | #x0FB9 | [#x20D0-#x20DC] | #x20E1 | [#x302A-#x302F] |
#x3099 | #x309Aa
[#x0030-#x0039] | [#x0660-#x0669] | [#x06F0-#x06F9] | [#x0966-#x096F] |
[#x09E6-#x09EF] | [#x0A66-#x0A6F] | [#x0AE6-#x0AEF] | [#x0B66-#x0B6F] |
[#x0BE7-#x0BEF] | [#x0C66-#x0C6F] | [#x0CE6-#x0CEF] | [#x0D66-#x0D6F] |
[#x0E50-#x0E59] | [#x0ED0-#x0ED9] | [#x0F20-#x0F29]z}
#x00B7 | #x02D0 | #x02D1 | #x0387 | #x0640 | #x0E46 | #x0EC6 | #x3005 |
#[#x3031-#x3035] | [#x309D-#x309E] | [#x30FC-#x30FE]z | �.�-�_z#x([\d|A-F]{4,4})z'\[#x([\d|A-F]{4,4})-#x([\d|A-F]{4,4})\]c C s� dd� | j d�D �}g }x�|D ]�}d}x`ttfD ]T}|j|�}|d k r0|jdd� |j� D �� t|d �dkr~|d
d |d < d}P q0W |s |jt|�gd � q W t|�}|S ) Nc S s g | ] }|j � �qS � )�strip)�.0�itemr
r
� /usr/lib/python3.6/_ihatexml.py�
<listcomp>h s z$charStringToList.<locals>.<listcomp>z | Fc S s g | ] }t |��qS r
)�hexToInt)r r
r
r
r r o s r � T���r r ) �split�reChar� reCharRange�match�append�groups�len�ord�normaliseCharList)�charsZ
charRanges�rvr
Z
foundMatchZregexpr r
r
r �charStringToListg s
r c C s� t | �} x | D ]}qW g }d}x�|t| �k r�d}|j| | � xT|| t| �k r�| || d |d d d kr�| || d |d d< |d7 }q@W ||7 }q W |S )Nr r r r )�sortedr r )�charListr
r �i�jr
r
r r | s
2 r ZFFFF� c C s� g }| d dkr*|j d| d d d g� xBt| d d� �D ].\}}|j |d d | |d d d g� q<W | d d tkr�|j | d d d tg� |S )Nr r r r r )r � enumerate� max_unicode)r r r! r
r
r
r �
missingRanges� s *r& c C sr g }x^| D ]V}|d |d kr6|j tt|d ��� q
|j tt|d ��d tt|d �� � q
W ddj|� S )Nr r r z[%s]� )r � escapeRegexp�chr�join)r r r
r
r
r �listToRegexpStr� s
r+ c C s
t | d�S )Nr# )�int)Zhex_strr
r
r r � s r c C s& d}x |D ]}| j |d| �} q
W | S )Nr �^�$�*�+�?�{�}�[�]�|�(�)r �\)r r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r )�replace)�stringZspecialCharacters�charr
r
r r( � s
r( u� [ -,/:-@\[-\^`\{-¶¸-¿×÷IJ-ijĿ-ŀʼnſDŽ-njDZ-dzǶ-ǹȘ-ɏʩ-ʺ˂-ˏ˒-˿͆-͟͢-΅Ϗϗ-ϙϛϝϟϡϴ-ЀЍѐѝ҂҇-ҏӅ-ӆӉ-ӊӍ-ӏӬ-ӭӶ-ӷӺ--՚-ՠև-ֺ֢־׀׃ׅ--ׯ׳-ؠػ-ؿٓ-ٟ٪-ٯڸ-ڹڿۏ۔۩ۮ-ۯۺ-ऀऄऺ-ऻॎ-ॐॕ-ॗ।-॥॰-ঀ----ঽ--ৎ---৲-ਁਃ--------ੵ-ઌ--ૡ-૰----ଵ-ୄ---୕-ୢ-୰------ஶ----௦௰-ఀఄఴ-ఽ--ౢ--ಁ಄-ಽ--ೝೢ--ഁഄഩഺ-ഽൄ-ൎ-ൖ൘-ൟൢ-൰-ฯ-฿๏๚--ຆຉ-ຌຎ-ຓຘຠຨ-ຩຬຯ຺-໎--༗༚-༟༪-༴༶༸༺-༽ཪ-྅ྌ-ྏྖྮ-ྰྸྺ-႟-ჷ-ჿᄁᄄᄈᄊᄍᄓ-ᄻᄽᄿᅁ-ᅋᅍᅏᅑ-ᅓᅖ-ᅘᅚ-ᅞᅢᅤᅦᅨᅪ-ᅬᅯ-ᅱᅴᅶ-ᆝᆟ-ᆧᆩ-ᆪᆬ-ᆭᆰ-ᆶᆹᆻᇃ-ᇪᇬ-ᇯᇱ-ᇸᇺ-᷿ẜ-ẟỺ-ỿ-----᾽᾿-῁῍-῏--῟῭-´-⃝-⃠⃢-℥℧-℩ℬ-ℭℯ-ⅿↃ-〄〆〈-〠〰〶-ゕ-゛-゜ゟ-゠・ヿ-ㄭ-䷿龦--]u� [ -@\[-\^`\{-¿×÷IJ-ijĿ-ŀʼnſDŽ-njDZ-dzǶ-ǹȘ-ɏʩ-ʺ˂-΅·Ϗϗ-ϙϛϝϟϡϴ-ЀЍѐѝ҂-ҏӅ-ӆӉ-ӊӍ-ӏӬ-ӭӶ-ӷӺ--՚-ՠև--ׯ׳-ؠػ-ـً-ٰڸ-ڹڿۏ۔ۖ-ۤۧ-ऄऺ-़ा-ॗॢ-----ৢ-৯৲-----ੱੵ-ઌ-઼ા-ૡ----ଵ-଼ା-ୢ------ஶ-ఄఴ-ౢ-಄-ೝೢ-ഄഩഺ-ൟൢ-ฯัิ-฿ๆ--ຆຉ-ຌຎ-ຓຘຠຨ-ຩຬຯັິ-ຼ--༿ཪ-႟-ჷ-ჿᄁᄄᄈᄊᄍᄓ-ᄻᄽᄿᅁ-ᅋᅍᅏᅑ-ᅓᅖ-ᅘᅚ-ᅞᅢᅤᅦᅨᅪ-ᅬᅯ-ᅱᅴᅶ-ᆝᆟ-ᆧᆩ-ᆪᆬ-ᆭᆰ-ᆶᆹᆻᇃ-ᇪᇬ-ᇯᇱ-ᇸᇺ-᷿ẜ-ẟỺ-ỿ-----᾽᾿-῁῍-῏--῟῭-´-℥℧-℩ℬ-ℭℯ-ⅿↃ-〆〈-〠〪-ゕ-゠・-ㄭ-䷿龦--]z#[^
a-zA-Z0-9\-'()+,./:=?;!*#@$_%]c @ sr e Zd Zejd�Zddd�Zd dd�Zd d
� Zd d � Z d
d� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd� ZdS ) �
InfosetFilterz
U[\dA-F]{5,5}FTc C s. || _ || _|| _|| _|| _|| _i | _d S )N)�dropXmlnsLocalName�dropXmlnsAttrNs�preventDoubleDashComments�preventDashAtCommentEnd�replaceFormFeedCharacters�preventSingleQuotePubid� replaceCache)�selfr> r? r@ rA rB rC r
r
r �__init__� s zInfosetFilter.__init__Nc C sL | j r |jd�r tjdt� d S | jr>|dkr>tjdt� d S | j|�S d S )Nzxmlns:z"Attributes cannot begin with xmlnsz http://www.w3.org/2000/xmlns/z)Attributes cannot be in the xml namespace)r> �
startswith�warnings�warnr r? � toXmlName)rE �name� namespacer
r
r �coerceAttribute� s z InfosetFilter.coerceAttributec C s
| j |�S )N)rJ )rE rK r
r
r �
coerceElement� s zInfosetFilter.coerceElementc C sN | j rJx$d|kr*tjdt� |jdd�}qW |jd�rJtjdt� |d7 }|S )Nz--z'Comments cannot contain adjacent dashesz- -r z Comments cannot end in a dash� )r@ rH rI r r: �endswith)rE �datar
r
r �
coerceComment� s
zInfosetFilter.coerceCommentc C s: | j r6x"t|jd��D ]}tjdt� qW |jdd�}|S )N� zText cannot contain U+000CrO )rB �range�countrH rI r r: )rE rQ r r
r
r �coerceCharacters� s
z InfosetFilter.coerceCharactersc C sp |}x4t j|�D ]&}tjdt� | j|�}|j||�}qW | jrl|jd�dkrltjdt� |jd| jd��}|S )NzCoercing non-XML pubid�'r z!Pubid cannot contain single quote) �nonPubidCharRegexp�findallrH rI r �getReplacementCharacterr: rC �find)rE rQ Z
dataOutputr< � replacementr
r
r � coercePubid� s
zInfosetFilter.coercePubidc
C s� |d }|dd � }t j|�}|r:tjdt� | j|�}n|}|}ttj|��}x.|D ]&}tjdt� | j|�} |j || �}qVW || S )Nr r zCoercing non-XML name)
�nonXmlNameFirstBMPRegexpr rH rI r rZ �set�nonXmlNameBMPRegexprY r: )
rE rK � nameFirstZnameRest�mZnameFirstOutputZnameRestOutputZ replaceCharsr< r\ r
r
r rJ � s
zInfosetFilter.toXmlNamec C s$ || j kr| j | }n
| j|�}|S )N)rD �
escapeChar)rE r< r\ r
r
r rZ s
z%InfosetFilter.getReplacementCharacterc C s0 x*t | jj|��D ]}|j|| j|��}qW |S )N)r_ �replacementRegexprY r: � unescapeChar)rE rK r
r
r
r � fromXmlName s zInfosetFilter.fromXmlNamec C s dt |� }|| j|< |S )NzU%05X)r rD )rE r< r\ r
r
r rc s
zInfosetFilter.escapeCharc C s t t|dd � d��S )Nr r# )r) r, )rE Zcharcoder
r
r re s zInfosetFilter.unescapeChar)FFFFTF)N)�__name__�
__module__� __qualname__�re�compilerd rF rM rN rR rV r] rJ rZ rf rc re r
r
r
r r= � s"
r= )!Z
__future__r r r rj rH Z constantsr ZbaseCharZ ideographicZcombiningCharacterZdigitZextenderr* ZletterrK ra rk r r r r r, r% r& r+ r r( r` r^ rX �objectr= r
r
r
r �<module> s2 0
pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.pyc 0000644 00000032721 14751155150 0017331 0 ustar 00 3
���eAA � @ s� d dl mZmZmZ d dlZd dlZddlmZ dZdZ dZ
dZ d Z d
j
ee g�Zd
j
ee d d d
e
e g�Zd
j
ed
g�Zejd�Zejd�Zdd� Zdd� Zedd�Zdd� Zdd� Zdd� Zd d � Zejd �Z ejd �Z ejd �Z G d!d"� d"e �Z dS )#� )�absolute_import�division�unicode_literalsN� )�DataLossWarninga^
[#x0041-#x005A] | [#x0061-#x007A] | [#x00C0-#x00D6] | [#x00D8-#x00F6] |
[#x00F8-#x00FF] | [#x0100-#x0131] | [#x0134-#x013E] | [#x0141-#x0148] |
[#x014A-#x017E] | [#x0180-#x01C3] | [#x01CD-#x01F0] | [#x01F4-#x01F5] |
[#x01FA-#x0217] | [#x0250-#x02A8] | [#x02BB-#x02C1] | #x0386 |
[#x0388-#x038A] | #x038C | [#x038E-#x03A1] | [#x03A3-#x03CE] |
[#x03D0-#x03D6] | #x03DA | #x03DC | #x03DE | #x03E0 | [#x03E2-#x03F3] |
[#x0401-#x040C] | [#x040E-#x044F] | [#x0451-#x045C] | [#x045E-#x0481] |
[#x0490-#x04C4] | [#x04C7-#x04C8] | [#x04CB-#x04CC] | [#x04D0-#x04EB] |
[#x04EE-#x04F5] | [#x04F8-#x04F9] | [#x0531-#x0556] | #x0559 |
[#x0561-#x0586] | [#x05D0-#x05EA] | [#x05F0-#x05F2] | [#x0621-#x063A] |
[#x0641-#x064A] | [#x0671-#x06B7] | [#x06BA-#x06BE] | [#x06C0-#x06CE] |
[#x06D0-#x06D3] | #x06D5 | [#x06E5-#x06E6] | [#x0905-#x0939] | #x093D |
[#x0958-#x0961] | [#x0985-#x098C] | [#x098F-#x0990] | [#x0993-#x09A8] |
[#x09AA-#x09B0] | #x09B2 | [#x09B6-#x09B9] | [#x09DC-#x09DD] |
[#x09DF-#x09E1] | [#x09F0-#x09F1] | [#x0A05-#x0A0A] | [#x0A0F-#x0A10] |
[#x0A13-#x0A28] | [#x0A2A-#x0A30] | [#x0A32-#x0A33] | [#x0A35-#x0A36] |
[#x0A38-#x0A39] | [#x0A59-#x0A5C] | #x0A5E | [#x0A72-#x0A74] |
[#x0A85-#x0A8B] | #x0A8D | [#x0A8F-#x0A91] | [#x0A93-#x0AA8] |
[#x0AAA-#x0AB0] | [#x0AB2-#x0AB3] | [#x0AB5-#x0AB9] | #x0ABD | #x0AE0 |
[#x0B05-#x0B0C] | [#x0B0F-#x0B10] | [#x0B13-#x0B28] | [#x0B2A-#x0B30] |
[#x0B32-#x0B33] | [#x0B36-#x0B39] | #x0B3D | [#x0B5C-#x0B5D] |
[#x0B5F-#x0B61] | [#x0B85-#x0B8A] | [#x0B8E-#x0B90] | [#x0B92-#x0B95] |
[#x0B99-#x0B9A] | #x0B9C | [#x0B9E-#x0B9F] | [#x0BA3-#x0BA4] |
[#x0BA8-#x0BAA] | [#x0BAE-#x0BB5] | [#x0BB7-#x0BB9] | [#x0C05-#x0C0C] |
[#x0C0E-#x0C10] | [#x0C12-#x0C28] | [#x0C2A-#x0C33] | [#x0C35-#x0C39] |
[#x0C60-#x0C61] | [#x0C85-#x0C8C] | [#x0C8E-#x0C90] | [#x0C92-#x0CA8] |
[#x0CAA-#x0CB3] | [#x0CB5-#x0CB9] | #x0CDE | [#x0CE0-#x0CE1] |
[#x0D05-#x0D0C] | [#x0D0E-#x0D10] | [#x0D12-#x0D28] | [#x0D2A-#x0D39] |
[#x0D60-#x0D61] | [#x0E01-#x0E2E] | #x0E30 | [#x0E32-#x0E33] |
[#x0E40-#x0E45] | [#x0E81-#x0E82] | #x0E84 | [#x0E87-#x0E88] | #x0E8A |
#x0E8D | [#x0E94-#x0E97] | [#x0E99-#x0E9F] | [#x0EA1-#x0EA3] | #x0EA5 |
#x0EA7 | [#x0EAA-#x0EAB] | [#x0EAD-#x0EAE] | #x0EB0 | [#x0EB2-#x0EB3] |
#x0EBD | [#x0EC0-#x0EC4] | [#x0F40-#x0F47] | [#x0F49-#x0F69] |
[#x10A0-#x10C5] | [#x10D0-#x10F6] | #x1100 | [#x1102-#x1103] |
[#x1105-#x1107] | #x1109 | [#x110B-#x110C] | [#x110E-#x1112] | #x113C |
#x113E | #x1140 | #x114C | #x114E | #x1150 | [#x1154-#x1155] | #x1159 |
[#x115F-#x1161] | #x1163 | #x1165 | #x1167 | #x1169 | [#x116D-#x116E] |
[#x1172-#x1173] | #x1175 | #x119E | #x11A8 | #x11AB | [#x11AE-#x11AF] |
[#x11B7-#x11B8] | #x11BA | [#x11BC-#x11C2] | #x11EB | #x11F0 | #x11F9 |
[#x1E00-#x1E9B] | [#x1EA0-#x1EF9] | [#x1F00-#x1F15] | [#x1F18-#x1F1D] |
[#x1F20-#x1F45] | [#x1F48-#x1F4D] | [#x1F50-#x1F57] | #x1F59 | #x1F5B |
#x1F5D | [#x1F5F-#x1F7D] | [#x1F80-#x1FB4] | [#x1FB6-#x1FBC] | #x1FBE |
[#x1FC2-#x1FC4] | [#x1FC6-#x1FCC] | [#x1FD0-#x1FD3] | [#x1FD6-#x1FDB] |
[#x1FE0-#x1FEC] | [#x1FF2-#x1FF4] | [#x1FF6-#x1FFC] | #x2126 |
[#x212A-#x212B] | #x212E | [#x2180-#x2182] | [#x3041-#x3094] |
[#x30A1-#x30FA] | [#x3105-#x312C] | [#xAC00-#xD7A3]z*[#x4E00-#x9FA5] | #x3007 | [#x3021-#x3029]a�
[#x0300-#x0345] | [#x0360-#x0361] | [#x0483-#x0486] | [#x0591-#x05A1] |
[#x05A3-#x05B9] | [#x05BB-#x05BD] | #x05BF | [#x05C1-#x05C2] | #x05C4 |
[#x064B-#x0652] | #x0670 | [#x06D6-#x06DC] | [#x06DD-#x06DF] |
[#x06E0-#x06E4] | [#x06E7-#x06E8] | [#x06EA-#x06ED] | [#x0901-#x0903] |
#x093C | [#x093E-#x094C] | #x094D | [#x0951-#x0954] | [#x0962-#x0963] |
[#x0981-#x0983] | #x09BC | #x09BE | #x09BF | [#x09C0-#x09C4] |
[#x09C7-#x09C8] | [#x09CB-#x09CD] | #x09D7 | [#x09E2-#x09E3] | #x0A02 |
#x0A3C | #x0A3E | #x0A3F | [#x0A40-#x0A42] | [#x0A47-#x0A48] |
[#x0A4B-#x0A4D] | [#x0A70-#x0A71] | [#x0A81-#x0A83] | #x0ABC |
[#x0ABE-#x0AC5] | [#x0AC7-#x0AC9] | [#x0ACB-#x0ACD] | [#x0B01-#x0B03] |
#x0B3C | [#x0B3E-#x0B43] | [#x0B47-#x0B48] | [#x0B4B-#x0B4D] |
[#x0B56-#x0B57] | [#x0B82-#x0B83] | [#x0BBE-#x0BC2] | [#x0BC6-#x0BC8] |
[#x0BCA-#x0BCD] | #x0BD7 | [#x0C01-#x0C03] | [#x0C3E-#x0C44] |
[#x0C46-#x0C48] | [#x0C4A-#x0C4D] | [#x0C55-#x0C56] | [#x0C82-#x0C83] |
[#x0CBE-#x0CC4] | [#x0CC6-#x0CC8] | [#x0CCA-#x0CCD] | [#x0CD5-#x0CD6] |
[#x0D02-#x0D03] | [#x0D3E-#x0D43] | [#x0D46-#x0D48] | [#x0D4A-#x0D4D] |
#x0D57 | #x0E31 | [#x0E34-#x0E3A] | [#x0E47-#x0E4E] | #x0EB1 |
[#x0EB4-#x0EB9] | [#x0EBB-#x0EBC] | [#x0EC8-#x0ECD] | [#x0F18-#x0F19] |
#x0F35 | #x0F37 | #x0F39 | #x0F3E | #x0F3F | [#x0F71-#x0F84] |
[#x0F86-#x0F8B] | [#x0F90-#x0F95] | #x0F97 | [#x0F99-#x0FAD] |
[#x0FB1-#x0FB7] | #x0FB9 | [#x20D0-#x20DC] | #x20E1 | [#x302A-#x302F] |
#x3099 | #x309Aa
[#x0030-#x0039] | [#x0660-#x0669] | [#x06F0-#x06F9] | [#x0966-#x096F] |
[#x09E6-#x09EF] | [#x0A66-#x0A6F] | [#x0AE6-#x0AEF] | [#x0B66-#x0B6F] |
[#x0BE7-#x0BEF] | [#x0C66-#x0C6F] | [#x0CE6-#x0CEF] | [#x0D66-#x0D6F] |
[#x0E50-#x0E59] | [#x0ED0-#x0ED9] | [#x0F20-#x0F29]z}
#x00B7 | #x02D0 | #x02D1 | #x0387 | #x0640 | #x0E46 | #x0EC6 | #x3005 |
#[#x3031-#x3035] | [#x309D-#x309E] | [#x30FC-#x30FE]z | �.�-�_z#x([\d|A-F]{4,4})z'\[#x([\d|A-F]{4,4})-#x([\d|A-F]{4,4})\]c C s� dd� | j d�D �}g }x�|D ]�}d}x`ttfD ]T}|j|�}|d k r0|jdd� |j� D �� t|d �dkr~|d
d |d < d}P q0W |s t|�dks�t�|jt|�gd � q W t |�}|S ) Nc S s g | ] }|j � �qS � )�strip)�.0�itemr
r
� /usr/lib/python3.6/_ihatexml.py�
<listcomp>h s z$charStringToList.<locals>.<listcomp>z | Fc S s g | ] }t |��qS r
)�hexToInt)r r
r
r
r r o s r � T���r r )
�split�reChar� reCharRange�match�append�groups�len�AssertionError�ord�normaliseCharList)�charsZ
charRanges�rvr
Z
foundMatchZregexpr r
r
r �charStringToListg s"
r c C s� t | �} x | D ]}|d |d kst�qW g }d}x�|t| �k r�d}|j| | � xT|| t| �k r�| || d |d d d kr�| || d |d d< |d7 }qTW ||7 }q4W |S )Nr r r r )�sortedr r r )�charListr
r �i�jr
r
r r | s
2 r ZFFFF� c C s� g }| d dkr*|j d| d d d g� xBt| d d� �D ].\}}|j |d d | |d d d g� q<W | d d tkr�|j | d d d tg� |S )Nr r r r r )r � enumerate� max_unicode)r! r r" r
r
r
r �
missingRanges� s *r' c C sr g }x^| D ]V}|d |d kr6|j tt|d ��� q
|j tt|d ��d tt|d �� � q
W ddj|� S )Nr r r z[%s]� )r � escapeRegexp�chr�join)r! r r
r
r
r �listToRegexpStr� s
r, c C s
t | d�S )Nr$ )�int)Zhex_strr
r
r r � s r c C s& d}x |D ]}| j |d| �} q
W | S )Nr �^�$�*�+�?�{�}�[�]�|�(�)r �\)r r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r )�replace)�stringZspecialCharacters�charr
r
r r) � s
r) u� [ -,/:-@\[-\^`\{-¶¸-¿×÷IJ-ijĿ-ŀʼnſDŽ-njDZ-dzǶ-ǹȘ-ɏʩ-ʺ˂-ˏ˒-˿͆-͟͢-΅Ϗϗ-ϙϛϝϟϡϴ-ЀЍѐѝ҂҇-ҏӅ-ӆӉ-ӊӍ-ӏӬ-ӭӶ-ӷӺ--՚-ՠև-ֺ֢־׀׃ׅ--ׯ׳-ؠػ-ؿٓ-ٟ٪-ٯڸ-ڹڿۏ۔۩ۮ-ۯۺ-ऀऄऺ-ऻॎ-ॐॕ-ॗ।-॥॰-ঀ----ঽ--ৎ---৲-ਁਃ--------ੵ-ઌ--ૡ-૰----ଵ-ୄ---୕-ୢ-୰------ஶ----௦௰-ఀఄఴ-ఽ--ౢ--ಁ಄-ಽ--ೝೢ--ഁഄഩഺ-ഽൄ-ൎ-ൖ൘-ൟൢ-൰-ฯ-฿๏๚--ຆຉ-ຌຎ-ຓຘຠຨ-ຩຬຯ຺-໎--༗༚-༟༪-༴༶༸༺-༽ཪ-྅ྌ-ྏྖྮ-ྰྸྺ-႟-ჷ-ჿᄁᄄᄈᄊᄍᄓ-ᄻᄽᄿᅁ-ᅋᅍᅏᅑ-ᅓᅖ-ᅘᅚ-ᅞᅢᅤᅦᅨᅪ-ᅬᅯ-ᅱᅴᅶ-ᆝᆟ-ᆧᆩ-ᆪᆬ-ᆭᆰ-ᆶᆹᆻᇃ-ᇪᇬ-ᇯᇱ-ᇸᇺ-᷿ẜ-ẟỺ-ỿ-----᾽᾿-῁῍-῏--῟῭-´-⃝-⃠⃢-℥℧-℩ℬ-ℭℯ-ⅿↃ-〄〆〈-〠〰〶-ゕ-゛-゜ゟ-゠・ヿ-ㄭ-䷿龦--]u� [ -@\[-\^`\{-¿×÷IJ-ijĿ-ŀʼnſDŽ-njDZ-dzǶ-ǹȘ-ɏʩ-ʺ˂-΅·Ϗϗ-ϙϛϝϟϡϴ-ЀЍѐѝ҂-ҏӅ-ӆӉ-ӊӍ-ӏӬ-ӭӶ-ӷӺ--՚-ՠև--ׯ׳-ؠػ-ـً-ٰڸ-ڹڿۏ۔ۖ-ۤۧ-ऄऺ-़ा-ॗॢ-----ৢ-৯৲-----ੱੵ-ઌ-઼ા-ૡ----ଵ-଼ା-ୢ------ஶ-ఄఴ-ౢ-಄-ೝೢ-ഄഩഺ-ൟൢ-ฯัิ-฿ๆ--ຆຉ-ຌຎ-ຓຘຠຨ-ຩຬຯັິ-ຼ--༿ཪ-႟-ჷ-ჿᄁᄄᄈᄊᄍᄓ-ᄻᄽᄿᅁ-ᅋᅍᅏᅑ-ᅓᅖ-ᅘᅚ-ᅞᅢᅤᅦᅨᅪ-ᅬᅯ-ᅱᅴᅶ-ᆝᆟ-ᆧᆩ-ᆪᆬ-ᆭᆰ-ᆶᆹᆻᇃ-ᇪᇬ-ᇯᇱ-ᇸᇺ-᷿ẜ-ẟỺ-ỿ-----᾽᾿-῁῍-῏--῟῭-´-℥℧-℩ℬ-ℭℯ-ⅿↃ-〆〈-〠〪-ゕ-゠・-ㄭ-䷿龦--]z#[^
a-zA-Z0-9\-'()+,./:=?;!*#@$_%]c @ sr e Zd Zejd�Zddd�Zd dd�Zd d
� Zd d � Z d
d� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd� ZdS ) �
InfosetFilterz
U[\dA-F]{5,5}FTc C s. || _ || _|| _|| _|| _|| _i | _d S )N)�dropXmlnsLocalName�dropXmlnsAttrNs�preventDoubleDashComments�preventDashAtCommentEnd�replaceFormFeedCharacters�preventSingleQuotePubid� replaceCache)�selfr? r@ rA rB rC rD r
r
r �__init__� s zInfosetFilter.__init__Nc C sL | j r |jd�r tjdt� d S | jr>|dkr>tjdt� d S | j|�S d S )Nzxmlns:z"Attributes cannot begin with xmlnsz http://www.w3.org/2000/xmlns/z)Attributes cannot be in the xml namespace)r? �
startswith�warnings�warnr r@ � toXmlName)rF �name� namespacer
r
r �coerceAttribute� s z InfosetFilter.coerceAttributec C s
| j |�S )N)rK )rF rL r
r
r �
coerceElement� s zInfosetFilter.coerceElementc C sN | j rJx$d|kr*tjdt� |jdd�}qW |jd�rJtjdt� |d7 }|S )Nz--z'Comments cannot contain adjacent dashesz- -r z Comments cannot end in a dash� )rA rI rJ r r; �endswith)rF �datar
r
r �
coerceComment� s
zInfosetFilter.coerceCommentc C s: | j r6x"t|jd��D ]}tjdt� qW |jdd�}|S )N� zText cannot contain U+000CrP )rC �range�countrI rJ r r; )rF rR r r
r
r �coerceCharacters� s
z InfosetFilter.coerceCharactersc C sp |}x4t j|�D ]&}tjdt� | j|�}|j||�}qW | jrl|jd�dkrltjdt� |jd| jd��}|S )NzCoercing non-XML pubid�'r z!Pubid cannot contain single quote) �nonPubidCharRegexp�findallrI rJ r �getReplacementCharacterr; rD �find)rF rR Z
dataOutputr= � replacementr
r
r � coercePubid� s
zInfosetFilter.coercePubidc
C s� |d }|dd � }t j|�}|r:tjdt� | j|�}n|}|}ttj|��}x.|D ]&}tjdt� | j|�} |j || �}qVW || S )Nr r zCoercing non-XML name)
�nonXmlNameFirstBMPRegexpr rI rJ r r[ �set�nonXmlNameBMPRegexprZ r; )
rF rL � nameFirstZnameRest�mZnameFirstOutputZnameRestOutputZ replaceCharsr= r] r
r
r rK � s
zInfosetFilter.toXmlNamec C s$ || j kr| j | }n
| j|�}|S )N)rE �
escapeChar)rF r= r] r
r
r r[ s
z%InfosetFilter.getReplacementCharacterc C s0 x*t | jj|��D ]}|j|| j|��}qW |S )N)r` �replacementRegexprZ r; � unescapeChar)rF rL r
r
r
r � fromXmlName s zInfosetFilter.fromXmlNamec C s dt |� }|| j|< |S )NzU%05X)r rE )rF r= r] r
r
r rd s
zInfosetFilter.escapeCharc C s t t|dd � d��S )Nr r$ )r* r- )rF Zcharcoder
r
r rf s zInfosetFilter.unescapeChar)FFFFTF)N)�__name__�
__module__� __qualname__�re�compilere rG rN rO rS rW r^ rK r[ rg rd rf r
r
r
r r> � s"
r> )!Z
__future__r r r rk rI Z constantsr ZbaseCharZ ideographicZcombiningCharacterZdigitZextenderr+ ZletterrL rb rl r r r r r- r& r' r, r r) ra r_ rY �objectr> r
r
r
r �<module> s2 0
pip/_vendor/html5lib/__pycache__/_utils.cpython-36.pyc 0000644 00000006332 14751155150 0016655 0 ustar 00 3
���e � @ s
d dl mZmZmZ d dlZd dlmZ d dlmZ yd dl j
j Z W n e
k
rd d dlj
jZ Y nX ddddd d
d gZejd d ko�ejd
dkZy,ed�Zeee�s�ed�Zeee�s�t�W n dZY nX dZG dd� de�Zdd� Zdd� Zdd � Z dd� Z dS )� )�absolute_import�division�unicode_literalsN)�
ModuleType)� text_type�
default_etree�MethodDispatcher�isSurrogatePair�surrogatePairToCodepoint�moduleFactoryFactory�supports_lone_surrogates�PY27� � � z"\uD800"z u"\uD800"FTc @ s$ e Zd ZdZf fdd�Zdd� ZdS )r ap Dict with 2 special properties:
On initiation, keys that are lists, sets or tuples are converted to
multiple keys so accessing any one of the items in the original
list-like object returns the matching value
md = MethodDispatcher({("foo", "bar"):"baz"})
md["foo"] == "baz"
A default value which can be set through the default attribute.
c C s~ g }xN|D ]F\}}t |ttttf�rBx*|D ]}|j||f� q*W q
|j||f� q
W tj| |� t| �t|�kstt �d | _
d S )N) �
isinstance�list�tuple� frozenset�set�append�dict�__init__�len�AssertionError�default)�self�itemsZ _dictEntries�name�value�item� r! � /usr/lib/python3.6/_utils.pyr 4 s
zMethodDispatcher.__init__c C s t j| || j�S )N)r �getr )r �keyr! r! r" � __getitem__C s z MethodDispatcher.__getitem__N)�__name__�
__module__� __qualname__�__doc__r r% r! r! r! r" r ' s c C sL t | �dkoJt| d �dkoJt| d �dkoJt| d �dkoJt| d �dkS )Nr r i � i�� r i � i�� )r �ord)�datar! r! r" r J s c C s, dt | d �d d t | d �d }|S )Ni r i � i r i � )r* )r+ Zchar_valr! r! r" r
P s c s i �� �fdd�}|S )Nc s� t tjtd��r d| j }n
d| j }t|j� �}y�| | | S tk
r� t|�}� | f|�|�}|jj|� d�kr�i �|< d�| kr�i �| |< d�| | kr�i �| | |< |�| | |< |S X d S )N� z _%s_factorys _%s_factoryr �args�kwargs) r r r& �typer r �KeyError�__dict__�update)Z
baseModuler- r. r Z kwargs_tuple�modZobjs)�factory� moduleCacher! r" �
moduleFactory\ s$
z+moduleFactoryFactory.<locals>.moduleFactoryr! )r4 r6 r! )r4 r5 r" r Y s c s i � � �fdd�}|S )Nc s2 t | �t |j� �f}|� kr*�| |�� |< � | S )N)r r )r- r. r$ )�cache�funcr! r" �wrappedy s zmemoize.<locals>.wrappedr! )r8 r9 r! )r7 r8 r" �memoizev s r: ) Z
__future__r r r �sys�typesr Zpip._vendor.sixr Zxml.etree.cElementTreeZetreeZ cElementTreer � ImportErrorZxml.etree.ElementTreeZ ElementTree�__all__� version_infor
�evalZ_xr r r r r r r
r r: r! r! r! r" �<module> s0
# pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.opt-1.pyc 0000644 00000275615 14751155150 0020577 0 ustar 00 3
���e�� � @ sF d dl mZmZmZ d dlmZmZmZ d dlZyd dl m
Z
W n e k
r` d dl m
Z
Y nX ddl
mZ ddl
mZ ddl
mZ dd lmZ dd
l
mZ dd lmZmZmZmZmZmZmZm Z m Z m Z m Z m Z!m"Z"m#Z#m$Z$m%Z% d!dd�Z&d"dd�Z'dd� Z(G dd� de)�Z*ej+dd� �Z,dd� Z-d#d d �Z.G d d � d e/�Z0dS )$� )�absolute_import�division�unicode_literals)�with_metaclass�viewkeys�PY3N)� OrderedDict� )� _inputstream)�
_tokenizer)� treebuilders)�Marker)�_utils)�spaceCharacters�asciiUpper2Lower�specialElements�headingElements�
cdataElements�rcdataElements�
tokenTypes�
tagTokenTypes�
namespaces� htmlIntegrationPointElements�"mathmlTextIntegrationPointElements�adjustForeignAttributes�adjustMathMLAttributes�adjustSVGAttributes�E�ReparseException�etreeTc K s$ t j|�}t||d�}|j| f|�S )z.Parse a string or file-like object into a tree)�namespaceHTMLElements)r �getTreeBuilder�
HTMLParser�parse)�doc� treebuilderr �kwargs�tb�p� r) �!/usr/lib/python3.6/html5parser.pyr# s
r# �divc K s, t j|�}t||d�}|j| fd|i|��S )N)r � container)r r! r" �
parseFragment)r$ r, r% r r& r' r( r) r) r* r- & s
r- c s G � fdd�dt �}|S )Nc s e Zd Z� fdd�ZdS )z-method_decorator_metaclass.<locals>.Decoratedc sB x0|j � D ]$\}}t|tj�r&� |�}|||< q
W tj| |||�S )N)�items�
isinstance�types� FunctionType�type�__new__)�metaZ classname�basesZ classDictZ
attributeNameZ attribute)�functionr) r* r3 . s
z5method_decorator_metaclass.<locals>.Decorated.__new__N)�__name__�
__module__� __qualname__r3 r) )r6 r) r* � Decorated- s r: )r2 )r6 r: r) )r6 r* �method_decorator_metaclass, s r; c @ s� e Zd ZdZd+dd�Zd,dd �Zd
d � Zed d
� �Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zd-dd �Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� ZdS ).r" zZHTML parser. Generates a tree structure from a stream of (possibly
malformed) HTMLNFTc sL |� _ |dkrtjd�}||�� _g � _t� fdd�t|�j� D ��� _dS )a
strict - raise an exception when a parse error is encountered
tree - a treebuilder class controlling the type of tree that will be
returned. Built in treebuilders can be accessed through
html5lib.treebuilders.getTreeBuilder(treeType)
Nr c s g | ]\}}||� � j �f�qS r) )�tree)�.0�name�cls)�selfr) r* �
<listcomp>M s z'HTMLParser.__init__.<locals>.<listcomp>) �strictr r! r< �errors�dict� getPhasesr. �phases)r@ r< rB r �debugr) )r@ r* �__init__< s
zHTMLParser.__init__r+ c K sh || _ || _|| _tj|fd| i|��| _| j� y | j� W n$ tk
rb | j� | j� Y nX d S )N�parser) �
innerHTMLModer, � scriptingr Z
HTMLTokenizer� tokenizer�reset�mainLoopr )r@ �stream� innerHTMLr, rK r& r) r) r* �_parseP s zHTMLParser._parsec C s� | j j� d| _g | _g | _d| _| jr�| jj� | _ | j t
krL| j j | j _
n0| j tkrd| j j| j _
n| j dkr|| j j| j _
n | jd | _| jj� | j� nd| _ | jd | _d | _d | _d| _d S )NFz no quirks� plaintext�
beforeHtml�initialT)r< rM �
firstStartTagrC �log�
compatModerJ r, �lowerrP r rL � rcdataState�stater � rawtextState�plaintextStaterF �phase�insertHtmlElement�resetInsertionModeZ lastPhaseZbeforeRCDataPhase�
framesetOK)r@ r) r) r* rM ^ s*
zHTMLParser.resetc C s t | d�sdS | jjjd jS )z�The name of the character encoding
that was used to decode the input stream,
or :obj:`None` if that is not determined yet.
rL Nr )�hasattrrL rO � charEncodingr> )r@ r) r) r* �documentEncoding� s
zHTMLParser.documentEncodingc C sJ |j dkr6|jtd kr6d|jko4|jd jt�dkS |j|j ftkS d S )Nzannotation-xml�mathml�encoding� text/html�application/xhtml+xml)rf rg )r> � namespacer �
attributes� translater r )r@ �elementr) r) r* �isHTMLIntegrationPoint� s
z!HTMLParser.isHTMLIntegrationPointc C s |j |jftkS )N)rh r> r )r@ rk r) r) r* � isMathMLTextIntegrationPoint� s z'HTMLParser.isMathMLTextIntegrationPointc C sj t d }t d }t d }t d }t d }t d }t d }�x�| j� D �]�}d } |}
�x�|
d k �r |
} | jjrx| jjd nd } | r�| jnd } | r�| jnd }
|
d }||kr�| j|
d
|
jd i �� d }
qVt| jj�d k�sl| | jj k�sl| j
| ��r ||k�r|d
t ddg�k�sl|||fk�sl| t d k�rP|
dk�rP||k�rP|d
dk�sl| j
| ��rt||||fk�rt| j}n
| jd }||k�r�|j|
�}
qV||k�r�|j|
�}
qV||k�r�|j|
�}
qV||k�r�|j|
�}
qV||k�r�|j|
�}
qV||krV|j|
�}
qVW ||krD| d rD| d rD| jdd
| d
i� qDW d}g }x(|�rd|j| j� | jj� }|�r>�q>W d S )N�
CharactersZSpaceCharacters�StartTag�EndTag�CommentZDoctype�
ParseErrorr r2 �data�datavarsr r> ZmglyphZ
malignmarkrd zannotation-xml�svg�inForeignContent� selfClosing�selfClosingAcknowledgedz&non-void-element-with-trailing-solidusT���)r �normalizedTokensr< � openElementsrh r> �
parseError�get�len�defaultNamespacerm � frozensetr rl r] rF �processCharacters�processSpaceCharacters�processStartTag�
processEndTag�processComment�processDoctype�append�
processEOF)r@ ZCharactersTokenZSpaceCharactersTokenZ
StartTagTokenZ EndTagTokenZ CommentTokenZ DoctypeTokenZParseErrorToken�tokenZ
prev_token� new_token� currentNodeZcurrentNodeNamespaceZcurrentNodeNamer2 r] Z reprocessrF r) r) r* rN � sp
zHTMLParser.mainLoopc c s x| j D ]}| j|�V qW d S )N)rL �normalizeToken)r@ r� r) r) r* rz � s zHTMLParser.normalizedTokensc O s | j |ddf|�|� | jj� S )a� Parse a HTML document into a well-formed tree
stream - a filelike object or string containing the HTML to be parsed
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
scripting - treat noscript elements as if javascript was turned on
FN)rQ r< Z getDocument)r@ rO �argsr& r) r) r* r# � s zHTMLParser.parsec O s | j |df|�|� | jj� S )a2 Parse a HTML fragment into a well-formed tree fragment
container - name of the element we're setting the innerHTML property
if set to None, default to 'div'
stream - a filelike object or string containing the HTML to be parsed
The optional encoding parameter must be a string that indicates
the encoding. If specified, that encoding will be used,
regardless of any BOM or later declaration (such as in a meta
element)
scripting - treat noscript elements as if javascript was turned on
T)rQ r< Z getFragment)r@ rO r� r& r) r) r* r- � s zHTMLParser.parseFragment�XXX-undefined-errorc C s@ |d kr i }| j j| jjj� ||f� | jr<tt| | ��d S )N)rC r� rL rO ZpositionrB rr r )r@ � errorcodert r) r) r* r| s
zHTMLParser.parseErrorc C sT |d t d krP|d }t|�|d< t|�t|d �krP|d j|ddd� � |S )z3 HTML5 specific normalizations to the token stream r2 ro rs Nr ry )r r r~ �update)r@ r� �rawr) r) r* r� s zHTMLParser.normalizeTokenc C s t |t� d S )N)�adjust_attributesr )r@ r� r) r) r* r s z!HTMLParser.adjustMathMLAttributesc C s t |t� d S )N)r� r )r@ r� r) r) r* r s z HTMLParser.adjustSVGAttributesc C s t |t� d S )N)r� �adjustForeignAttributesMap)r@ r� r) r) r* r s z"HTMLParser.adjustForeignAttributesc C s | j j� d S )N)rI r] )r@ r� r) r) r* �reparseTokenNormal s z HTMLParser.reparseTokenNormalc C s� d}ddddddddddd d d
d d �}x�| j jd d d� D ]p}|j}d }|| j jd krbd}| j}|dkrj| r�|j| j jkr�q:||kr�| j|| }P q:|r:| jd }P q:W || _d S )NF�inSelect�inCell�inRow� inTableBody� inCaption�
inColumnGroup�inTable�inBody�
inFrameset�
beforeHead)�select�td�th�tr�tbody�thead�tfoot�caption�colgroup�table�head�body�frameset�htmlr r Tr� r� r� r� ry )r� r� r� r� )r< r{ r> rP rh r rF r] )r@ ZlastZnewModes�nodeZnodeNameZ new_phaser) r) r* r_ ! s>
z HTMLParser.resetInsertionModec C sF | j j|� |dkr"| jj| j_n | jj| j_| j| _| jd | _dS )zYGeneric RCDATA/RAWTEXT Parsing algorithm
contentType - RCDATA or RAWTEXT
�RAWTEXT�textN) r< �
insertElementrL r[ rZ rY r] �
originalPhaserF )r@ r� Z contentTyper) r) r* �parseRCDataRawtextM s z HTMLParser.parseRCDataRawtext)NFTF)Fr+ F)r� N)r7 r8 r9 �__doc__rH rQ rM �propertyrc rl rm rN rz r# r- r| r� r r r r� r_ r� r) r) r) r* r" 8 s&
"
C
,r" c s" dd� }dd� }G dd� dt || |���� G dd� d� �}G d d
� d
� �}G � fd d �d � �}G � fd
d�d� �}G � fdd�d� �}G � fdd�d� �}G � fdd�d� �} G � fdd�d� �}
G � fdd�d� �} G � fdd�d� �} G � fdd �d � �}
G � fd d �d � �}G � fd d �d � �}G � fd!d"�d"� �}G � fd#d$�d$� �}G � fd%d&�d&� �}G � fd'd(�d(� �}G � fd)d*�d*� �}G � fd+d,�d,� �}G � fd-d.�d.� �}G � fd/d0�d0� �}G � fd1d2�d2� �}G � fd3d4�d4� �}||||||| |
| | |
||||||||||||d5�S )6Nc s( t dd� tj� D ���� �fdd�}|S )z4Logger that records which phase processes each tokenc s s | ]\}}||fV qd S )Nr) )r= �key�valuer) r) r* � <genexpr>c s z)getPhases.<locals>.log.<locals>.<genexpr>c s� � j jd�r�t|�dkr�|d }yd�|d i}W n � Y nX |d tkr\|d |d< | jjj| jjjj | jj j
j | j
j � j |f� � | f|�|�S � | f|�|�S d S )NZprocessr r2 r> ) r7 �
startswithr~ r rI rV r� rL rZ r] � __class__)r@ r� r& r� �info)r6 �
type_namesr) r* �wrappedf s
z'getPhases.<locals>.log.<locals>.wrapped)rD r r. )r6 r� r) )r6 r� r* rV a s zgetPhases.<locals>.logc S s | r t |�S tS d S )N)r; r2 )Z
use_metaclassZmetaclass_funcr) r) r* � getMetaclassz s z getPhases.<locals>.getMetaclassc @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dS )zgetPhases.<locals>.PhasezNBase class for helper object that implements each phase of processing
c S s || _ || _d S )N)rI r< )r@ rI r< r) r) r* rH � s z!getPhases.<locals>.Phase.__init__c S s t �d S )N)�NotImplementedError)r@ r) r) r* r� � s z#getPhases.<locals>.Phase.processEOFc S s | j j|| j jd � d S )Nr ry )r< �
insertCommentr{ )r@ r� r) r) r* r� � s z'getPhases.<locals>.Phase.processCommentc S s | j jd� d S )Nzunexpected-doctype)rI r| )r@ r� r) r) r* r� � s z'getPhases.<locals>.Phase.processDoctypec S s | j j|d � d S )Nrs )r< �
insertText)r@ r� r) r) r* r� � s z*getPhases.<locals>.Phase.processCharactersc S s | j j|d � d S )Nrs )r< r� )r@ r� r) r) r* r� � s z/getPhases.<locals>.Phase.processSpaceCharactersc S s | j |d |�S )Nr> )�startTagHandler)r@ r� r) r) r* r� � s z(getPhases.<locals>.Phase.processStartTagc S sl | j j r"|d dkr"| j jd� x<|d j� D ],\}}|| jjd jkr0|| jjd j|< q0W d| j _d S )Nr> r� z
non-html-rootrs r F)rI rU r| r. r< r{ ri )r@ r� �attrr� r) r) r* � startTagHtml� s z%getPhases.<locals>.Phase.startTagHtmlc S s | j |d |�S )Nr> )�
endTagHandler)r@ r� r) r) r* r� � s z&getPhases.<locals>.Phase.processEndTagN)
r7 r8 r9 r� rH r� r� r� r� r� r� r� r� r) r) r) r* �Phase� s
r� c @ sL e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z getPhases.<locals>.InitialPhasec S s d S )Nr) )r@ r� r) r) r* r� � s z6getPhases.<locals>.InitialPhase.processSpaceCharactersc S s | j j|| j j� d S )N)r< r� �document)r@ r� r) r) r* r� � s z.getPhases.<locals>.InitialPhase.processCommentc 8 S s |d }|d }|d }|d }|dks@|d k s@|d k rL|dkrL| j jd� |d krXd}| jj|� |dkrv|jt�}| � s�|d dk� s�|jdJ�� s�|dKk� s�|jdL�� r�|d k� s�|� r�|j� dDk� r�dE| j _n*|jdM�� s�|jdN��r |d k �r dH| j _| j j dI | j _
d S )ONr> �publicId�systemId�correctr� zabout:legacy-compatzunknown-doctype� �*+//silmaril//dtd html pro v0r11 19970101//�4-//advasoft ltd//dtd html 3.0 aswedit + extensions//�*-//as//dtd html 3.0 aswedit + extensions//� -//ietf//dtd html 2.0 level 1//� -//ietf//dtd html 2.0 level 2//�&-//ietf//dtd html 2.0 strict level 1//�&-//ietf//dtd html 2.0 strict level 2//� -//ietf//dtd html 2.0 strict//�-//ietf//dtd html 2.0//�-//ietf//dtd html 2.1e//�-//ietf//dtd html 3.0//� -//ietf//dtd html 3.2 final//�-//ietf//dtd html 3.2//�-//ietf//dtd html 3//�-//ietf//dtd html level 0//�-//ietf//dtd html level 1//�-//ietf//dtd html level 2//�-//ietf//dtd html level 3//�"-//ietf//dtd html strict level 0//�"-//ietf//dtd html strict level 1//�"-//ietf//dtd html strict level 2//�"-//ietf//dtd html strict level 3//�-//ietf//dtd html strict//�-//ietf//dtd html//�(-//metrius//dtd metrius presentational//�5-//microsoft//dtd internet explorer 2.0 html strict//�.-//microsoft//dtd internet explorer 2.0 html//�0-//microsoft//dtd internet explorer 2.0 tables//�5-//microsoft//dtd internet explorer 3.0 html strict//�.-//microsoft//dtd internet explorer 3.0 html//�0-//microsoft//dtd internet explorer 3.0 tables//�#-//netscape comm. corp.//dtd html//�*-//netscape comm. corp.//dtd strict html//�*-//o'reilly and associates//dtd html 2.0//�3-//o'reilly and associates//dtd html extended 1.0//�;-//o'reilly and associates//dtd html extended relaxed 1.0//�N-//softquad software//dtd hotmetal pro 6.0::19990601::extensions to html 4.0//�E-//softquad//dtd hotmetal pro 4.0::19971010::extensions to html 4.0//�$-//spyglass//dtd html 2.0 extended//�+-//sq//dtd html 2.0 hotmetal + extensions//�--//sun microsystems corp.//dtd hotjava html//�4-//sun microsystems corp.//dtd hotjava strict html//� -//w3c//dtd html 3 1995-03-24//� -//w3c//dtd html 3.2 draft//� -//w3c//dtd html 3.2 final//�-//w3c//dtd html 3.2//� -//w3c//dtd html 3.2s draft//� -//w3c//dtd html 4.0 frameset//�#-//w3c//dtd html 4.0 transitional//�(-//w3c//dtd html experimental 19960712//�&-//w3c//dtd html experimental 970421//�-//w3c//dtd w3 html//�-//w3o//dtd w3 html 3.0//�#-//webtechs//dtd mozilla html 2.0//� -//webtechs//dtd mozilla html//�$-//w3o//dtd w3 html strict 3.0//en//�"-/w3c/dtd html 4.0 transitional/en� -//w3c//dtd html 4.01 frameset//�$-//w3c//dtd html 4.01 transitional//z:http://www.ibm.com/data/dtd/v11/ibmxhtml1-transitional.dtd�quirks� -//w3c//dtd xhtml 1.0 frameset//�$-//w3c//dtd xhtml 1.0 transitional//zlimited quirksrS )7r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r )r r r� )r r )r r )r r ) rI r| r< Z
insertDoctyperj r r� rX rW rF r] )r@ r� r> r� r� r� r) r) r* r� � s�
z.getPhases.<locals>.InitialPhase.processDoctypec S s d| j _| j jd | j _d S )Nr rS )rI rW rF r] )r@ r) r) r* � anythingElse s z,getPhases.<locals>.InitialPhase.anythingElsec S s | j jd� | j� |S )Nz expected-doctype-but-got-chars)rI r| r )r@ r� r) r) r* r� s z1getPhases.<locals>.InitialPhase.processCharactersc S s" | j jdd|d i� | j� |S )Nz"expected-doctype-but-got-start-tagr> )rI r| r )r@ r� r) r) r* r� s z/getPhases.<locals>.InitialPhase.processStartTagc S s" | j jdd|d i� | j� |S )Nz expected-doctype-but-got-end-tagr> )rI r| r )r@ r� r) r) r* r� s z-getPhases.<locals>.InitialPhase.processEndTagc S s | j jd� | j� dS )Nz expected-doctype-but-got-eofT)rI r| r )r@ r) r) r* r� % s z*getPhases.<locals>.InitialPhase.processEOFN) r7 r8 r9 r� r� r� r r� r� r� r� r) r) r) r* � InitialPhase� s _r
c @ sD e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )z"getPhases.<locals>.BeforeHtmlPhasec S s& | j jtdd�� | jjd | j_d S )Nr� ro r� )r< Z
insertRoot�impliedTagTokenrI rF r] )r@ r) r) r* r^ , s z4getPhases.<locals>.BeforeHtmlPhase.insertHtmlElementc S s | j � dS )NT)r^ )r@ r) r) r* r� 1 s z-getPhases.<locals>.BeforeHtmlPhase.processEOFc S s | j j|| j j� d S )N)r< r� r� )r@ r� r) r) r* r� 5 s z1getPhases.<locals>.BeforeHtmlPhase.processCommentc S s d S )Nr) )r@ r� r) r) r* r� 8 s z9getPhases.<locals>.BeforeHtmlPhase.processSpaceCharactersc S s | j � |S )N)r^ )r@ r� r) r) r* r� ; s z4getPhases.<locals>.BeforeHtmlPhase.processCharactersc S s |d dkrd| j _| j� |S )Nr> r� T)rI rU r^ )r@ r� r) r) r* r� ? s z2getPhases.<locals>.BeforeHtmlPhase.processStartTagc S s4 |d dkr$| j jdd|d i� n | j� |S d S )Nr> r� r� r� �brz unexpected-end-tag-before-html)r� r� r� r )rI r| r^ )r@ r� r) r) r* r� E s
z0getPhases.<locals>.BeforeHtmlPhase.processEndTagN)
r7 r8 r9 r^ r� r� r� r� r� r� r) r) r) r* �BeforeHtmlPhase* s r
c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z"getPhases.<locals>.BeforeHeadPhasec sV � j | ||� tjd| jfd| jfg�| _| j| j_tjd| jfg�| _ | j
| j _d S )Nr� r� r� r )r� r� r� r ) rH r �MethodDispatcherr� � startTagHeadr� �
startTagOther�default�endTagImplyHeadr� � endTagOther)r@ rI r< )r� r) r* rH N s
z+getPhases.<locals>.BeforeHeadPhase.__init__c S s | j tdd�� dS )Nr� ro T)r r )r@ r) r) r* r� \ s z-getPhases.<locals>.BeforeHeadPhase.processEOFc S s d S )Nr) )r@ r� r) r) r* r� ` s z9getPhases.<locals>.BeforeHeadPhase.processSpaceCharactersc S s | j tdd�� |S )Nr� ro )r r )r@ r� r) r) r* r� c s z4getPhases.<locals>.BeforeHeadPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� g s z/getPhases.<locals>.BeforeHeadPhase.startTagHtmlc S s0 | j j|� | j jd | j _| jjd | j_d S )Nr �inHeadry )r< r� r{ � headPointerrI rF r] )r@ r� r) r) r* r j s z/getPhases.<locals>.BeforeHeadPhase.startTagHeadc S s | j tdd�� |S )Nr� ro )r r )r@ r� r) r) r* r o s z0getPhases.<locals>.BeforeHeadPhase.startTagOtherc S s | j tdd�� |S )Nr� ro )r r )r@ r� r) r) r* r s s z2getPhases.<locals>.BeforeHeadPhase.endTagImplyHeadc S s | j jdd|d i� d S )Nzend-tag-after-implied-rootr> )rI r| )r@ r� r) r) r* r w s z.getPhases.<locals>.BeforeHeadPhase.endTagOtherN) r7 r8 r9 rH r� r� r� r� r r r r r) )r� r) r* �BeforeHeadPhaseM s r c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!S )"z getPhases.<locals>.InHeadPhasec s� � j | ||� tjd| jfd| jfd| jfd| jfd| jfd| jfd | j fd
| j
fg�| _ | j | j _
tjd
| jfd| jfg�| _| j| j_
d S )Nr� �title�noframes�style�noscript�script�base�basefont�bgsound�command�linkr4 r� r r� )r r )r r r r r )r r� r� )rH r r r� �
startTagTitle�startTagNoFramesStyle�startTagNoscript�startTagScript�startTagBaseLinkCommand� startTagMetar r� r r �
endTagHead�endTagHtmlBodyBrr� r )r@ rI r< )r� r) r* rH | s
z'getPhases.<locals>.InHeadPhase.__init__c S s | j � dS )NT)r )r@ r) r) r* r� � s z)getPhases.<locals>.InHeadPhase.processEOFc S s | j � |S )N)r )r@ r� r) r) r* r� � s z0getPhases.<locals>.InHeadPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z+getPhases.<locals>.InHeadPhase.startTagHtmlc S s | j jd� d S )Nz!two-heads-are-not-better-than-one)rI r| )r@ r� r) r) r* r � s z+getPhases.<locals>.InHeadPhase.startTagHeadc S s$ | j j|� | j jj� d|d< d S )NTrx )r< r� r{ �pop)r@ r� r) r) r* r% � s z6getPhases.<locals>.InHeadPhase.startTagBaseLinkCommandc S s� | j j|� | j jj� d|d< |d }| jjjjd dkr�d|krZ| jjjj|d � nVd|kr�d|kr�|d j � d kr�t
j |d j d
��}t
j
|�}|j� }| jjjj|� d S ) NTrx rs r Z tentative�charsetZcontentz
http-equivz content-typezutf-8)r< r� r{ r) rI rL rO rb ZchangeEncodingrX r
Z
EncodingBytes�encodeZContentAttrParserr# )r@ r� ri rs rI �codecr) r) r* r& � s
z+getPhases.<locals>.InHeadPhase.startTagMetac S s | j j|d� d S )NZRCDATA)rI r� )r@ r� r) r) r* r! � s z,getPhases.<locals>.InHeadPhase.startTagTitlec S s | j j|d� d S )Nr� )rI r� )r@ r� r) r) r* r" � s z4getPhases.<locals>.InHeadPhase.startTagNoFramesStylec S s8 | j jr| j j|d� n | jj|� | j jd | j _d S )Nr� �inHeadNoscript)rI rK r� r< r� rF r] )r@ r� r) r) r* r# � s z/getPhases.<locals>.InHeadPhase.startTagNoscriptc S s< | j j|� | jjj| jj_| jj| j_| jjd | j_d S )Nr� ) r< r� rI rL ZscriptDataStaterZ r] r� rF )r@ r� r) r) r* r$ � s z-getPhases.<locals>.InHeadPhase.startTagScriptc S s | j � |S )N)r )r@ r� r) r) r* r � s z,getPhases.<locals>.InHeadPhase.startTagOtherc S s" | j jjj� }| j jd | j _d S )N� afterHead)rI r< r{ r) rF r] )r@ r� r� r) r) r* r' � s z)getPhases.<locals>.InHeadPhase.endTagHeadc S s | j � |S )N)r )r@ r� r) r) r* r( � s z/getPhases.<locals>.InHeadPhase.endTagHtmlBodyBrc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r � s z*getPhases.<locals>.InHeadPhase.endTagOtherc S s | j td�� d S )Nr� )r' r )r@ r) r) r* r � s z+getPhases.<locals>.InHeadPhase.anythingElseN)r7 r8 r9 rH r� r� r� r r% r& r! r" r# r$ r r' r( r r r) )r� r) r* � InHeadPhase{ s r/ c sx e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) z&getPhases.<locals>.InHeadNoscriptPhasec sf � j | ||� tjd| jfd | jfd | jfg�| _| j| j_tjd | j fd
| j
fg�| _ | j | j _d S )
Nr� r r r r4 r r r� r r )r r r r4 r r )r� r )
rH r r r� r% �startTagHeadNoscriptr� r r �endTagNoscript�endTagBrr� r )r@ rI r< )r� r) r* rH � s
z/getPhases.<locals>.InHeadNoscriptPhase.__init__c S s | j jd� | j� dS )Nzeof-in-head-noscriptT)rI r| r )r@ r) r) r* r� � s z1getPhases.<locals>.InHeadNoscriptPhase.processEOFc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r� � s z5getPhases.<locals>.InHeadNoscriptPhase.processCommentc S s | j jd� | j� |S )Nzchar-in-head-noscript)rI r| r )r@ r� r) r) r* r� � s z8getPhases.<locals>.InHeadNoscriptPhase.processCharactersc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r� s z=getPhases.<locals>.InHeadNoscriptPhase.processSpaceCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� s z3getPhases.<locals>.InHeadNoscriptPhase.startTagHtmlc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r% s z>getPhases.<locals>.InHeadNoscriptPhase.startTagBaseLinkCommandc S s | j jdd|d i� d S )Nzunexpected-start-tagr> )rI r| )r@ r� r) r) r* r0 s z;getPhases.<locals>.InHeadNoscriptPhase.startTagHeadNoscriptc S s" | j jdd|d i� | j� |S )Nz unexpected-inhead-noscript-tagr> )rI r| r )r@ r� r) r) r* r s z4getPhases.<locals>.InHeadNoscriptPhase.startTagOtherc S s" | j jjj� }| j jd | j _d S )Nr )rI r< r{ r) rF r] )r@ r� r� r) r) r* r1 s z5getPhases.<locals>.InHeadNoscriptPhase.endTagNoscriptc S s" | j jdd|d i� | j� |S )Nz unexpected-inhead-noscript-tagr> )rI r| r )r@ r� r) r) r* r2 s z/getPhases.<locals>.InHeadNoscriptPhase.endTagBrc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r s z2getPhases.<locals>.InHeadNoscriptPhase.endTagOtherc S s | j td�� d S )Nr )r1 r )r@ r) r) r* r s z3getPhases.<locals>.InHeadNoscriptPhase.anythingElseN)r7 r8 r9 rH r� r� r� r� r� r% r0 r r1 r2 r r r) )r� r) r* �InHeadNoscriptPhase� s r3 c sp e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� ZdS )z!getPhases.<locals>.AfterHeadPhasec
sn � j | ||� tjd| jfd| jfd| jfd| jfd
| jfg�| _| j | j_
tjd| j fg�| _ | j
| j _
d S )Nr� r� r� r r r r r4 r r r r r� r ) r r r r r4 r r r r )r� r� r )rH r r r� � startTagBody�startTagFrameset�startTagFromHeadr r� r r r( r� r )r@ rI r< )r� r) r* rH # s
z*getPhases.<locals>.AfterHeadPhase.__init__c S s | j � dS )NT)r )r@ r) r) r* r� 4 s z,getPhases.<locals>.AfterHeadPhase.processEOFc S s | j � |S )N)r )r@ r� r) r) r* r� 8 s z3getPhases.<locals>.AfterHeadPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� < s z.getPhases.<locals>.AfterHeadPhase.startTagHtmlc S s( d| j _| jj|� | j jd | j _d S )NFr� )rI r` r< r� rF r] )r@ r� r) r) r* r4 ? s z.getPhases.<locals>.AfterHeadPhase.startTagBodyc S s | j j|� | jjd | j_d S )Nr� )r< r� rI rF r] )r@ r� r) r) r* r5 D s z2getPhases.<locals>.AfterHeadPhase.startTagFramesetc S st | j jdd|d i� | jjj| jj� | j jd j|� x4| jjd d d� D ] }|jdkrN| jjj |� P qNW d S )Nz#unexpected-start-tag-out-of-my-headr> r r r� ry )
rI r| r< r{ r� r rF r� r> �remove)r@ r� r� r) r) r* r6 H s
z2getPhases.<locals>.AfterHeadPhase.startTagFromHeadc S s | j jdd|d i� d S )Nzunexpected-start-tagr> )rI r| )r@ r� r) r) r* r R s z.getPhases.<locals>.AfterHeadPhase.startTagHeadc S s | j � |S )N)r )r@ r� r) r) r* r U s z/getPhases.<locals>.AfterHeadPhase.startTagOtherc S s | j � |S )N)r )r@ r� r) r) r* r( Y s z2getPhases.<locals>.AfterHeadPhase.endTagHtmlBodyBrc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r ] s z-getPhases.<locals>.AfterHeadPhase.endTagOtherc S s. | j jtdd�� | jjd | j_d| j_d S )Nr� ro r� T)r< r� r rI rF r] r` )r@ r) r) r* r ` s z.getPhases.<locals>.AfterHeadPhase.anythingElseN)r7 r8 r9 rH r� r� r� r4 r5 r6 r r r( r r r) )r� r) r* �AfterHeadPhase" s
r8 c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Zd3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z d=d>� Z!d?d@� Z"dAdB� Z#dCdD� Z$dEdF� Z%dGdH� Z&dIdJ� Z'dKdL� Z(dMdN� Z)dOdP� Z*dQdR� Z+dSdT� Z,dUdV� Z-dWdX� Z.dYdZ� Z/d[d\� Z0d]d^� Z1d_d`� Z2dadb� Z3dcdd� Z4dedf� Z5dgS )hz getPhases.<locals>.InBodyPhasec , s� � j | ||� | j| _tjd| jfdd| jfd | jfd | jfde| j ft
| j fdf| j fd&| j
fdg| jfd*| jfd+| jfdh| jfd8| jfd9| jfdi| jfd=| jfd>| jfdj| jfdk| jfdH| jfdI| jfdJ| jfdK| j fdL| j fdM| j fdN| j fdl| j fdQ| j!fdm| j"fdn| j#fdV| j$fdW| j%fdo| j&fg!�| _'| j(| j'_)tjd | j*fd| j+fdp| j,fd&| j-fd | j.fdq| j/ft
| j0fdr| j1fds| j2fd@| j3fg
�| _4| j5| j4_)d S )tNr� r r r r r r4 r r r r� r� �address�article�aside�
blockquote�center�details�dirr+ �dl�fieldset�
figcaption�figure�footer�header�hgroup�main�menu�nav�olr( �section�summary�ul�pre�listing�form�li�dd�dtrR �a�b�big�code�em�font�i�s�small�strike�strong�tt�u�nobr�button�applet�marquee�objectZxmpr� �arear �embed�img�keygen�wbr�param�source�track�input�hr�image�isindex�textareaZiframer �noembedr r� �rp�rt�option�optgroupZmathru r� �colr� �framer� r� r� r� r� r� r� �dialog) r r r r r r4 r r r )r9 r: r; r< r= r> r? r+ r@ rA rB rC rD rE rF rG rH rI rJ r( rK rL rM )rN rO )rQ rR rS ) rU rV rW rX rY rZ r[ r\ r] r^ r_ r` )rc rd re )rf r rg rh ri rj )rk rl rm )rs r )rt ru )rv rw ) r� rx r� ry r� r� r� r� r� r� r� )r9 r: r; r< rb r= r> rz r? r+ r@ rA rB rC rD rE rF rO rG rH rI rJ rN rK rL rM )rR rS rQ )rT rU rV rW rX rY rZ ra r[ r\ r] r^ r_ r` )rc rd re )6rH � processSpaceCharactersNonPrer� r r r� �startTagProcessInHeadr4 r5 �startTagClosePr �startTagHeading�startTagPreListing� startTagForm�startTagListItem�startTagPlaintext� startTagA�startTagFormatting� startTagNobr�startTagButton�startTagAppletMarqueeObject� startTagXmp�
startTagTable�startTagVoidFormatting�startTagParamSource�
startTagInput�
startTagHr�
startTagImage�startTagIsIndex�startTagTextarea�startTagIFramer# �startTagRawtext�startTagSelect� startTagRpRt� startTagOpt� startTagMath� startTagSvg�startTagMisplacedr� r r �
endTagBody�
endTagHtml� endTagBlock�
endTagForm�endTagP�endTagListItem�
endTagHeading�endTagFormatting�endTagAppletMarqueeObjectr2 r� r )r@ rI r< )r� r) r* rH h s~
z'getPhases.<locals>.InBodyPhase.__init__c S s$ |j |j ko"|j|jko"|j|jkS )N)r> rh ri )r@ Znode1Znode2r) r) r* �isMatchingFormattingElement� s z:getPhases.<locals>.InBodyPhase.isMatchingFormattingElementc S s� | j j|� | j jd }g }x<| j jd d d� D ]&}|tkr@P q0| j||�r0|j|� q0W t|�dkrx| j jj|d � | j jj|� d S )Nr � ry ry ry ) r< r� r{ �activeFormattingElementsr
r� r� r~ r7 )r@ r� rk ZmatchingElementsr� r) r) r* �addFormattingElement� s z3getPhases.<locals>.InBodyPhase.addFormattingElementc
S s@ t d�}x2| jjd d d� D ] }|j|kr | jjd� P q W d S )NrR rS rQ r( r� r� r� r� r� r� r� r� r z expected-closing-tag-but-got-eof) rR rS rQ r( r� r� r� r� r� r� r� r� ry )r� r< r{ r> rI r| )r@ Zallowed_elementsr� r) r) r* r� � s
z)getPhases.<locals>.InBodyPhase.processEOFc S sh |d }| j | _|jd�rJ| jjd jdkrJ| jjd j� rJ|dd � }|rd| jj� | jj|� d S )
Nrs �
r rN rO rr ry )rN rO rr ry ) r{ r� r� r< r{ r> Z
hasContent�#reconstructActiveFormattingElementsr� )r@ r� rs r) r) r* �!processSpaceCharactersDropNewline� s
z@getPhases.<locals>.InBodyPhase.processSpaceCharactersDropNewlinec S sT |d dkrd S | j j� | j j|d � | jjrPtdd� |d D ��rPd| j_d S )Nrs � c S s g | ] }|t k�qS r) )r )r= �charr) r) r* rA � s zDgetPhases.<locals>.InBodyPhase.processCharacters.<locals>.<listcomp>F)r< r� r� rI r` �any)r@ r� r) r) r* r� � s
z0getPhases.<locals>.InBodyPhase.processCharactersc S s | j j� | j j|d � d S )Nrs )r< r� r� )r@ r� r) r) r* r{ � s
z;getPhases.<locals>.InBodyPhase.processSpaceCharactersNonPrec S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r| � s z4getPhases.<locals>.InBodyPhase.startTagProcessInHeadc S s� | j jdddi� t| jj�dks|| jjd jdkr6nFd| j _x<|d j� D ],\}}|| jjd jkrL|| jjd j|< qLW d S )Nzunexpected-start-tagr> r� r Frs ) rI r| r~ r< r{ r> r` r. ri )r@ r� r� r� r) r) r* r4 � s z+getPhases.<locals>.InBodyPhase.startTagBodyc S s� | j jdddi� t| jj�dks�| jjd jdkr6nt| j js@nj| jjd jrj| jjd jj| jjd � x"| jjd jdkr�| jjj � qlW | jj
|� | j j d | j _ d S ) Nzunexpected-start-tagr> r� r r� r� r� ry )
rI r| r~ r< r{ r> r` �parent� removeChildr) r� rF r] )r@ r� r) r) r* r5 � s " z/getPhases.<locals>.InBodyPhase.startTagFramesetc S s. | j jddd�r | jtd�� | j j|� d S )Nr( rb )�variant)r< �elementInScoper� r r� )r@ r� r) r) r* r} s z-getPhases.<locals>.InBodyPhase.startTagClosePc S s> | j jddd�r | jtd�� | j j|� d| j_| j| _d S )Nr( rb )r� F) r< r� r� r r� rI r` r� r� )r@ r� r) r) r* r s
z1getPhases.<locals>.InBodyPhase.startTagPreListingc S sZ | j jr | jjdddi� n:| j jddd�r:| jtd�� | j j|� | j jd | j _d S ) Nzunexpected-start-tagr> rP r( rb )r� r ry ) r< � formPointerrI r| r� r� r r� r{ )r@ r� r) r) r* r� s z+getPhases.<locals>.InBodyPhase.startTagFormc S s� d| j _dgddgddgd�}||d }xLt| jj�D ]<}|j|kr^| j jjt|jd�� P |j t
kr8|jd
kr8P q8W | jj d
d d �r�| j jjtd
d�� | jj |� d S )NFrQ rS rR )rQ rS rR r> rp r9 r+ r( rb )r� )r9 r+ r( )
rI r` �reversedr< r{ r> r] r� r � nameTupler r� r� )r@ r� Z stopNamesMapZ stopNamesr� r) r) r* r� s"
z/getPhases.<locals>.InBodyPhase.startTagListItemc S s> | j jddd�r | jtd�� | j j|� | jjj| jj_d S )Nr( rb )r� ) r< r� r� r r� rI rL r\ rZ )r@ r� r) r) r* r� 4 s z0getPhases.<locals>.InBodyPhase.startTagPlaintextc S sb | j jddd�r | jtd�� | j jd jtkrR| jjdd|d i� | j jj � | j j
|� d S )Nr( rb )r� r zunexpected-start-tagr> ry ) r< r� r� r r{ r> r rI r| r) r� )r@ r� r) r) r* r~ : s z.getPhases.<locals>.InBodyPhase.startTagHeadingc S s~ | j jd�}|rf| jjdddd�� | jtd�� || j jkrL| j jj|� || j jkrf| j jj|� | j j � | j
|� d S )NrT z$unexpected-start-tag-implies-end-tag)� startName�endName) r< �!elementInActiveFormattingElementsrI r| r� r r{ r7 r� r� r� )r@ r� Z afeAElementr) r) r* r� B s
z(getPhases.<locals>.InBodyPhase.startTagAc S s | j j� | j|� d S )N)r< r� r� )r@ r� r) r) r* r� O s
z1getPhases.<locals>.InBodyPhase.startTagFormattingc S sP | j j� | j jd�rB| jjdddd�� | jtd�� | j j� | j|� d S )Nra z$unexpected-start-tag-implies-end-tag)r� r� )r< r� r� rI r| r� r r� )r@ r� r) r) r* r� S s
z+getPhases.<locals>.InBodyPhase.startTagNobrc S sT | j jd�r2| jjdddd�� | jtd�� |S | j j� | j j|� d| j_d S )Nrb z$unexpected-start-tag-implies-end-tag)r� r� F) r< r� rI r| r� r r� r� r` )r@ r� r) r) r* r� ] s
z-getPhases.<locals>.InBodyPhase.startTagButtonc S s0 | j j� | j j|� | j jjt� d| j_d S )NF)r< r� r� r� r� r
rI r` )r@ r� r) r) r* r� h s
z:getPhases.<locals>.InBodyPhase.startTagAppletMarqueeObjectc S sB | j jddd�r | jtd�� | j j� d| j_| jj|d� d S )Nr( rb )r� Fr� )r< r� r� r r� rI r` r� )r@ r� r) r) r* r� n s
z*getPhases.<locals>.InBodyPhase.startTagXmpc S sR | j jdkr*| jjddd�r*| jtd�� | jj|� d| j _| j jd | j _ d S )Nr r( rb )r� Fr� )
rI rW r< r� r� r r� r` rF r] )r@ r� r) r) r* r� u s z,getPhases.<locals>.InBodyPhase.startTagTablec S s6 | j j� | j j|� | j jj� d|d< d| j_d S )NTrx F)r< r� r� r{ r) rI r` )r@ r� r) r) r* r� } s
z5getPhases.<locals>.InBodyPhase.startTagVoidFormattingc S s@ | j j}| j|� d|d kr<|d d jt�dkr<|| j _d S )Nr2 rs �hidden)rI r` r� rj r )r@ r� r` r) r) r* r� � s
z,getPhases.<locals>.InBodyPhase.startTagInputc S s$ | j j|� | j jj� d|d< d S )NTrx )r< r� r{ r) )r@ r� r) r) r* r� � s z2getPhases.<locals>.InBodyPhase.startTagParamSourcec S sJ | j jddd�r | jtd�� | j j|� | j jj� d|d< d| j_d S )Nr( rb )r� Trx F) r< r� r� r r� r{ r) rI r` )r@ r� r) r) r* r� � s z)getPhases.<locals>.InBodyPhase.startTagHrc S s6 | j jdddd�� | jtdd|d |d d�� d S ) Nz unexpected-start-tag-treated-asrp rh )� originalName�newNamero rs rw )ri rw )rI r| r� r )r@ r� r) r) r* r� � s
z,getPhases.<locals>.InBodyPhase.startTagImagec S s | j jdddi� | jjr d S i }d|d kr>|d d |d< | jtdd|d�� | jtd d�� | jtd
d�� d |d kr�|d d }nd }| jtd
|d�� |d j� }d|kr�|d= d |kr�|d = d|d< | jtdd||d d�� | j td
�� | jtd d�� | j td�� d S )Nzdeprecated-tagr> rq �actionrs rP ro )ri ro Zlabel�promptz3This is a searchable index. Enter search keywords: rn )r2 rs rn rw )ri rw )
rI r| r< r� r� r r� r �copyr� )r@ r� Z
form_attrsr� ri r) r) r* r� � s6
z.getPhases.<locals>.InBodyPhase.startTagIsIndexc S s0 | j j|� | jjj| jj_| j| _d| j_d S )NF) r< r� rI rL rY rZ r� r� r` )r@ r� r) r) r* r� � s z/getPhases.<locals>.InBodyPhase.startTagTextareac S s d| j _| j|� d S )NF)rI r` r� )r@ r� r) r) r* r� � s z-getPhases.<locals>.InBodyPhase.startTagIFramec S s" | j jr| j|� n
| j|� d S )N)rI rK r� r )r@ r� r) r) r* r# � s z/getPhases.<locals>.InBodyPhase.startTagNoscriptc S s | j j|d� dS )z8iframe, noembed noframes, noscript(if scripting enabled)r� N)rI r� )r@ r� r) r) r* r� � s z.getPhases.<locals>.InBodyPhase.startTagRawtextc S s@ | j jd jdkr$| jjjtd�� | j j� | jj j|� d S )Nr rv ry ) r< r{ r> rI r] r� r r� r� )r@ r� r) r) r* r� � s
z*getPhases.<locals>.InBodyPhase.startTagOptc S s� | j j� | j j|� d| j_| jj| jjd | jjd | jjd | jjd | jjd | jjd fkrx| jjd | j_n| jjd | j_d S )
NFr� r� r� r� r� r� �inSelectInTabler� )r< r� r� rI r` r] rF )r@ r� r) r) r* r� � s
z-getPhases.<locals>.InBodyPhase.startTagSelectc S sB | j jd�r2| j j� | j jd jdkr2| jj� | j j|� d S )N�rubyr ry )r< r� �generateImpliedEndTagsr{ r> rI r| r� )r@ r� r) r) r* r� � s
z+getPhases.<locals>.InBodyPhase.startTagRpRtc S sZ | j j� | jj|� | jj|� td |d< | j j|� |d rV| j jj� d|d< d S )Nrd rh rw Trx ) r< r� rI r r r r� r{ r) )r@ r� r) r) r* r� � s
z+getPhases.<locals>.InBodyPhase.startTagMathc S sZ | j j� | jj|� | jj|� td |d< | j j|� |d rV| j jj� d|d< d S )Nru rh rw Trx ) r< r� rI r r r r� r{ r) )r@ r� r) r) r* r� � s
z*getPhases.<locals>.InBodyPhase.startTagSvgc S s | j jdd|d i� dS )a5 Elements that should be children of other elements that have a
different insertion mode; here they are ignored
"caption", "col", "colgroup", "frame", "frameset", "head",
"option", "optgroup", "tbody", "td", "tfoot", "th", "thead",
"tr", "noscript"
z unexpected-start-tag-ignoredr> N)rI r| )r@ r� r) r) r* r� s z0getPhases.<locals>.InBodyPhase.startTagMisplacedc S s | j j� | j j|� d S )N)r< r� r� )r@ r� r) r) r* r s
z,getPhases.<locals>.InBodyPhase.startTagOtherc S s� | j jddd�sD| jtdd�� | jjdddi� | jtdd�� nX| j jd� | j jd j dkrt| jjdddi� | j jj
� }x|j dkr�| j jj
� }q�W d S )
Nr( rb )r� ro zunexpected-end-tagr> rp r ry ) r< r� r} r rI r| r� r� r{ r> r) )r@ r� r� r) r) r* r� s z&getPhases.<locals>.InBodyPhase.endTagPc S s� | j jd�s| jj� d S | j jd jdkrlx>| j jdd � D ]*}|jtd�kr>| jjdd|jd�� P q>W | jjd | j_d S )Nr� r � rR rS rQ rw rv r( rt ru r� r� r� r� r� r� r� z$expected-one-end-tag-but-got-another)�gotName� expectedName� afterBodyry )rR rS rQ rw rv r( rt ru r� r� r� r� r� r� r� r� ) r< r� rI r| r{ r> r� rF r] )r@ r� r� r) r) r* r� ! s
z)getPhases.<locals>.InBodyPhase.endTagBodyc S s" | j jd�r | jtd�� |S d S )Nr� )r< r� r� r )r@ r� r) r) r* r� 3 s z)getPhases.<locals>.InBodyPhase.endTagHtmlc S s� |d dkr| j | _| jj|d �}|r2| jj� | jjd j|d kr^| jjdd|d i� |r�| jjj � }x |j|d kr�| jjj � }qpW d S )Nr> rN r zend-tag-too-earlyry )
r{ r� r< r� r� r{ r> rI r| r) )r@ r� ZinScoper� r) r) r* r� 9 s
z*getPhases.<locals>.InBodyPhase.endTagBlockc S sx | j j}d | j _|d ks&| j j|� r:| jjdddi� n:| j j� | j jd |krf| jjdddi� | j jj|� d S )Nzunexpected-end-tagr> rP r zend-tag-too-early-ignoredry )r< r� r� rI r| r� r{ r7 )r@ r� r� r) r) r* r� G s
z)getPhases.<locals>.InBodyPhase.endTagFormc S s� |d dkrd}nd }| j j|d |d�sB| jjdd|d i� nj| j j|d d� | j jd j|d kr�| jjdd|d i� | j jj� }x |j|d kr�| j jj� }q�W d S )
Nr> rQ �list)r� zunexpected-end-tag)�excluder zend-tag-too-earlyry )r< r� rI r| r� r{ r> r) )r@ r� r� r� r) r) r* r� T s z-getPhases.<locals>.InBodyPhase.endTagListItemc S s� x$t D ] }| jj|�r| jj� P qW | jjd j|d krR| jjdd|d i� xBt D ]:}| jj|�rX| jjj� }x|jt kr�| jjj� }qvW P qXW d S )Nr r> zend-tag-too-earlyry ) r r< r� r� r{ r> rI r| r) )r@ r� �itemr) r) r* r� e s
z,getPhases.<locals>.InBodyPhase.endTagHeadingc S s" d}�x|dk �r |d7 }| j j|d �}| sL|| j jkrZ| j j|j� rZ| j|� dS || j jkr�| jjdd|d i� | j jj |� dS | j j|j�s�| jjdd|d i� dS || j jd kr�| jjdd|d i� | j jj
|�}d}x,| j j|d� D ]}|j t k�r |}P �q W |dk�rb| j jj
� }x ||k�rN| j jj
� }�q4W | j jj |� dS | j j|d }| j jj
|�}| } }
d} | j jj
|
�} x�| d k �rh| d7 } | d8 } | j j| }
|
| j jk�r�| j jj |
� �q�|
|k�r�P | |k�r
| j jj
|
�d }|
j� }
|
| j j| j jj
|
�< |
| j j| j jj
|
�< |
}
| j�rV| jj| � |
j| � |
} �q�W | j�r~| jj| � |jtd�k�r�| j j� \}}|j| |� n
|j| � |j� }
|j|
� |j|
� | j jj |� | j jj||
� | j jj |� | j jj| j jj
|�d |
� qW dS )z)The much-feared adoption agency algorithmr � r r> Nzadoption-agency-1.2zadoption-agency-4.4zadoption-agency-1.3r� r� r� r� r� r� ry )r� r� r� r� r� )r< r� r{ r� r> r rI r| r� r7 �indexr� r r) Z cloneNoder� r� Z appendChildr� Z getTableMisnestedNodePosition� insertBeforeZreparentChildren�insert)r@ r� ZouterLoopCounterZformattingElementZafeIndexZ
furthestBlockrk ZcommonAncestorZbookmarkZlastNoder� ZinnerLoopCounterr� Zcloner� r� r) r) r* r� t s�
z/getPhases.<locals>.InBodyPhase.endTagFormattingc S s� | j j|d �r| j j� | j jd j|d krF| jjdd|d i� | j j|d �r�| j jj� }x |j|d kr�| j jj� }qdW | j j� d S )Nr> r zend-tag-too-earlyry ) r< r� r� r{ r> rI r| r) � clearActiveFormattingElements)r@ r� rk r) r) r* r� s
z8getPhases.<locals>.InBodyPhase.endTagAppletMarqueeObjectc S s@ | j jdddd�� | jj� | jjtdd�� | jjj� d S )Nz unexpected-end-tag-treated-asr z
br element)r� r� ro )rI r| r< r� r� r r{ r) )r@ r� r) r) r* r2 # s
z'getPhases.<locals>.InBodyPhase.endTagBrc S s� x�| j jd d d� D ]�}|j|d kr~| j j|d d� | j jd j|d krd| jjdd|d i� x| j jj� |krxqfW P q|jtkr| jjdd|d i� P qW d S )Nr r> )r� zunexpected-end-tagry ry ) r< r{ r> r� rI r| r) r� r )r@ r� r� r) r) r* r * s
z*getPhases.<locals>.InBodyPhase.endTagOtherN)6r7 r8 r9 rH r� r� r� r� r� r{ r| r4 r5 r} r r� r� r� r~ r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r# r� r� r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r2 r r) )r� r) r* � InBodyPhasee sh G
$ r� c s@ e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
S )z getPhases.<locals>.TextPhasec sF � j | ||� tjg �| _| j| j_tjd| jfg�| _| j| j_d S )Nr ) rH r r r� r r � endTagScriptr� r )r@ rI r< )r� r) r* rH 9 s
z%getPhases.<locals>.TextPhase.__init__c S s | j j|d � d S )Nrs )r< r� )r@ r� r) r) r* r� A s z.getPhases.<locals>.TextPhase.processCharactersc S s8 | j jdd| jjd ji� | jjj� | j j| j _dS )Nz&expected-named-closing-tag-but-got-eofr> r Try )rI r| r< r{ r> r) r� r] )r@ r) r) r* r� D s
z'getPhases.<locals>.TextPhase.processEOFc S s d S )Nr) )r@ r� r) r) r* r K s z*getPhases.<locals>.TextPhase.startTagOtherc S s | j jj� }| jj| j_d S )N)r< r{ r) rI r� r] )r@ r� r� r) r) r* r� N s z)getPhases.<locals>.TextPhase.endTagScriptc S s | j jj� | jj| j_d S )N)r< r{ r) rI r� r] )r@ r� r) r) r* r U s z(getPhases.<locals>.TextPhase.endTagOtherN) r7 r8 r9 rH r� r� r r� r r) )r� r) r* � TextPhase8 s r� c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'S )(z getPhases.<locals>.InTablePhasec
s� � j | ||� tjd| jfd| jfd| jfd| jfd| jfd| jfd | j fd| j
fd| j fd| j fg
�| _
| j| j
_tjd | jfd| jfg�| _| j| j_d S )Nr� r� r� rx r� r� r� r� r� r� r� r r rn rP r� )r� r� r� )r� r� r� )r r ) r� r� rx r� r� r� r� r� r� r� r� )rH r r r� �startTagCaption�startTagColgroup� startTagCol�startTagRowGroup�startTagImplyTbodyr� �startTagStyleScriptr� r� r� r r � endTagTable� endTagIgnorer� r )r@ rI r< )r� r) r* rH [ s$
z(getPhases.<locals>.InTablePhase.__init__c S s( x"| j jd jdkr"| j jj� qW d S )Nr r� r� ry )r� r� )r< r{ r> r) )r@ r) r) r* �clearStackToTableContexts s z8getPhases.<locals>.InTablePhase.clearStackToTableContextc S s$ | j jd jdkr | jjd� n d S )Nr r� z eof-in-tablery )r< r{ r> rI r| )r@ r) r) r* r� | s z*getPhases.<locals>.InTablePhase.processEOFc S s4 | j j}| j jd | j _|| j j_| j jj|� d S )N� inTableText)rI r] rF r� r� )r@ r� r� r) r) r* r� � s
z6getPhases.<locals>.InTablePhase.processSpaceCharactersc S s4 | j j}| j jd | j _|| j j_| j jj|� d S )Nr� )rI r] rF r� r� )r@ r� r� r) r) r* r� � s
z1getPhases.<locals>.InTablePhase.processCharactersc S s& d| j _| jjd j|� d| j _d S )NTr� F)r< �insertFromTablerI rF r� )r@ r� r) r) r* r� � s z*getPhases.<locals>.InTablePhase.insertTextc S s6 | j � | jjjt� | jj|� | jjd | j_d S )Nr� ) r� r< r� r� r
r� rI rF r] )r@ r� r) r) r* r� � s z/getPhases.<locals>.InTablePhase.startTagCaptionc S s( | j � | jj|� | jjd | j_d S )Nr� )r� r< r� rI rF r] )r@ r� r) r) r* r� � s z0getPhases.<locals>.InTablePhase.startTagColgroupc S s | j tdd�� |S )Nr� ro )r� r )r@ r� r) r) r* r� � s z+getPhases.<locals>.InTablePhase.startTagColc S s( | j � | jj|� | jjd | j_d S )Nr� )r� r< r� rI rF r] )r@ r� r) r) r* r� � s z0getPhases.<locals>.InTablePhase.startTagRowGroupc S s | j tdd�� |S )Nr� ro )r� r )r@ r� r) r) r* r� � s z2getPhases.<locals>.InTablePhase.startTagImplyTbodyc S s6 | j jdddd�� | j jjtd�� | j js2|S d S )Nz$unexpected-start-tag-implies-end-tagr� )r� r� )rI r| r] r� r rP )r@ r� r) r) r* r� � s
z-getPhases.<locals>.InTablePhase.startTagTablec S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r� � s z3getPhases.<locals>.InTablePhase.startTagStyleScriptc S sV d|d krH|d d j t�dkrH| jjd� | jj|� | jjj� n
| j|� d S )Nr2 rs r� z unexpected-hidden-input-in-table) rj r rI r| r< r� r{ r) r )r@ r� r) r) r* r� � s z-getPhases.<locals>.InTablePhase.startTagInputc S sD | j jd� | jjd kr@| jj|� | jjd | j_| jjj� d S )Nzunexpected-form-in-tabler ry )rI r| r< r� r� r{ r) )r@ r� r) r) r* r� � s
z,getPhases.<locals>.InTablePhase.startTagFormc S s< | j jdd|d i� d| j_| j jd j|� d| j_d S )Nz)unexpected-start-tag-implies-table-voodoor> Tr� F)rI r| r< r� rF r� )r@ r� r) r) r* r � s z-getPhases.<locals>.InTablePhase.startTagOtherc S s� | j jddd�r�| j j� | j jd jdkrJ| jjdd| j jd jd�� x"| j jd jdkrl| j jj� qLW | j jj� | jj� n
| jj� d S ) Nr� )r� r zend-tag-too-early-named)r� r� ry ry ry ) r< r� r� r{ r> rI r| r) r_ )r@ r� r) r) r* r� � s
z+getPhases.<locals>.InTablePhase.endTagTablec S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r� � s z,getPhases.<locals>.InTablePhase.endTagIgnorec S s< | j jdd|d i� d| j_| j jd j|� d| j_d S )Nz'unexpected-end-tag-implies-table-voodoor> Tr� F)rI r| r< r� rF r� )r@ r� r) r) r* r � s z+getPhases.<locals>.InTablePhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r r) )r� r) r* � InTablePhaseY s&
r� c sP e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z#getPhases.<locals>.InTableTextPhasec s � j | ||� d | _g | _d S )N)rH r� �characterTokens)r@ rI r< )r� r) r* rH � s z,getPhases.<locals>.InTableTextPhase.__init__c S sd dj dd� | jD ��}tdd� |D ��rJtd |d�}| jjd j|� n|rZ| jj|� g | _d S )Nr� c S s g | ] }|d �qS )rs r) )r= r� r) r) r* rA � s zGgetPhases.<locals>.InTableTextPhase.flushCharacters.<locals>.<listcomp>c S s g | ] }|t k�qS r) )r )r= r� r) r) r* rA � s rn )r2 rs r� )�joinr� r� r rI rF r� r< )r@ rs r� r) r) r* �flushCharacters� s z3getPhases.<locals>.InTableTextPhase.flushCharactersc S s | j � | j| j_|S )N)r� r� rI r] )r@ r� r) r) r* r� � s
z2getPhases.<locals>.InTableTextPhase.processCommentc S s | j � | j| j_dS )NT)r� r� rI r] )r@ r) r) r* r� � s
z.getPhases.<locals>.InTableTextPhase.processEOFc S s |d dkrd S | j j|� d S )Nrs r� )r� r� )r@ r� r) r) r* r� s z5getPhases.<locals>.InTableTextPhase.processCharactersc S s | j j|� d S )N)r� r� )r@ r� r) r) r* r� s z:getPhases.<locals>.InTableTextPhase.processSpaceCharactersc S s | j � | j| j_|S )N)r� r� rI r] )r@ r� r) r) r* r�
s
z3getPhases.<locals>.InTableTextPhase.processStartTagc S s | j � | j| j_|S )N)r� r� rI r] )r@ r� r) r) r* r� s
z1getPhases.<locals>.InTableTextPhase.processEndTagN) r7 r8 r9 rH r� r� r� r� r� r� r� r) )r� r) r* �InTableTextPhase� s r� c s` e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dS )z!getPhases.<locals>.InCaptionPhasec
sf � j | ||� tjd| jfd
| jfg�| _| j| j_tjd| jfd | j fd| j
fg�| _ | j | j _d S )Nr� r� rx r� r� r� r� r� r� r� r� r� ) r� rx r� r� r� r� r� r� r� )
r� rx r� r� r� r� r� r� r� r� )
rH r r r� �startTagTableElementr� r r �
endTagCaptionr� r� r� r )r@ rI r< )r� r) r* rH s
z*getPhases.<locals>.InCaptionPhase.__init__c S s | j jddd� S )Nr� r� )r� )r< r� )r@ r) r) r* �ignoreEndTagCaption+ s z5getPhases.<locals>.InCaptionPhase.ignoreEndTagCaptionc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� . s z,getPhases.<locals>.InCaptionPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� 1 s z3getPhases.<locals>.InCaptionPhase.processCharactersc S s0 | j j� | j� }| j jjtd�� |s,|S d S )Nr� )rI r| r� r] r� r )r@ r� � ignoreEndTagr) r) r* r� 4 s
z6getPhases.<locals>.InCaptionPhase.startTagTableElementc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r < s z/getPhases.<locals>.InCaptionPhase.startTagOtherc S s� | j � s�| jj� | jjd jdkrB| jjdd| jjd jd�� x"| jjd jdkrd| jjj� qDW | jjj� | jj� | jj d | j_
n
| jj� d S ) Nr r� z$expected-one-end-tag-but-got-another)r� r� r� ry ry ry ) r� r< r� r{ r> rI r| r) r� rF r] )r@ r� r) r) r* r� ? s
z/getPhases.<locals>.InCaptionPhase.endTagCaptionc S s0 | j j� | j� }| j jjtd�� |s,|S d S )Nr� )rI r| r� r] r� r )r@ r� r� r) r) r* r� Q s
z-getPhases.<locals>.InCaptionPhase.endTagTablec S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r� X s z.getPhases.<locals>.InCaptionPhase.endTagIgnorec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r [ s z-getPhases.<locals>.InCaptionPhase.endTagOtherN)
r7 r8 r9 rH r� r� r� r� r r� r� r� r r) )r� r) r* �InCaptionPhase s r� c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z%getPhases.<locals>.InColumnGroupPhasec s^ � j | ||� tjd| jfd| jfg�| _| j| j_tjd| jfd| j fg�| _
| j | j
_d S )Nr� rx r� ) rH r r r� r� r� r r �endTagColgroup� endTagColr� r )r@ rI r< )r� r) r* rH a s
z.getPhases.<locals>.InColumnGroupPhase.__init__c S s | j jd jdkS )Nr r� ry )r< r{ r> )r@ r) r) r* �ignoreEndTagColgroupp s z:getPhases.<locals>.InColumnGroupPhase.ignoreEndTagColgroupc S s8 | j jd jdkrd S | j� }| jtd�� |s4dS d S )Nr r� r� Try )r< r{ r> r� r� r )r@ r� r) r) r* r� s s z0getPhases.<locals>.InColumnGroupPhase.processEOFc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r )r@ r� r� r) r) r* r� } s z7getPhases.<locals>.InColumnGroupPhase.processCharactersc S s$ | j j|� | j jj� d|d< d S )NTrx )r< r� r{ r) )r@ r� r) r) r* r� � s z1getPhases.<locals>.InColumnGroupPhase.startTagColc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r )r@ r� r� r) r) r* r � s z3getPhases.<locals>.InColumnGroupPhase.startTagOtherc S s4 | j � r| jj� n | jjj� | jjd | j_d S )Nr� )r� rI r| r< r{ r) rF r] )r@ r� r) r) r* r� � s z4getPhases.<locals>.InColumnGroupPhase.endTagColgroupc S s | j jdddi� d S )Nz
no-end-tagr> rx )rI r| )r@ r� r) r) r* r� � s z/getPhases.<locals>.InColumnGroupPhase.endTagColc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r )r@ r� r� r) r) r* r � s z1getPhases.<locals>.InColumnGroupPhase.endTagOtherN) r7 r8 r9 rH r� r� r� r� r r� r� r r) )r� r) r* �InColumnGroupPhase^ s
r� c sx e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) z#getPhases.<locals>.InTableBodyPhasec sv � j | ||� tjd| jfd| jfd
| jfd| jfg�| _| j| j_ tjd| j
fd | j fd| j fg�| _
| j| j
_ d S )Nr� r� r� r� r� rx r� r� r� r� r� r� )r� r� )r� rx r� r� r� r� )r� r� r� )r� r� rx r� r� r� r� r� )rH r r r� �
startTagTr�startTagTableCell�startTagTableOtherr� r r �endTagTableRowGroupr� r� r� r )r@ rI r< )r� r) r* rH � s
z,getPhases.<locals>.InTableBodyPhase.__init__c S s: x"| j jd jdkr"| j jj� qW | j jd jdkr6d S ) Nr r� r� r� r� ry )r� r� r� r� ry )r< r{ r> r) )r@ r) r) r* � clearStackToTableBodyContext� s
z@getPhases.<locals>.InTableBodyPhase.clearStackToTableBodyContextc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� � s z.getPhases.<locals>.InTableBodyPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z:getPhases.<locals>.InTableBodyPhase.processSpaceCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z5getPhases.<locals>.InTableBodyPhase.processCharactersc S s( | j � | jj|� | jjd | j_d S )Nr� )r� r< r� rI rF r] )r@ r� r) r) r* r� � s z.getPhases.<locals>.InTableBodyPhase.startTagTrc S s* | j jdd|d i� | jtdd�� |S )Nz unexpected-cell-in-table-bodyr> r� ro )rI r| r� r )r@ r� r) r) r* r� � s z5getPhases.<locals>.InTableBodyPhase.startTagTableCellc S sb | j jddd�s0| j jddd�s0| j jddd�rT| j� | jt| j jd j�� |S | jj� d S )Nr� r� )r� r� r� r ry ) r< r� r� r� r r{ r> rI r| )r@ r� r) r) r* r� � s z6getPhases.<locals>.InTableBodyPhase.startTagTableOtherc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z1getPhases.<locals>.InTableBodyPhase.startTagOtherc S sT | j j|d dd�r:| j� | j jj� | jjd | j_n| jjdd|d i� d S )Nr> r� )r� r� z unexpected-end-tag-in-table-body) r< r� r� r{ r) rI rF r] r| )r@ r� r) r) r* r� � s z7getPhases.<locals>.InTableBodyPhase.endTagTableRowGroupc S sb | j jddd�s0| j jddd�s0| j jddd�rT| j� | jt| j jd j�� |S | jj� d S )Nr� r� )r� r� r� r ry ) r< r� r� r� r r{ r> rI r| )r@ r� r) r) r* r� � s z/getPhases.<locals>.InTableBodyPhase.endTagTablec S s | j jdd|d i� d S )Nz unexpected-end-tag-in-table-bodyr> )rI r| )r@ r� r) r) r* r� � s z0getPhases.<locals>.InTableBodyPhase.endTagIgnorec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z/getPhases.<locals>.InTableBodyPhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r� r r� r� r� r r) )r� r) r* �InTableBodyPhase� s
r� c s� e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� Zdd � Zd S ) z getPhases.<locals>.InRowPhasec sv � j | ||� tjd| jfd
| jfd| jfg�| _| j| j_tjd
| j fd | j
fd| j fd| j fg�| _
| j| j
_d S )Nr� r� r� r� rx r� r� r� r� r� r� r� )r� r� )r� rx r� r� r� r� r� )r� r� r� )r� r� rx r� r� r� r� )rH r r r� r� r� r� r r �endTagTrr� r� r� r� r )r@ rI r< )r� r) r* rH s
z&getPhases.<locals>.InRowPhase.__init__c S sD x>| j jd jdkr>| jjdd| j jd ji� | j jj� qW d S ) Nr r� r� z'unexpected-implied-end-tag-in-table-rowr> ry )r� r� ry )r< r{ r> rI r| r) )r@ r) r) r* �clearStackToTableRowContext s z9getPhases.<locals>.InRowPhase.clearStackToTableRowContextc S s | j jddd� S )Nr� r� )r� )r< r� )r@ r) r) r* �ignoreEndTagTr s z,getPhases.<locals>.InRowPhase.ignoreEndTagTrc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� " s z(getPhases.<locals>.InRowPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� % s z4getPhases.<locals>.InRowPhase.processSpaceCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� ( s z/getPhases.<locals>.InRowPhase.processCharactersc S s6 | j � | jj|� | jjd | j_| jjjt� d S )Nr� ) r� r< r� rI rF r] r� r� r
)r@ r� r) r) r* r� + s z/getPhases.<locals>.InRowPhase.startTagTableCellc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r )r@ r� r� r) r) r* r� 1 s z0getPhases.<locals>.InRowPhase.startTagTableOtherc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r 8 s z+getPhases.<locals>.InRowPhase.startTagOtherc S s< | j � s.| j� | jjj� | jjd | j_n
| jj� d S )Nr� ) r� r� r< r{ r) rI rF r] r| )r@ r� r) r) r* r� ; s
z&getPhases.<locals>.InRowPhase.endTagTrc S s" | j � }| jtd�� |s |S d S )Nr� )r� r� r )r@ r� r� r) r) r* r� E s z)getPhases.<locals>.InRowPhase.endTagTablec S s4 | j j|d dd�r&| jtd�� |S | jj� d S )Nr> r� )r� r� )r< r� r� r rI r| )r@ r� r) r) r* r� M s z1getPhases.<locals>.InRowPhase.endTagTableRowGroupc S s | j jdd|d i� d S )Nz unexpected-end-tag-in-table-rowr> )rI r| )r@ r� r) r) r* r� T s z*getPhases.<locals>.InRowPhase.endTagIgnorec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r X s z)getPhases.<locals>.InRowPhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r� r r� r� r� r� r r) )r� r) r* �
InRowPhase s
r� c s` e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dS )z getPhases.<locals>.InCellPhasec sf � j | ||� tjd| jfd
| jfg�| _| j| j_tjd| jfd| j fd| j
fg�| _ | j | j _d S )Nr� r� rx r� r� r� r� r� r� r� r� r� ) r� rx r� r� r� r� r� r� r� )r� r� )r� r� rx r� r� )r� r� r� r� r� )
rH r r r� r� r� r r �endTagTableCellr� � endTagImplyr� r )r@ rI r< )r� r) r* rH ] s
z'getPhases.<locals>.InCellPhase.__init__c S sB | j jddd�r | jtd�� n | j jddd�r>| jtd�� d S )Nr� r� )r� r� )r< r� r� r )r@ r) r) r* � closeCelln s z(getPhases.<locals>.InCellPhase.closeCellc S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� u s z)getPhases.<locals>.InCellPhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� x s z0getPhases.<locals>.InCellPhase.processCharactersc S s: | j jddd�s | j jddd�r,| j� |S | jj� d S )Nr� r� )r� r� )r< r� r� rI r| )r@ r� r) r) r* r� { s
z1getPhases.<locals>.InCellPhase.startTagTableOtherc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z,getPhases.<locals>.InCellPhase.startTagOtherc S s� | j j|d dd�r�| j j|d � | j jd j|d krt| jjdd|d i� x.| j jj� }|j|d krRP qRW n | j jj� | j j� | jj d | j_
n| jjdd|d i� d S ) Nr> r� )r� r zunexpected-cell-end-tagr� zunexpected-end-tagry ) r< r� r� r{ r> rI r| r) r� rF r] )r@ r� r� r) r) r* r� � s
z.getPhases.<locals>.InCellPhase.endTagTableCellc S s | j jdd|d i� d S )Nzunexpected-end-tagr> )rI r| )r@ r� r) r) r* r� � s z+getPhases.<locals>.InCellPhase.endTagIgnorec S s. | j j|d dd�r | j� |S | jj� d S )Nr> r� )r� )r< r� r� rI r| )r@ r� r) r) r* r� � s z*getPhases.<locals>.InCellPhase.endTagImplyc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r � s z*getPhases.<locals>.InCellPhase.endTagOtherN)
r7 r8 r9 rH r� r� r� r� r r� r� r� r r) )r� r) r* � InCellPhase[ s
r� c sx e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zdd� ZdS ) z getPhases.<locals>.InSelectPhasec s� � j | ||� tjd| jfd| jfd| jfd| jfd | jfd| jfg�| _ | j
| j _ tjd| j fd| j
fd| jfg�| _| j| j_ d S )
Nr� rv rw r� rn ri rr r )rn ri rr )rH r r r� �startTagOption�startTagOptgroupr� r� r$ r� r r � endTagOption�endTagOptgroup� endTagSelectr� r )r@ rI r< )r� r) r* rH � s
z)getPhases.<locals>.InSelectPhase.__init__c S s$ | j jd jdkr | jjd� n d S )Nr r� z
eof-in-selectry )r< r{ r> rI r| )r@ r) r) r* r� � s z+getPhases.<locals>.InSelectPhase.processEOFc S s$ |d dkrd S | j j|d � d S )Nrs r� )r< r� )r@ r� r) r) r* r� � s z2getPhases.<locals>.InSelectPhase.processCharactersc S s. | j jd jdkr | j jj� | j j|� d S )Nr rv ry )r< r{ r> r) r� )r@ r� r) r) r* r� � s z/getPhases.<locals>.InSelectPhase.startTagOptionc S sL | j jd jdkr | j jj� | j jd jdkr<| j jj� | j j|� d S )Nr rv rw ry ry )r< r{ r> r) r� )r@ r� r) r) r* r� � s
z1getPhases.<locals>.InSelectPhase.startTagOptgroupc S s | j jd� | jtd�� d S )Nzunexpected-select-in-selectr� )rI r| r� r )r@ r� r) r) r* r� � s z/getPhases.<locals>.InSelectPhase.startTagSelectc S s2 | j jd� | jjddd�r.| jtd�� |S d S )Nzunexpected-input-in-selectr� )r� )rI r| r< r� r� r )r@ r� r) r) r* r� � s
z.getPhases.<locals>.InSelectPhase.startTagInputc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r$ � s z/getPhases.<locals>.InSelectPhase.startTagScriptc S s | j jdd|d i� d S )Nz unexpected-start-tag-in-selectr> )rI r| )r@ r� r) r) r* r � s z.getPhases.<locals>.InSelectPhase.startTagOtherc S s6 | j jd jdkr | j jj� n| jjdddi� d S )Nr rv z unexpected-end-tag-in-selectr> ry )r< r{ r> r) rI r| )r@ r� r) r) r* r� � s z-getPhases.<locals>.InSelectPhase.endTagOptionc S sf | j jd jdkr0| j jd jdkr0| j jj� | j jd jdkrP| j jj� n| jjdddi� d S )
Nr rv r� rw z unexpected-end-tag-in-selectr> ry ���ry )r< r{ r> r) rI r| )r@ r� r) r) r* r� � s z/getPhases.<locals>.InSelectPhase.endTagOptgroupc S sR | j jddd�rD| j jj� }x|jdkr6| j jj� }q W | jj� n
| jj� d S )Nr� )r� )r< r� r{ r) r> rI r_ r| )r@ r� r� r) r) r* r� � s z-getPhases.<locals>.InSelectPhase.endTagSelectc S s | j jdd|d i� d S )Nz unexpected-end-tag-in-selectr> )rI r| )r@ r� r) r) r* r s z,getPhases.<locals>.InSelectPhase.endTagOtherN)r7 r8 r9 rH r� r� r� r� r� r� r$ r r� r� r� r r) )r� r) r* �
InSelectPhase� s
r� c sH e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )z'getPhases.<locals>.InSelectInTablePhasec sN � j | ||� tjd | jfg�| _| j| j_tjd
| jfg�| _| j | j_d S ) Nr� r� r� r� r� r� r� r� )r� r� r� r� r� r� r� r� )r� r� r� r� r� r� r� r� )
rH r r r� r� r r r� r� r )r@ rI r< )r� r) r* rH s
z0getPhases.<locals>.InSelectInTablePhase.__init__c S s | j jd j� d S )Nr� )rI rF r� )r@ r) r) r* r� s z2getPhases.<locals>.InSelectInTablePhase.processEOFc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� s z9getPhases.<locals>.InSelectInTablePhase.processCharactersc S s( | j jdd|d i� | jtd�� |S )Nz5unexpected-table-element-start-tag-in-select-in-tabler> r� )rI r| r r )r@ r� r) r) r* r� ! s z5getPhases.<locals>.InSelectInTablePhase.startTagTablec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r & s z5getPhases.<locals>.InSelectInTablePhase.startTagOtherc S s@ | j jdd|d i� | jj|d dd�r<| jtd�� |S d S )Nz3unexpected-table-element-end-tag-in-select-in-tabler> r� )r� r� )rI r| r< r� r r )r@ r� r) r) r* r� ) s z3getPhases.<locals>.InSelectInTablePhase.endTagTablec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r / s z3getPhases.<locals>.InSelectInTablePhase.endTagOtherN)
r7 r8 r9 rH r� r� r� r r� r r) )r� r) r* �InSelectInTablePhase s r� c - s� e Zd Zeddddddddd d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,g,�Z� fd-d.�Zd/d0� Z� fd1d2�Zd3d4� Zd5d6� Z d7S )8z(getPhases.<locals>.InForeignContentPhaserU rV r< r� r r= rW rR r+ r@ rS rX rg Zh1Zh2Zh3Zh4Zh5Zh6r� ro rZ rh rQ rO rH r4 ra rJ r( rN r� r[ r\ �spanr^ r] �subZsupr� r_ r` rM �varc s � j | ||� d S )N)rH )r@ rI r< )r� r) r* rH < s z1getPhases.<locals>.InForeignContentPhase.__init__c % S sn ddddddddd d
d d d
ddddddddddddddd d d d d d!d"d#d$d%�$}|d& |krj||d& |d&< d S )'NZaltGlyphZ altGlyphDefZ altGlyphItemZ animateColorZ
animateMotionZanimateTransformZclipPathZfeBlendZ
feColorMatrixZfeComponentTransferZ feCompositeZfeConvolveMatrixZfeDiffuseLightingZfeDisplacementMapZfeDistantLightZfeFloodZfeFuncAZfeFuncBZfeFuncGZfeFuncRZfeGaussianBlurZfeImageZfeMergeZ feMergeNodeZ feMorphologyZfeOffsetZ fePointLightZfeSpecularLightingZ feSpotLightZfeTileZ feTurbulenceZ
foreignObjectZglyphRefZlinearGradientZradialGradientZtextPath)$ZaltglyphZ altglyphdefZ altglyphitemZ animatecolorZ
animatemotionZanimatetransformZclippathZfeblendZ
fecolormatrixZfecomponenttransferZ fecompositeZfeconvolvematrixZfediffuselightingZfedisplacementmapZfedistantlightZfefloodZfefuncaZfefuncbZfefuncgZfefuncrZfegaussianblurZfeimageZfemergeZ femergenodeZ femorphologyZfeoffsetZ fepointlightZfespecularlightingZ fespotlightZfetileZ feturbulenceZ
foreignobjectZglyphrefZlineargradientZradialgradientZtextpathr> r) )r@ r� � replacementsr) r) r* �adjustSVGTagNames? sL z:getPhases.<locals>.InForeignContentPhase.adjustSVGTagNamesc sL |d dkrd|d< n&| j jr<tdd� |d D ��r<d| j _� j| |� d S )Nrs r� u �c s s | ]}|t kV qd S )N)r )r= r� r) r) r* r� l s zMgetPhases.<locals>.InForeignContentPhase.processCharacters.<locals>.<genexpr>F)rI r` r� r� )r@ r� )r� r) r* r� h s
z:getPhases.<locals>.InForeignContentPhase.processCharactersc S s6 | j jd }|d | jksD|d dkr�t|d j� �tdddg�@ r�| jjdd|d i� xR| j jd j| j jkr�| jj | j jd � r�| jj
| j jd � r�| j jj � q\W |S |jt d kr�| jj
|� n$|jt d
kr�| j|� | jj|� | jj|� |j|d < | j j|� |d �r2| j jj � d
|d< d S )Nr r> rY rs ZcolorZface�sizez*unexpected-html-element-in-foreign-contentrd ru rh rw Trx ry ry ry ry )r< r{ �breakoutElements�set�keysrI r| rh r rl rm r) r r r r r r� )r@ r� r� r) r) r* r� p s.
z8getPhases.<locals>.InForeignContentPhase.processStartTagc S s� t | jj�d }| jjd }|jjt�|d krF| jjdd|d i� x�|jjt�|d kr�| jj| jj d kr�| jjj
� | jjj | j_x| jjj � |kr�q�W d }P |d8 }| jj| }|j
| jjkr�qHqH| jjj|�}P qHW |S )Nr r> zunexpected-end-tagr� ry )r~ r< r{ r> rj r rI r| r] rF r� r� r) rh r r� )r@ r� Z nodeIndexr� r� r) r) r* r� � s( z6getPhases.<locals>.InForeignContentPhase.processEndTagN)
r7 r8 r9 r� r rH r r� r� r� r) )r� r) r* �InForeignContentPhase2 s
) r c sP e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z!getPhases.<locals>.AfterBodyPhasec sN � j | ||� tjd| jfg�| _| j| j_tjd| jfg�| _| j | j_d S )Nr� )
rH r r r� r� r r r� r� r )r@ rI r< )r� r) r* rH � s
z*getPhases.<locals>.AfterBodyPhase.__init__c S s d S )Nr) )r@ r) r) r* r� � s z,getPhases.<locals>.AfterBodyPhase.processEOFc S s | j j|| j jd � d S )Nr )r< r� r{ )r@ r� r) r) r* r� � s z0getPhases.<locals>.AfterBodyPhase.processCommentc S s | j jd� | j jd | j _|S )Nzunexpected-char-after-bodyr� )rI r| rF r] )r@ r� r) r) r* r� � s z3getPhases.<locals>.AfterBodyPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� � s z.getPhases.<locals>.AfterBodyPhase.startTagHtmlc S s* | j jdd|d i� | j jd | j _|S )Nz unexpected-start-tag-after-bodyr> r� )rI r| rF r] )r@ r� r) r) r* r � s z/getPhases.<locals>.AfterBodyPhase.startTagOtherc S s* | j jr| j jd� n| j jd | j _d S )Nz'unexpected-end-tag-after-body-innerhtml�afterAfterBody)rI rP r| rF r] )r@ r> r) r) r* r� � s z,getPhases.<locals>.AfterBodyPhase.endTagHtmlc S s* | j jdd|d i� | j jd | j _|S )Nz unexpected-end-tag-after-bodyr> r� )rI r| rF r] )r@ r� r) r) r* r � s z-getPhases.<locals>.AfterBodyPhase.endTagOtherN) r7 r8 r9 rH r� r� r� r� r r� r r) )r� r) r* �AfterBodyPhase� s r c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z"getPhases.<locals>.InFramesetPhasec sf � j | ||� tjd| jfd| jfd| jfd| jfg�| _| j| j_ tjd| j
fg�| _ | j | j _ d S )Nr� r� ry r )
rH r r r� r5 �
startTagFrame�startTagNoframesr� r r �endTagFramesetr� r )r@ rI r< )r� r) r* rH � s
z+getPhases.<locals>.InFramesetPhase.__init__c S s$ | j jd jdkr | jjd� n d S )Nr r� zeof-in-framesetry )r< r{ r> rI r| )r@ r) r) r* r� � s z-getPhases.<locals>.InFramesetPhase.processEOFc S s | j jd� d S )Nzunexpected-char-in-frameset)rI r| )r@ r� r) r) r* r� � s z4getPhases.<locals>.InFramesetPhase.processCharactersc S s | j j|� d S )N)r< r� )r@ r� r) r) r* r5 � s z3getPhases.<locals>.InFramesetPhase.startTagFramesetc S s | j j|� | j jj� d S )N)r< r� r{ r) )r@ r� r) r) r* r � s z0getPhases.<locals>.InFramesetPhase.startTagFramec S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r
� s z3getPhases.<locals>.InFramesetPhase.startTagNoframesc S s | j jdd|d i� d S )Nz unexpected-start-tag-in-framesetr> )rI r| )r@ r� r) r) r* r � s z0getPhases.<locals>.InFramesetPhase.startTagOtherc S s\ | j jd jdkr | jjd� n | j jj� | jj rX| j jd jdkrX| jjd | j_d S )Nr r� z)unexpected-frameset-in-frameset-innerhtmlr� �
afterFramesetry ry ) r< r{ r> rI r| r) rP rF r] )r@ r� r) r) r* r � s
z1getPhases.<locals>.InFramesetPhase.endTagFramesetc S s | j jdd|d i� d S )Nz unexpected-end-tag-in-framesetr> )rI r| )r@ r� r) r) r* r
s z.getPhases.<locals>.InFramesetPhase.endTagOtherN) r7 r8 r9 rH r� r� r5 r r
r r r r) )r� r) r* �InFramesetPhase� s r
c sH e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dS )z%getPhases.<locals>.AfterFramesetPhasec sV � j | ||� tjd| jfd| jfg�| _| j| j_tjd| jfg�| _ | j
| j _d S )Nr� r ) rH r r r� r
r� r r r� r� r )r@ rI r< )r� r) r* rH
s
z.getPhases.<locals>.AfterFramesetPhase.__init__c S s d S )Nr) )r@ r) r) r* r�
s z0getPhases.<locals>.AfterFramesetPhase.processEOFc S s | j jd� d S )Nz unexpected-char-after-frameset)rI r| )r@ r� r) r) r* r� !
s z7getPhases.<locals>.AfterFramesetPhase.processCharactersc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r
$
s z6getPhases.<locals>.AfterFramesetPhase.startTagNoframesc S s | j jdd|d i� d S )Nz#unexpected-start-tag-after-framesetr> )rI r| )r@ r� r) r) r* r '
s z3getPhases.<locals>.AfterFramesetPhase.startTagOtherc S s | j jd | j _d S )N�afterAfterFrameset)rI rF r] )r@ r� r) r) r* r� +
s z0getPhases.<locals>.AfterFramesetPhase.endTagHtmlc S s | j jdd|d i� d S )Nz!unexpected-end-tag-after-framesetr> )rI r| )r@ r� r) r) r* r .
s z1getPhases.<locals>.AfterFramesetPhase.endTagOtherN)
r7 r8 r9 rH r� r� r
r r� r r) )r� r) r* �AfterFramesetPhase
s r c sP e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dS )z&getPhases.<locals>.AfterAfterBodyPhasec s0 � j | ||� tjd| jfg�| _| j| j_d S )Nr� )rH r r r� r� r r )r@ rI r< )r� r) r* rH 3
s z/getPhases.<locals>.AfterAfterBodyPhase.__init__c S s d S )Nr) )r@ r) r) r* r� ;
s z1getPhases.<locals>.AfterAfterBodyPhase.processEOFc S s | j j|| j j� d S )N)r< r� r� )r@ r� r) r) r* r� >
s z5getPhases.<locals>.AfterAfterBodyPhase.processCommentc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� A
s z=getPhases.<locals>.AfterAfterBodyPhase.processSpaceCharactersc S s | j jd� | j jd | j _|S )Nzexpected-eof-but-got-charr� )rI r| rF r] )r@ r� r) r) r* r� D
s z8getPhases.<locals>.AfterAfterBodyPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� I
s z3getPhases.<locals>.AfterAfterBodyPhase.startTagHtmlc S s* | j jdd|d i� | j jd | j _|S )Nz expected-eof-but-got-start-tagr> r� )rI r| rF r] )r@ r� r) r) r* r L
s z4getPhases.<locals>.AfterAfterBodyPhase.startTagOtherc S s* | j jdd|d i� | j jd | j _|S )Nz expected-eof-but-got-end-tagr> r� )rI r| rF r] )r@ r� r) r) r* r� R
s z4getPhases.<locals>.AfterAfterBodyPhase.processEndTagN) r7 r8 r9 rH r� r� r� r� r� r r� r) )r� r) r* �AfterAfterBodyPhase2
s r c sX e Zd Z� fdd�Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dS )z*getPhases.<locals>.AfterAfterFramesetPhasec s8 � j | ||� tjd| jfd| jfg�| _| j| j_d S )Nr� r )rH r r r� �startTagNoFramesr� r r )r@ rI r< )r� r) r* rH Y
s
z3getPhases.<locals>.AfterAfterFramesetPhase.__init__c S s d S )Nr) )r@ r) r) r* r� b
s z5getPhases.<locals>.AfterAfterFramesetPhase.processEOFc S s | j j|| j j� d S )N)r< r� r� )r@ r� r) r) r* r� e
s z9getPhases.<locals>.AfterAfterFramesetPhase.processCommentc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� h
s zAgetPhases.<locals>.AfterAfterFramesetPhase.processSpaceCharactersc S s | j jd� d S )Nzexpected-eof-but-got-char)rI r| )r@ r� r) r) r* r� k
s z<getPhases.<locals>.AfterAfterFramesetPhase.processCharactersc S s | j jd j|�S )Nr� )rI rF r� )r@ r� r) r) r* r� n
s z7getPhases.<locals>.AfterAfterFramesetPhase.startTagHtmlc S s | j jd j|�S )Nr )rI rF r� )r@ r� r) r) r* r q
s z;getPhases.<locals>.AfterAfterFramesetPhase.startTagNoFramesc S s | j jdd|d i� d S )Nz expected-eof-but-got-start-tagr> )rI r| )r@ r� r) r) r* r t
s z8getPhases.<locals>.AfterAfterFramesetPhase.startTagOtherc S s | j jdd|d i� d S )Nz expected-eof-but-got-end-tagr> )rI r| )r@ r� r) r) r* r� x
s z8getPhases.<locals>.AfterAfterFramesetPhase.processEndTagN) r7 r8 r9 rH r� r� r� r� r� r r r� r) )r� r) r* �AfterAfterFramesetPhaseX
s r )rT rS r� r r- r. r� r� r� r� r� r� r� r� r� r� r� rv r� r� r r r )r )rG rV r� r
r
r r/ r3 r8 r� r� r� r� r� r� r� r� r� r� r� r r r
r r r r) )r� r* rE _ sp ) #.g@C X! -GBbYLd's/9%&&rE c s^ t s
tjr t| d �t� �@ }nt| d �t� �@ }|rZt� fdd�| d j� D ��| d< d S )Nrs c 3 s" | ]\}}� j ||�|fV qd S )N)r} )r= �k�v)r r) r* r� �
s z$adjust_attributes.<locals>.<genexpr>)r r ZPY27r r� r r. )r� r Zneeds_adjustmentr) )r r* r� �
s
r� rp Fc C s |d kr i }t | | ||d�S )N)r2 r> rs rw )r )r> r2 ri rw r) r) r* r �
s
r c @ s e Zd ZdZdS )rr zError in parsed documentN)r7 r8 r9 r� r) r) r) r* rr �
s rr )r T)r+ r T)rp NF)1Z
__future__r r r Zpip._vendor.sixr r r r0 � collectionsr � ImportErrorZpip._vendor.ordereddictr� r
r r Ztreebuilders.baser
r Z constantsr r r r r r r r r r r r r� r r r r r# r- r; re r" ZmemoizerE r� r � Exceptionrr r) r) r) r* �<module> sR H
) L
pip/_vendor/html5lib/__pycache__/_utils.cpython-36.opt-1.pyc 0000644 00000006234 14751155150 0017615 0 ustar 00 3
���e � @ s� d dl mZmZmZ d dlZd dlmZ d dlmZ yd dl j
j Z W n e
k
rd d dlj
jZ Y nX ddddd d
d gZejd d ko�ejd
dkZy ed�Zeee�s�ed�ZW n dZY nX dZG dd� de�Zdd� Zdd� Zdd � Zdd� Z dS )� )�absolute_import�division�unicode_literalsN)�
ModuleType)� text_type�
default_etree�MethodDispatcher�isSurrogatePair�surrogatePairToCodepoint�moduleFactoryFactory�supports_lone_surrogates�PY27� � � z"\uD800"z u"\uD800"FTc @ s$ e Zd ZdZf fdd�Zdd� ZdS )r ap Dict with 2 special properties:
On initiation, keys that are lists, sets or tuples are converted to
multiple keys so accessing any one of the items in the original
list-like object returns the matching value
md = MethodDispatcher({("foo", "bar"):"baz"})
md["foo"] == "baz"
A default value which can be set through the default attribute.
c C sj g }xN|D ]F\}}t |ttttf�rBx*|D ]}|j||f� q*W q
|j||f� q
W tj| |� d | _d S )N) �
isinstance�list�tuple� frozenset�set�append�dict�__init__�default)�self�itemsZ _dictEntries�name�value�item� r � /usr/lib/python3.6/_utils.pyr 4 s
zMethodDispatcher.__init__c C s t j| || j�S )N)r �getr )r �keyr r r � __getitem__C s z MethodDispatcher.__getitem__N)�__name__�
__module__� __qualname__�__doc__r r# r r r r r ' s c C sL t | �dkoJt| d �dkoJt| d �dkoJt| d �dkoJt| d �dkS )Nr r i � i�� r i � i�� )�len�ord)�datar r r r J s c C s, dt | d �d d t | d �d }|S )Ni r i � i r i � )r) )r* Zchar_valr r r r
P s c s i �� �fdd�}|S )Nc s� t tjtd��r d| j }n
d| j }t|j� �}y�| | | S tk
r� t|�}� | f|�|�}|jj|� d�kr�i �|< d�| kr�i �| |< d�| | kr�i �| | |< |�| | |< |S X d S )N� z _%s_factorys _%s_factoryr �args�kwargs) r r r$ �typer r �KeyError�__dict__�update)Z
baseModuler, r- r Z kwargs_tuple�modZobjs)�factory� moduleCacher r �
moduleFactory\ s$
z+moduleFactoryFactory.<locals>.moduleFactoryr )r3 r5 r )r3 r4 r r Y s c s i � � �fdd�}|S )Nc s2 t | �t |j� �f}|� kr*�| |�� |< � | S )N)r r )r, r- r" )�cache�funcr r �wrappedy s zmemoize.<locals>.wrappedr )r7 r8 r )r6 r7 r �memoizev s r9 ) Z
__future__r r r �sys�typesr Zpip._vendor.sixr Zxml.etree.cElementTreeZetreeZ cElementTreer � ImportErrorZxml.etree.ElementTreeZ ElementTree�__all__� version_infor
�evalZ_xr r r r r r
r r9 r r r r �<module> s0
# pip/_vendor/html5lib/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000001563 14751155150 0020055 0 ustar 00 3
���e � @ sh d Z ddlmZmZmZ ddlmZmZmZ ddl m
Z
ddl m Z ddl
mZ dd d
d d d
gZdZdS )aM
HTML parsing library based on the WHATWG "HTML5"
specification. The parser is designed to be compatible with existing
HTML found in the wild and implements well-defined error recovery that
is largely compatible with modern desktop web browsers.
Example usage:
import html5lib
f = open("my_document.html")
tree = html5lib.parse(f)
� )�absolute_import�division�unicode_literals� )�
HTMLParser�parse�
parseFragment)�getTreeBuilder)�
getTreeWalker)� serializer r r r r
r z1.0b10N)�__doc__Z
__future__r r r Z html5parserr r r Z treebuildersr Z treewalkersr
Z
serializerr �__all__� __version__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/constants.py 0000644 00000242673 14751155150 0013120 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
import string
EOF = None
E = {
"null-character":
"Null character in input stream, replaced with U+FFFD.",
"invalid-codepoint":
"Invalid codepoint in stream.",
"incorrectly-placed-solidus":
"Solidus (/) incorrectly placed in tag.",
"incorrect-cr-newline-entity":
"Incorrect CR newline entity, replaced with LF.",
"illegal-windows-1252-entity":
"Entity used with illegal number (windows-1252 reference).",
"cant-convert-numeric-entity":
"Numeric entity couldn't be converted to character "
"(codepoint U+%(charAsInt)08x).",
"illegal-codepoint-for-numeric-entity":
"Numeric entity represents an illegal codepoint: "
"U+%(charAsInt)08x.",
"numeric-entity-without-semicolon":
"Numeric entity didn't end with ';'.",
"expected-numeric-entity-but-got-eof":
"Numeric entity expected. Got end of file instead.",
"expected-numeric-entity":
"Numeric entity expected but none found.",
"named-entity-without-semicolon":
"Named entity didn't end with ';'.",
"expected-named-entity":
"Named entity expected. Got none.",
"attributes-in-end-tag":
"End tag contains unexpected attributes.",
'self-closing-flag-on-end-tag':
"End tag contains unexpected self-closing flag.",
"expected-tag-name-but-got-right-bracket":
"Expected tag name. Got '>' instead.",
"expected-tag-name-but-got-question-mark":
"Expected tag name. Got '?' instead. (HTML doesn't "
"support processing instructions.)",
"expected-tag-name":
"Expected tag name. Got something else instead",
"expected-closing-tag-but-got-right-bracket":
"Expected closing tag. Got '>' instead. Ignoring '</>'.",
"expected-closing-tag-but-got-eof":
"Expected closing tag. Unexpected end of file.",
"expected-closing-tag-but-got-char":
"Expected closing tag. Unexpected character '%(data)s' found.",
"eof-in-tag-name":
"Unexpected end of file in the tag name.",
"expected-attribute-name-but-got-eof":
"Unexpected end of file. Expected attribute name instead.",
"eof-in-attribute-name":
"Unexpected end of file in attribute name.",
"invalid-character-in-attribute-name":
"Invalid character in attribute name",
"duplicate-attribute":
"Dropped duplicate attribute on tag.",
"expected-end-of-tag-name-but-got-eof":
"Unexpected end of file. Expected = or end of tag.",
"expected-attribute-value-but-got-eof":
"Unexpected end of file. Expected attribute value.",
"expected-attribute-value-but-got-right-bracket":
"Expected attribute value. Got '>' instead.",
'equals-in-unquoted-attribute-value':
"Unexpected = in unquoted attribute",
'unexpected-character-in-unquoted-attribute-value':
"Unexpected character in unquoted attribute",
"invalid-character-after-attribute-name":
"Unexpected character after attribute name.",
"unexpected-character-after-attribute-value":
"Unexpected character after attribute value.",
"eof-in-attribute-value-double-quote":
"Unexpected end of file in attribute value (\").",
"eof-in-attribute-value-single-quote":
"Unexpected end of file in attribute value (').",
"eof-in-attribute-value-no-quotes":
"Unexpected end of file in attribute value.",
"unexpected-EOF-after-solidus-in-tag":
"Unexpected end of file in tag. Expected >",
"unexpected-character-after-solidus-in-tag":
"Unexpected character after / in tag. Expected >",
"expected-dashes-or-doctype":
"Expected '--' or 'DOCTYPE'. Not found.",
"unexpected-bang-after-double-dash-in-comment":
"Unexpected ! after -- in comment",
"unexpected-space-after-double-dash-in-comment":
"Unexpected space after -- in comment",
"incorrect-comment":
"Incorrect comment.",
"eof-in-comment":
"Unexpected end of file in comment.",
"eof-in-comment-end-dash":
"Unexpected end of file in comment (-)",
"unexpected-dash-after-double-dash-in-comment":
"Unexpected '-' after '--' found in comment.",
"eof-in-comment-double-dash":
"Unexpected end of file in comment (--).",
"eof-in-comment-end-space-state":
"Unexpected end of file in comment.",
"eof-in-comment-end-bang-state":
"Unexpected end of file in comment.",
"unexpected-char-in-comment":
"Unexpected character in comment found.",
"need-space-after-doctype":
"No space after literal string 'DOCTYPE'.",
"expected-doctype-name-but-got-right-bracket":
"Unexpected > character. Expected DOCTYPE name.",
"expected-doctype-name-but-got-eof":
"Unexpected end of file. Expected DOCTYPE name.",
"eof-in-doctype-name":
"Unexpected end of file in DOCTYPE name.",
"eof-in-doctype":
"Unexpected end of file in DOCTYPE.",
"expected-space-or-right-bracket-in-doctype":
"Expected space or '>'. Got '%(data)s'",
"unexpected-end-of-doctype":
"Unexpected end of DOCTYPE.",
"unexpected-char-in-doctype":
"Unexpected character in DOCTYPE.",
"eof-in-innerhtml":
"XXX innerHTML EOF",
"unexpected-doctype":
"Unexpected DOCTYPE. Ignored.",
"non-html-root":
"html needs to be the first start tag.",
"expected-doctype-but-got-eof":
"Unexpected End of file. Expected DOCTYPE.",
"unknown-doctype":
"Erroneous DOCTYPE.",
"expected-doctype-but-got-chars":
"Unexpected non-space characters. Expected DOCTYPE.",
"expected-doctype-but-got-start-tag":
"Unexpected start tag (%(name)s). Expected DOCTYPE.",
"expected-doctype-but-got-end-tag":
"Unexpected end tag (%(name)s). Expected DOCTYPE.",
"end-tag-after-implied-root":
"Unexpected end tag (%(name)s) after the (implied) root element.",
"expected-named-closing-tag-but-got-eof":
"Unexpected end of file. Expected end tag (%(name)s).",
"two-heads-are-not-better-than-one":
"Unexpected start tag head in existing head. Ignored.",
"unexpected-end-tag":
"Unexpected end tag (%(name)s). Ignored.",
"unexpected-start-tag-out-of-my-head":
"Unexpected start tag (%(name)s) that can be in head. Moved.",
"unexpected-start-tag":
"Unexpected start tag (%(name)s).",
"missing-end-tag":
"Missing end tag (%(name)s).",
"missing-end-tags":
"Missing end tags (%(name)s).",
"unexpected-start-tag-implies-end-tag":
"Unexpected start tag (%(startName)s) "
"implies end tag (%(endName)s).",
"unexpected-start-tag-treated-as":
"Unexpected start tag (%(originalName)s). Treated as %(newName)s.",
"deprecated-tag":
"Unexpected start tag %(name)s. Don't use it!",
"unexpected-start-tag-ignored":
"Unexpected start tag %(name)s. Ignored.",
"expected-one-end-tag-but-got-another":
"Unexpected end tag (%(gotName)s). "
"Missing end tag (%(expectedName)s).",
"end-tag-too-early":
"End tag (%(name)s) seen too early. Expected other end tag.",
"end-tag-too-early-named":
"Unexpected end tag (%(gotName)s). Expected end tag (%(expectedName)s).",
"end-tag-too-early-ignored":
"End tag (%(name)s) seen too early. Ignored.",
"adoption-agency-1.1":
"End tag (%(name)s) violates step 1, "
"paragraph 1 of the adoption agency algorithm.",
"adoption-agency-1.2":
"End tag (%(name)s) violates step 1, "
"paragraph 2 of the adoption agency algorithm.",
"adoption-agency-1.3":
"End tag (%(name)s) violates step 1, "
"paragraph 3 of the adoption agency algorithm.",
"adoption-agency-4.4":
"End tag (%(name)s) violates step 4, "
"paragraph 4 of the adoption agency algorithm.",
"unexpected-end-tag-treated-as":
"Unexpected end tag (%(originalName)s). Treated as %(newName)s.",
"no-end-tag":
"This element (%(name)s) has no end tag.",
"unexpected-implied-end-tag-in-table":
"Unexpected implied end tag (%(name)s) in the table phase.",
"unexpected-implied-end-tag-in-table-body":
"Unexpected implied end tag (%(name)s) in the table body phase.",
"unexpected-char-implies-table-voodoo":
"Unexpected non-space characters in "
"table context caused voodoo mode.",
"unexpected-hidden-input-in-table":
"Unexpected input with type hidden in table context.",
"unexpected-form-in-table":
"Unexpected form in table context.",
"unexpected-start-tag-implies-table-voodoo":
"Unexpected start tag (%(name)s) in "
"table context caused voodoo mode.",
"unexpected-end-tag-implies-table-voodoo":
"Unexpected end tag (%(name)s) in "
"table context caused voodoo mode.",
"unexpected-cell-in-table-body":
"Unexpected table cell start tag (%(name)s) "
"in the table body phase.",
"unexpected-cell-end-tag":
"Got table cell end tag (%(name)s) "
"while required end tags are missing.",
"unexpected-end-tag-in-table-body":
"Unexpected end tag (%(name)s) in the table body phase. Ignored.",
"unexpected-implied-end-tag-in-table-row":
"Unexpected implied end tag (%(name)s) in the table row phase.",
"unexpected-end-tag-in-table-row":
"Unexpected end tag (%(name)s) in the table row phase. Ignored.",
"unexpected-select-in-select":
"Unexpected select start tag in the select phase "
"treated as select end tag.",
"unexpected-input-in-select":
"Unexpected input start tag in the select phase.",
"unexpected-start-tag-in-select":
"Unexpected start tag token (%(name)s in the select phase. "
"Ignored.",
"unexpected-end-tag-in-select":
"Unexpected end tag (%(name)s) in the select phase. Ignored.",
"unexpected-table-element-start-tag-in-select-in-table":
"Unexpected table element start tag (%(name)s) in the select in table phase.",
"unexpected-table-element-end-tag-in-select-in-table":
"Unexpected table element end tag (%(name)s) in the select in table phase.",
"unexpected-char-after-body":
"Unexpected non-space characters in the after body phase.",
"unexpected-start-tag-after-body":
"Unexpected start tag token (%(name)s)"
" in the after body phase.",
"unexpected-end-tag-after-body":
"Unexpected end tag token (%(name)s)"
" in the after body phase.",
"unexpected-char-in-frameset":
"Unexpected characters in the frameset phase. Characters ignored.",
"unexpected-start-tag-in-frameset":
"Unexpected start tag token (%(name)s)"
" in the frameset phase. Ignored.",
"unexpected-frameset-in-frameset-innerhtml":
"Unexpected end tag token (frameset) "
"in the frameset phase (innerHTML).",
"unexpected-end-tag-in-frameset":
"Unexpected end tag token (%(name)s)"
" in the frameset phase. Ignored.",
"unexpected-char-after-frameset":
"Unexpected non-space characters in the "
"after frameset phase. Ignored.",
"unexpected-start-tag-after-frameset":
"Unexpected start tag (%(name)s)"
" in the after frameset phase. Ignored.",
"unexpected-end-tag-after-frameset":
"Unexpected end tag (%(name)s)"
" in the after frameset phase. Ignored.",
"unexpected-end-tag-after-body-innerhtml":
"Unexpected end tag after body(innerHtml)",
"expected-eof-but-got-char":
"Unexpected non-space characters. Expected end of file.",
"expected-eof-but-got-start-tag":
"Unexpected start tag (%(name)s)"
". Expected end of file.",
"expected-eof-but-got-end-tag":
"Unexpected end tag (%(name)s)"
". Expected end of file.",
"eof-in-table":
"Unexpected end of file. Expected table content.",
"eof-in-select":
"Unexpected end of file. Expected select content.",
"eof-in-frameset":
"Unexpected end of file. Expected frameset content.",
"eof-in-script-in-script":
"Unexpected end of file. Expected script content.",
"eof-in-foreign-lands":
"Unexpected end of file. Expected foreign content",
"non-void-element-with-trailing-solidus":
"Trailing solidus not allowed on element %(name)s",
"unexpected-html-element-in-foreign-content":
"Element %(name)s not allowed in a non-html context",
"unexpected-end-tag-before-html":
"Unexpected end tag (%(name)s) before html.",
"unexpected-inhead-noscript-tag":
"Element %(name)s not allowed in a inhead-noscript context",
"eof-in-head-noscript":
"Unexpected end of file. Expected inhead-noscript content",
"char-in-head-noscript":
"Unexpected non-space character. Expected inhead-noscript content",
"XXX-undefined-error":
"Undefined error (this sucks and should be fixed)",
}
namespaces = {
"html": "http://www.w3.org/1999/xhtml",
"mathml": "http://www.w3.org/1998/Math/MathML",
"svg": "http://www.w3.org/2000/svg",
"xlink": "http://www.w3.org/1999/xlink",
"xml": "http://www.w3.org/XML/1998/namespace",
"xmlns": "http://www.w3.org/2000/xmlns/"
}
scopingElements = frozenset([
(namespaces["html"], "applet"),
(namespaces["html"], "caption"),
(namespaces["html"], "html"),
(namespaces["html"], "marquee"),
(namespaces["html"], "object"),
(namespaces["html"], "table"),
(namespaces["html"], "td"),
(namespaces["html"], "th"),
(namespaces["mathml"], "mi"),
(namespaces["mathml"], "mo"),
(namespaces["mathml"], "mn"),
(namespaces["mathml"], "ms"),
(namespaces["mathml"], "mtext"),
(namespaces["mathml"], "annotation-xml"),
(namespaces["svg"], "foreignObject"),
(namespaces["svg"], "desc"),
(namespaces["svg"], "title"),
])
formattingElements = frozenset([
(namespaces["html"], "a"),
(namespaces["html"], "b"),
(namespaces["html"], "big"),
(namespaces["html"], "code"),
(namespaces["html"], "em"),
(namespaces["html"], "font"),
(namespaces["html"], "i"),
(namespaces["html"], "nobr"),
(namespaces["html"], "s"),
(namespaces["html"], "small"),
(namespaces["html"], "strike"),
(namespaces["html"], "strong"),
(namespaces["html"], "tt"),
(namespaces["html"], "u")
])
specialElements = frozenset([
(namespaces["html"], "address"),
(namespaces["html"], "applet"),
(namespaces["html"], "area"),
(namespaces["html"], "article"),
(namespaces["html"], "aside"),
(namespaces["html"], "base"),
(namespaces["html"], "basefont"),
(namespaces["html"], "bgsound"),
(namespaces["html"], "blockquote"),
(namespaces["html"], "body"),
(namespaces["html"], "br"),
(namespaces["html"], "button"),
(namespaces["html"], "caption"),
(namespaces["html"], "center"),
(namespaces["html"], "col"),
(namespaces["html"], "colgroup"),
(namespaces["html"], "command"),
(namespaces["html"], "dd"),
(namespaces["html"], "details"),
(namespaces["html"], "dir"),
(namespaces["html"], "div"),
(namespaces["html"], "dl"),
(namespaces["html"], "dt"),
(namespaces["html"], "embed"),
(namespaces["html"], "fieldset"),
(namespaces["html"], "figure"),
(namespaces["html"], "footer"),
(namespaces["html"], "form"),
(namespaces["html"], "frame"),
(namespaces["html"], "frameset"),
(namespaces["html"], "h1"),
(namespaces["html"], "h2"),
(namespaces["html"], "h3"),
(namespaces["html"], "h4"),
(namespaces["html"], "h5"),
(namespaces["html"], "h6"),
(namespaces["html"], "head"),
(namespaces["html"], "header"),
(namespaces["html"], "hr"),
(namespaces["html"], "html"),
(namespaces["html"], "iframe"),
# Note that image is commented out in the spec as "this isn't an
# element that can end up on the stack, so it doesn't matter,"
(namespaces["html"], "image"),
(namespaces["html"], "img"),
(namespaces["html"], "input"),
(namespaces["html"], "isindex"),
(namespaces["html"], "li"),
(namespaces["html"], "link"),
(namespaces["html"], "listing"),
(namespaces["html"], "marquee"),
(namespaces["html"], "menu"),
(namespaces["html"], "meta"),
(namespaces["html"], "nav"),
(namespaces["html"], "noembed"),
(namespaces["html"], "noframes"),
(namespaces["html"], "noscript"),
(namespaces["html"], "object"),
(namespaces["html"], "ol"),
(namespaces["html"], "p"),
(namespaces["html"], "param"),
(namespaces["html"], "plaintext"),
(namespaces["html"], "pre"),
(namespaces["html"], "script"),
(namespaces["html"], "section"),
(namespaces["html"], "select"),
(namespaces["html"], "style"),
(namespaces["html"], "table"),
(namespaces["html"], "tbody"),
(namespaces["html"], "td"),
(namespaces["html"], "textarea"),
(namespaces["html"], "tfoot"),
(namespaces["html"], "th"),
(namespaces["html"], "thead"),
(namespaces["html"], "title"),
(namespaces["html"], "tr"),
(namespaces["html"], "ul"),
(namespaces["html"], "wbr"),
(namespaces["html"], "xmp"),
(namespaces["svg"], "foreignObject")
])
htmlIntegrationPointElements = frozenset([
(namespaces["mathml"], "annotaion-xml"),
(namespaces["svg"], "foreignObject"),
(namespaces["svg"], "desc"),
(namespaces["svg"], "title")
])
mathmlTextIntegrationPointElements = frozenset([
(namespaces["mathml"], "mi"),
(namespaces["mathml"], "mo"),
(namespaces["mathml"], "mn"),
(namespaces["mathml"], "ms"),
(namespaces["mathml"], "mtext")
])
adjustSVGAttributes = {
"attributename": "attributeName",
"attributetype": "attributeType",
"basefrequency": "baseFrequency",
"baseprofile": "baseProfile",
"calcmode": "calcMode",
"clippathunits": "clipPathUnits",
"contentscripttype": "contentScriptType",
"contentstyletype": "contentStyleType",
"diffuseconstant": "diffuseConstant",
"edgemode": "edgeMode",
"externalresourcesrequired": "externalResourcesRequired",
"filterres": "filterRes",
"filterunits": "filterUnits",
"glyphref": "glyphRef",
"gradienttransform": "gradientTransform",
"gradientunits": "gradientUnits",
"kernelmatrix": "kernelMatrix",
"kernelunitlength": "kernelUnitLength",
"keypoints": "keyPoints",
"keysplines": "keySplines",
"keytimes": "keyTimes",
"lengthadjust": "lengthAdjust",
"limitingconeangle": "limitingConeAngle",
"markerheight": "markerHeight",
"markerunits": "markerUnits",
"markerwidth": "markerWidth",
"maskcontentunits": "maskContentUnits",
"maskunits": "maskUnits",
"numoctaves": "numOctaves",
"pathlength": "pathLength",
"patterncontentunits": "patternContentUnits",
"patterntransform": "patternTransform",
"patternunits": "patternUnits",
"pointsatx": "pointsAtX",
"pointsaty": "pointsAtY",
"pointsatz": "pointsAtZ",
"preservealpha": "preserveAlpha",
"preserveaspectratio": "preserveAspectRatio",
"primitiveunits": "primitiveUnits",
"refx": "refX",
"refy": "refY",
"repeatcount": "repeatCount",
"repeatdur": "repeatDur",
"requiredextensions": "requiredExtensions",
"requiredfeatures": "requiredFeatures",
"specularconstant": "specularConstant",
"specularexponent": "specularExponent",
"spreadmethod": "spreadMethod",
"startoffset": "startOffset",
"stddeviation": "stdDeviation",
"stitchtiles": "stitchTiles",
"surfacescale": "surfaceScale",
"systemlanguage": "systemLanguage",
"tablevalues": "tableValues",
"targetx": "targetX",
"targety": "targetY",
"textlength": "textLength",
"viewbox": "viewBox",
"viewtarget": "viewTarget",
"xchannelselector": "xChannelSelector",
"ychannelselector": "yChannelSelector",
"zoomandpan": "zoomAndPan"
}
adjustMathMLAttributes = {"definitionurl": "definitionURL"}
adjustForeignAttributes = {
"xlink:actuate": ("xlink", "actuate", namespaces["xlink"]),
"xlink:arcrole": ("xlink", "arcrole", namespaces["xlink"]),
"xlink:href": ("xlink", "href", namespaces["xlink"]),
"xlink:role": ("xlink", "role", namespaces["xlink"]),
"xlink:show": ("xlink", "show", namespaces["xlink"]),
"xlink:title": ("xlink", "title", namespaces["xlink"]),
"xlink:type": ("xlink", "type", namespaces["xlink"]),
"xml:base": ("xml", "base", namespaces["xml"]),
"xml:lang": ("xml", "lang", namespaces["xml"]),
"xml:space": ("xml", "space", namespaces["xml"]),
"xmlns": (None, "xmlns", namespaces["xmlns"]),
"xmlns:xlink": ("xmlns", "xlink", namespaces["xmlns"])
}
unadjustForeignAttributes = dict([((ns, local), qname) for qname, (prefix, local, ns) in
adjustForeignAttributes.items()])
spaceCharacters = frozenset([
"\t",
"\n",
"\u000C",
" ",
"\r"
])
tableInsertModeElements = frozenset([
"table",
"tbody",
"tfoot",
"thead",
"tr"
])
asciiLowercase = frozenset(string.ascii_lowercase)
asciiUppercase = frozenset(string.ascii_uppercase)
asciiLetters = frozenset(string.ascii_letters)
digits = frozenset(string.digits)
hexDigits = frozenset(string.hexdigits)
asciiUpper2Lower = dict([(ord(c), ord(c.lower()))
for c in string.ascii_uppercase])
# Heading elements need to be ordered
headingElements = (
"h1",
"h2",
"h3",
"h4",
"h5",
"h6"
)
voidElements = frozenset([
"base",
"command",
"event-source",
"link",
"meta",
"hr",
"br",
"img",
"embed",
"param",
"area",
"col",
"input",
"source",
"track"
])
cdataElements = frozenset(['title', 'textarea'])
rcdataElements = frozenset([
'style',
'script',
'xmp',
'iframe',
'noembed',
'noframes',
'noscript'
])
booleanAttributes = {
"": frozenset(["irrelevant"]),
"style": frozenset(["scoped"]),
"img": frozenset(["ismap"]),
"audio": frozenset(["autoplay", "controls"]),
"video": frozenset(["autoplay", "controls"]),
"script": frozenset(["defer", "async"]),
"details": frozenset(["open"]),
"datagrid": frozenset(["multiple", "disabled"]),
"command": frozenset(["hidden", "disabled", "checked", "default"]),
"hr": frozenset(["noshade"]),
"menu": frozenset(["autosubmit"]),
"fieldset": frozenset(["disabled", "readonly"]),
"option": frozenset(["disabled", "readonly", "selected"]),
"optgroup": frozenset(["disabled", "readonly"]),
"button": frozenset(["disabled", "autofocus"]),
"input": frozenset(["disabled", "readonly", "required", "autofocus", "checked", "ismap"]),
"select": frozenset(["disabled", "readonly", "autofocus", "multiple"]),
"output": frozenset(["disabled", "readonly"]),
}
# entitiesWindows1252 has to be _ordered_ and needs to have an index. It
# therefore can't be a frozenset.
entitiesWindows1252 = (
8364, # 0x80 0x20AC EURO SIGN
65533, # 0x81 UNDEFINED
8218, # 0x82 0x201A SINGLE LOW-9 QUOTATION MARK
402, # 0x83 0x0192 LATIN SMALL LETTER F WITH HOOK
8222, # 0x84 0x201E DOUBLE LOW-9 QUOTATION MARK
8230, # 0x85 0x2026 HORIZONTAL ELLIPSIS
8224, # 0x86 0x2020 DAGGER
8225, # 0x87 0x2021 DOUBLE DAGGER
710, # 0x88 0x02C6 MODIFIER LETTER CIRCUMFLEX ACCENT
8240, # 0x89 0x2030 PER MILLE SIGN
352, # 0x8A 0x0160 LATIN CAPITAL LETTER S WITH CARON
8249, # 0x8B 0x2039 SINGLE LEFT-POINTING ANGLE QUOTATION MARK
338, # 0x8C 0x0152 LATIN CAPITAL LIGATURE OE
65533, # 0x8D UNDEFINED
381, # 0x8E 0x017D LATIN CAPITAL LETTER Z WITH CARON
65533, # 0x8F UNDEFINED
65533, # 0x90 UNDEFINED
8216, # 0x91 0x2018 LEFT SINGLE QUOTATION MARK
8217, # 0x92 0x2019 RIGHT SINGLE QUOTATION MARK
8220, # 0x93 0x201C LEFT DOUBLE QUOTATION MARK
8221, # 0x94 0x201D RIGHT DOUBLE QUOTATION MARK
8226, # 0x95 0x2022 BULLET
8211, # 0x96 0x2013 EN DASH
8212, # 0x97 0x2014 EM DASH
732, # 0x98 0x02DC SMALL TILDE
8482, # 0x99 0x2122 TRADE MARK SIGN
353, # 0x9A 0x0161 LATIN SMALL LETTER S WITH CARON
8250, # 0x9B 0x203A SINGLE RIGHT-POINTING ANGLE QUOTATION MARK
339, # 0x9C 0x0153 LATIN SMALL LIGATURE OE
65533, # 0x9D UNDEFINED
382, # 0x9E 0x017E LATIN SMALL LETTER Z WITH CARON
376 # 0x9F 0x0178 LATIN CAPITAL LETTER Y WITH DIAERESIS
)
xmlEntities = frozenset(['lt;', 'gt;', 'amp;', 'apos;', 'quot;'])
entities = {
"AElig": "\xc6",
"AElig;": "\xc6",
"AMP": "&",
"AMP;": "&",
"Aacute": "\xc1",
"Aacute;": "\xc1",
"Abreve;": "\u0102",
"Acirc": "\xc2",
"Acirc;": "\xc2",
"Acy;": "\u0410",
"Afr;": "\U0001d504",
"Agrave": "\xc0",
"Agrave;": "\xc0",
"Alpha;": "\u0391",
"Amacr;": "\u0100",
"And;": "\u2a53",
"Aogon;": "\u0104",
"Aopf;": "\U0001d538",
"ApplyFunction;": "\u2061",
"Aring": "\xc5",
"Aring;": "\xc5",
"Ascr;": "\U0001d49c",
"Assign;": "\u2254",
"Atilde": "\xc3",
"Atilde;": "\xc3",
"Auml": "\xc4",
"Auml;": "\xc4",
"Backslash;": "\u2216",
"Barv;": "\u2ae7",
"Barwed;": "\u2306",
"Bcy;": "\u0411",
"Because;": "\u2235",
"Bernoullis;": "\u212c",
"Beta;": "\u0392",
"Bfr;": "\U0001d505",
"Bopf;": "\U0001d539",
"Breve;": "\u02d8",
"Bscr;": "\u212c",
"Bumpeq;": "\u224e",
"CHcy;": "\u0427",
"COPY": "\xa9",
"COPY;": "\xa9",
"Cacute;": "\u0106",
"Cap;": "\u22d2",
"CapitalDifferentialD;": "\u2145",
"Cayleys;": "\u212d",
"Ccaron;": "\u010c",
"Ccedil": "\xc7",
"Ccedil;": "\xc7",
"Ccirc;": "\u0108",
"Cconint;": "\u2230",
"Cdot;": "\u010a",
"Cedilla;": "\xb8",
"CenterDot;": "\xb7",
"Cfr;": "\u212d",
"Chi;": "\u03a7",
"CircleDot;": "\u2299",
"CircleMinus;": "\u2296",
"CirclePlus;": "\u2295",
"CircleTimes;": "\u2297",
"ClockwiseContourIntegral;": "\u2232",
"CloseCurlyDoubleQuote;": "\u201d",
"CloseCurlyQuote;": "\u2019",
"Colon;": "\u2237",
"Colone;": "\u2a74",
"Congruent;": "\u2261",
"Conint;": "\u222f",
"ContourIntegral;": "\u222e",
"Copf;": "\u2102",
"Coproduct;": "\u2210",
"CounterClockwiseContourIntegral;": "\u2233",
"Cross;": "\u2a2f",
"Cscr;": "\U0001d49e",
"Cup;": "\u22d3",
"CupCap;": "\u224d",
"DD;": "\u2145",
"DDotrahd;": "\u2911",
"DJcy;": "\u0402",
"DScy;": "\u0405",
"DZcy;": "\u040f",
"Dagger;": "\u2021",
"Darr;": "\u21a1",
"Dashv;": "\u2ae4",
"Dcaron;": "\u010e",
"Dcy;": "\u0414",
"Del;": "\u2207",
"Delta;": "\u0394",
"Dfr;": "\U0001d507",
"DiacriticalAcute;": "\xb4",
"DiacriticalDot;": "\u02d9",
"DiacriticalDoubleAcute;": "\u02dd",
"DiacriticalGrave;": "`",
"DiacriticalTilde;": "\u02dc",
"Diamond;": "\u22c4",
"DifferentialD;": "\u2146",
"Dopf;": "\U0001d53b",
"Dot;": "\xa8",
"DotDot;": "\u20dc",
"DotEqual;": "\u2250",
"DoubleContourIntegral;": "\u222f",
"DoubleDot;": "\xa8",
"DoubleDownArrow;": "\u21d3",
"DoubleLeftArrow;": "\u21d0",
"DoubleLeftRightArrow;": "\u21d4",
"DoubleLeftTee;": "\u2ae4",
"DoubleLongLeftArrow;": "\u27f8",
"DoubleLongLeftRightArrow;": "\u27fa",
"DoubleLongRightArrow;": "\u27f9",
"DoubleRightArrow;": "\u21d2",
"DoubleRightTee;": "\u22a8",
"DoubleUpArrow;": "\u21d1",
"DoubleUpDownArrow;": "\u21d5",
"DoubleVerticalBar;": "\u2225",
"DownArrow;": "\u2193",
"DownArrowBar;": "\u2913",
"DownArrowUpArrow;": "\u21f5",
"DownBreve;": "\u0311",
"DownLeftRightVector;": "\u2950",
"DownLeftTeeVector;": "\u295e",
"DownLeftVector;": "\u21bd",
"DownLeftVectorBar;": "\u2956",
"DownRightTeeVector;": "\u295f",
"DownRightVector;": "\u21c1",
"DownRightVectorBar;": "\u2957",
"DownTee;": "\u22a4",
"DownTeeArrow;": "\u21a7",
"Downarrow;": "\u21d3",
"Dscr;": "\U0001d49f",
"Dstrok;": "\u0110",
"ENG;": "\u014a",
"ETH": "\xd0",
"ETH;": "\xd0",
"Eacute": "\xc9",
"Eacute;": "\xc9",
"Ecaron;": "\u011a",
"Ecirc": "\xca",
"Ecirc;": "\xca",
"Ecy;": "\u042d",
"Edot;": "\u0116",
"Efr;": "\U0001d508",
"Egrave": "\xc8",
"Egrave;": "\xc8",
"Element;": "\u2208",
"Emacr;": "\u0112",
"EmptySmallSquare;": "\u25fb",
"EmptyVerySmallSquare;": "\u25ab",
"Eogon;": "\u0118",
"Eopf;": "\U0001d53c",
"Epsilon;": "\u0395",
"Equal;": "\u2a75",
"EqualTilde;": "\u2242",
"Equilibrium;": "\u21cc",
"Escr;": "\u2130",
"Esim;": "\u2a73",
"Eta;": "\u0397",
"Euml": "\xcb",
"Euml;": "\xcb",
"Exists;": "\u2203",
"ExponentialE;": "\u2147",
"Fcy;": "\u0424",
"Ffr;": "\U0001d509",
"FilledSmallSquare;": "\u25fc",
"FilledVerySmallSquare;": "\u25aa",
"Fopf;": "\U0001d53d",
"ForAll;": "\u2200",
"Fouriertrf;": "\u2131",
"Fscr;": "\u2131",
"GJcy;": "\u0403",
"GT": ">",
"GT;": ">",
"Gamma;": "\u0393",
"Gammad;": "\u03dc",
"Gbreve;": "\u011e",
"Gcedil;": "\u0122",
"Gcirc;": "\u011c",
"Gcy;": "\u0413",
"Gdot;": "\u0120",
"Gfr;": "\U0001d50a",
"Gg;": "\u22d9",
"Gopf;": "\U0001d53e",
"GreaterEqual;": "\u2265",
"GreaterEqualLess;": "\u22db",
"GreaterFullEqual;": "\u2267",
"GreaterGreater;": "\u2aa2",
"GreaterLess;": "\u2277",
"GreaterSlantEqual;": "\u2a7e",
"GreaterTilde;": "\u2273",
"Gscr;": "\U0001d4a2",
"Gt;": "\u226b",
"HARDcy;": "\u042a",
"Hacek;": "\u02c7",
"Hat;": "^",
"Hcirc;": "\u0124",
"Hfr;": "\u210c",
"HilbertSpace;": "\u210b",
"Hopf;": "\u210d",
"HorizontalLine;": "\u2500",
"Hscr;": "\u210b",
"Hstrok;": "\u0126",
"HumpDownHump;": "\u224e",
"HumpEqual;": "\u224f",
"IEcy;": "\u0415",
"IJlig;": "\u0132",
"IOcy;": "\u0401",
"Iacute": "\xcd",
"Iacute;": "\xcd",
"Icirc": "\xce",
"Icirc;": "\xce",
"Icy;": "\u0418",
"Idot;": "\u0130",
"Ifr;": "\u2111",
"Igrave": "\xcc",
"Igrave;": "\xcc",
"Im;": "\u2111",
"Imacr;": "\u012a",
"ImaginaryI;": "\u2148",
"Implies;": "\u21d2",
"Int;": "\u222c",
"Integral;": "\u222b",
"Intersection;": "\u22c2",
"InvisibleComma;": "\u2063",
"InvisibleTimes;": "\u2062",
"Iogon;": "\u012e",
"Iopf;": "\U0001d540",
"Iota;": "\u0399",
"Iscr;": "\u2110",
"Itilde;": "\u0128",
"Iukcy;": "\u0406",
"Iuml": "\xcf",
"Iuml;": "\xcf",
"Jcirc;": "\u0134",
"Jcy;": "\u0419",
"Jfr;": "\U0001d50d",
"Jopf;": "\U0001d541",
"Jscr;": "\U0001d4a5",
"Jsercy;": "\u0408",
"Jukcy;": "\u0404",
"KHcy;": "\u0425",
"KJcy;": "\u040c",
"Kappa;": "\u039a",
"Kcedil;": "\u0136",
"Kcy;": "\u041a",
"Kfr;": "\U0001d50e",
"Kopf;": "\U0001d542",
"Kscr;": "\U0001d4a6",
"LJcy;": "\u0409",
"LT": "<",
"LT;": "<",
"Lacute;": "\u0139",
"Lambda;": "\u039b",
"Lang;": "\u27ea",
"Laplacetrf;": "\u2112",
"Larr;": "\u219e",
"Lcaron;": "\u013d",
"Lcedil;": "\u013b",
"Lcy;": "\u041b",
"LeftAngleBracket;": "\u27e8",
"LeftArrow;": "\u2190",
"LeftArrowBar;": "\u21e4",
"LeftArrowRightArrow;": "\u21c6",
"LeftCeiling;": "\u2308",
"LeftDoubleBracket;": "\u27e6",
"LeftDownTeeVector;": "\u2961",
"LeftDownVector;": "\u21c3",
"LeftDownVectorBar;": "\u2959",
"LeftFloor;": "\u230a",
"LeftRightArrow;": "\u2194",
"LeftRightVector;": "\u294e",
"LeftTee;": "\u22a3",
"LeftTeeArrow;": "\u21a4",
"LeftTeeVector;": "\u295a",
"LeftTriangle;": "\u22b2",
"LeftTriangleBar;": "\u29cf",
"LeftTriangleEqual;": "\u22b4",
"LeftUpDownVector;": "\u2951",
"LeftUpTeeVector;": "\u2960",
"LeftUpVector;": "\u21bf",
"LeftUpVectorBar;": "\u2958",
"LeftVector;": "\u21bc",
"LeftVectorBar;": "\u2952",
"Leftarrow;": "\u21d0",
"Leftrightarrow;": "\u21d4",
"LessEqualGreater;": "\u22da",
"LessFullEqual;": "\u2266",
"LessGreater;": "\u2276",
"LessLess;": "\u2aa1",
"LessSlantEqual;": "\u2a7d",
"LessTilde;": "\u2272",
"Lfr;": "\U0001d50f",
"Ll;": "\u22d8",
"Lleftarrow;": "\u21da",
"Lmidot;": "\u013f",
"LongLeftArrow;": "\u27f5",
"LongLeftRightArrow;": "\u27f7",
"LongRightArrow;": "\u27f6",
"Longleftarrow;": "\u27f8",
"Longleftrightarrow;": "\u27fa",
"Longrightarrow;": "\u27f9",
"Lopf;": "\U0001d543",
"LowerLeftArrow;": "\u2199",
"LowerRightArrow;": "\u2198",
"Lscr;": "\u2112",
"Lsh;": "\u21b0",
"Lstrok;": "\u0141",
"Lt;": "\u226a",
"Map;": "\u2905",
"Mcy;": "\u041c",
"MediumSpace;": "\u205f",
"Mellintrf;": "\u2133",
"Mfr;": "\U0001d510",
"MinusPlus;": "\u2213",
"Mopf;": "\U0001d544",
"Mscr;": "\u2133",
"Mu;": "\u039c",
"NJcy;": "\u040a",
"Nacute;": "\u0143",
"Ncaron;": "\u0147",
"Ncedil;": "\u0145",
"Ncy;": "\u041d",
"NegativeMediumSpace;": "\u200b",
"NegativeThickSpace;": "\u200b",
"NegativeThinSpace;": "\u200b",
"NegativeVeryThinSpace;": "\u200b",
"NestedGreaterGreater;": "\u226b",
"NestedLessLess;": "\u226a",
"NewLine;": "\n",
"Nfr;": "\U0001d511",
"NoBreak;": "\u2060",
"NonBreakingSpace;": "\xa0",
"Nopf;": "\u2115",
"Not;": "\u2aec",
"NotCongruent;": "\u2262",
"NotCupCap;": "\u226d",
"NotDoubleVerticalBar;": "\u2226",
"NotElement;": "\u2209",
"NotEqual;": "\u2260",
"NotEqualTilde;": "\u2242\u0338",
"NotExists;": "\u2204",
"NotGreater;": "\u226f",
"NotGreaterEqual;": "\u2271",
"NotGreaterFullEqual;": "\u2267\u0338",
"NotGreaterGreater;": "\u226b\u0338",
"NotGreaterLess;": "\u2279",
"NotGreaterSlantEqual;": "\u2a7e\u0338",
"NotGreaterTilde;": "\u2275",
"NotHumpDownHump;": "\u224e\u0338",
"NotHumpEqual;": "\u224f\u0338",
"NotLeftTriangle;": "\u22ea",
"NotLeftTriangleBar;": "\u29cf\u0338",
"NotLeftTriangleEqual;": "\u22ec",
"NotLess;": "\u226e",
"NotLessEqual;": "\u2270",
"NotLessGreater;": "\u2278",
"NotLessLess;": "\u226a\u0338",
"NotLessSlantEqual;": "\u2a7d\u0338",
"NotLessTilde;": "\u2274",
"NotNestedGreaterGreater;": "\u2aa2\u0338",
"NotNestedLessLess;": "\u2aa1\u0338",
"NotPrecedes;": "\u2280",
"NotPrecedesEqual;": "\u2aaf\u0338",
"NotPrecedesSlantEqual;": "\u22e0",
"NotReverseElement;": "\u220c",
"NotRightTriangle;": "\u22eb",
"NotRightTriangleBar;": "\u29d0\u0338",
"NotRightTriangleEqual;": "\u22ed",
"NotSquareSubset;": "\u228f\u0338",
"NotSquareSubsetEqual;": "\u22e2",
"NotSquareSuperset;": "\u2290\u0338",
"NotSquareSupersetEqual;": "\u22e3",
"NotSubset;": "\u2282\u20d2",
"NotSubsetEqual;": "\u2288",
"NotSucceeds;": "\u2281",
"NotSucceedsEqual;": "\u2ab0\u0338",
"NotSucceedsSlantEqual;": "\u22e1",
"NotSucceedsTilde;": "\u227f\u0338",
"NotSuperset;": "\u2283\u20d2",
"NotSupersetEqual;": "\u2289",
"NotTilde;": "\u2241",
"NotTildeEqual;": "\u2244",
"NotTildeFullEqual;": "\u2247",
"NotTildeTilde;": "\u2249",
"NotVerticalBar;": "\u2224",
"Nscr;": "\U0001d4a9",
"Ntilde": "\xd1",
"Ntilde;": "\xd1",
"Nu;": "\u039d",
"OElig;": "\u0152",
"Oacute": "\xd3",
"Oacute;": "\xd3",
"Ocirc": "\xd4",
"Ocirc;": "\xd4",
"Ocy;": "\u041e",
"Odblac;": "\u0150",
"Ofr;": "\U0001d512",
"Ograve": "\xd2",
"Ograve;": "\xd2",
"Omacr;": "\u014c",
"Omega;": "\u03a9",
"Omicron;": "\u039f",
"Oopf;": "\U0001d546",
"OpenCurlyDoubleQuote;": "\u201c",
"OpenCurlyQuote;": "\u2018",
"Or;": "\u2a54",
"Oscr;": "\U0001d4aa",
"Oslash": "\xd8",
"Oslash;": "\xd8",
"Otilde": "\xd5",
"Otilde;": "\xd5",
"Otimes;": "\u2a37",
"Ouml": "\xd6",
"Ouml;": "\xd6",
"OverBar;": "\u203e",
"OverBrace;": "\u23de",
"OverBracket;": "\u23b4",
"OverParenthesis;": "\u23dc",
"PartialD;": "\u2202",
"Pcy;": "\u041f",
"Pfr;": "\U0001d513",
"Phi;": "\u03a6",
"Pi;": "\u03a0",
"PlusMinus;": "\xb1",
"Poincareplane;": "\u210c",
"Popf;": "\u2119",
"Pr;": "\u2abb",
"Precedes;": "\u227a",
"PrecedesEqual;": "\u2aaf",
"PrecedesSlantEqual;": "\u227c",
"PrecedesTilde;": "\u227e",
"Prime;": "\u2033",
"Product;": "\u220f",
"Proportion;": "\u2237",
"Proportional;": "\u221d",
"Pscr;": "\U0001d4ab",
"Psi;": "\u03a8",
"QUOT": "\"",
"QUOT;": "\"",
"Qfr;": "\U0001d514",
"Qopf;": "\u211a",
"Qscr;": "\U0001d4ac",
"RBarr;": "\u2910",
"REG": "\xae",
"REG;": "\xae",
"Racute;": "\u0154",
"Rang;": "\u27eb",
"Rarr;": "\u21a0",
"Rarrtl;": "\u2916",
"Rcaron;": "\u0158",
"Rcedil;": "\u0156",
"Rcy;": "\u0420",
"Re;": "\u211c",
"ReverseElement;": "\u220b",
"ReverseEquilibrium;": "\u21cb",
"ReverseUpEquilibrium;": "\u296f",
"Rfr;": "\u211c",
"Rho;": "\u03a1",
"RightAngleBracket;": "\u27e9",
"RightArrow;": "\u2192",
"RightArrowBar;": "\u21e5",
"RightArrowLeftArrow;": "\u21c4",
"RightCeiling;": "\u2309",
"RightDoubleBracket;": "\u27e7",
"RightDownTeeVector;": "\u295d",
"RightDownVector;": "\u21c2",
"RightDownVectorBar;": "\u2955",
"RightFloor;": "\u230b",
"RightTee;": "\u22a2",
"RightTeeArrow;": "\u21a6",
"RightTeeVector;": "\u295b",
"RightTriangle;": "\u22b3",
"RightTriangleBar;": "\u29d0",
"RightTriangleEqual;": "\u22b5",
"RightUpDownVector;": "\u294f",
"RightUpTeeVector;": "\u295c",
"RightUpVector;": "\u21be",
"RightUpVectorBar;": "\u2954",
"RightVector;": "\u21c0",
"RightVectorBar;": "\u2953",
"Rightarrow;": "\u21d2",
"Ropf;": "\u211d",
"RoundImplies;": "\u2970",
"Rrightarrow;": "\u21db",
"Rscr;": "\u211b",
"Rsh;": "\u21b1",
"RuleDelayed;": "\u29f4",
"SHCHcy;": "\u0429",
"SHcy;": "\u0428",
"SOFTcy;": "\u042c",
"Sacute;": "\u015a",
"Sc;": "\u2abc",
"Scaron;": "\u0160",
"Scedil;": "\u015e",
"Scirc;": "\u015c",
"Scy;": "\u0421",
"Sfr;": "\U0001d516",
"ShortDownArrow;": "\u2193",
"ShortLeftArrow;": "\u2190",
"ShortRightArrow;": "\u2192",
"ShortUpArrow;": "\u2191",
"Sigma;": "\u03a3",
"SmallCircle;": "\u2218",
"Sopf;": "\U0001d54a",
"Sqrt;": "\u221a",
"Square;": "\u25a1",
"SquareIntersection;": "\u2293",
"SquareSubset;": "\u228f",
"SquareSubsetEqual;": "\u2291",
"SquareSuperset;": "\u2290",
"SquareSupersetEqual;": "\u2292",
"SquareUnion;": "\u2294",
"Sscr;": "\U0001d4ae",
"Star;": "\u22c6",
"Sub;": "\u22d0",
"Subset;": "\u22d0",
"SubsetEqual;": "\u2286",
"Succeeds;": "\u227b",
"SucceedsEqual;": "\u2ab0",
"SucceedsSlantEqual;": "\u227d",
"SucceedsTilde;": "\u227f",
"SuchThat;": "\u220b",
"Sum;": "\u2211",
"Sup;": "\u22d1",
"Superset;": "\u2283",
"SupersetEqual;": "\u2287",
"Supset;": "\u22d1",
"THORN": "\xde",
"THORN;": "\xde",
"TRADE;": "\u2122",
"TSHcy;": "\u040b",
"TScy;": "\u0426",
"Tab;": "\t",
"Tau;": "\u03a4",
"Tcaron;": "\u0164",
"Tcedil;": "\u0162",
"Tcy;": "\u0422",
"Tfr;": "\U0001d517",
"Therefore;": "\u2234",
"Theta;": "\u0398",
"ThickSpace;": "\u205f\u200a",
"ThinSpace;": "\u2009",
"Tilde;": "\u223c",
"TildeEqual;": "\u2243",
"TildeFullEqual;": "\u2245",
"TildeTilde;": "\u2248",
"Topf;": "\U0001d54b",
"TripleDot;": "\u20db",
"Tscr;": "\U0001d4af",
"Tstrok;": "\u0166",
"Uacute": "\xda",
"Uacute;": "\xda",
"Uarr;": "\u219f",
"Uarrocir;": "\u2949",
"Ubrcy;": "\u040e",
"Ubreve;": "\u016c",
"Ucirc": "\xdb",
"Ucirc;": "\xdb",
"Ucy;": "\u0423",
"Udblac;": "\u0170",
"Ufr;": "\U0001d518",
"Ugrave": "\xd9",
"Ugrave;": "\xd9",
"Umacr;": "\u016a",
"UnderBar;": "_",
"UnderBrace;": "\u23df",
"UnderBracket;": "\u23b5",
"UnderParenthesis;": "\u23dd",
"Union;": "\u22c3",
"UnionPlus;": "\u228e",
"Uogon;": "\u0172",
"Uopf;": "\U0001d54c",
"UpArrow;": "\u2191",
"UpArrowBar;": "\u2912",
"UpArrowDownArrow;": "\u21c5",
"UpDownArrow;": "\u2195",
"UpEquilibrium;": "\u296e",
"UpTee;": "\u22a5",
"UpTeeArrow;": "\u21a5",
"Uparrow;": "\u21d1",
"Updownarrow;": "\u21d5",
"UpperLeftArrow;": "\u2196",
"UpperRightArrow;": "\u2197",
"Upsi;": "\u03d2",
"Upsilon;": "\u03a5",
"Uring;": "\u016e",
"Uscr;": "\U0001d4b0",
"Utilde;": "\u0168",
"Uuml": "\xdc",
"Uuml;": "\xdc",
"VDash;": "\u22ab",
"Vbar;": "\u2aeb",
"Vcy;": "\u0412",
"Vdash;": "\u22a9",
"Vdashl;": "\u2ae6",
"Vee;": "\u22c1",
"Verbar;": "\u2016",
"Vert;": "\u2016",
"VerticalBar;": "\u2223",
"VerticalLine;": "|",
"VerticalSeparator;": "\u2758",
"VerticalTilde;": "\u2240",
"VeryThinSpace;": "\u200a",
"Vfr;": "\U0001d519",
"Vopf;": "\U0001d54d",
"Vscr;": "\U0001d4b1",
"Vvdash;": "\u22aa",
"Wcirc;": "\u0174",
"Wedge;": "\u22c0",
"Wfr;": "\U0001d51a",
"Wopf;": "\U0001d54e",
"Wscr;": "\U0001d4b2",
"Xfr;": "\U0001d51b",
"Xi;": "\u039e",
"Xopf;": "\U0001d54f",
"Xscr;": "\U0001d4b3",
"YAcy;": "\u042f",
"YIcy;": "\u0407",
"YUcy;": "\u042e",
"Yacute": "\xdd",
"Yacute;": "\xdd",
"Ycirc;": "\u0176",
"Ycy;": "\u042b",
"Yfr;": "\U0001d51c",
"Yopf;": "\U0001d550",
"Yscr;": "\U0001d4b4",
"Yuml;": "\u0178",
"ZHcy;": "\u0416",
"Zacute;": "\u0179",
"Zcaron;": "\u017d",
"Zcy;": "\u0417",
"Zdot;": "\u017b",
"ZeroWidthSpace;": "\u200b",
"Zeta;": "\u0396",
"Zfr;": "\u2128",
"Zopf;": "\u2124",
"Zscr;": "\U0001d4b5",
"aacute": "\xe1",
"aacute;": "\xe1",
"abreve;": "\u0103",
"ac;": "\u223e",
"acE;": "\u223e\u0333",
"acd;": "\u223f",
"acirc": "\xe2",
"acirc;": "\xe2",
"acute": "\xb4",
"acute;": "\xb4",
"acy;": "\u0430",
"aelig": "\xe6",
"aelig;": "\xe6",
"af;": "\u2061",
"afr;": "\U0001d51e",
"agrave": "\xe0",
"agrave;": "\xe0",
"alefsym;": "\u2135",
"aleph;": "\u2135",
"alpha;": "\u03b1",
"amacr;": "\u0101",
"amalg;": "\u2a3f",
"amp": "&",
"amp;": "&",
"and;": "\u2227",
"andand;": "\u2a55",
"andd;": "\u2a5c",
"andslope;": "\u2a58",
"andv;": "\u2a5a",
"ang;": "\u2220",
"ange;": "\u29a4",
"angle;": "\u2220",
"angmsd;": "\u2221",
"angmsdaa;": "\u29a8",
"angmsdab;": "\u29a9",
"angmsdac;": "\u29aa",
"angmsdad;": "\u29ab",
"angmsdae;": "\u29ac",
"angmsdaf;": "\u29ad",
"angmsdag;": "\u29ae",
"angmsdah;": "\u29af",
"angrt;": "\u221f",
"angrtvb;": "\u22be",
"angrtvbd;": "\u299d",
"angsph;": "\u2222",
"angst;": "\xc5",
"angzarr;": "\u237c",
"aogon;": "\u0105",
"aopf;": "\U0001d552",
"ap;": "\u2248",
"apE;": "\u2a70",
"apacir;": "\u2a6f",
"ape;": "\u224a",
"apid;": "\u224b",
"apos;": "'",
"approx;": "\u2248",
"approxeq;": "\u224a",
"aring": "\xe5",
"aring;": "\xe5",
"ascr;": "\U0001d4b6",
"ast;": "*",
"asymp;": "\u2248",
"asympeq;": "\u224d",
"atilde": "\xe3",
"atilde;": "\xe3",
"auml": "\xe4",
"auml;": "\xe4",
"awconint;": "\u2233",
"awint;": "\u2a11",
"bNot;": "\u2aed",
"backcong;": "\u224c",
"backepsilon;": "\u03f6",
"backprime;": "\u2035",
"backsim;": "\u223d",
"backsimeq;": "\u22cd",
"barvee;": "\u22bd",
"barwed;": "\u2305",
"barwedge;": "\u2305",
"bbrk;": "\u23b5",
"bbrktbrk;": "\u23b6",
"bcong;": "\u224c",
"bcy;": "\u0431",
"bdquo;": "\u201e",
"becaus;": "\u2235",
"because;": "\u2235",
"bemptyv;": "\u29b0",
"bepsi;": "\u03f6",
"bernou;": "\u212c",
"beta;": "\u03b2",
"beth;": "\u2136",
"between;": "\u226c",
"bfr;": "\U0001d51f",
"bigcap;": "\u22c2",
"bigcirc;": "\u25ef",
"bigcup;": "\u22c3",
"bigodot;": "\u2a00",
"bigoplus;": "\u2a01",
"bigotimes;": "\u2a02",
"bigsqcup;": "\u2a06",
"bigstar;": "\u2605",
"bigtriangledown;": "\u25bd",
"bigtriangleup;": "\u25b3",
"biguplus;": "\u2a04",
"bigvee;": "\u22c1",
"bigwedge;": "\u22c0",
"bkarow;": "\u290d",
"blacklozenge;": "\u29eb",
"blacksquare;": "\u25aa",
"blacktriangle;": "\u25b4",
"blacktriangledown;": "\u25be",
"blacktriangleleft;": "\u25c2",
"blacktriangleright;": "\u25b8",
"blank;": "\u2423",
"blk12;": "\u2592",
"blk14;": "\u2591",
"blk34;": "\u2593",
"block;": "\u2588",
"bne;": "=\u20e5",
"bnequiv;": "\u2261\u20e5",
"bnot;": "\u2310",
"bopf;": "\U0001d553",
"bot;": "\u22a5",
"bottom;": "\u22a5",
"bowtie;": "\u22c8",
"boxDL;": "\u2557",
"boxDR;": "\u2554",
"boxDl;": "\u2556",
"boxDr;": "\u2553",
"boxH;": "\u2550",
"boxHD;": "\u2566",
"boxHU;": "\u2569",
"boxHd;": "\u2564",
"boxHu;": "\u2567",
"boxUL;": "\u255d",
"boxUR;": "\u255a",
"boxUl;": "\u255c",
"boxUr;": "\u2559",
"boxV;": "\u2551",
"boxVH;": "\u256c",
"boxVL;": "\u2563",
"boxVR;": "\u2560",
"boxVh;": "\u256b",
"boxVl;": "\u2562",
"boxVr;": "\u255f",
"boxbox;": "\u29c9",
"boxdL;": "\u2555",
"boxdR;": "\u2552",
"boxdl;": "\u2510",
"boxdr;": "\u250c",
"boxh;": "\u2500",
"boxhD;": "\u2565",
"boxhU;": "\u2568",
"boxhd;": "\u252c",
"boxhu;": "\u2534",
"boxminus;": "\u229f",
"boxplus;": "\u229e",
"boxtimes;": "\u22a0",
"boxuL;": "\u255b",
"boxuR;": "\u2558",
"boxul;": "\u2518",
"boxur;": "\u2514",
"boxv;": "\u2502",
"boxvH;": "\u256a",
"boxvL;": "\u2561",
"boxvR;": "\u255e",
"boxvh;": "\u253c",
"boxvl;": "\u2524",
"boxvr;": "\u251c",
"bprime;": "\u2035",
"breve;": "\u02d8",
"brvbar": "\xa6",
"brvbar;": "\xa6",
"bscr;": "\U0001d4b7",
"bsemi;": "\u204f",
"bsim;": "\u223d",
"bsime;": "\u22cd",
"bsol;": "\\",
"bsolb;": "\u29c5",
"bsolhsub;": "\u27c8",
"bull;": "\u2022",
"bullet;": "\u2022",
"bump;": "\u224e",
"bumpE;": "\u2aae",
"bumpe;": "\u224f",
"bumpeq;": "\u224f",
"cacute;": "\u0107",
"cap;": "\u2229",
"capand;": "\u2a44",
"capbrcup;": "\u2a49",
"capcap;": "\u2a4b",
"capcup;": "\u2a47",
"capdot;": "\u2a40",
"caps;": "\u2229\ufe00",
"caret;": "\u2041",
"caron;": "\u02c7",
"ccaps;": "\u2a4d",
"ccaron;": "\u010d",
"ccedil": "\xe7",
"ccedil;": "\xe7",
"ccirc;": "\u0109",
"ccups;": "\u2a4c",
"ccupssm;": "\u2a50",
"cdot;": "\u010b",
"cedil": "\xb8",
"cedil;": "\xb8",
"cemptyv;": "\u29b2",
"cent": "\xa2",
"cent;": "\xa2",
"centerdot;": "\xb7",
"cfr;": "\U0001d520",
"chcy;": "\u0447",
"check;": "\u2713",
"checkmark;": "\u2713",
"chi;": "\u03c7",
"cir;": "\u25cb",
"cirE;": "\u29c3",
"circ;": "\u02c6",
"circeq;": "\u2257",
"circlearrowleft;": "\u21ba",
"circlearrowright;": "\u21bb",
"circledR;": "\xae",
"circledS;": "\u24c8",
"circledast;": "\u229b",
"circledcirc;": "\u229a",
"circleddash;": "\u229d",
"cire;": "\u2257",
"cirfnint;": "\u2a10",
"cirmid;": "\u2aef",
"cirscir;": "\u29c2",
"clubs;": "\u2663",
"clubsuit;": "\u2663",
"colon;": ":",
"colone;": "\u2254",
"coloneq;": "\u2254",
"comma;": ",",
"commat;": "@",
"comp;": "\u2201",
"compfn;": "\u2218",
"complement;": "\u2201",
"complexes;": "\u2102",
"cong;": "\u2245",
"congdot;": "\u2a6d",
"conint;": "\u222e",
"copf;": "\U0001d554",
"coprod;": "\u2210",
"copy": "\xa9",
"copy;": "\xa9",
"copysr;": "\u2117",
"crarr;": "\u21b5",
"cross;": "\u2717",
"cscr;": "\U0001d4b8",
"csub;": "\u2acf",
"csube;": "\u2ad1",
"csup;": "\u2ad0",
"csupe;": "\u2ad2",
"ctdot;": "\u22ef",
"cudarrl;": "\u2938",
"cudarrr;": "\u2935",
"cuepr;": "\u22de",
"cuesc;": "\u22df",
"cularr;": "\u21b6",
"cularrp;": "\u293d",
"cup;": "\u222a",
"cupbrcap;": "\u2a48",
"cupcap;": "\u2a46",
"cupcup;": "\u2a4a",
"cupdot;": "\u228d",
"cupor;": "\u2a45",
"cups;": "\u222a\ufe00",
"curarr;": "\u21b7",
"curarrm;": "\u293c",
"curlyeqprec;": "\u22de",
"curlyeqsucc;": "\u22df",
"curlyvee;": "\u22ce",
"curlywedge;": "\u22cf",
"curren": "\xa4",
"curren;": "\xa4",
"curvearrowleft;": "\u21b6",
"curvearrowright;": "\u21b7",
"cuvee;": "\u22ce",
"cuwed;": "\u22cf",
"cwconint;": "\u2232",
"cwint;": "\u2231",
"cylcty;": "\u232d",
"dArr;": "\u21d3",
"dHar;": "\u2965",
"dagger;": "\u2020",
"daleth;": "\u2138",
"darr;": "\u2193",
"dash;": "\u2010",
"dashv;": "\u22a3",
"dbkarow;": "\u290f",
"dblac;": "\u02dd",
"dcaron;": "\u010f",
"dcy;": "\u0434",
"dd;": "\u2146",
"ddagger;": "\u2021",
"ddarr;": "\u21ca",
"ddotseq;": "\u2a77",
"deg": "\xb0",
"deg;": "\xb0",
"delta;": "\u03b4",
"demptyv;": "\u29b1",
"dfisht;": "\u297f",
"dfr;": "\U0001d521",
"dharl;": "\u21c3",
"dharr;": "\u21c2",
"diam;": "\u22c4",
"diamond;": "\u22c4",
"diamondsuit;": "\u2666",
"diams;": "\u2666",
"die;": "\xa8",
"digamma;": "\u03dd",
"disin;": "\u22f2",
"div;": "\xf7",
"divide": "\xf7",
"divide;": "\xf7",
"divideontimes;": "\u22c7",
"divonx;": "\u22c7",
"djcy;": "\u0452",
"dlcorn;": "\u231e",
"dlcrop;": "\u230d",
"dollar;": "$",
"dopf;": "\U0001d555",
"dot;": "\u02d9",
"doteq;": "\u2250",
"doteqdot;": "\u2251",
"dotminus;": "\u2238",
"dotplus;": "\u2214",
"dotsquare;": "\u22a1",
"doublebarwedge;": "\u2306",
"downarrow;": "\u2193",
"downdownarrows;": "\u21ca",
"downharpoonleft;": "\u21c3",
"downharpoonright;": "\u21c2",
"drbkarow;": "\u2910",
"drcorn;": "\u231f",
"drcrop;": "\u230c",
"dscr;": "\U0001d4b9",
"dscy;": "\u0455",
"dsol;": "\u29f6",
"dstrok;": "\u0111",
"dtdot;": "\u22f1",
"dtri;": "\u25bf",
"dtrif;": "\u25be",
"duarr;": "\u21f5",
"duhar;": "\u296f",
"dwangle;": "\u29a6",
"dzcy;": "\u045f",
"dzigrarr;": "\u27ff",
"eDDot;": "\u2a77",
"eDot;": "\u2251",
"eacute": "\xe9",
"eacute;": "\xe9",
"easter;": "\u2a6e",
"ecaron;": "\u011b",
"ecir;": "\u2256",
"ecirc": "\xea",
"ecirc;": "\xea",
"ecolon;": "\u2255",
"ecy;": "\u044d",
"edot;": "\u0117",
"ee;": "\u2147",
"efDot;": "\u2252",
"efr;": "\U0001d522",
"eg;": "\u2a9a",
"egrave": "\xe8",
"egrave;": "\xe8",
"egs;": "\u2a96",
"egsdot;": "\u2a98",
"el;": "\u2a99",
"elinters;": "\u23e7",
"ell;": "\u2113",
"els;": "\u2a95",
"elsdot;": "\u2a97",
"emacr;": "\u0113",
"empty;": "\u2205",
"emptyset;": "\u2205",
"emptyv;": "\u2205",
"emsp13;": "\u2004",
"emsp14;": "\u2005",
"emsp;": "\u2003",
"eng;": "\u014b",
"ensp;": "\u2002",
"eogon;": "\u0119",
"eopf;": "\U0001d556",
"epar;": "\u22d5",
"eparsl;": "\u29e3",
"eplus;": "\u2a71",
"epsi;": "\u03b5",
"epsilon;": "\u03b5",
"epsiv;": "\u03f5",
"eqcirc;": "\u2256",
"eqcolon;": "\u2255",
"eqsim;": "\u2242",
"eqslantgtr;": "\u2a96",
"eqslantless;": "\u2a95",
"equals;": "=",
"equest;": "\u225f",
"equiv;": "\u2261",
"equivDD;": "\u2a78",
"eqvparsl;": "\u29e5",
"erDot;": "\u2253",
"erarr;": "\u2971",
"escr;": "\u212f",
"esdot;": "\u2250",
"esim;": "\u2242",
"eta;": "\u03b7",
"eth": "\xf0",
"eth;": "\xf0",
"euml": "\xeb",
"euml;": "\xeb",
"euro;": "\u20ac",
"excl;": "!",
"exist;": "\u2203",
"expectation;": "\u2130",
"exponentiale;": "\u2147",
"fallingdotseq;": "\u2252",
"fcy;": "\u0444",
"female;": "\u2640",
"ffilig;": "\ufb03",
"fflig;": "\ufb00",
"ffllig;": "\ufb04",
"ffr;": "\U0001d523",
"filig;": "\ufb01",
"fjlig;": "fj",
"flat;": "\u266d",
"fllig;": "\ufb02",
"fltns;": "\u25b1",
"fnof;": "\u0192",
"fopf;": "\U0001d557",
"forall;": "\u2200",
"fork;": "\u22d4",
"forkv;": "\u2ad9",
"fpartint;": "\u2a0d",
"frac12": "\xbd",
"frac12;": "\xbd",
"frac13;": "\u2153",
"frac14": "\xbc",
"frac14;": "\xbc",
"frac15;": "\u2155",
"frac16;": "\u2159",
"frac18;": "\u215b",
"frac23;": "\u2154",
"frac25;": "\u2156",
"frac34": "\xbe",
"frac34;": "\xbe",
"frac35;": "\u2157",
"frac38;": "\u215c",
"frac45;": "\u2158",
"frac56;": "\u215a",
"frac58;": "\u215d",
"frac78;": "\u215e",
"frasl;": "\u2044",
"frown;": "\u2322",
"fscr;": "\U0001d4bb",
"gE;": "\u2267",
"gEl;": "\u2a8c",
"gacute;": "\u01f5",
"gamma;": "\u03b3",
"gammad;": "\u03dd",
"gap;": "\u2a86",
"gbreve;": "\u011f",
"gcirc;": "\u011d",
"gcy;": "\u0433",
"gdot;": "\u0121",
"ge;": "\u2265",
"gel;": "\u22db",
"geq;": "\u2265",
"geqq;": "\u2267",
"geqslant;": "\u2a7e",
"ges;": "\u2a7e",
"gescc;": "\u2aa9",
"gesdot;": "\u2a80",
"gesdoto;": "\u2a82",
"gesdotol;": "\u2a84",
"gesl;": "\u22db\ufe00",
"gesles;": "\u2a94",
"gfr;": "\U0001d524",
"gg;": "\u226b",
"ggg;": "\u22d9",
"gimel;": "\u2137",
"gjcy;": "\u0453",
"gl;": "\u2277",
"glE;": "\u2a92",
"gla;": "\u2aa5",
"glj;": "\u2aa4",
"gnE;": "\u2269",
"gnap;": "\u2a8a",
"gnapprox;": "\u2a8a",
"gne;": "\u2a88",
"gneq;": "\u2a88",
"gneqq;": "\u2269",
"gnsim;": "\u22e7",
"gopf;": "\U0001d558",
"grave;": "`",
"gscr;": "\u210a",
"gsim;": "\u2273",
"gsime;": "\u2a8e",
"gsiml;": "\u2a90",
"gt": ">",
"gt;": ">",
"gtcc;": "\u2aa7",
"gtcir;": "\u2a7a",
"gtdot;": "\u22d7",
"gtlPar;": "\u2995",
"gtquest;": "\u2a7c",
"gtrapprox;": "\u2a86",
"gtrarr;": "\u2978",
"gtrdot;": "\u22d7",
"gtreqless;": "\u22db",
"gtreqqless;": "\u2a8c",
"gtrless;": "\u2277",
"gtrsim;": "\u2273",
"gvertneqq;": "\u2269\ufe00",
"gvnE;": "\u2269\ufe00",
"hArr;": "\u21d4",
"hairsp;": "\u200a",
"half;": "\xbd",
"hamilt;": "\u210b",
"hardcy;": "\u044a",
"harr;": "\u2194",
"harrcir;": "\u2948",
"harrw;": "\u21ad",
"hbar;": "\u210f",
"hcirc;": "\u0125",
"hearts;": "\u2665",
"heartsuit;": "\u2665",
"hellip;": "\u2026",
"hercon;": "\u22b9",
"hfr;": "\U0001d525",
"hksearow;": "\u2925",
"hkswarow;": "\u2926",
"hoarr;": "\u21ff",
"homtht;": "\u223b",
"hookleftarrow;": "\u21a9",
"hookrightarrow;": "\u21aa",
"hopf;": "\U0001d559",
"horbar;": "\u2015",
"hscr;": "\U0001d4bd",
"hslash;": "\u210f",
"hstrok;": "\u0127",
"hybull;": "\u2043",
"hyphen;": "\u2010",
"iacute": "\xed",
"iacute;": "\xed",
"ic;": "\u2063",
"icirc": "\xee",
"icirc;": "\xee",
"icy;": "\u0438",
"iecy;": "\u0435",
"iexcl": "\xa1",
"iexcl;": "\xa1",
"iff;": "\u21d4",
"ifr;": "\U0001d526",
"igrave": "\xec",
"igrave;": "\xec",
"ii;": "\u2148",
"iiiint;": "\u2a0c",
"iiint;": "\u222d",
"iinfin;": "\u29dc",
"iiota;": "\u2129",
"ijlig;": "\u0133",
"imacr;": "\u012b",
"image;": "\u2111",
"imagline;": "\u2110",
"imagpart;": "\u2111",
"imath;": "\u0131",
"imof;": "\u22b7",
"imped;": "\u01b5",
"in;": "\u2208",
"incare;": "\u2105",
"infin;": "\u221e",
"infintie;": "\u29dd",
"inodot;": "\u0131",
"int;": "\u222b",
"intcal;": "\u22ba",
"integers;": "\u2124",
"intercal;": "\u22ba",
"intlarhk;": "\u2a17",
"intprod;": "\u2a3c",
"iocy;": "\u0451",
"iogon;": "\u012f",
"iopf;": "\U0001d55a",
"iota;": "\u03b9",
"iprod;": "\u2a3c",
"iquest": "\xbf",
"iquest;": "\xbf",
"iscr;": "\U0001d4be",
"isin;": "\u2208",
"isinE;": "\u22f9",
"isindot;": "\u22f5",
"isins;": "\u22f4",
"isinsv;": "\u22f3",
"isinv;": "\u2208",
"it;": "\u2062",
"itilde;": "\u0129",
"iukcy;": "\u0456",
"iuml": "\xef",
"iuml;": "\xef",
"jcirc;": "\u0135",
"jcy;": "\u0439",
"jfr;": "\U0001d527",
"jmath;": "\u0237",
"jopf;": "\U0001d55b",
"jscr;": "\U0001d4bf",
"jsercy;": "\u0458",
"jukcy;": "\u0454",
"kappa;": "\u03ba",
"kappav;": "\u03f0",
"kcedil;": "\u0137",
"kcy;": "\u043a",
"kfr;": "\U0001d528",
"kgreen;": "\u0138",
"khcy;": "\u0445",
"kjcy;": "\u045c",
"kopf;": "\U0001d55c",
"kscr;": "\U0001d4c0",
"lAarr;": "\u21da",
"lArr;": "\u21d0",
"lAtail;": "\u291b",
"lBarr;": "\u290e",
"lE;": "\u2266",
"lEg;": "\u2a8b",
"lHar;": "\u2962",
"lacute;": "\u013a",
"laemptyv;": "\u29b4",
"lagran;": "\u2112",
"lambda;": "\u03bb",
"lang;": "\u27e8",
"langd;": "\u2991",
"langle;": "\u27e8",
"lap;": "\u2a85",
"laquo": "\xab",
"laquo;": "\xab",
"larr;": "\u2190",
"larrb;": "\u21e4",
"larrbfs;": "\u291f",
"larrfs;": "\u291d",
"larrhk;": "\u21a9",
"larrlp;": "\u21ab",
"larrpl;": "\u2939",
"larrsim;": "\u2973",
"larrtl;": "\u21a2",
"lat;": "\u2aab",
"latail;": "\u2919",
"late;": "\u2aad",
"lates;": "\u2aad\ufe00",
"lbarr;": "\u290c",
"lbbrk;": "\u2772",
"lbrace;": "{",
"lbrack;": "[",
"lbrke;": "\u298b",
"lbrksld;": "\u298f",
"lbrkslu;": "\u298d",
"lcaron;": "\u013e",
"lcedil;": "\u013c",
"lceil;": "\u2308",
"lcub;": "{",
"lcy;": "\u043b",
"ldca;": "\u2936",
"ldquo;": "\u201c",
"ldquor;": "\u201e",
"ldrdhar;": "\u2967",
"ldrushar;": "\u294b",
"ldsh;": "\u21b2",
"le;": "\u2264",
"leftarrow;": "\u2190",
"leftarrowtail;": "\u21a2",
"leftharpoondown;": "\u21bd",
"leftharpoonup;": "\u21bc",
"leftleftarrows;": "\u21c7",
"leftrightarrow;": "\u2194",
"leftrightarrows;": "\u21c6",
"leftrightharpoons;": "\u21cb",
"leftrightsquigarrow;": "\u21ad",
"leftthreetimes;": "\u22cb",
"leg;": "\u22da",
"leq;": "\u2264",
"leqq;": "\u2266",
"leqslant;": "\u2a7d",
"les;": "\u2a7d",
"lescc;": "\u2aa8",
"lesdot;": "\u2a7f",
"lesdoto;": "\u2a81",
"lesdotor;": "\u2a83",
"lesg;": "\u22da\ufe00",
"lesges;": "\u2a93",
"lessapprox;": "\u2a85",
"lessdot;": "\u22d6",
"lesseqgtr;": "\u22da",
"lesseqqgtr;": "\u2a8b",
"lessgtr;": "\u2276",
"lesssim;": "\u2272",
"lfisht;": "\u297c",
"lfloor;": "\u230a",
"lfr;": "\U0001d529",
"lg;": "\u2276",
"lgE;": "\u2a91",
"lhard;": "\u21bd",
"lharu;": "\u21bc",
"lharul;": "\u296a",
"lhblk;": "\u2584",
"ljcy;": "\u0459",
"ll;": "\u226a",
"llarr;": "\u21c7",
"llcorner;": "\u231e",
"llhard;": "\u296b",
"lltri;": "\u25fa",
"lmidot;": "\u0140",
"lmoust;": "\u23b0",
"lmoustache;": "\u23b0",
"lnE;": "\u2268",
"lnap;": "\u2a89",
"lnapprox;": "\u2a89",
"lne;": "\u2a87",
"lneq;": "\u2a87",
"lneqq;": "\u2268",
"lnsim;": "\u22e6",
"loang;": "\u27ec",
"loarr;": "\u21fd",
"lobrk;": "\u27e6",
"longleftarrow;": "\u27f5",
"longleftrightarrow;": "\u27f7",
"longmapsto;": "\u27fc",
"longrightarrow;": "\u27f6",
"looparrowleft;": "\u21ab",
"looparrowright;": "\u21ac",
"lopar;": "\u2985",
"lopf;": "\U0001d55d",
"loplus;": "\u2a2d",
"lotimes;": "\u2a34",
"lowast;": "\u2217",
"lowbar;": "_",
"loz;": "\u25ca",
"lozenge;": "\u25ca",
"lozf;": "\u29eb",
"lpar;": "(",
"lparlt;": "\u2993",
"lrarr;": "\u21c6",
"lrcorner;": "\u231f",
"lrhar;": "\u21cb",
"lrhard;": "\u296d",
"lrm;": "\u200e",
"lrtri;": "\u22bf",
"lsaquo;": "\u2039",
"lscr;": "\U0001d4c1",
"lsh;": "\u21b0",
"lsim;": "\u2272",
"lsime;": "\u2a8d",
"lsimg;": "\u2a8f",
"lsqb;": "[",
"lsquo;": "\u2018",
"lsquor;": "\u201a",
"lstrok;": "\u0142",
"lt": "<",
"lt;": "<",
"ltcc;": "\u2aa6",
"ltcir;": "\u2a79",
"ltdot;": "\u22d6",
"lthree;": "\u22cb",
"ltimes;": "\u22c9",
"ltlarr;": "\u2976",
"ltquest;": "\u2a7b",
"ltrPar;": "\u2996",
"ltri;": "\u25c3",
"ltrie;": "\u22b4",
"ltrif;": "\u25c2",
"lurdshar;": "\u294a",
"luruhar;": "\u2966",
"lvertneqq;": "\u2268\ufe00",
"lvnE;": "\u2268\ufe00",
"mDDot;": "\u223a",
"macr": "\xaf",
"macr;": "\xaf",
"male;": "\u2642",
"malt;": "\u2720",
"maltese;": "\u2720",
"map;": "\u21a6",
"mapsto;": "\u21a6",
"mapstodown;": "\u21a7",
"mapstoleft;": "\u21a4",
"mapstoup;": "\u21a5",
"marker;": "\u25ae",
"mcomma;": "\u2a29",
"mcy;": "\u043c",
"mdash;": "\u2014",
"measuredangle;": "\u2221",
"mfr;": "\U0001d52a",
"mho;": "\u2127",
"micro": "\xb5",
"micro;": "\xb5",
"mid;": "\u2223",
"midast;": "*",
"midcir;": "\u2af0",
"middot": "\xb7",
"middot;": "\xb7",
"minus;": "\u2212",
"minusb;": "\u229f",
"minusd;": "\u2238",
"minusdu;": "\u2a2a",
"mlcp;": "\u2adb",
"mldr;": "\u2026",
"mnplus;": "\u2213",
"models;": "\u22a7",
"mopf;": "\U0001d55e",
"mp;": "\u2213",
"mscr;": "\U0001d4c2",
"mstpos;": "\u223e",
"mu;": "\u03bc",
"multimap;": "\u22b8",
"mumap;": "\u22b8",
"nGg;": "\u22d9\u0338",
"nGt;": "\u226b\u20d2",
"nGtv;": "\u226b\u0338",
"nLeftarrow;": "\u21cd",
"nLeftrightarrow;": "\u21ce",
"nLl;": "\u22d8\u0338",
"nLt;": "\u226a\u20d2",
"nLtv;": "\u226a\u0338",
"nRightarrow;": "\u21cf",
"nVDash;": "\u22af",
"nVdash;": "\u22ae",
"nabla;": "\u2207",
"nacute;": "\u0144",
"nang;": "\u2220\u20d2",
"nap;": "\u2249",
"napE;": "\u2a70\u0338",
"napid;": "\u224b\u0338",
"napos;": "\u0149",
"napprox;": "\u2249",
"natur;": "\u266e",
"natural;": "\u266e",
"naturals;": "\u2115",
"nbsp": "\xa0",
"nbsp;": "\xa0",
"nbump;": "\u224e\u0338",
"nbumpe;": "\u224f\u0338",
"ncap;": "\u2a43",
"ncaron;": "\u0148",
"ncedil;": "\u0146",
"ncong;": "\u2247",
"ncongdot;": "\u2a6d\u0338",
"ncup;": "\u2a42",
"ncy;": "\u043d",
"ndash;": "\u2013",
"ne;": "\u2260",
"neArr;": "\u21d7",
"nearhk;": "\u2924",
"nearr;": "\u2197",
"nearrow;": "\u2197",
"nedot;": "\u2250\u0338",
"nequiv;": "\u2262",
"nesear;": "\u2928",
"nesim;": "\u2242\u0338",
"nexist;": "\u2204",
"nexists;": "\u2204",
"nfr;": "\U0001d52b",
"ngE;": "\u2267\u0338",
"nge;": "\u2271",
"ngeq;": "\u2271",
"ngeqq;": "\u2267\u0338",
"ngeqslant;": "\u2a7e\u0338",
"nges;": "\u2a7e\u0338",
"ngsim;": "\u2275",
"ngt;": "\u226f",
"ngtr;": "\u226f",
"nhArr;": "\u21ce",
"nharr;": "\u21ae",
"nhpar;": "\u2af2",
"ni;": "\u220b",
"nis;": "\u22fc",
"nisd;": "\u22fa",
"niv;": "\u220b",
"njcy;": "\u045a",
"nlArr;": "\u21cd",
"nlE;": "\u2266\u0338",
"nlarr;": "\u219a",
"nldr;": "\u2025",
"nle;": "\u2270",
"nleftarrow;": "\u219a",
"nleftrightarrow;": "\u21ae",
"nleq;": "\u2270",
"nleqq;": "\u2266\u0338",
"nleqslant;": "\u2a7d\u0338",
"nles;": "\u2a7d\u0338",
"nless;": "\u226e",
"nlsim;": "\u2274",
"nlt;": "\u226e",
"nltri;": "\u22ea",
"nltrie;": "\u22ec",
"nmid;": "\u2224",
"nopf;": "\U0001d55f",
"not": "\xac",
"not;": "\xac",
"notin;": "\u2209",
"notinE;": "\u22f9\u0338",
"notindot;": "\u22f5\u0338",
"notinva;": "\u2209",
"notinvb;": "\u22f7",
"notinvc;": "\u22f6",
"notni;": "\u220c",
"notniva;": "\u220c",
"notnivb;": "\u22fe",
"notnivc;": "\u22fd",
"npar;": "\u2226",
"nparallel;": "\u2226",
"nparsl;": "\u2afd\u20e5",
"npart;": "\u2202\u0338",
"npolint;": "\u2a14",
"npr;": "\u2280",
"nprcue;": "\u22e0",
"npre;": "\u2aaf\u0338",
"nprec;": "\u2280",
"npreceq;": "\u2aaf\u0338",
"nrArr;": "\u21cf",
"nrarr;": "\u219b",
"nrarrc;": "\u2933\u0338",
"nrarrw;": "\u219d\u0338",
"nrightarrow;": "\u219b",
"nrtri;": "\u22eb",
"nrtrie;": "\u22ed",
"nsc;": "\u2281",
"nsccue;": "\u22e1",
"nsce;": "\u2ab0\u0338",
"nscr;": "\U0001d4c3",
"nshortmid;": "\u2224",
"nshortparallel;": "\u2226",
"nsim;": "\u2241",
"nsime;": "\u2244",
"nsimeq;": "\u2244",
"nsmid;": "\u2224",
"nspar;": "\u2226",
"nsqsube;": "\u22e2",
"nsqsupe;": "\u22e3",
"nsub;": "\u2284",
"nsubE;": "\u2ac5\u0338",
"nsube;": "\u2288",
"nsubset;": "\u2282\u20d2",
"nsubseteq;": "\u2288",
"nsubseteqq;": "\u2ac5\u0338",
"nsucc;": "\u2281",
"nsucceq;": "\u2ab0\u0338",
"nsup;": "\u2285",
"nsupE;": "\u2ac6\u0338",
"nsupe;": "\u2289",
"nsupset;": "\u2283\u20d2",
"nsupseteq;": "\u2289",
"nsupseteqq;": "\u2ac6\u0338",
"ntgl;": "\u2279",
"ntilde": "\xf1",
"ntilde;": "\xf1",
"ntlg;": "\u2278",
"ntriangleleft;": "\u22ea",
"ntrianglelefteq;": "\u22ec",
"ntriangleright;": "\u22eb",
"ntrianglerighteq;": "\u22ed",
"nu;": "\u03bd",
"num;": "#",
"numero;": "\u2116",
"numsp;": "\u2007",
"nvDash;": "\u22ad",
"nvHarr;": "\u2904",
"nvap;": "\u224d\u20d2",
"nvdash;": "\u22ac",
"nvge;": "\u2265\u20d2",
"nvgt;": ">\u20d2",
"nvinfin;": "\u29de",
"nvlArr;": "\u2902",
"nvle;": "\u2264\u20d2",
"nvlt;": "<\u20d2",
"nvltrie;": "\u22b4\u20d2",
"nvrArr;": "\u2903",
"nvrtrie;": "\u22b5\u20d2",
"nvsim;": "\u223c\u20d2",
"nwArr;": "\u21d6",
"nwarhk;": "\u2923",
"nwarr;": "\u2196",
"nwarrow;": "\u2196",
"nwnear;": "\u2927",
"oS;": "\u24c8",
"oacute": "\xf3",
"oacute;": "\xf3",
"oast;": "\u229b",
"ocir;": "\u229a",
"ocirc": "\xf4",
"ocirc;": "\xf4",
"ocy;": "\u043e",
"odash;": "\u229d",
"odblac;": "\u0151",
"odiv;": "\u2a38",
"odot;": "\u2299",
"odsold;": "\u29bc",
"oelig;": "\u0153",
"ofcir;": "\u29bf",
"ofr;": "\U0001d52c",
"ogon;": "\u02db",
"ograve": "\xf2",
"ograve;": "\xf2",
"ogt;": "\u29c1",
"ohbar;": "\u29b5",
"ohm;": "\u03a9",
"oint;": "\u222e",
"olarr;": "\u21ba",
"olcir;": "\u29be",
"olcross;": "\u29bb",
"oline;": "\u203e",
"olt;": "\u29c0",
"omacr;": "\u014d",
"omega;": "\u03c9",
"omicron;": "\u03bf",
"omid;": "\u29b6",
"ominus;": "\u2296",
"oopf;": "\U0001d560",
"opar;": "\u29b7",
"operp;": "\u29b9",
"oplus;": "\u2295",
"or;": "\u2228",
"orarr;": "\u21bb",
"ord;": "\u2a5d",
"order;": "\u2134",
"orderof;": "\u2134",
"ordf": "\xaa",
"ordf;": "\xaa",
"ordm": "\xba",
"ordm;": "\xba",
"origof;": "\u22b6",
"oror;": "\u2a56",
"orslope;": "\u2a57",
"orv;": "\u2a5b",
"oscr;": "\u2134",
"oslash": "\xf8",
"oslash;": "\xf8",
"osol;": "\u2298",
"otilde": "\xf5",
"otilde;": "\xf5",
"otimes;": "\u2297",
"otimesas;": "\u2a36",
"ouml": "\xf6",
"ouml;": "\xf6",
"ovbar;": "\u233d",
"par;": "\u2225",
"para": "\xb6",
"para;": "\xb6",
"parallel;": "\u2225",
"parsim;": "\u2af3",
"parsl;": "\u2afd",
"part;": "\u2202",
"pcy;": "\u043f",
"percnt;": "%",
"period;": ".",
"permil;": "\u2030",
"perp;": "\u22a5",
"pertenk;": "\u2031",
"pfr;": "\U0001d52d",
"phi;": "\u03c6",
"phiv;": "\u03d5",
"phmmat;": "\u2133",
"phone;": "\u260e",
"pi;": "\u03c0",
"pitchfork;": "\u22d4",
"piv;": "\u03d6",
"planck;": "\u210f",
"planckh;": "\u210e",
"plankv;": "\u210f",
"plus;": "+",
"plusacir;": "\u2a23",
"plusb;": "\u229e",
"pluscir;": "\u2a22",
"plusdo;": "\u2214",
"plusdu;": "\u2a25",
"pluse;": "\u2a72",
"plusmn": "\xb1",
"plusmn;": "\xb1",
"plussim;": "\u2a26",
"plustwo;": "\u2a27",
"pm;": "\xb1",
"pointint;": "\u2a15",
"popf;": "\U0001d561",
"pound": "\xa3",
"pound;": "\xa3",
"pr;": "\u227a",
"prE;": "\u2ab3",
"prap;": "\u2ab7",
"prcue;": "\u227c",
"pre;": "\u2aaf",
"prec;": "\u227a",
"precapprox;": "\u2ab7",
"preccurlyeq;": "\u227c",
"preceq;": "\u2aaf",
"precnapprox;": "\u2ab9",
"precneqq;": "\u2ab5",
"precnsim;": "\u22e8",
"precsim;": "\u227e",
"prime;": "\u2032",
"primes;": "\u2119",
"prnE;": "\u2ab5",
"prnap;": "\u2ab9",
"prnsim;": "\u22e8",
"prod;": "\u220f",
"profalar;": "\u232e",
"profline;": "\u2312",
"profsurf;": "\u2313",
"prop;": "\u221d",
"propto;": "\u221d",
"prsim;": "\u227e",
"prurel;": "\u22b0",
"pscr;": "\U0001d4c5",
"psi;": "\u03c8",
"puncsp;": "\u2008",
"qfr;": "\U0001d52e",
"qint;": "\u2a0c",
"qopf;": "\U0001d562",
"qprime;": "\u2057",
"qscr;": "\U0001d4c6",
"quaternions;": "\u210d",
"quatint;": "\u2a16",
"quest;": "?",
"questeq;": "\u225f",
"quot": "\"",
"quot;": "\"",
"rAarr;": "\u21db",
"rArr;": "\u21d2",
"rAtail;": "\u291c",
"rBarr;": "\u290f",
"rHar;": "\u2964",
"race;": "\u223d\u0331",
"racute;": "\u0155",
"radic;": "\u221a",
"raemptyv;": "\u29b3",
"rang;": "\u27e9",
"rangd;": "\u2992",
"range;": "\u29a5",
"rangle;": "\u27e9",
"raquo": "\xbb",
"raquo;": "\xbb",
"rarr;": "\u2192",
"rarrap;": "\u2975",
"rarrb;": "\u21e5",
"rarrbfs;": "\u2920",
"rarrc;": "\u2933",
"rarrfs;": "\u291e",
"rarrhk;": "\u21aa",
"rarrlp;": "\u21ac",
"rarrpl;": "\u2945",
"rarrsim;": "\u2974",
"rarrtl;": "\u21a3",
"rarrw;": "\u219d",
"ratail;": "\u291a",
"ratio;": "\u2236",
"rationals;": "\u211a",
"rbarr;": "\u290d",
"rbbrk;": "\u2773",
"rbrace;": "}",
"rbrack;": "]",
"rbrke;": "\u298c",
"rbrksld;": "\u298e",
"rbrkslu;": "\u2990",
"rcaron;": "\u0159",
"rcedil;": "\u0157",
"rceil;": "\u2309",
"rcub;": "}",
"rcy;": "\u0440",
"rdca;": "\u2937",
"rdldhar;": "\u2969",
"rdquo;": "\u201d",
"rdquor;": "\u201d",
"rdsh;": "\u21b3",
"real;": "\u211c",
"realine;": "\u211b",
"realpart;": "\u211c",
"reals;": "\u211d",
"rect;": "\u25ad",
"reg": "\xae",
"reg;": "\xae",
"rfisht;": "\u297d",
"rfloor;": "\u230b",
"rfr;": "\U0001d52f",
"rhard;": "\u21c1",
"rharu;": "\u21c0",
"rharul;": "\u296c",
"rho;": "\u03c1",
"rhov;": "\u03f1",
"rightarrow;": "\u2192",
"rightarrowtail;": "\u21a3",
"rightharpoondown;": "\u21c1",
"rightharpoonup;": "\u21c0",
"rightleftarrows;": "\u21c4",
"rightleftharpoons;": "\u21cc",
"rightrightarrows;": "\u21c9",
"rightsquigarrow;": "\u219d",
"rightthreetimes;": "\u22cc",
"ring;": "\u02da",
"risingdotseq;": "\u2253",
"rlarr;": "\u21c4",
"rlhar;": "\u21cc",
"rlm;": "\u200f",
"rmoust;": "\u23b1",
"rmoustache;": "\u23b1",
"rnmid;": "\u2aee",
"roang;": "\u27ed",
"roarr;": "\u21fe",
"robrk;": "\u27e7",
"ropar;": "\u2986",
"ropf;": "\U0001d563",
"roplus;": "\u2a2e",
"rotimes;": "\u2a35",
"rpar;": ")",
"rpargt;": "\u2994",
"rppolint;": "\u2a12",
"rrarr;": "\u21c9",
"rsaquo;": "\u203a",
"rscr;": "\U0001d4c7",
"rsh;": "\u21b1",
"rsqb;": "]",
"rsquo;": "\u2019",
"rsquor;": "\u2019",
"rthree;": "\u22cc",
"rtimes;": "\u22ca",
"rtri;": "\u25b9",
"rtrie;": "\u22b5",
"rtrif;": "\u25b8",
"rtriltri;": "\u29ce",
"ruluhar;": "\u2968",
"rx;": "\u211e",
"sacute;": "\u015b",
"sbquo;": "\u201a",
"sc;": "\u227b",
"scE;": "\u2ab4",
"scap;": "\u2ab8",
"scaron;": "\u0161",
"sccue;": "\u227d",
"sce;": "\u2ab0",
"scedil;": "\u015f",
"scirc;": "\u015d",
"scnE;": "\u2ab6",
"scnap;": "\u2aba",
"scnsim;": "\u22e9",
"scpolint;": "\u2a13",
"scsim;": "\u227f",
"scy;": "\u0441",
"sdot;": "\u22c5",
"sdotb;": "\u22a1",
"sdote;": "\u2a66",
"seArr;": "\u21d8",
"searhk;": "\u2925",
"searr;": "\u2198",
"searrow;": "\u2198",
"sect": "\xa7",
"sect;": "\xa7",
"semi;": ";",
"seswar;": "\u2929",
"setminus;": "\u2216",
"setmn;": "\u2216",
"sext;": "\u2736",
"sfr;": "\U0001d530",
"sfrown;": "\u2322",
"sharp;": "\u266f",
"shchcy;": "\u0449",
"shcy;": "\u0448",
"shortmid;": "\u2223",
"shortparallel;": "\u2225",
"shy": "\xad",
"shy;": "\xad",
"sigma;": "\u03c3",
"sigmaf;": "\u03c2",
"sigmav;": "\u03c2",
"sim;": "\u223c",
"simdot;": "\u2a6a",
"sime;": "\u2243",
"simeq;": "\u2243",
"simg;": "\u2a9e",
"simgE;": "\u2aa0",
"siml;": "\u2a9d",
"simlE;": "\u2a9f",
"simne;": "\u2246",
"simplus;": "\u2a24",
"simrarr;": "\u2972",
"slarr;": "\u2190",
"smallsetminus;": "\u2216",
"smashp;": "\u2a33",
"smeparsl;": "\u29e4",
"smid;": "\u2223",
"smile;": "\u2323",
"smt;": "\u2aaa",
"smte;": "\u2aac",
"smtes;": "\u2aac\ufe00",
"softcy;": "\u044c",
"sol;": "/",
"solb;": "\u29c4",
"solbar;": "\u233f",
"sopf;": "\U0001d564",
"spades;": "\u2660",
"spadesuit;": "\u2660",
"spar;": "\u2225",
"sqcap;": "\u2293",
"sqcaps;": "\u2293\ufe00",
"sqcup;": "\u2294",
"sqcups;": "\u2294\ufe00",
"sqsub;": "\u228f",
"sqsube;": "\u2291",
"sqsubset;": "\u228f",
"sqsubseteq;": "\u2291",
"sqsup;": "\u2290",
"sqsupe;": "\u2292",
"sqsupset;": "\u2290",
"sqsupseteq;": "\u2292",
"squ;": "\u25a1",
"square;": "\u25a1",
"squarf;": "\u25aa",
"squf;": "\u25aa",
"srarr;": "\u2192",
"sscr;": "\U0001d4c8",
"ssetmn;": "\u2216",
"ssmile;": "\u2323",
"sstarf;": "\u22c6",
"star;": "\u2606",
"starf;": "\u2605",
"straightepsilon;": "\u03f5",
"straightphi;": "\u03d5",
"strns;": "\xaf",
"sub;": "\u2282",
"subE;": "\u2ac5",
"subdot;": "\u2abd",
"sube;": "\u2286",
"subedot;": "\u2ac3",
"submult;": "\u2ac1",
"subnE;": "\u2acb",
"subne;": "\u228a",
"subplus;": "\u2abf",
"subrarr;": "\u2979",
"subset;": "\u2282",
"subseteq;": "\u2286",
"subseteqq;": "\u2ac5",
"subsetneq;": "\u228a",
"subsetneqq;": "\u2acb",
"subsim;": "\u2ac7",
"subsub;": "\u2ad5",
"subsup;": "\u2ad3",
"succ;": "\u227b",
"succapprox;": "\u2ab8",
"succcurlyeq;": "\u227d",
"succeq;": "\u2ab0",
"succnapprox;": "\u2aba",
"succneqq;": "\u2ab6",
"succnsim;": "\u22e9",
"succsim;": "\u227f",
"sum;": "\u2211",
"sung;": "\u266a",
"sup1": "\xb9",
"sup1;": "\xb9",
"sup2": "\xb2",
"sup2;": "\xb2",
"sup3": "\xb3",
"sup3;": "\xb3",
"sup;": "\u2283",
"supE;": "\u2ac6",
"supdot;": "\u2abe",
"supdsub;": "\u2ad8",
"supe;": "\u2287",
"supedot;": "\u2ac4",
"suphsol;": "\u27c9",
"suphsub;": "\u2ad7",
"suplarr;": "\u297b",
"supmult;": "\u2ac2",
"supnE;": "\u2acc",
"supne;": "\u228b",
"supplus;": "\u2ac0",
"supset;": "\u2283",
"supseteq;": "\u2287",
"supseteqq;": "\u2ac6",
"supsetneq;": "\u228b",
"supsetneqq;": "\u2acc",
"supsim;": "\u2ac8",
"supsub;": "\u2ad4",
"supsup;": "\u2ad6",
"swArr;": "\u21d9",
"swarhk;": "\u2926",
"swarr;": "\u2199",
"swarrow;": "\u2199",
"swnwar;": "\u292a",
"szlig": "\xdf",
"szlig;": "\xdf",
"target;": "\u2316",
"tau;": "\u03c4",
"tbrk;": "\u23b4",
"tcaron;": "\u0165",
"tcedil;": "\u0163",
"tcy;": "\u0442",
"tdot;": "\u20db",
"telrec;": "\u2315",
"tfr;": "\U0001d531",
"there4;": "\u2234",
"therefore;": "\u2234",
"theta;": "\u03b8",
"thetasym;": "\u03d1",
"thetav;": "\u03d1",
"thickapprox;": "\u2248",
"thicksim;": "\u223c",
"thinsp;": "\u2009",
"thkap;": "\u2248",
"thksim;": "\u223c",
"thorn": "\xfe",
"thorn;": "\xfe",
"tilde;": "\u02dc",
"times": "\xd7",
"times;": "\xd7",
"timesb;": "\u22a0",
"timesbar;": "\u2a31",
"timesd;": "\u2a30",
"tint;": "\u222d",
"toea;": "\u2928",
"top;": "\u22a4",
"topbot;": "\u2336",
"topcir;": "\u2af1",
"topf;": "\U0001d565",
"topfork;": "\u2ada",
"tosa;": "\u2929",
"tprime;": "\u2034",
"trade;": "\u2122",
"triangle;": "\u25b5",
"triangledown;": "\u25bf",
"triangleleft;": "\u25c3",
"trianglelefteq;": "\u22b4",
"triangleq;": "\u225c",
"triangleright;": "\u25b9",
"trianglerighteq;": "\u22b5",
"tridot;": "\u25ec",
"trie;": "\u225c",
"triminus;": "\u2a3a",
"triplus;": "\u2a39",
"trisb;": "\u29cd",
"tritime;": "\u2a3b",
"trpezium;": "\u23e2",
"tscr;": "\U0001d4c9",
"tscy;": "\u0446",
"tshcy;": "\u045b",
"tstrok;": "\u0167",
"twixt;": "\u226c",
"twoheadleftarrow;": "\u219e",
"twoheadrightarrow;": "\u21a0",
"uArr;": "\u21d1",
"uHar;": "\u2963",
"uacute": "\xfa",
"uacute;": "\xfa",
"uarr;": "\u2191",
"ubrcy;": "\u045e",
"ubreve;": "\u016d",
"ucirc": "\xfb",
"ucirc;": "\xfb",
"ucy;": "\u0443",
"udarr;": "\u21c5",
"udblac;": "\u0171",
"udhar;": "\u296e",
"ufisht;": "\u297e",
"ufr;": "\U0001d532",
"ugrave": "\xf9",
"ugrave;": "\xf9",
"uharl;": "\u21bf",
"uharr;": "\u21be",
"uhblk;": "\u2580",
"ulcorn;": "\u231c",
"ulcorner;": "\u231c",
"ulcrop;": "\u230f",
"ultri;": "\u25f8",
"umacr;": "\u016b",
"uml": "\xa8",
"uml;": "\xa8",
"uogon;": "\u0173",
"uopf;": "\U0001d566",
"uparrow;": "\u2191",
"updownarrow;": "\u2195",
"upharpoonleft;": "\u21bf",
"upharpoonright;": "\u21be",
"uplus;": "\u228e",
"upsi;": "\u03c5",
"upsih;": "\u03d2",
"upsilon;": "\u03c5",
"upuparrows;": "\u21c8",
"urcorn;": "\u231d",
"urcorner;": "\u231d",
"urcrop;": "\u230e",
"uring;": "\u016f",
"urtri;": "\u25f9",
"uscr;": "\U0001d4ca",
"utdot;": "\u22f0",
"utilde;": "\u0169",
"utri;": "\u25b5",
"utrif;": "\u25b4",
"uuarr;": "\u21c8",
"uuml": "\xfc",
"uuml;": "\xfc",
"uwangle;": "\u29a7",
"vArr;": "\u21d5",
"vBar;": "\u2ae8",
"vBarv;": "\u2ae9",
"vDash;": "\u22a8",
"vangrt;": "\u299c",
"varepsilon;": "\u03f5",
"varkappa;": "\u03f0",
"varnothing;": "\u2205",
"varphi;": "\u03d5",
"varpi;": "\u03d6",
"varpropto;": "\u221d",
"varr;": "\u2195",
"varrho;": "\u03f1",
"varsigma;": "\u03c2",
"varsubsetneq;": "\u228a\ufe00",
"varsubsetneqq;": "\u2acb\ufe00",
"varsupsetneq;": "\u228b\ufe00",
"varsupsetneqq;": "\u2acc\ufe00",
"vartheta;": "\u03d1",
"vartriangleleft;": "\u22b2",
"vartriangleright;": "\u22b3",
"vcy;": "\u0432",
"vdash;": "\u22a2",
"vee;": "\u2228",
"veebar;": "\u22bb",
"veeeq;": "\u225a",
"vellip;": "\u22ee",
"verbar;": "|",
"vert;": "|",
"vfr;": "\U0001d533",
"vltri;": "\u22b2",
"vnsub;": "\u2282\u20d2",
"vnsup;": "\u2283\u20d2",
"vopf;": "\U0001d567",
"vprop;": "\u221d",
"vrtri;": "\u22b3",
"vscr;": "\U0001d4cb",
"vsubnE;": "\u2acb\ufe00",
"vsubne;": "\u228a\ufe00",
"vsupnE;": "\u2acc\ufe00",
"vsupne;": "\u228b\ufe00",
"vzigzag;": "\u299a",
"wcirc;": "\u0175",
"wedbar;": "\u2a5f",
"wedge;": "\u2227",
"wedgeq;": "\u2259",
"weierp;": "\u2118",
"wfr;": "\U0001d534",
"wopf;": "\U0001d568",
"wp;": "\u2118",
"wr;": "\u2240",
"wreath;": "\u2240",
"wscr;": "\U0001d4cc",
"xcap;": "\u22c2",
"xcirc;": "\u25ef",
"xcup;": "\u22c3",
"xdtri;": "\u25bd",
"xfr;": "\U0001d535",
"xhArr;": "\u27fa",
"xharr;": "\u27f7",
"xi;": "\u03be",
"xlArr;": "\u27f8",
"xlarr;": "\u27f5",
"xmap;": "\u27fc",
"xnis;": "\u22fb",
"xodot;": "\u2a00",
"xopf;": "\U0001d569",
"xoplus;": "\u2a01",
"xotime;": "\u2a02",
"xrArr;": "\u27f9",
"xrarr;": "\u27f6",
"xscr;": "\U0001d4cd",
"xsqcup;": "\u2a06",
"xuplus;": "\u2a04",
"xutri;": "\u25b3",
"xvee;": "\u22c1",
"xwedge;": "\u22c0",
"yacute": "\xfd",
"yacute;": "\xfd",
"yacy;": "\u044f",
"ycirc;": "\u0177",
"ycy;": "\u044b",
"yen": "\xa5",
"yen;": "\xa5",
"yfr;": "\U0001d536",
"yicy;": "\u0457",
"yopf;": "\U0001d56a",
"yscr;": "\U0001d4ce",
"yucy;": "\u044e",
"yuml": "\xff",
"yuml;": "\xff",
"zacute;": "\u017a",
"zcaron;": "\u017e",
"zcy;": "\u0437",
"zdot;": "\u017c",
"zeetrf;": "\u2128",
"zeta;": "\u03b6",
"zfr;": "\U0001d537",
"zhcy;": "\u0436",
"zigrarr;": "\u21dd",
"zopf;": "\U0001d56b",
"zscr;": "\U0001d4cf",
"zwj;": "\u200d",
"zwnj;": "\u200c",
}
replacementCharacters = {
0x0: "\uFFFD",
0x0d: "\u000D",
0x80: "\u20AC",
0x81: "\u0081",
0x82: "\u201A",
0x83: "\u0192",
0x84: "\u201E",
0x85: "\u2026",
0x86: "\u2020",
0x87: "\u2021",
0x88: "\u02C6",
0x89: "\u2030",
0x8A: "\u0160",
0x8B: "\u2039",
0x8C: "\u0152",
0x8D: "\u008D",
0x8E: "\u017D",
0x8F: "\u008F",
0x90: "\u0090",
0x91: "\u2018",
0x92: "\u2019",
0x93: "\u201C",
0x94: "\u201D",
0x95: "\u2022",
0x96: "\u2013",
0x97: "\u2014",
0x98: "\u02DC",
0x99: "\u2122",
0x9A: "\u0161",
0x9B: "\u203A",
0x9C: "\u0153",
0x9D: "\u009D",
0x9E: "\u017E",
0x9F: "\u0178",
}
tokenTypes = {
"Doctype": 0,
"Characters": 1,
"SpaceCharacters": 2,
"StartTag": 3,
"EndTag": 4,
"EmptyTag": 5,
"Comment": 6,
"ParseError": 7
}
tagTokenTypes = frozenset([tokenTypes["StartTag"], tokenTypes["EndTag"],
tokenTypes["EmptyTag"]])
prefixes = dict([(v, k) for k, v in namespaces.items()])
prefixes["http://www.w3.org/1998/Math/MathML"] = "math"
class DataLossWarning(UserWarning):
pass
class ReparseException(Exception):
pass
pip/_vendor/html5lib/_utils.py 0000644 00000010000 14751155150 0012354 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
import sys
from types import ModuleType
from pip._vendor.six import text_type
try:
import xml.etree.cElementTree as default_etree
except ImportError:
import xml.etree.ElementTree as default_etree
__all__ = ["default_etree", "MethodDispatcher", "isSurrogatePair",
"surrogatePairToCodepoint", "moduleFactoryFactory",
"supports_lone_surrogates", "PY27"]
PY27 = sys.version_info[0] == 2 and sys.version_info[1] >= 7
# Platforms not supporting lone surrogates (\uD800-\uDFFF) should be
# caught by the below test. In general this would be any platform
# using UTF-16 as its encoding of unicode strings, such as
# Jython. This is because UTF-16 itself is based on the use of such
# surrogates, and there is no mechanism to further escape such
# escapes.
try:
_x = eval('"\\uD800"') # pylint:disable=eval-used
if not isinstance(_x, text_type):
# We need this with u"" because of http://bugs.jython.org/issue2039
_x = eval('u"\\uD800"') # pylint:disable=eval-used
assert isinstance(_x, text_type)
except: # pylint:disable=bare-except
supports_lone_surrogates = False
else:
supports_lone_surrogates = True
class MethodDispatcher(dict):
"""Dict with 2 special properties:
On initiation, keys that are lists, sets or tuples are converted to
multiple keys so accessing any one of the items in the original
list-like object returns the matching value
md = MethodDispatcher({("foo", "bar"):"baz"})
md["foo"] == "baz"
A default value which can be set through the default attribute.
"""
def __init__(self, items=()):
# Using _dictEntries instead of directly assigning to self is about
# twice as fast. Please do careful performance testing before changing
# anything here.
_dictEntries = []
for name, value in items:
if isinstance(name, (list, tuple, frozenset, set)):
for item in name:
_dictEntries.append((item, value))
else:
_dictEntries.append((name, value))
dict.__init__(self, _dictEntries)
assert len(self) == len(_dictEntries)
self.default = None
def __getitem__(self, key):
return dict.get(self, key, self.default)
# Some utility functions to deal with weirdness around UCS2 vs UCS4
# python builds
def isSurrogatePair(data):
return (len(data) == 2 and
ord(data[0]) >= 0xD800 and ord(data[0]) <= 0xDBFF and
ord(data[1]) >= 0xDC00 and ord(data[1]) <= 0xDFFF)
def surrogatePairToCodepoint(data):
char_val = (0x10000 + (ord(data[0]) - 0xD800) * 0x400 +
(ord(data[1]) - 0xDC00))
return char_val
# Module Factory Factory (no, this isn't Java, I know)
# Here to stop this being duplicated all over the place.
def moduleFactoryFactory(factory):
moduleCache = {}
def moduleFactory(baseModule, *args, **kwargs):
if isinstance(ModuleType.__name__, type("")):
name = "_%s_factory" % baseModule.__name__
else:
name = b"_%s_factory" % baseModule.__name__
kwargs_tuple = tuple(kwargs.items())
try:
return moduleCache[name][args][kwargs_tuple]
except KeyError:
mod = ModuleType(name)
objs = factory(baseModule, *args, **kwargs)
mod.__dict__.update(objs)
if "name" not in moduleCache:
moduleCache[name] = {}
if "args" not in moduleCache[name]:
moduleCache[name][args] = {}
if "kwargs" not in moduleCache[name][args]:
moduleCache[name][args][kwargs_tuple] = {}
moduleCache[name][args][kwargs_tuple] = mod
return mod
return moduleFactory
def memoize(func):
cache = {}
def wrapped(*args, **kwargs):
key = (tuple(args), tuple(kwargs.items()))
if key not in cache:
cache[key] = func(*args, **kwargs)
return cache[key]
return wrapped
pip/_vendor/html5lib/serializer.py 0000644 00000033541 14751155150 0013245 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import text_type
import re
from codecs import register_error, xmlcharrefreplace_errors
from .constants import voidElements, booleanAttributes, spaceCharacters
from .constants import rcdataElements, entities, xmlEntities
from . import treewalkers, _utils
from xml.sax.saxutils import escape
_quoteAttributeSpecChars = "".join(spaceCharacters) + "\"'=<>`"
_quoteAttributeSpec = re.compile("[" + _quoteAttributeSpecChars + "]")
_quoteAttributeLegacy = re.compile("[" + _quoteAttributeSpecChars +
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\t\n"
"\x0b\x0c\r\x0e\x0f\x10\x11\x12\x13\x14\x15"
"\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f"
"\x20\x2f\x60\xa0\u1680\u180e\u180f\u2000"
"\u2001\u2002\u2003\u2004\u2005\u2006\u2007"
"\u2008\u2009\u200a\u2028\u2029\u202f\u205f"
"\u3000]")
_encode_entity_map = {}
_is_ucs4 = len("\U0010FFFF") == 1
for k, v in list(entities.items()):
# skip multi-character entities
if ((_is_ucs4 and len(v) > 1) or
(not _is_ucs4 and len(v) > 2)):
continue
if v != "&":
if len(v) == 2:
v = _utils.surrogatePairToCodepoint(v)
else:
v = ord(v)
if v not in _encode_entity_map or k.islower():
# prefer < over < and similarly for &, >, etc.
_encode_entity_map[v] = k
def htmlentityreplace_errors(exc):
if isinstance(exc, (UnicodeEncodeError, UnicodeTranslateError)):
res = []
codepoints = []
skip = False
for i, c in enumerate(exc.object[exc.start:exc.end]):
if skip:
skip = False
continue
index = i + exc.start
if _utils.isSurrogatePair(exc.object[index:min([exc.end, index + 2])]):
codepoint = _utils.surrogatePairToCodepoint(exc.object[index:index + 2])
skip = True
else:
codepoint = ord(c)
codepoints.append(codepoint)
for cp in codepoints:
e = _encode_entity_map.get(cp)
if e:
res.append("&")
res.append(e)
if not e.endswith(";"):
res.append(";")
else:
res.append("&#x%s;" % (hex(cp)[2:]))
return ("".join(res), exc.end)
else:
return xmlcharrefreplace_errors(exc)
register_error("htmlentityreplace", htmlentityreplace_errors)
def serialize(input, tree="etree", encoding=None, **serializer_opts):
# XXX: Should we cache this?
walker = treewalkers.getTreeWalker(tree)
s = HTMLSerializer(**serializer_opts)
return s.render(walker(input), encoding)
class HTMLSerializer(object):
# attribute quoting options
quote_attr_values = "legacy" # be secure by default
quote_char = '"'
use_best_quote_char = True
# tag syntax options
omit_optional_tags = True
minimize_boolean_attributes = True
use_trailing_solidus = False
space_before_trailing_solidus = True
# escaping options
escape_lt_in_attrs = False
escape_rcdata = False
resolve_entities = True
# miscellaneous options
alphabetical_attributes = False
inject_meta_charset = True
strip_whitespace = False
sanitize = False
options = ("quote_attr_values", "quote_char", "use_best_quote_char",
"omit_optional_tags", "minimize_boolean_attributes",
"use_trailing_solidus", "space_before_trailing_solidus",
"escape_lt_in_attrs", "escape_rcdata", "resolve_entities",
"alphabetical_attributes", "inject_meta_charset",
"strip_whitespace", "sanitize")
def __init__(self, **kwargs):
"""Initialize HTMLSerializer.
Keyword options (default given first unless specified) include:
inject_meta_charset=True|False
Whether it insert a meta element to define the character set of the
document.
quote_attr_values="legacy"|"spec"|"always"
Whether to quote attribute values that don't require quoting
per legacy browser behaviour, when required by the standard, or always.
quote_char=u'"'|u"'"
Use given quote character for attribute quoting. Default is to
use double quote unless attribute value contains a double quote,
in which case single quotes are used instead.
escape_lt_in_attrs=False|True
Whether to escape < in attribute values.
escape_rcdata=False|True
Whether to escape characters that need to be escaped within normal
elements within rcdata elements such as style.
resolve_entities=True|False
Whether to resolve named character entities that appear in the
source tree. The XML predefined entities < > & " '
are unaffected by this setting.
strip_whitespace=False|True
Whether to remove semantically meaningless whitespace. (This
compresses all whitespace to a single space except within pre.)
minimize_boolean_attributes=True|False
Shortens boolean attributes to give just the attribute value,
for example <input disabled="disabled"> becomes <input disabled>.
use_trailing_solidus=False|True
Includes a close-tag slash at the end of the start tag of void
elements (empty elements whose end tag is forbidden). E.g. <hr/>.
space_before_trailing_solidus=True|False
Places a space immediately before the closing slash in a tag
using a trailing solidus. E.g. <hr />. Requires use_trailing_solidus.
sanitize=False|True
Strip all unsafe or unknown constructs from output.
See `html5lib user documentation`_
omit_optional_tags=True|False
Omit start/end tags that are optional.
alphabetical_attributes=False|True
Reorder attributes to be in alphabetical order.
.. _html5lib user documentation: http://code.google.com/p/html5lib/wiki/UserDocumentation
"""
unexpected_args = frozenset(kwargs) - frozenset(self.options)
if len(unexpected_args) > 0:
raise TypeError("__init__() got an unexpected keyword argument '%s'" % next(iter(unexpected_args)))
if 'quote_char' in kwargs:
self.use_best_quote_char = False
for attr in self.options:
setattr(self, attr, kwargs.get(attr, getattr(self, attr)))
self.errors = []
self.strict = False
def encode(self, string):
assert(isinstance(string, text_type))
if self.encoding:
return string.encode(self.encoding, "htmlentityreplace")
else:
return string
def encodeStrict(self, string):
assert(isinstance(string, text_type))
if self.encoding:
return string.encode(self.encoding, "strict")
else:
return string
def serialize(self, treewalker, encoding=None):
# pylint:disable=too-many-nested-blocks
self.encoding = encoding
in_cdata = False
self.errors = []
if encoding and self.inject_meta_charset:
from .filters.inject_meta_charset import Filter
treewalker = Filter(treewalker, encoding)
# Alphabetical attributes is here under the assumption that none of
# the later filters add or change order of attributes; it needs to be
# before the sanitizer so escaped elements come out correctly
if self.alphabetical_attributes:
from .filters.alphabeticalattributes import Filter
treewalker = Filter(treewalker)
# WhitespaceFilter should be used before OptionalTagFilter
# for maximum efficiently of this latter filter
if self.strip_whitespace:
from .filters.whitespace import Filter
treewalker = Filter(treewalker)
if self.sanitize:
from .filters.sanitizer import Filter
treewalker = Filter(treewalker)
if self.omit_optional_tags:
from .filters.optionaltags import Filter
treewalker = Filter(treewalker)
for token in treewalker:
type = token["type"]
if type == "Doctype":
doctype = "<!DOCTYPE %s" % token["name"]
if token["publicId"]:
doctype += ' PUBLIC "%s"' % token["publicId"]
elif token["systemId"]:
doctype += " SYSTEM"
if token["systemId"]:
if token["systemId"].find('"') >= 0:
if token["systemId"].find("'") >= 0:
self.serializeError("System identifer contains both single and double quote characters")
quote_char = "'"
else:
quote_char = '"'
doctype += " %s%s%s" % (quote_char, token["systemId"], quote_char)
doctype += ">"
yield self.encodeStrict(doctype)
elif type in ("Characters", "SpaceCharacters"):
if type == "SpaceCharacters" or in_cdata:
if in_cdata and token["data"].find("</") >= 0:
self.serializeError("Unexpected </ in CDATA")
yield self.encode(token["data"])
else:
yield self.encode(escape(token["data"]))
elif type in ("StartTag", "EmptyTag"):
name = token["name"]
yield self.encodeStrict("<%s" % name)
if name in rcdataElements and not self.escape_rcdata:
in_cdata = True
elif in_cdata:
self.serializeError("Unexpected child element of a CDATA element")
for (_, attr_name), attr_value in token["data"].items():
# TODO: Add namespace support here
k = attr_name
v = attr_value
yield self.encodeStrict(' ')
yield self.encodeStrict(k)
if not self.minimize_boolean_attributes or \
(k not in booleanAttributes.get(name, tuple()) and
k not in booleanAttributes.get("", tuple())):
yield self.encodeStrict("=")
if self.quote_attr_values == "always" or len(v) == 0:
quote_attr = True
elif self.quote_attr_values == "spec":
quote_attr = _quoteAttributeSpec.search(v) is not None
elif self.quote_attr_values == "legacy":
quote_attr = _quoteAttributeLegacy.search(v) is not None
else:
raise ValueError("quote_attr_values must be one of: "
"'always', 'spec', or 'legacy'")
v = v.replace("&", "&")
if self.escape_lt_in_attrs:
v = v.replace("<", "<")
if quote_attr:
quote_char = self.quote_char
if self.use_best_quote_char:
if "'" in v and '"' not in v:
quote_char = '"'
elif '"' in v and "'" not in v:
quote_char = "'"
if quote_char == "'":
v = v.replace("'", "'")
else:
v = v.replace('"', """)
yield self.encodeStrict(quote_char)
yield self.encode(v)
yield self.encodeStrict(quote_char)
else:
yield self.encode(v)
if name in voidElements and self.use_trailing_solidus:
if self.space_before_trailing_solidus:
yield self.encodeStrict(" /")
else:
yield self.encodeStrict("/")
yield self.encode(">")
elif type == "EndTag":
name = token["name"]
if name in rcdataElements:
in_cdata = False
elif in_cdata:
self.serializeError("Unexpected child element of a CDATA element")
yield self.encodeStrict("</%s>" % name)
elif type == "Comment":
data = token["data"]
if data.find("--") >= 0:
self.serializeError("Comment contains --")
yield self.encodeStrict("<!--%s-->" % token["data"])
elif type == "Entity":
name = token["name"]
key = name + ";"
if key not in entities:
self.serializeError("Entity %s not recognized" % name)
if self.resolve_entities and key not in xmlEntities:
data = entities[key]
else:
data = "&%s;" % name
yield self.encodeStrict(data)
else:
self.serializeError(token["data"])
def render(self, treewalker, encoding=None):
if encoding:
return b"".join(list(self.serialize(treewalker, encoding)))
else:
return "".join(list(self.serialize(treewalker)))
def serializeError(self, data="XXX ERROR MESSAGE NEEDED"):
# XXX The idea is to make data mandatory.
self.errors.append(data)
if self.strict:
raise SerializeError
class SerializeError(Exception):
"""Error in serialized tree"""
pass
pip/_vendor/html5lib/_trie/datrie.py 0000644 00000002232 14751155150 0013437 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from datrie import Trie as DATrie
from pip._vendor.six import text_type
from ._base import Trie as ABCTrie
class Trie(ABCTrie):
def __init__(self, data):
chars = set()
for key in data.keys():
if not isinstance(key, text_type):
raise TypeError("All keys must be strings")
for char in key:
chars.add(char)
self._data = DATrie("".join(chars))
for key, value in data.items():
self._data[key] = value
def __contains__(self, key):
return key in self._data
def __len__(self):
return len(self._data)
def __iter__(self):
raise NotImplementedError()
def __getitem__(self, key):
return self._data[key]
def keys(self, prefix=None):
return self._data.keys(prefix)
def has_keys_with_prefix(self, prefix):
return self._data.has_keys_with_prefix(prefix)
def longest_prefix(self, prefix):
return self._data.longest_prefix(prefix)
def longest_prefix_item(self, prefix):
return self._data.longest_prefix_item(prefix)
pip/_vendor/html5lib/_trie/__init__.py 0000644 00000000441 14751155150 0013726 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from .py import Trie as PyTrie
Trie = PyTrie
# pylint:disable=wrong-import-position
try:
from .datrie import Trie as DATrie
except ImportError:
pass
else:
Trie = DATrie
# pylint:enable=wrong-import-position
pip/_vendor/html5lib/_trie/_base.py 0000644 00000001723 14751155150 0013244 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from collections import Mapping
class Trie(Mapping):
"""Abstract base class for tries"""
def keys(self, prefix=None):
# pylint:disable=arguments-differ
keys = super(Trie, self).keys()
if prefix is None:
return set(keys)
# Python 2.6: no set comprehensions
return set([x for x in keys if x.startswith(prefix)])
def has_keys_with_prefix(self, prefix):
for key in self.keys():
if key.startswith(prefix):
return True
return False
def longest_prefix(self, prefix):
if prefix in self:
return prefix
for i in range(1, len(prefix) + 1):
if prefix[:-i] in self:
return prefix[:-i]
raise KeyError(prefix)
def longest_prefix_item(self, prefix):
lprefix = self.longest_prefix(prefix)
return (lprefix, self[lprefix])
pip/_vendor/html5lib/_trie/py.py 0000644 00000003357 14751155150 0012630 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import text_type
from bisect import bisect_left
from ._base import Trie as ABCTrie
class Trie(ABCTrie):
def __init__(self, data):
if not all(isinstance(x, text_type) for x in data.keys()):
raise TypeError("All keys must be strings")
self._data = data
self._keys = sorted(data.keys())
self._cachestr = ""
self._cachepoints = (0, len(data))
def __contains__(self, key):
return key in self._data
def __len__(self):
return len(self._data)
def __iter__(self):
return iter(self._data)
def __getitem__(self, key):
return self._data[key]
def keys(self, prefix=None):
if prefix is None or prefix == "" or not self._keys:
return set(self._keys)
if prefix.startswith(self._cachestr):
lo, hi = self._cachepoints
start = i = bisect_left(self._keys, prefix, lo, hi)
else:
start = i = bisect_left(self._keys, prefix)
keys = set()
if start == len(self._keys):
return keys
while self._keys[i].startswith(prefix):
keys.add(self._keys[i])
i += 1
self._cachestr = prefix
self._cachepoints = (start, i)
return keys
def has_keys_with_prefix(self, prefix):
if prefix in self._data:
return True
if prefix.startswith(self._cachestr):
lo, hi = self._cachepoints
i = bisect_left(self._keys, prefix, lo, hi)
else:
i = bisect_left(self._keys, prefix)
if i == len(self._keys):
return False
return self._keys[i].startswith(prefix)
pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.pyc 0000644 00000000524 14751155150 0020214 0 ustar 00 3
���e! � @ sR d dl mZmZmZ ddlmZ eZyddlmZ W n e k
rH Y nX eZdS )� )�absolute_import�division�unicode_literals� )�TrieN)
Z
__future__r r r �pyr ZPyTrieZdatrieZDATrie� ImportError� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/_trie/__pycache__/datrie.cpython-36.opt-1.pyc 0000644 00000003626 14751155150 0020672 0 ustar 00 3
���e� � @ sL d dl mZmZmZ d dlmZ d dlmZ ddl mZ
G dd� de
�ZdS )� )�absolute_import�division�unicode_literals)�Trie)� text_type� c @ sV e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zdd d
�Zdd� Z dd� Z
dd� Z d S )r c C sv t � }x:|j� D ].}t|t�s&td��x|D ]}|j|� q,W qW tdj|��| _x |j � D ]\}}|| j|< q\W d S )NzAll keys must be strings� )
�set�keys�
isinstancer � TypeError�add�DATrie�join�_data�items)�self�data�chars�key�char�value� r � /usr/lib/python3.6/datrie.py�__init__
s
z
Trie.__init__c C s
|| j kS )N)r )r r r r r � __contains__ s zTrie.__contains__c C s
t | j�S )N)�lenr )r r r r �__len__ s z Trie.__len__c C s
t � �d S )N)�NotImplementedError)r r r r �__iter__ s z
Trie.__iter__c C s
| j | S )N)r )r r r r r � __getitem__ s zTrie.__getitem__Nc C s | j j|�S )N)r r
)r �prefixr r r r
" s z Trie.keysc C s | j j|�S )N)r �has_keys_with_prefix)r r! r r r r" % s zTrie.has_keys_with_prefixc C s | j j|�S )N)r �longest_prefix)r r! r r r r# ( s zTrie.longest_prefixc C s | j j|�S )N)r �longest_prefix_item)r r! r r r r$ + s zTrie.longest_prefix_item)N) �__name__�
__module__� __qualname__r r r r r r
r" r# r$ r r r r r s
r N) Z
__future__r r r Zdatrier r Zpip._vendor.sixr Z_baseZABCTrier r r r �<module> s pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000524 14751155150 0021153 0 ustar 00 3
���e! � @ sR d dl mZmZmZ ddlmZ eZyddlmZ W n e k
rH Y nX eZdS )� )�absolute_import�division�unicode_literals� )�TrieN)
Z
__future__r r r �pyr ZPyTrieZdatrieZDATrie� ImportError� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.pyc 0000644 00000002625 14751155150 0017532 0 ustar 00 3
���e� � @ s4 d dl mZmZmZ d dlmZ G dd� de�ZdS )� )�absolute_import�division�unicode_literals)�Mappingc s: e Zd ZdZd � fdd� Zdd� Zdd� Zd d
� Z� ZS ) �Triez Abstract base class for triesNc s4 t t| �j� }� d kr t|�S t� fdd�|D ��S )Nc s g | ]}|j � �r|�qS � )�
startswith)�.0�x)�prefixr �/usr/lib/python3.6/_base.py�
<listcomp> s z Trie.keys.<locals>.<listcomp>)�superr �keys�set)�selfr r )� __class__)r r r s z Trie.keysc C s$ x | j � D ]}|j|�r
dS q
W dS )NTF)r r )r r �keyr r r �has_keys_with_prefix s
zTrie.has_keys_with_prefixc C sT || kr |S x:t dt|�d �D ]$}|d | � | kr |d | � S q W t|��d S )N� )�range�len�KeyError)r r �ir r r �longest_prefix s zTrie.longest_prefixc C s | j |�}|| | fS )N)r )r r Zlprefixr r r �longest_prefix_item$ s
zTrie.longest_prefix_item)N) �__name__�
__module__� __qualname__�__doc__r r r r �
__classcell__r r )r r r s
r N)Z
__future__r r r � collectionsr r r r r r �<module> s pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.opt-1.pyc 0000644 00000002625 14751155150 0020471 0 ustar 00 3
���e� � @ s4 d dl mZmZmZ d dlmZ G dd� de�ZdS )� )�absolute_import�division�unicode_literals)�Mappingc s: e Zd ZdZd � fdd� Zdd� Zdd� Zd d
� Z� ZS ) �Triez Abstract base class for triesNc s4 t t| �j� }� d kr t|�S t� fdd�|D ��S )Nc s g | ]}|j � �r|�qS � )�
startswith)�.0�x)�prefixr �/usr/lib/python3.6/_base.py�
<listcomp> s z Trie.keys.<locals>.<listcomp>)�superr �keys�set)�selfr r )� __class__)r r r s z Trie.keysc C s$ x | j � D ]}|j|�r
dS q
W dS )NTF)r r )r r �keyr r r �has_keys_with_prefix s
zTrie.has_keys_with_prefixc C sT || kr |S x:t dt|�d �D ]$}|d | � | kr |d | � S q W t|��d S )N� )�range�len�KeyError)r r �ir r r �longest_prefix s zTrie.longest_prefixc C s | j |�}|| | fS )N)r )r r Zlprefixr r r �longest_prefix_item$ s
zTrie.longest_prefix_item)N) �__name__�
__module__� __qualname__�__doc__r r r r �
__classcell__r r )r r r s
r N)Z
__future__r r r � collectionsr r r r r r �<module> s pip/_vendor/html5lib/_trie/__pycache__/datrie.cpython-36.pyc 0000644 00000003626 14751155150 0017733 0 ustar 00 3
���e� � @ sL d dl mZmZmZ d dlmZ d dlmZ ddl mZ
G dd� de
�ZdS )� )�absolute_import�division�unicode_literals)�Trie)� text_type� c @ sV e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zdd d
�Zdd� Z dd� Z
dd� Z d S )r c C sv t � }x:|j� D ].}t|t�s&td��x|D ]}|j|� q,W qW tdj|��| _x |j � D ]\}}|| j|< q\W d S )NzAll keys must be strings� )
�set�keys�
isinstancer � TypeError�add�DATrie�join�_data�items)�self�data�chars�key�char�value� r � /usr/lib/python3.6/datrie.py�__init__
s
z
Trie.__init__c C s
|| j kS )N)r )r r r r r � __contains__ s zTrie.__contains__c C s
t | j�S )N)�lenr )r r r r �__len__ s z Trie.__len__c C s
t � �d S )N)�NotImplementedError)r r r r �__iter__ s z
Trie.__iter__c C s
| j | S )N)r )r r r r r � __getitem__ s zTrie.__getitem__Nc C s | j j|�S )N)r r
)r �prefixr r r r
" s z Trie.keysc C s | j j|�S )N)r �has_keys_with_prefix)r r! r r r r" % s zTrie.has_keys_with_prefixc C s | j j|�S )N)r �longest_prefix)r r! r r r r# ( s zTrie.longest_prefixc C s | j j|�S )N)r �longest_prefix_item)r r! r r r r$ + s zTrie.longest_prefix_item)N) �__name__�
__module__� __qualname__r r r r r r
r" r# r$ r r r r r s
r N) Z
__future__r r r Zdatrier r Zpip._vendor.sixr Z_baseZABCTrier r r r �<module> s pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.opt-1.pyc 0000644 00000004143 14751155150 0020045 0 ustar 00 3
���e� � @ sL d dl mZmZmZ d dlmZ d dlmZ ddlm Z
G dd� de
�Z dS ) � )�absolute_import�division�unicode_literals)� text_type)� bisect_left� )�Triec @ sF e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zdd d
�Zdd� Z d S )r c C sJ t dd� |j� D ��s td��|| _t|j� �| _d| _dt|�f| _d S )Nc s s | ]}t |t�V qd S )N)�
isinstancer )�.0�x� r �/usr/lib/python3.6/py.py� <genexpr> s z Trie.__init__.<locals>.<genexpr>zAll keys must be strings� r ) �all�keys� TypeError�_data�sorted�_keys� _cachestr�len� _cachepoints)�self�datar r r
�__init__
s z
Trie.__init__c C s
|| j kS )N)r )r �keyr r r
� __contains__ s zTrie.__contains__c C s
t | j�S )N)r r )r r r r
�__len__ s z Trie.__len__c C s
t | j�S )N)�iterr )r r r r
�__iter__ s z
Trie.__iter__c C s
| j | S )N)r )r r r r r
� __getitem__ s zTrie.__getitem__Nc C s� |d ks|dks| j r"t| j �S |j| j�rN| j\}}t| j |||� }}nt| j |� }}t� }|t| j �krv|S x,| j | j|�r�|j| j | � |d7 }qxW || _||f| _|S )Nr r )r �set�
startswithr r r r �add)r �prefix�lo�hi�start�ir r r r
r s
z Trie.keysc C sd || j krdS |j| j�r6| j\}}t| j|||�}n t| j|�}|t| j�krTdS | j| j|�S )NTF)r r# r r r r r )r r% r& r' r) r r r
�has_keys_with_prefix6 s
zTrie.has_keys_with_prefix)N)
�__name__�
__module__� __qualname__r r r r r! r r* r r r r
r s
r N) Z
__future__r r r Zpip._vendor.sixr Zbisectr Z_baser ZABCTrier r r r
�<module> s pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.pyc 0000644 00000004143 14751155150 0017106 0 ustar 00 3
���e� � @ sL d dl mZmZmZ d dlmZ d dlmZ ddlm Z
G dd� de
�Z dS ) � )�absolute_import�division�unicode_literals)� text_type)� bisect_left� )�Triec @ sF e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zdd d
�Zdd� Z d S )r c C sJ t dd� |j� D ��s td��|| _t|j� �| _d| _dt|�f| _d S )Nc s s | ]}t |t�V qd S )N)�
isinstancer )�.0�x� r �/usr/lib/python3.6/py.py� <genexpr> s z Trie.__init__.<locals>.<genexpr>zAll keys must be strings� r ) �all�keys� TypeError�_data�sorted�_keys� _cachestr�len� _cachepoints)�self�datar r r
�__init__
s z
Trie.__init__c C s
|| j kS )N)r )r �keyr r r
� __contains__ s zTrie.__contains__c C s
t | j�S )N)r r )r r r r
�__len__ s z Trie.__len__c C s
t | j�S )N)�iterr )r r r r
�__iter__ s z
Trie.__iter__c C s
| j | S )N)r )r r r r r
� __getitem__ s zTrie.__getitem__Nc C s� |d ks|dks| j r"t| j �S |j| j�rN| j\}}t| j |||� }}nt| j |� }}t� }|t| j �krv|S x,| j | j|�r�|j| j | � |d7 }qxW || _||f| _|S )Nr r )r �set�
startswithr r r r �add)r �prefix�lo�hi�start�ir r r r
r s
z Trie.keysc C sd || j krdS |j| j�r6| j\}}t| j|||�}n t| j|�}|t| j�krTdS | j| j|�S )NTF)r r# r r r r r )r r% r& r' r) r r r
�has_keys_with_prefix6 s
zTrie.has_keys_with_prefix)N)
�__name__�
__module__� __qualname__r r r r r! r r* r r r r
r s
r N) Z
__future__r r r Zpip._vendor.sixr Zbisectr Z_baser ZABCTrier r r r
�<module> s pip/_vendor/html5lib/__init__.py 0000644 00000001414 14751155150 0012625 0 ustar 00 """
HTML parsing library based on the WHATWG "HTML5"
specification. The parser is designed to be compatible with existing
HTML found in the wild and implements well-defined error recovery that
is largely compatible with modern desktop web browsers.
Example usage:
import html5lib
f = open("my_document.html")
tree = html5lib.parse(f)
"""
from __future__ import absolute_import, division, unicode_literals
from .html5parser import HTMLParser, parse, parseFragment
from .treebuilders import getTreeBuilder
from .treewalkers import getTreeWalker
from .serializer import serialize
__all__ = ["HTMLParser", "parse", "parseFragment", "getTreeBuilder",
"getTreeWalker", "serialize"]
# this has to be at the top level, see how setup.py parses this
__version__ = "1.0b10"
pip/_vendor/html5lib/filters/sanitizer.py 0000644 00000061030 14751155150 0014546 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
import re
from xml.sax.saxutils import escape, unescape
from pip._vendor.six.moves import urllib_parse as urlparse
from . import base
from ..constants import namespaces, prefixes
__all__ = ["Filter"]
allowed_elements = frozenset((
(namespaces['html'], 'a'),
(namespaces['html'], 'abbr'),
(namespaces['html'], 'acronym'),
(namespaces['html'], 'address'),
(namespaces['html'], 'area'),
(namespaces['html'], 'article'),
(namespaces['html'], 'aside'),
(namespaces['html'], 'audio'),
(namespaces['html'], 'b'),
(namespaces['html'], 'big'),
(namespaces['html'], 'blockquote'),
(namespaces['html'], 'br'),
(namespaces['html'], 'button'),
(namespaces['html'], 'canvas'),
(namespaces['html'], 'caption'),
(namespaces['html'], 'center'),
(namespaces['html'], 'cite'),
(namespaces['html'], 'code'),
(namespaces['html'], 'col'),
(namespaces['html'], 'colgroup'),
(namespaces['html'], 'command'),
(namespaces['html'], 'datagrid'),
(namespaces['html'], 'datalist'),
(namespaces['html'], 'dd'),
(namespaces['html'], 'del'),
(namespaces['html'], 'details'),
(namespaces['html'], 'dfn'),
(namespaces['html'], 'dialog'),
(namespaces['html'], 'dir'),
(namespaces['html'], 'div'),
(namespaces['html'], 'dl'),
(namespaces['html'], 'dt'),
(namespaces['html'], 'em'),
(namespaces['html'], 'event-source'),
(namespaces['html'], 'fieldset'),
(namespaces['html'], 'figcaption'),
(namespaces['html'], 'figure'),
(namespaces['html'], 'footer'),
(namespaces['html'], 'font'),
(namespaces['html'], 'form'),
(namespaces['html'], 'header'),
(namespaces['html'], 'h1'),
(namespaces['html'], 'h2'),
(namespaces['html'], 'h3'),
(namespaces['html'], 'h4'),
(namespaces['html'], 'h5'),
(namespaces['html'], 'h6'),
(namespaces['html'], 'hr'),
(namespaces['html'], 'i'),
(namespaces['html'], 'img'),
(namespaces['html'], 'input'),
(namespaces['html'], 'ins'),
(namespaces['html'], 'keygen'),
(namespaces['html'], 'kbd'),
(namespaces['html'], 'label'),
(namespaces['html'], 'legend'),
(namespaces['html'], 'li'),
(namespaces['html'], 'm'),
(namespaces['html'], 'map'),
(namespaces['html'], 'menu'),
(namespaces['html'], 'meter'),
(namespaces['html'], 'multicol'),
(namespaces['html'], 'nav'),
(namespaces['html'], 'nextid'),
(namespaces['html'], 'ol'),
(namespaces['html'], 'output'),
(namespaces['html'], 'optgroup'),
(namespaces['html'], 'option'),
(namespaces['html'], 'p'),
(namespaces['html'], 'pre'),
(namespaces['html'], 'progress'),
(namespaces['html'], 'q'),
(namespaces['html'], 's'),
(namespaces['html'], 'samp'),
(namespaces['html'], 'section'),
(namespaces['html'], 'select'),
(namespaces['html'], 'small'),
(namespaces['html'], 'sound'),
(namespaces['html'], 'source'),
(namespaces['html'], 'spacer'),
(namespaces['html'], 'span'),
(namespaces['html'], 'strike'),
(namespaces['html'], 'strong'),
(namespaces['html'], 'sub'),
(namespaces['html'], 'sup'),
(namespaces['html'], 'table'),
(namespaces['html'], 'tbody'),
(namespaces['html'], 'td'),
(namespaces['html'], 'textarea'),
(namespaces['html'], 'time'),
(namespaces['html'], 'tfoot'),
(namespaces['html'], 'th'),
(namespaces['html'], 'thead'),
(namespaces['html'], 'tr'),
(namespaces['html'], 'tt'),
(namespaces['html'], 'u'),
(namespaces['html'], 'ul'),
(namespaces['html'], 'var'),
(namespaces['html'], 'video'),
(namespaces['mathml'], 'maction'),
(namespaces['mathml'], 'math'),
(namespaces['mathml'], 'merror'),
(namespaces['mathml'], 'mfrac'),
(namespaces['mathml'], 'mi'),
(namespaces['mathml'], 'mmultiscripts'),
(namespaces['mathml'], 'mn'),
(namespaces['mathml'], 'mo'),
(namespaces['mathml'], 'mover'),
(namespaces['mathml'], 'mpadded'),
(namespaces['mathml'], 'mphantom'),
(namespaces['mathml'], 'mprescripts'),
(namespaces['mathml'], 'mroot'),
(namespaces['mathml'], 'mrow'),
(namespaces['mathml'], 'mspace'),
(namespaces['mathml'], 'msqrt'),
(namespaces['mathml'], 'mstyle'),
(namespaces['mathml'], 'msub'),
(namespaces['mathml'], 'msubsup'),
(namespaces['mathml'], 'msup'),
(namespaces['mathml'], 'mtable'),
(namespaces['mathml'], 'mtd'),
(namespaces['mathml'], 'mtext'),
(namespaces['mathml'], 'mtr'),
(namespaces['mathml'], 'munder'),
(namespaces['mathml'], 'munderover'),
(namespaces['mathml'], 'none'),
(namespaces['svg'], 'a'),
(namespaces['svg'], 'animate'),
(namespaces['svg'], 'animateColor'),
(namespaces['svg'], 'animateMotion'),
(namespaces['svg'], 'animateTransform'),
(namespaces['svg'], 'clipPath'),
(namespaces['svg'], 'circle'),
(namespaces['svg'], 'defs'),
(namespaces['svg'], 'desc'),
(namespaces['svg'], 'ellipse'),
(namespaces['svg'], 'font-face'),
(namespaces['svg'], 'font-face-name'),
(namespaces['svg'], 'font-face-src'),
(namespaces['svg'], 'g'),
(namespaces['svg'], 'glyph'),
(namespaces['svg'], 'hkern'),
(namespaces['svg'], 'linearGradient'),
(namespaces['svg'], 'line'),
(namespaces['svg'], 'marker'),
(namespaces['svg'], 'metadata'),
(namespaces['svg'], 'missing-glyph'),
(namespaces['svg'], 'mpath'),
(namespaces['svg'], 'path'),
(namespaces['svg'], 'polygon'),
(namespaces['svg'], 'polyline'),
(namespaces['svg'], 'radialGradient'),
(namespaces['svg'], 'rect'),
(namespaces['svg'], 'set'),
(namespaces['svg'], 'stop'),
(namespaces['svg'], 'svg'),
(namespaces['svg'], 'switch'),
(namespaces['svg'], 'text'),
(namespaces['svg'], 'title'),
(namespaces['svg'], 'tspan'),
(namespaces['svg'], 'use'),
))
allowed_attributes = frozenset((
# HTML attributes
(None, 'abbr'),
(None, 'accept'),
(None, 'accept-charset'),
(None, 'accesskey'),
(None, 'action'),
(None, 'align'),
(None, 'alt'),
(None, 'autocomplete'),
(None, 'autofocus'),
(None, 'axis'),
(None, 'background'),
(None, 'balance'),
(None, 'bgcolor'),
(None, 'bgproperties'),
(None, 'border'),
(None, 'bordercolor'),
(None, 'bordercolordark'),
(None, 'bordercolorlight'),
(None, 'bottompadding'),
(None, 'cellpadding'),
(None, 'cellspacing'),
(None, 'ch'),
(None, 'challenge'),
(None, 'char'),
(None, 'charoff'),
(None, 'choff'),
(None, 'charset'),
(None, 'checked'),
(None, 'cite'),
(None, 'class'),
(None, 'clear'),
(None, 'color'),
(None, 'cols'),
(None, 'colspan'),
(None, 'compact'),
(None, 'contenteditable'),
(None, 'controls'),
(None, 'coords'),
(None, 'data'),
(None, 'datafld'),
(None, 'datapagesize'),
(None, 'datasrc'),
(None, 'datetime'),
(None, 'default'),
(None, 'delay'),
(None, 'dir'),
(None, 'disabled'),
(None, 'draggable'),
(None, 'dynsrc'),
(None, 'enctype'),
(None, 'end'),
(None, 'face'),
(None, 'for'),
(None, 'form'),
(None, 'frame'),
(None, 'galleryimg'),
(None, 'gutter'),
(None, 'headers'),
(None, 'height'),
(None, 'hidefocus'),
(None, 'hidden'),
(None, 'high'),
(None, 'href'),
(None, 'hreflang'),
(None, 'hspace'),
(None, 'icon'),
(None, 'id'),
(None, 'inputmode'),
(None, 'ismap'),
(None, 'keytype'),
(None, 'label'),
(None, 'leftspacing'),
(None, 'lang'),
(None, 'list'),
(None, 'longdesc'),
(None, 'loop'),
(None, 'loopcount'),
(None, 'loopend'),
(None, 'loopstart'),
(None, 'low'),
(None, 'lowsrc'),
(None, 'max'),
(None, 'maxlength'),
(None, 'media'),
(None, 'method'),
(None, 'min'),
(None, 'multiple'),
(None, 'name'),
(None, 'nohref'),
(None, 'noshade'),
(None, 'nowrap'),
(None, 'open'),
(None, 'optimum'),
(None, 'pattern'),
(None, 'ping'),
(None, 'point-size'),
(None, 'poster'),
(None, 'pqg'),
(None, 'preload'),
(None, 'prompt'),
(None, 'radiogroup'),
(None, 'readonly'),
(None, 'rel'),
(None, 'repeat-max'),
(None, 'repeat-min'),
(None, 'replace'),
(None, 'required'),
(None, 'rev'),
(None, 'rightspacing'),
(None, 'rows'),
(None, 'rowspan'),
(None, 'rules'),
(None, 'scope'),
(None, 'selected'),
(None, 'shape'),
(None, 'size'),
(None, 'span'),
(None, 'src'),
(None, 'start'),
(None, 'step'),
(None, 'style'),
(None, 'summary'),
(None, 'suppress'),
(None, 'tabindex'),
(None, 'target'),
(None, 'template'),
(None, 'title'),
(None, 'toppadding'),
(None, 'type'),
(None, 'unselectable'),
(None, 'usemap'),
(None, 'urn'),
(None, 'valign'),
(None, 'value'),
(None, 'variable'),
(None, 'volume'),
(None, 'vspace'),
(None, 'vrml'),
(None, 'width'),
(None, 'wrap'),
(namespaces['xml'], 'lang'),
# MathML attributes
(None, 'actiontype'),
(None, 'align'),
(None, 'columnalign'),
(None, 'columnalign'),
(None, 'columnalign'),
(None, 'columnlines'),
(None, 'columnspacing'),
(None, 'columnspan'),
(None, 'depth'),
(None, 'display'),
(None, 'displaystyle'),
(None, 'equalcolumns'),
(None, 'equalrows'),
(None, 'fence'),
(None, 'fontstyle'),
(None, 'fontweight'),
(None, 'frame'),
(None, 'height'),
(None, 'linethickness'),
(None, 'lspace'),
(None, 'mathbackground'),
(None, 'mathcolor'),
(None, 'mathvariant'),
(None, 'mathvariant'),
(None, 'maxsize'),
(None, 'minsize'),
(None, 'other'),
(None, 'rowalign'),
(None, 'rowalign'),
(None, 'rowalign'),
(None, 'rowlines'),
(None, 'rowspacing'),
(None, 'rowspan'),
(None, 'rspace'),
(None, 'scriptlevel'),
(None, 'selection'),
(None, 'separator'),
(None, 'stretchy'),
(None, 'width'),
(None, 'width'),
(namespaces['xlink'], 'href'),
(namespaces['xlink'], 'show'),
(namespaces['xlink'], 'type'),
# SVG attributes
(None, 'accent-height'),
(None, 'accumulate'),
(None, 'additive'),
(None, 'alphabetic'),
(None, 'arabic-form'),
(None, 'ascent'),
(None, 'attributeName'),
(None, 'attributeType'),
(None, 'baseProfile'),
(None, 'bbox'),
(None, 'begin'),
(None, 'by'),
(None, 'calcMode'),
(None, 'cap-height'),
(None, 'class'),
(None, 'clip-path'),
(None, 'color'),
(None, 'color-rendering'),
(None, 'content'),
(None, 'cx'),
(None, 'cy'),
(None, 'd'),
(None, 'dx'),
(None, 'dy'),
(None, 'descent'),
(None, 'display'),
(None, 'dur'),
(None, 'end'),
(None, 'fill'),
(None, 'fill-opacity'),
(None, 'fill-rule'),
(None, 'font-family'),
(None, 'font-size'),
(None, 'font-stretch'),
(None, 'font-style'),
(None, 'font-variant'),
(None, 'font-weight'),
(None, 'from'),
(None, 'fx'),
(None, 'fy'),
(None, 'g1'),
(None, 'g2'),
(None, 'glyph-name'),
(None, 'gradientUnits'),
(None, 'hanging'),
(None, 'height'),
(None, 'horiz-adv-x'),
(None, 'horiz-origin-x'),
(None, 'id'),
(None, 'ideographic'),
(None, 'k'),
(None, 'keyPoints'),
(None, 'keySplines'),
(None, 'keyTimes'),
(None, 'lang'),
(None, 'marker-end'),
(None, 'marker-mid'),
(None, 'marker-start'),
(None, 'markerHeight'),
(None, 'markerUnits'),
(None, 'markerWidth'),
(None, 'mathematical'),
(None, 'max'),
(None, 'min'),
(None, 'name'),
(None, 'offset'),
(None, 'opacity'),
(None, 'orient'),
(None, 'origin'),
(None, 'overline-position'),
(None, 'overline-thickness'),
(None, 'panose-1'),
(None, 'path'),
(None, 'pathLength'),
(None, 'points'),
(None, 'preserveAspectRatio'),
(None, 'r'),
(None, 'refX'),
(None, 'refY'),
(None, 'repeatCount'),
(None, 'repeatDur'),
(None, 'requiredExtensions'),
(None, 'requiredFeatures'),
(None, 'restart'),
(None, 'rotate'),
(None, 'rx'),
(None, 'ry'),
(None, 'slope'),
(None, 'stemh'),
(None, 'stemv'),
(None, 'stop-color'),
(None, 'stop-opacity'),
(None, 'strikethrough-position'),
(None, 'strikethrough-thickness'),
(None, 'stroke'),
(None, 'stroke-dasharray'),
(None, 'stroke-dashoffset'),
(None, 'stroke-linecap'),
(None, 'stroke-linejoin'),
(None, 'stroke-miterlimit'),
(None, 'stroke-opacity'),
(None, 'stroke-width'),
(None, 'systemLanguage'),
(None, 'target'),
(None, 'text-anchor'),
(None, 'to'),
(None, 'transform'),
(None, 'type'),
(None, 'u1'),
(None, 'u2'),
(None, 'underline-position'),
(None, 'underline-thickness'),
(None, 'unicode'),
(None, 'unicode-range'),
(None, 'units-per-em'),
(None, 'values'),
(None, 'version'),
(None, 'viewBox'),
(None, 'visibility'),
(None, 'width'),
(None, 'widths'),
(None, 'x'),
(None, 'x-height'),
(None, 'x1'),
(None, 'x2'),
(namespaces['xlink'], 'actuate'),
(namespaces['xlink'], 'arcrole'),
(namespaces['xlink'], 'href'),
(namespaces['xlink'], 'role'),
(namespaces['xlink'], 'show'),
(namespaces['xlink'], 'title'),
(namespaces['xlink'], 'type'),
(namespaces['xml'], 'base'),
(namespaces['xml'], 'lang'),
(namespaces['xml'], 'space'),
(None, 'y'),
(None, 'y1'),
(None, 'y2'),
(None, 'zoomAndPan'),
))
attr_val_is_uri = frozenset((
(None, 'href'),
(None, 'src'),
(None, 'cite'),
(None, 'action'),
(None, 'longdesc'),
(None, 'poster'),
(None, 'background'),
(None, 'datasrc'),
(None, 'dynsrc'),
(None, 'lowsrc'),
(None, 'ping'),
(namespaces['xlink'], 'href'),
(namespaces['xml'], 'base'),
))
svg_attr_val_allows_ref = frozenset((
(None, 'clip-path'),
(None, 'color-profile'),
(None, 'cursor'),
(None, 'fill'),
(None, 'filter'),
(None, 'marker'),
(None, 'marker-start'),
(None, 'marker-mid'),
(None, 'marker-end'),
(None, 'mask'),
(None, 'stroke'),
))
svg_allow_local_href = frozenset((
(None, 'altGlyph'),
(None, 'animate'),
(None, 'animateColor'),
(None, 'animateMotion'),
(None, 'animateTransform'),
(None, 'cursor'),
(None, 'feImage'),
(None, 'filter'),
(None, 'linearGradient'),
(None, 'pattern'),
(None, 'radialGradient'),
(None, 'textpath'),
(None, 'tref'),
(None, 'set'),
(None, 'use')
))
allowed_css_properties = frozenset((
'azimuth',
'background-color',
'border-bottom-color',
'border-collapse',
'border-color',
'border-left-color',
'border-right-color',
'border-top-color',
'clear',
'color',
'cursor',
'direction',
'display',
'elevation',
'float',
'font',
'font-family',
'font-size',
'font-style',
'font-variant',
'font-weight',
'height',
'letter-spacing',
'line-height',
'overflow',
'pause',
'pause-after',
'pause-before',
'pitch',
'pitch-range',
'richness',
'speak',
'speak-header',
'speak-numeral',
'speak-punctuation',
'speech-rate',
'stress',
'text-align',
'text-decoration',
'text-indent',
'unicode-bidi',
'vertical-align',
'voice-family',
'volume',
'white-space',
'width',
))
allowed_css_keywords = frozenset((
'auto',
'aqua',
'black',
'block',
'blue',
'bold',
'both',
'bottom',
'brown',
'center',
'collapse',
'dashed',
'dotted',
'fuchsia',
'gray',
'green',
'!important',
'italic',
'left',
'lime',
'maroon',
'medium',
'none',
'navy',
'normal',
'nowrap',
'olive',
'pointer',
'purple',
'red',
'right',
'solid',
'silver',
'teal',
'top',
'transparent',
'underline',
'white',
'yellow',
))
allowed_svg_properties = frozenset((
'fill',
'fill-opacity',
'fill-rule',
'stroke',
'stroke-width',
'stroke-linecap',
'stroke-linejoin',
'stroke-opacity',
))
allowed_protocols = frozenset((
'ed2k',
'ftp',
'http',
'https',
'irc',
'mailto',
'news',
'gopher',
'nntp',
'telnet',
'webcal',
'xmpp',
'callto',
'feed',
'urn',
'aim',
'rsync',
'tag',
'ssh',
'sftp',
'rtsp',
'afs',
'data',
))
allowed_content_types = frozenset((
'image/png',
'image/jpeg',
'image/gif',
'image/webp',
'image/bmp',
'text/plain',
))
data_content_type = re.compile(r'''
^
# Match a content type <application>/<type>
(?P<content_type>[-a-zA-Z0-9.]+/[-a-zA-Z0-9.]+)
# Match any character set and encoding
(?:(?:;charset=(?:[-a-zA-Z0-9]+)(?:;(?:base64))?)
|(?:;(?:base64))?(?:;charset=(?:[-a-zA-Z0-9]+))?)
# Assume the rest is data
,.*
$
''',
re.VERBOSE)
class Filter(base.Filter):
""" sanitization of XHTML+MathML+SVG and of inline style attributes."""
def __init__(self,
source,
allowed_elements=allowed_elements,
allowed_attributes=allowed_attributes,
allowed_css_properties=allowed_css_properties,
allowed_css_keywords=allowed_css_keywords,
allowed_svg_properties=allowed_svg_properties,
allowed_protocols=allowed_protocols,
allowed_content_types=allowed_content_types,
attr_val_is_uri=attr_val_is_uri,
svg_attr_val_allows_ref=svg_attr_val_allows_ref,
svg_allow_local_href=svg_allow_local_href):
super(Filter, self).__init__(source)
self.allowed_elements = allowed_elements
self.allowed_attributes = allowed_attributes
self.allowed_css_properties = allowed_css_properties
self.allowed_css_keywords = allowed_css_keywords
self.allowed_svg_properties = allowed_svg_properties
self.allowed_protocols = allowed_protocols
self.allowed_content_types = allowed_content_types
self.attr_val_is_uri = attr_val_is_uri
self.svg_attr_val_allows_ref = svg_attr_val_allows_ref
self.svg_allow_local_href = svg_allow_local_href
def __iter__(self):
for token in base.Filter.__iter__(self):
token = self.sanitize_token(token)
if token:
yield token
# Sanitize the +html+, escaping all elements not in ALLOWED_ELEMENTS, and
# stripping out all # attributes not in ALLOWED_ATTRIBUTES. Style
# attributes are parsed, and a restricted set, # specified by
# ALLOWED_CSS_PROPERTIES and ALLOWED_CSS_KEYWORDS, are allowed through.
# attributes in ATTR_VAL_IS_URI are scanned, and only URI schemes specified
# in ALLOWED_PROTOCOLS are allowed.
#
# sanitize_html('<script> do_nasty_stuff() </script>')
# => <script> do_nasty_stuff() </script>
# sanitize_html('<a href="javascript: sucker();">Click here for $100</a>')
# => <a>Click here for $100</a>
def sanitize_token(self, token):
# accommodate filters which use token_type differently
token_type = token["type"]
if token_type in ("StartTag", "EndTag", "EmptyTag"):
name = token["name"]
namespace = token["namespace"]
if ((namespace, name) in self.allowed_elements or
(namespace is None and
(namespaces["html"], name) in self.allowed_elements)):
return self.allowed_token(token)
else:
return self.disallowed_token(token)
elif token_type == "Comment":
pass
else:
return token
def allowed_token(self, token):
if "data" in token:
attrs = token["data"]
attr_names = set(attrs.keys())
# Remove forbidden attributes
for to_remove in (attr_names - self.allowed_attributes):
del token["data"][to_remove]
attr_names.remove(to_remove)
# Remove attributes with disallowed URL values
for attr in (attr_names & self.attr_val_is_uri):
assert attr in attrs
# I don't have a clue where this regexp comes from or why it matches those
# characters, nor why we call unescape. I just know it's always been here.
# Should you be worried by this comment in a sanitizer? Yes. On the other hand, all
# this will do is remove *more* than it otherwise would.
val_unescaped = re.sub("[`\x00-\x20\x7f-\xa0\s]+", '',
unescape(attrs[attr])).lower()
# remove replacement characters from unescaped characters
val_unescaped = val_unescaped.replace("\ufffd", "")
try:
uri = urlparse.urlparse(val_unescaped)
except ValueError:
uri = None
del attrs[attr]
if uri and uri.scheme:
if uri.scheme not in self.allowed_protocols:
del attrs[attr]
if uri.scheme == 'data':
m = data_content_type.match(uri.path)
if not m:
del attrs[attr]
elif m.group('content_type') not in self.allowed_content_types:
del attrs[attr]
for attr in self.svg_attr_val_allows_ref:
if attr in attrs:
attrs[attr] = re.sub(r'url\s*\(\s*[^#\s][^)]+?\)',
' ',
unescape(attrs[attr]))
if (token["name"] in self.svg_allow_local_href and
(namespaces['xlink'], 'href') in attrs and re.search('^\s*[^#\s].*',
attrs[(namespaces['xlink'], 'href')])):
del attrs[(namespaces['xlink'], 'href')]
if (None, 'style') in attrs:
attrs[(None, 'style')] = self.sanitize_css(attrs[(None, 'style')])
token["data"] = attrs
return token
def disallowed_token(self, token):
token_type = token["type"]
if token_type == "EndTag":
token["data"] = "</%s>" % token["name"]
elif token["data"]:
assert token_type in ("StartTag", "EmptyTag")
attrs = []
for (ns, name), v in token["data"].items():
attrs.append(' %s="%s"' % (name if ns is None else "%s:%s" % (prefixes[ns], name), escape(v)))
token["data"] = "<%s%s>" % (token["name"], ''.join(attrs))
else:
token["data"] = "<%s>" % token["name"]
if token.get("selfClosing"):
token["data"] = token["data"][:-1] + "/>"
token["type"] = "Characters"
del token["name"]
return token
def sanitize_css(self, style):
# disallow urls
style = re.compile('url\s*\(\s*[^\s)]+?\s*\)\s*').sub(' ', style)
# gauntlet
if not re.match("""^([:,;#%.\sa-zA-Z0-9!]|\w-\w|'[\s\w]+'|"[\s\w]+"|\([\d,\s]+\))*$""", style):
return ''
if not re.match("^\s*([-\w]+\s*:[^:;]*(;\s*|$))*$", style):
return ''
clean = []
for prop, value in re.findall("([-\w]+)\s*:\s*([^:;]*)", style):
if not value:
continue
if prop.lower() in self.allowed_css_properties:
clean.append(prop + ': ' + value + ';')
elif prop.split('-')[0].lower() in ['background', 'border', 'margin',
'padding']:
for keyword in value.split():
if keyword not in self.allowed_css_keywords and \
not re.match("^(#[0-9a-f]+|rgb\(\d+%?,\d*%?,?\d*%?\)?|\d{0,2}\.?\d{0,2}(cm|em|ex|in|mm|pc|pt|px|%|,|\))?)$", keyword): # noqa
break
else:
clean.append(prop + ': ' + value + ';')
elif prop.lower() in self.allowed_svg_properties:
clean.append(prop + ': ' + value + ';')
return ' '.join(clean)
pip/_vendor/html5lib/filters/whitespace.py 0000644 00000002163 14751155150 0014674 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
import re
from . import base
from ..constants import rcdataElements, spaceCharacters
spaceCharacters = "".join(spaceCharacters)
SPACES_REGEX = re.compile("[%s]+" % spaceCharacters)
class Filter(base.Filter):
spacePreserveElements = frozenset(["pre", "textarea"] + list(rcdataElements))
def __iter__(self):
preserve = 0
for token in base.Filter.__iter__(self):
type = token["type"]
if type == "StartTag" \
and (preserve or token["name"] in self.spacePreserveElements):
preserve += 1
elif type == "EndTag" and preserve:
preserve -= 1
elif not preserve and type == "SpaceCharacters" and token["data"]:
# Test on token["data"] above to not introduce spaces where there were not
token["data"] = " "
elif not preserve and type == "Characters":
token["data"] = collapse_spaces(token["data"])
yield token
def collapse_spaces(text):
return SPACES_REGEX.sub(' ', text)
pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.opt-1.pyc 0000644 00000042731 14751155150 0022000 0 ustar 00 3
���eb � E @ s
d dl mZmZmZ d dlZd dlmZmZ d dlm Z
ddl m Z ddl
mZmZ d gZeed
d fed
d fed
d
fed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
d fed
d fed
d fed
d fed
d fed
d!fed
d"fed
d#fed
d$fed
d%fed
d&fed
d'fed
d(fed
d)fed
d*fed
d+fed
d,fed
d-fed
d.fed
d/fed
d0fed
d1fed
d2fed
d3fed
d4fed
d5fed
d6fed
d7fed
d8fed
d9fed
d:fed
d;fed
d<fed
d=fed
d>fed
d?fed
d@fed
dAfed
dBfed
dCfed
dDfed
dEfed
dFfed
dGfed
dHfed
dIfed
dJfed
dKfed
dLfed
dMfed
dNfed
dOfed
dPfed
dQfed
dRfed
dSfed
dTfed
dUfed
dVfed
dWfed
dXfed
dYfed
dZfed
d[fed
d\fed
d]fed
d^fed
d_fed
d`fed
dafed
dbfed
dcfed
ddfed
defed
dffed
dgfed
dhfed
difed
djfed
dkfed
dlfed
dmfedn dofedn dpfedn dqfedn drfedn dsfedn dtfedn dufedn dvfedn dwfedn dxfedn dyfedn dzfedn d{fedn d|fedn d}fedn d~fedn dfedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fed� d fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�ff��Ze�d3�d4�d5�d6�d7�d8�d9�d:�d;�d<�d=�d>�d?�d@�dA�dB�dC�dD�dE�dF�dG�dH�dI�dJ�dK�dL�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d`�da�db�dc�dd�de�df�dg�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dr�ds�dt�du�dv�dw�dx�dy�dz�d{�d|�d}�d~�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d�e�d1 d�f�d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d͐dΐdϐdАdѐdҐdӐdԐdՐddאdؐdِdڐdېdܐdݐdސdߐd�d�d�d�d�d�d�e�dO d�fe�dO �dPfe�dO �d%f�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d��d��d��d��d��d��d��d��d��d��d��d �d�d�d�d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�d/�d0�d1�d2�d3�d4�d5�d6�d7�d8�d9�d:�d;�d<�d=�d>�d?�d@�dA�dB�dC�dD�dE�dF�dG�dH�dI�dJ�dK�dL�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d`�da�db�dce�dO �d�fe�dO �d�fe�dO d�fe�dO �d�fe�dO �dPfe�dO d�fe�dO �d%fe�d1 �d�fe�d1 d�fe�d1 �d�f�dd�de�df�dg�fC�Ze�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dre�dO d�fe�d1 �d�ff
�Ze�d~�Ze�d��Ze�d��Ze�d��Ze�d��Ze�d��Ze�d��Zej �d1ej �Z G �d2d � d e j �Z dS (� � )�absolute_import�division�unicode_literalsN)�escape�unescape)� urllib_parse� )�base� )�
namespaces�prefixes�Filter�html�a�abbrZacronymZaddressZareaZarticleZasideZaudio�bZbigZ
blockquote�brZbuttonZcanvasZcaption�center�cite�code�colZcolgroupZcommandZdatagridZdatalistZdd�delZdetailsZdfnZdialog�dirZdivZdlZdtZemz event-sourceZfieldsetZ
figcaptionZfigureZfooter�font�form�headerZh1Zh2Zh3Zh4Zh5Zh6Zhr�iZimg�inputZinsZkeygenZkbd�labelZlegendZli�m�mapZmenuZmeterZmulticolZnavZnextidZol�outputZoptgroupZoption�pZpreZprogress�q�sZsampZsectionZselectZsmallZsound�sourceZspacer�spanZstrikeZstrong�subZsup�tableZtbodyZtdZtextareaZtimeZtfootZthZtheadZtrZtt�uZul�varZvideoZmathmlZmactionZmathZmerrorZmfracZmiZ
mmultiscriptsZmn�moZmoverZmpaddedZmphantomZ mprescriptsZmrootZmrowZmspaceZmsqrtZmstyleZmsubZmsubsupZmsupZmtableZmtdZmtextZmtrZmunderZ
munderover�noneZsvg�animate� animateColor�
animateMotion�animateTransformZclipPathZcircleZdefsZdescZellipsez font-facezfont-face-namez
font-face-src�gZglyphZhkern�linearGradient�line�markerZmetadataz
missing-glyphZmpath�pathZpolygonZpolyline�radialGradientZrect�set�stopZswitch�text�titleZtspan�use�accept�accept-charset� accesskey�action�align�alt� autocomplete� autofocus�axis�
background�balance�bgcolor� bgproperties�border� bordercolor�bordercolordark�bordercolorlight�
bottompadding� cellpadding� cellspacing�ch� challenge�char�charoff�choff�charset�checked�class�clear�color�cols�colspan�compact�contenteditable�controls�coords�data�datafld� datapagesize�datasrc�datetime�default�delay�disabled� draggable�dynsrc�enctype�end�face�for�frame�
galleryimg�gutter�headers�height� hidefocus�hidden�high�href�hreflang�hspace�icon�id� inputmode�ismap�keytype� leftspacing�lang�list�longdesc�loop� loopcount�loopend� loopstart�low�lowsrc�max� maxlength�media�method�min�multiple�name�nohref�noshade�nowrap�open�optimum�pattern�ping�
point-size�poster�pqg�preload�prompt�
radiogroup�readonly�rel�
repeat-max�
repeat-min�replace�required�rev� rightspacing�rows�rowspan�rules�scope�selected�shape�size�src�start�step�style�summary�suppress�tabindex�target�template�
toppadding�type� unselectable�usemap�urn�valign�value�variable�volume�vspace�vrml�width�wrapZxml�
actiontype� columnalign� columnlines�
columnspacing�
columnspan�depth�display� displaystyle� equalcolumns� equalrows�fence� fontstyle�
fontweight�
linethickness�lspace�mathbackground� mathcolor� mathvariant�maxsize�minsize�other�rowalign�rowlines�
rowspacing�rspace� scriptlevel� selection� separator�stretchy�xlinkZshow�
accent-height�
accumulate�additive�
alphabetic� arabic-form�ascent�
attributeName�
attributeType� baseProfile�bbox�begin�by�calcMode�
cap-height� clip-path�color-rendering�content�cx�cy�d�dx�dy�descent�dur�fill� fill-opacity� fill-rule� font-family� font-size� font-stretch�
font-style� font-variant� font-weight�from�fx�fy�g1�g2�
glyph-name�
gradientUnits�hanging� horiz-adv-x�horiz-origin-x� ideographic�k� keyPoints�
keySplines�keyTimes�
marker-end�
marker-mid� marker-start� markerHeight� markerUnits� markerWidth� mathematical�offset�opacity�orient�origin�overline-position�overline-thickness�panose-1�
pathLength�points�preserveAspectRatio�r�refX�refY� repeatCount� repeatDur�requiredExtensions�requiredFeatures�restart�rotate�rx�ry�slope�stemh�stemv�
stop-color� stop-opacity�strikethrough-position�strikethrough-thickness�stroke�stroke-dasharray�stroke-dashoffset�stroke-linecap�stroke-linejoin�stroke-miterlimit�stroke-opacity� stroke-width�systemLanguage� text-anchor�to� transform�u1�u2�underline-position�underline-thickness�unicode�
unicode-range� units-per-em�values�version�viewBox�
visibility�widths�x�x-height�x1�x2ZactuateZarcroleZroler Zspace�y�y1�y2�
zoomAndPan�
color-profile�cursor�filter�mask�altGlyph�feImage�textpath�tref�azimuth�background-color�border-bottom-color�border-collapse� border-color�border-left-color�border-right-color�border-top-color� direction� elevation�float�letter-spacing� line-height�overflow�pause� pause-after� pause-before�pitch� pitch-range�richness�speak� speak-header�
speak-numeral�speak-punctuation� speech-rate�stress�
text-align�text-decoration� text-indent� unicode-bidi�vertical-align� voice-family� white-space�auto�aqua�black�block�blue�bold�both�bottom�brown�collapse�dashed�dotted�fuchsia�gray�green�
!important�italic�left�lime�maroon�medium�navy�normal�olive�pointer�purple�red�right�solid�silver�teal�top� transparent� underline�white�yellow�ed2k�ftp�http�https�irc�mailto�news�gopher�nntp�telnet�webcal�xmpp�callto�feed�aim�rsync�tag�ssh�sftp�rtsp�afs� image/png�
image/jpeg� image/gif�
image/webp� image/bmp�
text/plainaL
^
# Match a content type <application>/<type>
(?P<content_type>[-a-zA-Z0-9.]+/[-a-zA-Z0-9.]+)
# Match any character set and encoding
(?:(?:;charset=(?:[-a-zA-Z0-9]+)(?:;(?:base64))?)
|(?:;(?:base64))?(?:;charset=(?:[-a-zA-Z0-9]+))?)
# Assume the rest is data
,.*
$
c
s^ e Zd ZdZeeeeee e
e e e
f
� fdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z� ZS )r
zA sanitization of XHTML+MathML+SVG and of inline style attributes.c sP t t| �j|� || _|| _|| _|| _|| _|| _|| _ | | _
|
| _ | | _ d S )N)
�superr
�__init__�allowed_elements�allowed_attributes�allowed_css_properties�allowed_css_keywords�allowed_svg_properties�allowed_protocols�allowed_content_types�attr_val_is_uri�svg_attr_val_allows_ref�svg_allow_local_href) �selfr% r� r� r� r� r� r� r� r� r� r� )� __class__� � /usr/lib/python3.6/sanitizer.pyr� � s zFilter.__init__c c s. x(t jj| �D ]}| j|�}|r|V qW d S )N)r r
�__iter__�sanitize_token)r� �tokenr� r� r� r� � s
zFilter.__iter__c C sp |d }|d kr^|d }|d }||f| j ksH|d krRtd |f| j krR| j|�S | j|�S n|dkrhn|S d S )
Nr� �StartTag�EndTag�EmptyTagr� � namespacer �Comment)r� r� r� )r� r �
allowed_token�disallowed_token)r� r� �
token_typer� r� r� r� r� r� � s
zFilter.sanitize_tokenc C s� d|k�r�|d }t |j� �}x&|| j D ]}|d |= |j|� q*W x�|| j@ D ]�}tjddt|| ��j� }|j dd�}yt
j
|�}W n t k
r� d }||= Y nX |o�|j rR|j | j
kr�||= |j dkrRtj|j�}|s�||= qR|jd�| jkrR||= qRW x4| jD ]*}||k�r
tjddt|| ��||< �q
W |d | jk�r�td d
f|k�r�tjd |td d
f ��r�|td d
f= d
|k�r�| j|d �|d< ||d< |S )Nr` u
[` - - \s]+� u �Z content_typezurl\s*\(\s*[^#\s][^)]+?\)� r� r� rv z ^\s*[^#\s].*r� )Nr� )Nr� )Nr� )r7 �keysr� �remover� �rer' r �lowerr� �urlparse�
ValueError�schemer� �data_content_type�matchr5 �groupr� r� r� r �search� sanitize_css) r� r� �attrsZ
attr_namesZ to_remove�attrZ
val_unescapedZurir r� r� r� r� sJ
zFilter.allowed_tokenc C s� |d }|dkr"d|d |d< n�|d r�g }xJ|d j � D ]:\\}}}|jd|d krZ|ndt| |f t|�f � q<W d|d d j|�f |d< nd
|d |d< |jd �r�|d d d� d
|d< d|d< |d= |S )Nr� r� z</%s>r� r` z %s="%s"z%s:%sz<%s%s>r� z<%s>Z selfClosingr z/>Z
Characters���)�items�appendr r �join�get)r� r� r� r� �nsr� �vr� r� r� r� 2 s 2
zFilter.disallowed_tokenc C s t jd�jd|�}t jd|�s"dS t jd|�s2dS g }x�t jd|�D ]�\}}|sRqD|j� | jkrx|j|d | d � qD|jd �d
j� dkr�xf|j� D ] }|| j kr�t jd|� r�P q�W |j|d | d � qD|j� | j
krD|j|d | d � qDW dj |�S )Nzurl\s*\(\s*[^\s)]+?\s*\)\s*r� z@^([:,;#%.\sa-zA-Z0-9!]|\w-\w|'[\s\w]+'|"[\s\w]+"|\([\d,\s]+\))*$r� z ^\s*([-\w]+\s*:[^:;]*(;\s*|$))*$z([-\w]+)\s*:\s*([^:;]*)z: �;�-r rE rI �margin�paddingz\^(#[0-9a-f]+|rgb\(\d+%?,\d*%?,?\d*%?\)?|\d{0,2}\.?\d{0,2}(cm|em|ex|in|mm|pc|pt|px|%|,|\))?)$)rE rI r� r� ) r� �compiler' r� �findallr� r� r� �splitr� r� r� )r� r� ZcleanZpropr� �keywordr� r� r� r� F s*
zFilter.sanitize_css)�__name__�
__module__� __qualname__�__doc__r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__r� r� )r� r� r
� s
2)Nr )Nr< )Nr= )Nr> )Nr? )Nr@ )NrA )NrB )NrC )NrD )NrE )NrF )NrG )NrH )NrI )NrJ )NrK )NrL )NrM )NrN )NrO )NrP )NrQ )NrR )NrS )NrT )NrU )NrV )Nr )NrW )NrX )NrY )NrZ )Nr[ )Nr\ )Nr] )Nr^ )Nr_ )Nr` )Nra )Nrb )Nrc )Nrd )Nre )Nrf )Nr )Nrg )Nrh )Nri )Nrj )Nrk )Nrl )Nrm )Nr )Nrn )Nro )Nrp )Nrq )Nrr )Nrs )Nrt )Nru )Nrv )Nrw )Nrx )Nry )Nrz )Nr{ )Nr| )Nr} )Nr )Nr~ )Nr )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr& )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr: )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr@ )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nrn )Nrr )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )NrW )Nr� )NrY )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nrk )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nrr )Nr )Nr )Nrz )Nr
)Nr )Nr )Nr
)Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr� )Nr� )Nr� )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr5 )Nr )Nr )Nr )Nr )Nr! )Nr" )Nr# )Nr$ )Nr% )Nr& )Nr' )Nr( )Nr) )Nr* )Nr+ )Nr, )Nr- )Nr. )Nr/ )Nr0 )Nr1 )Nr2 )Nr3 )Nr4 )Nr5 )Nr6 )Nr7 )Nr8 )Nr9 )Nr: )Nr� )Nr; )Nr< )Nr= )Nr� )Nr> )Nr? )Nr@ )NrA )NrB )NrC )NrD )NrE )NrF )NrG )NrH )Nr� )NrI )NrJ )NrK )NrL )NrM )NrN )NrO )NrP )NrQ )Nrv )Nr� )Nr )Nr? )Nr� )Nr� )NrE )Nrc )Nri )Nr� )Nr� �Nr� �NrR �NrS �Nr� �NrT �Nr4 �Nr �Nr �Nr �NrU �Nr2 ) r� r� r� r� r� r� r� r r r r �NrV �Nr- �Nr. �Nr/ �Nr0 �NrS �NrW �NrT �Nr2 �Nr� �Nr6 �NrX �NrY �Nr7 �Nr; )r r r r r r r
r r r
r r r r r ).rZ r[ r\ r] r^ r_ r` ra rX rY rS rb r� rc rd r r� r� r� r� r� rr re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry r� rz r� )'r{ r| r} r~ r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r, r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )r� r� r� r2 r9 r5 r6 r8 )r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r` )r� r� r� r� r� r� ) Z
__future__r r r r� Zxml.sax.saxutilsr r Zpip._vendor.six.movesr r� r� r Z constantsr r �__all__� frozensetr� r� r� r� r� r� r� r� r� r� r� �VERBOSEr� r
r� r� r� r� �<module> s2
pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.opt-1.pyc 0000644 00000003116 14751155150 0023755 0 ustar 00 3
���e�
� @ s6 d dl mZmZmZ ddlmZ G dd� dej�ZdS )� )�absolute_import�division�unicode_literals� )�basec @ s e Zd Zdd� Zdd� ZdS )�Filterc C s t jj| |� || _d S )N)r r �__init__�encoding)�self�sourcer � r �)/usr/lib/python3.6/inject_meta_charset.pyr s zFilter.__init__c
c s� d}| j d k}g }�x�tjj| �D �]�}|d }|dkrP|d j� dkrLd}�np|dk�rV|d j� dk�rd }x�|d
j� D ]V\\}}} |d k r�q~q~|j� d kr�| j |d
||f< d }P q~|d
kr~| j� dkr~d }q~W |o�d|d
k�rTd| j |d
d< d }nR|d j� dk�r�| �r�dd|d
d�V ddd| j id�V ddd�V d }q"nj|dk�r�|d j� dk�r�|�r�|jd�V |�s�ddd| j id�V x|�r�|jd�V �q�W d }d}|dk�r�|j|� q"|V q"W d S )NZpre_head�typeZStartTag�name�headZin_headZEmptyTag�metaF�data�charsetTz
http-equivz content-type�contentztext/html; charset=%s)r r r ZEndTag)r r r Z post_head)Nr )Nr )Nr )Nr )r r r �__iter__�lower�items�pop�append)
r
�stateZ
meta_found�pending�tokenr Zhas_http_equiv_content_type� namespacer �valuer r r
r sX
zFilter.__iter__N)�__name__�
__module__� __qualname__r r r r r r
r s r N)Z
__future__r r r � r r r r r r
�<module> s pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.opt-1.pyc 0000644 00000001730 14751155150 0024502 0 ustar 00 3
���em � @ sh d dl mZmZmZ ddlmZ yd dlmZ W n ek
rP d dl mZ Y nX G dd� dej
�Z
dS )� )�absolute_import�division�unicode_literals� )�base)� OrderedDictc @ s e Zd Zdd� ZdS )�Filterc c sh xbt jj| �D ]R}|d dkrZt� }x,t|d j� dd� d�D ]\}}|||< q>W ||d< |V qW d S ) N�type�StartTag�EmptyTag�datac S s | d S )Nr � )�xr
r
�,/usr/lib/python3.6/alphabeticalattributes.py�<lambda> s z!Filter.__iter__.<locals>.<lambda>)�key)r
r )r r �__iter__r �sorted�items)�self�tokenZattrs�name�valuer
r
r r s zFilter.__iter__N)�__name__�
__module__� __qualname__r r
r
r
r r s r N) Z
__future__r r r � r � collectionsr � ImportErrorZ ordereddictr r
r
r
r �<module> s pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.pyc 0000644 00000005615 14751155150 0021535 0 ustar 00 3
���e&) � @ s6 d dl mZmZmZ ddlmZ G dd� dej�ZdS )� )�absolute_import�division�unicode_literals� )�basec @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�Filterc c sL d }}x*| j D ] }|d k r(|||fV |}|}qW |d k rH||d fV d S )N)�source)�selfZ previous1Z previous2�token� r �"/usr/lib/python3.6/optionaltags.py�slider s z
Filter.sliderc c sv xp| j � D ]d\}}}|d }|dkrH|d s@| j|d ||� rn|V q
|dkrh| j|d |�sn|V q
|V q
W d S )N�type�StartTag�data�name�EndTag)r
�is_optional_start�is_optional_end)r �previousr
�nextr r r r �__iter__ s zFilter.__iter__c C s� |r |d pd }|dkr |dkS |dkrJ|dkr4dS |d krH|d
dkS n�|d krx|dkr^d S |dkrr|d
dkS dS nd|dkr�|dkr�|d
dkS d S nB|dk� r�|dkr�|r�|d d kr�|d
dkr�d S |d
dkS d S d S )Nr �html�Comment�SpaceCharacters�headr �EmptyTagTr r �bodyF�script�style�colgroup�col�tbody�thead�tfoot�tr)r r )r r )r r )r r )r r )r" r# r$ r )r �tagnamer r r r r r r s4
zFilter.is_optional_startc C s |r |d pd }|d7kr |d8kS |d9krP|d
kr<|d |kS |d kpJ|d kS �n�|d:kr�|d
krl|d d;kS |dkr�|d kp�|d kS dS �n||dk� r�|d<k� r�|d d=kS |d k� p�|d kS �nF|d-k� r�|d
k� r�|d d>kS |d k� p�|d kS �n|d?k�r,|d
k�r|d d@kS |d k�p(|d kS n�|d0k�r`|dAk�rDdS |d
k�rZ|d d0kS d1S n�|dBk�r�|d
k�r�|d dCkS |d3k�r�|d k�p�|d kS dS nf|d4k�r�|d
k�r�|d d3kS |d k�p�|d kS n2|dDk�r|d
k�r�|d dEkS |d k�p|d kS dS )FNr r r r r r �li�optgroupr% r r r �dt�ddF�pr �address�article�aside�
blockquote�datagrid�dialog�dir�div�dl�fieldset�footer�form�h1�h2�h3�h4�h5�h6�header�hr�menu�nav�ol�pre�section�table�ul�option�rt�rpr Tr# r" r$ �td�th)r r r )r r )r' r( r% )r) r* )r) r* )r r ) r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB r+ rC rD rE rF )rG r( )rH rI )rH rI )r r )r# r" )r" r$ )rJ rK )rJ rK r )r r& r r r r r r W sf
zFilter.is_optional_endN)�__name__�
__module__� __qualname__r
r r r r r r r r s
9r N)Z
__future__r r r � r r r r r r �<module> s pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.pyc 0000644 00000001373 14751155150 0017740 0 ustar 00 3
���e � @ s( d dl mZmZmZ G dd� de�ZdS )� )�absolute_import�division�unicode_literalsc @ s$ e Zd Zdd� Zdd� Zdd� ZdS )�Filterc C s
|| _ d S )N)�source)�selfr � r �/usr/lib/python3.6/base.py�__init__ s zFilter.__init__c C s
t | j�S )N)�iterr )r r r r �__iter__ s zFilter.__iter__c C s t | j|�S )N)�getattrr )r �namer r r � __getattr__ s zFilter.__getattr__N)�__name__�
__module__� __qualname__r
r r r r r r r s r N)Z
__future__r r r �objectr r r r r �<module> s pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.pyc 0000644 00000001730 14751155150 0023543 0 ustar 00 3
���em � @ sh d dl mZmZmZ ddlmZ yd dlmZ W n ek
rP d dl mZ Y nX G dd� dej
�Z
dS )� )�absolute_import�division�unicode_literals� )�base)� OrderedDictc @ s e Zd Zdd� ZdS )�Filterc c sh xbt jj| �D ]R}|d dkrZt� }x,t|d j� dd� d�D ]\}}|||< q>W ||d< |V qW d S ) N�type�StartTag�EmptyTag�datac S s | d S )Nr � )�xr
r
�,/usr/lib/python3.6/alphabeticalattributes.py�<lambda> s z!Filter.__iter__.<locals>.<lambda>)�key)r
r )r r �__iter__r �sorted�items)�self�tokenZattrs�name�valuer
r
r r s zFilter.__iter__N)�__name__�
__module__� __qualname__r r
r
r
r r s r N) Z
__future__r r r � r � collectionsr � ImportErrorZ ordereddictr r
r
r
r �<module> s pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.opt-1.pyc 0000644 00000002245 14751155150 0022120 0 ustar 00 3
���es � @ sn d dl mZmZmZ d dlZddlmZ ddlmZm Z dj
e �Z ej de �Z G d d
� d
ej
�Z
d d � ZdS )
� )�absolute_import�division�unicode_literalsN� )�base� )�rcdataElements�spaceCharacters� z[%s]+c @ s( e Zd Zeddgee� �Zdd� ZdS )�FilterZpreZtextareac c s� d}x�t jj| �D ]�}|d }|dkrB|s8|d | jkrB|d7 }nT|dkrX|rX|d8 }n>| rx|dkrx|d rxd |d< n | r�|d
kr�t|d �|d< |V qW d S ) Nr �typeZStartTag�namer ZEndTagZSpaceCharacters�data� Z
Characters)r r �__iter__�spacePreserveElements�collapse_spaces)�selfZpreserve�tokenr � r � /usr/lib/python3.6/whitespace.pyr s
zFilter.__iter__N)�__name__�
__module__� __qualname__� frozenset�listr r r r r r r r s r c C s t jd| �S )Nr )� SPACES_REGEX�sub)�textr r r r % s r )Z
__future__r r r �rer
r Z constantsr r �join�compiler r r r r r r �<module> s
pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.pyc 0000644 00000000161 14751155150 0020557 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.pyc 0000644 00000003116 14751155150 0023016 0 ustar 00 3
���e�
� @ s6 d dl mZmZmZ ddlmZ G dd� dej�ZdS )� )�absolute_import�division�unicode_literals� )�basec @ s e Zd Zdd� Zdd� ZdS )�Filterc C s t jj| |� || _d S )N)r r �__init__�encoding)�self�sourcer � r �)/usr/lib/python3.6/inject_meta_charset.pyr s zFilter.__init__c
c s� d}| j d k}g }�x�tjj| �D �]�}|d }|dkrP|d j� dkrLd}�np|dk�rV|d j� dk�rd }x�|d
j� D ]V\\}}} |d k r�q~q~|j� d kr�| j |d
||f< d }P q~|d
kr~| j� dkr~d }q~W |o�d|d
k�rTd| j |d
d< d }nR|d j� dk�r�| �r�dd|d
d�V ddd| j id�V ddd�V d }q"nj|dk�r�|d j� dk�r�|�r�|jd�V |�s�ddd| j id�V x|�r�|jd�V �q�W d }d}|dk�r�|j|� q"|V q"W d S )NZpre_head�typeZStartTag�name�headZin_headZEmptyTag�metaF�data�charsetTz
http-equivz content-type�contentztext/html; charset=%s)r r r ZEndTag)r r r Z post_head)Nr )Nr )Nr )Nr )r r r �__iter__�lower�items�pop�append)
r
�stateZ
meta_found�pending�tokenr Zhas_http_equiv_content_type� namespacer �valuer r r
r sX
zFilter.__iter__N)�__name__�
__module__� __qualname__r r r r r r
r s r N)Z
__future__r r r � r r r r r r
�<module> s pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000161 14751155150 0021516 0 ustar 00 3
���e � @ s d S )N� r r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.pyc 0000644 00000002245 14751155150 0021161 0 ustar 00 3
���es � @ sn d dl mZmZmZ d dlZddlmZ ddlmZm Z dj
e �Z ej de �Z G d d
� d
ej
�Z
d d � ZdS )
� )�absolute_import�division�unicode_literalsN� )�base� )�rcdataElements�spaceCharacters� z[%s]+c @ s( e Zd Zeddgee� �Zdd� ZdS )�FilterZpreZtextareac c s� d}x�t jj| �D ]�}|d }|dkrB|s8|d | jkrB|d7 }nT|dkrX|rX|d8 }n>| rx|dkrx|d rxd |d< n | r�|d
kr�t|d �|d< |V qW d S ) Nr �typeZStartTag�namer ZEndTagZSpaceCharacters�data� Z
Characters)r r �__iter__�spacePreserveElements�collapse_spaces)�selfZpreserve�tokenr � r � /usr/lib/python3.6/whitespace.pyr s
zFilter.__iter__N)�__name__�
__module__� __qualname__� frozenset�listr r r r r r r r s r c C s t jd| �S )Nr )� SPACES_REGEX�sub)�textr r r r % s r )Z
__future__r r r �rer
r Z constantsr r �join�compiler r r r r r r �<module> s
pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.opt-1.pyc 0000644 00000001373 14751155150 0020677 0 ustar 00 3
���e � @ s( d dl mZmZmZ G dd� de�ZdS )� )�absolute_import�division�unicode_literalsc @ s$ e Zd Zdd� Zdd� Zdd� ZdS )�Filterc C s
|| _ d S )N)�source)�selfr � r �/usr/lib/python3.6/base.py�__init__ s zFilter.__init__c C s
t | j�S )N)�iterr )r r r r �__iter__ s zFilter.__iter__c C s t | j|�S )N)�getattrr )r �namer r r � __getattr__ s zFilter.__getattr__N)�__name__�
__module__� __qualname__r
r r r r r r r s r N)Z
__future__r r r �objectr r r r r �<module> s pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.opt-1.pyc 0000644 00000005615 14751155150 0022474 0 ustar 00 3
���e&) � @ s6 d dl mZmZmZ ddlmZ G dd� dej�ZdS )� )�absolute_import�division�unicode_literals� )�basec @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�Filterc c sL d }}x*| j D ] }|d k r(|||fV |}|}qW |d k rH||d fV d S )N)�source)�selfZ previous1Z previous2�token� r �"/usr/lib/python3.6/optionaltags.py�slider s z
Filter.sliderc c sv xp| j � D ]d\}}}|d }|dkrH|d s@| j|d ||� rn|V q
|dkrh| j|d |�sn|V q
|V q
W d S )N�type�StartTag�data�name�EndTag)r
�is_optional_start�is_optional_end)r �previousr
�nextr r r r �__iter__ s zFilter.__iter__c C s� |r |d pd }|dkr |dkS |dkrJ|dkr4dS |d krH|d
dkS n�|d krx|dkr^d S |dkrr|d
dkS dS nd|dkr�|dkr�|d
dkS d S nB|dk� r�|dkr�|r�|d d kr�|d
dkr�d S |d
dkS d S d S )Nr �html�Comment�SpaceCharacters�headr �EmptyTagTr r �bodyF�script�style�colgroup�col�tbody�thead�tfoot�tr)r r )r r )r r )r r )r r )r" r# r$ r )r �tagnamer r r r r r r s4
zFilter.is_optional_startc C s |r |d pd }|d7kr |d8kS |d9krP|d
kr<|d |kS |d kpJ|d kS �n�|d:kr�|d
krl|d d;kS |dkr�|d kp�|d kS dS �n||dk� r�|d<k� r�|d d=kS |d k� p�|d kS �nF|d-k� r�|d
k� r�|d d>kS |d k� p�|d kS �n|d?k�r,|d
k�r|d d@kS |d k�p(|d kS n�|d0k�r`|dAk�rDdS |d
k�rZ|d d0kS d1S n�|dBk�r�|d
k�r�|d dCkS |d3k�r�|d k�p�|d kS dS nf|d4k�r�|d
k�r�|d d3kS |d k�p�|d kS n2|dDk�r|d
k�r�|d dEkS |d k�p|d kS dS )FNr r r r r r �li�optgroupr% r r r �dt�ddF�pr �address�article�aside�
blockquote�datagrid�dialog�dir�div�dl�fieldset�footer�form�h1�h2�h3�h4�h5�h6�header�hr�menu�nav�ol�pre�section�table�ul�option�rt�rpr Tr# r" r$ �td�th)r r r )r r )r' r( r% )r) r* )r) r* )r r ) r, r- r. r/ r0 r1 r2 r3 r4 r5 r6 r7 r8 r9 r: r; r< r= r> r? r@ rA rB r+ rC rD rE rF )rG r( )rH rI )rH rI )r r )r# r" )r" r$ )rJ rK )rJ rK r )r r& r r r r r r W sf
zFilter.is_optional_endN)�__name__�
__module__� __qualname__r
r r r r r r r r s
9r N)Z
__future__r r r � r r r r r r �<module> s pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.pyc 0000644 00000043040 14751155150 0021033 0 ustar 00 3
���eb � E @ s
d dl mZmZmZ d dlZd dlmZmZ d dlm Z
ddl m Z ddl
mZmZ d gZeed
d fed
d fed
d
fed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
dfed
d fed
d fed
d fed
d fed
d fed
d!fed
d"fed
d#fed
d$fed
d%fed
d&fed
d'fed
d(fed
d)fed
d*fed
d+fed
d,fed
d-fed
d.fed
d/fed
d0fed
d1fed
d2fed
d3fed
d4fed
d5fed
d6fed
d7fed
d8fed
d9fed
d:fed
d;fed
d<fed
d=fed
d>fed
d?fed
d@fed
dAfed
dBfed
dCfed
dDfed
dEfed
dFfed
dGfed
dHfed
dIfed
dJfed
dKfed
dLfed
dMfed
dNfed
dOfed
dPfed
dQfed
dRfed
dSfed
dTfed
dUfed
dVfed
dWfed
dXfed
dYfed
dZfed
d[fed
d\fed
d]fed
d^fed
d_fed
d`fed
dafed
dbfed
dcfed
ddfed
defed
dffed
dgfed
dhfed
difed
djfed
dkfed
dlfed
dmfedn dofedn dpfedn dqfedn drfedn dsfedn dtfedn dufedn dvfedn dwfedn dxfedn dyfedn dzfedn d{fedn d|fedn d}fedn d~fedn dfedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fedn d�fed� d fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�fed� d�ff��Ze�d3�d4�d5�d6�d7�d8�d9�d:�d;�d<�d=�d>�d?�d@�dA�dB�dC�dD�dE�dF�dG�dH�dI�dJ�dK�dL�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d`�da�db�dc�dd�de�df�dg�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dr�ds�dt�du�dv�dw�dx�dy�dz�d{�d|�d}�d~�d�d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d��d�e�d1 d�f�d��d��d��ddÐdĐdŐdƐdǐdȐdɐdʐdːd̐d͐dΐdϐdАdѐdҐdӐdԐdՐddאdؐdِdڐdېdܐdݐdސdߐd�d�d�d�d�d�d�e�dO d�fe�dO �dPfe�dO �d%f�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d��d��d��d��d��d��d��d��d��d��d��d �d�d�d�d�d�d�d�d�d �d
�d �d �d
�d�d�d�d�d�d�d�d�d�d�d�d�d�d�d �d �d �d �d �d!�d"�d#�d$�d%�d&�d'�d(�d)�d*�d+�d,�d-�d.�d/�d0�d1�d2�d3�d4�d5�d6�d7�d8�d9�d:�d;�d<�d=�d>�d?�d@�dA�dB�dC�dD�dE�dF�dG�dH�dI�dJ�dK�dL�dM�dN�dO�dP�dQ�dR�dS�dT�dU�dV�dW�dX�dY�dZ�d[�d\�d]�d^�d_�d`�da�db�dce�dO �d�fe�dO �d�fe�dO d�fe�dO �d�fe�dO �dPfe�dO d�fe�dO �d%fe�d1 �d�fe�d1 d�fe�d1 �d�f�dd�de�df�dg�fC�Ze�dh�di�dj�dk�dl�dm�dn�do�dp�dq�dre�dO d�fe�d1 �d�ff
�Ze�d~�Ze�d��Ze�d��Ze�d��Ze�d��Ze�d��Ze�d��Zej �d1ej �Z G �d2d � d e j �Z dS (� � )�absolute_import�division�unicode_literalsN)�escape�unescape)� urllib_parse� )�base� )�
namespaces�prefixes�Filter�html�a�abbrZacronymZaddressZareaZarticleZasideZaudio�bZbigZ
blockquote�brZbuttonZcanvasZcaption�center�cite�code�colZcolgroupZcommandZdatagridZdatalistZdd�delZdetailsZdfnZdialog�dirZdivZdlZdtZemz event-sourceZfieldsetZ
figcaptionZfigureZfooter�font�form�headerZh1Zh2Zh3Zh4Zh5Zh6Zhr�iZimg�inputZinsZkeygenZkbd�labelZlegendZli�m�mapZmenuZmeterZmulticolZnavZnextidZol�outputZoptgroupZoption�pZpreZprogress�q�sZsampZsectionZselectZsmallZsound�sourceZspacer�spanZstrikeZstrong�subZsup�tableZtbodyZtdZtextareaZtimeZtfootZthZtheadZtrZtt�uZul�varZvideoZmathmlZmactionZmathZmerrorZmfracZmiZ
mmultiscriptsZmn�moZmoverZmpaddedZmphantomZ mprescriptsZmrootZmrowZmspaceZmsqrtZmstyleZmsubZmsubsupZmsupZmtableZmtdZmtextZmtrZmunderZ
munderover�noneZsvg�animate� animateColor�
animateMotion�animateTransformZclipPathZcircleZdefsZdescZellipsez font-facezfont-face-namez
font-face-src�gZglyphZhkern�linearGradient�line�markerZmetadataz
missing-glyphZmpath�pathZpolygonZpolyline�radialGradientZrect�set�stopZswitch�text�titleZtspan�use�accept�accept-charset� accesskey�action�align�alt� autocomplete� autofocus�axis�
background�balance�bgcolor� bgproperties�border� bordercolor�bordercolordark�bordercolorlight�
bottompadding� cellpadding� cellspacing�ch� challenge�char�charoff�choff�charset�checked�class�clear�color�cols�colspan�compact�contenteditable�controls�coords�data�datafld� datapagesize�datasrc�datetime�default�delay�disabled� draggable�dynsrc�enctype�end�face�for�frame�
galleryimg�gutter�headers�height� hidefocus�hidden�high�href�hreflang�hspace�icon�id� inputmode�ismap�keytype� leftspacing�lang�list�longdesc�loop� loopcount�loopend� loopstart�low�lowsrc�max� maxlength�media�method�min�multiple�name�nohref�noshade�nowrap�open�optimum�pattern�ping�
point-size�poster�pqg�preload�prompt�
radiogroup�readonly�rel�
repeat-max�
repeat-min�replace�required�rev� rightspacing�rows�rowspan�rules�scope�selected�shape�size�src�start�step�style�summary�suppress�tabindex�target�template�
toppadding�type� unselectable�usemap�urn�valign�value�variable�volume�vspace�vrml�width�wrapZxml�
actiontype� columnalign� columnlines�
columnspacing�
columnspan�depth�display� displaystyle� equalcolumns� equalrows�fence� fontstyle�
fontweight�
linethickness�lspace�mathbackground� mathcolor� mathvariant�maxsize�minsize�other�rowalign�rowlines�
rowspacing�rspace� scriptlevel� selection� separator�stretchy�xlinkZshow�
accent-height�
accumulate�additive�
alphabetic� arabic-form�ascent�
attributeName�
attributeType� baseProfile�bbox�begin�by�calcMode�
cap-height� clip-path�color-rendering�content�cx�cy�d�dx�dy�descent�dur�fill� fill-opacity� fill-rule� font-family� font-size� font-stretch�
font-style� font-variant� font-weight�from�fx�fy�g1�g2�
glyph-name�
gradientUnits�hanging� horiz-adv-x�horiz-origin-x� ideographic�k� keyPoints�
keySplines�keyTimes�
marker-end�
marker-mid� marker-start� markerHeight� markerUnits� markerWidth� mathematical�offset�opacity�orient�origin�overline-position�overline-thickness�panose-1�
pathLength�points�preserveAspectRatio�r�refX�refY� repeatCount� repeatDur�requiredExtensions�requiredFeatures�restart�rotate�rx�ry�slope�stemh�stemv�
stop-color� stop-opacity�strikethrough-position�strikethrough-thickness�stroke�stroke-dasharray�stroke-dashoffset�stroke-linecap�stroke-linejoin�stroke-miterlimit�stroke-opacity� stroke-width�systemLanguage� text-anchor�to� transform�u1�u2�underline-position�underline-thickness�unicode�
unicode-range� units-per-em�values�version�viewBox�
visibility�widths�x�x-height�x1�x2ZactuateZarcroleZroler Zspace�y�y1�y2�
zoomAndPan�
color-profile�cursor�filter�mask�altGlyph�feImage�textpath�tref�azimuth�background-color�border-bottom-color�border-collapse� border-color�border-left-color�border-right-color�border-top-color� direction� elevation�float�letter-spacing� line-height�overflow�pause� pause-after� pause-before�pitch� pitch-range�richness�speak� speak-header�
speak-numeral�speak-punctuation� speech-rate�stress�
text-align�text-decoration� text-indent� unicode-bidi�vertical-align� voice-family� white-space�auto�aqua�black�block�blue�bold�both�bottom�brown�collapse�dashed�dotted�fuchsia�gray�green�
!important�italic�left�lime�maroon�medium�navy�normal�olive�pointer�purple�red�right�solid�silver�teal�top� transparent� underline�white�yellow�ed2k�ftp�http�https�irc�mailto�news�gopher�nntp�telnet�webcal�xmpp�callto�feed�aim�rsync�tag�ssh�sftp�rtsp�afs� image/png�
image/jpeg� image/gif�
image/webp� image/bmp�
text/plainaL
^
# Match a content type <application>/<type>
(?P<content_type>[-a-zA-Z0-9.]+/[-a-zA-Z0-9.]+)
# Match any character set and encoding
(?:(?:;charset=(?:[-a-zA-Z0-9]+)(?:;(?:base64))?)
|(?:;(?:base64))?(?:;charset=(?:[-a-zA-Z0-9]+))?)
# Assume the rest is data
,.*
$
c
s^ e Zd ZdZeeeeee e
e e e
f
� fdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z� ZS )r
zA sanitization of XHTML+MathML+SVG and of inline style attributes.c sP t t| �j|� || _|| _|| _|| _|| _|| _|| _ | | _
|
| _ | | _ d S )N)
�superr
�__init__�allowed_elements�allowed_attributes�allowed_css_properties�allowed_css_keywords�allowed_svg_properties�allowed_protocols�allowed_content_types�attr_val_is_uri�svg_attr_val_allows_ref�svg_allow_local_href) �selfr% r� r� r� r� r� r� r� r� r� r� )� __class__� � /usr/lib/python3.6/sanitizer.pyr� � s zFilter.__init__c c s. x(t jj| �D ]}| j|�}|r|V qW d S )N)r r
�__iter__�sanitize_token)r� �tokenr� r� r� r� � s
zFilter.__iter__c C sp |d }|d kr^|d }|d }||f| j ksH|d krRtd |f| j krR| j|�S | j|�S n|dkrhn|S d S )
Nr� �StartTag�EndTag�EmptyTagr� � namespacer �Comment)r� r� r� )r� r �
allowed_token�disallowed_token)r� r� �
token_typer� r� r� r� r� r� � s
zFilter.sanitize_tokenc C s� d|k�r�|d }t |j� �}x&|| j D ]}|d |= |j|� q*W x�|| j@ D ]�}||ksbt�tjddt|| ��j � }|j
dd�}yt j |�}W n t k
r� d }||= Y nX |o�|j
rR|j
| jkr�||= |j
dkrRtj|j�}|s�||= qR|jd�| jkrR||= qRW x4| jD ]*}||k�rtjddt|| ��||< �qW |d | jk�r�td d
f|k�r�tjd |td d
f ��r�|td d
f= d
|k�r�| j|d �|d< ||d< |S )Nr` u
[` - - \s]+� u �Z content_typezurl\s*\(\s*[^#\s][^)]+?\)� r� r� rv z ^\s*[^#\s].*r� )Nr� )Nr� )Nr� )r7 �keysr� �remover� �AssertionError�rer' r �lowerr� �urlparse�
ValueError�schemer� �data_content_type�matchr5 �groupr� r� r� r �search� sanitize_css) r� r� �attrsZ
attr_namesZ to_remove�attrZ
val_unescapedZurir r� r� r� r� sL
zFilter.allowed_tokenc C s� |d }|dkr"d|d |d< n�|d r�|dks6t �g }xJ|d j� D ]:\\}}}|jd|d krf|nd t| |f t|�f � qHW d
|d d j|�f |d< nd |d |d< |jd
�r�|d d d� d |d< d|d< |d= |S )Nr� r� z</%s>r� r` r� r� z %s="%s"z%s:%sz<%s%s>r� z<%s>Z selfClosingr z/>Z
Characters)r� r� ���)r� �items�appendr r �join�get)r� r� r� r� �nsr� �vr� r� r� r� 2 s 2
zFilter.disallowed_tokenc C s t jd�jd|�}t jd|�s"dS t jd|�s2dS g }x�t jd|�D ]�\}}|sRqD|j� | jkrx|j|d | d � qD|jd �d
j� dkr�xf|j� D ] }|| j kr�t jd|� r�P q�W |j|d | d � qD|j� | j
krD|j|d | d � qDW dj |�S )Nzurl\s*\(\s*[^\s)]+?\s*\)\s*r� z@^([:,;#%.\sa-zA-Z0-9!]|\w-\w|'[\s\w]+'|"[\s\w]+"|\([\d,\s]+\))*$r� z ^\s*([-\w]+\s*:[^:;]*(;\s*|$))*$z([-\w]+)\s*:\s*([^:;]*)z: �;�-r rE rI �margin�paddingz\^(#[0-9a-f]+|rgb\(\d+%?,\d*%?,?\d*%?\)?|\d{0,2}\.?\d{0,2}(cm|em|ex|in|mm|pc|pt|px|%|,|\))?)$)rE rI r� r� ) r� �compiler' r� �findallr� r� r� �splitr� r� r� )r� r� ZcleanZpropr� �keywordr� r� r� r� F s*
zFilter.sanitize_css)�__name__�
__module__� __qualname__�__doc__r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__r� r� )r� r� r
� s
2)Nr )Nr< )Nr= )Nr> )Nr? )Nr@ )NrA )NrB )NrC )NrD )NrE )NrF )NrG )NrH )NrI )NrJ )NrK )NrL )NrM )NrN )NrO )NrP )NrQ )NrR )NrS )NrT )NrU )NrV )Nr )NrW )NrX )NrY )NrZ )Nr[ )Nr\ )Nr] )Nr^ )Nr_ )Nr` )Nra )Nrb )Nrc )Nrd )Nre )Nrf )Nr )Nrg )Nrh )Nri )Nrj )Nrk )Nrl )Nrm )Nr )Nrn )Nro )Nrp )Nrq )Nrr )Nrs )Nrt )Nru )Nrv )Nrw )Nrx )Nry )Nrz )Nr{ )Nr| )Nr} )Nr )Nr~ )Nr )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr& )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr: )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr@ )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nrn )Nrr )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )NrW )Nr� )NrY )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nrk )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr� )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nrr )Nr )Nr )Nrz )Nr
)Nr )Nr )Nr
)Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr� )Nr� )Nr� )Nr )Nr )Nr )Nr )Nr )Nr )Nr )Nr5 )Nr )Nr )Nr )Nr )Nr! )Nr" )Nr# )Nr$ )Nr% )Nr& )Nr' )Nr( )Nr) )Nr* )Nr+ )Nr, )Nr- )Nr. )Nr/ )Nr0 )Nr1 )Nr2 )Nr3 )Nr4 )Nr5 )Nr6 )Nr7 )Nr8 )Nr9 )Nr: )Nr� )Nr; )Nr< )Nr= )Nr� )Nr> )Nr? )Nr@ )NrA )NrB )NrC )NrD )NrE )NrF )NrG )NrH )Nr� )NrI )NrJ )NrK )NrL )NrM )NrN )NrO )NrP )NrQ )Nrv )Nr� )Nr )Nr? )Nr� )Nr� )NrE )Nrc )Nri )Nr� )Nr� �Nr� �NrR �NrS �Nr� �NrT �Nr4 �Nr �Nr �Nr �NrU �Nr2 ) r� r� r� r� r� r� r r r r r �NrV �Nr- �Nr. �Nr/ �Nr0 �NrS �NrW �NrT �Nr2 �Nr� �Nr6 �NrX �NrY �Nr7 �Nr; )r r r r r r
r r r
r r r r r r ).rZ r[ r\ r] r^ r_ r` ra rX rY rS rb r� rc rd r r� r� r� r� r� rr re rf rg rh ri rj rk rl rm rn ro rp rq rr rs rt ru rv rw rx ry r� rz r� )'r{ r| r} r~ r r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r, r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� )r� r� r� r2 r9 r5 r6 r8 )r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r` )r� r� r� r� r� r� ) Z
__future__r r r r� Zxml.sax.saxutilsr r Zpip._vendor.six.movesr r� r� r Z constantsr r �__all__� frozensetr� r� r� r� r� r� r� r� r� r� r� �VERBOSEr� r
r� r� r� r� �<module> s2
pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.pyc 0000644 00000004355 14751155150 0017777 0 ustar 00 3
���e%
� @ sh d dl mZmZmZ d dlmZ ddlmZ ddlm Z m
Z
ddlm Z dj e �Z G d d
� d
ej
�Z
d S ) � )�absolute_import�division�unicode_literals)� text_type� )�base� )�
namespaces� voidElements)�spaceCharacters� c s& e Zd Zd� fdd� Zdd� Z� ZS )�FilterTc s t t| �j|� || _d S )N)�superr
�__init__�require_matching_tags)�self�sourcer )� __class__� �/usr/lib/python3.6/lint.pyr
s zFilter.__init__c c sR g }�xFt jj| �D �]4}|d }|dk�rP|d }|d }|d ksRt|t�sRt�|dks^t�t|t�slt�|dksxt�t|d t�s�t�| s�|td kr�|tkr�|dks�t�n |dks�t�|dkr�| j r�|j
||f� xp|d j � D ]`\\}}}|d k�st|t��st�|dk�s t�t|t��s,t�|dk�s:t�t|t�s�t�q�W �n�|d k�r|d }|d }|d k�s�t|t��s�t�|dk�s�t�t|t��s�t�|dk�s�t�| �s�|td k�r�|tk�r�d
�s
td d |i ��n"| j �rD|j � }|||fk�sDt��n6|d
k�r4|d }t|t��sDt��n|dk�r�|d }t|t��sVt�|dk�sdt�|dk�rD|j
t�dk�sDt�n�|dk�r�|d }|d k�s�t|t��s�t�|d d k�s�t|t��s�t�|d d k�sDt|t��sDt�nV|dk�rt|d t��sDt�n6|dk�r.t|d t��sDt�nd
�sDtdd|i ��|V qW d S )N�type�StartTag�EmptyTag� namespace�namer �dataZhtmlZEndTagFz.Void element reported as EndTag token: %(tag)s�tag�Comment�
Characters�SpaceCharactersZDoctypeZpublicIdZsystemIdZEntityZSerializerErrorz Unknown token type: %(type)s)r r )r r )r r
�__iter__�
isinstancer �AssertionError�dictr r
r �append�items�pop�stripr ) r Z
open_elements�tokenr r r �value�startr r r r r sl
zFilter.__iter__)T)�__name__�
__module__� __qualname__r r �
__classcell__r r )r r r
s r
N)Z
__future__r r r Zpip._vendor.sixr r r Z constantsr r
r �joinr
r r r r �<module> s
pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.opt-1.pyc 0000644 00000003025 14751155150 0020727 0 ustar 00 3
���e%
� @ sh d dl mZmZmZ d dlmZ ddlmZ ddlm Z m
Z
ddlm Z dj e �Z G d d
� d
ej
�Z
d S ) � )�absolute_import�division�unicode_literals)� text_type� )�base� )�
namespaces� voidElements)�spaceCharacters� c s& e Zd Zd� fdd� Zdd� Z� ZS )�FilterTc s t t| �j|� || _d S )N)�superr
�__init__�require_matching_tags)�self�sourcer )� __class__� �/usr/lib/python3.6/lint.pyr
s zFilter.__init__c c s@ g }�x4t jj| �D �]"}|d }|dkr�|d }|d }| sL|td krV|tkrVn |dkrr| jrr|j||f� x�|d j� D ] \\}}}q�W n�|dkr�|d }|d }| s�|td kr�|tkr�n| jr�|j� }n\|d kr�|d }nJ|dk�r|d }|d k�r2n,|d k�r|d }n|d
k�r&n |dk�r2n |V qW d S )N�type�StartTag�EmptyTag� namespace�nameZhtml�dataZEndTag�Comment�
Characters�SpaceCharactersZDoctypeZEntityZSerializerError)r r )r r ) r r
�__iter__r r
r �append�items�pop) r Z
open_elements�tokenr r r �value�startr r r r r sF
zFilter.__iter__)T)�__name__�
__module__� __qualname__r r �
__classcell__r r )r r r
s r
N)Z
__future__r r r Zpip._vendor.sixr r r Z constantsr r
r �joinr
r r r r �<module> s
pip/_vendor/html5lib/filters/optionaltags.py 0000644 00000024446 14751155150 0015254 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from . import base
class Filter(base.Filter):
def slider(self):
previous1 = previous2 = None
for token in self.source:
if previous1 is not None:
yield previous2, previous1, token
previous2 = previous1
previous1 = token
if previous1 is not None:
yield previous2, previous1, None
def __iter__(self):
for previous, token, next in self.slider():
type = token["type"]
if type == "StartTag":
if (token["data"] or
not self.is_optional_start(token["name"], previous, next)):
yield token
elif type == "EndTag":
if not self.is_optional_end(token["name"], next):
yield token
else:
yield token
def is_optional_start(self, tagname, previous, next):
type = next and next["type"] or None
if tagname in 'html':
# An html element's start tag may be omitted if the first thing
# inside the html element is not a space character or a comment.
return type not in ("Comment", "SpaceCharacters")
elif tagname == 'head':
# A head element's start tag may be omitted if the first thing
# inside the head element is an element.
# XXX: we also omit the start tag if the head element is empty
if type in ("StartTag", "EmptyTag"):
return True
elif type == "EndTag":
return next["name"] == "head"
elif tagname == 'body':
# A body element's start tag may be omitted if the first thing
# inside the body element is not a space character or a comment,
# except if the first thing inside the body element is a script
# or style element and the node immediately preceding the body
# element is a head element whose end tag has been omitted.
if type in ("Comment", "SpaceCharacters"):
return False
elif type == "StartTag":
# XXX: we do not look at the preceding event, so we never omit
# the body element's start tag if it's followed by a script or
# a style element.
return next["name"] not in ('script', 'style')
else:
return True
elif tagname == 'colgroup':
# A colgroup element's start tag may be omitted if the first thing
# inside the colgroup element is a col element, and if the element
# is not immediately preceded by another colgroup element whose
# end tag has been omitted.
if type in ("StartTag", "EmptyTag"):
# XXX: we do not look at the preceding event, so instead we never
# omit the colgroup element's end tag when it is immediately
# followed by another colgroup element. See is_optional_end.
return next["name"] == "col"
else:
return False
elif tagname == 'tbody':
# A tbody element's start tag may be omitted if the first thing
# inside the tbody element is a tr element, and if the element is
# not immediately preceded by a tbody, thead, or tfoot element
# whose end tag has been omitted.
if type == "StartTag":
# omit the thead and tfoot elements' end tag when they are
# immediately followed by a tbody element. See is_optional_end.
if previous and previous['type'] == 'EndTag' and \
previous['name'] in ('tbody', 'thead', 'tfoot'):
return False
return next["name"] == 'tr'
else:
return False
return False
def is_optional_end(self, tagname, next):
type = next and next["type"] or None
if tagname in ('html', 'head', 'body'):
# An html element's end tag may be omitted if the html element
# is not immediately followed by a space character or a comment.
return type not in ("Comment", "SpaceCharacters")
elif tagname in ('li', 'optgroup', 'tr'):
# A li element's end tag may be omitted if the li element is
# immediately followed by another li element or if there is
# no more content in the parent element.
# An optgroup element's end tag may be omitted if the optgroup
# element is immediately followed by another optgroup element,
# or if there is no more content in the parent element.
# A tr element's end tag may be omitted if the tr element is
# immediately followed by another tr element, or if there is
# no more content in the parent element.
if type == "StartTag":
return next["name"] == tagname
else:
return type == "EndTag" or type is None
elif tagname in ('dt', 'dd'):
# A dt element's end tag may be omitted if the dt element is
# immediately followed by another dt element or a dd element.
# A dd element's end tag may be omitted if the dd element is
# immediately followed by another dd element or a dt element,
# or if there is no more content in the parent element.
if type == "StartTag":
return next["name"] in ('dt', 'dd')
elif tagname == 'dd':
return type == "EndTag" or type is None
else:
return False
elif tagname == 'p':
# A p element's end tag may be omitted if the p element is
# immediately followed by an address, article, aside,
# blockquote, datagrid, dialog, dir, div, dl, fieldset,
# footer, form, h1, h2, h3, h4, h5, h6, header, hr, menu,
# nav, ol, p, pre, section, table, or ul, element, or if
# there is no more content in the parent element.
if type in ("StartTag", "EmptyTag"):
return next["name"] in ('address', 'article', 'aside',
'blockquote', 'datagrid', 'dialog',
'dir', 'div', 'dl', 'fieldset', 'footer',
'form', 'h1', 'h2', 'h3', 'h4', 'h5', 'h6',
'header', 'hr', 'menu', 'nav', 'ol',
'p', 'pre', 'section', 'table', 'ul')
else:
return type == "EndTag" or type is None
elif tagname == 'option':
# An option element's end tag may be omitted if the option
# element is immediately followed by another option element,
# or if it is immediately followed by an <code>optgroup</code>
# element, or if there is no more content in the parent
# element.
if type == "StartTag":
return next["name"] in ('option', 'optgroup')
else:
return type == "EndTag" or type is None
elif tagname in ('rt', 'rp'):
# An rt element's end tag may be omitted if the rt element is
# immediately followed by an rt or rp element, or if there is
# no more content in the parent element.
# An rp element's end tag may be omitted if the rp element is
# immediately followed by an rt or rp element, or if there is
# no more content in the parent element.
if type == "StartTag":
return next["name"] in ('rt', 'rp')
else:
return type == "EndTag" or type is None
elif tagname == 'colgroup':
# A colgroup element's end tag may be omitted if the colgroup
# element is not immediately followed by a space character or
# a comment.
if type in ("Comment", "SpaceCharacters"):
return False
elif type == "StartTag":
# XXX: we also look for an immediately following colgroup
# element. See is_optional_start.
return next["name"] != 'colgroup'
else:
return True
elif tagname in ('thead', 'tbody'):
# A thead element's end tag may be omitted if the thead element
# is immediately followed by a tbody or tfoot element.
# A tbody element's end tag may be omitted if the tbody element
# is immediately followed by a tbody or tfoot element, or if
# there is no more content in the parent element.
# A tfoot element's end tag may be omitted if the tfoot element
# is immediately followed by a tbody element, or if there is no
# more content in the parent element.
# XXX: we never omit the end tag when the following element is
# a tbody. See is_optional_start.
if type == "StartTag":
return next["name"] in ['tbody', 'tfoot']
elif tagname == 'tbody':
return type == "EndTag" or type is None
else:
return False
elif tagname == 'tfoot':
# A tfoot element's end tag may be omitted if the tfoot element
# is immediately followed by a tbody element, or if there is no
# more content in the parent element.
# XXX: we never omit the end tag when the following element is
# a tbody. See is_optional_start.
if type == "StartTag":
return next["name"] == 'tbody'
else:
return type == "EndTag" or type is None
elif tagname in ('td', 'th'):
# A td element's end tag may be omitted if the td element is
# immediately followed by a td or th element, or if there is
# no more content in the parent element.
# A th element's end tag may be omitted if the th element is
# immediately followed by a td or th element, or if there is
# no more content in the parent element.
if type == "StartTag":
return next["name"] in ('td', 'th')
else:
return type == "EndTag" or type is None
return False
pip/_vendor/html5lib/filters/base.py 0000644 00000000436 14751155150 0013453 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
class Filter(object):
def __init__(self, source):
self.source = source
def __iter__(self):
return iter(self.source)
def __getattr__(self, name):
return getattr(self.source, name)
pip/_vendor/html5lib/filters/alphabeticalattributes.py 0000644 00000001155 14751155150 0017260 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from . import base
try:
from collections import OrderedDict
except ImportError:
from ordereddict import OrderedDict
class Filter(base.Filter):
def __iter__(self):
for token in base.Filter.__iter__(self):
if token["type"] in ("StartTag", "EmptyTag"):
attrs = OrderedDict()
for name, value in sorted(token["data"].items(),
key=lambda x: x[0]):
attrs[name] = value
token["data"] = attrs
yield token
pip/_vendor/html5lib/filters/inject_meta_charset.py 0000644 00000005266 14751155150 0016542 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from . import base
class Filter(base.Filter):
def __init__(self, source, encoding):
base.Filter.__init__(self, source)
self.encoding = encoding
def __iter__(self):
state = "pre_head"
meta_found = (self.encoding is None)
pending = []
for token in base.Filter.__iter__(self):
type = token["type"]
if type == "StartTag":
if token["name"].lower() == "head":
state = "in_head"
elif type == "EmptyTag":
if token["name"].lower() == "meta":
# replace charset with actual encoding
has_http_equiv_content_type = False
for (namespace, name), value in token["data"].items():
if namespace is not None:
continue
elif name.lower() == 'charset':
token["data"][(namespace, name)] = self.encoding
meta_found = True
break
elif name == 'http-equiv' and value.lower() == 'content-type':
has_http_equiv_content_type = True
else:
if has_http_equiv_content_type and (None, "content") in token["data"]:
token["data"][(None, "content")] = 'text/html; charset=%s' % self.encoding
meta_found = True
elif token["name"].lower() == "head" and not meta_found:
# insert meta into empty head
yield {"type": "StartTag", "name": "head",
"data": token["data"]}
yield {"type": "EmptyTag", "name": "meta",
"data": {(None, "charset"): self.encoding}}
yield {"type": "EndTag", "name": "head"}
meta_found = True
continue
elif type == "EndTag":
if token["name"].lower() == "head" and pending:
# insert meta into head (if necessary) and flush pending queue
yield pending.pop(0)
if not meta_found:
yield {"type": "EmptyTag", "name": "meta",
"data": {(None, "charset"): self.encoding}}
while pending:
yield pending.pop(0)
meta_found = True
state = "post_head"
if state == "in_head":
pending.append(token)
else:
yield token
pip/_vendor/html5lib/filters/__init__.py 0000644 00000000000 14751155150 0014263 0 ustar 00 pip/_vendor/html5lib/filters/lint.py 0000644 00000006445 14751155150 0013515 0 ustar 00 from __future__ import absolute_import, division, unicode_literals
from pip._vendor.six import text_type
from . import base
from ..constants import namespaces, voidElements
from ..constants import spaceCharacters
spaceCharacters = "".join(spaceCharacters)
class Filter(base.Filter):
def __init__(self, source, require_matching_tags=True):
super(Filter, self).__init__(source)
self.require_matching_tags = require_matching_tags
def __iter__(self):
open_elements = []
for token in base.Filter.__iter__(self):
type = token["type"]
if type in ("StartTag", "EmptyTag"):
namespace = token["namespace"]
name = token["name"]
assert namespace is None or isinstance(namespace, text_type)
assert namespace != ""
assert isinstance(name, text_type)
assert name != ""
assert isinstance(token["data"], dict)
if (not namespace or namespace == namespaces["html"]) and name in voidElements:
assert type == "EmptyTag"
else:
assert type == "StartTag"
if type == "StartTag" and self.require_matching_tags:
open_elements.append((namespace, name))
for (namespace, name), value in token["data"].items():
assert namespace is None or isinstance(namespace, text_type)
assert namespace != ""
assert isinstance(name, text_type)
assert name != ""
assert isinstance(value, text_type)
elif type == "EndTag":
namespace = token["namespace"]
name = token["name"]
assert namespace is None or isinstance(namespace, text_type)
assert namespace != ""
assert isinstance(name, text_type)
assert name != ""
if (not namespace or namespace == namespaces["html"]) and name in voidElements:
assert False, "Void element reported as EndTag token: %(tag)s" % {"tag": name}
elif self.require_matching_tags:
start = open_elements.pop()
assert start == (namespace, name)
elif type == "Comment":
data = token["data"]
assert isinstance(data, text_type)
elif type in ("Characters", "SpaceCharacters"):
data = token["data"]
assert isinstance(data, text_type)
assert data != ""
if type == "SpaceCharacters":
assert data.strip(spaceCharacters) == ""
elif type == "Doctype":
name = token["name"]
assert name is None or isinstance(name, text_type)
assert token["publicId"] is None or isinstance(name, text_type)
assert token["systemId"] is None or isinstance(name, text_type)
elif type == "Entity":
assert isinstance(token["name"], text_type)
elif type == "SerializerError":
assert isinstance(token["data"], text_type)
else:
assert False, "Unknown token type: %(type)s" % {"type": type}
yield token
pip/_vendor/progress/__init__.py 0000644 00000005717 14751155150 0012763 0 ustar 00 # Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
from __future__ import division
from collections import deque
from datetime import timedelta
from math import ceil
from sys import stderr
from time import time
__version__ = '1.2'
class Infinite(object):
file = stderr
sma_window = 10
def __init__(self, *args, **kwargs):
self.index = 0
self.start_ts = time()
self._ts = self.start_ts
self._dt = deque(maxlen=self.sma_window)
for key, val in kwargs.items():
setattr(self, key, val)
def __getitem__(self, key):
if key.startswith('_'):
return None
return getattr(self, key, None)
@property
def avg(self):
return sum(self._dt) / len(self._dt) if self._dt else 0
@property
def elapsed(self):
return int(time() - self.start_ts)
@property
def elapsed_td(self):
return timedelta(seconds=self.elapsed)
def update(self):
pass
def start(self):
pass
def finish(self):
pass
def next(self, n=1):
if n > 0:
now = time()
dt = (now - self._ts) / n
self._dt.append(dt)
self._ts = now
self.index = self.index + n
self.update()
def iter(self, it):
for x in it:
yield x
self.next()
self.finish()
class Progress(Infinite):
def __init__(self, *args, **kwargs):
super(Progress, self).__init__(*args, **kwargs)
self.max = kwargs.get('max', 100)
@property
def eta(self):
return int(ceil(self.avg * self.remaining))
@property
def eta_td(self):
return timedelta(seconds=self.eta)
@property
def percent(self):
return self.progress * 100
@property
def progress(self):
return min(1, self.index / self.max)
@property
def remaining(self):
return max(self.max - self.index, 0)
def start(self):
self.update()
def goto(self, index):
incr = index - self.index
self.next(incr)
def iter(self, it):
try:
self.max = len(it)
except TypeError:
pass
for x in it:
yield x
self.next()
self.finish()
pip/_vendor/progress/bar.py 0000644 00000005175 14751155150 0011766 0 ustar 00 # -*- coding: utf-8 -*-
# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
from . import Progress
from .helpers import WritelnMixin
class Bar(WritelnMixin, Progress):
width = 32
message = ''
suffix = '%(index)d/%(max)d'
bar_prefix = ' |'
bar_suffix = '| '
empty_fill = ' '
fill = '#'
hide_cursor = True
def update(self):
filled_length = int(self.width * self.progress)
empty_length = self.width - filled_length
message = self.message % self
bar = self.fill * filled_length
empty = self.empty_fill * empty_length
suffix = self.suffix % self
line = ''.join([message, self.bar_prefix, bar, empty, self.bar_suffix,
suffix])
self.writeln(line)
class ChargingBar(Bar):
suffix = '%(percent)d%%'
bar_prefix = ' '
bar_suffix = ' '
empty_fill = u'∙'
fill = u'█'
class FillingSquaresBar(ChargingBar):
empty_fill = u'▢'
fill = u'▣'
class FillingCirclesBar(ChargingBar):
empty_fill = u'◯'
fill = u'◉'
class IncrementalBar(Bar):
phases = (u' ', u'▏', u'▎', u'▍', u'▌', u'▋', u'▊', u'▉', u'█')
def update(self):
nphases = len(self.phases)
expanded_length = int(nphases * self.width * self.progress)
filled_length = int(self.width * self.progress)
empty_length = self.width - filled_length
phase = expanded_length - (filled_length * nphases)
message = self.message % self
bar = self.phases[-1] * filled_length
current = self.phases[phase] if phase > 0 else ''
empty = self.empty_fill * max(0, empty_length - len(current))
suffix = self.suffix % self
line = ''.join([message, self.bar_prefix, bar, current, empty,
self.bar_suffix, suffix])
self.writeln(line)
class ShadyBar(IncrementalBar):
phases = (u' ', u'░', u'▒', u'▓', u'█')
pip/_vendor/progress/helpers.py 0000644 00000005446 14751155150 0012665 0 ustar 00 # Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
from __future__ import print_function
HIDE_CURSOR = '\x1b[?25l'
SHOW_CURSOR = '\x1b[?25h'
class WriteMixin(object):
hide_cursor = False
def __init__(self, message=None, **kwargs):
super(WriteMixin, self).__init__(**kwargs)
self._width = 0
if message:
self.message = message
if self.file.isatty():
if self.hide_cursor:
print(HIDE_CURSOR, end='', file=self.file)
print(self.message, end='', file=self.file)
self.file.flush()
def write(self, s):
if self.file.isatty():
b = '\b' * self._width
c = s.ljust(self._width)
print(b + c, end='', file=self.file)
self._width = max(self._width, len(s))
self.file.flush()
def finish(self):
if self.file.isatty() and self.hide_cursor:
print(SHOW_CURSOR, end='', file=self.file)
class WritelnMixin(object):
hide_cursor = False
def __init__(self, message=None, **kwargs):
super(WritelnMixin, self).__init__(**kwargs)
if message:
self.message = message
if self.file.isatty() and self.hide_cursor:
print(HIDE_CURSOR, end='', file=self.file)
def clearln(self):
if self.file.isatty():
print('\r\x1b[K', end='', file=self.file)
def writeln(self, line):
if self.file.isatty():
self.clearln()
print(line, end='', file=self.file)
self.file.flush()
def finish(self):
if self.file.isatty():
print(file=self.file)
if self.hide_cursor:
print(SHOW_CURSOR, end='', file=self.file)
from signal import signal, SIGINT
from sys import exit
class SigIntMixin(object):
"""Registers a signal handler that calls finish on SIGINT"""
def __init__(self, *args, **kwargs):
super(SigIntMixin, self).__init__(*args, **kwargs)
signal(SIGINT, self._sigint_handler)
def _sigint_handler(self, signum, frame):
self.finish()
exit(0)
pip/_vendor/progress/__pycache__/helpers.cpython-36.pyc 0000644 00000005517 14751155150 0017150 0 ustar 00 3
���e& � @ sd d dl mZ dZdZG dd� de�ZG dd� de�Zd dlmZmZ d d l m
Z
G d
d � d e�Z d S )
� )�print_functionz[?25lz[?25hc s2 e Zd ZdZd � fdd� Zdd� Zdd� Z� ZS )
�
WriteMixinFNc sb t t| �jf |� d| _|r"|| _| jj� r^| jrBtt d| jd� t| jd| jd� | jj
� d S )Nr � )�end�file) �superr �__init__�_width�messager �isatty� hide_cursor�print� HIDE_CURSOR�flush)�selfr
�kwargs)� __class__� � /usr/lib/python3.6/helpers.pyr s
zWriteMixin.__init__c C sT | j j� rPd| j }|j| j�}t|| d| j d� t| jt|��| _| j j� d S )N�r )r r )r r r �ljustr
�max�lenr )r �s�b�cr r r �write% s
zWriteMixin.writec C s$ | j j� r | jr ttd| j d� d S )Nr )r r )r r r r
� SHOW_CURSOR)r r r r �finish- s zWriteMixin.finish)N)�__name__�
__module__� __qualname__r r r r �
__classcell__r r )r r r s r c s: e Zd ZdZd � fdd� Zdd� Zdd� Zd d
� Z� ZS ) � WritelnMixinFNc s@ t t| �jf |� |r || _| jj� r<| jr<ttd| jd� d S )Nr )r r ) r r# r r
r r r r
r )r r
r )r r r r 5 s
zWritelnMixin.__init__c C s | j j� rtdd| j d� d S )Nz
[Kr )r r )r r r
)r r r r �clearln= s
zWritelnMixin.clearlnc C s0 | j j� r,| j� t|d| j d� | j j� d S )Nr )r r )r r r$ r
r )r �liner r r �writelnA s
zWritelnMixin.writelnc C s0 | j j� r,t| j d� | jr,ttd| j d� d S )N)r r )r r )r r r
r r )r r r r r G s
zWritelnMixin.finish)N) r r r! r r r$ r& r r" r r )r r r# 2 s
r# )�signal�SIGINT)�exitc s( e Zd ZdZ� fdd�Zdd� Z� ZS )� SigIntMixinz6Registers a signal handler that calls finish on SIGINTc s" t t| �j||� tt| j� d S )N)r r* r r' r( �_sigint_handler)r �argsr )r r r r U s zSigIntMixin.__init__c C s | j � td� d S )Nr )r r) )r Zsignum�framer r r r+ Y s zSigIntMixin._sigint_handler)r r r! �__doc__r r+ r" r r )r r r* R s r* N) Z
__future__r r r �objectr r# r' r( �sysr) r* r r r r �<module> s pip/_vendor/progress/__pycache__/helpers.cpython-36.opt-1.pyc 0000644 00000005517 14751155150 0020107 0 ustar 00 3
���e& � @ sd d dl mZ dZdZG dd� de�ZG dd� de�Zd dlmZmZ d d l m
Z
G d
d � d e�Z d S )
� )�print_functionz[?25lz[?25hc s2 e Zd ZdZd � fdd� Zdd� Zdd� Z� ZS )
�
WriteMixinFNc sb t t| �jf |� d| _|r"|| _| jj� r^| jrBtt d| jd� t| jd| jd� | jj
� d S )Nr � )�end�file) �superr �__init__�_width�messager �isatty� hide_cursor�print� HIDE_CURSOR�flush)�selfr
�kwargs)� __class__� � /usr/lib/python3.6/helpers.pyr s
zWriteMixin.__init__c C sT | j j� rPd| j }|j| j�}t|| d| j d� t| jt|��| _| j j� d S )N�r )r r )r r r �ljustr
�max�lenr )r �s�b�cr r r �write% s
zWriteMixin.writec C s$ | j j� r | jr ttd| j d� d S )Nr )r r )r r r r
� SHOW_CURSOR)r r r r �finish- s zWriteMixin.finish)N)�__name__�
__module__� __qualname__r r r r �
__classcell__r r )r r r s r c s: e Zd ZdZd � fdd� Zdd� Zdd� Zd d
� Z� ZS ) � WritelnMixinFNc s@ t t| �jf |� |r || _| jj� r<| jr<ttd| jd� d S )Nr )r r ) r r# r r
r r r r
r )r r
r )r r r r 5 s
zWritelnMixin.__init__c C s | j j� rtdd| j d� d S )Nz
[Kr )r r )r r r
)r r r r �clearln= s
zWritelnMixin.clearlnc C s0 | j j� r,| j� t|d| j d� | j j� d S )Nr )r r )r r r$ r
r )r �liner r r �writelnA s
zWritelnMixin.writelnc C s0 | j j� r,t| j d� | jr,ttd| j d� d S )N)r r )r r )r r r
r r )r r r r r G s
zWritelnMixin.finish)N) r r r! r r r$ r& r r" r r )r r r# 2 s
r# )�signal�SIGINT)�exitc s( e Zd ZdZ� fdd�Zdd� Z� ZS )� SigIntMixinz6Registers a signal handler that calls finish on SIGINTc s" t t| �j||� tt| j� d S )N)r r* r r' r( �_sigint_handler)r �argsr )r r r r U s zSigIntMixin.__init__c C s | j � td� d S )Nr )r r) )r Zsignum�framer r r r+ Y s zSigIntMixin._sigint_handler)r r r! �__doc__r r+ r" r r )r r r* R s r* N) Z
__future__r r r �objectr r# r' r( �sysr) r* r r r r �<module> s pip/_vendor/progress/__pycache__/bar.cpython-36.pyc 0000644 00000004521 14751155150 0016244 0 ustar 00 3
���e}
� @ s~ d dl mZ d dlmZ G dd� dee�ZG dd� de�ZG dd� de�ZG d d
� d
e�ZG d d � d e�ZG d
d� de�Z dS )� )�Progress)� WritelnMixinc @ s4 e Zd ZdZdZdZdZdZdZdZ dZ
d d
� Z d S ) �Bar� � z%(index)d/%(max)dz |z| � �#Tc C sj t | j| j �}| j| }| j| }| j| }| j| }| j| }dj|| j||| j |g�}| j
|� d S )Nr ) �int�width�progress�message�fill�
empty_fill�suffix�join�
bar_prefix�
bar_suffix�writeln)�self�
filled_length� empty_lengthr �bar�emptyr �line� r �/usr/lib/python3.6/bar.py�update s
z
Bar.updateN) �__name__�
__module__� __qualname__r
r r r r r r
Z hide_cursorr r r r r r s r c @ s e Zd ZdZdZdZdZdZdS )� ChargingBarz
%(percent)d%%r u ∙u █N)r r r r r r r r
r r r r r , s
r c @ s e Zd ZdZdZdS )�FillingSquaresBaru ▢u ▣N)r r r r r
r r r r r! 4 s r! c @ s e Zd ZdZdZdS )�FillingCirclesBaru ◯u ◉N)r r r r r
r r r r r" 9 s r" c @ s e Zd Zd
Zd
d � Zd S )�IncrementalBarr � ▏� ▎� ▍� ▌� ▋� ▊� ▉� █c C s� t | j�}t|| j | j �}t| j| j �}| j| }||| }| j| }| jd | }|dkrn| j| nd}| jtd|t |� � } | j| }
dj || j
||| | j |
g�} | j | � d S )Nr � r ���)
�len�phasesr r
r r r �maxr r r r r ) r ZnphasesZexpanded_lengthr r Zphaser r Zcurrentr r r r r r r A s
zIncrementalBar.updateN) r r$ r% r& r' r( r) r* r+ )r r r r/ r r r r r r# > s r# c @ s e Zd ZdZdS )�ShadyBarr � ░� ▒� ▓� █N)r r2 r3 r4 r5 )r r r r/ r r r r r1 R s r1 N)
r r Zhelpersr r r r! r" r# r1 r r r r �<module> s pip/_vendor/progress/__pycache__/spinner.cpython-36.opt-1.pyc 0000644 00000002177 14751155150 0020122 0 ustar 00 3
���e" � @ s^ d dl mZ d dlmZ G dd� dee�ZG dd� de�ZG dd� de�ZG d d
� d
e�Zd S ) � )�Infinite)�
WriteMixinc @ s e Zd ZdZd
ZdZdd� Zd S ) �Spinner� �-�\�|�/Tc C s$ | j t| j� }| j| j| � d S )N)�index�len�phases�write)�self�i� r � /usr/lib/python3.6/spinner.py�update s zSpinner.updateN)r r r r )�__name__�
__module__� __qualname__�messager Z hide_cursorr r r r r r s r c @ s e Zd ZddddgZdS )�
PieSpinneru ◷u ◶u ◵u ◴N)r r r r r r r r r s r c @ s e Zd ZddddgZdS )� MoonSpinneru ◑u ◒u ◐u ◓N)r r r r r r r r r # s r c @ s e Zd ZddddddgZdS )� LineSpinneru ⎺u ⎻u ⎼u ⎽N)r r r r r r r r r ' s r N)r r Zhelpersr r r r r r r r r �<module> s
pip/_vendor/progress/__pycache__/counter.cpython-36.opt-1.pyc 0000644 00000002745 14751155150 0020124 0 ustar 00 3
���e� � @ sf d dl mZmZ d dlmZ G dd� dee�ZG dd� dee�ZG dd� dee�ZG d d
� d
e�Zd S ) � )�Infinite�Progress)�
WriteMixinc @ s e Zd ZdZdZdd� ZdS )�Counter� Tc C s | j t| j�� d S )N)�write�str�index)�self� r � /usr/lib/python3.6/counter.py�update s zCounter.updateN)�__name__�
__module__� __qualname__�message� hide_cursorr
r r r r r s r c @ s e Zd ZdZdd� ZdS )� CountdownTc C s | j t| j�� d S )N)r r Z remaining)r
r r r r
s zCountdown.updateN)r r r r r
r r r r r s r c @ s e Zd ZdZd
Zd d � Zd
S )�Stack� � ▁� ▂� ▃� ▄� ▅� ▆� ▇� █Tc C s6 t | j�}t|d t| j| ��}| j| j| � d S )Nr )�len�phases�min�intZprogressr )r
Znphases�ir r r r
( s
z Stack.updateN) r r r r r r r r r )r r r r r r
r r r r r $ s r c @ s e Zd ZdZdS )�Pie� ○� ◔� ◑� ◕� ●N)r$ r% r& r' r( )r r r r r r r r r# . s r# N) r r r Zhelpersr r r r r# r r r r �<module> s
pip/_vendor/progress/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000007266 14751155150 0020207 0 ustar 00 3
���e� � @ sp d dl mZ d dlmZ d dlmZ d dlmZ d dlm Z d dl
m
Z
dZ G dd � d e �Z
G d
d � d e
�Zd S )
� )�division)�deque)� timedelta)�ceil)�stderr)�timez1.2c @ sr e Zd ZeZdZdd� Zdd� Zedd� �Z edd � �Z
ed
d � �Z d d
� Z dd� Z
dd� Zddd�Zdd� ZdS )�Infinite�
c O sJ d| _ t� | _| j| _t| jd�| _x |j� D ]\}}t| ||� q.W d S )Nr )�maxlen) �indexr �start_ts�_tsr �
sma_window�_dt�items�setattr)�self�args�kwargs�key�val� r � /usr/lib/python3.6/__init__.py�__init__ s zInfinite.__init__c C s |j d�rd S t| |d �S )N�_)�
startswith�getattr)r r r r r � __getitem__' s
zInfinite.__getitem__c C s | j rt| j �t| j � S dS )Nr )r �sum�len)r r r r �avg, s z Infinite.avgc C s t t� | j �S )N)�intr r )r r r r �elapsed0 s zInfinite.elapsedc C s t | jd�S )N)�seconds)r r" )r r r r �
elapsed_td4 s zInfinite.elapsed_tdc C s d S )Nr )r r r r �update8 s zInfinite.updatec C s d S )Nr )r r r r �start; s zInfinite.startc C s d S )Nr )r r r r �finish> s zInfinite.finish� c C sF |dkr.t � }|| j | }| jj|� || _| j| | _| j� d S )Nr )r r
r �appendr r% )r �nZnowZdtr r r �nextA s z
Infinite.nextc c s( x|D ]}|V | j � qW | j� d S )N)r+ r' )r �it�xr r r �iterK s
z
Infinite.iterN)r( )�__name__�
__module__� __qualname__r �filer r r �propertyr r" r$ r% r& r' r+ r. r r r r r s
r c sp e Zd Z� fdd�Zedd� �Zedd� �Zedd� �Zed d
� �Zed d � �Z d
d� Z
dd� Z dd� Z � Z
S )�Progressc s$ t t| �j||� |jdd�| _d S )N�max�d )�superr4 r �getr5 )r r r )� __class__r r r S s zProgress.__init__c C s t t| j| j ��S )N)r! r r � remaining)r r r r �etaW s z Progress.etac C s t | jd�S )N)r# )r r; )r r r r �eta_td[ s zProgress.eta_tdc C s
| j d S )Nr6 )�progress)r r r r �percent_ s zProgress.percentc C s t d| j| j �S )Nr( )�minr r5 )r r r r r= c s zProgress.progressc C s t | j | j d�S )Nr )r5 r )r r r r r: g s zProgress.remainingc C s | j � d S )N)r% )r r r r r& k s zProgress.startc C s || j }| j|� d S )N)r r+ )r r Zincrr r r �goton s
z
Progress.gotoc c sL yt |�| _W n tk
r" Y nX x|D ]}|V | j� q*W | j� d S )N)r r5 � TypeErrorr+ r' )r r, r- r r r r. r s
z
Progress.iter)r/ r0 r1 r r3 r; r< r> r= r: r& r@ r. �
__classcell__r r )r9 r r4 R s r4 N)Z
__future__r � collectionsr Zdatetimer Zmathr �sysr r � __version__�objectr r4 r r r r �<module> s 7 pip/_vendor/progress/__pycache__/spinner.cpython-36.pyc 0000644 00000002177 14751155150 0017163 0 ustar 00 3
���e" � @ s^ d dl mZ d dlmZ G dd� dee�ZG dd� de�ZG dd� de�ZG d d
� d
e�Zd S ) � )�Infinite)�
WriteMixinc @ s e Zd ZdZd
ZdZdd� Zd S ) �Spinner� �-�\�|�/Tc C s$ | j t| j� }| j| j| � d S )N)�index�len�phases�write)�self�i� r � /usr/lib/python3.6/spinner.py�update s zSpinner.updateN)r r r r )�__name__�
__module__� __qualname__�messager Z hide_cursorr r r r r r s r c @ s e Zd ZddddgZdS )�
PieSpinneru ◷u ◶u ◵u ◴N)r r r r r r r r r s r c @ s e Zd ZddddgZdS )� MoonSpinneru ◑u ◒u ◐u ◓N)r r r r r r r r r # s r c @ s e Zd ZddddddgZdS )� LineSpinneru ⎺u ⎻u ⎼u ⎽N)r r r r r r r r r ' s r N)r r Zhelpersr r r r r r r r r �<module> s
pip/_vendor/progress/__pycache__/__init__.cpython-36.pyc 0000644 00000007266 14751155150 0017250 0 ustar 00 3
���e� � @ sp d dl mZ d dlmZ d dlmZ d dlmZ d dlm Z d dl
m
Z
dZ G dd � d e �Z
G d
d � d e
�Zd S )
� )�division)�deque)� timedelta)�ceil)�stderr)�timez1.2c @ sr e Zd ZeZdZdd� Zdd� Zedd� �Z edd � �Z
ed
d � �Z d d
� Z dd� Z
dd� Zddd�Zdd� ZdS )�Infinite�
c O sJ d| _ t� | _| j| _t| jd�| _x |j� D ]\}}t| ||� q.W d S )Nr )�maxlen) �indexr �start_ts�_tsr �
sma_window�_dt�items�setattr)�self�args�kwargs�key�val� r � /usr/lib/python3.6/__init__.py�__init__ s zInfinite.__init__c C s |j d�rd S t| |d �S )N�_)�
startswith�getattr)r r r r r � __getitem__' s
zInfinite.__getitem__c C s | j rt| j �t| j � S dS )Nr )r �sum�len)r r r r �avg, s z Infinite.avgc C s t t� | j �S )N)�intr r )r r r r �elapsed0 s zInfinite.elapsedc C s t | jd�S )N)�seconds)r r" )r r r r �
elapsed_td4 s zInfinite.elapsed_tdc C s d S )Nr )r r r r �update8 s zInfinite.updatec C s d S )Nr )r r r r �start; s zInfinite.startc C s d S )Nr )r r r r �finish> s zInfinite.finish� c C sF |dkr.t � }|| j | }| jj|� || _| j| | _| j� d S )Nr )r r
r �appendr r% )r �nZnowZdtr r r �nextA s z
Infinite.nextc c s( x|D ]}|V | j � qW | j� d S )N)r+ r' )r �it�xr r r �iterK s
z
Infinite.iterN)r( )�__name__�
__module__� __qualname__r �filer r r �propertyr r" r$ r% r& r' r+ r. r r r r r s
r c sp e Zd Z� fdd�Zedd� �Zedd� �Zedd� �Zed d
� �Zed d � �Z d
d� Z
dd� Z dd� Z � Z
S )�Progressc s$ t t| �j||� |jdd�| _d S )N�max�d )�superr4 r �getr5 )r r r )� __class__r r r S s zProgress.__init__c C s t t| j| j ��S )N)r! r r � remaining)r r r r �etaW s z Progress.etac C s t | jd�S )N)r# )r r; )r r r r �eta_td[ s zProgress.eta_tdc C s
| j d S )Nr6 )�progress)r r r r �percent_ s zProgress.percentc C s t d| j| j �S )Nr( )�minr r5 )r r r r r= c s zProgress.progressc C s t | j | j d�S )Nr )r5 r )r r r r r: g s zProgress.remainingc C s | j � d S )N)r% )r r r r r& k s zProgress.startc C s || j }| j|� d S )N)r r+ )r r Zincrr r r �goton s
z
Progress.gotoc c sL yt |�| _W n tk
r" Y nX x|D ]}|V | j� q*W | j� d S )N)r r5 � TypeErrorr+ r' )r r, r- r r r r. r s
z
Progress.iter)r/ r0 r1 r r3 r; r< r> r= r: r& r@ r. �
__classcell__r r )r9 r r4 R s r4 N)Z
__future__r � collectionsr Zdatetimer Zmathr �sysr r � __version__�objectr r4 r r r r �<module> s 7 pip/_vendor/progress/__pycache__/bar.cpython-36.opt-1.pyc 0000644 00000004521 14751155150 0017203 0 ustar 00 3
���e}
� @ s~ d dl mZ d dlmZ G dd� dee�ZG dd� de�ZG dd� de�ZG d d
� d
e�ZG d d � d e�ZG d
d� de�Z dS )� )�Progress)� WritelnMixinc @ s4 e Zd ZdZdZdZdZdZdZdZ dZ
d d
� Z d S ) �Bar� � z%(index)d/%(max)dz |z| � �#Tc C sj t | j| j �}| j| }| j| }| j| }| j| }| j| }dj|| j||| j |g�}| j
|� d S )Nr ) �int�width�progress�message�fill�
empty_fill�suffix�join�
bar_prefix�
bar_suffix�writeln)�self�
filled_length� empty_lengthr �bar�emptyr �line� r �/usr/lib/python3.6/bar.py�update s
z
Bar.updateN) �__name__�
__module__� __qualname__r
r r r r r r
Z hide_cursorr r r r r r s r c @ s e Zd ZdZdZdZdZdZdS )� ChargingBarz
%(percent)d%%r u ∙u █N)r r r r r r r r
r r r r r , s
r c @ s e Zd ZdZdZdS )�FillingSquaresBaru ▢u ▣N)r r r r r
r r r r r! 4 s r! c @ s e Zd ZdZdZdS )�FillingCirclesBaru ◯u ◉N)r r r r r
r r r r r" 9 s r" c @ s e Zd Zd
Zd
d � Zd S )�IncrementalBarr � ▏� ▎� ▍� ▌� ▋� ▊� ▉� █c C s� t | j�}t|| j | j �}t| j| j �}| j| }||| }| j| }| jd | }|dkrn| j| nd}| jtd|t |� � } | j| }
dj || j
||| | j |
g�} | j | � d S )Nr � r ���)
�len�phasesr r
r r r �maxr r r r r ) r ZnphasesZexpanded_lengthr r Zphaser r Zcurrentr r r r r r r A s
zIncrementalBar.updateN) r r$ r% r& r' r( r) r* r+ )r r r r/ r r r r r r# > s r# c @ s e Zd ZdZdS )�ShadyBarr � ░� ▒� ▓� █N)r r2 r3 r4 r5 )r r r r/ r r r r r1 R s r1 N)
r r Zhelpersr r r r! r" r# r1 r r r r �<module> s pip/_vendor/progress/__pycache__/counter.cpython-36.pyc 0000644 00000002745 14751155150 0017165 0 ustar 00 3
���e� � @ sf d dl mZmZ d dlmZ G dd� dee�ZG dd� dee�ZG dd� dee�ZG d d
� d
e�Zd S ) � )�Infinite�Progress)�
WriteMixinc @ s e Zd ZdZdZdd� ZdS )�Counter� Tc C s | j t| j�� d S )N)�write�str�index)�self� r � /usr/lib/python3.6/counter.py�update s zCounter.updateN)�__name__�
__module__� __qualname__�message� hide_cursorr
r r r r r s r c @ s e Zd ZdZdd� ZdS )� CountdownTc C s | j t| j�� d S )N)r r Z remaining)r
r r r r
s zCountdown.updateN)r r r r r
r r r r r s r c @ s e Zd ZdZd
Zd d � Zd
S )�Stack� � ▁� ▂� ▃� ▄� ▅� ▆� ▇� █Tc C s6 t | j�}t|d t| j| ��}| j| j| � d S )Nr )�len�phases�min�intZprogressr )r
Znphases�ir r r r
( s
z Stack.updateN) r r r r r r r r r )r r r r r r
r r r r r $ s r c @ s e Zd ZdZdS )�Pie� ○� ◔� ◑� ◕� ●N)r$ r% r& r' r( )r r r r r r r r r# . s r# N) r r r Zhelpersr r r r r# r r r r �<module> s
pip/_vendor/progress/counter.py 0000644 00000002736 14751155150 0012701 0 ustar 00 # -*- coding: utf-8 -*-
# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
from . import Infinite, Progress
from .helpers import WriteMixin
class Counter(WriteMixin, Infinite):
message = ''
hide_cursor = True
def update(self):
self.write(str(self.index))
class Countdown(WriteMixin, Progress):
hide_cursor = True
def update(self):
self.write(str(self.remaining))
class Stack(WriteMixin, Progress):
phases = (u' ', u'▁', u'▂', u'▃', u'▄', u'▅', u'▆', u'▇', u'█')
hide_cursor = True
def update(self):
nphases = len(self.phases)
i = min(nphases - 1, int(self.progress * nphases))
self.write(self.phases[i])
class Pie(Stack):
phases = (u'○', u'◔', u'◑', u'◕', u'●')
pip/_vendor/progress/spinner.py 0000644 00000002442 14751155150 0012672 0 ustar 00 # -*- coding: utf-8 -*-
# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
from . import Infinite
from .helpers import WriteMixin
class Spinner(WriteMixin, Infinite):
message = ''
phases = ('-', '\\', '|', '/')
hide_cursor = True
def update(self):
i = self.index % len(self.phases)
self.write(self.phases[i])
class PieSpinner(Spinner):
phases = [u'◷', u'◶', u'◵', u'◴']
class MoonSpinner(Spinner):
phases = [u'◑', u'◒', u'◐', u'◓']
class LineSpinner(Spinner):
phases = [u'⎺', u'⎻', u'⎼', u'⎽', u'⎼', u'⎻']
pip/_vendor/certifi/__init__.py 0000644 00000000077 14751155150 0012536 0 ustar 00 from .core import where, old_where
__version__ = "2018.01.18"
pip/_vendor/certifi/__pycache__/__main__.cpython-36.pyc 0000644 00000000251 14751155150 0016775 0 ustar 00 3
���e) � @ s d dl mZ ee� � dS )� )�whereN)Zcertifir �print� r r � /usr/lib/python3.6/__main__.py�<module> s pip/_vendor/certifi/__pycache__/core.cpython-36.pyc 0000644 00000002112 14751155150 0016203 0 ustar 00 3
���e& � @ sJ d Z ddlZddlZG dd� de�Zdd� Zdd� Zed krFee� � dS )
zU
certifi.py
~~~~~~~~~~
This module returns the installation location of cacert.pem.
� Nc @ s e Zd ZdZdS )�DeprecatedBundleWarningz�
The weak security bundle is being deprecated. Please bother your service
provider to get them to stop using cross-signed roots.
N)�__name__�
__module__� __qualname__�__doc__� r r �/usr/lib/python3.6/core.pyr s r c C s dS )Nz /etc/pki/tls/certs/ca-bundle.crtr r r r r �where s r c C s t jdt� t� S )Nz�The weak security bundle has been removed. certifi.old_where() is now an alias of certifi.where(). Please update your code to use certifi.where() instead. certifi.old_where() will be removed in 2018.)�warnings�warnr r r r r r � old_where s r �__main__) r �osr
�DeprecationWarningr r r r �printr r r r �<module> s pip/_vendor/certifi/__pycache__/core.cpython-36.opt-1.pyc 0000644 00000002112 14751155150 0017142 0 ustar 00 3
���e& � @ sJ d Z ddlZddlZG dd� de�Zdd� Zdd� Zed krFee� � dS )
zU
certifi.py
~~~~~~~~~~
This module returns the installation location of cacert.pem.
� Nc @ s e Zd ZdZdS )�DeprecatedBundleWarningz�
The weak security bundle is being deprecated. Please bother your service
provider to get them to stop using cross-signed roots.
N)�__name__�
__module__� __qualname__�__doc__� r r �/usr/lib/python3.6/core.pyr s r c C s dS )Nz /etc/pki/tls/certs/ca-bundle.crtr r r r r �where s r c C s t jdt� t� S )Nz�The weak security bundle has been removed. certifi.old_where() is now an alias of certifi.where(). Please update your code to use certifi.where() instead. certifi.old_where() will be removed in 2018.)�warnings�warnr r r r r r � old_where s r �__main__) r �osr
�DeprecationWarningr r r r �printr r r r �<module> s pip/_vendor/certifi/__pycache__/__main__.cpython-36.opt-1.pyc 0000644 00000000251 14751155150 0017734 0 ustar 00 3
���e) � @ s d dl mZ ee� � dS )� )�whereN)Zcertifir �print� r r � /usr/lib/python3.6/__main__.py�<module> s pip/_vendor/certifi/__pycache__/__init__.cpython-36.pyc 0000644 00000000306 14751155150 0017015 0 ustar 00 3
���e? � @ s d dl mZmZ dZdS )� )�where� old_wherez
2018.01.18N)Zcorer r � __version__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/certifi/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000306 14751155150 0017754 0 ustar 00 3
���e? � @ s d dl mZmZ dZdS )� )�where� old_wherez
2018.01.18N)Zcorer r � __version__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/certifi/__main__.py 0000644 00000000051 14751155150 0012507 0 ustar 00 from certifi import where
print(where())
pip/_vendor/certifi/core.py 0000644 00000001446 14751155150 0011730 0 ustar 00 #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
certifi.py
~~~~~~~~~~
This module returns the installation location of cacert.pem.
"""
import os
import warnings
class DeprecatedBundleWarning(DeprecationWarning):
"""
The weak security bundle is being deprecated. Please bother your service
provider to get them to stop using cross-signed roots.
"""
def where():
return '/etc/pki/tls/certs/ca-bundle.crt'
def old_where():
warnings.warn(
"The weak security bundle has been removed. certifi.old_where() is now an alias "
"of certifi.where(). Please update your code to use certifi.where() instead. "
"certifi.old_where() will be removed in 2018.",
DeprecatedBundleWarning
)
return where()
if __name__ == '__main__':
print(where())
pip/_vendor/lockfile/linklockfile.py 0000644 00000005134 14751155150 0013607 0 ustar 00 from __future__ import absolute_import
import time
import os
from . import (LockBase, LockFailed, NotLocked, NotMyLock, LockTimeout,
AlreadyLocked)
class LinkLockFile(LockBase):
"""Lock access to a file using atomic property of link(2).
>>> lock = LinkLockFile('somefile')
>>> lock = LinkLockFile('somefile', threaded=False)
"""
def acquire(self, timeout=None):
try:
open(self.unique_name, "wb").close()
except IOError:
raise LockFailed("failed to create %s" % self.unique_name)
timeout = timeout if timeout is not None else self.timeout
end_time = time.time()
if timeout is not None and timeout > 0:
end_time += timeout
while True:
# Try and create a hard link to it.
try:
os.link(self.unique_name, self.lock_file)
except OSError:
# Link creation failed. Maybe we've double-locked?
nlinks = os.stat(self.unique_name).st_nlink
if nlinks == 2:
# The original link plus the one I created == 2. We're
# good to go.
return
else:
# Otherwise the lock creation failed.
if timeout is not None and time.time() > end_time:
os.unlink(self.unique_name)
if timeout > 0:
raise LockTimeout("Timeout waiting to acquire"
" lock for %s" %
self.path)
else:
raise AlreadyLocked("%s is already locked" %
self.path)
time.sleep(timeout is not None and timeout / 10 or 0.1)
else:
# Link creation succeeded. We're good to go.
return
def release(self):
if not self.is_locked():
raise NotLocked("%s is not locked" % self.path)
elif not os.path.exists(self.unique_name):
raise NotMyLock("%s is locked, but not by me" % self.path)
os.unlink(self.unique_name)
os.unlink(self.lock_file)
def is_locked(self):
return os.path.exists(self.lock_file)
def i_am_locking(self):
return (self.is_locked() and
os.path.exists(self.unique_name) and
os.stat(self.unique_name).st_nlink == 2)
def break_lock(self):
if os.path.exists(self.lock_file):
os.unlink(self.lock_file)
pip/_vendor/lockfile/__init__.py 0000644 00000022233 14751155150 0012677 0 ustar 00 # -*- coding: utf-8 -*-
"""
lockfile.py - Platform-independent advisory file locks.
Requires Python 2.5 unless you apply 2.4.diff
Locking is done on a per-thread basis instead of a per-process basis.
Usage:
>>> lock = LockFile('somefile')
>>> try:
... lock.acquire()
... except AlreadyLocked:
... print 'somefile', 'is locked already.'
... except LockFailed:
... print 'somefile', 'can\\'t be locked.'
... else:
... print 'got lock'
got lock
>>> print lock.is_locked()
True
>>> lock.release()
>>> lock = LockFile('somefile')
>>> print lock.is_locked()
False
>>> with lock:
... print lock.is_locked()
True
>>> print lock.is_locked()
False
>>> lock = LockFile('somefile')
>>> # It is okay to lock twice from the same thread...
>>> with lock:
... lock.acquire()
...
>>> # Though no counter is kept, so you can't unlock multiple times...
>>> print lock.is_locked()
False
Exceptions:
Error - base class for other exceptions
LockError - base class for all locking exceptions
AlreadyLocked - Another thread or process already holds the lock
LockFailed - Lock failed for some other reason
UnlockError - base class for all unlocking exceptions
AlreadyUnlocked - File was not locked.
NotMyLock - File was locked but not by the current thread/process
"""
from __future__ import absolute_import
import functools
import os
import socket
import threading
import warnings
# Work with PEP8 and non-PEP8 versions of threading module.
if not hasattr(threading, "current_thread"):
threading.current_thread = threading.currentThread
if not hasattr(threading.Thread, "get_name"):
threading.Thread.get_name = threading.Thread.getName
__all__ = ['Error', 'LockError', 'LockTimeout', 'AlreadyLocked',
'LockFailed', 'UnlockError', 'NotLocked', 'NotMyLock',
'LinkFileLock', 'MkdirFileLock', 'SQLiteFileLock',
'LockBase', 'locked']
class Error(Exception):
"""
Base class for other exceptions.
>>> try:
... raise Error
... except Exception:
... pass
"""
pass
class LockError(Error):
"""
Base class for error arising from attempts to acquire the lock.
>>> try:
... raise LockError
... except Error:
... pass
"""
pass
class LockTimeout(LockError):
"""Raised when lock creation fails within a user-defined period of time.
>>> try:
... raise LockTimeout
... except LockError:
... pass
"""
pass
class AlreadyLocked(LockError):
"""Some other thread/process is locking the file.
>>> try:
... raise AlreadyLocked
... except LockError:
... pass
"""
pass
class LockFailed(LockError):
"""Lock file creation failed for some other reason.
>>> try:
... raise LockFailed
... except LockError:
... pass
"""
pass
class UnlockError(Error):
"""
Base class for errors arising from attempts to release the lock.
>>> try:
... raise UnlockError
... except Error:
... pass
"""
pass
class NotLocked(UnlockError):
"""Raised when an attempt is made to unlock an unlocked file.
>>> try:
... raise NotLocked
... except UnlockError:
... pass
"""
pass
class NotMyLock(UnlockError):
"""Raised when an attempt is made to unlock a file someone else locked.
>>> try:
... raise NotMyLock
... except UnlockError:
... pass
"""
pass
class _SharedBase(object):
def __init__(self, path):
self.path = path
def acquire(self, timeout=None):
"""
Acquire the lock.
* If timeout is omitted (or None), wait forever trying to lock the
file.
* If timeout > 0, try to acquire the lock for that many seconds. If
the lock period expires and the file is still locked, raise
LockTimeout.
* If timeout <= 0, raise AlreadyLocked immediately if the file is
already locked.
"""
raise NotImplemented("implement in subclass")
def release(self):
"""
Release the lock.
If the file is not locked, raise NotLocked.
"""
raise NotImplemented("implement in subclass")
def __enter__(self):
"""
Context manager support.
"""
self.acquire()
return self
def __exit__(self, *_exc):
"""
Context manager support.
"""
self.release()
def __repr__(self):
return "<%s: %r>" % (self.__class__.__name__, self.path)
class LockBase(_SharedBase):
"""Base class for platform-specific lock classes."""
def __init__(self, path, threaded=True, timeout=None):
"""
>>> lock = LockBase('somefile')
>>> lock = LockBase('somefile', threaded=False)
"""
super(LockBase, self).__init__(path)
self.lock_file = os.path.abspath(path) + ".lock"
self.hostname = socket.gethostname()
self.pid = os.getpid()
if threaded:
t = threading.current_thread()
# Thread objects in Python 2.4 and earlier do not have ident
# attrs. Worm around that.
ident = getattr(t, "ident", hash(t))
self.tname = "-%x" % (ident & 0xffffffff)
else:
self.tname = ""
dirname = os.path.dirname(self.lock_file)
# unique name is mostly about the current process, but must
# also contain the path -- otherwise, two adjacent locked
# files conflict (one file gets locked, creating lock-file and
# unique file, the other one gets locked, creating lock-file
# and overwriting the already existing lock-file, then one
# gets unlocked, deleting both lock-file and unique file,
# finally the last lock errors out upon releasing.
self.unique_name = os.path.join(dirname,
"%s%s.%s%s" % (self.hostname,
self.tname,
self.pid,
hash(self.path)))
self.timeout = timeout
def is_locked(self):
"""
Tell whether or not the file is locked.
"""
raise NotImplemented("implement in subclass")
def i_am_locking(self):
"""
Return True if this object is locking the file.
"""
raise NotImplemented("implement in subclass")
def break_lock(self):
"""
Remove a lock. Useful if a locking thread failed to unlock.
"""
raise NotImplemented("implement in subclass")
def __repr__(self):
return "<%s: %r -- %r>" % (self.__class__.__name__, self.unique_name,
self.path)
def _fl_helper(cls, mod, *args, **kwds):
warnings.warn("Import from %s module instead of lockfile package" % mod,
DeprecationWarning, stacklevel=2)
# This is a bit funky, but it's only for awhile. The way the unit tests
# are constructed this function winds up as an unbound method, so it
# actually takes three args, not two. We want to toss out self.
if not isinstance(args[0], str):
# We are testing, avoid the first arg
args = args[1:]
if len(args) == 1 and not kwds:
kwds["threaded"] = True
return cls(*args, **kwds)
def LinkFileLock(*args, **kwds):
"""Factory function provided for backwards compatibility.
Do not use in new code. Instead, import LinkLockFile from the
lockfile.linklockfile module.
"""
from . import linklockfile
return _fl_helper(linklockfile.LinkLockFile, "lockfile.linklockfile",
*args, **kwds)
def MkdirFileLock(*args, **kwds):
"""Factory function provided for backwards compatibility.
Do not use in new code. Instead, import MkdirLockFile from the
lockfile.mkdirlockfile module.
"""
from . import mkdirlockfile
return _fl_helper(mkdirlockfile.MkdirLockFile, "lockfile.mkdirlockfile",
*args, **kwds)
def SQLiteFileLock(*args, **kwds):
"""Factory function provided for backwards compatibility.
Do not use in new code. Instead, import SQLiteLockFile from the
lockfile.mkdirlockfile module.
"""
from . import sqlitelockfile
return _fl_helper(sqlitelockfile.SQLiteLockFile, "lockfile.sqlitelockfile",
*args, **kwds)
def locked(path, timeout=None):
"""Decorator which enables locks for decorated function.
Arguments:
- path: path for lockfile.
- timeout (optional): Timeout for acquiring lock.
Usage:
@locked('/var/run/myname', timeout=0)
def myname(...):
...
"""
def decor(func):
@functools.wraps(func)
def wrapper(*args, **kwargs):
lock = FileLock(path, timeout=timeout)
lock.acquire()
try:
return func(*args, **kwargs)
finally:
lock.release()
return wrapper
return decor
if hasattr(os, "link"):
from . import linklockfile as _llf
LockFile = _llf.LinkLockFile
else:
from . import mkdirlockfile as _mlf
LockFile = _mlf.MkdirLockFile
FileLock = LockFile
pip/_vendor/lockfile/sqlitelockfile.py 0000644 00000012602 14751155150 0014151 0 ustar 00 from __future__ import absolute_import, division
import time
import os
try:
unicode
except NameError:
unicode = str
from . import LockBase, NotLocked, NotMyLock, LockTimeout, AlreadyLocked
class SQLiteLockFile(LockBase):
"Demonstrate SQL-based locking."
testdb = None
def __init__(self, path, threaded=True, timeout=None):
"""
>>> lock = SQLiteLockFile('somefile')
>>> lock = SQLiteLockFile('somefile', threaded=False)
"""
LockBase.__init__(self, path, threaded, timeout)
self.lock_file = unicode(self.lock_file)
self.unique_name = unicode(self.unique_name)
if SQLiteLockFile.testdb is None:
import tempfile
_fd, testdb = tempfile.mkstemp()
os.close(_fd)
os.unlink(testdb)
del _fd, tempfile
SQLiteLockFile.testdb = testdb
import sqlite3
self.connection = sqlite3.connect(SQLiteLockFile.testdb)
c = self.connection.cursor()
try:
c.execute("create table locks"
"("
" lock_file varchar(32),"
" unique_name varchar(32)"
")")
except sqlite3.OperationalError:
pass
else:
self.connection.commit()
import atexit
atexit.register(os.unlink, SQLiteLockFile.testdb)
def acquire(self, timeout=None):
timeout = timeout if timeout is not None else self.timeout
end_time = time.time()
if timeout is not None and timeout > 0:
end_time += timeout
if timeout is None:
wait = 0.1
elif timeout <= 0:
wait = 0
else:
wait = timeout / 10
cursor = self.connection.cursor()
while True:
if not self.is_locked():
# Not locked. Try to lock it.
cursor.execute("insert into locks"
" (lock_file, unique_name)"
" values"
" (?, ?)",
(self.lock_file, self.unique_name))
self.connection.commit()
# Check to see if we are the only lock holder.
cursor.execute("select * from locks"
" where unique_name = ?",
(self.unique_name,))
rows = cursor.fetchall()
if len(rows) > 1:
# Nope. Someone else got there. Remove our lock.
cursor.execute("delete from locks"
" where unique_name = ?",
(self.unique_name,))
self.connection.commit()
else:
# Yup. We're done, so go home.
return
else:
# Check to see if we are the only lock holder.
cursor.execute("select * from locks"
" where unique_name = ?",
(self.unique_name,))
rows = cursor.fetchall()
if len(rows) == 1:
# We're the locker, so go home.
return
# Maybe we should wait a bit longer.
if timeout is not None and time.time() > end_time:
if timeout > 0:
# No more waiting.
raise LockTimeout("Timeout waiting to acquire"
" lock for %s" %
self.path)
else:
# Someone else has the lock and we are impatient..
raise AlreadyLocked("%s is already locked" % self.path)
# Well, okay. We'll give it a bit longer.
time.sleep(wait)
def release(self):
if not self.is_locked():
raise NotLocked("%s is not locked" % self.path)
if not self.i_am_locking():
raise NotMyLock("%s is locked, but not by me (by %s)" %
(self.unique_name, self._who_is_locking()))
cursor = self.connection.cursor()
cursor.execute("delete from locks"
" where unique_name = ?",
(self.unique_name,))
self.connection.commit()
def _who_is_locking(self):
cursor = self.connection.cursor()
cursor.execute("select unique_name from locks"
" where lock_file = ?",
(self.lock_file,))
return cursor.fetchone()[0]
def is_locked(self):
cursor = self.connection.cursor()
cursor.execute("select * from locks"
" where lock_file = ?",
(self.lock_file,))
rows = cursor.fetchall()
return not not rows
def i_am_locking(self):
cursor = self.connection.cursor()
cursor.execute("select * from locks"
" where lock_file = ?"
" and unique_name = ?",
(self.lock_file, self.unique_name))
return not not cursor.fetchall()
def break_lock(self):
cursor = self.connection.cursor()
cursor.execute("delete from locks"
" where lock_file = ?",
(self.lock_file,))
self.connection.commit()
pip/_vendor/lockfile/pidlockfile.py 0000644 00000013712 14751155150 0013427 0 ustar 00 # -*- coding: utf-8 -*-
# pidlockfile.py
#
# Copyright © 2008–2009 Ben Finney <ben+python@benfinney.id.au>
#
# This is free software: you may copy, modify, and/or distribute this work
# under the terms of the Python Software Foundation License, version 2 or
# later as published by the Python Software Foundation.
# No warranty expressed or implied. See the file LICENSE.PSF-2 for details.
""" Lockfile behaviour implemented via Unix PID files.
"""
from __future__ import absolute_import
import errno
import os
import time
from . import (LockBase, AlreadyLocked, LockFailed, NotLocked, NotMyLock,
LockTimeout)
class PIDLockFile(LockBase):
""" Lockfile implemented as a Unix PID file.
The lock file is a normal file named by the attribute `path`.
A lock's PID file contains a single line of text, containing
the process ID (PID) of the process that acquired the lock.
>>> lock = PIDLockFile('somefile')
>>> lock = PIDLockFile('somefile')
"""
def __init__(self, path, threaded=False, timeout=None):
# pid lockfiles don't support threaded operation, so always force
# False as the threaded arg.
LockBase.__init__(self, path, False, timeout)
self.unique_name = self.path
def read_pid(self):
""" Get the PID from the lock file.
"""
return read_pid_from_pidfile(self.path)
def is_locked(self):
""" Test if the lock is currently held.
The lock is held if the PID file for this lock exists.
"""
return os.path.exists(self.path)
def i_am_locking(self):
""" Test if the lock is held by the current process.
Returns ``True`` if the current process ID matches the
number stored in the PID file.
"""
return self.is_locked() and os.getpid() == self.read_pid()
def acquire(self, timeout=None):
""" Acquire the lock.
Creates the PID file for this lock, or raises an error if
the lock could not be acquired.
"""
timeout = timeout if timeout is not None else self.timeout
end_time = time.time()
if timeout is not None and timeout > 0:
end_time += timeout
while True:
try:
write_pid_to_pidfile(self.path)
except OSError as exc:
if exc.errno == errno.EEXIST:
# The lock creation failed. Maybe sleep a bit.
if time.time() > end_time:
if timeout is not None and timeout > 0:
raise LockTimeout("Timeout waiting to acquire"
" lock for %s" %
self.path)
else:
raise AlreadyLocked("%s is already locked" %
self.path)
time.sleep(timeout is not None and timeout / 10 or 0.1)
else:
raise LockFailed("failed to create %s" % self.path)
else:
return
def release(self):
""" Release the lock.
Removes the PID file to release the lock, or raises an
error if the current process does not hold the lock.
"""
if not self.is_locked():
raise NotLocked("%s is not locked" % self.path)
if not self.i_am_locking():
raise NotMyLock("%s is locked, but not by me" % self.path)
remove_existing_pidfile(self.path)
def break_lock(self):
""" Break an existing lock.
Removes the PID file if it already exists, otherwise does
nothing.
"""
remove_existing_pidfile(self.path)
def read_pid_from_pidfile(pidfile_path):
""" Read the PID recorded in the named PID file.
Read and return the numeric PID recorded as text in the named
PID file. If the PID file cannot be read, or if the content is
not a valid PID, return ``None``.
"""
pid = None
try:
pidfile = open(pidfile_path, 'r')
except IOError:
pass
else:
# According to the FHS 2.3 section on PID files in /var/run:
#
# The file must consist of the process identifier in
# ASCII-encoded decimal, followed by a newline character.
#
# Programs that read PID files should be somewhat flexible
# in what they accept; i.e., they should ignore extra
# whitespace, leading zeroes, absence of the trailing
# newline, or additional lines in the PID file.
line = pidfile.readline().strip()
try:
pid = int(line)
except ValueError:
pass
pidfile.close()
return pid
def write_pid_to_pidfile(pidfile_path):
""" Write the PID in the named PID file.
Get the numeric process ID (“PID”) of the current process
and write it to the named file as a line of text.
"""
open_flags = (os.O_CREAT | os.O_EXCL | os.O_WRONLY)
open_mode = 0o644
pidfile_fd = os.open(pidfile_path, open_flags, open_mode)
pidfile = os.fdopen(pidfile_fd, 'w')
# According to the FHS 2.3 section on PID files in /var/run:
#
# The file must consist of the process identifier in
# ASCII-encoded decimal, followed by a newline character. For
# example, if crond was process number 25, /var/run/crond.pid
# would contain three characters: two, five, and newline.
pid = os.getpid()
pidfile.write("%s\n" % pid)
pidfile.close()
def remove_existing_pidfile(pidfile_path):
""" Remove the named PID file if it exists.
Removing a PID file that doesn't already exist puts us in the
desired state, so we ignore the condition if the file does not
exist.
"""
try:
os.remove(pidfile_path)
except OSError as exc:
if exc.errno == errno.ENOENT:
pass
else:
raise
pip/_vendor/lockfile/mkdirlockfile.py 0000644 00000006030 14751155150 0013754 0 ustar 00 from __future__ import absolute_import, division
import time
import os
import sys
import errno
from . import (LockBase, LockFailed, NotLocked, NotMyLock, LockTimeout,
AlreadyLocked)
class MkdirLockFile(LockBase):
"""Lock file by creating a directory."""
def __init__(self, path, threaded=True, timeout=None):
"""
>>> lock = MkdirLockFile('somefile')
>>> lock = MkdirLockFile('somefile', threaded=False)
"""
LockBase.__init__(self, path, threaded, timeout)
# Lock file itself is a directory. Place the unique file name into
# it.
self.unique_name = os.path.join(self.lock_file,
"%s.%s%s" % (self.hostname,
self.tname,
self.pid))
def acquire(self, timeout=None):
timeout = timeout if timeout is not None else self.timeout
end_time = time.time()
if timeout is not None and timeout > 0:
end_time += timeout
if timeout is None:
wait = 0.1
else:
wait = max(0, timeout / 10)
while True:
try:
os.mkdir(self.lock_file)
except OSError:
err = sys.exc_info()[1]
if err.errno == errno.EEXIST:
# Already locked.
if os.path.exists(self.unique_name):
# Already locked by me.
return
if timeout is not None and time.time() > end_time:
if timeout > 0:
raise LockTimeout("Timeout waiting to acquire"
" lock for %s" %
self.path)
else:
# Someone else has the lock.
raise AlreadyLocked("%s is already locked" %
self.path)
time.sleep(wait)
else:
# Couldn't create the lock for some other reason
raise LockFailed("failed to create %s" % self.lock_file)
else:
open(self.unique_name, "wb").close()
return
def release(self):
if not self.is_locked():
raise NotLocked("%s is not locked" % self.path)
elif not os.path.exists(self.unique_name):
raise NotMyLock("%s is locked, but not by me" % self.path)
os.unlink(self.unique_name)
os.rmdir(self.lock_file)
def is_locked(self):
return os.path.exists(self.lock_file)
def i_am_locking(self):
return (self.is_locked() and
os.path.exists(self.unique_name))
def break_lock(self):
if os.path.exists(self.lock_file):
for name in os.listdir(self.lock_file):
os.unlink(os.path.join(self.lock_file, name))
os.rmdir(self.lock_file)
pip/_vendor/lockfile/symlinklockfile.py 0000644 00000005070 14751155150 0014337 0 ustar 00 from __future__ import absolute_import
import os
import time
from . import (LockBase, NotLocked, NotMyLock, LockTimeout,
AlreadyLocked)
class SymlinkLockFile(LockBase):
"""Lock access to a file using symlink(2)."""
def __init__(self, path, threaded=True, timeout=None):
# super(SymlinkLockFile).__init(...)
LockBase.__init__(self, path, threaded, timeout)
# split it back!
self.unique_name = os.path.split(self.unique_name)[1]
def acquire(self, timeout=None):
# Hopefully unnecessary for symlink.
# try:
# open(self.unique_name, "wb").close()
# except IOError:
# raise LockFailed("failed to create %s" % self.unique_name)
timeout = timeout if timeout is not None else self.timeout
end_time = time.time()
if timeout is not None and timeout > 0:
end_time += timeout
while True:
# Try and create a symbolic link to it.
try:
os.symlink(self.unique_name, self.lock_file)
except OSError:
# Link creation failed. Maybe we've double-locked?
if self.i_am_locking():
# Linked to out unique name. Proceed.
return
else:
# Otherwise the lock creation failed.
if timeout is not None and time.time() > end_time:
if timeout > 0:
raise LockTimeout("Timeout waiting to acquire"
" lock for %s" %
self.path)
else:
raise AlreadyLocked("%s is already locked" %
self.path)
time.sleep(timeout / 10 if timeout is not None else 0.1)
else:
# Link creation succeeded. We're good to go.
return
def release(self):
if not self.is_locked():
raise NotLocked("%s is not locked" % self.path)
elif not self.i_am_locking():
raise NotMyLock("%s is locked, but not by me" % self.path)
os.unlink(self.lock_file)
def is_locked(self):
return os.path.islink(self.lock_file)
def i_am_locking(self):
return (os.path.islink(self.lock_file)
and os.readlink(self.lock_file) == self.unique_name)
def break_lock(self):
if os.path.islink(self.lock_file): # exists && link
os.unlink(self.lock_file)
pip/_vendor/lockfile/__pycache__/mkdirlockfile.cpython-36.opt-1.pyc 0000644 00000005013 14751155150 0021177 0 ustar 00 3
���e � @ sd d dl mZmZ d dlZd dlZd dlZd dlZddlmZm Z m
Z
m Z m Z m
Z
G dd� de�ZdS )� )�absolute_import�divisionN� )�LockBase�
LockFailed� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ sD e Zd ZdZddd�Zddd�Zdd � Zd
d � Zd d
� Zdd� Z dS )�
MkdirLockFilez"Lock file by creating a directory.TNc C s6 t j| |||� tjj| jd| j| j| jf �| _ dS )zs
>>> lock = MkdirLockFile('somefile')
>>> lock = MkdirLockFile('somefile', threaded=False)
z%s.%s%sN)
r �__init__�os�path�join� lock_fileZhostnameZtname�pid� unique_name)�selfr Zthreaded�timeout� r �#/usr/lib/python3.6/mkdirlockfile.pyr s
zMkdirLockFile.__init__c C s |d k r |n| j }tj� }|d k r2|dkr2||7 }|d kr@d}ntd|d �}x�ytj| j� W n� tk
r� tj� d }|j t j
kr�tj j | j
�r�d S |d k r�tj� |kr�|dkr�td| j ��ntd| j ��tj|� ntd| j ��Y qPX t| j
d�j� d S qPW d S ) Nr g�������?�
r z&Timeout waiting to acquire lock for %sz%s is already lockedzfailed to create %s�wb)r �time�maxr
�mkdirr �OSError�sys�exc_info�errnoZEEXISTr �existsr r r
Zsleepr �open�close)r r Zend_time�wait�errr r r �acquire s2
zMkdirLockFile.acquirec C sP | j � std| j ��n tjj| j�s4td| j ��tj| j� tj| j � d S )Nz%s is not lockedz%s is locked, but not by me)
� is_lockedr r r
r r r �unlink�rmdirr )r r r r �releaseA s zMkdirLockFile.releasec C s t jj| j�S )N)r
r r r )r r r r r& I s zMkdirLockFile.is_lockedc C s | j � otjj| j�S )N)r& r
r r r )r r r r � i_am_lockingL s zMkdirLockFile.i_am_lockingc C sJ t jj| j�rFx*t j| j�D ]}t jt jj| j|�� q W t j| j� d S )N)r
r r r �listdirr' r r( )r �namer r r �
break_lockP s zMkdirLockFile.break_lock)TN)N)
�__name__�
__module__� __qualname__�__doc__r r% r) r& r* r- r r r r r s
&r )Z
__future__r r r r
r r � r r r r r r
r r r r r �<module> s pip/_vendor/lockfile/__pycache__/__init__.cpython-36.pyc 0000644 00000023146 14751155150 0017167 0 ustar 00 3
���e�$ �
@ s� d Z ddlmZ ddlZddlZddlZddlZddlZeed�sJej e_
eej d�sbej j ej _
dddd d
d d d
dddddg
ZG dd� de�ZG dd� de�ZG dd� de�ZG dd � d e�ZG dd
� d
e�ZG dd � d e�ZG dd � d e�ZG dd
� d
e�ZG dd � d e�ZG d d� de�Zd d � Zd d� Z d!d� Z d"d� Z d(d#d�Z eed$��rjd%d&l m!Z" e"j#Z$nd%d'l m%Z& e&j'Z$e$Z(dS ))a
lockfile.py - Platform-independent advisory file locks.
Requires Python 2.5 unless you apply 2.4.diff
Locking is done on a per-thread basis instead of a per-process basis.
Usage:
>>> lock = LockFile('somefile')
>>> try:
... lock.acquire()
... except AlreadyLocked:
... print 'somefile', 'is locked already.'
... except LockFailed:
... print 'somefile', 'can\'t be locked.'
... else:
... print 'got lock'
got lock
>>> print lock.is_locked()
True
>>> lock.release()
>>> lock = LockFile('somefile')
>>> print lock.is_locked()
False
>>> with lock:
... print lock.is_locked()
True
>>> print lock.is_locked()
False
>>> lock = LockFile('somefile')
>>> # It is okay to lock twice from the same thread...
>>> with lock:
... lock.acquire()
...
>>> # Though no counter is kept, so you can't unlock multiple times...
>>> print lock.is_locked()
False
Exceptions:
Error - base class for other exceptions
LockError - base class for all locking exceptions
AlreadyLocked - Another thread or process already holds the lock
LockFailed - Lock failed for some other reason
UnlockError - base class for all unlocking exceptions
AlreadyUnlocked - File was not locked.
NotMyLock - File was locked but not by the current thread/process
� )�absolute_importN�current_thread�get_name�Error� LockError� LockTimeout�
AlreadyLocked�
LockFailed� UnlockError� NotLocked� NotMyLock� LinkFileLock�
MkdirFileLock�SQLiteFileLock�LockBase�lockedc @ s e Zd ZdZdS )r zw
Base class for other exceptions.
>>> try:
... raise Error
... except Exception:
... pass
N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/__init__.pyr J s c @ s e Zd ZdZdS )r z�
Base class for error arising from attempts to acquire the lock.
>>> try:
... raise LockError
... except Error:
... pass
N)r r r r r r r r r V s c @ s e Zd ZdZdS )r z�Raised when lock creation fails within a user-defined period of time.
>>> try:
... raise LockTimeout
... except LockError:
... pass
N)r r r r r r r r r b s c @ s e Zd ZdZdS )r z�Some other thread/process is locking the file.
>>> try:
... raise AlreadyLocked
... except LockError:
... pass
N)r r r r r r r r r m s c @ s e Zd ZdZdS )r z�Lock file creation failed for some other reason.
>>> try:
... raise LockFailed
... except LockError:
... pass
N)r r r r r r r r r x s c @ s e Zd ZdZdS )r
z�
Base class for errors arising from attempts to release the lock.
>>> try:
... raise UnlockError
... except Error:
... pass
N)r r r r r r r r r
� s c @ s e Zd ZdZdS )r z�Raised when an attempt is made to unlock an unlocked file.
>>> try:
... raise NotLocked
... except UnlockError:
... pass
N)r r r r r r r r r � s c @ s e Zd ZdZdS )r z�Raised when an attempt is made to unlock a file someone else locked.
>>> try:
... raise NotMyLock
... except UnlockError:
... pass
N)r r r r r r r r r � s c @ s> e Zd Zdd� Zddd�Zdd� Zdd � Zd
d � Zd d
� ZdS )� _SharedBasec C s
|| _ d S )N)�path)�selfr r r r �__init__� s z_SharedBase.__init__Nc C s t d��dS )a�
Acquire the lock.
* If timeout is omitted (or None), wait forever trying to lock the
file.
* If timeout > 0, try to acquire the lock for that many seconds. If
the lock period expires and the file is still locked, raise
LockTimeout.
* If timeout <= 0, raise AlreadyLocked immediately if the file is
already locked.
zimplement in subclassN)�NotImplemented)r �timeoutr r r �acquire� s z_SharedBase.acquirec C s t d��dS )zX
Release the lock.
If the file is not locked, raise NotLocked.
zimplement in subclassN)r )r r r r �release� s z_SharedBase.releasec C s | j � | S )z*
Context manager support.
)r )r r r r � __enter__� s z_SharedBase.__enter__c G s | j � dS )z*
Context manager support.
N)r )r Z_excr r r �__exit__� s z_SharedBase.__exit__c C s d| j j| jf S )Nz<%s: %r>)� __class__r r )r r r r �__repr__� s z_SharedBase.__repr__)N) r r r r r r r r! r# r r r r r � s
r c sB e Zd ZdZd� fdd� Zdd� Zdd � Zd
d � Zd d
� Z� Z S )r z.Base class for platform-specific lock classes.TNc s� t t| �j|� tjj|�d | _tj� | _ tj
� | _ |rbt j
� }t|dt|��}d|d@ | _nd| _tjj| j�}tjj|d| j | j| j t| j�f �| _|| _dS )zi
>>> lock = LockBase('somefile')
>>> lock = LockBase('somefile', threaded=False)
z.lock�identz-%xl �� � z %s%s.%s%sN)�superr r �osr �abspathZ lock_file�socketZ gethostnameZhostname�getpid�pid� threadingr �getattr�hashZtname�dirname�join� unique_namer )r r �threadedr �tr$ r/ )r" r r r � s
zLockBase.__init__c C s t d��dS )z9
Tell whether or not the file is locked.
zimplement in subclassN)r )r r r r � is_locked� s zLockBase.is_lockedc C s t d��dS )zA
Return True if this object is locking the file.
zimplement in subclassN)r )r r r r � i_am_locking� s zLockBase.i_am_lockingc C s t d��dS )zN
Remove a lock. Useful if a locking thread failed to unlock.
zimplement in subclassN)r )r r r r �
break_lock s zLockBase.break_lockc C s d| j j| j| jf S )Nz<%s: %r -- %r>)r" r r1 r )r r r r r# s zLockBase.__repr__)TN)
r r r r r r4 r5 r6 r# �
__classcell__r r )r" r r � s !c O sR t jd| tdd� t|d t�s.|dd � }t|�dkrH| rHd|d< | ||�S )Nz1Import from %s module instead of lockfile package� )�
stacklevelr � Tr2 )�warnings�warn�DeprecationWarning�
isinstance�str�len)�cls�mod�args�kwdsr r r �
_fl_helper s
rE c O s ddl m} t|jdf| �|�S )z�Factory function provided for backwards compatibility.
Do not use in new code. Instead, import LinkLockFile from the
lockfile.linklockfile module.
r: )� linklockfilezlockfile.linklockfile)r% rF rE � LinkLockFile)rC rD rF r r r r
s
c O s ddl m} t|jdf| �|�S )z�Factory function provided for backwards compatibility.
Do not use in new code. Instead, import MkdirLockFile from the
lockfile.mkdirlockfile module.
r: )�
mkdirlockfilezlockfile.mkdirlockfile)r% rH rE �
MkdirLockFile)rC rD rH r r r r % s
c O s ddl m} t|jdf| �|�S )z�Factory function provided for backwards compatibility.
Do not use in new code. Instead, import SQLiteLockFile from the
lockfile.mkdirlockfile module.
r: )�sqlitelockfilezlockfile.sqlitelockfile)r% rJ rE ZSQLiteLockFile)rC rD rJ r r r r 0 s
c s � �fdd�}|S )a Decorator which enables locks for decorated function.
Arguments:
- path: path for lockfile.
- timeout (optional): Timeout for acquiring lock.
Usage:
@locked('/var/run/myname', timeout=0)
def myname(...):
...
c s t j� �� ��fdd��}|S )Nc
s. t ��d�}|j� z
� | |�S |j� X d S )N)r )�FileLockr r )rC �kwargs�lock)�funcr r r r �wrapperH s
z&locked.<locals>.decor.<locals>.wrapper)� functools�wraps)rN rO )r r )rN r �decorG s zlocked.<locals>.decorr )r r rR r )r r r r ; s
�linkr: )rF )rH )N))r Z
__future__r rP r' r) r, r; �hasattrZ
currentThreadr ZThreadZgetNamer �__all__� Exceptionr r r r r r
r r �objectr r rE r
r r r r% rF Z_llfrG ZLockFilerH Z_mlfrI rK r r r r �<module>4 sF
-:
pip/_vendor/lockfile/__pycache__/pidlockfile.cpython-36.pyc 0000644 00000011243 14751155150 0017710 0 ustar 00 3
���e� � @ st d Z ddlmZ ddlZddlZddlZddlmZmZm Z m
Z
m Z m Z G dd� de�Z
dd � Zd
d � Zd d
� ZdS )z8 Lockfile behaviour implemented via Unix PID files.
� )�absolute_importN� )�LockBase�
AlreadyLocked�
LockFailed� NotLocked� NotMyLock� LockTimeoutc @ sL e Zd ZdZddd�Zdd� Zdd � Zd
d � Zdd d
�Zdd� Z dd� Z
dS )� PIDLockFileaA Lockfile implemented as a Unix PID file.
The lock file is a normal file named by the attribute `path`.
A lock's PID file contains a single line of text, containing
the process ID (PID) of the process that acquired the lock.
>>> lock = PIDLockFile('somefile')
>>> lock = PIDLockFile('somefile')
FNc C s t j| |d|� | j| _d S )NF)r �__init__�pathZ unique_name)�selfr Zthreaded�timeout� r �!/usr/lib/python3.6/pidlockfile.pyr $ s zPIDLockFile.__init__c C s
t | j�S )z- Get the PID from the lock file.
)�read_pid_from_pidfiler )r
r r r �read_pid* s zPIDLockFile.read_pidc C s t jj| j�S )zv Test if the lock is currently held.
The lock is held if the PID file for this lock exists.
)�osr �exists)r
r r r � is_locked/ s zPIDLockFile.is_lockedc C s | j � otj� | j� kS )z� Test if the lock is held by the current process.
Returns ``True`` if the current process ID matches the
number stored in the PID file.
)r r �getpidr )r
r r r � i_am_locking7 s zPIDLockFile.i_am_lockingc C s� |dk r |n| j }tj� }|dk r2|dkr2||7 }x�yt| j� W n� tk
r� } zv|jtjkr�tj� |kr�|dk r�|dkr�td| j ��ntd| j ��tj |dk r�|d p�d� nt
d| j ��W Y dd}~X q4X dS q4W dS )z� Acquire the lock.
Creates the PID file for this lock, or raises an error if
the lock could not be acquired.
Nr z&Timeout waiting to acquire lock for %sz%s is already locked�
g�������?zfailed to create %s) r �time�write_pid_to_pidfiler �OSError�errnoZEEXISTr r Zsleepr )r
r Zend_time�excr r r �acquire? s$
zPIDLockFile.acquirec C s: | j � std| j ��| j� s,td| j ��t| j� dS )z� Release the lock.
Removes the PID file to release the lock, or raises an
error if the current process does not hold the lock.
z%s is not lockedz%s is locked, but not by meN)r r r r r �remove_existing_pidfile)r
r r r �release_ s
zPIDLockFile.releasec C s t | j� dS )z� Break an existing lock.
Removes the PID file if it already exists, otherwise does
nothing.
N)r r )r
r r r �
break_lockl s zPIDLockFile.break_lock)FN)N) �__name__�
__module__� __qualname__�__doc__r r r r r r r! r r r r r
s
r
c C sb d}yt | d�}W n tk
r& Y n8X |j� j� }y t|�}W n tk
rT Y nX |j� |S )z� Read the PID recorded in the named PID file.
Read and return the numeric PID recorded as text in the named
PID file. If the PID file cannot be read, or if the content is
not a valid PID, return ``None``.
N�r)�open�IOError�readline�strip�int�
ValueError�close)� pidfile_path�pid�pidfile�liner r r r v s r c C sR t jt jB t jB }d}t j| ||�}t j|d�}t j� }|jd| � |j� dS )u� Write the PID in the named PID file.
Get the numeric process ID (“PID”) of the current process
and write it to the named file as a line of text.
i� �wz%s
N) r �O_CREAT�O_EXCL�O_WRONLYr' �fdopenr �writer- )r. Z
open_flagsZ open_modeZ
pidfile_fdr0 r/ r r r r � s r c C sF yt j| � W n2 tk
r@ } z|jtjkr.n� W Y dd}~X nX dS )z� Remove the named PID file if it exists.
Removing a PID file that doesn't already exist puts us in the
desired state, so we ignore the condition if the file does not
exist.
N)r �remover r �ENOENT)r. r r r r r � s r )r% Z
__future__r r r r � r r r r r r r
r r r r r r r �<module>
s ]" pip/_vendor/lockfile/__pycache__/mkdirlockfile.cpython-36.pyc 0000644 00000005013 14751155150 0020240 0 ustar 00 3
���e � @ sd d dl mZmZ d dlZd dlZd dlZd dlZddlmZm Z m
Z
m Z m Z m
Z
G dd� de�ZdS )� )�absolute_import�divisionN� )�LockBase�
LockFailed� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ sD e Zd ZdZddd�Zddd�Zdd � Zd
d � Zd d
� Zdd� Z dS )�
MkdirLockFilez"Lock file by creating a directory.TNc C s6 t j| |||� tjj| jd| j| j| jf �| _ dS )zs
>>> lock = MkdirLockFile('somefile')
>>> lock = MkdirLockFile('somefile', threaded=False)
z%s.%s%sN)
r �__init__�os�path�join� lock_fileZhostnameZtname�pid� unique_name)�selfr Zthreaded�timeout� r �#/usr/lib/python3.6/mkdirlockfile.pyr s
zMkdirLockFile.__init__c C s |d k r |n| j }tj� }|d k r2|dkr2||7 }|d kr@d}ntd|d �}x�ytj| j� W n� tk
r� tj� d }|j t j
kr�tj j | j
�r�d S |d k r�tj� |kr�|dkr�td| j ��ntd| j ��tj|� ntd| j ��Y qPX t| j
d�j� d S qPW d S ) Nr g�������?�
r z&Timeout waiting to acquire lock for %sz%s is already lockedzfailed to create %s�wb)r �time�maxr
�mkdirr �OSError�sys�exc_info�errnoZEEXISTr �existsr r r
Zsleepr �open�close)r r Zend_time�wait�errr r r �acquire s2
zMkdirLockFile.acquirec C sP | j � std| j ��n tjj| j�s4td| j ��tj| j� tj| j � d S )Nz%s is not lockedz%s is locked, but not by me)
� is_lockedr r r
r r r �unlink�rmdirr )r r r r �releaseA s zMkdirLockFile.releasec C s t jj| j�S )N)r
r r r )r r r r r& I s zMkdirLockFile.is_lockedc C s | j � otjj| j�S )N)r& r
r r r )r r r r � i_am_lockingL s zMkdirLockFile.i_am_lockingc C sJ t jj| j�rFx*t j| j�D ]}t jt jj| j|�� q W t j| j� d S )N)r
r r r �listdirr' r r( )r �namer r r �
break_lockP s zMkdirLockFile.break_lock)TN)N)
�__name__�
__module__� __qualname__�__doc__r r% r) r& r* r- r r r r r s
&r )Z
__future__r r r r
r r � r r r r r r
r r r r r �<module> s pip/_vendor/lockfile/__pycache__/sqlitelockfile.cpython-36.pyc 0000644 00000007126 14751155150 0020442 0 ustar 00 3
���e� � @ sr d dl mZmZ d dlZd dlZye W n ek
r@ eZY nX ddlm Z m
Z
m Z m Z m
Z
G dd� de �ZdS )� )�absolute_import�divisionN� )�LockBase� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ sP e Zd ZdZdZddd�Zddd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dS )�SQLiteLockFilez Demonstrate SQL-based locking.NTc
C s� t j| |||� t| j�| _t| j�| _tjdkrdddl}|j� \}}t j
|� t j |� ~~|t_ddl }|j
tj�| _| jj� }y|jd� W n |jk
r� Y n$X | jj� ddl} | jt j tj� dS )zu
>>> lock = SQLiteLockFile('somefile')
>>> lock = SQLiteLockFile('somefile', threaded=False)
Nr zGcreate table locks( lock_file varchar(32), unique_name varchar(32)))r �__init__�unicode� lock_file� unique_namer
�testdb�tempfileZmkstemp�os�close�unlink�sqlite3Zconnect�
connection�cursor�executeZOperationalError�commit�atexit�register)
�self�pathZthreaded�timeoutr Z_fdr r �cr � r �$/usr/lib/python3.6/sqlitelockfile.pyr s(
zSQLiteLockFile.__init__c C sH |d k r |n| j }tj� }|d k r2|dkr2||7 }|d kr@d}n|dkrNd}n|d }| jj� }x�| j� s�|jd| j| jf� | jj� |jd| jf� |j � }t
|�dkr�|jd| jf� | jj� q�d S n(|jd| jf� |j � }t
|�dkr�d S |d k �r6tj� |k�r6|dk�r(t d| j ��nt
d | j ��tj|� qbW d S )
Nr g�������?�
z;insert into locks (lock_file, unique_name) values (?, ?)z*select * from locks where unique_name = ?r z(delete from locks where unique_name = ?z&Timeout waiting to acquire lock for %sz%s is already locked)r �timer r � is_lockedr r
r r �fetchall�lenr r r Zsleep)r r Zend_time�waitr �rowsr r r �acquire5 sD
zSQLiteLockFile.acquirec C s\ | j � std| j ��| j� s4td| j| j� f ��| jj� }|j d| jf� | jj
� d S )Nz%s is not lockedz#%s is locked, but not by me (by %s)z(delete from locks where unique_name = ?) r# r r � i_am_lockingr r �_who_is_lockingr r r r )r r r r r �releaset s
zSQLiteLockFile.releasec C s& | j j� }|jd| jf� |j� d S )Nz2select unique_name from locks where lock_file = ?r )r r r r
Zfetchone)r r r r r r* � s
z SQLiteLockFile._who_is_lockingc C s* | j j� }|jd| jf� |j� }| S )Nz(select * from locks where lock_file = ?)r r r r
r$ )r r r' r r r r# � s
zSQLiteLockFile.is_lockedc C s* | j j� }|jd| j| jf� |j� S )Nz?select * from locks where lock_file = ? and unique_name = ?)r r r r
r r$ )r r r r r r) � s
zSQLiteLockFile.i_am_lockingc C s( | j j� }|jd| jf� | j j� d S )Nz&delete from locks where lock_file = ?)r r r r
r )r r r r r �
break_lock� s
zSQLiteLockFile.break_lock)TN)N) �__name__�
__module__� __qualname__�__doc__r r r( r+ r* r# r) r, r r r r r
s
"
? r
)Z
__future__r r r" r r � NameError�str� r r r r r r
r r r r �<module> s
pip/_vendor/lockfile/__pycache__/linklockfile.cpython-36.pyc 0000644 00000004241 14751155150 0020071 0 ustar 00 3
���e\
� @ sP d dl mZ d dlZd dlZddlmZmZmZmZm Z m
Z
G dd� de�Z dS )� )�absolute_importN� )�LockBase�
LockFailed� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ s: e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zd d � ZdS )� LinkLockFilez�Lock access to a file using atomic property of link(2).
>>> lock = LinkLockFile('somefile')
>>> lock = LinkLockFile('somefile', threaded=False)
Nc C s" yt | jd�j� W n" tk
r6 td| j ��Y nX |d k rD|n| j}tj� }|d k rj|dkrj||7 }x�ytj| j| j � W n� t
k
�r tj | j�j }|dkr�d S |d k r�tj� |kr�tj
| j� |dkr�td| j ��ntd| j ��tj|d k �r
|d �p d� Y qlX d S qlW d S ) N�wbzfailed to create %sr � z&Timeout waiting to acquire lock for %sz%s is already locked�
g�������?)�open� unique_name�close�IOErrorr �timeout�time�os�link� lock_file�OSError�stat�st_nlink�unlinkr �pathr Zsleep)�selfr Zend_timeZnlinks� r �"/usr/lib/python3.6/linklockfile.py�acquire s0
$zLinkLockFile.acquirec C sP | j � std| j ��n tjj| j�s4td| j ��tj| j� tj| j� d S )Nz%s is not lockedz%s is locked, but not by me) � is_lockedr r r �existsr r r r )r r r r �release7 s zLinkLockFile.releasec C s t jj| j�S )N)r r r! r )r r r r r ? s zLinkLockFile.is_lockedc C s( | j � o&tjj| j�o&tj| j�jdkS )Nr )r r r r! r r r )r r r r � i_am_lockingB s zLinkLockFile.i_am_lockingc C s t jj| j�rt j| j� d S )N)r r r! r r )r r r r �
break_lockG s zLinkLockFile.break_lock)N) �__name__�
__module__� __qualname__�__doc__r r" r r# r$ r r r r r
s
&r
) Z
__future__r r r � r r r r r r r
r r r r �<module> s pip/_vendor/lockfile/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000023146 14751155150 0020126 0 ustar 00 3
���e�$ �
@ s� d Z ddlmZ ddlZddlZddlZddlZddlZeed�sJej e_
eej d�sbej j ej _
dddd d
d d d
dddddg
ZG dd� de�ZG dd� de�ZG dd� de�ZG dd � d e�ZG dd
� d
e�ZG dd � d e�ZG dd � d e�ZG dd
� d
e�ZG dd � d e�ZG d d� de�Zd d � Zd d� Z d!d� Z d"d� Z d(d#d�Z eed$��rjd%d&l m!Z" e"j#Z$nd%d'l m%Z& e&j'Z$e$Z(dS ))a
lockfile.py - Platform-independent advisory file locks.
Requires Python 2.5 unless you apply 2.4.diff
Locking is done on a per-thread basis instead of a per-process basis.
Usage:
>>> lock = LockFile('somefile')
>>> try:
... lock.acquire()
... except AlreadyLocked:
... print 'somefile', 'is locked already.'
... except LockFailed:
... print 'somefile', 'can\'t be locked.'
... else:
... print 'got lock'
got lock
>>> print lock.is_locked()
True
>>> lock.release()
>>> lock = LockFile('somefile')
>>> print lock.is_locked()
False
>>> with lock:
... print lock.is_locked()
True
>>> print lock.is_locked()
False
>>> lock = LockFile('somefile')
>>> # It is okay to lock twice from the same thread...
>>> with lock:
... lock.acquire()
...
>>> # Though no counter is kept, so you can't unlock multiple times...
>>> print lock.is_locked()
False
Exceptions:
Error - base class for other exceptions
LockError - base class for all locking exceptions
AlreadyLocked - Another thread or process already holds the lock
LockFailed - Lock failed for some other reason
UnlockError - base class for all unlocking exceptions
AlreadyUnlocked - File was not locked.
NotMyLock - File was locked but not by the current thread/process
� )�absolute_importN�current_thread�get_name�Error� LockError� LockTimeout�
AlreadyLocked�
LockFailed� UnlockError� NotLocked� NotMyLock� LinkFileLock�
MkdirFileLock�SQLiteFileLock�LockBase�lockedc @ s e Zd ZdZdS )r zw
Base class for other exceptions.
>>> try:
... raise Error
... except Exception:
... pass
N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/__init__.pyr J s c @ s e Zd ZdZdS )r z�
Base class for error arising from attempts to acquire the lock.
>>> try:
... raise LockError
... except Error:
... pass
N)r r r r r r r r r V s c @ s e Zd ZdZdS )r z�Raised when lock creation fails within a user-defined period of time.
>>> try:
... raise LockTimeout
... except LockError:
... pass
N)r r r r r r r r r b s c @ s e Zd ZdZdS )r z�Some other thread/process is locking the file.
>>> try:
... raise AlreadyLocked
... except LockError:
... pass
N)r r r r r r r r r m s c @ s e Zd ZdZdS )r z�Lock file creation failed for some other reason.
>>> try:
... raise LockFailed
... except LockError:
... pass
N)r r r r r r r r r x s c @ s e Zd ZdZdS )r
z�
Base class for errors arising from attempts to release the lock.
>>> try:
... raise UnlockError
... except Error:
... pass
N)r r r r r r r r r
� s c @ s e Zd ZdZdS )r z�Raised when an attempt is made to unlock an unlocked file.
>>> try:
... raise NotLocked
... except UnlockError:
... pass
N)r r r r r r r r r � s c @ s e Zd ZdZdS )r z�Raised when an attempt is made to unlock a file someone else locked.
>>> try:
... raise NotMyLock
... except UnlockError:
... pass
N)r r r r r r r r r � s c @ s> e Zd Zdd� Zddd�Zdd� Zdd � Zd
d � Zd d
� ZdS )� _SharedBasec C s
|| _ d S )N)�path)�selfr r r r �__init__� s z_SharedBase.__init__Nc C s t d��dS )a�
Acquire the lock.
* If timeout is omitted (or None), wait forever trying to lock the
file.
* If timeout > 0, try to acquire the lock for that many seconds. If
the lock period expires and the file is still locked, raise
LockTimeout.
* If timeout <= 0, raise AlreadyLocked immediately if the file is
already locked.
zimplement in subclassN)�NotImplemented)r �timeoutr r r �acquire� s z_SharedBase.acquirec C s t d��dS )zX
Release the lock.
If the file is not locked, raise NotLocked.
zimplement in subclassN)r )r r r r �release� s z_SharedBase.releasec C s | j � | S )z*
Context manager support.
)r )r r r r � __enter__� s z_SharedBase.__enter__c G s | j � dS )z*
Context manager support.
N)r )r Z_excr r r �__exit__� s z_SharedBase.__exit__c C s d| j j| jf S )Nz<%s: %r>)� __class__r r )r r r r �__repr__� s z_SharedBase.__repr__)N) r r r r r r r r! r# r r r r r � s
r c sB e Zd ZdZd� fdd� Zdd� Zdd � Zd
d � Zd d
� Z� Z S )r z.Base class for platform-specific lock classes.TNc s� t t| �j|� tjj|�d | _tj� | _ tj
� | _ |rbt j
� }t|dt|��}d|d@ | _nd| _tjj| j�}tjj|d| j | j| j t| j�f �| _|| _dS )zi
>>> lock = LockBase('somefile')
>>> lock = LockBase('somefile', threaded=False)
z.lock�identz-%xl �� � z %s%s.%s%sN)�superr r �osr �abspathZ lock_file�socketZ gethostnameZhostname�getpid�pid� threadingr �getattr�hashZtname�dirname�join� unique_namer )r r �threadedr �tr$ r/ )r" r r r � s
zLockBase.__init__c C s t d��dS )z9
Tell whether or not the file is locked.
zimplement in subclassN)r )r r r r � is_locked� s zLockBase.is_lockedc C s t d��dS )zA
Return True if this object is locking the file.
zimplement in subclassN)r )r r r r � i_am_locking� s zLockBase.i_am_lockingc C s t d��dS )zN
Remove a lock. Useful if a locking thread failed to unlock.
zimplement in subclassN)r )r r r r �
break_lock s zLockBase.break_lockc C s d| j j| j| jf S )Nz<%s: %r -- %r>)r" r r1 r )r r r r r# s zLockBase.__repr__)TN)
r r r r r r4 r5 r6 r# �
__classcell__r r )r" r r � s !c O sR t jd| tdd� t|d t�s.|dd � }t|�dkrH| rHd|d< | ||�S )Nz1Import from %s module instead of lockfile package� )�
stacklevelr � Tr2 )�warnings�warn�DeprecationWarning�
isinstance�str�len)�cls�mod�args�kwdsr r r �
_fl_helper s
rE c O s ddl m} t|jdf| �|�S )z�Factory function provided for backwards compatibility.
Do not use in new code. Instead, import LinkLockFile from the
lockfile.linklockfile module.
r: )� linklockfilezlockfile.linklockfile)r% rF rE � LinkLockFile)rC rD rF r r r r
s
c O s ddl m} t|jdf| �|�S )z�Factory function provided for backwards compatibility.
Do not use in new code. Instead, import MkdirLockFile from the
lockfile.mkdirlockfile module.
r: )�
mkdirlockfilezlockfile.mkdirlockfile)r% rH rE �
MkdirLockFile)rC rD rH r r r r % s
c O s ddl m} t|jdf| �|�S )z�Factory function provided for backwards compatibility.
Do not use in new code. Instead, import SQLiteLockFile from the
lockfile.mkdirlockfile module.
r: )�sqlitelockfilezlockfile.sqlitelockfile)r% rJ rE ZSQLiteLockFile)rC rD rJ r r r r 0 s
c s � �fdd�}|S )a Decorator which enables locks for decorated function.
Arguments:
- path: path for lockfile.
- timeout (optional): Timeout for acquiring lock.
Usage:
@locked('/var/run/myname', timeout=0)
def myname(...):
...
c s t j� �� ��fdd��}|S )Nc
s. t ��d�}|j� z
� | |�S |j� X d S )N)r )�FileLockr r )rC �kwargs�lock)�funcr r r r �wrapperH s
z&locked.<locals>.decor.<locals>.wrapper)� functools�wraps)rN rO )r r )rN r �decorG s zlocked.<locals>.decorr )r r rR r )r r r r ; s
�linkr: )rF )rH )N))r Z
__future__r rP r' r) r, r; �hasattrZ
currentThreadr ZThreadZgetNamer �__all__� Exceptionr r r r r r
r r �objectr r rE r
r r r r% rF Z_llfrG ZLockFilerH Z_mlfrI rK r r r r �<module>4 sF
-:
pip/_vendor/lockfile/__pycache__/sqlitelockfile.cpython-36.opt-1.pyc 0000644 00000007126 14751155150 0021401 0 ustar 00 3
���e� � @ sr d dl mZmZ d dlZd dlZye W n ek
r@ eZY nX ddlm Z m
Z
m Z m Z m
Z
G dd� de �ZdS )� )�absolute_import�divisionN� )�LockBase� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ sP e Zd ZdZdZddd�Zddd�Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dS )�SQLiteLockFilez Demonstrate SQL-based locking.NTc
C s� t j| |||� t| j�| _t| j�| _tjdkrdddl}|j� \}}t j
|� t j |� ~~|t_ddl }|j
tj�| _| jj� }y|jd� W n |jk
r� Y n$X | jj� ddl} | jt j tj� dS )zu
>>> lock = SQLiteLockFile('somefile')
>>> lock = SQLiteLockFile('somefile', threaded=False)
Nr zGcreate table locks( lock_file varchar(32), unique_name varchar(32)))r �__init__�unicode� lock_file� unique_namer
�testdb�tempfileZmkstemp�os�close�unlink�sqlite3Zconnect�
connection�cursor�executeZOperationalError�commit�atexit�register)
�self�pathZthreaded�timeoutr Z_fdr r �cr � r �$/usr/lib/python3.6/sqlitelockfile.pyr s(
zSQLiteLockFile.__init__c C sH |d k r |n| j }tj� }|d k r2|dkr2||7 }|d kr@d}n|dkrNd}n|d }| jj� }x�| j� s�|jd| j| jf� | jj� |jd| jf� |j � }t
|�dkr�|jd| jf� | jj� q�d S n(|jd| jf� |j � }t
|�dkr�d S |d k �r6tj� |k�r6|dk�r(t d| j ��nt
d | j ��tj|� qbW d S )
Nr g�������?�
z;insert into locks (lock_file, unique_name) values (?, ?)z*select * from locks where unique_name = ?r z(delete from locks where unique_name = ?z&Timeout waiting to acquire lock for %sz%s is already locked)r �timer r � is_lockedr r
r r �fetchall�lenr r r Zsleep)r r Zend_time�waitr �rowsr r r �acquire5 sD
zSQLiteLockFile.acquirec C s\ | j � std| j ��| j� s4td| j| j� f ��| jj� }|j d| jf� | jj
� d S )Nz%s is not lockedz#%s is locked, but not by me (by %s)z(delete from locks where unique_name = ?) r# r r � i_am_lockingr r �_who_is_lockingr r r r )r r r r r �releaset s
zSQLiteLockFile.releasec C s& | j j� }|jd| jf� |j� d S )Nz2select unique_name from locks where lock_file = ?r )r r r r
Zfetchone)r r r r r r* � s
z SQLiteLockFile._who_is_lockingc C s* | j j� }|jd| jf� |j� }| S )Nz(select * from locks where lock_file = ?)r r r r
r$ )r r r' r r r r# � s
zSQLiteLockFile.is_lockedc C s* | j j� }|jd| j| jf� |j� S )Nz?select * from locks where lock_file = ? and unique_name = ?)r r r r
r r$ )r r r r r r) � s
zSQLiteLockFile.i_am_lockingc C s( | j j� }|jd| jf� | j j� d S )Nz&delete from locks where lock_file = ?)r r r r
r )r r r r r �
break_lock� s
zSQLiteLockFile.break_lock)TN)N) �__name__�
__module__� __qualname__�__doc__r r r( r+ r* r# r) r, r r r r r
s
"
? r
)Z
__future__r r r" r r � NameError�str� r r r r r r
r r r r �<module> s
pip/_vendor/lockfile/__pycache__/symlinklockfile.cpython-36.opt-1.pyc 0000644 00000004056 14751155150 0021565 0 ustar 00 3
���e8
� @ sL d dl mZ d dlZd dlZddlmZmZmZmZm Z G dd� de�Z
dS )� )�absolute_importN� )�LockBase� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ sD e Zd ZdZddd�Zddd�Zdd � Zd
d � Zd d
� Zdd� Z dS )�SymlinkLockFilez'Lock access to a file using symlink(2).TNc C s( t j| |||� tjj| j�d | _d S )Nr )r �__init__�os�path�split� unique_name)�selfr Zthreaded�timeout� r �%/usr/lib/python3.6/symlinklockfile.pyr
s zSymlinkLockFile.__init__c C s� |d k r |n| j }tj� }|d k r2|dkr2||7 }x�ytj| j| j� W nt tk
r� | j� rdd S |d k r�tj� |kr�|dkr�td| j ��nt
d| j ��tj |d k r�|d nd� Y q4X d S q4W d S )Nr z&Timeout waiting to acquire lock for %sz%s is already locked�
g�������?) r �timer �symlinkr � lock_file�OSError� i_am_lockingr r r Zsleep)r r Zend_timer r r �acquire s$
zSymlinkLockFile.acquirec C s> | j � std| j ��n| j� s.td| j ��tj| j� d S )Nz%s is not lockedz%s is locked, but not by me)� is_lockedr r r r r �unlinkr )r r r r �release6 s
zSymlinkLockFile.releasec C s t jj| j�S )N)r r �islinkr )r r r r r = s zSymlinkLockFile.is_lockedc C s t jj| j�o t j| j�| jkS )N)r r r r �readlinkr )r r r r r @ s z SymlinkLockFile.i_am_lockingc C s t jj| j�rt j| j� d S )N)r r r r r )r r r r �
break_lockD s zSymlinkLockFile.break_lock)TN)N)
�__name__�
__module__� __qualname__�__doc__r
r r r r r r r r r r
s
#r ) Z
__future__r r r � r r r r r r r r r r �<module> s pip/_vendor/lockfile/__pycache__/symlinklockfile.cpython-36.pyc 0000644 00000004056 14751155150 0020626 0 ustar 00 3
���e8
� @ sL d dl mZ d dlZd dlZddlmZmZmZmZm Z G dd� de�Z
dS )� )�absolute_importN� )�LockBase� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ sD e Zd ZdZddd�Zddd�Zdd � Zd
d � Zd d
� Zdd� Z dS )�SymlinkLockFilez'Lock access to a file using symlink(2).TNc C s( t j| |||� tjj| j�d | _d S )Nr )r �__init__�os�path�split� unique_name)�selfr Zthreaded�timeout� r �%/usr/lib/python3.6/symlinklockfile.pyr
s zSymlinkLockFile.__init__c C s� |d k r |n| j }tj� }|d k r2|dkr2||7 }x�ytj| j| j� W nt tk
r� | j� rdd S |d k r�tj� |kr�|dkr�td| j ��nt
d| j ��tj |d k r�|d nd� Y q4X d S q4W d S )Nr z&Timeout waiting to acquire lock for %sz%s is already locked�
g�������?) r �timer �symlinkr � lock_file�OSError� i_am_lockingr r r Zsleep)r r Zend_timer r r �acquire s$
zSymlinkLockFile.acquirec C s> | j � std| j ��n| j� s.td| j ��tj| j� d S )Nz%s is not lockedz%s is locked, but not by me)� is_lockedr r r r r �unlinkr )r r r r �release6 s
zSymlinkLockFile.releasec C s t jj| j�S )N)r r �islinkr )r r r r r = s zSymlinkLockFile.is_lockedc C s t jj| j�o t j| j�| jkS )N)r r r r �readlinkr )r r r r r @ s z SymlinkLockFile.i_am_lockingc C s t jj| j�rt j| j� d S )N)r r r r r )r r r r �
break_lockD s zSymlinkLockFile.break_lock)TN)N)
�__name__�
__module__� __qualname__�__doc__r
r r r r r r r r r r
s
#r ) Z
__future__r r r � r r r r r r r r r r �<module> s pip/_vendor/lockfile/__pycache__/linklockfile.cpython-36.opt-1.pyc 0000644 00000004241 14751155150 0021030 0 ustar 00 3
���e\
� @ sP d dl mZ d dlZd dlZddlmZmZmZmZm Z m
Z
G dd� de�Z dS )� )�absolute_importN� )�LockBase�
LockFailed� NotLocked� NotMyLock� LockTimeout�
AlreadyLockedc @ s: e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zd d � ZdS )� LinkLockFilez�Lock access to a file using atomic property of link(2).
>>> lock = LinkLockFile('somefile')
>>> lock = LinkLockFile('somefile', threaded=False)
Nc C s" yt | jd�j� W n" tk
r6 td| j ��Y nX |d k rD|n| j}tj� }|d k rj|dkrj||7 }x�ytj| j| j � W n� t
k
�r tj | j�j }|dkr�d S |d k r�tj� |kr�tj
| j� |dkr�td| j ��ntd| j ��tj|d k �r
|d �p d� Y qlX d S qlW d S ) N�wbzfailed to create %sr � z&Timeout waiting to acquire lock for %sz%s is already locked�
g�������?)�open� unique_name�close�IOErrorr �timeout�time�os�link� lock_file�OSError�stat�st_nlink�unlinkr �pathr Zsleep)�selfr Zend_timeZnlinks� r �"/usr/lib/python3.6/linklockfile.py�acquire s0
$zLinkLockFile.acquirec C sP | j � std| j ��n tjj| j�s4td| j ��tj| j� tj| j� d S )Nz%s is not lockedz%s is locked, but not by me) � is_lockedr r r �existsr r r r )r r r r �release7 s zLinkLockFile.releasec C s t jj| j�S )N)r r r! r )r r r r r ? s zLinkLockFile.is_lockedc C s( | j � o&tjj| j�o&tj| j�jdkS )Nr )r r r r! r r r )r r r r � i_am_lockingB s zLinkLockFile.i_am_lockingc C s t jj| j�rt j| j� d S )N)r r r! r r )r r r r �
break_lockG s zLinkLockFile.break_lock)N) �__name__�
__module__� __qualname__�__doc__r r" r r# r$ r r r r r
s
&r
) Z
__future__r r r � r r r r r r r
r r r r �<module> s pip/_vendor/lockfile/__pycache__/pidlockfile.cpython-36.opt-1.pyc 0000644 00000011243 14751155150 0020647 0 ustar 00 3
���e� � @ st d Z ddlmZ ddlZddlZddlZddlmZmZm Z m
Z
m Z m Z G dd� de�Z
dd � Zd
d � Zd d
� ZdS )z8 Lockfile behaviour implemented via Unix PID files.
� )�absolute_importN� )�LockBase�
AlreadyLocked�
LockFailed� NotLocked� NotMyLock� LockTimeoutc @ sL e Zd ZdZddd�Zdd� Zdd � Zd
d � Zdd d
�Zdd� Z dd� Z
dS )� PIDLockFileaA Lockfile implemented as a Unix PID file.
The lock file is a normal file named by the attribute `path`.
A lock's PID file contains a single line of text, containing
the process ID (PID) of the process that acquired the lock.
>>> lock = PIDLockFile('somefile')
>>> lock = PIDLockFile('somefile')
FNc C s t j| |d|� | j| _d S )NF)r �__init__�pathZ unique_name)�selfr Zthreaded�timeout� r �!/usr/lib/python3.6/pidlockfile.pyr $ s zPIDLockFile.__init__c C s
t | j�S )z- Get the PID from the lock file.
)�read_pid_from_pidfiler )r
r r r �read_pid* s zPIDLockFile.read_pidc C s t jj| j�S )zv Test if the lock is currently held.
The lock is held if the PID file for this lock exists.
)�osr �exists)r
r r r � is_locked/ s zPIDLockFile.is_lockedc C s | j � otj� | j� kS )z� Test if the lock is held by the current process.
Returns ``True`` if the current process ID matches the
number stored in the PID file.
)r r �getpidr )r
r r r � i_am_locking7 s zPIDLockFile.i_am_lockingc C s� |dk r |n| j }tj� }|dk r2|dkr2||7 }x�yt| j� W n� tk
r� } zv|jtjkr�tj� |kr�|dk r�|dkr�td| j ��ntd| j ��tj |dk r�|d p�d� nt
d| j ��W Y dd}~X q4X dS q4W dS )z� Acquire the lock.
Creates the PID file for this lock, or raises an error if
the lock could not be acquired.
Nr z&Timeout waiting to acquire lock for %sz%s is already locked�
g�������?zfailed to create %s) r �time�write_pid_to_pidfiler �OSError�errnoZEEXISTr r Zsleepr )r
r Zend_time�excr r r �acquire? s$
zPIDLockFile.acquirec C s: | j � std| j ��| j� s,td| j ��t| j� dS )z� Release the lock.
Removes the PID file to release the lock, or raises an
error if the current process does not hold the lock.
z%s is not lockedz%s is locked, but not by meN)r r r r r �remove_existing_pidfile)r
r r r �release_ s
zPIDLockFile.releasec C s t | j� dS )z� Break an existing lock.
Removes the PID file if it already exists, otherwise does
nothing.
N)r r )r
r r r �
break_lockl s zPIDLockFile.break_lock)FN)N) �__name__�
__module__� __qualname__�__doc__r r r r r r r! r r r r r
s
r
c C sb d}yt | d�}W n tk
r& Y n8X |j� j� }y t|�}W n tk
rT Y nX |j� |S )z� Read the PID recorded in the named PID file.
Read and return the numeric PID recorded as text in the named
PID file. If the PID file cannot be read, or if the content is
not a valid PID, return ``None``.
N�r)�open�IOError�readline�strip�int�
ValueError�close)� pidfile_path�pid�pidfile�liner r r r v s r c C sR t jt jB t jB }d}t j| ||�}t j|d�}t j� }|jd| � |j� dS )u� Write the PID in the named PID file.
Get the numeric process ID (“PID”) of the current process
and write it to the named file as a line of text.
i� �wz%s
N) r �O_CREAT�O_EXCL�O_WRONLYr' �fdopenr �writer- )r. Z
open_flagsZ open_modeZ
pidfile_fdr0 r/ r r r r � s r c C sF yt j| � W n2 tk
r@ } z|jtjkr.n� W Y dd}~X nX dS )z� Remove the named PID file if it exists.
Removing a PID file that doesn't already exist puts us in the
desired state, so we ignore the condition if the file does not
exist.
N)r �remover r �ENOENT)r. r r r r r � s r )r% Z
__future__r r r r � r r r r r r r
r r r r r r r �<module>
s ]" pip/_vendor/pyparsing.py 0000644 00000665653 14751155150 0011407 0 ustar 00 # module pyparsing.py
#
# Copyright (c) 2003-2016 Paul T. McGuire
#
# Permission is hereby granted, free of charge, to any person obtaining
# a copy of this software and associated documentation files (the
# "Software"), to deal in the Software without restriction, including
# without limitation the rights to use, copy, modify, merge, publish,
# distribute, sublicense, and/or sell copies of the Software, and to
# permit persons to whom the Software is furnished to do so, subject to
# the following conditions:
#
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
#
__doc__ = \
"""
pyparsing module - Classes and methods to define and execute parsing grammars
The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you
don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.
Here is a program to parse "Hello, World!" (or any greeting of the form
C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
The program outputs the following::
Hello, World! -> ['Hello', ',', 'World', '!']
The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of '+', '|' and '^' operators.
The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
object with named attributes.
The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.)
- quoted strings
- embedded comments
"""
__version__ = "2.1.10"
__versionTime__ = "07 Oct 2016 01:31 UTC"
__author__ = "Paul McGuire <ptmcg@users.sourceforge.net>"
import string
from weakref import ref as wkref
import copy
import sys
import warnings
import re
import sre_constants
import collections
import pprint
import traceback
import types
from datetime import datetime
try:
from _thread import RLock
except ImportError:
from threading import RLock
try:
from collections import OrderedDict as _OrderedDict
except ImportError:
try:
from ordereddict import OrderedDict as _OrderedDict
except ImportError:
_OrderedDict = None
#~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) )
__all__ = [
'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty',
'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal',
'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or',
'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException',
'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException',
'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter',
'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore',
'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col',
'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString',
'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums',
'htmlComment', 'javaStyleComment', 'line', 'lineEnd', 'lineStart', 'lineno',
'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral',
'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables',
'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity',
'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd',
'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute',
'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation','locatedExpr', 'withClass',
'CloseMatch', 'tokenMap', 'pyparsing_common',
]
system_version = tuple(sys.version_info)[:3]
PY_3 = system_version[0] == 3
if PY_3:
_MAX_INT = sys.maxsize
basestring = str
unichr = chr
_ustr = str
# build list of single arg builtins, that can be used as parse actions
singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]
else:
_MAX_INT = sys.maxint
range = xrange
def _ustr(obj):
"""Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
then < returns the unicode object | encodes it with the default encoding | ... >.
"""
if isinstance(obj,unicode):
return obj
try:
# If this works, then _ustr(obj) has the same behaviour as str(obj), so
# it won't break any existing code.
return str(obj)
except UnicodeEncodeError:
# Else encode it
ret = unicode(obj).encode(sys.getdefaultencoding(), 'xmlcharrefreplace')
xmlcharref = Regex('&#\d+;')
xmlcharref.setParseAction(lambda t: '\\u' + hex(int(t[0][2:-1]))[2:])
return xmlcharref.transformString(ret)
# build list of single arg builtins, tolerant of Python version, that can be used as parse actions
singleArgBuiltins = []
import __builtin__
for fname in "sum len sorted reversed list tuple set any all min max".split():
try:
singleArgBuiltins.append(getattr(__builtin__,fname))
except AttributeError:
continue
_generatorType = type((y for y in range(1)))
def _xml_escape(data):
"""Escape &, <, >, ", ', etc. in a string of data."""
# ampersand must be replaced first
from_symbols = '&><"\''
to_symbols = ('&'+s+';' for s in "amp gt lt quot apos".split())
for from_,to_ in zip(from_symbols, to_symbols):
data = data.replace(from_, to_)
return data
class _Constants(object):
pass
alphas = string.ascii_uppercase + string.ascii_lowercase
nums = "0123456789"
hexnums = nums + "ABCDEFabcdef"
alphanums = alphas + nums
_bslash = chr(92)
printables = "".join(c for c in string.printable if c not in string.whitespace)
class ParseBaseException(Exception):
"""base exception class for all parsing runtime exceptions"""
# Performance tuning: we construct a *lot* of these, so keep this
# constructor as small and fast as possible
def __init__( self, pstr, loc=0, msg=None, elem=None ):
self.loc = loc
if msg is None:
self.msg = pstr
self.pstr = ""
else:
self.msg = msg
self.pstr = pstr
self.parserElement = elem
self.args = (pstr, loc, msg)
@classmethod
def _from_exception(cls, pe):
"""
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
"""
return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)
def __getattr__( self, aname ):
"""supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
"""
if( aname == "lineno" ):
return lineno( self.loc, self.pstr )
elif( aname in ("col", "column") ):
return col( self.loc, self.pstr )
elif( aname == "line" ):
return line( self.loc, self.pstr )
else:
raise AttributeError(aname)
def __str__( self ):
return "%s (at char %d), (line:%d, col:%d)" % \
( self.msg, self.loc, self.lineno, self.column )
def __repr__( self ):
return _ustr(self)
def markInputline( self, markerString = ">!<" ):
"""Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
"""
line_str = self.line
line_column = self.column - 1
if markerString:
line_str = "".join((line_str[:line_column],
markerString, line_str[line_column:]))
return line_str.strip()
def __dir__(self):
return "lineno col line".split() + dir(type(self))
class ParseException(ParseBaseException):
"""
Exception thrown when parse expressions don't match class;
supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
"""
pass
class ParseFatalException(ParseBaseException):
"""user-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediately"""
pass
class ParseSyntaxException(ParseFatalException):
"""just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been found"""
pass
#~ class ReparseException(ParseBaseException):
#~ """Experimental class - parse actions can raise this exception to cause
#~ pyparsing to reparse the input string:
#~ - with a modified input string, and/or
#~ - with a modified start location
#~ Set the values of the ReparseException in the constructor, and raise the
#~ exception in a parse action to cause pyparsing to use the new string/location.
#~ Setting the values as None causes no change to be made.
#~ """
#~ def __init_( self, newstring, restartLoc ):
#~ self.newParseText = newstring
#~ self.reparseLoc = restartLoc
class RecursiveGrammarException(Exception):
"""exception thrown by L{ParserElement.validate} if the grammar could be improperly recursive"""
def __init__( self, parseElementList ):
self.parseElementTrace = parseElementList
def __str__( self ):
return "RecursiveGrammarException: %s" % self.parseElementTrace
class _ParseResultsWithOffset(object):
def __init__(self,p1,p2):
self.tup = (p1,p2)
def __getitem__(self,i):
return self.tup[i]
def __repr__(self):
return repr(self.tup[0])
def setOffset(self,i):
self.tup = (self.tup[0],i)
class ParseResults(object):
"""
Structured parse results, to provide multiple means of access to the parsed data:
- as a list (C{len(results)})
- by list index (C{results[0], results[1]}, etc.)
- by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
"""
def __new__(cls, toklist=None, name=None, asList=True, modal=True ):
if isinstance(toklist, cls):
return toklist
retobj = object.__new__(cls)
retobj.__doinit = True
return retobj
# Performance tuning: we construct a *lot* of these, so keep this
# constructor as small and fast as possible
def __init__( self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance ):
if self.__doinit:
self.__doinit = False
self.__name = None
self.__parent = None
self.__accumNames = {}
self.__asList = asList
self.__modal = modal
if toklist is None:
toklist = []
if isinstance(toklist, list):
self.__toklist = toklist[:]
elif isinstance(toklist, _generatorType):
self.__toklist = list(toklist)
else:
self.__toklist = [toklist]
self.__tokdict = dict()
if name is not None and name:
if not modal:
self.__accumNames[name] = 0
if isinstance(name,int):
name = _ustr(name) # will always return a str, but use _ustr for consistency
self.__name = name
if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None,'',[])):
if isinstance(toklist,basestring):
toklist = [ toklist ]
if asList:
if isinstance(toklist,ParseResults):
self[name] = _ParseResultsWithOffset(toklist.copy(),0)
else:
self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]),0)
self[name].__name = name
else:
try:
self[name] = toklist[0]
except (KeyError,TypeError,IndexError):
self[name] = toklist
def __getitem__( self, i ):
if isinstance( i, (int,slice) ):
return self.__toklist[i]
else:
if i not in self.__accumNames:
return self.__tokdict[i][-1][0]
else:
return ParseResults([ v[0] for v in self.__tokdict[i] ])
def __setitem__( self, k, v, isinstance=isinstance ):
if isinstance(v,_ParseResultsWithOffset):
self.__tokdict[k] = self.__tokdict.get(k,list()) + [v]
sub = v[0]
elif isinstance(k,(int,slice)):
self.__toklist[k] = v
sub = v
else:
self.__tokdict[k] = self.__tokdict.get(k,list()) + [_ParseResultsWithOffset(v,0)]
sub = v
if isinstance(sub,ParseResults):
sub.__parent = wkref(self)
def __delitem__( self, i ):
if isinstance(i,(int,slice)):
mylen = len( self.__toklist )
del self.__toklist[i]
# convert int to slice
if isinstance(i, int):
if i < 0:
i += mylen
i = slice(i, i+1)
# get removed indices
removed = list(range(*i.indices(mylen)))
removed.reverse()
# fixup indices in token dictionary
for name,occurrences in self.__tokdict.items():
for j in removed:
for k, (value, position) in enumerate(occurrences):
occurrences[k] = _ParseResultsWithOffset(value, position - (position > j))
else:
del self.__tokdict[i]
def __contains__( self, k ):
return k in self.__tokdict
def __len__( self ): return len( self.__toklist )
def __bool__(self): return ( not not self.__toklist )
__nonzero__ = __bool__
def __iter__( self ): return iter( self.__toklist )
def __reversed__( self ): return iter( self.__toklist[::-1] )
def _iterkeys( self ):
if hasattr(self.__tokdict, "iterkeys"):
return self.__tokdict.iterkeys()
else:
return iter(self.__tokdict)
def _itervalues( self ):
return (self[k] for k in self._iterkeys())
def _iteritems( self ):
return ((k, self[k]) for k in self._iterkeys())
if PY_3:
keys = _iterkeys
"""Returns an iterator of all named result keys (Python 3.x only)."""
values = _itervalues
"""Returns an iterator of all named result values (Python 3.x only)."""
items = _iteritems
"""Returns an iterator of all named result key-value tuples (Python 3.x only)."""
else:
iterkeys = _iterkeys
"""Returns an iterator of all named result keys (Python 2.x only)."""
itervalues = _itervalues
"""Returns an iterator of all named result values (Python 2.x only)."""
iteritems = _iteritems
"""Returns an iterator of all named result key-value tuples (Python 2.x only)."""
def keys( self ):
"""Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x)."""
return list(self.iterkeys())
def values( self ):
"""Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x)."""
return list(self.itervalues())
def items( self ):
"""Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x)."""
return list(self.iteritems())
def haskeys( self ):
"""Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names."""
return bool(self.__tokdict)
def pop( self, *args, **kwargs):
"""
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
"""
if not args:
args = [-1]
for k,v in kwargs.items():
if k == 'default':
args = (args[0], v)
else:
raise TypeError("pop() got an unexpected keyword argument '%s'" % k)
if (isinstance(args[0], int) or
len(args) == 1 or
args[0] in self):
index = args[0]
ret = self[index]
del self[index]
return ret
else:
defaultvalue = args[1]
return defaultvalue
def get(self, key, defaultValue=None):
"""
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
"""
if key in self:
return self[key]
else:
return defaultValue
def insert( self, index, insStr ):
"""
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
"""
self.__toklist.insert(index, insStr)
# fixup indices in token dictionary
for name,occurrences in self.__tokdict.items():
for k, (value, position) in enumerate(occurrences):
occurrences[k] = _ParseResultsWithOffset(value, position + (position > index))
def append( self, item ):
"""
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
"""
self.__toklist.append(item)
def extend( self, itemseq ):
"""
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
"""
if isinstance(itemseq, ParseResults):
self += itemseq
else:
self.__toklist.extend(itemseq)
def clear( self ):
"""
Clear all elements and results names.
"""
del self.__toklist[:]
self.__tokdict.clear()
def __getattr__( self, name ):
try:
return self[name]
except KeyError:
return ""
if name in self.__tokdict:
if name not in self.__accumNames:
return self.__tokdict[name][-1][0]
else:
return ParseResults([ v[0] for v in self.__tokdict[name] ])
else:
return ""
def __add__( self, other ):
ret = self.copy()
ret += other
return ret
def __iadd__( self, other ):
if other.__tokdict:
offset = len(self.__toklist)
addoffset = lambda a: offset if a<0 else a+offset
otheritems = other.__tokdict.items()
otherdictitems = [(k, _ParseResultsWithOffset(v[0],addoffset(v[1])) )
for (k,vlist) in otheritems for v in vlist]
for k,v in otherdictitems:
self[k] = v
if isinstance(v[0],ParseResults):
v[0].__parent = wkref(self)
self.__toklist += other.__toklist
self.__accumNames.update( other.__accumNames )
return self
def __radd__(self, other):
if isinstance(other,int) and other == 0:
# useful for merging many ParseResults using sum() builtin
return self.copy()
else:
# this may raise a TypeError - so be it
return other + self
def __repr__( self ):
return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) )
def __str__( self ):
return '[' + ', '.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + ']'
def _asStringList( self, sep='' ):
out = []
for item in self.__toklist:
if out and sep:
out.append(sep)
if isinstance( item, ParseResults ):
out += item._asStringList()
else:
out.append( _ustr(item) )
return out
def asList( self ):
"""
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
"""
return [res.asList() if isinstance(res,ParseResults) else res for res in self.__toklist]
def asDict( self ):
"""
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
"""
if PY_3:
item_fn = self.items
else:
item_fn = self.iteritems
def toItem(obj):
if isinstance(obj, ParseResults):
if obj.haskeys():
return obj.asDict()
else:
return [toItem(v) for v in obj]
else:
return obj
return dict((k,toItem(v)) for k,v in item_fn())
def copy( self ):
"""
Returns a new copy of a C{ParseResults} object.
"""
ret = ParseResults( self.__toklist )
ret.__tokdict = self.__tokdict.copy()
ret.__parent = self.__parent
ret.__accumNames.update( self.__accumNames )
ret.__name = self.__name
return ret
def asXML( self, doctag=None, namedItemsOnly=False, indent="", formatted=True ):
"""
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
"""
nl = "\n"
out = []
namedItems = dict((v[1],k) for (k,vlist) in self.__tokdict.items()
for v in vlist)
nextLevelIndent = indent + " "
# collapse out indents if formatting is not desired
if not formatted:
indent = ""
nextLevelIndent = ""
nl = ""
selfTag = None
if doctag is not None:
selfTag = doctag
else:
if self.__name:
selfTag = self.__name
if not selfTag:
if namedItemsOnly:
return ""
else:
selfTag = "ITEM"
out += [ nl, indent, "<", selfTag, ">" ]
for i,res in enumerate(self.__toklist):
if isinstance(res,ParseResults):
if i in namedItems:
out += [ res.asXML(namedItems[i],
namedItemsOnly and doctag is None,
nextLevelIndent,
formatted)]
else:
out += [ res.asXML(None,
namedItemsOnly and doctag is None,
nextLevelIndent,
formatted)]
else:
# individual token, see if there is a name for it
resTag = None
if i in namedItems:
resTag = namedItems[i]
if not resTag:
if namedItemsOnly:
continue
else:
resTag = "ITEM"
xmlBodyText = _xml_escape(_ustr(res))
out += [ nl, nextLevelIndent, "<", resTag, ">",
xmlBodyText,
"</", resTag, ">" ]
out += [ nl, indent, "</", selfTag, ">" ]
return "".join(out)
def __lookup(self,sub):
for k,vlist in self.__tokdict.items():
for v,loc in vlist:
if sub is v:
return k
return None
def getName(self):
"""
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
"""
if self.__name:
return self.__name
elif self.__parent:
par = self.__parent()
if par:
return par.__lookup(self)
else:
return None
elif (len(self) == 1 and
len(self.__tokdict) == 1 and
next(iter(self.__tokdict.values()))[0][1] in (0,-1)):
return next(iter(self.__tokdict.keys()))
else:
return None
def dump(self, indent='', depth=0, full=True):
"""
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
"""
out = []
NL = '\n'
out.append( indent+_ustr(self.asList()) )
if full:
if self.haskeys():
items = sorted((str(k), v) for k,v in self.items())
for k,v in items:
if out:
out.append(NL)
out.append( "%s%s- %s: " % (indent,(' '*depth), k) )
if isinstance(v,ParseResults):
if v:
out.append( v.dump(indent,depth+1) )
else:
out.append(_ustr(v))
else:
out.append(repr(v))
elif any(isinstance(vv,ParseResults) for vv in self):
v = self
for i,vv in enumerate(v):
if isinstance(vv,ParseResults):
out.append("\n%s%s[%d]:\n%s%s%s" % (indent,(' '*(depth)),i,indent,(' '*(depth+1)),vv.dump(indent,depth+1) ))
else:
out.append("\n%s%s[%d]:\n%s%s%s" % (indent,(' '*(depth)),i,indent,(' '*(depth+1)),_ustr(vv)))
return "".join(out)
def pprint(self, *args, **kwargs):
"""
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
"""
pprint.pprint(self.asList(), *args, **kwargs)
# add support for pickle protocol
def __getstate__(self):
return ( self.__toklist,
( self.__tokdict.copy(),
self.__parent is not None and self.__parent() or None,
self.__accumNames,
self.__name ) )
def __setstate__(self,state):
self.__toklist = state[0]
(self.__tokdict,
par,
inAccumNames,
self.__name) = state[1]
self.__accumNames = {}
self.__accumNames.update(inAccumNames)
if par is not None:
self.__parent = wkref(par)
else:
self.__parent = None
def __getnewargs__(self):
return self.__toklist, self.__name, self.__asList, self.__modal
def __dir__(self):
return (dir(type(self)) + list(self.keys()))
collections.MutableMapping.register(ParseResults)
def col (loc,strg):
"""Returns current column within a string, counting newlines as line separators.
The first column is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
"""
s = strg
return 1 if 0<loc<len(s) and s[loc-1] == '\n' else loc - s.rfind("\n", 0, loc)
def lineno(loc,strg):
"""Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
"""
return strg.count("\n",0,loc) + 1
def line( loc, strg ):
"""Returns the line of text containing loc within a string, counting newlines as line separators.
"""
lastCR = strg.rfind("\n", 0, loc)
nextCR = strg.find("\n", loc)
if nextCR >= 0:
return strg[lastCR+1:nextCR]
else:
return strg[lastCR+1:]
def _defaultStartDebugAction( instring, loc, expr ):
print (("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )))
def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ):
print ("Matched " + _ustr(expr) + " -> " + str(toks.asList()))
def _defaultExceptionDebugAction( instring, loc, expr, exc ):
print ("Exception raised:" + _ustr(exc))
def nullDebugAction(*args):
"""'Do-nothing' debug action, to suppress debugging output during parsing."""
pass
# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
#~ 'decorator to trim function calls to match the arity of the target'
#~ def _trim_arity(func, maxargs=3):
#~ if func in singleArgBuiltins:
#~ return lambda s,l,t: func(t)
#~ limit = 0
#~ foundArity = False
#~ def wrapper(*args):
#~ nonlocal limit,foundArity
#~ while 1:
#~ try:
#~ ret = func(*args[limit:])
#~ foundArity = True
#~ return ret
#~ except TypeError:
#~ if limit == maxargs or foundArity:
#~ raise
#~ limit += 1
#~ continue
#~ return wrapper
# this version is Python 2.x-3.x cross-compatible
'decorator to trim function calls to match the arity of the target'
def _trim_arity(func, maxargs=2):
if func in singleArgBuiltins:
return lambda s,l,t: func(t)
limit = [0]
foundArity = [False]
# traceback return data structure changed in Py3.5 - normalize back to plain tuples
if system_version[:2] >= (3,5):
def extract_stack(limit=0):
# special handling for Python 3.5.0 - extra deep call stack by 1
offset = -3 if system_version == (3,5,0) else -2
frame_summary = traceback.extract_stack(limit=-offset+limit-1)[offset]
return [(frame_summary.filename, frame_summary.lineno)]
def extract_tb(tb, limit=0):
frames = traceback.extract_tb(tb, limit=limit)
frame_summary = frames[-1]
return [(frame_summary.filename, frame_summary.lineno)]
else:
extract_stack = traceback.extract_stack
extract_tb = traceback.extract_tb
# synthesize what would be returned by traceback.extract_stack at the call to
# user's parse action 'func', so that we don't incur call penalty at parse time
LINE_DIFF = 6
# IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND
# THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
this_line = extract_stack(limit=2)[-1]
pa_call_line_synth = (this_line[0], this_line[1]+LINE_DIFF)
def wrapper(*args):
while 1:
try:
ret = func(*args[limit[0]:])
foundArity[0] = True
return ret
except TypeError:
# re-raise TypeErrors if they did not come from our arity testing
if foundArity[0]:
raise
else:
try:
tb = sys.exc_info()[-1]
if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
raise
finally:
del tb
if limit[0] <= maxargs:
limit[0] += 1
continue
raise
# copy func name to wrapper for sensible debug output
func_name = "<parse action>"
try:
func_name = getattr(func, '__name__',
getattr(func, '__class__').__name__)
except Exception:
func_name = str(func)
wrapper.__name__ = func_name
return wrapper
class ParserElement(object):
"""Abstract base level parser element class."""
DEFAULT_WHITE_CHARS = " \n\t\r"
verbose_stacktrace = False
@staticmethod
def setDefaultWhitespaceChars( chars ):
r"""
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
"""
ParserElement.DEFAULT_WHITE_CHARS = chars
@staticmethod
def inlineLiteralsUsing(cls):
"""
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
"""
ParserElement._literalStringClass = cls
def __init__( self, savelist=False ):
self.parseAction = list()
self.failAction = None
#~ self.name = "<unknown>" # don't define self.name, let subclasses try/except upcall
self.strRepr = None
self.resultsName = None
self.saveAsList = savelist
self.skipWhitespace = True
self.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
self.copyDefaultWhiteChars = True
self.mayReturnEmpty = False # used when checking for left-recursion
self.keepTabs = False
self.ignoreExprs = list()
self.debug = False
self.streamlined = False
self.mayIndexError = True # used to optimize exception handling for subclasses that don't advance parse index
self.errmsg = ""
self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
self.debugActions = ( None, None, None ) #custom debug actions
self.re = None
self.callPreparse = True # used to avoid redundant calls to preParse
self.callDuringTry = False
def copy( self ):
"""
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
"""
cpy = copy.copy( self )
cpy.parseAction = self.parseAction[:]
cpy.ignoreExprs = self.ignoreExprs[:]
if self.copyDefaultWhiteChars:
cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
return cpy
def setName( self, name ):
"""
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
"""
self.name = name
self.errmsg = "Expected " + self.name
if hasattr(self,"exception"):
self.exception.msg = self.errmsg
return self
def setResultsName( self, name, listAllMatches=False ):
"""
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
NOTE: this returns a *copy* of the original C{ParserElement} object;
this is so that the client can define a basic element, such as an
integer, and reference it in multiple places with different names.
You can also set results names using the abbreviated syntax,
C{expr("name")} in place of C{expr.setResultsName("name")} -
see L{I{__call__}<__call__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
"""
newself = self.copy()
if name.endswith("*"):
name = name[:-1]
listAllMatches=True
newself.resultsName = name
newself.modalResults = not listAllMatches
return newself
def setBreak(self,breakFlag = True):
"""Method to invoke the Python pdb debugger when this element is
about to be parsed. Set C{breakFlag} to True to enable, False to
disable.
"""
if breakFlag:
_parseMethod = self._parse
def breaker(instring, loc, doActions=True, callPreParse=True):
import pdb
pdb.set_trace()
return _parseMethod( instring, loc, doActions, callPreParse )
breaker._originalParseMethod = _parseMethod
self._parse = breaker
else:
if hasattr(self._parse,"_originalParseMethod"):
self._parse = self._parse._originalParseMethod
return self
def setParseAction( self, *fns, **kwargs ):
"""
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
"""
self.parseAction = list(map(_trim_arity, list(fns)))
self.callDuringTry = kwargs.get("callDuringTry", False)
return self
def addParseAction( self, *fns, **kwargs ):
"""
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
"""
self.parseAction += list(map(_trim_arity, list(fns)))
self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
return self
def addCondition(self, *fns, **kwargs):
"""Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
"""
msg = kwargs.get("message", "failed user-defined condition")
exc_type = ParseFatalException if kwargs.get("fatal", False) else ParseException
for fn in fns:
def pa(s,l,t):
if not bool(_trim_arity(fn)(s,l,t)):
raise exc_type(s,l,msg)
self.parseAction.append(pa)
self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
return self
def setFailAction( self, fn ):
"""Define action to perform if parsing fails at this expression.
Fail acton fn is a callable function that takes the arguments
C{fn(s,loc,expr,err)} where:
- s = string being parsed
- loc = location where expression match was attempted and failed
- expr = the parse expression that failed
- err = the exception thrown
The function returns no value. It may throw C{L{ParseFatalException}}
if it is desired to stop parsing immediately."""
self.failAction = fn
return self
def _skipIgnorables( self, instring, loc ):
exprsFound = True
while exprsFound:
exprsFound = False
for e in self.ignoreExprs:
try:
while 1:
loc,dummy = e._parse( instring, loc )
exprsFound = True
except ParseException:
pass
return loc
def preParse( self, instring, loc ):
if self.ignoreExprs:
loc = self._skipIgnorables( instring, loc )
if self.skipWhitespace:
wt = self.whiteChars
instrlen = len(instring)
while loc < instrlen and instring[loc] in wt:
loc += 1
return loc
def parseImpl( self, instring, loc, doActions=True ):
return loc, []
def postParse( self, instring, loc, tokenlist ):
return tokenlist
#~ @profile
def _parseNoCache( self, instring, loc, doActions=True, callPreParse=True ):
debugging = ( self.debug ) #and doActions )
if debugging or self.failAction:
#~ print ("Match",self,"at loc",loc,"(%d,%d)" % ( lineno(loc,instring), col(loc,instring) ))
if (self.debugActions[0] ):
self.debugActions[0]( instring, loc, self )
if callPreParse and self.callPreparse:
preloc = self.preParse( instring, loc )
else:
preloc = loc
tokensStart = preloc
try:
try:
loc,tokens = self.parseImpl( instring, preloc, doActions )
except IndexError:
raise ParseException( instring, len(instring), self.errmsg, self )
except ParseBaseException as err:
#~ print ("Exception raised:", err)
if self.debugActions[2]:
self.debugActions[2]( instring, tokensStart, self, err )
if self.failAction:
self.failAction( instring, tokensStart, self, err )
raise
else:
if callPreParse and self.callPreparse:
preloc = self.preParse( instring, loc )
else:
preloc = loc
tokensStart = preloc
if self.mayIndexError or loc >= len(instring):
try:
loc,tokens = self.parseImpl( instring, preloc, doActions )
except IndexError:
raise ParseException( instring, len(instring), self.errmsg, self )
else:
loc,tokens = self.parseImpl( instring, preloc, doActions )
tokens = self.postParse( instring, loc, tokens )
retTokens = ParseResults( tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults )
if self.parseAction and (doActions or self.callDuringTry):
if debugging:
try:
for fn in self.parseAction:
tokens = fn( instring, tokensStart, retTokens )
if tokens is not None:
retTokens = ParseResults( tokens,
self.resultsName,
asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
modal=self.modalResults )
except ParseBaseException as err:
#~ print "Exception raised in user parse action:", err
if (self.debugActions[2] ):
self.debugActions[2]( instring, tokensStart, self, err )
raise
else:
for fn in self.parseAction:
tokens = fn( instring, tokensStart, retTokens )
if tokens is not None:
retTokens = ParseResults( tokens,
self.resultsName,
asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
modal=self.modalResults )
if debugging:
#~ print ("Matched",self,"->",retTokens.asList())
if (self.debugActions[1] ):
self.debugActions[1]( instring, tokensStart, loc, self, retTokens )
return loc, retTokens
def tryParse( self, instring, loc ):
try:
return self._parse( instring, loc, doActions=False )[0]
except ParseFatalException:
raise ParseException( instring, loc, self.errmsg, self)
def canParseNext(self, instring, loc):
try:
self.tryParse(instring, loc)
except (ParseException, IndexError):
return False
else:
return True
class _UnboundedCache(object):
def __init__(self):
cache = {}
self.not_in_cache = not_in_cache = object()
def get(self, key):
return cache.get(key, not_in_cache)
def set(self, key, value):
cache[key] = value
def clear(self):
cache.clear()
self.get = types.MethodType(get, self)
self.set = types.MethodType(set, self)
self.clear = types.MethodType(clear, self)
if _OrderedDict is not None:
class _FifoCache(object):
def __init__(self, size):
self.not_in_cache = not_in_cache = object()
cache = _OrderedDict()
def get(self, key):
return cache.get(key, not_in_cache)
def set(self, key, value):
cache[key] = value
if len(cache) > size:
cache.popitem(False)
def clear(self):
cache.clear()
self.get = types.MethodType(get, self)
self.set = types.MethodType(set, self)
self.clear = types.MethodType(clear, self)
else:
class _FifoCache(object):
def __init__(self, size):
self.not_in_cache = not_in_cache = object()
cache = {}
key_fifo = collections.deque([], size)
def get(self, key):
return cache.get(key, not_in_cache)
def set(self, key, value):
cache[key] = value
if len(cache) > size:
cache.pop(key_fifo.popleft(), None)
key_fifo.append(key)
def clear(self):
cache.clear()
key_fifo.clear()
self.get = types.MethodType(get, self)
self.set = types.MethodType(set, self)
self.clear = types.MethodType(clear, self)
# argument cache for optimizing repeated calls when backtracking through recursive expressions
packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn't fail
packrat_cache_lock = RLock()
packrat_cache_stats = [0, 0]
# this method gets repeatedly called during backtracking with the same arguments -
# we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
def _parseCache( self, instring, loc, doActions=True, callPreParse=True ):
HIT, MISS = 0, 1
lookup = (self, instring, loc, callPreParse, doActions)
with ParserElement.packrat_cache_lock:
cache = ParserElement.packrat_cache
value = cache.get(lookup)
if value is cache.not_in_cache:
ParserElement.packrat_cache_stats[MISS] += 1
try:
value = self._parseNoCache(instring, loc, doActions, callPreParse)
except ParseBaseException as pe:
# cache a copy of the exception, without the traceback
cache.set(lookup, pe.__class__(*pe.args))
raise
else:
cache.set(lookup, (value[0], value[1].copy()))
return value
else:
ParserElement.packrat_cache_stats[HIT] += 1
if isinstance(value, Exception):
raise value
return (value[0], value[1].copy())
_parse = _parseNoCache
@staticmethod
def resetCache():
ParserElement.packrat_cache.clear()
ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)
_packratEnabled = False
@staticmethod
def enablePackrat(cache_size_limit=128):
"""Enables "packrat" parsing, which adds memoizing to the parsing logic.
Repeated parse attempts at the same string location (which happens
often in many complex grammars) can immediately return a cached value,
instead of re-executing parsing/validating code. Memoizing is done of
both valid results and parsing exceptions.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "compile as you go", you must call
C{enablePackrat} before calling C{psyco.full()}. If you do not do this,
Python will crash. For best results, call C{enablePackrat()} immediately
after importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
"""
if not ParserElement._packratEnabled:
ParserElement._packratEnabled = True
if cache_size_limit is None:
ParserElement.packrat_cache = ParserElement._UnboundedCache()
else:
ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
ParserElement._parse = ParserElement._parseCache
def parseString( self, instring, parseAll=False ):
"""
Execute the parse expression with the given string.
This is the main interface to the client code, once the complete
expression has been built.
If you want the grammar to require that the entire input string be
successfully parsed, then set C{parseAll} to True (equivalent to ending
the grammar with C{L{StringEnd()}}).
Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
in order to report proper column numbers in parse actions.
If the input string contains tabs and
the grammar uses parse actions that use the C{loc} argument to index into the
string being parsed, you can ensure you have a consistent view of the input
string by:
- calling C{parseWithTabs} on your grammar before calling C{parseString}
(see L{I{parseWithTabs}<parseWithTabs>})
- define your parse action using the full C{(s,loc,toks)} signature, and
reference the input string using the parse action's C{s} argument
- explictly expand the tabs in your input string before calling
C{parseString}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
"""
ParserElement.resetCache()
if not self.streamlined:
self.streamline()
#~ self.saveAsList = True
for e in self.ignoreExprs:
e.streamline()
if not self.keepTabs:
instring = instring.expandtabs()
try:
loc, tokens = self._parse( instring, 0 )
if parseAll:
loc = self.preParse( instring, loc )
se = Empty() + StringEnd()
se._parse( instring, loc )
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
else:
return tokens
def scanString( self, instring, maxMatches=_MAX_INT, overlap=False ):
"""
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
C{maxMatches} argument, to clip scanning after 'n' matches are found. If
C{overlap} is specified, then overlapping matches will be reported.
Note that the start and end locations are reported relative to the string
being parsed. See L{I{parseString}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
"""
if not self.streamlined:
self.streamline()
for e in self.ignoreExprs:
e.streamline()
if not self.keepTabs:
instring = _ustr(instring).expandtabs()
instrlen = len(instring)
loc = 0
preparseFn = self.preParse
parseFn = self._parse
ParserElement.resetCache()
matches = 0
try:
while loc <= instrlen and matches < maxMatches:
try:
preloc = preparseFn( instring, loc )
nextLoc,tokens = parseFn( instring, preloc, callPreParse=False )
except ParseException:
loc = preloc+1
else:
if nextLoc > loc:
matches += 1
yield tokens, preloc, nextLoc
if overlap:
nextloc = preparseFn( instring, loc )
if nextloc > loc:
loc = nextLoc
else:
loc += 1
else:
loc = nextLoc
else:
loc = preloc+1
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def transformString( self, instring ):
"""
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
"""
out = []
lastE = 0
# force preservation of <TAB>s, to minimize unwanted transformation of string, and to
# keep string locs straight between transformString and scanString
self.keepTabs = True
try:
for t,s,e in self.scanString( instring ):
out.append( instring[lastE:s] )
if t:
if isinstance(t,ParseResults):
out += t.asList()
elif isinstance(t,list):
out += t
else:
out.append(t)
lastE = e
out.append(instring[lastE:])
out = [o for o in out if o]
return "".join(map(_ustr,_flatten(out)))
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def searchString( self, instring, maxMatches=_MAX_INT ):
"""
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
"""
try:
return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ])
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
"""
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
"""
splits = 0
last = 0
for t,s,e in self.scanString(instring, maxMatches=maxsplit):
yield instring[last:s]
if includeSeparators:
yield t[0]
last = e
yield instring[last:]
def __add__(self, other ):
"""
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return And( [ self, other ] )
def __radd__(self, other ):
"""
Implementation of + operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other + self
def __sub__(self, other):
"""
Implementation of - operator, returns C{L{And}} with error stop
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return And( [ self, And._ErrorStop(), other ] )
def __rsub__(self, other ):
"""
Implementation of - operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other - self
def __mul__(self,other):
"""
Implementation of * operator, allows use of C{expr * 3} in place of
C{expr + expr + expr}. Expressions may also me multiplied by a 2-integer
tuple, similar to C{{min,max}} multipliers in regular expressions. Tuples
may also include C{None} as in:
- C{expr*(n,None)} or C{expr*(n,)} is equivalent
to C{expr*n + L{ZeroOrMore}(expr)}
(read as "at least n instances of C{expr}")
- C{expr*(None,n)} is equivalent to C{expr*(0,n)}
(read as "0 to n instances of C{expr}")
- C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
- C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
Note that C{expr*(None,n)} does not raise an exception if
more than n exprs exist in the input stream; that is,
C{expr*(None,n)} does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
C{expr*(None,n) + ~expr}
"""
if isinstance(other,int):
minElements, optElements = other,0
elif isinstance(other,tuple):
other = (other + (None, None))[:2]
if other[0] is None:
other = (0, other[1])
if isinstance(other[0],int) and other[1] is None:
if other[0] == 0:
return ZeroOrMore(self)
if other[0] == 1:
return OneOrMore(self)
else:
return self*other[0] + ZeroOrMore(self)
elif isinstance(other[0],int) and isinstance(other[1],int):
minElements, optElements = other
optElements -= minElements
else:
raise TypeError("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1]))
else:
raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other))
if minElements < 0:
raise ValueError("cannot multiply ParserElement by negative value")
if optElements < 0:
raise ValueError("second tuple value must be greater or equal to first tuple value")
if minElements == optElements == 0:
raise ValueError("cannot multiply ParserElement by 0 or (0,0)")
if (optElements):
def makeOptionalList(n):
if n>1:
return Optional(self + makeOptionalList(n-1))
else:
return Optional(self)
if minElements:
if minElements == 1:
ret = self + makeOptionalList(optElements)
else:
ret = And([self]*minElements) + makeOptionalList(optElements)
else:
ret = makeOptionalList(optElements)
else:
if minElements == 1:
ret = self
else:
ret = And([self]*minElements)
return ret
def __rmul__(self, other):
return self.__mul__(other)
def __or__(self, other ):
"""
Implementation of | operator - returns C{L{MatchFirst}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return MatchFirst( [ self, other ] )
def __ror__(self, other ):
"""
Implementation of | operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other | self
def __xor__(self, other ):
"""
Implementation of ^ operator - returns C{L{Or}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return Or( [ self, other ] )
def __rxor__(self, other ):
"""
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other ^ self
def __and__(self, other ):
"""
Implementation of & operator - returns C{L{Each}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return Each( [ self, other ] )
def __rand__(self, other ):
"""
Implementation of & operator when left operand is not a C{L{ParserElement}}
"""
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
if not isinstance( other, ParserElement ):
warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
SyntaxWarning, stacklevel=2)
return None
return other & self
def __invert__( self ):
"""
Implementation of ~ operator - returns C{L{NotAny}}
"""
return NotAny( self )
def __call__(self, name=None):
"""
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
"""
if name is not None:
return self.setResultsName(name)
else:
return self.copy()
def suppress( self ):
"""
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
"""
return Suppress( self )
def leaveWhitespace( self ):
"""
Disables the skipping of whitespace before matching the characters in the
C{ParserElement}'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
"""
self.skipWhitespace = False
return self
def setWhitespaceChars( self, chars ):
"""
Overrides the default whitespace chars
"""
self.skipWhitespace = True
self.whiteChars = chars
self.copyDefaultWhiteChars = False
return self
def parseWithTabs( self ):
"""
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
"""
self.keepTabs = True
return self
def ignore( self, other ):
"""
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
"""
if isinstance(other, basestring):
other = Suppress(other)
if isinstance( other, Suppress ):
if other not in self.ignoreExprs:
self.ignoreExprs.append(other)
else:
self.ignoreExprs.append( Suppress( other.copy() ) )
return self
def setDebugActions( self, startAction, successAction, exceptionAction ):
"""
Enable display of debugging messages while doing pattern matching.
"""
self.debugActions = (startAction or _defaultStartDebugAction,
successAction or _defaultSuccessDebugAction,
exceptionAction or _defaultExceptionDebugAction)
self.debug = True
return self
def setDebug( self, flag=True ):
"""
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
"""
if flag:
self.setDebugActions( _defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction )
else:
self.debug = False
return self
def __str__( self ):
return self.name
def __repr__( self ):
return _ustr(self)
def streamline( self ):
self.streamlined = True
self.strRepr = None
return self
def checkRecursion( self, parseElementList ):
pass
def validate( self, validateTrace=[] ):
"""
Check defined expressions for valid structure, check for infinite recursive definitions.
"""
self.checkRecursion( [] )
def parseFile( self, file_or_filename, parseAll=False ):
"""
Execute the parse expression on the given file or filename.
If a filename is specified (instead of a file object),
the entire file is opened, read, and closed before parsing.
"""
try:
file_contents = file_or_filename.read()
except AttributeError:
with open(file_or_filename, "r") as f:
file_contents = f.read()
try:
return self.parseString(file_contents, parseAll)
except ParseBaseException as exc:
if ParserElement.verbose_stacktrace:
raise
else:
# catch and re-raise exception from here, clears out pyparsing internal stack trace
raise exc
def __eq__(self,other):
if isinstance(other, ParserElement):
return self is other or vars(self) == vars(other)
elif isinstance(other, basestring):
return self.matches(other)
else:
return super(ParserElement,self)==other
def __ne__(self,other):
return not (self == other)
def __hash__(self):
return hash(id(self))
def __req__(self,other):
return self == other
def __rne__(self,other):
return not (self == other)
def matches(self, testString, parseAll=True):
"""
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
"""
try:
self.parseString(_ustr(testString), parseAll=parseAll)
return True
except ParseBaseException:
return False
def runTests(self, tests, parseAll=True, comment='#', fullDump=True, printResults=True, failureTests=False):
"""
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\\n of strings that spans \\n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
"""
if isinstance(tests, basestring):
tests = list(map(str.strip, tests.rstrip().splitlines()))
if isinstance(comment, basestring):
comment = Literal(comment)
allResults = []
comments = []
success = True
for t in tests:
if comment is not None and comment.matches(t, False) or comments and not t:
comments.append(t)
continue
if not t:
continue
out = ['\n'.join(comments), t]
comments = []
try:
t = t.replace(r'\n','\n')
result = self.parseString(t, parseAll=parseAll)
out.append(result.dump(full=fullDump))
success = success and not failureTests
except ParseBaseException as pe:
fatal = "(FATAL)" if isinstance(pe, ParseFatalException) else ""
if '\n' in t:
out.append(line(pe.loc, t))
out.append(' '*(col(pe.loc,t)-1) + '^' + fatal)
else:
out.append(' '*pe.loc + '^' + fatal)
out.append("FAIL: " + str(pe))
success = success and failureTests
result = pe
except Exception as exc:
out.append("FAIL-EXCEPTION: " + str(exc))
success = success and failureTests
result = exc
if printResults:
if fullDump:
out.append('')
print('\n'.join(out))
allResults.append((t, result))
return success, allResults
class Token(ParserElement):
"""
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
"""
def __init__( self ):
super(Token,self).__init__( savelist=False )
class Empty(Token):
"""
An empty token, will always match.
"""
def __init__( self ):
super(Empty,self).__init__()
self.name = "Empty"
self.mayReturnEmpty = True
self.mayIndexError = False
class NoMatch(Token):
"""
A token that will never match.
"""
def __init__( self ):
super(NoMatch,self).__init__()
self.name = "NoMatch"
self.mayReturnEmpty = True
self.mayIndexError = False
self.errmsg = "Unmatchable token"
def parseImpl( self, instring, loc, doActions=True ):
raise ParseException(instring, loc, self.errmsg, self)
class Literal(Token):
"""
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
"""
def __init__( self, matchString ):
super(Literal,self).__init__()
self.match = matchString
self.matchLen = len(matchString)
try:
self.firstMatchChar = matchString[0]
except IndexError:
warnings.warn("null string passed to Literal; use Empty() instead",
SyntaxWarning, stacklevel=2)
self.__class__ = Empty
self.name = '"%s"' % _ustr(self.match)
self.errmsg = "Expected " + self.name
self.mayReturnEmpty = False
self.mayIndexError = False
# Performance tuning: this routine gets called a *lot*
# if this is a single character match string and the first character matches,
# short-circuit as quickly as possible, and avoid calling startswith
#~ @profile
def parseImpl( self, instring, loc, doActions=True ):
if (instring[loc] == self.firstMatchChar and
(self.matchLen==1 or instring.startswith(self.match,loc)) ):
return loc+self.matchLen, self.match
raise ParseException(instring, loc, self.errmsg, self)
_L = Literal
ParserElement._literalStringClass = Literal
class Keyword(Token):
"""
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
Accepts two optional constructor arguments in addition to the keyword string:
- C{identChars} is a string of characters that would be valid identifier characters,
defaulting to all alphanumerics + "_" and "$"
- C{caseless} allows case-insensitive matching, default is C{False}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
"""
DEFAULT_KEYWORD_CHARS = alphanums+"_$"
def __init__( self, matchString, identChars=None, caseless=False ):
super(Keyword,self).__init__()
if identChars is None:
identChars = Keyword.DEFAULT_KEYWORD_CHARS
self.match = matchString
self.matchLen = len(matchString)
try:
self.firstMatchChar = matchString[0]
except IndexError:
warnings.warn("null string passed to Keyword; use Empty() instead",
SyntaxWarning, stacklevel=2)
self.name = '"%s"' % self.match
self.errmsg = "Expected " + self.name
self.mayReturnEmpty = False
self.mayIndexError = False
self.caseless = caseless
if caseless:
self.caselessmatch = matchString.upper()
identChars = identChars.upper()
self.identChars = set(identChars)
def parseImpl( self, instring, loc, doActions=True ):
if self.caseless:
if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
(loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) and
(loc == 0 or instring[loc-1].upper() not in self.identChars) ):
return loc+self.matchLen, self.match
else:
if (instring[loc] == self.firstMatchChar and
(self.matchLen==1 or instring.startswith(self.match,loc)) and
(loc >= len(instring)-self.matchLen or instring[loc+self.matchLen] not in self.identChars) and
(loc == 0 or instring[loc-1] not in self.identChars) ):
return loc+self.matchLen, self.match
raise ParseException(instring, loc, self.errmsg, self)
def copy(self):
c = super(Keyword,self).copy()
c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
return c
@staticmethod
def setDefaultKeywordChars( chars ):
"""Overrides the default Keyword chars
"""
Keyword.DEFAULT_KEYWORD_CHARS = chars
class CaselessLiteral(Literal):
"""
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
"""
def __init__( self, matchString ):
super(CaselessLiteral,self).__init__( matchString.upper() )
# Preserve the defining literal.
self.returnString = matchString
self.name = "'%s'" % self.returnString
self.errmsg = "Expected " + self.name
def parseImpl( self, instring, loc, doActions=True ):
if instring[ loc:loc+self.matchLen ].upper() == self.match:
return loc+self.matchLen, self.returnString
raise ParseException(instring, loc, self.errmsg, self)
class CaselessKeyword(Keyword):
"""
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
"""
def __init__( self, matchString, identChars=None ):
super(CaselessKeyword,self).__init__( matchString, identChars, caseless=True )
def parseImpl( self, instring, loc, doActions=True ):
if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
(loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) ):
return loc+self.matchLen, self.match
raise ParseException(instring, loc, self.errmsg, self)
class CloseMatch(Token):
"""
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
"""
def __init__(self, match_string, maxMismatches=1):
super(CloseMatch,self).__init__()
self.name = match_string
self.match_string = match_string
self.maxMismatches = maxMismatches
self.errmsg = "Expected %r (with up to %d mismatches)" % (self.match_string, self.maxMismatches)
self.mayIndexError = False
self.mayReturnEmpty = False
def parseImpl( self, instring, loc, doActions=True ):
start = loc
instrlen = len(instring)
maxloc = start + len(self.match_string)
if maxloc <= instrlen:
match_string = self.match_string
match_stringloc = 0
mismatches = []
maxMismatches = self.maxMismatches
for match_stringloc,s_m in enumerate(zip(instring[loc:maxloc], self.match_string)):
src,mat = s_m
if src != mat:
mismatches.append(match_stringloc)
if len(mismatches) > maxMismatches:
break
else:
loc = match_stringloc + 1
results = ParseResults([instring[start:loc]])
results['original'] = self.match_string
results['mismatches'] = mismatches
return loc, results
raise ParseException(instring, loc, self.errmsg, self)
class Word(Token):
"""
Token for matching words composed of allowed character sets.
Defined with string containing all allowed initial characters,
an optional string containing allowed body characters (if omitted,
defaults to the initial character set), and an optional minimum,
maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction. An optional
C{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
"""
def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ):
super(Word,self).__init__()
if excludeChars:
initChars = ''.join(c for c in initChars if c not in excludeChars)
if bodyChars:
bodyChars = ''.join(c for c in bodyChars if c not in excludeChars)
self.initCharsOrig = initChars
self.initChars = set(initChars)
if bodyChars :
self.bodyCharsOrig = bodyChars
self.bodyChars = set(bodyChars)
else:
self.bodyCharsOrig = initChars
self.bodyChars = set(initChars)
self.maxSpecified = max > 0
if min < 1:
raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted")
self.minLen = min
if max > 0:
self.maxLen = max
else:
self.maxLen = _MAX_INT
if exact > 0:
self.maxLen = exact
self.minLen = exact
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayIndexError = False
self.asKeyword = asKeyword
if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0):
if self.bodyCharsOrig == self.initCharsOrig:
self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig)
elif len(self.initCharsOrig) == 1:
self.reString = "%s[%s]*" % \
(re.escape(self.initCharsOrig),
_escapeRegexRangeChars(self.bodyCharsOrig),)
else:
self.reString = "[%s][%s]*" % \
(_escapeRegexRangeChars(self.initCharsOrig),
_escapeRegexRangeChars(self.bodyCharsOrig),)
if self.asKeyword:
self.reString = r"\b"+self.reString+r"\b"
try:
self.re = re.compile( self.reString )
except Exception:
self.re = None
def parseImpl( self, instring, loc, doActions=True ):
if self.re:
result = self.re.match(instring,loc)
if not result:
raise ParseException(instring, loc, self.errmsg, self)
loc = result.end()
return loc, result.group()
if not(instring[ loc ] in self.initChars):
raise ParseException(instring, loc, self.errmsg, self)
start = loc
loc += 1
instrlen = len(instring)
bodychars = self.bodyChars
maxloc = start + self.maxLen
maxloc = min( maxloc, instrlen )
while loc < maxloc and instring[loc] in bodychars:
loc += 1
throwException = False
if loc - start < self.minLen:
throwException = True
if self.maxSpecified and loc < instrlen and instring[loc] in bodychars:
throwException = True
if self.asKeyword:
if (start>0 and instring[start-1] in bodychars) or (loc<instrlen and instring[loc] in bodychars):
throwException = True
if throwException:
raise ParseException(instring, loc, self.errmsg, self)
return loc, instring[start:loc]
def __str__( self ):
try:
return super(Word,self).__str__()
except Exception:
pass
if self.strRepr is None:
def charsAsStr(s):
if len(s)>4:
return s[:4]+"..."
else:
return s
if ( self.initCharsOrig != self.bodyCharsOrig ):
self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) )
else:
self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig)
return self.strRepr
class Regex(Token):
"""
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
"""
compiledREtype = type(re.compile("[A-Z]"))
def __init__( self, pattern, flags=0):
"""The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags."""
super(Regex,self).__init__()
if isinstance(pattern, basestring):
if not pattern:
warnings.warn("null string passed to Regex; use Empty() instead",
SyntaxWarning, stacklevel=2)
self.pattern = pattern
self.flags = flags
try:
self.re = re.compile(self.pattern, self.flags)
self.reString = self.pattern
except sre_constants.error:
warnings.warn("invalid pattern (%s) passed to Regex" % pattern,
SyntaxWarning, stacklevel=2)
raise
elif isinstance(pattern, Regex.compiledREtype):
self.re = pattern
self.pattern = \
self.reString = str(pattern)
self.flags = flags
else:
raise ValueError("Regex may only be constructed with a string or a compiled RE object")
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayIndexError = False
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
result = self.re.match(instring,loc)
if not result:
raise ParseException(instring, loc, self.errmsg, self)
loc = result.end()
d = result.groupdict()
ret = ParseResults(result.group())
if d:
for k in d:
ret[k] = d[k]
return loc,ret
def __str__( self ):
try:
return super(Regex,self).__str__()
except Exception:
pass
if self.strRepr is None:
self.strRepr = "Re:(%s)" % repr(self.pattern)
return self.strRepr
class QuotedString(Token):
r"""
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
"""
def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
super(QuotedString,self).__init__()
# remove white space from quote chars - wont work anyway
quoteChar = quoteChar.strip()
if not quoteChar:
warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
raise SyntaxError()
if endQuoteChar is None:
endQuoteChar = quoteChar
else:
endQuoteChar = endQuoteChar.strip()
if not endQuoteChar:
warnings.warn("endQuoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
raise SyntaxError()
self.quoteChar = quoteChar
self.quoteCharLen = len(quoteChar)
self.firstQuoteChar = quoteChar[0]
self.endQuoteChar = endQuoteChar
self.endQuoteCharLen = len(endQuoteChar)
self.escChar = escChar
self.escQuote = escQuote
self.unquoteResults = unquoteResults
self.convertWhitespaceEscapes = convertWhitespaceEscapes
if multiline:
self.flags = re.MULTILINE | re.DOTALL
self.pattern = r'%s(?:[^%s%s]' % \
( re.escape(self.quoteChar),
_escapeRegexRangeChars(self.endQuoteChar[0]),
(escChar is not None and _escapeRegexRangeChars(escChar) or '') )
else:
self.flags = 0
self.pattern = r'%s(?:[^%s\n\r%s]' % \
( re.escape(self.quoteChar),
_escapeRegexRangeChars(self.endQuoteChar[0]),
(escChar is not None and _escapeRegexRangeChars(escChar) or '') )
if len(self.endQuoteChar) > 1:
self.pattern += (
'|(?:' + ')|(?:'.join("%s[^%s]" % (re.escape(self.endQuoteChar[:i]),
_escapeRegexRangeChars(self.endQuoteChar[i]))
for i in range(len(self.endQuoteChar)-1,0,-1)) + ')'
)
if escQuote:
self.pattern += (r'|(?:%s)' % re.escape(escQuote))
if escChar:
self.pattern += (r'|(?:%s.)' % re.escape(escChar))
self.escCharReplacePattern = re.escape(self.escChar)+"(.)"
self.pattern += (r')*%s' % re.escape(self.endQuoteChar))
try:
self.re = re.compile(self.pattern, self.flags)
self.reString = self.pattern
except sre_constants.error:
warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern,
SyntaxWarning, stacklevel=2)
raise
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayIndexError = False
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
result = instring[loc] == self.firstQuoteChar and self.re.match(instring,loc) or None
if not result:
raise ParseException(instring, loc, self.errmsg, self)
loc = result.end()
ret = result.group()
if self.unquoteResults:
# strip off quotes
ret = ret[self.quoteCharLen:-self.endQuoteCharLen]
if isinstance(ret,basestring):
# replace escaped whitespace
if '\\' in ret and self.convertWhitespaceEscapes:
ws_map = {
r'\t' : '\t',
r'\n' : '\n',
r'\f' : '\f',
r'\r' : '\r',
}
for wslit,wschar in ws_map.items():
ret = ret.replace(wslit, wschar)
# replace escaped characters
if self.escChar:
ret = re.sub(self.escCharReplacePattern,"\g<1>",ret)
# replace escaped quotes
if self.escQuote:
ret = ret.replace(self.escQuote, self.endQuoteChar)
return loc, ret
def __str__( self ):
try:
return super(QuotedString,self).__str__()
except Exception:
pass
if self.strRepr is None:
self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar)
return self.strRepr
class CharsNotIn(Token):
"""
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
"""
def __init__( self, notChars, min=1, max=0, exact=0 ):
super(CharsNotIn,self).__init__()
self.skipWhitespace = False
self.notChars = notChars
if min < 1:
raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted")
self.minLen = min
if max > 0:
self.maxLen = max
else:
self.maxLen = _MAX_INT
if exact > 0:
self.maxLen = exact
self.minLen = exact
self.name = _ustr(self)
self.errmsg = "Expected " + self.name
self.mayReturnEmpty = ( self.minLen == 0 )
self.mayIndexError = False
def parseImpl( self, instring, loc, doActions=True ):
if instring[loc] in self.notChars:
raise ParseException(instring, loc, self.errmsg, self)
start = loc
loc += 1
notchars = self.notChars
maxlen = min( start+self.maxLen, len(instring) )
while loc < maxlen and \
(instring[loc] not in notchars):
loc += 1
if loc - start < self.minLen:
raise ParseException(instring, loc, self.errmsg, self)
return loc, instring[start:loc]
def __str__( self ):
try:
return super(CharsNotIn, self).__str__()
except Exception:
pass
if self.strRepr is None:
if len(self.notChars) > 4:
self.strRepr = "!W:(%s...)" % self.notChars[:4]
else:
self.strRepr = "!W:(%s)" % self.notChars
return self.strRepr
class White(Token):
"""
Special matching class for matching whitespace. Normally, whitespace is ignored
by pyparsing grammars. This class is included when some whitespace structures
are significant. Define with a string containing the whitespace characters to be
matched; default is C{" \\t\\r\\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments,
as defined for the C{L{Word}} class.
"""
whiteStrs = {
" " : "<SPC>",
"\t": "<TAB>",
"\n": "<LF>",
"\r": "<CR>",
"\f": "<FF>",
}
def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0):
super(White,self).__init__()
self.matchWhite = ws
self.setWhitespaceChars( "".join(c for c in self.whiteChars if c not in self.matchWhite) )
#~ self.leaveWhitespace()
self.name = ("".join(White.whiteStrs[c] for c in self.matchWhite))
self.mayReturnEmpty = True
self.errmsg = "Expected " + self.name
self.minLen = min
if max > 0:
self.maxLen = max
else:
self.maxLen = _MAX_INT
if exact > 0:
self.maxLen = exact
self.minLen = exact
def parseImpl( self, instring, loc, doActions=True ):
if not(instring[ loc ] in self.matchWhite):
raise ParseException(instring, loc, self.errmsg, self)
start = loc
loc += 1
maxloc = start + self.maxLen
maxloc = min( maxloc, len(instring) )
while loc < maxloc and instring[loc] in self.matchWhite:
loc += 1
if loc - start < self.minLen:
raise ParseException(instring, loc, self.errmsg, self)
return loc, instring[start:loc]
class _PositionToken(Token):
def __init__( self ):
super(_PositionToken,self).__init__()
self.name=self.__class__.__name__
self.mayReturnEmpty = True
self.mayIndexError = False
class GoToColumn(_PositionToken):
"""
Token to advance to a specific column of input text; useful for tabular report scraping.
"""
def __init__( self, colno ):
super(GoToColumn,self).__init__()
self.col = colno
def preParse( self, instring, loc ):
if col(loc,instring) != self.col:
instrlen = len(instring)
if self.ignoreExprs:
loc = self._skipIgnorables( instring, loc )
while loc < instrlen and instring[loc].isspace() and col( loc, instring ) != self.col :
loc += 1
return loc
def parseImpl( self, instring, loc, doActions=True ):
thiscol = col( loc, instring )
if thiscol > self.col:
raise ParseException( instring, loc, "Text not in expected column", self )
newloc = loc + self.col - thiscol
ret = instring[ loc: newloc ]
return newloc, ret
class LineStart(_PositionToken):
"""
Matches if current position is at the beginning of a line within the parse string
Example::
test = '''\
AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
"""
def __init__( self ):
super(LineStart,self).__init__()
self.errmsg = "Expected start of line"
def parseImpl( self, instring, loc, doActions=True ):
if col(loc, instring) == 1:
return loc, []
raise ParseException(instring, loc, self.errmsg, self)
class LineEnd(_PositionToken):
"""
Matches if current position is at the end of a line within the parse string
"""
def __init__( self ):
super(LineEnd,self).__init__()
self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") )
self.errmsg = "Expected end of line"
def parseImpl( self, instring, loc, doActions=True ):
if loc<len(instring):
if instring[loc] == "\n":
return loc+1, "\n"
else:
raise ParseException(instring, loc, self.errmsg, self)
elif loc == len(instring):
return loc+1, []
else:
raise ParseException(instring, loc, self.errmsg, self)
class StringStart(_PositionToken):
"""
Matches if current position is at the beginning of the parse string
"""
def __init__( self ):
super(StringStart,self).__init__()
self.errmsg = "Expected start of text"
def parseImpl( self, instring, loc, doActions=True ):
if loc != 0:
# see if entire string up to here is just whitespace and ignoreables
if loc != self.preParse( instring, 0 ):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
class StringEnd(_PositionToken):
"""
Matches if current position is at the end of the parse string
"""
def __init__( self ):
super(StringEnd,self).__init__()
self.errmsg = "Expected end of text"
def parseImpl( self, instring, loc, doActions=True ):
if loc < len(instring):
raise ParseException(instring, loc, self.errmsg, self)
elif loc == len(instring):
return loc+1, []
elif loc > len(instring):
return loc, []
else:
raise ParseException(instring, loc, self.errmsg, self)
class WordStart(_PositionToken):
"""
Matches if the current position is at the beginning of a Word, and
is not preceded by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{\b} behavior of regular expressions,
use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
the string being parsed, or at the beginning of a line.
"""
def __init__(self, wordChars = printables):
super(WordStart,self).__init__()
self.wordChars = set(wordChars)
self.errmsg = "Not at the start of a word"
def parseImpl(self, instring, loc, doActions=True ):
if loc != 0:
if (instring[loc-1] in self.wordChars or
instring[loc] not in self.wordChars):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
class WordEnd(_PositionToken):
"""
Matches if the current position is at the end of a Word, and
is not followed by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{\b} behavior of regular expressions,
use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
the string being parsed, or at the end of a line.
"""
def __init__(self, wordChars = printables):
super(WordEnd,self).__init__()
self.wordChars = set(wordChars)
self.skipWhitespace = False
self.errmsg = "Not at the end of a word"
def parseImpl(self, instring, loc, doActions=True ):
instrlen = len(instring)
if instrlen>0 and loc<instrlen:
if (instring[loc] in self.wordChars or
instring[loc-1] not in self.wordChars):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
class ParseExpression(ParserElement):
"""
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
"""
def __init__( self, exprs, savelist = False ):
super(ParseExpression,self).__init__(savelist)
if isinstance( exprs, _generatorType ):
exprs = list(exprs)
if isinstance( exprs, basestring ):
self.exprs = [ ParserElement._literalStringClass( exprs ) ]
elif isinstance( exprs, collections.Iterable ):
exprs = list(exprs)
# if sequence of strings provided, wrap with Literal
if all(isinstance(expr, basestring) for expr in exprs):
exprs = map(ParserElement._literalStringClass, exprs)
self.exprs = list(exprs)
else:
try:
self.exprs = list( exprs )
except TypeError:
self.exprs = [ exprs ]
self.callPreparse = False
def __getitem__( self, i ):
return self.exprs[i]
def append( self, other ):
self.exprs.append( other )
self.strRepr = None
return self
def leaveWhitespace( self ):
"""Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions."""
self.skipWhitespace = False
self.exprs = [ e.copy() for e in self.exprs ]
for e in self.exprs:
e.leaveWhitespace()
return self
def ignore( self, other ):
if isinstance( other, Suppress ):
if other not in self.ignoreExprs:
super( ParseExpression, self).ignore( other )
for e in self.exprs:
e.ignore( self.ignoreExprs[-1] )
else:
super( ParseExpression, self).ignore( other )
for e in self.exprs:
e.ignore( self.ignoreExprs[-1] )
return self
def __str__( self ):
try:
return super(ParseExpression,self).__str__()
except Exception:
pass
if self.strRepr is None:
self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.exprs) )
return self.strRepr
def streamline( self ):
super(ParseExpression,self).streamline()
for e in self.exprs:
e.streamline()
# collapse nested And's of the form And( And( And( a,b), c), d) to And( a,b,c,d )
# but only if there are no parse actions or resultsNames on the nested And's
# (likewise for Or's and MatchFirst's)
if ( len(self.exprs) == 2 ):
other = self.exprs[0]
if ( isinstance( other, self.__class__ ) and
not(other.parseAction) and
other.resultsName is None and
not other.debug ):
self.exprs = other.exprs[:] + [ self.exprs[1] ]
self.strRepr = None
self.mayReturnEmpty |= other.mayReturnEmpty
self.mayIndexError |= other.mayIndexError
other = self.exprs[-1]
if ( isinstance( other, self.__class__ ) and
not(other.parseAction) and
other.resultsName is None and
not other.debug ):
self.exprs = self.exprs[:-1] + other.exprs[:]
self.strRepr = None
self.mayReturnEmpty |= other.mayReturnEmpty
self.mayIndexError |= other.mayIndexError
self.errmsg = "Expected " + _ustr(self)
return self
def setResultsName( self, name, listAllMatches=False ):
ret = super(ParseExpression,self).setResultsName(name,listAllMatches)
return ret
def validate( self, validateTrace=[] ):
tmp = validateTrace[:]+[self]
for e in self.exprs:
e.validate(tmp)
self.checkRecursion( [] )
def copy(self):
ret = super(ParseExpression,self).copy()
ret.exprs = [e.copy() for e in self.exprs]
return ret
class And(ParseExpression):
"""
Requires all given C{ParseExpression}s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the C{'+'} operator.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
"""
class _ErrorStop(Empty):
def __init__(self, *args, **kwargs):
super(And._ErrorStop,self).__init__(*args, **kwargs)
self.name = '-'
self.leaveWhitespace()
def __init__( self, exprs, savelist = True ):
super(And,self).__init__(exprs, savelist)
self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
self.setWhitespaceChars( self.exprs[0].whiteChars )
self.skipWhitespace = self.exprs[0].skipWhitespace
self.callPreparse = True
def parseImpl( self, instring, loc, doActions=True ):
# pass False as last arg to _parse for first element, since we already
# pre-parsed the string as part of our And pre-parsing
loc, resultlist = self.exprs[0]._parse( instring, loc, doActions, callPreParse=False )
errorStop = False
for e in self.exprs[1:]:
if isinstance(e, And._ErrorStop):
errorStop = True
continue
if errorStop:
try:
loc, exprtokens = e._parse( instring, loc, doActions )
except ParseSyntaxException:
raise
except ParseBaseException as pe:
pe.__traceback__ = None
raise ParseSyntaxException._from_exception(pe)
except IndexError:
raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
else:
loc, exprtokens = e._parse( instring, loc, doActions )
if exprtokens or exprtokens.haskeys():
resultlist += exprtokens
return loc, resultlist
def __iadd__(self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
return self.append( other ) #And( [ self, other ] )
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
if not e.mayReturnEmpty:
break
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
class Or(ParseExpression):
"""
Requires that at least one C{ParseExpression} is found.
If two expressions match, the expression that matches the longest string will be used.
May be constructed using the C{'^'} operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
"""
def __init__( self, exprs, savelist = False ):
super(Or,self).__init__(exprs, savelist)
if self.exprs:
self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
else:
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
maxExcLoc = -1
maxException = None
matches = []
for e in self.exprs:
try:
loc2 = e.tryParse( instring, loc )
except ParseException as err:
err.__traceback__ = None
if err.loc > maxExcLoc:
maxException = err
maxExcLoc = err.loc
except IndexError:
if len(instring) > maxExcLoc:
maxException = ParseException(instring,len(instring),e.errmsg,self)
maxExcLoc = len(instring)
else:
# save match among all matches, to retry longest to shortest
matches.append((loc2, e))
if matches:
matches.sort(key=lambda x: -x[0])
for _,e in matches:
try:
return e._parse( instring, loc, doActions )
except ParseException as err:
err.__traceback__ = None
if err.loc > maxExcLoc:
maxException = err
maxExcLoc = err.loc
if maxException is not None:
maxException.msg = self.errmsg
raise maxException
else:
raise ParseException(instring, loc, "no defined alternatives to match", self)
def __ixor__(self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
return self.append( other ) #Or( [ self, other ] )
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " ^ ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
class MatchFirst(ParseExpression):
"""
Requires that at least one C{ParseExpression} is found.
If two expressions match, the first one listed is the one that will match.
May be constructed using the C{'|'} operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
"""
def __init__( self, exprs, savelist = False ):
super(MatchFirst,self).__init__(exprs, savelist)
if self.exprs:
self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
else:
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
maxExcLoc = -1
maxException = None
for e in self.exprs:
try:
ret = e._parse( instring, loc, doActions )
return ret
except ParseException as err:
if err.loc > maxExcLoc:
maxException = err
maxExcLoc = err.loc
except IndexError:
if len(instring) > maxExcLoc:
maxException = ParseException(instring,len(instring),e.errmsg,self)
maxExcLoc = len(instring)
# only got here if no expression matched, raise exception for match that made it the furthest
else:
if maxException is not None:
maxException.msg = self.errmsg
raise maxException
else:
raise ParseException(instring, loc, "no defined alternatives to match", self)
def __ior__(self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass( other )
return self.append( other ) #MatchFirst( [ self, other ] )
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " | ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
class Each(ParseExpression):
"""
Requires all given C{ParseExpression}s to be found, but in any order.
Expressions may be separated by whitespace.
May be constructed using the C{'&'} operator.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
"""
def __init__( self, exprs, savelist = True ):
super(Each,self).__init__(exprs, savelist)
self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
self.skipWhitespace = True
self.initExprGroups = True
def parseImpl( self, instring, loc, doActions=True ):
if self.initExprGroups:
self.opt1map = dict((id(e.expr),e) for e in self.exprs if isinstance(e,Optional))
opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ]
opt2 = [ e for e in self.exprs if e.mayReturnEmpty and not isinstance(e,Optional)]
self.optionals = opt1 + opt2
self.multioptionals = [ e.expr for e in self.exprs if isinstance(e,ZeroOrMore) ]
self.multirequired = [ e.expr for e in self.exprs if isinstance(e,OneOrMore) ]
self.required = [ e for e in self.exprs if not isinstance(e,(Optional,ZeroOrMore,OneOrMore)) ]
self.required += self.multirequired
self.initExprGroups = False
tmpLoc = loc
tmpReqd = self.required[:]
tmpOpt = self.optionals[:]
matchOrder = []
keepMatching = True
while keepMatching:
tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
failed = []
for e in tmpExprs:
try:
tmpLoc = e.tryParse( instring, tmpLoc )
except ParseException:
failed.append(e)
else:
matchOrder.append(self.opt1map.get(id(e),e))
if e in tmpReqd:
tmpReqd.remove(e)
elif e in tmpOpt:
tmpOpt.remove(e)
if len(failed) == len(tmpExprs):
keepMatching = False
if tmpReqd:
missing = ", ".join(_ustr(e) for e in tmpReqd)
raise ParseException(instring,loc,"Missing one or more required elements (%s)" % missing )
# add any unmatched Optionals, in case they have default values defined
matchOrder += [e for e in self.exprs if isinstance(e,Optional) and e.expr in tmpOpt]
resultlist = []
for e in matchOrder:
loc,results = e._parse(instring,loc,doActions)
resultlist.append(results)
finalResults = sum(resultlist, ParseResults([]))
return loc, finalResults
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + " & ".join(_ustr(e) for e in self.exprs) + "}"
return self.strRepr
def checkRecursion( self, parseElementList ):
subRecCheckList = parseElementList[:] + [ self ]
for e in self.exprs:
e.checkRecursion( subRecCheckList )
class ParseElementEnhance(ParserElement):
"""
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
"""
def __init__( self, expr, savelist=False ):
super(ParseElementEnhance,self).__init__(savelist)
if isinstance( expr, basestring ):
if issubclass(ParserElement._literalStringClass, Token):
expr = ParserElement._literalStringClass(expr)
else:
expr = ParserElement._literalStringClass(Literal(expr))
self.expr = expr
self.strRepr = None
if expr is not None:
self.mayIndexError = expr.mayIndexError
self.mayReturnEmpty = expr.mayReturnEmpty
self.setWhitespaceChars( expr.whiteChars )
self.skipWhitespace = expr.skipWhitespace
self.saveAsList = expr.saveAsList
self.callPreparse = expr.callPreparse
self.ignoreExprs.extend(expr.ignoreExprs)
def parseImpl( self, instring, loc, doActions=True ):
if self.expr is not None:
return self.expr._parse( instring, loc, doActions, callPreParse=False )
else:
raise ParseException("",loc,self.errmsg,self)
def leaveWhitespace( self ):
self.skipWhitespace = False
self.expr = self.expr.copy()
if self.expr is not None:
self.expr.leaveWhitespace()
return self
def ignore( self, other ):
if isinstance( other, Suppress ):
if other not in self.ignoreExprs:
super( ParseElementEnhance, self).ignore( other )
if self.expr is not None:
self.expr.ignore( self.ignoreExprs[-1] )
else:
super( ParseElementEnhance, self).ignore( other )
if self.expr is not None:
self.expr.ignore( self.ignoreExprs[-1] )
return self
def streamline( self ):
super(ParseElementEnhance,self).streamline()
if self.expr is not None:
self.expr.streamline()
return self
def checkRecursion( self, parseElementList ):
if self in parseElementList:
raise RecursiveGrammarException( parseElementList+[self] )
subRecCheckList = parseElementList[:] + [ self ]
if self.expr is not None:
self.expr.checkRecursion( subRecCheckList )
def validate( self, validateTrace=[] ):
tmp = validateTrace[:]+[self]
if self.expr is not None:
self.expr.validate(tmp)
self.checkRecursion( [] )
def __str__( self ):
try:
return super(ParseElementEnhance,self).__str__()
except Exception:
pass
if self.strRepr is None and self.expr is not None:
self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) )
return self.strRepr
class FollowedBy(ParseElementEnhance):
"""
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
"""
def __init__( self, expr ):
super(FollowedBy,self).__init__(expr)
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
self.expr.tryParse( instring, loc )
return loc, []
class NotAny(ParseElementEnhance):
"""
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
"""
def __init__( self, expr ):
super(NotAny,self).__init__(expr)
#~ self.leaveWhitespace()
self.skipWhitespace = False # do NOT use self.leaveWhitespace(), don't want to propagate to exprs
self.mayReturnEmpty = True
self.errmsg = "Found unwanted token, "+_ustr(self.expr)
def parseImpl( self, instring, loc, doActions=True ):
if self.expr.canParseNext(instring, loc):
raise ParseException(instring, loc, self.errmsg, self)
return loc, []
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "~{" + _ustr(self.expr) + "}"
return self.strRepr
class _MultipleMatch(ParseElementEnhance):
def __init__( self, expr, stopOn=None):
super(_MultipleMatch, self).__init__(expr)
self.saveAsList = True
ender = stopOn
if isinstance(ender, basestring):
ender = ParserElement._literalStringClass(ender)
self.not_ender = ~ender if ender is not None else None
def parseImpl( self, instring, loc, doActions=True ):
self_expr_parse = self.expr._parse
self_skip_ignorables = self._skipIgnorables
check_ender = self.not_ender is not None
if check_ender:
try_not_ender = self.not_ender.tryParse
# must be at least one (but first see if we are the stopOn sentinel;
# if so, fail)
if check_ender:
try_not_ender(instring, loc)
loc, tokens = self_expr_parse( instring, loc, doActions, callPreParse=False )
try:
hasIgnoreExprs = (not not self.ignoreExprs)
while 1:
if check_ender:
try_not_ender(instring, loc)
if hasIgnoreExprs:
preloc = self_skip_ignorables( instring, loc )
else:
preloc = loc
loc, tmptokens = self_expr_parse( instring, preloc, doActions )
if tmptokens or tmptokens.haskeys():
tokens += tmptokens
except (ParseException,IndexError):
pass
return loc, tokens
class OneOrMore(_MultipleMatch):
"""
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
"""
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "{" + _ustr(self.expr) + "}..."
return self.strRepr
class ZeroOrMore(_MultipleMatch):
"""
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
"""
def __init__( self, expr, stopOn=None):
super(ZeroOrMore,self).__init__(expr, stopOn=stopOn)
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
try:
return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
except (ParseException,IndexError):
return loc, []
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "[" + _ustr(self.expr) + "]..."
return self.strRepr
class _NullToken(object):
def __bool__(self):
return False
__nonzero__ = __bool__
def __str__(self):
return ""
_optionalNotMatched = _NullToken()
class Optional(ParseElementEnhance):
"""
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
"""
def __init__( self, expr, default=_optionalNotMatched ):
super(Optional,self).__init__( expr, savelist=False )
self.saveAsList = self.expr.saveAsList
self.defaultValue = default
self.mayReturnEmpty = True
def parseImpl( self, instring, loc, doActions=True ):
try:
loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False )
except (ParseException,IndexError):
if self.defaultValue is not _optionalNotMatched:
if self.expr.resultsName:
tokens = ParseResults([ self.defaultValue ])
tokens[self.expr.resultsName] = self.defaultValue
else:
tokens = [ self.defaultValue ]
else:
tokens = []
return loc, tokens
def __str__( self ):
if hasattr(self,"name"):
return self.name
if self.strRepr is None:
self.strRepr = "[" + _ustr(self.expr) + "]"
return self.strRepr
class SkipTo(ParseElementEnhance):
"""
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
"""
def __init__( self, other, include=False, ignore=None, failOn=None ):
super( SkipTo, self ).__init__( other )
self.ignoreExpr = ignore
self.mayReturnEmpty = True
self.mayIndexError = False
self.includeMatch = include
self.asList = False
if isinstance(failOn, basestring):
self.failOn = ParserElement._literalStringClass(failOn)
else:
self.failOn = failOn
self.errmsg = "No match found for "+_ustr(self.expr)
def parseImpl( self, instring, loc, doActions=True ):
startloc = loc
instrlen = len(instring)
expr = self.expr
expr_parse = self.expr._parse
self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
tmploc = loc
while tmploc <= instrlen:
if self_failOn_canParseNext is not None:
# break if failOn expression matches
if self_failOn_canParseNext(instring, tmploc):
break
if self_ignoreExpr_tryParse is not None:
# advance past ignore expressions
while 1:
try:
tmploc = self_ignoreExpr_tryParse(instring, tmploc)
except ParseBaseException:
break
try:
expr_parse(instring, tmploc, doActions=False, callPreParse=False)
except (ParseException, IndexError):
# no match, advance loc in string
tmploc += 1
else:
# matched skipto expr, done
break
else:
# ran off the end of the input string without matching skipto expr, fail
raise ParseException(instring, loc, self.errmsg, self)
# build up return values
loc = tmploc
skiptext = instring[startloc:loc]
skipresult = ParseResults(skiptext)
if self.includeMatch:
loc, mat = expr_parse(instring,loc,doActions,callPreParse=False)
skipresult += mat
return loc, skipresult
class Forward(ParseElementEnhance):
"""
Forward declaration of an expression to be defined later -
used for recursive grammars, such as algebraic infix notation.
When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
Note: take care when assigning to C{Forward} not to overlook precedence of operators.
Specifically, '|' has a lower precedence than '<<', so that::
fwdExpr << a | b | c
will actually be evaluated as::
(fwdExpr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the C{Forward}::
fwdExpr << (a | b | c)
Converting to use the '<<=' operator instead will avoid this problem.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
"""
def __init__( self, other=None ):
super(Forward,self).__init__( other, savelist=False )
def __lshift__( self, other ):
if isinstance( other, basestring ):
other = ParserElement._literalStringClass(other)
self.expr = other
self.strRepr = None
self.mayIndexError = self.expr.mayIndexError
self.mayReturnEmpty = self.expr.mayReturnEmpty
self.setWhitespaceChars( self.expr.whiteChars )
self.skipWhitespace = self.expr.skipWhitespace
self.saveAsList = self.expr.saveAsList
self.ignoreExprs.extend(self.expr.ignoreExprs)
return self
def __ilshift__(self, other):
return self << other
def leaveWhitespace( self ):
self.skipWhitespace = False
return self
def streamline( self ):
if not self.streamlined:
self.streamlined = True
if self.expr is not None:
self.expr.streamline()
return self
def validate( self, validateTrace=[] ):
if self not in validateTrace:
tmp = validateTrace[:]+[self]
if self.expr is not None:
self.expr.validate(tmp)
self.checkRecursion([])
def __str__( self ):
if hasattr(self,"name"):
return self.name
return self.__class__.__name__ + ": ..."
# stubbed out for now - creates awful memory and perf issues
self._revertClass = self.__class__
self.__class__ = _ForwardNoRecurse
try:
if self.expr is not None:
retString = _ustr(self.expr)
else:
retString = "None"
finally:
self.__class__ = self._revertClass
return self.__class__.__name__ + ": " + retString
def copy(self):
if self.expr is not None:
return super(Forward,self).copy()
else:
ret = Forward()
ret <<= self
return ret
class _ForwardNoRecurse(Forward):
def __str__( self ):
return "..."
class TokenConverter(ParseElementEnhance):
"""
Abstract subclass of C{ParseExpression}, for converting parsed results.
"""
def __init__( self, expr, savelist=False ):
super(TokenConverter,self).__init__( expr )#, savelist )
self.saveAsList = False
class Combine(TokenConverter):
"""
Converter to concatenate all matching tokens to a single string.
By default, the matching patterns must also be contiguous in the input string;
this can be disabled by specifying C{'adjacent=False'} in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
"""
def __init__( self, expr, joinString="", adjacent=True ):
super(Combine,self).__init__( expr )
# suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
if adjacent:
self.leaveWhitespace()
self.adjacent = adjacent
self.skipWhitespace = True
self.joinString = joinString
self.callPreparse = True
def ignore( self, other ):
if self.adjacent:
ParserElement.ignore(self, other)
else:
super( Combine, self).ignore( other )
return self
def postParse( self, instring, loc, tokenlist ):
retToks = tokenlist.copy()
del retToks[:]
retToks += ParseResults([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults)
if self.resultsName and retToks.haskeys():
return [ retToks ]
else:
return retToks
class Group(TokenConverter):
"""
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
"""
def __init__( self, expr ):
super(Group,self).__init__( expr )
self.saveAsList = True
def postParse( self, instring, loc, tokenlist ):
return [ tokenlist ]
class Dict(TokenConverter):
"""
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
"""
def __init__( self, expr ):
super(Dict,self).__init__( expr )
self.saveAsList = True
def postParse( self, instring, loc, tokenlist ):
for i,tok in enumerate(tokenlist):
if len(tok) == 0:
continue
ikey = tok[0]
if isinstance(ikey,int):
ikey = _ustr(tok[0]).strip()
if len(tok)==1:
tokenlist[ikey] = _ParseResultsWithOffset("",i)
elif len(tok)==2 and not isinstance(tok[1],ParseResults):
tokenlist[ikey] = _ParseResultsWithOffset(tok[1],i)
else:
dictvalue = tok.copy() #ParseResults(i)
del dictvalue[0]
if len(dictvalue)!= 1 or (isinstance(dictvalue,ParseResults) and dictvalue.haskeys()):
tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i)
else:
tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i)
if self.resultsName:
return [ tokenlist ]
else:
return tokenlist
class Suppress(TokenConverter):
"""
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
"""
def postParse( self, instring, loc, tokenlist ):
return []
def suppress( self ):
return self
class OnlyOnce(object):
"""
Wrapper for parse actions, to ensure they are only called once.
"""
def __init__(self, methodCall):
self.callable = _trim_arity(methodCall)
self.called = False
def __call__(self,s,l,t):
if not self.called:
results = self.callable(s,l,t)
self.called = True
return results
raise ParseException(s,l,"")
def reset(self):
self.called = False
def traceParseAction(f):
"""
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
"""
f = _trim_arity(f)
def z(*paArgs):
thisFunc = f.__name__
s,l,t = paArgs[-3:]
if len(paArgs)>3:
thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc
sys.stderr.write( ">>entering %s(line: '%s', %d, %r)\n" % (thisFunc,line(l,s),l,t) )
try:
ret = f(*paArgs)
except Exception as exc:
sys.stderr.write( "<<leaving %s (exception: %s)\n" % (thisFunc,exc) )
raise
sys.stderr.write( "<<leaving %s (ret: %r)\n" % (thisFunc,ret) )
return ret
try:
z.__name__ = f.__name__
except AttributeError:
pass
return z
#
# global helpers
#
def delimitedList( expr, delim=",", combine=False ):
"""
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
"""
dlName = _ustr(expr)+" ["+_ustr(delim)+" "+_ustr(expr)+"]..."
if combine:
return Combine( expr + ZeroOrMore( delim + expr ) ).setName(dlName)
else:
return ( expr + ZeroOrMore( Suppress( delim ) + expr ) ).setName(dlName)
def countedArray( expr, intExpr=None ):
"""
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
"""
arrayExpr = Forward()
def countFieldParseAction(s,l,t):
n = t[0]
arrayExpr << (n and Group(And([expr]*n)) or Group(empty))
return []
if intExpr is None:
intExpr = Word(nums).setParseAction(lambda t:int(t[0]))
else:
intExpr = intExpr.copy()
intExpr.setName("arrayLen")
intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
return ( intExpr + arrayExpr ).setName('(len) ' + _ustr(expr) + '...')
def _flatten(L):
ret = []
for i in L:
if isinstance(i,list):
ret.extend(_flatten(i))
else:
ret.append(i)
return ret
def matchPreviousLiteral(expr):
"""
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
"""
rep = Forward()
def copyTokenToRepeater(s,l,t):
if t:
if len(t) == 1:
rep << t[0]
else:
# flatten t tokens
tflat = _flatten(t.asList())
rep << And(Literal(tt) for tt in tflat)
else:
rep << Empty()
expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
rep.setName('(prev) ' + _ustr(expr))
return rep
def matchPreviousExpr(expr):
"""
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
"""
rep = Forward()
e2 = expr.copy()
rep <<= e2
def copyTokenToRepeater(s,l,t):
matchTokens = _flatten(t.asList())
def mustMatchTheseTokens(s,l,t):
theseTokens = _flatten(t.asList())
if theseTokens != matchTokens:
raise ParseException("",0,"")
rep.setParseAction( mustMatchTheseTokens, callDuringTry=True )
expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
rep.setName('(prev) ' + _ustr(expr))
return rep
def _escapeRegexRangeChars(s):
#~ escape these chars: ^-]
for c in r"\^-]":
s = s.replace(c,_bslash+c)
s = s.replace("\n",r"\n")
s = s.replace("\t",r"\t")
return _ustr(s)
def oneOf( strs, caseless=False, useRegex=True ):
"""
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
"""
if caseless:
isequal = ( lambda a,b: a.upper() == b.upper() )
masks = ( lambda a,b: b.upper().startswith(a.upper()) )
parseElementClass = CaselessLiteral
else:
isequal = ( lambda a,b: a == b )
masks = ( lambda a,b: b.startswith(a) )
parseElementClass = Literal
symbols = []
if isinstance(strs,basestring):
symbols = strs.split()
elif isinstance(strs, collections.Iterable):
symbols = list(strs)
else:
warnings.warn("Invalid argument to oneOf, expected string or iterable",
SyntaxWarning, stacklevel=2)
if not symbols:
return NoMatch()
i = 0
while i < len(symbols)-1:
cur = symbols[i]
for j,other in enumerate(symbols[i+1:]):
if ( isequal(other, cur) ):
del symbols[i+j+1]
break
elif ( masks(cur, other) ):
del symbols[i+j+1]
symbols.insert(i,other)
cur = other
break
else:
i += 1
if not caseless and useRegex:
#~ print (strs,"->", "|".join( [ _escapeRegexChars(sym) for sym in symbols] ))
try:
if len(symbols)==len("".join(symbols)):
return Regex( "[%s]" % "".join(_escapeRegexRangeChars(sym) for sym in symbols) ).setName(' | '.join(symbols))
else:
return Regex( "|".join(re.escape(sym) for sym in symbols) ).setName(' | '.join(symbols))
except Exception:
warnings.warn("Exception creating Regex for oneOf, building MatchFirst",
SyntaxWarning, stacklevel=2)
# last resort, just use MatchFirst
return MatchFirst(parseElementClass(sym) for sym in symbols).setName(' | '.join(symbols))
def dictOf( key, value ):
"""
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
"""
return Dict( ZeroOrMore( Group ( key + value ) ) )
def originalTextFor(expr, asString=True):
"""
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
"""
locMarker = Empty().setParseAction(lambda s,loc,t: loc)
endlocMarker = locMarker.copy()
endlocMarker.callPreparse = False
matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end")
if asString:
extractText = lambda s,l,t: s[t._original_start:t._original_end]
else:
def extractText(s,l,t):
t[:] = [s[t.pop('_original_start'):t.pop('_original_end')]]
matchExpr.setParseAction(extractText)
matchExpr.ignoreExprs = expr.ignoreExprs
return matchExpr
def ungroup(expr):
"""
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
"""
return TokenConverter(expr).setParseAction(lambda t:t[0])
def locatedExpr(expr):
"""
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
"""
locator = Empty().setParseAction(lambda s,l,t: l)
return Group(locator("locn_start") + expr("value") + locator.copy().leaveWhitespace()("locn_end"))
# convenience constants for positional expressions
empty = Empty().setName("empty")
lineStart = LineStart().setName("lineStart")
lineEnd = LineEnd().setName("lineEnd")
stringStart = StringStart().setName("stringStart")
stringEnd = StringEnd().setName("stringEnd")
_escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1])
_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16)))
_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8)))
_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | Word(printables, excludeChars=r'\]', exact=1) | Regex(r"\w", re.UNICODE)
_charRange = Group(_singleChar + Suppress("-") + _singleChar)
_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]"
def srange(s):
r"""
Helper to easily define string ranges for use in Word construction. Borrows
syntax from regexp '[]' string range definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string is the expanded
character set joined into a single string.
The values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
"""
_expanded = lambda p: p if not isinstance(p,ParseResults) else ''.join(unichr(c) for c in range(ord(p[0]),ord(p[1])+1))
try:
return "".join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
except Exception:
return ""
def matchOnlyAtCol(n):
"""
Helper method for defining parse actions that require matching at a specific
column in the input text.
"""
def verifyCol(strg,locn,toks):
if col(locn,strg) != n:
raise ParseException(strg,locn,"matched token not at column %d" % n)
return verifyCol
def replaceWith(replStr):
"""
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
"""
return lambda s,l,t: [replStr]
def removeQuotes(s,l,t):
"""
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
"""
return t[0][1:-1]
def tokenMap(func, *args):
"""
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
"""
def pa(s,l,t):
return [func(tokn, *args) for tokn in t]
try:
func_name = getattr(func, '__name__',
getattr(func, '__class__').__name__)
except Exception:
func_name = str(func)
pa.__name__ = func_name
return pa
upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
"""(Deprecated) Helper parse action to convert tokens to upper case. Deprecated in favor of L{pyparsing_common.upcaseTokens}"""
downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
"""(Deprecated) Helper parse action to convert tokens to lower case. Deprecated in favor of L{pyparsing_common.downcaseTokens}"""
def _makeTags(tagStr, xml):
"""Internal helper to construct opening and closing tag expressions, given a tag name"""
if isinstance(tagStr,basestring):
resname = tagStr
tagStr = Keyword(tagStr, caseless=not xml)
else:
resname = tagStr.name
tagAttrName = Word(alphas,alphanums+"_-:")
if (xml):
tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes )
openTag = Suppress("<") + tagStr("tag") + \
Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \
Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
else:
printablesLessRAbrack = "".join(c for c in printables if c not in ">")
tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack)
openTag = Suppress("<") + tagStr("tag") + \
Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \
Optional( Suppress("=") + tagAttrValue ) ))) + \
Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
closeTag = Combine(_L("</") + tagStr + ">")
openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % resname)
closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("</%s>" % resname)
openTag.tag = resname
closeTag.tag = resname
return openTag, closeTag
def makeHTMLTags(tagStr):
"""
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
"""
return _makeTags( tagStr, False )
def makeXMLTags(tagStr):
"""
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
"""
return _makeTags( tagStr, True )
def withAttribute(*args,**attrDict):
"""
Helper to create a validating parse action to be used with start tags created
with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
with a required attribute value, to avoid false matches on common tags such as
C{<TD>} or C{<DIV>}.
Call C{withAttribute} with a series of attribute names and values. Specify the list
of filter attributes names and values as:
- keyword arguments, as in C{(align="right")}, or
- as an explicit dict with C{**} operator, when an attribute name is also a Python
reserved word, as in C{**{"class":"Customer", "align":"right"}}
- a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
For attribute names with a namespace prefix, you must use the second form. Attribute
names are matched insensitive to upper/lower case.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
"""
if args:
attrs = args[:]
else:
attrs = attrDict.items()
attrs = [(k,v) for k,v in attrs]
def pa(s,l,tokens):
for attrName,attrValue in attrs:
if attrName not in tokens:
raise ParseException(s,l,"no matching attribute " + attrName)
if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" %
(attrName, tokens[attrName], attrValue))
return pa
withAttribute.ANY_VALUE = object()
def withClass(classname, namespace=''):
"""
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
"""
classattr = "%s:class" % namespace if namespace else "class"
return withAttribute(**{classattr : classname})
opAssoc = _Constants()
opAssoc.LEFT = object()
opAssoc.RIGHT = object()
def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ):
"""
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
"""
ret = Forward()
lastExpr = baseExpr | ( lpar + ret + rpar )
for i,operDef in enumerate(opList):
opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4]
termName = "%s term" % opExpr if arity < 3 else "%s%s term" % opExpr
if arity == 3:
if opExpr is None or len(opExpr) != 2:
raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions")
opExpr1, opExpr2 = opExpr
thisExpr = Forward().setName(termName)
if rightLeftAssoc == opAssoc.LEFT:
if arity == 1:
matchExpr = FollowedBy(lastExpr + opExpr) + Group( lastExpr + OneOrMore( opExpr ) )
elif arity == 2:
if opExpr is not None:
matchExpr = FollowedBy(lastExpr + opExpr + lastExpr) + Group( lastExpr + OneOrMore( opExpr + lastExpr ) )
else:
matchExpr = FollowedBy(lastExpr+lastExpr) + Group( lastExpr + OneOrMore(lastExpr) )
elif arity == 3:
matchExpr = FollowedBy(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr) + \
Group( lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr )
else:
raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
elif rightLeftAssoc == opAssoc.RIGHT:
if arity == 1:
# try to avoid LR with this extra test
if not isinstance(opExpr, Optional):
opExpr = Optional(opExpr)
matchExpr = FollowedBy(opExpr.expr + thisExpr) + Group( opExpr + thisExpr )
elif arity == 2:
if opExpr is not None:
matchExpr = FollowedBy(lastExpr + opExpr + thisExpr) + Group( lastExpr + OneOrMore( opExpr + thisExpr ) )
else:
matchExpr = FollowedBy(lastExpr + thisExpr) + Group( lastExpr + OneOrMore( thisExpr ) )
elif arity == 3:
matchExpr = FollowedBy(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr) + \
Group( lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr )
else:
raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
else:
raise ValueError("operator must indicate right or left associativity")
if pa:
matchExpr.setParseAction( pa )
thisExpr <<= ( matchExpr.setName(termName) | lastExpr )
lastExpr = thisExpr
ret <<= lastExpr
return ret
operatorPrecedence = infixNotation
"""(Deprecated) Former name of C{L{infixNotation}}, will be dropped in a future release."""
dblQuotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"').setName("string enclosed in double quotes")
sglQuotedString = Combine(Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("string enclosed in single quotes")
quotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"'|
Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("quotedString using single or double quotes")
unicodeString = Combine(_L('u') + quotedString.copy()).setName("unicode string literal")
def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()):
"""
Helper method for defining nested lists enclosed in opening and closing
delimiters ("(" and ")" are the default).
Parameters:
- opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
"""
if opener == closer:
raise ValueError("opening and closing strings cannot be the same")
if content is None:
if isinstance(opener,basestring) and isinstance(closer,basestring):
if len(opener) == 1 and len(closer)==1:
if ignoreExpr is not None:
content = (Combine(OneOrMore(~ignoreExpr +
CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS,exact=1))
).setParseAction(lambda t:t[0].strip()))
else:
content = (empty.copy()+CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS
).setParseAction(lambda t:t[0].strip()))
else:
if ignoreExpr is not None:
content = (Combine(OneOrMore(~ignoreExpr +
~Literal(opener) + ~Literal(closer) +
CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
).setParseAction(lambda t:t[0].strip()))
else:
content = (Combine(OneOrMore(~Literal(opener) + ~Literal(closer) +
CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
).setParseAction(lambda t:t[0].strip()))
else:
raise ValueError("opening and closing arguments must be strings if no content expression is given")
ret = Forward()
if ignoreExpr is not None:
ret <<= Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) )
else:
ret <<= Group( Suppress(opener) + ZeroOrMore( ret | content ) + Suppress(closer) )
ret.setName('nested %s%s expression' % (opener,closer))
return ret
def indentedBlock(blockStatementExpr, indentStack, indent=True):
"""
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
"""
def checkPeerIndent(s,l,t):
if l >= len(s): return
curCol = col(l,s)
if curCol != indentStack[-1]:
if curCol > indentStack[-1]:
raise ParseFatalException(s,l,"illegal nesting")
raise ParseException(s,l,"not a peer entry")
def checkSubIndent(s,l,t):
curCol = col(l,s)
if curCol > indentStack[-1]:
indentStack.append( curCol )
else:
raise ParseException(s,l,"not a subentry")
def checkUnindent(s,l,t):
if l >= len(s): return
curCol = col(l,s)
if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]):
raise ParseException(s,l,"not an unindent")
indentStack.pop()
NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress())
INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName('INDENT')
PEER = Empty().setParseAction(checkPeerIndent).setName('')
UNDENT = Empty().setParseAction(checkUnindent).setName('UNINDENT')
if indent:
smExpr = Group( Optional(NL) +
#~ FollowedBy(blockStatementExpr) +
INDENT + (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) + UNDENT)
else:
smExpr = Group( Optional(NL) +
(OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) )
blockStatementExpr.ignore(_bslash + LineEnd())
return smExpr.setName('indented block')
alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]")
punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]")
anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:").setName('any tag'))
_htmlEntityMap = dict(zip("gt lt amp nbsp quot apos".split(),'><& "\''))
commonHTMLEntity = Regex('&(?P<entity>' + '|'.join(_htmlEntityMap.keys()) +");").setName("common HTML entity")
def replaceHTMLEntity(t):
"""Helper parser action to replace common HTML entities with their special characters"""
return _htmlEntityMap.get(t.entity)
# it's easy to get these comment structures wrong - they're very common, so may as well make them available
cStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/').setName("C style comment")
"Comment of the form C{/* ... */}"
htmlComment = Regex(r"<!--[\s\S]*?-->").setName("HTML comment")
"Comment of the form C{<!-- ... -->}"
restOfLine = Regex(r".*").leaveWhitespace().setName("rest of line")
dblSlashComment = Regex(r"//(?:\\\n|[^\n])*").setName("// comment")
"Comment of the form C{// ... (to end of line)}"
cppStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/'| dblSlashComment).setName("C++ style comment")
"Comment of either form C{L{cStyleComment}} or C{L{dblSlashComment}}"
javaStyleComment = cppStyleComment
"Same as C{L{cppStyleComment}}"
pythonStyleComment = Regex(r"#.*").setName("Python style comment")
"Comment of the form C{# ... (to end of line)}"
_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=',') +
Optional( Word(" \t") +
~Literal(",") + ~LineEnd() ) ) ).streamline().setName("commaItem")
commaSeparatedList = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("commaSeparatedList")
"""(Deprecated) Predefined expression of 1 or more printable words or quoted strings, separated by commas.
This expression is deprecated in favor of L{pyparsing_common.comma_separated_list}."""
# some other useful expressions - using lower-case class name since we are really using this as a namespace
class pyparsing_common:
"""
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
"""
convertToInteger = tokenMap(int)
"""
Parse action for converting parsed integers to Python int
"""
convertToFloat = tokenMap(float)
"""
Parse action for converting parsed numbers to Python float
"""
integer = Word(nums).setName("integer").setParseAction(convertToInteger)
"""expression that parses an unsigned integer, returns an int"""
hex_integer = Word(hexnums).setName("hex integer").setParseAction(tokenMap(int,16))
"""expression that parses a hexadecimal integer, returns an int"""
signed_integer = Regex(r'[+-]?\d+').setName("signed integer").setParseAction(convertToInteger)
"""expression that parses an integer with optional leading sign, returns an int"""
fraction = (signed_integer().setParseAction(convertToFloat) + '/' + signed_integer().setParseAction(convertToFloat)).setName("fraction")
"""fractional expression of an integer divided by an integer, returns a float"""
fraction.addParseAction(lambda t: t[0]/t[-1])
mixed_integer = (fraction | signed_integer + Optional(Optional('-').suppress() + fraction)).setName("fraction or mixed integer-fraction")
"""mixed integer of the form 'integer - fraction', with optional leading integer, returns float"""
mixed_integer.addParseAction(sum)
real = Regex(r'[+-]?\d+\.\d*').setName("real number").setParseAction(convertToFloat)
"""expression that parses a floating point number and returns a float"""
sci_real = Regex(r'[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)').setName("real number with scientific notation").setParseAction(convertToFloat)
"""expression that parses a floating point number with optional scientific notation and returns a float"""
# streamlining this expression makes the docs nicer-looking
number = (sci_real | real | signed_integer).streamline()
"""any numeric expression, returns the corresponding Python type"""
fnumber = Regex(r'[+-]?\d+\.?\d*([eE][+-]?\d+)?').setName("fnumber").setParseAction(convertToFloat)
"""any int or real number, returned as float"""
identifier = Word(alphas+'_', alphanums+'_').setName("identifier")
"""typical code identifier (leading alpha or '_', followed by 0 or more alphas, nums, or '_')"""
ipv4_address = Regex(r'(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}').setName("IPv4 address")
"IPv4 address (C{0.0.0.0 - 255.255.255.255})"
_ipv6_part = Regex(r'[0-9a-fA-F]{1,4}').setName("hex_integer")
_full_ipv6_address = (_ipv6_part + (':' + _ipv6_part)*7).setName("full IPv6 address")
_short_ipv6_address = (Optional(_ipv6_part + (':' + _ipv6_part)*(0,6)) + "::" + Optional(_ipv6_part + (':' + _ipv6_part)*(0,6))).setName("short IPv6 address")
_short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) < 8)
_mixed_ipv6_address = ("::ffff:" + ipv4_address).setName("mixed IPv6 address")
ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName("IPv6 address")).setName("IPv6 address")
"IPv6 address (long, short, or mixed form)"
mac_address = Regex(r'[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}').setName("MAC address")
"MAC address xx:xx:xx:xx:xx (may also have '-' or '.' delimiters)"
@staticmethod
def convertToDate(fmt="%Y-%m-%d"):
"""
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
"""
def cvt_fn(s,l,t):
try:
return datetime.strptime(t[0], fmt).date()
except ValueError as ve:
raise ParseException(s, l, str(ve))
return cvt_fn
@staticmethod
def convertToDatetime(fmt="%Y-%m-%dT%H:%M:%S.%f"):
"""
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
"""
def cvt_fn(s,l,t):
try:
return datetime.strptime(t[0], fmt)
except ValueError as ve:
raise ParseException(s, l, str(ve))
return cvt_fn
iso8601_date = Regex(r'(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?').setName("ISO8601 date")
"ISO8601 date (C{yyyy-mm-dd})"
iso8601_datetime = Regex(r'(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?').setName("ISO8601 datetime")
"ISO8601 datetime (C{yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)}) - trailing seconds, milliseconds, and timezone optional; accepts separating C{'T'} or C{' '}"
uuid = Regex(r'[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}').setName("UUID")
"UUID (C{xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx})"
_html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
@staticmethod
def stripHTMLTags(s, l, tokens):
"""
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
"""
return pyparsing_common._html_stripper.transformString(tokens[0])
_commasepitem = Combine(OneOrMore(~Literal(",") + ~LineEnd() + Word(printables, excludeChars=',')
+ Optional( White(" \t") ) ) ).streamline().setName("commaItem")
comma_separated_list = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("comma separated list")
"""Predefined expression of 1 or more printable words or quoted strings, separated by commas."""
upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
"""Parse action to convert tokens to upper case."""
downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
"""Parse action to convert tokens to lower case."""
if __name__ == "__main__":
selectToken = CaselessLiteral("select")
fromToken = CaselessLiteral("from")
ident = Word(alphas, alphanums + "_$")
columnName = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
columnNameList = Group(delimitedList(columnName)).setName("columns")
columnSpec = ('*' | columnNameList)
tableName = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
tableNameList = Group(delimitedList(tableName)).setName("tables")
simpleSQL = selectToken("command") + columnSpec("columns") + fromToken + tableNameList("tables")
# demo runTests method, including embedded comments in test string
simpleSQL.runTests("""
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
""")
pyparsing_common.number.runTests("""
100
-100
+100
3.14159
6.02e23
1e-12
""")
# any int or real number, returned as float
pyparsing_common.fnumber.runTests("""
100
-100
+100
3.14159
6.02e23
1e-12
""")
pyparsing_common.hex_integer.runTests("""
100
FF
""")
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests("""
12345678-1234-5678-1234-567812345678
""")
pip/_vendor/ipaddress.py 0000644 00000234460 14751155150 0011335 0 ustar 00 # Copyright 2007 Google Inc.
# Licensed to PSF under a Contributor Agreement.
"""A fast, lightweight IPv4/IPv6 manipulation library in Python.
This library is used to create/poke/manipulate IPv4 and IPv6 addresses
and networks.
"""
from __future__ import unicode_literals
import itertools
import struct
__version__ = '1.0.17'
# Compatibility functions
_compat_int_types = (int,)
try:
_compat_int_types = (int, long)
except NameError:
pass
try:
_compat_str = unicode
except NameError:
_compat_str = str
assert bytes != str
if b'\0'[0] == 0: # Python 3 semantics
def _compat_bytes_to_byte_vals(byt):
return byt
else:
def _compat_bytes_to_byte_vals(byt):
return [struct.unpack(b'!B', b)[0] for b in byt]
try:
_compat_int_from_byte_vals = int.from_bytes
except AttributeError:
def _compat_int_from_byte_vals(bytvals, endianess):
assert endianess == 'big'
res = 0
for bv in bytvals:
assert isinstance(bv, _compat_int_types)
res = (res << 8) + bv
return res
def _compat_to_bytes(intval, length, endianess):
assert isinstance(intval, _compat_int_types)
assert endianess == 'big'
if length == 4:
if intval < 0 or intval >= 2 ** 32:
raise struct.error("integer out of range for 'I' format code")
return struct.pack(b'!I', intval)
elif length == 16:
if intval < 0 or intval >= 2 ** 128:
raise struct.error("integer out of range for 'QQ' format code")
return struct.pack(b'!QQ', intval >> 64, intval & 0xffffffffffffffff)
else:
raise NotImplementedError()
if hasattr(int, 'bit_length'):
# Not int.bit_length , since that won't work in 2.7 where long exists
def _compat_bit_length(i):
return i.bit_length()
else:
def _compat_bit_length(i):
for res in itertools.count():
if i >> res == 0:
return res
def _compat_range(start, end, step=1):
assert step > 0
i = start
while i < end:
yield i
i += step
class _TotalOrderingMixin(object):
__slots__ = ()
# Helper that derives the other comparison operations from
# __lt__ and __eq__
# We avoid functools.total_ordering because it doesn't handle
# NotImplemented correctly yet (http://bugs.python.org/issue10042)
def __eq__(self, other):
raise NotImplementedError
def __ne__(self, other):
equal = self.__eq__(other)
if equal is NotImplemented:
return NotImplemented
return not equal
def __lt__(self, other):
raise NotImplementedError
def __le__(self, other):
less = self.__lt__(other)
if less is NotImplemented or not less:
return self.__eq__(other)
return less
def __gt__(self, other):
less = self.__lt__(other)
if less is NotImplemented:
return NotImplemented
equal = self.__eq__(other)
if equal is NotImplemented:
return NotImplemented
return not (less or equal)
def __ge__(self, other):
less = self.__lt__(other)
if less is NotImplemented:
return NotImplemented
return not less
IPV4LENGTH = 32
IPV6LENGTH = 128
class AddressValueError(ValueError):
"""A Value Error related to the address."""
class NetmaskValueError(ValueError):
"""A Value Error related to the netmask."""
def ip_address(address):
"""Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP address. Either IPv4 or
IPv6 addresses may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Address or IPv6Address object.
Raises:
ValueError: if the *address* passed isn't either a v4 or a v6
address
"""
try:
return IPv4Address(address)
except (AddressValueError, NetmaskValueError):
pass
try:
return IPv6Address(address)
except (AddressValueError, NetmaskValueError):
pass
if isinstance(address, bytes):
raise AddressValueError(
'%r does not appear to be an IPv4 or IPv6 address. '
'Did you pass in a bytes (str in Python 2) instead of'
' a unicode object?' % address)
raise ValueError('%r does not appear to be an IPv4 or IPv6 address' %
address)
def ip_network(address, strict=True):
"""Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP network. Either IPv4 or
IPv6 networks may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Network or IPv6Network object.
Raises:
ValueError: if the string passed isn't either a v4 or a v6
address. Or if the network has host bits set.
"""
try:
return IPv4Network(address, strict)
except (AddressValueError, NetmaskValueError):
pass
try:
return IPv6Network(address, strict)
except (AddressValueError, NetmaskValueError):
pass
if isinstance(address, bytes):
raise AddressValueError(
'%r does not appear to be an IPv4 or IPv6 network. '
'Did you pass in a bytes (str in Python 2) instead of'
' a unicode object?' % address)
raise ValueError('%r does not appear to be an IPv4 or IPv6 network' %
address)
def ip_interface(address):
"""Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP address. Either IPv4 or
IPv6 addresses may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Interface or IPv6Interface object.
Raises:
ValueError: if the string passed isn't either a v4 or a v6
address.
Notes:
The IPv?Interface classes describe an Address on a particular
Network, so they're basically a combination of both the Address
and Network classes.
"""
try:
return IPv4Interface(address)
except (AddressValueError, NetmaskValueError):
pass
try:
return IPv6Interface(address)
except (AddressValueError, NetmaskValueError):
pass
raise ValueError('%r does not appear to be an IPv4 or IPv6 interface' %
address)
def v4_int_to_packed(address):
"""Represent an address as 4 packed bytes in network (big-endian) order.
Args:
address: An integer representation of an IPv4 IP address.
Returns:
The integer address packed as 4 bytes in network (big-endian) order.
Raises:
ValueError: If the integer is negative or too large to be an
IPv4 IP address.
"""
try:
return _compat_to_bytes(address, 4, 'big')
except (struct.error, OverflowError):
raise ValueError("Address negative or too large for IPv4")
def v6_int_to_packed(address):
"""Represent an address as 16 packed bytes in network (big-endian) order.
Args:
address: An integer representation of an IPv6 IP address.
Returns:
The integer address packed as 16 bytes in network (big-endian) order.
"""
try:
return _compat_to_bytes(address, 16, 'big')
except (struct.error, OverflowError):
raise ValueError("Address negative or too large for IPv6")
def _split_optional_netmask(address):
"""Helper to split the netmask and raise AddressValueError if needed"""
addr = _compat_str(address).split('/')
if len(addr) > 2:
raise AddressValueError("Only one '/' permitted in %r" % address)
return addr
def _find_address_range(addresses):
"""Find a sequence of sorted deduplicated IPv#Address.
Args:
addresses: a list of IPv#Address objects.
Yields:
A tuple containing the first and last IP addresses in the sequence.
"""
it = iter(addresses)
first = last = next(it)
for ip in it:
if ip._ip != last._ip + 1:
yield first, last
first = ip
last = ip
yield first, last
def _count_righthand_zero_bits(number, bits):
"""Count the number of zero bits on the right hand side.
Args:
number: an integer.
bits: maximum number of bits to count.
Returns:
The number of zero bits on the right hand side of the number.
"""
if number == 0:
return bits
return min(bits, _compat_bit_length(~number & (number - 1)))
def summarize_address_range(first, last):
"""Summarize a network range given the first and last IP addresses.
Example:
>>> list(summarize_address_range(IPv4Address('192.0.2.0'),
... IPv4Address('192.0.2.130')))
... #doctest: +NORMALIZE_WHITESPACE
[IPv4Network('192.0.2.0/25'), IPv4Network('192.0.2.128/31'),
IPv4Network('192.0.2.130/32')]
Args:
first: the first IPv4Address or IPv6Address in the range.
last: the last IPv4Address or IPv6Address in the range.
Returns:
An iterator of the summarized IPv(4|6) network objects.
Raise:
TypeError:
If the first and last objects are not IP addresses.
If the first and last objects are not the same version.
ValueError:
If the last object is not greater than the first.
If the version of the first address is not 4 or 6.
"""
if (not (isinstance(first, _BaseAddress) and
isinstance(last, _BaseAddress))):
raise TypeError('first and last must be IP addresses, not networks')
if first.version != last.version:
raise TypeError("%s and %s are not of the same version" % (
first, last))
if first > last:
raise ValueError('last IP address must be greater than first')
if first.version == 4:
ip = IPv4Network
elif first.version == 6:
ip = IPv6Network
else:
raise ValueError('unknown IP version')
ip_bits = first._max_prefixlen
first_int = first._ip
last_int = last._ip
while first_int <= last_int:
nbits = min(_count_righthand_zero_bits(first_int, ip_bits),
_compat_bit_length(last_int - first_int + 1) - 1)
net = ip((first_int, ip_bits - nbits))
yield net
first_int += 1 << nbits
if first_int - 1 == ip._ALL_ONES:
break
def _collapse_addresses_internal(addresses):
"""Loops through the addresses, collapsing concurrent netblocks.
Example:
ip1 = IPv4Network('192.0.2.0/26')
ip2 = IPv4Network('192.0.2.64/26')
ip3 = IPv4Network('192.0.2.128/26')
ip4 = IPv4Network('192.0.2.192/26')
_collapse_addresses_internal([ip1, ip2, ip3, ip4]) ->
[IPv4Network('192.0.2.0/24')]
This shouldn't be called directly; it is called via
collapse_addresses([]).
Args:
addresses: A list of IPv4Network's or IPv6Network's
Returns:
A list of IPv4Network's or IPv6Network's depending on what we were
passed.
"""
# First merge
to_merge = list(addresses)
subnets = {}
while to_merge:
net = to_merge.pop()
supernet = net.supernet()
existing = subnets.get(supernet)
if existing is None:
subnets[supernet] = net
elif existing != net:
# Merge consecutive subnets
del subnets[supernet]
to_merge.append(supernet)
# Then iterate over resulting networks, skipping subsumed subnets
last = None
for net in sorted(subnets.values()):
if last is not None:
# Since they are sorted,
# last.network_address <= net.network_address is a given.
if last.broadcast_address >= net.broadcast_address:
continue
yield net
last = net
def collapse_addresses(addresses):
"""Collapse a list of IP objects.
Example:
collapse_addresses([IPv4Network('192.0.2.0/25'),
IPv4Network('192.0.2.128/25')]) ->
[IPv4Network('192.0.2.0/24')]
Args:
addresses: An iterator of IPv4Network or IPv6Network objects.
Returns:
An iterator of the collapsed IPv(4|6)Network objects.
Raises:
TypeError: If passed a list of mixed version objects.
"""
addrs = []
ips = []
nets = []
# split IP addresses and networks
for ip in addresses:
if isinstance(ip, _BaseAddress):
if ips and ips[-1]._version != ip._version:
raise TypeError("%s and %s are not of the same version" % (
ip, ips[-1]))
ips.append(ip)
elif ip._prefixlen == ip._max_prefixlen:
if ips and ips[-1]._version != ip._version:
raise TypeError("%s and %s are not of the same version" % (
ip, ips[-1]))
try:
ips.append(ip.ip)
except AttributeError:
ips.append(ip.network_address)
else:
if nets and nets[-1]._version != ip._version:
raise TypeError("%s and %s are not of the same version" % (
ip, nets[-1]))
nets.append(ip)
# sort and dedup
ips = sorted(set(ips))
# find consecutive address ranges in the sorted sequence and summarize them
if ips:
for first, last in _find_address_range(ips):
addrs.extend(summarize_address_range(first, last))
return _collapse_addresses_internal(addrs + nets)
def get_mixed_type_key(obj):
"""Return a key suitable for sorting between networks and addresses.
Address and Network objects are not sortable by default; they're
fundamentally different so the expression
IPv4Address('192.0.2.0') <= IPv4Network('192.0.2.0/24')
doesn't make any sense. There are some times however, where you may wish
to have ipaddress sort these for you anyway. If you need to do this, you
can use this function as the key= argument to sorted().
Args:
obj: either a Network or Address object.
Returns:
appropriate key.
"""
if isinstance(obj, _BaseNetwork):
return obj._get_networks_key()
elif isinstance(obj, _BaseAddress):
return obj._get_address_key()
return NotImplemented
class _IPAddressBase(_TotalOrderingMixin):
"""The mother class."""
__slots__ = ()
@property
def exploded(self):
"""Return the longhand version of the IP address as a string."""
return self._explode_shorthand_ip_string()
@property
def compressed(self):
"""Return the shorthand version of the IP address as a string."""
return _compat_str(self)
@property
def reverse_pointer(self):
"""The name of the reverse DNS pointer for the IP address, e.g.:
>>> ipaddress.ip_address("127.0.0.1").reverse_pointer
'1.0.0.127.in-addr.arpa'
>>> ipaddress.ip_address("2001:db8::1").reverse_pointer
'1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.8.b.d.0.1.0.0.2.ip6.arpa'
"""
return self._reverse_pointer()
@property
def version(self):
msg = '%200s has no version specified' % (type(self),)
raise NotImplementedError(msg)
def _check_int_address(self, address):
if address < 0:
msg = "%d (< 0) is not permitted as an IPv%d address"
raise AddressValueError(msg % (address, self._version))
if address > self._ALL_ONES:
msg = "%d (>= 2**%d) is not permitted as an IPv%d address"
raise AddressValueError(msg % (address, self._max_prefixlen,
self._version))
def _check_packed_address(self, address, expected_len):
address_len = len(address)
if address_len != expected_len:
msg = (
'%r (len %d != %d) is not permitted as an IPv%d address. '
'Did you pass in a bytes (str in Python 2) instead of'
' a unicode object?'
)
raise AddressValueError(msg % (address, address_len,
expected_len, self._version))
@classmethod
def _ip_int_from_prefix(cls, prefixlen):
"""Turn the prefix length into a bitwise netmask
Args:
prefixlen: An integer, the prefix length.
Returns:
An integer.
"""
return cls._ALL_ONES ^ (cls._ALL_ONES >> prefixlen)
@classmethod
def _prefix_from_ip_int(cls, ip_int):
"""Return prefix length from the bitwise netmask.
Args:
ip_int: An integer, the netmask in expanded bitwise format
Returns:
An integer, the prefix length.
Raises:
ValueError: If the input intermingles zeroes & ones
"""
trailing_zeroes = _count_righthand_zero_bits(ip_int,
cls._max_prefixlen)
prefixlen = cls._max_prefixlen - trailing_zeroes
leading_ones = ip_int >> trailing_zeroes
all_ones = (1 << prefixlen) - 1
if leading_ones != all_ones:
byteslen = cls._max_prefixlen // 8
details = _compat_to_bytes(ip_int, byteslen, 'big')
msg = 'Netmask pattern %r mixes zeroes & ones'
raise ValueError(msg % details)
return prefixlen
@classmethod
def _report_invalid_netmask(cls, netmask_str):
msg = '%r is not a valid netmask' % netmask_str
raise NetmaskValueError(msg)
@classmethod
def _prefix_from_prefix_string(cls, prefixlen_str):
"""Return prefix length from a numeric string
Args:
prefixlen_str: The string to be converted
Returns:
An integer, the prefix length.
Raises:
NetmaskValueError: If the input is not a valid netmask
"""
# int allows a leading +/- as well as surrounding whitespace,
# so we ensure that isn't the case
if not _BaseV4._DECIMAL_DIGITS.issuperset(prefixlen_str):
cls._report_invalid_netmask(prefixlen_str)
try:
prefixlen = int(prefixlen_str)
except ValueError:
cls._report_invalid_netmask(prefixlen_str)
if not (0 <= prefixlen <= cls._max_prefixlen):
cls._report_invalid_netmask(prefixlen_str)
return prefixlen
@classmethod
def _prefix_from_ip_string(cls, ip_str):
"""Turn a netmask/hostmask string into a prefix length
Args:
ip_str: The netmask/hostmask to be converted
Returns:
An integer, the prefix length.
Raises:
NetmaskValueError: If the input is not a valid netmask/hostmask
"""
# Parse the netmask/hostmask like an IP address.
try:
ip_int = cls._ip_int_from_string(ip_str)
except AddressValueError:
cls._report_invalid_netmask(ip_str)
# Try matching a netmask (this would be /1*0*/ as a bitwise regexp).
# Note that the two ambiguous cases (all-ones and all-zeroes) are
# treated as netmasks.
try:
return cls._prefix_from_ip_int(ip_int)
except ValueError:
pass
# Invert the bits, and try matching a /0+1+/ hostmask instead.
ip_int ^= cls._ALL_ONES
try:
return cls._prefix_from_ip_int(ip_int)
except ValueError:
cls._report_invalid_netmask(ip_str)
def __reduce__(self):
return self.__class__, (_compat_str(self),)
class _BaseAddress(_IPAddressBase):
"""A generic IP object.
This IP class contains the version independent methods which are
used by single IP addresses.
"""
__slots__ = ()
def __int__(self):
return self._ip
def __eq__(self, other):
try:
return (self._ip == other._ip and
self._version == other._version)
except AttributeError:
return NotImplemented
def __lt__(self, other):
if not isinstance(other, _IPAddressBase):
return NotImplemented
if not isinstance(other, _BaseAddress):
raise TypeError('%s and %s are not of the same type' % (
self, other))
if self._version != other._version:
raise TypeError('%s and %s are not of the same version' % (
self, other))
if self._ip != other._ip:
return self._ip < other._ip
return False
# Shorthand for Integer addition and subtraction. This is not
# meant to ever support addition/subtraction of addresses.
def __add__(self, other):
if not isinstance(other, _compat_int_types):
return NotImplemented
return self.__class__(int(self) + other)
def __sub__(self, other):
if not isinstance(other, _compat_int_types):
return NotImplemented
return self.__class__(int(self) - other)
def __repr__(self):
return '%s(%r)' % (self.__class__.__name__, _compat_str(self))
def __str__(self):
return _compat_str(self._string_from_ip_int(self._ip))
def __hash__(self):
return hash(hex(int(self._ip)))
def _get_address_key(self):
return (self._version, self)
def __reduce__(self):
return self.__class__, (self._ip,)
class _BaseNetwork(_IPAddressBase):
"""A generic IP network object.
This IP class contains the version independent methods which are
used by networks.
"""
def __init__(self, address):
self._cache = {}
def __repr__(self):
return '%s(%r)' % (self.__class__.__name__, _compat_str(self))
def __str__(self):
return '%s/%d' % (self.network_address, self.prefixlen)
def hosts(self):
"""Generate Iterator over usable hosts in a network.
This is like __iter__ except it doesn't return the network
or broadcast addresses.
"""
network = int(self.network_address)
broadcast = int(self.broadcast_address)
for x in _compat_range(network + 1, broadcast):
yield self._address_class(x)
def __iter__(self):
network = int(self.network_address)
broadcast = int(self.broadcast_address)
for x in _compat_range(network, broadcast + 1):
yield self._address_class(x)
def __getitem__(self, n):
network = int(self.network_address)
broadcast = int(self.broadcast_address)
if n >= 0:
if network + n > broadcast:
raise IndexError('address out of range')
return self._address_class(network + n)
else:
n += 1
if broadcast + n < network:
raise IndexError('address out of range')
return self._address_class(broadcast + n)
def __lt__(self, other):
if not isinstance(other, _IPAddressBase):
return NotImplemented
if not isinstance(other, _BaseNetwork):
raise TypeError('%s and %s are not of the same type' % (
self, other))
if self._version != other._version:
raise TypeError('%s and %s are not of the same version' % (
self, other))
if self.network_address != other.network_address:
return self.network_address < other.network_address
if self.netmask != other.netmask:
return self.netmask < other.netmask
return False
def __eq__(self, other):
try:
return (self._version == other._version and
self.network_address == other.network_address and
int(self.netmask) == int(other.netmask))
except AttributeError:
return NotImplemented
def __hash__(self):
return hash(int(self.network_address) ^ int(self.netmask))
def __contains__(self, other):
# always false if one is v4 and the other is v6.
if self._version != other._version:
return False
# dealing with another network.
if isinstance(other, _BaseNetwork):
return False
# dealing with another address
else:
# address
return (int(self.network_address) <= int(other._ip) <=
int(self.broadcast_address))
def overlaps(self, other):
"""Tell if self is partly contained in other."""
return self.network_address in other or (
self.broadcast_address in other or (
other.network_address in self or (
other.broadcast_address in self)))
@property
def broadcast_address(self):
x = self._cache.get('broadcast_address')
if x is None:
x = self._address_class(int(self.network_address) |
int(self.hostmask))
self._cache['broadcast_address'] = x
return x
@property
def hostmask(self):
x = self._cache.get('hostmask')
if x is None:
x = self._address_class(int(self.netmask) ^ self._ALL_ONES)
self._cache['hostmask'] = x
return x
@property
def with_prefixlen(self):
return '%s/%d' % (self.network_address, self._prefixlen)
@property
def with_netmask(self):
return '%s/%s' % (self.network_address, self.netmask)
@property
def with_hostmask(self):
return '%s/%s' % (self.network_address, self.hostmask)
@property
def num_addresses(self):
"""Number of hosts in the current subnet."""
return int(self.broadcast_address) - int(self.network_address) + 1
@property
def _address_class(self):
# Returning bare address objects (rather than interfaces) allows for
# more consistent behaviour across the network address, broadcast
# address and individual host addresses.
msg = '%200s has no associated address class' % (type(self),)
raise NotImplementedError(msg)
@property
def prefixlen(self):
return self._prefixlen
def address_exclude(self, other):
"""Remove an address from a larger block.
For example:
addr1 = ip_network('192.0.2.0/28')
addr2 = ip_network('192.0.2.1/32')
list(addr1.address_exclude(addr2)) =
[IPv4Network('192.0.2.0/32'), IPv4Network('192.0.2.2/31'),
IPv4Network('192.0.2.4/30'), IPv4Network('192.0.2.8/29')]
or IPv6:
addr1 = ip_network('2001:db8::1/32')
addr2 = ip_network('2001:db8::1/128')
list(addr1.address_exclude(addr2)) =
[ip_network('2001:db8::1/128'),
ip_network('2001:db8::2/127'),
ip_network('2001:db8::4/126'),
ip_network('2001:db8::8/125'),
...
ip_network('2001:db8:8000::/33')]
Args:
other: An IPv4Network or IPv6Network object of the same type.
Returns:
An iterator of the IPv(4|6)Network objects which is self
minus other.
Raises:
TypeError: If self and other are of differing address
versions, or if other is not a network object.
ValueError: If other is not completely contained by self.
"""
if not self._version == other._version:
raise TypeError("%s and %s are not of the same version" % (
self, other))
if not isinstance(other, _BaseNetwork):
raise TypeError("%s is not a network object" % other)
if not other.subnet_of(self):
raise ValueError('%s not contained in %s' % (other, self))
if other == self:
return
# Make sure we're comparing the network of other.
other = other.__class__('%s/%s' % (other.network_address,
other.prefixlen))
s1, s2 = self.subnets()
while s1 != other and s2 != other:
if other.subnet_of(s1):
yield s2
s1, s2 = s1.subnets()
elif other.subnet_of(s2):
yield s1
s1, s2 = s2.subnets()
else:
# If we got here, there's a bug somewhere.
raise AssertionError('Error performing exclusion: '
's1: %s s2: %s other: %s' %
(s1, s2, other))
if s1 == other:
yield s2
elif s2 == other:
yield s1
else:
# If we got here, there's a bug somewhere.
raise AssertionError('Error performing exclusion: '
's1: %s s2: %s other: %s' %
(s1, s2, other))
def compare_networks(self, other):
"""Compare two IP objects.
This is only concerned about the comparison of the integer
representation of the network addresses. This means that the
host bits aren't considered at all in this method. If you want
to compare host bits, you can easily enough do a
'HostA._ip < HostB._ip'
Args:
other: An IP object.
Returns:
If the IP versions of self and other are the same, returns:
-1 if self < other:
eg: IPv4Network('192.0.2.0/25') < IPv4Network('192.0.2.128/25')
IPv6Network('2001:db8::1000/124') <
IPv6Network('2001:db8::2000/124')
0 if self == other
eg: IPv4Network('192.0.2.0/24') == IPv4Network('192.0.2.0/24')
IPv6Network('2001:db8::1000/124') ==
IPv6Network('2001:db8::1000/124')
1 if self > other
eg: IPv4Network('192.0.2.128/25') > IPv4Network('192.0.2.0/25')
IPv6Network('2001:db8::2000/124') >
IPv6Network('2001:db8::1000/124')
Raises:
TypeError if the IP versions are different.
"""
# does this need to raise a ValueError?
if self._version != other._version:
raise TypeError('%s and %s are not of the same type' % (
self, other))
# self._version == other._version below here:
if self.network_address < other.network_address:
return -1
if self.network_address > other.network_address:
return 1
# self.network_address == other.network_address below here:
if self.netmask < other.netmask:
return -1
if self.netmask > other.netmask:
return 1
return 0
def _get_networks_key(self):
"""Network-only key function.
Returns an object that identifies this address' network and
netmask. This function is a suitable "key" argument for sorted()
and list.sort().
"""
return (self._version, self.network_address, self.netmask)
def subnets(self, prefixlen_diff=1, new_prefix=None):
"""The subnets which join to make the current subnet.
In the case that self contains only one IP
(self._prefixlen == 32 for IPv4 or self._prefixlen == 128
for IPv6), yield an iterator with just ourself.
Args:
prefixlen_diff: An integer, the amount the prefix length
should be increased by. This should not be set if
new_prefix is also set.
new_prefix: The desired new prefix length. This must be a
larger number (smaller prefix) than the existing prefix.
This should not be set if prefixlen_diff is also set.
Returns:
An iterator of IPv(4|6) objects.
Raises:
ValueError: The prefixlen_diff is too small or too large.
OR
prefixlen_diff and new_prefix are both set or new_prefix
is a smaller number than the current prefix (smaller
number means a larger network)
"""
if self._prefixlen == self._max_prefixlen:
yield self
return
if new_prefix is not None:
if new_prefix < self._prefixlen:
raise ValueError('new prefix must be longer')
if prefixlen_diff != 1:
raise ValueError('cannot set prefixlen_diff and new_prefix')
prefixlen_diff = new_prefix - self._prefixlen
if prefixlen_diff < 0:
raise ValueError('prefix length diff must be > 0')
new_prefixlen = self._prefixlen + prefixlen_diff
if new_prefixlen > self._max_prefixlen:
raise ValueError(
'prefix length diff %d is invalid for netblock %s' % (
new_prefixlen, self))
start = int(self.network_address)
end = int(self.broadcast_address) + 1
step = (int(self.hostmask) + 1) >> prefixlen_diff
for new_addr in _compat_range(start, end, step):
current = self.__class__((new_addr, new_prefixlen))
yield current
def supernet(self, prefixlen_diff=1, new_prefix=None):
"""The supernet containing the current network.
Args:
prefixlen_diff: An integer, the amount the prefix length of
the network should be decreased by. For example, given a
/24 network and a prefixlen_diff of 3, a supernet with a
/21 netmask is returned.
Returns:
An IPv4 network object.
Raises:
ValueError: If self.prefixlen - prefixlen_diff < 0. I.e., you have
a negative prefix length.
OR
If prefixlen_diff and new_prefix are both set or new_prefix is a
larger number than the current prefix (larger number means a
smaller network)
"""
if self._prefixlen == 0:
return self
if new_prefix is not None:
if new_prefix > self._prefixlen:
raise ValueError('new prefix must be shorter')
if prefixlen_diff != 1:
raise ValueError('cannot set prefixlen_diff and new_prefix')
prefixlen_diff = self._prefixlen - new_prefix
new_prefixlen = self.prefixlen - prefixlen_diff
if new_prefixlen < 0:
raise ValueError(
'current prefixlen is %d, cannot have a prefixlen_diff of %d' %
(self.prefixlen, prefixlen_diff))
return self.__class__((
int(self.network_address) & (int(self.netmask) << prefixlen_diff),
new_prefixlen
))
@property
def is_multicast(self):
"""Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is a multicast address.
See RFC 2373 2.7 for details.
"""
return (self.network_address.is_multicast and
self.broadcast_address.is_multicast)
def subnet_of(self, other):
# always false if one is v4 and the other is v6.
if self._version != other._version:
return False
# dealing with another network.
if (hasattr(other, 'network_address') and
hasattr(other, 'broadcast_address')):
return (other.network_address <= self.network_address and
other.broadcast_address >= self.broadcast_address)
# dealing with another address
else:
raise TypeError('Unable to test subnet containment with element '
'of type %s' % type(other))
def supernet_of(self, other):
# always false if one is v4 and the other is v6.
if self._version != other._version:
return False
# dealing with another network.
if (hasattr(other, 'network_address') and
hasattr(other, 'broadcast_address')):
return (other.network_address >= self.network_address and
other.broadcast_address <= self.broadcast_address)
# dealing with another address
else:
raise TypeError('Unable to test subnet containment with element '
'of type %s' % type(other))
@property
def is_reserved(self):
"""Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within one of the
reserved IPv6 Network ranges.
"""
return (self.network_address.is_reserved and
self.broadcast_address.is_reserved)
@property
def is_link_local(self):
"""Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is reserved per RFC 4291.
"""
return (self.network_address.is_link_local and
self.broadcast_address.is_link_local)
@property
def is_private(self):
"""Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv4-special-registry or iana-ipv6-special-registry.
"""
return (self.network_address.is_private and
self.broadcast_address.is_private)
@property
def is_global(self):
"""Test if this address is allocated for public networks.
Returns:
A boolean, True if the address is not reserved per
iana-ipv4-special-registry or iana-ipv6-special-registry.
"""
return not self.is_private
@property
def is_unspecified(self):
"""Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 2373 2.5.2.
"""
return (self.network_address.is_unspecified and
self.broadcast_address.is_unspecified)
@property
def is_loopback(self):
"""Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback address as defined in
RFC 2373 2.5.3.
"""
return (self.network_address.is_loopback and
self.broadcast_address.is_loopback)
class _BaseV4(object):
"""Base IPv4 object.
The following methods are used by IPv4 objects in both single IP
addresses and networks.
"""
__slots__ = ()
_version = 4
# Equivalent to 255.255.255.255 or 32 bits of 1's.
_ALL_ONES = (2 ** IPV4LENGTH) - 1
_DECIMAL_DIGITS = frozenset('0123456789')
# the valid octets for host and netmasks. only useful for IPv4.
_valid_mask_octets = frozenset([255, 254, 252, 248, 240, 224, 192, 128, 0])
_max_prefixlen = IPV4LENGTH
# There are only a handful of valid v4 netmasks, so we cache them all
# when constructed (see _make_netmask()).
_netmask_cache = {}
def _explode_shorthand_ip_string(self):
return _compat_str(self)
@classmethod
def _make_netmask(cls, arg):
"""Make a (netmask, prefix_len) tuple from the given argument.
Argument can be:
- an integer (the prefix length)
- a string representing the prefix length (e.g. "24")
- a string representing the prefix netmask (e.g. "255.255.255.0")
"""
if arg not in cls._netmask_cache:
if isinstance(arg, _compat_int_types):
prefixlen = arg
else:
try:
# Check for a netmask in prefix length form
prefixlen = cls._prefix_from_prefix_string(arg)
except NetmaskValueError:
# Check for a netmask or hostmask in dotted-quad form.
# This may raise NetmaskValueError.
prefixlen = cls._prefix_from_ip_string(arg)
netmask = IPv4Address(cls._ip_int_from_prefix(prefixlen))
cls._netmask_cache[arg] = netmask, prefixlen
return cls._netmask_cache[arg]
@classmethod
def _ip_int_from_string(cls, ip_str):
"""Turn the given IP string into an integer for comparison.
Args:
ip_str: A string, the IP ip_str.
Returns:
The IP ip_str as an integer.
Raises:
AddressValueError: if ip_str isn't a valid IPv4 Address.
"""
if not ip_str:
raise AddressValueError('Address cannot be empty')
octets = ip_str.split('.')
if len(octets) != 4:
raise AddressValueError("Expected 4 octets in %r" % ip_str)
try:
return _compat_int_from_byte_vals(
map(cls._parse_octet, octets), 'big')
except ValueError as exc:
raise AddressValueError("%s in %r" % (exc, ip_str))
@classmethod
def _parse_octet(cls, octet_str):
"""Convert a decimal octet into an integer.
Args:
octet_str: A string, the number to parse.
Returns:
The octet as an integer.
Raises:
ValueError: if the octet isn't strictly a decimal from [0..255].
"""
if not octet_str:
raise ValueError("Empty octet not permitted")
# Whitelist the characters, since int() allows a lot of bizarre stuff.
if not cls._DECIMAL_DIGITS.issuperset(octet_str):
msg = "Only decimal digits permitted in %r"
raise ValueError(msg % octet_str)
# We do the length check second, since the invalid character error
# is likely to be more informative for the user
if len(octet_str) > 3:
msg = "At most 3 characters permitted in %r"
raise ValueError(msg % octet_str)
# Convert to integer (we know digits are legal)
octet_int = int(octet_str, 10)
# Any octets that look like they *might* be written in octal,
# and which don't look exactly the same in both octal and
# decimal are rejected as ambiguous
if octet_int > 7 and octet_str[0] == '0':
msg = "Ambiguous (octal/decimal) value in %r not permitted"
raise ValueError(msg % octet_str)
if octet_int > 255:
raise ValueError("Octet %d (> 255) not permitted" % octet_int)
return octet_int
@classmethod
def _string_from_ip_int(cls, ip_int):
"""Turns a 32-bit integer into dotted decimal notation.
Args:
ip_int: An integer, the IP address.
Returns:
The IP address as a string in dotted decimal notation.
"""
return '.'.join(_compat_str(struct.unpack(b'!B', b)[0]
if isinstance(b, bytes)
else b)
for b in _compat_to_bytes(ip_int, 4, 'big'))
def _is_hostmask(self, ip_str):
"""Test if the IP string is a hostmask (rather than a netmask).
Args:
ip_str: A string, the potential hostmask.
Returns:
A boolean, True if the IP string is a hostmask.
"""
bits = ip_str.split('.')
try:
parts = [x for x in map(int, bits) if x in self._valid_mask_octets]
except ValueError:
return False
if len(parts) != len(bits):
return False
if parts[0] < parts[-1]:
return True
return False
def _reverse_pointer(self):
"""Return the reverse DNS pointer name for the IPv4 address.
This implements the method described in RFC1035 3.5.
"""
reverse_octets = _compat_str(self).split('.')[::-1]
return '.'.join(reverse_octets) + '.in-addr.arpa'
@property
def max_prefixlen(self):
return self._max_prefixlen
@property
def version(self):
return self._version
class IPv4Address(_BaseV4, _BaseAddress):
"""Represent and manipulate single IPv4 Addresses."""
__slots__ = ('_ip', '__weakref__')
def __init__(self, address):
"""
Args:
address: A string or integer representing the IP
Additionally, an integer can be passed, so
IPv4Address('192.0.2.1') == IPv4Address(3221225985).
or, more generally
IPv4Address(int(IPv4Address('192.0.2.1'))) ==
IPv4Address('192.0.2.1')
Raises:
AddressValueError: If ipaddress isn't a valid IPv4 address.
"""
# Efficient constructor from integer.
if isinstance(address, _compat_int_types):
self._check_int_address(address)
self._ip = address
return
# Constructing from a packed address
if isinstance(address, bytes):
self._check_packed_address(address, 4)
bvs = _compat_bytes_to_byte_vals(address)
self._ip = _compat_int_from_byte_vals(bvs, 'big')
return
# Assume input argument to be string or any object representation
# which converts into a formatted IP string.
addr_str = _compat_str(address)
if '/' in addr_str:
raise AddressValueError("Unexpected '/' in %r" % address)
self._ip = self._ip_int_from_string(addr_str)
@property
def packed(self):
"""The binary representation of this address."""
return v4_int_to_packed(self._ip)
@property
def is_reserved(self):
"""Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within the
reserved IPv4 Network range.
"""
return self in self._constants._reserved_network
@property
def is_private(self):
"""Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv4-special-registry.
"""
return any(self in net for net in self._constants._private_networks)
@property
def is_global(self):
return (
self not in self._constants._public_network and
not self.is_private)
@property
def is_multicast(self):
"""Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is multicast.
See RFC 3171 for details.
"""
return self in self._constants._multicast_network
@property
def is_unspecified(self):
"""Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 5735 3.
"""
return self == self._constants._unspecified_address
@property
def is_loopback(self):
"""Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback per RFC 3330.
"""
return self in self._constants._loopback_network
@property
def is_link_local(self):
"""Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is link-local per RFC 3927.
"""
return self in self._constants._linklocal_network
class IPv4Interface(IPv4Address):
def __init__(self, address):
if isinstance(address, (bytes, _compat_int_types)):
IPv4Address.__init__(self, address)
self.network = IPv4Network(self._ip)
self._prefixlen = self._max_prefixlen
return
if isinstance(address, tuple):
IPv4Address.__init__(self, address[0])
if len(address) > 1:
self._prefixlen = int(address[1])
else:
self._prefixlen = self._max_prefixlen
self.network = IPv4Network(address, strict=False)
self.netmask = self.network.netmask
self.hostmask = self.network.hostmask
return
addr = _split_optional_netmask(address)
IPv4Address.__init__(self, addr[0])
self.network = IPv4Network(address, strict=False)
self._prefixlen = self.network._prefixlen
self.netmask = self.network.netmask
self.hostmask = self.network.hostmask
def __str__(self):
return '%s/%d' % (self._string_from_ip_int(self._ip),
self.network.prefixlen)
def __eq__(self, other):
address_equal = IPv4Address.__eq__(self, other)
if not address_equal or address_equal is NotImplemented:
return address_equal
try:
return self.network == other.network
except AttributeError:
# An interface with an associated network is NOT the
# same as an unassociated address. That's why the hash
# takes the extra info into account.
return False
def __lt__(self, other):
address_less = IPv4Address.__lt__(self, other)
if address_less is NotImplemented:
return NotImplemented
try:
return self.network < other.network
except AttributeError:
# We *do* allow addresses and interfaces to be sorted. The
# unassociated address is considered less than all interfaces.
return False
def __hash__(self):
return self._ip ^ self._prefixlen ^ int(self.network.network_address)
__reduce__ = _IPAddressBase.__reduce__
@property
def ip(self):
return IPv4Address(self._ip)
@property
def with_prefixlen(self):
return '%s/%s' % (self._string_from_ip_int(self._ip),
self._prefixlen)
@property
def with_netmask(self):
return '%s/%s' % (self._string_from_ip_int(self._ip),
self.netmask)
@property
def with_hostmask(self):
return '%s/%s' % (self._string_from_ip_int(self._ip),
self.hostmask)
class IPv4Network(_BaseV4, _BaseNetwork):
"""This class represents and manipulates 32-bit IPv4 network + addresses..
Attributes: [examples for IPv4Network('192.0.2.0/27')]
.network_address: IPv4Address('192.0.2.0')
.hostmask: IPv4Address('0.0.0.31')
.broadcast_address: IPv4Address('192.0.2.32')
.netmask: IPv4Address('255.255.255.224')
.prefixlen: 27
"""
# Class to use when creating address objects
_address_class = IPv4Address
def __init__(self, address, strict=True):
"""Instantiate a new IPv4 network object.
Args:
address: A string or integer representing the IP [& network].
'192.0.2.0/24'
'192.0.2.0/255.255.255.0'
'192.0.0.2/0.0.0.255'
are all functionally the same in IPv4. Similarly,
'192.0.2.1'
'192.0.2.1/255.255.255.255'
'192.0.2.1/32'
are also functionally equivalent. That is to say, failing to
provide a subnetmask will create an object with a mask of /32.
If the mask (portion after the / in the argument) is given in
dotted quad form, it is treated as a netmask if it starts with a
non-zero field (e.g. /255.0.0.0 == /8) and as a hostmask if it
starts with a zero field (e.g. 0.255.255.255 == /8), with the
single exception of an all-zero mask which is treated as a
netmask == /0. If no mask is given, a default of /32 is used.
Additionally, an integer can be passed, so
IPv4Network('192.0.2.1') == IPv4Network(3221225985)
or, more generally
IPv4Interface(int(IPv4Interface('192.0.2.1'))) ==
IPv4Interface('192.0.2.1')
Raises:
AddressValueError: If ipaddress isn't a valid IPv4 address.
NetmaskValueError: If the netmask isn't valid for
an IPv4 address.
ValueError: If strict is True and a network address is not
supplied.
"""
_BaseNetwork.__init__(self, address)
# Constructing from a packed address or integer
if isinstance(address, (_compat_int_types, bytes)):
self.network_address = IPv4Address(address)
self.netmask, self._prefixlen = self._make_netmask(
self._max_prefixlen)
# fixme: address/network test here.
return
if isinstance(address, tuple):
if len(address) > 1:
arg = address[1]
else:
# We weren't given an address[1]
arg = self._max_prefixlen
self.network_address = IPv4Address(address[0])
self.netmask, self._prefixlen = self._make_netmask(arg)
packed = int(self.network_address)
if packed & int(self.netmask) != packed:
if strict:
raise ValueError('%s has host bits set' % self)
else:
self.network_address = IPv4Address(packed &
int(self.netmask))
return
# Assume input argument to be string or any object representation
# which converts into a formatted IP prefix string.
addr = _split_optional_netmask(address)
self.network_address = IPv4Address(self._ip_int_from_string(addr[0]))
if len(addr) == 2:
arg = addr[1]
else:
arg = self._max_prefixlen
self.netmask, self._prefixlen = self._make_netmask(arg)
if strict:
if (IPv4Address(int(self.network_address) & int(self.netmask)) !=
self.network_address):
raise ValueError('%s has host bits set' % self)
self.network_address = IPv4Address(int(self.network_address) &
int(self.netmask))
if self._prefixlen == (self._max_prefixlen - 1):
self.hosts = self.__iter__
@property
def is_global(self):
"""Test if this address is allocated for public networks.
Returns:
A boolean, True if the address is not reserved per
iana-ipv4-special-registry.
"""
return (not (self.network_address in IPv4Network('100.64.0.0/10') and
self.broadcast_address in IPv4Network('100.64.0.0/10')) and
not self.is_private)
class _IPv4Constants(object):
_linklocal_network = IPv4Network('169.254.0.0/16')
_loopback_network = IPv4Network('127.0.0.0/8')
_multicast_network = IPv4Network('224.0.0.0/4')
_public_network = IPv4Network('100.64.0.0/10')
_private_networks = [
IPv4Network('0.0.0.0/8'),
IPv4Network('10.0.0.0/8'),
IPv4Network('127.0.0.0/8'),
IPv4Network('169.254.0.0/16'),
IPv4Network('172.16.0.0/12'),
IPv4Network('192.0.0.0/29'),
IPv4Network('192.0.0.170/31'),
IPv4Network('192.0.2.0/24'),
IPv4Network('192.168.0.0/16'),
IPv4Network('198.18.0.0/15'),
IPv4Network('198.51.100.0/24'),
IPv4Network('203.0.113.0/24'),
IPv4Network('240.0.0.0/4'),
IPv4Network('255.255.255.255/32'),
]
_reserved_network = IPv4Network('240.0.0.0/4')
_unspecified_address = IPv4Address('0.0.0.0')
IPv4Address._constants = _IPv4Constants
class _BaseV6(object):
"""Base IPv6 object.
The following methods are used by IPv6 objects in both single IP
addresses and networks.
"""
__slots__ = ()
_version = 6
_ALL_ONES = (2 ** IPV6LENGTH) - 1
_HEXTET_COUNT = 8
_HEX_DIGITS = frozenset('0123456789ABCDEFabcdef')
_max_prefixlen = IPV6LENGTH
# There are only a bunch of valid v6 netmasks, so we cache them all
# when constructed (see _make_netmask()).
_netmask_cache = {}
@classmethod
def _make_netmask(cls, arg):
"""Make a (netmask, prefix_len) tuple from the given argument.
Argument can be:
- an integer (the prefix length)
- a string representing the prefix length (e.g. "24")
- a string representing the prefix netmask (e.g. "255.255.255.0")
"""
if arg not in cls._netmask_cache:
if isinstance(arg, _compat_int_types):
prefixlen = arg
else:
prefixlen = cls._prefix_from_prefix_string(arg)
netmask = IPv6Address(cls._ip_int_from_prefix(prefixlen))
cls._netmask_cache[arg] = netmask, prefixlen
return cls._netmask_cache[arg]
@classmethod
def _ip_int_from_string(cls, ip_str):
"""Turn an IPv6 ip_str into an integer.
Args:
ip_str: A string, the IPv6 ip_str.
Returns:
An int, the IPv6 address
Raises:
AddressValueError: if ip_str isn't a valid IPv6 Address.
"""
if not ip_str:
raise AddressValueError('Address cannot be empty')
parts = ip_str.split(':')
# An IPv6 address needs at least 2 colons (3 parts).
_min_parts = 3
if len(parts) < _min_parts:
msg = "At least %d parts expected in %r" % (_min_parts, ip_str)
raise AddressValueError(msg)
# If the address has an IPv4-style suffix, convert it to hexadecimal.
if '.' in parts[-1]:
try:
ipv4_int = IPv4Address(parts.pop())._ip
except AddressValueError as exc:
raise AddressValueError("%s in %r" % (exc, ip_str))
parts.append('%x' % ((ipv4_int >> 16) & 0xFFFF))
parts.append('%x' % (ipv4_int & 0xFFFF))
# An IPv6 address can't have more than 8 colons (9 parts).
# The extra colon comes from using the "::" notation for a single
# leading or trailing zero part.
_max_parts = cls._HEXTET_COUNT + 1
if len(parts) > _max_parts:
msg = "At most %d colons permitted in %r" % (
_max_parts - 1, ip_str)
raise AddressValueError(msg)
# Disregarding the endpoints, find '::' with nothing in between.
# This indicates that a run of zeroes has been skipped.
skip_index = None
for i in _compat_range(1, len(parts) - 1):
if not parts[i]:
if skip_index is not None:
# Can't have more than one '::'
msg = "At most one '::' permitted in %r" % ip_str
raise AddressValueError(msg)
skip_index = i
# parts_hi is the number of parts to copy from above/before the '::'
# parts_lo is the number of parts to copy from below/after the '::'
if skip_index is not None:
# If we found a '::', then check if it also covers the endpoints.
parts_hi = skip_index
parts_lo = len(parts) - skip_index - 1
if not parts[0]:
parts_hi -= 1
if parts_hi:
msg = "Leading ':' only permitted as part of '::' in %r"
raise AddressValueError(msg % ip_str) # ^: requires ^::
if not parts[-1]:
parts_lo -= 1
if parts_lo:
msg = "Trailing ':' only permitted as part of '::' in %r"
raise AddressValueError(msg % ip_str) # :$ requires ::$
parts_skipped = cls._HEXTET_COUNT - (parts_hi + parts_lo)
if parts_skipped < 1:
msg = "Expected at most %d other parts with '::' in %r"
raise AddressValueError(msg % (cls._HEXTET_COUNT - 1, ip_str))
else:
# Otherwise, allocate the entire address to parts_hi. The
# endpoints could still be empty, but _parse_hextet() will check
# for that.
if len(parts) != cls._HEXTET_COUNT:
msg = "Exactly %d parts expected without '::' in %r"
raise AddressValueError(msg % (cls._HEXTET_COUNT, ip_str))
if not parts[0]:
msg = "Leading ':' only permitted as part of '::' in %r"
raise AddressValueError(msg % ip_str) # ^: requires ^::
if not parts[-1]:
msg = "Trailing ':' only permitted as part of '::' in %r"
raise AddressValueError(msg % ip_str) # :$ requires ::$
parts_hi = len(parts)
parts_lo = 0
parts_skipped = 0
try:
# Now, parse the hextets into a 128-bit integer.
ip_int = 0
for i in range(parts_hi):
ip_int <<= 16
ip_int |= cls._parse_hextet(parts[i])
ip_int <<= 16 * parts_skipped
for i in range(-parts_lo, 0):
ip_int <<= 16
ip_int |= cls._parse_hextet(parts[i])
return ip_int
except ValueError as exc:
raise AddressValueError("%s in %r" % (exc, ip_str))
@classmethod
def _parse_hextet(cls, hextet_str):
"""Convert an IPv6 hextet string into an integer.
Args:
hextet_str: A string, the number to parse.
Returns:
The hextet as an integer.
Raises:
ValueError: if the input isn't strictly a hex number from
[0..FFFF].
"""
# Whitelist the characters, since int() allows a lot of bizarre stuff.
if not cls._HEX_DIGITS.issuperset(hextet_str):
raise ValueError("Only hex digits permitted in %r" % hextet_str)
# We do the length check second, since the invalid character error
# is likely to be more informative for the user
if len(hextet_str) > 4:
msg = "At most 4 characters permitted in %r"
raise ValueError(msg % hextet_str)
# Length check means we can skip checking the integer value
return int(hextet_str, 16)
@classmethod
def _compress_hextets(cls, hextets):
"""Compresses a list of hextets.
Compresses a list of strings, replacing the longest continuous
sequence of "0" in the list with "" and adding empty strings at
the beginning or at the end of the string such that subsequently
calling ":".join(hextets) will produce the compressed version of
the IPv6 address.
Args:
hextets: A list of strings, the hextets to compress.
Returns:
A list of strings.
"""
best_doublecolon_start = -1
best_doublecolon_len = 0
doublecolon_start = -1
doublecolon_len = 0
for index, hextet in enumerate(hextets):
if hextet == '0':
doublecolon_len += 1
if doublecolon_start == -1:
# Start of a sequence of zeros.
doublecolon_start = index
if doublecolon_len > best_doublecolon_len:
# This is the longest sequence of zeros so far.
best_doublecolon_len = doublecolon_len
best_doublecolon_start = doublecolon_start
else:
doublecolon_len = 0
doublecolon_start = -1
if best_doublecolon_len > 1:
best_doublecolon_end = (best_doublecolon_start +
best_doublecolon_len)
# For zeros at the end of the address.
if best_doublecolon_end == len(hextets):
hextets += ['']
hextets[best_doublecolon_start:best_doublecolon_end] = ['']
# For zeros at the beginning of the address.
if best_doublecolon_start == 0:
hextets = [''] + hextets
return hextets
@classmethod
def _string_from_ip_int(cls, ip_int=None):
"""Turns a 128-bit integer into hexadecimal notation.
Args:
ip_int: An integer, the IP address.
Returns:
A string, the hexadecimal representation of the address.
Raises:
ValueError: The address is bigger than 128 bits of all ones.
"""
if ip_int is None:
ip_int = int(cls._ip)
if ip_int > cls._ALL_ONES:
raise ValueError('IPv6 address is too large')
hex_str = '%032x' % ip_int
hextets = ['%x' % int(hex_str[x:x + 4], 16) for x in range(0, 32, 4)]
hextets = cls._compress_hextets(hextets)
return ':'.join(hextets)
def _explode_shorthand_ip_string(self):
"""Expand a shortened IPv6 address.
Args:
ip_str: A string, the IPv6 address.
Returns:
A string, the expanded IPv6 address.
"""
if isinstance(self, IPv6Network):
ip_str = _compat_str(self.network_address)
elif isinstance(self, IPv6Interface):
ip_str = _compat_str(self.ip)
else:
ip_str = _compat_str(self)
ip_int = self._ip_int_from_string(ip_str)
hex_str = '%032x' % ip_int
parts = [hex_str[x:x + 4] for x in range(0, 32, 4)]
if isinstance(self, (_BaseNetwork, IPv6Interface)):
return '%s/%d' % (':'.join(parts), self._prefixlen)
return ':'.join(parts)
def _reverse_pointer(self):
"""Return the reverse DNS pointer name for the IPv6 address.
This implements the method described in RFC3596 2.5.
"""
reverse_chars = self.exploded[::-1].replace(':', '')
return '.'.join(reverse_chars) + '.ip6.arpa'
@property
def max_prefixlen(self):
return self._max_prefixlen
@property
def version(self):
return self._version
class IPv6Address(_BaseV6, _BaseAddress):
"""Represent and manipulate single IPv6 Addresses."""
__slots__ = ('_ip', '__weakref__')
def __init__(self, address):
"""Instantiate a new IPv6 address object.
Args:
address: A string or integer representing the IP
Additionally, an integer can be passed, so
IPv6Address('2001:db8::') ==
IPv6Address(42540766411282592856903984951653826560)
or, more generally
IPv6Address(int(IPv6Address('2001:db8::'))) ==
IPv6Address('2001:db8::')
Raises:
AddressValueError: If address isn't a valid IPv6 address.
"""
# Efficient constructor from integer.
if isinstance(address, _compat_int_types):
self._check_int_address(address)
self._ip = address
return
# Constructing from a packed address
if isinstance(address, bytes):
self._check_packed_address(address, 16)
bvs = _compat_bytes_to_byte_vals(address)
self._ip = _compat_int_from_byte_vals(bvs, 'big')
return
# Assume input argument to be string or any object representation
# which converts into a formatted IP string.
addr_str = _compat_str(address)
if '/' in addr_str:
raise AddressValueError("Unexpected '/' in %r" % address)
self._ip = self._ip_int_from_string(addr_str)
@property
def packed(self):
"""The binary representation of this address."""
return v6_int_to_packed(self._ip)
@property
def is_multicast(self):
"""Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is a multicast address.
See RFC 2373 2.7 for details.
"""
return self in self._constants._multicast_network
@property
def is_reserved(self):
"""Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within one of the
reserved IPv6 Network ranges.
"""
return any(self in x for x in self._constants._reserved_networks)
@property
def is_link_local(self):
"""Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is reserved per RFC 4291.
"""
return self in self._constants._linklocal_network
@property
def is_site_local(self):
"""Test if the address is reserved for site-local.
Note that the site-local address space has been deprecated by RFC 3879.
Use is_private to test if this address is in the space of unique local
addresses as defined by RFC 4193.
Returns:
A boolean, True if the address is reserved per RFC 3513 2.5.6.
"""
return self in self._constants._sitelocal_network
@property
def is_private(self):
"""Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv6-special-registry.
"""
return any(self in net for net in self._constants._private_networks)
@property
def is_global(self):
"""Test if this address is allocated for public networks.
Returns:
A boolean, true if the address is not reserved per
iana-ipv6-special-registry.
"""
return not self.is_private
@property
def is_unspecified(self):
"""Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 2373 2.5.2.
"""
return self._ip == 0
@property
def is_loopback(self):
"""Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback address as defined in
RFC 2373 2.5.3.
"""
return self._ip == 1
@property
def ipv4_mapped(self):
"""Return the IPv4 mapped address.
Returns:
If the IPv6 address is a v4 mapped address, return the
IPv4 mapped address. Return None otherwise.
"""
if (self._ip >> 32) != 0xFFFF:
return None
return IPv4Address(self._ip & 0xFFFFFFFF)
@property
def teredo(self):
"""Tuple of embedded teredo IPs.
Returns:
Tuple of the (server, client) IPs or None if the address
doesn't appear to be a teredo address (doesn't start with
2001::/32)
"""
if (self._ip >> 96) != 0x20010000:
return None
return (IPv4Address((self._ip >> 64) & 0xFFFFFFFF),
IPv4Address(~self._ip & 0xFFFFFFFF))
@property
def sixtofour(self):
"""Return the IPv4 6to4 embedded address.
Returns:
The IPv4 6to4-embedded address if present or None if the
address doesn't appear to contain a 6to4 embedded address.
"""
if (self._ip >> 112) != 0x2002:
return None
return IPv4Address((self._ip >> 80) & 0xFFFFFFFF)
class IPv6Interface(IPv6Address):
def __init__(self, address):
if isinstance(address, (bytes, _compat_int_types)):
IPv6Address.__init__(self, address)
self.network = IPv6Network(self._ip)
self._prefixlen = self._max_prefixlen
return
if isinstance(address, tuple):
IPv6Address.__init__(self, address[0])
if len(address) > 1:
self._prefixlen = int(address[1])
else:
self._prefixlen = self._max_prefixlen
self.network = IPv6Network(address, strict=False)
self.netmask = self.network.netmask
self.hostmask = self.network.hostmask
return
addr = _split_optional_netmask(address)
IPv6Address.__init__(self, addr[0])
self.network = IPv6Network(address, strict=False)
self.netmask = self.network.netmask
self._prefixlen = self.network._prefixlen
self.hostmask = self.network.hostmask
def __str__(self):
return '%s/%d' % (self._string_from_ip_int(self._ip),
self.network.prefixlen)
def __eq__(self, other):
address_equal = IPv6Address.__eq__(self, other)
if not address_equal or address_equal is NotImplemented:
return address_equal
try:
return self.network == other.network
except AttributeError:
# An interface with an associated network is NOT the
# same as an unassociated address. That's why the hash
# takes the extra info into account.
return False
def __lt__(self, other):
address_less = IPv6Address.__lt__(self, other)
if address_less is NotImplemented:
return NotImplemented
try:
return self.network < other.network
except AttributeError:
# We *do* allow addresses and interfaces to be sorted. The
# unassociated address is considered less than all interfaces.
return False
def __hash__(self):
return self._ip ^ self._prefixlen ^ int(self.network.network_address)
__reduce__ = _IPAddressBase.__reduce__
@property
def ip(self):
return IPv6Address(self._ip)
@property
def with_prefixlen(self):
return '%s/%s' % (self._string_from_ip_int(self._ip),
self._prefixlen)
@property
def with_netmask(self):
return '%s/%s' % (self._string_from_ip_int(self._ip),
self.netmask)
@property
def with_hostmask(self):
return '%s/%s' % (self._string_from_ip_int(self._ip),
self.hostmask)
@property
def is_unspecified(self):
return self._ip == 0 and self.network.is_unspecified
@property
def is_loopback(self):
return self._ip == 1 and self.network.is_loopback
class IPv6Network(_BaseV6, _BaseNetwork):
"""This class represents and manipulates 128-bit IPv6 networks.
Attributes: [examples for IPv6('2001:db8::1000/124')]
.network_address: IPv6Address('2001:db8::1000')
.hostmask: IPv6Address('::f')
.broadcast_address: IPv6Address('2001:db8::100f')
.netmask: IPv6Address('ffff:ffff:ffff:ffff:ffff:ffff:ffff:fff0')
.prefixlen: 124
"""
# Class to use when creating address objects
_address_class = IPv6Address
def __init__(self, address, strict=True):
"""Instantiate a new IPv6 Network object.
Args:
address: A string or integer representing the IPv6 network or the
IP and prefix/netmask.
'2001:db8::/128'
'2001:db8:0000:0000:0000:0000:0000:0000/128'
'2001:db8::'
are all functionally the same in IPv6. That is to say,
failing to provide a subnetmask will create an object with
a mask of /128.
Additionally, an integer can be passed, so
IPv6Network('2001:db8::') ==
IPv6Network(42540766411282592856903984951653826560)
or, more generally
IPv6Network(int(IPv6Network('2001:db8::'))) ==
IPv6Network('2001:db8::')
strict: A boolean. If true, ensure that we have been passed
A true network address, eg, 2001:db8::1000/124 and not an
IP address on a network, eg, 2001:db8::1/124.
Raises:
AddressValueError: If address isn't a valid IPv6 address.
NetmaskValueError: If the netmask isn't valid for
an IPv6 address.
ValueError: If strict was True and a network address was not
supplied.
"""
_BaseNetwork.__init__(self, address)
# Efficient constructor from integer or packed address
if isinstance(address, (bytes, _compat_int_types)):
self.network_address = IPv6Address(address)
self.netmask, self._prefixlen = self._make_netmask(
self._max_prefixlen)
return
if isinstance(address, tuple):
if len(address) > 1:
arg = address[1]
else:
arg = self._max_prefixlen
self.netmask, self._prefixlen = self._make_netmask(arg)
self.network_address = IPv6Address(address[0])
packed = int(self.network_address)
if packed & int(self.netmask) != packed:
if strict:
raise ValueError('%s has host bits set' % self)
else:
self.network_address = IPv6Address(packed &
int(self.netmask))
return
# Assume input argument to be string or any object representation
# which converts into a formatted IP prefix string.
addr = _split_optional_netmask(address)
self.network_address = IPv6Address(self._ip_int_from_string(addr[0]))
if len(addr) == 2:
arg = addr[1]
else:
arg = self._max_prefixlen
self.netmask, self._prefixlen = self._make_netmask(arg)
if strict:
if (IPv6Address(int(self.network_address) & int(self.netmask)) !=
self.network_address):
raise ValueError('%s has host bits set' % self)
self.network_address = IPv6Address(int(self.network_address) &
int(self.netmask))
if self._prefixlen == (self._max_prefixlen - 1):
self.hosts = self.__iter__
def hosts(self):
"""Generate Iterator over usable hosts in a network.
This is like __iter__ except it doesn't return the
Subnet-Router anycast address.
"""
network = int(self.network_address)
broadcast = int(self.broadcast_address)
for x in _compat_range(network + 1, broadcast + 1):
yield self._address_class(x)
@property
def is_site_local(self):
"""Test if the address is reserved for site-local.
Note that the site-local address space has been deprecated by RFC 3879.
Use is_private to test if this address is in the space of unique local
addresses as defined by RFC 4193.
Returns:
A boolean, True if the address is reserved per RFC 3513 2.5.6.
"""
return (self.network_address.is_site_local and
self.broadcast_address.is_site_local)
class _IPv6Constants(object):
_linklocal_network = IPv6Network('fe80::/10')
_multicast_network = IPv6Network('ff00::/8')
_private_networks = [
IPv6Network('::1/128'),
IPv6Network('::/128'),
IPv6Network('::ffff:0:0/96'),
IPv6Network('100::/64'),
IPv6Network('2001::/23'),
IPv6Network('2001:2::/48'),
IPv6Network('2001:db8::/32'),
IPv6Network('2001:10::/28'),
IPv6Network('fc00::/7'),
IPv6Network('fe80::/10'),
]
_reserved_networks = [
IPv6Network('::/8'), IPv6Network('100::/8'),
IPv6Network('200::/7'), IPv6Network('400::/6'),
IPv6Network('800::/5'), IPv6Network('1000::/4'),
IPv6Network('4000::/3'), IPv6Network('6000::/3'),
IPv6Network('8000::/3'), IPv6Network('A000::/3'),
IPv6Network('C000::/3'), IPv6Network('E000::/4'),
IPv6Network('F000::/5'), IPv6Network('F800::/6'),
IPv6Network('FE00::/9'),
]
_sitelocal_network = IPv6Network('fec0::/10')
IPv6Address._constants = _IPv6Constants
pip/_vendor/__pycache__/retrying.cpython-36.pyc 0000644 00000017525 14751155150 0015507 0 ustar 00 3
���e�& � @ sl d dl Z d dlmZ d dlZd dlZd dlZdZdd� ZG dd� de�Z G dd � d e�Z
G d
d � d e �Z dS ) � N)�sixi���?c sB t � �dkr,t� d �r,dd� }|� d �S � �fdd�}|S dS )z�
Decorator function that instantiates the Retrying object
@param *dargs: positional arguments passed to Retrying object
@param **dkw: keyword arguments passed to the Retrying object
� r c s t j� �� fdd��}|S )Nc s t � j� f| �|�S )N)�Retrying�call)�args�kw)�f� � /usr/lib/python3.6/retrying.py� wrapped_f$ s z-retry.<locals>.wrap_simple.<locals>.wrapped_f)r �wraps)r r r )r r
� wrap_simple" s zretry.<locals>.wrap_simplec s t j� ���� fdd��}|S )Nc s t � ��j�f| �|�S )N)r r )r r )�dargs�dkwr r r
r / s z&retry.<locals>.wrap.<locals>.wrapped_f)r r )r r )r r )r r
�wrap- s zretry.<locals>.wrapN)�len�callable)r r r
r r )r r r
�retry s
r c @ sn e Zd Zddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� ZdS ) r NFc s |d kr dn|| _ |d kr dn|| _|d kr0dn|| _|d krBdn|| _|d krTdn|| _|d krfdn|| _| d krxdn| | _|
d kr�dn|
| _| d kr�tn| | _ |d kr�dn|| _
g � |d k r̈ j | j � |d k r� j | j
� |d k r�|| _n&|d k�r
� fdd�| _n t| |�| _dd� g�|d k �r6�j | j� |d k �sJ|d k �rV�j | j� |d k �sj| d k �rv�j | j� |
d k �s�| d k �r��j | j� |d k �r�|| _n&|d k�rfd d�| _n t| |�| _| d k�r�| j| _n| | _|
d k�r�| j| _n|
| _|| _d S )
N� �d i� r r c s t � �fdd��D ��S )Nc 3 s | ]}|� ��V qd S )Nr )�.0r )�attempts�delayr r
� <genexpr>a s z6Retrying.__init__.<locals>.<lambda>.<locals>.<genexpr>)�any)r r )�
stop_funcs)r r r
�<lambda>a s z#Retrying.__init__.<locals>.<lambda>c _ s dS )Nr r )r �kwargsr r r
r h s c s t � �fdd��D ��S )Nc 3 s | ]}|� ��V qd S )Nr )r r )r r r r
r y s z6Retrying.__init__.<locals>.<lambda>.<locals>.<genexpr>)�max)r r )�
wait_funcs)r r r
r y s )�_stop_max_attempt_number�_stop_max_delay� _wait_fixed�_wait_random_min�_wait_random_max�_wait_incrementing_start� _wait_incrementing_increment� _wait_exponential_multiplier�MAX_WAIT�_wait_exponential_max�_wait_jitter_max�append�stop_after_attempt�stop_after_delay�stop�getattr� fixed_sleep� random_sleep�incrementing_sleep�exponential_sleep�wait�
always_reject�_retry_on_exception� never_reject�_retry_on_result�_wrap_exception)�selfr. r4 Zstop_max_attempt_numberZstop_max_delayZ
wait_fixedZwait_random_minZwait_random_maxZwait_incrementing_startZwait_incrementing_incrementZwait_exponential_multiplierZwait_exponential_maxZretry_on_exceptionZretry_on_result�wrap_exceptionZ stop_funcZ wait_funcZwait_jitter_maxr )r r r
�__init__: sR
zRetrying.__init__c C s
|| j kS )z;Stop after the previous attempt >= stop_max_attempt_number.)r )r: �previous_attempt_number� delay_since_first_attempt_msr r r
r, � s zRetrying.stop_after_attemptc C s
|| j kS )z=Stop after the time from the first attempt >= stop_max_delay.)r! )r: r= r> r r r
r- � s zRetrying.stop_after_delayc C s dS )z#Don't sleep at all before retrying.r r )r: r= r> r r r
�no_sleep� s zRetrying.no_sleepc C s | j S )z0Sleep a fixed amount of time between each retry.)r" )r: r= r> r r r
r0 � s zRetrying.fixed_sleepc C s t j| j| j�S )zISleep a random amount of time between wait_random_min and wait_random_max)�randomZrandintr# r$ )r: r= r> r r r
r1 � s zRetrying.random_sleepc C s$ | j | j|d }|dk r d}|S )z�
Sleep an incremental amount of time after each attempt, starting at
wait_incrementing_start and incrementing by wait_incrementing_increment
r r )r% r& )r: r= r> �resultr r r
r2 � s zRetrying.incrementing_sleepc C s2 d| }| j | }|| jkr"| j}|dk r.d}|S )N� r )r' r) )r: r= r> ZexprA r r r
r3 � s
zRetrying.exponential_sleepc C s dS )NFr )r: rA r r r
r7 � s zRetrying.never_rejectc C s dS )NTr )r: rA r r r
r5 � s zRetrying.always_rejectc C s4 d}|j r || j|jd �O }n|| j|j�O }|S )NFr )�
has_exceptionr6 �valuer8 )r: �attemptZrejectr r r
�
should_reject� s
zRetrying.should_rejectc
O s� t ttj� d ��}d}x�yt|||�|d�}W n tj� }t||d�}Y nX | j|�sh|j| j�S t ttj� d ��| }| j ||�r�| j r�|j
r�|j� �q�t |��n<| j ||�} | j
r�tj� | j
}
| td|
� } tj| d � |d7 }qW d S )Ni� r FTr g @�@)�int�round�time�Attempt�sys�exc_inforF �getr9 r. rC �
RetryErrorr4 r* r@ r �sleep) r: �fnr r Z
start_time�attempt_numberrE �tbr> rO Zjitterr r r
r � s*
z
Retrying.call)NNNNNNNNNNNNNFNNN)�__name__�
__module__� __qualname__r< r, r- r? r0 r1 r2 r3 r7 r5 rF r r r r r
r 8 s0
F
r c @ s* e Zd ZdZdd� Zd
dd�Zdd� Zd S ) rJ z�
An Attempt encapsulates a call to a target function that may end as a
normal return value from the function or an Exception depending on what
occurred during the execution.
c C s || _ || _|| _d S )N)rD rQ rC )r: rD rQ rC r r r
r< � s zAttempt.__init__Fc C s@ | j r6|rt| ��q<tj| jd | jd | jd � n| jS dS )z�
Return the return value of this Attempt instance or raise an Exception.
If wrap_exception is true, this Attempt is wrapped inside of a
RetryError before being raised.
r r rB N)rC rN r ZreraiserD )r: r; r r r
rM � s
"z Attempt.getc C s: | j r&dj| jdjtj| jd ���S dj| j| j�S d S )NzAttempts: {0}, Error:
{1}� rB zAttempts: {0}, Value: {1})rC �formatrQ �join� traceback� format_tbrD )r: r r r
�__repr__� s zAttempt.__repr__N)F)rS rT rU �__doc__r< rM r[ r r r r
rJ � s
rJ c @ s e Zd ZdZdd� Zdd� ZdS )rN zU
A RetryError encapsulates the last Attempt instance right before giving up.
c C s
|| _ d S )N)� last_attempt)r: r] r r r
r< s zRetryError.__init__c C s dj | j�S )NzRetryError[{0}])rW r] )r: r r r
�__str__
s zRetryError.__str__N)rS rT rU r\ r< r^ r r r r
rN s rN )
r@ Z pip._vendorr rK rI rY r( r �objectr rJ � ExceptionrN r r r r
�<module> s *! pip/_vendor/__pycache__/distro.cpython-36.pyc 0000644 00000077437 14751155150 0015160 0 ustar 00 3
���e� � @ sb d Z ddlZddlZddlZddlZddlZddlZddlZejj d�sXe
dj ej���dZ dZ
i Zddd �Zd
diZejd �Zejd �Zd
dde
dfZd:dd�Zdd� Zd;dd�Zd<dd�Zd=dd �Zd>d d �Zd?d d �Zd@d!d"�Z d#d$� Z d%d&� Z dAd'd(�Z d)d*� Z d+d,� Z!d-d.� Z"d/d0� Z#d1d2� Z$d3d4� Z%G d5d6� d6e&�Z'e'� Z(d7d8� Z)e*d9k�r^e)� dS )Ba,
The ``distro`` package (``distro`` stands for Linux Distribution) provides
information about the Linux distribution it runs on, such as a reliable
machine-readable distro ID, or version information.
It is a renewed alternative implementation for Python's original
:py:func:`platform.linux_distribution` function, but it provides much more
functionality. An alternative implementation became necessary because Python
3.5 deprecated this function, and Python 3.7 is expected to remove it
altogether. Its predecessor function :py:func:`platform.dist` was already
deprecated since Python 2.6 and is also expected to be removed in Python 3.7.
Still, there are many cases in which access to Linux distribution information
is needed. See `Python issue 1322 <https://bugs.python.org/issue1322>`_ for
more information.
� N�linuxzUnsupported platform: {0}z/etcz
os-releaseZoracleZrhel)ZenterpriseenterpriseZredhatenterpriseworkstationZredhatzA(?:[^)]*\)(.*)\()? *(?:STL )?([\d.+\-a-z]*\d) *(?:esaeler *)?(.+)z(\w+)[-_](release|version)$Zdebian_versionz lsb-releasez oem-releasezsystem-releaseTc C s
t j| �S )a$
Return information about the current Linux distribution as a tuple
``(id_name, version, codename)`` with items as follows:
* ``id_name``: If *full_distribution_name* is false, the result of
:func:`distro.id`. Otherwise, the result of :func:`distro.name`.
* ``version``: The result of :func:`distro.version`.
* ``codename``: The result of :func:`distro.codename`.
The interface of this function is compatible with the original
:py:func:`platform.linux_distribution` function, supporting a subset of
its parameters.
The data it returns may not exactly be the same, because it uses more data
sources than the original function, and that may lead to different data if
the Linux distribution is not consistent across multiple data sources it
provides (there are indeed such distributions ...).
Another reason for differences is the fact that the :func:`distro.id`
method normalizes the distro ID string to a reliable machine-readable value
for a number of popular Linux distributions.
)�_distro�linux_distribution)�full_distribution_name� r � /usr/lib/python3.6/distro.pyr ` s r c C s t j� S )a�
Return the distro ID of the current Linux distribution, as a
machine-readable string.
For a number of Linux distributions, the returned distro ID value is
*reliable*, in the sense that it is documented and that it does not change
across releases of the distribution.
This package maintains the following reliable distro ID values:
============== =========================================
Distro ID Distribution
============== =========================================
"ubuntu" Ubuntu
"debian" Debian
"rhel" RedHat Enterprise Linux
"centos" CentOS
"rocky" Rocky Linux
"fedora" Fedora
"sles" SUSE Linux Enterprise Server
"opensuse" openSUSE
"amazon" Amazon Linux
"arch" Arch Linux
"cloudlinux" CloudLinux OS
"exherbo" Exherbo Linux
"gentoo" GenToo Linux
"ibm_powerkvm" IBM PowerKVM
"kvmibm" KVM for IBM z Systems
"linuxmint" Linux Mint
"mageia" Mageia
"mandriva" Mandriva Linux
"parallels" Parallels
"pidora" Pidora
"raspbian" Raspbian
"oracle" Oracle Linux (and Oracle Enterprise Linux)
"scientific" Scientific Linux
"slackware" Slackware
"xenserver" XenServer
============== =========================================
If you have a need to get distros for reliable IDs added into this set,
or if you find that the :func:`distro.id` function returns a different
distro ID for one of the listed distros, please create an issue in the
`distro issue tracker`_.
**Lookup hierarchy and transformations:**
First, the ID is obtained from the following sources, in the specified
order. The first available and non-empty value is used:
* the value of the "ID" attribute of the os-release file,
* the value of the "Distributor ID" attribute returned by the lsb_release
command,
* the first part of the file name of the distro release file,
The so determined ID value then passes the following transformations,
before it is returned by this method:
* it is translated to lower case,
* blanks (which should not be there anyway) are translated to underscores,
* a normalization of the ID is performed, based upon
`normalization tables`_. The purpose of this normalization is to ensure
that the ID is as reliable as possible, even across incompatible changes
in the Linux distributions. A common reason for an incompatible change is
the addition of an os-release file, or the addition of the lsb_release
command, with ID values that differ from what was previously determined
from the distro release file name.
)r �idr r r r r | s Ir Fc C s
t j| �S )an
Return the name of the current Linux distribution, as a human-readable
string.
If *pretty* is false, the name is returned without version or codename.
(e.g. "CentOS Linux")
If *pretty* is true, the version and codename are appended.
(e.g. "CentOS Linux 7.1.1503 (Core)")
**Lookup hierarchy:**
The name is obtained from the following sources, in the specified order.
The first available and non-empty value is used:
* If *pretty* is false:
- the value of the "NAME" attribute of the os-release file,
- the value of the "Distributor ID" attribute returned by the lsb_release
command,
- the value of the "<name>" field of the distro release file.
* If *pretty* is true:
- the value of the "PRETTY_NAME" attribute of the os-release file,
- the value of the "Description" attribute returned by the lsb_release
command,
- the value of the "<name>" field of the distro release file, appended
with the value of the pretty version ("<version_id>" and "<codename>"
fields) of the distro release file, if available.
)r �name)�prettyr r r r � s $r c C s t j| |�S )ay
Return the version of the current Linux distribution, as a human-readable
string.
If *pretty* is false, the version is returned without codename (e.g.
"7.0").
If *pretty* is true, the codename in parenthesis is appended, if the
codename is non-empty (e.g. "7.0 (Maipo)").
Some distributions provide version numbers with different precisions in
the different sources of distribution information. Examining the different
sources in a fixed priority order does not always yield the most precise
version (e.g. for Debian 8.2, or CentOS 7.1).
The *best* parameter can be used to control the approach for the returned
version:
If *best* is false, the first non-empty version number in priority order of
the examined sources is returned.
If *best* is true, the most precise version number out of all examined
sources is returned.
**Lookup hierarchy:**
In all cases, the version number is obtained from the following sources.
If *best* is false, this order represents the priority order:
* the value of the "VERSION_ID" attribute of the os-release file,
* the value of the "Release" attribute returned by the lsb_release
command,
* the version number parsed from the "<version_id>" field of the first line
of the distro release file,
* the version number parsed from the "PRETTY_NAME" attribute of the
os-release file, if it follows the format of the distro release files.
* the version number parsed from the "Description" attribute returned by
the lsb_release command, if it follows the format of the distro release
files.
)r �version)r
�bestr r r r � s )r c C s
t j| �S )a�
Return the version of the current Linux distribution as a tuple
``(major, minor, build_number)`` with items as follows:
* ``major``: The result of :func:`distro.major_version`.
* ``minor``: The result of :func:`distro.minor_version`.
* ``build_number``: The result of :func:`distro.build_number`.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r �
version_parts)r r r r r
s r
c C s
t j| �S )a8
Return the major version of the current Linux distribution, as a string,
if provided.
Otherwise, the empty string is returned. The major version is the first
part of the dot-separated version string.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r �
major_version)r r r r r , s
r c C s
t j| �S )a9
Return the minor version of the current Linux distribution, as a string,
if provided.
Otherwise, the empty string is returned. The minor version is the second
part of the dot-separated version string.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r �
minor_version)r r r r r 9 s
r c C s
t j| �S )a6
Return the build number of the current Linux distribution, as a string,
if provided.
Otherwise, the empty string is returned. The build number is the third part
of the dot-separated version string.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r � build_number)r r r r r F s
r c C s t j� S )a
Return a space-separated list of distro IDs of distributions that are
closely related to the current Linux distribution in regards to packaging
and programming interfaces, for example distributions the current
distribution is a derivative from.
**Lookup hierarchy:**
This information item is only provided by the os-release file.
For details, see the description of the "ID_LIKE" attribute in the
`os-release man page
<http://www.freedesktop.org/software/systemd/man/os-release.html>`_.
)r �liker r r r r S s r c C s t j� S )a�
Return the codename for the release of the current Linux distribution,
as a string.
If the distribution does not have a codename, an empty string is returned.
Note that the returned codename is not always really a codename. For
example, openSUSE returns "x86_64". This function does not handle such
cases in any special way and just returns the string it finds, if any.
**Lookup hierarchy:**
* the codename within the "VERSION" attribute of the os-release file, if
provided,
* the value of the "Codename" attribute returned by the lsb_release
command,
* the value of the "<codename>" field of the distro release file.
)r �codenamer r r r r d s r c C s t j| |�S )a�
Return certain machine-readable information items about the current Linux
distribution in a dictionary, as shown in the following example:
.. sourcecode:: python
{
'id': 'rhel',
'version': '7.0',
'version_parts': {
'major': '7',
'minor': '0',
'build_number': ''
},
'like': 'fedora',
'codename': 'Maipo'
}
The dictionary structure and keys are always the same, regardless of which
information items are available in the underlying data sources. The values
for the various keys are as follows:
* ``id``: The result of :func:`distro.id`.
* ``version``: The result of :func:`distro.version`.
* ``version_parts -> major``: The result of :func:`distro.major_version`.
* ``version_parts -> minor``: The result of :func:`distro.minor_version`.
* ``version_parts -> build_number``: The result of
:func:`distro.build_number`.
* ``like``: The result of :func:`distro.like`.
* ``codename``: The result of :func:`distro.codename`.
For a description of the *pretty* and *best* parameters, see the
:func:`distro.version` method.
)r �info)r
r r r r r | s )r c C s t j� S )z�
Return a dictionary containing key-value pairs for the information items
from the os-release file data source of the current Linux distribution.
See `os-release file`_ for details about these information items.
)r �os_release_infor r r r r � s r c C s t j� S )z�
Return a dictionary containing key-value pairs for the information items
from the lsb_release command data source of the current Linux distribution.
See `lsb_release command output`_ for details about these information
items.
)r �lsb_release_infor r r r r � s r c C s t j� S )z�
Return a dictionary containing key-value pairs for the information items
from the distro release file data source of the current Linux distribution.
See `distro release file`_ for details about these information items.
)r �distro_release_infor r r r r � s r c C s
t j| �S )a�
Return a single named information item from the os-release file data source
of the current Linux distribution.
Parameters:
* ``attribute`` (string): Key of the information item.
Returns:
* (string): Value of the information item, if the item exists.
The empty string, if the item does not exist.
See `os-release file`_ for details about these information items.
)r �os_release_attr)� attributer r r r � s r c C s
t j| �S )a�
Return a single named information item from the lsb_release command output
data source of the current Linux distribution.
Parameters:
* ``attribute`` (string): Key of the information item.
Returns:
* (string): Value of the information item, if the item exists.
The empty string, if the item does not exist.
See `lsb_release command output`_ for details about these information
items.
)r �lsb_release_attr)r r r r r � s r c C s
t j| �S )a�
Return a single named information item from the distro release file
data source of the current Linux distribution.
Parameters:
* ``attribute`` (string): Key of the information item.
Returns:
* (string): Value of the information item, if the item exists.
The empty string, if the item does not exist.
See `distro release file`_ for details about these information items.
)r �distro_release_attr)r r r r r � s r c @ s� e Zd ZdZd:dd�Zdd� Zd;dd �Zd
d � Zd<d
d�Zd=dd�Z d>dd�Z
d?dd�Z d@dd�Z dAdd�Z
dd� Zdd � ZdBd d �Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zed-d.� �Zd/d0� Zed1d2� �Zd3d4� Z d5d6� Z ed7d8� �Z d9S )C�LinuxDistributiona
Provides information about a Linux distribution.
This package creates a private module-global instance of this class with
default initialization arguments, that is used by the
`consolidated accessor functions`_ and `single source accessor functions`_.
By using default initialization arguments, that module-global instance
returns data about the current Linux distribution (i.e. the distro this
package runs on).
Normally, it is not necessary to create additional instances of this class.
However, in situations where control is needed over the exact data sources
that are used, instances of this class can be created with a specific
distro release file, or a specific os-release file, or without invoking the
lsb_release command.
T� c C sH |pt jjtt�| _|pd| _| j� | _|r4| j � ni | _
| j � | _ dS )a8
The initialization method of this class gathers information from the
available data sources, and stores that in private instance attributes.
Subsequent access to the information items uses these private instance
attributes, so that the data sources are read only once.
Parameters:
* ``include_lsb`` (bool): Controls whether the
`lsb_release command output`_ is included as a data source.
If the lsb_release command is not available in the program execution
path, the data source for the lsb_release command will be empty.
* ``os_release_file`` (string): The path name of the
`os-release file`_ that is to be used as a data source.
An empty string (the default) will cause the default path name to
be used (see `os-release file`_ for details).
If the specified or defaulted os-release file does not exist, the
data source for the os-release file will be empty.
* ``distro_release_file`` (string): The path name of the
`distro release file`_ that is to be used as a data source.
An empty string (the default) will cause a default search algorithm
to be used (see `distro release file`_ for details).
If the specified distro release file does not exist, or if no default
distro release file can be found, the data source for the distro
release file will be empty.
Public instance attributes:
* ``os_release_file`` (string): The path name of the
`os-release file`_ that is actually used as a data source. The
empty string if no distro release file is used as a data source.
* ``distro_release_file`` (string): The path name of the
`distro release file`_ that is actually used as a data source. The
empty string if no distro release file is used as a data source.
Raises:
* :py:exc:`IOError`: Some I/O issue with an os-release file or distro
release file.
* :py:exc:`subprocess.CalledProcessError`: The lsb_release command had
some issue (other than not being available in the program execution
path).
* :py:exc:`UnicodeError`: A data source has unexpected characters or
uses an unexpected encoding.
r N)
�os�path�join� _UNIXCONFDIR�_OS_RELEASE_BASENAME�os_release_file�distro_release_file�_get_os_release_info�_os_release_info�_get_lsb_release_info�_lsb_release_info�_get_distro_release_info�_distro_release_info)�selfZ include_lsbr" r# r r r �__init__ s ;
zLinuxDistribution.__init__c C s dj | j| j| j| j| j�S )z Return repr of all info
z�LinuxDistribution(os_release_file={0!r}, distro_release_file={1!r}, _os_release_info={2!r}, _lsb_release_info={3!r}, _distro_release_info={4!r}))�formatr" r# r% r' r) )r* r r r �__repr__V s zLinuxDistribution.__repr__c C s" |r | j � n| j� | j� | j� fS )z�
Return information about the Linux distribution that is compatible
with Python's :func:`platform.linux_distribution`, supporting a subset
of its parameters.
For details, see :func:`distro.linux_distribution`.
)r r r r )r* r r r r r f s z$LinuxDistribution.linux_distributionc C sT dd� }| j d�}|r ||t�S | jd�}|r8||t�S | jd�}|rP||t�S dS )zrReturn the distro ID of the Linux distribution, as a string.
For details, see :func:`distro.id`.
c S s | j � jdd�} |j| | �S )N� �_)�lower�replace�get)� distro_id�tabler r r � normalizey s z'LinuxDistribution.id.<locals>.normalizer �distributor_idr )r �NORMALIZED_OS_IDr �NORMALIZED_LSB_IDr �NORMALIZED_DISTRO_ID)r* r5 r3 r r r r t s
zLinuxDistribution.idFc C sh | j d�p | jd�p | jd�}|r`| j d�p4| jd�}|s`| jd�}| jdd�}|r`|d | }|pfdS ) zx
Return the name of the Linux distribution, as a string.
For details, see :func:`distro.name`.
r r6 � pretty_name� descriptionT)r
r. r )r r r r )r* r
r r r r r r � s
zLinuxDistribution.namec C s� | j d�| jd�| jd�| j| j d��jdd�| j| jd��jdd�g}d}|r�xJ|D ]$}|jd�|jd�ksv|dkrV|}qVW n x|D ]}|dkr�|}P q�W |r�|r�| j� r�dj|| j� �}|S )z~
Return the version of the Linux distribution, as a string.
For details, see :func:`distro.version`.
�
version_id�releaser: r r; �.z {0} ({1}))r r r � _parse_distro_release_contentr2 �countr r, )r* r
r Zversionsr �vr r r r � s&
zLinuxDistribution.versionc C sL | j |d�}|rHtjd�}|j|�}|rH|j� \}}}||p>d|pDdfS dS )z�
Return the version of the Linux distribution, as a tuple of version
numbers.
For details, see :func:`distro.version_parts`.
)r z(\d+)\.?(\d+)?\.?(\d+)?r )r r r )r �re�compile�match�groups)r* r Z version_strZ
version_regex�matches�major�minorr r r r r
� s
z LinuxDistribution.version_partsc C s | j |�d S )z�
Return the major version number of the current distribution.
For details, see :func:`distro.major_version`.
r )r
)r* r r r r r � s z LinuxDistribution.major_versionc C s | j |�d S )z�
Return the minor version number of the Linux distribution.
For details, see :func:`distro.minor_version`.
� )r
)r* r r r r r � s z LinuxDistribution.minor_versionc C s | j |�d S )z{
Return the build number of the Linux distribution.
For details, see :func:`distro.build_number`.
� )r
)r* r r r r r � s z LinuxDistribution.build_numberc C s | j d�p dS )z�
Return the IDs of distributions that are like the Linux distribution.
For details, see :func:`distro.like`.
Zid_liker )r )r* r r r r � s zLinuxDistribution.likec C s" | j d�p | jd�p | jd�p dS )zs
Return the codename of the Linux distribution.
For details, see :func:`distro.codename`.
r r )r r r )r* r r r r � s
zLinuxDistribution.codenamec C sB t | j� | j||�t | j|�| j|�| j|�d�| j� | j� d�S )z�
Return certain machine-readable information about the Linux
distribution.
For details, see :func:`distro.info`.
)rG rH r )r r r
r r )�dictr r r r r r r )r* r
r r r r r � s
zLinuxDistribution.infoc C s | j S )z�
Return a dictionary containing key-value pairs for the information
items from the os-release file data source of the Linux distribution.
For details, see :func:`distro.os_release_info`.
)r% )r* r r r r
s z!LinuxDistribution.os_release_infoc C s | j S )z�
Return a dictionary containing key-value pairs for the information
items from the lsb_release command data source of the Linux
distribution.
For details, see :func:`distro.lsb_release_info`.
)r' )r* r r r r s z"LinuxDistribution.lsb_release_infoc C s | j S )z�
Return a dictionary containing key-value pairs for the information
items from the distro release file data source of the Linux
distribution.
For details, see :func:`distro.distro_release_info`.
)r) )r* r r r r s z%LinuxDistribution.distro_release_infoc C s | j j|d�S )z�
Return a single named information item from the os-release file data
source of the Linux distribution.
For details, see :func:`distro.os_release_attr`.
r )r% r2 )r* r r r r r * s z!LinuxDistribution.os_release_attrc C s | j j|d�S )z�
Return a single named information item from the lsb_release command
output data source of the Linux distribution.
For details, see :func:`distro.lsb_release_attr`.
r )r' r2 )r* r r r r r 3 s z"LinuxDistribution.lsb_release_attrc C s | j j|d�S )z�
Return a single named information item from the distro release file
data source of the Linux distribution.
For details, see :func:`distro.distro_release_attr`.
r )r) r2 )r* r r r r r < s z%LinuxDistribution.distro_release_attrc C s. t jj| j�r*t| j�� }| j|�S Q R X i S )z�
Get the information items from the specified os-release file.
Returns:
A dictionary containing all information items.
N)r r �isfiler" �open�_parse_os_release_content)r* Z release_filer r r r$ E s z&LinuxDistribution._get_os_release_infoc C s� i }t j | dd�}d|_tjd dkr@t|jt�r@|jjd�|_t|�}x�|D ]�}d|krN|j dd�\}}t|t�r~|jd�}|||j
� < |d kr�t j d
|�}|r�|j
� }|jd �}|jd �}|j� }||d
< q�d|d
< qNqNW |S )aD
Parse the lines of an os-release file.
Parameters:
* lines: Iterable through the lines in the os-release file.
Each line must be a unicode string or a UTF-8 encoded byte
string.
Returns:
A dictionary containing all information items.
T)�posixr rJ z
iso-8859-1�=rI zutf-8�VERSIONz(\(\D+\))|,(\s+)?\D+z()�,r r )�shlexZwhitespace_split�sys� version_info�
isinstanceZ wordchars�bytes�decode�list�splitr0 rB �search�group�strip)�lines�propsZlexer�tokens�token�krA r r r r rN Q s.
z+LinuxDistribution._parse_os_release_contentc C s� d}t j|dt jt jd�}|j� \}}|jd�|jd� }}|j}|dkr\|j� }| j|�S |dkrhi S tj dd� d
kr�t j
||||��n@tj dd� dkr�t j
|||��n tj dd� dkr�t j
||��dS )z�
Get the information items from the lsb_release command output.
Returns:
A dictionary containing all information items.
zlsb_release -aT)�shell�stdout�stderrzutf-8r � NrJ � � � � )rg rh )rJ ri )rJ rj ) �
subprocess�Popen�PIPEZ communicaterX �
returncode�
splitlines�_parse_lsb_release_contentrT rU ZCalledProcessError)r* �cmdZprocessrd re �codeZcontentr r r r& � s(
z'LinuxDistribution._get_lsb_release_infoc C st i }xj| D ]b}t |t�r"|jd�n|}|jd�jdd�}t|�dkrFq
|\}}|j|jdd�j� |j� i� q
W |S )aM
Parse the output of the lsb_release command.
Parameters:
* lines: Iterable through the lines of the lsb_release output.
Each line must be a unicode string or a UTF-8 encoded byte
string.
Returns:
A dictionary containing all information items.
zutf-8�
�:rI rJ r. r/ ) rV rW rX r] rZ �len�updater1 r0 )r^ r_ �lineZkvrb rA r r r rp � s
"z,LinuxDistribution._parse_lsb_release_contentc C s� | j r@| j| j �}tjj| j �}tj|�}|r<|jd�|d< |S tjt �}|j
� x\|D ]T}|t krfqXtj|�}|rXtjj t |�}| j|�}d|krX|| _ |jd�|d< |S qXW i S dS )z�
Get the information items from the specified distro release file.
Returns:
A dictionary containing all information items.
rI r r N)
r# �_parse_distro_release_filer r �basename� _DISTRO_RELEASE_BASENAME_PATTERNrD r\ �listdirr �sort� _DISTRO_RELEASE_IGNORE_BASENAMESr )r* � distro_infory rD Z basenames�filepathr r r r( � s,
z*LinuxDistribution._get_distro_release_infoc C s. t jj|�r*t|��}| j|j� �S Q R X i S )z�
Parse a distro release file.
Parameters:
* filepath: Path name of the distro release file.
Returns:
A dictionary containing all information items.
N)r r rL rM r? �readline)r* r �fpr r r rx � s
z,LinuxDistribution._parse_distro_release_filec C s� t | t�r| jd�} tj| j� ddd � �}i }|r�|jd�ddd
� |d< |jd�rn|jd�ddd � |d< |jd�r�|jd�ddd � |d< n| r�| j� |d< |S )
a
Parse a line from a distro release file.
Parameters:
* line: Line from the distro release file. Must be a unicode string
or a UTF-8 encoded byte string.
Returns:
A dictionary containing all information items.
zutf-8NrI rg r rJ r< r ���r� r� r� )rV rW rX �(_DISTRO_RELEASE_CONTENT_REVERSED_PATTERNrD r] r\ )rw rF r~ r r r r? � s
z/LinuxDistribution._parse_distro_release_contentN)Tr r )T)F)FF)F)F)F)F)FF) �__name__�
__module__� __qualname__�__doc__r+ r- r r r r r
r r r r r r r r r r r r r$ � staticmethodrN r& rp r( rx r? r r r r r s:
@
!
< )r c C s� dd l } tjt�}|jtj� |jtjtj �� | j
dd�}|j ddddd� |j � }|j
rv|jt
jt� d d
d �� nB|jd td
d
�� td
d
�}|r�|jd|� t� }|r�|jd|� d S )Nr zLinux distro info tool)r; z--jsonz-jz!Output in machine readable format�
store_true)�help�action� T)�indentZ sort_keyszName: %s)r
z Version: %sz Codename: %s)�argparse�loggingZ getLoggerr� ZsetLevel�DEBUGZ
addHandlerZ
StreamHandlerrT rd �ArgumentParser� add_argument�
parse_args�jsonr �dumpsr r r )r� Zlogger�parser�argsZdistribution_versionZdistribution_codenamer r r �main s(
r� �__main__)T)F)FF)F)F)F)F)FF)+r� r rB rT r� rS r� rk �platform�
startswith� ImportErrorr, r r! r7 r8 r9 rC r� rz r} r r r r r
r r r r r r r r r r r r �objectr r r� r� r r r r �<module> sd
L
'
,
,
pip/_vendor/__pycache__/re-vendor.cpython-36.pyc 0000644 00000002010 14751155150 0015524 0 ustar 00 3
���e � @ s� d dl Z d dlZd dlZd dlZd dlZe jje jje��Z dd� Z
dd� Z dd� Z e
dkr�eej�d krpe
� ejd
dkr�e � n ejd
dkr�e � ne
� dS ) � Nc C s t d� tjd� d S )Nz"Usage: re-vendor.py [clean|vendor]� )�print�sys�exit� r r � /usr/lib/python3.6/re-vendor.py�usage s r c C sP x6t jt�D ](} t jjt| �}t jj|�r tj|� q W t jt jjtd�� d S )Nzsix.py) �os�listdir�here�path�join�isdir�shutil�rmtree�unlink)�fn�dirnamer r r �clean
s
r c C s6 t jddtddg� x tjd�D ]} tj| � q W d S )NZinstallz-tz-rz
vendor.txtz
*.egg-info)�pip�mainr �globr r )r r r r �vendor s r �__main__� r )r r r r r r �abspathr �__file__r r r r �__name__�len�argvr r r r �<module> s pip/_vendor/__pycache__/six.cpython-36.opt-1.pyc 0000644 00000057532 14751155150 0015410 0 ustar 00 3
���e�u � I @ sr d Z ddlmZ ddlZddlZddlZddlZddlZdZdZ ej
d dkZ ej
d dkZ ej
dd� �dzkZ
e r�efZefZefZeZeZejZn�efZeefZeejfZe ZeZej j d �r�e�d|�ZnLG d d
� d
e �Z ye!e � � W n e"k
�r e�d~�ZY n X e�d��Z[ dd� Z#dd� Z$G dd� de �Z%G dd� de%�Z&G dd� dej'�Z(G dd� de%�Z)G dd � d e �Z*e*e+�Z,G d d � d e(�Z-e)d d d d!�e)d"d#d$d%d"�e)d&d#d#d'd&�e)d(d)d$d*d(�e)d+d)d,�e)d-d#d$d.d-�e)d/d0d0d1d/�e)d2d0d0d/d2�e)d3d)d$d4d3�e)d5d)e
�r d6nd7d8�e)d9d)d:�e)d;d<d=d>�e)d!d!d �e)d?d?d@�e)dAdAd@�e)dBdBd@�e)d4d)d$d4d3�e)dCd#d$dDdC�e)dEd#d#dFdE�e&d$d)�e&dGdH�e&dIdJ�e&dKdLdM�e&dNdOdN�e&dPdQdR�e&dSdTdU�e&dVdWdX�e&dYdZd[�e&d\d]d^�e&d_d`da�e&dbdcdd�e&dedfdg�e&dhdidj�e&dkdkdl�e&dmdmdl�e&dndndl�e&dododp�e&dqdr�e&dsdt�e&dudv�e&dwdxdw�e&dydz�e&d{d|d}�e&d~dd��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�e+d� d��e&d�e+d� d��e&d�e+d� e+d� �e&d�d�d��e&d�d�d��e&d�d�d��g>Z.ej d�k�rZe.e&d�d��g7 Z.x:e.D ]2Z/e0e-e/j1e/� e2e/e&��r`e,j3e/d�e/j1 � �q`W [/e.e-_.e-e+d� �Z4e,j3e4d�� G d�d�� d�e(�Z5e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d>d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��gZ6x e6D ]Z/e0e5e/j1e/� �q�W [/e6e5_.e,j3e5e+d� �d�dӃ G d�dՄ d�e(�Z7e)d�d�d��e)d�d�d��e)d�d�d��gZ8x e8D ]Z/e0e7e/j1e/� �q$W [/e8e7_.e,j3e7e+d� �d�d܃ G d�dބ d�e(�Z9e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)�d d�d�g!Z:x e:D ]Z/e0e9e/j1e/� �q�W [/e:e9_.e,j3e9e+�d ��d�d� G �d�d� �de(�Z;e)�dd��d�e)�dd��d�e)�d d��d�e)�d
d��d�gZ<x e<D ]Z/e0e;e/j1e/� �qTW [/e<e;_.e,j3e;e+�d ��d �d
� G �d�d� �de(�Z=e)�dd�d��gZ>x e>D ]Z/e0e=e/j1e/� �q�W [/e>e=_.e,j3e=e+�d ��d�d� G �d�d� �dej'�Z?e,j3e?e+d� ��d� �d�d� Z@�d�d� ZAe � rj�dZB�d ZC�d ZD�d ZE�d ZF�d ZGn$�d!ZB�d"ZC�d#ZD�d$ZE�d%ZF�d&ZGyeHZIW n" eJk
� r� �d'�d(� ZIY nX eIZHyeKZKW n" eJk
� r� �d)�d*� ZKY nX e �
r�d+�d,� ZLejMZN�d-�d.� ZOe ZPn>�d/�d,� ZL�d0�d1� ZN�d2�d.� ZOG �d3�d4� �d4e �ZPeKZKe#eL�d5� ejQeB�ZRejQeC�ZSejQeD�ZTejQeE�ZUejQeF�ZVejQeG�ZWe �
r��d6�d7� ZX�d8�d9� ZY�d:�d;� ZZ�d<�d=� Z[ej\�d>�Z]ej\�d?�Z^ej\�d@�Z_nT�dA�d7� ZX�dB�d9� ZY�dC�d;� ZZ�dD�d=� Z[ej\�dE�Z]ej\�dF�Z^ej\�dG�Z_e#eX�dH� e#eY�dI� e#eZ�dJ� e#e[�dK� e � r�dL�dM� Z`�dN�dO� ZaebZcddldZdedje�dP�jfZg[dejhd�ZiejjZkelZmddlnZnenjoZoenjpZp�dQZqej
d
d
k� r �dRZr�dSZsn �dTZr�dUZsnj�dV�dM� Z`�dW�dO� ZaecZcebZg�dX�dY� Zi�dZ�d[� Zkejtejuev�ZmddloZoeojo ZoZp�d\Zq�dRZr�dSZse#e`�d]� e#ea�d^� �d_�dQ� Zw�d`�dT� Zx�da�dU� Zye � r�eze4j{�db�Z|�d��dc�dd�Z}n�d��de�df�Z|e|�dg� ej
dd� �d�k�
re|�dh� n.ej
dd� �d�k�
r8e|�di� n �dj�dk� Z~eze4j{�dld�Zedk�
rj�dm�dn� Zej
dd� �d�k �
r�eZ��do�dn� Ze#e}�dp� ej
dd� �d�k �
r�ej�ej�f�dq�dr�Z�nej�Z��ds�dt� Z��du�dv� Z��dw�dx� Z�g Z�e+Z�e�� j��dy�dk �rg e�_�ej��rbx>e�ej��D ]0\Z�Z�ee��j+d k�r*e�j1e+k�r*ej�e�= P �q*W [�[�ej�j�e,� dS (� z6Utilities for writing code that runs on Python 2 and 3� )�absolute_importNz'Benjamin Peterson <benjamin@python.org>z1.10.0� � � �java� � c @ s e Zd Zdd� ZdS )�Xc C s dS )Nr r l � )�selfr
r
�/usr/lib/python3.6/six.py�__len__> s z X.__len__N)�__name__�
__module__� __qualname__r
r
r
r
r r < s r �? c C s
|| _ dS )z Add documentation to a function.N)�__doc__)�func�docr
r
r �_add_docK s r c C s t | � tj| S )z7Import module, returning the module after the last dot.)�
__import__�sys�modules)�namer
r
r �_import_moduleP s r c @ s e Zd Zdd� Zdd� ZdS )�
_LazyDescrc C s
|| _ d S )N)r )r r r
r
r �__init__X s z_LazyDescr.__init__c C sB | j � }t|| j|� yt|j| j� W n tk
r< Y nX |S )N)�_resolve�setattrr �delattr� __class__�AttributeError)r �obj�tp�resultr
r
r �__get__[ s z_LazyDescr.__get__N)r r r r r% r
r
r
r r V s r c s. e Zd Zd� fdd� Zdd� Zdd� Z� ZS ) � MovedModuleNc s2 t t| �j|� tr(|d kr |}|| _n|| _d S )N)�superr& r �PY3�mod)r r �old�new)r r
r r i s zMovedModule.__init__c C s
t | j�S )N)r r) )r r
r
r r r s zMovedModule._resolvec C s" | j � }t||�}t| ||� |S )N)r �getattrr )r �attr�_module�valuer
r
r � __getattr__u s
zMovedModule.__getattr__)N)r r r r r r0 �
__classcell__r
r
)r r r& g s r& c s( e Zd Z� fdd�Zdd� Zg Z� ZS )� _LazyModulec s t t| �j|� | jj| _d S )N)r' r2 r r r )r r )r r
r r ~ s z_LazyModule.__init__c C s ddg}|dd� | j D �7 }|S )Nr r c S s g | ]
}|j �qS r
)r )�.0r- r
r
r �
<listcomp>� s z'_LazyModule.__dir__.<locals>.<listcomp>)�_moved_attributes)r Zattrsr
r
r �__dir__� s z_LazyModule.__dir__)r r r r r6 r5 r1 r
r
)r r r2 | s r2 c s& e Zd Zd� fdd� Zdd� Z� ZS )�MovedAttributeNc sd t t| �j|� trH|d kr |}|| _|d kr@|d kr<|}n|}|| _n|| _|d krZ|}|| _d S )N)r' r7 r r( r) r- )r r Zold_modZnew_modZold_attrZnew_attr)r r
r r � s zMovedAttribute.__init__c C s t | j�}t|| j�S )N)r r) r, r- )r �moduler
r
r r � s
zMovedAttribute._resolve)NN)r r r r r r1 r
r
)r r r7 � s r7 c @ sV e Zd ZdZdd� Zdd� Zdd� Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z e Z dS )�_SixMetaPathImporterz�
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
c C s || _ i | _d S )N)r �
known_modules)r Zsix_module_namer
r
r r � s z _SixMetaPathImporter.__init__c G s& x |D ]}|| j | jd | < qW d S )N�.)r: r )r r) Z fullnames�fullnamer
r
r � _add_module� s
z _SixMetaPathImporter._add_modulec C s | j | jd | S )Nr; )r: r )r r< r
r
r � _get_module� s z _SixMetaPathImporter._get_moduleNc C s || j kr| S d S )N)r: )r r< �pathr
r
r � find_module� s
z _SixMetaPathImporter.find_modulec C s0 y
| j | S tk
r* td| ��Y nX d S )Nz!This loader does not know module )r: �KeyError� ImportError)r r< r
r
r Z __get_module� s
z!_SixMetaPathImporter.__get_modulec C sR y
t j| S tk
r Y nX | j|�}t|t�r>|j� }n| |_|t j|< |S )N)r r rA � _SixMetaPathImporter__get_module�
isinstancer& r �
__loader__)r r< r) r
r
r � load_module� s
z _SixMetaPathImporter.load_modulec C s t | j|�d�S )z�
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
�__path__)�hasattrrC )r r< r
r
r �
is_package� s z _SixMetaPathImporter.is_packagec C s | j |� dS )z;Return None
Required, if is_package is implementedN)rC )r r< r
r
r �get_code� s
z _SixMetaPathImporter.get_code)N)
r r r r r r= r> r@ rC rF rI rJ �
get_sourcer
r
r
r r9 � s
r9 c @ s e Zd ZdZg ZdS )� _MovedItemsz Lazy loading of moved objectsN)r r r r rG r
r
r
r rL � s rL Z cStringIO�io�StringIO�filter� itertools�builtinsZifilter� filterfalseZ ifilterfalse�inputZ __builtin__Z raw_input�internr �map�imap�getcwd�osZgetcwdu�getcwdb�rangeZxrangeZ
reload_module� importlibZimp�reload�reduce� functoolsZ shlex_quoteZpipesZshlexZquote�UserDict� collections�UserList�
UserString�zipZizip� zip_longestZ izip_longestZ configparserZ ConfigParser�copyregZcopy_regZdbm_gnuZgdbmzdbm.gnuZ
_dummy_threadZ dummy_threadZhttp_cookiejarZ cookielibzhttp.cookiejarZ http_cookiesZCookiez http.cookiesZ
html_entitiesZhtmlentitydefsz
html.entitiesZ html_parserZ
HTMLParserz html.parserZ http_clientZhttplibz http.clientZemail_mime_multipartzemail.MIMEMultipartzemail.mime.multipartZemail_mime_nonmultipartzemail.MIMENonMultipartzemail.mime.nonmultipartZemail_mime_textzemail.MIMETextzemail.mime.textZemail_mime_basezemail.MIMEBasezemail.mime.baseZBaseHTTPServerz http.serverZ
CGIHTTPServerZSimpleHTTPServerZcPickle�pickleZqueueZQueue�reprlib�reprZ socketserverZ SocketServer�_threadZthreadZtkinterZTkinterZtkinter_dialogZDialogztkinter.dialogZtkinter_filedialogZ
FileDialogztkinter.filedialogZtkinter_scrolledtextZ ScrolledTextztkinter.scrolledtextZtkinter_simpledialogZ SimpleDialogztkinter.simpledialogZ tkinter_tixZTixz tkinter.tixZ tkinter_ttkZttkz tkinter.ttkZtkinter_constantsZ Tkconstantsztkinter.constantsZ tkinter_dndZTkdndz tkinter.dndZtkinter_colorchooserZtkColorChooserztkinter.colorchooserZtkinter_commondialogZtkCommonDialogztkinter.commondialogZtkinter_tkfiledialogZ tkFileDialogZ tkinter_fontZtkFontz tkinter.fontZtkinter_messageboxZ tkMessageBoxztkinter.messageboxZtkinter_tksimpledialogZtkSimpleDialogZ urllib_parsez.moves.urllib_parsez urllib.parseZ urllib_errorz.moves.urllib_errorz urllib.errorZurllibz
.moves.urllibZurllib_robotparser� robotparserzurllib.robotparserZ
xmlrpc_clientZ xmlrpclibz
xmlrpc.clientZ
xmlrpc_serverZSimpleXMLRPCServerz
xmlrpc.serverZwin32�winreg�_winregzmoves.z.moves�movesc @ s e Zd ZdZdS )� Module_six_moves_urllib_parsez7Lazy loading of moved objects in six.moves.urllib_parseN)r r r r r
r
r
r rn @ s rn Z ParseResultZurlparseZ SplitResultZparse_qsZ parse_qslZ urldefragZurljoinZurlsplitZ
urlunparseZ
urlunsplitZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ
splitqueryZsplittagZ splituserZ
uses_fragmentZ uses_netlocZ uses_paramsZ
uses_queryZ
uses_relativezmoves.urllib_parsezmoves.urllib.parsec @ s e Zd ZdZdS )� Module_six_moves_urllib_errorz7Lazy loading of moved objects in six.moves.urllib_errorN)r r r r r
r
r
r ro h s ro ZURLErrorZurllib2Z HTTPErrorZContentTooShortErrorz.moves.urllib.errorzmoves.urllib_errorzmoves.urllib.errorc @ s e Zd ZdZdS )� Module_six_moves_urllib_requestz9Lazy loading of moved objects in six.moves.urllib_requestN)r r r r r
r
r
r rp | s rp Zurlopenzurllib.requestZinstall_openerZ build_openerZ pathname2urlZ url2pathnameZ
getproxiesZRequestZOpenerDirectorZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZ BaseHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZHTTPErrorProcessorZ urlretrieveZ
urlcleanupZ URLopenerZFancyURLopenerZ proxy_bypassz.moves.urllib.requestzmoves.urllib_requestzmoves.urllib.requestc @ s e Zd ZdZdS )� Module_six_moves_urllib_responsez:Lazy loading of moved objects in six.moves.urllib_responseN)r r r r r
r
r
r rq � s rq Zaddbasezurllib.responseZ addclosehookZaddinfoZ
addinfourlz.moves.urllib.responsezmoves.urllib_responsezmoves.urllib.responsec @ s e Zd ZdZdS )�#Module_six_moves_urllib_robotparserz=Lazy loading of moved objects in six.moves.urllib_robotparserN)r r r r r
r
r
r rr � s rr ZRobotFileParserz.moves.urllib.robotparserzmoves.urllib_robotparserzmoves.urllib.robotparserc @ sN e Zd ZdZg Zejd�Zejd�Zejd�Z ejd�Z
ejd�Z dd� Z d S )
�Module_six_moves_urllibzICreate a six.moves.urllib namespace that resembles the Python 3 namespacezmoves.urllib_parsezmoves.urllib_errorzmoves.urllib_requestzmoves.urllib_responsezmoves.urllib_robotparserc C s dddddgS )N�parse�error�request�responserj r
)r r
r
r r6 � s z Module_six_moves_urllib.__dir__N)
r r r r rG � _importerr> rt ru rv rw rj r6 r
r
r
r rs � s
rs z moves.urllibc C s t t| j| � dS )zAdd an item to six.moves.N)r rL r )Zmover
r
r �add_move� s ry c C sX yt t| � W nD tk
rR y tj| = W n" tk
rL td| f ��Y nX Y nX dS )zRemove item from six.moves.zno such move, %rN)r rL r! rm �__dict__rA )r r
r
r � remove_move� s r{ �__func__�__self__� __closure__�__code__� __defaults__� __globals__�im_funcZim_selfZ func_closureZ func_codeZ
func_defaultsZ func_globalsc C s | j � S )N)�next)�itr
r
r �advance_iterator s r� c C s t dd� t| �jD ��S )Nc s s | ]}d |j kV qdS )�__call__N)rz )r3 �klassr
r
r � <genexpr> s zcallable.<locals>.<genexpr>)�any�type�__mro__)r" r
r
r �callable s r� c C s | S )Nr
)�unboundr
r
r �get_unbound_function s r� c C s | S )Nr
)r �clsr
r
r �create_unbound_method s r� c C s | j S )N)r� )r� r
r
r r� " s c C s t j| ||j�S )N)�types�
MethodTyper )r r" r
r
r �create_bound_method% s r� c C s t j| d |�S )N)r� r� )r r� r
r
r r� ( s c @ s e Zd Zdd� ZdS )�Iteratorc C s t | �j| �S )N)r� �__next__)r r
r
r r� - s z
Iterator.nextN)r r r r� r
r
r
r r� + s r� z3Get the function out of a possibly unbound functionc K s t | jf |��S )N)�iter�keys)�d�kwr
r
r �iterkeys> s r� c K s t | jf |��S )N)r� �values)r� r� r
r
r �
itervaluesA s r� c K s t | jf |��S )N)r� �items)r� r� r
r
r � iteritemsD s r� c K s t | jf |��S )N)r� Zlists)r� r� r
r
r � iterlistsG s r� r� r� r� c K s | j f |�S )N)r� )r� r� r
r
r r� P s c K s | j f |�S )N)r� )r� r� r
r
r r� S s c K s | j f |�S )N)r� )r� r� r
r
r r� V s c K s | j f |�S )N)r� )r� r� r
r
r r� Y s �viewkeys�
viewvalues� viewitemsz1Return an iterator over the keys of a dictionary.z3Return an iterator over the values of a dictionary.z?Return an iterator over the (key, value) pairs of a dictionary.zBReturn an iterator over the (key, [values]) pairs of a dictionary.c C s
| j d�S )Nzlatin-1)�encode)�sr
r
r �bk s r� c C s | S )Nr
)r� r
r
r �un s r� z>B�assertCountEqualZassertRaisesRegexpZassertRegexpMatches�assertRaisesRegex� assertRegexc C s | S )Nr
)r� r
r
r r� � s c C s t | jdd�d�S )Nz\\z\\\\Zunicode_escape)�unicode�replace)r� r
r
r r� � s c C s t | d �S )Nr )�ord)Zbsr
r
r �byte2int� s r� c C s t | | �S )N)r� )Zbuf�ir
r
r �
indexbytes� s r� ZassertItemsEqualz Byte literalz Text literalc O s t | t�||�S )N)r, �_assertCountEqual)r �args�kwargsr
r
r r� � s c O s t | t�||�S )N)r, �_assertRaisesRegex)r r� r� r
r
r r� � s c O s t | t�||�S )N)r, � _assertRegex)r r� r� r
r
r r� � s �execc C s* |d kr| � }|j |k r"|j|��|�d S )N)�
__traceback__�with_traceback)r# r/ �tbr
r
r �reraise� s
r� c C sB |dkr*t jd�}|j}|dkr&|j}~n |dkr6|}td� dS )z Execute code in a namespace.Nr z exec _code_ in _globs_, _locs_)r � _getframe� f_globals�f_localsr� )Z_code_Z_globs_Z_locs_�framer
r
r �exec_� s
r� z9def reraise(tp, value, tb=None):
raise tp, value, tb
zrdef raise_from(value, from_value):
if from_value is None:
raise value
raise value from from_value
zCdef raise_from(value, from_value):
raise value from from_value
c C s | �d S )Nr
)r/ Z
from_valuer
r
r �
raise_from� s r� �printc
s6 |j dtj�� � dkrdS � fdd�}d}|j dd�}|dk r`t|t�rNd}nt|t�s`td��|j d d�}|dk r�t|t�r�d}nt|t�s�td
��|r�td ��|s�x | D ]}t|t�r�d}P q�W |r�td �}td
�}nd }d
}|dkr�|}|dk� r�|}x,t| �D ] \} }| �r ||� ||� �qW ||� dS )z4The new-style print function for Python 2.4 and 2.5.�fileNc sd t | t�st| �} t � t�rVt | t�rV� jd k rVt� dd �}|d krHd}| j� j|�} � j| � d S )N�errors�strict) rD �
basestring�strr� r� �encodingr, r� �write)�datar� )�fpr
r r� � s
zprint_.<locals>.writeF�sepTz sep must be None or a string�endz end must be None or a stringz$invalid keyword arguments to print()�
� )�popr �stdoutrD r� r� � TypeError� enumerate)
r� r� r� Z want_unicoder� r� �arg�newlineZspacer� r
)r� r �print_� sL
r� c O s< |j dtj�}|jdd�}t| |� |r8|d k r8|j� d S )Nr� �flushF)�getr r� r� �_printr� )r� r� r� r� r
r
r r� s
zReraise an exception.c s � ��fdd�}|S )Nc s t j�� ��| �} �| _| S )N)r^ �wraps� __wrapped__)�f)�assigned�updated�wrappedr
r �wrapper s zwraps.<locals>.wrapperr
)r� r� r� r� r
)r� r� r� r r� s r� c s& G � �fdd�d��}t j|df i �S )z%Create a base class with a metaclass.c s e Zd Z� �fdd�ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )Nr
)r� r Z
this_basesr� )�bases�metar
r �__new__' s z)with_metaclass.<locals>.metaclass.__new__N)r r r r� r
)r� r� r
r � metaclass% s r� Ztemporary_class)r� r� )r� r� r� r
)r� r� r �with_metaclass s r� c s � fdd�}|S )z6Class decorator for creating a class with a metaclass.c sl | j j� }|jd�}|d k rDt|t�r,|g}x|D ]}|j|� q2W |jdd � |jdd � � | j| j|�S )N� __slots__rz � __weakref__)rz �copyr� rD r� r� r � __bases__)r� Z orig_vars�slotsZ slots_var)r� r
r r� . s
z add_metaclass.<locals>.wrapperr
)r� r� r
)r� r �
add_metaclass, s r� c C s2 t r.d| jkr td| j ��| j| _dd� | _| S )a
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
�__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().c S s | j � jd�S )Nzutf-8)� __unicode__r� )r r
r
r �<lambda>J s z-python_2_unicode_compatible.<locals>.<lambda>)�PY2rz �
ValueErrorr r� r� )r� r
r
r �python_2_unicode_compatible< s
r� �__spec__)r r l i���l i���l l ���� )N)NN)r r )r r )r r )r r )�r Z
__future__r r^ rP �operatorr r� �
__author__� __version__� version_infor� r( ZPY34r� Z string_types�intZ
integer_typesr� Z class_typesZ text_type�bytesZ binary_type�maxsizeZMAXSIZEr� ZlongZ ClassTyper� �platform�
startswith�objectr �len�
OverflowErrorr r r r& �
ModuleTyper2 r7 r9 r rx rL r5 r- r r rD r= rm rn Z _urllib_parse_moved_attributesro Z _urllib_error_moved_attributesrp Z _urllib_request_moved_attributesrq Z!_urllib_response_moved_attributesrr Z$_urllib_robotparser_moved_attributesrs ry r{ Z
_meth_funcZ
_meth_selfZ
_func_closureZ
_func_codeZ_func_defaultsZ
_func_globalsr� r� � NameErrorr� r� r� r� r� r� �
attrgetterZget_method_functionZget_method_selfZget_function_closureZget_function_codeZget_function_defaultsZget_function_globalsr� r� r� r� � methodcallerr� r� r� r� r� �chrZunichr�struct�Struct�packZint2byte�
itemgetterr� �getitemr� r� Z iterbytesrM rN �BytesIOr� r� r� �partialrV r� r� r� r� r, rQ r� r� r� r� r� �WRAPPER_ASSIGNMENTS�WRAPPER_UPDATESr� r� r� r� rG � __package__�globalsr� r� �submodule_search_locations� meta_pathr� r� Zimporter�appendr
r
r
r �<module> s�
>
5 pip/_vendor/__pycache__/pyparsing.cpython-36.opt-1.pyc 0000644 00000610513 14751155150 0016613 0 ustar 00 3
���e�k � @ s� d Z dZdZdZddlZddlmZ ddlZddl Z ddl
Z
ddl Z ddl Z ddl
Z
ddlZddlZddlZddlmZ yddlmZ W n ek
r� ddlmZ Y nX ydd l
mZ W n> ek
r� ydd lmZ W n ek
r� dZY nX Y nX d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrgiZee j�dds� Z e d dskZ e �r"e j Z e Z!e"Z#e Z$e%e&e'e(e)ee*e+e,e-e.g Z/nbe j0Z e1Z2dtdu� Z$g Z/ddl3Z3xBdvj4� D ]6Z5ye/j6e7e3e5�� W n e8k
�r| �wJY nX �qJW e9dwdx� e2dy�D ��Z:dzd{� Z;G d|d}� d}e<�Z=ej>ej? Z@d~ZAeAd ZBe@eA ZCe"d��ZDd�jEd�dx� ejFD ��ZGG d�d!� d!eH�ZIG d�d#� d#eI�ZJG d�d%� d%eI�ZKG d�d'� d'eK�ZLG d�d*� d*eH�ZMG d�d�� d�e<�ZNG d�d&� d&e<�ZOe
jPjQeO� d�d=� ZRd�dN� ZSd�dK� ZTd�d�� ZUd�d�� ZVd�d�� ZWd�dU� ZX�d/d�d��ZYG d�d(� d(e<�ZZG d�d0� d0eZ�Z[G d�d� de[�Z\G d�d� de[�Z]G d�d� de[�Z^e^Z_e^eZ_`G d�d� de[�ZaG d�d � d e^�ZbG d�d � d ea�ZcG d�dp� dpe[�ZdG d�d3� d3e[�ZeG d�d+� d+e[�ZfG d�d)� d)e[�ZgG d�d
� d
e[�ZhG d�d2� d2e[�ZiG d�d�� d�e[�ZjG d�d� dej�ZkG d�d� dej�ZlG d�d� dej�ZmG d�d.� d.ej�ZnG d�d-� d-ej�ZoG d�d5� d5ej�ZpG d�d4� d4ej�ZqG d�d$� d$eZ�ZrG d�d
� d
er�ZsG d�d � d er�ZtG d�d� der�ZuG d�d� der�ZvG d�d"� d"eZ�ZwG d�d� dew�ZxG d�d � d ew�ZyG d�d�� d�ew�ZzG d�d � d ez�Z{G d�d6� d6ez�Z|G d�d�� d�e<�Z}e}� Z~G d�d � d ew�ZG d�d,� d,ew�Z�G d�d� dew�Z�G d�d�� d�e��Z�G d�d1� d1ew�Z�G d�d� de��Z�G d�d� de��Z�G d�d� de��Z�G d�d/� d/e��Z�G d�d � d e<�Z�d�df� Z��d0d�dD�Z��d1d�d@�Z�d�d΄ Z�d�dS� Z�d�dR� Z�d�d҄ Z��d2d�dW�Z�d�dE� Z��d3d�dk�Z�d�dl� Z�d�dn� Z�e\� j�dG�Z�el� j�dM�Z�em� j�dL�Z�en� j�de�Z�eo� j�dd�Z�eeeDd�d�dڍj�d�d܄ �Z�efd݃j�d�d܄ �Z�efd߃j�d�d܄ �Z�e�e�B e�B eeeGd�dyd�B efd�e j��B Z�e�e�e�d� e� �Z�e^d�ed�j�d� e�e{e�e�B ��j�d� d� Z�d�dc� Z�d�dQ� Z�d�d`� Z�d�d^� Z�d�dq� Z�e�d�d܄ �Z�e�d�d܄ �Z�d�d� Z�d�dO� Z�d�dP� Z�d�di� Z�e<� e�_��d4d�do�Z�e=� Z�e<� e�_�e<� e�_�e�d��e�d��fd�dm�Z�e�Z�e�efd��d� �j�d��Z�e�efd��d� �j�d��Z�e�efd��d� efd��d� B �j��d �Z�e�e_�d�e�j� �j��d�Z�d�d�de�j� f�ddT�Z��d5�ddj�Z�e��d�Z�e��d�Z�e�eee@eC�d �j��d��\Z�Z�e�e��d j4� �d
��Z�ef�d �d jEe�jà � �d
�j��d�ZĐdd_� Z�e�ef�d��d �j��d�Z�ef�d�j��d�Z�ef�d�jȃ j��d�Z�ef�d�j��d�Z�e�ef�d��d e�B �j��d�Z�e�Z�ef�d�j��d�Z�e�e{eeeGdɐd �eee�d �e^dɃ em� � ��j j��d �Z�e�ee�j� e�B d��d ��j�d>�Z�G �d dr� dr�Z�eҐd!k� r�eb�d"�Z�eb�d#�Z�eee@eC�d$ �Z�e�eՐd%dӐd&�j�e��Z�e�e�eփ�j��d'�Zאd(e�B Z�e�eՐd%dӐd&�j�e��Z�e�e�eك�j��d)�Z�eӐd*�eؐd'� e� eڐd)� Z�e�jܐd+� e�j�jܐd,� e�j�jܐd,� e�j�jܐd-� ddl�Z�e�j�j�e�e�j�� e�j�jܐd.� dS (6 aS
pyparsing module - Classes and methods to define and execute parsing grammars
The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you
don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.
Here is a program to parse "Hello, World!" (or any greeting of the form
C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
The program outputs the following::
Hello, World! -> ['Hello', ',', 'World', '!']
The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of '+', '|' and '^' operators.
The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
object with named attributes.
The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.)
- quoted strings
- embedded comments
z2.1.10z07 Oct 2016 01:31 UTCz*Paul McGuire <ptmcg@users.sourceforge.net>� N)�ref)�datetime)�RLock)� OrderedDict�And�CaselessKeyword�CaselessLiteral�
CharsNotIn�Combine�Dict�Each�Empty�
FollowedBy�Forward�
GoToColumn�Group�Keyword�LineEnd� LineStart�Literal�
MatchFirst�NoMatch�NotAny� OneOrMore�OnlyOnce�Optional�Or�ParseBaseException�ParseElementEnhance�ParseException�ParseExpression�ParseFatalException� ParseResults�ParseSyntaxException�
ParserElement� QuotedString�RecursiveGrammarException�Regex�SkipTo� StringEnd� StringStart�Suppress�Token�TokenConverter�White�Word�WordEnd� WordStart�
ZeroOrMore� alphanums�alphas�
alphas8bit� anyCloseTag�
anyOpenTag�
cStyleComment�col�commaSeparatedList�commonHTMLEntity� countedArray�cppStyleComment�dblQuotedString�dblSlashComment�
delimitedList�dictOf�downcaseTokens�empty�hexnums� htmlComment�javaStyleComment�line�lineEnd� lineStart�lineno� makeHTMLTags� makeXMLTags�matchOnlyAtCol�matchPreviousExpr�matchPreviousLiteral�
nestedExpr�nullDebugAction�nums�oneOf�opAssoc�operatorPrecedence�
printables�punc8bit�pythonStyleComment� quotedString� removeQuotes�replaceHTMLEntity� replaceWith�
restOfLine�sglQuotedString�srange� stringEnd� stringStart�traceParseAction�
unicodeString� upcaseTokens�
withAttribute�
indentedBlock�originalTextFor�ungroup�
infixNotation� locatedExpr� withClass�
CloseMatch�tokenMap�pyparsing_common� c C s` t | t�r| S yt| �S tk
rZ t| �jtj� d�}td�}|jdd� � |j |�S X dS )a Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
then < returns the unicode object | encodes it with the default encoding | ... >.
�xmlcharrefreplacez&#\d+;c S s$ dt t| d dd� ��dd � S )Nz\ur � � ���)�hex�int)�t� rw � /usr/lib/python3.6/pyparsing.py�<lambda>� s z_ustr.<locals>.<lambda>N)
�
isinstanceZunicode�str�UnicodeEncodeError�encode�sys�getdefaultencodingr' �setParseAction�transformString)�obj�retZ
xmlcharrefrw rw rx �_ustr� s
r� z6sum len sorted reversed list tuple set any all min maxc c s | ]
}|V qd S )Nrw )�.0�yrw rw rx � <genexpr>� s r� rr c C s> d}dd� dj � D �}x"t||�D ]\}}| j||�} q"W | S )z/Escape &, <, >, ", ', etc. in a string of data.z&><"'c s s | ]}d | d V qdS )�&�;Nrw )r� �srw rw rx r� � s z _xml_escape.<locals>.<genexpr>zamp gt lt quot apos)�split�zip�replace)�dataZ from_symbolsZ
to_symbolsZfrom_Zto_rw rw rx � _xml_escape� s
r� c @ s e Zd ZdS )�
_ConstantsN)�__name__�
__module__� __qualname__rw rw rw rx r� � s r� �
0123456789Z ABCDEFabcdef�\ � c c s | ]}|t jkr|V qd S )N)�stringZ
whitespace)r� �crw rw rx r� � s c @ sP e Zd ZdZddd�Zedd� �Zdd � Zd
d � Zd d
� Z ddd�Z
dd� Z dS )r z7base exception class for all parsing runtime exceptionsr Nc C s> || _ |d kr || _d| _n || _|| _|| _|||f| _d S )Nr� )�loc�msg�pstr�
parserElement�args)�selfr� r� r� �elemrw rw rx �__init__� s zParseBaseException.__init__c C s | |j |j|j|j�S )z�
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
)r� r� r� r� )�cls�perw rw rx �_from_exception� s z"ParseBaseException._from_exceptionc C sN |dkrt | j| j�S |dkr,t| j| j�S |dkrBt| j| j�S t|��dS )z�supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
rJ r9 �columnrG N)r9 r� )rJ r� r� r9 rG �AttributeError)r� Zanamerw rw rx � __getattr__� s z ParseBaseException.__getattr__c C s d| j | j| j| jf S )Nz"%s (at char %d), (line:%d, col:%d))r� r� rJ r� )r� rw rw rx �__str__� s zParseBaseException.__str__c C s t | �S )N)r� )r� rw rw rx �__repr__� s zParseBaseException.__repr__�>!<c C s< | j }| jd }|r4dj|d|� |||d� f�}|j� S )z�Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
rr r� N)rG r� �join�strip)r� Z markerStringZline_strZ line_columnrw rw rx �
markInputline� s
z ParseBaseException.markInputlinec C s dj � tt| �� S )Nzlineno col line)r� �dir�type)r� rw rw rx �__dir__� s zParseBaseException.__dir__)r NN)r� ) r� r� r� �__doc__r� � classmethodr� r� r� r� r� r� rw rw rw rx r � s
c @ s e Zd ZdZdS )r aN
Exception thrown when parse expressions don't match class;
supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
N)r� r� r� r� rw rw rw rx r � s c @ s e Zd ZdZdS )r! znuser-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediatelyN)r� r� r� r� rw rw rw rx r! s c @ s e Zd ZdZdS )r# z�just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been foundN)r� r� r� r� rw rw rw rx r# s c @ s e Zd ZdZdd� Zdd� ZdS )r& zZexception thrown by L{ParserElement.validate} if the grammar could be improperly recursivec C s
|| _ d S )N)�parseElementTrace)r� �parseElementListrw rw rx r� s z"RecursiveGrammarException.__init__c C s
d| j S )Nz RecursiveGrammarException: %s)r� )r� rw rw rx r� s z!RecursiveGrammarException.__str__N)r� r� r� r� r� r� rw rw rw rx r& s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�_ParseResultsWithOffsetc C s ||f| _ d S )N)�tup)r� Zp1Zp2rw rw rx r� $ s z _ParseResultsWithOffset.__init__c C s
| j | S )N)r� )r� �irw rw rx � __getitem__& s z#_ParseResultsWithOffset.__getitem__c C s t | jd �S )Nr )�reprr� )r� rw rw rx r� ( s z _ParseResultsWithOffset.__repr__c C s | j d |f| _ d S )Nr )r� )r� r� rw rw rx � setOffset* s z!_ParseResultsWithOffset.setOffsetN)r� r� r� r� r� r� r� rw rw rw rx r� # s r� c @ s� e Zd ZdZd[dd�Zddddefdd�Zdd � Zefd
d �Zd d
� Z dd� Z
dd� Z dd� Z e Z
dd� Zdd� Zdd� Zdd� Zd d � Zer�eZeZeZn$eZeZeZd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd\d(d)�Z d*d+� Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z!d4d5� Z"d6d7� Z#d8d9� Z$d:d;� Z%d<d=� Z&d]d?d@�Z'dAdB� Z(dCdD� Z)dEdF� Z*d^dHdI�Z+dJdK� Z,dLdM� Z-d_dOdP�Z.dQdR� Z/dSdT� Z0dUdV� Z1dWdX� Z2dYdZ� Z3dS )`r" aI
Structured parse results, to provide multiple means of access to the parsed data:
- as a list (C{len(results)})
- by list index (C{results[0], results[1]}, etc.)
- by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
NTc C s" t || �r|S tj| �}d|_|S )NT)rz �object�__new__�_ParseResults__doinit)r� �toklist�name�asList�modalZretobjrw rw rx r� T s
zParseResults.__new__c
C s` | j rvd| _ d | _d | _i | _|| _|| _|d kr6g }||t�rP|d d � | _n ||t�rft|�| _n|g| _t � | _
|d k o�|�r\|s�d| j|< ||t �r�t |�}|| _||t
d �ttf�o�|d dg fk�s\||t�r�|g}|�r&||t��rt|j� d�| |< ntt|d �d�| |< || | _n6y|d | |< W n$ tttfk
�rZ || |< Y nX d S )NFr r� )r� �_ParseResults__name�_ParseResults__parent�_ParseResults__accumNames�_ParseResults__asList�_ParseResults__modal�list�_ParseResults__toklist�_generatorType�dict�_ParseResults__tokdictru r� r� �
basestringr" r� �copy�KeyError� TypeError�
IndexError)r� r� r� r� r� rz rw rw rx r� ] sB
$
zParseResults.__init__c C sP t |ttf�r| j| S || jkr4| j| d d S tdd� | j| D ��S d S )Nrr r c S s g | ] }|d �qS )r rw )r� �vrw rw rx �
<listcomp>� s z,ParseResults.__getitem__.<locals>.<listcomp>rs )rz ru �slicer� r� r� r" )r� r� rw rw rx r� � s
zParseResults.__getitem__c C s� ||t �r0| jj|t� �|g | j|< |d }nD||ttf�rN|| j|< |}n&| jj|t� �t |d�g | j|< |}||t�r�t| �|_ d S )Nr )
r� r� �getr� ru r� r� r" �wkrefr� )r� �kr� rz �subrw rw rx � __setitem__� s
"
zParseResults.__setitem__c
C s� t |ttf�r�t| j�}| j|= t |t�rH|dk r:||7 }t||d �}tt|j|�� �}|j� x^| j j
� D ]F\}}x<|D ]4}x.t |�D ]"\}\}} t || | |k �||< q�W q|W qnW n| j |= d S )Nr rr )
rz ru r� �lenr� r� �range�indices�reverser� �items� enumerater� )
r� r� ZmylenZremovedr� � occurrences�jr� �value�positionrw rw rx � __delitem__� s
$zParseResults.__delitem__c C s
|| j kS )N)r� )r� r� rw rw rx � __contains__� s zParseResults.__contains__c C s
t | j�S )N)r� r� )r� rw rw rx �__len__� s zParseResults.__len__c C s
| j S )N)r� )r� rw rw rx �__bool__� s zParseResults.__bool__c C s
t | j�S )N)�iterr� )r� rw rw rx �__iter__� s zParseResults.__iter__c C s t | jd d d� �S )Nrr rs )r� r� )r� rw rw rx � __reversed__� s zParseResults.__reversed__c C s$ t | jd�r| jj� S t| j�S d S )N�iterkeys)�hasattrr� r� r� )r� rw rw rx � _iterkeys� s
zParseResults._iterkeysc s � fdd�� j � D �S )Nc 3 s | ]}� | V qd S )Nrw )r� r� )r� rw rx r� � s z+ParseResults._itervalues.<locals>.<genexpr>)r� )r� rw )r� rx � _itervalues� s zParseResults._itervaluesc s � fdd�� j � D �S )Nc 3 s | ]}|� | fV qd S )Nrw )r� r� )r� rw rx r� � s z*ParseResults._iteritems.<locals>.<genexpr>)r� )r� rw )r� rx �
_iteritems� s zParseResults._iteritemsc C s t | j� �S )zVReturns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).)r� r� )r� rw rw rx �keys� s zParseResults.keysc C s t | j� �S )zXReturns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).)r� �
itervalues)r� rw rw rx �values� s zParseResults.valuesc C s t | j� �S )zfReturns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).)r� � iteritems)r� rw rw rx r� � s zParseResults.itemsc C s
t | j�S )z�Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names.)�boolr� )r� rw rw rx �haskeys� s zParseResults.haskeysc O s� |s
dg}x6|j � D ]*\}}|dkr2|d |f}qtd| ��qW t|d t�sht|�dksh|d | kr�|d }| | }| |= |S |d }|S dS )a�
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
rr �defaultr z-pop() got an unexpected keyword argument '%s'Nrs )r� r� rz ru r� )r� r� �kwargsr� r� �indexr� Z defaultvaluerw rw rx �pop� s " zParseResults.popc C s || kr| | S |S dS )ai
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
Nrw )r� �key� defaultValuerw rw rx r� s zParseResults.getc C sZ | j j||� xF| jj� D ]8\}}x.t|�D ]"\}\}}t||||k �||< q,W qW dS )a
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
N)r� �insertr� r� r� r� )r� r� ZinsStrr� r� r� r� r� rw rw rx r� 2 s zParseResults.insertc C s | j j|� dS )a�
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
N)r� �append)r� �itemrw rw rx r� F s zParseResults.appendc C s$ t |t�r| |7 } n | jj|� dS )a
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
N)rz r" r� �extend)r� Zitemseqrw rw rx r� T s
zParseResults.extendc C s | j dd�= | jj� dS )z7
Clear all elements and results names.
N)r� r� �clear)r� rw rw rx r� f s zParseResults.clearc C sf y| | S t k
r dS X || jkr^|| jkrD| j| d d S tdd� | j| D ��S ndS d S )Nr� rr r c S s g | ] }|d �qS )r rw )r� r� rw rw rx r� w s z,ParseResults.__getattr__.<locals>.<listcomp>rs )r� r� r� r" )r� r� rw rw rx r� m s
zParseResults.__getattr__c C s | j � }||7 }|S )N)r� )r� �otherr� rw rw rx �__add__{ s zParseResults.__add__c s� |j rnt| j���fdd�� |j j� }� fdd�|D �}x4|D ],\}}|| |< t|d t�r>t| �|d _q>W | j|j7 _| jj |j� | S )Nc s | dk r � S | � S )Nr rw )�a)�offsetrw rx ry � s z'ParseResults.__iadd__.<locals>.<lambda>c s4 g | ],\}}|D ] }|t |d � |d ��f�qqS )r rr )r� )r� r� �vlistr� )� addoffsetrw rx r� � s z)ParseResults.__iadd__.<locals>.<listcomp>r )
r� r� r� r� rz r" r� r� r� �update)r� r� Z
otheritemsZotherdictitemsr� r� rw )r r rx �__iadd__� s
zParseResults.__iadd__c C s& t |t�r|dkr| j� S || S d S )Nr )rz ru r� )r� r� rw rw rx �__radd__� s zParseResults.__radd__c C s dt | j�t | j�f S )Nz(%s, %s))r� r� r� )r� rw rw rx r� � s zParseResults.__repr__c C s ddj dd� | jD �� d S )N�[z, c s s( | ] }t |t�rt|�nt|�V qd S )N)rz r" r� r� )r� r� rw rw rx r� � s z'ParseResults.__str__.<locals>.<genexpr>�])r� r� )r� rw rw rx r� � s zParseResults.__str__r� c C sP g }xF| j D ]<}|r"|r"|j|� t|t�r:||j� 7 }q |jt|�� q W |S )N)r� r� rz r" �
_asStringListr� )r� �sep�outr� rw rw rx r
� s
zParseResults._asStringListc C s dd� | j D �S )a�
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
c S s" g | ]}t |t�r|j� n|�qS rw )rz r" r� )r� �resrw rw rx r� � s z'ParseResults.asList.<locals>.<listcomp>)r� )r� rw rw rx r� � s zParseResults.asListc s6 t r | j}n| j}� fdd�� t� fdd�|� D ��S )a�
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
c s6 t | t�r.| j� r| j� S � fdd�| D �S n| S d S )Nc s g | ] }� |��qS rw rw )r� r� )�toItemrw rx r� � s z7ParseResults.asDict.<locals>.toItem.<locals>.<listcomp>)rz r" r� �asDict)r� )r rw rx r � s
z#ParseResults.asDict.<locals>.toItemc 3 s | ]\}}|� |�fV qd S )Nrw )r� r� r� )r rw rx r� � s z&ParseResults.asDict.<locals>.<genexpr>)�PY_3r� r� r� )r� Zitem_fnrw )r rx r � s
zParseResults.asDictc C s8 t | j�}| jj� |_| j|_|jj| j� | j|_|S )zA
Returns a new copy of a C{ParseResults} object.
)r" r� r� r� r� r� r r� )r� r� rw rw rx r� � s
zParseResults.copyFc C sP d}g }t dd� | jj� D ��}|d }|s8d}d}d}d} |dk rJ|} n | jrV| j} | sf|rbdS d} |||d| d g7 }x�t| j�D ]�\}
} t| t�r�|
|kr�|| j||
|o�|dk||�g7 }n || jd|o�|dk||�g7 }q�d} |
|kr�||
} | �s
|�rq�nd} t t
| ��}
|||d| d |
d
| d g 7 }q�W |||d
| d g7 }dj |�S ) z�
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
�
c s s( | ] \}}|D ]}|d |fV qqdS )rr Nrw )r� r� r r� rw rw rx r� � s z%ParseResults.asXML.<locals>.<genexpr>z r� NZITEM�<�>z</) r� r� r� r� r� r� rz r" �asXMLr� r� r� )r� ZdoctagZnamedItemsOnly�indentZ formatted�nlr Z
namedItemsZnextLevelIndentZselfTagr� r
ZresTagZ xmlBodyTextrw rw rx r � sT
zParseResults.asXMLc C s: x4| j j� D ]&\}}x |D ]\}}||kr|S qW q W d S )N)r� r� )r� r� r� r r� r� rw rw rx Z__lookup$ s
zParseResults.__lookupc C s� | j r | j S | jr.| j� }|r(|j| �S dS nNt| �dkrxt| j�dkrxtt| jj� ��d d dkrxtt| jj� ��S dS dS )a(
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
Nrr r rs )r rs ) r� r� �_ParseResults__lookupr� r� �nextr� r� r� )r� �parrw rw rx �getName+ s
zParseResults.getNamer c C sb g }d}|j |t| j� � � |�rX| j� r�tdd� | j� D ��}xz|D ]r\}}|r^|j |� |j d|d| |f � t|t�r�|r�|j |j||d �� q�|j t|�� qH|j t |�� qHW n�t
dd� | D ���rX| }x~t |�D ]r\} }
t|
t��r*|j d|d| | |d|d |
j||d �f � q�|j d|d| | |d|d t|
�f � q�W d j |�S )
aH
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
r c s s | ]\}}t |�|fV qd S )N)r{ )r� r� r� rw rw rx r� g s z$ParseResults.dump.<locals>.<genexpr>z
%s%s- %s: z rr c s s | ]}t |t�V qd S )N)rz r" )r� �vvrw rw rx r� s s z
%s%s[%d]:
%s%s%sr� )
r� r� r� r� �sortedr� rz r" �dumpr� �anyr� r� ) r� r �depth�fullr �NLr� r� r� r� r rw rw rx r P s,
4.zParseResults.dumpc O s t j | j� f|�|� dS )a�
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
N)�pprintr� )r� r� r� rw rw rx r" } s zParseResults.pprintc C s. | j | jj� | jd k r | j� p d | j| jffS )N)r� r� r� r� r� r� )r� rw rw rx � __getstate__� s
zParseResults.__getstate__c C sN |d | _ |d \| _}}| _i | _| jj|� |d k rDt|�| _nd | _d S )Nr rr )r� r� r� r� r r� r� )r� �stater Z inAccumNamesrw rw rx � __setstate__� s
zParseResults.__setstate__c C s | j | j| j| jfS )N)r� r� r� r� )r� rw rw rx �__getnewargs__� s zParseResults.__getnewargs__c C s t t| ��t| j� � S )N)r� r� r� r� )r� rw rw rx r� � s zParseResults.__dir__)NNTT)N)r� )NFr� T)r� r T)4r� r� r� r� r� rz r� r� r� r� r� r� r� � __nonzero__r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r� r
r� r r� r r r r r" r# r% r& r� rw rw rw rx r" - sh &
'
4
#
=%
-
c C sF |}d| k ot |�k n r4|| d dkr4dS | |jdd| � S )a Returns current column within a string, counting newlines as line separators.
The first column is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r rr r )r� �rfind)r� �strgr� rw rw rx r9 � s
c C s |j dd| �d S )a Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r r rr )�count)r� r) rw rw rx rJ � s
c C sF |j dd| �}|jd| �}|dkr2||d |� S ||d d� S dS )zfReturns the line of text containing loc within a string, counting newlines as line separators.
r r rr N)r( �find)r� r) ZlastCRZnextCRrw rw rx rG � s
c C s8 t dt|� d t|� dt|| �t|| �f � d S )NzMatch z at loc z(%d,%d))�printr� rJ r9 )�instringr� �exprrw rw rx �_defaultStartDebugAction� s r/ c C s$ t dt|� d t|j� � � d S )NzMatched z -> )r, r� r{ r� )r- �startlocZendlocr. �toksrw rw rx �_defaultSuccessDebugAction� s r2 c C s t dt|� � d S )NzException raised:)r, r� )r- r� r. �excrw rw rx � _defaultExceptionDebugAction� s r4 c G s dS )zG'Do-nothing' debug action, to suppress debugging output during parsing.Nrw )r� rw rw rx rQ � s rq c s� �t kr�fdd�S dg�dg�td d� dkrFddd �}dd
d �� n tj}tj� d }|dd
�d }|d |d | f�� �����fdd�}d}yt�dt�d�j�}W n tk
r� t��}Y nX ||_|S )Nc s � |�S )Nrw )r� �lrv )�funcrw rx ry � s z _trim_arity.<locals>.<lambda>r Frq ro � c S s8 t dkr dnd }tj| | d d�| }|j|jfgS )
Nro r7 r rq rr )�limit)ro r7 r ������)�system_version� traceback�
extract_stack�filenamerJ )r8 r �
frame_summaryrw rw rx r= s z"_trim_arity.<locals>.extract_stackc S s$ t j| |d�}|d }|j|jfgS )N)r8 rr rs )r< �
extract_tbr> rJ )�tbr8 Zframesr? rw rw rx r@ s z _trim_arity.<locals>.extract_tb� )r8 rr c s� x�y �| �d d � � }d�d< |S t k
r� �d r>� n4z.tj� d }� |dd�d d d� �ksj� W d ~X �d �kr��d d7 < w� Y qX qW d S )Nr Trr rq )r8 rs rs )r� r~ �exc_info)r� r� rA )r@ �
foundArityr6 r8 �maxargs�pa_call_line_synthrw rx �wrapper s" z _trim_arity.<locals>.wrapperz<parse action>r� � __class__)ro r7 )r )r rs ) �singleArgBuiltinsr; r< r= r@ �getattrr� � Exceptionr{ )r6 rE r= Z LINE_DIFFZ this_linerG � func_namerw )r@ rD r6 r8 rE rF rx � _trim_arity� s*
rM c s� e Zd ZdZdZdZedd� �Zedd� �Zd�dd �Z d
d � Z
d d
� Z d�dd�Z d�dd�Z
dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd�d d �Zd!d"� Zd�d#d$�Zd%d&� Zd'd(� ZG d)d*� d*e�Zed+k r�G d,d-� d-e�Z nG d.d-� d-e�Z i Z e � Z d/d/gZ d�d0d1�Z!eZ"ed2d3� �Z#dZ$ed�d5d6��Z%d�d7d8�Z&e'dfd9d:�Z(d;d<� Z)e'fd=d>�Z*e'dfd?d@�Z+dAdB� Z,dCdD� Z-dEdF� Z.dGdH� Z/dIdJ� Z0dKdL� Z1dMdN� Z2dOdP� Z3dQdR� Z4dSdT� Z5dUdV� Z6dWdX� Z7dYdZ� Z8d�d[d\�Z9d]d^� Z:d_d`� Z;dadb� Z<dcdd� Z=dedf� Z>dgdh� Z?d�didj�Z@dkdl� ZAdmdn� ZBdodp� ZCdqdr� ZDg fdsdt�ZEd�dudv�ZF� fdwdx�ZGdydz� ZHd{d|� ZId}d~� ZJdd�� ZKd�d�d��ZLd�d�d��ZM� ZNS )�r$ z)Abstract base level parser element class.z
Fc C s
| t _dS )a�
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
N)r$ �DEFAULT_WHITE_CHARS)�charsrw rw rx �setDefaultWhitespaceChars= s
z'ParserElement.setDefaultWhitespaceCharsc C s
| t _dS )a�
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
N)r$ �_literalStringClass)r� rw rw rx �inlineLiteralsUsingL s z!ParserElement.inlineLiteralsUsingc C s� t � | _d | _d | _d | _|| _d| _tj| _ d| _
d| _ d| _ t � | _
d| _d| _d| _d| _d| _d| _d | _d| _d| _d S )NTFr� )NNN)r� � parseAction�
failAction�strRepr� resultsName�
saveAsList�skipWhitespacer$ rN �
whiteChars�copyDefaultWhiteChars�mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined�
mayIndexError�errmsg� modalResults� debugActions�re� callPreparse�
callDuringTry)r� �savelistrw rw rx r� a s( zParserElement.__init__c C s< t j | �}| jdd� |_| jdd� |_| jr8tj|_|S )a$
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
N)r� rS r] rZ r$ rN rY )r� Zcpyrw rw rx r� x s
zParserElement.copyc C s* || _ d| j | _t| d�r&| j| j_| S )af
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
z Expected � exception)r� ra r� rh r� )r� r� rw rw rx �setName� s
zParserElement.setNamec C s4 | j � }|jd�r"|dd� }d}||_| |_|S )aP
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
NOTE: this returns a *copy* of the original C{ParserElement} object;
this is so that the client can define a basic element, such as an
integer, and reference it in multiple places with different names.
You can also set results names using the abbreviated syntax,
C{expr("name")} in place of C{expr.setResultsName("name")} -
see L{I{__call__}<__call__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
�*Nrr Trs )r� �endswithrV rb )r� r� �listAllMatchesZnewselfrw rw rx �setResultsName� s
z ParserElement.setResultsNameTc s@ |r&| j � d� fdd� }� |_|| _ nt| j d�r<| j j| _ | S )z�Method to invoke the Python pdb debugger when this element is
about to be parsed. Set C{breakFlag} to True to enable, False to
disable.
Tc s dd l }|j� � | |||�S )Nr )�pdbZ set_trace)r- r� � doActions� callPreParsern )� _parseMethodrw rx �breaker� s z'ParserElement.setBreak.<locals>.breaker�_originalParseMethod)TT)�_parsers r� )r� Z breakFlagrr rw )rq rx �setBreak� s
zParserElement.setBreakc O s& t ttt |���| _|jdd�| _| S )a
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
rf F)r� �maprM rS r� rf )r� �fnsr� rw rw rx r� � s "z ParserElement.setParseActionc O s4 | j tttt|���7 _ | jp,|jdd�| _| S )z�
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
rf F)rS r� rv rM rf r� )r� rw r� rw rw rx �addParseAction� s z ParserElement.addParseActionc sb |j dd��|j dd�r tnt� x(|D ] �� ��fdd�}| jj|� q&W | jpZ|j dd�| _| S )a� Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
�messagez failed user-defined condition�fatalFc s$ t t��| ||��s � | |���d S )N)r� rM )r� r5 rv )�exc_type�fnr� rw rx �pa s z&ParserElement.addCondition.<locals>.parf )r� r! r rS r� rf )r� rw r� r} rw )r{ r| r� rx � addCondition� s
zParserElement.addConditionc C s
|| _ | S )a Define action to perform if parsing fails at this expression.
Fail acton fn is a callable function that takes the arguments
C{fn(s,loc,expr,err)} where:
- s = string being parsed
- loc = location where expression match was attempted and failed
- expr = the parse expression that failed
- err = the exception thrown
The function returns no value. It may throw C{L{ParseFatalException}}
if it is desired to stop parsing immediately.)rT )r� r| rw rw rx �
setFailAction s
zParserElement.setFailActionc C sZ d}xP|rTd}xB| j D ]8}y x|j||�\}}d}q W W q tk
rL Y qX qW qW |S )NTF)r] rt r )r� r- r� Z
exprsFound�eZdummyrw rw rx �_skipIgnorables# s z ParserElement._skipIgnorablesc C sL | j r| j||�}| jrH| j}t|�}x ||k rF|| |krF|d7 }q(W |S )Nrr )r] r� rX rY r� )r� r- r� Zwt�instrlenrw rw rx �preParse0 s zParserElement.preParsec C s |g fS )Nrw )r� r- r� ro rw rw rx � parseImpl< s zParserElement.parseImplc C s |S )Nrw )r� r- r� � tokenlistrw rw rx � postParse? s zParserElement.postParsec " C s� | j }|s| jr�| jd r,| jd ||| � |rD| jrD| j||�}n|}|}yDy| j|||�\}}W n( tk
r� t|t|�| j | ��Y nX W nX t
k
r� } z<| jd r�| jd ||| | � | jr�| j||| | � � W Y d d } ~ X nX n�|o�| j�r| j||�}n|}|}| j �s$|t|�k�rhy| j|||�\}}W n* tk
�rd t|t|�| j | ��Y nX n| j|||�\}}| j |||�}t
|| j| j| jd�}
| j�r�|�s�| j�r�|�rVyRxL| jD ]B} | |||
�}|d k �r�t
|| j| j�o�t|t
tf�| jd�}
�q�W W nF t
k
�rR } z(| jd �r@| jd ||| | � � W Y d d } ~ X nX nNxL| jD ]B} | |||
�}|d k �r^t
|| j| j�o�t|t
tf�| jd�}
�q^W |�r�| jd �r�| jd |||| |
� ||
fS )Nr rq )r� r� rr )r^ rT rc re r� r� r� r r� ra r r` r� r" rV rW rb rS rf rz r� ) r� r- r� ro rp Z debugging�prelocZ tokensStart�tokens�errZ retTokensr| rw rw rx �
_parseNoCacheC sp
zParserElement._parseNoCachec C s> y| j ||dd�d S tk
r8 t||| j| ��Y nX d S )NF)ro r )rt r! r ra )r� r- r� rw rw rx �tryParse� s zParserElement.tryParsec C s2 y| j ||� W n ttfk
r( dS X dS d S )NFT)r� r r� )r� r- r� rw rw rx � canParseNext� s
zParserElement.canParseNextc @ s e Zd Zdd� ZdS )z ParserElement._UnboundedCachec sd i � t � | _�� �fdd�}� fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )�cache� not_in_cacherw rx r� � s z3ParserElement._UnboundedCache.__init__.<locals>.getc s |� |< d S )Nrw )r� r� r� )r� rw rx �set� s z3ParserElement._UnboundedCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z5ParserElement._UnboundedCache.__init__.<locals>.clear)r� r� �types�
MethodTyper� r� r� )r� r� r� r� rw )r� r� rx r� � s z&ParserElement._UnboundedCache.__init__N)r� r� r� r� rw rw rw rx �_UnboundedCache� s r� Nc @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sh t � | _�t� � � �fdd�}� �fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s" |� |< t � ��kr � jd� d S )NF)r� �popitem)r� r� r� )r� �sizerw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear)r� r� � _OrderedDictr� r� r� r� r� )r� r� r� r� r� rw )r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx �
_FifoCache� s r� c @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sv t � | _�i � tjg ���� �fdd�}� ��fdd�}� �fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s2 |� |< t � ��kr$� j�j� d � �j|� d S )N)r� r� �popleftr� )r� r� r� )r� �key_fifor� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � �j � d S )N)r� )r� )r� r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear) r� r� � collections�dequer� r� r� r� r� )r� r� r� r� r� rw )r� r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx r� � s r c C s� d\}}| ||||f}t j�� t j}|j|�} | |jkr�t j| d7 < y| j||||�} W n8 tk
r� }
z |j||
j |
j
� � � W Y d d }
~
X q�X |j|| d | d j � f� | S n4t j| d7 < t | t
�r�| �| d | d j � fS W d Q R X d S )Nr rr )r rr )r$ �packrat_cache_lock�
packrat_cacher� r� �packrat_cache_statsr� r r� rH r� r� rz rK ) r� r- r� ro rp ZHITZMISS�lookupr� r� r� rw rw rx � _parseCache� s$
zParserElement._parseCachec C s( t jj� dgtt j� t jd d �< d S )Nr )r$ r� r� r� r� rw rw rw rx �
resetCache� s
zParserElement.resetCache� c C s8 t js4dt _| dkr t j� t _n t j| �t _t jt _dS )a� Enables "packrat" parsing, which adds memoizing to the parsing logic.
Repeated parse attempts at the same string location (which happens
often in many complex grammars) can immediately return a cached value,
instead of re-executing parsing/validating code. Memoizing is done of
both valid results and parsing exceptions.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "compile as you go", you must call
C{enablePackrat} before calling C{psyco.full()}. If you do not do this,
Python will crash. For best results, call C{enablePackrat()} immediately
after importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
TN)r$ �_packratEnabledr� r� r� r� rt )Zcache_size_limitrw rw rx �
enablePackrat s zParserElement.enablePackratc C s� t j� | js| j� x| jD ] }|j� q W | js<|j� }y<| j|d�\}}|rv| j||�}t � t
� }|j||� W n0 t k
r� } zt j r�� n|�W Y dd}~X nX |S dS )aB
Execute the parse expression with the given string.
This is the main interface to the client code, once the complete
expression has been built.
If you want the grammar to require that the entire input string be
successfully parsed, then set C{parseAll} to True (equivalent to ending
the grammar with C{L{StringEnd()}}).
Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
in order to report proper column numbers in parse actions.
If the input string contains tabs and
the grammar uses parse actions that use the C{loc} argument to index into the
string being parsed, you can ensure you have a consistent view of the input
string by:
- calling C{parseWithTabs} on your grammar before calling C{parseString}
(see L{I{parseWithTabs}<parseWithTabs>})
- define your parse action using the full C{(s,loc,toks)} signature, and
reference the input string using the parse action's C{s} argument
- explictly expand the tabs in your input string before calling
C{parseString}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
r N)
r$ r� r_ �
streamliner] r\ �
expandtabsrt r� r
r) r �verbose_stacktrace)r� r- �parseAllr� r� r� Zser3 rw rw rx � parseString# s$ zParserElement.parseStringc c s@ | j s| j� x| jD ] }|j� qW | js8t|�j� }t|�}d}| j}| j}t j
� d} y�x�||kon| |k �ry |||�}
|||
dd�\} } W n t k
r� |
d }Y q`X | |kr�| d7 } | |
| fV |r�|||�}
|
|kr�| }q�|d7 }n| }q`|
d }q`W W n4 t k
�r: } zt j
�r&� n|�W Y dd}~X nX dS )a�
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
C{maxMatches} argument, to clip scanning after 'n' matches are found. If
C{overlap} is specified, then overlapping matches will be reported.
Note that the start and end locations are reported relative to the string
being parsed. See L{I{parseString}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
r F)rp rr N)r_ r� r] r\ r� r� r� r� rt r$ r� r r r� )r� r- �
maxMatchesZoverlapr� r� r� Z
preparseFnZparseFn�matchesr� ZnextLocr� Znextlocr3 rw rw rx �
scanStringU sB
zParserElement.scanStringc C s� g }d}d| _ y�xh| j|�D ]Z\}}}|j|||� � |rrt|t�rT||j� 7 }n t|t�rh||7 }n
|j|� |}q W |j||d� � dd� |D �}djtt t
|���S t k
r� } zt j
rȂ n|�W Y dd}~X nX dS )af
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
r TNc S s g | ] }|r|�qS rw rw )r� �orw rw rx r� � s z1ParserElement.transformString.<locals>.<listcomp>r� )r\ r� r� rz r" r� r� r� rv r� �_flattenr r$ r� )r� r- r ZlastErv r� r� r3 rw rw rx r� � s(
z ParserElement.transformStringc C sP yt dd� | j||�D ��S tk
rJ } ztjr6� n|�W Y dd}~X nX dS )a~
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
c S s g | ]\}}}|�qS rw rw )r� rv r� r� rw rw rx r� � s z.ParserElement.searchString.<locals>.<listcomp>N)r" r� r r$ r� )r� r- r� r3 rw rw rx � searchString� s zParserElement.searchStringc c sX d}d}x<| j ||d�D ]*\}}}|||� V |r>|d V |}qW ||d� V dS )a[
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
r )r� N)r� ) r� r- �maxsplitZincludeSeparatorsZsplitsZlastrv r� r� rw rw rx r� � s
zParserElement.splitc C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )a�
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
z4Cannot combine element of type %s with ParserElementrq )�
stacklevelN) rz r� r$ rQ �warnings�warnr� �
SyntaxWarningr )r� r� rw rw rx r � s
zParserElement.__add__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of + operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx r s
zParserElement.__radd__c C sL t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| tj � |g�S )zQ
Implementation of - operator, returns C{L{And}} with error stop
z4Cannot combine element of type %s with ParserElementrq )r� N)
rz r� r$ rQ r� r� r� r� r �
_ErrorStop)r� r� rw rw rx �__sub__ s
zParserElement.__sub__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of - operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rsub__ s
zParserElement.__rsub__c s� t |t�r|d }}n�t |t�r�|d dd� }|d dkrHd|d f}t |d t�r�|d dkr�|d dkrvt��S |d dkr�t��S �|d t�� S nJt |d t�r�t |d t�r�|\}}||8 }n tdt|d �t|d ���ntdt|���|dk �r td��|dk �r td��|| k�o2dkn �rBtd ��|�r�� �fd
d �� |�r�|dk�rt�� |� }nt�g| �� |� }n� |�}n |dk�r��}nt�g| �}|S )
a�
Implementation of * operator, allows use of C{expr * 3} in place of
C{expr + expr + expr}. Expressions may also me multiplied by a 2-integer
tuple, similar to C{{min,max}} multipliers in regular expressions. Tuples
may also include C{None} as in:
- C{expr*(n,None)} or C{expr*(n,)} is equivalent
to C{expr*n + L{ZeroOrMore}(expr)}
(read as "at least n instances of C{expr}")
- C{expr*(None,n)} is equivalent to C{expr*(0,n)}
(read as "0 to n instances of C{expr}")
- C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
- C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
Note that C{expr*(None,n)} does not raise an exception if
more than n exprs exist in the input stream; that is,
C{expr*(None,n)} does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
C{expr*(None,n) + ~expr}
r Nrq rr z7cannot multiply 'ParserElement' and ('%s','%s') objectsz0cannot multiply 'ParserElement' and '%s' objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuez+cannot multiply ParserElement by 0 or (0,0)c s( | dkr t �� | d � �S t ��S d S )Nrr )r )�n)�makeOptionalListr� rw rx r� ] s z/ParserElement.__mul__.<locals>.makeOptionalList)NN) rz ru �tupler2 r r� r� �
ValueErrorr )r� r� Z minElementsZ optElementsr� rw )r� r� rx �__mul__, sD
zParserElement.__mul__c C s
| j |�S )N)r� )r� r� rw rw rx �__rmul__p s zParserElement.__rmul__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zI
Implementation of | operator - returns C{L{MatchFirst}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__or__s s
zParserElement.__or__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || B S )z]
Implementation of | operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__ror__ s
zParserElement.__ror__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zA
Implementation of ^ operator - returns C{L{Or}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__xor__� s
zParserElement.__xor__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || A S )z]
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rxor__� s
zParserElement.__rxor__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zC
Implementation of & operator - returns C{L{Each}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__and__� s
zParserElement.__and__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || @ S )z]
Implementation of & operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rand__� s
zParserElement.__rand__c C s t | �S )zE
Implementation of ~ operator - returns C{L{NotAny}}
)r )r� rw rw rx �
__invert__� s zParserElement.__invert__c C s |dk r| j |�S | j� S dS )a
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
N)rm r� )r� r� rw rw rx �__call__� s
zParserElement.__call__c C s t | �S )z�
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
)r+ )r� rw rw rx �suppress� s zParserElement.suppressc C s
d| _ | S )a
Disables the skipping of whitespace before matching the characters in the
C{ParserElement}'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
F)rX )r� rw rw rx �leaveWhitespace� s z ParserElement.leaveWhitespacec C s d| _ || _d| _| S )z8
Overrides the default whitespace chars
TF)rX rY rZ )r� rO rw rw rx �setWhitespaceChars� s z ParserElement.setWhitespaceCharsc C s
d| _ | S )z�
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
T)r\ )r� rw rw rx �
parseWithTabs� s zParserElement.parseWithTabsc C sL t |t�rt|�}t |t�r4|| jkrH| jj|� n| jjt|j� �� | S )a�
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
)rz r� r+ r] r� r� )r� r� rw rw rx �ignore� s
zParserElement.ignorec C s" |pt |p t|ptf| _d| _| S )zT
Enable display of debugging messages while doing pattern matching.
T)r/ r2 r4 rc r^ )r� Z startActionZ
successActionZexceptionActionrw rw rx �setDebugActions
s
z ParserElement.setDebugActionsc C s |r| j ttt� nd| _| S )a�
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
F)r� r/ r2 r4 r^ )r� �flagrw rw rx �setDebug s #zParserElement.setDebugc C s | j S )N)r� )r� rw rw rx r� @ s zParserElement.__str__c C s t | �S )N)r� )r� rw rw rx r� C s zParserElement.__repr__c C s d| _ d | _| S )NT)r_ rU )r� rw rw rx r� F s zParserElement.streamlinec C s d S )Nrw )r� r� rw rw rx �checkRecursionK s z ParserElement.checkRecursionc C s | j g � dS )zj
Check defined expressions for valid structure, check for infinite recursive definitions.
N)r� )r� �
validateTracerw rw rx �validateN s zParserElement.validatec C s� y |j � }W n2 tk
r> t|d��}|j � }W dQ R X Y nX y | j||�S tk
r| } ztjrh� n|�W Y dd}~X nX dS )z�
Execute the parse expression on the given file or filename.
If a filename is specified (instead of a file object),
the entire file is opened, read, and closed before parsing.
�rN)�readr� �openr� r r$ r� )r� Zfile_or_filenamer� Z
file_contents�fr3 rw rw rx � parseFileT s zParserElement.parseFilec sH t |t�r"| |kp t| �t|�kS t |t�r6| j|�S tt| �|kS d S )N)rz r$ �varsr� r� �super)r� r� )rH rw rx �__eq__h s
zParserElement.__eq__c C s
| |k S )Nrw )r� r� rw rw rx �__ne__p s zParserElement.__ne__c C s t t| ��S )N)�hash�id)r� rw rw rx �__hash__s s zParserElement.__hash__c C s | |kS )Nrw )r� r� rw rw rx �__req__v s zParserElement.__req__c C s
| |k S )Nrw )r� r� rw rw rx �__rne__y s zParserElement.__rne__c C s0 y| j t|�|d� dS tk
r* dS X dS )a�
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
)r� TFN)r� r� r )r� Z
testStringr� rw rw rx r� | s
zParserElement.matches�#c C s� t |t�r"tttj|j� j� ��}t |t�r4t|�}g }g }d} �x�|D �]�}
|dk rb|j |
d�sl|rx|
rx|j
|
� qH|
s~qHdj |�|
g} g }y:|
j dd�}
| j
|
|d�} | j
| j|d�� | o�| } W n� tk
�rx }
z�t |
t�r�dnd }d|
k�r0| j
t|
j|
�� | j
d
t|
j|
�d d | � n| j
d
|
j d | � | j
d
t|
� � | �ob|} |
} W Y dd}
~
X nD tk
�r� } z&| j
dt|� � | �o�|} |} W Y dd}~X nX |�r�|�r�| j
d � tdj | �� |j
|
| f� qHW | |fS )a3
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\n of strings that spans \n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
TNFr z\n)r� )r z(FATAL)r� � rr �^zFAIL: zFAIL-EXCEPTION: )rz r� r� rv r{ r� �rstrip�
splitlinesr r� r� r� r� r� r r r! rG r� r9 rK r, )r� Ztestsr� ZcommentZfullDumpZ printResultsZ failureTestsZ
allResultsZcomments�successrv r �resultr� rz r3 rw rw rx �runTests� sN W
$
zParserElement.runTests)F)F)T)T)TT)TT)r� )F)N)T)F)T)Tr� TTF)Or� r� r� r� rN r� � staticmethodrP rR r� r� ri rm ru r� rx r~ r r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� rt r� r� r� r� �_MAX_INTr� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__rw rw )rH rx r$ 8 s�
&
H
"
2G+ D
)
c s e Zd ZdZ� fdd�Z� ZS )r, zT
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
c s t t| �jdd� d S )NF)rg )r� r, r� )r� )rH rw rx r� s zToken.__init__)r� r� r� r� r� r� rw rw )rH rx r, s c s e Zd ZdZ� fdd�Z� ZS )r
z,
An empty token, will always match.
c s$ t t| �j� d| _d| _d| _d S )Nr
TF)r� r
r� r� r[ r` )r� )rH rw rx r� s zEmpty.__init__)r� r� r� r� r� r� rw rw )rH rx r
s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r z(
A token that will never match.
c s* t t| �j� d| _d| _d| _d| _d S )Nr TFzUnmatchable token)r� r r� r� r[ r` ra )r� )rH rw rx r� * s
zNoMatch.__init__Tc C s t ||| j| ��d S )N)r ra )r� r- r� ro rw rw rx r� 1 s zNoMatch.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r & s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
c s� t t| �j� || _t|�| _y|d | _W n* tk
rV tj dt
dd� t | _ Y nX dt
| j� | _d| j | _d| _d| _d S )Nr z2null string passed to Literal; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �matchr� �matchLen�firstMatchCharr� r� r� r� r
rH r� r� ra r[ r` )r� � matchString)rH rw rx r� C s
zLiteral.__init__Tc C sJ || | j kr6| jdks&|j| j|�r6|| j | jfS t||| j| ��d S )Nrr )r� r� �
startswithr� r ra )r� r- r� ro rw rw rx r� V s zLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r 5 s
c sL e Zd ZdZed Zd� fdd� Zddd �Z� fd
d �Ze d d
� �Z
� Z S )r a\
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
Accepts two optional constructor arguments in addition to the keyword string:
- C{identChars} is a string of characters that would be valid identifier characters,
defaulting to all alphanumerics + "_" and "$"
- C{caseless} allows case-insensitive matching, default is C{False}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
z_$NFc s� t t| �j� |d kr tj}|| _t|�| _y|d | _W n$ tk
r^ t j
dt dd� Y nX d| j | _ d| j | _
d| _d| _|| _|r�|j� | _|j� }t|�| _d S )Nr z2null string passed to Keyword; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �DEFAULT_KEYWORD_CHARSr� r� r� r� r� r� r� r� r� ra r[ r` �caseless�upper�
caselessmatchr� �
identChars)r� r� r� r� )rH rw rx r� q s&
zKeyword.__init__Tc C s | j r||||| j � j� | jkr�|t|�| j ksL||| j j� | jkr�|dksj||d j� | jkr�|| j | jfS nv|| | jkr�| jdks�|j| j|�r�|t|�| j ks�||| j | jkr�|dks�||d | jkr�|| j | jfS t ||| j
| ��d S )Nr rr ) r� r� r� r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s * &zKeyword.parseImplc s t t| �j� }tj|_|S )N)r� r r� r� r� )r� r� )rH rw rx r� � s z Keyword.copyc C s
| t _dS )z,Overrides the default Keyword chars
N)r r� )rO rw rw rx �setDefaultKeywordChars� s z Keyword.setDefaultKeywordChars)NF)T) r� r� r� r� r3 r� r� r� r� r� r� r� rw rw )rH rx r ^ s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r al
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
c s6 t t| �j|j� � || _d| j | _d| j | _d S )Nz'%s'z Expected )r� r r� r� � returnStringr� ra )r� r� )rH rw rx r� � s zCaselessLiteral.__init__Tc C s@ |||| j � j� | jkr,|| j | jfS t||| j| ��d S )N)r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s zCaselessLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
r z�
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
Nc s t t| �j||dd� d S )NT)r� )r� r r� )r� r� r� )rH rw rx r� � s zCaselessKeyword.__init__Tc C sj |||| j � j� | jkrV|t|�| j ksF||| j j� | jkrV|| j | jfS t||| j| ��d S )N)r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s *zCaselessKeyword.parseImpl)N)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
rl ax
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
rr c sB t t| �j� || _|| _|| _d| j| jf | _d| _d| _d S )Nz&Expected %r (with up to %d mismatches)F) r� rl r� r� � match_string�
maxMismatchesra r` r[ )r� r� r� )rH rw rx r� � s zCloseMatch.__init__Tc C s� |}t |�}|t | j� }||kr�| j}d}g } | j}
x�tt|||� | j��D ]0\}} | \} }
| |
krP| j|� t | �|
krPP qPW |d }t|||� g�}| j|d< | |d< ||fS t||| j| ��d S )Nr rr �original�
mismatches) r� r� r� r� r� r� r" r ra )r� r- r� ro �startr� �maxlocr� Zmatch_stringlocr� r� Zs_m�src�mat�resultsrw rw rx r� � s( "
zCloseMatch.parseImpl)rr )T)r� r� r� r� r� r� r� rw rw )rH rx rl � s c s8 e Zd ZdZd
� fdd� Zdd d
�Z� fd d �Z� ZS )r/ a
Token for matching words composed of allowed character sets.
Defined with string containing all allowed initial characters,
an optional string containing allowed body characters (if omitted,
defaults to the initial character set), and an optional minimum,
maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction. An optional
C{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
Nrr r Fc s� t t| �j� � rFdj� fdd�|D ��}|rFdj� fdd�|D ��}|| _t|�| _|rl|| _t|�| _n|| _t|�| _|dk| _ |dk r�t
d��|| _ |dkr�|| _ nt
| _ |dkr�|| _ || _ t| �| _d| j | _d | _|| _d
| j| j k�r�|dk�r�|dk�r�|dk�r�| j| jk�r8d t| j� | _nHt| j�dk�rfd tj| j�t| j�f | _nd
t| j�t| j�f | _| j�r�d| j d | _ytj| j�| _W n tk
�r� d | _Y nX d S )Nr� c 3 s | ]}|� kr|V qd S )Nrw )r� r� )� excludeCharsrw rx r� 7
s z Word.__init__.<locals>.<genexpr>c 3 s | ]}|� kr|V qd S )Nrw )r� r� )r� rw rx r� 9
s r rr zZcannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permittedz Expected Fr� z[%s]+z%s[%s]*z [%s][%s]*z\b)r� r/ r� r� �
initCharsOrigr� � initChars�
bodyCharsOrig� bodyChars� maxSpecifiedr� �minLen�maxLenr� r� r� ra r` � asKeyword�_escapeRegexRangeChars�reStringr� rd �escape�compilerK )r� r r �min�max�exactr r� )rH )r� rx r� 4
sT
0
z
Word.__init__Tc
C sD | j r<| j j||�}|s(t||| j| ��|j� }||j� fS || | jkrZt||| j| ��|}|d7 }t|�}| j}|| j }t
||�}x ||k r�|| |kr�|d7 }q�W d} || | j k r�d} | j r�||k r�|| |kr�d} | j
�r |dk�r||d |k�s||k �r || |k�r d} | �r4t||| j| ��||||� fS )Nrr FTr )rd r� r ra �end�groupr r� r r r r r r )
r� r- r� ro r� r� r� Z bodycharsr� ZthrowExceptionrw rw rx r� j
s6
4zWord.parseImplc st yt t| �j� S tk
r" Y nX | jd krndd� }| j| jkr^d|| j�|| j�f | _nd|| j� | _| jS )Nc S s$ t | �dkr | d d� d S | S d S )N� z...)r� )r� rw rw rx �
charsAsStr�
s z Word.__str__.<locals>.charsAsStrz W:(%s,%s)zW:(%s))r� r/ r� rK rU r� r )r� r )rH rw rx r� �
s
z Word.__str__)Nrr r r FN)T)r� r� r� r� r� r� r� r� rw rw )rH rx r/
s .6
#c sF e Zd ZdZeejd��Zd � fdd� Zd dd�Z � fd d
�Z
� Z S )
r' a�
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
z[A-Z]r c s� t t| �j� t|t�r�|s,tjdtdd� || _|| _ y t
j | j| j �| _
| j| _ W q� t
jk
r� tjd| tdd� � Y q�X n2t|tj�r�|| _
t|� | _| _ || _ ntd��t| �| _d| j | _d| _d| _d S )
z�The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags.z0null string passed to Regex; use Empty() insteadrq )r� z$invalid pattern (%s) passed to RegexzCRegex may only be constructed with a string or a compiled RE objectz Expected FTN)r� r' r� rz r� r� r� r� �pattern�flagsrd r
r �
sre_constants�error�compiledREtyper{ r� r� r� ra r` r[ )r� r r )rH rw rx r� �
s.
zRegex.__init__Tc C sd | j j||�}|s"t||| j| ��|j� }|j� }t|j� �}|r\x|D ]}|| ||< qHW ||fS )N)rd r� r ra r � groupdictr" r )r� r- r� ro r� �dr� r� rw rw rx r� �
s
zRegex.parseImplc sD yt t| �j� S tk
r" Y nX | jd kr>dt| j� | _| jS )NzRe:(%s))r� r' r� rK rU r� r )r� )rH rw rx r� �
s
z
Regex.__str__)r )T) r� r� r� r� r� rd r
r r� r� r� r� rw rw )rH rx r' �
s
"
c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r% a�
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
NFTc sN t t� �j� |j� }|s0tjdtdd� t� �|d kr>|}n"|j� }|s`tjdtdd� t� �|� _t |�� _
|d � _ |� _ t |�� _
|� _|� _|� _|� _|r�tjtjB � _dtj� j�t� j d �|d k r�t|�p�df � _n<d� _dtj� j�t� j d �|d k �rt|��p df � _t � j �d k�rp� jd
d j� fd d
�tt � j �d dd�D �� d 7 _|�r�� jdtj|� 7 _|�r�� jdtj|� 7 _tj� j�d � _� jdtj� j � 7 _y tj � j� j�� _� j� _ W n0 t j k
�r& tjd� j tdd� � Y nX t � �� _!d� j! � _"d� _#d� _$d S )Nz$quoteChar cannot be the empty stringrq )r� z'endQuoteChar cannot be the empty stringr z %s(?:[^%s%s]r� z%s(?:[^%s\n\r%s]rr z|(?:z)|(?:c 3 s4 | ],}d t j� jd|� �t� j| �f V qdS )z%s[^%s]N)rd r � endQuoteCharr )r� r� )r� rw rx r� / s z(QuotedString.__init__.<locals>.<genexpr>�)z|(?:%s)z|(?:%s.)z(.)z)*%sz$invalid pattern (%s) passed to Regexz Expected FTrs )%r� r% r� r� r� r� r� � SyntaxError� quoteCharr� � quoteCharLen�firstQuoteCharr �endQuoteCharLen�escChar�escQuote�unquoteResults�convertWhitespaceEscapesrd � MULTILINE�DOTALLr r r r r� r� �escCharReplacePatternr
r r r r� r� ra r` r[ )r� r r r! Z multiliner" r r# )rH )r� rx r� sf
6
zQuotedString.__init__c C s� || | j kr | jj||�p d }|s4t||| j| ��|j� }|j� }| jr�|| j| j � }t
|t �r�d|kr�| j r�ddddd�}x |j
� D ]\}}|j||�}q�W | jr�tj| jd|�}| jr�|j| j| j�}||fS )N�\� r � �
)z\tz\nz\fz\rz\g<1>)r rd r� r ra r r r" r r rz r� r# r� r� r r� r& r! r ) r� r- r� ro r� r� Zws_mapZwslitZwscharrw rw rx r� G s(
zQuotedString.parseImplc sF yt t| �j� S tk
r" Y nX | jd kr@d| j| jf | _| jS )Nz.quoted string, starting with %s ending with %s)r� r% r� rK rU r r )r� )rH rw rx r� j s
zQuotedString.__str__)NNFTNT)T)r� r� r� r� r� r� r� r� rw rw )rH rx r% �
s A
#c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r a�
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
rr r c s� t t| �j� d| _|| _|dk r*td��|| _|dkr@|| _nt| _|dkrZ|| _|| _t | �| _
d| j
| _ | jdk| _ d| _
d S )NFrr zfcannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permittedr z Expected )r� r r� rX �notCharsr� r r r� r� r� ra r[ r` )r� r+ r r r
)rH rw rx r� � s
zCharsNotIn.__init__Tc C s� || | j kr t||| j| ��|}|d7 }| j }t|| j t|��}x ||k rd|| |krd|d7 }qFW || | jk r�t||| j| ��||||� fS )Nrr )r+ r ra r r r� r )r� r- r� ro r� Znotchars�maxlenrw rw rx r� � s
zCharsNotIn.parseImplc sd yt t| �j� S tk
r" Y nX | jd kr^t| j�dkrRd| jd d� | _n d| j | _| jS )Nr z
!W:(%s...)z!W:(%s))r� r r� rK rU r� r+ )r� )rH rw rx r� � s
zCharsNotIn.__str__)rr r r )T)r� r� r� r� r� r� r� r� rw rw )rH rx r v s
c s< e Zd ZdZdddddd�Zd� fd d � Zddd�Z� ZS )r. a�
Special matching class for matching whitespace. Normally, whitespace is ignored
by pyparsing grammars. This class is included when some whitespace structures
are significant. Define with a string containing the whitespace characters to be
matched; default is C{" \t\r\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments,
as defined for the C{L{Word}} class.
z<SPC>z<TAB>z<LF>z<CR>z<FF>)r� r( r r* r) �
rr r c s� t t� �j� |� _� jdj� fdd�� jD ��� djdd� � jD ��� _d� _d� j � _ |� _
|dkrt|� _ nt � _ |dkr�|� _ |� _
d S )Nr� c 3 s | ]}|� j kr|V qd S )N)�
matchWhite)r� r� )r� rw rx r� � s z!White.__init__.<locals>.<genexpr>c s s | ]}t j| V qd S )N)r. � whiteStrs)r� r� rw rw rx r� � s Tz Expected r )
r� r. r� r. r� r� rY r� r[ ra r r r� )r� Zwsr r r
)rH )r� rx r� � s zWhite.__init__Tc C s� || | j kr t||| j| ��|}|d7 }|| j }t|t|��}x"||k rd|| | j krd|d7 }qDW || | jk r�t||| j| ��||||� fS )Nrr )r. r ra r r r� r )r� r- r� ro r� r� rw rw rx r� � s
zWhite.parseImpl)r- rr r r )T)r� r� r� r� r/ r� r� r� rw rw )rH rx r. � s c s e Zd Z� fdd�Z� ZS )�_PositionTokenc s( t t| �j� | jj| _d| _d| _d S )NTF)r� r0 r� rH r� r� r[ r` )r� )rH rw rx r� � s
z_PositionToken.__init__)r� r� r� r� r� rw rw )rH rx r0 � s r0 c s2 e Zd ZdZ� fdd�Zdd� Zd dd�Z� ZS )
r zb
Token to advance to a specific column of input text; useful for tabular report scraping.
c s t t| �j� || _d S )N)r� r r� r9 )r� �colno)rH rw rx r� � s zGoToColumn.__init__c C s` t ||�| j kr\t|�}| jr*| j||�}x0||k rZ|| j� rZt ||�| j krZ|d7 }q,W |S )Nrr )r9 r� r] r� �isspace)r� r- r� r� rw rw rx r� � s & zGoToColumn.preParseTc C sD t ||�}|| j kr"t||d| ��|| j | }|||� }||fS )NzText not in expected column)r9 r )r� r- r� ro ZthiscolZnewlocr� rw rw rx r� s
zGoToColumn.parseImpl)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Matches if current position is at the beginning of a line within the parse string
Example::
test = ''' AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
c s t t| �j� d| _d S )NzExpected start of line)r� r r� ra )r� )rH rw rx r� & s zLineStart.__init__Tc C s* t ||�dkr|g fS t||| j| ��d S )Nrr )r9 r ra )r� r- r� ro rw rw rx r� * s zLineStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r zU
Matches if current position is at the end of a line within the parse string
c s, t t| �j� | jtjjdd�� d| _d S )Nr r� zExpected end of line)r� r r� r� r$ rN r� ra )r� )rH rw rx r� 3 s zLineEnd.__init__Tc C sb |t |�k r6|| dkr$|d dfS t||| j| ��n(|t |�krN|d g fS t||| j| ��d S )Nr rr )r� r ra )r� r- r� ro rw rw rx r� 8 s zLineEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r / s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r* zM
Matches if current position is at the beginning of the parse string
c s t t| �j� d| _d S )NzExpected start of text)r� r* r� ra )r� )rH rw rx r� G s zStringStart.__init__Tc C s0 |dkr(|| j |d�kr(t||| j| ��|g fS )Nr )r� r ra )r� r- r� ro rw rw rx r� K s zStringStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r* C s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r) zG
Matches if current position is at the end of the parse string
c s t t| �j� d| _d S )NzExpected end of text)r� r) r� ra )r� )rH rw rx r� V s zStringEnd.__init__Tc C s^ |t |�k r t||| j| ��n<|t |�kr6|d g fS |t |�krJ|g fS t||| j| ��d S )Nrr )r� r ra )r� r- r� ro rw rw rx r� Z s zStringEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r) R s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r1 ap
Matches if the current position is at the beginning of a Word, and
is not preceded by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
the string being parsed, or at the beginning of a line.
c s" t t| �j� t|�| _d| _d S )NzNot at the start of a word)r� r1 r� r� � wordCharsra )r� r3 )rH rw rx r� l s
zWordStart.__init__Tc C s@ |dkr8||d | j ks(|| | j kr8t||| j| ��|g fS )Nr rr )r3 r ra )r� r- r� ro rw rw rx r� q s
zWordStart.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r1 d s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r0 aZ
Matches if the current position is at the end of a Word, and
is not followed by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
the string being parsed, or at the end of a line.
c s( t t| �j� t|�| _d| _d| _d S )NFzNot at the end of a word)r� r0 r� r� r3 rX ra )r� r3 )rH rw rx r� � s
zWordEnd.__init__Tc C sP t |�}|dkrH||k rH|| | jks8||d | jkrHt||| j| ��|g fS )Nr rr )r� r3 r ra )r� r- r� ro r� rw rw rx r� � s zWordEnd.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r0 x s c s� e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Z� fd d �Z� fd
d�Z � fdd�Z
d� fdd� Z g fdd�Z � fdd�Z
� ZS )r z^
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r"t|�}t|t�r<tj|�g| _ njt|t
j �rzt|�}t dd� |D ��rnt
tj|�}t|�| _ n,yt|�| _ W n tk
r� |g| _ Y nX d| _d S )Nc s s | ]}t |t�V qd S )N)rz r� )r� r. rw rw rx r� � s z+ParseExpression.__init__.<locals>.<genexpr>F)r� r r� rz r� r� r� r$ rQ �exprsr� �Iterable�allrv r� re )r� r4 rg )rH rw rx r� � s
zParseExpression.__init__c C s
| j | S )N)r4 )r� r� rw rw rx r� � s zParseExpression.__getitem__c C s | j j|� d | _| S )N)r4 r� rU )r� r� rw rw rx r� � s zParseExpression.appendc C s4 d| _ dd� | jD �| _x| jD ] }|j� q W | S )z~Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions.Fc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z3ParseExpression.leaveWhitespace.<locals>.<listcomp>)rX r4 r� )r� r� rw rw rx r� � s
z ParseExpression.leaveWhitespacec sz t |t�rF|| jkrvtt| �j|� xP| jD ]}|j| jd � q,W n0tt| �j|� x | jD ]}|j| jd � q^W | S )Nrr rs rs )rz r+ r] r� r r� r4 )r� r� r� )rH rw rx r� � s
zParseExpression.ignorec sL yt t| �j� S tk
r" Y nX | jd krFd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU rH r� r� r4 )r� )rH rw rx r� � s
zParseExpression.__str__c s0 t t| �j� x| jD ] }|j� qW t| j�dk�r | jd }t|| j�r�|j r�|jd kr�|j r�|jd d � | jd g | _d | _
| j |j O _ | j |j O _ | jd }t|| j�o�|j o�|jd ko�|j �r | jd d� |jd d � | _d | _
| j |j O _ | j |j O _ dt
| � | _| S )Nrq r rr z Expected rs rs )r� r r� r4 r� rz rH rS rV r^ rU r[ r` r� ra )r� r� r� )rH rw rx r� � s0
zParseExpression.streamlinec s t t| �j||�}|S )N)r� r rm )r� r� rl r� )rH rw rx rm � s z ParseExpression.setResultsNamec C s: |d d � | g }x| j D ]}|j|� qW | jg � d S )N)r4 r� r� )r� r� �tmpr� rw rw rx r� � s zParseExpression.validatec s$ t t| �j� }dd� | jD �|_|S )Nc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z(ParseExpression.copy.<locals>.<listcomp>)r� r r� r4 )r� r� )rH rw rx r� � s zParseExpression.copy)F)F)r� r� r� r� r� r� r� r� r� r� r� rm r� r� r� rw rw )rH rx r � s
" c sT e Zd ZdZG dd� de�Zd� fdd� Zddd�Zd d
� Zd d � Z d
d� Z
� Z S )r a
Requires all given C{ParseExpression}s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the C{'+'} operator.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
c s e Zd Z� fdd�Z� ZS )zAnd._ErrorStopc s& t tj| �j||� d| _| j� d S )N�-)r� r r� r� r� r� )r� r� r� )rH rw rx r�
s zAnd._ErrorStop.__init__)r� r� r� r� r� rw rw )rH rx r�
s r� Tc sR t t| �j||� tdd� | jD ��| _| j| jd j� | jd j| _d| _ d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r�
s z And.__init__.<locals>.<genexpr>r T)
r� r r� r6 r4 r[ r� rY rX re )r� r4 rg )rH rw rx r�
s
z And.__init__c C s | j d j|||dd�\}}d}x�| j dd � D ]�}t|tj�rFd}q0|r�y|j|||�\}}W q� tk
rv � Y q� tk
r� } zd |_tj|��W Y d d }~X q� t k
r� t|t
|�| j | ��Y q�X n|j|||�\}}|s�|j � r0||7 }q0W ||fS )Nr F)rp rr T)
r4 rt rz r r� r# r �
__traceback__r� r� r� ra r� ) r� r- r� ro �
resultlistZ errorStopr� Z
exprtokensr� rw rw rx r�
s( z
And.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx r 5
s
z And.__iadd__c C s8 |d d � | g }x | j D ]}|j|� |jsP qW d S )N)r4 r� r[ )r� r� �subRecCheckListr� rw rw rx r� :
s
zAnd.checkRecursionc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� �{r� c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� F
s z And.__str__.<locals>.<genexpr>�})r� r� rU r� r4 )r� rw rw rx r� A
s
z And.__str__)T)T) r� r� r� r� r
r� r� r� r r� r� r� rw rw )rH rx r � s
c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the expression that matches the longest string will be used.
May be constructed using the C{'^'} operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� \
s z Or.__init__.<locals>.<genexpr>T)r� r r� r4 r r[ )r� r4 rg )rH rw rx r� Y
s z Or.__init__Tc C sT d}d }g }x�| j D ]�}y|j||�}W nv tk
rd } z d | _| j|krT| }| j}W Y d d } ~ X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX |j||f� qW |�r*|j dd� d� x`|D ]X\}
}y|j
|||�S tk
�r$ } z"d | _| j|k�r| }| j}W Y d d } ~ X q�X q�W |d k �rB| j|_ |�nt||d| ��d S )Nrr c S s
| d S )Nr rw )�xrw rw rx ry u
s z Or.parseImpl.<locals>.<lambda>)r� z no defined alternatives to matchrs ) r4 r� r r9 r� r� r� ra r� �sortrt r� ) r� r- r� ro � maxExcLoc� maxExceptionr� r� Zloc2r� �_rw rw rx r� `
s<
z Or.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ixor__�
s
z Or.__ixor__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r< z ^ c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z Or.__str__.<locals>.<genexpr>r= )r� r� rU r� r4 )r� rw rw rx r� �
s
z
Or.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r4 r� )r� r� r; r� rw rw rx r� �
s zOr.checkRecursion)F)T)
r� r� r� r� r� r� rC r� r� r� rw rw )rH rx r K
s
& c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the first one listed is the one that will match.
May be constructed using the C{'|'} operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� �
s z&MatchFirst.__init__.<locals>.<genexpr>T)r� r r� r4 r r[ )r� r4 rg )rH rw rx r� �
s zMatchFirst.__init__Tc C s� d}d }x�| j D ]�}y|j|||�}|S tk
r\ } z|j|krL|}|j}W Y d d }~X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX qW |d k r�| j|_|�nt||d| ��d S )Nrr z no defined alternatives to matchrs )r4 rt r r� r� r� ra r� ) r� r- r� ro r@ rA r� r� r� rw rw rx r� �
s$
zMatchFirst.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ior__�
s
zMatchFirst.__ior__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r< z | c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z%MatchFirst.__str__.<locals>.<genexpr>r= )r� r� rU r� r4 )r� rw rw rx r� �
s
zMatchFirst.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r4 r� )r� r� r; r� rw rw rx r� �
s zMatchFirst.checkRecursion)F)T)
r� r� r� r� r� r� rD r� r� r� rw rw )rH rx r �
s
c s< e Zd ZdZd � fdd� Zd dd�Zdd� Zd d
� Z� ZS )
r am
Requires all given C{ParseExpression}s to be found, but in any order.
Expressions may be separated by whitespace.
May be constructed using the C{'&'} operator.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
Tc s8 t t| �j||� tdd� | jD ��| _d| _d| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� s z Each.__init__.<locals>.<genexpr>T)r� r r� r6 r4 r[ rX �initExprGroups)r� r4 rg )rH rw rx r� s z
Each.__init__c
s� | j r�tdd� | jD ��| _dd� | jD �}dd� | jD �}|| | _dd� | jD �| _dd� | jD �| _dd� | jD �| _| j| j7 _d | _ |}| jd d � }| jd d � � g }d
} x�| �rp|� | j | j }
g } x~|
D ]v} y| j||�}W n t k
�r | j
| � Y q�X |j
| jj t | �| �� | |k�rD|j
| � q�| � kr� j
| � q�W t| �t|
�kr�d } q�W |�r�d jd d� |D ��}
t ||d
|
��|� fdd�| jD �7 }g }x*|D ]"} | j|||�\}}|j
|� �q�W t|tg ��}||fS )Nc s s& | ] }t |t�rt|j�|fV qd S )N)rz r r� r. )r� r� rw rw rx r� s z!Each.parseImpl.<locals>.<genexpr>c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� s z"Each.parseImpl.<locals>.<listcomp>c S s" g | ]}|j rt|t� r|�qS rw )r[ rz r )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r2 r. )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� ! s c S s g | ]}t |tttf�s|�qS rw )rz r r2 r )r� r� rw rw rx r� " s FTz, c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� = s z*Missing one or more required elements (%s)c s$ g | ] }t |t�r|j� kr|�qS rw )rz r r. )r� r� )�tmpOptrw rx r� A s )rE r� r4 Zopt1mapZ optionalsZmultioptionalsZ
multirequiredZrequiredr� r r� r� r� �remover� r� rt �sumr" )r� r- r� ro Zopt1Zopt2ZtmpLocZtmpReqdZ
matchOrderZ keepMatchingZtmpExprsZfailedr� Zmissingr: r� Z finalResultsrw )rF rx r� sP
zEach.parseImplc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r< z & c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� P s z Each.__str__.<locals>.<genexpr>r= )r� r� rU r� r4 )r� rw rw rx r� K s
z Each.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r4 r� )r� r� r; r� rw rw rx r� T s zEach.checkRecursion)T)T) r� r� r� r� r� r� r� r� r� rw rw )rH rx r �
s
5
1 c sl e Zd ZdZd� fdd� Zddd�Zdd � Z� fd
d �Z� fd d
�Zdd� Z g fdd�Z
� fdd�Z � Z S )r za
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r@ttjt�r2tj|�}ntjt |��}|| _
d | _ |d k r�|j | _ |j
| _
| j|j� |j| _|j| _|j| _| jj|j� d S )N)r� r r� rz r� �
issubclassr$ rQ r, r r. rU r` r[ r� rY rX rW re r] r� )r� r. rg )rH rw rx r� ^ s
z ParseElementEnhance.__init__Tc C s2 | j d k r | j j|||dd�S td|| j| ��d S )NF)rp r� )r. rt r ra )r� r- r� ro rw rw rx r� p s
z ParseElementEnhance.parseImplc C s* d| _ | jj� | _| jd k r&| jj� | S )NF)rX r. r� r� )r� rw rw rx r� v s
z#ParseElementEnhance.leaveWhitespacec sr t |t�rB|| jkrntt| �j|� | jd k rn| jj| jd � n,tt| �j|� | jd k rn| jj| jd � | S )Nrr rs rs )rz r+ r] r� r r� r. )r� r� )rH rw rx r� } s
zParseElementEnhance.ignorec s& t t| �j� | jd k r"| jj� | S )N)r� r r� r. )r� )rH rw rx r� � s
z ParseElementEnhance.streamlinec C sB | |krt || g ��|d d � | g }| jd k r>| jj|� d S )N)r& r. r� )r� r� r; rw rw rx r� � s
z"ParseElementEnhance.checkRecursionc C s6 |d d � | g }| j d k r(| j j|� | jg � d S )N)r. r� r� )r� r� r7 rw rw rx r� � s
z ParseElementEnhance.validatec sV yt t| �j� S tk
r" Y nX | jd krP| jd k rPd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU r. rH r� r� )r� )rH rw rx r� � s zParseElementEnhance.__str__)F)T)
r� r� r� r� r� r� r� r� r� r� r� r� r� rw rw )rH rx r Z s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
c s t t| �j|� d| _d S )NT)r� r r� r[ )r� r. )rH rw rx r� � s zFollowedBy.__init__Tc C s | j j||� |g fS )N)r. r� )r� r- r� ro rw rw rx r� � s zFollowedBy.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s2 e Zd ZdZ� fdd�Zd dd�Zdd� Z� ZS )
r a�
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
c s0 t t| �j|� d| _d| _dt| j� | _d S )NFTzFound unwanted token, )r� r r� rX r[ r� r. ra )r� r. )rH rw rx r� � s zNotAny.__init__Tc C s& | j j||�r t||| j| ��|g fS )N)r. r� r ra )r� r- r� ro rw rw rx r� � s zNotAny.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� z~{r= )r� r� rU r� r. )r� rw rw rx r� � s
zNotAny.__str__)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd Zd� fdd� Zddd�Z� ZS ) �_MultipleMatchNc sF t t| �j|� d| _|}t|t�r.tj|�}|d k r<| nd | _d S )NT) r� rJ r� rW rz r� r$ rQ � not_ender)r� r. �stopOnZender)rH rw rx r� � s
z_MultipleMatch.__init__Tc C s� | j j}| j}| jd k }|r$| jj}|r2|||� ||||dd�\}}yZ| j } xJ|rb|||� | rr|||�}
n|}
|||
|�\}} | s�| j� rT|| 7 }qTW W n ttfk
r� Y nX ||fS )NF)rp ) r. rt r� rK r� r] r� r r� ) r� r- r� ro Zself_expr_parseZself_skip_ignorablesZ check_enderZ
try_not_enderr� ZhasIgnoreExprsr� Z tmptokensrw rw rx r� � s,
z_MultipleMatch.parseImpl)N)T)r� r� r� r� r� r� rw rw )rH rx rJ � s rJ c @ s e Zd ZdZdd� ZdS )r a�
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
c C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r< z}...)r� r� rU r� r. )r� rw rw rx r� ! s
zOneOrMore.__str__N)r� r� r� r� r� rw rw rw rx r s c s8 e Zd ZdZd
� fdd� Zd � fdd� Zdd � Z� ZS ) r2 aw
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
Nc s t t| �j||d� d| _d S )N)rL T)r� r2 r� r[ )r� r. rL )rH rw rx r� 6 s zZeroOrMore.__init__Tc s6 yt t| �j|||�S ttfk
r0 |g fS X d S )N)r� r2 r� r r� )r� r- r� ro )rH rw rx r� : s zZeroOrMore.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r z]...)r� r� rU r� r. )r� rw rw rx r� @ s
zZeroOrMore.__str__)N)T)r� r� r� r� r� r� r� r� rw rw )rH rx r2 * s c @ s e Zd Zdd� ZeZdd� ZdS )�
_NullTokenc C s dS )NFrw )r� rw rw rx r� J s z_NullToken.__bool__c C s dS )Nr� rw )r� rw rw rx r� M s z_NullToken.__str__N)r� r� r� r� r' r� rw rw rw rx rM I s rM c s6 e Zd ZdZef� fdd� Zd dd�Zdd� Z� ZS )
r aa
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
c s. t t| �j|dd� | jj| _|| _d| _d S )NF)rg T)r� r r� r. rW r� r[ )r� r. r� )rH rw rx r� t s
zOptional.__init__Tc C sz y | j j|||dd�\}}W nT ttfk
rp | jtk rh| j jr^t| jg�}| j|| j j< ql| jg}ng }Y nX ||fS )NF)rp )r. rt r r� r� �_optionalNotMatchedrV r" )r� r- r� ro r� rw rw rx r� z s
zOptional.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r r )r� r� rU r� r. )r� rw rw rx r� � s
zOptional.__str__)T) r� r� r� r� rN r� r� r� r� rw rw )rH rx r Q s "
c s, e Zd ZdZd � fdd� Zd
dd�Z� ZS ) r( a�
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
FNc s` t t| �j|� || _d| _d| _|| _d| _t|t �rFt
j |�| _ n|| _ dt
| j� | _d S )NTFzNo match found for )r� r( r� �
ignoreExprr[ r` � includeMatchr� rz r� r$ rQ �failOnr� r. ra )r� r� �includer� rQ )rH rw rx r� � s
zSkipTo.__init__Tc C s, |}t |�}| j}| jj}| jd k r,| jjnd }| jd k rB| jjnd } |}
x�|
|kr�|d k rh|||
�rhP | d k r�x*y| ||
�}
W qr tk
r� P Y qrX qrW y|||
ddd� W n tt fk
r� |
d7 }
Y qLX P qLW t||| j
| ��|
}|||� } t | �} | j �r$||||dd�\}}
| |
7 } || fS )NF)ro rp rr )rp )
r� r. rt rQ r� rO r� r r r� ra r" rP )r� r- r� ro r0 r� r. Z
expr_parseZself_failOn_canParseNextZself_ignoreExpr_tryParseZtmplocZskiptextZ
skipresultr� rw rw rx r� � s<
zSkipTo.parseImpl)FNN)T)r� r� r� r� r� r� r� rw rw )rH rx r( � s 6
c sb e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Zd d � Zg fd
d�Z dd� Z
� fdd�Z � Z S )r aK
Forward declaration of an expression to be defined later -
used for recursive grammars, such as algebraic infix notation.
When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
Note: take care when assigning to C{Forward} not to overlook precedence of operators.
Specifically, '|' has a lower precedence than '<<', so that::
fwdExpr << a | b | c
will actually be evaluated as::
(fwdExpr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the C{Forward}::
fwdExpr << (a | b | c)
Converting to use the '<<=' operator instead will avoid this problem.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
Nc s t t| �j|dd� d S )NF)rg )r� r r� )r� r� )rH rw rx r� s zForward.__init__c C sj t |t�rtj|�}|| _d | _| jj| _| jj| _| j| jj � | jj
| _
| jj | _ | j j
| jj � | S )N)rz r� r$ rQ r. rU r` r[ r� rY rX rW r] r� )r� r� rw rw rx �
__lshift__ s
zForward.__lshift__c C s | |> S )Nrw )r� r� rw rw rx � __ilshift__' s zForward.__ilshift__c C s
d| _ | S )NF)rX )r� rw rw rx r� * s zForward.leaveWhitespacec C s$ | j s d| _ | jd k r | jj� | S )NT)r_ r. r� )r� rw rw rx r� . s
zForward.streamlinec C s> | |kr0|d d � | g }| j d k r0| j j|� | jg � d S )N)r. r� r� )r� r� r7 rw rw rx r� 5 s
zForward.validatec C s> t | d�r| jS | jjd S d}W d | j| _X | jjd | S )Nr� z: ...�Nonez: )r� r� rH r� Z _revertClass�_ForwardNoRecurser. r� )r� Z retStringrw rw rx r� < s
zForward.__str__c s. | j d k rtt| �j� S t� }|| K }|S d S )N)r. r� r r� )r� r� )rH rw rx r� M s
z Forward.copy)N)
r� r� r� r� r� rS rT r� r� r� r� r� r� rw rw )rH rx r s
c @ s e Zd Zdd� ZdS )rV c C s dS )Nz...rw )r� rw rw rx r� V s z_ForwardNoRecurse.__str__N)r� r� r� r� rw rw rw rx rV U s rV c s" e Zd ZdZd� fdd� Z� ZS )r- zQ
Abstract subclass of C{ParseExpression}, for converting parsed results.
Fc s t t| �j|� d| _d S )NF)r� r- r� rW )r� r. rg )rH rw rx r� ] s zTokenConverter.__init__)F)r� r� r� r� r� r� rw rw )rH rx r- Y s c s6 e Zd ZdZd
� fdd� Z� fdd�Zdd � Z� ZS ) r
a�
Converter to concatenate all matching tokens to a single string.
By default, the matching patterns must also be contiguous in the input string;
this can be disabled by specifying C{'adjacent=False'} in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
r� Tc s8 t t| �j|� |r | j� || _d| _|| _d| _d S )NT)r� r
r� r� �adjacentrX �
joinStringre )r� r. rX rW )rH rw rx r� r s zCombine.__init__c s( | j rtj| |� ntt| �j|� | S )N)rW r$ r� r� r
)r� r� )rH rw rx r� | s zCombine.ignorec C sP |j � }|d d �= |tdj|j| j��g| jd�7 }| jrH|j� rH|gS |S d S )Nr� )r� )r� r" r� r
rX rb rV r� )r� r- r� r� ZretToksrw rw rx r� � s
"zCombine.postParse)r� T)r� r� r� r� r� r� r� r� rw rw )rH rx r
a s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r a�
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s zGroup.__init__c C s |gS )Nrw )r� r- r� r� rw rw rx r� � s zGroup.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r aW
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s z
Dict.__init__c C s� x�t |�D ]�\}}t|�dkr q
|d }t|t�rBt|d �j� }t|�dkr^td|�||< q
t|�dkr�t|d t� r�t|d |�||< q
|j� }|d= t|�dks�t|t�r�|j � r�t||�||< q
t|d |�||< q
W | j
r�|gS |S d S )Nr rr r� rq ) r� r� rz ru r� r� r� r" r� r� rV )r� r- r� r� r� �tokZikeyZ dictvaluerw rw rx r� � s$
zDict.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s # c @ s e Zd ZdZdd� Zdd� ZdS )r+ aV
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
c C s g S )Nrw )r� r- r� r� rw rw rx r� � s zSuppress.postParsec C s | S )Nrw )r� rw rw rx r� � s zSuppress.suppressN)r� r� r� r� r� r� rw rw rw rx r+ � s c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) r zI
Wrapper for parse actions, to ensure they are only called once.
c C s t |�| _d| _d S )NF)rM �callable�called)r� Z
methodCallrw rw rx r� s
zOnlyOnce.__init__c C s. | j s | j|||�}d| _ |S t||d��d S )NTr� )r[ rZ r )r� r� r5 rv r� rw rw rx r� s
zOnlyOnce.__call__c C s
d| _ d S )NF)r[ )r� rw rw rx �reset
s zOnlyOnce.resetN)r� r� r� r� r� r� r\ rw rw rw rx r � s c s: t � �� � fdd�}y � j|_W n tk
r4 Y nX |S )as
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
c s� � j }| dd � \}}}t| �dkr8| d jj d | }tjjd|t||�||f � y � | � }W n8 tk
r� } z tjjd||f � � W Y d d }~X nX tjjd||f � |S )Nro r �.z">>entering %s(line: '%s', %d, %r)
z <<leaving %s (exception: %s)
z<<leaving %s (ret: %r)
r9 )r� r� rH r~ �stderr�writerG rK )ZpaArgsZthisFuncr� r5 rv r� r3 )r� rw rx �z# s ztraceParseAction.<locals>.z)rM r� r� )r� r` rw )r� rx rb
s
�,Fc C s` t | �d t |� d t | � d }|rBt| t|| � �j|�S | tt|�| � j|�S dS )a�
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
z [r� z]...N)r� r
r2 ri r+ )r. Zdelim�combineZdlNamerw rw rx r@ 9 s
$c sj t � � � �fdd�}|dkr0tt�jdd� �}n|j� }|jd� |j|dd� |� jd t�� d
�S ) a:
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
c s. |d }� |r t t�g| ��p&t t�> g S )Nr )r r rC )r� r5 rv r� )� arrayExprr. rw rx �countFieldParseAction_ s "z+countedArray.<locals>.countFieldParseActionNc S s t | d �S )Nr )ru )rv rw rw rx ry d s z countedArray.<locals>.<lambda>ZarrayLenT)rf z(len) z...)r r/ rR r� r� ri rx r� )r. ZintExprrd rw )rc r. rx r< L s
c C s: g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W |S )N)rz r� r� r� r� )�Lr� r� rw rw rx r� k s
r� c s6 t � � � fdd�}| j|dd� � jdt| � � � S )a*
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
c sP |rBt |�dkr � |d > qLt|j� �}� tdd� |D ��> n
� t� > d S )Nrr r c s s | ]}t |�V qd S )N)r )r� �ttrw rw rx r� � s zDmatchPreviousLiteral.<locals>.copyTokenToRepeater.<locals>.<genexpr>)r� r� r� r r
)r� r5 rv Ztflat)�reprw rx �copyTokenToRepeater� s z1matchPreviousLiteral.<locals>.copyTokenToRepeaterT)rf z(prev) )r rx ri r� )r. rh rw )rg rx rO t s
c sF t � � | j� }� |K � � fdd�}| j|dd� � jdt| � � � S )aS
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
c s* t |j� �� � fdd�}�j|dd� d S )Nc s$ t |j� �}|� kr tddd��d S )Nr� r )r� r� r )r� r5 rv Z theseTokens)� matchTokensrw rx �mustMatchTheseTokens� s zLmatchPreviousExpr.<locals>.copyTokenToRepeater.<locals>.mustMatchTheseTokensT)rf )r� r� r� )r� r5 rv rj )rg )ri rx rh � s z.matchPreviousExpr.<locals>.copyTokenToRepeaterT)rf z(prev) )r r� rx ri r� )r. Ze2rh rw )rg rx rN � s c C s> x dD ]}| j |t| �} qW | j dd�} | j dd�} t| �S )Nz\^-]r z\nr( z\t)r� �_bslashr� )r� r� rw rw rx r � s
r Tc
s� |rdd� }dd� }t � ndd� }dd� }t� g }t| t�rF| j� }n&t| tj�r\t| �}ntj dt
dd� |svt � S d }x�|t |�d
k �r|| }xnt
||d
d � �D ]N\}} || |�r�||| d
= P q�||| �r�||| d
= |j|| � | }P q�W |d
7 }q|W | �r�|�r�yht |�t d j|��k�rZtd
d jdd� |D �� �jdj|��S tdjdd� |D ���jdj|��S W n& tk
�r� tj dt
dd� Y nX t� fdd�|D ��jdj|��S )a�
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
c S s | j � |j � kS )N)r� )r �brw rw rx ry � s zoneOf.<locals>.<lambda>c S s |j � j| j � �S )N)r� r� )r rl rw rw rx ry � s c S s | |kS )Nrw )r rl rw rw rx ry � s c S s
|j | �S )N)r� )r rl rw rw rx ry � s z6Invalid argument to oneOf, expected string or iterablerq )r� r rr Nr� z[%s]c s s | ]}t |�V qd S )N)r )r� �symrw rw rx r� � s zoneOf.<locals>.<genexpr>z | �|c s s | ]}t j|�V qd S )N)rd r )r� rm rw rw rx r� � s z7Exception creating Regex for oneOf, building MatchFirstc 3 s | ]}� |�V qd S )Nrw )r� rm )�parseElementClassrw rx r� � s )r r rz r� r� r� r5 r� r� r� r� r r� r� r� r� r' ri rK r )
Zstrsr� ZuseRegexZisequalZmasksZsymbolsr� Zcurr� r� rw )ro rx rS � sL
((c C s t tt| | ���S )a�
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
)r r2 r )r� r� rw rw rx rA � s !c C s^ t � jdd� �}|j� }d|_|d�| |d� }|r@dd� }ndd� }|j|� | j|_|S ) a�
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
c S s |S )Nrw )r� r� rv rw rw rx ry 8 s z!originalTextFor.<locals>.<lambda>F�_original_start�
_original_endc S s | |j |j� S )N)rp rq )r� r5 rv rw rw rx ry = s c S s& | |j d�|j d�� g|d d �< d S )Nrp rq )r� )r� r5 rv rw rw rx � extractText? s z$originalTextFor.<locals>.extractText)r
r� r� re r] )r. ZasStringZ locMarkerZ endlocMarker� matchExprrr rw rw rx rg s
c C s t | �jdd� �S )zp
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
c S s | d S )Nr rw )rv rw rw rx ry J s zungroup.<locals>.<lambda>)r- r� )r. rw rw rx rh E s c C s4 t � jdd� �}t|d�| d� |j� j� d� �S )a�
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
c S s |S )Nrw )r� r5 rv rw rw rx ry ` s z locatedExpr.<locals>.<lambda>Z
locn_startr� Zlocn_end)r
r� r r� r� )r. Zlocatorrw rw rx rj L s z\[]-*.$+^?()~ )r
c C s |d d S )Nr rr rw )r� r5 rv rw rw rx ry k s ry z\\0?[xX][0-9a-fA-F]+c C s t t|d jd�d��S )Nr z\0x� )�unichrru �lstrip)r� r5 rv rw rw rx ry l s z \\0[0-7]+c C s t t|d dd � d��S )Nr rr � )ru ru )r� r5 rv rw rw rx ry m s z\])r� r
z\wr8 r r� Znegate�bodyr c sB dd� � y dj � fdd�tj| �jD ��S tk
r< dS X dS )a�
Helper to easily define string ranges for use in Word construction. Borrows
syntax from regexp '[]' string range definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string is the expanded
character set joined into a single string.
The values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
c S s< t | t�s| S djdd� tt| d �t| d �d �D ��S )Nr� c s s | ]}t |�V qd S )N)ru )r� r� rw rw rx r� � s z+srange.<locals>.<lambda>.<locals>.<genexpr>r rr )rz r" r� r� �ord)�prw rw rx ry � s zsrange.<locals>.<lambda>r� c 3 s | ]}� |�V qd S )Nrw )r� �part)� _expandedrw rx r� � s zsrange.<locals>.<genexpr>N)r� �_reBracketExprr� rx rK )r� rw )r| rx r_ r s
c s � fdd�}|S )zt
Helper method for defining parse actions that require matching at a specific
column in the input text.
c s" t || �� kr t| |d� ��d S )Nz matched token not at column %d)r9 r )r) Zlocnr1 )r� rw rx � verifyCol� s z!matchOnlyAtCol.<locals>.verifyColrw )r� r~ rw )r� rx rM � s c s � fdd�S )a�
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
c s � gS )Nrw )r� r5 rv )�replStrrw rx ry � s z replaceWith.<locals>.<lambda>rw )r rw )r rx r\ � s c C s |d dd� S )a
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
r rr rs rw )r� r5 rv rw rw rx rZ � s c sN � �fdd�}yt �dt �d�j�}W n tk
rB t��}Y nX ||_|S )aG
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
c s � �fdd�|D �S )Nc s g | ]}�|f� �� �qS rw rw )r� Ztokn)r� r6 rw rx r� � s z(tokenMap.<locals>.pa.<locals>.<listcomp>rw )r� r5 rv )r� r6 rw rx r} � s ztokenMap.<locals>.par� rH )rJ r� rK r{ )r6 r� r} rL rw )r� r6 rx rm � s c C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� �lower)rv rw rw rx ry � s c C s� t | t�r | }t| | d�} n| j}tttd �}|r�tj� j t
�}t d�| d� t t
t|t d� | ��� tddgd�jd �j d
d � � t d � }n�d
jdd� tD ��}tj� j t
�t|�B }t d�| d� t t
t|j t�tt d�| � ��� tddgd�jd �j dd � � t d � }ttd�| d �}|jdd
j|jdd�j� j� � �jd| �}|jdd
j|jdd�j� j� � �jd| �}||_||_||fS )zRInternal helper to construct opening and closing tag expressions, given a tag name)r� z_-:r �tag�=�/F)r� rC c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z_makeTags.<locals>.<lambda>r r� c s s | ]}|d kr|V qdS )r Nrw )r� r� rw rw rx r� � s z _makeTags.<locals>.<genexpr>c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z</r� �:r� z<%s>r z</%s>) rz r� r r� r/ r4 r3 r> r� r� rZ r+ r r2 r r rm r� rV rY rB r
�_Lr� �titler� ri r� )�tagStrZxmlZresnameZ tagAttrNameZ tagAttrValueZopenTagZprintablesLessRAbrackZcloseTagrw rw rx � _makeTags� s"
T\..r� c C s
t | d�S )a
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
F)r� )r� rw rw rx rK � s c C s
t | d�S )z�
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
T)r� )r� rw rw rx rL s c s8 | r| dd� � n|j � � dd� � D �� � fdd�}|S )a<
Helper to create a validating parse action to be used with start tags created
with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
with a required attribute value, to avoid false matches on common tags such as
C{<TD>} or C{<DIV>}.
Call C{withAttribute} with a series of attribute names and values. Specify the list
of filter attributes names and values as:
- keyword arguments, as in C{(align="right")}, or
- as an explicit dict with C{**} operator, when an attribute name is also a Python
reserved word, as in C{**{"class":"Customer", "align":"right"}}
- a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
For attribute names with a namespace prefix, you must use the second form. Attribute
names are matched insensitive to upper/lower case.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
Nc S s g | ]\}}||f�qS rw rw )r� r� r� rw rw rx r� Q s z!withAttribute.<locals>.<listcomp>c s^ xX� D ]P\}}||kr&t | |d| ��|tjkr|| |krt | |d||| |f ��qW d S )Nzno matching attribute z+attribute '%s' has value '%s', must be '%s')r re � ANY_VALUE)r� r5 r� ZattrNameZ attrValue)�attrsrw rx r} R s zwithAttribute.<locals>.pa)r� )r� ZattrDictr} rw )r� rx re s 2 c C s |r d| nd}t f || i�S )a�
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
z%s:class�class)re )Z classname� namespaceZ classattrrw rw rx rk \ s �(r c C s� t � }| || | B }�x`t|�D �]R\}}|d dd� \}} }
} | dk rTd| nd| } | dkr�|dksxt|�dkr�td��|\}
}t � j| �}|
tjk�rd| dkr�t|| �t|t |� � }n�| dk�r |dk �r t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�rZt||
| | | �t||
| | | � }ntd ��n�|
tj
k�rH| dk�r�t |t ��s�t |�}t|j
| �t|| � }n�| dk�r|dk �r�t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�r>t||
| | | �t||
| | | � }ntd ��ntd
��| �r`|j| � ||j| �|B K }|}q"W ||K }|S ) a�
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
Nr ro z%s termz %s%s termrq z@if numterms=3, opExpr must be a tuple or list of two expressionsrr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)N)r r� r� r� ri rT �LEFTr r r �RIGHTrz r r. r� )ZbaseExprZopListZlparZrparr� ZlastExprr� ZoperDefZopExprZarityZrightLeftAssocr} ZtermNameZopExpr1ZopExpr2ZthisExprrs rw rw rx ri � sR ;
&
&
z4"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�"z string enclosed in double quotesz4'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�'z string enclosed in single quotesz*quotedString using single or double quotes�uzunicode string literalc C s� | |krt d��|dk�r(t| t�o,t|t��r t| �dkr�t|�dkr�|dk r�tt| t| | tj dd� ��j dd� �}n$t
j � t| | tj �j dd� � }nx|dk r�tt| t | � t |� ttjdd� ��j dd� �}n4ttt | � t |� ttjdd� ��j d d� �}nt d
��t
� }|dk �rb|tt| �t||B |B � t|� �K }n$|tt| �t||B � t|� �K }|jd | |f � |S ) a~
Helper method for defining nested lists enclosed in opening and closing
delimiters ("(" and ")" are the default).
Parameters:
- opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
z.opening and closing strings cannot be the sameNrr )r
c S s | d j � S )Nr )r� )rv rw rw rx ry 9 s z nestedExpr.<locals>.<lambda>c S s | d j � S )Nr )r� )rv rw rw rx ry < s c S s | d j � S )Nr )r� )rv rw rw rx ry B s c S s | d j � S )Nr )r� )rv rw rw rx ry F s zOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)r� rz r� r� r
r r r$ rN r� rC r� r r r r+ r2 ri )�openerZcloserZcontentrO r� rw rw rx rP � s4 :
*$c s� � fdd�}� fdd�}� fdd�}t t� jd�j� �}t� t� j|� jd�}t� j|�jd �}t� j|�jd
�} |r�tt|�| t |t| � t|� � | �}
n$tt|�t |t| � t|� � �}
| j t
t� � |
jd �S ) a
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
c sN |t | �krd S t|| �}|� d krJ|� d kr>t| |d��t| |d��d S )Nrr zillegal nestingznot a peer entryrs rs )r� r9 r! r )r� r5 rv �curCol)� indentStackrw rx �checkPeerIndent� s
z&indentedBlock.<locals>.checkPeerIndentc s2 t || �}|� d kr"� j|� n t| |d��d S )Nrr znot a subentryrs )r9 r� r )r� r5 rv r� )r� rw rx �checkSubIndent� s
z%indentedBlock.<locals>.checkSubIndentc sN |t | �krd S t|| �}� o4|� d k o4|� d ksBt| |d��� j� d S )Nrr rq znot an unindentrs r: )r� r9 r r� )r� r5 rv r� )r� rw rx �
checkUnindent� s
z$indentedBlock.<locals>.checkUnindentz �INDENTr� ZUNINDENTzindented block) r r r� r� r
r� ri r r r� rk ) ZblockStatementExprr� r r� r� r� r! r� ZPEERZUNDENTZsmExprrw )r� rx rf Q s N , z#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]z_:zany tagzgt lt amp nbsp quot aposz><& "'z &(?P<entity>rn z);zcommon HTML entityc C s t j| j�S )zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMapr� Zentity)rv rw rw rx r[ � s z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style comment)r� z � commaItem)r� c @ s� e Zd ZdZee�Zee�Ze e
�j d�j e�Z
e e�j d�j eed��Zed�j d�j e�Ze� j e�d e� j e� j d�Zejd d
� � eeeed �j� e � B j d �Zeje� ed
�j d�j e�Zed�j d�j e�ZeeB eB j� Zed�j d�j e�Z e e d e d �j d�Z ed�j d�Z ed�j d�Z!e!de! d j d�Z"ee!de! d> �d ee!de! d? � j d �Z#e#j$d d
� � d!e j d"�Z%e&e"e%B e#B j d#��j d#�Z'ed$�j d%�Z(e)d@d'd(��Z*e)dAd*d+��Z+ed,�j d-�Z,ed.�j d/�Z-ed0�j d1�Z.e/j� e0j� B Z1e)d2d3� �Z2e&e3e4d4� e5� e e6d4d5� ee7d6�� ��j� j d7�Z8e9ee:j;� e8B d8d9��j d:�Z<e)ed;d
� ��Z=e)ed<d
� ��Z>d=S )Brn a�
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
�integerz hex integerrt z[+-]?\d+zsigned integerr� �fractionc C s | d | d S )Nr rr rs rw )rv rw rw rx ry � s zpyparsing_common.<lambda>r8 z"fraction or mixed integer-fractionz
[+-]?\d+\.\d*z real numberz+[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)z$real number with scientific notationz [+-]?\d+\.?\d*([eE][+-]?\d+)?�fnumberrB �
identifierzK(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}z IPv4 addressz[0-9a-fA-F]{1,4}� hex_integerr� � zfull IPv6 addressr rB z::zshort IPv6 addressc C s t dd� | D ��dk S )Nc s s | ]}t jj|�rd V qdS )rr N)rn �
_ipv6_partr� )r� rf rw rw rx r� � s z,pyparsing_common.<lambda>.<locals>.<genexpr>rw )rH )rv rw rw rx ry � s z::ffff:zmixed IPv6 addressz IPv6 addressz:[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}z MAC address�%Y-%m-%dc s � fdd�}|S )a�
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
c sL yt j|d � �j� S tk
rF } zt| |t|���W Y d d }~X nX d S )Nr )r �strptimeZdater� r r{ )r� r5 rv �ve)�fmtrw rx �cvt_fn� s z.pyparsing_common.convertToDate.<locals>.cvt_fnrw )r� r� rw )r� rx �
convertToDate� s z pyparsing_common.convertToDate�%Y-%m-%dT%H:%M:%S.%fc s � fdd�}|S )a
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
c sH yt j|d � �S tk
rB } zt| |t|���W Y d d }~X nX d S )Nr )r r� r� r r{ )r� r5 rv r� )r� rw rx r� � s z2pyparsing_common.convertToDatetime.<locals>.cvt_fnrw )r� r� rw )r� rx �convertToDatetime� s z"pyparsing_common.convertToDatetimez7(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?z ISO8601 datez�(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?zISO8601 datetimez2[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}�UUIDc C s t jj|d �S )a
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
r )rn �_html_stripperr� )r� r5 r� rw rw rx �
stripHTMLTags� s
z pyparsing_common.stripHTMLTagsra )r� z r� r� )r� zcomma separated listc C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� r� )rv rw rw rx ry � s N)r rB )r rB )r� )r� )?r� r� r� r� rm ru ZconvertToInteger�floatZconvertToFloatr/ rR ri r� r� rD r� r' Zsigned_integerr� rx r r� Z
mixed_integerrH �realZsci_realr� �numberr� r4 r3 r� Z ipv4_addressr� Z_full_ipv6_addressZ_short_ipv6_addressr~ Z_mixed_ipv6_addressr
Z ipv6_addressZ mac_addressr� r� r� Z iso8601_dateZiso8601_datetime�uuidr7 r6 r� r� r r r rV r. �
_commasepitemr@ rY r� Zcomma_separated_listrd rB rw rw rw rx rn � sN ""
2 8 �__main__Zselect�fromz_$r] )rb �columnsrj ZtablesZcommandaK
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
z]
100
-100
+100
3.14159
6.02e23
1e-12
z
100
FF
z6
12345678-1234-5678-1234-567812345678
)rq )ra F)N)FT)T)r� )T)�r� � __version__Z__versionTime__�
__author__r� �weakrefr r� r� r~ r� rd r r� r" r< r� r �_threadr � ImportErrorZ threadingr r� Z ordereddict�__all__r� � version_infor; r �maxsizer� r{ r� �chrru r� rH r� r �reversedr� r� r r6 r r rI ZmaxintZxranger� Z __builtin__r� Zfnamer� rJ r� r� r� r� r� r� Zascii_uppercaseZascii_lowercaser4 rR rD r3 rk r� Z printablerV rK r r r! r# r& r� r" �MutableMapping�registerr9 rJ rG r/ r2 r4 rQ rM r$ r, r
r r r� rQ r r r rl r/ r' r% r r. r0 r r r r* r) r1 r0 r r r r r r r r rJ r r2 rM rN r r( r rV r- r
r r r+ r rb r@ r< r� rO rN r rS rA rg rh rj ri rC rI rH ra r` r� Z _escapedPuncZ_escapedHexCharZ_escapedOctChar�UNICODEZ _singleCharZ
_charRangerm r} r_ rM r\ rZ rm rd rB r� rK rL re r� rk rT r� r� ri rU r> r^ rY rc rP rf r5 rW r7 r6 r� r� r� r� r; r[ r8 rE r� r] r? r= rF rX r� r� r: rn r� Z selectTokenZ fromTokenZidentZ
columnNameZcolumnNameListZ
columnSpecZ tableNameZ
tableNameListZ simpleSQLr� r� r� r� r� r� rw rw rw rx �<module>= s�
8
@ d &A= I
G3 pLOD|M &# @sQ,A, I# % &0
, ? #k Zr
(
0
" pip/_vendor/__pycache__/distro.cpython-36.opt-1.pyc 0000644 00000077437 14751155150 0016117 0 ustar 00 3
���e� � @ sb d Z ddlZddlZddlZddlZddlZddlZddlZejj d�sXe
dj ej���dZ dZ
i Zddd �Zd
diZejd �Zejd �Zd
dde
dfZd:dd�Zdd� Zd;dd�Zd<dd�Zd=dd �Zd>d d �Zd?d d �Zd@d!d"�Z d#d$� Z d%d&� Z dAd'd(�Z d)d*� Z d+d,� Z!d-d.� Z"d/d0� Z#d1d2� Z$d3d4� Z%G d5d6� d6e&�Z'e'� Z(d7d8� Z)e*d9k�r^e)� dS )Ba,
The ``distro`` package (``distro`` stands for Linux Distribution) provides
information about the Linux distribution it runs on, such as a reliable
machine-readable distro ID, or version information.
It is a renewed alternative implementation for Python's original
:py:func:`platform.linux_distribution` function, but it provides much more
functionality. An alternative implementation became necessary because Python
3.5 deprecated this function, and Python 3.7 is expected to remove it
altogether. Its predecessor function :py:func:`platform.dist` was already
deprecated since Python 2.6 and is also expected to be removed in Python 3.7.
Still, there are many cases in which access to Linux distribution information
is needed. See `Python issue 1322 <https://bugs.python.org/issue1322>`_ for
more information.
� N�linuxzUnsupported platform: {0}z/etcz
os-releaseZoracleZrhel)ZenterpriseenterpriseZredhatenterpriseworkstationZredhatzA(?:[^)]*\)(.*)\()? *(?:STL )?([\d.+\-a-z]*\d) *(?:esaeler *)?(.+)z(\w+)[-_](release|version)$Zdebian_versionz lsb-releasez oem-releasezsystem-releaseTc C s
t j| �S )a$
Return information about the current Linux distribution as a tuple
``(id_name, version, codename)`` with items as follows:
* ``id_name``: If *full_distribution_name* is false, the result of
:func:`distro.id`. Otherwise, the result of :func:`distro.name`.
* ``version``: The result of :func:`distro.version`.
* ``codename``: The result of :func:`distro.codename`.
The interface of this function is compatible with the original
:py:func:`platform.linux_distribution` function, supporting a subset of
its parameters.
The data it returns may not exactly be the same, because it uses more data
sources than the original function, and that may lead to different data if
the Linux distribution is not consistent across multiple data sources it
provides (there are indeed such distributions ...).
Another reason for differences is the fact that the :func:`distro.id`
method normalizes the distro ID string to a reliable machine-readable value
for a number of popular Linux distributions.
)�_distro�linux_distribution)�full_distribution_name� r � /usr/lib/python3.6/distro.pyr ` s r c C s t j� S )a�
Return the distro ID of the current Linux distribution, as a
machine-readable string.
For a number of Linux distributions, the returned distro ID value is
*reliable*, in the sense that it is documented and that it does not change
across releases of the distribution.
This package maintains the following reliable distro ID values:
============== =========================================
Distro ID Distribution
============== =========================================
"ubuntu" Ubuntu
"debian" Debian
"rhel" RedHat Enterprise Linux
"centos" CentOS
"rocky" Rocky Linux
"fedora" Fedora
"sles" SUSE Linux Enterprise Server
"opensuse" openSUSE
"amazon" Amazon Linux
"arch" Arch Linux
"cloudlinux" CloudLinux OS
"exherbo" Exherbo Linux
"gentoo" GenToo Linux
"ibm_powerkvm" IBM PowerKVM
"kvmibm" KVM for IBM z Systems
"linuxmint" Linux Mint
"mageia" Mageia
"mandriva" Mandriva Linux
"parallels" Parallels
"pidora" Pidora
"raspbian" Raspbian
"oracle" Oracle Linux (and Oracle Enterprise Linux)
"scientific" Scientific Linux
"slackware" Slackware
"xenserver" XenServer
============== =========================================
If you have a need to get distros for reliable IDs added into this set,
or if you find that the :func:`distro.id` function returns a different
distro ID for one of the listed distros, please create an issue in the
`distro issue tracker`_.
**Lookup hierarchy and transformations:**
First, the ID is obtained from the following sources, in the specified
order. The first available and non-empty value is used:
* the value of the "ID" attribute of the os-release file,
* the value of the "Distributor ID" attribute returned by the lsb_release
command,
* the first part of the file name of the distro release file,
The so determined ID value then passes the following transformations,
before it is returned by this method:
* it is translated to lower case,
* blanks (which should not be there anyway) are translated to underscores,
* a normalization of the ID is performed, based upon
`normalization tables`_. The purpose of this normalization is to ensure
that the ID is as reliable as possible, even across incompatible changes
in the Linux distributions. A common reason for an incompatible change is
the addition of an os-release file, or the addition of the lsb_release
command, with ID values that differ from what was previously determined
from the distro release file name.
)r �idr r r r r | s Ir Fc C s
t j| �S )an
Return the name of the current Linux distribution, as a human-readable
string.
If *pretty* is false, the name is returned without version or codename.
(e.g. "CentOS Linux")
If *pretty* is true, the version and codename are appended.
(e.g. "CentOS Linux 7.1.1503 (Core)")
**Lookup hierarchy:**
The name is obtained from the following sources, in the specified order.
The first available and non-empty value is used:
* If *pretty* is false:
- the value of the "NAME" attribute of the os-release file,
- the value of the "Distributor ID" attribute returned by the lsb_release
command,
- the value of the "<name>" field of the distro release file.
* If *pretty* is true:
- the value of the "PRETTY_NAME" attribute of the os-release file,
- the value of the "Description" attribute returned by the lsb_release
command,
- the value of the "<name>" field of the distro release file, appended
with the value of the pretty version ("<version_id>" and "<codename>"
fields) of the distro release file, if available.
)r �name)�prettyr r r r � s $r c C s t j| |�S )ay
Return the version of the current Linux distribution, as a human-readable
string.
If *pretty* is false, the version is returned without codename (e.g.
"7.0").
If *pretty* is true, the codename in parenthesis is appended, if the
codename is non-empty (e.g. "7.0 (Maipo)").
Some distributions provide version numbers with different precisions in
the different sources of distribution information. Examining the different
sources in a fixed priority order does not always yield the most precise
version (e.g. for Debian 8.2, or CentOS 7.1).
The *best* parameter can be used to control the approach for the returned
version:
If *best* is false, the first non-empty version number in priority order of
the examined sources is returned.
If *best* is true, the most precise version number out of all examined
sources is returned.
**Lookup hierarchy:**
In all cases, the version number is obtained from the following sources.
If *best* is false, this order represents the priority order:
* the value of the "VERSION_ID" attribute of the os-release file,
* the value of the "Release" attribute returned by the lsb_release
command,
* the version number parsed from the "<version_id>" field of the first line
of the distro release file,
* the version number parsed from the "PRETTY_NAME" attribute of the
os-release file, if it follows the format of the distro release files.
* the version number parsed from the "Description" attribute returned by
the lsb_release command, if it follows the format of the distro release
files.
)r �version)r
�bestr r r r � s )r c C s
t j| �S )a�
Return the version of the current Linux distribution as a tuple
``(major, minor, build_number)`` with items as follows:
* ``major``: The result of :func:`distro.major_version`.
* ``minor``: The result of :func:`distro.minor_version`.
* ``build_number``: The result of :func:`distro.build_number`.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r �
version_parts)r r r r r
s r
c C s
t j| �S )a8
Return the major version of the current Linux distribution, as a string,
if provided.
Otherwise, the empty string is returned. The major version is the first
part of the dot-separated version string.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r �
major_version)r r r r r , s
r c C s
t j| �S )a9
Return the minor version of the current Linux distribution, as a string,
if provided.
Otherwise, the empty string is returned. The minor version is the second
part of the dot-separated version string.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r �
minor_version)r r r r r 9 s
r c C s
t j| �S )a6
Return the build number of the current Linux distribution, as a string,
if provided.
Otherwise, the empty string is returned. The build number is the third part
of the dot-separated version string.
For a description of the *best* parameter, see the :func:`distro.version`
method.
)r � build_number)r r r r r F s
r c C s t j� S )a
Return a space-separated list of distro IDs of distributions that are
closely related to the current Linux distribution in regards to packaging
and programming interfaces, for example distributions the current
distribution is a derivative from.
**Lookup hierarchy:**
This information item is only provided by the os-release file.
For details, see the description of the "ID_LIKE" attribute in the
`os-release man page
<http://www.freedesktop.org/software/systemd/man/os-release.html>`_.
)r �liker r r r r S s r c C s t j� S )a�
Return the codename for the release of the current Linux distribution,
as a string.
If the distribution does not have a codename, an empty string is returned.
Note that the returned codename is not always really a codename. For
example, openSUSE returns "x86_64". This function does not handle such
cases in any special way and just returns the string it finds, if any.
**Lookup hierarchy:**
* the codename within the "VERSION" attribute of the os-release file, if
provided,
* the value of the "Codename" attribute returned by the lsb_release
command,
* the value of the "<codename>" field of the distro release file.
)r �codenamer r r r r d s r c C s t j| |�S )a�
Return certain machine-readable information items about the current Linux
distribution in a dictionary, as shown in the following example:
.. sourcecode:: python
{
'id': 'rhel',
'version': '7.0',
'version_parts': {
'major': '7',
'minor': '0',
'build_number': ''
},
'like': 'fedora',
'codename': 'Maipo'
}
The dictionary structure and keys are always the same, regardless of which
information items are available in the underlying data sources. The values
for the various keys are as follows:
* ``id``: The result of :func:`distro.id`.
* ``version``: The result of :func:`distro.version`.
* ``version_parts -> major``: The result of :func:`distro.major_version`.
* ``version_parts -> minor``: The result of :func:`distro.minor_version`.
* ``version_parts -> build_number``: The result of
:func:`distro.build_number`.
* ``like``: The result of :func:`distro.like`.
* ``codename``: The result of :func:`distro.codename`.
For a description of the *pretty* and *best* parameters, see the
:func:`distro.version` method.
)r �info)r
r r r r r | s )r c C s t j� S )z�
Return a dictionary containing key-value pairs for the information items
from the os-release file data source of the current Linux distribution.
See `os-release file`_ for details about these information items.
)r �os_release_infor r r r r � s r c C s t j� S )z�
Return a dictionary containing key-value pairs for the information items
from the lsb_release command data source of the current Linux distribution.
See `lsb_release command output`_ for details about these information
items.
)r �lsb_release_infor r r r r � s r c C s t j� S )z�
Return a dictionary containing key-value pairs for the information items
from the distro release file data source of the current Linux distribution.
See `distro release file`_ for details about these information items.
)r �distro_release_infor r r r r � s r c C s
t j| �S )a�
Return a single named information item from the os-release file data source
of the current Linux distribution.
Parameters:
* ``attribute`` (string): Key of the information item.
Returns:
* (string): Value of the information item, if the item exists.
The empty string, if the item does not exist.
See `os-release file`_ for details about these information items.
)r �os_release_attr)� attributer r r r � s r c C s
t j| �S )a�
Return a single named information item from the lsb_release command output
data source of the current Linux distribution.
Parameters:
* ``attribute`` (string): Key of the information item.
Returns:
* (string): Value of the information item, if the item exists.
The empty string, if the item does not exist.
See `lsb_release command output`_ for details about these information
items.
)r �lsb_release_attr)r r r r r � s r c C s
t j| �S )a�
Return a single named information item from the distro release file
data source of the current Linux distribution.
Parameters:
* ``attribute`` (string): Key of the information item.
Returns:
* (string): Value of the information item, if the item exists.
The empty string, if the item does not exist.
See `distro release file`_ for details about these information items.
)r �distro_release_attr)r r r r r � s r c @ s� e Zd ZdZd:dd�Zdd� Zd;dd �Zd
d � Zd<d
d�Zd=dd�Z d>dd�Z
d?dd�Z d@dd�Z dAdd�Z
dd� Zdd � ZdBd d �Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zed-d.� �Zd/d0� Zed1d2� �Zd3d4� Z d5d6� Z ed7d8� �Z d9S )C�LinuxDistributiona
Provides information about a Linux distribution.
This package creates a private module-global instance of this class with
default initialization arguments, that is used by the
`consolidated accessor functions`_ and `single source accessor functions`_.
By using default initialization arguments, that module-global instance
returns data about the current Linux distribution (i.e. the distro this
package runs on).
Normally, it is not necessary to create additional instances of this class.
However, in situations where control is needed over the exact data sources
that are used, instances of this class can be created with a specific
distro release file, or a specific os-release file, or without invoking the
lsb_release command.
T� c C sH |pt jjtt�| _|pd| _| j� | _|r4| j � ni | _
| j � | _ dS )a8
The initialization method of this class gathers information from the
available data sources, and stores that in private instance attributes.
Subsequent access to the information items uses these private instance
attributes, so that the data sources are read only once.
Parameters:
* ``include_lsb`` (bool): Controls whether the
`lsb_release command output`_ is included as a data source.
If the lsb_release command is not available in the program execution
path, the data source for the lsb_release command will be empty.
* ``os_release_file`` (string): The path name of the
`os-release file`_ that is to be used as a data source.
An empty string (the default) will cause the default path name to
be used (see `os-release file`_ for details).
If the specified or defaulted os-release file does not exist, the
data source for the os-release file will be empty.
* ``distro_release_file`` (string): The path name of the
`distro release file`_ that is to be used as a data source.
An empty string (the default) will cause a default search algorithm
to be used (see `distro release file`_ for details).
If the specified distro release file does not exist, or if no default
distro release file can be found, the data source for the distro
release file will be empty.
Public instance attributes:
* ``os_release_file`` (string): The path name of the
`os-release file`_ that is actually used as a data source. The
empty string if no distro release file is used as a data source.
* ``distro_release_file`` (string): The path name of the
`distro release file`_ that is actually used as a data source. The
empty string if no distro release file is used as a data source.
Raises:
* :py:exc:`IOError`: Some I/O issue with an os-release file or distro
release file.
* :py:exc:`subprocess.CalledProcessError`: The lsb_release command had
some issue (other than not being available in the program execution
path).
* :py:exc:`UnicodeError`: A data source has unexpected characters or
uses an unexpected encoding.
r N)
�os�path�join� _UNIXCONFDIR�_OS_RELEASE_BASENAME�os_release_file�distro_release_file�_get_os_release_info�_os_release_info�_get_lsb_release_info�_lsb_release_info�_get_distro_release_info�_distro_release_info)�selfZ include_lsbr" r# r r r �__init__ s ;
zLinuxDistribution.__init__c C s dj | j| j| j| j| j�S )z Return repr of all info
z�LinuxDistribution(os_release_file={0!r}, distro_release_file={1!r}, _os_release_info={2!r}, _lsb_release_info={3!r}, _distro_release_info={4!r}))�formatr" r# r% r' r) )r* r r r �__repr__V s zLinuxDistribution.__repr__c C s" |r | j � n| j� | j� | j� fS )z�
Return information about the Linux distribution that is compatible
with Python's :func:`platform.linux_distribution`, supporting a subset
of its parameters.
For details, see :func:`distro.linux_distribution`.
)r r r r )r* r r r r r f s z$LinuxDistribution.linux_distributionc C sT dd� }| j d�}|r ||t�S | jd�}|r8||t�S | jd�}|rP||t�S dS )zrReturn the distro ID of the Linux distribution, as a string.
For details, see :func:`distro.id`.
c S s | j � jdd�} |j| | �S )N� �_)�lower�replace�get)� distro_id�tabler r r � normalizey s z'LinuxDistribution.id.<locals>.normalizer �distributor_idr )r �NORMALIZED_OS_IDr �NORMALIZED_LSB_IDr �NORMALIZED_DISTRO_ID)r* r5 r3 r r r r t s
zLinuxDistribution.idFc C sh | j d�p | jd�p | jd�}|r`| j d�p4| jd�}|s`| jd�}| jdd�}|r`|d | }|pfdS ) zx
Return the name of the Linux distribution, as a string.
For details, see :func:`distro.name`.
r r6 � pretty_name� descriptionT)r
r. r )r r r r )r* r
r r r r r r � s
zLinuxDistribution.namec C s� | j d�| jd�| jd�| j| j d��jdd�| j| jd��jdd�g}d}|r�xJ|D ]$}|jd�|jd�ksv|dkrV|}qVW n x|D ]}|dkr�|}P q�W |r�|r�| j� r�dj|| j� �}|S )z~
Return the version of the Linux distribution, as a string.
For details, see :func:`distro.version`.
�
version_id�releaser: r r; �.z {0} ({1}))r r r � _parse_distro_release_contentr2 �countr r, )r* r
r Zversionsr �vr r r r � s&
zLinuxDistribution.versionc C sL | j |d�}|rHtjd�}|j|�}|rH|j� \}}}||p>d|pDdfS dS )z�
Return the version of the Linux distribution, as a tuple of version
numbers.
For details, see :func:`distro.version_parts`.
)r z(\d+)\.?(\d+)?\.?(\d+)?r )r r r )r �re�compile�match�groups)r* r Z version_strZ
version_regex�matches�major�minorr r r r r
� s
z LinuxDistribution.version_partsc C s | j |�d S )z�
Return the major version number of the current distribution.
For details, see :func:`distro.major_version`.
r )r
)r* r r r r r � s z LinuxDistribution.major_versionc C s | j |�d S )z�
Return the minor version number of the Linux distribution.
For details, see :func:`distro.minor_version`.
� )r
)r* r r r r r � s z LinuxDistribution.minor_versionc C s | j |�d S )z{
Return the build number of the Linux distribution.
For details, see :func:`distro.build_number`.
� )r
)r* r r r r r � s z LinuxDistribution.build_numberc C s | j d�p dS )z�
Return the IDs of distributions that are like the Linux distribution.
For details, see :func:`distro.like`.
Zid_liker )r )r* r r r r � s zLinuxDistribution.likec C s" | j d�p | jd�p | jd�p dS )zs
Return the codename of the Linux distribution.
For details, see :func:`distro.codename`.
r r )r r r )r* r r r r � s
zLinuxDistribution.codenamec C sB t | j� | j||�t | j|�| j|�| j|�d�| j� | j� d�S )z�
Return certain machine-readable information about the Linux
distribution.
For details, see :func:`distro.info`.
)rG rH r )r r r
r r )�dictr r r r r r r )r* r
r r r r r � s
zLinuxDistribution.infoc C s | j S )z�
Return a dictionary containing key-value pairs for the information
items from the os-release file data source of the Linux distribution.
For details, see :func:`distro.os_release_info`.
)r% )r* r r r r
s z!LinuxDistribution.os_release_infoc C s | j S )z�
Return a dictionary containing key-value pairs for the information
items from the lsb_release command data source of the Linux
distribution.
For details, see :func:`distro.lsb_release_info`.
)r' )r* r r r r s z"LinuxDistribution.lsb_release_infoc C s | j S )z�
Return a dictionary containing key-value pairs for the information
items from the distro release file data source of the Linux
distribution.
For details, see :func:`distro.distro_release_info`.
)r) )r* r r r r s z%LinuxDistribution.distro_release_infoc C s | j j|d�S )z�
Return a single named information item from the os-release file data
source of the Linux distribution.
For details, see :func:`distro.os_release_attr`.
r )r% r2 )r* r r r r r * s z!LinuxDistribution.os_release_attrc C s | j j|d�S )z�
Return a single named information item from the lsb_release command
output data source of the Linux distribution.
For details, see :func:`distro.lsb_release_attr`.
r )r' r2 )r* r r r r r 3 s z"LinuxDistribution.lsb_release_attrc C s | j j|d�S )z�
Return a single named information item from the distro release file
data source of the Linux distribution.
For details, see :func:`distro.distro_release_attr`.
r )r) r2 )r* r r r r r < s z%LinuxDistribution.distro_release_attrc C s. t jj| j�r*t| j�� }| j|�S Q R X i S )z�
Get the information items from the specified os-release file.
Returns:
A dictionary containing all information items.
N)r r �isfiler" �open�_parse_os_release_content)r* Z release_filer r r r$ E s z&LinuxDistribution._get_os_release_infoc C s� i }t j | dd�}d|_tjd dkr@t|jt�r@|jjd�|_t|�}x�|D ]�}d|krN|j dd�\}}t|t�r~|jd�}|||j
� < |d kr�t j d
|�}|r�|j
� }|jd �}|jd �}|j� }||d
< q�d|d
< qNqNW |S )aD
Parse the lines of an os-release file.
Parameters:
* lines: Iterable through the lines in the os-release file.
Each line must be a unicode string or a UTF-8 encoded byte
string.
Returns:
A dictionary containing all information items.
T)�posixr rJ z
iso-8859-1�=rI zutf-8�VERSIONz(\(\D+\))|,(\s+)?\D+z()�,r r )�shlexZwhitespace_split�sys� version_info�
isinstanceZ wordchars�bytes�decode�list�splitr0 rB �search�group�strip)�lines�propsZlexer�tokens�token�krA r r r r rN Q s.
z+LinuxDistribution._parse_os_release_contentc C s� d}t j|dt jt jd�}|j� \}}|jd�|jd� }}|j}|dkr\|j� }| j|�S |dkrhi S tj dd� d
kr�t j
||||��n@tj dd� dkr�t j
|||��n tj dd� dkr�t j
||��dS )z�
Get the information items from the lsb_release command output.
Returns:
A dictionary containing all information items.
zlsb_release -aT)�shell�stdout�stderrzutf-8r � NrJ � � � � )rg rh )rJ ri )rJ rj ) �
subprocess�Popen�PIPEZ communicaterX �
returncode�
splitlines�_parse_lsb_release_contentrT rU ZCalledProcessError)r* �cmdZprocessrd re �codeZcontentr r r r& � s(
z'LinuxDistribution._get_lsb_release_infoc C st i }xj| D ]b}t |t�r"|jd�n|}|jd�jdd�}t|�dkrFq
|\}}|j|jdd�j� |j� i� q
W |S )aM
Parse the output of the lsb_release command.
Parameters:
* lines: Iterable through the lines of the lsb_release output.
Each line must be a unicode string or a UTF-8 encoded byte
string.
Returns:
A dictionary containing all information items.
zutf-8�
�:rI rJ r. r/ ) rV rW rX r] rZ �len�updater1 r0 )r^ r_ �lineZkvrb rA r r r rp � s
"z,LinuxDistribution._parse_lsb_release_contentc C s� | j r@| j| j �}tjj| j �}tj|�}|r<|jd�|d< |S tjt �}|j
� x\|D ]T}|t krfqXtj|�}|rXtjj t |�}| j|�}d|krX|| _ |jd�|d< |S qXW i S dS )z�
Get the information items from the specified distro release file.
Returns:
A dictionary containing all information items.
rI r r N)
r# �_parse_distro_release_filer r �basename� _DISTRO_RELEASE_BASENAME_PATTERNrD r\ �listdirr �sort� _DISTRO_RELEASE_IGNORE_BASENAMESr )r* � distro_infory rD Z basenames�filepathr r r r( � s,
z*LinuxDistribution._get_distro_release_infoc C s. t jj|�r*t|��}| j|j� �S Q R X i S )z�
Parse a distro release file.
Parameters:
* filepath: Path name of the distro release file.
Returns:
A dictionary containing all information items.
N)r r rL rM r? �readline)r* r �fpr r r rx � s
z,LinuxDistribution._parse_distro_release_filec C s� t | t�r| jd�} tj| j� ddd � �}i }|r�|jd�ddd
� |d< |jd�rn|jd�ddd � |d< |jd�r�|jd�ddd � |d< n| r�| j� |d< |S )
a
Parse a line from a distro release file.
Parameters:
* line: Line from the distro release file. Must be a unicode string
or a UTF-8 encoded byte string.
Returns:
A dictionary containing all information items.
zutf-8NrI rg r rJ r< r ���r� r� r� )rV rW rX �(_DISTRO_RELEASE_CONTENT_REVERSED_PATTERNrD r] r\ )rw rF r~ r r r r? � s
z/LinuxDistribution._parse_distro_release_contentN)Tr r )T)F)FF)F)F)F)F)FF) �__name__�
__module__� __qualname__�__doc__r+ r- r r r r r
r r r r r r r r r r r r r$ � staticmethodrN r& rp r( rx r? r r r r r s:
@
!
< )r c C s� dd l } tjt�}|jtj� |jtjtj �� | j
dd�}|j ddddd� |j � }|j
rv|jt
jt� d d
d �� nB|jd td
d
�� td
d
�}|r�|jd|� t� }|r�|jd|� d S )Nr zLinux distro info tool)r; z--jsonz-jz!Output in machine readable format�
store_true)�help�action� T)�indentZ sort_keyszName: %s)r
z Version: %sz Codename: %s)�argparse�loggingZ getLoggerr� ZsetLevel�DEBUGZ
addHandlerZ
StreamHandlerrT rd �ArgumentParser� add_argument�
parse_args�jsonr �dumpsr r r )r� Zlogger�parser�argsZdistribution_versionZdistribution_codenamer r r �main s(
r� �__main__)T)F)FF)F)F)F)F)FF)+r� r rB rT r� rS r� rk �platform�
startswith� ImportErrorr, r r! r7 r8 r9 rC r� rz r} r r r r r
r r r r r r r r r r r r �objectr r r� r� r r r r �<module> sd
L
'
,
,
pip/_vendor/__pycache__/ipaddress.cpython-36.pyc 0000644 00000201427 14751155150 0015616 0 ustar 00 3
���e09 � @ sl d Z ddlmZ ddlZddlZdZefZy eefZW n e k
rJ Y nX ye
Z W n$ e k
rx e Z e
e kstt�Y nX dOdkr�dd� Zndd� Zy
ejZW n ek
r� d d
� ZY nX d d � Zeed
�r�dd� Zndd� ZdPdd�ZG dd� de�ZdZdZG dd� de�Z G dd� de�Z d d � Z dQd d �Z d!d"� Z d#d$� Z!d%d&� Z"d'd(� Z#d)d*� Z$d+d,� Z%d-d.� Z&d/d0� Z'd1d2� Z(d3d4� Z)G d5d6� d6e�Z*G d7d8� d8e*�Z+G d9d:� d:e*�Z,G d;d<� d<e�Z-G d=d>� d>e-e+�Z.G d?d@� d@e.�Z/G dAdB� dBe-e,�Z0G dCdD� dDe�Z1e1e._2G dEdF� dFe�Z3G dGdH� dHe3e+�Z4G dIdJ� dJe4�Z5G dKdL� dLe3e,�Z6G dMdN� dNe�Z7e7e4_2dS )Rz�A fast, lightweight IPv4/IPv6 manipulation library in Python.
This library is used to create/poke/manipulate IPv4 and IPv6 addresses
and networks.
� )�unicode_literalsNz1.0.17� c C s | S )N� )�bytr r � /usr/lib/python3.6/ipaddress.py�_compat_bytes_to_byte_vals s r c C s dd� | D �S )Nc S s g | ]}t jd |�d �qS )s !Br )�struct�unpack)�.0�br r r �
<listcomp># s z._compat_bytes_to_byte_vals.<locals>.<listcomp>r )r r r r r " s c C s< |dks t �d}x&| D ] }t|t�s(t �|d> | }qW |S )N�bigr � )�AssertionError�
isinstance�_compat_int_types)Zbytvals� endianess�resZbvr r r �_compat_int_from_byte_vals' s
r c C s� t | t�st�|dkst�|dkrH| dk s2| dkr<tjd��tjd| �S |dkr�| dk sd| dd krntjd
��tjd | d ? | d
@ �S t� �d S )Nr
� r � � z(integer out of range for 'I' format codes !I� � z)integer out of range for 'QQ' format codes !QQ�@ l ���� l )r r r r �error�pack�NotImplementedError)ZintvalZlengthr r r r �_compat_to_bytes0 s
r �
bit_lengthc C s | j � S )N)r )�ir r r �_compat_bit_length? s r! c C s& x t j� D ]}| |? dkr
|S q
W d S )Nr )� itertools�count)r r r r r r! B s � c c s0 |dks t �| }x||k r*|V ||7 }qW d S )Nr )r )�start�end�stepr r r r �
_compat_rangeH s
r( c @ s@ e Zd Zf Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Z d
S )�_TotalOrderingMixinc C s t �d S )N)r )�self�otherr r r �__eq__W s z_TotalOrderingMixin.__eq__c C s | j |�}|tkrtS | S )N)r, �NotImplemented)r* r+ �equalr r r �__ne__Z s
z_TotalOrderingMixin.__ne__c C s t �d S )N)r )r* r+ r r r �__lt__` s z_TotalOrderingMixin.__lt__c C s& | j |�}|tks| r"| j|�S |S )N)r0 r- r, )r* r+ �lessr r r �__le__c s
z_TotalOrderingMixin.__le__c C s6 | j |�}|tkrtS | j|�}|tkr,tS |p2| S )N)r0 r- r, )r* r+ r1 r. r r r �__gt__i s
z_TotalOrderingMixin.__gt__c C s | j |�}|tkrtS | S )N)r0 r- )r* r+ r1 r r r �__ge__r s
z_TotalOrderingMixin.__ge__N)
�__name__�
__module__� __qualname__� __slots__r, r/ r0 r2 r3 r4 r r r r r) P s r) r r c @ s e Zd ZdZdS )�AddressValueErrorz%A Value Error related to the address.N)r5 r6 r7 �__doc__r r r r r9 } s r9 c @ s e Zd ZdZdS )�NetmaskValueErrorz%A Value Error related to the netmask.N)r5 r6 r7 r: r r r r r; � s r; c C sj yt | �S ttfk
r Y nX yt| �S ttfk
rB Y nX t| t�rZtd| ��td| ��dS )a� Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP address. Either IPv4 or
IPv6 addresses may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Address or IPv6Address object.
Raises:
ValueError: if the *address* passed isn't either a v4 or a v6
address
zx%r does not appear to be an IPv4 or IPv6 address. Did you pass in a bytes (str in Python 2) instead of a unicode object?z0%r does not appear to be an IPv4 or IPv6 addressN)� IPv4Addressr9 r; � IPv6Addressr �bytes�
ValueError)�addressr r r �
ip_address� s
rA Tc C sn y
t | |�S ttfk
r" Y nX y
t| |�S ttfk
rF Y nX t| t�r^td| ��td| ��dS )a� Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP network. Either IPv4 or
IPv6 networks may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Network or IPv6Network object.
Raises:
ValueError: if the string passed isn't either a v4 or a v6
address. Or if the network has host bits set.
zx%r does not appear to be an IPv4 or IPv6 network. Did you pass in a bytes (str in Python 2) instead of a unicode object?z0%r does not appear to be an IPv4 or IPv6 networkN)� IPv4Networkr9 r; � IPv6Networkr r> r? )r@ �strictr r r �
ip_network� s
rE c C sT yt | �S ttfk
r Y nX yt| �S ttfk
rB Y nX td| ��dS )ag Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP address. Either IPv4 or
IPv6 addresses may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Interface or IPv6Interface object.
Raises:
ValueError: if the string passed isn't either a v4 or a v6
address.
Notes:
The IPv?Interface classes describe an Address on a particular
Network, so they're basically a combination of both the Address
and Network classes.
z2%r does not appear to be an IPv4 or IPv6 interfaceN)�
IPv4Interfacer9 r; �
IPv6Interfacer? )r@ r r r � ip_interface� s rH c C s4 y t | dd�S tjtfk
r. td��Y nX dS )a` Represent an address as 4 packed bytes in network (big-endian) order.
Args:
address: An integer representation of an IPv4 IP address.
Returns:
The integer address packed as 4 bytes in network (big-endian) order.
Raises:
ValueError: If the integer is negative or too large to be an
IPv4 IP address.
r r
z&Address negative or too large for IPv4N)r r r �
OverflowErrorr? )r@ r r r �v4_int_to_packed� s rJ c C s4 y t | dd�S tjtfk
r. td��Y nX dS )z�Represent an address as 16 packed bytes in network (big-endian) order.
Args:
address: An integer representation of an IPv6 IP address.
Returns:
The integer address packed as 16 bytes in network (big-endian) order.
r r
z&Address negative or too large for IPv6N)r r r rI r? )r@ r r r �v6_int_to_packed s
rK c C s* t | �jd�}t|�dkr&td| ��|S )zAHelper to split the netmask and raise AddressValueError if needed�/r z Only one '/' permitted in %r)� _compat_str�split�lenr9 )r@ �addrr r r �_split_optional_netmask s rQ c c sR t | �}t|� }}x.|D ]&}|j|jd kr<||fV |}|}qW ||fV dS )z�Find a sequence of sorted deduplicated IPv#Address.
Args:
addresses: a list of IPv#Address objects.
Yields:
A tuple containing the first and last IP addresses in the sequence.
r$ N)�iter�next�_ip)� addresses�it�first�last�ipr r r �_find_address_range s
rZ c C s$ | dkr |S t |t| | d @ ��S )z�Count the number of zero bits on the right hand side.
Args:
number: an integer.
bits: maximum number of bits to count.
Returns:
The number of zero bits on the right hand side of the number.
r r$ )�minr! )Znumber�bitsr r r �_count_righthand_zero_bits0 s r] c c s� t | t�ot |t�s td��| j|jkr8td| |f ��| |krHtd��| jdkrXt}n| jdkrht}ntd��| j}| j}|j}x^||kr�t t
||�t || d �d �}|||| f�}|V |d|> 7 }|d |j kr�P q�W dS ) a� Summarize a network range given the first and last IP addresses.
Example:
>>> list(summarize_address_range(IPv4Address('192.0.2.0'),
... IPv4Address('192.0.2.130')))
... #doctest: +NORMALIZE_WHITESPACE
[IPv4Network('192.0.2.0/25'), IPv4Network('192.0.2.128/31'),
IPv4Network('192.0.2.130/32')]
Args:
first: the first IPv4Address or IPv6Address in the range.
last: the last IPv4Address or IPv6Address in the range.
Returns:
An iterator of the summarized IPv(4|6) network objects.
Raise:
TypeError:
If the first and last objects are not IP addresses.
If the first and last objects are not the same version.
ValueError:
If the last object is not greater than the first.
If the version of the first address is not 4 or 6.
z1first and last must be IP addresses, not networksz%%s and %s are not of the same versionz*last IP address must be greater than firstr � zunknown IP versionr$ N)
r � _BaseAddress� TypeError�versionr? rB rC �_max_prefixlenrT r[ r] r! � _ALL_ONES)rW rX rY Zip_bitsZ first_intZlast_intZnbits�netr r r �summarize_address_range@ s0
re c c s� t | �}i }xL|rX|j� }|j� }|j|�}|dkr>|||< q||kr||= |j|� qW d}x4t|j� �D ]$}|dk r�|j|jkr�ql|V |}qlW dS )au Loops through the addresses, collapsing concurrent netblocks.
Example:
ip1 = IPv4Network('192.0.2.0/26')
ip2 = IPv4Network('192.0.2.64/26')
ip3 = IPv4Network('192.0.2.128/26')
ip4 = IPv4Network('192.0.2.192/26')
_collapse_addresses_internal([ip1, ip2, ip3, ip4]) ->
[IPv4Network('192.0.2.0/24')]
This shouldn't be called directly; it is called via
collapse_addresses([]).
Args:
addresses: A list of IPv4Network's or IPv6Network's
Returns:
A list of IPv4Network's or IPv6Network's depending on what we were
passed.
N)�list�pop�supernet�get�append�sorted�values�broadcast_address)rU Zto_merge�subnetsrd rh ZexistingrX r r r � _collapse_addresses_internalw s$
ro c C s8 g }g }g }x�| D ]�}t |t�rT|rH|d j|jkrHtd||d f ��|j|� q|j|jkr�|r�|d j|jkr�td||d f ��y|j|j� W q� tk
r� |j|j � Y q�X q|r�|d j|jkr�td||d f ��|j|� qW t
t |��}|�r,x&t |�D ]\}}|j
t||�� �qW t|| �S ) a� Collapse a list of IP objects.
Example:
collapse_addresses([IPv4Network('192.0.2.0/25'),
IPv4Network('192.0.2.128/25')]) ->
[IPv4Network('192.0.2.0/24')]
Args:
addresses: An iterator of IPv4Network or IPv6Network objects.
Returns:
An iterator of the collapsed IPv(4|6)Network objects.
Raises:
TypeError: If passed a list of mixed version objects.
r$ z%%s and %s are not of the same version���rp rp rp rp rp )r r_ �_versionr` rj �
_prefixlenrb rY �AttributeError�network_addressrk �setrZ �extendre ro )rU ZaddrsZipsZnetsrY rW rX r r r �collapse_addresses� s4
rw c C s( t | t�r| j� S t | t�r$| j� S tS )a2 Return a key suitable for sorting between networks and addresses.
Address and Network objects are not sortable by default; they're
fundamentally different so the expression
IPv4Address('192.0.2.0') <= IPv4Network('192.0.2.0/24')
doesn't make any sense. There are some times however, where you may wish
to have ipaddress sort these for you anyway. If you need to do this, you
can use this function as the key= argument to sorted().
Args:
obj: either a Network or Address object.
Returns:
appropriate key.
)r � _BaseNetwork�_get_networks_keyr_ �_get_address_keyr- )�objr r r �get_mixed_type_key� s
r| c @ s� e Zd ZdZf Zedd� �Zedd� �Zedd� �Zedd � �Z d
d � Z
d d
� Z e dd� �Z
e dd� �Ze dd� �Ze dd� �Ze dd� �Zdd� ZdS )�_IPAddressBasezThe mother class.c C s | j � S )z:Return the longhand version of the IP address as a string.)� _explode_shorthand_ip_string)r* r r r �exploded� s z_IPAddressBase.explodedc C s t | �S )z;Return the shorthand version of the IP address as a string.)rM )r* r r r �
compressed s z_IPAddressBase.compressedc C s | j � S )aI The name of the reverse DNS pointer for the IP address, e.g.:
>>> ipaddress.ip_address("127.0.0.1").reverse_pointer
'1.0.0.127.in-addr.arpa'
>>> ipaddress.ip_address("2001:db8::1").reverse_pointer
'1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.8.b.d.0.1.0.0.2.ip6.arpa'
)�_reverse_pointer)r* r r r �reverse_pointer s z _IPAddressBase.reverse_pointerc C s dt | �f }t|��d S )Nz %200s has no version specified)�typer )r* �msgr r r ra s z_IPAddressBase.versionc C sF |dk r d}t ||| jf ��|| jkrBd}t ||| j| jf ��d S )Nr z-%d (< 0) is not permitted as an IPv%d addressz2%d (>= 2**%d) is not permitted as an IPv%d address)r9 rq rc rb )r* r@ r� r r r �_check_int_address s
z!_IPAddressBase._check_int_addressc C s. t |�}||kr*d}t||||| jf ��d S )Nz~%r (len %d != %d) is not permitted as an IPv%d address. Did you pass in a bytes (str in Python 2) instead of a unicode object?)rO r9 rq )r* r@ Z expected_lenZ address_lenr� r r r �_check_packed_address s
z$_IPAddressBase._check_packed_addressc C s | j | j |? A S )z�Turn the prefix length into a bitwise netmask
Args:
prefixlen: An integer, the prefix length.
Returns:
An integer.
)rc )�cls� prefixlenr r r �_ip_int_from_prefix+ s z"_IPAddressBase._ip_int_from_prefixc C s\ t || j�}| j| }||? }d|> d }||krX| jd }t||d�}d}t|| ��|S )a Return prefix length from the bitwise netmask.
Args:
ip_int: An integer, the netmask in expanded bitwise format
Returns:
An integer, the prefix length.
Raises:
ValueError: If the input intermingles zeroes & ones
r$ r r
z&Netmask pattern %r mixes zeroes & ones)r] rb r r? ) r� �ip_intZtrailing_zeroesr� Z leading_onesZall_onesZbyteslenZdetailsr� r r r �_prefix_from_ip_int8 s
z"_IPAddressBase._prefix_from_ip_intc C s d| }t |��d S )Nz%r is not a valid netmask)r; )r� Z netmask_strr� r r r �_report_invalid_netmaskQ s z&_IPAddressBase._report_invalid_netmaskc C sj t jj|�s| j|� y t|�}W n tk
r@ | j|� Y nX d| koV| jkn sf| j|� |S )a Return prefix length from a numeric string
Args:
prefixlen_str: The string to be converted
Returns:
An integer, the prefix length.
Raises:
NetmaskValueError: If the input is not a valid netmask
r )�_BaseV4�_DECIMAL_DIGITS�
issupersetr� �intr? rb )r� Z
prefixlen_strr� r r r �_prefix_from_prefix_stringV s
z)_IPAddressBase._prefix_from_prefix_stringc C s� y| j |�}W n tk
r, | j|� Y nX y
| j|�S tk
rL Y nX || jN }y
| j|�S tk
r� | j|� Y nX dS )a Turn a netmask/hostmask string into a prefix length
Args:
ip_str: The netmask/hostmask to be converted
Returns:
An integer, the prefix length.
Raises:
NetmaskValueError: If the input is not a valid netmask/hostmask
N)�_ip_int_from_stringr9 r� r� r? rc )r� �ip_strr� r r r �_prefix_from_ip_stringo s
z%_IPAddressBase._prefix_from_ip_stringc C s | j t| �ffS )N)� __class__rM )r* r r r �
__reduce__� s z_IPAddressBase.__reduce__N)r5 r6 r7 r: r8 �propertyr r� r� ra r� r� � classmethodr� r� r� r� r� r� r r r r r} � s
"r} c @ sd e Zd ZdZf Zdd� Zdd� Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� ZdS )r_ z�A generic IP object.
This IP class contains the version independent methods which are
used by single IP addresses.
c C s | j S )N)rT )r* r r r �__int__� s z_BaseAddress.__int__c C s2 y| j |j ko| j|jkS tk
r, tS X d S )N)rT rq rs r- )r* r+ r r r r, � s
z_BaseAddress.__eq__c C s` t |t�stS t |t�s(td| |f ��| j|jkrDtd| |f ��| j|jkr\| j|jk S dS )Nz"%s and %s are not of the same typez%%s and %s are not of the same versionF)r r} r- r_ r` rq rT )r* r+ r r r r0 � s
z_BaseAddress.__lt__c C s t |t�stS | jt| �| �S )N)r r r- r� r� )r* r+ r r r �__add__� s
z_BaseAddress.__add__c C s t |t�stS | jt| �| �S )N)r r r- r� r� )r* r+ r r r �__sub__� s
z_BaseAddress.__sub__c C s d| j jt| �f S )Nz%s(%r))r� r5 rM )r* r r r �__repr__� s z_BaseAddress.__repr__c C s t | j| j��S )N)rM �_string_from_ip_intrT )r* r r r �__str__� s z_BaseAddress.__str__c C s t tt| j���S )N)�hash�hexr� rT )r* r r r �__hash__� s z_BaseAddress.__hash__c C s
| j | fS )N)rq )r* r r r rz � s z _BaseAddress._get_address_keyc C s | j | jffS )N)r� rT )r* r r r r� � s z_BaseAddress.__reduce__N)r5 r6 r7 r: r8 r� r, r0 r� r� r� r� r� rz r� r r r r r_ � s r_ c @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zedd� �Zedd� �Zed d � �Zed d � �Zed d!� �Zed"d#� �Zed$d%� �Zed&d'� �Zd(d)� Zd*d+� Zd,d-� ZdFd0d1�ZdGd2d3�Z ed4d5� �Z d6d7� Z d8d9� Z ed:d;� �Z ed<d=� �Z!ed>d?� �Z"ed@dA� �Z#edBdC� �Z$edDdE� �Z%d/S )Hrx z~A generic IP network object.
This IP class contains the version independent methods which are
used by networks.
c C s
i | _ d S )N)�_cache)r* r@ r r r �__init__� s z_BaseNetwork.__init__c C s d| j jt| �f S )Nz%s(%r))r� r5 rM )r* r r r r� � s z_BaseNetwork.__repr__c C s d| j | jf S )Nz%s/%d)rt r� )r* r r r r� � s z_BaseNetwork.__str__c c s< t | j�}t | j�}x"t|d |�D ]}| j|�V q$W dS )z�Generate Iterator over usable hosts in a network.
This is like __iter__ except it doesn't return the network
or broadcast addresses.
r$ N)r� rt rm r( �_address_class)r* �network� broadcast�xr r r �hosts� s
z_BaseNetwork.hostsc c s< t | j�}t | j�}x"t||d �D ]}| j|�V q$W d S )Nr$ )r� rt rm r( r� )r* r� r� r� r r r �__iter__� s
z_BaseNetwork.__iter__c C sl t | j�}t | j�}|dkr>|| |kr0td��| j|| �S |d7 }|| |k rZtd��| j|| �S d S )Nr zaddress out of ranger$ )r� rt rm �
IndexErrorr� )r* �nr� r� r r r � __getitem__� s
z_BaseNetwork.__getitem__c C sx t |t�stS t |t�s(td| |f ��| j|jkrDtd| |f ��| j|jkr\| j|jk S | j|jkrt| j|jk S dS )Nz"%s and %s are not of the same typez%%s and %s are not of the same versionF)r r} r- rx r` rq rt �netmask)r* r+ r r r r0 s
z_BaseNetwork.__lt__c C sF y,| j |j ko,| j|jko,t| j�t|j�kS tk
r@ tS X d S )N)rq rt r� r� rs r- )r* r+ r r r r, s z_BaseNetwork.__eq__c C s t t| j�t| j�A �S )N)r� r� rt r� )r* r r r r� s z_BaseNetwork.__hash__c C sL | j |j krdS t|t�r dS t| j�t|j� koBt| j�kS S d S )NF)rq r rx r� rt rT rm )r* r+ r r r � __contains__ s
z_BaseNetwork.__contains__c C s( | j |kp&| j|kp&|j | kp&|j| kS )z*Tell if self is partly contained in other.)rt rm )r* r+ r r r �overlaps) s
z_BaseNetwork.overlapsc C s< | j jd�}|d kr8| jt| j�t| j�B �}|| j d< |S )Nrm )r� ri r� r� rt �hostmask)r* r� r r r rm 0 s
z _BaseNetwork.broadcast_addressc C s8 | j jd�}|d kr4| jt| j�| jA �}|| j d< |S )Nr� )r� ri r� r� r� rc )r* r� r r r r� 9 s
z_BaseNetwork.hostmaskc C s d| j | jf S )Nz%s/%d)rt rr )r* r r r �with_prefixlenA s z_BaseNetwork.with_prefixlenc C s d| j | jf S )Nz%s/%s)rt r� )r* r r r � with_netmaskE s z_BaseNetwork.with_netmaskc C s d| j | jf S )Nz%s/%s)rt r� )r* r r r �
with_hostmaskI s z_BaseNetwork.with_hostmaskc C s t | j�t | j� d S )z&Number of hosts in the current subnet.r$ )r� rm rt )r* r r r �
num_addressesM s z_BaseNetwork.num_addressesc C s dt | �f }t|��d S )Nz%%200s has no associated address class)r� r )r* r� r r r r� R s z_BaseNetwork._address_classc C s | j S )N)rr )r* r r r r� Z s z_BaseNetwork.prefixlenc c s | j |j ks td| |f ��t|t�s2td| ��|j| �sLtd|| f ��|| krXdS |jd|j|jf �}| j � \}}xb||kr�||kr�|j|�r�|V |j � \}}q||j|�r�|V |j � \}}q|t
d|||f ��q|W ||kr�|V n$||k�r |V nt
d|||f ��dS )a� Remove an address from a larger block.
For example:
addr1 = ip_network('192.0.2.0/28')
addr2 = ip_network('192.0.2.1/32')
list(addr1.address_exclude(addr2)) =
[IPv4Network('192.0.2.0/32'), IPv4Network('192.0.2.2/31'),
IPv4Network('192.0.2.4/30'), IPv4Network('192.0.2.8/29')]
or IPv6:
addr1 = ip_network('2001:db8::1/32')
addr2 = ip_network('2001:db8::1/128')
list(addr1.address_exclude(addr2)) =
[ip_network('2001:db8::1/128'),
ip_network('2001:db8::2/127'),
ip_network('2001:db8::4/126'),
ip_network('2001:db8::8/125'),
...
ip_network('2001:db8:8000::/33')]
Args:
other: An IPv4Network or IPv6Network object of the same type.
Returns:
An iterator of the IPv(4|6)Network objects which is self
minus other.
Raises:
TypeError: If self and other are of differing address
versions, or if other is not a network object.
ValueError: If other is not completely contained by self.
z%%s and %s are not of the same versionz%s is not a network objectz%s not contained in %sNz%s/%sz3Error performing exclusion: s1: %s s2: %s other: %s) rq r` r rx � subnet_ofr? r� rt r� rn r )r* r+ �s1�s2r r r �address_exclude^ s6 $
z _BaseNetwork.address_excludec C s` | j |j kr td| |f ��| j|jk r,dS | j|jkr<dS | j|jk rLdS | j|jkr\dS dS )a� Compare two IP objects.
This is only concerned about the comparison of the integer
representation of the network addresses. This means that the
host bits aren't considered at all in this method. If you want
to compare host bits, you can easily enough do a
'HostA._ip < HostB._ip'
Args:
other: An IP object.
Returns:
If the IP versions of self and other are the same, returns:
-1 if self < other:
eg: IPv4Network('192.0.2.0/25') < IPv4Network('192.0.2.128/25')
IPv6Network('2001:db8::1000/124') <
IPv6Network('2001:db8::2000/124')
0 if self == other
eg: IPv4Network('192.0.2.0/24') == IPv4Network('192.0.2.0/24')
IPv6Network('2001:db8::1000/124') ==
IPv6Network('2001:db8::1000/124')
1 if self > other
eg: IPv4Network('192.0.2.128/25') > IPv4Network('192.0.2.0/25')
IPv6Network('2001:db8::2000/124') >
IPv6Network('2001:db8::1000/124')
Raises:
TypeError if the IP versions are different.
z"%s and %s are not of the same typer$ r rp rp )rq r` rt r� )r* r+ r r r �compare_networks� s ! z _BaseNetwork.compare_networksc C s | j | j| jfS )z�Network-only key function.
Returns an object that identifies this address' network and
netmask. This function is a suitable "key" argument for sorted()
and list.sort().
)rq rt r� )r* r r r ry � s z _BaseNetwork._get_networks_keyr$ Nc c s� | j | jkr| V dS |dk rJ|| j k r0td��|dkr@td��|| j }|dk rZtd��| j | }|| jkr~td|| f ��t| j�}t| j�d }t| j�d |? }x(t|||�D ]}| j||f�}|V q�W dS )a� The subnets which join to make the current subnet.
In the case that self contains only one IP
(self._prefixlen == 32 for IPv4 or self._prefixlen == 128
for IPv6), yield an iterator with just ourself.
Args:
prefixlen_diff: An integer, the amount the prefix length
should be increased by. This should not be set if
new_prefix is also set.
new_prefix: The desired new prefix length. This must be a
larger number (smaller prefix) than the existing prefix.
This should not be set if prefixlen_diff is also set.
Returns:
An iterator of IPv(4|6) objects.
Raises:
ValueError: The prefixlen_diff is too small or too large.
OR
prefixlen_diff and new_prefix are both set or new_prefix
is a smaller number than the current prefix (smaller
number means a larger network)
Nznew prefix must be longerr$ z(cannot set prefixlen_diff and new_prefixr z prefix length diff must be > 0z0prefix length diff %d is invalid for netblock %s) rr rb r? r� rt rm r� r( r� ) r* �prefixlen_diff�
new_prefix�
new_prefixlenr% r& r' Znew_addrZcurrentr r r rn � s,
z_BaseNetwork.subnetsc C s� | j dkr| S |dk rB|| j kr(td��|dkr8td��| j | }| j| }|dk rftd| j|f ��| jt| j�t| j�|> @ |f�S )a� The supernet containing the current network.
Args:
prefixlen_diff: An integer, the amount the prefix length of
the network should be decreased by. For example, given a
/24 network and a prefixlen_diff of 3, a supernet with a
/21 netmask is returned.
Returns:
An IPv4 network object.
Raises:
ValueError: If self.prefixlen - prefixlen_diff < 0. I.e., you have
a negative prefix length.
OR
If prefixlen_diff and new_prefix are both set or new_prefix is a
larger number than the current prefix (larger number means a
smaller network)
r Nznew prefix must be shorterr$ z(cannot set prefixlen_diff and new_prefixz;current prefixlen is %d, cannot have a prefixlen_diff of %d)rr r? r� r� r� rt r� )r* r� r� r� r r r rh s
z_BaseNetwork.supernetc C s | j jo| jjS )z�Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is a multicast address.
See RFC 2373 2.7 for details.
)rt � is_multicastrm )r* r r r r� A s z_BaseNetwork.is_multicastc C sP | j |j krdS t|d�r<t|d�r<|j| jko:|j| jkS tdt|� ��d S )NFrt rm z9Unable to test subnet containment with element of type %s)rq �hasattrrt rm r` r� )r* r+ r r r r� M s
z_BaseNetwork.subnet_ofc C sP | j |j krdS t|d�r<t|d�r<|j| jko:|j| jkS tdt|� ��d S )NFrt rm z9Unable to test subnet containment with element of type %s)rq r� rt rm r` r� )r* r+ r r r � supernet_of[ s
z_BaseNetwork.supernet_ofc C s | j jo| jjS )z�Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within one of the
reserved IPv6 Network ranges.
)rt � is_reservedrm )r* r r r r� i s z_BaseNetwork.is_reservedc C s | j jo| jjS )z�Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is reserved per RFC 4291.
)rt �
is_link_localrm )r* r r r r� u s z_BaseNetwork.is_link_localc C s | j jo| jjS )z�Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv4-special-registry or iana-ipv6-special-registry.
)rt �
is_privaterm )r* r r r r� � s z_BaseNetwork.is_privatec C s | j S )z�Test if this address is allocated for public networks.
Returns:
A boolean, True if the address is not reserved per
iana-ipv4-special-registry or iana-ipv6-special-registry.
)r� )r* r r r � is_global� s z_BaseNetwork.is_globalc C s | j jo| jjS )z�Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 2373 2.5.2.
)rt �is_unspecifiedrm )r* r r r r� � s z_BaseNetwork.is_unspecifiedc C s | j jo| jjS )z�Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback address as defined in
RFC 2373 2.5.3.
)rt � is_loopbackrm )r* r r r r� � s z_BaseNetwork.is_loopback)r$ N)r$ N)&r5 r6 r7 r: r� r� r� r� r� r� r0 r, r� r� r� r� rm r� r� r� r� r� r� r� r� r� ry rn rh r� r� r� r� r� r� r� r� r� r r r r rx � sD
K0
5
) rx c
@ s� e Zd ZdZf ZdZde d Zed�Z edddd d
d d d
dg �Z
eZ i Z dd� Z
edd� �Zedd� �Zedd� �Zedd� �Zdd� Zdd � Zed d � �Zed d � �Zd!S )"r� zyBase IPv4 object.
The following methods are used by IPv4 objects in both single IP
addresses and networks.
r r r$ �
0123456789� � � � �� �� � r r c C s t | �S )N)rM )r* r r r r~ � s z$_BaseV4._explode_shorthand_ip_stringc C sn || j krdt|t�r|}n.y| j|�}W n tk
rF | j|�}Y nX t| j|��}||f| j |< | j | S )a Make a (netmask, prefix_len) tuple from the given argument.
Argument can be:
- an integer (the prefix length)
- a string representing the prefix length (e.g. "24")
- a string representing the prefix netmask (e.g. "255.255.255.0")
)�_netmask_cacher r r� r; r� r< r� )r� �argr� r� r r r �
_make_netmask� s
z_BaseV4._make_netmaskc C sx |s t d��|jd�}t|�dkr.t d| ��ytt| j|�d�S tk
rr } zt d||f ��W Y dd}~X nX dS )a Turn the given IP string into an integer for comparison.
Args:
ip_str: A string, the IP ip_str.
Returns:
The IP ip_str as an integer.
Raises:
AddressValueError: if ip_str isn't a valid IPv4 Address.
zAddress cannot be empty�.r zExpected 4 octets in %rr
z%s in %rN)r9 rN rO r �map� _parse_octetr? )r� r� Zoctets�excr r r r� � s
z_BaseV4._ip_int_from_stringc C s� |s t d��| jj|�s(d}t || ��t|�dkrDd}t || ��t|d�}|dkrr|d dkrrd }t || ��|d
kr�t d | ��|S ) a Convert a decimal octet into an integer.
Args:
octet_str: A string, the number to parse.
Returns:
The octet as an integer.
Raises:
ValueError: if the octet isn't strictly a decimal from [0..255].
zEmpty octet not permittedz#Only decimal digits permitted in %r� z$At most 3 characters permitted in %r�
� r �0z3Ambiguous (octal/decimal) value in %r not permittedr� z Octet %d (> 255) not permitted)r? r� r� rO r� )r� Z octet_strr� Z octet_intr r r r� � s
z_BaseV4._parse_octetc C s dj dd� t|dd�D ��S )z�Turns a 32-bit integer into dotted decimal notation.
Args:
ip_int: An integer, the IP address.
Returns:
The IP address as a string in dotted decimal notation.
r� c s s0 | ](}t t|t�r"tjd |�d n|�V qdS )s !Br N)rM r r> r r )r
r r r r � <genexpr>- s z._BaseV4._string_from_ip_int.<locals>.<genexpr>r r
)�joinr )r� r� r r r r� " s
z_BaseV4._string_from_ip_intc sh |j d�}y � fdd�tt|�D �}W n tk
r: dS X t|�t|�krPdS |d |d k rddS dS ) z�Test if the IP string is a hostmask (rather than a netmask).
Args:
ip_str: A string, the potential hostmask.
Returns:
A boolean, True if the IP string is a hostmask.
r� c s g | ]}|� j kr|�qS r )�_valid_mask_octets)r
r� )r* r r r > s z(_BaseV4._is_hostmask.<locals>.<listcomp>Fr r$ Trp )rN r� r� r? rO )r* r� r\ �partsr )r* r � _is_hostmask2 s
z_BaseV4._is_hostmaskc C s& t | �jd�ddd� }dj|�d S )z�Return the reverse DNS pointer name for the IPv4 address.
This implements the method described in RFC1035 3.5.
r� Nr$ z
.in-addr.arparp )rM rN r� )r* Zreverse_octetsr r r r� G s z_BaseV4._reverse_pointerc C s | j S )N)rb )r* r r r �
max_prefixlenP s z_BaseV4.max_prefixlenc C s | j S )N)rq )r* r r r ra T s z_BaseV4.versionN)r5 r6 r7 r: r8 rq �
IPV4LENGTHrc � frozensetr� r� rb r� r~ r� r� r� r� r� r� r� r� r� ra r r r r r� � s" % r� c @ s| e Zd ZdZdZdd� Zedd� �Zedd � �Zed
d � �Z ed d
� �Z
edd� �Z edd� �Z edd� �Z
edd� �ZdS )r< z/Represent and manipulate single IPv4 Addresses.rT � __weakref__c C sx t |t�r | j|� || _dS t |t�rL| j|d� t|�}t|d�| _dS t|�}d|krht d| ��| j
|�| _dS )a�
Args:
address: A string or integer representing the IP
Additionally, an integer can be passed, so
IPv4Address('192.0.2.1') == IPv4Address(3221225985).
or, more generally
IPv4Address(int(IPv4Address('192.0.2.1'))) ==
IPv4Address('192.0.2.1')
Raises:
AddressValueError: If ipaddress isn't a valid IPv4 address.
Nr r
rL zUnexpected '/' in %r) r r r� rT r> r� r r rM r9 r� )r* r@ �bvs�addr_strr r r r� _ s
zIPv4Address.__init__c C s
t | j�S )z*The binary representation of this address.)rJ rT )r* r r r �packed� s zIPv4Address.packedc C s | | j jkS )z�Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within the
reserved IPv4 Network range.
)�
_constants�_reserved_network)r* r r r r� � s zIPv4Address.is_reservedc s t � fdd�� jjD ��S )z�Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv4-special-registry.
c 3 s | ]}� |kV qd S )Nr )r
rd )r* r r r� � s z)IPv4Address.is_private.<locals>.<genexpr>)�anyr� �_private_networks)r* r )r* r r� � s zIPv4Address.is_privatec C s | | j jko| j S )N)r� �_public_networkr� )r* r r r r� � s zIPv4Address.is_globalc C s | | j jkS )z�Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is multicast.
See RFC 3171 for details.
)r� �_multicast_network)r* r r r r� � s zIPv4Address.is_multicastc C s | | j jkS )z�Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 5735 3.
)r� �_unspecified_address)r* r r r r� � s zIPv4Address.is_unspecifiedc C s | | j jkS )z�Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback per RFC 3330.
)r� �_loopback_network)r* r r r r� � s zIPv4Address.is_loopbackc C s | | j jkS )z�Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is link-local per RFC 3927.
)r� �_linklocal_network)r* r r r r� � s zIPv4Address.is_link_localN)rT r� )r5 r6 r7 r: r8 r� r� r� r� r� r� r� r� r� r� r r r r r< Y s $
r< c @ sj e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zej Z e
d d � �Z e
d
d� �Z e
dd� �Z
e
dd� �ZdS )rF c C s� t |ttf�r2tj| |� t| j�| _| j| _ d S t |t
�r�tj| |d � t |�dkrht |d �| _ n| j| _ t|dd�| _| jj
| _
| jj| _d S t|�}tj| |d � t|dd�| _| jj | _ | jj
| _
| jj| _d S )Nr r$ F)rD )r r> r r< r� rB rT r� rb rr �tuplerO r� r� r� rQ )r* r@ rP r r r r� � s(
zIPv4Interface.__init__c C s d| j | j�| jjf S )Nz%s/%d)r� rT r� r� )r* r r r r� � s zIPv4Interface.__str__c C sD t j| |�}| s|tkr |S y | j|jkS tk
r> dS X d S )NF)r< r, r- r� rs )r* r+ �
address_equalr r r r, � s zIPv4Interface.__eq__c C s> t j| |�}|tkrtS y | j|jk S tk
r8 dS X d S )NF)r< r0 r- r� rs )r* r+ � address_lessr r r r0 � s zIPv4Interface.__lt__c C s | j | jA t| jj�A S )N)rT rr r� r� rt )r* r r r r� s zIPv4Interface.__hash__c C s
t | j�S )N)r< rT )r* r r r rY
s zIPv4Interface.ipc C s d| j | j�| jf S )Nz%s/%s)r� rT rr )r* r r r r� s z IPv4Interface.with_prefixlenc C s d| j | j�| jf S )Nz%s/%s)r� rT r� )r* r r r r� s zIPv4Interface.with_netmaskc C s d| j | j�| jf S )Nz%s/%s)r� rT r� )r* r r r r� s zIPv4Interface.with_hostmaskN)r5 r6 r7 r� r� r, r0 r� r} r� r� rY r� r� r� r r r r rF � s rF c @ s* e Zd ZdZeZddd�Zedd� �ZdS ) rB ae This class represents and manipulates 32-bit IPv4 network + addresses..
Attributes: [examples for IPv4Network('192.0.2.0/27')]
.network_address: IPv4Address('192.0.2.0')
.hostmask: IPv4Address('0.0.0.31')
.broadcast_address: IPv4Address('192.0.2.32')
.netmask: IPv4Address('255.255.255.224')
.prefixlen: 27
Tc C s| t j| |� t|ttf�r<t|�| _| j| j�\| _ | _
dS t|t �r�t |�dkr\|d }n| j}t|d �| _| j|�\| _ | _
t
| j�}|t
| j �@ |kr�|r�td| ��nt|t
| j �@ �| _dS t|�}t| j|d ��| _t |�dkr�|d }n| j}| j|�\| _ | _
|�rDtt
| j�t
| j �@ �| jk�rDtd| ��tt
| j�t
| j �@ �| _| j
| jd k�rx| j| _dS )a Instantiate a new IPv4 network object.
Args:
address: A string or integer representing the IP [& network].
'192.0.2.0/24'
'192.0.2.0/255.255.255.0'
'192.0.0.2/0.0.0.255'
are all functionally the same in IPv4. Similarly,
'192.0.2.1'
'192.0.2.1/255.255.255.255'
'192.0.2.1/32'
are also functionally equivalent. That is to say, failing to
provide a subnetmask will create an object with a mask of /32.
If the mask (portion after the / in the argument) is given in
dotted quad form, it is treated as a netmask if it starts with a
non-zero field (e.g. /255.0.0.0 == /8) and as a hostmask if it
starts with a zero field (e.g. 0.255.255.255 == /8), with the
single exception of an all-zero mask which is treated as a
netmask == /0. If no mask is given, a default of /32 is used.
Additionally, an integer can be passed, so
IPv4Network('192.0.2.1') == IPv4Network(3221225985)
or, more generally
IPv4Interface(int(IPv4Interface('192.0.2.1'))) ==
IPv4Interface('192.0.2.1')
Raises:
AddressValueError: If ipaddress isn't a valid IPv4 address.
NetmaskValueError: If the netmask isn't valid for
an IPv4 address.
ValueError: If strict is True and a network address is not
supplied.
Nr$ r z%s has host bits setr )rx r� r r r> r< rt r� rb r� rr r� rO r� r? rQ r� r� r� )r* r@ rD r� r� rP r r r r� 0 sB %
zIPv4Network.__init__c C s& | j td�ko| jtd�k o$| j S )z�Test if this address is allocated for public networks.
Returns:
A boolean, True if the address is not reserved per
iana-ipv4-special-registry.
z
100.64.0.0/10)rt rB rm r� )r* r r r r� � s zIPv4Network.is_globalN)T) r5 r6 r7 r: r< r� r� r� r� r r r r rB ! s
UrB c @ s� e Zd Zed�Zed�Zed�Zed�Zed�ed�ed�ed�ed�ed�ed �ed
�ed �ed �ed
�ed�ed�ed�gZed�Z e
d�Z dS )�_IPv4Constantsz169.254.0.0/16z 127.0.0.0/8z 224.0.0.0/4z
100.64.0.0/10z 0.0.0.0/8z
10.0.0.0/8z
172.16.0.0/12z 192.0.0.0/29z192.0.0.170/31z 192.0.2.0/24z192.168.0.0/16z
198.18.0.0/15z198.51.100.0/24z203.0.113.0/24z 240.0.0.0/4z255.255.255.255/32z0.0.0.0N) r5 r6 r7 rB r� r� r� r� r� r� r< r� r r r r r� � s(
r� c @ s� e Zd ZdZf ZdZde d ZdZe d�Z
eZ i Z e
dd� �Ze
d d
� �Ze
d d � �Ze
d
d� �Ze
ddd��Zdd� Zdd� Zedd� �Zedd� �ZdS )�_BaseV6zyBase IPv6 object.
The following methods are used by IPv6 objects in both single IP
addresses and networks.
r^ r r$ r Z0123456789ABCDEFabcdefc C sJ || j kr@t|t�r|}n
| j|�}t| j|��}||f| j |< | j | S )a Make a (netmask, prefix_len) tuple from the given argument.
Argument can be:
- an integer (the prefix length)
- a string representing the prefix length (e.g. "24")
- a string representing the prefix netmask (e.g. "255.255.255.0")
)r� r r r� r= r� )r� r� r� r� r r r r� � s
z_BaseV6._make_netmaskc C s� |s t d��|jd�}d}t|�|k r:d||f }t |��d|d kr�yt|j� �j}W n2 t k
r� } zt d||f ��W Y dd}~X nX |jd |d
? d @ � |jd |d @ � | jd }t|�|kr�d |d |f }t |��d}x@tdt|�d �D ]*} || s�|dk �r d
| }t |��| }q�W |dk �r�|}
t|�| d } |d �sn|
d8 }
|
�rnd}t || ��|d �s�| d8 } | �r�d}t || ��| j|
| } | dk �r4d}t || jd |f ��njt|�| jk�r�d}t || j|f ��|d �s
d}t || ��|d �s$d}t || ��t|�}
d} d} ytd}
x,t |
�D ] } |
d
K }
|
| j
|| �O }
�qDW |
d
| K }
x0t | d�D ] } |
d
K }
|
| j
|| �O }
�q�W |
S t k
�r� } zt d||f ��W Y dd}~X nX dS )z�Turn an IPv6 ip_str into an integer.
Args:
ip_str: A string, the IPv6 ip_str.
Returns:
An int, the IPv6 address
Raises:
AddressValueError: if ip_str isn't a valid IPv6 Address.
zAddress cannot be empty�:r� z At least %d parts expected in %rr� r$ z%s in %rNz%xr i�� z!At most %d colons permitted in %rz At most one '::' permitted in %rr z0Leading ':' only permitted as part of '::' in %rz1Trailing ':' only permitted as part of '::' in %rz/Expected at most %d other parts with '::' in %rz,Exactly %d parts expected without '::' in %rrp rp rp ) r9 rN rO r< rg rT rj �
_HEXTET_COUNTr( �range�
_parse_hextetr? )r� r� r� Z
_min_partsr� Zipv4_intr� Z
_max_partsZ
skip_indexr Zparts_hiZparts_loZ
parts_skippedr� r r r r� � s�
"
z_BaseV6._ip_int_from_stringc C s> | j j|�std| ��t|�dkr4d}t|| ��t|d�S )a& Convert an IPv6 hextet string into an integer.
Args:
hextet_str: A string, the number to parse.
Returns:
The hextet as an integer.
Raises:
ValueError: if the input isn't strictly a hex number from
[0..FFFF].
z Only hex digits permitted in %rr z$At most 4 characters permitted in %rr )� _HEX_DIGITSr� r? rO r� )r� Z
hextet_strr� r r r r� E s z_BaseV6._parse_hextetc C s� d}d}d}d}xJt |�D ]>\}}|dkrP|d7 }|dkr>|}||krX|}|}qd}d}qW |dkr�|| }|t|�kr�|dg7 }dg|||�< |dkr�dg| }|S ) a� Compresses a list of hextets.
Compresses a list of strings, replacing the longest continuous
sequence of "0" in the list with "" and adding empty strings at
the beginning or at the end of the string such that subsequently
calling ":".join(hextets) will produce the compressed version of
the IPv6 address.
Args:
hextets: A list of strings, the hextets to compress.
Returns:
A list of strings.
r$ r r� � rp rp rp rp )� enumeraterO ) r� �hextetsZbest_doublecolon_startZbest_doublecolon_lenZdoublecolon_startZdoublecolon_len�indexZhextetZbest_doublecolon_endr r r �_compress_hextets_ s.
z_BaseV6._compress_hextetsNc sZ |dkrt | j�}|| jkr$td��d| � � fdd�tddd�D �}| j|�}d j|�S )
a, Turns a 128-bit integer into hexadecimal notation.
Args:
ip_int: An integer, the IP address.
Returns:
A string, the hexadecimal representation of the address.
Raises:
ValueError: The address is bigger than 128 bits of all ones.
NzIPv6 address is too largez%032xc s& g | ] }d t � ||d � d� �qS )z%xr r )r� )r
r� )�hex_strr r r � s z/_BaseV6._string_from_ip_int.<locals>.<listcomp>r r r r� )r� rT rc r? r� r� r� )r� r� r� r )r� r r� � s
z_BaseV6._string_from_ip_intc s� t | t�rt| j�}n t | t�r,t| j�}nt| �}| j|�}d| � � fdd�tddd�D �}t | ttf�r�ddj |�| j
f S dj |�S ) z�Expand a shortened IPv6 address.
Args:
ip_str: A string, the IPv6 address.
Returns:
A string, the expanded IPv6 address.
z%032xc s g | ]}� ||d � �qS )r r )r
r� )r� r r r � s z8_BaseV6._explode_shorthand_ip_string.<locals>.<listcomp>r r r z%s/%dr� ) r rC rM rt rG rY r� r� rx r� rr )r* r� r� r� r )r� r r~ � s
z$_BaseV6._explode_shorthand_ip_stringc C s& | j ddd� jdd�}dj|�d S )z�Return the reverse DNS pointer name for the IPv6 address.
This implements the method described in RFC3596 2.5.
Nr$ r� r� r� z .ip6.arparp )r �replacer� )r* Z
reverse_charsr r r r� � s z_BaseV6._reverse_pointerc C s | j S )N)rb )r* r r r r� � s z_BaseV6.max_prefixlenc C s | j S )N)rq )r* r r r ra � s z_BaseV6.version)N)r5 r6 r7 r: r8 rq �
IPV6LENGTHrc r� r� r� rb r� r� r� r� r� r� r� r~ r� r� r� ra r r r r r� � s$ i 0 r� c @ s� e Zd ZdZd Zdd� Zedd� �Zedd � �Zed
d � �Z ed d
� �Z
edd� �Z edd� �Z edd� �Z
edd� �Zedd� �Zedd� �Zedd� �Zed d � �Zd S ) r= z/Represent and manipulate single IPv6 Addresses.rT r� c C sx t |t�r | j|� || _dS t |t�rL| j|d� t|�}t|d�| _dS t|�}d|krht d| ��| j
|�| _dS )a Instantiate a new IPv6 address object.
Args:
address: A string or integer representing the IP
Additionally, an integer can be passed, so
IPv6Address('2001:db8::') ==
IPv6Address(42540766411282592856903984951653826560)
or, more generally
IPv6Address(int(IPv6Address('2001:db8::'))) ==
IPv6Address('2001:db8::')
Raises:
AddressValueError: If address isn't a valid IPv6 address.
Nr r
rL zUnexpected '/' in %r) r r r� rT r> r� r r rM r9 r� )r* r@ r� r� r r r r� � s
zIPv6Address.__init__c C s
t | j�S )z*The binary representation of this address.)rK rT )r* r r r r� � s zIPv6Address.packedc C s | | j jkS )z�Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is a multicast address.
See RFC 2373 2.7 for details.
)r� r� )r* r r r r� s zIPv6Address.is_multicastc s t � fdd�� jjD ��S )z�Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within one of the
reserved IPv6 Network ranges.
c 3 s | ]}� |kV qd S )Nr )r
r� )r* r r r� s z*IPv6Address.is_reserved.<locals>.<genexpr>)r� r� �_reserved_networks)r* r )r* r r� s zIPv6Address.is_reservedc C s | | j jkS )z�Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is reserved per RFC 4291.
)r� r� )r* r r r r� s zIPv6Address.is_link_localc C s | | j jkS )a` Test if the address is reserved for site-local.
Note that the site-local address space has been deprecated by RFC 3879.
Use is_private to test if this address is in the space of unique local
addresses as defined by RFC 4193.
Returns:
A boolean, True if the address is reserved per RFC 3513 2.5.6.
)r� �_sitelocal_network)r* r r r �
is_site_local# s zIPv6Address.is_site_localc s t � fdd�� jjD ��S )z�Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv6-special-registry.
c 3 s | ]}� |kV qd S )Nr )r
rd )r* r r r� : s z)IPv6Address.is_private.<locals>.<genexpr>)r� r� r� )r* r )r* r r� 1 s zIPv6Address.is_privatec C s | j S )z�Test if this address is allocated for public networks.
Returns:
A boolean, true if the address is not reserved per
iana-ipv6-special-registry.
)r� )r* r r r r� < s zIPv6Address.is_globalc C s
| j dkS )z�Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 2373 2.5.2.
r )rT )r* r r r r� G s zIPv6Address.is_unspecifiedc C s
| j dkS )z�Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback address as defined in
RFC 2373 2.5.3.
r$ )rT )r* r r r r� R s zIPv6Address.is_loopbackc C s | j d? dkrdS t| j d@ �S )z�Return the IPv4 mapped address.
Returns:
If the IPv6 address is a v4 mapped address, return the
IPv4 mapped address. Return None otherwise.
r i�� Nl �� )rT r< )r* r r r � ipv4_mapped] s zIPv6Address.ipv4_mappedc C s4 | j d? dkrdS t| j d? d@ �t| j d@ �fS )z�Tuple of embedded teredo IPs.
Returns:
Tuple of the (server, client) IPs or None if the address
doesn't appear to be a teredo address (doesn't start with
2001::/32)
�` i Nr l �� )rT r< )r* r r r �teredoj s
zIPv6Address.teredoc C s$ | j d? dkrdS t| j d? d@ �S )z�Return the IPv4 6to4 embedded address.
Returns:
The IPv4 6to4-embedded address if present or None if the
address doesn't appear to contain a 6to4 embedded address.
�p i N�P l �� )rT r< )r* r r r � sixtofoury s zIPv6Address.sixtofourN)rT r� )r5 r6 r7 r: r8 r� r� r� r� r� r� r r� r� r� r� r r r r r r r r= � s %
r= c @ s� e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zej Z e
d d � �Z e
d
d� �Z e
dd� �Z
e
dd� �Ze
dd� �Ze
dd� �ZdS )rG c C s� t |ttf�r2tj| |� t| j�| _| j| _ d S t |t
�r�tj| |d � t |�dkrht |d �| _ n| j| _ t|dd�| _| jj
| _
| jj| _d S t|�}tj| |d � t|dd�| _| jj
| _
| jj | _ | jj| _d S )Nr r$ F)rD )r r> r r= r� rC rT r� rb rr r� rO r� r� r� rQ )r* r@ rP r r r r� � s(
zIPv6Interface.__init__c C s d| j | j�| jjf S )Nz%s/%d)r� rT r� r� )r* r r r r� � s zIPv6Interface.__str__c C sD t j| |�}| s|tkr |S y | j|jkS tk
r> dS X d S )NF)r= r, r- r� rs )r* r+ r� r r r r, � s zIPv6Interface.__eq__c C s> t j| |�}|tkrtS y | j|jk S tk
r8 dS X d S )NF)r= r0 r- r� rs )r* r+ r� r r r r0 � s zIPv6Interface.__lt__c C s | j | jA t| jj�A S )N)rT rr r� r� rt )r* r r r r� � s zIPv6Interface.__hash__c C s
t | j�S )N)r= rT )r* r r r rY � s zIPv6Interface.ipc C s d| j | j�| jf S )Nz%s/%s)r� rT rr )r* r r r r� � s z IPv6Interface.with_prefixlenc C s d| j | j�| jf S )Nz%s/%s)r� rT r� )r* r r r r� � s zIPv6Interface.with_netmaskc C s d| j | j�| jf S )Nz%s/%s)r� rT r� )r* r r r r� � s zIPv6Interface.with_hostmaskc C s | j dko| jjS )Nr )rT r� r� )r* r r r r� � s z IPv6Interface.is_unspecifiedc C s | j dko| jjS )Nr$ )rT r� r� )r* r r r r� � s zIPv6Interface.is_loopbackN)r5 r6 r7 r� r� r, r0 r� r} r� r� rY r� r� r� r� r� r r r r rG � s rG c @ s2 e Zd ZdZeZd
dd�Zdd� Zedd� �Z d S ) rC av This class represents and manipulates 128-bit IPv6 networks.
Attributes: [examples for IPv6('2001:db8::1000/124')]
.network_address: IPv6Address('2001:db8::1000')
.hostmask: IPv6Address('::f')
.broadcast_address: IPv6Address('2001:db8::100f')
.netmask: IPv6Address('ffff:ffff:ffff:ffff:ffff:ffff:ffff:fff0')
.prefixlen: 124
Tc C s| t j| |� t|ttf�r<t|�| _| j| j�\| _ | _
dS t|t �r�t |�dkr\|d }n| j}| j|�\| _ | _
t|d �| _t
| j�}|t
| j �@ |kr�|r�td| ��nt|t
| j �@ �| _dS t|�}t| j|d ��| _t |�dkr�|d }n| j}| j|�\| _ | _
|�rDtt
| j�t
| j �@ �| jk�rDtd| ��tt
| j�t
| j �@ �| _| j
| jd k�rx| j| _dS )a� Instantiate a new IPv6 Network object.
Args:
address: A string or integer representing the IPv6 network or the
IP and prefix/netmask.
'2001:db8::/128'
'2001:db8:0000:0000:0000:0000:0000:0000/128'
'2001:db8::'
are all functionally the same in IPv6. That is to say,
failing to provide a subnetmask will create an object with
a mask of /128.
Additionally, an integer can be passed, so
IPv6Network('2001:db8::') ==
IPv6Network(42540766411282592856903984951653826560)
or, more generally
IPv6Network(int(IPv6Network('2001:db8::'))) ==
IPv6Network('2001:db8::')
strict: A boolean. If true, ensure that we have been passed
A true network address, eg, 2001:db8::1000/124 and not an
IP address on a network, eg, 2001:db8::1/124.
Raises:
AddressValueError: If address isn't a valid IPv6 address.
NetmaskValueError: If the netmask isn't valid for
an IPv6 address.
ValueError: If strict was True and a network address was not
supplied.
Nr$ r z%s has host bits setr )rx r� r r> r r= rt r� rb r� rr r� rO r� r? rQ r� r� r� )r* r@ rD r� r� rP r r r r� � sB
zIPv6Network.__init__c c s@ t | j�}t | j�}x&t|d |d �D ]}| j|�V q(W dS )z�Generate Iterator over usable hosts in a network.
This is like __iter__ except it doesn't return the
Subnet-Router anycast address.
r$ N)r� rt rm r( r� )r* r� r� r� r r r r� < s
zIPv6Network.hostsc C s | j jo| jjS )a` Test if the address is reserved for site-local.
Note that the site-local address space has been deprecated by RFC 3879.
Use is_private to test if this address is in the space of unique local
addresses as defined by RFC 4193.
Returns:
A boolean, True if the address is reserved per RFC 3513 2.5.6.
)rt r rm )r* r r r r H s zIPv6Network.is_site_localN)T)
r5 r6 r7 r: r= r� r� r� r� r r r r r rC � s
O rC c @ s� e Zd Zed�Zed�Zed�ed�ed�ed�ed�ed�ed �ed
�ed �ed�g
Zed �ed
�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�gZed�Zd S ) �_IPv6Constantsz fe80::/10zff00::/8z::1/128z::/128z
::ffff:0:0/96z100::/64z 2001::/23z 2001:2::/48z
2001:db8::/32z 2001:10::/28zfc00::/7z::/8z100::/8z200::/7z400::/6z800::/5z1000::/4z4000::/3z6000::/3z8000::/3zA000::/3zC000::/3zE000::/4zF000::/5zF800::/6zFE00::/9z fec0::/10N) r5 r6 r7 rC r� r� r� r r r r r r r X s*
r r )r$ )T)8r: Z
__future__r r" r � __version__r� r Zlong� NameErrorZunicoderM �strr> r r �
from_bytesr rs r r� r! r( �objectr) r� r� r? r9 r; rA rE rH rJ rK rQ rZ r] re ro rw r| r} r_ rx r� r< rF rB r� r� r� r= rG rC r r r r r �<module> s�
)$
$#716 = a *vRr 5V{! pip/_vendor/__pycache__/appdirs.cpython-36.pyc 0000644 00000044153 14751155150 0015303 0 ustar 00 3
���e`W � @ s� d Z d1Zdjeee��ZddlZddlZejd dkZ e r>eZ
ej j d�r�ddl Z e j
� d d Zej d�rrd Zq�ej d
�r�d Zq�d Znej Zd2dd�Zd3dd�Zd4dd�Zd5dd�Zd6dd�Zd7dd�ZG dd � d e�Zd d � Zd d � Zd!d"� Zd#d$� Zed k�r�yddl Z eZ W nn e k
�r� ydd%l m!Z! eZ W nB e k
�r| yddl"Z#eZ W n e k
�rv eZ Y nX Y nX Y nX e$d&k�r~d'Z%d(Z&d8Z'e(d)� ee%e&d*d+�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q�W e(d-� ee%e&�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q�W e(d.� ee%�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q$W e(d/� ee%d
d0�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q^W dS )9zyUtilities for determining application-specific dirs.
See <http://github.com/ActiveState/appdirs> for details and usage.
� � � �.N� �javaZWindows�win32ZMac�darwinZlinux2Fc C s� t dkr^|dkr| }|r dp d}tjjt|��}| r�|dk rNtjj||| �}q�tjj|| �}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
aJ Return full path to the user-specific data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
macOS: ~/Library/Application Support/<AppName>
Unix: ~/.local/share/<AppName> # or in $XDG_DATA_HOME, if defined
Win XP (not roaming): C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
Win XP (roaming): C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
Win 7 (not roaming): C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
Win 7 (roaming): C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
That means, by default "~/.local/share/<AppName>".
r N�
CSIDL_APPDATA�CSIDL_LOCAL_APPDATAFr z ~/Library/Application Support/Z
XDG_DATA_HOMEz~/.local/share)�system�os�path�normpath�_get_win_folder�join�
expanduser�getenv)�appname� appauthor�version�roaming�constr
� r � /usr/lib/python3.6/appdirs.py�
user_data_dir- s& r c s
t dkrR|dkr� }tjjtd��}� r�|dk rBtjj||� �}q�tjj|� �}n�t dkrztjjd�}� r�tjj|� �}nttjdtjjdd g��}d
d � |j tj�D �}� r�|r�tjj� |�� � fd d �|D �}|r�tjj|�}n|d
}|S � o�|�rtjj||�}|S )ai Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of data dirs should be
returned. By default, the first item from XDG_DATA_DIRS is
returned, or '/usr/local/share/<AppName>',
if XDG_DATA_DIRS is not set
Typical user data directories are:
macOS: /Library/Application Support/<AppName>
Unix: /usr/local/share/<AppName> or /usr/share/<AppName>
Win XP: C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
Win 7: C:\ProgramData\<AppAuthor>\<AppName> # Hidden, but writeable on Win 7.
For Unix, this is using the $XDG_DATA_DIRS[0] default.
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r N�CSIDL_COMMON_APPDATAFr z /Library/Application SupportZ
XDG_DATA_DIRSz/usr/local/sharez
/usr/sharec S s g | ]}t jj|jt j���qS r )r r
r �rstrip�sep)�.0�xr r r �
<listcomp>� s z!site_data_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )
r r r
r r r r r �pathsep�split)r r r � multipathr
�pathlistr )r r �
site_data_dird s4
r% c C sX t dkrt| |d|�}n&tjdtjjd��}| r>tjj|| �}| rT|rTtjj||�}|S )a� Return full path to the user-specific config dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
macOS: same as user_data_dir
Unix: ~/.config/<AppName> # or in $XDG_CONFIG_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
That means, by deafult "~/.config/<AppName>".
r r NZXDG_CONFIG_HOMEz ~/.config)r r )r r r r r
r r )r r r r r
r r r �user_config_dir� s r& c s� t d kr*t� |�}� r�|r�tjj||�}ndtjdd�}dd� |jtj�D �}� rt|rbtjj� |�� � fdd�|D �}|r�tjj|�}n|d }|S )
a Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of config dirs should be
returned. By default, the first item from XDG_CONFIG_DIRS is
returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
Typical user data directories are:
macOS: same as site_data_dir
Unix: /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
$XDG_CONFIG_DIRS
Win *: same as site_data_dir
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r r ZXDG_CONFIG_DIRSz/etc/xdgc S s g | ]}t jj|jt j���qS r )r r
r r r )r r r r r r � s z#site_config_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )r r )r r% r r
r r r" r! )r r r r# r
r$ r )r r �site_config_dir� s
r' Tc C s� t dkrd|dkr| }tjjtd��}| r�|dk rBtjj||| �}ntjj|| �}|r�tjj|d�}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
a Return full path to the user-specific cache dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Cache" to the base app data dir for Windows. See
discussion below.
Typical user cache directories are:
macOS: ~/Library/Caches/<AppName>
Unix: ~/.cache/<AppName> (XDG default)
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
On Windows the only suggestion in the MSDN docs is that local settings go in
the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
app data dir (the default returned by `user_data_dir` above). Apps typically
put cache data somewhere *under* the given dir here. Some examples:
...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
...\Acme\SuperApp\Cache\1.0
OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
This can be disabled with the `opinion=False` option.
r Nr
FZCacher z~/Library/CachesZXDG_CACHE_HOMEz~/.cache)r r r
r r r r r )r r r �opinionr
r r r �user_cache_dir s( ! r) c C s� t dkr tjjtjjd�| �}nNt dkrLt| ||�}d}|rntjj|d�}n"t| ||�}d}|rntjj|d�}| r�|r�tjj||�}|S )a� Return full path to the user-specific log dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Logs" to the base app data dir for Windows, and "log" to the
base cache dir for Unix. See discussion below.
Typical user cache directories are:
macOS: ~/Library/Logs/<AppName>
Unix: ~/.cache/<AppName>/log # or under $XDG_CACHE_HOME if defined
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
On Windows the only suggestion in the MSDN docs is that local settings
go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
examples of what some windows apps use for a logs dir.)
OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
value for Windows and appends "log" to the user cache dir for Unix.
This can be disabled with the `opinion=False` option.
r z~/Library/Logsr FZLogs�log)r r r
r r r r) )r r r r( r
r r r � user_log_dir: s
r+ c @ sb e Zd ZdZddd�Zedd� �Zedd � �Zed
d � �Zed d
� �Z edd� �Z
edd� �Z dS )�AppDirsz1Convenience wrapper for getting application dirs.NFc C s" || _ || _|| _|| _|| _d S )N)r r r r r# )�selfr r r r r# r r r �__init__o s
zAppDirs.__init__c C s t | j| j| j| jd�S )N)r r )r r r r r )r- r r r r w s
zAppDirs.user_data_dirc C s t | j| j| j| jd�S )N)r r# )r% r r r r# )r- r r r r% | s
zAppDirs.site_data_dirc C s t | j| j| j| jd�S )N)r r )r& r r r r )r- r r r r& � s
zAppDirs.user_config_dirc C s t | j| j| j| jd�S )N)r r# )r' r r r r# )r- r r r r' � s
zAppDirs.site_config_dirc C s t | j| j| jd�S )N)r )r) r r r )r- r r r r) � s
zAppDirs.user_cache_dirc C s t | j| j| jd�S )N)r )r+ r r r )r- r r r r+ � s
zAppDirs.user_log_dir)NNFF) �__name__�
__module__� __qualname__�__doc__r. �propertyr r% r& r' r) r+ r r r r r, m s
r, c C s: ddl }dddd�| }|j|jd�}|j||�\}}|S )z�This is a fallback technique at best. I'm not sure if using the
registry for this guarantees us the correct answer for all CSIDL_*
names.
r NZAppDatazCommon AppDataz
Local AppData)r r r
z@Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders)�_winreg�OpenKey�HKEY_CURRENT_USERZ QueryValueEx)�
csidl_namer4 Zshell_folder_name�key�dir�typer r r � _get_win_folder_from_registry� s r; c C s� ddl m}m} |jdt|| �dd�}y`t|�}d}x |D ]}t|�dkr:d}P q:W |r�ydd l}|j|�}W n t k
r� Y nX W n t
k
r� Y nX |S )Nr )�shellcon�shellF� T) �win32com.shellr< r= �SHGetFolderPath�getattr�unicode�ord�win32api�GetShortPathName� ImportError� UnicodeError)r7 r< r= r9 �
has_high_char�crD r r r � _get_win_folder_with_pywin32� s$
rJ c C s� dd l }dddd�| }|jd�}|jjjd |d d|� d}x |D ]}t|�dkrBd }P qBW |r�|jd�}|jjj|j|d�r�|}|jS )
Nr � �# � )r r r
i Fr> T) �ctypesZcreate_unicode_buffer�windllZshell32ZSHGetFolderPathWrC Zkernel32ZGetShortPathNameW�value)r7 rN Z csidl_const�bufrH rI Zbuf2r r r �_get_win_folder_with_ctypes� s"
rR c C s� dd l }ddlm} ddlm} |jjd }|jd|�}|jj }|j
d t |j | �d |j j
|� |jj|j� �jd�}d}x |D ]} t| �dkr~d }P q~W |r�|jd|�}|jj }
tj|||�r�|jj|j� �jd�}|S )
Nr )�jna)r � rI � Fr> T)�arrayZcom.sunrS Zcom.sun.jna.platformr ZWinDefZMAX_PATHZzerosZShell32ZINSTANCEr@ rA ZShlObjZSHGFP_TYPE_CURRENTZNativeZtoStringZtostringr rC ZKernel32ZkernalrE ) r7 rV rS r Zbuf_sizerQ r= r9 rH rI Zkernelr r r �_get_win_folder_with_jna� s&
rW )rO �__main__ZMyAppZ MyCompanyz%-- app dirs (with optional 'version')z1.0)r z%s: %sz)
-- app dirs (without optional 'version')z+
-- app dirs (without optional 'appauthor')z(
-- app dirs (with disabled 'appauthor'))r )r r r )NNNF)NNNF)NNNF)NNNF)NNNT)NNNT)r r% r& r' r) r+ ),r2 Z__version_info__r �map�str� __version__�sysr � version_infoZPY3rB �platform�
startswithZjava_verZos_namer r r% r& r' r) r+ �objectr, r; rJ rR rW r? Zwin32comr rF rN rO Z com.sun.jnaZcomr/ r r Zprops�print�dirsZproprA r r r r �<module> s~
7
B
(
3
9
3+
pip/_vendor/__pycache__/pyparsing.cpython-36.pyc 0000644 00000610513 14751155150 0015654 0 ustar 00 3
���e�k � @ s� d Z dZdZdZddlZddlmZ ddlZddl Z ddl
Z
ddl Z ddl Z ddl
Z
ddlZddlZddlZddlmZ yddlmZ W n ek
r� ddlmZ Y nX ydd l
mZ W n> ek
r� ydd lmZ W n ek
r� dZY nX Y nX d
d d d
ddddddddddddddd d d d d d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<d=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrgiZee j�dds� Z e d dskZ e �r"e j Z e Z!e"Z#e Z$e%e&e'e(e)ee*e+e,e-e.g Z/nbe j0Z e1Z2dtdu� Z$g Z/ddl3Z3xBdvj4� D ]6Z5ye/j6e7e3e5�� W n e8k
�r| �wJY nX �qJW e9dwdx� e2dy�D ��Z:dzd{� Z;G d|d}� d}e<�Z=ej>ej? Z@d~ZAeAd ZBe@eA ZCe"d��ZDd�jEd�dx� ejFD ��ZGG d�d!� d!eH�ZIG d�d#� d#eI�ZJG d�d%� d%eI�ZKG d�d'� d'eK�ZLG d�d*� d*eH�ZMG d�d�� d�e<�ZNG d�d&� d&e<�ZOe
jPjQeO� d�d=� ZRd�dN� ZSd�dK� ZTd�d�� ZUd�d�� ZVd�d�� ZWd�dU� ZX�d/d�d��ZYG d�d(� d(e<�ZZG d�d0� d0eZ�Z[G d�d� de[�Z\G d�d� de[�Z]G d�d� de[�Z^e^Z_e^eZ_`G d�d� de[�ZaG d�d � d e^�ZbG d�d � d ea�ZcG d�dp� dpe[�ZdG d�d3� d3e[�ZeG d�d+� d+e[�ZfG d�d)� d)e[�ZgG d�d
� d
e[�ZhG d�d2� d2e[�ZiG d�d�� d�e[�ZjG d�d� dej�ZkG d�d� dej�ZlG d�d� dej�ZmG d�d.� d.ej�ZnG d�d-� d-ej�ZoG d�d5� d5ej�ZpG d�d4� d4ej�ZqG d�d$� d$eZ�ZrG d�d
� d
er�ZsG d�d � d er�ZtG d�d� der�ZuG d�d� der�ZvG d�d"� d"eZ�ZwG d�d� dew�ZxG d�d � d ew�ZyG d�d�� d�ew�ZzG d�d � d ez�Z{G d�d6� d6ez�Z|G d�d�� d�e<�Z}e}� Z~G d�d � d ew�ZG d�d,� d,ew�Z�G d�d� dew�Z�G d�d�� d�e��Z�G d�d1� d1ew�Z�G d�d� de��Z�G d�d� de��Z�G d�d� de��Z�G d�d/� d/e��Z�G d�d � d e<�Z�d�df� Z��d0d�dD�Z��d1d�d@�Z�d�d΄ Z�d�dS� Z�d�dR� Z�d�d҄ Z��d2d�dW�Z�d�dE� Z��d3d�dk�Z�d�dl� Z�d�dn� Z�e\� j�dG�Z�el� j�dM�Z�em� j�dL�Z�en� j�de�Z�eo� j�dd�Z�eeeDd�d�dڍj�d�d܄ �Z�efd݃j�d�d܄ �Z�efd߃j�d�d܄ �Z�e�e�B e�B eeeGd�dyd�B efd�e j��B Z�e�e�e�d� e� �Z�e^d�ed�j�d� e�e{e�e�B ��j�d� d� Z�d�dc� Z�d�dQ� Z�d�d`� Z�d�d^� Z�d�dq� Z�e�d�d܄ �Z�e�d�d܄ �Z�d�d� Z�d�dO� Z�d�dP� Z�d�di� Z�e<� e�_��d4d�do�Z�e=� Z�e<� e�_�e<� e�_�e�d��e�d��fd�dm�Z�e�Z�e�efd��d� �j�d��Z�e�efd��d� �j�d��Z�e�efd��d� efd��d� B �j��d �Z�e�e_�d�e�j� �j��d�Z�d�d�de�j� f�ddT�Z��d5�ddj�Z�e��d�Z�e��d�Z�e�eee@eC�d �j��d��\Z�Z�e�e��d j4� �d
��Z�ef�d �d jEe�jà � �d
�j��d�ZĐdd_� Z�e�ef�d��d �j��d�Z�ef�d�j��d�Z�ef�d�jȃ j��d�Z�ef�d�j��d�Z�e�ef�d��d e�B �j��d�Z�e�Z�ef�d�j��d�Z�e�e{eeeGdɐd �eee�d �e^dɃ em� � ��j j��d �Z�e�ee�j� e�B d��d ��j�d>�Z�G �d dr� dr�Z�eҐd!k� r�eb�d"�Z�eb�d#�Z�eee@eC�d$ �Z�e�eՐd%dӐd&�j�e��Z�e�e�eփ�j��d'�Zאd(e�B Z�e�eՐd%dӐd&�j�e��Z�e�e�eك�j��d)�Z�eӐd*�eؐd'� e� eڐd)� Z�e�jܐd+� e�j�jܐd,� e�j�jܐd,� e�j�jܐd-� ddl�Z�e�j�j�e�e�j�� e�j�jܐd.� dS (6 aS
pyparsing module - Classes and methods to define and execute parsing grammars
The pyparsing module is an alternative approach to creating and executing simple grammars,
vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you
don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
provides a library of classes that you use to construct the grammar directly in Python.
Here is a program to parse "Hello, World!" (or any greeting of the form
C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements
(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
L{Literal} expressions)::
from pyparsing import Word, alphas
# define grammar of a greeting
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
The program outputs the following::
Hello, World! -> ['Hello', ',', 'World', '!']
The Python representation of the grammar is quite readable, owing to the self-explanatory
class names, and the use of '+', '|' and '^' operators.
The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
object with named attributes.
The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
- extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.)
- quoted strings
- embedded comments
z2.1.10z07 Oct 2016 01:31 UTCz*Paul McGuire <ptmcg@users.sourceforge.net>� N)�ref)�datetime)�RLock)� OrderedDict�And�CaselessKeyword�CaselessLiteral�
CharsNotIn�Combine�Dict�Each�Empty�
FollowedBy�Forward�
GoToColumn�Group�Keyword�LineEnd� LineStart�Literal�
MatchFirst�NoMatch�NotAny� OneOrMore�OnlyOnce�Optional�Or�ParseBaseException�ParseElementEnhance�ParseException�ParseExpression�ParseFatalException� ParseResults�ParseSyntaxException�
ParserElement� QuotedString�RecursiveGrammarException�Regex�SkipTo� StringEnd� StringStart�Suppress�Token�TokenConverter�White�Word�WordEnd� WordStart�
ZeroOrMore� alphanums�alphas�
alphas8bit� anyCloseTag�
anyOpenTag�
cStyleComment�col�commaSeparatedList�commonHTMLEntity� countedArray�cppStyleComment�dblQuotedString�dblSlashComment�
delimitedList�dictOf�downcaseTokens�empty�hexnums� htmlComment�javaStyleComment�line�lineEnd� lineStart�lineno� makeHTMLTags� makeXMLTags�matchOnlyAtCol�matchPreviousExpr�matchPreviousLiteral�
nestedExpr�nullDebugAction�nums�oneOf�opAssoc�operatorPrecedence�
printables�punc8bit�pythonStyleComment� quotedString� removeQuotes�replaceHTMLEntity� replaceWith�
restOfLine�sglQuotedString�srange� stringEnd� stringStart�traceParseAction�
unicodeString� upcaseTokens�
withAttribute�
indentedBlock�originalTextFor�ungroup�
infixNotation� locatedExpr� withClass�
CloseMatch�tokenMap�pyparsing_common� c C s` t | t�r| S yt| �S tk
rZ t| �jtj� d�}td�}|jdd� � |j |�S X dS )a Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
then < returns the unicode object | encodes it with the default encoding | ... >.
�xmlcharrefreplacez&#\d+;c S s$ dt t| d dd� ��dd � S )Nz\ur � � ���)�hex�int)�t� rw � /usr/lib/python3.6/pyparsing.py�<lambda>� s z_ustr.<locals>.<lambda>N)
�
isinstanceZunicode�str�UnicodeEncodeError�encode�sys�getdefaultencodingr' �setParseAction�transformString)�obj�retZ
xmlcharrefrw rw rx �_ustr� s
r� z6sum len sorted reversed list tuple set any all min maxc c s | ]
}|V qd S )Nrw )�.0�yrw rw rx � <genexpr>� s r� rr c C s> d}dd� dj � D �}x"t||�D ]\}}| j||�} q"W | S )z/Escape &, <, >, ", ', etc. in a string of data.z&><"'c s s | ]}d | d V qdS )�&�;Nrw )r� �srw rw rx r� � s z _xml_escape.<locals>.<genexpr>zamp gt lt quot apos)�split�zip�replace)�dataZ from_symbolsZ
to_symbolsZfrom_Zto_rw rw rx � _xml_escape� s
r� c @ s e Zd ZdS )�
_ConstantsN)�__name__�
__module__� __qualname__rw rw rw rx r� � s r� �
0123456789Z ABCDEFabcdef�\ � c c s | ]}|t jkr|V qd S )N)�stringZ
whitespace)r� �crw rw rx r� � s c @ sP e Zd ZdZddd�Zedd� �Zdd � Zd
d � Zd d
� Z ddd�Z
dd� Z dS )r z7base exception class for all parsing runtime exceptionsr Nc C s> || _ |d kr || _d| _n || _|| _|| _|||f| _d S )Nr� )�loc�msg�pstr�
parserElement�args)�selfr� r� r� �elemrw rw rx �__init__� s zParseBaseException.__init__c C s | |j |j|j|j�S )z�
internal factory method to simplify creating one type of ParseException
from another - avoids having __init__ signature conflicts among subclasses
)r� r� r� r� )�cls�perw rw rx �_from_exception� s z"ParseBaseException._from_exceptionc C sN |dkrt | j| j�S |dkr,t| j| j�S |dkrBt| j| j�S t|��dS )z�supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
rJ r9 �columnrG N)r9 r� )rJ r� r� r9 rG �AttributeError)r� Zanamerw rw rx � __getattr__� s z ParseBaseException.__getattr__c C s d| j | j| j| jf S )Nz"%s (at char %d), (line:%d, col:%d))r� r� rJ r� )r� rw rw rx �__str__� s zParseBaseException.__str__c C s t | �S )N)r� )r� rw rw rx �__repr__� s zParseBaseException.__repr__�>!<c C s< | j }| jd }|r4dj|d|� |||d� f�}|j� S )z�Extracts the exception line from the input string, and marks
the location of the exception with a special symbol.
rr r� N)rG r� �join�strip)r� Z markerStringZline_strZ line_columnrw rw rx �
markInputline� s
z ParseBaseException.markInputlinec C s dj � tt| �� S )Nzlineno col line)r� �dir�type)r� rw rw rx �__dir__� s zParseBaseException.__dir__)r NN)r� ) r� r� r� �__doc__r� � classmethodr� r� r� r� r� r� rw rw rw rx r � s
c @ s e Zd ZdZdS )r aN
Exception thrown when parse expressions don't match class;
supported attributes by name are:
- lineno - returns the line number of the exception text
- col - returns the column number of the exception text
- line - returns the line containing the exception text
Example::
try:
Word(nums).setName("integer").parseString("ABC")
except ParseException as pe:
print(pe)
print("column: {}".format(pe.col))
prints::
Expected integer (at char 0), (line:1, col:1)
column: 1
N)r� r� r� r� rw rw rw rx r � s c @ s e Zd ZdZdS )r! znuser-throwable exception thrown when inconsistent parse content
is found; stops all parsing immediatelyN)r� r� r� r� rw rw rw rx r! s c @ s e Zd ZdZdS )r# z�just like L{ParseFatalException}, but thrown internally when an
L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop
immediately because an unbacktrackable syntax error has been foundN)r� r� r� r� rw rw rw rx r# s c @ s e Zd ZdZdd� Zdd� ZdS )r& zZexception thrown by L{ParserElement.validate} if the grammar could be improperly recursivec C s
|| _ d S )N)�parseElementTrace)r� �parseElementListrw rw rx r� s z"RecursiveGrammarException.__init__c C s
d| j S )Nz RecursiveGrammarException: %s)r� )r� rw rw rx r� s z!RecursiveGrammarException.__str__N)r� r� r� r� r� r� rw rw rw rx r& s c @ s, e Zd Zdd� Zdd� Zdd� Zdd� Zd S )
�_ParseResultsWithOffsetc C s ||f| _ d S )N)�tup)r� Zp1Zp2rw rw rx r� $ s z _ParseResultsWithOffset.__init__c C s
| j | S )N)r� )r� �irw rw rx � __getitem__& s z#_ParseResultsWithOffset.__getitem__c C s t | jd �S )Nr )�reprr� )r� rw rw rx r� ( s z _ParseResultsWithOffset.__repr__c C s | j d |f| _ d S )Nr )r� )r� r� rw rw rx � setOffset* s z!_ParseResultsWithOffset.setOffsetN)r� r� r� r� r� r� r� rw rw rw rx r� # s r� c @ s� e Zd ZdZd[dd�Zddddefdd�Zdd � Zefd
d �Zd d
� Z dd� Z
dd� Z dd� Z e Z
dd� Zdd� Zdd� Zdd� Zd d � Zer�eZeZeZn$eZeZeZd d � Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd\d(d)�Z d*d+� Z d,d-� Z d.d/� Z d0d1� Z d2d3� Z!d4d5� Z"d6d7� Z#d8d9� Z$d:d;� Z%d<d=� Z&d]d?d@�Z'dAdB� Z(dCdD� Z)dEdF� Z*d^dHdI�Z+dJdK� Z,dLdM� Z-d_dOdP�Z.dQdR� Z/dSdT� Z0dUdV� Z1dWdX� Z2dYdZ� Z3dS )`r" aI
Structured parse results, to provide multiple means of access to the parsed data:
- as a list (C{len(results)})
- by list index (C{results[0], results[1]}, etc.)
- by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
Example::
integer = Word(nums)
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
# date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
# parseString returns a ParseResults object
result = date_str.parseString("1999/12/31")
def test(s, fn=repr):
print("%s -> %s" % (s, fn(eval(s))))
test("list(result)")
test("result[0]")
test("result['month']")
test("result.day")
test("'month' in result")
test("'minutes' in result")
test("result.dump()", str)
prints::
list(result) -> ['1999', '/', '12', '/', '31']
result[0] -> '1999'
result['month'] -> '12'
result.day -> '31'
'month' in result -> True
'minutes' in result -> False
result.dump() -> ['1999', '/', '12', '/', '31']
- day: 31
- month: 12
- year: 1999
NTc C s" t || �r|S tj| �}d|_|S )NT)rz �object�__new__�_ParseResults__doinit)r� �toklist�name�asList�modalZretobjrw rw rx r� T s
zParseResults.__new__c
C s` | j rvd| _ d | _d | _i | _|| _|| _|d kr6g }||t�rP|d d � | _n ||t�rft|�| _n|g| _t � | _
|d k o�|�r\|s�d| j|< ||t �r�t |�}|| _||t
d �ttf�o�|d dg fk�s\||t�r�|g}|�r&||t��rt|j� d�| |< ntt|d �d�| |< || | _n6y|d | |< W n$ tttfk
�rZ || |< Y nX d S )NFr r� )r� �_ParseResults__name�_ParseResults__parent�_ParseResults__accumNames�_ParseResults__asList�_ParseResults__modal�list�_ParseResults__toklist�_generatorType�dict�_ParseResults__tokdictru r� r� �
basestringr" r� �copy�KeyError� TypeError�
IndexError)r� r� r� r� r� rz rw rw rx r� ] sB
$
zParseResults.__init__c C sP t |ttf�r| j| S || jkr4| j| d d S tdd� | j| D ��S d S )Nrr r c S s g | ] }|d �qS )r rw )r� �vrw rw rx �
<listcomp>� s z,ParseResults.__getitem__.<locals>.<listcomp>rs )rz ru �slicer� r� r� r" )r� r� rw rw rx r� � s
zParseResults.__getitem__c C s� ||t �r0| jj|t� �|g | j|< |d }nD||ttf�rN|| j|< |}n&| jj|t� �t |d�g | j|< |}||t�r�t| �|_ d S )Nr )
r� r� �getr� ru r� r� r" �wkrefr� )r� �kr� rz �subrw rw rx � __setitem__� s
"
zParseResults.__setitem__c
C s� t |ttf�r�t| j�}| j|= t |t�rH|dk r:||7 }t||d �}tt|j|�� �}|j� x^| j j
� D ]F\}}x<|D ]4}x.t |�D ]"\}\}} t || | |k �||< q�W q|W qnW n| j |= d S )Nr rr )
rz ru r� �lenr� r� �range�indices�reverser� �items� enumerater� )
r� r� ZmylenZremovedr� � occurrences�jr� �value�positionrw rw rx � __delitem__� s
$zParseResults.__delitem__c C s
|| j kS )N)r� )r� r� rw rw rx � __contains__� s zParseResults.__contains__c C s
t | j�S )N)r� r� )r� rw rw rx �__len__� s zParseResults.__len__c C s
| j S )N)r� )r� rw rw rx �__bool__� s zParseResults.__bool__c C s
t | j�S )N)�iterr� )r� rw rw rx �__iter__� s zParseResults.__iter__c C s t | jd d d� �S )Nrr rs )r� r� )r� rw rw rx � __reversed__� s zParseResults.__reversed__c C s$ t | jd�r| jj� S t| j�S d S )N�iterkeys)�hasattrr� r� r� )r� rw rw rx � _iterkeys� s
zParseResults._iterkeysc s � fdd�� j � D �S )Nc 3 s | ]}� | V qd S )Nrw )r� r� )r� rw rx r� � s z+ParseResults._itervalues.<locals>.<genexpr>)r� )r� rw )r� rx � _itervalues� s zParseResults._itervaluesc s � fdd�� j � D �S )Nc 3 s | ]}|� | fV qd S )Nrw )r� r� )r� rw rx r� � s z*ParseResults._iteritems.<locals>.<genexpr>)r� )r� rw )r� rx �
_iteritems� s zParseResults._iteritemsc C s t | j� �S )zVReturns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).)r� r� )r� rw rw rx �keys� s zParseResults.keysc C s t | j� �S )zXReturns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).)r� �
itervalues)r� rw rw rx �values� s zParseResults.valuesc C s t | j� �S )zfReturns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).)r� � iteritems)r� rw rw rx r� � s zParseResults.itemsc C s
t | j�S )z�Since keys() returns an iterator, this method is helpful in bypassing
code that looks for the existence of any defined results names.)�boolr� )r� rw rw rx �haskeys� s zParseResults.haskeysc O s� |s
dg}x6|j � D ]*\}}|dkr2|d |f}qtd| ��qW t|d t�sht|�dksh|d | kr�|d }| | }| |= |S |d }|S dS )a�
Removes and returns item at specified index (default=C{last}).
Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
argument or an integer argument, it will use C{list} semantics
and pop tokens from the list of parsed tokens. If passed a
non-integer argument (most likely a string), it will use C{dict}
semantics and pop the corresponding value from any defined
results names. A second default return value argument is
supported, just as in C{dict.pop()}.
Example::
def remove_first(tokens):
tokens.pop(0)
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
label = Word(alphas)
patt = label("LABEL") + OneOrMore(Word(nums))
print(patt.parseString("AAB 123 321").dump())
# Use pop() in a parse action to remove named result (note that corresponding value is not
# removed from list form of results)
def remove_LABEL(tokens):
tokens.pop("LABEL")
return tokens
patt.addParseAction(remove_LABEL)
print(patt.parseString("AAB 123 321").dump())
prints::
['AAB', '123', '321']
- LABEL: AAB
['AAB', '123', '321']
rr �defaultr z-pop() got an unexpected keyword argument '%s'Nrs )r� r� rz ru r� )r� r� �kwargsr� r� �indexr� Z defaultvaluerw rw rx �pop� s " zParseResults.popc C s || kr| | S |S dS )ai
Returns named result matching the given key, or if there is no
such name, then returns the given C{defaultValue} or C{None} if no
C{defaultValue} is specified.
Similar to C{dict.get()}.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString("1999/12/31")
print(result.get("year")) # -> '1999'
print(result.get("hour", "not specified")) # -> 'not specified'
print(result.get("hour")) # -> None
Nrw )r� �key� defaultValuerw rw rx r� s zParseResults.getc C sZ | j j||� xF| jj� D ]8\}}x.t|�D ]"\}\}}t||||k �||< q,W qW dS )a
Inserts new element at location index in the list of parsed tokens.
Similar to C{list.insert()}.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to insert the parse location in the front of the parsed results
def insert_locn(locn, tokens):
tokens.insert(0, locn)
print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
N)r� �insertr� r� r� r� )r� r� ZinsStrr� r� r� r� r� rw rw rx r� 2 s zParseResults.insertc C s | j j|� dS )a�
Add single element to end of ParseResults list of elements.
Example::
print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
# use a parse action to compute the sum of the parsed integers, and add it to the end
def append_sum(tokens):
tokens.append(sum(map(int, tokens)))
print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
N)r� �append)r� �itemrw rw rx r� F s zParseResults.appendc C s$ t |t�r| |7 } n | jj|� dS )a
Add sequence of elements to end of ParseResults list of elements.
Example::
patt = OneOrMore(Word(alphas))
# use a parse action to append the reverse of the matched strings, to make a palindrome
def make_palindrome(tokens):
tokens.extend(reversed([t[::-1] for t in tokens]))
return ''.join(tokens)
print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
N)rz r" r� �extend)r� Zitemseqrw rw rx r� T s
zParseResults.extendc C s | j dd�= | jj� dS )z7
Clear all elements and results names.
N)r� r� �clear)r� rw rw rx r� f s zParseResults.clearc C sf y| | S t k
r dS X || jkr^|| jkrD| j| d d S tdd� | j| D ��S ndS d S )Nr� rr r c S s g | ] }|d �qS )r rw )r� r� rw rw rx r� w s z,ParseResults.__getattr__.<locals>.<listcomp>rs )r� r� r� r" )r� r� rw rw rx r� m s
zParseResults.__getattr__c C s | j � }||7 }|S )N)r� )r� �otherr� rw rw rx �__add__{ s zParseResults.__add__c s� |j rnt| j���fdd�� |j j� }� fdd�|D �}x4|D ],\}}|| |< t|d t�r>t| �|d _q>W | j|j7 _| jj |j� | S )Nc s | dk r � S | � S )Nr rw )�a)�offsetrw rx ry � s z'ParseResults.__iadd__.<locals>.<lambda>c s4 g | ],\}}|D ] }|t |d � |d ��f�qqS )r rr )r� )r� r� �vlistr� )� addoffsetrw rx r� � s z)ParseResults.__iadd__.<locals>.<listcomp>r )
r� r� r� r� rz r" r� r� r� �update)r� r� Z
otheritemsZotherdictitemsr� r� rw )r r rx �__iadd__� s
zParseResults.__iadd__c C s& t |t�r|dkr| j� S || S d S )Nr )rz ru r� )r� r� rw rw rx �__radd__� s zParseResults.__radd__c C s dt | j�t | j�f S )Nz(%s, %s))r� r� r� )r� rw rw rx r� � s zParseResults.__repr__c C s ddj dd� | jD �� d S )N�[z, c s s( | ] }t |t�rt|�nt|�V qd S )N)rz r" r� r� )r� r� rw rw rx r� � s z'ParseResults.__str__.<locals>.<genexpr>�])r� r� )r� rw rw rx r� � s zParseResults.__str__r� c C sP g }xF| j D ]<}|r"|r"|j|� t|t�r:||j� 7 }q |jt|�� q W |S )N)r� r� rz r" �
_asStringListr� )r� �sep�outr� rw rw rx r
� s
zParseResults._asStringListc C s dd� | j D �S )a�
Returns the parse results as a nested list of matching tokens, all converted to strings.
Example::
patt = OneOrMore(Word(alphas))
result = patt.parseString("sldkj lsdkj sldkj")
# even though the result prints in string-like form, it is actually a pyparsing ParseResults
print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
# Use asList() to create an actual list
result_list = result.asList()
print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
c S s" g | ]}t |t�r|j� n|�qS rw )rz r" r� )r� �resrw rw rx r� � s z'ParseResults.asList.<locals>.<listcomp>)r� )r� rw rw rx r� � s zParseResults.asListc s6 t r | j}n| j}� fdd�� t� fdd�|� D ��S )a�
Returns the named parse results as a nested dictionary.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
result_dict = result.asDict()
print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
# even though a ParseResults supports dict-like access, sometime you just need to have a dict
import json
print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
c s6 t | t�r.| j� r| j� S � fdd�| D �S n| S d S )Nc s g | ] }� |��qS rw rw )r� r� )�toItemrw rx r� � s z7ParseResults.asDict.<locals>.toItem.<locals>.<listcomp>)rz r" r� �asDict)r� )r rw rx r � s
z#ParseResults.asDict.<locals>.toItemc 3 s | ]\}}|� |�fV qd S )Nrw )r� r� r� )r rw rx r� � s z&ParseResults.asDict.<locals>.<genexpr>)�PY_3r� r� r� )r� Zitem_fnrw )r rx r � s
zParseResults.asDictc C s8 t | j�}| jj� |_| j|_|jj| j� | j|_|S )zA
Returns a new copy of a C{ParseResults} object.
)r" r� r� r� r� r� r r� )r� r� rw rw rx r� � s
zParseResults.copyFc C sP d}g }t dd� | jj� D ��}|d }|s8d}d}d}d} |dk rJ|} n | jrV| j} | sf|rbdS d} |||d| d g7 }x�t| j�D ]�\}
} t| t�r�|
|kr�|| j||
|o�|dk||�g7 }n || jd|o�|dk||�g7 }q�d} |
|kr�||
} | �s
|�rq�nd} t t
| ��}
|||d| d |
d
| d g 7 }q�W |||d
| d g7 }dj |�S ) z�
(Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
�
c s s( | ] \}}|D ]}|d |fV qqdS )rr Nrw )r� r� r r� rw rw rx r� � s z%ParseResults.asXML.<locals>.<genexpr>z r� NZITEM�<�>z</) r� r� r� r� r� r� rz r" �asXMLr� r� r� )r� ZdoctagZnamedItemsOnly�indentZ formatted�nlr Z
namedItemsZnextLevelIndentZselfTagr� r
ZresTagZ xmlBodyTextrw rw rx r � sT
zParseResults.asXMLc C s: x4| j j� D ]&\}}x |D ]\}}||kr|S qW q W d S )N)r� r� )r� r� r� r r� r� rw rw rx Z__lookup$ s
zParseResults.__lookupc C s� | j r | j S | jr.| j� }|r(|j| �S dS nNt| �dkrxt| j�dkrxtt| jj� ��d d dkrxtt| jj� ��S dS dS )a(
Returns the results name for this token expression. Useful when several
different expressions might match at a particular location.
Example::
integer = Word(nums)
ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
house_number_expr = Suppress('#') + Word(nums, alphanums)
user_data = (Group(house_number_expr)("house_number")
| Group(ssn_expr)("ssn")
| Group(integer)("age"))
user_info = OneOrMore(user_data)
result = user_info.parseString("22 111-22-3333 #221B")
for item in result:
print(item.getName(), ':', item[0])
prints::
age : 22
ssn : 111-22-3333
house_number : 221B
Nrr r rs )r rs ) r� r� �_ParseResults__lookupr� r� �nextr� r� r� )r� �parrw rw rx �getName+ s
zParseResults.getNamer c C sb g }d}|j |t| j� � � |�rX| j� r�tdd� | j� D ��}xz|D ]r\}}|r^|j |� |j d|d| |f � t|t�r�|r�|j |j||d �� q�|j t|�� qH|j t |�� qHW n�t
dd� | D ���rX| }x~t |�D ]r\} }
t|
t��r*|j d|d| | |d|d |
j||d �f � q�|j d|d| | |d|d t|
�f � q�W d j |�S )
aH
Diagnostic method for listing out the contents of a C{ParseResults}.
Accepts an optional C{indent} argument so that this string can be embedded
in a nested display of other data.
Example::
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
result = date_str.parseString('12/31/1999')
print(result.dump())
prints::
['12', '/', '31', '/', '1999']
- day: 1999
- month: 31
- year: 12
r c s s | ]\}}t |�|fV qd S )N)r{ )r� r� r� rw rw rx r� g s z$ParseResults.dump.<locals>.<genexpr>z
%s%s- %s: z rr c s s | ]}t |t�V qd S )N)rz r" )r� �vvrw rw rx r� s s z
%s%s[%d]:
%s%s%sr� )
r� r� r� r� �sortedr� rz r" �dumpr� �anyr� r� ) r� r �depth�fullr �NLr� r� r� r� r rw rw rx r P s,
4.zParseResults.dumpc O s t j | j� f|�|� dS )a�
Pretty-printer for parsed results as a list, using the C{pprint} module.
Accepts additional positional or keyword args as defined for the
C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
Example::
ident = Word(alphas, alphanums)
num = Word(nums)
func = Forward()
term = ident | num | Group('(' + func + ')')
func <<= ident + Group(Optional(delimitedList(term)))
result = func.parseString("fna a,b,(fnb c,d,200),100")
result.pprint(width=40)
prints::
['fna',
['a',
'b',
['(', 'fnb', ['c', 'd', '200'], ')'],
'100']]
N)�pprintr� )r� r� r� rw rw rx r" } s zParseResults.pprintc C s. | j | jj� | jd k r | j� p d | j| jffS )N)r� r� r� r� r� r� )r� rw rw rx � __getstate__� s
zParseResults.__getstate__c C sN |d | _ |d \| _}}| _i | _| jj|� |d k rDt|�| _nd | _d S )Nr rr )r� r� r� r� r r� r� )r� �stater Z inAccumNamesrw rw rx � __setstate__� s
zParseResults.__setstate__c C s | j | j| j| jfS )N)r� r� r� r� )r� rw rw rx �__getnewargs__� s zParseResults.__getnewargs__c C s t t| ��t| j� � S )N)r� r� r� r� )r� rw rw rx r� � s zParseResults.__dir__)NNTT)N)r� )NFr� T)r� r T)4r� r� r� r� r� rz r� r� r� r� r� r� r� � __nonzero__r� r� r� r� r� r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r r r r� r� r
r� r r� r r r r r" r# r% r& r� rw rw rw rx r" - sh &
'
4
#
=%
-
c C sF |}d| k ot |�k n r4|| d dkr4dS | |jdd| � S )a Returns current column within a string, counting newlines as line separators.
The first column is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r rr r )r� �rfind)r� �strgr� rw rw rx r9 � s
c C s |j dd| �d S )a Returns current line number within a string, counting newlines as line separators.
The first line is number 1.
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
r r rr )�count)r� r) rw rw rx rJ � s
c C sF |j dd| �}|jd| �}|dkr2||d |� S ||d d� S dS )zfReturns the line of text containing loc within a string, counting newlines as line separators.
r r rr N)r( �find)r� r) ZlastCRZnextCRrw rw rx rG � s
c C s8 t dt|� d t|� dt|| �t|| �f � d S )NzMatch z at loc z(%d,%d))�printr� rJ r9 )�instringr� �exprrw rw rx �_defaultStartDebugAction� s r/ c C s$ t dt|� d t|j� � � d S )NzMatched z -> )r, r� r{ r� )r- �startlocZendlocr. �toksrw rw rx �_defaultSuccessDebugAction� s r2 c C s t dt|� � d S )NzException raised:)r, r� )r- r� r. �excrw rw rx � _defaultExceptionDebugAction� s r4 c G s dS )zG'Do-nothing' debug action, to suppress debugging output during parsing.Nrw )r� rw rw rx rQ � s rq c s� �t kr�fdd�S dg�dg�td d� dkrFddd �}dd
d �� n tj}tj� d }|dd
�d }|d |d | f�� �����fdd�}d}yt�dt�d�j�}W n tk
r� t��}Y nX ||_|S )Nc s � |�S )Nrw )r� �lrv )�funcrw rx ry � s z _trim_arity.<locals>.<lambda>r Frq ro � c S s8 t dkr dnd }tj| | d d�| }|j|jfgS )
Nro r7 r rq rr )�limit)ro r7 r ������)�system_version� traceback�
extract_stack�filenamerJ )r8 r �
frame_summaryrw rw rx r= s z"_trim_arity.<locals>.extract_stackc S s$ t j| |d�}|d }|j|jfgS )N)r8 rr rs )r< �
extract_tbr> rJ )�tbr8 Zframesr? rw rw rx r@ s z _trim_arity.<locals>.extract_tb� )r8 rr c s� x�y �| �d d � � }d�d< |S t k
r� �d r>� n4z.tj� d }� |dd�d d d� �ksj� W d ~X �d �kr��d d7 < w� Y qX qW d S )Nr Trr rq )r8 rs rs )r� r~ �exc_info)r� r� rA )r@ �
foundArityr6 r8 �maxargs�pa_call_line_synthrw rx �wrapper s" z _trim_arity.<locals>.wrapperz<parse action>r� � __class__)ro r7 )r )r rs ) �singleArgBuiltinsr; r< r= r@ �getattrr� � Exceptionr{ )r6 rE r= Z LINE_DIFFZ this_linerG � func_namerw )r@ rD r6 r8 rE rF rx � _trim_arity� s*
rM c s� e Zd ZdZdZdZedd� �Zedd� �Zd�dd �Z d
d � Z
d d
� Z d�dd�Z d�dd�Z
dd� Zdd� Zdd� Zdd� Zdd � Zd d � Zd�d d �Zd!d"� Zd�d#d$�Zd%d&� Zd'd(� ZG d)d*� d*e�Zed+k r�G d,d-� d-e�Z nG d.d-� d-e�Z i Z e � Z d/d/gZ d�d0d1�Z!eZ"ed2d3� �Z#dZ$ed�d5d6��Z%d�d7d8�Z&e'dfd9d:�Z(d;d<� Z)e'fd=d>�Z*e'dfd?d@�Z+dAdB� Z,dCdD� Z-dEdF� Z.dGdH� Z/dIdJ� Z0dKdL� Z1dMdN� Z2dOdP� Z3dQdR� Z4dSdT� Z5dUdV� Z6dWdX� Z7dYdZ� Z8d�d[d\�Z9d]d^� Z:d_d`� Z;dadb� Z<dcdd� Z=dedf� Z>dgdh� Z?d�didj�Z@dkdl� ZAdmdn� ZBdodp� ZCdqdr� ZDg fdsdt�ZEd�dudv�ZF� fdwdx�ZGdydz� ZHd{d|� ZId}d~� ZJdd�� ZKd�d�d��ZLd�d�d��ZM� ZNS )�r$ z)Abstract base level parser element class.z
Fc C s
| t _dS )a�
Overrides the default whitespace chars
Example::
# default whitespace chars are space, <TAB> and newline
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl']
# change to just treat newline as significant
ParserElement.setDefaultWhitespaceChars(" \t")
OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def']
N)r$ �DEFAULT_WHITE_CHARS)�charsrw rw rx �setDefaultWhitespaceChars= s
z'ParserElement.setDefaultWhitespaceCharsc C s
| t _dS )a�
Set class to be used for inclusion of string literals into a parser.
Example::
# default literal class used is Literal
integer = Word(nums)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# change to Suppress
ParserElement.inlineLiteralsUsing(Suppress)
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
date_str.parseString("1999/12/31") # -> ['1999', '12', '31']
N)r$ �_literalStringClass)r� rw rw rx �inlineLiteralsUsingL s z!ParserElement.inlineLiteralsUsingc C s� t � | _d | _d | _d | _|| _d| _tj| _ d| _
d| _ d| _ t � | _
d| _d| _d| _d| _d| _d| _d | _d| _d| _d S )NTFr� )NNN)r� � parseAction�
failAction�strRepr� resultsName�
saveAsList�skipWhitespacer$ rN �
whiteChars�copyDefaultWhiteChars�mayReturnEmpty�keepTabs� ignoreExprs�debug� streamlined�
mayIndexError�errmsg� modalResults� debugActions�re� callPreparse�
callDuringTry)r� �savelistrw rw rx r� a s( zParserElement.__init__c C s< t j | �}| jdd� |_| jdd� |_| jr8tj|_|S )a$
Make a copy of this C{ParserElement}. Useful for defining different parse actions
for the same parsing pattern, using copies of the original parse element.
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
prints::
[5120, 100, 655360, 268435456]
Equivalent form of C{expr.copy()} is just C{expr()}::
integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
N)r� rS r] rZ r$ rN rY )r� Zcpyrw rw rx r� x s
zParserElement.copyc C s* || _ d| j | _t| d�r&| j| j_| S )af
Define name for this expression, makes debugging and exception messages clearer.
Example::
Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1)
z Expected � exception)r� ra r� rh r� )r� r� rw rw rx �setName� s
zParserElement.setNamec C s4 | j � }|jd�r"|dd� }d}||_| |_|S )aP
Define name for referencing matching tokens as a nested attribute
of the returned parse results.
NOTE: this returns a *copy* of the original C{ParserElement} object;
this is so that the client can define a basic element, such as an
integer, and reference it in multiple places with different names.
You can also set results names using the abbreviated syntax,
C{expr("name")} in place of C{expr.setResultsName("name")} -
see L{I{__call__}<__call__>}.
Example::
date_str = (integer.setResultsName("year") + '/'
+ integer.setResultsName("month") + '/'
+ integer.setResultsName("day"))
# equivalent form:
date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
�*Nrr Trs )r� �endswithrV rb )r� r� �listAllMatchesZnewselfrw rw rx �setResultsName� s
z ParserElement.setResultsNameTc s@ |r&| j � d� fdd� }� |_|| _ nt| j d�r<| j j| _ | S )z�Method to invoke the Python pdb debugger when this element is
about to be parsed. Set C{breakFlag} to True to enable, False to
disable.
Tc s dd l }|j� � | |||�S )Nr )�pdbZ set_trace)r- r� � doActions� callPreParsern )� _parseMethodrw rx �breaker� s z'ParserElement.setBreak.<locals>.breaker�_originalParseMethod)TT)�_parsers r� )r� Z breakFlagrr rw )rq rx �setBreak� s
zParserElement.setBreakc O s& t ttt |���| _|jdd�| _| S )a
Define action to perform when successfully matching parse element definition.
Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
- s = the original string being parsed (see note below)
- loc = the location of the matching substring
- toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
If the functions in fns modify the tokens, they can return them as the return
value from fn, and the modified list of tokens will replace the original.
Otherwise, fn does not need to return any value.
Optional keyword arguments:
- callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
Note: the default parsing behavior is to expand tabs in the input string
before starting the parsing process. See L{I{parseString}<parseString>} for more information
on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
consistent view of the parsed string, the parse location, and line and column
positions within the parsed string.
Example::
integer = Word(nums)
date_str = integer + '/' + integer + '/' + integer
date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31']
# use parse action to convert to ints at parse time
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
date_str = integer + '/' + integer + '/' + integer
# note that integer fields are now ints, not strings
date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31]
rf F)r� �maprM rS r� rf )r� �fnsr� rw rw rx r� � s "z ParserElement.setParseActionc O s4 | j tttt|���7 _ | jp,|jdd�| _| S )z�
Add parse action to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
See examples in L{I{copy}<copy>}.
rf F)rS r� rv rM rf r� )r� rw r� rw rw rx �addParseAction� s z ParserElement.addParseActionc sb |j dd��|j dd�r tnt� x(|D ] �� ��fdd�}| jj|� q&W | jpZ|j dd�| _| S )a� Add a boolean predicate function to expression's list of parse actions. See
L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction},
functions passed to C{addCondition} need to return boolean success/fail of the condition.
Optional keyword arguments:
- message = define a custom message to be used in the raised exception
- fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
Example::
integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
year_int = integer.copy()
year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
date_str = year_int + '/' + integer + '/' + integer
result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
�messagez failed user-defined condition�fatalFc s$ t t��| ||��s � | |���d S )N)r� rM )r� r5 rv )�exc_type�fnr� rw rx �pa s z&ParserElement.addCondition.<locals>.parf )r� r! r rS r� rf )r� rw r� r} rw )r{ r| r� rx � addCondition� s
zParserElement.addConditionc C s
|| _ | S )a Define action to perform if parsing fails at this expression.
Fail acton fn is a callable function that takes the arguments
C{fn(s,loc,expr,err)} where:
- s = string being parsed
- loc = location where expression match was attempted and failed
- expr = the parse expression that failed
- err = the exception thrown
The function returns no value. It may throw C{L{ParseFatalException}}
if it is desired to stop parsing immediately.)rT )r� r| rw rw rx �
setFailAction s
zParserElement.setFailActionc C sZ d}xP|rTd}xB| j D ]8}y x|j||�\}}d}q W W q tk
rL Y qX qW qW |S )NTF)r] rt r )r� r- r� Z
exprsFound�eZdummyrw rw rx �_skipIgnorables# s z ParserElement._skipIgnorablesc C sL | j r| j||�}| jrH| j}t|�}x ||k rF|| |krF|d7 }q(W |S )Nrr )r] r� rX rY r� )r� r- r� Zwt�instrlenrw rw rx �preParse0 s zParserElement.preParsec C s |g fS )Nrw )r� r- r� ro rw rw rx � parseImpl< s zParserElement.parseImplc C s |S )Nrw )r� r- r� � tokenlistrw rw rx � postParse? s zParserElement.postParsec " C s� | j }|s| jr�| jd r,| jd ||| � |rD| jrD| j||�}n|}|}yDy| j|||�\}}W n( tk
r� t|t|�| j | ��Y nX W nX t
k
r� } z<| jd r�| jd ||| | � | jr�| j||| | � � W Y d d } ~ X nX n�|o�| j�r| j||�}n|}|}| j �s$|t|�k�rhy| j|||�\}}W n* tk
�rd t|t|�| j | ��Y nX n| j|||�\}}| j |||�}t
|| j| j| jd�}
| j�r�|�s�| j�r�|�rVyRxL| jD ]B} | |||
�}|d k �r�t
|| j| j�o�t|t
tf�| jd�}
�q�W W nF t
k
�rR } z(| jd �r@| jd ||| | � � W Y d d } ~ X nX nNxL| jD ]B} | |||
�}|d k �r^t
|| j| j�o�t|t
tf�| jd�}
�q^W |�r�| jd �r�| jd |||| |
� ||
fS )Nr rq )r� r� rr )r^ rT rc re r� r� r� r r� ra r r` r� r" rV rW rb rS rf rz r� ) r� r- r� ro rp Z debugging�prelocZ tokensStart�tokens�errZ retTokensr| rw rw rx �
_parseNoCacheC sp
zParserElement._parseNoCachec C s> y| j ||dd�d S tk
r8 t||| j| ��Y nX d S )NF)ro r )rt r! r ra )r� r- r� rw rw rx �tryParse� s zParserElement.tryParsec C s2 y| j ||� W n ttfk
r( dS X dS d S )NFT)r� r r� )r� r- r� rw rw rx � canParseNext� s
zParserElement.canParseNextc @ s e Zd Zdd� ZdS )z ParserElement._UnboundedCachec sd i � t � | _�� �fdd�}� fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )�cache� not_in_cacherw rx r� � s z3ParserElement._UnboundedCache.__init__.<locals>.getc s |� |< d S )Nrw )r� r� r� )r� rw rx �set� s z3ParserElement._UnboundedCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z5ParserElement._UnboundedCache.__init__.<locals>.clear)r� r� �types�
MethodTyper� r� r� )r� r� r� r� rw )r� r� rx r� � s z&ParserElement._UnboundedCache.__init__N)r� r� r� r� rw rw rw rx �_UnboundedCache� s r� Nc @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sh t � | _�t� � � �fdd�}� �fdd�}� fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s" |� |< t � ��kr � jd� d S )NF)r� �popitem)r� r� r� )r� �sizerw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � d S )N)r� )r� )r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear)r� r� � _OrderedDictr� r� r� r� r� )r� r� r� r� r� rw )r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx �
_FifoCache� s r� c @ s e Zd Zdd� ZdS )zParserElement._FifoCachec sv t � | _�i � tjg ���� �fdd�}� ��fdd�}� �fdd�}tj|| �| _tj|| �| _tj|| �| _d S )Nc s � j |��S )N)r� )r� r� )r� r� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.getc s2 |� |< t � ��kr$� j�j� d � �j|� d S )N)r� r� �popleftr� )r� r� r� )r� �key_fifor� rw rx r� � s z.ParserElement._FifoCache.__init__.<locals>.setc s � j � �j � d S )N)r� )r� )r� r� rw rx r� � s z0ParserElement._FifoCache.__init__.<locals>.clear) r� r� � collections�dequer� r� r� r� r� )r� r� r� r� r� rw )r� r� r� r� rx r� � s z!ParserElement._FifoCache.__init__N)r� r� r� r� rw rw rw rx r� � s r c C s� d\}}| ||||f}t j�� t j}|j|�} | |jkr�t j| d7 < y| j||||�} W n8 tk
r� }
z |j||
j |
j
� � � W Y d d }
~
X q�X |j|| d | d j � f� | S n4t j| d7 < t | t
�r�| �| d | d j � fS W d Q R X d S )Nr rr )r rr )r$ �packrat_cache_lock�
packrat_cacher� r� �packrat_cache_statsr� r r� rH r� r� rz rK ) r� r- r� ro rp ZHITZMISS�lookupr� r� r� rw rw rx � _parseCache� s$
zParserElement._parseCachec C s( t jj� dgtt j� t jd d �< d S )Nr )r$ r� r� r� r� rw rw rw rx �
resetCache� s
zParserElement.resetCache� c C s8 t js4dt _| dkr t j� t _n t j| �t _t jt _dS )a� Enables "packrat" parsing, which adds memoizing to the parsing logic.
Repeated parse attempts at the same string location (which happens
often in many complex grammars) can immediately return a cached value,
instead of re-executing parsing/validating code. Memoizing is done of
both valid results and parsing exceptions.
Parameters:
- cache_size_limit - (default=C{128}) - if an integer value is provided
will limit the size of the packrat cache; if None is passed, then
the cache size will be unbounded; if 0 is passed, the cache will
be effectively disabled.
This speedup may break existing programs that use parse actions that
have side-effects. For this reason, packrat parsing is disabled when
you first import pyparsing. To activate the packrat feature, your
program must call the class method C{ParserElement.enablePackrat()}. If
your program uses C{psyco} to "compile as you go", you must call
C{enablePackrat} before calling C{psyco.full()}. If you do not do this,
Python will crash. For best results, call C{enablePackrat()} immediately
after importing pyparsing.
Example::
import pyparsing
pyparsing.ParserElement.enablePackrat()
TN)r$ �_packratEnabledr� r� r� r� rt )Zcache_size_limitrw rw rx �
enablePackrat s zParserElement.enablePackratc C s� t j� | js| j� x| jD ] }|j� q W | js<|j� }y<| j|d�\}}|rv| j||�}t � t
� }|j||� W n0 t k
r� } zt j r�� n|�W Y dd}~X nX |S dS )aB
Execute the parse expression with the given string.
This is the main interface to the client code, once the complete
expression has been built.
If you want the grammar to require that the entire input string be
successfully parsed, then set C{parseAll} to True (equivalent to ending
the grammar with C{L{StringEnd()}}).
Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
in order to report proper column numbers in parse actions.
If the input string contains tabs and
the grammar uses parse actions that use the C{loc} argument to index into the
string being parsed, you can ensure you have a consistent view of the input
string by:
- calling C{parseWithTabs} on your grammar before calling C{parseString}
(see L{I{parseWithTabs}<parseWithTabs>})
- define your parse action using the full C{(s,loc,toks)} signature, and
reference the input string using the parse action's C{s} argument
- explictly expand the tabs in your input string before calling
C{parseString}
Example::
Word('a').parseString('aaaaabaaa') # -> ['aaaaa']
Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text
r N)
r$ r� r_ �
streamliner] r\ �
expandtabsrt r� r
r) r �verbose_stacktrace)r� r- �parseAllr� r� r� Zser3 rw rw rx � parseString# s$ zParserElement.parseStringc c s@ | j s| j� x| jD ] }|j� qW | js8t|�j� }t|�}d}| j}| j}t j
� d} y�x�||kon| |k �ry |||�}
|||
dd�\} } W n t k
r� |
d }Y q`X | |kr�| d7 } | |
| fV |r�|||�}
|
|kr�| }q�|d7 }n| }q`|
d }q`W W n4 t k
�r: } zt j
�r&� n|�W Y dd}~X nX dS )a�
Scan the input string for expression matches. Each match will return the
matching tokens, start location, and end location. May be called with optional
C{maxMatches} argument, to clip scanning after 'n' matches are found. If
C{overlap} is specified, then overlapping matches will be reported.
Note that the start and end locations are reported relative to the string
being parsed. See L{I{parseString}<parseString>} for more information on parsing
strings with embedded tabs.
Example::
source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
print(source)
for tokens,start,end in Word(alphas).scanString(source):
print(' '*start + '^'*(end-start))
print(' '*start + tokens[0])
prints::
sldjf123lsdjjkf345sldkjf879lkjsfd987
^^^^^
sldjf
^^^^^^^
lsdjjkf
^^^^^^
sldkjf
^^^^^^
lkjsfd
r F)rp rr N)r_ r� r] r\ r� r� r� r� rt r$ r� r r r� )r� r- �
maxMatchesZoverlapr� r� r� Z
preparseFnZparseFn�matchesr� ZnextLocr� Znextlocr3 rw rw rx �
scanStringU sB
zParserElement.scanStringc C s� g }d}d| _ y�xh| j|�D ]Z\}}}|j|||� � |rrt|t�rT||j� 7 }n t|t�rh||7 }n
|j|� |}q W |j||d� � dd� |D �}djtt t
|���S t k
r� } zt j
rȂ n|�W Y dd}~X nX dS )af
Extension to C{L{scanString}}, to modify matching text with modified tokens that may
be returned from a parse action. To use C{transformString}, define a grammar and
attach a parse action to it that modifies the returned token list.
Invoking C{transformString()} on a target string will then scan for matches,
and replace the matched text patterns according to the logic in the parse
action. C{transformString()} returns the resulting transformed string.
Example::
wd = Word(alphas)
wd.setParseAction(lambda toks: toks[0].title())
print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
Prints::
Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
r TNc S s g | ] }|r|�qS rw rw )r� �orw rw rx r� � s z1ParserElement.transformString.<locals>.<listcomp>r� )r\ r� r� rz r" r� r� r� rv r� �_flattenr r$ r� )r� r- r ZlastErv r� r� r3 rw rw rx r� � s(
z ParserElement.transformStringc C sP yt dd� | j||�D ��S tk
rJ } ztjr6� n|�W Y dd}~X nX dS )a~
Another extension to C{L{scanString}}, simplifying the access to the tokens found
to match the given parse expression. May be called with optional
C{maxMatches} argument, to clip searching after 'n' matches are found.
Example::
# a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
cap_word = Word(alphas.upper(), alphas.lower())
print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
prints::
['More', 'Iron', 'Lead', 'Gold', 'I']
c S s g | ]\}}}|�qS rw rw )r� rv r� r� rw rw rx r� � s z.ParserElement.searchString.<locals>.<listcomp>N)r" r� r r$ r� )r� r- r� r3 rw rw rx � searchString� s zParserElement.searchStringc c sX d}d}x<| j ||d�D ]*\}}}|||� V |r>|d V |}qW ||d� V dS )a[
Generator method to split a string using the given expression as a separator.
May be called with optional C{maxsplit} argument, to limit the number of splits;
and the optional C{includeSeparators} argument (default=C{False}), if the separating
matching text should be included in the split results.
Example::
punc = oneOf(list(".,;:/-!?"))
print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
prints::
['This', ' this', '', ' this sentence', ' is badly punctuated', '']
r )r� N)r� ) r� r- �maxsplitZincludeSeparatorsZsplitsZlastrv r� r� rw rw rx r� � s
zParserElement.splitc C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )a�
Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
converts them to L{Literal}s by default.
Example::
greet = Word(alphas) + "," + Word(alphas) + "!"
hello = "Hello, World!"
print (hello, "->", greet.parseString(hello))
Prints::
Hello, World! -> ['Hello', ',', 'World', '!']
z4Cannot combine element of type %s with ParserElementrq )�
stacklevelN) rz r� r$ rQ �warnings�warnr� �
SyntaxWarningr )r� r� rw rw rx r � s
zParserElement.__add__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of + operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx r s
zParserElement.__radd__c C sL t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| tj � |g�S )zQ
Implementation of - operator, returns C{L{And}} with error stop
z4Cannot combine element of type %s with ParserElementrq )r� N)
rz r� r$ rQ r� r� r� r� r �
_ErrorStop)r� r� rw rw rx �__sub__ s
zParserElement.__sub__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || S )z]
Implementation of - operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rsub__ s
zParserElement.__rsub__c s� t |t�r|d }}n�t |t�r�|d dd� }|d dkrHd|d f}t |d t�r�|d dkr�|d dkrvt��S |d dkr�t��S �|d t�� S nJt |d t�r�t |d t�r�|\}}||8 }n tdt|d �t|d ���ntdt|���|dk �r td��|dk �r td��|| k�o2dkn �rBtd ��|�r�� �fd
d �� |�r�|dk�rt�� |� }nt�g| �� |� }n� |�}n |dk�r��}nt�g| �}|S )
a�
Implementation of * operator, allows use of C{expr * 3} in place of
C{expr + expr + expr}. Expressions may also me multiplied by a 2-integer
tuple, similar to C{{min,max}} multipliers in regular expressions. Tuples
may also include C{None} as in:
- C{expr*(n,None)} or C{expr*(n,)} is equivalent
to C{expr*n + L{ZeroOrMore}(expr)}
(read as "at least n instances of C{expr}")
- C{expr*(None,n)} is equivalent to C{expr*(0,n)}
(read as "0 to n instances of C{expr}")
- C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
- C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
Note that C{expr*(None,n)} does not raise an exception if
more than n exprs exist in the input stream; that is,
C{expr*(None,n)} does not enforce a maximum number of expr
occurrences. If this behavior is desired, then write
C{expr*(None,n) + ~expr}
r Nrq rr z7cannot multiply 'ParserElement' and ('%s','%s') objectsz0cannot multiply 'ParserElement' and '%s' objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuez+cannot multiply ParserElement by 0 or (0,0)c s( | dkr t �� | d � �S t ��S d S )Nrr )r )�n)�makeOptionalListr� rw rx r� ] s z/ParserElement.__mul__.<locals>.makeOptionalList)NN) rz ru �tupler2 r r� r� �
ValueErrorr )r� r� Z minElementsZ optElementsr� rw )r� r� rx �__mul__, sD
zParserElement.__mul__c C s
| j |�S )N)r� )r� r� rw rw rx �__rmul__p s zParserElement.__rmul__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zI
Implementation of | operator - returns C{L{MatchFirst}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__or__s s
zParserElement.__or__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || B S )z]
Implementation of | operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__ror__ s
zParserElement.__ror__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zA
Implementation of ^ operator - returns C{L{Or}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__xor__� s
zParserElement.__xor__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || A S )z]
Implementation of ^ operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rxor__� s
zParserElement.__rxor__c C sF t |t�rtj|�}t |t�s:tjdt|� tdd� dS t| |g�S )zC
Implementation of & operator - returns C{L{Each}}
z4Cannot combine element of type %s with ParserElementrq )r� N) rz r� r$ rQ r� r� r� r� r )r� r� rw rw rx �__and__� s
zParserElement.__and__c C sB t |t�rtj|�}t |t�s:tjdt|� tdd� dS || @ S )z]
Implementation of & operator when left operand is not a C{L{ParserElement}}
z4Cannot combine element of type %s with ParserElementrq )r� N)rz r� r$ rQ r� r� r� r� )r� r� rw rw rx �__rand__� s
zParserElement.__rand__c C s t | �S )zE
Implementation of ~ operator - returns C{L{NotAny}}
)r )r� rw rw rx �
__invert__� s zParserElement.__invert__c C s |dk r| j |�S | j� S dS )a
Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
passed as C{True}.
If C{name} is omitted, same as calling C{L{copy}}.
Example::
# these are equivalent
userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")
N)rm r� )r� r� rw rw rx �__call__� s
zParserElement.__call__c C s t | �S )z�
Suppresses the output of this C{ParserElement}; useful to keep punctuation from
cluttering up returned output.
)r+ )r� rw rw rx �suppress� s zParserElement.suppressc C s
d| _ | S )a
Disables the skipping of whitespace before matching the characters in the
C{ParserElement}'s defined pattern. This is normally only used internally by
the pyparsing module, but may be needed in some whitespace-sensitive grammars.
F)rX )r� rw rw rx �leaveWhitespace� s z ParserElement.leaveWhitespacec C s d| _ || _d| _| S )z8
Overrides the default whitespace chars
TF)rX rY rZ )r� rO rw rw rx �setWhitespaceChars� s z ParserElement.setWhitespaceCharsc C s
d| _ | S )z�
Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
Must be called before C{parseString} when the input grammar contains elements that
match C{<TAB>} characters.
T)r\ )r� rw rw rx �
parseWithTabs� s zParserElement.parseWithTabsc C sL t |t�rt|�}t |t�r4|| jkrH| jj|� n| jjt|j� �� | S )a�
Define expression to be ignored (e.g., comments) while doing pattern
matching; may be called repeatedly, to define multiple comment or other
ignorable patterns.
Example::
patt = OneOrMore(Word(alphas))
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
patt.ignore(cStyleComment)
patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
)rz r� r+ r] r� r� )r� r� rw rw rx �ignore� s
zParserElement.ignorec C s" |pt |p t|ptf| _d| _| S )zT
Enable display of debugging messages while doing pattern matching.
T)r/ r2 r4 rc r^ )r� Z startActionZ
successActionZexceptionActionrw rw rx �setDebugActions
s
z ParserElement.setDebugActionsc C s |r| j ttt� nd| _| S )a�
Enable display of debugging messages while doing pattern matching.
Set C{flag} to True to enable, False to disable.
Example::
wd = Word(alphas).setName("alphaword")
integer = Word(nums).setName("numword")
term = wd | integer
# turn on debugging for wd
wd.setDebug()
OneOrMore(term).parseString("abc 123 xyz 890")
prints::
Match alphaword at loc 0(1,1)
Matched alphaword -> ['abc']
Match alphaword at loc 3(1,4)
Exception raised:Expected alphaword (at char 4), (line:1, col:5)
Match alphaword at loc 7(1,8)
Matched alphaword -> ['xyz']
Match alphaword at loc 11(1,12)
Exception raised:Expected alphaword (at char 12), (line:1, col:13)
Match alphaword at loc 15(1,16)
Exception raised:Expected alphaword (at char 15), (line:1, col:16)
The output shown is that produced by the default debug actions - custom debug actions can be
specified using L{setDebugActions}. Prior to attempting
to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
which makes debugging and exception messages easier to understand - for instance, the default
name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
F)r� r/ r2 r4 r^ )r� �flagrw rw rx �setDebug s #zParserElement.setDebugc C s | j S )N)r� )r� rw rw rx r� @ s zParserElement.__str__c C s t | �S )N)r� )r� rw rw rx r� C s zParserElement.__repr__c C s d| _ d | _| S )NT)r_ rU )r� rw rw rx r� F s zParserElement.streamlinec C s d S )Nrw )r� r� rw rw rx �checkRecursionK s z ParserElement.checkRecursionc C s | j g � dS )zj
Check defined expressions for valid structure, check for infinite recursive definitions.
N)r� )r� �
validateTracerw rw rx �validateN s zParserElement.validatec C s� y |j � }W n2 tk
r> t|d��}|j � }W dQ R X Y nX y | j||�S tk
r| } ztjrh� n|�W Y dd}~X nX dS )z�
Execute the parse expression on the given file or filename.
If a filename is specified (instead of a file object),
the entire file is opened, read, and closed before parsing.
�rN)�readr� �openr� r r$ r� )r� Zfile_or_filenamer� Z
file_contents�fr3 rw rw rx � parseFileT s zParserElement.parseFilec sH t |t�r"| |kp t| �t|�kS t |t�r6| j|�S tt| �|kS d S )N)rz r$ �varsr� r� �super)r� r� )rH rw rx �__eq__h s
zParserElement.__eq__c C s
| |k S )Nrw )r� r� rw rw rx �__ne__p s zParserElement.__ne__c C s t t| ��S )N)�hash�id)r� rw rw rx �__hash__s s zParserElement.__hash__c C s | |kS )Nrw )r� r� rw rw rx �__req__v s zParserElement.__req__c C s
| |k S )Nrw )r� r� rw rw rx �__rne__y s zParserElement.__rne__c C s0 y| j t|�|d� dS tk
r* dS X dS )a�
Method for quick testing of a parser against a test string. Good for simple
inline microtests of sub expressions while building up larger parser.
Parameters:
- testString - to test against this expression for a match
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
Example::
expr = Word(nums)
assert expr.matches("100")
)r� TFN)r� r� r )r� Z
testStringr� rw rw rx r� | s
zParserElement.matches�#c C s� t |t�r"tttj|j� j� ��}t |t�r4t|�}g }g }d} �x�|D �]�}
|dk rb|j |
d�sl|rx|
rx|j
|
� qH|
s~qHdj |�|
g} g }y:|
j dd�}
| j
|
|d�} | j
| j|d�� | o�| } W n� tk
�rx }
z�t |
t�r�dnd }d|
k�r0| j
t|
j|
�� | j
d
t|
j|
�d d | � n| j
d
|
j d | � | j
d
t|
� � | �ob|} |
} W Y dd}
~
X nD tk
�r� } z&| j
dt|� � | �o�|} |} W Y dd}~X nX |�r�|�r�| j
d � tdj | �� |j
|
| f� qHW | |fS )a3
Execute the parse expression on a series of test strings, showing each
test, the parsed results or where the parse failed. Quick and easy way to
run a parse expression against a list of sample strings.
Parameters:
- tests - a list of separate test strings, or a multiline string of test strings
- parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
- comment - (default=C{'#'}) - expression for indicating embedded comments in the test
string; pass None to disable comment filtering
- fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
if False, only dump nested list
- printResults - (default=C{True}) prints test output to stdout
- failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
Returns: a (success, results) tuple, where success indicates that all tests succeeded
(or failed if C{failureTests} is True), and the results contain a list of lines of each
test's output
Example::
number_expr = pyparsing_common.number.copy()
result = number_expr.runTests('''
# unsigned integer
100
# negative integer
-100
# float with scientific notation
6.02e23
# integer with scientific notation
1e-12
''')
print("Success" if result[0] else "Failed!")
result = number_expr.runTests('''
# stray character
100Z
# missing leading digit before '.'
-.100
# too many '.'
3.14.159
''', failureTests=True)
print("Success" if result[0] else "Failed!")
prints::
# unsigned integer
100
[100]
# negative integer
-100
[-100]
# float with scientific notation
6.02e23
[6.02e+23]
# integer with scientific notation
1e-12
[1e-12]
Success
# stray character
100Z
^
FAIL: Expected end of text (at char 3), (line:1, col:4)
# missing leading digit before '.'
-.100
^
FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
# too many '.'
3.14.159
^
FAIL: Expected end of text (at char 4), (line:1, col:5)
Success
Each test string must be on a single line. If you want to test a string that spans multiple
lines, create a test like this::
expr.runTest(r"this is a test\n of strings that spans \n 3 lines")
(Note that this is a raw string literal, you must include the leading 'r'.)
TNFr z\n)r� )r z(FATAL)r� � rr �^zFAIL: zFAIL-EXCEPTION: )rz r� r� rv r{ r� �rstrip�
splitlinesr r� r� r� r� r� r r r! rG r� r9 rK r, )r� Ztestsr� ZcommentZfullDumpZ printResultsZ failureTestsZ
allResultsZcomments�successrv r �resultr� rz r3 rw rw rx �runTests� sN W
$
zParserElement.runTests)F)F)T)T)TT)TT)r� )F)N)T)F)T)Tr� TTF)Or� r� r� r� rN r� � staticmethodrP rR r� r� ri rm ru r� rx r~ r r� r� r� r� r� r� r� r� r� r� r� r� r r� r� r� rt r� r� r� r� �_MAX_INTr� r� r� r� r r r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� �
__classcell__rw rw )rH rx r$ 8 s�
&
H
"
2G+ D
)
c s e Zd ZdZ� fdd�Z� ZS )r, zT
Abstract C{ParserElement} subclass, for defining atomic matching patterns.
c s t t| �jdd� d S )NF)rg )r� r, r� )r� )rH rw rx r� s zToken.__init__)r� r� r� r� r� r� rw rw )rH rx r, s c s e Zd ZdZ� fdd�Z� ZS )r
z,
An empty token, will always match.
c s$ t t| �j� d| _d| _d| _d S )Nr
TF)r� r
r� r� r[ r` )r� )rH rw rx r� s zEmpty.__init__)r� r� r� r� r� r� rw rw )rH rx r
s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r z(
A token that will never match.
c s* t t| �j� d| _d| _d| _d| _d S )Nr TFzUnmatchable token)r� r r� r� r[ r` ra )r� )rH rw rx r� * s
zNoMatch.__init__Tc C s t ||| j| ��d S )N)r ra )r� r- r� ro rw rw rx r� 1 s zNoMatch.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r & s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Token to exactly match a specified string.
Example::
Literal('blah').parseString('blah') # -> ['blah']
Literal('blah').parseString('blahfooblah') # -> ['blah']
Literal('blah').parseString('bla') # -> Exception: Expected "blah"
For case-insensitive matching, use L{CaselessLiteral}.
For keyword matching (force word break before and after the matched string),
use L{Keyword} or L{CaselessKeyword}.
c s� t t| �j� || _t|�| _y|d | _W n* tk
rV tj dt
dd� t | _ Y nX dt
| j� | _d| j | _d| _d| _d S )Nr z2null string passed to Literal; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �matchr� �matchLen�firstMatchCharr� r� r� r� r
rH r� r� ra r[ r` )r� � matchString)rH rw rx r� C s
zLiteral.__init__Tc C sJ || | j kr6| jdks&|j| j|�r6|| j | jfS t||| j| ��d S )Nrr )r� r� �
startswithr� r ra )r� r- r� ro rw rw rx r� V s zLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r 5 s
c sL e Zd ZdZed Zd� fdd� Zddd �Z� fd
d �Ze d d
� �Z
� Z S )r a\
Token to exactly match a specified string as a keyword, that is, it must be
immediately followed by a non-keyword character. Compare with C{L{Literal}}:
- C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
- C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
Accepts two optional constructor arguments in addition to the keyword string:
- C{identChars} is a string of characters that would be valid identifier characters,
defaulting to all alphanumerics + "_" and "$"
- C{caseless} allows case-insensitive matching, default is C{False}.
Example::
Keyword("start").parseString("start") # -> ['start']
Keyword("start").parseString("starting") # -> Exception
For case-insensitive matching, use L{CaselessKeyword}.
z_$NFc s� t t| �j� |d kr tj}|| _t|�| _y|d | _W n$ tk
r^ t j
dt dd� Y nX d| j | _ d| j | _
d| _d| _|| _|r�|j� | _|j� }t|�| _d S )Nr z2null string passed to Keyword; use Empty() insteadrq )r� z"%s"z Expected F)r� r r� �DEFAULT_KEYWORD_CHARSr� r� r� r� r� r� r� r� r� ra r[ r` �caseless�upper�
caselessmatchr� �
identChars)r� r� r� r� )rH rw rx r� q s&
zKeyword.__init__Tc C s | j r||||| j � j� | jkr�|t|�| j ksL||| j j� | jkr�|dksj||d j� | jkr�|| j | jfS nv|| | jkr�| jdks�|j| j|�r�|t|�| j ks�||| j | jkr�|dks�||d | jkr�|| j | jfS t ||| j
| ��d S )Nr rr ) r� r� r� r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s * &zKeyword.parseImplc s t t| �j� }tj|_|S )N)r� r r� r� r� )r� r� )rH rw rx r� � s z Keyword.copyc C s
| t _dS )z,Overrides the default Keyword chars
N)r r� )rO rw rw rx �setDefaultKeywordChars� s z Keyword.setDefaultKeywordChars)NF)T) r� r� r� r� r3 r� r� r� r� r� r� r� rw rw )rH rx r ^ s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r al
Token to match a specified string, ignoring case of letters.
Note: the matched results will always be in the case of the given
match string, NOT the case of the input text.
Example::
OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
(Contrast with example for L{CaselessKeyword}.)
c s6 t t| �j|j� � || _d| j | _d| j | _d S )Nz'%s'z Expected )r� r r� r� � returnStringr� ra )r� r� )rH rw rx r� � s zCaselessLiteral.__init__Tc C s@ |||| j � j� | jkr,|| j | jfS t||| j| ��d S )N)r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s zCaselessLiteral.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
r z�
Caseless version of L{Keyword}.
Example::
OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
(Contrast with example for L{CaselessLiteral}.)
Nc s t t| �j||dd� d S )NT)r� )r� r r� )r� r� r� )rH rw rx r� � s zCaselessKeyword.__init__Tc C sj |||| j � j� | jkrV|t|�| j ksF||| j j� | jkrV|| j | jfS t||| j| ��d S )N)r� r� r� r� r� r� r ra )r� r- r� ro rw rw rx r� � s *zCaselessKeyword.parseImpl)N)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s, e Zd ZdZd� fdd� Zd dd�Z� ZS )
rl ax
A variation on L{Literal} which matches "close" matches, that is,
strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
- C{match_string} - string to be matched
- C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
The results from a successful parse will contain the matched text from the input string and the following named results:
- C{mismatches} - a list of the positions within the match_string where mismatches were found
- C{original} - the original match_string used to compare against the input string
If C{mismatches} is an empty list, then the match was an exact match.
Example::
patt = CloseMatch("ATCATCGAATGGA")
patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
# exact match
patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
# close match allowing up to 2 mismatches
patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
rr c sB t t| �j� || _|| _|| _d| j| jf | _d| _d| _d S )Nz&Expected %r (with up to %d mismatches)F) r� rl r� r� � match_string�
maxMismatchesra r` r[ )r� r� r� )rH rw rx r� � s zCloseMatch.__init__Tc C s� |}t |�}|t | j� }||kr�| j}d}g } | j}
x�tt|||� | j��D ]0\}} | \} }
| |
krP| j|� t | �|
krPP qPW |d }t|||� g�}| j|d< | |d< ||fS t||| j| ��d S )Nr rr �original�
mismatches) r� r� r� r� r� r� r" r ra )r� r- r� ro �startr� �maxlocr� Zmatch_stringlocr� r� Zs_m�src�mat�resultsrw rw rx r� � s( "
zCloseMatch.parseImpl)rr )T)r� r� r� r� r� r� r� rw rw )rH rx rl � s c s8 e Zd ZdZd
� fdd� Zdd d
�Z� fd d �Z� ZS )r/ a
Token for matching words composed of allowed character sets.
Defined with string containing all allowed initial characters,
an optional string containing allowed body characters (if omitted,
defaults to the initial character set), and an optional minimum,
maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction. An optional
C{excludeChars} parameter can list characters that might be found in
the input C{bodyChars} string; useful to define a word of all printables
except for one or two characters, for instance.
L{srange} is useful for defining custom character set strings for defining
C{Word} expressions, using range notation from regular expression character sets.
A common mistake is to use C{Word} to match a specific literal string, as in
C{Word("Address")}. Remember that C{Word} uses the string argument to define
I{sets} of matchable characters. This expression would match "Add", "AAA",
"dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
To match an exact literal string, use L{Literal} or L{Keyword}.
pyparsing includes helper strings for building Words:
- L{alphas}
- L{nums}
- L{alphanums}
- L{hexnums}
- L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
- L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
- L{printables} (any non-whitespace character)
Example::
# a word composed of digits
integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
# a word with a leading capital, and zero or more lowercase
capital_word = Word(alphas.upper(), alphas.lower())
# hostnames are alphanumeric, with leading alpha, and '-'
hostname = Word(alphas, alphanums+'-')
# roman numeral (not a strict parser, accepts invalid mix of characters)
roman = Word("IVXLCDM")
# any string of non-whitespace characters, except for ','
csv_value = Word(printables, excludeChars=",")
Nrr r Fc s� t t| �j� � rFdj� fdd�|D ��}|rFdj� fdd�|D ��}|| _t|�| _|rl|| _t|�| _n|| _t|�| _|dk| _ |dk r�t
d��|| _ |dkr�|| _ nt
| _ |dkr�|| _ || _ t| �| _d| j | _d | _|| _d
| j| j k�r�|dk�r�|dk�r�|dk�r�| j| jk�r8d t| j� | _nHt| j�dk�rfd tj| j�t| j�f | _nd
t| j�t| j�f | _| j�r�d| j d | _ytj| j�| _W n tk
�r� d | _Y nX d S )Nr� c 3 s | ]}|� kr|V qd S )Nrw )r� r� )� excludeCharsrw rx r� 7
s z Word.__init__.<locals>.<genexpr>c 3 s | ]}|� kr|V qd S )Nrw )r� r� )r� rw rx r� 9
s r rr zZcannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permittedz Expected Fr� z[%s]+z%s[%s]*z [%s][%s]*z\b)r� r/ r� r� �
initCharsOrigr� � initChars�
bodyCharsOrig� bodyChars� maxSpecifiedr� �minLen�maxLenr� r� r� ra r` � asKeyword�_escapeRegexRangeChars�reStringr� rd �escape�compilerK )r� r r �min�max�exactr r� )rH )r� rx r� 4
sT
0
z
Word.__init__Tc
C sD | j r<| j j||�}|s(t||| j| ��|j� }||j� fS || | jkrZt||| j| ��|}|d7 }t|�}| j}|| j }t
||�}x ||k r�|| |kr�|d7 }q�W d} || | j k r�d} | j r�||k r�|| |kr�d} | j
�r |dk�r||d |k�s||k �r || |k�r d} | �r4t||| j| ��||||� fS )Nrr FTr )rd r� r ra �end�groupr r� r r r r r r )
r� r- r� ro r� r� r� Z bodycharsr� ZthrowExceptionrw rw rx r� j
s6
4zWord.parseImplc st yt t| �j� S tk
r" Y nX | jd krndd� }| j| jkr^d|| j�|| j�f | _nd|| j� | _| jS )Nc S s$ t | �dkr | d d� d S | S d S )N� z...)r� )r� rw rw rx �
charsAsStr�
s z Word.__str__.<locals>.charsAsStrz W:(%s,%s)zW:(%s))r� r/ r� rK rU r� r )r� r )rH rw rx r� �
s
z Word.__str__)Nrr r r FN)T)r� r� r� r� r� r� r� r� rw rw )rH rx r/
s .6
#c sF e Zd ZdZeejd��Zd � fdd� Zd dd�Z � fd d
�Z
� Z S )
r' a�
Token for matching strings that match a given regular expression.
Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as
named parse results.
Example::
realnum = Regex(r"[+-]?\d+\.\d*")
date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
# ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
z[A-Z]r c s� t t| �j� t|t�r�|s,tjdtdd� || _|| _ y t
j | j| j �| _
| j| _ W q� t
jk
r� tjd| tdd� � Y q�X n2t|tj�r�|| _
t|� | _| _ || _ ntd��t| �| _d| j | _d| _d| _d S )
z�The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags.z0null string passed to Regex; use Empty() insteadrq )r� z$invalid pattern (%s) passed to RegexzCRegex may only be constructed with a string or a compiled RE objectz Expected FTN)r� r' r� rz r� r� r� r� �pattern�flagsrd r
r �
sre_constants�error�compiledREtyper{ r� r� r� ra r` r[ )r� r r )rH rw rx r� �
s.
zRegex.__init__Tc C sd | j j||�}|s"t||| j| ��|j� }|j� }t|j� �}|r\x|D ]}|| ||< qHW ||fS )N)rd r� r ra r � groupdictr" r )r� r- r� ro r� �dr� r� rw rw rx r� �
s
zRegex.parseImplc sD yt t| �j� S tk
r" Y nX | jd kr>dt| j� | _| jS )NzRe:(%s))r� r' r� rK rU r� r )r� )rH rw rx r� �
s
z
Regex.__str__)r )T) r� r� r� r� r� rd r
r r� r� r� r� rw rw )rH rx r' �
s
"
c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r% a�
Token for matching strings that are delimited by quoting characters.
Defined with the following parameters:
- quoteChar - string of one or more characters defining the quote delimiting string
- escChar - character to escape quotes, typically backslash (default=C{None})
- escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
- multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
- unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
- endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
- convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
Example::
qs = QuotedString('"')
print(qs.searchString('lsjdf "This is the quote" sldjf'))
complex_qs = QuotedString('{{', endQuoteChar='}}')
print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
sql_qs = QuotedString('"', escQuote='""')
print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
prints::
[['This is the quote']]
[['This is the "quote"']]
[['This is the quote with "embedded" quotes']]
NFTc sN t t� �j� |j� }|s0tjdtdd� t� �|d kr>|}n"|j� }|s`tjdtdd� t� �|� _t |�� _
|d � _ |� _ t |�� _
|� _|� _|� _|� _|r�tjtjB � _dtj� j�t� j d �|d k r�t|�p�df � _n<d� _dtj� j�t� j d �|d k �rt|��p df � _t � j �d k�rp� jd
d j� fd d
�tt � j �d dd�D �� d 7 _|�r�� jdtj|� 7 _|�r�� jdtj|� 7 _tj� j�d � _� jdtj� j � 7 _y tj � j� j�� _� j� _ W n0 t j k
�r& tjd� j tdd� � Y nX t � �� _!d� j! � _"d� _#d� _$d S )Nz$quoteChar cannot be the empty stringrq )r� z'endQuoteChar cannot be the empty stringr z %s(?:[^%s%s]r� z%s(?:[^%s\n\r%s]rr z|(?:z)|(?:c 3 s4 | ],}d t j� jd|� �t� j| �f V qdS )z%s[^%s]N)rd r � endQuoteCharr )r� r� )r� rw rx r� / s z(QuotedString.__init__.<locals>.<genexpr>�)z|(?:%s)z|(?:%s.)z(.)z)*%sz$invalid pattern (%s) passed to Regexz Expected FTrs )%r� r% r� r� r� r� r� � SyntaxError� quoteCharr� � quoteCharLen�firstQuoteCharr �endQuoteCharLen�escChar�escQuote�unquoteResults�convertWhitespaceEscapesrd � MULTILINE�DOTALLr r r r r� r� �escCharReplacePatternr
r r r r� r� ra r` r[ )r� r r r! Z multiliner" r r# )rH )r� rx r� sf
6
zQuotedString.__init__c C s� || | j kr | jj||�p d }|s4t||| j| ��|j� }|j� }| jr�|| j| j � }t
|t �r�d|kr�| j r�ddddd�}x |j
� D ]\}}|j||�}q�W | jr�tj| jd|�}| jr�|j| j| j�}||fS )N�\� r � �
)z\tz\nz\fz\rz\g<1>)r rd r� r ra r r r" r r rz r� r# r� r� r r� r& r! r ) r� r- r� ro r� r� Zws_mapZwslitZwscharrw rw rx r� G s(
zQuotedString.parseImplc sF yt t| �j� S tk
r" Y nX | jd kr@d| j| jf | _| jS )Nz.quoted string, starting with %s ending with %s)r� r% r� rK rU r r )r� )rH rw rx r� j s
zQuotedString.__str__)NNFTNT)T)r� r� r� r� r� r� r� r� rw rw )rH rx r% �
s A
#c s8 e Zd ZdZd � fdd� Zd dd�Z� fd d
�Z� ZS )
r a�
Token for matching words composed of characters I{not} in a given set (will
include whitespace in matched characters if not listed in the provided exclusion set - see example).
Defined with string containing all disallowed characters, and an optional
minimum, maximum, and/or exact length. The default value for C{min} is 1 (a
minimum value < 1 is not valid); the default values for C{max} and C{exact}
are 0, meaning no maximum or exact length restriction.
Example::
# define a comma-separated-value as anything that is not a ','
csv_value = CharsNotIn(',')
print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
prints::
['dkls', 'lsdkjf', 's12 34', '@!#', '213']
rr r c s� t t| �j� d| _|| _|dk r*td��|| _|dkr@|| _nt| _|dkrZ|| _|| _t | �| _
d| j
| _ | jdk| _ d| _
d S )NFrr zfcannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permittedr z Expected )r� r r� rX �notCharsr� r r r� r� r� ra r[ r` )r� r+ r r r
)rH rw rx r� � s
zCharsNotIn.__init__Tc C s� || | j kr t||| j| ��|}|d7 }| j }t|| j t|��}x ||k rd|| |krd|d7 }qFW || | jk r�t||| j| ��||||� fS )Nrr )r+ r ra r r r� r )r� r- r� ro r� Znotchars�maxlenrw rw rx r� � s
zCharsNotIn.parseImplc sd yt t| �j� S tk
r" Y nX | jd kr^t| j�dkrRd| jd d� | _n d| j | _| jS )Nr z
!W:(%s...)z!W:(%s))r� r r� rK rU r� r+ )r� )rH rw rx r� � s
zCharsNotIn.__str__)rr r r )T)r� r� r� r� r� r� r� r� rw rw )rH rx r v s
c s< e Zd ZdZdddddd�Zd� fd d � Zddd�Z� ZS )r. a�
Special matching class for matching whitespace. Normally, whitespace is ignored
by pyparsing grammars. This class is included when some whitespace structures
are significant. Define with a string containing the whitespace characters to be
matched; default is C{" \t\r\n"}. Also takes optional C{min}, C{max}, and C{exact} arguments,
as defined for the C{L{Word}} class.
z<SPC>z<TAB>z<LF>z<CR>z<FF>)r� r( r r* r) �
rr r c s� t t� �j� |� _� jdj� fdd�� jD ��� djdd� � jD ��� _d� _d� j � _ |� _
|dkrt|� _ nt � _ |dkr�|� _ |� _
d S )Nr� c 3 s | ]}|� j kr|V qd S )N)�
matchWhite)r� r� )r� rw rx r� � s z!White.__init__.<locals>.<genexpr>c s s | ]}t j| V qd S )N)r. � whiteStrs)r� r� rw rw rx r� � s Tz Expected r )
r� r. r� r. r� r� rY r� r[ ra r r r� )r� Zwsr r r
)rH )r� rx r� � s zWhite.__init__Tc C s� || | j kr t||| j| ��|}|d7 }|| j }t|t|��}x"||k rd|| | j krd|d7 }qDW || | jk r�t||| j| ��||||� fS )Nrr )r. r ra r r r� r )r� r- r� ro r� r� rw rw rx r� � s
zWhite.parseImpl)r- rr r r )T)r� r� r� r� r/ r� r� r� rw rw )rH rx r. � s c s e Zd Z� fdd�Z� ZS )�_PositionTokenc s( t t| �j� | jj| _d| _d| _d S )NTF)r� r0 r� rH r� r� r[ r` )r� )rH rw rx r� � s
z_PositionToken.__init__)r� r� r� r� r� rw rw )rH rx r0 � s r0 c s2 e Zd ZdZ� fdd�Zdd� Zd dd�Z� ZS )
r zb
Token to advance to a specific column of input text; useful for tabular report scraping.
c s t t| �j� || _d S )N)r� r r� r9 )r� �colno)rH rw rx r� � s zGoToColumn.__init__c C s` t ||�| j kr\t|�}| jr*| j||�}x0||k rZ|| j� rZt ||�| j krZ|d7 }q,W |S )Nrr )r9 r� r] r� �isspace)r� r- r� r� rw rw rx r� � s & zGoToColumn.preParseTc C sD t ||�}|| j kr"t||d| ��|| j | }|||� }||fS )NzText not in expected column)r9 r )r� r- r� ro ZthiscolZnewlocr� rw rw rx r� s
zGoToColumn.parseImpl)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Matches if current position is at the beginning of a line within the parse string
Example::
test = ''' AAA this line
AAA and this line
AAA but not this one
B AAA and definitely not this one
'''
for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
print(t)
Prints::
['AAA', ' this line']
['AAA', ' and this line']
c s t t| �j� d| _d S )NzExpected start of line)r� r r� ra )r� )rH rw rx r� & s zLineStart.__init__Tc C s* t ||�dkr|g fS t||| j| ��d S )Nrr )r9 r ra )r� r- r� ro rw rw rx r� * s zLineStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r zU
Matches if current position is at the end of a line within the parse string
c s, t t| �j� | jtjjdd�� d| _d S )Nr r� zExpected end of line)r� r r� r� r$ rN r� ra )r� )rH rw rx r� 3 s zLineEnd.__init__Tc C sb |t |�k r6|| dkr$|d dfS t||| j| ��n(|t |�krN|d g fS t||| j| ��d S )Nr rr )r� r ra )r� r- r� ro rw rw rx r� 8 s zLineEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r / s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r* zM
Matches if current position is at the beginning of the parse string
c s t t| �j� d| _d S )NzExpected start of text)r� r* r� ra )r� )rH rw rx r� G s zStringStart.__init__Tc C s0 |dkr(|| j |d�kr(t||| j| ��|g fS )Nr )r� r ra )r� r- r� ro rw rw rx r� K s zStringStart.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r* C s c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r) zG
Matches if current position is at the end of the parse string
c s t t| �j� d| _d S )NzExpected end of text)r� r) r� ra )r� )rH rw rx r� V s zStringEnd.__init__Tc C s^ |t |�k r t||| j| ��n<|t |�kr6|d g fS |t |�krJ|g fS t||| j| ��d S )Nrr )r� r ra )r� r- r� ro rw rw rx r� Z s zStringEnd.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r) R s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r1 ap
Matches if the current position is at the beginning of a Word, and
is not preceded by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
the string being parsed, or at the beginning of a line.
c s" t t| �j� t|�| _d| _d S )NzNot at the start of a word)r� r1 r� r� � wordCharsra )r� r3 )rH rw rx r� l s
zWordStart.__init__Tc C s@ |dkr8||d | j ks(|| | j kr8t||| j| ��|g fS )Nr rr )r3 r ra )r� r- r� ro rw rw rx r� q s
zWordStart.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r1 d s c s. e Zd ZdZef� fdd� Zddd�Z� ZS )r0 aZ
Matches if the current position is at the end of a Word, and
is not followed by any character in a given set of C{wordChars}
(default=C{printables}). To emulate the C{} behavior of regular expressions,
use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
the string being parsed, or at the end of a line.
c s( t t| �j� t|�| _d| _d| _d S )NFzNot at the end of a word)r� r0 r� r� r3 rX ra )r� r3 )rH rw rx r� � s
zWordEnd.__init__Tc C sP t |�}|dkrH||k rH|| | jks8||d | jkrHt||| j| ��|g fS )Nr rr )r� r3 r ra )r� r- r� ro r� rw rw rx r� � s zWordEnd.parseImpl)T)r� r� r� r� rV r� r� r� rw rw )rH rx r0 x s c s� e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Z� fd d �Z� fd
d�Z � fdd�Z
d� fdd� Z g fdd�Z � fdd�Z
� ZS )r z^
Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r"t|�}t|t�r<tj|�g| _ njt|t
j �rzt|�}t dd� |D ��rnt
tj|�}t|�| _ n,yt|�| _ W n tk
r� |g| _ Y nX d| _d S )Nc s s | ]}t |t�V qd S )N)rz r� )r� r. rw rw rx r� � s z+ParseExpression.__init__.<locals>.<genexpr>F)r� r r� rz r� r� r� r$ rQ �exprsr� �Iterable�allrv r� re )r� r4 rg )rH rw rx r� � s
zParseExpression.__init__c C s
| j | S )N)r4 )r� r� rw rw rx r� � s zParseExpression.__getitem__c C s | j j|� d | _| S )N)r4 r� rU )r� r� rw rw rx r� � s zParseExpression.appendc C s4 d| _ dd� | jD �| _x| jD ] }|j� q W | S )z~Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
all contained expressions.Fc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z3ParseExpression.leaveWhitespace.<locals>.<listcomp>)rX r4 r� )r� r� rw rw rx r� � s
z ParseExpression.leaveWhitespacec sz t |t�rF|| jkrvtt| �j|� xP| jD ]}|j| jd � q,W n0tt| �j|� x | jD ]}|j| jd � q^W | S )Nrr rs rs )rz r+ r] r� r r� r4 )r� r� r� )rH rw rx r� � s
zParseExpression.ignorec sL yt t| �j� S tk
r" Y nX | jd krFd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU rH r� r� r4 )r� )rH rw rx r� � s
zParseExpression.__str__c s0 t t| �j� x| jD ] }|j� qW t| j�dk�r | jd }t|| j�r�|j r�|jd kr�|j r�|jd d � | jd g | _d | _
| j |j O _ | j |j O _ | jd }t|| j�o�|j o�|jd ko�|j �r | jd d� |jd d � | _d | _
| j |j O _ | j |j O _ dt
| � | _| S )Nrq r rr z Expected rs rs )r� r r� r4 r� rz rH rS rV r^ rU r[ r` r� ra )r� r� r� )rH rw rx r� � s0
zParseExpression.streamlinec s t t| �j||�}|S )N)r� r rm )r� r� rl r� )rH rw rx rm � s z ParseExpression.setResultsNamec C s: |d d � | g }x| j D ]}|j|� qW | jg � d S )N)r4 r� r� )r� r� �tmpr� rw rw rx r� � s zParseExpression.validatec s$ t t| �j� }dd� | jD �|_|S )Nc S s g | ] }|j � �qS rw )r� )r� r� rw rw rx r� � s z(ParseExpression.copy.<locals>.<listcomp>)r� r r� r4 )r� r� )rH rw rx r� � s zParseExpression.copy)F)F)r� r� r� r� r� r� r� r� r� r� r� rm r� r� r� rw rw )rH rx r � s
" c sT e Zd ZdZG dd� de�Zd� fdd� Zddd�Zd d
� Zd d � Z d
d� Z
� Z S )r a
Requires all given C{ParseExpression}s to be found in the given order.
Expressions may be separated by whitespace.
May be constructed using the C{'+'} operator.
May also be constructed using the C{'-'} operator, which will suppress backtracking.
Example::
integer = Word(nums)
name_expr = OneOrMore(Word(alphas))
expr = And([integer("id"),name_expr("name"),integer("age")])
# more easily written as:
expr = integer("id") + name_expr("name") + integer("age")
c s e Zd Z� fdd�Z� ZS )zAnd._ErrorStopc s& t tj| �j||� d| _| j� d S )N�-)r� r r� r� r� r� )r� r� r� )rH rw rx r�
s zAnd._ErrorStop.__init__)r� r� r� r� r� rw rw )rH rx r�
s r� Tc sR t t| �j||� tdd� | jD ��| _| j| jd j� | jd j| _d| _ d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r�
s z And.__init__.<locals>.<genexpr>r T)
r� r r� r6 r4 r[ r� rY rX re )r� r4 rg )rH rw rx r�
s
z And.__init__c C s | j d j|||dd�\}}d}x�| j dd � D ]�}t|tj�rFd}q0|r�y|j|||�\}}W q� tk
rv � Y q� tk
r� } zd |_tj|��W Y d d }~X q� t k
r� t|t
|�| j | ��Y q�X n|j|||�\}}|s�|j � r0||7 }q0W ||fS )Nr F)rp rr T)
r4 rt rz r r� r# r �
__traceback__r� r� r� ra r� ) r� r- r� ro �
resultlistZ errorStopr� Z
exprtokensr� rw rw rx r�
s( z
And.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx r 5
s
z And.__iadd__c C s8 |d d � | g }x | j D ]}|j|� |jsP qW d S )N)r4 r� r[ )r� r� �subRecCheckListr� rw rw rx r� :
s
zAnd.checkRecursionc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� �{r� c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� F
s z And.__str__.<locals>.<genexpr>�})r� r� rU r� r4 )r� rw rw rx r� A
s
z And.__str__)T)T) r� r� r� r� r
r� r� r� r r� r� r� rw rw )rH rx r � s
c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the expression that matches the longest string will be used.
May be constructed using the C{'^'} operator.
Example::
# construct Or using '^' operator
number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789"))
prints::
[['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� \
s z Or.__init__.<locals>.<genexpr>T)r� r r� r4 r r[ )r� r4 rg )rH rw rx r� Y
s z Or.__init__Tc C sT d}d }g }x�| j D ]�}y|j||�}W nv tk
rd } z d | _| j|krT| }| j}W Y d d } ~ X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX |j||f� qW |�r*|j dd� d� x`|D ]X\}
}y|j
|||�S tk
�r$ } z"d | _| j|k�r| }| j}W Y d d } ~ X q�X q�W |d k �rB| j|_ |�nt||d| ��d S )Nrr c S s
| d S )Nr rw )�xrw rw rx ry u
s z Or.parseImpl.<locals>.<lambda>)r� z no defined alternatives to matchrs ) r4 r� r r9 r� r� r� ra r� �sortrt r� ) r� r- r� ro � maxExcLoc� maxExceptionr� r� Zloc2r� �_rw rw rx r� `
s<
z Or.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ixor__�
s
z Or.__ixor__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r< z ^ c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z Or.__str__.<locals>.<genexpr>r= )r� r� rU r� r4 )r� rw rw rx r� �
s
z
Or.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r4 r� )r� r� r; r� rw rw rx r� �
s zOr.checkRecursion)F)T)
r� r� r� r� r� r� rC r� r� r� rw rw )rH rx r K
s
& c sD e Zd ZdZd� fdd� Zddd�Zdd � Zd
d � Zd d
� Z� Z S )r a�
Requires that at least one C{ParseExpression} is found.
If two expressions match, the first one listed is the one that will match.
May be constructed using the C{'|'} operator.
Example::
# construct MatchFirst using '|' operator
# watch the order of expressions to match
number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']]
# put more selective expression first
number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']]
Fc s: t t| �j||� | jr0tdd� | jD ��| _nd| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� �
s z&MatchFirst.__init__.<locals>.<genexpr>T)r� r r� r4 r r[ )r� r4 rg )rH rw rx r� �
s zMatchFirst.__init__Tc C s� d}d }x�| j D ]�}y|j|||�}|S tk
r\ } z|j|krL|}|j}W Y d d }~X q tk
r� t|�|kr�t|t|�|j| �}t|�}Y qX qW |d k r�| j|_|�nt||d| ��d S )Nrr z no defined alternatives to matchrs )r4 rt r r� r� r� ra r� ) r� r- r� ro r@ rA r� r� r� rw rw rx r� �
s$
zMatchFirst.parseImplc C s t |t�rtj|�}| j|�S )N)rz r� r$ rQ r� )r� r� rw rw rx �__ior__�
s
zMatchFirst.__ior__c C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r< z | c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� �
s z%MatchFirst.__str__.<locals>.<genexpr>r= )r� r� rU r� r4 )r� rw rw rx r� �
s
zMatchFirst.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r4 r� )r� r� r; r� rw rw rx r� �
s zMatchFirst.checkRecursion)F)T)
r� r� r� r� r� r� rD r� r� r� rw rw )rH rx r �
s
c s< e Zd ZdZd � fdd� Zd dd�Zdd� Zd d
� Z� ZS )
r am
Requires all given C{ParseExpression}s to be found, but in any order.
Expressions may be separated by whitespace.
May be constructed using the C{'&'} operator.
Example::
color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
integer = Word(nums)
shape_attr = "shape:" + shape_type("shape")
posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
color_attr = "color:" + color("color")
size_attr = "size:" + integer("size")
# use Each (using operator '&') to accept attributes in any order
# (shape and posn are required, color and size are optional)
shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
shape_spec.runTests('''
shape: SQUARE color: BLACK posn: 100, 120
shape: CIRCLE size: 50 color: BLUE posn: 50,80
color:GREEN size:20 shape:TRIANGLE posn:20,40
'''
)
prints::
shape: SQUARE color: BLACK posn: 100, 120
['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
- color: BLACK
- posn: ['100', ',', '120']
- x: 100
- y: 120
- shape: SQUARE
shape: CIRCLE size: 50 color: BLUE posn: 50,80
['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
- color: BLUE
- posn: ['50', ',', '80']
- x: 50
- y: 80
- shape: CIRCLE
- size: 50
color: GREEN size: 20 shape: TRIANGLE posn: 20,40
['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
- color: GREEN
- posn: ['20', ',', '40']
- x: 20
- y: 40
- shape: TRIANGLE
- size: 20
Tc s8 t t| �j||� tdd� | jD ��| _d| _d| _d S )Nc s s | ] }|j V qd S )N)r[ )r� r� rw rw rx r� s z Each.__init__.<locals>.<genexpr>T)r� r r� r6 r4 r[ rX �initExprGroups)r� r4 rg )rH rw rx r� s z
Each.__init__c
s� | j r�tdd� | jD ��| _dd� | jD �}dd� | jD �}|| | _dd� | jD �| _dd� | jD �| _dd� | jD �| _| j| j7 _d | _ |}| jd d � }| jd d � � g }d
} x�| �rp|� | j | j }
g } x~|
D ]v} y| j||�}W n t k
�r | j
| � Y q�X |j
| jj t | �| �� | |k�rD|j
| � q�| � kr� j
| � q�W t| �t|
�kr�d } q�W |�r�d jd d� |D ��}
t ||d
|
��|� fdd�| jD �7 }g }x*|D ]"} | j|||�\}}|j
|� �q�W t|tg ��}||fS )Nc s s& | ] }t |t�rt|j�|fV qd S )N)rz r r� r. )r� r� rw rw rx r� s z!Each.parseImpl.<locals>.<genexpr>c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� s z"Each.parseImpl.<locals>.<listcomp>c S s" g | ]}|j rt|t� r|�qS rw )r[ rz r )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r2 r. )r� r� rw rw rx r� s c S s g | ]}t |t�r|j�qS rw )rz r r. )r� r� rw rw rx r� ! s c S s g | ]}t |tttf�s|�qS rw )rz r r2 r )r� r� rw rw rx r� " s FTz, c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� = s z*Missing one or more required elements (%s)c s$ g | ] }t |t�r|j� kr|�qS rw )rz r r. )r� r� )�tmpOptrw rx r� A s )rE r� r4 Zopt1mapZ optionalsZmultioptionalsZ
multirequiredZrequiredr� r r� r� r� �remover� r� rt �sumr" )r� r- r� ro Zopt1Zopt2ZtmpLocZtmpReqdZ
matchOrderZ keepMatchingZtmpExprsZfailedr� Zmissingr: r� Z finalResultsrw )rF rx r� sP
zEach.parseImplc C s@ t | d�r| jS | jd kr:ddjdd� | jD �� d | _| jS )Nr� r< z & c s s | ]}t |�V qd S )N)r� )r� r� rw rw rx r� P s z Each.__str__.<locals>.<genexpr>r= )r� r� rU r� r4 )r� rw rw rx r� K s
z Each.__str__c C s0 |d d � | g }x| j D ]}|j|� qW d S )N)r4 r� )r� r� r; r� rw rw rx r� T s zEach.checkRecursion)T)T) r� r� r� r� r� r� r� r� r� rw rw )rH rx r �
s
5
1 c sl e Zd ZdZd� fdd� Zddd�Zdd � Z� fd
d �Z� fd d
�Zdd� Z g fdd�Z
� fdd�Z � Z S )r za
Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
Fc s� t t| �j|� t|t�r@ttjt�r2tj|�}ntjt |��}|| _
d | _ |d k r�|j | _ |j
| _
| j|j� |j| _|j| _|j| _| jj|j� d S )N)r� r r� rz r� �
issubclassr$ rQ r, r r. rU r` r[ r� rY rX rW re r] r� )r� r. rg )rH rw rx r� ^ s
z ParseElementEnhance.__init__Tc C s2 | j d k r | j j|||dd�S td|| j| ��d S )NF)rp r� )r. rt r ra )r� r- r� ro rw rw rx r� p s
z ParseElementEnhance.parseImplc C s* d| _ | jj� | _| jd k r&| jj� | S )NF)rX r. r� r� )r� rw rw rx r� v s
z#ParseElementEnhance.leaveWhitespacec sr t |t�rB|| jkrntt| �j|� | jd k rn| jj| jd � n,tt| �j|� | jd k rn| jj| jd � | S )Nrr rs rs )rz r+ r] r� r r� r. )r� r� )rH rw rx r� } s
zParseElementEnhance.ignorec s& t t| �j� | jd k r"| jj� | S )N)r� r r� r. )r� )rH rw rx r� � s
z ParseElementEnhance.streamlinec C sB | |krt || g ��|d d � | g }| jd k r>| jj|� d S )N)r& r. r� )r� r� r; rw rw rx r� � s
z"ParseElementEnhance.checkRecursionc C s6 |d d � | g }| j d k r(| j j|� | jg � d S )N)r. r� r� )r� r� r7 rw rw rx r� � s
z ParseElementEnhance.validatec sV yt t| �j� S tk
r" Y nX | jd krP| jd k rPd| jjt| j�f | _| jS )Nz%s:(%s)) r� r r� rK rU r. rH r� r� )r� )rH rw rx r� � s zParseElementEnhance.__str__)F)T)
r� r� r� r� r� r� r� r� r� r� r� r� r� rw rw )rH rx r Z s
c s* e Zd ZdZ� fdd�Zddd�Z� ZS )r a�
Lookahead matching of the given parse expression. C{FollowedBy}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression matches at the current
position. C{FollowedBy} always returns a null token list.
Example::
# use FollowedBy to match a label only if it is followed by a ':'
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
prints::
[['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
c s t t| �j|� d| _d S )NT)r� r r� r[ )r� r. )rH rw rx r� � s zFollowedBy.__init__Tc C s | j j||� |g fS )N)r. r� )r� r- r� ro rw rw rx r� � s zFollowedBy.parseImpl)T)r� r� r� r� r� r� r� rw rw )rH rx r � s c s2 e Zd ZdZ� fdd�Zd dd�Zdd� Z� ZS )
r a�
Lookahead to disallow matching with the given parse expression. C{NotAny}
does I{not} advance the parsing position within the input string, it only
verifies that the specified parse expression does I{not} match at the current
position. Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
always returns a null token list. May be constructed using the '~' operator.
Example::
c s0 t t| �j|� d| _d| _dt| j� | _d S )NFTzFound unwanted token, )r� r r� rX r[ r� r. ra )r� r. )rH rw rx r� � s zNotAny.__init__Tc C s& | j j||�r t||| j| ��|g fS )N)r. r� r ra )r� r- r� ro rw rw rx r� � s zNotAny.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� z~{r= )r� r� rU r� r. )r� rw rw rx r� � s
zNotAny.__str__)T)r� r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd Zd� fdd� Zddd�Z� ZS ) �_MultipleMatchNc sF t t| �j|� d| _|}t|t�r.tj|�}|d k r<| nd | _d S )NT) r� rJ r� rW rz r� r$ rQ � not_ender)r� r. �stopOnZender)rH rw rx r� � s
z_MultipleMatch.__init__Tc C s� | j j}| j}| jd k }|r$| jj}|r2|||� ||||dd�\}}yZ| j } xJ|rb|||� | rr|||�}
n|}
|||
|�\}} | s�| j� rT|| 7 }qTW W n ttfk
r� Y nX ||fS )NF)rp ) r. rt r� rK r� r] r� r r� ) r� r- r� ro Zself_expr_parseZself_skip_ignorablesZ check_enderZ
try_not_enderr� ZhasIgnoreExprsr� Z tmptokensrw rw rx r� � s,
z_MultipleMatch.parseImpl)N)T)r� r� r� r� r� r� rw rw )rH rx rJ � s rJ c @ s e Zd ZdZdd� ZdS )r a�
Repetition of one or more of the given expression.
Parameters:
- expr - expression that must match one or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: BLACK"
OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
# use stopOn attribute for OneOrMore to avoid reading label string as part of the data
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
# could also be written as
(attr_expr * (1,)).parseString(text).pprint()
c C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r< z}...)r� r� rU r� r. )r� rw rw rx r� ! s
zOneOrMore.__str__N)r� r� r� r� r� rw rw rw rx r s c s8 e Zd ZdZd
� fdd� Zd � fdd� Zdd � Z� ZS ) r2 aw
Optional repetition of zero or more of the given expression.
Parameters:
- expr - expression that must match zero or more times
- stopOn - (default=C{None}) - expression for a terminating sentinel
(only required if the sentinel would ordinarily match the repetition
expression)
Example: similar to L{OneOrMore}
Nc s t t| �j||d� d| _d S )N)rL T)r� r2 r� r[ )r� r. rL )rH rw rx r� 6 s zZeroOrMore.__init__Tc s6 yt t| �j|||�S ttfk
r0 |g fS X d S )N)r� r2 r� r r� )r� r- r� ro )rH rw rx r� : s zZeroOrMore.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r z]...)r� r� rU r� r. )r� rw rw rx r� @ s
zZeroOrMore.__str__)N)T)r� r� r� r� r� r� r� r� rw rw )rH rx r2 * s c @ s e Zd Zdd� ZeZdd� ZdS )�
_NullTokenc C s dS )NFrw )r� rw rw rx r� J s z_NullToken.__bool__c C s dS )Nr� rw )r� rw rw rx r� M s z_NullToken.__str__N)r� r� r� r� r' r� rw rw rw rx rM I s rM c s6 e Zd ZdZef� fdd� Zd dd�Zdd� Z� ZS )
r aa
Optional matching of the given expression.
Parameters:
- expr - expression that must match zero or more times
- default (optional) - value to be returned if the optional expression is not found.
Example::
# US postal code can be a 5-digit zip, plus optional 4-digit qualifier
zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
zip.runTests('''
# traditional ZIP code
12345
# ZIP+4 form
12101-0001
# invalid ZIP
98765-
''')
prints::
# traditional ZIP code
12345
['12345']
# ZIP+4 form
12101-0001
['12101-0001']
# invalid ZIP
98765-
^
FAIL: Expected end of text (at char 5), (line:1, col:6)
c s. t t| �j|dd� | jj| _|| _d| _d S )NF)rg T)r� r r� r. rW r� r[ )r� r. r� )rH rw rx r� t s
zOptional.__init__Tc C sz y | j j|||dd�\}}W nT ttfk
rp | jtk rh| j jr^t| jg�}| j|| j j< ql| jg}ng }Y nX ||fS )NF)rp )r. rt r r� r� �_optionalNotMatchedrV r" )r� r- r� ro r� rw rw rx r� z s
zOptional.parseImplc C s4 t | d�r| jS | jd kr.dt| j� d | _| jS )Nr� r r )r� r� rU r� r. )r� rw rw rx r� � s
zOptional.__str__)T) r� r� r� r� rN r� r� r� r� rw rw )rH rx r Q s "
c s, e Zd ZdZd � fdd� Zd
dd�Z� ZS ) r( a�
Token for skipping over all undefined text until the matched expression is found.
Parameters:
- expr - target expression marking the end of the data to be skipped
- include - (default=C{False}) if True, the target expression is also parsed
(the skipped text and target expression are returned as a 2-element list).
- ignore - (default=C{None}) used to define grammars (typically quoted strings and
comments) that might contain false matches to the target expression
- failOn - (default=C{None}) define expressions that are not allowed to be
included in the skipped test; if found before the target expression is found,
the SkipTo is not a match
Example::
report = '''
Outstanding Issues Report - 1 Jan 2000
# | Severity | Description | Days Open
-----+----------+-------------------------------------------+-----------
101 | Critical | Intermittent system crash | 6
94 | Cosmetic | Spelling error on Login ('log|n') | 14
79 | Minor | System slow when running too many reports | 47
'''
integer = Word(nums)
SEP = Suppress('|')
# use SkipTo to simply match everything up until the next SEP
# - ignore quoted strings, so that a '|' character inside a quoted string does not match
# - parse action will call token.strip() for each matched token, i.e., the description body
string_data = SkipTo(SEP, ignore=quotedString)
string_data.setParseAction(tokenMap(str.strip))
ticket_expr = (integer("issue_num") + SEP
+ string_data("sev") + SEP
+ string_data("desc") + SEP
+ integer("days_open"))
for tkt in ticket_expr.searchString(report):
print tkt.dump()
prints::
['101', 'Critical', 'Intermittent system crash', '6']
- days_open: 6
- desc: Intermittent system crash
- issue_num: 101
- sev: Critical
['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
- days_open: 14
- desc: Spelling error on Login ('log|n')
- issue_num: 94
- sev: Cosmetic
['79', 'Minor', 'System slow when running too many reports', '47']
- days_open: 47
- desc: System slow when running too many reports
- issue_num: 79
- sev: Minor
FNc s` t t| �j|� || _d| _d| _|| _d| _t|t �rFt
j |�| _ n|| _ dt
| j� | _d S )NTFzNo match found for )r� r( r� �
ignoreExprr[ r` � includeMatchr� rz r� r$ rQ �failOnr� r. ra )r� r� �includer� rQ )rH rw rx r� � s
zSkipTo.__init__Tc C s, |}t |�}| j}| jj}| jd k r,| jjnd }| jd k rB| jjnd } |}
x�|
|kr�|d k rh|||
�rhP | d k r�x*y| ||
�}
W qr tk
r� P Y qrX qrW y|||
ddd� W n tt fk
r� |
d7 }
Y qLX P qLW t||| j
| ��|
}|||� } t | �} | j �r$||||dd�\}}
| |
7 } || fS )NF)ro rp rr )rp )
r� r. rt rQ r� rO r� r r r� ra r" rP )r� r- r� ro r0 r� r. Z
expr_parseZself_failOn_canParseNextZself_ignoreExpr_tryParseZtmplocZskiptextZ
skipresultr� rw rw rx r� � s<
zSkipTo.parseImpl)FNN)T)r� r� r� r� r� r� r� rw rw )rH rx r( � s 6
c sb e Zd ZdZd� fdd� Zdd� Zdd� Zd d
� Zd d � Zg fd
d�Z dd� Z
� fdd�Z � Z S )r aK
Forward declaration of an expression to be defined later -
used for recursive grammars, such as algebraic infix notation.
When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
Note: take care when assigning to C{Forward} not to overlook precedence of operators.
Specifically, '|' has a lower precedence than '<<', so that::
fwdExpr << a | b | c
will actually be evaluated as::
(fwdExpr << a) | b | c
thereby leaving b and c out as parseable alternatives. It is recommended that you
explicitly group the values inserted into the C{Forward}::
fwdExpr << (a | b | c)
Converting to use the '<<=' operator instead will avoid this problem.
See L{ParseResults.pprint} for an example of a recursive parser created using
C{Forward}.
Nc s t t| �j|dd� d S )NF)rg )r� r r� )r� r� )rH rw rx r� s zForward.__init__c C sj t |t�rtj|�}|| _d | _| jj| _| jj| _| j| jj � | jj
| _
| jj | _ | j j
| jj � | S )N)rz r� r$ rQ r. rU r` r[ r� rY rX rW r] r� )r� r� rw rw rx �
__lshift__ s
zForward.__lshift__c C s | |> S )Nrw )r� r� rw rw rx � __ilshift__' s zForward.__ilshift__c C s
d| _ | S )NF)rX )r� rw rw rx r� * s zForward.leaveWhitespacec C s$ | j s d| _ | jd k r | jj� | S )NT)r_ r. r� )r� rw rw rx r� . s
zForward.streamlinec C s> | |kr0|d d � | g }| j d k r0| j j|� | jg � d S )N)r. r� r� )r� r� r7 rw rw rx r� 5 s
zForward.validatec C s> t | d�r| jS | jjd S d}W d | j| _X | jjd | S )Nr� z: ...�Nonez: )r� r� rH r� Z _revertClass�_ForwardNoRecurser. r� )r� Z retStringrw rw rx r� < s
zForward.__str__c s. | j d k rtt| �j� S t� }|| K }|S d S )N)r. r� r r� )r� r� )rH rw rx r� M s
z Forward.copy)N)
r� r� r� r� r� rS rT r� r� r� r� r� r� rw rw )rH rx r s
c @ s e Zd Zdd� ZdS )rV c C s dS )Nz...rw )r� rw rw rx r� V s z_ForwardNoRecurse.__str__N)r� r� r� r� rw rw rw rx rV U s rV c s" e Zd ZdZd� fdd� Z� ZS )r- zQ
Abstract subclass of C{ParseExpression}, for converting parsed results.
Fc s t t| �j|� d| _d S )NF)r� r- r� rW )r� r. rg )rH rw rx r� ] s zTokenConverter.__init__)F)r� r� r� r� r� r� rw rw )rH rx r- Y s c s6 e Zd ZdZd
� fdd� Z� fdd�Zdd � Z� ZS ) r
a�
Converter to concatenate all matching tokens to a single string.
By default, the matching patterns must also be contiguous in the input string;
this can be disabled by specifying C{'adjacent=False'} in the constructor.
Example::
real = Word(nums) + '.' + Word(nums)
print(real.parseString('3.1416')) # -> ['3', '.', '1416']
# will also erroneously match the following
print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
real = Combine(Word(nums) + '.' + Word(nums))
print(real.parseString('3.1416')) # -> ['3.1416']
# no match when there are internal spaces
print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
r� Tc s8 t t| �j|� |r | j� || _d| _|| _d| _d S )NT)r� r
r� r� �adjacentrX �
joinStringre )r� r. rX rW )rH rw rx r� r s zCombine.__init__c s( | j rtj| |� ntt| �j|� | S )N)rW r$ r� r� r
)r� r� )rH rw rx r� | s zCombine.ignorec C sP |j � }|d d �= |tdj|j| j��g| jd�7 }| jrH|j� rH|gS |S d S )Nr� )r� )r� r" r� r
rX rb rV r� )r� r- r� r� ZretToksrw rw rx r� � s
"zCombine.postParse)r� T)r� r� r� r� r� r� r� r� rw rw )rH rx r
a s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r a�
Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
Example::
ident = Word(alphas)
num = Word(nums)
term = ident | num
func = ident + Optional(delimitedList(term))
print(func.parseString("fn a,b,100")) # -> ['fn', 'a', 'b', '100']
func = ident + Group(Optional(delimitedList(term)))
print(func.parseString("fn a,b,100")) # -> ['fn', ['a', 'b', '100']]
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s zGroup.__init__c C s |gS )Nrw )r� r- r� r� rw rw rx r� � s zGroup.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s
c s( e Zd ZdZ� fdd�Zdd� Z� ZS )r aW
Converter to return a repetitive expression as a list, but also as a dictionary.
Each element can also be referenced using the first token in the expression as its key.
Useful for tabular report scraping when the first column can be used as a item key.
Example::
data_word = Word(alphas)
label = data_word + FollowedBy(':')
attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
# print attributes as plain groups
print(OneOrMore(attr_expr).parseString(text).dump())
# instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
print(result.dump())
# access named fields as dict entries, or output as dict
print(result['shape'])
print(result.asDict())
prints::
['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
{'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
See more examples at L{ParseResults} of accessing fields by results name.
c s t t| �j|� d| _d S )NT)r� r r� rW )r� r. )rH rw rx r� � s z
Dict.__init__c C s� x�t |�D ]�\}}t|�dkr q
|d }t|t�rBt|d �j� }t|�dkr^td|�||< q
t|�dkr�t|d t� r�t|d |�||< q
|j� }|d= t|�dks�t|t�r�|j � r�t||�||< q
t|d |�||< q
W | j
r�|gS |S d S )Nr rr r� rq ) r� r� rz ru r� r� r� r" r� r� rV )r� r- r� r� r� �tokZikeyZ dictvaluerw rw rx r� � s$
zDict.postParse)r� r� r� r� r� r� r� rw rw )rH rx r � s # c @ s e Zd ZdZdd� Zdd� ZdS )r+ aV
Converter for ignoring the results of a parsed expression.
Example::
source = "a, b, c,d"
wd = Word(alphas)
wd_list1 = wd + ZeroOrMore(',' + wd)
print(wd_list1.parseString(source))
# often, delimiters that are useful during parsing are just in the
# way afterward - use Suppress to keep them out of the parsed output
wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
print(wd_list2.parseString(source))
prints::
['a', ',', 'b', ',', 'c', ',', 'd']
['a', 'b', 'c', 'd']
(See also L{delimitedList}.)
c C s g S )Nrw )r� r- r� r� rw rw rx r� � s zSuppress.postParsec C s | S )Nrw )r� rw rw rx r� � s zSuppress.suppressN)r� r� r� r� r� r� rw rw rw rx r+ � s c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) r zI
Wrapper for parse actions, to ensure they are only called once.
c C s t |�| _d| _d S )NF)rM �callable�called)r� Z
methodCallrw rw rx r� s
zOnlyOnce.__init__c C s. | j s | j|||�}d| _ |S t||d��d S )NTr� )r[ rZ r )r� r� r5 rv r� rw rw rx r� s
zOnlyOnce.__call__c C s
d| _ d S )NF)r[ )r� rw rw rx �reset
s zOnlyOnce.resetN)r� r� r� r� r� r� r\ rw rw rw rx r � s c s: t � �� � fdd�}y � j|_W n tk
r4 Y nX |S )as
Decorator for debugging parse actions.
When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
Example::
wd = Word(alphas)
@traceParseAction
def remove_duplicate_chars(tokens):
return ''.join(sorted(set(''.join(tokens)))
wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
prints::
>>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
<<leaving remove_duplicate_chars (ret: 'dfjkls')
['dfjkls']
c s� � j }| dd � \}}}t| �dkr8| d jj d | }tjjd|t||�||f � y � | � }W n8 tk
r� } z tjjd||f � � W Y d d }~X nX tjjd||f � |S )Nro r �.z">>entering %s(line: '%s', %d, %r)
z <<leaving %s (exception: %s)
z<<leaving %s (ret: %r)
r9 )r� r� rH r~ �stderr�writerG rK )ZpaArgsZthisFuncr� r5 rv r� r3 )r� rw rx �z# s ztraceParseAction.<locals>.z)rM r� r� )r� r` rw )r� rx rb
s
�,Fc C s` t | �d t |� d t | � d }|rBt| t|| � �j|�S | tt|�| � j|�S dS )a�
Helper to define a delimited list of expressions - the delimiter defaults to ','.
By default, the list elements and delimiters can have intervening whitespace, and
comments, but this can be overridden by passing C{combine=True} in the constructor.
If C{combine} is set to C{True}, the matching tokens are returned as a single token
string, with the delimiters included; otherwise, the matching tokens are returned
as a list of tokens, with the delimiters suppressed.
Example::
delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
z [r� z]...N)r� r
r2 ri r+ )r. Zdelim�combineZdlNamerw rw rx r@ 9 s
$c sj t � � � �fdd�}|dkr0tt�jdd� �}n|j� }|jd� |j|dd� |� jd t�� d
�S ) a:
Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
Example::
countedArray(Word(alphas)).parseString('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd']
c s. |d }� |r t t�g| ��p&t t�> g S )Nr )r r rC )r� r5 rv r� )� arrayExprr. rw rx �countFieldParseAction_ s "z+countedArray.<locals>.countFieldParseActionNc S s t | d �S )Nr )ru )rv rw rw rx ry d s z countedArray.<locals>.<lambda>ZarrayLenT)rf z(len) z...)r r/ rR r� r� ri rx r� )r. ZintExprrd rw )rc r. rx r< L s
c C s: g }x0| D ](}t |t�r(|jt|�� q
|j|� q
W |S )N)rz r� r� r� r� )�Lr� r� rw rw rx r� k s
r� c s6 t � � � fdd�}| j|dd� � jdt| � � � S )a*
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousLiteral(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches a
previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
If this is not desired, use C{matchPreviousExpr}.
Do I{not} use with packrat parsing enabled.
c sP |rBt |�dkr � |d > qLt|j� �}� tdd� |D ��> n
� t� > d S )Nrr r c s s | ]}t |�V qd S )N)r )r� �ttrw rw rx r� � s zDmatchPreviousLiteral.<locals>.copyTokenToRepeater.<locals>.<genexpr>)r� r� r� r r
)r� r5 rv Ztflat)�reprw rx �copyTokenToRepeater� s z1matchPreviousLiteral.<locals>.copyTokenToRepeaterT)rf z(prev) )r rx ri r� )r. rh rw )rg rx rO t s
c sF t � � | j� }� |K � � fdd�}| j|dd� � jdt| � � � S )aS
Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks
for a 'repeat' of a previous expression. For example::
first = Word(nums)
second = matchPreviousExpr(first)
matchExpr = first + ":" + second
will match C{"1:1"}, but not C{"1:2"}. Because this matches by
expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
the expressions are evaluated first, and then compared, so
C{"1"} is compared with C{"10"}.
Do I{not} use with packrat parsing enabled.
c s* t |j� �� � fdd�}�j|dd� d S )Nc s$ t |j� �}|� kr tddd��d S )Nr� r )r� r� r )r� r5 rv Z theseTokens)� matchTokensrw rx �mustMatchTheseTokens� s zLmatchPreviousExpr.<locals>.copyTokenToRepeater.<locals>.mustMatchTheseTokensT)rf )r� r� r� )r� r5 rv rj )rg )ri rx rh � s z.matchPreviousExpr.<locals>.copyTokenToRepeaterT)rf z(prev) )r r� rx ri r� )r. Ze2rh rw )rg rx rN � s c C s> x dD ]}| j |t| �} qW | j dd�} | j dd�} t| �S )Nz\^-]r z\nr( z\t)r� �_bslashr� )r� r� rw rw rx r � s
r Tc
s� |rdd� }dd� }t � ndd� }dd� }t� g }t| t�rF| j� }n&t| tj�r\t| �}ntj dt
dd� |svt � S d }x�|t |�d
k �r|| }xnt
||d
d � �D ]N\}} || |�r�||| d
= P q�||| �r�||| d
= |j|| � | }P q�W |d
7 }q|W | �r�|�r�yht |�t d j|��k�rZtd
d jdd� |D �� �jdj|��S tdjdd� |D ���jdj|��S W n& tk
�r� tj dt
dd� Y nX t� fdd�|D ��jdj|��S )a�
Helper to quickly define a set of alternative Literals, and makes sure to do
longest-first testing when there is a conflict, regardless of the input order,
but returns a C{L{MatchFirst}} for best performance.
Parameters:
- strs - a string of space-delimited literals, or a collection of string literals
- caseless - (default=C{False}) - treat all literals as caseless
- useRegex - (default=C{True}) - as an optimization, will generate a Regex
object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
if creating a C{Regex} raises an exception)
Example::
comp_oper = oneOf("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.searchString("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
c S s | j � |j � kS )N)r� )r �brw rw rx ry � s zoneOf.<locals>.<lambda>c S s |j � j| j � �S )N)r� r� )r rl rw rw rx ry � s c S s | |kS )Nrw )r rl rw rw rx ry � s c S s
|j | �S )N)r� )r rl rw rw rx ry � s z6Invalid argument to oneOf, expected string or iterablerq )r� r rr Nr� z[%s]c s s | ]}t |�V qd S )N)r )r� �symrw rw rx r� � s zoneOf.<locals>.<genexpr>z | �|c s s | ]}t j|�V qd S )N)rd r )r� rm rw rw rx r� � s z7Exception creating Regex for oneOf, building MatchFirstc 3 s | ]}� |�V qd S )Nrw )r� rm )�parseElementClassrw rx r� � s )r r rz r� r� r� r5 r� r� r� r� r r� r� r� r� r' ri rK r )
Zstrsr� ZuseRegexZisequalZmasksZsymbolsr� Zcurr� r� rw )ro rx rS � sL
((c C s t tt| | ���S )a�
Helper to easily and clearly define a dictionary by specifying the respective patterns
for the key and value. Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
in the proper order. The key pattern can include delimiting markers or punctuation,
as long as they are suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the C{Dict} results can include named token
fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
print(OneOrMore(attr_expr).parseString(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
# similar to Dict, but simpler call format
result = dictOf(attr_label, attr_value).parseString(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.asDict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: light blue
- posn: upper left
- shape: SQUARE
- texture: burlap
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
)r r2 r )r� r� rw rw rx rA � s !c C s^ t � jdd� �}|j� }d|_|d�| |d� }|r@dd� }ndd� }|j|� | j|_|S ) a�
Helper to return the original, untokenized text for a given expression. Useful to
restore the parsed fields of an HTML start tag into the raw tag text itself, or to
revert separate tokens with intervening whitespace back to the original matching
input text. By default, returns astring containing the original parsed text.
If the optional C{asString} argument is passed as C{False}, then the return value is a
C{L{ParseResults}} containing any results names that were originally matched, and a
single token containing the original matched text from the input string. So if
the expression passed to C{L{originalTextFor}} contains expressions with defined
results names, you must set C{asString} to C{False} if you want to preserve those
results name values.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b","i"):
opener,closer = makeHTMLTags(tag)
patt = originalTextFor(opener + SkipTo(closer) + closer)
print(patt.searchString(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
c S s |S )Nrw )r� r� rv rw rw rx ry 8 s z!originalTextFor.<locals>.<lambda>F�_original_start�
_original_endc S s | |j |j� S )N)rp rq )r� r5 rv rw rw rx ry = s c S s& | |j d�|j d�� g|d d �< d S )Nrp rq )r� )r� r5 rv rw rw rx � extractText? s z$originalTextFor.<locals>.extractText)r
r� r� re r] )r. ZasStringZ locMarkerZ endlocMarker� matchExprrr rw rw rx rg s
c C s t | �jdd� �S )zp
Helper to undo pyparsing's default grouping of And expressions, even
if all but one are non-empty.
c S s | d S )Nr rw )rv rw rw rx ry J s zungroup.<locals>.<lambda>)r- r� )r. rw rw rx rh E s c C s4 t � jdd� �}t|d�| d� |j� j� d� �S )a�
Helper to decorate a returned token with its starting and ending locations in the input string.
This helper adds the following results names:
- locn_start = location where matched expression begins
- locn_end = location where matched expression ends
- value = the actual parsed results
Be careful if the input text contains C{<TAB>} characters, you may want to call
C{L{ParserElement.parseWithTabs}}
Example::
wd = Word(alphas)
for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
c S s |S )Nrw )r� r5 rv rw rw rx ry ` s z locatedExpr.<locals>.<lambda>Z
locn_startr� Zlocn_end)r
r� r r� r� )r. Zlocatorrw rw rx rj L s z\[]-*.$+^?()~ )r
c C s |d d S )Nr rr rw )r� r5 rv rw rw rx ry k s ry z\\0?[xX][0-9a-fA-F]+c C s t t|d jd�d��S )Nr z\0x� )�unichrru �lstrip)r� r5 rv rw rw rx ry l s z \\0[0-7]+c C s t t|d dd � d��S )Nr rr � )ru ru )r� r5 rv rw rw rx ry m s z\])r� r
z\wr8 r r� Znegate�bodyr c sB dd� � y dj � fdd�tj| �jD ��S tk
r< dS X dS )a�
Helper to easily define string ranges for use in Word construction. Borrows
syntax from regexp '[]' string range definitions::
srange("[0-9]") -> "0123456789"
srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz"
srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
The input string must be enclosed in []'s, and the returned string is the expanded
character set joined into a single string.
The values enclosed in the []'s may be:
- a single character
- an escaped character with a leading backslash (such as C{\-} or C{\]})
- an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character)
(C{\0x##} is also supported for backwards compatibility)
- an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
- a range of any of the above, separated by a dash (C{'a-z'}, etc.)
- any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
c S s< t | t�s| S djdd� tt| d �t| d �d �D ��S )Nr� c s s | ]}t |�V qd S )N)ru )r� r� rw rw rx r� � s z+srange.<locals>.<lambda>.<locals>.<genexpr>r rr )rz r" r� r� �ord)�prw rw rx ry � s zsrange.<locals>.<lambda>r� c 3 s | ]}� |�V qd S )Nrw )r� �part)� _expandedrw rx r� � s zsrange.<locals>.<genexpr>N)r� �_reBracketExprr� rx rK )r� rw )r| rx r_ r s
c s � fdd�}|S )zt
Helper method for defining parse actions that require matching at a specific
column in the input text.
c s" t || �� kr t| |d� ��d S )Nz matched token not at column %d)r9 r )r) Zlocnr1 )r� rw rx � verifyCol� s z!matchOnlyAtCol.<locals>.verifyColrw )r� r~ rw )r� rx rM � s c s � fdd�S )a�
Helper method for common parse actions that simply return a literal value. Especially
useful when used with C{L{transformString<ParserElement.transformString>}()}.
Example::
num = Word(nums).setParseAction(lambda toks: int(toks[0]))
na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
term = na | num
OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
c s � gS )Nrw )r� r5 rv )�replStrrw rx ry � s z replaceWith.<locals>.<lambda>rw )r rw )r rx r\ � s c C s |d dd� S )a
Helper parse action for removing quotation marks from parsed quoted strings.
Example::
# by default, quotation marks are included in parsed results
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
# use removeQuotes to strip quotation marks from parsed results
quotedString.setParseAction(removeQuotes)
quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
r rr rs rw )r� r5 rv rw rw rx rZ � s c sN � �fdd�}yt �dt �d�j�}W n tk
rB t��}Y nX ||_|S )aG
Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional
args are passed, they are forwarded to the given function as additional arguments after
the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
parsed data to an integer using base 16.
Example (compare the last to example in L{ParserElement.transformString}::
hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
hex_ints.runTests('''
00 11 22 aa FF 0a 0d 1a
''')
upperword = Word(alphas).setParseAction(tokenMap(str.upper))
OneOrMore(upperword).runTests('''
my kingdom for a horse
''')
wd = Word(alphas).setParseAction(tokenMap(str.title))
OneOrMore(wd).setParseAction(' '.join).runTests('''
now is the winter of our discontent made glorious summer by this sun of york
''')
prints::
00 11 22 aa FF 0a 0d 1a
[0, 17, 34, 170, 255, 10, 13, 26]
my kingdom for a horse
['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
now is the winter of our discontent made glorious summer by this sun of york
['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
c s � �fdd�|D �S )Nc s g | ]}�|f� �� �qS rw rw )r� Ztokn)r� r6 rw rx r� � s z(tokenMap.<locals>.pa.<locals>.<listcomp>rw )r� r5 rv )r� r6 rw rx r} � s ztokenMap.<locals>.par� rH )rJ r� rK r{ )r6 r� r} rL rw )r� r6 rx rm � s c C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� �lower)rv rw rw rx ry � s c C s� t | t�r | }t| | d�} n| j}tttd �}|r�tj� j t
�}t d�| d� t t
t|t d� | ��� tddgd�jd �j d
d � � t d � }n�d
jdd� tD ��}tj� j t
�t|�B }t d�| d� t t
t|j t�tt d�| � ��� tddgd�jd �j dd � � t d � }ttd�| d �}|jdd
j|jdd�j� j� � �jd| �}|jdd
j|jdd�j� j� � �jd| �}||_||_||fS )zRInternal helper to construct opening and closing tag expressions, given a tag name)r� z_-:r �tag�=�/F)r� rC c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z_makeTags.<locals>.<lambda>r r� c s s | ]}|d kr|V qdS )r Nrw )r� r� rw rw rx r� � s z _makeTags.<locals>.<genexpr>c S s |d dkS )Nr r� rw )r� r5 rv rw rw rx ry � s z</r� �:r� z<%s>r z</%s>) rz r� r r� r/ r4 r3 r> r� r� rZ r+ r r2 r r rm r� rV rY rB r
�_Lr� �titler� ri r� )�tagStrZxmlZresnameZ tagAttrNameZ tagAttrValueZopenTagZprintablesLessRAbrackZcloseTagrw rw rx � _makeTags� s"
T\..r� c C s
t | d�S )a
Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
# makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
a,a_end = makeHTMLTags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.searchString(text):
# attributes in the <A> tag (like "href" shown here) are also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> http://pyparsing.wikispaces.com
F)r� )r� rw rw rx rK � s c C s
t | d�S )z�
Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
tags only in the given upper/lower case.
Example: similar to L{makeHTMLTags}
T)r� )r� rw rw rx rL s c s8 | r| dd� � n|j � � dd� � D �� � fdd�}|S )a<
Helper to create a validating parse action to be used with start tags created
with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
with a required attribute value, to avoid false matches on common tags such as
C{<TD>} or C{<DIV>}.
Call C{withAttribute} with a series of attribute names and values. Specify the list
of filter attributes names and values as:
- keyword arguments, as in C{(align="right")}, or
- as an explicit dict with C{**} operator, when an attribute name is also a Python
reserved word, as in C{**{"class":"Customer", "align":"right"}}
- a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
For attribute names with a namespace prefix, you must use the second form. Attribute
names are matched insensitive to upper/lower case.
If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
To verify that the attribute exists, but without specifying a value, pass
C{withAttribute.ANY_VALUE} as the value.
Example::
html = '''
<div>
Some text
<div type="grid">1 4 0 1 0</div>
<div type="graph">1,3 2,3 1,1</div>
<div>this has no type</div>
</div>
'''
div,div_end = makeHTMLTags("div")
# only match div tag having a type attribute with value "grid"
div_grid = div().setParseAction(withAttribute(type="grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
# construct a match with any div tag having a type attribute, regardless of the value
div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
Nc S s g | ]\}}||f�qS rw rw )r� r� r� rw rw rx r� Q s z!withAttribute.<locals>.<listcomp>c s^ xX� D ]P\}}||kr&t | |d| ��|tjkr|| |krt | |d||| |f ��qW d S )Nzno matching attribute z+attribute '%s' has value '%s', must be '%s')r re � ANY_VALUE)r� r5 r� ZattrNameZ attrValue)�attrsrw rx r} R s zwithAttribute.<locals>.pa)r� )r� ZattrDictr} rw )r� rx re s 2 c C s |r d| nd}t f || i�S )a�
Simplified version of C{L{withAttribute}} when matching on a div class - made
difficult because C{class} is a reserved word in Python.
Example::
html = '''
<div>
Some text
<div class="grid">1 4 0 1 0</div>
<div class="graph">1,3 2,3 1,1</div>
<div>this <div> has no class</div>
</div>
'''
div,div_end = makeHTMLTags("div")
div_grid = div().setParseAction(withClass("grid"))
grid_expr = div_grid + SkipTo(div | div_end)("body")
for grid_header in grid_expr.searchString(html):
print(grid_header.body)
div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
div_expr = div_any_type + SkipTo(div | div_end)("body")
for div_header in div_expr.searchString(html):
print(div_header.body)
prints::
1 4 0 1 0
1 4 0 1 0
1,3 2,3 1,1
z%s:class�class)re )Z classname� namespaceZ classattrrw rw rx rk \ s �(r c C s� t � }| || | B }�x`t|�D �]R\}}|d dd� \}} }
} | dk rTd| nd| } | dkr�|dksxt|�dkr�td��|\}
}t � j| �}|
tjk�rd| dkr�t|| �t|t |� � }n�| dk�r |dk �r t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�rZt||
| | | �t||
| | | � }ntd ��n�|
tj
k�rH| dk�r�t |t ��s�t |�}t|j
| �t|| � }n�| dk�r|dk �r�t|| | �t|t || � � }n t|| �t|t |� � }nD| dk�r>t||
| | | �t||
| | | � }ntd ��ntd
��| �r`|j| � ||j| �|B K }|}q"W ||K }|S ) a�
Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary or
binary, left- or right-associative. Parse actions can also be attached
to operator expressions. The generated parser will also recognize the use
of parentheses to override operator precedences (see example below).
Note: if you define a deep operator list, you may see performance issues
when using infixNotation. See L{ParserElement.enablePackrat} for a
mechanism to potentially improve your parser performance.
Parameters:
- baseExpr - expression representing the most basic element for the nested
- opList - list of tuples, one for each operator precedence level in the
expression grammar; each tuple is of the form
(opExpr, numTerms, rightLeftAssoc, parseAction), where:
- opExpr is the pyparsing expression for the operator;
may also be a string, which will be converted to a Literal;
if numTerms is 3, opExpr is a tuple of two expressions, for the
two operators separating the 3 terms
- numTerms is the number of terms for this operator (must
be 1, 2, or 3)
- rightLeftAssoc is the indicator whether the operator is
right or left associative, using the pyparsing-defined
constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
- parseAction is the parse action to be associated with
expressions matching this operator expression (the
parse action tuple member may be omitted)
- lpar - expression for matching left-parentheses (default=C{Suppress('(')})
- rpar - expression for matching right-parentheses (default=C{Suppress(')')})
Example::
# simple example of four-function arithmetic with ints and variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infixNotation(integer | varname,
[
('-', 1, opAssoc.RIGHT),
(oneOf('* /'), 2, opAssoc.LEFT),
(oneOf('+ -'), 2, opAssoc.LEFT),
])
arith_expr.runTests('''
5+3*6
(5+3)*6
-2--11
''', fullDump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
-2--11
[[['-', 2], '-', ['-', 11]]]
Nr ro z%s termz %s%s termrq z@if numterms=3, opExpr must be a tuple or list of two expressionsrr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)N)r r� r� r� ri rT �LEFTr r r �RIGHTrz r r. r� )ZbaseExprZopListZlparZrparr� ZlastExprr� ZoperDefZopExprZarityZrightLeftAssocr} ZtermNameZopExpr1ZopExpr2ZthisExprrs rw rw rx ri � sR ;
&
&
z4"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�"z string enclosed in double quotesz4'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*�'z string enclosed in single quotesz*quotedString using single or double quotes�uzunicode string literalc C s� | |krt d��|dk�r(t| t�o,t|t��r t| �dkr�t|�dkr�|dk r�tt| t| | tj dd� ��j dd� �}n$t
j � t| | tj �j dd� � }nx|dk r�tt| t | � t |� ttjdd� ��j dd� �}n4ttt | � t |� ttjdd� ��j d d� �}nt d
��t
� }|dk �rb|tt| �t||B |B � t|� �K }n$|tt| �t||B � t|� �K }|jd | |f � |S ) a~
Helper method for defining nested lists enclosed in opening and closing
delimiters ("(" and ")" are the default).
Parameters:
- opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
- closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
- content - expression for items within the nested lists (default=C{None})
- ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
If an expression is not provided for the content argument, the nested
expression will capture all whitespace-delimited content between delimiters
as a list of separate values.
Use the C{ignoreExpr} argument to define expressions that may contain
opening or closing characters that should not be treated as opening
or closing characters for nesting, such as quotedString or a comment
expression. Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
The default is L{quotedString}, but if no expressions are to be ignored,
then pass C{None} for this argument.
Example::
data_type = oneOf("void int short long char float double")
decl_data_type = Combine(data_type + Optional(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR,RPAR = map(Suppress, "()")
code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(cStyleComment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.searchString(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
z.opening and closing strings cannot be the sameNrr )r
c S s | d j � S )Nr )r� )rv rw rw rx ry 9 s z nestedExpr.<locals>.<lambda>c S s | d j � S )Nr )r� )rv rw rw rx ry < s c S s | d j � S )Nr )r� )rv rw rw rx ry B s c S s | d j � S )Nr )r� )rv rw rw rx ry F s zOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)r� rz r� r� r
r r r$ rN r� rC r� r r r r+ r2 ri )�openerZcloserZcontentrO r� rw rw rx rP � s4 :
*$c s� � fdd�}� fdd�}� fdd�}t t� jd�j� �}t� t� j|� jd�}t� j|�jd �}t� j|�jd
�} |r�tt|�| t |t| � t|� � | �}
n$tt|�t |t| � t|� � �}
| j t
t� � |
jd �S ) a
Helper method for defining space-delimited indentation blocks, such as
those used to define block statements in Python source code.
Parameters:
- blockStatementExpr - expression defining syntax of statement that
is repeated within the indented block
- indentStack - list created by caller to manage indentation stack
(multiple statementWithIndentedBlock expressions within a single grammar
should share a common indentStack)
- indent - boolean indicating whether block must be indented beyond the
the current level; set to False for block of left-most statements
(default=C{True})
A valid block must contain at least one C{blockStatement}.
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group( funcDecl + func_body )
rvalue = Forward()
funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << ( funcDef | assignment | identifier )
module_body = OneOrMore(stmt)
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
c sN |t | �krd S t|| �}|� d krJ|� d kr>t| |d��t| |d��d S )Nrr zillegal nestingznot a peer entryrs rs )r� r9 r! r )r� r5 rv �curCol)� indentStackrw rx �checkPeerIndent� s
z&indentedBlock.<locals>.checkPeerIndentc s2 t || �}|� d kr"� j|� n t| |d��d S )Nrr znot a subentryrs )r9 r� r )r� r5 rv r� )r� rw rx �checkSubIndent� s
z%indentedBlock.<locals>.checkSubIndentc sN |t | �krd S t|| �}� o4|� d k o4|� d ksBt| |d��� j� d S )Nrr rq znot an unindentrs r: )r� r9 r r� )r� r5 rv r� )r� rw rx �
checkUnindent� s
z$indentedBlock.<locals>.checkUnindentz �INDENTr� ZUNINDENTzindented block) r r r� r� r
r� ri r r r� rk ) ZblockStatementExprr� r r� r� r� r! r� ZPEERZUNDENTZsmExprrw )r� rx rf Q s N , z#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]z_:zany tagzgt lt amp nbsp quot aposz><& "'z &(?P<entity>rn z);zcommon HTML entityc C s t j| j�S )zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMapr� Zentity)rv rw rw rx r[ � s z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style comment)r� z � commaItem)r� c @ s� e Zd ZdZee�Zee�Ze e
�j d�j e�Z
e e�j d�j eed��Zed�j d�j e�Ze� j e�d e� j e� j d�Zejd d
� � eeeed �j� e � B j d �Zeje� ed
�j d�j e�Zed�j d�j e�ZeeB eB j� Zed�j d�j e�Z e e d e d �j d�Z ed�j d�Z ed�j d�Z!e!de! d j d�Z"ee!de! d> �d ee!de! d? � j d �Z#e#j$d d
� � d!e j d"�Z%e&e"e%B e#B j d#��j d#�Z'ed$�j d%�Z(e)d@d'd(��Z*e)dAd*d+��Z+ed,�j d-�Z,ed.�j d/�Z-ed0�j d1�Z.e/j� e0j� B Z1e)d2d3� �Z2e&e3e4d4� e5� e e6d4d5� ee7d6�� ��j� j d7�Z8e9ee:j;� e8B d8d9��j d:�Z<e)ed;d
� ��Z=e)ed<d
� ��Z>d=S )Brn a�
Here are some common low-level expressions that may be useful in jump-starting parser development:
- numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
- common L{programming identifiers<identifier>}
- network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
- ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
- L{UUID<uuid>}
- L{comma-separated list<comma_separated_list>}
Parse actions:
- C{L{convertToInteger}}
- C{L{convertToFloat}}
- C{L{convertToDate}}
- C{L{convertToDatetime}}
- C{L{stripHTMLTags}}
- C{L{upcaseTokens}}
- C{L{downcaseTokens}}
Example::
pyparsing_common.number.runTests('''
# any int or real number, returned as the appropriate type
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.fnumber.runTests('''
# any int or real number, returned as float
100
-100
+100
3.14159
6.02e23
1e-12
''')
pyparsing_common.hex_integer.runTests('''
# hex numbers
100
FF
''')
pyparsing_common.fraction.runTests('''
# fractions
1/2
-3/4
''')
pyparsing_common.mixed_integer.runTests('''
# mixed fractions
1
1/2
-3/4
1-3/4
''')
import uuid
pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
pyparsing_common.uuid.runTests('''
# uuid
12345678-1234-5678-1234-567812345678
''')
prints::
# any int or real number, returned as the appropriate type
100
[100]
-100
[-100]
+100
[100]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# any int or real number, returned as float
100
[100.0]
-100
[-100.0]
+100
[100.0]
3.14159
[3.14159]
6.02e23
[6.02e+23]
1e-12
[1e-12]
# hex numbers
100
[256]
FF
[255]
# fractions
1/2
[0.5]
-3/4
[-0.75]
# mixed fractions
1
[1]
1/2
[0.5]
-3/4
[-0.75]
1-3/4
[1.75]
# uuid
12345678-1234-5678-1234-567812345678
[UUID('12345678-1234-5678-1234-567812345678')]
�integerz hex integerrt z[+-]?\d+zsigned integerr� �fractionc C s | d | d S )Nr rr rs rw )rv rw rw rx ry � s zpyparsing_common.<lambda>r8 z"fraction or mixed integer-fractionz
[+-]?\d+\.\d*z real numberz+[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)z$real number with scientific notationz [+-]?\d+\.?\d*([eE][+-]?\d+)?�fnumberrB �
identifierzK(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}z IPv4 addressz[0-9a-fA-F]{1,4}� hex_integerr� � zfull IPv6 addressr rB z::zshort IPv6 addressc C s t dd� | D ��dk S )Nc s s | ]}t jj|�rd V qdS )rr N)rn �
_ipv6_partr� )r� rf rw rw rx r� � s z,pyparsing_common.<lambda>.<locals>.<genexpr>rw )rH )rv rw rw rx ry � s z::ffff:zmixed IPv6 addressz IPv6 addressz:[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}z MAC address�%Y-%m-%dc s � fdd�}|S )a�
Helper to create a parse action for converting parsed date string to Python datetime.date
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
Example::
date_expr = pyparsing_common.iso8601_date.copy()
date_expr.setParseAction(pyparsing_common.convertToDate())
print(date_expr.parseString("1999-12-31"))
prints::
[datetime.date(1999, 12, 31)]
c sL yt j|d � �j� S tk
rF } zt| |t|���W Y d d }~X nX d S )Nr )r �strptimeZdater� r r{ )r� r5 rv �ve)�fmtrw rx �cvt_fn� s z.pyparsing_common.convertToDate.<locals>.cvt_fnrw )r� r� rw )r� rx �
convertToDate� s z pyparsing_common.convertToDate�%Y-%m-%dT%H:%M:%S.%fc s � fdd�}|S )a
Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
Params -
- fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
Example::
dt_expr = pyparsing_common.iso8601_datetime.copy()
dt_expr.setParseAction(pyparsing_common.convertToDatetime())
print(dt_expr.parseString("1999-12-31T23:59:59.999"))
prints::
[datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
c sH yt j|d � �S tk
rB } zt| |t|���W Y d d }~X nX d S )Nr )r r� r� r r{ )r� r5 rv r� )r� rw rx r� � s z2pyparsing_common.convertToDatetime.<locals>.cvt_fnrw )r� r� rw )r� rx �convertToDatetime� s z"pyparsing_common.convertToDatetimez7(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?z ISO8601 datez�(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?zISO8601 datetimez2[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}�UUIDc C s t jj|d �S )a
Parse action to remove HTML tags from web page HTML source
Example::
# strip HTML links from normal text
text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
td,td_end = makeHTMLTags("TD")
table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
r )rn �_html_stripperr� )r� r5 r� rw rw rx �
stripHTMLTags� s
z pyparsing_common.stripHTMLTagsra )r� z r� r� )r� zcomma separated listc C s t | �j� S )N)r� r� )rv rw rw rx ry � s c C s t | �j� S )N)r� r� )rv rw rw rx ry � s N)r rB )r rB )r� )r� )?r� r� r� r� rm ru ZconvertToInteger�floatZconvertToFloatr/ rR ri r� r� rD r� r' Zsigned_integerr� rx r r� Z
mixed_integerrH �realZsci_realr� �numberr� r4 r3 r� Z ipv4_addressr� Z_full_ipv6_addressZ_short_ipv6_addressr~ Z_mixed_ipv6_addressr
Z ipv6_addressZ mac_addressr� r� r� Z iso8601_dateZiso8601_datetime�uuidr7 r6 r� r� r r r rV r. �
_commasepitemr@ rY r� Zcomma_separated_listrd rB rw rw rw rx rn � sN ""
2 8 �__main__Zselect�fromz_$r] )rb �columnsrj ZtablesZcommandaK
# '*' as column list and dotted table name
select * from SYS.XYZZY
# caseless match on "SELECT", and casts back to "select"
SELECT * from XYZZY, ABC
# list of column names, and mixed case SELECT keyword
Select AA,BB,CC from Sys.dual
# multiple tables
Select A, B, C from Sys.dual, Table2
# invalid SELECT keyword - should fail
Xelect A, B, C from Sys.dual
# incomplete command - should fail
Select
# invalid column name - should fail
Select ^^^ frox Sys.dual
z]
100
-100
+100
3.14159
6.02e23
1e-12
z
100
FF
z6
12345678-1234-5678-1234-567812345678
)rq )ra F)N)FT)T)r� )T)�r� � __version__Z__versionTime__�
__author__r� �weakrefr r� r� r~ r� rd r r� r" r< r� r �_threadr � ImportErrorZ threadingr r� Z ordereddict�__all__r� � version_infor; r �maxsizer� r{ r� �chrru r� rH r� r �reversedr� r� r r6 r r rI ZmaxintZxranger� Z __builtin__r� Zfnamer� rJ r� r� r� r� r� r� Zascii_uppercaseZascii_lowercaser4 rR rD r3 rk r� Z printablerV rK r r r! r# r& r� r" �MutableMapping�registerr9 rJ rG r/ r2 r4 rQ rM r$ r, r
r r r� rQ r r r rl r/ r' r% r r. r0 r r r r* r) r1 r0 r r r r r r r r rJ r r2 rM rN r r( r rV r- r
r r r+ r rb r@ r< r� rO rN r rS rA rg rh rj ri rC rI rH ra r` r� Z _escapedPuncZ_escapedHexCharZ_escapedOctChar�UNICODEZ _singleCharZ
_charRangerm r} r_ rM r\ rZ rm rd rB r� rK rL re r� rk rT r� r� ri rU r> r^ rY rc rP rf r5 rW r7 r6 r� r� r� r� r; r[ r8 rE r� r] r? r= rF rX r� r� r: rn r� Z selectTokenZ fromTokenZidentZ
columnNameZcolumnNameListZ
columnSpecZ tableNameZ
tableNameListZ simpleSQLr� r� r� r� r� r� rw rw rw rx �<module>= s�
8
@ d &A= I
G3 pLOD|M &# @sQ,A, I# % &0
, ? #k Zr
(
0
" pip/_vendor/__pycache__/ipaddress.cpython-36.opt-1.pyc 0000644 00000201213 14751155150 0016546 0 ustar 00 3
���e09 � @ s` d Z ddlmZ ddlZddlZdZefZy eefZW n e k
rJ Y nX ye
Z W n e k
rl e Z Y nX dOdkr�dd� Z
ndd� Z
y
ejZW n ek
r� d d
� ZY nX d d � Zeed
�r�dd� Zndd� ZdPdd�ZG dd� de�ZdZdZG dd� de�ZG dd� de�Zd d � Z dQd d �Z d!d"� Z d#d$� Z d%d&� Z d'd(� Z!d)d*� Z"d+d,� Z#d-d.� Z$d/d0� Z%d1d2� Z&d3d4� Z'G d5d6� d6e�Z(G d7d8� d8e(�Z)G d9d:� d:e(�Z*G d;d<� d<e�Z+G d=d>� d>e+e)�Z,G d?d@� d@e,�Z-G dAdB� dBe+e*�Z.G dCdD� dDe�Z/e/e,_0G dEdF� dFe�Z1G dGdH� dHe1e)�Z2G dIdJ� dJe2�Z3G dKdL� dLe1e*�Z4G dMdN� dNe�Z5e5e2_0dS )Rz�A fast, lightweight IPv4/IPv6 manipulation library in Python.
This library is used to create/poke/manipulate IPv4 and IPv6 addresses
and networks.
� )�unicode_literalsNz1.0.17� c C s | S )N� )�bytr r � /usr/lib/python3.6/ipaddress.py�_compat_bytes_to_byte_vals s r c C s dd� | D �S )Nc S s g | ]}t jd |�d �qS )s !Br )�struct�unpack)�.0�br r r �
<listcomp># s z._compat_bytes_to_byte_vals.<locals>.<listcomp>r )r r r r r " s c C s" d}x| D ]}|d> | }q
W |S )Nr � r )Zbytvals� endianess�resZbvr r r �_compat_int_from_byte_vals' s
r c C st |dkr.| dk s| d
kr"t jd��t jd| �S |dkrj| dk sJ| dd krTt jd ��t jd
| d ? | d @ �S t� �d S )N� r � � z(integer out of range for 'I' format codes !I� � z)integer out of range for 'QQ' format codes !QQ�@ l ���� l )r �error�pack�NotImplementedError)ZintvalZlengthr r r r �_compat_to_bytes0 s
r �
bit_lengthc C s | j � S )N)r )�ir r r �_compat_bit_length? s r c C s& x t j� D ]}| |? dkr
|S q
W d S )Nr )� itertools�count)r r r r r r B s � c c s$ | }x||k r |V ||7 }qW d S )Nr )�start�end�stepr r r r �
_compat_rangeH s
r$ c @ s@ e Zd Zf Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Z d
S )�_TotalOrderingMixinc C s t �d S )N)r )�self�otherr r r �__eq__W s z_TotalOrderingMixin.__eq__c C s | j |�}|tkrtS | S )N)r( �NotImplemented)r& r' �equalr r r �__ne__Z s
z_TotalOrderingMixin.__ne__c C s t �d S )N)r )r& r' r r r �__lt__` s z_TotalOrderingMixin.__lt__c C s& | j |�}|tks| r"| j|�S |S )N)r, r) r( )r& r' �lessr r r �__le__c s
z_TotalOrderingMixin.__le__c C s6 | j |�}|tkrtS | j|�}|tkr,tS |p2| S )N)r, r) r( )r& r' r- r* r r r �__gt__i s
z_TotalOrderingMixin.__gt__c C s | j |�}|tkrtS | S )N)r, r) )r& r' r- r r r �__ge__r s
z_TotalOrderingMixin.__ge__N)
�__name__�
__module__� __qualname__� __slots__r( r+ r, r. r/ r0 r r r r r% P s r% r r c @ s e Zd ZdZdS )�AddressValueErrorz%A Value Error related to the address.N)r1 r2 r3 �__doc__r r r r r5 } s r5 c @ s e Zd ZdZdS )�NetmaskValueErrorz%A Value Error related to the netmask.N)r1 r2 r3 r6 r r r r r7 � s r7 c C sj yt | �S ttfk
r Y nX yt| �S ttfk
rB Y nX t| t�rZtd| ��td| ��dS )a� Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP address. Either IPv4 or
IPv6 addresses may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Address or IPv6Address object.
Raises:
ValueError: if the *address* passed isn't either a v4 or a v6
address
zx%r does not appear to be an IPv4 or IPv6 address. Did you pass in a bytes (str in Python 2) instead of a unicode object?z0%r does not appear to be an IPv4 or IPv6 addressN)� IPv4Addressr5 r7 � IPv6Address�
isinstance�bytes�
ValueError)�addressr r r �
ip_address� s
r> Tc C sn y
t | |�S ttfk
r" Y nX y
t| |�S ttfk
rF Y nX t| t�r^td| ��td| ��dS )a� Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP network. Either IPv4 or
IPv6 networks may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Network or IPv6Network object.
Raises:
ValueError: if the string passed isn't either a v4 or a v6
address. Or if the network has host bits set.
zx%r does not appear to be an IPv4 or IPv6 network. Did you pass in a bytes (str in Python 2) instead of a unicode object?z0%r does not appear to be an IPv4 or IPv6 networkN)� IPv4Networkr5 r7 � IPv6Networkr: r; r< )r= �strictr r r �
ip_network� s
rB c C sT yt | �S ttfk
r Y nX yt| �S ttfk
rB Y nX td| ��dS )ag Take an IP string/int and return an object of the correct type.
Args:
address: A string or integer, the IP address. Either IPv4 or
IPv6 addresses may be supplied; integers less than 2**32 will
be considered to be IPv4 by default.
Returns:
An IPv4Interface or IPv6Interface object.
Raises:
ValueError: if the string passed isn't either a v4 or a v6
address.
Notes:
The IPv?Interface classes describe an Address on a particular
Network, so they're basically a combination of both the Address
and Network classes.
z2%r does not appear to be an IPv4 or IPv6 interfaceN)�
IPv4Interfacer5 r7 �
IPv6Interfacer< )r= r r r � ip_interface� s rE c C s4 y t | dd�S tjtfk
r. td��Y nX dS )a` Represent an address as 4 packed bytes in network (big-endian) order.
Args:
address: An integer representation of an IPv4 IP address.
Returns:
The integer address packed as 4 bytes in network (big-endian) order.
Raises:
ValueError: If the integer is negative or too large to be an
IPv4 IP address.
r �bigz&Address negative or too large for IPv4N)r r r �
OverflowErrorr< )r= r r r �v4_int_to_packed� s rH c C s4 y t | dd�S tjtfk
r. td��Y nX dS )z�Represent an address as 16 packed bytes in network (big-endian) order.
Args:
address: An integer representation of an IPv6 IP address.
Returns:
The integer address packed as 16 bytes in network (big-endian) order.
r rF z&Address negative or too large for IPv6N)r r r rG r< )r= r r r �v6_int_to_packed s
rI c C s* t | �jd�}t|�dkr&td| ��|S )zAHelper to split the netmask and raise AddressValueError if needed�/r z Only one '/' permitted in %r)� _compat_str�split�lenr5 )r= �addrr r r �_split_optional_netmask s rO c c sR t | �}t|� }}x.|D ]&}|j|jd kr<||fV |}|}qW ||fV dS )z�Find a sequence of sorted deduplicated IPv#Address.
Args:
addresses: a list of IPv#Address objects.
Yields:
A tuple containing the first and last IP addresses in the sequence.
r N)�iter�next�_ip)� addresses�it�first�last�ipr r r �_find_address_range s
rX c C s$ | dkr |S t |t| | d @ ��S )z�Count the number of zero bits on the right hand side.
Args:
number: an integer.
bits: maximum number of bits to count.
Returns:
The number of zero bits on the right hand side of the number.
r r )�minr )Znumber�bitsr r r �_count_righthand_zero_bits0 s r[ c c s� t | t�ot |t�s td��| j|jkr8td| |f ��| |krHtd��| jdkrXt}n| jdkrht}ntd��| j}| j}|j}x^||kr�t t
||�t || d �d �}|||| f�}|V |d|> 7 }|d |j kr�P q�W dS ) a� Summarize a network range given the first and last IP addresses.
Example:
>>> list(summarize_address_range(IPv4Address('192.0.2.0'),
... IPv4Address('192.0.2.130')))
... #doctest: +NORMALIZE_WHITESPACE
[IPv4Network('192.0.2.0/25'), IPv4Network('192.0.2.128/31'),
IPv4Network('192.0.2.130/32')]
Args:
first: the first IPv4Address or IPv6Address in the range.
last: the last IPv4Address or IPv6Address in the range.
Returns:
An iterator of the summarized IPv(4|6) network objects.
Raise:
TypeError:
If the first and last objects are not IP addresses.
If the first and last objects are not the same version.
ValueError:
If the last object is not greater than the first.
If the version of the first address is not 4 or 6.
z1first and last must be IP addresses, not networksz%%s and %s are not of the same versionz*last IP address must be greater than firstr � zunknown IP versionr N)
r: � _BaseAddress� TypeError�versionr< r? r@ �_max_prefixlenrR rY r[ r � _ALL_ONES)rU rV rW Zip_bitsZ first_intZlast_intZnbits�netr r r �summarize_address_range@ s0
rc c c s� t | �}i }xL|rX|j� }|j� }|j|�}|dkr>|||< q||kr||= |j|� qW d}x4t|j� �D ]$}|dk r�|j|jkr�ql|V |}qlW dS )au Loops through the addresses, collapsing concurrent netblocks.
Example:
ip1 = IPv4Network('192.0.2.0/26')
ip2 = IPv4Network('192.0.2.64/26')
ip3 = IPv4Network('192.0.2.128/26')
ip4 = IPv4Network('192.0.2.192/26')
_collapse_addresses_internal([ip1, ip2, ip3, ip4]) ->
[IPv4Network('192.0.2.0/24')]
This shouldn't be called directly; it is called via
collapse_addresses([]).
Args:
addresses: A list of IPv4Network's or IPv6Network's
Returns:
A list of IPv4Network's or IPv6Network's depending on what we were
passed.
N)�list�pop�supernet�get�append�sorted�values�broadcast_address)rS Zto_merge�subnetsrb rf ZexistingrV r r r � _collapse_addresses_internalw s$
rm c C s8 g }g }g }x�| D ]�}t |t�rT|rH|d j|jkrHtd||d f ��|j|� q|j|jkr�|r�|d j|jkr�td||d f ��y|j|j� W q� tk
r� |j|j � Y q�X q|r�|d j|jkr�td||d f ��|j|� qW t
t |��}|�r,x&t |�D ]\}}|j
t||�� �qW t|| �S ) a� Collapse a list of IP objects.
Example:
collapse_addresses([IPv4Network('192.0.2.0/25'),
IPv4Network('192.0.2.128/25')]) ->
[IPv4Network('192.0.2.0/24')]
Args:
addresses: An iterator of IPv4Network or IPv6Network objects.
Returns:
An iterator of the collapsed IPv(4|6)Network objects.
Raises:
TypeError: If passed a list of mixed version objects.
r z%%s and %s are not of the same version���rn rn rn rn rn )r: r] �_versionr^ rh �
_prefixlenr` rW �AttributeError�network_addressri �setrX �extendrc rm )rS ZaddrsZipsZnetsrW rU rV r r r �collapse_addresses� s4
ru c C s( t | t�r| j� S t | t�r$| j� S tS )a2 Return a key suitable for sorting between networks and addresses.
Address and Network objects are not sortable by default; they're
fundamentally different so the expression
IPv4Address('192.0.2.0') <= IPv4Network('192.0.2.0/24')
doesn't make any sense. There are some times however, where you may wish
to have ipaddress sort these for you anyway. If you need to do this, you
can use this function as the key= argument to sorted().
Args:
obj: either a Network or Address object.
Returns:
appropriate key.
)r: � _BaseNetwork�_get_networks_keyr] �_get_address_keyr) )�objr r r �get_mixed_type_key� s
rz c @ s� e Zd ZdZf Zedd� �Zedd� �Zedd� �Zedd � �Z d
d � Z
d d
� Z e dd� �Z
e dd� �Ze dd� �Ze dd� �Ze dd� �Zdd� ZdS )�_IPAddressBasezThe mother class.c C s | j � S )z:Return the longhand version of the IP address as a string.)� _explode_shorthand_ip_string)r& r r r �exploded� s z_IPAddressBase.explodedc C s t | �S )z;Return the shorthand version of the IP address as a string.)rK )r& r r r �
compressed s z_IPAddressBase.compressedc C s | j � S )aI The name of the reverse DNS pointer for the IP address, e.g.:
>>> ipaddress.ip_address("127.0.0.1").reverse_pointer
'1.0.0.127.in-addr.arpa'
>>> ipaddress.ip_address("2001:db8::1").reverse_pointer
'1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.8.b.d.0.1.0.0.2.ip6.arpa'
)�_reverse_pointer)r& r r r �reverse_pointer s z _IPAddressBase.reverse_pointerc C s dt | �f }t|��d S )Nz %200s has no version specified)�typer )r& �msgr r r r_ s z_IPAddressBase.versionc C sF |dk r d}t ||| jf ��|| jkrBd}t ||| j| jf ��d S )Nr z-%d (< 0) is not permitted as an IPv%d addressz2%d (>= 2**%d) is not permitted as an IPv%d address)r5 ro ra r` )r& r= r� r r r �_check_int_address s
z!_IPAddressBase._check_int_addressc C s. t |�}||kr*d}t||||| jf ��d S )Nz~%r (len %d != %d) is not permitted as an IPv%d address. Did you pass in a bytes (str in Python 2) instead of a unicode object?)rM r5 ro )r& r= Z expected_lenZ address_lenr� r r r �_check_packed_address s
z$_IPAddressBase._check_packed_addressc C s | j | j |? A S )z�Turn the prefix length into a bitwise netmask
Args:
prefixlen: An integer, the prefix length.
Returns:
An integer.
)ra )�cls� prefixlenr r r �_ip_int_from_prefix+ s z"_IPAddressBase._ip_int_from_prefixc C s\ t || j�}| j| }||? }d|> d }||krX| jd }t||d�}d}t|| ��|S )a Return prefix length from the bitwise netmask.
Args:
ip_int: An integer, the netmask in expanded bitwise format
Returns:
An integer, the prefix length.
Raises:
ValueError: If the input intermingles zeroes & ones
r r
rF z&Netmask pattern %r mixes zeroes & ones)r[ r` r r< ) r� �ip_intZtrailing_zeroesr� Z leading_onesZall_onesZbyteslenZdetailsr� r r r �_prefix_from_ip_int8 s
z"_IPAddressBase._prefix_from_ip_intc C s d| }t |��d S )Nz%r is not a valid netmask)r7 )r� Z netmask_strr� r r r �_report_invalid_netmaskQ s z&_IPAddressBase._report_invalid_netmaskc C sj t jj|�s| j|� y t|�}W n tk
r@ | j|� Y nX d| koV| jkn sf| j|� |S )a Return prefix length from a numeric string
Args:
prefixlen_str: The string to be converted
Returns:
An integer, the prefix length.
Raises:
NetmaskValueError: If the input is not a valid netmask
r )�_BaseV4�_DECIMAL_DIGITS�
issupersetr� �intr< r` )r� Z
prefixlen_strr� r r r �_prefix_from_prefix_stringV s
z)_IPAddressBase._prefix_from_prefix_stringc C s� y| j |�}W n tk
r, | j|� Y nX y
| j|�S tk
rL Y nX || jN }y
| j|�S tk
r� | j|� Y nX dS )a Turn a netmask/hostmask string into a prefix length
Args:
ip_str: The netmask/hostmask to be converted
Returns:
An integer, the prefix length.
Raises:
NetmaskValueError: If the input is not a valid netmask/hostmask
N)�_ip_int_from_stringr5 r� r� r< ra )r� �ip_strr� r r r �_prefix_from_ip_stringo s
z%_IPAddressBase._prefix_from_ip_stringc C s | j t| �ffS )N)� __class__rK )r& r r r �
__reduce__� s z_IPAddressBase.__reduce__N)r1 r2 r3 r6 r4 �propertyr} r~ r� r_ r� r� � classmethodr� r� r� r� r� r� r r r r r{ � s
"r{ c @ sd e Zd ZdZf Zdd� Zdd� Zdd� Zdd � Zd
d � Z d d
� Z
dd� Z dd� Z dd� Z
dd� ZdS )r] z�A generic IP object.
This IP class contains the version independent methods which are
used by single IP addresses.
c C s | j S )N)rR )r& r r r �__int__� s z_BaseAddress.__int__c C s2 y| j |j ko| j|jkS tk
r, tS X d S )N)rR ro rq r) )r& r' r r r r( � s
z_BaseAddress.__eq__c C s` t |t�stS t |t�s(td| |f ��| j|jkrDtd| |f ��| j|jkr\| j|jk S dS )Nz"%s and %s are not of the same typez%%s and %s are not of the same versionF)r: r{ r) r] r^ ro rR )r& r' r r r r, � s
z_BaseAddress.__lt__c C s t |t�stS | jt| �| �S )N)r: �_compat_int_typesr) r� r� )r& r' r r r �__add__� s
z_BaseAddress.__add__c C s t |t�stS | jt| �| �S )N)r: r� r) r� r� )r& r' r r r �__sub__� s
z_BaseAddress.__sub__c C s d| j jt| �f S )Nz%s(%r))r� r1 rK )r& r r r �__repr__� s z_BaseAddress.__repr__c C s t | j| j��S )N)rK �_string_from_ip_intrR )r& r r r �__str__� s z_BaseAddress.__str__c C s t tt| j���S )N)�hash�hexr� rR )r& r r r �__hash__� s z_BaseAddress.__hash__c C s
| j | fS )N)ro )r& r r r rx � s z _BaseAddress._get_address_keyc C s | j | jffS )N)r� rR )r& r r r r� � s z_BaseAddress.__reduce__N)r1 r2 r3 r6 r4 r� r( r, r� r� r� r� r� rx r� r r r r r] � s r] c @ sX e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zedd� �Zedd� �Zed d � �Zed d � �Zed d!� �Zed"d#� �Zed$d%� �Zed&d'� �Zd(d)� Zd*d+� Zd,d-� ZdFd0d1�ZdGd2d3�Z ed4d5� �Z d6d7� Z d8d9� Z ed:d;� �Z ed<d=� �Z!ed>d?� �Z"ed@dA� �Z#edBdC� �Z$edDdE� �Z%d/S )Hrv z~A generic IP network object.
This IP class contains the version independent methods which are
used by networks.
c C s
i | _ d S )N)�_cache)r& r= r r r �__init__� s z_BaseNetwork.__init__c C s d| j jt| �f S )Nz%s(%r))r� r1 rK )r& r r r r� � s z_BaseNetwork.__repr__c C s d| j | jf S )Nz%s/%d)rr r� )r& r r r r� � s z_BaseNetwork.__str__c c s< t | j�}t | j�}x"t|d |�D ]}| j|�V q$W dS )z�Generate Iterator over usable hosts in a network.
This is like __iter__ except it doesn't return the network
or broadcast addresses.
r N)r� rr rk r$ �_address_class)r& �network� broadcast�xr r r �hosts� s
z_BaseNetwork.hostsc c s< t | j�}t | j�}x"t||d �D ]}| j|�V q$W d S )Nr )r� rr rk r$ r� )r& r� r� r� r r r �__iter__� s
z_BaseNetwork.__iter__c C sl t | j�}t | j�}|dkr>|| |kr0td��| j|| �S |d7 }|| |k rZtd��| j|| �S d S )Nr zaddress out of ranger )r� rr rk �
IndexErrorr� )r& �nr� r� r r r � __getitem__� s
z_BaseNetwork.__getitem__c C sx t |t�stS t |t�s(td| |f ��| j|jkrDtd| |f ��| j|jkr\| j|jk S | j|jkrt| j|jk S dS )Nz"%s and %s are not of the same typez%%s and %s are not of the same versionF)r: r{ r) rv r^ ro rr �netmask)r& r' r r r r, s
z_BaseNetwork.__lt__c C sF y,| j |j ko,| j|jko,t| j�t|j�kS tk
r@ tS X d S )N)ro rr r� r� rq r) )r& r' r r r r( s z_BaseNetwork.__eq__c C s t t| j�t| j�A �S )N)r� r� rr r� )r& r r r r� s z_BaseNetwork.__hash__c C sL | j |j krdS t|t�r dS t| j�t|j� koBt| j�kS S d S )NF)ro r: rv r� rr rR rk )r& r' r r r � __contains__ s
z_BaseNetwork.__contains__c C s( | j |kp&| j|kp&|j | kp&|j| kS )z*Tell if self is partly contained in other.)rr rk )r& r' r r r �overlaps) s
z_BaseNetwork.overlapsc C s< | j jd�}|d kr8| jt| j�t| j�B �}|| j d< |S )Nrk )r� rg r� r� rr �hostmask)r& r� r r r rk 0 s
z _BaseNetwork.broadcast_addressc C s8 | j jd�}|d kr4| jt| j�| jA �}|| j d< |S )Nr� )r� rg r� r� r� ra )r& r� r r r r� 9 s
z_BaseNetwork.hostmaskc C s d| j | jf S )Nz%s/%d)rr rp )r& r r r �with_prefixlenA s z_BaseNetwork.with_prefixlenc C s d| j | jf S )Nz%s/%s)rr r� )r& r r r � with_netmaskE s z_BaseNetwork.with_netmaskc C s d| j | jf S )Nz%s/%s)rr r� )r& r r r �
with_hostmaskI s z_BaseNetwork.with_hostmaskc C s t | j�t | j� d S )z&Number of hosts in the current subnet.r )r� rk rr )r& r r r �
num_addressesM s z_BaseNetwork.num_addressesc C s dt | �f }t|��d S )Nz%%200s has no associated address class)r� r )r& r� r r r r� R s z_BaseNetwork._address_classc C s | j S )N)rp )r& r r r r� Z s z_BaseNetwork.prefixlenc c s | j |j ks td| |f ��t|t�s2td| ��|j| �sLtd|| f ��|| krXdS |jd|j|jf �}| j � \}}xb||kr�||kr�|j|�r�|V |j � \}}q||j|�r�|V |j � \}}q|t
d|||f ��q|W ||kr�|V n$||k�r |V nt
d|||f ��dS )a� Remove an address from a larger block.
For example:
addr1 = ip_network('192.0.2.0/28')
addr2 = ip_network('192.0.2.1/32')
list(addr1.address_exclude(addr2)) =
[IPv4Network('192.0.2.0/32'), IPv4Network('192.0.2.2/31'),
IPv4Network('192.0.2.4/30'), IPv4Network('192.0.2.8/29')]
or IPv6:
addr1 = ip_network('2001:db8::1/32')
addr2 = ip_network('2001:db8::1/128')
list(addr1.address_exclude(addr2)) =
[ip_network('2001:db8::1/128'),
ip_network('2001:db8::2/127'),
ip_network('2001:db8::4/126'),
ip_network('2001:db8::8/125'),
...
ip_network('2001:db8:8000::/33')]
Args:
other: An IPv4Network or IPv6Network object of the same type.
Returns:
An iterator of the IPv(4|6)Network objects which is self
minus other.
Raises:
TypeError: If self and other are of differing address
versions, or if other is not a network object.
ValueError: If other is not completely contained by self.
z%%s and %s are not of the same versionz%s is not a network objectz%s not contained in %sNz%s/%sz3Error performing exclusion: s1: %s s2: %s other: %s) ro r^ r: rv � subnet_ofr< r� rr r� rl �AssertionError)r& r' �s1�s2r r r �address_exclude^ s6 $
z _BaseNetwork.address_excludec C s` | j |j kr td| |f ��| j|jk r,dS | j|jkr<dS | j|jk rLdS | j|jkr\dS dS )a� Compare two IP objects.
This is only concerned about the comparison of the integer
representation of the network addresses. This means that the
host bits aren't considered at all in this method. If you want
to compare host bits, you can easily enough do a
'HostA._ip < HostB._ip'
Args:
other: An IP object.
Returns:
If the IP versions of self and other are the same, returns:
-1 if self < other:
eg: IPv4Network('192.0.2.0/25') < IPv4Network('192.0.2.128/25')
IPv6Network('2001:db8::1000/124') <
IPv6Network('2001:db8::2000/124')
0 if self == other
eg: IPv4Network('192.0.2.0/24') == IPv4Network('192.0.2.0/24')
IPv6Network('2001:db8::1000/124') ==
IPv6Network('2001:db8::1000/124')
1 if self > other
eg: IPv4Network('192.0.2.128/25') > IPv4Network('192.0.2.0/25')
IPv6Network('2001:db8::2000/124') >
IPv6Network('2001:db8::1000/124')
Raises:
TypeError if the IP versions are different.
z"%s and %s are not of the same typer r rn rn )ro r^ rr r� )r& r' r r r �compare_networks� s ! z _BaseNetwork.compare_networksc C s | j | j| jfS )z�Network-only key function.
Returns an object that identifies this address' network and
netmask. This function is a suitable "key" argument for sorted()
and list.sort().
)ro rr r� )r& r r r rw � s z _BaseNetwork._get_networks_keyr Nc c s� | j | jkr| V dS |dk rJ|| j k r0td��|dkr@td��|| j }|dk rZtd��| j | }|| jkr~td|| f ��t| j�}t| j�d }t| j�d |? }x(t|||�D ]}| j||f�}|V q�W dS )a� The subnets which join to make the current subnet.
In the case that self contains only one IP
(self._prefixlen == 32 for IPv4 or self._prefixlen == 128
for IPv6), yield an iterator with just ourself.
Args:
prefixlen_diff: An integer, the amount the prefix length
should be increased by. This should not be set if
new_prefix is also set.
new_prefix: The desired new prefix length. This must be a
larger number (smaller prefix) than the existing prefix.
This should not be set if prefixlen_diff is also set.
Returns:
An iterator of IPv(4|6) objects.
Raises:
ValueError: The prefixlen_diff is too small or too large.
OR
prefixlen_diff and new_prefix are both set or new_prefix
is a smaller number than the current prefix (smaller
number means a larger network)
Nznew prefix must be longerr z(cannot set prefixlen_diff and new_prefixr z prefix length diff must be > 0z0prefix length diff %d is invalid for netblock %s) rp r` r< r� rr rk r� r$ r� ) r& �prefixlen_diff�
new_prefix�
new_prefixlenr! r" r# Znew_addrZcurrentr r r rl � s,
z_BaseNetwork.subnetsc C s� | j dkr| S |dk rB|| j kr(td��|dkr8td��| j | }| j| }|dk rftd| j|f ��| jt| j�t| j�|> @ |f�S )a� The supernet containing the current network.
Args:
prefixlen_diff: An integer, the amount the prefix length of
the network should be decreased by. For example, given a
/24 network and a prefixlen_diff of 3, a supernet with a
/21 netmask is returned.
Returns:
An IPv4 network object.
Raises:
ValueError: If self.prefixlen - prefixlen_diff < 0. I.e., you have
a negative prefix length.
OR
If prefixlen_diff and new_prefix are both set or new_prefix is a
larger number than the current prefix (larger number means a
smaller network)
r Nznew prefix must be shorterr z(cannot set prefixlen_diff and new_prefixz;current prefixlen is %d, cannot have a prefixlen_diff of %d)rp r< r� r� r� rr r� )r& r� r� r� r r r rf s
z_BaseNetwork.supernetc C s | j jo| jjS )z�Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is a multicast address.
See RFC 2373 2.7 for details.
)rr � is_multicastrk )r& r r r r� A s z_BaseNetwork.is_multicastc C sP | j |j krdS t|d�r<t|d�r<|j| jko:|j| jkS tdt|� ��d S )NFrr rk z9Unable to test subnet containment with element of type %s)ro �hasattrrr rk r^ r� )r& r' r r r r� M s
z_BaseNetwork.subnet_ofc C sP | j |j krdS t|d�r<t|d�r<|j| jko:|j| jkS tdt|� ��d S )NFrr rk z9Unable to test subnet containment with element of type %s)ro r� rr rk r^ r� )r& r' r r r � supernet_of[ s
z_BaseNetwork.supernet_ofc C s | j jo| jjS )z�Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within one of the
reserved IPv6 Network ranges.
)rr � is_reservedrk )r& r r r r� i s z_BaseNetwork.is_reservedc C s | j jo| jjS )z�Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is reserved per RFC 4291.
)rr �
is_link_localrk )r& r r r r� u s z_BaseNetwork.is_link_localc C s | j jo| jjS )z�Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv4-special-registry or iana-ipv6-special-registry.
)rr �
is_privaterk )r& r r r r� � s z_BaseNetwork.is_privatec C s | j S )z�Test if this address is allocated for public networks.
Returns:
A boolean, True if the address is not reserved per
iana-ipv4-special-registry or iana-ipv6-special-registry.
)r� )r& r r r � is_global� s z_BaseNetwork.is_globalc C s | j jo| jjS )z�Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 2373 2.5.2.
)rr �is_unspecifiedrk )r& r r r r� � s z_BaseNetwork.is_unspecifiedc C s | j jo| jjS )z�Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback address as defined in
RFC 2373 2.5.3.
)rr � is_loopbackrk )r& r r r r� � s z_BaseNetwork.is_loopback)r N)r N)&r1 r2 r3 r6 r� r� r� r� r� r� r, r( r� r� r� r� rk r� r� r� r� r� r� r� r� r� rw rl rf r� r� r� r� r� r� r� r� r� r r r r rv � sD
K0
5
) rv c
@ s� e Zd ZdZf ZdZde d Zed�Z edddd d
d d d
dg �Z
eZ i Z dd� Z
edd� �Zedd� �Zedd� �Zedd� �Zdd� Zdd � Zed d � �Zed d � �Zd!S )"r� zyBase IPv4 object.
The following methods are used by IPv4 objects in both single IP
addresses and networks.
r r r �
0123456789� � � � �� �� � r r c C s t | �S )N)rK )r& r r r r| � s z$_BaseV4._explode_shorthand_ip_stringc C sn || j krdt|t�r|}n.y| j|�}W n tk
rF | j|�}Y nX t| j|��}||f| j |< | j | S )a Make a (netmask, prefix_len) tuple from the given argument.
Argument can be:
- an integer (the prefix length)
- a string representing the prefix length (e.g. "24")
- a string representing the prefix netmask (e.g. "255.255.255.0")
)�_netmask_cacher: r� r� r7 r� r8 r� )r� �argr� r� r r r �
_make_netmask� s
z_BaseV4._make_netmaskc C sx |s t d��|jd�}t|�dkr.t d| ��ytt| j|�d�S tk
rr } zt d||f ��W Y dd}~X nX dS )a Turn the given IP string into an integer for comparison.
Args:
ip_str: A string, the IP ip_str.
Returns:
The IP ip_str as an integer.
Raises:
AddressValueError: if ip_str isn't a valid IPv4 Address.
zAddress cannot be empty�.r zExpected 4 octets in %rrF z%s in %rN)r5 rL rM r �map� _parse_octetr< )r� r� Zoctets�excr r r r� � s
z_BaseV4._ip_int_from_stringc C s� |s t d��| jj|�s(d}t || ��t|�dkrDd}t || ��t|d�}|dkrr|d dkrrd }t || ��|d
kr�t d | ��|S ) a Convert a decimal octet into an integer.
Args:
octet_str: A string, the number to parse.
Returns:
The octet as an integer.
Raises:
ValueError: if the octet isn't strictly a decimal from [0..255].
zEmpty octet not permittedz#Only decimal digits permitted in %r� z$At most 3 characters permitted in %r�
� r �0z3Ambiguous (octal/decimal) value in %r not permittedr� z Octet %d (> 255) not permitted)r< r� r� rM r� )r� Z octet_strr� Z octet_intr r r r� � s
z_BaseV4._parse_octetc C s dj dd� t|dd�D ��S )z�Turns a 32-bit integer into dotted decimal notation.
Args:
ip_int: An integer, the IP address.
Returns:
The IP address as a string in dotted decimal notation.
r� c s s0 | ](}t t|t�r"tjd |�d n|�V qdS )s !Br N)rK r: r; r r )r
r r r r � <genexpr>- s z._BaseV4._string_from_ip_int.<locals>.<genexpr>r rF )�joinr )r� r� r r r r� " s
z_BaseV4._string_from_ip_intc sh |j d�}y � fdd�tt|�D �}W n tk
r: dS X t|�t|�krPdS |d |d k rddS dS ) z�Test if the IP string is a hostmask (rather than a netmask).
Args:
ip_str: A string, the potential hostmask.
Returns:
A boolean, True if the IP string is a hostmask.
r� c s g | ]}|� j kr|�qS r )�_valid_mask_octets)r
r� )r& r r r > s z(_BaseV4._is_hostmask.<locals>.<listcomp>Fr r Trn )rL r� r� r< rM )r& r� rZ �partsr )r& r � _is_hostmask2 s
z_BaseV4._is_hostmaskc C s& t | �jd�ddd� }dj|�d S )z�Return the reverse DNS pointer name for the IPv4 address.
This implements the method described in RFC1035 3.5.
r� Nr z
.in-addr.arparn )rK rL r� )r& Zreverse_octetsr r r r G s z_BaseV4._reverse_pointerc C s | j S )N)r` )r& r r r �
max_prefixlenP s z_BaseV4.max_prefixlenc C s | j S )N)ro )r& r r r r_ T s z_BaseV4.versionN)r1 r2 r3 r6 r4 ro �
IPV4LENGTHra � frozensetr� r� r` r� r| r� r� r� r� r� r� r r� r� r_ r r r r r� � s" % r� c @ s| e Zd ZdZdZdd� Zedd� �Zedd � �Zed
d � �Z ed d
� �Z
edd� �Z edd� �Z edd� �Z
edd� �ZdS )r8 z/Represent and manipulate single IPv4 Addresses.rR � __weakref__c C sx t |t�r | j|� || _dS t |t�rL| j|d� t|�}t|d�| _dS t|�}d|krht d| ��| j
|�| _dS )a�
Args:
address: A string or integer representing the IP
Additionally, an integer can be passed, so
IPv4Address('192.0.2.1') == IPv4Address(3221225985).
or, more generally
IPv4Address(int(IPv4Address('192.0.2.1'))) ==
IPv4Address('192.0.2.1')
Raises:
AddressValueError: If ipaddress isn't a valid IPv4 address.
Nr rF rJ zUnexpected '/' in %r) r: r� r� rR r; r� r r rK r5 r� )r& r= �bvs�addr_strr r r r� _ s
zIPv4Address.__init__c C s
t | j�S )z*The binary representation of this address.)rH rR )r& r r r �packed� s zIPv4Address.packedc C s | | j jkS )z�Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within the
reserved IPv4 Network range.
)�
_constants�_reserved_network)r& r r r r� � s zIPv4Address.is_reservedc s t � fdd�� jjD ��S )z�Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv4-special-registry.
c 3 s | ]}� |kV qd S )Nr )r
rb )r& r r r� � s z)IPv4Address.is_private.<locals>.<genexpr>)�anyr� �_private_networks)r& r )r& r r� � s zIPv4Address.is_privatec C s | | j jko| j S )N)r� �_public_networkr� )r& r r r r� � s zIPv4Address.is_globalc C s | | j jkS )z�Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is multicast.
See RFC 3171 for details.
)r� �_multicast_network)r& r r r r� � s zIPv4Address.is_multicastc C s | | j jkS )z�Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 5735 3.
)r� �_unspecified_address)r& r r r r� � s zIPv4Address.is_unspecifiedc C s | | j jkS )z�Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback per RFC 3330.
)r� �_loopback_network)r& r r r r� � s zIPv4Address.is_loopbackc C s | | j jkS )z�Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is link-local per RFC 3927.
)r� �_linklocal_network)r& r r r r� � s zIPv4Address.is_link_localN)rR r� )r1 r2 r3 r6 r4 r� r� r� r� r� r� r� r� r� r� r r r r r8 Y s $
r8 c @ sj e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zej Z e
d d � �Z e
d
d� �Z e
dd� �Z
e
dd� �ZdS )rC c C s� t |ttf�r2tj| |� t| j�| _| j| _ d S t |t
�r�tj| |d � t |�dkrht |d �| _ n| j| _ t|dd�| _| jj
| _
| jj| _d S t|�}tj| |d � t|dd�| _| jj | _ | jj
| _
| jj| _d S )Nr r F)rA )r: r; r� r8 r� r? rR r� r` rp �tuplerM r� r� r� rO )r& r= rN r r r r� � s(
zIPv4Interface.__init__c C s d| j | j�| jjf S )Nz%s/%d)r� rR r� r� )r& r r r r� � s zIPv4Interface.__str__c C sD t j| |�}| s|tkr |S y | j|jkS tk
r> dS X d S )NF)r8 r( r) r� rq )r& r' �
address_equalr r r r( � s zIPv4Interface.__eq__c C s> t j| |�}|tkrtS y | j|jk S tk
r8 dS X d S )NF)r8 r, r) r� rq )r& r' � address_lessr r r r, � s zIPv4Interface.__lt__c C s | j | jA t| jj�A S )N)rR rp r� r� rr )r& r r r r� s zIPv4Interface.__hash__c C s
t | j�S )N)r8 rR )r& r r r rW
s zIPv4Interface.ipc C s d| j | j�| jf S )Nz%s/%s)r� rR rp )r& r r r r� s z IPv4Interface.with_prefixlenc C s d| j | j�| jf S )Nz%s/%s)r� rR r� )r& r r r r� s zIPv4Interface.with_netmaskc C s d| j | j�| jf S )Nz%s/%s)r� rR r� )r& r r r r� s zIPv4Interface.with_hostmaskN)r1 r2 r3 r� r� r( r, r� r{ r� r� rW r� r� r� r r r r rC � s rC c @ s* e Zd ZdZeZddd�Zedd� �ZdS ) r? ae This class represents and manipulates 32-bit IPv4 network + addresses..
Attributes: [examples for IPv4Network('192.0.2.0/27')]
.network_address: IPv4Address('192.0.2.0')
.hostmask: IPv4Address('0.0.0.31')
.broadcast_address: IPv4Address('192.0.2.32')
.netmask: IPv4Address('255.255.255.224')
.prefixlen: 27
Tc C s| t j| |� t|ttf�r<t|�| _| j| j�\| _ | _
dS t|t �r�t |�dkr\|d }n| j}t|d �| _| j|�\| _ | _
t
| j�}|t
| j �@ |kr�|r�td| ��nt|t
| j �@ �| _dS t|�}t| j|d ��| _t |�dkr�|d }n| j}| j|�\| _ | _
|�rDtt
| j�t
| j �@ �| jk�rDtd| ��tt
| j�t
| j �@ �| _| j
| jd k�rx| j| _dS )a Instantiate a new IPv4 network object.
Args:
address: A string or integer representing the IP [& network].
'192.0.2.0/24'
'192.0.2.0/255.255.255.0'
'192.0.0.2/0.0.0.255'
are all functionally the same in IPv4. Similarly,
'192.0.2.1'
'192.0.2.1/255.255.255.255'
'192.0.2.1/32'
are also functionally equivalent. That is to say, failing to
provide a subnetmask will create an object with a mask of /32.
If the mask (portion after the / in the argument) is given in
dotted quad form, it is treated as a netmask if it starts with a
non-zero field (e.g. /255.0.0.0 == /8) and as a hostmask if it
starts with a zero field (e.g. 0.255.255.255 == /8), with the
single exception of an all-zero mask which is treated as a
netmask == /0. If no mask is given, a default of /32 is used.
Additionally, an integer can be passed, so
IPv4Network('192.0.2.1') == IPv4Network(3221225985)
or, more generally
IPv4Interface(int(IPv4Interface('192.0.2.1'))) ==
IPv4Interface('192.0.2.1')
Raises:
AddressValueError: If ipaddress isn't a valid IPv4 address.
NetmaskValueError: If the netmask isn't valid for
an IPv4 address.
ValueError: If strict is True and a network address is not
supplied.
Nr r z%s has host bits setr )rv r� r: r� r; r8 rr r� r` r� rp r� rM r� r< rO r� r� r� )r& r= rA r� r� rN r r r r� 0 sB %
zIPv4Network.__init__c C s& | j td�ko| jtd�k o$| j S )z�Test if this address is allocated for public networks.
Returns:
A boolean, True if the address is not reserved per
iana-ipv4-special-registry.
z
100.64.0.0/10)rr r? rk r� )r& r r r r� � s zIPv4Network.is_globalN)T) r1 r2 r3 r6 r8 r� r� r� r� r r r r r? ! s
Ur? c @ s� e Zd Zed�Zed�Zed�Zed�Zed�ed�ed�ed�ed�ed�ed �ed
�ed �ed �ed
�ed�ed�ed�gZed�Z e
d�Z dS )�_IPv4Constantsz169.254.0.0/16z 127.0.0.0/8z 224.0.0.0/4z
100.64.0.0/10z 0.0.0.0/8z
10.0.0.0/8z
172.16.0.0/12z 192.0.0.0/29z192.0.0.170/31z 192.0.2.0/24z192.168.0.0/16z
198.18.0.0/15z198.51.100.0/24z203.0.113.0/24z 240.0.0.0/4z255.255.255.255/32z0.0.0.0N) r1 r2 r3 r? r� r� r� r� r� r� r8 r� r r r r r� � s(
r� c @ s� e Zd ZdZf ZdZde d ZdZe d�Z
eZ i Z e
dd� �Ze
d d
� �Ze
d d � �Ze
d
d� �Ze
ddd��Zdd� Zdd� Zedd� �Zedd� �ZdS )�_BaseV6zyBase IPv6 object.
The following methods are used by IPv6 objects in both single IP
addresses and networks.
r\ r r r
Z0123456789ABCDEFabcdefc C sJ || j kr@t|t�r|}n
| j|�}t| j|��}||f| j |< | j | S )a Make a (netmask, prefix_len) tuple from the given argument.
Argument can be:
- an integer (the prefix length)
- a string representing the prefix length (e.g. "24")
- a string representing the prefix netmask (e.g. "255.255.255.0")
)r� r: r� r� r9 r� )r� r� r� r� r r r r� � s
z_BaseV6._make_netmaskc C s� |s t d��|jd�}d}t|�|k r:d||f }t |��d|d kr�yt|j� �j}W n2 t k
r� } zt d||f ��W Y dd}~X nX |jd |d
? d @ � |jd |d @ � | jd }t|�|kr�d |d |f }t |��d}x@tdt|�d �D ]*} || s�|dk �r d
| }t |��| }q�W |dk �r�|}
t|�| d } |d �sn|
d8 }
|
�rnd}t || ��|d �s�| d8 } | �r�d}t || ��| j|
| } | dk �r4d}t || jd |f ��njt|�| jk�r�d}t || j|f ��|d �s
d}t || ��|d �s$d}t || ��t|�}
d} d} ytd}
x,t |
�D ] } |
d
K }
|
| j
|| �O }
�qDW |
d
| K }
x0t | d�D ] } |
d
K }
|
| j
|| �O }
�q�W |
S t k
�r� } zt d||f ��W Y dd}~X nX dS )z�Turn an IPv6 ip_str into an integer.
Args:
ip_str: A string, the IPv6 ip_str.
Returns:
An int, the IPv6 address
Raises:
AddressValueError: if ip_str isn't a valid IPv6 Address.
zAddress cannot be empty�:r� z At least %d parts expected in %rr� r z%s in %rNz%xr i�� z!At most %d colons permitted in %rz At most one '::' permitted in %rr z0Leading ':' only permitted as part of '::' in %rz1Trailing ':' only permitted as part of '::' in %rz/Expected at most %d other parts with '::' in %rz,Exactly %d parts expected without '::' in %rrn rn rn ) r5 rL rM r8 re rR rh �
_HEXTET_COUNTr$ �range�
_parse_hextetr< )r� r� r� Z
_min_partsr� Zipv4_intr� Z
_max_partsZ
skip_indexr Zparts_hiZparts_loZ
parts_skippedr� r r r r� � s�
"
z_BaseV6._ip_int_from_stringc C s> | j j|�std| ��t|�dkr4d}t|| ��t|d�S )a& Convert an IPv6 hextet string into an integer.
Args:
hextet_str: A string, the number to parse.
Returns:
The hextet as an integer.
Raises:
ValueError: if the input isn't strictly a hex number from
[0..FFFF].
z Only hex digits permitted in %rr z$At most 4 characters permitted in %rr )� _HEX_DIGITSr� r< rM r� )r� Z
hextet_strr� r r r r� E s z_BaseV6._parse_hextetc C s� d}d}d}d}xJt |�D ]>\}}|dkrP|d7 }|dkr>|}||krX|}|}qd}d}qW |dkr�|| }|t|�kr�|dg7 }dg|||�< |dkr�dg| }|S ) a� Compresses a list of hextets.
Compresses a list of strings, replacing the longest continuous
sequence of "0" in the list with "" and adding empty strings at
the beginning or at the end of the string such that subsequently
calling ":".join(hextets) will produce the compressed version of
the IPv6 address.
Args:
hextets: A list of strings, the hextets to compress.
Returns:
A list of strings.
r r r� � rn rn rn rn )� enumeraterM ) r� �hextetsZbest_doublecolon_startZbest_doublecolon_lenZdoublecolon_startZdoublecolon_len�indexZhextetZbest_doublecolon_endr r r �_compress_hextets_ s.
z_BaseV6._compress_hextetsNc sZ |dkrt | j�}|| jkr$td��d| � � fdd�tddd�D �}| j|�}d j|�S )
a, Turns a 128-bit integer into hexadecimal notation.
Args:
ip_int: An integer, the IP address.
Returns:
A string, the hexadecimal representation of the address.
Raises:
ValueError: The address is bigger than 128 bits of all ones.
NzIPv6 address is too largez%032xc s& g | ] }d t � ||d � d� �qS )z%xr r )r� )r
r� )�hex_strr r r � s z/_BaseV6._string_from_ip_int.<locals>.<listcomp>r r r r� )r� rR ra r< r� r� r� )r� r� r� r )r� r r� � s
z_BaseV6._string_from_ip_intc s� t | t�rt| j�}n t | t�r,t| j�}nt| �}| j|�}d| � � fdd�tddd�D �}t | ttf�r�ddj |�| j
f S dj |�S ) z�Expand a shortened IPv6 address.
Args:
ip_str: A string, the IPv6 address.
Returns:
A string, the expanded IPv6 address.
z%032xc s g | ]}� ||d � �qS )r r )r
r� )r� r r r � s z8_BaseV6._explode_shorthand_ip_string.<locals>.<listcomp>r r r z%s/%dr� ) r: r@ rK rr rD rW r� r� rv r� rp )r& r� r� r� r )r� r r| � s
z$_BaseV6._explode_shorthand_ip_stringc C s& | j ddd� jdd�}dj|�d S )z�Return the reverse DNS pointer name for the IPv6 address.
This implements the method described in RFC3596 2.5.
Nr r� r� r� z .ip6.arparn )r} �replacer� )r& Z
reverse_charsr r r r � s z_BaseV6._reverse_pointerc C s | j S )N)r` )r& r r r r� � s z_BaseV6.max_prefixlenc C s | j S )N)ro )r& r r r r_ � s z_BaseV6.version)N)r1 r2 r3 r6 r4 ro �
IPV6LENGTHra r� r� r� r` r� r� r� r� r� r� r� r| r r� r� r_ r r r r r� � s$ i 0 r� c @ s� e Zd ZdZd Zdd� Zedd� �Zedd � �Zed
d � �Z ed d
� �Z
edd� �Z edd� �Z edd� �Z
edd� �Zedd� �Zedd� �Zedd� �Zed d � �Zd S ) r9 z/Represent and manipulate single IPv6 Addresses.rR r� c C sx t |t�r | j|� || _dS t |t�rL| j|d� t|�}t|d�| _dS t|�}d|krht d| ��| j
|�| _dS )a Instantiate a new IPv6 address object.
Args:
address: A string or integer representing the IP
Additionally, an integer can be passed, so
IPv6Address('2001:db8::') ==
IPv6Address(42540766411282592856903984951653826560)
or, more generally
IPv6Address(int(IPv6Address('2001:db8::'))) ==
IPv6Address('2001:db8::')
Raises:
AddressValueError: If address isn't a valid IPv6 address.
Nr rF rJ zUnexpected '/' in %r) r: r� r� rR r; r� r r rK r5 r� )r& r= r� r� r r r r� � s
zIPv6Address.__init__c C s
t | j�S )z*The binary representation of this address.)rI rR )r& r r r r� � s zIPv6Address.packedc C s | | j jkS )z�Test if the address is reserved for multicast use.
Returns:
A boolean, True if the address is a multicast address.
See RFC 2373 2.7 for details.
)r� r� )r& r r r r� s zIPv6Address.is_multicastc s t � fdd�� jjD ��S )z�Test if the address is otherwise IETF reserved.
Returns:
A boolean, True if the address is within one of the
reserved IPv6 Network ranges.
c 3 s | ]}� |kV qd S )Nr )r
r� )r& r r r� s z*IPv6Address.is_reserved.<locals>.<genexpr>)r� r� �_reserved_networks)r& r )r& r r� s zIPv6Address.is_reservedc C s | | j jkS )z�Test if the address is reserved for link-local.
Returns:
A boolean, True if the address is reserved per RFC 4291.
)r� r� )r& r r r r� s zIPv6Address.is_link_localc C s | | j jkS )a` Test if the address is reserved for site-local.
Note that the site-local address space has been deprecated by RFC 3879.
Use is_private to test if this address is in the space of unique local
addresses as defined by RFC 4193.
Returns:
A boolean, True if the address is reserved per RFC 3513 2.5.6.
)r� �_sitelocal_network)r& r r r �
is_site_local# s zIPv6Address.is_site_localc s t � fdd�� jjD ��S )z�Test if this address is allocated for private networks.
Returns:
A boolean, True if the address is reserved per
iana-ipv6-special-registry.
c 3 s | ]}� |kV qd S )Nr )r
rb )r& r r r� : s z)IPv6Address.is_private.<locals>.<genexpr>)r� r� r� )r& r )r& r r� 1 s zIPv6Address.is_privatec C s | j S )z�Test if this address is allocated for public networks.
Returns:
A boolean, true if the address is not reserved per
iana-ipv6-special-registry.
)r� )r& r r r r� < s zIPv6Address.is_globalc C s
| j dkS )z�Test if the address is unspecified.
Returns:
A boolean, True if this is the unspecified address as defined in
RFC 2373 2.5.2.
r )rR )r& r r r r� G s zIPv6Address.is_unspecifiedc C s
| j dkS )z�Test if the address is a loopback address.
Returns:
A boolean, True if the address is a loopback address as defined in
RFC 2373 2.5.3.
r )rR )r& r r r r� R s zIPv6Address.is_loopbackc C s | j d? dkrdS t| j d@ �S )z�Return the IPv4 mapped address.
Returns:
If the IPv6 address is a v4 mapped address, return the
IPv4 mapped address. Return None otherwise.
r i�� Nl �� )rR r8 )r& r r r � ipv4_mapped] s zIPv6Address.ipv4_mappedc C s4 | j d? dkrdS t| j d? d@ �t| j d@ �fS )z�Tuple of embedded teredo IPs.
Returns:
Tuple of the (server, client) IPs or None if the address
doesn't appear to be a teredo address (doesn't start with
2001::/32)
�` i Nr l �� )rR r8 )r& r r r �teredoj s
zIPv6Address.teredoc C s$ | j d? dkrdS t| j d? d@ �S )z�Return the IPv4 6to4 embedded address.
Returns:
The IPv4 6to4-embedded address if present or None if the
address doesn't appear to contain a 6to4 embedded address.
�p i N�P l �� )rR r8 )r& r r r � sixtofoury s zIPv6Address.sixtofourN)rR r� )r1 r2 r3 r6 r4 r� r� r� r� r� r� r r� r� r� r� r r r r r r r r9 � s %
r9 c @ s� e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zej Z e
d d � �Z e
d
d� �Z e
dd� �Z
e
dd� �Ze
dd� �Ze
dd� �ZdS )rD c C s� t |ttf�r2tj| |� t| j�| _| j| _ d S t |t
�r�tj| |d � t |�dkrht |d �| _ n| j| _ t|dd�| _| jj
| _
| jj| _d S t|�}tj| |d � t|dd�| _| jj
| _
| jj | _ | jj| _d S )Nr r F)rA )r: r; r� r9 r� r@ rR r� r` rp r� rM r� r� r� rO )r& r= rN r r r r� � s(
zIPv6Interface.__init__c C s d| j | j�| jjf S )Nz%s/%d)r� rR r� r� )r& r r r r� � s zIPv6Interface.__str__c C sD t j| |�}| s|tkr |S y | j|jkS tk
r> dS X d S )NF)r9 r( r) r� rq )r& r' r� r r r r( � s zIPv6Interface.__eq__c C s> t j| |�}|tkrtS y | j|jk S tk
r8 dS X d S )NF)r9 r, r) r� rq )r& r' r� r r r r, � s zIPv6Interface.__lt__c C s | j | jA t| jj�A S )N)rR rp r� r� rr )r& r r r r� � s zIPv6Interface.__hash__c C s
t | j�S )N)r9 rR )r& r r r rW � s zIPv6Interface.ipc C s d| j | j�| jf S )Nz%s/%s)r� rR rp )r& r r r r� � s z IPv6Interface.with_prefixlenc C s d| j | j�| jf S )Nz%s/%s)r� rR r� )r& r r r r� � s zIPv6Interface.with_netmaskc C s d| j | j�| jf S )Nz%s/%s)r� rR r� )r& r r r r� � s zIPv6Interface.with_hostmaskc C s | j dko| jjS )Nr )rR r� r� )r& r r r r� � s z IPv6Interface.is_unspecifiedc C s | j dko| jjS )Nr )rR r� r� )r& r r r r� � s zIPv6Interface.is_loopbackN)r1 r2 r3 r� r� r( r, r� r{ r� r� rW r� r� r� r� r� r r r r rD � s rD c @ s2 e Zd ZdZeZd
dd�Zdd� Zedd� �Z d S ) r@ av This class represents and manipulates 128-bit IPv6 networks.
Attributes: [examples for IPv6('2001:db8::1000/124')]
.network_address: IPv6Address('2001:db8::1000')
.hostmask: IPv6Address('::f')
.broadcast_address: IPv6Address('2001:db8::100f')
.netmask: IPv6Address('ffff:ffff:ffff:ffff:ffff:ffff:ffff:fff0')
.prefixlen: 124
Tc C s| t j| |� t|ttf�r<t|�| _| j| j�\| _ | _
dS t|t �r�t |�dkr\|d }n| j}| j|�\| _ | _
t|d �| _t
| j�}|t
| j �@ |kr�|r�td| ��nt|t
| j �@ �| _dS t|�}t| j|d ��| _t |�dkr�|d }n| j}| j|�\| _ | _
|�rDtt
| j�t
| j �@ �| jk�rDtd| ��tt
| j�t
| j �@ �| _| j
| jd k�rx| j| _dS )a� Instantiate a new IPv6 Network object.
Args:
address: A string or integer representing the IPv6 network or the
IP and prefix/netmask.
'2001:db8::/128'
'2001:db8:0000:0000:0000:0000:0000:0000/128'
'2001:db8::'
are all functionally the same in IPv6. That is to say,
failing to provide a subnetmask will create an object with
a mask of /128.
Additionally, an integer can be passed, so
IPv6Network('2001:db8::') ==
IPv6Network(42540766411282592856903984951653826560)
or, more generally
IPv6Network(int(IPv6Network('2001:db8::'))) ==
IPv6Network('2001:db8::')
strict: A boolean. If true, ensure that we have been passed
A true network address, eg, 2001:db8::1000/124 and not an
IP address on a network, eg, 2001:db8::1/124.
Raises:
AddressValueError: If address isn't a valid IPv6 address.
NetmaskValueError: If the netmask isn't valid for
an IPv6 address.
ValueError: If strict was True and a network address was not
supplied.
Nr r z%s has host bits setr )rv r� r: r; r� r9 rr r� r` r� rp r� rM r� r< rO r� r� r� )r& r= rA r� r� rN r r r r� � sB
zIPv6Network.__init__c c s@ t | j�}t | j�}x&t|d |d �D ]}| j|�V q(W dS )z�Generate Iterator over usable hosts in a network.
This is like __iter__ except it doesn't return the
Subnet-Router anycast address.
r N)r� rr rk r$ r� )r& r� r� r� r r r r� < s
zIPv6Network.hostsc C s | j jo| jjS )a` Test if the address is reserved for site-local.
Note that the site-local address space has been deprecated by RFC 3879.
Use is_private to test if this address is in the space of unique local
addresses as defined by RFC 4193.
Returns:
A boolean, True if the address is reserved per RFC 3513 2.5.6.
)rr r rk )r& r r r r H s zIPv6Network.is_site_localN)T)
r1 r2 r3 r6 r9 r� r� r� r� r r r r r r@ � s
O r@ c @ s� e Zd Zed�Zed�Zed�ed�ed�ed�ed�ed�ed �ed
�ed �ed�g
Zed �ed
�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�ed�gZed�Zd S ) �_IPv6Constantsz fe80::/10zff00::/8z::1/128z::/128z
::ffff:0:0/96z100::/64z 2001::/23z 2001:2::/48z
2001:db8::/32z 2001:10::/28zfc00::/7z::/8z100::/8z200::/7z400::/6z800::/5z1000::/4z4000::/3z6000::/3z8000::/3zA000::/3zC000::/3zE000::/4zF000::/5zF800::/6zFE00::/9z fec0::/10N) r1 r2 r3 r@ r� r� r� r r r r r r r X s*
r r )r )T)6r6 Z
__future__r r r � __version__r� r� Zlong� NameErrorZunicoderK �strr �
from_bytesr rq r r� r r$ �objectr% r� r� r< r5 r7 r> rB rE rH rI rO rX r[ rc rm ru rz r{ r] rv r� r8 rC r? r� r� r� r9 rD r@ r r r r r �<module> s�
)$
$#716 = a *vRr 5V{! pip/_vendor/__pycache__/__init__.cpython-36.pyc 0000644 00000005240 14751155150 0015372 0 ustar 00 3
���e> � @ s� d Z ddlmZ ddlZddlZddlZdZejj ejj
e ��Z dd� Z
e�r�ejejje d��ej ejdd�< e
d� e
d � e
d
� e
d � e
d � e
d
� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d � e
d � e
d � e
d � e
d � e
d!� e
d"� e
d#� e
d$� e
d%� e
d&� e
d'� e
d(� e
d)� e
d*� e
d+� e
d,� e
d-� e
d.� e
d/� e
d0� e
d1� e
d2� dS )3z�
pip._vendor is for vendoring dependencies of pip to prevent needing pip to
depend on something external.
Files inside of pip._vendor should be considered immutable and should only be
updated to versions from upstream.
� )�absolute_importNFc C s� dj t| �}yt|t� t� dd� W nz tk
r� yt| t� t� dd� W n tk
r` Y n:X tj| tj|< |jdd�\}}t tj| |tj| � Y nX d S )Nz{0}.{1}r )�level�.� )
�format�__name__�
__import__�globals�locals� ImportError�sys�modules�rsplit�setattr)Z
modulenameZ
vendored_name�base�head� r � /usr/lib/python3.6/__init__.py�vendored s r z*.whlZ cachecontrolZcoloramaZdistlibZdistroZhtml5libZlockfileZsixz six.moveszsix.moves.urllibZ packagingzpackaging.versionzpackaging.specifiersZ
pkg_resourcesZprogressZretryingZrequestszrequests.packageszrequests.packages.urllib3z&requests.packages.urllib3._collectionsz$requests.packages.urllib3.connectionz(requests.packages.urllib3.connectionpoolz!requests.packages.urllib3.contribz*requests.packages.urllib3.contrib.ntlmpoolz+requests.packages.urllib3.contrib.pyopensslz$requests.packages.urllib3.exceptionsz requests.packages.urllib3.fieldsz"requests.packages.urllib3.filepostz"requests.packages.urllib3.packagesz/requests.packages.urllib3.packages.ordered_dictz&requests.packages.urllib3.packages.sixz5requests.packages.urllib3.packages.ssl_match_hostnamezErequests.packages.urllib3.packages.ssl_match_hostname._implementationz%requests.packages.urllib3.poolmanagerz!requests.packages.urllib3.requestz"requests.packages.urllib3.responsez requests.packages.urllib3.utilz)requests.packages.urllib3.util.connectionz&requests.packages.urllib3.util.requestz'requests.packages.urllib3.util.responsez$requests.packages.urllib3.util.retryz#requests.packages.urllib3.util.ssl_z&requests.packages.urllib3.util.timeoutz"requests.packages.urllib3.util.url)�__doc__Z
__future__r ZglobZos.path�osr Z DEBUNDLED�path�abspath�dirname�__file__Z WHEEL_DIRr �joinr r r r �<module> sh $ pip/_vendor/__pycache__/retrying.cpython-36.opt-1.pyc 0000644 00000017525 14751155150 0016446 0 ustar 00 3
���e�& � @ sl d dl Z d dlmZ d dlZd dlZd dlZdZdd� ZG dd� de�Z G dd � d e�Z
G d
d � d e �Z dS ) � N)�sixi���?c sB t � �dkr,t� d �r,dd� }|� d �S � �fdd�}|S dS )z�
Decorator function that instantiates the Retrying object
@param *dargs: positional arguments passed to Retrying object
@param **dkw: keyword arguments passed to the Retrying object
� r c s t j� �� fdd��}|S )Nc s t � j� f| �|�S )N)�Retrying�call)�args�kw)�f� � /usr/lib/python3.6/retrying.py� wrapped_f$ s z-retry.<locals>.wrap_simple.<locals>.wrapped_f)r �wraps)r r r )r r
� wrap_simple" s zretry.<locals>.wrap_simplec s t j� ���� fdd��}|S )Nc s t � ��j�f| �|�S )N)r r )r r )�dargs�dkwr r r
r / s z&retry.<locals>.wrap.<locals>.wrapped_f)r r )r r )r r )r r
�wrap- s zretry.<locals>.wrapN)�len�callable)r r r
r r )r r r
�retry s
r c @ sn e Zd Zddd�Zdd� Zdd� Zd d
� Zd d � Zd
d� Zdd� Z dd� Z
dd� Z dd� Z dd� Z
dd� ZdS ) r NFc s |d kr dn|| _ |d kr dn|| _|d kr0dn|| _|d krBdn|| _|d krTdn|| _|d krfdn|| _| d krxdn| | _|
d kr�dn|
| _| d kr�tn| | _ |d kr�dn|| _
g � |d k r̈ j | j � |d k r� j | j
� |d k r�|| _n&|d k�r
� fdd�| _n t| |�| _dd� g�|d k �r6�j | j� |d k �sJ|d k �rV�j | j� |d k �sj| d k �rv�j | j� |
d k �s�| d k �r��j | j� |d k �r�|| _n&|d k�rfd d�| _n t| |�| _| d k�r�| j| _n| | _|
d k�r�| j| _n|
| _|| _d S )
N� �d i� r r c s t � �fdd��D ��S )Nc 3 s | ]}|� ��V qd S )Nr )�.0r )�attempts�delayr r
� <genexpr>a s z6Retrying.__init__.<locals>.<lambda>.<locals>.<genexpr>)�any)r r )�
stop_funcs)r r r
�<lambda>a s z#Retrying.__init__.<locals>.<lambda>c _ s dS )Nr r )r �kwargsr r r
r h s c s t � �fdd��D ��S )Nc 3 s | ]}|� ��V qd S )Nr )r r )r r r r
r y s z6Retrying.__init__.<locals>.<lambda>.<locals>.<genexpr>)�max)r r )�
wait_funcs)r r r
r y s )�_stop_max_attempt_number�_stop_max_delay� _wait_fixed�_wait_random_min�_wait_random_max�_wait_incrementing_start� _wait_incrementing_increment� _wait_exponential_multiplier�MAX_WAIT�_wait_exponential_max�_wait_jitter_max�append�stop_after_attempt�stop_after_delay�stop�getattr� fixed_sleep� random_sleep�incrementing_sleep�exponential_sleep�wait�
always_reject�_retry_on_exception� never_reject�_retry_on_result�_wrap_exception)�selfr. r4 Zstop_max_attempt_numberZstop_max_delayZ
wait_fixedZwait_random_minZwait_random_maxZwait_incrementing_startZwait_incrementing_incrementZwait_exponential_multiplierZwait_exponential_maxZretry_on_exceptionZretry_on_result�wrap_exceptionZ stop_funcZ wait_funcZwait_jitter_maxr )r r r
�__init__: sR
zRetrying.__init__c C s
|| j kS )z;Stop after the previous attempt >= stop_max_attempt_number.)r )r: �previous_attempt_number� delay_since_first_attempt_msr r r
r, � s zRetrying.stop_after_attemptc C s
|| j kS )z=Stop after the time from the first attempt >= stop_max_delay.)r! )r: r= r> r r r
r- � s zRetrying.stop_after_delayc C s dS )z#Don't sleep at all before retrying.r r )r: r= r> r r r
�no_sleep� s zRetrying.no_sleepc C s | j S )z0Sleep a fixed amount of time between each retry.)r" )r: r= r> r r r
r0 � s zRetrying.fixed_sleepc C s t j| j| j�S )zISleep a random amount of time between wait_random_min and wait_random_max)�randomZrandintr# r$ )r: r= r> r r r
r1 � s zRetrying.random_sleepc C s$ | j | j|d }|dk r d}|S )z�
Sleep an incremental amount of time after each attempt, starting at
wait_incrementing_start and incrementing by wait_incrementing_increment
r r )r% r& )r: r= r> �resultr r r
r2 � s zRetrying.incrementing_sleepc C s2 d| }| j | }|| jkr"| j}|dk r.d}|S )N� r )r' r) )r: r= r> ZexprA r r r
r3 � s
zRetrying.exponential_sleepc C s dS )NFr )r: rA r r r
r7 � s zRetrying.never_rejectc C s dS )NTr )r: rA r r r
r5 � s zRetrying.always_rejectc C s4 d}|j r || j|jd �O }n|| j|j�O }|S )NFr )�
has_exceptionr6 �valuer8 )r: �attemptZrejectr r r
�
should_reject� s
zRetrying.should_rejectc
O s� t ttj� d ��}d}x�yt|||�|d�}W n tj� }t||d�}Y nX | j|�sh|j| j�S t ttj� d ��| }| j ||�r�| j r�|j
r�|j� �q�t |��n<| j ||�} | j
r�tj� | j
}
| td|
� } tj| d � |d7 }qW d S )Ni� r FTr g @�@)�int�round�time�Attempt�sys�exc_inforF �getr9 r. rC �
RetryErrorr4 r* r@ r �sleep) r: �fnr r Z
start_time�attempt_numberrE �tbr> rO Zjitterr r r
r � s*
z
Retrying.call)NNNNNNNNNNNNNFNNN)�__name__�
__module__� __qualname__r< r, r- r? r0 r1 r2 r3 r7 r5 rF r r r r r
r 8 s0
F
r c @ s* e Zd ZdZdd� Zd
dd�Zdd� Zd S ) rJ z�
An Attempt encapsulates a call to a target function that may end as a
normal return value from the function or an Exception depending on what
occurred during the execution.
c C s || _ || _|| _d S )N)rD rQ rC )r: rD rQ rC r r r
r< � s zAttempt.__init__Fc C s@ | j r6|rt| ��q<tj| jd | jd | jd � n| jS dS )z�
Return the return value of this Attempt instance or raise an Exception.
If wrap_exception is true, this Attempt is wrapped inside of a
RetryError before being raised.
r r rB N)rC rN r ZreraiserD )r: r; r r r
rM � s
"z Attempt.getc C s: | j r&dj| jdjtj| jd ���S dj| j| j�S d S )NzAttempts: {0}, Error:
{1}� rB zAttempts: {0}, Value: {1})rC �formatrQ �join� traceback� format_tbrD )r: r r r
�__repr__� s zAttempt.__repr__N)F)rS rT rU �__doc__r< rM r[ r r r r
rJ � s
rJ c @ s e Zd ZdZdd� Zdd� ZdS )rN zU
A RetryError encapsulates the last Attempt instance right before giving up.
c C s
|| _ d S )N)� last_attempt)r: r] r r r
r< s zRetryError.__init__c C s dj | j�S )NzRetryError[{0}])rW r] )r: r r r
�__str__
s zRetryError.__str__N)rS rT rU r\ r< r^ r r r r
rN s rN )
r@ Z pip._vendorr rK rI rY r( r �objectr rJ � ExceptionrN r r r r
�<module> s *! pip/_vendor/__pycache__/appdirs.cpython-36.opt-1.pyc 0000644 00000044153 14751155150 0016242 0 ustar 00 3
���e`W � @ s� d Z d1Zdjeee��ZddlZddlZejd dkZ e r>eZ
ej j d�r�ddl Z e j
� d d Zej d�rrd Zq�ej d
�r�d Zq�d Znej Zd2dd�Zd3dd�Zd4dd�Zd5dd�Zd6dd�Zd7dd�ZG dd � d e�Zd d � Zd d � Zd!d"� Zd#d$� Zed k�r�yddl Z eZ W nn e k
�r� ydd%l m!Z! eZ W nB e k
�r| yddl"Z#eZ W n e k
�rv eZ Y nX Y nX Y nX e$d&k�r~d'Z%d(Z&d8Z'e(d)� ee%e&d*d+�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q�W e(d-� ee%e&�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q�W e(d.� ee%�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q$W e(d/� ee%d
d0�Z)x$e'D ] Z*e(d,e*e+e)e*�f � �q^W dS )9zyUtilities for determining application-specific dirs.
See <http://github.com/ActiveState/appdirs> for details and usage.
� � � �.N� �javaZWindows�win32ZMac�darwinZlinux2Fc C s� t dkr^|dkr| }|r dp d}tjjt|��}| r�|dk rNtjj||| �}q�tjj|| �}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
aJ Return full path to the user-specific data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
macOS: ~/Library/Application Support/<AppName>
Unix: ~/.local/share/<AppName> # or in $XDG_DATA_HOME, if defined
Win XP (not roaming): C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
Win XP (roaming): C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
Win 7 (not roaming): C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
Win 7 (roaming): C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
That means, by default "~/.local/share/<AppName>".
r N�
CSIDL_APPDATA�CSIDL_LOCAL_APPDATAFr z ~/Library/Application Support/Z
XDG_DATA_HOMEz~/.local/share)�system�os�path�normpath�_get_win_folder�join�
expanduser�getenv)�appname� appauthor�version�roaming�constr
� r � /usr/lib/python3.6/appdirs.py�
user_data_dir- s& r c s
t dkrR|dkr� }tjjtd��}� r�|dk rBtjj||� �}q�tjj|� �}n�t dkrztjjd�}� r�tjj|� �}nttjdtjjdd g��}d
d � |j tj�D �}� r�|r�tjj� |�� � fd d �|D �}|r�tjj|�}n|d
}|S � o�|�rtjj||�}|S )ai Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of data dirs should be
returned. By default, the first item from XDG_DATA_DIRS is
returned, or '/usr/local/share/<AppName>',
if XDG_DATA_DIRS is not set
Typical user data directories are:
macOS: /Library/Application Support/<AppName>
Unix: /usr/local/share/<AppName> or /usr/share/<AppName>
Win XP: C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
Win 7: C:\ProgramData\<AppAuthor>\<AppName> # Hidden, but writeable on Win 7.
For Unix, this is using the $XDG_DATA_DIRS[0] default.
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r N�CSIDL_COMMON_APPDATAFr z /Library/Application SupportZ
XDG_DATA_DIRSz/usr/local/sharez
/usr/sharec S s g | ]}t jj|jt j���qS r )r r
r �rstrip�sep)�.0�xr r r �
<listcomp>� s z!site_data_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )
r r r
r r r r r �pathsep�split)r r r � multipathr
�pathlistr )r r �
site_data_dird s4
r% c C sX t dkrt| |d|�}n&tjdtjjd��}| r>tjj|| �}| rT|rTtjj||�}|S )a� Return full path to the user-specific config dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"roaming" (boolean, default False) can be set True to use the Windows
roaming appdata directory. That means that for users on a Windows
network setup for roaming profiles, this user data will be
sync'd on login. See
<http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
for a discussion of issues.
Typical user data directories are:
macOS: same as user_data_dir
Unix: ~/.config/<AppName> # or in $XDG_CONFIG_HOME, if defined
Win *: same as user_data_dir
For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
That means, by deafult "~/.config/<AppName>".
r r NZXDG_CONFIG_HOMEz ~/.config)r r )r r r r r
r r )r r r r r
r r r �user_config_dir� s r& c s� t d kr*t� |�}� r�|r�tjj||�}ndtjdd�}dd� |jtj�D �}� rt|rbtjj� |�� � fdd�|D �}|r�tjj|�}n|d }|S )
a Return full path to the user-shared data dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"multipath" is an optional parameter only applicable to *nix
which indicates that the entire list of config dirs should be
returned. By default, the first item from XDG_CONFIG_DIRS is
returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
Typical user data directories are:
macOS: same as site_data_dir
Unix: /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
$XDG_CONFIG_DIRS
Win *: same as site_data_dir
Vista: (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
r r ZXDG_CONFIG_DIRSz/etc/xdgc S s g | ]}t jj|jt j���qS r )r r
r r r )r r r r r r � s z#site_config_dir.<locals>.<listcomp>c s g | ]}t jj|� g��qS r )r r r )r r )r r r r � s r )r r )r r% r r
r r r" r! )r r r r# r
r$ r )r r �site_config_dir� s
r' Tc C s� t dkrd|dkr| }tjjtd��}| r�|dk rBtjj||| �}ntjj|| �}|r�tjj|d�}nNt dkr�tjjd�}| r�tjj|| �}n&tjdtjjd ��}| r�tjj|| �}| r�|r�tjj||�}|S )
a Return full path to the user-specific cache dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Cache" to the base app data dir for Windows. See
discussion below.
Typical user cache directories are:
macOS: ~/Library/Caches/<AppName>
Unix: ~/.cache/<AppName> (XDG default)
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
On Windows the only suggestion in the MSDN docs is that local settings go in
the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
app data dir (the default returned by `user_data_dir` above). Apps typically
put cache data somewhere *under* the given dir here. Some examples:
...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
...\Acme\SuperApp\Cache\1.0
OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
This can be disabled with the `opinion=False` option.
r Nr
FZCacher z~/Library/CachesZXDG_CACHE_HOMEz~/.cache)r r r
r r r r r )r r r �opinionr
r r r �user_cache_dir s( ! r) c C s� t dkr tjjtjjd�| �}nNt dkrLt| ||�}d}|rntjj|d�}n"t| ||�}d}|rntjj|d�}| r�|r�tjj||�}|S )a� Return full path to the user-specific log dir for this application.
"appname" is the name of application.
If None, just the system directory is returned.
"appauthor" (only used on Windows) is the name of the
appauthor or distributing body for this application. Typically
it is the owning company name. This falls back to appname. You may
pass False to disable it.
"version" is an optional version path element to append to the
path. You might want to use this if you want multiple versions
of your app to be able to run independently. If used, this
would typically be "<major>.<minor>".
Only applied when appname is present.
"opinion" (boolean) can be False to disable the appending of
"Logs" to the base app data dir for Windows, and "log" to the
base cache dir for Unix. See discussion below.
Typical user cache directories are:
macOS: ~/Library/Logs/<AppName>
Unix: ~/.cache/<AppName>/log # or under $XDG_CACHE_HOME if defined
Win XP: C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
Vista: C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
On Windows the only suggestion in the MSDN docs is that local settings
go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
examples of what some windows apps use for a logs dir.)
OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
value for Windows and appends "log" to the user cache dir for Unix.
This can be disabled with the `opinion=False` option.
r z~/Library/Logsr FZLogs�log)r r r
r r r r) )r r r r( r
r r r � user_log_dir: s
r+ c @ sb e Zd ZdZddd�Zedd� �Zedd � �Zed
d � �Zed d
� �Z edd� �Z
edd� �Z dS )�AppDirsz1Convenience wrapper for getting application dirs.NFc C s" || _ || _|| _|| _|| _d S )N)r r r r r# )�selfr r r r r# r r r �__init__o s
zAppDirs.__init__c C s t | j| j| j| jd�S )N)r r )r r r r r )r- r r r r w s
zAppDirs.user_data_dirc C s t | j| j| j| jd�S )N)r r# )r% r r r r# )r- r r r r% | s
zAppDirs.site_data_dirc C s t | j| j| j| jd�S )N)r r )r& r r r r )r- r r r r& � s
zAppDirs.user_config_dirc C s t | j| j| j| jd�S )N)r r# )r' r r r r# )r- r r r r' � s
zAppDirs.site_config_dirc C s t | j| j| jd�S )N)r )r) r r r )r- r r r r) � s
zAppDirs.user_cache_dirc C s t | j| j| jd�S )N)r )r+ r r r )r- r r r r+ � s
zAppDirs.user_log_dir)NNFF) �__name__�
__module__� __qualname__�__doc__r. �propertyr r% r& r' r) r+ r r r r r, m s
r, c C s: ddl }dddd�| }|j|jd�}|j||�\}}|S )z�This is a fallback technique at best. I'm not sure if using the
registry for this guarantees us the correct answer for all CSIDL_*
names.
r NZAppDatazCommon AppDataz
Local AppData)r r r
z@Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders)�_winreg�OpenKey�HKEY_CURRENT_USERZ QueryValueEx)�
csidl_namer4 Zshell_folder_name�key�dir�typer r r � _get_win_folder_from_registry� s r; c C s� ddl m}m} |jdt|| �dd�}y`t|�}d}x |D ]}t|�dkr:d}P q:W |r�ydd l}|j|�}W n t k
r� Y nX W n t
k
r� Y nX |S )Nr )�shellcon�shellF� T) �win32com.shellr< r= �SHGetFolderPath�getattr�unicode�ord�win32api�GetShortPathName� ImportError� UnicodeError)r7 r< r= r9 �
has_high_char�crD r r r � _get_win_folder_with_pywin32� s$
rJ c C s� dd l }dddd�| }|jd�}|jjjd |d d|� d}x |D ]}t|�dkrBd }P qBW |r�|jd�}|jjj|j|d�r�|}|jS )
Nr � �# � )r r r
i Fr> T) �ctypesZcreate_unicode_buffer�windllZshell32ZSHGetFolderPathWrC Zkernel32ZGetShortPathNameW�value)r7 rN Z csidl_const�bufrH rI Zbuf2r r r �_get_win_folder_with_ctypes� s"
rR c C s� dd l }ddlm} ddlm} |jjd }|jd|�}|jj }|j
d t |j | �d |j j
|� |jj|j� �jd�}d}x |D ]} t| �dkr~d }P q~W |r�|jd|�}|jj }
tj|||�r�|jj|j� �jd�}|S )
Nr )�jna)r � rI � Fr> T)�arrayZcom.sunrS Zcom.sun.jna.platformr ZWinDefZMAX_PATHZzerosZShell32ZINSTANCEr@ rA ZShlObjZSHGFP_TYPE_CURRENTZNativeZtoStringZtostringr rC ZKernel32ZkernalrE ) r7 rV rS r Zbuf_sizerQ r= r9 rH rI Zkernelr r r �_get_win_folder_with_jna� s&
rW )rO �__main__ZMyAppZ MyCompanyz%-- app dirs (with optional 'version')z1.0)r z%s: %sz)
-- app dirs (without optional 'version')z+
-- app dirs (without optional 'appauthor')z(
-- app dirs (with disabled 'appauthor'))r )r r r )NNNF)NNNF)NNNF)NNNF)NNNT)NNNT)r r% r& r' r) r+ ),r2 Z__version_info__r �map�str� __version__�sysr � version_infoZPY3rB �platform�
startswithZjava_verZos_namer r r% r& r' r) r+ �objectr, r; rJ rR rW r? Zwin32comr rF rN rO Z com.sun.jnaZcomr/ r r Zprops�print�dirsZproprA r r r r �<module> s~
7
B
(
3
9
3+
pip/_vendor/__pycache__/six.cpython-36.pyc 0000644 00000057532 14751155150 0014451 0 ustar 00 3
���e�u � I @ sr d Z ddlmZ ddlZddlZddlZddlZddlZdZdZ ej
d dkZ ej
d dkZ ej
dd� �dzkZ
e r�efZefZefZeZeZejZn�efZeefZeejfZe ZeZej j d �r�e�d|�ZnLG d d
� d
e �Z ye!e � � W n e"k
�r e�d~�ZY n X e�d��Z[ dd� Z#dd� Z$G dd� de �Z%G dd� de%�Z&G dd� dej'�Z(G dd� de%�Z)G dd � d e �Z*e*e+�Z,G d d � d e(�Z-e)d d d d!�e)d"d#d$d%d"�e)d&d#d#d'd&�e)d(d)d$d*d(�e)d+d)d,�e)d-d#d$d.d-�e)d/d0d0d1d/�e)d2d0d0d/d2�e)d3d)d$d4d3�e)d5d)e
�r d6nd7d8�e)d9d)d:�e)d;d<d=d>�e)d!d!d �e)d?d?d@�e)dAdAd@�e)dBdBd@�e)d4d)d$d4d3�e)dCd#d$dDdC�e)dEd#d#dFdE�e&d$d)�e&dGdH�e&dIdJ�e&dKdLdM�e&dNdOdN�e&dPdQdR�e&dSdTdU�e&dVdWdX�e&dYdZd[�e&d\d]d^�e&d_d`da�e&dbdcdd�e&dedfdg�e&dhdidj�e&dkdkdl�e&dmdmdl�e&dndndl�e&dododp�e&dqdr�e&dsdt�e&dudv�e&dwdxdw�e&dydz�e&d{d|d}�e&d~dd��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�d�d��e&d�e+d� d��e&d�e+d� d��e&d�e+d� e+d� �e&d�d�d��e&d�d�d��e&d�d�d��g>Z.ej d�k�rZe.e&d�d��g7 Z.x:e.D ]2Z/e0e-e/j1e/� e2e/e&��r`e,j3e/d�e/j1 � �q`W [/e.e-_.e-e+d� �Z4e,j3e4d�� G d�d�� d�e(�Z5e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d>d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��e)d�d�d��gZ6x e6D ]Z/e0e5e/j1e/� �q�W [/e6e5_.e,j3e5e+d� �d�dӃ G d�dՄ d�e(�Z7e)d�d�d��e)d�d�d��e)d�d�d��gZ8x e8D ]Z/e0e7e/j1e/� �q$W [/e8e7_.e,j3e7e+d� �d�d܃ G d�dބ d�e(�Z9e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)d�d�d�e)�d d�d�g!Z:x e:D ]Z/e0e9e/j1e/� �q�W [/e:e9_.e,j3e9e+�d ��d�d� G �d�d� �de(�Z;e)�dd��d�e)�dd��d�e)�d d��d�e)�d
d��d�gZ<x e<D ]Z/e0e;e/j1e/� �qTW [/e<e;_.e,j3e;e+�d ��d �d
� G �d�d� �de(�Z=e)�dd�d��gZ>x e>D ]Z/e0e=e/j1e/� �q�W [/e>e=_.e,j3e=e+�d ��d�d� G �d�d� �dej'�Z?e,j3e?e+d� ��d� �d�d� Z@�d�d� ZAe � rj�dZB�d ZC�d ZD�d ZE�d ZF�d ZGn$�d!ZB�d"ZC�d#ZD�d$ZE�d%ZF�d&ZGyeHZIW n" eJk
� r� �d'�d(� ZIY nX eIZHyeKZKW n" eJk
� r� �d)�d*� ZKY nX e �
r�d+�d,� ZLejMZN�d-�d.� ZOe ZPn>�d/�d,� ZL�d0�d1� ZN�d2�d.� ZOG �d3�d4� �d4e �ZPeKZKe#eL�d5� ejQeB�ZRejQeC�ZSejQeD�ZTejQeE�ZUejQeF�ZVejQeG�ZWe �
r��d6�d7� ZX�d8�d9� ZY�d:�d;� ZZ�d<�d=� Z[ej\�d>�Z]ej\�d?�Z^ej\�d@�Z_nT�dA�d7� ZX�dB�d9� ZY�dC�d;� ZZ�dD�d=� Z[ej\�dE�Z]ej\�dF�Z^ej\�dG�Z_e#eX�dH� e#eY�dI� e#eZ�dJ� e#e[�dK� e � r�dL�dM� Z`�dN�dO� ZaebZcddldZdedje�dP�jfZg[dejhd�ZiejjZkelZmddlnZnenjoZoenjpZp�dQZqej
d
d
k� r �dRZr�dSZsn �dTZr�dUZsnj�dV�dM� Z`�dW�dO� ZaecZcebZg�dX�dY� Zi�dZ�d[� Zkejtejuev�ZmddloZoeojo ZoZp�d\Zq�dRZr�dSZse#e`�d]� e#ea�d^� �d_�dQ� Zw�d`�dT� Zx�da�dU� Zye � r�eze4j{�db�Z|�d��dc�dd�Z}n�d��de�df�Z|e|�dg� ej
dd� �d�k�
re|�dh� n.ej
dd� �d�k�
r8e|�di� n �dj�dk� Z~eze4j{�dld�Zedk�
rj�dm�dn� Zej
dd� �d�k �
r�eZ��do�dn� Ze#e}�dp� ej
dd� �d�k �
r�ej�ej�f�dq�dr�Z�nej�Z��ds�dt� Z��du�dv� Z��dw�dx� Z�g Z�e+Z�e�� j��dy�dk �rg e�_�ej��rbx>e�ej��D ]0\Z�Z�ee��j+d k�r*e�j1e+k�r*ej�e�= P �q*W [�[�ej�j�e,� dS (� z6Utilities for writing code that runs on Python 2 and 3� )�absolute_importNz'Benjamin Peterson <benjamin@python.org>z1.10.0� � � �java� � c @ s e Zd Zdd� ZdS )�Xc C s dS )Nr r l � )�selfr
r
�/usr/lib/python3.6/six.py�__len__> s z X.__len__N)�__name__�
__module__� __qualname__r
r
r
r
r r < s r �? c C s
|| _ dS )z Add documentation to a function.N)�__doc__)�func�docr
r
r �_add_docK s r c C s t | � tj| S )z7Import module, returning the module after the last dot.)�
__import__�sys�modules)�namer
r
r �_import_moduleP s r c @ s e Zd Zdd� Zdd� ZdS )�
_LazyDescrc C s
|| _ d S )N)r )r r r
r
r �__init__X s z_LazyDescr.__init__c C sB | j � }t|| j|� yt|j| j� W n tk
r< Y nX |S )N)�_resolve�setattrr �delattr� __class__�AttributeError)r �obj�tp�resultr
r
r �__get__[ s z_LazyDescr.__get__N)r r r r r% r
r
r
r r V s r c s. e Zd Zd� fdd� Zdd� Zdd� Z� ZS ) � MovedModuleNc s2 t t| �j|� tr(|d kr |}|| _n|| _d S )N)�superr& r �PY3�mod)r r �old�new)r r
r r i s zMovedModule.__init__c C s
t | j�S )N)r r) )r r
r
r r r s zMovedModule._resolvec C s" | j � }t||�}t| ||� |S )N)r �getattrr )r �attr�_module�valuer
r
r � __getattr__u s
zMovedModule.__getattr__)N)r r r r r r0 �
__classcell__r
r
)r r r& g s r& c s( e Zd Z� fdd�Zdd� Zg Z� ZS )� _LazyModulec s t t| �j|� | jj| _d S )N)r' r2 r r r )r r )r r
r r ~ s z_LazyModule.__init__c C s ddg}|dd� | j D �7 }|S )Nr r c S s g | ]
}|j �qS r
)r )�.0r- r
r
r �
<listcomp>� s z'_LazyModule.__dir__.<locals>.<listcomp>)�_moved_attributes)r Zattrsr
r
r �__dir__� s z_LazyModule.__dir__)r r r r r6 r5 r1 r
r
)r r r2 | s r2 c s& e Zd Zd� fdd� Zdd� Z� ZS )�MovedAttributeNc sd t t| �j|� trH|d kr |}|| _|d kr@|d kr<|}n|}|| _n|| _|d krZ|}|| _d S )N)r' r7 r r( r) r- )r r Zold_modZnew_modZold_attrZnew_attr)r r
r r � s zMovedAttribute.__init__c C s t | j�}t|| j�S )N)r r) r, r- )r �moduler
r
r r � s
zMovedAttribute._resolve)NN)r r r r r r1 r
r
)r r r7 � s r7 c @ sV e Zd ZdZdd� Zdd� Zdd� Zdd d
�Zd d � Zd
d� Z dd� Z
dd� Z e Z dS )�_SixMetaPathImporterz�
A meta path importer to import six.moves and its submodules.
This class implements a PEP302 finder and loader. It should be compatible
with Python 2.5 and all existing versions of Python3
c C s || _ i | _d S )N)r �
known_modules)r Zsix_module_namer
r
r r � s z _SixMetaPathImporter.__init__c G s& x |D ]}|| j | jd | < qW d S )N�.)r: r )r r) Z fullnames�fullnamer
r
r � _add_module� s
z _SixMetaPathImporter._add_modulec C s | j | jd | S )Nr; )r: r )r r< r
r
r � _get_module� s z _SixMetaPathImporter._get_moduleNc C s || j kr| S d S )N)r: )r r< �pathr
r
r � find_module� s
z _SixMetaPathImporter.find_modulec C s0 y
| j | S tk
r* td| ��Y nX d S )Nz!This loader does not know module )r: �KeyError� ImportError)r r< r
r
r Z __get_module� s
z!_SixMetaPathImporter.__get_modulec C sR y
t j| S tk
r Y nX | j|�}t|t�r>|j� }n| |_|t j|< |S )N)r r rA � _SixMetaPathImporter__get_module�
isinstancer& r �
__loader__)r r< r) r
r
r � load_module� s
z _SixMetaPathImporter.load_modulec C s t | j|�d�S )z�
Return true, if the named module is a package.
We need this method to get correct spec objects with
Python 3.4 (see PEP451)
�__path__)�hasattrrC )r r< r
r
r �
is_package� s z _SixMetaPathImporter.is_packagec C s | j |� dS )z;Return None
Required, if is_package is implementedN)rC )r r< r
r
r �get_code� s
z _SixMetaPathImporter.get_code)N)
r r r r r r= r> r@ rC rF rI rJ �
get_sourcer
r
r
r r9 � s
r9 c @ s e Zd ZdZg ZdS )� _MovedItemsz Lazy loading of moved objectsN)r r r r rG r
r
r
r rL � s rL Z cStringIO�io�StringIO�filter� itertools�builtinsZifilter� filterfalseZ ifilterfalse�inputZ __builtin__Z raw_input�internr �map�imap�getcwd�osZgetcwdu�getcwdb�rangeZxrangeZ
reload_module� importlibZimp�reload�reduce� functoolsZ shlex_quoteZpipesZshlexZquote�UserDict� collections�UserList�
UserString�zipZizip� zip_longestZ izip_longestZ configparserZ ConfigParser�copyregZcopy_regZdbm_gnuZgdbmzdbm.gnuZ
_dummy_threadZ dummy_threadZhttp_cookiejarZ cookielibzhttp.cookiejarZ http_cookiesZCookiez http.cookiesZ
html_entitiesZhtmlentitydefsz
html.entitiesZ html_parserZ
HTMLParserz html.parserZ http_clientZhttplibz http.clientZemail_mime_multipartzemail.MIMEMultipartzemail.mime.multipartZemail_mime_nonmultipartzemail.MIMENonMultipartzemail.mime.nonmultipartZemail_mime_textzemail.MIMETextzemail.mime.textZemail_mime_basezemail.MIMEBasezemail.mime.baseZBaseHTTPServerz http.serverZ
CGIHTTPServerZSimpleHTTPServerZcPickle�pickleZqueueZQueue�reprlib�reprZ socketserverZ SocketServer�_threadZthreadZtkinterZTkinterZtkinter_dialogZDialogztkinter.dialogZtkinter_filedialogZ
FileDialogztkinter.filedialogZtkinter_scrolledtextZ ScrolledTextztkinter.scrolledtextZtkinter_simpledialogZ SimpleDialogztkinter.simpledialogZ tkinter_tixZTixz tkinter.tixZ tkinter_ttkZttkz tkinter.ttkZtkinter_constantsZ Tkconstantsztkinter.constantsZ tkinter_dndZTkdndz tkinter.dndZtkinter_colorchooserZtkColorChooserztkinter.colorchooserZtkinter_commondialogZtkCommonDialogztkinter.commondialogZtkinter_tkfiledialogZ tkFileDialogZ tkinter_fontZtkFontz tkinter.fontZtkinter_messageboxZ tkMessageBoxztkinter.messageboxZtkinter_tksimpledialogZtkSimpleDialogZ urllib_parsez.moves.urllib_parsez urllib.parseZ urllib_errorz.moves.urllib_errorz urllib.errorZurllibz
.moves.urllibZurllib_robotparser� robotparserzurllib.robotparserZ
xmlrpc_clientZ xmlrpclibz
xmlrpc.clientZ
xmlrpc_serverZSimpleXMLRPCServerz
xmlrpc.serverZwin32�winreg�_winregzmoves.z.moves�movesc @ s e Zd ZdZdS )� Module_six_moves_urllib_parsez7Lazy loading of moved objects in six.moves.urllib_parseN)r r r r r
r
r
r rn @ s rn Z ParseResultZurlparseZ SplitResultZparse_qsZ parse_qslZ urldefragZurljoinZurlsplitZ
urlunparseZ
urlunsplitZ
quote_plusZunquoteZ unquote_plusZ urlencodeZ
splitqueryZsplittagZ splituserZ
uses_fragmentZ uses_netlocZ uses_paramsZ
uses_queryZ
uses_relativezmoves.urllib_parsezmoves.urllib.parsec @ s e Zd ZdZdS )� Module_six_moves_urllib_errorz7Lazy loading of moved objects in six.moves.urllib_errorN)r r r r r
r
r
r ro h s ro ZURLErrorZurllib2Z HTTPErrorZContentTooShortErrorz.moves.urllib.errorzmoves.urllib_errorzmoves.urllib.errorc @ s e Zd ZdZdS )� Module_six_moves_urllib_requestz9Lazy loading of moved objects in six.moves.urllib_requestN)r r r r r
r
r
r rp | s rp Zurlopenzurllib.requestZinstall_openerZ build_openerZ pathname2urlZ url2pathnameZ
getproxiesZRequestZOpenerDirectorZHTTPDefaultErrorHandlerZHTTPRedirectHandlerZHTTPCookieProcessorZ ProxyHandlerZ BaseHandlerZHTTPPasswordMgrZ HTTPPasswordMgrWithDefaultRealmZAbstractBasicAuthHandlerZHTTPBasicAuthHandlerZProxyBasicAuthHandlerZAbstractDigestAuthHandlerZHTTPDigestAuthHandlerZProxyDigestAuthHandlerZ HTTPHandlerZ HTTPSHandlerZ FileHandlerZ
FTPHandlerZCacheFTPHandlerZUnknownHandlerZHTTPErrorProcessorZ urlretrieveZ
urlcleanupZ URLopenerZFancyURLopenerZ proxy_bypassz.moves.urllib.requestzmoves.urllib_requestzmoves.urllib.requestc @ s e Zd ZdZdS )� Module_six_moves_urllib_responsez:Lazy loading of moved objects in six.moves.urllib_responseN)r r r r r
r
r
r rq � s rq Zaddbasezurllib.responseZ addclosehookZaddinfoZ
addinfourlz.moves.urllib.responsezmoves.urllib_responsezmoves.urllib.responsec @ s e Zd ZdZdS )�#Module_six_moves_urllib_robotparserz=Lazy loading of moved objects in six.moves.urllib_robotparserN)r r r r r
r
r
r rr � s rr ZRobotFileParserz.moves.urllib.robotparserzmoves.urllib_robotparserzmoves.urllib.robotparserc @ sN e Zd ZdZg Zejd�Zejd�Zejd�Z ejd�Z
ejd�Z dd� Z d S )
�Module_six_moves_urllibzICreate a six.moves.urllib namespace that resembles the Python 3 namespacezmoves.urllib_parsezmoves.urllib_errorzmoves.urllib_requestzmoves.urllib_responsezmoves.urllib_robotparserc C s dddddgS )N�parse�error�request�responserj r
)r r
r
r r6 � s z Module_six_moves_urllib.__dir__N)
r r r r rG � _importerr> rt ru rv rw rj r6 r
r
r
r rs � s
rs z moves.urllibc C s t t| j| � dS )zAdd an item to six.moves.N)r rL r )Zmover
r
r �add_move� s ry c C sX yt t| � W nD tk
rR y tj| = W n" tk
rL td| f ��Y nX Y nX dS )zRemove item from six.moves.zno such move, %rN)r rL r! rm �__dict__rA )r r
r
r � remove_move� s r{ �__func__�__self__� __closure__�__code__� __defaults__� __globals__�im_funcZim_selfZ func_closureZ func_codeZ
func_defaultsZ func_globalsc C s | j � S )N)�next)�itr
r
r �advance_iterator s r� c C s t dd� t| �jD ��S )Nc s s | ]}d |j kV qdS )�__call__N)rz )r3 �klassr
r
r � <genexpr> s zcallable.<locals>.<genexpr>)�any�type�__mro__)r" r
r
r �callable s r� c C s | S )Nr
)�unboundr
r
r �get_unbound_function s r� c C s | S )Nr
)r �clsr
r
r �create_unbound_method s r� c C s | j S )N)r� )r� r
r
r r� " s c C s t j| ||j�S )N)�types�
MethodTyper )r r" r
r
r �create_bound_method% s r� c C s t j| d |�S )N)r� r� )r r� r
r
r r� ( s c @ s e Zd Zdd� ZdS )�Iteratorc C s t | �j| �S )N)r� �__next__)r r
r
r r� - s z
Iterator.nextN)r r r r� r
r
r
r r� + s r� z3Get the function out of a possibly unbound functionc K s t | jf |��S )N)�iter�keys)�d�kwr
r
r �iterkeys> s r� c K s t | jf |��S )N)r� �values)r� r� r
r
r �
itervaluesA s r� c K s t | jf |��S )N)r� �items)r� r� r
r
r � iteritemsD s r� c K s t | jf |��S )N)r� Zlists)r� r� r
r
r � iterlistsG s r� r� r� r� c K s | j f |�S )N)r� )r� r� r
r
r r� P s c K s | j f |�S )N)r� )r� r� r
r
r r� S s c K s | j f |�S )N)r� )r� r� r
r
r r� V s c K s | j f |�S )N)r� )r� r� r
r
r r� Y s �viewkeys�
viewvalues� viewitemsz1Return an iterator over the keys of a dictionary.z3Return an iterator over the values of a dictionary.z?Return an iterator over the (key, value) pairs of a dictionary.zBReturn an iterator over the (key, [values]) pairs of a dictionary.c C s
| j d�S )Nzlatin-1)�encode)�sr
r
r �bk s r� c C s | S )Nr
)r� r
r
r �un s r� z>B�assertCountEqualZassertRaisesRegexpZassertRegexpMatches�assertRaisesRegex� assertRegexc C s | S )Nr
)r� r
r
r r� � s c C s t | jdd�d�S )Nz\\z\\\\Zunicode_escape)�unicode�replace)r� r
r
r r� � s c C s t | d �S )Nr )�ord)Zbsr
r
r �byte2int� s r� c C s t | | �S )N)r� )Zbuf�ir
r
r �
indexbytes� s r� ZassertItemsEqualz Byte literalz Text literalc O s t | t�||�S )N)r, �_assertCountEqual)r �args�kwargsr
r
r r� � s c O s t | t�||�S )N)r, �_assertRaisesRegex)r r� r� r
r
r r� � s c O s t | t�||�S )N)r, � _assertRegex)r r� r� r
r
r r� � s �execc C s* |d kr| � }|j |k r"|j|��|�d S )N)�
__traceback__�with_traceback)r# r/ �tbr
r
r �reraise� s
r� c C sB |dkr*t jd�}|j}|dkr&|j}~n |dkr6|}td� dS )z Execute code in a namespace.Nr z exec _code_ in _globs_, _locs_)r � _getframe� f_globals�f_localsr� )Z_code_Z_globs_Z_locs_�framer
r
r �exec_� s
r� z9def reraise(tp, value, tb=None):
raise tp, value, tb
zrdef raise_from(value, from_value):
if from_value is None:
raise value
raise value from from_value
zCdef raise_from(value, from_value):
raise value from from_value
c C s | �d S )Nr
)r/ Z
from_valuer
r
r �
raise_from� s r� �printc
s6 |j dtj�� � dkrdS � fdd�}d}|j dd�}|dk r`t|t�rNd}nt|t�s`td��|j d d�}|dk r�t|t�r�d}nt|t�s�td
��|r�td ��|s�x | D ]}t|t�r�d}P q�W |r�td �}td
�}nd }d
}|dkr�|}|dk� r�|}x,t| �D ] \} }| �r ||� ||� �qW ||� dS )z4The new-style print function for Python 2.4 and 2.5.�fileNc sd t | t�st| �} t � t�rVt | t�rV� jd k rVt� dd �}|d krHd}| j� j|�} � j| � d S )N�errors�strict) rD �
basestring�strr� r� �encodingr, r� �write)�datar� )�fpr
r r� � s
zprint_.<locals>.writeF�sepTz sep must be None or a string�endz end must be None or a stringz$invalid keyword arguments to print()�
� )�popr �stdoutrD r� r� � TypeError� enumerate)
r� r� r� Z want_unicoder� r� �arg�newlineZspacer� r
)r� r �print_� sL
r� c O s< |j dtj�}|jdd�}t| |� |r8|d k r8|j� d S )Nr� �flushF)�getr r� r� �_printr� )r� r� r� r� r
r
r r� s
zReraise an exception.c s � ��fdd�}|S )Nc s t j�� ��| �} �| _| S )N)r^ �wraps� __wrapped__)�f)�assigned�updated�wrappedr
r �wrapper s zwraps.<locals>.wrapperr
)r� r� r� r� r
)r� r� r� r r� s r� c s& G � �fdd�d��}t j|df i �S )z%Create a base class with a metaclass.c s e Zd Z� �fdd�ZdS )z!with_metaclass.<locals>.metaclassc s �|� |�S )Nr
)r� r Z
this_basesr� )�bases�metar
r �__new__' s z)with_metaclass.<locals>.metaclass.__new__N)r r r r� r
)r� r� r
r � metaclass% s r� Ztemporary_class)r� r� )r� r� r� r
)r� r� r �with_metaclass s r� c s � fdd�}|S )z6Class decorator for creating a class with a metaclass.c sl | j j� }|jd�}|d k rDt|t�r,|g}x|D ]}|j|� q2W |jdd � |jdd � � | j| j|�S )N� __slots__rz � __weakref__)rz �copyr� rD r� r� r � __bases__)r� Z orig_vars�slotsZ slots_var)r� r
r r� . s
z add_metaclass.<locals>.wrapperr
)r� r� r
)r� r �
add_metaclass, s r� c C s2 t r.d| jkr td| j ��| j| _dd� | _| S )a
A decorator that defines __unicode__ and __str__ methods under Python 2.
Under Python 3 it does nothing.
To support Python 2 and 3 with a single code base, define a __str__ method
returning text and apply this decorator to the class.
�__str__zY@python_2_unicode_compatible cannot be applied to %s because it doesn't define __str__().c S s | j � jd�S )Nzutf-8)� __unicode__r� )r r
r
r �<lambda>J s z-python_2_unicode_compatible.<locals>.<lambda>)�PY2rz �
ValueErrorr r� r� )r� r
r
r �python_2_unicode_compatible< s
r� �__spec__)r r l i���l i���l l ���� )N)NN)r r )r r )r r )r r )�r Z
__future__r r^ rP �operatorr r� �
__author__� __version__� version_infor� r( ZPY34r� Z string_types�intZ
integer_typesr� Z class_typesZ text_type�bytesZ binary_type�maxsizeZMAXSIZEr� ZlongZ ClassTyper� �platform�
startswith�objectr �len�
OverflowErrorr r r r& �
ModuleTyper2 r7 r9 r rx rL r5 r- r r rD r= rm rn Z _urllib_parse_moved_attributesro Z _urllib_error_moved_attributesrp Z _urllib_request_moved_attributesrq Z!_urllib_response_moved_attributesrr Z$_urllib_robotparser_moved_attributesrs ry r{ Z
_meth_funcZ
_meth_selfZ
_func_closureZ
_func_codeZ_func_defaultsZ
_func_globalsr� r� � NameErrorr� r� r� r� r� r� �
attrgetterZget_method_functionZget_method_selfZget_function_closureZget_function_codeZget_function_defaultsZget_function_globalsr� r� r� r� � methodcallerr� r� r� r� r� �chrZunichr�struct�Struct�packZint2byte�
itemgetterr� �getitemr� r� Z iterbytesrM rN �BytesIOr� r� r� �partialrV r� r� r� r� r, rQ r� r� r� r� r� �WRAPPER_ASSIGNMENTS�WRAPPER_UPDATESr� r� r� r� rG � __package__�globalsr� r� �submodule_search_locations� meta_pathr� r� Zimporter�appendr
r
r
r �<module> s�
>
5 pip/_vendor/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000005240 14751155150 0016331 0 ustar 00 3
���e> � @ s� d Z ddlmZ ddlZddlZddlZdZejj ejj
e ��Z dd� Z
e�r�ejejje d��ej ejdd�< e
d� e
d � e
d
� e
d � e
d � e
d
� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d� e
d � e
d � e
d � e
d � e
d � e
d!� e
d"� e
d#� e
d$� e
d%� e
d&� e
d'� e
d(� e
d)� e
d*� e
d+� e
d,� e
d-� e
d.� e
d/� e
d0� e
d1� e
d2� dS )3z�
pip._vendor is for vendoring dependencies of pip to prevent needing pip to
depend on something external.
Files inside of pip._vendor should be considered immutable and should only be
updated to versions from upstream.
� )�absolute_importNFc C s� dj t| �}yt|t� t� dd� W nz tk
r� yt| t� t� dd� W n tk
r` Y n:X tj| tj|< |jdd�\}}t tj| |tj| � Y nX d S )Nz{0}.{1}r )�level�.� )
�format�__name__�
__import__�globals�locals� ImportError�sys�modules�rsplit�setattr)Z
modulenameZ
vendored_name�base�head� r � /usr/lib/python3.6/__init__.py�vendored s r z*.whlZ cachecontrolZcoloramaZdistlibZdistroZhtml5libZlockfileZsixz six.moveszsix.moves.urllibZ packagingzpackaging.versionzpackaging.specifiersZ
pkg_resourcesZprogressZretryingZrequestszrequests.packageszrequests.packages.urllib3z&requests.packages.urllib3._collectionsz$requests.packages.urllib3.connectionz(requests.packages.urllib3.connectionpoolz!requests.packages.urllib3.contribz*requests.packages.urllib3.contrib.ntlmpoolz+requests.packages.urllib3.contrib.pyopensslz$requests.packages.urllib3.exceptionsz requests.packages.urllib3.fieldsz"requests.packages.urllib3.filepostz"requests.packages.urllib3.packagesz/requests.packages.urllib3.packages.ordered_dictz&requests.packages.urllib3.packages.sixz5requests.packages.urllib3.packages.ssl_match_hostnamezErequests.packages.urllib3.packages.ssl_match_hostname._implementationz%requests.packages.urllib3.poolmanagerz!requests.packages.urllib3.requestz"requests.packages.urllib3.responsez requests.packages.urllib3.utilz)requests.packages.urllib3.util.connectionz&requests.packages.urllib3.util.requestz'requests.packages.urllib3.util.responsez$requests.packages.urllib3.util.retryz#requests.packages.urllib3.util.ssl_z&requests.packages.urllib3.util.timeoutz"requests.packages.urllib3.util.url)�__doc__Z
__future__r ZglobZos.path�osr Z DEBUNDLED�path�abspath�dirname�__file__Z WHEEL_DIRr �joinr r r r �<module> sh $ pip/_vendor/__pycache__/re-vendor.cpython-36.opt-1.pyc 0000644 00000002010 14751155150 0016463 0 ustar 00 3
���e � @ s� d dl Z d dlZd dlZd dlZd dlZe jje jje��Z dd� Z
dd� Z dd� Z e
dkr�eej�d krpe
� ejd
dkr�e � n ejd
dkr�e � ne
� dS ) � Nc C s t d� tjd� d S )Nz"Usage: re-vendor.py [clean|vendor]� )�print�sys�exit� r r � /usr/lib/python3.6/re-vendor.py�usage s r c C sP x6t jt�D ](} t jjt| �}t jj|�r tj|� q W t jt jjtd�� d S )Nzsix.py) �os�listdir�here�path�join�isdir�shutil�rmtree�unlink)�fn�dirnamer r r �clean
s
r c C s6 t jddtddg� x tjd�D ]} tj| � q W d S )NZinstallz-tz-rz
vendor.txtz
*.egg-info)�pip�mainr �globr r )r r r r �vendor s r �__main__� r )r r r r r r �abspathr �__file__r r r r �__name__�len�argvr r r r �<module> s pip/_vendor/colorama/initialise.py 0000644 00000003575 14751155150 0013307 0 ustar 00 # Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
import atexit
import contextlib
import sys
from .ansitowin32 import AnsiToWin32
orig_stdout = None
orig_stderr = None
wrapped_stdout = None
wrapped_stderr = None
atexit_done = False
def reset_all():
if AnsiToWin32 is not None: # Issue #74: objects might become None at exit
AnsiToWin32(orig_stdout).reset_all()
def init(autoreset=False, convert=None, strip=None, wrap=True):
if not wrap and any([autoreset, convert, strip]):
raise ValueError('wrap=False conflicts with any other arg=True')
global wrapped_stdout, wrapped_stderr
global orig_stdout, orig_stderr
orig_stdout = sys.stdout
orig_stderr = sys.stderr
if sys.stdout is None:
wrapped_stdout = None
else:
sys.stdout = wrapped_stdout = \
wrap_stream(orig_stdout, convert, strip, autoreset, wrap)
if sys.stderr is None:
wrapped_stderr = None
else:
sys.stderr = wrapped_stderr = \
wrap_stream(orig_stderr, convert, strip, autoreset, wrap)
global atexit_done
if not atexit_done:
atexit.register(reset_all)
atexit_done = True
def deinit():
if orig_stdout is not None:
sys.stdout = orig_stdout
if orig_stderr is not None:
sys.stderr = orig_stderr
@contextlib.contextmanager
def colorama_text(*args, **kwargs):
init(*args, **kwargs)
try:
yield
finally:
deinit()
def reinit():
if wrapped_stdout is not None:
sys.stdout = wrapped_stdout
if wrapped_stderr is not None:
sys.stderr = wrapped_stderr
def wrap_stream(stream, convert, strip, autoreset, wrap):
if wrap:
wrapper = AnsiToWin32(stream,
convert=convert, strip=strip, autoreset=autoreset)
if wrapper.should_wrap():
stream = wrapper.stream
return stream
pip/_vendor/colorama/ansitowin32.py 0000644 00000022704 14751155150 0013330 0 ustar 00 # Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
import re
import sys
import os
from .ansi import AnsiFore, AnsiBack, AnsiStyle, Style
from .winterm import WinTerm, WinColor, WinStyle
from .win32 import windll, winapi_test
winterm = None
if windll is not None:
winterm = WinTerm()
def is_stream_closed(stream):
return not hasattr(stream, 'closed') or stream.closed
def is_a_tty(stream):
return hasattr(stream, 'isatty') and stream.isatty()
class StreamWrapper(object):
'''
Wraps a stream (such as stdout), acting as a transparent proxy for all
attribute access apart from method 'write()', which is delegated to our
Converter instance.
'''
def __init__(self, wrapped, converter):
# double-underscore everything to prevent clashes with names of
# attributes on the wrapped stream object.
self.__wrapped = wrapped
self.__convertor = converter
def __getattr__(self, name):
return getattr(self.__wrapped, name)
def write(self, text):
self.__convertor.write(text)
class AnsiToWin32(object):
'''
Implements a 'write()' method which, on Windows, will strip ANSI character
sequences from the text, and if outputting to a tty, will convert them into
win32 function calls.
'''
ANSI_CSI_RE = re.compile('\001?\033\[((?:\d|;)*)([a-zA-Z])\002?') # Control Sequence Introducer
ANSI_OSC_RE = re.compile('\001?\033\]((?:.|;)*?)(\x07)\002?') # Operating System Command
def __init__(self, wrapped, convert=None, strip=None, autoreset=False):
# The wrapped stream (normally sys.stdout or sys.stderr)
self.wrapped = wrapped
# should we reset colors to defaults after every .write()
self.autoreset = autoreset
# create the proxy wrapping our output stream
self.stream = StreamWrapper(wrapped, self)
on_windows = os.name == 'nt'
# We test if the WinAPI works, because even if we are on Windows
# we may be using a terminal that doesn't support the WinAPI
# (e.g. Cygwin Terminal). In this case it's up to the terminal
# to support the ANSI codes.
conversion_supported = on_windows and winapi_test()
# should we strip ANSI sequences from our output?
if strip is None:
strip = conversion_supported or (not is_stream_closed(wrapped) and not is_a_tty(wrapped))
self.strip = strip
# should we should convert ANSI sequences into win32 calls?
if convert is None:
convert = conversion_supported and not is_stream_closed(wrapped) and is_a_tty(wrapped)
self.convert = convert
# dict of ansi codes to win32 functions and parameters
self.win32_calls = self.get_win32_calls()
# are we wrapping stderr?
self.on_stderr = self.wrapped is sys.stderr
def should_wrap(self):
'''
True if this class is actually needed. If false, then the output
stream will not be affected, nor will win32 calls be issued, so
wrapping stdout is not actually required. This will generally be
False on non-Windows platforms, unless optional functionality like
autoreset has been requested using kwargs to init()
'''
return self.convert or self.strip or self.autoreset
def get_win32_calls(self):
if self.convert and winterm:
return {
AnsiStyle.RESET_ALL: (winterm.reset_all, ),
AnsiStyle.BRIGHT: (winterm.style, WinStyle.BRIGHT),
AnsiStyle.DIM: (winterm.style, WinStyle.NORMAL),
AnsiStyle.NORMAL: (winterm.style, WinStyle.NORMAL),
AnsiFore.BLACK: (winterm.fore, WinColor.BLACK),
AnsiFore.RED: (winterm.fore, WinColor.RED),
AnsiFore.GREEN: (winterm.fore, WinColor.GREEN),
AnsiFore.YELLOW: (winterm.fore, WinColor.YELLOW),
AnsiFore.BLUE: (winterm.fore, WinColor.BLUE),
AnsiFore.MAGENTA: (winterm.fore, WinColor.MAGENTA),
AnsiFore.CYAN: (winterm.fore, WinColor.CYAN),
AnsiFore.WHITE: (winterm.fore, WinColor.GREY),
AnsiFore.RESET: (winterm.fore, ),
AnsiFore.LIGHTBLACK_EX: (winterm.fore, WinColor.BLACK, True),
AnsiFore.LIGHTRED_EX: (winterm.fore, WinColor.RED, True),
AnsiFore.LIGHTGREEN_EX: (winterm.fore, WinColor.GREEN, True),
AnsiFore.LIGHTYELLOW_EX: (winterm.fore, WinColor.YELLOW, True),
AnsiFore.LIGHTBLUE_EX: (winterm.fore, WinColor.BLUE, True),
AnsiFore.LIGHTMAGENTA_EX: (winterm.fore, WinColor.MAGENTA, True),
AnsiFore.LIGHTCYAN_EX: (winterm.fore, WinColor.CYAN, True),
AnsiFore.LIGHTWHITE_EX: (winterm.fore, WinColor.GREY, True),
AnsiBack.BLACK: (winterm.back, WinColor.BLACK),
AnsiBack.RED: (winterm.back, WinColor.RED),
AnsiBack.GREEN: (winterm.back, WinColor.GREEN),
AnsiBack.YELLOW: (winterm.back, WinColor.YELLOW),
AnsiBack.BLUE: (winterm.back, WinColor.BLUE),
AnsiBack.MAGENTA: (winterm.back, WinColor.MAGENTA),
AnsiBack.CYAN: (winterm.back, WinColor.CYAN),
AnsiBack.WHITE: (winterm.back, WinColor.GREY),
AnsiBack.RESET: (winterm.back, ),
AnsiBack.LIGHTBLACK_EX: (winterm.back, WinColor.BLACK, True),
AnsiBack.LIGHTRED_EX: (winterm.back, WinColor.RED, True),
AnsiBack.LIGHTGREEN_EX: (winterm.back, WinColor.GREEN, True),
AnsiBack.LIGHTYELLOW_EX: (winterm.back, WinColor.YELLOW, True),
AnsiBack.LIGHTBLUE_EX: (winterm.back, WinColor.BLUE, True),
AnsiBack.LIGHTMAGENTA_EX: (winterm.back, WinColor.MAGENTA, True),
AnsiBack.LIGHTCYAN_EX: (winterm.back, WinColor.CYAN, True),
AnsiBack.LIGHTWHITE_EX: (winterm.back, WinColor.GREY, True),
}
return dict()
def write(self, text):
if self.strip or self.convert:
self.write_and_convert(text)
else:
self.wrapped.write(text)
self.wrapped.flush()
if self.autoreset:
self.reset_all()
def reset_all(self):
if self.convert:
self.call_win32('m', (0,))
elif not self.strip and not is_stream_closed(self.wrapped):
self.wrapped.write(Style.RESET_ALL)
def write_and_convert(self, text):
'''
Write the given text to our wrapped stream, stripping any ANSI
sequences from the text, and optionally converting them into win32
calls.
'''
cursor = 0
text = self.convert_osc(text)
for match in self.ANSI_CSI_RE.finditer(text):
start, end = match.span()
self.write_plain_text(text, cursor, start)
self.convert_ansi(*match.groups())
cursor = end
self.write_plain_text(text, cursor, len(text))
def write_plain_text(self, text, start, end):
if start < end:
self.wrapped.write(text[start:end])
self.wrapped.flush()
def convert_ansi(self, paramstring, command):
if self.convert:
params = self.extract_params(command, paramstring)
self.call_win32(command, params)
def extract_params(self, command, paramstring):
if command in 'Hf':
params = tuple(int(p) if len(p) != 0 else 1 for p in paramstring.split(';'))
while len(params) < 2:
# defaults:
params = params + (1,)
else:
params = tuple(int(p) for p in paramstring.split(';') if len(p) != 0)
if len(params) == 0:
# defaults:
if command in 'JKm':
params = (0,)
elif command in 'ABCD':
params = (1,)
return params
def call_win32(self, command, params):
if command == 'm':
for param in params:
if param in self.win32_calls:
func_args = self.win32_calls[param]
func = func_args[0]
args = func_args[1:]
kwargs = dict(on_stderr=self.on_stderr)
func(*args, **kwargs)
elif command in 'J':
winterm.erase_screen(params[0], on_stderr=self.on_stderr)
elif command in 'K':
winterm.erase_line(params[0], on_stderr=self.on_stderr)
elif command in 'Hf': # cursor position - absolute
winterm.set_cursor_position(params, on_stderr=self.on_stderr)
elif command in 'ABCD': # cursor position - relative
n = params[0]
# A - up, B - down, C - forward, D - back
x, y = {'A': (0, -n), 'B': (0, n), 'C': (n, 0), 'D': (-n, 0)}[command]
winterm.cursor_adjust(x, y, on_stderr=self.on_stderr)
def convert_osc(self, text):
for match in self.ANSI_OSC_RE.finditer(text):
start, end = match.span()
text = text[:start] + text[end:]
paramstring, command = match.groups()
if command in '\x07': # \x07 = BEL
params = paramstring.split(";")
# 0 - change title and icon (we will only change title)
# 1 - change icon (we don't support this)
# 2 - change title
if params[0] in '02':
winterm.set_title(params[1])
return text
pip/_vendor/colorama/ansi.py 0000644 00000004734 14751155150 0012105 0 ustar 00 # Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
'''
This module generates ANSI character codes to printing colors to terminals.
See: http://en.wikipedia.org/wiki/ANSI_escape_code
'''
CSI = '\033['
OSC = '\033]'
BEL = '\007'
def code_to_chars(code):
return CSI + str(code) + 'm'
def set_title(title):
return OSC + '2;' + title + BEL
def clear_screen(mode=2):
return CSI + str(mode) + 'J'
def clear_line(mode=2):
return CSI + str(mode) + 'K'
class AnsiCodes(object):
def __init__(self):
# the subclasses declare class attributes which are numbers.
# Upon instantiation we define instance attributes, which are the same
# as the class attributes but wrapped with the ANSI escape sequence
for name in dir(self):
if not name.startswith('_'):
value = getattr(self, name)
setattr(self, name, code_to_chars(value))
class AnsiCursor(object):
def UP(self, n=1):
return CSI + str(n) + 'A'
def DOWN(self, n=1):
return CSI + str(n) + 'B'
def FORWARD(self, n=1):
return CSI + str(n) + 'C'
def BACK(self, n=1):
return CSI + str(n) + 'D'
def POS(self, x=1, y=1):
return CSI + str(y) + ';' + str(x) + 'H'
class AnsiFore(AnsiCodes):
BLACK = 30
RED = 31
GREEN = 32
YELLOW = 33
BLUE = 34
MAGENTA = 35
CYAN = 36
WHITE = 37
RESET = 39
# These are fairly well supported, but not part of the standard.
LIGHTBLACK_EX = 90
LIGHTRED_EX = 91
LIGHTGREEN_EX = 92
LIGHTYELLOW_EX = 93
LIGHTBLUE_EX = 94
LIGHTMAGENTA_EX = 95
LIGHTCYAN_EX = 96
LIGHTWHITE_EX = 97
class AnsiBack(AnsiCodes):
BLACK = 40
RED = 41
GREEN = 42
YELLOW = 43
BLUE = 44
MAGENTA = 45
CYAN = 46
WHITE = 47
RESET = 49
# These are fairly well supported, but not part of the standard.
LIGHTBLACK_EX = 100
LIGHTRED_EX = 101
LIGHTGREEN_EX = 102
LIGHTYELLOW_EX = 103
LIGHTBLUE_EX = 104
LIGHTMAGENTA_EX = 105
LIGHTCYAN_EX = 106
LIGHTWHITE_EX = 107
class AnsiStyle(AnsiCodes):
BRIGHT = 1
DIM = 2
NORMAL = 22
RESET_ALL = 0
Fore = AnsiFore()
Back = AnsiBack()
Style = AnsiStyle()
Cursor = AnsiCursor()
pip/_vendor/colorama/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000554 14751155150 0020131 0 ustar 00 3
���e� � @ sD d dl mZmZmZmZ d dlmZmZmZm Z d dl
m Z dZ dS )� )�init�deinit�reinit�
colorama_text)�Fore�Back�Style�Cursor)� AnsiToWin32z0.3.7N)
Z
initialiser r r r �ansir r r r Z ansitowin32r
� __version__� r
r
� /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/colorama/__pycache__/win32.cpython-36.opt-1.pyc 0000644 00000006743 14751155150 0017342 0 ustar 00 3
���e� � @ s� dZ d Zy.ddlZddlmZ eej�ZddlmZ W n. eefk
rd dZdd� Z dd� Z
Y �nfX dd lm Z m Z m
Z
mZ ejZG d
d � d e �ZejjZejge_eje_ejjZejee�ge_eje_ejj Z ejej ge _eje _ejj Z ejege _eje _ejj Z!eje
ejeeej�ge!_eje!_ejj"Z#ejej ejeeej�ge#_eje#_ejj$Z%ej&ge%_eje%_e ee �eee�iZ'd d
� Z
e fdd�Zdd� Z d dd�Z dd� Z(dd� Z"dd� Z)dS ) � � � N)�
LibraryLoader)�wintypesc G s d S )N� )�_r r �/usr/lib/python3.6/win32.py�<lambda> s r c G s d S )Nr )r r r r r s )�byref� Structure�c_char�POINTERc @ s> e Zd ZdZdefdefdejfdejfdefgZdd� Z d S )
�CONSOLE_SCREEN_BUFFER_INFOzstruct in wincon.h.�dwSize�dwCursorPosition� wAttributes�srWindow�dwMaximumWindowSizec C sH d| j j| j j| jj| jj| j| jj| jj| jj| jj | j
j| j
jf S )Nz"(%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d)) r �Y�Xr r r �Top�LeftZBottomZRightr )�selfr r r �__str__ s z"CONSOLE_SCREEN_BUFFER_INFO.__str__N)
�__name__�
__module__� __qualname__�__doc__�COORDr �WORDZ
SMALL_RECTZ_fields_r r r r r r s
r c C s$ t t } t� }t| t|��}t|�S )N)�handles�STDOUTr �_GetConsoleScreenBufferInfor
�bool)�handle�csbi�successr r r � winapi_testa s
r' c C s t | }t� }t|t|��}|S )N)r r r" r
)� stream_idr$ r% r& r r r �GetConsoleScreenBufferInfoh s
r) c C s t | }t||�S )N)r �_SetConsoleTextAttribute)r( Zattrsr$ r r r �SetConsoleTextAttributeo s r+ Tc C sv t |� }|jdks |jdkr d S t |jd |jd �}|rdtt�j}| j|j7 _| j|j7 _t| }t ||�S )Nr � )
r r r r) r! r r r r �_SetConsoleCursorPosition)r( ZpositionZadjustZadjusted_position�srr$ r r r �SetConsoleCursorPositions s
r/ c C sB t | }t|j� �}tj|�}tjd�}t||||t|��}|jS )Nr )r r �encoder �DWORD� _FillConsoleOutputCharacterAr
�value)r( �char�length�startr$ � num_writtenr& r r r �FillConsoleOutputCharacter� s
r8 c C s: t | }tj|�}tj|�}tjd�}t||||t|��S )za FillConsoleOutputAttribute( hConsole, csbi.wAttributes, dwConSize, coordScreen, &cCharsWritten )r )r r r r1 �_FillConsoleOutputAttributer
)r( �attrr5 r6 r$ Z attributer7 r r r �FillConsoleOutputAttribute� s
r; c C s t | �S )N)�_SetConsoleTitleW)�titler r r �SetConsoleTitle� s r> i����i�)T)*r! ZSTDERRZctypesr ZWinDLLZwindllr �AttributeError� ImportErrorr+ r' r
r r r
Z_COORDr r Zkernel32Z GetStdHandleZ
_GetStdHandler1 ZargtypesZHANDLEZrestyper) r" ZBOOLr* r r/ r- ZFillConsoleOutputCharacterAr2 r; r9 ZSetConsoleTitleAr< ZLPCSTRr r8 r> r r r r �<module> sl
pip/_vendor/colorama/__pycache__/win32.cpython-36.pyc 0000644 00000006743 14751155150 0016403 0 ustar 00 3
���e� � @ s� dZ d Zy.ddlZddlmZ eej�ZddlmZ W n. eefk
rd dZdd� Z dd� Z
Y �nfX dd lm Z m Z m
Z
mZ ejZG d
d � d e �ZejjZejge_eje_ejjZejee�ge_eje_ejj Z ejej ge _eje _ejj Z ejege _eje _ejj Z!eje
ejeeej�ge!_eje!_ejj"Z#ejej ejeeej�ge#_eje#_ejj$Z%ej&ge%_eje%_e ee �eee�iZ'd d
� Z
e fdd�Zdd� Z d dd�Z dd� Z(dd� Z"dd� Z)dS ) � � � N)�
LibraryLoader)�wintypesc G s d S )N� )�_r r �/usr/lib/python3.6/win32.py�<lambda> s r c G s d S )Nr )r r r r r s )�byref� Structure�c_char�POINTERc @ s> e Zd ZdZdefdefdejfdejfdefgZdd� Z d S )
�CONSOLE_SCREEN_BUFFER_INFOzstruct in wincon.h.�dwSize�dwCursorPosition� wAttributes�srWindow�dwMaximumWindowSizec C sH d| j j| j j| jj| jj| j| jj| jj| jj| jj | j
j| j
jf S )Nz"(%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d)) r �Y�Xr r r �Top�LeftZBottomZRightr )�selfr r r �__str__ s z"CONSOLE_SCREEN_BUFFER_INFO.__str__N)
�__name__�
__module__� __qualname__�__doc__�COORDr �WORDZ
SMALL_RECTZ_fields_r r r r r r s
r c C s$ t t } t� }t| t|��}t|�S )N)�handles�STDOUTr �_GetConsoleScreenBufferInfor
�bool)�handle�csbi�successr r r � winapi_testa s
r' c C s t | }t� }t|t|��}|S )N)r r r" r
)� stream_idr$ r% r& r r r �GetConsoleScreenBufferInfoh s
r) c C s t | }t||�S )N)r �_SetConsoleTextAttribute)r( Zattrsr$ r r r �SetConsoleTextAttributeo s r+ Tc C sv t |� }|jdks |jdkr d S t |jd |jd �}|rdtt�j}| j|j7 _| j|j7 _t| }t ||�S )Nr � )
r r r r) r! r r r r �_SetConsoleCursorPosition)r( ZpositionZadjustZadjusted_position�srr$ r r r �SetConsoleCursorPositions s
r/ c C sB t | }t|j� �}tj|�}tjd�}t||||t|��}|jS )Nr )r r �encoder �DWORD� _FillConsoleOutputCharacterAr
�value)r( �char�length�startr$ � num_writtenr& r r r �FillConsoleOutputCharacter� s
r8 c C s: t | }tj|�}tj|�}tjd�}t||||t|��S )za FillConsoleOutputAttribute( hConsole, csbi.wAttributes, dwConSize, coordScreen, &cCharsWritten )r )r r r r1 �_FillConsoleOutputAttributer
)r( �attrr5 r6 r$ Z attributer7 r r r �FillConsoleOutputAttribute� s
r; c C s t | �S )N)�_SetConsoleTitleW)�titler r r �SetConsoleTitle� s r> i����i�)T)*r! ZSTDERRZctypesr ZWinDLLZwindllr �AttributeError� ImportErrorr+ r' r
r r r
Z_COORDr r Zkernel32Z GetStdHandleZ
_GetStdHandler1 ZargtypesZHANDLEZrestyper) r" ZBOOLr* r r/ r- ZFillConsoleOutputCharacterAr2 r; r9 ZSetConsoleTitleAr< ZLPCSTRr r8 r> r r r r �<module> sl
pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.opt-1.pyc 0000644 00000015522 14751155150 0020553 0 ustar 00 3
���e�% � @ s� d dl Z d dlZd dlZddlmZmZmZmZ ddlm Z m
Z
m Z ddl m
Z
mZ dZe
dk rfe � Zdd� Zdd � ZG d
d � d e�ZG d d
� d
e�ZdS )� N� )�AnsiFore�AnsiBack� AnsiStyle�Style)�WinTerm�WinColor�WinStyle)�windll� winapi_testc C s t | d� p| jS )N�closed)�hasattrr )�stream� r �!/usr/lib/python3.6/ansitowin32.py�is_stream_closed s r c C s t | d�o| j� S )N�isatty)r
r )r r r r �is_a_tty s r c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �
StreamWrapperz�
Wraps a stream (such as stdout), acting as a transparent proxy for all
attribute access apart from method 'write()', which is delegated to our
Converter instance.
c C s || _ || _d S )N)�_StreamWrapper__wrapped�_StreamWrapper__convertor)�self�wrappedZ converterr r r �__init__ s zStreamWrapper.__init__c C s t | j|�S )N)�getattrr )r �namer r r � __getattr__$ s zStreamWrapper.__getattr__c C s | j j|� d S )N)r �write)r �textr r r r ' s zStreamWrapper.writeN)�__name__�
__module__� __qualname__�__doc__r r r r r r r r s r c @ s~ e Zd ZdZejd�Zejd�Zd dd�Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zdd� ZdS ) � AnsiToWin32z�
Implements a 'write()' method which, on Windows, will strip ANSI character
sequences from the text, and if outputting to a tty, will convert them into
win32 function calls.
z ?\[((?:\d|;)*)([a-zA-Z])?z?\]((?:.|;)*?)()?NFc C s� || _ || _t|| �| _tjdk}|o*t� }|d krL|pJt|� oJt|� }|| _ |d krp|ont|� ont|�}|| _
| j � | _ | j t
jk| _d S )N�nt)r � autoresetr r �osr r r r �strip�convert�get_win32_calls� win32_calls�sys�stderr� on_stderr)r r r( r' r% Z
on_windowsZconversion_supportedr r r r 4 s
zAnsiToWin32.__init__c C s | j p| jp| jS )aj
True if this class is actually needed. If false, then the output
stream will not be affected, nor will win32 calls be issued, so
wrapping stdout is not actually required. This will generally be
False on non-Windows platforms, unless optional functionality like
autoreset has been requested using kwargs to init()
)r( r' r% )r r r r � should_wrapU s zAnsiToWin32.should_wrapc N C s> | j ot�r8tjtjftjtjtjftjtjtj ftj tjtj ft
j tj t
j ft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj ft
jtj t
j dft
jtj t
jdft
jtj t
jdft
jtj t
jdft
jtj t
jdft
j tj t
jdft
j tj t
jdft
j tj t
jdft j tj t
j ft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj ft jtj t
j dft jtj t
jdft jtj t
jdft jtj t
jdft jtj t
jdft j tj t
jdft j tj t
jdft j tj t
jdfi&S t!� S )NT)"r( �wintermr � RESET_ALL� reset_allZBRIGHTZstyler ZDIMZNORMALr ZBLACKZforer ZREDZGREENZYELLOWZBLUEZMAGENTAZCYANZWHITEZGREYZRESETZ
LIGHTBLACK_EXZ LIGHTRED_EXZ
LIGHTGREEN_EXZLIGHTYELLOW_EXZ LIGHTBLUE_EXZLIGHTMAGENTA_EXZ LIGHTCYAN_EXZ
LIGHTWHITE_EXr Zback�dict)r r r r r) _ sP
zAnsiToWin32.get_win32_callsc C s@ | j s | jr| j|� n| jj|� | jj� | jr<| j� d S )N)r' r( �write_and_convertr r �flushr% r1 )r r r r r r � s
zAnsiToWin32.writec C s: | j r| jdd� n"| j r6t| j� r6| jjtj� d S )N�mr )r )r( �
call_win32r' r r r r r0 )r r r r r1 � s zAnsiToWin32.reset_allc C sf d}| j |�}x@| jj|�D ]0}|j� \}}| j|||� | j|j� � |}q W | j||t|�� dS )z�
Write the given text to our wrapped stream, stripping any ANSI
sequences from the text, and optionally converting them into win32
calls.
r N)� convert_osc� ANSI_CSI_RE�finditer�span�write_plain_text� convert_ansi�groups�len)r r Zcursor�match�start�endr r r r3 � s
z AnsiToWin32.write_and_convertc C s* ||k r&| j j|||� � | j j� d S )N)r r r4 )r r r@ rA r r r r; � s z AnsiToWin32.write_plain_textc C s" | j r | j||�}| j||� d S )N)r( �extract_paramsr6 )r � paramstring�command�paramsr r r r< � s zAnsiToWin32.convert_ansic C s~ |dkr<t dd� |jd�D ��}xXt|�dk r8|d }q"W n>t dd� |jd�D ��}t|�dkrz|d krnd }n |d
krzd
}|S )N�Hfc s s& | ] }t |�d krt|�ndV qdS )r r N)r> �int)�.0�pr r r � <genexpr>� s z-AnsiToWin32.extract_params.<locals>.<genexpr>�;� r c s s" | ]}t |�d krt|�V qdS )r N)r> rG )rH rI r r r rJ � s r ZJKm�ABCD)r )r )r )�tuple�splitr> )r rD rC rE r r r rB � s zAnsiToWin32.extract_paramsc C s� |dkrVx�|D ]B}|| j kr| j | }|d }|dd � }t| jd�}|||� qW n�|dkrttj|d | jd� n�|dkr�tj|d | jd� nf|dkr�tj|| jd� nL|dkr�|d }d| fd|f|df| dfd �| \} }
tj| |
| jd� d S )
Nr5 r r )r- �J�KrF rM )�A�B�C�D)r* r2 r- r/ Z erase_screenZ
erase_lineZset_cursor_positionZ
cursor_adjust) r rD rE ZparamZ func_args�func�args�kwargs�n�x�yr r r r6 � s$
*zAnsiToWin32.call_win32c C sv xp| j j|�D ]`}|j� \}}|d |� ||d � }|j� \}}|dkr|jd�}|d dkrtj|d � qW |S )N�rK r Z02r )� ANSI_OSC_REr9 r: r= rO r/ Z set_title)r r r? r@ rA rC rD rE r r r r7 � s
zAnsiToWin32.convert_osc)NNF)r r r! r" �re�compiler8 r] r r. r) r r1 r3 r; r< rB r6 r7 r r r r r# + s
!
,
r# )r^ r+ r& �ansir r r r r/ r r r Zwin32r
r r r �objectr r# r r r r �<module> s pip/_vendor/colorama/__pycache__/ansi.cpython-36.pyc 0000644 00000006276 14751155150 0016374 0 ustar 00 3
���e� � @ s� d Z dZdZdZdd� Zdd� Zdd d
�Zdd d �ZG d
d� de�Z G dd� de�Z
G dd� de �Z G dd� de �Z G dd� de �Z
e � Ze � Ze
� Ze
� ZdS )z�
This module generates ANSI character codes to printing colors to terminals.
See: http://en.wikipedia.org/wiki/ANSI_escape_code
z[z]�c C s t t| � d S )N�m)�CSI�str)�code� r �/usr/lib/python3.6/ansi.py�
code_to_chars s r c C s t d | t S )Nz2;)�OSC�BEL)�titler r r � set_title s r � c C s t t| � d S )N�J)r r )�moder r r � clear_screen s r c C s t t| � d S )N�K)r r )r r r r �
clear_line s r c @ s e Zd Zdd� ZdS )� AnsiCodesc C s: x4t | �D ](}|jd�s
t| |�}t| |t|�� q
W d S )N�_)�dir�
startswith�getattr�setattrr )�self�name�valuer r r �__init__ s
zAnsiCodes.__init__N)�__name__�
__module__� __qualname__r r r r r r s r c @ s> e Zd Zd
dd�Zddd�Zddd�Zddd �Zdd
d �Zd S )�
AnsiCursor� c C s t t|� d S )N�A)r r )r �nr r r �UP% s z
AnsiCursor.UPc C s t t|� d S )N�B)r r )r r# r r r �DOWN' s zAnsiCursor.DOWNc C s t t|� d S )N�C)r r )r r# r r r �FORWARD) s zAnsiCursor.FORWARDc C s t t|� d S )N�D)r r )r r# r r r �BACK+ s zAnsiCursor.BACKc C s t t|� d t|� d S )N�;�H)r r )r �x�yr r r �POS- s zAnsiCursor.POSN)r! )r! )r! )r! )r! r! )r r r r$ r& r( r* r/ r r r r r $ s
r c @ sP e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZdZdZdZdS )�AnsiFore� � � �! �" �# �$ �% �' �Z �[ �\ �] �^ �_ �` �a N)r r r �BLACK�RED�GREEN�YELLOW�BLUE�MAGENTA�CYAN�WHITE�RESET�
LIGHTBLACK_EX� LIGHTRED_EX�
LIGHTGREEN_EX�LIGHTYELLOW_EX� LIGHTBLUE_EX�LIGHTMAGENTA_EX� LIGHTCYAN_EX�
LIGHTWHITE_EXr r r r r0 1 s" r0 c @ sP e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZdZdZdZdS )�AnsiBack�( �) �* �+ �, �- �. �/ �1 �d �e �f �g �h �i �j �k N)r r r rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR r r r r rS G s" rS c @ s e Zd ZdZdZdZdZdS )� AnsiStyler! r
� � N)r r r ZBRIGHTZDIMZNORMALZ RESET_ALLr r r r re ] s re N)r
)r
)�__doc__r r r
r r r r �objectr r r0 rS re ZForeZBackZStyleZCursorr r r r �<module> s
pip/_vendor/colorama/__pycache__/__init__.cpython-36.pyc 0000644 00000000554 14751155150 0017172 0 ustar 00 3
���e� � @ sD d dl mZmZmZmZ d dlmZmZmZm Z d dl
m Z dZ dS )� )�init�deinit�reinit�
colorama_text)�Fore�Back�Style�Cursor)� AnsiToWin32z0.3.7N)
Z
initialiser r r r �ansir r r r Z ansitowin32r
� __version__� r
r
� /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/colorama/__pycache__/initialise.cpython-36.pyc 0000644 00000003061 14751155150 0017561 0 ustar 00 3
���e} � @ st d dl Z d dlZd dlZddlmZ dadadadada dd� Z
ddd �Z d
d � Z ej
d d
� �Zdd� Zdd� ZdS )� N� )� AnsiToWin32Fc C s t d k rt t�j� d S )N)r � orig_stdout� reset_all� r r � /usr/lib/python3.6/initialise.pyr s r Tc C s� | r t | ||g�r td��tjatjatjd kr8d antt||| |� t_atjd kr^d a ntt||| |� t_a t
s�t j t
� da
d S )Nz,wrap=False conflicts with any other arg=TrueT)�any�
ValueError�sys�stdoutr �stderr� orig_stderr�wrapped_stdout� wrap_stream�wrapped_stderr� atexit_done�atexit�registerr )� autoreset�convert�strip�wrapr r r �init s
r c C s t d k rt t_td k r tt_d S )N)r r
r r
r r r r r �deinit3 s r c
o s" t | |� z
d V W d t� X d S )N)r r )�args�kwargsr r r �
colorama_text: s
r c C s t d k rt t_td k r tt_d S )N)r r
r r r r r r r �reinitC s r c C s& |r"t | |||d�}|j� r"|j} | S )N)r r r )r Z should_wrap�stream)r r r r r �wrapperr r r r J s r )FNNT)r �
contextlibr
Z ansitowin32r r r
r r r r r r �contextmanagerr r r r r r r �<module> s
pip/_vendor/colorama/__pycache__/ansi.cpython-36.opt-1.pyc 0000644 00000006276 14751155150 0017333 0 ustar 00 3
���e� � @ s� d Z dZdZdZdd� Zdd� Zdd d
�Zdd d �ZG d
d� de�Z G dd� de�Z
G dd� de �Z G dd� de �Z G dd� de �Z
e � Ze � Ze
� Ze
� ZdS )z�
This module generates ANSI character codes to printing colors to terminals.
See: http://en.wikipedia.org/wiki/ANSI_escape_code
z[z]�c C s t t| � d S )N�m)�CSI�str)�code� r �/usr/lib/python3.6/ansi.py�
code_to_chars s r c C s t d | t S )Nz2;)�OSC�BEL)�titler r r � set_title s r � c C s t t| � d S )N�J)r r )�moder r r � clear_screen s r c C s t t| � d S )N�K)r r )r r r r �
clear_line s r c @ s e Zd Zdd� ZdS )� AnsiCodesc C s: x4t | �D ](}|jd�s
t| |�}t| |t|�� q
W d S )N�_)�dir�
startswith�getattr�setattrr )�self�name�valuer r r �__init__ s
zAnsiCodes.__init__N)�__name__�
__module__� __qualname__r r r r r r s r c @ s> e Zd Zd
dd�Zddd�Zddd�Zddd �Zdd
d �Zd S )�
AnsiCursor� c C s t t|� d S )N�A)r r )r �nr r r �UP% s z
AnsiCursor.UPc C s t t|� d S )N�B)r r )r r# r r r �DOWN' s zAnsiCursor.DOWNc C s t t|� d S )N�C)r r )r r# r r r �FORWARD) s zAnsiCursor.FORWARDc C s t t|� d S )N�D)r r )r r# r r r �BACK+ s zAnsiCursor.BACKc C s t t|� d t|� d S )N�;�H)r r )r �x�yr r r �POS- s zAnsiCursor.POSN)r! )r! )r! )r! )r! r! )r r r r$ r& r( r* r/ r r r r r $ s
r c @ sP e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZdZdZdZdS )�AnsiFore� � � �! �" �# �$ �% �' �Z �[ �\ �] �^ �_ �` �a N)r r r �BLACK�RED�GREEN�YELLOW�BLUE�MAGENTA�CYAN�WHITE�RESET�
LIGHTBLACK_EX� LIGHTRED_EX�
LIGHTGREEN_EX�LIGHTYELLOW_EX� LIGHTBLUE_EX�LIGHTMAGENTA_EX� LIGHTCYAN_EX�
LIGHTWHITE_EXr r r r r0 1 s" r0 c @ sP e Zd ZdZdZdZdZdZdZdZ dZ
d Z d
Z d Z
d Zd
ZdZdZdZdZdS )�AnsiBack�( �) �* �+ �, �- �. �/ �1 �d �e �f �g �h �i �j �k N)r r r rB rC rD rE rF rG rH rI rJ rK rL rM rN rO rP rQ rR r r r r rS G s" rS c @ s e Zd ZdZdZdZdZdS )� AnsiStyler! r
� � N)r r r ZBRIGHTZDIMZNORMALZ RESET_ALLr r r r re ] s re N)r
)r
)�__doc__r r r
r r r r �objectr r r0 rS re ZForeZBackZStyleZCursorr r r r �<module> s
pip/_vendor/colorama/__pycache__/winterm.cpython-36.pyc 0000644 00000010607 14751155150 0017120 0 ustar 00 3
���e� � @ s@ d dl mZ G dd� de�ZG dd� de�ZG dd� de�ZdS ) � )�win32c @ s, e Zd ZdZdZdZdZdZdZdZ dZ
d S )
�WinColor� r � � � � � � N) �__name__�
__module__� __qualname__ZBLACKZBLUEZGREENZCYANZREDZMAGENTAZYELLOWZGREY� r r � /usr/lib/python3.6/winterm.pyr s r c @ s e Zd ZdZdZdZdS )�WinStyler � � N)r r r
ZNORMAL�BRIGHT�BRIGHT_BACKGROUNDr r r r r s r c @ s� e Zd Zdd� Zdd� Zdd� Zd dd �Zd!d d �Zd"d
d�Zd#dd�Z d$dd�Z
dd� Z d%dd�Z d&dd�Z
d'dd�Zd(d d �Zd d � ZdS ))�WinTermc C s> t jt j�j| _| j| j� | j| _| j| _ | j
| _ d| _ d S )Nr )
r �GetConsoleScreenBufferInfo�STDOUTZ wAttributes�_default� set_attrs�_fore�
_default_fore�_back�
_default_back�_style�_default_style�_light)�selfr r r �__init__ s zWinTerm.__init__c C s | j | jd | j| jB S )N� )r r r r )r! r r r � get_attrs$ s zWinTerm.get_attrsc C s. |d@ | _ |d? d@ | _|tjtjB @ | _d S )Nr
r )r r r r r r )r! �valuer r r r ' s
zWinTerm.set_attrsNc C s | j | j� | j| jd� d S )N)�attrs)r r � set_console)r! � on_stderrr r r � reset_all, s zWinTerm.reset_allFc C sL |d kr| j }|| _|r*| jtjO _n| jtj M _| j|d� d S )N)r( )r r r r r r' )r! �fore�lightr( r r r r* 0 s z WinTerm.forec C sL |d kr| j }|| _|r*| jtjO _n| jtj M _| j|d� d S )N)r( )r r r r r r' )r! �backr+ r( r r r r, ; s z WinTerm.backc C s$ |d kr| j }|| _| j|d� d S )N)r( )r r r' )r! �styler( r r r r- F s z
WinTerm.stylec C s0 |d kr| j � }tj}|r tj}tj||� d S )N)r$ r r �STDERRZSetConsoleTextAttribute)r! r& r( �handler r r r' L s zWinTerm.set_consolec C s, t j|�j}| jd7 _| jd7 _|S )Nr )r r �dwCursorPosition�X�Y)r! r/ �positionr r r � get_positionT s zWinTerm.get_positionc C s, |d kr d S t j}|r t j}t j||� d S )N)r r r. �SetConsoleCursorPosition)r! r3 r( r/ r r r �set_cursor_position\ s zWinTerm.set_cursor_positionc C sB t j}|rt j}| j|�}|j| |j| f}t j||dd� d S )NF)Zadjust)r r r. r4 r2 r1 r5 )r! �x�yr( r/ r3 Zadjusted_positionr r r �
cursor_adjustf s
zWinTerm.cursor_adjustr c C s� t j}|rt j}t j|�}|jj|jj }|jj|jj |jj }|dkrX|j}|| }|dkrrt jdd�}|}n|dkr�t jdd�}|}t j |d||� t j
|| j � ||� |dkr�t j |d� d S )Nr r r � )r r )
r r r. r �dwSizer1 r2 r0 �COORD�FillConsoleOutputCharacter�FillConsoleOutputAttributer$ r5 ) r! �moder( r/ �csbiZcells_in_screenZcells_before_cursor�
from_coord�cells_to_eraser r r � erase_screenn s&
zWinTerm.erase_screenc C s� t j}|rt j}t j|�}|dkr8|j}|jj|jj }|dkrZt jd|jj�}|jj}n |dkrzt jd|jj�}|jj}t j |d||� t j
|| j � ||� d S )Nr r r r: ) r r r. r r0 r; r1 r< r2 r= r> r$ )r! r? r( r/ r@ rA rB r r r �
erase_line� s
zWinTerm.erase_linec C s t j|� d S )N)r ZSetConsoleTitle)r! �titler r r � set_title� s zWinTerm.set_title)N)NFF)NFF)NF)NF)NF)F)r F)r F)r r r
r" r$ r r) r* r, r- r' r4 r6 r9 rC rD rF r r r r r s
r N)� r �objectr r r r r r r �<module> s pip/_vendor/colorama/__pycache__/initialise.cpython-36.opt-1.pyc 0000644 00000003061 14751155150 0020520 0 ustar 00 3
���e} � @ st d dl Z d dlZd dlZddlmZ dadadadada dd� Z
ddd �Z d
d � Z ej
d d
� �Zdd� Zdd� ZdS )� N� )� AnsiToWin32Fc C s t d k rt t�j� d S )N)r � orig_stdout� reset_all� r r � /usr/lib/python3.6/initialise.pyr s r Tc C s� | r t | ||g�r td��tjatjatjd kr8d antt||| |� t_atjd kr^d a ntt||| |� t_a t
s�t j t
� da
d S )Nz,wrap=False conflicts with any other arg=TrueT)�any�
ValueError�sys�stdoutr �stderr� orig_stderr�wrapped_stdout� wrap_stream�wrapped_stderr� atexit_done�atexit�registerr )� autoreset�convert�strip�wrapr r r �init s
r c C s t d k rt t_td k r tt_d S )N)r r
r r
r r r r r �deinit3 s r c
o s" t | |� z
d V W d t� X d S )N)r r )�args�kwargsr r r �
colorama_text: s
r c C s t d k rt t_td k r tt_d S )N)r r
r r r r r r r �reinitC s r c C s& |r"t | |||d�}|j� r"|j} | S )N)r r r )r Z should_wrap�stream)r r r r r �wrapperr r r r J s r )FNNT)r �
contextlibr
Z ansitowin32r r r
r r r r r r �contextmanagerr r r r r r r �<module> s
pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.pyc 0000644 00000015522 14751155150 0017614 0 ustar 00 3
���e�% � @ s� d dl Z d dlZd dlZddlmZmZmZmZ ddlm Z m
Z
m Z ddl m
Z
mZ dZe
dk rfe � Zdd� Zdd � ZG d
d � d e�ZG d d
� d
e�ZdS )� N� )�AnsiFore�AnsiBack� AnsiStyle�Style)�WinTerm�WinColor�WinStyle)�windll� winapi_testc C s t | d� p| jS )N�closed)�hasattrr )�stream� r �!/usr/lib/python3.6/ansitowin32.py�is_stream_closed s r c C s t | d�o| j� S )N�isatty)r
r )r r r r �is_a_tty s r c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) �
StreamWrapperz�
Wraps a stream (such as stdout), acting as a transparent proxy for all
attribute access apart from method 'write()', which is delegated to our
Converter instance.
c C s || _ || _d S )N)�_StreamWrapper__wrapped�_StreamWrapper__convertor)�self�wrappedZ converterr r r �__init__ s zStreamWrapper.__init__c C s t | j|�S )N)�getattrr )r �namer r r � __getattr__$ s zStreamWrapper.__getattr__c C s | j j|� d S )N)r �write)r �textr r r r ' s zStreamWrapper.writeN)�__name__�
__module__� __qualname__�__doc__r r r r r r r r s r c @ s~ e Zd ZdZejd�Zejd�Zd dd�Zdd � Z d
d � Z
d d
� Z dd� Z dd� Z
dd� Zdd� Zdd� Zdd� Zdd� ZdS ) � AnsiToWin32z�
Implements a 'write()' method which, on Windows, will strip ANSI character
sequences from the text, and if outputting to a tty, will convert them into
win32 function calls.
z ?\[((?:\d|;)*)([a-zA-Z])?z?\]((?:.|;)*?)()?NFc C s� || _ || _t|| �| _tjdk}|o*t� }|d krL|pJt|� oJt|� }|| _ |d krp|ont|� ont|�}|| _
| j � | _ | j t
jk| _d S )N�nt)r � autoresetr r �osr r r r �strip�convert�get_win32_calls� win32_calls�sys�stderr� on_stderr)r r r( r' r% Z
on_windowsZconversion_supportedr r r r 4 s
zAnsiToWin32.__init__c C s | j p| jp| jS )aj
True if this class is actually needed. If false, then the output
stream will not be affected, nor will win32 calls be issued, so
wrapping stdout is not actually required. This will generally be
False on non-Windows platforms, unless optional functionality like
autoreset has been requested using kwargs to init()
)r( r' r% )r r r r � should_wrapU s zAnsiToWin32.should_wrapc N C s> | j ot�r8tjtjftjtjtjftjtjtj ftj tjtj ft
j tj t
j ft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj t
jft
jtj ft
jtj t
j dft
jtj t
jdft
jtj t
jdft
jtj t
jdft
jtj t
jdft
j tj t
jdft
j tj t
jdft
j tj t
jdft j tj t
j ft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj t
jft jtj ft jtj t
j dft jtj t
jdft jtj t
jdft jtj t
jdft jtj t
jdft j tj t
jdft j tj t
jdft j tj t
jdfi&S t!� S )NT)"r( �wintermr � RESET_ALL� reset_allZBRIGHTZstyler ZDIMZNORMALr ZBLACKZforer ZREDZGREENZYELLOWZBLUEZMAGENTAZCYANZWHITEZGREYZRESETZ
LIGHTBLACK_EXZ LIGHTRED_EXZ
LIGHTGREEN_EXZLIGHTYELLOW_EXZ LIGHTBLUE_EXZLIGHTMAGENTA_EXZ LIGHTCYAN_EXZ
LIGHTWHITE_EXr Zback�dict)r r r r r) _ sP
zAnsiToWin32.get_win32_callsc C s@ | j s | jr| j|� n| jj|� | jj� | jr<| j� d S )N)r' r( �write_and_convertr r �flushr% r1 )r r r r r r � s
zAnsiToWin32.writec C s: | j r| jdd� n"| j r6t| j� r6| jjtj� d S )N�mr )r )r( �
call_win32r' r r r r r0 )r r r r r1 � s zAnsiToWin32.reset_allc C sf d}| j |�}x@| jj|�D ]0}|j� \}}| j|||� | j|j� � |}q W | j||t|�� dS )z�
Write the given text to our wrapped stream, stripping any ANSI
sequences from the text, and optionally converting them into win32
calls.
r N)� convert_osc� ANSI_CSI_RE�finditer�span�write_plain_text� convert_ansi�groups�len)r r Zcursor�match�start�endr r r r3 � s
z AnsiToWin32.write_and_convertc C s* ||k r&| j j|||� � | j j� d S )N)r r r4 )r r r@ rA r r r r; � s z AnsiToWin32.write_plain_textc C s" | j r | j||�}| j||� d S )N)r( �extract_paramsr6 )r � paramstring�command�paramsr r r r< � s zAnsiToWin32.convert_ansic C s~ |dkr<t dd� |jd�D ��}xXt|�dk r8|d }q"W n>t dd� |jd�D ��}t|�dkrz|d krnd }n |d
krzd
}|S )N�Hfc s s& | ] }t |�d krt|�ndV qdS )r r N)r> �int)�.0�pr r r � <genexpr>� s z-AnsiToWin32.extract_params.<locals>.<genexpr>�;� r c s s" | ]}t |�d krt|�V qdS )r N)r> rG )rH rI r r r rJ � s r ZJKm�ABCD)r )r )r )�tuple�splitr> )r rD rC rE r r r rB � s zAnsiToWin32.extract_paramsc C s� |dkrVx�|D ]B}|| j kr| j | }|d }|dd � }t| jd�}|||� qW n�|dkrttj|d | jd� n�|dkr�tj|d | jd� nf|dkr�tj|| jd� nL|dkr�|d }d| fd|f|df| dfd �| \} }
tj| |
| jd� d S )
Nr5 r r )r- �J�KrF rM )�A�B�C�D)r* r2 r- r/ Z erase_screenZ
erase_lineZset_cursor_positionZ
cursor_adjust) r rD rE ZparamZ func_args�func�args�kwargs�n�x�yr r r r6 � s$
*zAnsiToWin32.call_win32c C sv xp| j j|�D ]`}|j� \}}|d |� ||d � }|j� \}}|dkr|jd�}|d dkrtj|d � qW |S )N�rK r Z02r )� ANSI_OSC_REr9 r: r= rO r/ Z set_title)r r r? r@ rA rC rD rE r r r r7 � s
zAnsiToWin32.convert_osc)NNF)r r r! r" �re�compiler8 r] r r. r) r r1 r3 r; r< rB r6 r7 r r r r r# + s
!
,
r# )r^ r+ r& �ansir r r r r/ r r r Zwin32r
r r r �objectr r# r r r r �<module> s pip/_vendor/colorama/__pycache__/winterm.cpython-36.opt-1.pyc 0000644 00000010607 14751155150 0020057 0 ustar 00 3
���e� � @ s@ d dl mZ G dd� de�ZG dd� de�ZG dd� de�ZdS ) � )�win32c @ s, e Zd ZdZdZdZdZdZdZdZ dZ
d S )
�WinColor� r � � � � � � N) �__name__�
__module__� __qualname__ZBLACKZBLUEZGREENZCYANZREDZMAGENTAZYELLOWZGREY� r r � /usr/lib/python3.6/winterm.pyr s r c @ s e Zd ZdZdZdZdS )�WinStyler � � N)r r r
ZNORMAL�BRIGHT�BRIGHT_BACKGROUNDr r r r r s r c @ s� e Zd Zdd� Zdd� Zdd� Zd dd �Zd!d d �Zd"d
d�Zd#dd�Z d$dd�Z
dd� Z d%dd�Z d&dd�Z
d'dd�Zd(d d �Zd d � ZdS ))�WinTermc C s> t jt j�j| _| j| j� | j| _| j| _ | j
| _ d| _ d S )Nr )
r �GetConsoleScreenBufferInfo�STDOUTZ wAttributes�_default� set_attrs�_fore�
_default_fore�_back�
_default_back�_style�_default_style�_light)�selfr r r �__init__ s zWinTerm.__init__c C s | j | jd | j| jB S )N� )r r r r )r! r r r � get_attrs$ s zWinTerm.get_attrsc C s. |d@ | _ |d? d@ | _|tjtjB @ | _d S )Nr
r )r r r r r r )r! �valuer r r r ' s
zWinTerm.set_attrsNc C s | j | j� | j| jd� d S )N)�attrs)r r � set_console)r! � on_stderrr r r � reset_all, s zWinTerm.reset_allFc C sL |d kr| j }|| _|r*| jtjO _n| jtj M _| j|d� d S )N)r( )r r r r r r' )r! �fore�lightr( r r r r* 0 s z WinTerm.forec C sL |d kr| j }|| _|r*| jtjO _n| jtj M _| j|d� d S )N)r( )r r r r r r' )r! �backr+ r( r r r r, ; s z WinTerm.backc C s$ |d kr| j }|| _| j|d� d S )N)r( )r r r' )r! �styler( r r r r- F s z
WinTerm.stylec C s0 |d kr| j � }tj}|r tj}tj||� d S )N)r$ r r �STDERRZSetConsoleTextAttribute)r! r& r( �handler r r r' L s zWinTerm.set_consolec C s, t j|�j}| jd7 _| jd7 _|S )Nr )r r �dwCursorPosition�X�Y)r! r/ �positionr r r � get_positionT s zWinTerm.get_positionc C s, |d kr d S t j}|r t j}t j||� d S )N)r r r. �SetConsoleCursorPosition)r! r3 r( r/ r r r �set_cursor_position\ s zWinTerm.set_cursor_positionc C sB t j}|rt j}| j|�}|j| |j| f}t j||dd� d S )NF)Zadjust)r r r. r4 r2 r1 r5 )r! �x�yr( r/ r3 Zadjusted_positionr r r �
cursor_adjustf s
zWinTerm.cursor_adjustr c C s� t j}|rt j}t j|�}|jj|jj }|jj|jj |jj }|dkrX|j}|| }|dkrrt jdd�}|}n|dkr�t jdd�}|}t j |d||� t j
|| j � ||� |dkr�t j |d� d S )Nr r r � )r r )
r r r. r �dwSizer1 r2 r0 �COORD�FillConsoleOutputCharacter�FillConsoleOutputAttributer$ r5 ) r! �moder( r/ �csbiZcells_in_screenZcells_before_cursor�
from_coord�cells_to_eraser r r � erase_screenn s&
zWinTerm.erase_screenc C s� t j}|rt j}t j|�}|dkr8|j}|jj|jj }|dkrZt jd|jj�}|jj}n |dkrzt jd|jj�}|jj}t j |d||� t j
|| j � ||� d S )Nr r r r: ) r r r. r r0 r; r1 r< r2 r= r> r$ )r! r? r( r/ r@ rA rB r r r �
erase_line� s
zWinTerm.erase_linec C s t j|� d S )N)r ZSetConsoleTitle)r! �titler r r � set_title� s zWinTerm.set_title)N)NFF)NFF)NF)NF)NF)F)r F)r F)r r r
r" r$ r r) r* r, r- r' r4 r6 r9 rC rD rF r r r r r s
r N)� r �objectr r r r r r r �<module> s pip/_vendor/colorama/__init__.py 0000644 00000000360 14751155150 0012701 0 ustar 00 # Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
from .initialise import init, deinit, reinit, colorama_text
from .ansi import Fore, Back, Style, Cursor
from .ansitowin32 import AnsiToWin32
__version__ = '0.3.7'
pip/_vendor/colorama/win32.py 0000644 00000012365 14751155150 0012114 0 ustar 00 # Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
# from winbase.h
STDOUT = -11
STDERR = -12
try:
import ctypes
from ctypes import LibraryLoader
windll = LibraryLoader(ctypes.WinDLL)
from ctypes import wintypes
except (AttributeError, ImportError):
windll = None
SetConsoleTextAttribute = lambda *_: None
winapi_test = lambda *_: None
else:
from ctypes import byref, Structure, c_char, POINTER
COORD = wintypes._COORD
class CONSOLE_SCREEN_BUFFER_INFO(Structure):
"""struct in wincon.h."""
_fields_ = [
("dwSize", COORD),
("dwCursorPosition", COORD),
("wAttributes", wintypes.WORD),
("srWindow", wintypes.SMALL_RECT),
("dwMaximumWindowSize", COORD),
]
def __str__(self):
return '(%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d)' % (
self.dwSize.Y, self.dwSize.X
, self.dwCursorPosition.Y, self.dwCursorPosition.X
, self.wAttributes
, self.srWindow.Top, self.srWindow.Left, self.srWindow.Bottom, self.srWindow.Right
, self.dwMaximumWindowSize.Y, self.dwMaximumWindowSize.X
)
_GetStdHandle = windll.kernel32.GetStdHandle
_GetStdHandle.argtypes = [
wintypes.DWORD,
]
_GetStdHandle.restype = wintypes.HANDLE
_GetConsoleScreenBufferInfo = windll.kernel32.GetConsoleScreenBufferInfo
_GetConsoleScreenBufferInfo.argtypes = [
wintypes.HANDLE,
POINTER(CONSOLE_SCREEN_BUFFER_INFO),
]
_GetConsoleScreenBufferInfo.restype = wintypes.BOOL
_SetConsoleTextAttribute = windll.kernel32.SetConsoleTextAttribute
_SetConsoleTextAttribute.argtypes = [
wintypes.HANDLE,
wintypes.WORD,
]
_SetConsoleTextAttribute.restype = wintypes.BOOL
_SetConsoleCursorPosition = windll.kernel32.SetConsoleCursorPosition
_SetConsoleCursorPosition.argtypes = [
wintypes.HANDLE,
COORD,
]
_SetConsoleCursorPosition.restype = wintypes.BOOL
_FillConsoleOutputCharacterA = windll.kernel32.FillConsoleOutputCharacterA
_FillConsoleOutputCharacterA.argtypes = [
wintypes.HANDLE,
c_char,
wintypes.DWORD,
COORD,
POINTER(wintypes.DWORD),
]
_FillConsoleOutputCharacterA.restype = wintypes.BOOL
_FillConsoleOutputAttribute = windll.kernel32.FillConsoleOutputAttribute
_FillConsoleOutputAttribute.argtypes = [
wintypes.HANDLE,
wintypes.WORD,
wintypes.DWORD,
COORD,
POINTER(wintypes.DWORD),
]
_FillConsoleOutputAttribute.restype = wintypes.BOOL
_SetConsoleTitleW = windll.kernel32.SetConsoleTitleA
_SetConsoleTitleW.argtypes = [
wintypes.LPCSTR
]
_SetConsoleTitleW.restype = wintypes.BOOL
handles = {
STDOUT: _GetStdHandle(STDOUT),
STDERR: _GetStdHandle(STDERR),
}
def winapi_test():
handle = handles[STDOUT]
csbi = CONSOLE_SCREEN_BUFFER_INFO()
success = _GetConsoleScreenBufferInfo(
handle, byref(csbi))
return bool(success)
def GetConsoleScreenBufferInfo(stream_id=STDOUT):
handle = handles[stream_id]
csbi = CONSOLE_SCREEN_BUFFER_INFO()
success = _GetConsoleScreenBufferInfo(
handle, byref(csbi))
return csbi
def SetConsoleTextAttribute(stream_id, attrs):
handle = handles[stream_id]
return _SetConsoleTextAttribute(handle, attrs)
def SetConsoleCursorPosition(stream_id, position, adjust=True):
position = COORD(*position)
# If the position is out of range, do nothing.
if position.Y <= 0 or position.X <= 0:
return
# Adjust for Windows' SetConsoleCursorPosition:
# 1. being 0-based, while ANSI is 1-based.
# 2. expecting (x,y), while ANSI uses (y,x).
adjusted_position = COORD(position.Y - 1, position.X - 1)
if adjust:
# Adjust for viewport's scroll position
sr = GetConsoleScreenBufferInfo(STDOUT).srWindow
adjusted_position.Y += sr.Top
adjusted_position.X += sr.Left
# Resume normal processing
handle = handles[stream_id]
return _SetConsoleCursorPosition(handle, adjusted_position)
def FillConsoleOutputCharacter(stream_id, char, length, start):
handle = handles[stream_id]
char = c_char(char.encode())
length = wintypes.DWORD(length)
num_written = wintypes.DWORD(0)
# Note that this is hard-coded for ANSI (vs wide) bytes.
success = _FillConsoleOutputCharacterA(
handle, char, length, start, byref(num_written))
return num_written.value
def FillConsoleOutputAttribute(stream_id, attr, length, start):
''' FillConsoleOutputAttribute( hConsole, csbi.wAttributes, dwConSize, coordScreen, &cCharsWritten )'''
handle = handles[stream_id]
attribute = wintypes.WORD(attr)
length = wintypes.DWORD(length)
num_written = wintypes.DWORD(0)
# Note that this is hard-coded for ANSI (vs wide) bytes.
return _FillConsoleOutputAttribute(
handle, attribute, length, start, byref(num_written))
def SetConsoleTitle(title):
return _SetConsoleTitleW(title)
pip/_vendor/colorama/winterm.py 0000644 00000014222 14751155150 0012631 0 ustar 00 # Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
from . import win32
# from wincon.h
class WinColor(object):
BLACK = 0
BLUE = 1
GREEN = 2
CYAN = 3
RED = 4
MAGENTA = 5
YELLOW = 6
GREY = 7
# from wincon.h
class WinStyle(object):
NORMAL = 0x00 # dim text, dim background
BRIGHT = 0x08 # bright text, dim background
BRIGHT_BACKGROUND = 0x80 # dim text, bright background
class WinTerm(object):
def __init__(self):
self._default = win32.GetConsoleScreenBufferInfo(win32.STDOUT).wAttributes
self.set_attrs(self._default)
self._default_fore = self._fore
self._default_back = self._back
self._default_style = self._style
# In order to emulate LIGHT_EX in windows, we borrow the BRIGHT style.
# So that LIGHT_EX colors and BRIGHT style do not clobber each other,
# we track them separately, since LIGHT_EX is overwritten by Fore/Back
# and BRIGHT is overwritten by Style codes.
self._light = 0
def get_attrs(self):
return self._fore + self._back * 16 + (self._style | self._light)
def set_attrs(self, value):
self._fore = value & 7
self._back = (value >> 4) & 7
self._style = value & (WinStyle.BRIGHT | WinStyle.BRIGHT_BACKGROUND)
def reset_all(self, on_stderr=None):
self.set_attrs(self._default)
self.set_console(attrs=self._default)
def fore(self, fore=None, light=False, on_stderr=False):
if fore is None:
fore = self._default_fore
self._fore = fore
# Emulate LIGHT_EX with BRIGHT Style
if light:
self._light |= WinStyle.BRIGHT
else:
self._light &= ~WinStyle.BRIGHT
self.set_console(on_stderr=on_stderr)
def back(self, back=None, light=False, on_stderr=False):
if back is None:
back = self._default_back
self._back = back
# Emulate LIGHT_EX with BRIGHT_BACKGROUND Style
if light:
self._light |= WinStyle.BRIGHT_BACKGROUND
else:
self._light &= ~WinStyle.BRIGHT_BACKGROUND
self.set_console(on_stderr=on_stderr)
def style(self, style=None, on_stderr=False):
if style is None:
style = self._default_style
self._style = style
self.set_console(on_stderr=on_stderr)
def set_console(self, attrs=None, on_stderr=False):
if attrs is None:
attrs = self.get_attrs()
handle = win32.STDOUT
if on_stderr:
handle = win32.STDERR
win32.SetConsoleTextAttribute(handle, attrs)
def get_position(self, handle):
position = win32.GetConsoleScreenBufferInfo(handle).dwCursorPosition
# Because Windows coordinates are 0-based,
# and win32.SetConsoleCursorPosition expects 1-based.
position.X += 1
position.Y += 1
return position
def set_cursor_position(self, position=None, on_stderr=False):
if position is None:
# I'm not currently tracking the position, so there is no default.
# position = self.get_position()
return
handle = win32.STDOUT
if on_stderr:
handle = win32.STDERR
win32.SetConsoleCursorPosition(handle, position)
def cursor_adjust(self, x, y, on_stderr=False):
handle = win32.STDOUT
if on_stderr:
handle = win32.STDERR
position = self.get_position(handle)
adjusted_position = (position.Y + y, position.X + x)
win32.SetConsoleCursorPosition(handle, adjusted_position, adjust=False)
def erase_screen(self, mode=0, on_stderr=False):
# 0 should clear from the cursor to the end of the screen.
# 1 should clear from the cursor to the beginning of the screen.
# 2 should clear the entire screen, and move cursor to (1,1)
handle = win32.STDOUT
if on_stderr:
handle = win32.STDERR
csbi = win32.GetConsoleScreenBufferInfo(handle)
# get the number of character cells in the current buffer
cells_in_screen = csbi.dwSize.X * csbi.dwSize.Y
# get number of character cells before current cursor position
cells_before_cursor = csbi.dwSize.X * csbi.dwCursorPosition.Y + csbi.dwCursorPosition.X
if mode == 0:
from_coord = csbi.dwCursorPosition
cells_to_erase = cells_in_screen - cells_before_cursor
if mode == 1:
from_coord = win32.COORD(0, 0)
cells_to_erase = cells_before_cursor
elif mode == 2:
from_coord = win32.COORD(0, 0)
cells_to_erase = cells_in_screen
# fill the entire screen with blanks
win32.FillConsoleOutputCharacter(handle, ' ', cells_to_erase, from_coord)
# now set the buffer's attributes accordingly
win32.FillConsoleOutputAttribute(handle, self.get_attrs(), cells_to_erase, from_coord)
if mode == 2:
# put the cursor where needed
win32.SetConsoleCursorPosition(handle, (1, 1))
def erase_line(self, mode=0, on_stderr=False):
# 0 should clear from the cursor to the end of the line.
# 1 should clear from the cursor to the beginning of the line.
# 2 should clear the entire line.
handle = win32.STDOUT
if on_stderr:
handle = win32.STDERR
csbi = win32.GetConsoleScreenBufferInfo(handle)
if mode == 0:
from_coord = csbi.dwCursorPosition
cells_to_erase = csbi.dwSize.X - csbi.dwCursorPosition.X
if mode == 1:
from_coord = win32.COORD(0, csbi.dwCursorPosition.Y)
cells_to_erase = csbi.dwCursorPosition.X
elif mode == 2:
from_coord = win32.COORD(0, csbi.dwCursorPosition.Y)
cells_to_erase = csbi.dwSize.X
# fill the entire screen with blanks
win32.FillConsoleOutputCharacter(handle, ' ', cells_to_erase, from_coord)
# now set the buffer's attributes accordingly
win32.FillConsoleOutputAttribute(handle, self.get_attrs(), cells_to_erase, from_coord)
def set_title(self, title):
win32.SetConsoleTitle(title)
pip/_vendor/webencodings/__pycache__/tests.cpython-36.pyc 0000644 00000011570 14751155150 0017447 0 ustar 00 3
���e� � @ s� d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
m Z m Z dd� Z
dd� Zd d
� Zd d � Zd
d� Zdd� Zdd� Zdd� Zdd� ZdS )z�
webencodings.tests
~~~~~~~~~~~~~~~~~~
A basic test suite for Encoding.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� )�unicode_literals� ) �lookup�LABELS�decode�encode� iter_decode� iter_encode�IncrementalDecoder�IncrementalEncoder�UTF8c O s4 y|||� W n | k
r" d S X t d| ��d S )NzDid not raise %s.)�AssertionError)Z exceptionZfunction�args�kwargs� r �/usr/lib/python3.6/tests.py�
assert_raises s
r c C s t d�jdkst�t d�jdks$t�t d�jdks6t�t d�jdksHt�t d�jdksZt�t d�jdkslt�t d�jdks~t�t d�d ks�t�t d�d ks�t�t d �jd
ks�t�t d �jd
ks�t�t d �jd
ks�t�t d
�jd
ks�t�t d�d ks�t�t d�d k�st�d S )Nzutf-8zUtf-8zUTF-8�utf8zutf8 z
utf8 �u8u utf-8 zUS-ASCIIz windows-1252z
iso-8859-1�latin1ZLATIN1zlatin-1u LATİN1)r �namer
r r r r � test_labels s r c C s x�t D ]�} td| �dt| �fks$t�td| �dks6t�xLdD ]D}tdg| | �\}}t|�g ksdt�ttdg| | ��g ks<t�q<W t| �}|jd�dks�t�|jddd�dks�t�t | �}|jd�dks�t�|jddd�dkst�qW x&t
t j � �D ]}t|�j |ks�t�q�W d S ) N� � r r � T)�final)r r r )
r r r r
r r �listr r
r �set�valuesr )Zlabel�repeat�output�_�decoder�encoderr r r r �test_all_labels0 s
r$ c C sT t ttdd� t ttdd� t ttg d� t ttg d� t ttd� t ttd� d S )Ns éZinvalid� é)r � LookupErrorr r r r r
r r r r r �test_invalid_labelC s r' c C s� t dd�dtd�fkst�t dtd��dtd�fks8t�t dd�dtd�fksRt�t dt�dtd�fkslt�t dd�dtd�fks�t�t d d�dtd�fks�t�t d
d�dtd �fks�t�t d d�dtd
�fks�t�t dd�dtd �fks�t�t dd�dtd
�fk�s
t�t dd�dtd �fk�s&t�t dd�dtd
�fk�sBt�t dd�dtd
�fk�s^t�t dd�dtd �fk�szt�t dd�dtd
�fk�s�t�t dd�dtd
�fk�s�t�d S )N� �r u €s ér r% �asciiu és és �� �zutf-16bes ��� zutf-16les ��� u s �� �s �zUTF-16BEs � zUTF-16LEzUTF-16)r r r
r r r r r � test_decodeL s r* c C sp t dd�dkst�t dd�dks$t�t dd�dks6t�t dd�dksHt�t dd�dksZt�t dd �d
kslt�d S ) Nr% r � �r s ézutf-16s � zutf-16lezutf-16bes �)r r
r r r r � test_encodeb s r, c C s� dd� } | g d�dkst �| dgd�dks.t �| dgd�dksBt �| dgd�d ksVt �| d
d gd�d kslt �| d d
gd�d ks�t �| dgd�dks�t �| dgd�dks�t �| dddgd�dks�t �| dddgd�dks�t �| ddddddgd�dks�t �| dgd�dk�st �| dgd�dk�s$t �| dgd�dk�s:t �| dgd�dk�sPt �| dd ddd d gd�dk�spt �| dd d gd �d!k�s�t �d S )"Nc S s t | |�\}}dj|�S )Nr )r �join)�inputZfallback_encodingr Z _encodingr r r �iter_decode_to_stringl s z/test_iter_decode.<locals>.iter_decode_to_stringr r r r+ r% s helloZhellos hes llos hell� os éu és és � �� �� au a�� �s ���s �u ï»s �� �s ��� � �s ��� s h�zx-user-definedu hllo)r
)r/ r r r �test_iter_decodek s. r7 c C s� dj tg d��dkst�dj tdgd��dks2t�dj tdgd��dksLt�dj tddddgd��dkslt�dj tddddgd��dks�t�dj tddddgd��dks�t�dj tddddgd ��d
ks�t�dj tdd dd gd
��dks�t�d S )Nr r r r% r+ zutf-16s � zutf-16lezutf-16bes �u hZllozx-user-defineds h�llo)r- r r
r r r r �test_iter_encode� s r8 c C s@ d} d}d} d}t | d�|td�fks*t�t|d�| ks<t�d S )Ns 2, O�#�ɻtϨ�u 2, O#ts aaZaazx-user-defined)r r r
r )ZencodedZdecodedr r r �test_x_user_defined� s r9 N)�__doc__Z
__future__r r r r r r r r r
r r r r r$ r' r* r, r7 r8 r9 r r r r �<module> s , pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.opt-1.pyc 0000644 00000003376 14751155150 0021043 0 ustar 00 3
���e � @ sf d Z ddlZyddlmZ W n ek
r< ddlmZ Y nX dd� Zdd� Zedkrbe ed �� dS )
z�
webencodings.mklabels
~~~~~~~~~~~~~~~~~~~~~
Regenarate the webencodings.labels module.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� N)�urlopenc C s | S )N� )�stringr r � /usr/lib/python3.6/mklabels.py� assert_lower s r c sf dg}dd� t jt| �j� jd��D �}tdd� |D ��� |j� fdd�|D �� |jd� d j|�S )
Na """
webencodings.labels
~~~~~~~~~~~~~~~~~~~
Map encoding labels to their name.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
# XXX Do not edit!
# This file is automatically generated by mklabels.py
LABELS = {
c S sL g | ]D}|d D ]6}|d D ](}t t|��jd�t |d �jd�f�q qqS )Z encodings�labels�u�name)�reprr �lstrip)�.0�category�encoding�labelr r r �
<listcomp>- s z generate.<locals>.<listcomp>�asciic s s | ]\}}t |�V qd S )N)�len)r r r r r r � <genexpr>2 s zgenerate.<locals>.<genexpr>c 3 s, | ]$\}}d |d� t |� |f V qdS )z %s:%s %s,
� N)r )r r r )�max_lenr r r 4 s �}� ) �json�loadsr �read�decode�max�extend�append�join)Zurl�partsr r )r r �generate s
r! �__main__z.http://encoding.spec.whatwg.org/encodings.json)
�__doc__r Zurllibr � ImportErrorZurllib.requestr r! �__name__�printr r r r �<module> s ! pip/_vendor/webencodings/__pycache__/tests.cpython-36.opt-1.pyc 0000644 00000004443 14751155150 0020407 0 ustar 00 3
���e� � @ s� d Z ddlmZ ddlmZmZmZmZmZm Z m
Z
m Z m Z dd� Z
dd� Zd d
� Zd d � Zd
d� Zdd� Zdd� Zdd� Zdd� ZdS )z�
webencodings.tests
~~~~~~~~~~~~~~~~~~
A basic test suite for Encoding.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� )�unicode_literals� ) �lookup�LABELS�decode�encode� iter_decode� iter_encode�IncrementalDecoder�IncrementalEncoder�UTF8c O s4 y|||� W n | k
r" d S X t d| ��d S )NzDid not raise %s.)�AssertionError)Z exceptionZfunction�args�kwargs� r �/usr/lib/python3.6/tests.py�
assert_raises s
r c C s d S )Nr r r r r � test_labels s r c C sZ x>t D ]6} x dD ]}tdg| | �\}}qW t| �}t| �}qW xtt j� �D ]}qNW d S )Nr r � � )r r r )r r r
r �set�values)Zlabel�repeat�output�_�decoder�encoder�namer r r �test_all_labels0 s
r c C sT t ttdd� t ttdd� t ttg d� t ttg d� t ttd� t ttd� d S )Ns éZinvalid� é)r � LookupErrorr r r r r
r r r r r �test_invalid_labelC s r! c C s d S )Nr r r r r � test_decodeL s r" c C s d S )Nr r r r r � test_encodeb s r# c C s dd� } d S )Nc S s t | |�\}}dj|�S )N� )r �join)�inputZfallback_encodingr Z _encodingr r r �iter_decode_to_stringl s z/test_iter_decode.<locals>.iter_decode_to_stringr )r' r r r �test_iter_decodek s r( c C s d S )Nr r r r r �test_iter_encode� s r) c C s d} d}d} d}d S )Ns 2, O�#�ɻtϨ�u 2, O#ts aaZaar )ZencodedZdecodedr r r �test_x_user_defined� s
r* N)�__doc__Z
__future__r r$ r r r r r r r
r r r r r r! r" r# r( r) r* r r r r �<module> s , pip/_vendor/webencodings/__pycache__/labels.cpython-36.pyc 0000644 00000007646 14751155150 0017560 0 ustar 00 3
���e# � � @ s� d Z ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd d d d d d d d d d d d
d
d
d d d d d d d d d d d
d
d
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd d d d d d d d d d d d d d d d d!d!d!d!d!d"d"d"d#d#d$d$d$d$d$d$d$d%d%d%d%d%d%d%d%d%d%d&d&d'd(d(d)d*��Zd+S ),z�
webencodings.labels
~~~~~~~~~~~~~~~~~~~
Map encoding labels to their name.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
zutf-8�ibm866z
iso-8859-2z
iso-8859-3z
iso-8859-4z
iso-8859-5z
iso-8859-6z
iso-8859-7z
iso-8859-8z iso-8859-8-iz iso-8859-10z iso-8859-13z iso-8859-14z iso-8859-15z iso-8859-16zkoi8-rzkoi8-u� macintoshz windows-874z windows-1250z windows-1251z windows-1252z windows-1253z windows-1254z windows-1255z windows-1256z windows-1257z windows-1258zx-mac-cyrillic�gbk�gb18030z
hz-gb-2312�big5zeuc-jpz iso-2022-jp� shift_jiszeuc-krz iso-2022-krzutf-16bezutf-16lezx-user-defined)�zunicode-1-1-utf-8zutf-8�utf8�866�cp866�csibm866r � csisolatin2z
iso-8859-2z
iso-ir-101z iso8859-2Ziso88592z
iso_8859-2ziso_8859-2:1987�l2�latin2� csisolatin3z
iso-8859-3z
iso-ir-109z iso8859-3Ziso88593z
iso_8859-3ziso_8859-3:1988�l3�latin3� csisolatin4z
iso-8859-4z
iso-ir-110z iso8859-4Ziso88594z
iso_8859-4ziso_8859-4:1988�l4�latin4�csisolatincyrillic�cyrillicz
iso-8859-5z
iso-ir-144z iso8859-5Ziso88595z
iso_8859-5ziso_8859-5:1988�arabiczasmo-708Z csiso88596eZ csiso88596i�csisolatinarabiczecma-114z
iso-8859-6z iso-8859-6-ez iso-8859-6-iz
iso-ir-127z iso8859-6Ziso88596z
iso_8859-6ziso_8859-6:1987�csisolatingreekzecma-118�elot_928�greek�greek8z
iso-8859-7z
iso-ir-126z iso8859-7Ziso88597z
iso_8859-7ziso_8859-7:1987Z sun_eu_greekZ csiso88598e�csisolatinhebrew�hebrewz
iso-8859-8z iso-8859-8-ez
iso-ir-138z iso8859-8Ziso88598z
iso_8859-8ziso_8859-8:1988ZvisualZ csiso88598iz iso-8859-8-iZlogical� csisolatin6z iso-8859-10z
iso-ir-157z
iso8859-10Z iso885910�l6�latin6z iso-8859-13z
iso8859-13Z iso885913z iso-8859-14z
iso8859-14Z iso885914Z csisolatin9z iso-8859-15z
iso8859-15Z iso885915z iso_8859-15�l9z iso-8859-16�cskoi8rZkoiZkoi8zkoi8-r�koi8_rzkoi8-uZ csmacintoshZmacr z x-mac-romanzdos-874z iso-8859-11z
iso8859-11Z iso885911ztis-620z windows-874�cp1250z windows-1250zx-cp1250�cp1251z windows-1251zx-cp1251zansi_x3.4-1968�ascii�cp1252�cp819� csisolatin1�ibm819z
iso-8859-1z
iso-ir-100z iso8859-1Ziso88591z
iso_8859-1ziso_8859-1:1987�l1�latin1zus-asciiz windows-1252zx-cp1252�cp1253z windows-1253zx-cp1253�cp1254� csisolatin5z
iso-8859-9z
iso-ir-148z iso8859-9Ziso88599z
iso_8859-9ziso_8859-9:1989�l5�latin5z windows-1254zx-cp1254�cp1255z windows-1255zx-cp1255�cp1256z windows-1256zx-cp1256�cp1257z windows-1257zx-cp1257�cp1258z windows-1258zx-cp1258zx-mac-cyrilliczx-mac-ukrainian�chineseZcsgb2312�csiso58gb231280�gb2312Zgb_2312z
gb_2312-80r z iso-ir-58zx-gbkr z
hz-gb-2312r z
big5-hkscszcn-big5�csbig5zx-x-big5Zcseucpkdfmtjapanesezeuc-jpzx-euc-jp� csiso2022jpz iso-2022-jp�
csshiftjis�ms_kanjiz shift-jisr �sjisz windows-31jzx-sjisZcseuckrZ
csksc56011987zeuc-krz
iso-ir-149�koreanzks_c_5601-1987zks_c_5601-1989�ksc5601Zksc_5601z windows-949� csiso2022krz iso-2022-krzutf-16bezutf-16zutf-16lezx-user-definedN)�__doc__ZLABELS� rB rB � /usr/lib/python3.6/labels.py�<module> s� pip/_vendor/webencodings/__pycache__/labels.cpython-36.opt-1.pyc 0000644 00000007646 14751155150 0020517 0 ustar 00 3
���e# � � @ s� d Z ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd d d d d d d d d d d d
d
d
d d d d d d d d d d d
d
d
ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd d d d d d d d d d d d d d d d d!d!d!d!d!d"d"d"d#d#d$d$d$d$d$d$d$d%d%d%d%d%d%d%d%d%d%d&d&d'd(d(d)d*��Zd+S ),z�
webencodings.labels
~~~~~~~~~~~~~~~~~~~
Map encoding labels to their name.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
zutf-8�ibm866z
iso-8859-2z
iso-8859-3z
iso-8859-4z
iso-8859-5z
iso-8859-6z
iso-8859-7z
iso-8859-8z iso-8859-8-iz iso-8859-10z iso-8859-13z iso-8859-14z iso-8859-15z iso-8859-16zkoi8-rzkoi8-u� macintoshz windows-874z windows-1250z windows-1251z windows-1252z windows-1253z windows-1254z windows-1255z windows-1256z windows-1257z windows-1258zx-mac-cyrillic�gbk�gb18030z
hz-gb-2312�big5zeuc-jpz iso-2022-jp� shift_jiszeuc-krz iso-2022-krzutf-16bezutf-16lezx-user-defined)�zunicode-1-1-utf-8zutf-8�utf8�866�cp866�csibm866r � csisolatin2z
iso-8859-2z
iso-ir-101z iso8859-2Ziso88592z
iso_8859-2ziso_8859-2:1987�l2�latin2� csisolatin3z
iso-8859-3z
iso-ir-109z iso8859-3Ziso88593z
iso_8859-3ziso_8859-3:1988�l3�latin3� csisolatin4z
iso-8859-4z
iso-ir-110z iso8859-4Ziso88594z
iso_8859-4ziso_8859-4:1988�l4�latin4�csisolatincyrillic�cyrillicz
iso-8859-5z
iso-ir-144z iso8859-5Ziso88595z
iso_8859-5ziso_8859-5:1988�arabiczasmo-708Z csiso88596eZ csiso88596i�csisolatinarabiczecma-114z
iso-8859-6z iso-8859-6-ez iso-8859-6-iz
iso-ir-127z iso8859-6Ziso88596z
iso_8859-6ziso_8859-6:1987�csisolatingreekzecma-118�elot_928�greek�greek8z
iso-8859-7z
iso-ir-126z iso8859-7Ziso88597z
iso_8859-7ziso_8859-7:1987Z sun_eu_greekZ csiso88598e�csisolatinhebrew�hebrewz
iso-8859-8z iso-8859-8-ez
iso-ir-138z iso8859-8Ziso88598z
iso_8859-8ziso_8859-8:1988ZvisualZ csiso88598iz iso-8859-8-iZlogical� csisolatin6z iso-8859-10z
iso-ir-157z
iso8859-10Z iso885910�l6�latin6z iso-8859-13z
iso8859-13Z iso885913z iso-8859-14z
iso8859-14Z iso885914Z csisolatin9z iso-8859-15z
iso8859-15Z iso885915z iso_8859-15�l9z iso-8859-16�cskoi8rZkoiZkoi8zkoi8-r�koi8_rzkoi8-uZ csmacintoshZmacr z x-mac-romanzdos-874z iso-8859-11z
iso8859-11Z iso885911ztis-620z windows-874�cp1250z windows-1250zx-cp1250�cp1251z windows-1251zx-cp1251zansi_x3.4-1968�ascii�cp1252�cp819� csisolatin1�ibm819z
iso-8859-1z
iso-ir-100z iso8859-1Ziso88591z
iso_8859-1ziso_8859-1:1987�l1�latin1zus-asciiz windows-1252zx-cp1252�cp1253z windows-1253zx-cp1253�cp1254� csisolatin5z
iso-8859-9z
iso-ir-148z iso8859-9Ziso88599z
iso_8859-9ziso_8859-9:1989�l5�latin5z windows-1254zx-cp1254�cp1255z windows-1255zx-cp1255�cp1256z windows-1256zx-cp1256�cp1257z windows-1257zx-cp1257�cp1258z windows-1258zx-cp1258zx-mac-cyrilliczx-mac-ukrainian�chineseZcsgb2312�csiso58gb231280�gb2312Zgb_2312z
gb_2312-80r z iso-ir-58zx-gbkr z
hz-gb-2312r z
big5-hkscszcn-big5�csbig5zx-x-big5Zcseucpkdfmtjapanesezeuc-jpzx-euc-jp� csiso2022jpz iso-2022-jp�
csshiftjis�ms_kanjiz shift-jisr �sjisz windows-31jzx-sjisZcseuckrZ
csksc56011987zeuc-krz
iso-ir-149�koreanzks_c_5601-1987zks_c_5601-1989�ksc5601Zksc_5601z windows-949� csiso2022krz iso-2022-krzutf-16bezutf-16zutf-16lezx-user-definedN)�__doc__ZLABELS� rB rB � /usr/lib/python3.6/labels.py�<module> s� pip/_vendor/webencodings/__pycache__/__init__.cpython-36.pyc 0000644 00000022570 14751155150 0020046 0 ustar 00 3
���eP) � @ s� d Z ddlmZ ddlZddlmZ dZddd d
d �Zi Zd d
� Z dd� Z
dd� Z G dd� de �Z
e
d�Ze
d�Ze
d�Zd+dd�Zdd� Zed fd d �Zd,d d �Zd!d"� Zed fd#d$�Zd%d&� ZG d'd(� d(e �ZG d)d*� d*e �ZdS )-a
webencodings
~~~~~~~~~~~~
This is a Python implementation of the `WHATWG Encoding standard
<http://encoding.spec.whatwg.org/>`. See README for details.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� )�unicode_literalsN� )�LABELSz0.5z
iso-8859-8z mac-cyrillicz mac-romanZcp874)z iso-8859-8-izx-mac-cyrillic� macintoshz windows-874c C s | j d�j� jd�S )a9 Transform (only) ASCII letters to lower case: A-Z is mapped to a-z.
:param string: An Unicode string.
:returns: A new Unicode string.
This is used for `ASCII case-insensitive
<http://encoding.spec.whatwg.org/#ascii-case-insensitive>`_
matching of encoding labels.
The same matching is also used, among other things,
for `CSS keywords <http://dev.w3.org/csswg/css-values/#keywords>`_.
This is different from the :meth:`~py:str.lower` method of Unicode strings
which also affect non-ASCII characters,
sometimes mapping them into the ASCII range:
>>> keyword = u'Bac\N{KELVIN SIGN}ground'
>>> assert keyword.lower() == u'background'
>>> assert ascii_lower(keyword) != keyword.lower()
>>> assert ascii_lower(keyword) == u'bac\N{KELVIN SIGN}ground'
�utf8)�encode�lower�decode)�string� r � /usr/lib/python3.6/__init__.py� ascii_lower# s r
c C sx t | jd��} tj| �}|dkr$dS tj|�}|dkrt|dkrLddlm} ntj||�}tj |�}t
||�}|t|< |S )u<
Look for an encoding by its label.
This is the spec’s `get an encoding
<http://encoding.spec.whatwg.org/#concept-encoding-get>`_ algorithm.
Supported labels are listed there.
:param label: A string.
:returns:
An :class:`Encoding` object, or :obj:`None` for an unknown label.
z
Nzx-user-definedr )�
codec_info) r
�stripr �get�CACHEZx_user_definedr � PYTHON_NAMES�codecs�lookup�Encoding)Zlabel�name�encodingr Z python_namer r r r = s
r c C s. t | d�r| S t| �}|dkr*td| ��|S )z�
Accept either an encoding object or label.
:param encoding: An :class:`Encoding` object or a label string.
:returns: An :class:`Encoding` object.
:raises: :exc:`~exceptions.LookupError` for an unknown label.
r NzUnknown encoding label: %r)�hasattrr � LookupError)Zencoding_or_labelr r r r �
_get_encoding[ s
r c @ s e Zd ZdZdd� Zdd� ZdS )r aO Reresents a character encoding such as UTF-8,
that can be used for decoding or encoding.
.. attribute:: name
Canonical name of the encoding
.. attribute:: codec_info
The actual implementation of the encoding,
a stdlib :class:`~codecs.CodecInfo` object.
See :func:`codecs.register`.
c C s || _ || _d S )N)r r )�selfr r r r r �__init__| s zEncoding.__init__c C s
d| j S )Nz
<Encoding %s>)r )r r r r �__repr__� s zEncoding.__repr__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r m s r zutf-8zutf-16lezutf-16be�replacec C s2 t |�}t| �\}} |p|}|jj| |�d |fS )a�
Decode a single string.
:param input: A byte string
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:return:
A ``(output, encoding)`` tuple of an Unicode string
and an :obj:`Encoding`.
r )r � _detect_bomr r )�input�fallback_encoding�errorsZ bom_encodingr r r r r � s r c C sV | j d�rt| dd� fS | j d�r4t| dd� fS | j d�rNt| dd� fS d| fS )zBReturn (bom_encoding, input), with any BOM removed from the input.s ��� Ns ��s � )�
startswith�_UTF16LE�_UTF16BE�UTF8)r$ r r r r# � s
r# �strictc C s t |�jj| |�d S )a;
Encode a single string.
:param input: An Unicode string.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:return: A byte string.
r )r r r )r$ r r& r r r r � s r c C s$ t ||�}t| |�}t|�}||fS )a�
"Pull"-based decoder.
:param input:
An iterable of byte strings.
The input is first consumed just enough to determine the encoding
based on the precense of a BOM,
then consumed on demand when the return value is.
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:returns:
An ``(output, encoding)`` tuple.
:obj:`output` is an iterable of Unicode strings,
:obj:`encoding` is the :obj:`Encoding` that is being used.
)�IncrementalDecoder�_iter_decode_generator�next)r$ r% r& �decoder� generatorr r r r � iter_decode� s
r3 c c s� |j }t| �} xf| D ].}||�}|r|jdk s2t�|jV |V P qW |ddd�}|jdk s`t�|jV |rr|V dS x | D ]}||�}|r||V q|W |ddd�}|r�|V dS )zqReturn a generator that first yields the :obj:`Encoding`,
then yields output chukns as Unicode strings.
N� T)�final)r �iterr �AssertionError)r$ r1 r �chunck�outputr r r r/ � s,
r/ c C s t ||�j}t| |�S )uY
“Pull”-based encoder.
:param input: An iterable of Unicode strings.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:returns: An iterable of byte strings.
)�IncrementalEncoderr �_iter_encode_generator)r$ r r& r r r r � iter_encode� s r< c c s: x | D ]}||�}|r|V qW |ddd�}|r6|V d S )N� T)r5 r )r$ r r8 r9 r r r r; s
r; c @ s$ e Zd ZdZd dd�Zd
dd�ZdS ) r. uO
“Push”-based decoder.
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
r" c C s& t |�| _|| _d| _d | _d | _d S )Nr4 )r �_fallback_encoding�_errors�_buffer�_decoderr )r r% r& r r r r s
zIncrementalDecoder.__init__Fc C s~ | j }|dk r|||�S | j| }t|�\}}|dkrXt|�dk rR| rR|| _dS | j}|jj| j�j}|| _ || _ |||�S )z�Decode one chunk of the input.
:param input: A byte string.
:param final:
Indicate that no more input is available.
Must be :obj:`True` if this is the last call.
:returns: An Unicode string.
Nr( r= )
rA r@ r# �lenr> r �incrementaldecoderr? r r )r r$ r5 r1 r r r r r ' s
zIncrementalDecoder.decodeN)r" )F)r r r r! r r r r r r r. s
r. c @ s e Zd ZdZedfdd�ZdS )r: u�
“Push”-based encoder.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
.. method:: encode(input, final=False)
:param input: An Unicode string.
:param final:
Indicate that no more input is available.
Must be :obj:`True` if this is the last call.
:returns: A byte string.
r- c C s t |�}|jj|�j| _d S )N)r r �incrementalencoderr )r r r& r r r r T s zIncrementalEncoder.__init__N)r r r r! r, r r r r r r: C s r: )r" )r" )r! Z
__future__r r Zlabelsr �VERSIONr r r
r r �objectr r, r* r+ r r# r r3 r/ r< r; r. r: r r r r �<module>
s2
3 pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.opt-1.pyc 0000644 00000005025 14751155150 0022225 0 ustar 00 3
���e� � @ s� d Z ddlmZ ddlZG dd� dej�ZG dd� dej�ZG dd � d ej�ZG d
d � d eej�ZG d d
� d
eej�Zej de� j
e� j eeeed�Z dZ
eje
�ZdS )z�
webencodings.x_user_defined
~~~~~~~~~~~~~~~~~~~~~~~~~~~
An implementation of the x-user-defined encoding.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� )�unicode_literalsNc @ s e Zd Zddd�Zddd�ZdS ) �Codec�strictc C s t j||t�S )N)�codecs�charmap_encode�encoding_table)�self�input�errors� r �$/usr/lib/python3.6/x_user_defined.py�encode s z Codec.encodec C s t j||t�S )N)r �charmap_decode�decoding_table)r r r
r r r �decode s z Codec.decodeN)r )r )�__name__�
__module__� __qualname__r
r r r r r r s
r c @ s e Zd Zddd�ZdS )�IncrementalEncoderFc C s t j|| jt�d S )Nr )r r r
r )r r �finalr r r r
s zIncrementalEncoder.encodeN)F)r r r r
r r r r r s r c @ s e Zd Zddd�ZdS )�IncrementalDecoderFc C s t j|| jt�d S )Nr )r r r
r )r r r r r r r $ s zIncrementalDecoder.decodeN)F)r r r r r r r r r # s r c @ s e Zd ZdS )� StreamWriterN)r r r r r r r r ( s r c @ s e Zd ZdS )� StreamReaderN)r r r r r r r r , s r zx-user-defined)�namer
r �incrementalencoder�incrementaldecoder� streamreader� streamwriteru
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~)�__doc__Z
__future__r r r r r r r � CodecInfor
r Z
codec_infor �
charmap_buildr r r r r �<module> s& pip/_vendor/webencodings/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000022510 14751155150 0020777 0 ustar 00 3
���eP) � @ s� d Z ddlmZ ddlZddlmZ dZddd d
d �Zi Zd d
� Z dd� Z
dd� Z G dd� de �Z
e
d�Ze
d�Ze
d�Zd+dd�Zdd� Zed fd d �Zd,d d �Zd!d"� Zed fd#d$�Zd%d&� ZG d'd(� d(e �ZG d)d*� d*e �ZdS )-a
webencodings
~~~~~~~~~~~~
This is a Python implementation of the `WHATWG Encoding standard
<http://encoding.spec.whatwg.org/>`. See README for details.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� )�unicode_literalsN� )�LABELSz0.5z
iso-8859-8z mac-cyrillicz mac-romanZcp874)z iso-8859-8-izx-mac-cyrillic� macintoshz windows-874c C s | j d�j� jd�S )a9 Transform (only) ASCII letters to lower case: A-Z is mapped to a-z.
:param string: An Unicode string.
:returns: A new Unicode string.
This is used for `ASCII case-insensitive
<http://encoding.spec.whatwg.org/#ascii-case-insensitive>`_
matching of encoding labels.
The same matching is also used, among other things,
for `CSS keywords <http://dev.w3.org/csswg/css-values/#keywords>`_.
This is different from the :meth:`~py:str.lower` method of Unicode strings
which also affect non-ASCII characters,
sometimes mapping them into the ASCII range:
>>> keyword = u'Bac\N{KELVIN SIGN}ground'
>>> assert keyword.lower() == u'background'
>>> assert ascii_lower(keyword) != keyword.lower()
>>> assert ascii_lower(keyword) == u'bac\N{KELVIN SIGN}ground'
�utf8)�encode�lower�decode)�string� r � /usr/lib/python3.6/__init__.py� ascii_lower# s r
c C sx t | jd��} tj| �}|dkr$dS tj|�}|dkrt|dkrLddlm} ntj||�}tj |�}t
||�}|t|< |S )u<
Look for an encoding by its label.
This is the spec’s `get an encoding
<http://encoding.spec.whatwg.org/#concept-encoding-get>`_ algorithm.
Supported labels are listed there.
:param label: A string.
:returns:
An :class:`Encoding` object, or :obj:`None` for an unknown label.
z
Nzx-user-definedr )�
codec_info) r
�stripr �get�CACHEZx_user_definedr � PYTHON_NAMES�codecs�lookup�Encoding)Zlabel�name�encodingr Z python_namer r r r = s
r c C s. t | d�r| S t| �}|dkr*td| ��|S )z�
Accept either an encoding object or label.
:param encoding: An :class:`Encoding` object or a label string.
:returns: An :class:`Encoding` object.
:raises: :exc:`~exceptions.LookupError` for an unknown label.
r NzUnknown encoding label: %r)�hasattrr � LookupError)Zencoding_or_labelr r r r �
_get_encoding[ s
r c @ s e Zd ZdZdd� Zdd� ZdS )r aO Reresents a character encoding such as UTF-8,
that can be used for decoding or encoding.
.. attribute:: name
Canonical name of the encoding
.. attribute:: codec_info
The actual implementation of the encoding,
a stdlib :class:`~codecs.CodecInfo` object.
See :func:`codecs.register`.
c C s || _ || _d S )N)r r )�selfr r r r r �__init__| s zEncoding.__init__c C s
d| j S )Nz
<Encoding %s>)r )r r r r �__repr__� s zEncoding.__repr__N)�__name__�
__module__� __qualname__�__doc__r r r r r r r m s r zutf-8zutf-16lezutf-16be�replacec C s2 t |�}t| �\}} |p|}|jj| |�d |fS )a�
Decode a single string.
:param input: A byte string
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:return:
A ``(output, encoding)`` tuple of an Unicode string
and an :obj:`Encoding`.
r )r � _detect_bomr r )�input�fallback_encoding�errorsZ bom_encodingr r r r r � s r c C sV | j d�rt| dd� fS | j d�r4t| dd� fS | j d�rNt| dd� fS d| fS )zBReturn (bom_encoding, input), with any BOM removed from the input.s ��� Ns ��s � )�
startswith�_UTF16LE�_UTF16BE�UTF8)r$ r r r r# � s
r# �strictc C s t |�jj| |�d S )a;
Encode a single string.
:param input: An Unicode string.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:return: A byte string.
r )r r r )r$ r r& r r r r � s r c C s$ t ||�}t| |�}t|�}||fS )a�
"Pull"-based decoder.
:param input:
An iterable of byte strings.
The input is first consumed just enough to determine the encoding
based on the precense of a BOM,
then consumed on demand when the return value is.
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:returns:
An ``(output, encoding)`` tuple.
:obj:`output` is an iterable of Unicode strings,
:obj:`encoding` is the :obj:`Encoding` that is being used.
)�IncrementalDecoder�_iter_decode_generator�next)r$ r% r& �decoder� generatorr r r r � iter_decode� s
r3 c c s� |j }t| �} xJ| D ] }||�}|r|jV |V P qW |ddd�}|jV |rV|V dS x | D ]}||�}|r`|V q`W |ddd�}|r�|V dS )zqReturn a generator that first yields the :obj:`Encoding`,
then yields output chukns as Unicode strings.
� T)�finalN)r �iterr )r$ r1 r �chunck�outputr r r r/ � s(
r/ c C s t ||�j}t| |�S )uY
“Pull”-based encoder.
:param input: An iterable of Unicode strings.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:returns: An iterable of byte strings.
)�IncrementalEncoderr �_iter_encode_generator)r$ r r& r r r r � iter_encode� s r; c c s: x | D ]}||�}|r|V qW |ddd�}|r6|V d S )N� T)r5 r )r$ r r7 r8 r r r r: s
r: c @ s$ e Zd ZdZd dd�Zd
dd�ZdS ) r. uO
“Push”-based decoder.
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
r" c C s& t |�| _|| _d| _d | _d | _d S )Nr4 )r �_fallback_encoding�_errors�_buffer�_decoderr )r r% r& r r r r s
zIncrementalDecoder.__init__Fc C s~ | j }|dk r|||�S | j| }t|�\}}|dkrXt|�dk rR| rR|| _dS | j}|jj| j�j}|| _ || _ |||�S )z�Decode one chunk of the input.
:param input: A byte string.
:param final:
Indicate that no more input is available.
Must be :obj:`True` if this is the last call.
:returns: An Unicode string.
Nr( r< )
r@ r? r# �lenr= r �incrementaldecoderr> r r )r r$ r5 r1 r r r r r ' s
zIncrementalDecoder.decodeN)r" )F)r r r r! r r r r r r r. s
r. c @ s e Zd ZdZedfdd�ZdS )r9 u�
“Push”-based encoder.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
.. method:: encode(input, final=False)
:param input: An Unicode string.
:param final:
Indicate that no more input is available.
Must be :obj:`True` if this is the last call.
:returns: A byte string.
r- c C s t |�}|jj|�j| _d S )N)r r �incrementalencoderr )r r r& r r r r T s zIncrementalEncoder.__init__N)r r r r! r, r r r r r r9 C s r9 )r" )r" )r! Z
__future__r r Zlabelsr �VERSIONr r r
r r �objectr r, r* r+ r r# r r3 r/ r; r: r. r9 r r r r �<module>
s2
3 pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.pyc 0000644 00000003444 14751155150 0020100 0 ustar 00 3
���e � @ sf d Z ddlZyddlmZ W n ek
r< ddlmZ Y nX dd� Zdd� Zedkrbe ed �� dS )
z�
webencodings.mklabels
~~~~~~~~~~~~~~~~~~~~~
Regenarate the webencodings.labels module.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� N)�urlopenc C s | | j � kst�| S )N)�lower�AssertionError)�string� r � /usr/lib/python3.6/mklabels.py� assert_lower s r c sf dg}dd� t jt| �j� jd��D �}tdd� |D ��� |j� fdd�|D �� |jd� d j|�S )
Na """
webencodings.labels
~~~~~~~~~~~~~~~~~~~
Map encoding labels to their name.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
# XXX Do not edit!
# This file is automatically generated by mklabels.py
LABELS = {
c S sL g | ]D}|d D ]6}|d D ](}t t|��jd�t |d �jd�f�q qqS )Z encodings�labels�u�name)�reprr �lstrip)�.0�category�encoding�labelr r r �
<listcomp>- s z generate.<locals>.<listcomp>�asciic s s | ]\}}t |�V qd S )N)�len)r r r r r r � <genexpr>2 s zgenerate.<locals>.<genexpr>c 3 s, | ]$\}}d |d� t |� |f V qdS )z %s:%s %s,
� N)r )r r r )�max_lenr r r 4 s �}� ) �json�loadsr �read�decode�max�extend�append�join)Zurl�partsr r )r r �generate s
r# �__main__z.http://encoding.spec.whatwg.org/encodings.json)
�__doc__r Zurllibr � ImportErrorZurllib.requestr r# �__name__�printr r r r �<module> s ! pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.pyc 0000644 00000005025 14751155150 0021266 0 ustar 00 3
���e� � @ s� d Z ddlmZ ddlZG dd� dej�ZG dd� dej�ZG dd � d ej�ZG d
d � d eej�ZG d d
� d
eej�Zej de� j
e� j eeeed�Z dZ
eje
�ZdS )z�
webencodings.x_user_defined
~~~~~~~~~~~~~~~~~~~~~~~~~~~
An implementation of the x-user-defined encoding.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
� )�unicode_literalsNc @ s e Zd Zddd�Zddd�ZdS ) �Codec�strictc C s t j||t�S )N)�codecs�charmap_encode�encoding_table)�self�input�errors� r �$/usr/lib/python3.6/x_user_defined.py�encode s z Codec.encodec C s t j||t�S )N)r �charmap_decode�decoding_table)r r r
r r r �decode s z Codec.decodeN)r )r )�__name__�
__module__� __qualname__r
r r r r r r s
r c @ s e Zd Zddd�ZdS )�IncrementalEncoderFc C s t j|| jt�d S )Nr )r r r
r )r r �finalr r r r
s zIncrementalEncoder.encodeN)F)r r r r
r r r r r s r c @ s e Zd Zddd�ZdS )�IncrementalDecoderFc C s t j|| jt�d S )Nr )r r r
r )r r r r r r r $ s zIncrementalDecoder.decodeN)F)r r r r r r r r r # s r c @ s e Zd ZdS )� StreamWriterN)r r r r r r r r ( s r c @ s e Zd ZdS )� StreamReaderN)r r r r r r r r , s r zx-user-defined)�namer
r �incrementalencoder�incrementaldecoder� streamreader� streamwriteru
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~)�__doc__Z
__future__r r r r r r r � CodecInfor
r Z
codec_infor �
charmap_buildr r r r r �<module> s& pip/_vendor/webencodings/labels.py 0000644 00000021423 14751155150 0013261 0 ustar 00 """
webencodings.labels
~~~~~~~~~~~~~~~~~~~
Map encoding labels to their name.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
# XXX Do not edit!
# This file is automatically generated by mklabels.py
LABELS = {
'unicode-1-1-utf-8': 'utf-8',
'utf-8': 'utf-8',
'utf8': 'utf-8',
'866': 'ibm866',
'cp866': 'ibm866',
'csibm866': 'ibm866',
'ibm866': 'ibm866',
'csisolatin2': 'iso-8859-2',
'iso-8859-2': 'iso-8859-2',
'iso-ir-101': 'iso-8859-2',
'iso8859-2': 'iso-8859-2',
'iso88592': 'iso-8859-2',
'iso_8859-2': 'iso-8859-2',
'iso_8859-2:1987': 'iso-8859-2',
'l2': 'iso-8859-2',
'latin2': 'iso-8859-2',
'csisolatin3': 'iso-8859-3',
'iso-8859-3': 'iso-8859-3',
'iso-ir-109': 'iso-8859-3',
'iso8859-3': 'iso-8859-3',
'iso88593': 'iso-8859-3',
'iso_8859-3': 'iso-8859-3',
'iso_8859-3:1988': 'iso-8859-3',
'l3': 'iso-8859-3',
'latin3': 'iso-8859-3',
'csisolatin4': 'iso-8859-4',
'iso-8859-4': 'iso-8859-4',
'iso-ir-110': 'iso-8859-4',
'iso8859-4': 'iso-8859-4',
'iso88594': 'iso-8859-4',
'iso_8859-4': 'iso-8859-4',
'iso_8859-4:1988': 'iso-8859-4',
'l4': 'iso-8859-4',
'latin4': 'iso-8859-4',
'csisolatincyrillic': 'iso-8859-5',
'cyrillic': 'iso-8859-5',
'iso-8859-5': 'iso-8859-5',
'iso-ir-144': 'iso-8859-5',
'iso8859-5': 'iso-8859-5',
'iso88595': 'iso-8859-5',
'iso_8859-5': 'iso-8859-5',
'iso_8859-5:1988': 'iso-8859-5',
'arabic': 'iso-8859-6',
'asmo-708': 'iso-8859-6',
'csiso88596e': 'iso-8859-6',
'csiso88596i': 'iso-8859-6',
'csisolatinarabic': 'iso-8859-6',
'ecma-114': 'iso-8859-6',
'iso-8859-6': 'iso-8859-6',
'iso-8859-6-e': 'iso-8859-6',
'iso-8859-6-i': 'iso-8859-6',
'iso-ir-127': 'iso-8859-6',
'iso8859-6': 'iso-8859-6',
'iso88596': 'iso-8859-6',
'iso_8859-6': 'iso-8859-6',
'iso_8859-6:1987': 'iso-8859-6',
'csisolatingreek': 'iso-8859-7',
'ecma-118': 'iso-8859-7',
'elot_928': 'iso-8859-7',
'greek': 'iso-8859-7',
'greek8': 'iso-8859-7',
'iso-8859-7': 'iso-8859-7',
'iso-ir-126': 'iso-8859-7',
'iso8859-7': 'iso-8859-7',
'iso88597': 'iso-8859-7',
'iso_8859-7': 'iso-8859-7',
'iso_8859-7:1987': 'iso-8859-7',
'sun_eu_greek': 'iso-8859-7',
'csiso88598e': 'iso-8859-8',
'csisolatinhebrew': 'iso-8859-8',
'hebrew': 'iso-8859-8',
'iso-8859-8': 'iso-8859-8',
'iso-8859-8-e': 'iso-8859-8',
'iso-ir-138': 'iso-8859-8',
'iso8859-8': 'iso-8859-8',
'iso88598': 'iso-8859-8',
'iso_8859-8': 'iso-8859-8',
'iso_8859-8:1988': 'iso-8859-8',
'visual': 'iso-8859-8',
'csiso88598i': 'iso-8859-8-i',
'iso-8859-8-i': 'iso-8859-8-i',
'logical': 'iso-8859-8-i',
'csisolatin6': 'iso-8859-10',
'iso-8859-10': 'iso-8859-10',
'iso-ir-157': 'iso-8859-10',
'iso8859-10': 'iso-8859-10',
'iso885910': 'iso-8859-10',
'l6': 'iso-8859-10',
'latin6': 'iso-8859-10',
'iso-8859-13': 'iso-8859-13',
'iso8859-13': 'iso-8859-13',
'iso885913': 'iso-8859-13',
'iso-8859-14': 'iso-8859-14',
'iso8859-14': 'iso-8859-14',
'iso885914': 'iso-8859-14',
'csisolatin9': 'iso-8859-15',
'iso-8859-15': 'iso-8859-15',
'iso8859-15': 'iso-8859-15',
'iso885915': 'iso-8859-15',
'iso_8859-15': 'iso-8859-15',
'l9': 'iso-8859-15',
'iso-8859-16': 'iso-8859-16',
'cskoi8r': 'koi8-r',
'koi': 'koi8-r',
'koi8': 'koi8-r',
'koi8-r': 'koi8-r',
'koi8_r': 'koi8-r',
'koi8-u': 'koi8-u',
'csmacintosh': 'macintosh',
'mac': 'macintosh',
'macintosh': 'macintosh',
'x-mac-roman': 'macintosh',
'dos-874': 'windows-874',
'iso-8859-11': 'windows-874',
'iso8859-11': 'windows-874',
'iso885911': 'windows-874',
'tis-620': 'windows-874',
'windows-874': 'windows-874',
'cp1250': 'windows-1250',
'windows-1250': 'windows-1250',
'x-cp1250': 'windows-1250',
'cp1251': 'windows-1251',
'windows-1251': 'windows-1251',
'x-cp1251': 'windows-1251',
'ansi_x3.4-1968': 'windows-1252',
'ascii': 'windows-1252',
'cp1252': 'windows-1252',
'cp819': 'windows-1252',
'csisolatin1': 'windows-1252',
'ibm819': 'windows-1252',
'iso-8859-1': 'windows-1252',
'iso-ir-100': 'windows-1252',
'iso8859-1': 'windows-1252',
'iso88591': 'windows-1252',
'iso_8859-1': 'windows-1252',
'iso_8859-1:1987': 'windows-1252',
'l1': 'windows-1252',
'latin1': 'windows-1252',
'us-ascii': 'windows-1252',
'windows-1252': 'windows-1252',
'x-cp1252': 'windows-1252',
'cp1253': 'windows-1253',
'windows-1253': 'windows-1253',
'x-cp1253': 'windows-1253',
'cp1254': 'windows-1254',
'csisolatin5': 'windows-1254',
'iso-8859-9': 'windows-1254',
'iso-ir-148': 'windows-1254',
'iso8859-9': 'windows-1254',
'iso88599': 'windows-1254',
'iso_8859-9': 'windows-1254',
'iso_8859-9:1989': 'windows-1254',
'l5': 'windows-1254',
'latin5': 'windows-1254',
'windows-1254': 'windows-1254',
'x-cp1254': 'windows-1254',
'cp1255': 'windows-1255',
'windows-1255': 'windows-1255',
'x-cp1255': 'windows-1255',
'cp1256': 'windows-1256',
'windows-1256': 'windows-1256',
'x-cp1256': 'windows-1256',
'cp1257': 'windows-1257',
'windows-1257': 'windows-1257',
'x-cp1257': 'windows-1257',
'cp1258': 'windows-1258',
'windows-1258': 'windows-1258',
'x-cp1258': 'windows-1258',
'x-mac-cyrillic': 'x-mac-cyrillic',
'x-mac-ukrainian': 'x-mac-cyrillic',
'chinese': 'gbk',
'csgb2312': 'gbk',
'csiso58gb231280': 'gbk',
'gb2312': 'gbk',
'gb_2312': 'gbk',
'gb_2312-80': 'gbk',
'gbk': 'gbk',
'iso-ir-58': 'gbk',
'x-gbk': 'gbk',
'gb18030': 'gb18030',
'hz-gb-2312': 'hz-gb-2312',
'big5': 'big5',
'big5-hkscs': 'big5',
'cn-big5': 'big5',
'csbig5': 'big5',
'x-x-big5': 'big5',
'cseucpkdfmtjapanese': 'euc-jp',
'euc-jp': 'euc-jp',
'x-euc-jp': 'euc-jp',
'csiso2022jp': 'iso-2022-jp',
'iso-2022-jp': 'iso-2022-jp',
'csshiftjis': 'shift_jis',
'ms_kanji': 'shift_jis',
'shift-jis': 'shift_jis',
'shift_jis': 'shift_jis',
'sjis': 'shift_jis',
'windows-31j': 'shift_jis',
'x-sjis': 'shift_jis',
'cseuckr': 'euc-kr',
'csksc56011987': 'euc-kr',
'euc-kr': 'euc-kr',
'iso-ir-149': 'euc-kr',
'korean': 'euc-kr',
'ks_c_5601-1987': 'euc-kr',
'ks_c_5601-1989': 'euc-kr',
'ksc5601': 'euc-kr',
'ksc_5601': 'euc-kr',
'windows-949': 'euc-kr',
'csiso2022kr': 'iso-2022-kr',
'iso-2022-kr': 'iso-2022-kr',
'utf-16be': 'utf-16be',
'utf-16': 'utf-16le',
'utf-16le': 'utf-16le',
'x-user-defined': 'x-user-defined',
}
pip/_vendor/webencodings/mklabels.py 0000644 00000002431 14751155150 0013607 0 ustar 00 """
webencodings.mklabels
~~~~~~~~~~~~~~~~~~~~~
Regenarate the webencodings.labels module.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
import json
try:
from urllib import urlopen
except ImportError:
from urllib.request import urlopen
def assert_lower(string):
assert string == string.lower()
return string
def generate(url):
parts = ['''\
"""
webencodings.labels
~~~~~~~~~~~~~~~~~~~
Map encoding labels to their name.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
# XXX Do not edit!
# This file is automatically generated by mklabels.py
LABELS = {
''']
labels = [
(repr(assert_lower(label)).lstrip('u'),
repr(encoding['name']).lstrip('u'))
for category in json.loads(urlopen(url).read().decode('ascii'))
for encoding in category['encodings']
for label in encoding['labels']]
max_len = max(len(label) for label, name in labels)
parts.extend(
' %s:%s %s,\n' % (label, ' ' * (max_len - len(label)), name)
for label, name in labels)
parts.append('}')
return ''.join(parts)
if __name__ == '__main__':
print(generate('http://encoding.spec.whatwg.org/encodings.json'))
pip/_vendor/webencodings/x_user_defined.py 0000644 00000010322 14751155150 0014776 0 ustar 00 # coding: utf8
"""
webencodings.x_user_defined
~~~~~~~~~~~~~~~~~~~~~~~~~~~
An implementation of the x-user-defined encoding.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
from __future__ import unicode_literals
import codecs
### Codec APIs
class Codec(codecs.Codec):
def encode(self, input, errors='strict'):
return codecs.charmap_encode(input, errors, encoding_table)
def decode(self, input, errors='strict'):
return codecs.charmap_decode(input, errors, decoding_table)
class IncrementalEncoder(codecs.IncrementalEncoder):
def encode(self, input, final=False):
return codecs.charmap_encode(input, self.errors, encoding_table)[0]
class IncrementalDecoder(codecs.IncrementalDecoder):
def decode(self, input, final=False):
return codecs.charmap_decode(input, self.errors, decoding_table)[0]
class StreamWriter(Codec, codecs.StreamWriter):
pass
class StreamReader(Codec, codecs.StreamReader):
pass
### encodings module API
codec_info = codecs.CodecInfo(
name='x-user-defined',
encode=Codec().encode,
decode=Codec().decode,
incrementalencoder=IncrementalEncoder,
incrementaldecoder=IncrementalDecoder,
streamreader=StreamReader,
streamwriter=StreamWriter,
)
### Decoding Table
# Python 3:
# for c in range(256): print(' %r' % chr(c if c < 128 else c + 0xF700))
decoding_table = (
'\x00'
'\x01'
'\x02'
'\x03'
'\x04'
'\x05'
'\x06'
'\x07'
'\x08'
'\t'
'\n'
'\x0b'
'\x0c'
'\r'
'\x0e'
'\x0f'
'\x10'
'\x11'
'\x12'
'\x13'
'\x14'
'\x15'
'\x16'
'\x17'
'\x18'
'\x19'
'\x1a'
'\x1b'
'\x1c'
'\x1d'
'\x1e'
'\x1f'
' '
'!'
'"'
'#'
'$'
'%'
'&'
"'"
'('
')'
'*'
'+'
','
'-'
'.'
'/'
'0'
'1'
'2'
'3'
'4'
'5'
'6'
'7'
'8'
'9'
':'
';'
'<'
'='
'>'
'?'
'@'
'A'
'B'
'C'
'D'
'E'
'F'
'G'
'H'
'I'
'J'
'K'
'L'
'M'
'N'
'O'
'P'
'Q'
'R'
'S'
'T'
'U'
'V'
'W'
'X'
'Y'
'Z'
'['
'\\'
']'
'^'
'_'
'`'
'a'
'b'
'c'
'd'
'e'
'f'
'g'
'h'
'i'
'j'
'k'
'l'
'm'
'n'
'o'
'p'
'q'
'r'
's'
't'
'u'
'v'
'w'
'x'
'y'
'z'
'{'
'|'
'}'
'~'
'\x7f'
'\uf780'
'\uf781'
'\uf782'
'\uf783'
'\uf784'
'\uf785'
'\uf786'
'\uf787'
'\uf788'
'\uf789'
'\uf78a'
'\uf78b'
'\uf78c'
'\uf78d'
'\uf78e'
'\uf78f'
'\uf790'
'\uf791'
'\uf792'
'\uf793'
'\uf794'
'\uf795'
'\uf796'
'\uf797'
'\uf798'
'\uf799'
'\uf79a'
'\uf79b'
'\uf79c'
'\uf79d'
'\uf79e'
'\uf79f'
'\uf7a0'
'\uf7a1'
'\uf7a2'
'\uf7a3'
'\uf7a4'
'\uf7a5'
'\uf7a6'
'\uf7a7'
'\uf7a8'
'\uf7a9'
'\uf7aa'
'\uf7ab'
'\uf7ac'
'\uf7ad'
'\uf7ae'
'\uf7af'
'\uf7b0'
'\uf7b1'
'\uf7b2'
'\uf7b3'
'\uf7b4'
'\uf7b5'
'\uf7b6'
'\uf7b7'
'\uf7b8'
'\uf7b9'
'\uf7ba'
'\uf7bb'
'\uf7bc'
'\uf7bd'
'\uf7be'
'\uf7bf'
'\uf7c0'
'\uf7c1'
'\uf7c2'
'\uf7c3'
'\uf7c4'
'\uf7c5'
'\uf7c6'
'\uf7c7'
'\uf7c8'
'\uf7c9'
'\uf7ca'
'\uf7cb'
'\uf7cc'
'\uf7cd'
'\uf7ce'
'\uf7cf'
'\uf7d0'
'\uf7d1'
'\uf7d2'
'\uf7d3'
'\uf7d4'
'\uf7d5'
'\uf7d6'
'\uf7d7'
'\uf7d8'
'\uf7d9'
'\uf7da'
'\uf7db'
'\uf7dc'
'\uf7dd'
'\uf7de'
'\uf7df'
'\uf7e0'
'\uf7e1'
'\uf7e2'
'\uf7e3'
'\uf7e4'
'\uf7e5'
'\uf7e6'
'\uf7e7'
'\uf7e8'
'\uf7e9'
'\uf7ea'
'\uf7eb'
'\uf7ec'
'\uf7ed'
'\uf7ee'
'\uf7ef'
'\uf7f0'
'\uf7f1'
'\uf7f2'
'\uf7f3'
'\uf7f4'
'\uf7f5'
'\uf7f6'
'\uf7f7'
'\uf7f8'
'\uf7f9'
'\uf7fa'
'\uf7fb'
'\uf7fc'
'\uf7fd'
'\uf7fe'
'\uf7ff'
)
### Encoding table
encoding_table = codecs.charmap_build(decoding_table)
pip/_vendor/webencodings/__init__.py 0000644 00000024520 14751155150 0013557 0 ustar 00 # coding: utf8
"""
webencodings
~~~~~~~~~~~~
This is a Python implementation of the `WHATWG Encoding standard
<http://encoding.spec.whatwg.org/>`. See README for details.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
from __future__ import unicode_literals
import codecs
from .labels import LABELS
VERSION = '0.5'
# Some names in Encoding are not valid Python aliases. Remap these.
PYTHON_NAMES = {
'iso-8859-8-i': 'iso-8859-8',
'x-mac-cyrillic': 'mac-cyrillic',
'macintosh': 'mac-roman',
'windows-874': 'cp874'}
CACHE = {}
def ascii_lower(string):
r"""Transform (only) ASCII letters to lower case: A-Z is mapped to a-z.
:param string: An Unicode string.
:returns: A new Unicode string.
This is used for `ASCII case-insensitive
<http://encoding.spec.whatwg.org/#ascii-case-insensitive>`_
matching of encoding labels.
The same matching is also used, among other things,
for `CSS keywords <http://dev.w3.org/csswg/css-values/#keywords>`_.
This is different from the :meth:`~py:str.lower` method of Unicode strings
which also affect non-ASCII characters,
sometimes mapping them into the ASCII range:
>>> keyword = u'Bac\N{KELVIN SIGN}ground'
>>> assert keyword.lower() == u'background'
>>> assert ascii_lower(keyword) != keyword.lower()
>>> assert ascii_lower(keyword) == u'bac\N{KELVIN SIGN}ground'
"""
# This turns out to be faster than unicode.translate()
return string.encode('utf8').lower().decode('utf8')
def lookup(label):
"""
Look for an encoding by its label.
This is the spec’s `get an encoding
<http://encoding.spec.whatwg.org/#concept-encoding-get>`_ algorithm.
Supported labels are listed there.
:param label: A string.
:returns:
An :class:`Encoding` object, or :obj:`None` for an unknown label.
"""
# Only strip ASCII whitespace: U+0009, U+000A, U+000C, U+000D, and U+0020.
label = ascii_lower(label.strip('\t\n\f\r '))
name = LABELS.get(label)
if name is None:
return None
encoding = CACHE.get(name)
if encoding is None:
if name == 'x-user-defined':
from .x_user_defined import codec_info
else:
python_name = PYTHON_NAMES.get(name, name)
# Any python_name value that gets to here should be valid.
codec_info = codecs.lookup(python_name)
encoding = Encoding(name, codec_info)
CACHE[name] = encoding
return encoding
def _get_encoding(encoding_or_label):
"""
Accept either an encoding object or label.
:param encoding: An :class:`Encoding` object or a label string.
:returns: An :class:`Encoding` object.
:raises: :exc:`~exceptions.LookupError` for an unknown label.
"""
if hasattr(encoding_or_label, 'codec_info'):
return encoding_or_label
encoding = lookup(encoding_or_label)
if encoding is None:
raise LookupError('Unknown encoding label: %r' % encoding_or_label)
return encoding
class Encoding(object):
"""Reresents a character encoding such as UTF-8,
that can be used for decoding or encoding.
.. attribute:: name
Canonical name of the encoding
.. attribute:: codec_info
The actual implementation of the encoding,
a stdlib :class:`~codecs.CodecInfo` object.
See :func:`codecs.register`.
"""
def __init__(self, name, codec_info):
self.name = name
self.codec_info = codec_info
def __repr__(self):
return '<Encoding %s>' % self.name
#: The UTF-8 encoding. Should be used for new content and formats.
UTF8 = lookup('utf-8')
_UTF16LE = lookup('utf-16le')
_UTF16BE = lookup('utf-16be')
def decode(input, fallback_encoding, errors='replace'):
"""
Decode a single string.
:param input: A byte string
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:return:
A ``(output, encoding)`` tuple of an Unicode string
and an :obj:`Encoding`.
"""
# Fail early if `encoding` is an invalid label.
fallback_encoding = _get_encoding(fallback_encoding)
bom_encoding, input = _detect_bom(input)
encoding = bom_encoding or fallback_encoding
return encoding.codec_info.decode(input, errors)[0], encoding
def _detect_bom(input):
"""Return (bom_encoding, input), with any BOM removed from the input."""
if input.startswith(b'\xFF\xFE'):
return _UTF16LE, input[2:]
if input.startswith(b'\xFE\xFF'):
return _UTF16BE, input[2:]
if input.startswith(b'\xEF\xBB\xBF'):
return UTF8, input[3:]
return None, input
def encode(input, encoding=UTF8, errors='strict'):
"""
Encode a single string.
:param input: An Unicode string.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:return: A byte string.
"""
return _get_encoding(encoding).codec_info.encode(input, errors)[0]
def iter_decode(input, fallback_encoding, errors='replace'):
"""
"Pull"-based decoder.
:param input:
An iterable of byte strings.
The input is first consumed just enough to determine the encoding
based on the precense of a BOM,
then consumed on demand when the return value is.
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:returns:
An ``(output, encoding)`` tuple.
:obj:`output` is an iterable of Unicode strings,
:obj:`encoding` is the :obj:`Encoding` that is being used.
"""
decoder = IncrementalDecoder(fallback_encoding, errors)
generator = _iter_decode_generator(input, decoder)
encoding = next(generator)
return generator, encoding
def _iter_decode_generator(input, decoder):
"""Return a generator that first yields the :obj:`Encoding`,
then yields output chukns as Unicode strings.
"""
decode = decoder.decode
input = iter(input)
for chunck in input:
output = decode(chunck)
if output:
assert decoder.encoding is not None
yield decoder.encoding
yield output
break
else:
# Input exhausted without determining the encoding
output = decode(b'', final=True)
assert decoder.encoding is not None
yield decoder.encoding
if output:
yield output
return
for chunck in input:
output = decode(chunck)
if output:
yield output
output = decode(b'', final=True)
if output:
yield output
def iter_encode(input, encoding=UTF8, errors='strict'):
"""
“Pull”-based encoder.
:param input: An iterable of Unicode strings.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
:returns: An iterable of byte strings.
"""
# Fail early if `encoding` is an invalid label.
encode = IncrementalEncoder(encoding, errors).encode
return _iter_encode_generator(input, encode)
def _iter_encode_generator(input, encode):
for chunck in input:
output = encode(chunck)
if output:
yield output
output = encode('', final=True)
if output:
yield output
class IncrementalDecoder(object):
"""
“Push”-based decoder.
:param fallback_encoding:
An :class:`Encoding` object or a label string.
The encoding to use if :obj:`input` does note have a BOM.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
"""
def __init__(self, fallback_encoding, errors='replace'):
# Fail early if `encoding` is an invalid label.
self._fallback_encoding = _get_encoding(fallback_encoding)
self._errors = errors
self._buffer = b''
self._decoder = None
#: The actual :class:`Encoding` that is being used,
#: or :obj:`None` if that is not determined yet.
#: (Ie. if there is not enough input yet to determine
#: if there is a BOM.)
self.encoding = None # Not known yet.
def decode(self, input, final=False):
"""Decode one chunk of the input.
:param input: A byte string.
:param final:
Indicate that no more input is available.
Must be :obj:`True` if this is the last call.
:returns: An Unicode string.
"""
decoder = self._decoder
if decoder is not None:
return decoder(input, final)
input = self._buffer + input
encoding, input = _detect_bom(input)
if encoding is None:
if len(input) < 3 and not final: # Not enough data yet.
self._buffer = input
return ''
else: # No BOM
encoding = self._fallback_encoding
decoder = encoding.codec_info.incrementaldecoder(self._errors).decode
self._decoder = decoder
self.encoding = encoding
return decoder(input, final)
class IncrementalEncoder(object):
"""
“Push”-based encoder.
:param encoding: An :class:`Encoding` object or a label string.
:param errors: Type of error handling. See :func:`codecs.register`.
:raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
.. method:: encode(input, final=False)
:param input: An Unicode string.
:param final:
Indicate that no more input is available.
Must be :obj:`True` if this is the last call.
:returns: A byte string.
"""
def __init__(self, encoding=UTF8, errors='strict'):
encoding = _get_encoding(encoding)
self.encode = encoding.codec_info.incrementalencoder(errors).encode
pip/_vendor/webencodings/tests.py 0000644 00000014642 14751155150 0013166 0 ustar 00 # coding: utf8
"""
webencodings.tests
~~~~~~~~~~~~~~~~~~
A basic test suite for Encoding.
:copyright: Copyright 2012 by Simon Sapin
:license: BSD, see LICENSE for details.
"""
from __future__ import unicode_literals
from . import (lookup, LABELS, decode, encode, iter_decode, iter_encode,
IncrementalDecoder, IncrementalEncoder, UTF8)
def assert_raises(exception, function, *args, **kwargs):
try:
function(*args, **kwargs)
except exception:
return
else: # pragma: no cover
raise AssertionError('Did not raise %s.' % exception)
def test_labels():
assert lookup('utf-8').name == 'utf-8'
assert lookup('Utf-8').name == 'utf-8'
assert lookup('UTF-8').name == 'utf-8'
assert lookup('utf8').name == 'utf-8'
assert lookup('utf8').name == 'utf-8'
assert lookup('utf8 ').name == 'utf-8'
assert lookup(' \r\nutf8\t').name == 'utf-8'
assert lookup('u8') is None # Python label.
assert lookup('utf-8 ') is None # Non-ASCII white space.
assert lookup('US-ASCII').name == 'windows-1252'
assert lookup('iso-8859-1').name == 'windows-1252'
assert lookup('latin1').name == 'windows-1252'
assert lookup('LATIN1').name == 'windows-1252'
assert lookup('latin-1') is None
assert lookup('LATİN1') is None # ASCII-only case insensitivity.
def test_all_labels():
for label in LABELS:
assert decode(b'', label) == ('', lookup(label))
assert encode('', label) == b''
for repeat in [0, 1, 12]:
output, _ = iter_decode([b''] * repeat, label)
assert list(output) == []
assert list(iter_encode([''] * repeat, label)) == []
decoder = IncrementalDecoder(label)
assert decoder.decode(b'') == ''
assert decoder.decode(b'', final=True) == ''
encoder = IncrementalEncoder(label)
assert encoder.encode('') == b''
assert encoder.encode('', final=True) == b''
# All encoding names are valid labels too:
for name in set(LABELS.values()):
assert lookup(name).name == name
def test_invalid_label():
assert_raises(LookupError, decode, b'\xEF\xBB\xBF\xc3\xa9', 'invalid')
assert_raises(LookupError, encode, 'é', 'invalid')
assert_raises(LookupError, iter_decode, [], 'invalid')
assert_raises(LookupError, iter_encode, [], 'invalid')
assert_raises(LookupError, IncrementalDecoder, 'invalid')
assert_raises(LookupError, IncrementalEncoder, 'invalid')
def test_decode():
assert decode(b'\x80', 'latin1') == ('€', lookup('latin1'))
assert decode(b'\x80', lookup('latin1')) == ('€', lookup('latin1'))
assert decode(b'\xc3\xa9', 'utf8') == ('é', lookup('utf8'))
assert decode(b'\xc3\xa9', UTF8) == ('é', lookup('utf8'))
assert decode(b'\xc3\xa9', 'ascii') == ('é', lookup('ascii'))
assert decode(b'\xEF\xBB\xBF\xc3\xa9', 'ascii') == ('é', lookup('utf8')) # UTF-8 with BOM
assert decode(b'\xFE\xFF\x00\xe9', 'ascii') == ('é', lookup('utf-16be')) # UTF-16-BE with BOM
assert decode(b'\xFF\xFE\xe9\x00', 'ascii') == ('é', lookup('utf-16le')) # UTF-16-LE with BOM
assert decode(b'\xFE\xFF\xe9\x00', 'ascii') == ('\ue900', lookup('utf-16be'))
assert decode(b'\xFF\xFE\x00\xe9', 'ascii') == ('\ue900', lookup('utf-16le'))
assert decode(b'\x00\xe9', 'UTF-16BE') == ('é', lookup('utf-16be'))
assert decode(b'\xe9\x00', 'UTF-16LE') == ('é', lookup('utf-16le'))
assert decode(b'\xe9\x00', 'UTF-16') == ('é', lookup('utf-16le'))
assert decode(b'\xe9\x00', 'UTF-16BE') == ('\ue900', lookup('utf-16be'))
assert decode(b'\x00\xe9', 'UTF-16LE') == ('\ue900', lookup('utf-16le'))
assert decode(b'\x00\xe9', 'UTF-16') == ('\ue900', lookup('utf-16le'))
def test_encode():
assert encode('é', 'latin1') == b'\xe9'
assert encode('é', 'utf8') == b'\xc3\xa9'
assert encode('é', 'utf8') == b'\xc3\xa9'
assert encode('é', 'utf-16') == b'\xe9\x00'
assert encode('é', 'utf-16le') == b'\xe9\x00'
assert encode('é', 'utf-16be') == b'\x00\xe9'
def test_iter_decode():
def iter_decode_to_string(input, fallback_encoding):
output, _encoding = iter_decode(input, fallback_encoding)
return ''.join(output)
assert iter_decode_to_string([], 'latin1') == ''
assert iter_decode_to_string([b''], 'latin1') == ''
assert iter_decode_to_string([b'\xe9'], 'latin1') == 'é'
assert iter_decode_to_string([b'hello'], 'latin1') == 'hello'
assert iter_decode_to_string([b'he', b'llo'], 'latin1') == 'hello'
assert iter_decode_to_string([b'hell', b'o'], 'latin1') == 'hello'
assert iter_decode_to_string([b'\xc3\xa9'], 'latin1') == 'é'
assert iter_decode_to_string([b'\xEF\xBB\xBF\xc3\xa9'], 'latin1') == 'é'
assert iter_decode_to_string([
b'\xEF\xBB\xBF', b'\xc3', b'\xa9'], 'latin1') == 'é'
assert iter_decode_to_string([
b'\xEF\xBB\xBF', b'a', b'\xc3'], 'latin1') == 'a\uFFFD'
assert iter_decode_to_string([
b'', b'\xEF', b'', b'', b'\xBB\xBF\xc3', b'\xa9'], 'latin1') == 'é'
assert iter_decode_to_string([b'\xEF\xBB\xBF'], 'latin1') == ''
assert iter_decode_to_string([b'\xEF\xBB'], 'latin1') == 'ï»'
assert iter_decode_to_string([b'\xFE\xFF\x00\xe9'], 'latin1') == 'é'
assert iter_decode_to_string([b'\xFF\xFE\xe9\x00'], 'latin1') == 'é'
assert iter_decode_to_string([
b'', b'\xFF', b'', b'', b'\xFE\xe9', b'\x00'], 'latin1') == 'é'
assert iter_decode_to_string([
b'', b'h\xe9', b'llo'], 'x-user-defined') == 'h\uF7E9llo'
def test_iter_encode():
assert b''.join(iter_encode([], 'latin1')) == b''
assert b''.join(iter_encode([''], 'latin1')) == b''
assert b''.join(iter_encode(['é'], 'latin1')) == b'\xe9'
assert b''.join(iter_encode(['', 'é', '', ''], 'latin1')) == b'\xe9'
assert b''.join(iter_encode(['', 'é', '', ''], 'utf-16')) == b'\xe9\x00'
assert b''.join(iter_encode(['', 'é', '', ''], 'utf-16le')) == b'\xe9\x00'
assert b''.join(iter_encode(['', 'é', '', ''], 'utf-16be')) == b'\x00\xe9'
assert b''.join(iter_encode([
'', 'h\uF7E9', '', 'llo'], 'x-user-defined')) == b'h\xe9llo'
def test_x_user_defined():
encoded = b'2,\x0c\x0b\x1aO\xd9#\xcb\x0f\xc9\xbbt\xcf\xa8\xca'
decoded = '2,\x0c\x0b\x1aO\uf7d9#\uf7cb\x0f\uf7c9\uf7bbt\uf7cf\uf7a8\uf7ca'
encoded = b'aa'
decoded = 'aa'
assert decode(encoded, 'x-user-defined') == (decoded, lookup('x-user-defined'))
assert encode(decoded, 'x-user-defined') == encoded
pip/_vendor/distlib/scripts.py 0000644 00000035570 14751155150 0012501 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2013-2015 Vinay Sajip.
# Licensed to the Python Software Foundation under a contributor agreement.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
from io import BytesIO
import logging
import os
import re
import struct
import sys
from .compat import sysconfig, detect_encoding, ZipFile
from .resources import finder
from .util import (FileOperator, get_export_entry, convert_path,
get_executable, in_venv)
logger = logging.getLogger(__name__)
_DEFAULT_MANIFEST = '''
<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
<assemblyIdentity version="1.0.0.0"
processorArchitecture="X86"
name="%s"
type="win32"/>
<!-- Identify the application security requirements. -->
<trustInfo xmlns="urn:schemas-microsoft-com:asm.v3">
<security>
<requestedPrivileges>
<requestedExecutionLevel level="asInvoker" uiAccess="false"/>
</requestedPrivileges>
</security>
</trustInfo>
</assembly>'''.strip()
# check if Python is called on the first line with this expression
FIRST_LINE_RE = re.compile(b'^#!.*pythonw?[0-9.]*([ \t].*)?$')
SCRIPT_TEMPLATE = '''# -*- coding: utf-8 -*-
if __name__ == '__main__':
import sys, re
def _resolve(module, func):
__import__(module)
mod = sys.modules[module]
parts = func.split('.')
result = getattr(mod, parts.pop(0))
for p in parts:
result = getattr(result, p)
return result
try:
sys.argv[0] = re.sub(r'(-script\.pyw?|\.exe)?$', '', sys.argv[0])
func = _resolve('%(module)s', '%(func)s')
rc = func() # None interpreted as 0
except Exception as e: # only supporting Python >= 2.6
sys.stderr.write('%%s\\n' %% e)
rc = 1
sys.exit(rc)
'''
def _enquote_executable(executable):
if ' ' in executable:
# make sure we quote only the executable in case of env
# for example /usr/bin/env "/dir with spaces/bin/jython"
# instead of "/usr/bin/env /dir with spaces/bin/jython"
# otherwise whole
if executable.startswith('/usr/bin/env '):
env, _executable = executable.split(' ', 1)
if ' ' in _executable and not _executable.startswith('"'):
executable = '%s "%s"' % (env, _executable)
else:
if not executable.startswith('"'):
executable = '"%s"' % executable
return executable
class ScriptMaker(object):
"""
A class to copy or create scripts from source scripts or callable
specifications.
"""
script_template = SCRIPT_TEMPLATE
executable = None # for shebangs
def __init__(self, source_dir, target_dir, add_launchers=True,
dry_run=False, fileop=None):
self.source_dir = source_dir
self.target_dir = target_dir
self.add_launchers = add_launchers
self.force = False
self.clobber = False
# It only makes sense to set mode bits on POSIX.
self.set_mode = (os.name == 'posix') or (os.name == 'java' and
os._name == 'posix')
self.variants = set(('', 'X.Y'))
self._fileop = fileop or FileOperator(dry_run)
self._is_nt = os.name == 'nt' or (
os.name == 'java' and os._name == 'nt')
def _get_alternate_executable(self, executable, options):
if options.get('gui', False) and self._is_nt: # pragma: no cover
dn, fn = os.path.split(executable)
fn = fn.replace('python', 'pythonw')
executable = os.path.join(dn, fn)
return executable
if sys.platform.startswith('java'): # pragma: no cover
def _is_shell(self, executable):
"""
Determine if the specified executable is a script
(contains a #! line)
"""
try:
with open(executable) as fp:
return fp.read(2) == '#!'
except (OSError, IOError):
logger.warning('Failed to open %s', executable)
return False
def _fix_jython_executable(self, executable):
if self._is_shell(executable):
# Workaround for Jython is not needed on Linux systems.
import java
if java.lang.System.getProperty('os.name') == 'Linux':
return executable
elif executable.lower().endswith('jython.exe'):
# Use wrapper exe for Jython on Windows
return executable
return '/usr/bin/env %s' % executable
def _get_shebang(self, encoding, post_interp=b'', options=None):
enquote = True
if self.executable:
executable = self.executable
enquote = False # assume this will be taken care of
elif not sysconfig.is_python_build():
executable = get_executable()
elif in_venv(): # pragma: no cover
executable = os.path.join(sysconfig.get_path('scripts'),
'python%s' % sysconfig.get_config_var('EXE'))
else: # pragma: no cover
executable = os.path.join(
sysconfig.get_config_var('BINDIR'),
'python%s%s' % (sysconfig.get_config_var('VERSION'),
sysconfig.get_config_var('EXE')))
if options:
executable = self._get_alternate_executable(executable, options)
if sys.platform.startswith('java'): # pragma: no cover
executable = self._fix_jython_executable(executable)
# Normalise case for Windows
executable = os.path.normcase(executable)
# If the user didn't specify an executable, it may be necessary to
# cater for executable paths with spaces (not uncommon on Windows)
if enquote:
executable = _enquote_executable(executable)
# Issue #51: don't use fsencode, since we later try to
# check that the shebang is decodable using utf-8.
executable = executable.encode('utf-8')
# in case of IronPython, play safe and enable frames support
if (sys.platform == 'cli' and '-X:Frames' not in post_interp
and '-X:FullFrames' not in post_interp): # pragma: no cover
post_interp += b' -X:Frames'
shebang = b'#!' + executable + post_interp + b'\n'
# Python parser starts to read a script using UTF-8 until
# it gets a #coding:xxx cookie. The shebang has to be the
# first line of a file, the #coding:xxx cookie cannot be
# written before. So the shebang has to be decodable from
# UTF-8.
try:
shebang.decode('utf-8')
except UnicodeDecodeError: # pragma: no cover
raise ValueError(
'The shebang (%r) is not decodable from utf-8' % shebang)
# If the script is encoded to a custom encoding (use a
# #coding:xxx cookie), the shebang has to be decodable from
# the script encoding too.
if encoding != 'utf-8':
try:
shebang.decode(encoding)
except UnicodeDecodeError: # pragma: no cover
raise ValueError(
'The shebang (%r) is not decodable '
'from the script encoding (%r)' % (shebang, encoding))
return shebang
def _get_script_text(self, entry):
return self.script_template % dict(module=entry.prefix,
func=entry.suffix)
manifest = _DEFAULT_MANIFEST
def get_manifest(self, exename):
base = os.path.basename(exename)
return self.manifest % base
def _write_script(self, names, shebang, script_bytes, filenames, ext):
use_launcher = self.add_launchers and self._is_nt
linesep = os.linesep.encode('utf-8')
if not use_launcher:
script_bytes = shebang + linesep + script_bytes
else: # pragma: no cover
if ext == 'py':
launcher = self._get_launcher('t')
else:
launcher = self._get_launcher('w')
stream = BytesIO()
with ZipFile(stream, 'w') as zf:
zf.writestr('__main__.py', script_bytes)
zip_data = stream.getvalue()
script_bytes = launcher + shebang + linesep + zip_data
for name in names:
outname = os.path.join(self.target_dir, name)
if use_launcher: # pragma: no cover
n, e = os.path.splitext(outname)
if e.startswith('.py'):
outname = n
outname = '%s.exe' % outname
try:
self._fileop.write_binary_file(outname, script_bytes)
except Exception:
# Failed writing an executable - it might be in use.
logger.warning('Failed to write executable - trying to '
'use .deleteme logic')
dfname = '%s.deleteme' % outname
if os.path.exists(dfname):
os.remove(dfname) # Not allowed to fail here
os.rename(outname, dfname) # nor here
self._fileop.write_binary_file(outname, script_bytes)
logger.debug('Able to replace executable using '
'.deleteme logic')
try:
os.remove(dfname)
except Exception:
pass # still in use - ignore error
else:
if self._is_nt and not outname.endswith('.' + ext): # pragma: no cover
outname = '%s.%s' % (outname, ext)
if os.path.exists(outname) and not self.clobber:
logger.warning('Skipping existing file %s', outname)
continue
self._fileop.write_binary_file(outname, script_bytes)
if self.set_mode:
self._fileop.set_executable_mode([outname])
filenames.append(outname)
def _make_script(self, entry, filenames, options=None):
post_interp = b''
if options:
args = options.get('interpreter_args', [])
if args:
args = ' %s' % ' '.join(args)
post_interp = args.encode('utf-8')
shebang = self._get_shebang('utf-8', post_interp, options=options)
script = self._get_script_text(entry).encode('utf-8')
name = entry.name
scriptnames = set()
if '' in self.variants:
scriptnames.add(name)
if 'X' in self.variants:
scriptnames.add('%s%s' % (name, sys.version[0]))
if 'X.Y' in self.variants:
scriptnames.add('%s-%s' % (name, sys.version[:3]))
if options and options.get('gui', False):
ext = 'pyw'
else:
ext = 'py'
self._write_script(scriptnames, shebang, script, filenames, ext)
def _copy_script(self, script, filenames):
adjust = False
script = os.path.join(self.source_dir, convert_path(script))
outname = os.path.join(self.target_dir, os.path.basename(script))
if not self.force and not self._fileop.newer(script, outname):
logger.debug('not copying %s (up-to-date)', script)
return
# Always open the file, but ignore failures in dry-run mode --
# that way, we'll get accurate feedback if we can read the
# script.
try:
f = open(script, 'rb')
except IOError: # pragma: no cover
if not self.dry_run:
raise
f = None
else:
first_line = f.readline()
if not first_line: # pragma: no cover
logger.warning('%s: %s is an empty file (skipping)',
self.get_command_name(), script)
return
match = FIRST_LINE_RE.match(first_line.replace(b'\r\n', b'\n'))
if match:
adjust = True
post_interp = match.group(1) or b''
if not adjust:
if f:
f.close()
self._fileop.copy_file(script, outname)
if self.set_mode:
self._fileop.set_executable_mode([outname])
filenames.append(outname)
else:
logger.info('copying and adjusting %s -> %s', script,
self.target_dir)
if not self._fileop.dry_run:
encoding, lines = detect_encoding(f.readline)
f.seek(0)
shebang = self._get_shebang(encoding, post_interp)
if b'pythonw' in first_line: # pragma: no cover
ext = 'pyw'
else:
ext = 'py'
n = os.path.basename(outname)
self._write_script([n], shebang, f.read(), filenames, ext)
if f:
f.close()
@property
def dry_run(self):
return self._fileop.dry_run
@dry_run.setter
def dry_run(self, value):
self._fileop.dry_run = value
if os.name == 'nt' or (os.name == 'java' and os._name == 'nt'): # pragma: no cover
# Executable launcher support.
# Launchers are from https://bitbucket.org/vinay.sajip/simple_launcher/
def _get_launcher(self, kind):
if struct.calcsize('P') == 8: # 64-bit
bits = '64'
else:
bits = '32'
name = '%s%s.exe' % (kind, bits)
# Issue 31: don't hardcode an absolute package name, but
# determine it relative to the current package
distlib_package = __name__.rsplit('.', 1)[0]
result = finder(distlib_package).find(name).bytes
return result
# Public API follows
def make(self, specification, options=None):
"""
Make a script.
:param specification: The specification, which is either a valid export
entry specification (to make a script from a
callable) or a filename (to make a script by
copying from a source location).
:param options: A dictionary of options controlling script generation.
:return: A list of all absolute pathnames written to.
"""
filenames = []
entry = get_export_entry(specification)
if entry is None:
self._copy_script(specification, filenames)
else:
self._make_script(entry, filenames, options=options)
return filenames
def make_multiple(self, specifications, options=None):
"""
Take a list of specifications and make scripts from them,
:param specifications: A list of specifications.
:return: A list of all absolute pathnames written to,
"""
filenames = []
for specification in specifications:
filenames.extend(self.make(specification, options))
return filenames
pip/_vendor/distlib/database.py 0000644 00000141010 14751155150 0012541 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012-2016 The Python Software Foundation.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
"""PEP 376 implementation."""
from __future__ import unicode_literals
import base64
import codecs
import contextlib
import hashlib
import logging
import os
import posixpath
import sys
import zipimport
from . import DistlibException, resources
from .compat import StringIO
from .version import get_scheme, UnsupportedVersionError
from .metadata import Metadata, METADATA_FILENAME, WHEEL_METADATA_FILENAME
from .util import (parse_requirement, cached_property, parse_name_and_version,
read_exports, write_exports, CSVReader, CSVWriter)
__all__ = ['Distribution', 'BaseInstalledDistribution',
'InstalledDistribution', 'EggInfoDistribution',
'DistributionPath']
logger = logging.getLogger(__name__)
EXPORTS_FILENAME = 'pydist-exports.json'
COMMANDS_FILENAME = 'pydist-commands.json'
DIST_FILES = ('INSTALLER', METADATA_FILENAME, 'RECORD', 'REQUESTED',
'RESOURCES', EXPORTS_FILENAME, 'SHARED')
DISTINFO_EXT = '.dist-info'
class _Cache(object):
"""
A simple cache mapping names and .dist-info paths to distributions
"""
def __init__(self):
"""
Initialise an instance. There is normally one for each DistributionPath.
"""
self.name = {}
self.path = {}
self.generated = False
def clear(self):
"""
Clear the cache, setting it to its initial state.
"""
self.name.clear()
self.path.clear()
self.generated = False
def add(self, dist):
"""
Add a distribution to the cache.
:param dist: The distribution to add.
"""
if dist.path not in self.path:
self.path[dist.path] = dist
self.name.setdefault(dist.key, []).append(dist)
class DistributionPath(object):
"""
Represents a set of distributions installed on a path (typically sys.path).
"""
def __init__(self, path=None, include_egg=False):
"""
Create an instance from a path, optionally including legacy (distutils/
setuptools/distribute) distributions.
:param path: The path to use, as a list of directories. If not specified,
sys.path is used.
:param include_egg: If True, this instance will look for and return legacy
distributions as well as those based on PEP 376.
"""
if path is None:
path = sys.path
self.path = path
self._include_dist = True
self._include_egg = include_egg
self._cache = _Cache()
self._cache_egg = _Cache()
self._cache_enabled = True
self._scheme = get_scheme('default')
def _get_cache_enabled(self):
return self._cache_enabled
def _set_cache_enabled(self, value):
self._cache_enabled = value
cache_enabled = property(_get_cache_enabled, _set_cache_enabled)
def clear_cache(self):
"""
Clears the internal cache.
"""
self._cache.clear()
self._cache_egg.clear()
def _yield_distributions(self):
"""
Yield .dist-info and/or .egg(-info) distributions.
"""
# We need to check if we've seen some resources already, because on
# some Linux systems (e.g. some Debian/Ubuntu variants) there are
# symlinks which alias other files in the environment.
seen = set()
for path in self.path:
finder = resources.finder_for_path(path)
if finder is None:
continue
r = finder.find('')
if not r or not r.is_container:
continue
rset = sorted(r.resources)
for entry in rset:
r = finder.find(entry)
if not r or r.path in seen:
continue
if self._include_dist and entry.endswith(DISTINFO_EXT):
possible_filenames = [METADATA_FILENAME, WHEEL_METADATA_FILENAME]
for metadata_filename in possible_filenames:
metadata_path = posixpath.join(entry, metadata_filename)
pydist = finder.find(metadata_path)
if pydist:
break
else:
continue
with contextlib.closing(pydist.as_stream()) as stream:
metadata = Metadata(fileobj=stream, scheme='legacy')
logger.debug('Found %s', r.path)
seen.add(r.path)
yield new_dist_class(r.path, metadata=metadata,
env=self)
elif self._include_egg and entry.endswith(('.egg-info',
'.egg')):
logger.debug('Found %s', r.path)
seen.add(r.path)
yield old_dist_class(r.path, self)
def _generate_cache(self):
"""
Scan the path for distributions and populate the cache with
those that are found.
"""
gen_dist = not self._cache.generated
gen_egg = self._include_egg and not self._cache_egg.generated
if gen_dist or gen_egg:
for dist in self._yield_distributions():
if isinstance(dist, InstalledDistribution):
self._cache.add(dist)
else:
self._cache_egg.add(dist)
if gen_dist:
self._cache.generated = True
if gen_egg:
self._cache_egg.generated = True
@classmethod
def distinfo_dirname(cls, name, version):
"""
The *name* and *version* parameters are converted into their
filename-escaped form, i.e. any ``'-'`` characters are replaced
with ``'_'`` other than the one in ``'dist-info'`` and the one
separating the name from the version number.
:parameter name: is converted to a standard distribution name by replacing
any runs of non- alphanumeric characters with a single
``'-'``.
:type name: string
:parameter version: is converted to a standard version string. Spaces
become dots, and all other non-alphanumeric characters
(except dots) become dashes, with runs of multiple
dashes condensed to a single dash.
:type version: string
:returns: directory name
:rtype: string"""
name = name.replace('-', '_')
return '-'.join([name, version]) + DISTINFO_EXT
def get_distributions(self):
"""
Provides an iterator that looks for distributions and returns
:class:`InstalledDistribution` or
:class:`EggInfoDistribution` instances for each one of them.
:rtype: iterator of :class:`InstalledDistribution` and
:class:`EggInfoDistribution` instances
"""
if not self._cache_enabled:
for dist in self._yield_distributions():
yield dist
else:
self._generate_cache()
for dist in self._cache.path.values():
yield dist
if self._include_egg:
for dist in self._cache_egg.path.values():
yield dist
def get_distribution(self, name):
"""
Looks for a named distribution on the path.
This function only returns the first result found, as no more than one
value is expected. If nothing is found, ``None`` is returned.
:rtype: :class:`InstalledDistribution`, :class:`EggInfoDistribution`
or ``None``
"""
result = None
name = name.lower()
if not self._cache_enabled:
for dist in self._yield_distributions():
if dist.key == name:
result = dist
break
else:
self._generate_cache()
if name in self._cache.name:
result = self._cache.name[name][0]
elif self._include_egg and name in self._cache_egg.name:
result = self._cache_egg.name[name][0]
return result
def provides_distribution(self, name, version=None):
"""
Iterates over all distributions to find which distributions provide *name*.
If a *version* is provided, it will be used to filter the results.
This function only returns the first result found, since no more than
one values are expected. If the directory is not found, returns ``None``.
:parameter version: a version specifier that indicates the version
required, conforming to the format in ``PEP-345``
:type name: string
:type version: string
"""
matcher = None
if not version is None:
try:
matcher = self._scheme.matcher('%s (%s)' % (name, version))
except ValueError:
raise DistlibException('invalid name or version: %r, %r' %
(name, version))
for dist in self.get_distributions():
provided = dist.provides
for p in provided:
p_name, p_ver = parse_name_and_version(p)
if matcher is None:
if p_name == name:
yield dist
break
else:
if p_name == name and matcher.match(p_ver):
yield dist
break
def get_file_path(self, name, relative_path):
"""
Return the path to a resource file.
"""
dist = self.get_distribution(name)
if dist is None:
raise LookupError('no distribution named %r found' % name)
return dist.get_resource_path(relative_path)
def get_exported_entries(self, category, name=None):
"""
Return all of the exported entries in a particular category.
:param category: The category to search for entries.
:param name: If specified, only entries with that name are returned.
"""
for dist in self.get_distributions():
r = dist.exports
if category in r:
d = r[category]
if name is not None:
if name in d:
yield d[name]
else:
for v in d.values():
yield v
class Distribution(object):
"""
A base class for distributions, whether installed or from indexes.
Either way, it must have some metadata, so that's all that's needed
for construction.
"""
build_time_dependency = False
"""
Set to True if it's known to be only a build-time dependency (i.e.
not needed after installation).
"""
requested = False
"""A boolean that indicates whether the ``REQUESTED`` metadata file is
present (in other words, whether the package was installed by user
request or it was installed as a dependency)."""
def __init__(self, metadata):
"""
Initialise an instance.
:param metadata: The instance of :class:`Metadata` describing this
distribution.
"""
self.metadata = metadata
self.name = metadata.name
self.key = self.name.lower() # for case-insensitive comparisons
self.version = metadata.version
self.locator = None
self.digest = None
self.extras = None # additional features requested
self.context = None # environment marker overrides
self.download_urls = set()
self.digests = {}
@property
def source_url(self):
"""
The source archive download URL for this distribution.
"""
return self.metadata.source_url
download_url = source_url # Backward compatibility
@property
def name_and_version(self):
"""
A utility property which displays the name and version in parentheses.
"""
return '%s (%s)' % (self.name, self.version)
@property
def provides(self):
"""
A set of distribution names and versions provided by this distribution.
:return: A set of "name (version)" strings.
"""
plist = self.metadata.provides
s = '%s (%s)' % (self.name, self.version)
if s not in plist:
plist.append(s)
return plist
def _get_requirements(self, req_attr):
md = self.metadata
logger.debug('Getting requirements from metadata %r', md.todict())
reqts = getattr(md, req_attr)
return set(md.get_requirements(reqts, extras=self.extras,
env=self.context))
@property
def run_requires(self):
return self._get_requirements('run_requires')
@property
def meta_requires(self):
return self._get_requirements('meta_requires')
@property
def build_requires(self):
return self._get_requirements('build_requires')
@property
def test_requires(self):
return self._get_requirements('test_requires')
@property
def dev_requires(self):
return self._get_requirements('dev_requires')
def matches_requirement(self, req):
"""
Say if this instance matches (fulfills) a requirement.
:param req: The requirement to match.
:rtype req: str
:return: True if it matches, else False.
"""
# Requirement may contain extras - parse to lose those
# from what's passed to the matcher
r = parse_requirement(req)
scheme = get_scheme(self.metadata.scheme)
try:
matcher = scheme.matcher(r.requirement)
except UnsupportedVersionError:
# XXX compat-mode if cannot read the version
logger.warning('could not read version %r - using name only',
req)
name = req.split()[0]
matcher = scheme.matcher(name)
name = matcher.key # case-insensitive
result = False
for p in self.provides:
p_name, p_ver = parse_name_and_version(p)
if p_name != name:
continue
try:
result = matcher.match(p_ver)
break
except UnsupportedVersionError:
pass
return result
def __repr__(self):
"""
Return a textual representation of this instance,
"""
if self.source_url:
suffix = ' [%s]' % self.source_url
else:
suffix = ''
return '<Distribution %s (%s)%s>' % (self.name, self.version, suffix)
def __eq__(self, other):
"""
See if this distribution is the same as another.
:param other: The distribution to compare with. To be equal to one
another. distributions must have the same type, name,
version and source_url.
:return: True if it is the same, else False.
"""
if type(other) is not type(self):
result = False
else:
result = (self.name == other.name and
self.version == other.version and
self.source_url == other.source_url)
return result
def __hash__(self):
"""
Compute hash in a way which matches the equality test.
"""
return hash(self.name) + hash(self.version) + hash(self.source_url)
class BaseInstalledDistribution(Distribution):
"""
This is the base class for installed distributions (whether PEP 376 or
legacy).
"""
hasher = None
def __init__(self, metadata, path, env=None):
"""
Initialise an instance.
:param metadata: An instance of :class:`Metadata` which describes the
distribution. This will normally have been initialised
from a metadata file in the ``path``.
:param path: The path of the ``.dist-info`` or ``.egg-info``
directory for the distribution.
:param env: This is normally the :class:`DistributionPath`
instance where this distribution was found.
"""
super(BaseInstalledDistribution, self).__init__(metadata)
self.path = path
self.dist_path = env
def get_hash(self, data, hasher=None):
"""
Get the hash of some data, using a particular hash algorithm, if
specified.
:param data: The data to be hashed.
:type data: bytes
:param hasher: The name of a hash implementation, supported by hashlib,
or ``None``. Examples of valid values are ``'sha1'``,
``'sha224'``, ``'sha384'``, '``sha256'``, ``'md5'`` and
``'sha512'``. If no hasher is specified, the ``hasher``
attribute of the :class:`InstalledDistribution` instance
is used. If the hasher is determined to be ``None``, MD5
is used as the hashing algorithm.
:returns: The hash of the data. If a hasher was explicitly specified,
the returned hash will be prefixed with the specified hasher
followed by '='.
:rtype: str
"""
if hasher is None:
hasher = self.hasher
if hasher is None:
hasher = hashlib.md5
prefix = ''
else:
hasher = getattr(hashlib, hasher)
prefix = '%s=' % self.hasher
digest = hasher(data).digest()
digest = base64.urlsafe_b64encode(digest).rstrip(b'=').decode('ascii')
return '%s%s' % (prefix, digest)
class InstalledDistribution(BaseInstalledDistribution):
"""
Created with the *path* of the ``.dist-info`` directory provided to the
constructor. It reads the metadata contained in ``pydist.json`` when it is
instantiated., or uses a passed in Metadata instance (useful for when
dry-run mode is being used).
"""
hasher = 'sha256'
def __init__(self, path, metadata=None, env=None):
self.finder = finder = resources.finder_for_path(path)
if finder is None:
import pdb; pdb.set_trace ()
if env and env._cache_enabled and path in env._cache.path:
metadata = env._cache.path[path].metadata
elif metadata is None:
r = finder.find(METADATA_FILENAME)
# Temporary - for Wheel 0.23 support
if r is None:
r = finder.find(WHEEL_METADATA_FILENAME)
# Temporary - for legacy support
if r is None:
r = finder.find('METADATA')
if r is None:
raise ValueError('no %s found in %s' % (METADATA_FILENAME,
path))
with contextlib.closing(r.as_stream()) as stream:
metadata = Metadata(fileobj=stream, scheme='legacy')
super(InstalledDistribution, self).__init__(metadata, path, env)
if env and env._cache_enabled:
env._cache.add(self)
try:
r = finder.find('REQUESTED')
except AttributeError:
import pdb; pdb.set_trace ()
self.requested = r is not None
def __repr__(self):
return '<InstalledDistribution %r %s at %r>' % (
self.name, self.version, self.path)
def __str__(self):
return "%s %s" % (self.name, self.version)
def _get_records(self):
"""
Get the list of installed files for the distribution
:return: A list of tuples of path, hash and size. Note that hash and
size might be ``None`` for some entries. The path is exactly
as stored in the file (which is as in PEP 376).
"""
results = []
r = self.get_distinfo_resource('RECORD')
with contextlib.closing(r.as_stream()) as stream:
with CSVReader(stream=stream) as record_reader:
# Base location is parent dir of .dist-info dir
#base_location = os.path.dirname(self.path)
#base_location = os.path.abspath(base_location)
for row in record_reader:
missing = [None for i in range(len(row), 3)]
path, checksum, size = row + missing
#if not os.path.isabs(path):
# path = path.replace('/', os.sep)
# path = os.path.join(base_location, path)
results.append((path, checksum, size))
return results
@cached_property
def exports(self):
"""
Return the information exported by this distribution.
:return: A dictionary of exports, mapping an export category to a dict
of :class:`ExportEntry` instances describing the individual
export entries, and keyed by name.
"""
result = {}
r = self.get_distinfo_resource(EXPORTS_FILENAME)
if r:
result = self.read_exports()
return result
def read_exports(self):
"""
Read exports data from a file in .ini format.
:return: A dictionary of exports, mapping an export category to a list
of :class:`ExportEntry` instances describing the individual
export entries.
"""
result = {}
r = self.get_distinfo_resource(EXPORTS_FILENAME)
if r:
with contextlib.closing(r.as_stream()) as stream:
result = read_exports(stream)
return result
def write_exports(self, exports):
"""
Write a dictionary of exports to a file in .ini format.
:param exports: A dictionary of exports, mapping an export category to
a list of :class:`ExportEntry` instances describing the
individual export entries.
"""
rf = self.get_distinfo_file(EXPORTS_FILENAME)
with open(rf, 'w') as f:
write_exports(exports, f)
def get_resource_path(self, relative_path):
"""
NOTE: This API may change in the future.
Return the absolute path to a resource file with the given relative
path.
:param relative_path: The path, relative to .dist-info, of the resource
of interest.
:return: The absolute path where the resource is to be found.
"""
r = self.get_distinfo_resource('RESOURCES')
with contextlib.closing(r.as_stream()) as stream:
with CSVReader(stream=stream) as resources_reader:
for relative, destination in resources_reader:
if relative == relative_path:
return destination
raise KeyError('no resource file with relative path %r '
'is installed' % relative_path)
def list_installed_files(self):
"""
Iterates over the ``RECORD`` entries and returns a tuple
``(path, hash, size)`` for each line.
:returns: iterator of (path, hash, size)
"""
for result in self._get_records():
yield result
def write_installed_files(self, paths, prefix, dry_run=False):
"""
Writes the ``RECORD`` file, using the ``paths`` iterable passed in. Any
existing ``RECORD`` file is silently overwritten.
prefix is used to determine when to write absolute paths.
"""
prefix = os.path.join(prefix, '')
base = os.path.dirname(self.path)
base_under_prefix = base.startswith(prefix)
base = os.path.join(base, '')
record_path = self.get_distinfo_file('RECORD')
logger.info('creating %s', record_path)
if dry_run:
return None
with CSVWriter(record_path) as writer:
for path in paths:
if os.path.isdir(path) or path.endswith(('.pyc', '.pyo')):
# do not put size and hash, as in PEP-376
hash_value = size = ''
else:
size = '%d' % os.path.getsize(path)
with open(path, 'rb') as fp:
hash_value = self.get_hash(fp.read())
if path.startswith(base) or (base_under_prefix and
path.startswith(prefix)):
path = os.path.relpath(path, base)
writer.writerow((path, hash_value, size))
# add the RECORD file itself
if record_path.startswith(base):
record_path = os.path.relpath(record_path, base)
writer.writerow((record_path, '', ''))
return record_path
def check_installed_files(self):
"""
Checks that the hashes and sizes of the files in ``RECORD`` are
matched by the files themselves. Returns a (possibly empty) list of
mismatches. Each entry in the mismatch list will be a tuple consisting
of the path, 'exists', 'size' or 'hash' according to what didn't match
(existence is checked first, then size, then hash), the expected
value and the actual value.
"""
mismatches = []
base = os.path.dirname(self.path)
record_path = self.get_distinfo_file('RECORD')
for path, hash_value, size in self.list_installed_files():
if not os.path.isabs(path):
path = os.path.join(base, path)
if path == record_path:
continue
if not os.path.exists(path):
mismatches.append((path, 'exists', True, False))
elif os.path.isfile(path):
actual_size = str(os.path.getsize(path))
if size and actual_size != size:
mismatches.append((path, 'size', size, actual_size))
elif hash_value:
if '=' in hash_value:
hasher = hash_value.split('=', 1)[0]
else:
hasher = None
with open(path, 'rb') as f:
actual_hash = self.get_hash(f.read(), hasher)
if actual_hash != hash_value:
mismatches.append((path, 'hash', hash_value, actual_hash))
return mismatches
@cached_property
def shared_locations(self):
"""
A dictionary of shared locations whose keys are in the set 'prefix',
'purelib', 'platlib', 'scripts', 'headers', 'data' and 'namespace'.
The corresponding value is the absolute path of that category for
this distribution, and takes into account any paths selected by the
user at installation time (e.g. via command-line arguments). In the
case of the 'namespace' key, this would be a list of absolute paths
for the roots of namespace packages in this distribution.
The first time this property is accessed, the relevant information is
read from the SHARED file in the .dist-info directory.
"""
result = {}
shared_path = os.path.join(self.path, 'SHARED')
if os.path.isfile(shared_path):
with codecs.open(shared_path, 'r', encoding='utf-8') as f:
lines = f.read().splitlines()
for line in lines:
key, value = line.split('=', 1)
if key == 'namespace':
result.setdefault(key, []).append(value)
else:
result[key] = value
return result
def write_shared_locations(self, paths, dry_run=False):
"""
Write shared location information to the SHARED file in .dist-info.
:param paths: A dictionary as described in the documentation for
:meth:`shared_locations`.
:param dry_run: If True, the action is logged but no file is actually
written.
:return: The path of the file written to.
"""
shared_path = os.path.join(self.path, 'SHARED')
logger.info('creating %s', shared_path)
if dry_run:
return None
lines = []
for key in ('prefix', 'lib', 'headers', 'scripts', 'data'):
path = paths[key]
if os.path.isdir(paths[key]):
lines.append('%s=%s' % (key, path))
for ns in paths.get('namespace', ()):
lines.append('namespace=%s' % ns)
with codecs.open(shared_path, 'w', encoding='utf-8') as f:
f.write('\n'.join(lines))
return shared_path
def get_distinfo_resource(self, path):
if path not in DIST_FILES:
raise DistlibException('invalid path for a dist-info file: '
'%r at %r' % (path, self.path))
finder = resources.finder_for_path(self.path)
if finder is None:
raise DistlibException('Unable to get a finder for %s' % self.path)
return finder.find(path)
def get_distinfo_file(self, path):
"""
Returns a path located under the ``.dist-info`` directory. Returns a
string representing the path.
:parameter path: a ``'/'``-separated path relative to the
``.dist-info`` directory or an absolute path;
If *path* is an absolute path and doesn't start
with the ``.dist-info`` directory path,
a :class:`DistlibException` is raised
:type path: str
:rtype: str
"""
# Check if it is an absolute path # XXX use relpath, add tests
if path.find(os.sep) >= 0:
# it's an absolute path?
distinfo_dirname, path = path.split(os.sep)[-2:]
if distinfo_dirname != self.path.split(os.sep)[-1]:
raise DistlibException(
'dist-info file %r does not belong to the %r %s '
'distribution' % (path, self.name, self.version))
# The file must be relative
if path not in DIST_FILES:
raise DistlibException('invalid path for a dist-info file: '
'%r at %r' % (path, self.path))
return os.path.join(self.path, path)
def list_distinfo_files(self):
"""
Iterates over the ``RECORD`` entries and returns paths for each line if
the path is pointing to a file located in the ``.dist-info`` directory
or one of its subdirectories.
:returns: iterator of paths
"""
base = os.path.dirname(self.path)
for path, checksum, size in self._get_records():
# XXX add separator or use real relpath algo
if not os.path.isabs(path):
path = os.path.join(base, path)
if path.startswith(self.path):
yield path
def __eq__(self, other):
return (isinstance(other, InstalledDistribution) and
self.path == other.path)
# See http://docs.python.org/reference/datamodel#object.__hash__
__hash__ = object.__hash__
class EggInfoDistribution(BaseInstalledDistribution):
"""Created with the *path* of the ``.egg-info`` directory or file provided
to the constructor. It reads the metadata contained in the file itself, or
if the given path happens to be a directory, the metadata is read from the
file ``PKG-INFO`` under that directory."""
requested = True # as we have no way of knowing, assume it was
shared_locations = {}
def __init__(self, path, env=None):
def set_name_and_version(s, n, v):
s.name = n
s.key = n.lower() # for case-insensitive comparisons
s.version = v
self.path = path
self.dist_path = env
if env and env._cache_enabled and path in env._cache_egg.path:
metadata = env._cache_egg.path[path].metadata
set_name_and_version(self, metadata.name, metadata.version)
else:
metadata = self._get_metadata(path)
# Need to be set before caching
set_name_and_version(self, metadata.name, metadata.version)
if env and env._cache_enabled:
env._cache_egg.add(self)
super(EggInfoDistribution, self).__init__(metadata, path, env)
def _get_metadata(self, path):
requires = None
def parse_requires_data(data):
"""Create a list of dependencies from a requires.txt file.
*data*: the contents of a setuptools-produced requires.txt file.
"""
reqs = []
lines = data.splitlines()
for line in lines:
line = line.strip()
if line.startswith('['):
logger.warning('Unexpected line: quitting requirement scan: %r',
line)
break
r = parse_requirement(line)
if not r:
logger.warning('Not recognised as a requirement: %r', line)
continue
if r.extras:
logger.warning('extra requirements in requires.txt are '
'not supported')
if not r.constraints:
reqs.append(r.name)
else:
cons = ', '.join('%s%s' % c for c in r.constraints)
reqs.append('%s (%s)' % (r.name, cons))
return reqs
def parse_requires_path(req_path):
"""Create a list of dependencies from a requires.txt file.
*req_path*: the path to a setuptools-produced requires.txt file.
"""
reqs = []
try:
with codecs.open(req_path, 'r', 'utf-8') as fp:
reqs = parse_requires_data(fp.read())
except IOError:
pass
return reqs
if path.endswith('.egg'):
if os.path.isdir(path):
meta_path = os.path.join(path, 'EGG-INFO', 'PKG-INFO')
metadata = Metadata(path=meta_path, scheme='legacy')
req_path = os.path.join(path, 'EGG-INFO', 'requires.txt')
requires = parse_requires_path(req_path)
else:
# FIXME handle the case where zipfile is not available
zipf = zipimport.zipimporter(path)
fileobj = StringIO(
zipf.get_data('EGG-INFO/PKG-INFO').decode('utf8'))
metadata = Metadata(fileobj=fileobj, scheme='legacy')
try:
data = zipf.get_data('EGG-INFO/requires.txt')
requires = parse_requires_data(data.decode('utf-8'))
except IOError:
requires = None
elif path.endswith('.egg-info'):
if os.path.isdir(path):
req_path = os.path.join(path, 'requires.txt')
requires = parse_requires_path(req_path)
path = os.path.join(path, 'PKG-INFO')
metadata = Metadata(path=path, scheme='legacy')
else:
raise DistlibException('path must end with .egg-info or .egg, '
'got %r' % path)
if requires:
metadata.add_requirements(requires)
return metadata
def __repr__(self):
return '<EggInfoDistribution %r %s at %r>' % (
self.name, self.version, self.path)
def __str__(self):
return "%s %s" % (self.name, self.version)
def check_installed_files(self):
"""
Checks that the hashes and sizes of the files in ``RECORD`` are
matched by the files themselves. Returns a (possibly empty) list of
mismatches. Each entry in the mismatch list will be a tuple consisting
of the path, 'exists', 'size' or 'hash' according to what didn't match
(existence is checked first, then size, then hash), the expected
value and the actual value.
"""
mismatches = []
record_path = os.path.join(self.path, 'installed-files.txt')
if os.path.exists(record_path):
for path, _, _ in self.list_installed_files():
if path == record_path:
continue
if not os.path.exists(path):
mismatches.append((path, 'exists', True, False))
return mismatches
def list_installed_files(self):
"""
Iterates over the ``installed-files.txt`` entries and returns a tuple
``(path, hash, size)`` for each line.
:returns: a list of (path, hash, size)
"""
def _md5(path):
f = open(path, 'rb')
try:
content = f.read()
finally:
f.close()
return hashlib.md5(content).hexdigest()
def _size(path):
return os.stat(path).st_size
record_path = os.path.join(self.path, 'installed-files.txt')
result = []
if os.path.exists(record_path):
with codecs.open(record_path, 'r', encoding='utf-8') as f:
for line in f:
line = line.strip()
p = os.path.normpath(os.path.join(self.path, line))
# "./" is present as a marker between installed files
# and installation metadata files
if not os.path.exists(p):
logger.warning('Non-existent file: %s', p)
if p.endswith(('.pyc', '.pyo')):
continue
#otherwise fall through and fail
if not os.path.isdir(p):
result.append((p, _md5(p), _size(p)))
result.append((record_path, None, None))
return result
def list_distinfo_files(self, absolute=False):
"""
Iterates over the ``installed-files.txt`` entries and returns paths for
each line if the path is pointing to a file located in the
``.egg-info`` directory or one of its subdirectories.
:parameter absolute: If *absolute* is ``True``, each returned path is
transformed into a local absolute path. Otherwise the
raw value from ``installed-files.txt`` is returned.
:type absolute: boolean
:returns: iterator of paths
"""
record_path = os.path.join(self.path, 'installed-files.txt')
skip = True
with codecs.open(record_path, 'r', encoding='utf-8') as f:
for line in f:
line = line.strip()
if line == './':
skip = False
continue
if not skip:
p = os.path.normpath(os.path.join(self.path, line))
if p.startswith(self.path):
if absolute:
yield p
else:
yield line
def __eq__(self, other):
return (isinstance(other, EggInfoDistribution) and
self.path == other.path)
# See http://docs.python.org/reference/datamodel#object.__hash__
__hash__ = object.__hash__
new_dist_class = InstalledDistribution
old_dist_class = EggInfoDistribution
class DependencyGraph(object):
"""
Represents a dependency graph between distributions.
The dependency relationships are stored in an ``adjacency_list`` that maps
distributions to a list of ``(other, label)`` tuples where ``other``
is a distribution and the edge is labeled with ``label`` (i.e. the version
specifier, if such was provided). Also, for more efficient traversal, for
every distribution ``x``, a list of predecessors is kept in
``reverse_list[x]``. An edge from distribution ``a`` to
distribution ``b`` means that ``a`` depends on ``b``. If any missing
dependencies are found, they are stored in ``missing``, which is a
dictionary that maps distributions to a list of requirements that were not
provided by any other distributions.
"""
def __init__(self):
self.adjacency_list = {}
self.reverse_list = {}
self.missing = {}
def add_distribution(self, distribution):
"""Add the *distribution* to the graph.
:type distribution: :class:`distutils2.database.InstalledDistribution`
or :class:`distutils2.database.EggInfoDistribution`
"""
self.adjacency_list[distribution] = []
self.reverse_list[distribution] = []
#self.missing[distribution] = []
def add_edge(self, x, y, label=None):
"""Add an edge from distribution *x* to distribution *y* with the given
*label*.
:type x: :class:`distutils2.database.InstalledDistribution` or
:class:`distutils2.database.EggInfoDistribution`
:type y: :class:`distutils2.database.InstalledDistribution` or
:class:`distutils2.database.EggInfoDistribution`
:type label: ``str`` or ``None``
"""
self.adjacency_list[x].append((y, label))
# multiple edges are allowed, so be careful
if x not in self.reverse_list[y]:
self.reverse_list[y].append(x)
def add_missing(self, distribution, requirement):
"""
Add a missing *requirement* for the given *distribution*.
:type distribution: :class:`distutils2.database.InstalledDistribution`
or :class:`distutils2.database.EggInfoDistribution`
:type requirement: ``str``
"""
logger.debug('%s missing %r', distribution, requirement)
self.missing.setdefault(distribution, []).append(requirement)
def _repr_dist(self, dist):
return '%s %s' % (dist.name, dist.version)
def repr_node(self, dist, level=1):
"""Prints only a subgraph"""
output = [self._repr_dist(dist)]
for other, label in self.adjacency_list[dist]:
dist = self._repr_dist(other)
if label is not None:
dist = '%s [%s]' % (dist, label)
output.append(' ' * level + str(dist))
suboutput = self.repr_node(other, level + 1)
subs = suboutput.split('\n')
output.extend(subs[1:])
return '\n'.join(output)
def to_dot(self, f, skip_disconnected=True):
"""Writes a DOT output for the graph to the provided file *f*.
If *skip_disconnected* is set to ``True``, then all distributions
that are not dependent on any other distribution are skipped.
:type f: has to support ``file``-like operations
:type skip_disconnected: ``bool``
"""
disconnected = []
f.write("digraph dependencies {\n")
for dist, adjs in self.adjacency_list.items():
if len(adjs) == 0 and not skip_disconnected:
disconnected.append(dist)
for other, label in adjs:
if not label is None:
f.write('"%s" -> "%s" [label="%s"]\n' %
(dist.name, other.name, label))
else:
f.write('"%s" -> "%s"\n' % (dist.name, other.name))
if not skip_disconnected and len(disconnected) > 0:
f.write('subgraph disconnected {\n')
f.write('label = "Disconnected"\n')
f.write('bgcolor = red\n')
for dist in disconnected:
f.write('"%s"' % dist.name)
f.write('\n')
f.write('}\n')
f.write('}\n')
def topological_sort(self):
"""
Perform a topological sort of the graph.
:return: A tuple, the first element of which is a topologically sorted
list of distributions, and the second element of which is a
list of distributions that cannot be sorted because they have
circular dependencies and so form a cycle.
"""
result = []
# Make a shallow copy of the adjacency list
alist = {}
for k, v in self.adjacency_list.items():
alist[k] = v[:]
while True:
# See what we can remove in this run
to_remove = []
for k, v in list(alist.items())[:]:
if not v:
to_remove.append(k)
del alist[k]
if not to_remove:
# What's left in alist (if anything) is a cycle.
break
# Remove from the adjacency list of others
for k, v in alist.items():
alist[k] = [(d, r) for d, r in v if d not in to_remove]
logger.debug('Moving to result: %s',
['%s (%s)' % (d.name, d.version) for d in to_remove])
result.extend(to_remove)
return result, list(alist.keys())
def __repr__(self):
"""Representation of the graph"""
output = []
for dist, adjs in self.adjacency_list.items():
output.append(self.repr_node(dist))
return '\n'.join(output)
def make_graph(dists, scheme='default'):
"""Makes a dependency graph from the given distributions.
:parameter dists: a list of distributions
:type dists: list of :class:`distutils2.database.InstalledDistribution` and
:class:`distutils2.database.EggInfoDistribution` instances
:rtype: a :class:`DependencyGraph` instance
"""
scheme = get_scheme(scheme)
graph = DependencyGraph()
provided = {} # maps names to lists of (version, dist) tuples
# first, build the graph and find out what's provided
for dist in dists:
graph.add_distribution(dist)
for p in dist.provides:
name, version = parse_name_and_version(p)
logger.debug('Add to provided: %s, %s, %s', name, version, dist)
provided.setdefault(name, []).append((version, dist))
# now make the edges
for dist in dists:
requires = (dist.run_requires | dist.meta_requires |
dist.build_requires | dist.dev_requires)
for req in requires:
try:
matcher = scheme.matcher(req)
except UnsupportedVersionError:
# XXX compat-mode if cannot read the version
logger.warning('could not read version %r - using name only',
req)
name = req.split()[0]
matcher = scheme.matcher(name)
name = matcher.key # case-insensitive
matched = False
if name in provided:
for version, provider in provided[name]:
try:
match = matcher.match(version)
except UnsupportedVersionError:
match = False
if match:
graph.add_edge(dist, provider, req)
matched = True
break
if not matched:
graph.add_missing(dist, req)
return graph
def get_dependent_dists(dists, dist):
"""Recursively generate a list of distributions from *dists* that are
dependent on *dist*.
:param dists: a list of distributions
:param dist: a distribution, member of *dists* for which we are interested
"""
if dist not in dists:
raise DistlibException('given distribution %r is not a member '
'of the list' % dist.name)
graph = make_graph(dists)
dep = [dist] # dependent distributions
todo = graph.reverse_list[dist] # list of nodes we should inspect
while todo:
d = todo.pop()
dep.append(d)
for succ in graph.reverse_list[d]:
if succ not in dep:
todo.append(succ)
dep.pop(0) # remove dist from dep, was there to prevent infinite loops
return dep
def get_required_dists(dists, dist):
"""Recursively generate a list of distributions from *dists* that are
required by *dist*.
:param dists: a list of distributions
:param dist: a distribution, member of *dists* for which we are interested
"""
if dist not in dists:
raise DistlibException('given distribution %r is not a member '
'of the list' % dist.name)
graph = make_graph(dists)
req = [] # required distributions
todo = graph.adjacency_list[dist] # list of nodes we should inspect
while todo:
d = todo.pop()[0]
req.append(d)
for pred in graph.adjacency_list[d]:
if pred not in req:
todo.append(pred)
return req
def make_dist(name, version, **kwargs):
"""
A convenience method for making a dist given just a name and version.
"""
summary = kwargs.pop('summary', 'Placeholder for summary')
md = Metadata(**kwargs)
md.name = name
md.version = version
md.summary = summary or 'Placeholder for summary'
return Distribution(md)
pip/_vendor/distlib/util.py 0000644 00000150551 14751155150 0011764 0 ustar 00 #
# Copyright (C) 2012-2016 The Python Software Foundation.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
import codecs
from collections import deque
import contextlib
import csv
from glob import iglob as std_iglob
import io
import json
import logging
import os
import py_compile
import re
import shutil
import socket
try:
import ssl
except ImportError: # pragma: no cover
ssl = None
import subprocess
import sys
import tarfile
import tempfile
import textwrap
try:
import threading
except ImportError: # pragma: no cover
import dummy_threading as threading
import time
from . import DistlibException
from .compat import (string_types, text_type, shutil, raw_input, StringIO,
cache_from_source, urlopen, urljoin, httplib, xmlrpclib,
splittype, HTTPHandler, BaseConfigurator, valid_ident,
Container, configparser, URLError, ZipFile, fsdecode,
unquote)
logger = logging.getLogger(__name__)
#
# Requirement parsing code for name + optional constraints + optional extras
#
# e.g. 'foo >= 1.2, < 2.0 [bar, baz]'
#
# The regex can seem a bit hairy, so we build it up out of smaller pieces
# which are manageable.
#
COMMA = r'\s*,\s*'
COMMA_RE = re.compile(COMMA)
IDENT = r'(\w|[.-])+'
EXTRA_IDENT = r'(\*|:(\*|\w+):|' + IDENT + ')'
VERSPEC = IDENT + r'\*?'
RELOP = '([<>=!~]=)|[<>]'
#
# The first relop is optional - if absent, will be taken as '~='
#
BARE_CONSTRAINTS = ('(' + RELOP + r')?\s*(' + VERSPEC + ')(' + COMMA + '(' +
RELOP + r')\s*(' + VERSPEC + '))*')
DIRECT_REF = '(from\s+(?P<diref>.*))'
#
# Either the bare constraints or the bare constraints in parentheses
#
CONSTRAINTS = (r'\(\s*(?P<c1>' + BARE_CONSTRAINTS + '|' + DIRECT_REF +
r')\s*\)|(?P<c2>' + BARE_CONSTRAINTS + '\s*)')
EXTRA_LIST = EXTRA_IDENT + '(' + COMMA + EXTRA_IDENT + ')*'
EXTRAS = r'\[\s*(?P<ex>' + EXTRA_LIST + r')?\s*\]'
REQUIREMENT = ('(?P<dn>' + IDENT + r')\s*(' + EXTRAS + r'\s*)?(\s*' +
CONSTRAINTS + ')?$')
REQUIREMENT_RE = re.compile(REQUIREMENT)
#
# Used to scan through the constraints
#
RELOP_IDENT = '(?P<op>' + RELOP + r')\s*(?P<vn>' + VERSPEC + ')'
RELOP_IDENT_RE = re.compile(RELOP_IDENT)
def parse_requirement(s):
def get_constraint(m):
d = m.groupdict()
return d['op'], d['vn']
result = None
m = REQUIREMENT_RE.match(s)
if m:
d = m.groupdict()
name = d['dn']
cons = d['c1'] or d['c2']
if not d['diref']:
url = None
else:
# direct reference
cons = None
url = d['diref'].strip()
if not cons:
cons = None
constr = ''
rs = d['dn']
else:
if cons[0] not in '<>!=':
cons = '~=' + cons
iterator = RELOP_IDENT_RE.finditer(cons)
cons = [get_constraint(m) for m in iterator]
rs = '%s (%s)' % (name, ', '.join(['%s %s' % con for con in cons]))
if not d['ex']:
extras = None
else:
extras = COMMA_RE.split(d['ex'])
result = Container(name=name, constraints=cons, extras=extras,
requirement=rs, source=s, url=url)
return result
def get_resources_dests(resources_root, rules):
"""Find destinations for resources files"""
def get_rel_path(base, path):
# normalizes and returns a lstripped-/-separated path
base = base.replace(os.path.sep, '/')
path = path.replace(os.path.sep, '/')
assert path.startswith(base)
return path[len(base):].lstrip('/')
destinations = {}
for base, suffix, dest in rules:
prefix = os.path.join(resources_root, base)
for abs_base in iglob(prefix):
abs_glob = os.path.join(abs_base, suffix)
for abs_path in iglob(abs_glob):
resource_file = get_rel_path(resources_root, abs_path)
if dest is None: # remove the entry if it was here
destinations.pop(resource_file, None)
else:
rel_path = get_rel_path(abs_base, abs_path)
rel_dest = dest.replace(os.path.sep, '/').rstrip('/')
destinations[resource_file] = rel_dest + '/' + rel_path
return destinations
def in_venv():
if hasattr(sys, 'real_prefix'):
# virtualenv venvs
result = True
else:
# PEP 405 venvs
result = sys.prefix != getattr(sys, 'base_prefix', sys.prefix)
return result
def get_executable():
# The __PYVENV_LAUNCHER__ dance is apparently no longer needed, as
# changes to the stub launcher mean that sys.executable always points
# to the stub on macOS
# if sys.platform == 'darwin' and ('__PYVENV_LAUNCHER__'
# in os.environ):
# result = os.environ['__PYVENV_LAUNCHER__']
# else:
# result = sys.executable
# return result
result = os.path.normcase(sys.executable)
if not isinstance(result, text_type):
result = fsdecode(result)
return result
def proceed(prompt, allowed_chars, error_prompt=None, default=None):
p = prompt
while True:
s = raw_input(p)
p = prompt
if not s and default:
s = default
if s:
c = s[0].lower()
if c in allowed_chars:
break
if error_prompt:
p = '%c: %s\n%s' % (c, error_prompt, prompt)
return c
def extract_by_key(d, keys):
if isinstance(keys, string_types):
keys = keys.split()
result = {}
for key in keys:
if key in d:
result[key] = d[key]
return result
def read_exports(stream):
if sys.version_info[0] >= 3:
# needs to be a text stream
stream = codecs.getreader('utf-8')(stream)
# Try to load as JSON, falling back on legacy format
data = stream.read()
stream = StringIO(data)
try:
jdata = json.load(stream)
result = jdata['extensions']['python.exports']['exports']
for group, entries in result.items():
for k, v in entries.items():
s = '%s = %s' % (k, v)
entry = get_export_entry(s)
assert entry is not None
entries[k] = entry
return result
except Exception:
stream.seek(0, 0)
def read_stream(cp, stream):
if hasattr(cp, 'read_file'):
cp.read_file(stream)
else:
cp.readfp(stream)
cp = configparser.ConfigParser()
try:
read_stream(cp, stream)
except configparser.MissingSectionHeaderError:
stream.close()
data = textwrap.dedent(data)
stream = StringIO(data)
read_stream(cp, stream)
result = {}
for key in cp.sections():
result[key] = entries = {}
for name, value in cp.items(key):
s = '%s = %s' % (name, value)
entry = get_export_entry(s)
assert entry is not None
#entry.dist = self
entries[name] = entry
return result
def write_exports(exports, stream):
if sys.version_info[0] >= 3:
# needs to be a text stream
stream = codecs.getwriter('utf-8')(stream)
cp = configparser.ConfigParser()
for k, v in exports.items():
# TODO check k, v for valid values
cp.add_section(k)
for entry in v.values():
if entry.suffix is None:
s = entry.prefix
else:
s = '%s:%s' % (entry.prefix, entry.suffix)
if entry.flags:
s = '%s [%s]' % (s, ', '.join(entry.flags))
cp.set(k, entry.name, s)
cp.write(stream)
@contextlib.contextmanager
def tempdir():
td = tempfile.mkdtemp()
try:
yield td
finally:
shutil.rmtree(td)
@contextlib.contextmanager
def chdir(d):
cwd = os.getcwd()
try:
os.chdir(d)
yield
finally:
os.chdir(cwd)
@contextlib.contextmanager
def socket_timeout(seconds=15):
cto = socket.getdefaulttimeout()
try:
socket.setdefaulttimeout(seconds)
yield
finally:
socket.setdefaulttimeout(cto)
class cached_property(object):
def __init__(self, func):
self.func = func
#for attr in ('__name__', '__module__', '__doc__'):
# setattr(self, attr, getattr(func, attr, None))
def __get__(self, obj, cls=None):
if obj is None:
return self
value = self.func(obj)
object.__setattr__(obj, self.func.__name__, value)
#obj.__dict__[self.func.__name__] = value = self.func(obj)
return value
def convert_path(pathname):
"""Return 'pathname' as a name that will work on the native filesystem.
The path is split on '/' and put back together again using the current
directory separator. Needed because filenames in the setup script are
always supplied in Unix style, and have to be converted to the local
convention before we can actually use them in the filesystem. Raises
ValueError on non-Unix-ish systems if 'pathname' either starts or
ends with a slash.
"""
if os.sep == '/':
return pathname
if not pathname:
return pathname
if pathname[0] == '/':
raise ValueError("path '%s' cannot be absolute" % pathname)
if pathname[-1] == '/':
raise ValueError("path '%s' cannot end with '/'" % pathname)
paths = pathname.split('/')
while os.curdir in paths:
paths.remove(os.curdir)
if not paths:
return os.curdir
return os.path.join(*paths)
class FileOperator(object):
def __init__(self, dry_run=False):
self.dry_run = dry_run
self.ensured = set()
self._init_record()
def _init_record(self):
self.record = False
self.files_written = set()
self.dirs_created = set()
def record_as_written(self, path):
if self.record:
self.files_written.add(path)
def newer(self, source, target):
"""Tell if the target is newer than the source.
Returns true if 'source' exists and is more recently modified than
'target', or if 'source' exists and 'target' doesn't.
Returns false if both exist and 'target' is the same age or younger
than 'source'. Raise PackagingFileError if 'source' does not exist.
Note that this test is not very accurate: files created in the same
second will have the same "age".
"""
if not os.path.exists(source):
raise DistlibException("file '%r' does not exist" %
os.path.abspath(source))
if not os.path.exists(target):
return True
return os.stat(source).st_mtime > os.stat(target).st_mtime
def copy_file(self, infile, outfile, check=True):
"""Copy a file respecting dry-run and force flags.
"""
self.ensure_dir(os.path.dirname(outfile))
logger.info('Copying %s to %s', infile, outfile)
if not self.dry_run:
msg = None
if check:
if os.path.islink(outfile):
msg = '%s is a symlink' % outfile
elif os.path.exists(outfile) and not os.path.isfile(outfile):
msg = '%s is a non-regular file' % outfile
if msg:
raise ValueError(msg + ' which would be overwritten')
shutil.copyfile(infile, outfile)
self.record_as_written(outfile)
def copy_stream(self, instream, outfile, encoding=None):
assert not os.path.isdir(outfile)
self.ensure_dir(os.path.dirname(outfile))
logger.info('Copying stream %s to %s', instream, outfile)
if not self.dry_run:
if encoding is None:
outstream = open(outfile, 'wb')
else:
outstream = codecs.open(outfile, 'w', encoding=encoding)
try:
shutil.copyfileobj(instream, outstream)
finally:
outstream.close()
self.record_as_written(outfile)
def write_binary_file(self, path, data):
self.ensure_dir(os.path.dirname(path))
if not self.dry_run:
with open(path, 'wb') as f:
f.write(data)
self.record_as_written(path)
def write_text_file(self, path, data, encoding):
self.ensure_dir(os.path.dirname(path))
if not self.dry_run:
with open(path, 'wb') as f:
f.write(data.encode(encoding))
self.record_as_written(path)
def set_mode(self, bits, mask, files):
if os.name == 'posix' or (os.name == 'java' and os._name == 'posix'):
# Set the executable bits (owner, group, and world) on
# all the files specified.
for f in files:
if self.dry_run:
logger.info("changing mode of %s", f)
else:
mode = (os.stat(f).st_mode | bits) & mask
logger.info("changing mode of %s to %o", f, mode)
os.chmod(f, mode)
set_executable_mode = lambda s, f: s.set_mode(0o555, 0o7777, f)
def ensure_dir(self, path):
path = os.path.abspath(path)
if path not in self.ensured and not os.path.exists(path):
self.ensured.add(path)
d, f = os.path.split(path)
self.ensure_dir(d)
logger.info('Creating %s' % path)
if not self.dry_run:
os.mkdir(path)
if self.record:
self.dirs_created.add(path)
def byte_compile(self, path, optimize=False, force=False, prefix=None):
dpath = cache_from_source(path, not optimize)
logger.info('Byte-compiling %s to %s', path, dpath)
if not self.dry_run:
if force or self.newer(path, dpath):
if not prefix:
diagpath = None
else:
assert path.startswith(prefix)
diagpath = path[len(prefix):]
py_compile.compile(path, dpath, diagpath, True) # raise error
self.record_as_written(dpath)
return dpath
def ensure_removed(self, path):
if os.path.exists(path):
if os.path.isdir(path) and not os.path.islink(path):
logger.debug('Removing directory tree at %s', path)
if not self.dry_run:
shutil.rmtree(path)
if self.record:
if path in self.dirs_created:
self.dirs_created.remove(path)
else:
if os.path.islink(path):
s = 'link'
else:
s = 'file'
logger.debug('Removing %s %s', s, path)
if not self.dry_run:
os.remove(path)
if self.record:
if path in self.files_written:
self.files_written.remove(path)
def is_writable(self, path):
result = False
while not result:
if os.path.exists(path):
result = os.access(path, os.W_OK)
break
parent = os.path.dirname(path)
if parent == path:
break
path = parent
return result
def commit(self):
"""
Commit recorded changes, turn off recording, return
changes.
"""
assert self.record
result = self.files_written, self.dirs_created
self._init_record()
return result
def rollback(self):
if not self.dry_run:
for f in list(self.files_written):
if os.path.exists(f):
os.remove(f)
# dirs should all be empty now, except perhaps for
# __pycache__ subdirs
# reverse so that subdirs appear before their parents
dirs = sorted(self.dirs_created, reverse=True)
for d in dirs:
flist = os.listdir(d)
if flist:
assert flist == ['__pycache__']
sd = os.path.join(d, flist[0])
os.rmdir(sd)
os.rmdir(d) # should fail if non-empty
self._init_record()
def resolve(module_name, dotted_path):
if module_name in sys.modules:
mod = sys.modules[module_name]
else:
mod = __import__(module_name)
if dotted_path is None:
result = mod
else:
parts = dotted_path.split('.')
result = getattr(mod, parts.pop(0))
for p in parts:
result = getattr(result, p)
return result
class ExportEntry(object):
def __init__(self, name, prefix, suffix, flags):
self.name = name
self.prefix = prefix
self.suffix = suffix
self.flags = flags
@cached_property
def value(self):
return resolve(self.prefix, self.suffix)
def __repr__(self): # pragma: no cover
return '<ExportEntry %s = %s:%s %s>' % (self.name, self.prefix,
self.suffix, self.flags)
def __eq__(self, other):
if not isinstance(other, ExportEntry):
result = False
else:
result = (self.name == other.name and
self.prefix == other.prefix and
self.suffix == other.suffix and
self.flags == other.flags)
return result
__hash__ = object.__hash__
ENTRY_RE = re.compile(r'''(?P<name>(\w|[-.+])+)
\s*=\s*(?P<callable>(\w+)([:\.]\w+)*)
\s*(\[\s*(?P<flags>\w+(=\w+)?(,\s*\w+(=\w+)?)*)\s*\])?
''', re.VERBOSE)
def get_export_entry(specification):
m = ENTRY_RE.search(specification)
if not m:
result = None
if '[' in specification or ']' in specification:
raise DistlibException("Invalid specification "
"'%s'" % specification)
else:
d = m.groupdict()
name = d['name']
path = d['callable']
colons = path.count(':')
if colons == 0:
prefix, suffix = path, None
else:
if colons != 1:
raise DistlibException("Invalid specification "
"'%s'" % specification)
prefix, suffix = path.split(':')
flags = d['flags']
if flags is None:
if '[' in specification or ']' in specification:
raise DistlibException("Invalid specification "
"'%s'" % specification)
flags = []
else:
flags = [f.strip() for f in flags.split(',')]
result = ExportEntry(name, prefix, suffix, flags)
return result
def get_cache_base(suffix=None):
"""
Return the default base location for distlib caches. If the directory does
not exist, it is created. Use the suffix provided for the base directory,
and default to '.distlib' if it isn't provided.
On Windows, if LOCALAPPDATA is defined in the environment, then it is
assumed to be a directory, and will be the parent directory of the result.
On POSIX, and on Windows if LOCALAPPDATA is not defined, the user's home
directory - using os.expanduser('~') - will be the parent directory of
the result.
The result is just the directory '.distlib' in the parent directory as
determined above, or with the name specified with ``suffix``.
"""
if suffix is None:
suffix = '.distlib'
if os.name == 'nt' and 'LOCALAPPDATA' in os.environ:
result = os.path.expandvars('$localappdata')
else:
# Assume posix, or old Windows
result = os.path.expanduser('~')
# we use 'isdir' instead of 'exists', because we want to
# fail if there's a file with that name
if os.path.isdir(result):
usable = os.access(result, os.W_OK)
if not usable:
logger.warning('Directory exists but is not writable: %s', result)
else:
try:
os.makedirs(result)
usable = True
except OSError:
logger.warning('Unable to create %s', result, exc_info=True)
usable = False
if not usable:
result = tempfile.mkdtemp()
logger.warning('Default location unusable, using %s', result)
return os.path.join(result, suffix)
def path_to_cache_dir(path):
"""
Convert an absolute path to a directory name for use in a cache.
The algorithm used is:
#. On Windows, any ``':'`` in the drive is replaced with ``'---'``.
#. Any occurrence of ``os.sep`` is replaced with ``'--'``.
#. ``'.cache'`` is appended.
"""
d, p = os.path.splitdrive(os.path.abspath(path))
if d:
d = d.replace(':', '---')
p = p.replace(os.sep, '--')
return d + p + '.cache'
def ensure_slash(s):
if not s.endswith('/'):
return s + '/'
return s
def parse_credentials(netloc):
username = password = None
if '@' in netloc:
prefix, netloc = netloc.split('@', 1)
if ':' not in prefix:
username = prefix
else:
username, password = prefix.split(':', 1)
return username, password, netloc
def get_process_umask():
result = os.umask(0o22)
os.umask(result)
return result
def is_string_sequence(seq):
result = True
i = None
for i, s in enumerate(seq):
if not isinstance(s, string_types):
result = False
break
assert i is not None
return result
PROJECT_NAME_AND_VERSION = re.compile('([a-z0-9_]+([.-][a-z_][a-z0-9_]*)*)-'
'([a-z0-9_.+-]+)', re.I)
PYTHON_VERSION = re.compile(r'-py(\d\.?\d?)')
def split_filename(filename, project_name=None):
"""
Extract name, version, python version from a filename (no extension)
Return name, version, pyver or None
"""
result = None
pyver = None
filename = unquote(filename).replace(' ', '-')
m = PYTHON_VERSION.search(filename)
if m:
pyver = m.group(1)
filename = filename[:m.start()]
if project_name and len(filename) > len(project_name) + 1:
m = re.match(re.escape(project_name) + r'\b', filename)
if m:
n = m.end()
result = filename[:n], filename[n + 1:], pyver
if result is None:
m = PROJECT_NAME_AND_VERSION.match(filename)
if m:
result = m.group(1), m.group(3), pyver
return result
# Allow spaces in name because of legacy dists like "Twisted Core"
NAME_VERSION_RE = re.compile(r'(?P<name>[\w .-]+)\s*'
r'\(\s*(?P<ver>[^\s)]+)\)$')
def parse_name_and_version(p):
"""
A utility method used to get name and version from a string.
From e.g. a Provides-Dist value.
:param p: A value in a form 'foo (1.0)'
:return: The name and version as a tuple.
"""
m = NAME_VERSION_RE.match(p)
if not m:
raise DistlibException('Ill-formed name/version string: \'%s\'' % p)
d = m.groupdict()
return d['name'].strip().lower(), d['ver']
def get_extras(requested, available):
result = set()
requested = set(requested or [])
available = set(available or [])
if '*' in requested:
requested.remove('*')
result |= available
for r in requested:
if r == '-':
result.add(r)
elif r.startswith('-'):
unwanted = r[1:]
if unwanted not in available:
logger.warning('undeclared extra: %s' % unwanted)
if unwanted in result:
result.remove(unwanted)
else:
if r not in available:
logger.warning('undeclared extra: %s' % r)
result.add(r)
return result
#
# Extended metadata functionality
#
def _get_external_data(url):
result = {}
try:
# urlopen might fail if it runs into redirections,
# because of Python issue #13696. Fixed in locators
# using a custom redirect handler.
resp = urlopen(url)
headers = resp.info()
ct = headers.get('Content-Type')
if not ct.startswith('application/json'):
logger.debug('Unexpected response for JSON request: %s', ct)
else:
reader = codecs.getreader('utf-8')(resp)
#data = reader.read().decode('utf-8')
#result = json.loads(data)
result = json.load(reader)
except Exception as e:
logger.exception('Failed to get external data for %s: %s', url, e)
return result
_external_data_base_url = 'https://www.red-dove.com/pypi/projects/'
def get_project_data(name):
url = '%s/%s/project.json' % (name[0].upper(), name)
url = urljoin(_external_data_base_url, url)
result = _get_external_data(url)
return result
def get_package_data(name, version):
url = '%s/%s/package-%s.json' % (name[0].upper(), name, version)
url = urljoin(_external_data_base_url, url)
return _get_external_data(url)
class Cache(object):
"""
A class implementing a cache for resources that need to live in the file system
e.g. shared libraries. This class was moved from resources to here because it
could be used by other modules, e.g. the wheel module.
"""
def __init__(self, base):
"""
Initialise an instance.
:param base: The base directory where the cache should be located.
"""
# we use 'isdir' instead of 'exists', because we want to
# fail if there's a file with that name
if not os.path.isdir(base): # pragma: no cover
os.makedirs(base)
if (os.stat(base).st_mode & 0o77) != 0:
logger.warning('Directory \'%s\' is not private', base)
self.base = os.path.abspath(os.path.normpath(base))
def prefix_to_dir(self, prefix):
"""
Converts a resource prefix to a directory name in the cache.
"""
return path_to_cache_dir(prefix)
def clear(self):
"""
Clear the cache.
"""
not_removed = []
for fn in os.listdir(self.base):
fn = os.path.join(self.base, fn)
try:
if os.path.islink(fn) or os.path.isfile(fn):
os.remove(fn)
elif os.path.isdir(fn):
shutil.rmtree(fn)
except Exception:
not_removed.append(fn)
return not_removed
class EventMixin(object):
"""
A very simple publish/subscribe system.
"""
def __init__(self):
self._subscribers = {}
def add(self, event, subscriber, append=True):
"""
Add a subscriber for an event.
:param event: The name of an event.
:param subscriber: The subscriber to be added (and called when the
event is published).
:param append: Whether to append or prepend the subscriber to an
existing subscriber list for the event.
"""
subs = self._subscribers
if event not in subs:
subs[event] = deque([subscriber])
else:
sq = subs[event]
if append:
sq.append(subscriber)
else:
sq.appendleft(subscriber)
def remove(self, event, subscriber):
"""
Remove a subscriber for an event.
:param event: The name of an event.
:param subscriber: The subscriber to be removed.
"""
subs = self._subscribers
if event not in subs:
raise ValueError('No subscribers: %r' % event)
subs[event].remove(subscriber)
def get_subscribers(self, event):
"""
Return an iterator for the subscribers for an event.
:param event: The event to return subscribers for.
"""
return iter(self._subscribers.get(event, ()))
def publish(self, event, *args, **kwargs):
"""
Publish a event and return a list of values returned by its
subscribers.
:param event: The event to publish.
:param args: The positional arguments to pass to the event's
subscribers.
:param kwargs: The keyword arguments to pass to the event's
subscribers.
"""
result = []
for subscriber in self.get_subscribers(event):
try:
value = subscriber(event, *args, **kwargs)
except Exception:
logger.exception('Exception during event publication')
value = None
result.append(value)
logger.debug('publish %s: args = %s, kwargs = %s, result = %s',
event, args, kwargs, result)
return result
#
# Simple sequencing
#
class Sequencer(object):
def __init__(self):
self._preds = {}
self._succs = {}
self._nodes = set() # nodes with no preds/succs
def add_node(self, node):
self._nodes.add(node)
def remove_node(self, node, edges=False):
if node in self._nodes:
self._nodes.remove(node)
if edges:
for p in set(self._preds.get(node, ())):
self.remove(p, node)
for s in set(self._succs.get(node, ())):
self.remove(node, s)
# Remove empties
for k, v in list(self._preds.items()):
if not v:
del self._preds[k]
for k, v in list(self._succs.items()):
if not v:
del self._succs[k]
def add(self, pred, succ):
assert pred != succ
self._preds.setdefault(succ, set()).add(pred)
self._succs.setdefault(pred, set()).add(succ)
def remove(self, pred, succ):
assert pred != succ
try:
preds = self._preds[succ]
succs = self._succs[pred]
except KeyError: # pragma: no cover
raise ValueError('%r not a successor of anything' % succ)
try:
preds.remove(pred)
succs.remove(succ)
except KeyError: # pragma: no cover
raise ValueError('%r not a successor of %r' % (succ, pred))
def is_step(self, step):
return (step in self._preds or step in self._succs or
step in self._nodes)
def get_steps(self, final):
if not self.is_step(final):
raise ValueError('Unknown: %r' % final)
result = []
todo = []
seen = set()
todo.append(final)
while todo:
step = todo.pop(0)
if step in seen:
# if a step was already seen,
# move it to the end (so it will appear earlier
# when reversed on return) ... but not for the
# final step, as that would be confusing for
# users
if step != final:
result.remove(step)
result.append(step)
else:
seen.add(step)
result.append(step)
preds = self._preds.get(step, ())
todo.extend(preds)
return reversed(result)
@property
def strong_connections(self):
#http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
index_counter = [0]
stack = []
lowlinks = {}
index = {}
result = []
graph = self._succs
def strongconnect(node):
# set the depth index for this node to the smallest unused index
index[node] = index_counter[0]
lowlinks[node] = index_counter[0]
index_counter[0] += 1
stack.append(node)
# Consider successors
try:
successors = graph[node]
except Exception:
successors = []
for successor in successors:
if successor not in lowlinks:
# Successor has not yet been visited
strongconnect(successor)
lowlinks[node] = min(lowlinks[node],lowlinks[successor])
elif successor in stack:
# the successor is in the stack and hence in the current
# strongly connected component (SCC)
lowlinks[node] = min(lowlinks[node],index[successor])
# If `node` is a root node, pop the stack and generate an SCC
if lowlinks[node] == index[node]:
connected_component = []
while True:
successor = stack.pop()
connected_component.append(successor)
if successor == node: break
component = tuple(connected_component)
# storing the result
result.append(component)
for node in graph:
if node not in lowlinks:
strongconnect(node)
return result
@property
def dot(self):
result = ['digraph G {']
for succ in self._preds:
preds = self._preds[succ]
for pred in preds:
result.append(' %s -> %s;' % (pred, succ))
for node in self._nodes:
result.append(' %s;' % node)
result.append('}')
return '\n'.join(result)
#
# Unarchiving functionality for zip, tar, tgz, tbz, whl
#
ARCHIVE_EXTENSIONS = ('.tar.gz', '.tar.bz2', '.tar', '.zip',
'.tgz', '.tbz', '.whl')
def unarchive(archive_filename, dest_dir, format=None, check=True):
def check_path(path):
if not isinstance(path, text_type):
path = path.decode('utf-8')
p = os.path.abspath(os.path.join(dest_dir, path))
if not p.startswith(dest_dir) or p[plen] != os.sep:
raise ValueError('path outside destination: %r' % p)
dest_dir = os.path.abspath(dest_dir)
plen = len(dest_dir)
archive = None
if format is None:
if archive_filename.endswith(('.zip', '.whl')):
format = 'zip'
elif archive_filename.endswith(('.tar.gz', '.tgz')):
format = 'tgz'
mode = 'r:gz'
elif archive_filename.endswith(('.tar.bz2', '.tbz')):
format = 'tbz'
mode = 'r:bz2'
elif archive_filename.endswith('.tar'):
format = 'tar'
mode = 'r'
else: # pragma: no cover
raise ValueError('Unknown format for %r' % archive_filename)
try:
if format == 'zip':
archive = ZipFile(archive_filename, 'r')
if check:
names = archive.namelist()
for name in names:
check_path(name)
else:
archive = tarfile.open(archive_filename, mode)
if check:
names = archive.getnames()
for name in names:
check_path(name)
if format != 'zip' and sys.version_info[0] < 3:
# See Python issue 17153. If the dest path contains Unicode,
# tarfile extraction fails on Python 2.x if a member path name
# contains non-ASCII characters - it leads to an implicit
# bytes -> unicode conversion using ASCII to decode.
for tarinfo in archive.getmembers():
if not isinstance(tarinfo.name, text_type):
tarinfo.name = tarinfo.name.decode('utf-8')
# Limit extraction of dangerous items, if this Python
# allows it easily. If not, just trust the input.
# See: https://docs.python.org/3/library/tarfile.html#extraction-filters
def extraction_filter(member, path):
"""Run tarfile.tar_fillter, but raise the expected ValueError"""
# This is only called if the current Python has tarfile filters
try:
return tarfile.tar_filter(member, path)
except tarfile.FilterError as exc:
raise ValueError(str(exc))
archive.extraction_filter = extraction_filter
archive.extractall(dest_dir)
finally:
if archive:
archive.close()
def zip_dir(directory):
"""zip a directory tree into a BytesIO object"""
result = io.BytesIO()
dlen = len(directory)
with ZipFile(result, "w") as zf:
for root, dirs, files in os.walk(directory):
for name in files:
full = os.path.join(root, name)
rel = root[dlen:]
dest = os.path.join(rel, name)
zf.write(full, dest)
return result
#
# Simple progress bar
#
UNITS = ('', 'K', 'M', 'G','T','P')
class Progress(object):
unknown = 'UNKNOWN'
def __init__(self, minval=0, maxval=100):
assert maxval is None or maxval >= minval
self.min = self.cur = minval
self.max = maxval
self.started = None
self.elapsed = 0
self.done = False
def update(self, curval):
assert self.min <= curval
assert self.max is None or curval <= self.max
self.cur = curval
now = time.time()
if self.started is None:
self.started = now
else:
self.elapsed = now - self.started
def increment(self, incr):
assert incr >= 0
self.update(self.cur + incr)
def start(self):
self.update(self.min)
return self
def stop(self):
if self.max is not None:
self.update(self.max)
self.done = True
@property
def maximum(self):
return self.unknown if self.max is None else self.max
@property
def percentage(self):
if self.done:
result = '100 %'
elif self.max is None:
result = ' ?? %'
else:
v = 100.0 * (self.cur - self.min) / (self.max - self.min)
result = '%3d %%' % v
return result
def format_duration(self, duration):
if (duration <= 0) and self.max is None or self.cur == self.min:
result = '??:??:??'
#elif duration < 1:
# result = '--:--:--'
else:
result = time.strftime('%H:%M:%S', time.gmtime(duration))
return result
@property
def ETA(self):
if self.done:
prefix = 'Done'
t = self.elapsed
#import pdb; pdb.set_trace()
else:
prefix = 'ETA '
if self.max is None:
t = -1
elif self.elapsed == 0 or (self.cur == self.min):
t = 0
else:
#import pdb; pdb.set_trace()
t = float(self.max - self.min)
t /= self.cur - self.min
t = (t - 1) * self.elapsed
return '%s: %s' % (prefix, self.format_duration(t))
@property
def speed(self):
if self.elapsed == 0:
result = 0.0
else:
result = (self.cur - self.min) / self.elapsed
for unit in UNITS:
if result < 1000:
break
result /= 1000.0
return '%d %sB/s' % (result, unit)
#
# Glob functionality
#
RICH_GLOB = re.compile(r'\{([^}]*)\}')
_CHECK_RECURSIVE_GLOB = re.compile(r'[^/\\,{]\*\*|\*\*[^/\\,}]')
_CHECK_MISMATCH_SET = re.compile(r'^[^{]*\}|\{[^}]*$')
def iglob(path_glob):
"""Extended globbing function that supports ** and {opt1,opt2,opt3}."""
if _CHECK_RECURSIVE_GLOB.search(path_glob):
msg = """invalid glob %r: recursive glob "**" must be used alone"""
raise ValueError(msg % path_glob)
if _CHECK_MISMATCH_SET.search(path_glob):
msg = """invalid glob %r: mismatching set marker '{' or '}'"""
raise ValueError(msg % path_glob)
return _iglob(path_glob)
def _iglob(path_glob):
rich_path_glob = RICH_GLOB.split(path_glob, 1)
if len(rich_path_glob) > 1:
assert len(rich_path_glob) == 3, rich_path_glob
prefix, set, suffix = rich_path_glob
for item in set.split(','):
for path in _iglob(''.join((prefix, item, suffix))):
yield path
else:
if '**' not in path_glob:
for item in std_iglob(path_glob):
yield item
else:
prefix, radical = path_glob.split('**', 1)
if prefix == '':
prefix = '.'
if radical == '':
radical = '*'
else:
# we support both
radical = radical.lstrip('/')
radical = radical.lstrip('\\')
for path, dir, files in os.walk(prefix):
path = os.path.normpath(path)
for fn in _iglob(os.path.join(path, radical)):
yield fn
if ssl:
from .compat import (HTTPSHandler as BaseHTTPSHandler, match_hostname,
CertificateError)
#
# HTTPSConnection which verifies certificates/matches domains
#
class HTTPSConnection(httplib.HTTPSConnection):
ca_certs = None # set this to the path to the certs file (.pem)
check_domain = True # only used if ca_certs is not None
# noinspection PyPropertyAccess
def connect(self):
sock = socket.create_connection((self.host, self.port), self.timeout)
if getattr(self, '_tunnel_host', False):
self.sock = sock
self._tunnel()
if not hasattr(ssl, 'SSLContext'):
# For 2.x
if self.ca_certs:
cert_reqs = ssl.CERT_REQUIRED
else:
cert_reqs = ssl.CERT_NONE
self.sock = ssl.wrap_socket(sock, self.key_file, self.cert_file,
cert_reqs=cert_reqs,
ssl_version=ssl.PROTOCOL_SSLv23,
ca_certs=self.ca_certs)
else: # pragma: no cover
context = ssl.SSLContext(ssl.PROTOCOL_SSLv23)
context.options |= ssl.OP_NO_SSLv2
if self.cert_file:
context.load_cert_chain(self.cert_file, self.key_file)
kwargs = {}
if self.ca_certs:
context.verify_mode = ssl.CERT_REQUIRED
context.load_verify_locations(cafile=self.ca_certs)
if getattr(ssl, 'HAS_SNI', False):
kwargs['server_hostname'] = self.host
self.sock = context.wrap_socket(sock, **kwargs)
if self.ca_certs and self.check_domain:
try:
match_hostname(self.sock.getpeercert(), self.host)
logger.debug('Host verified: %s', self.host)
except CertificateError: # pragma: no cover
self.sock.shutdown(socket.SHUT_RDWR)
self.sock.close()
raise
class HTTPSHandler(BaseHTTPSHandler):
def __init__(self, ca_certs, check_domain=True):
BaseHTTPSHandler.__init__(self)
self.ca_certs = ca_certs
self.check_domain = check_domain
def _conn_maker(self, *args, **kwargs):
"""
This is called to create a connection instance. Normally you'd
pass a connection class to do_open, but it doesn't actually check for
a class, and just expects a callable. As long as we behave just as a
constructor would have, we should be OK. If it ever changes so that
we *must* pass a class, we'll create an UnsafeHTTPSConnection class
which just sets check_domain to False in the class definition, and
choose which one to pass to do_open.
"""
result = HTTPSConnection(*args, **kwargs)
if self.ca_certs:
result.ca_certs = self.ca_certs
result.check_domain = self.check_domain
return result
def https_open(self, req):
try:
return self.do_open(self._conn_maker, req)
except URLError as e:
if 'certificate verify failed' in str(e.reason):
raise CertificateError('Unable to verify server certificate '
'for %s' % req.host)
else:
raise
#
# To prevent against mixing HTTP traffic with HTTPS (examples: A Man-In-The-
# Middle proxy using HTTP listens on port 443, or an index mistakenly serves
# HTML containing a http://xyz link when it should be https://xyz),
# you can use the following handler class, which does not allow HTTP traffic.
#
# It works by inheriting from HTTPHandler - so build_opener won't add a
# handler for HTTP itself.
#
class HTTPSOnlyHandler(HTTPSHandler, HTTPHandler):
def http_open(self, req):
raise URLError('Unexpected HTTP request on what should be a secure '
'connection: %s' % req)
#
# XML-RPC with timeouts
#
_ver_info = sys.version_info[:2]
if _ver_info == (2, 6):
class HTTP(httplib.HTTP):
def __init__(self, host='', port=None, **kwargs):
if port == 0: # 0 means use port 0, not the default port
port = None
self._setup(self._connection_class(host, port, **kwargs))
if ssl:
class HTTPS(httplib.HTTPS):
def __init__(self, host='', port=None, **kwargs):
if port == 0: # 0 means use port 0, not the default port
port = None
self._setup(self._connection_class(host, port, **kwargs))
class Transport(xmlrpclib.Transport):
def __init__(self, timeout, use_datetime=0):
self.timeout = timeout
xmlrpclib.Transport.__init__(self, use_datetime)
def make_connection(self, host):
h, eh, x509 = self.get_host_info(host)
if _ver_info == (2, 6):
result = HTTP(h, timeout=self.timeout)
else:
if not self._connection or host != self._connection[0]:
self._extra_headers = eh
self._connection = host, httplib.HTTPConnection(h)
result = self._connection[1]
return result
if ssl:
class SafeTransport(xmlrpclib.SafeTransport):
def __init__(self, timeout, use_datetime=0):
self.timeout = timeout
xmlrpclib.SafeTransport.__init__(self, use_datetime)
def make_connection(self, host):
h, eh, kwargs = self.get_host_info(host)
if not kwargs:
kwargs = {}
kwargs['timeout'] = self.timeout
if _ver_info == (2, 6):
result = HTTPS(host, None, **kwargs)
else:
if not self._connection or host != self._connection[0]:
self._extra_headers = eh
self._connection = host, httplib.HTTPSConnection(h, None,
**kwargs)
result = self._connection[1]
return result
class ServerProxy(xmlrpclib.ServerProxy):
def __init__(self, uri, **kwargs):
self.timeout = timeout = kwargs.pop('timeout', None)
# The above classes only come into play if a timeout
# is specified
if timeout is not None:
scheme, _ = splittype(uri)
use_datetime = kwargs.get('use_datetime', 0)
if scheme == 'https':
tcls = SafeTransport
else:
tcls = Transport
kwargs['transport'] = t = tcls(timeout, use_datetime=use_datetime)
self.transport = t
xmlrpclib.ServerProxy.__init__(self, uri, **kwargs)
#
# CSV functionality. This is provided because on 2.x, the csv module can't
# handle Unicode. However, we need to deal with Unicode in e.g. RECORD files.
#
def _csv_open(fn, mode, **kwargs):
if sys.version_info[0] < 3:
mode += 'b'
else:
kwargs['newline'] = ''
return open(fn, mode, **kwargs)
class CSVBase(object):
defaults = {
'delimiter': str(','), # The strs are used because we need native
'quotechar': str('"'), # str in the csv API (2.x won't take
'lineterminator': str('\n') # Unicode)
}
def __enter__(self):
return self
def __exit__(self, *exc_info):
self.stream.close()
class CSVReader(CSVBase):
def __init__(self, **kwargs):
if 'stream' in kwargs:
stream = kwargs['stream']
if sys.version_info[0] >= 3:
# needs to be a text stream
stream = codecs.getreader('utf-8')(stream)
self.stream = stream
else:
self.stream = _csv_open(kwargs['path'], 'r')
self.reader = csv.reader(self.stream, **self.defaults)
def __iter__(self):
return self
def next(self):
result = next(self.reader)
if sys.version_info[0] < 3:
for i, item in enumerate(result):
if not isinstance(item, text_type):
result[i] = item.decode('utf-8')
return result
__next__ = next
class CSVWriter(CSVBase):
def __init__(self, fn, **kwargs):
self.stream = _csv_open(fn, 'w')
self.writer = csv.writer(self.stream, **self.defaults)
def writerow(self, row):
if sys.version_info[0] < 3:
r = []
for item in row:
if isinstance(item, text_type):
item = item.encode('utf-8')
r.append(item)
row = r
self.writer.writerow(row)
#
# Configurator functionality
#
class Configurator(BaseConfigurator):
value_converters = dict(BaseConfigurator.value_converters)
value_converters['inc'] = 'inc_convert'
def __init__(self, config, base=None):
super(Configurator, self).__init__(config)
self.base = base or os.getcwd()
def configure_custom(self, config):
def convert(o):
if isinstance(o, (list, tuple)):
result = type(o)([convert(i) for i in o])
elif isinstance(o, dict):
if '()' in o:
result = self.configure_custom(o)
else:
result = {}
for k in o:
result[k] = convert(o[k])
else:
result = self.convert(o)
return result
c = config.pop('()')
if not callable(c):
c = self.resolve(c)
props = config.pop('.', None)
# Check for valid identifiers
args = config.pop('[]', ())
if args:
args = tuple([convert(o) for o in args])
items = [(k, convert(config[k])) for k in config if valid_ident(k)]
kwargs = dict(items)
result = c(*args, **kwargs)
if props:
for n, v in props.items():
setattr(result, n, convert(v))
return result
def __getitem__(self, key):
result = self.config[key]
if isinstance(result, dict) and '()' in result:
self.config[key] = result = self.configure_custom(result)
return result
def inc_convert(self, value):
"""Default converter for the inc:// protocol."""
if not os.path.isabs(value):
value = os.path.join(self.base, value)
with codecs.open(value, 'r', encoding='utf-8') as f:
result = json.load(f)
return result
#
# Mixin for running subprocesses and capturing their output
#
class SubprocessMixin(object):
def __init__(self, verbose=False, progress=None):
self.verbose = verbose
self.progress = progress
def reader(self, stream, context):
"""
Read lines from a subprocess' output stream and either pass to a progress
callable (if specified) or write progress information to sys.stderr.
"""
progress = self.progress
verbose = self.verbose
while True:
s = stream.readline()
if not s:
break
if progress is not None:
progress(s, context)
else:
if not verbose:
sys.stderr.write('.')
else:
sys.stderr.write(s.decode('utf-8'))
sys.stderr.flush()
stream.close()
def run_command(self, cmd, **kwargs):
p = subprocess.Popen(cmd, stdout=subprocess.PIPE,
stderr=subprocess.PIPE, **kwargs)
t1 = threading.Thread(target=self.reader, args=(p.stdout, 'stdout'))
t1.start()
t2 = threading.Thread(target=self.reader, args=(p.stderr, 'stderr'))
t2.start()
p.wait()
t1.join()
t2.join()
if self.progress is not None:
self.progress('done.', 'main')
elif self.verbose:
sys.stderr.write('done.\n')
return p
def normalize_name(name):
"""Normalize a python package name a la PEP 503"""
# https://www.python.org/dev/peps/pep-0503/#normalized-names
return re.sub('[-_.]+', '-', name).lower()
pip/_vendor/distlib/__init__.py 0000644 00000001105 14751155150 0012534 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012-2016 Vinay Sajip.
# Licensed to the Python Software Foundation under a contributor agreement.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
import logging
__version__ = '0.2.4'
class DistlibException(Exception):
pass
try:
from logging import NullHandler
except ImportError: # pragma: no cover
class NullHandler(logging.Handler):
def handle(self, record): pass
def emit(self, record): pass
def createLock(self): self.lock = None
logger = logging.getLogger(__name__)
logger.addHandler(NullHandler())
pip/_vendor/distlib/metadata.py 0000644 00000113661 14751155150 0012570 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012 The Python Software Foundation.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
"""Implementation of the Metadata for Python packages PEPs.
Supports all metadata formats (1.0, 1.1, 1.2, and 2.0 experimental).
"""
from __future__ import unicode_literals
import codecs
from email import message_from_file
import json
import logging
import re
from . import DistlibException, __version__
from .compat import StringIO, string_types, text_type
from .markers import interpret
from .util import extract_by_key, get_extras
from .version import get_scheme, PEP440_VERSION_RE
logger = logging.getLogger(__name__)
class MetadataMissingError(DistlibException):
"""A required metadata is missing"""
class MetadataConflictError(DistlibException):
"""Attempt to read or write metadata fields that are conflictual."""
class MetadataUnrecognizedVersionError(DistlibException):
"""Unknown metadata version number."""
class MetadataInvalidError(DistlibException):
"""A metadata value is invalid"""
# public API of this module
__all__ = ['Metadata', 'PKG_INFO_ENCODING', 'PKG_INFO_PREFERRED_VERSION']
# Encoding used for the PKG-INFO files
PKG_INFO_ENCODING = 'utf-8'
# preferred version. Hopefully will be changed
# to 1.2 once PEP 345 is supported everywhere
PKG_INFO_PREFERRED_VERSION = '1.1'
_LINE_PREFIX_1_2 = re.compile('\n \|')
_LINE_PREFIX_PRE_1_2 = re.compile('\n ')
_241_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
'Summary', 'Description',
'Keywords', 'Home-page', 'Author', 'Author-email',
'License')
_314_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
'Supported-Platform', 'Summary', 'Description',
'Keywords', 'Home-page', 'Author', 'Author-email',
'License', 'Classifier', 'Download-URL', 'Obsoletes',
'Provides', 'Requires')
_314_MARKERS = ('Obsoletes', 'Provides', 'Requires', 'Classifier',
'Download-URL')
_345_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
'Supported-Platform', 'Summary', 'Description',
'Keywords', 'Home-page', 'Author', 'Author-email',
'Maintainer', 'Maintainer-email', 'License',
'Classifier', 'Download-URL', 'Obsoletes-Dist',
'Project-URL', 'Provides-Dist', 'Requires-Dist',
'Requires-Python', 'Requires-External')
_345_MARKERS = ('Provides-Dist', 'Requires-Dist', 'Requires-Python',
'Obsoletes-Dist', 'Requires-External', 'Maintainer',
'Maintainer-email', 'Project-URL')
_426_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
'Supported-Platform', 'Summary', 'Description',
'Keywords', 'Home-page', 'Author', 'Author-email',
'Maintainer', 'Maintainer-email', 'License',
'Classifier', 'Download-URL', 'Obsoletes-Dist',
'Project-URL', 'Provides-Dist', 'Requires-Dist',
'Requires-Python', 'Requires-External', 'Private-Version',
'Obsoleted-By', 'Setup-Requires-Dist', 'Extension',
'Provides-Extra')
_426_MARKERS = ('Private-Version', 'Provides-Extra', 'Obsoleted-By',
'Setup-Requires-Dist', 'Extension')
_ALL_FIELDS = set()
_ALL_FIELDS.update(_241_FIELDS)
_ALL_FIELDS.update(_314_FIELDS)
_ALL_FIELDS.update(_345_FIELDS)
_ALL_FIELDS.update(_426_FIELDS)
EXTRA_RE = re.compile(r'''extra\s*==\s*("([^"]+)"|'([^']+)')''')
def _version2fieldlist(version):
if version == '1.0':
return _241_FIELDS
elif version == '1.1':
return _314_FIELDS
elif version == '1.2':
return _345_FIELDS
elif version == '2.0':
return _426_FIELDS
raise MetadataUnrecognizedVersionError(version)
def _best_version(fields):
"""Detect the best version depending on the fields used."""
def _has_marker(keys, markers):
for marker in markers:
if marker in keys:
return True
return False
keys = []
for key, value in fields.items():
if value in ([], 'UNKNOWN', None):
continue
keys.append(key)
possible_versions = ['1.0', '1.1', '1.2', '2.0']
# first let's try to see if a field is not part of one of the version
for key in keys:
if key not in _241_FIELDS and '1.0' in possible_versions:
possible_versions.remove('1.0')
if key not in _314_FIELDS and '1.1' in possible_versions:
possible_versions.remove('1.1')
if key not in _345_FIELDS and '1.2' in possible_versions:
possible_versions.remove('1.2')
if key not in _426_FIELDS and '2.0' in possible_versions:
possible_versions.remove('2.0')
# possible_version contains qualified versions
if len(possible_versions) == 1:
return possible_versions[0] # found !
elif len(possible_versions) == 0:
raise MetadataConflictError('Unknown metadata set')
# let's see if one unique marker is found
is_1_1 = '1.1' in possible_versions and _has_marker(keys, _314_MARKERS)
is_1_2 = '1.2' in possible_versions and _has_marker(keys, _345_MARKERS)
is_2_0 = '2.0' in possible_versions and _has_marker(keys, _426_MARKERS)
if int(is_1_1) + int(is_1_2) + int(is_2_0) > 1:
raise MetadataConflictError('You used incompatible 1.1/1.2/2.0 fields')
# we have the choice, 1.0, or 1.2, or 2.0
# - 1.0 has a broken Summary field but works with all tools
# - 1.1 is to avoid
# - 1.2 fixes Summary but has little adoption
# - 2.0 adds more features and is very new
if not is_1_1 and not is_1_2 and not is_2_0:
# we couldn't find any specific marker
if PKG_INFO_PREFERRED_VERSION in possible_versions:
return PKG_INFO_PREFERRED_VERSION
if is_1_1:
return '1.1'
if is_1_2:
return '1.2'
return '2.0'
_ATTR2FIELD = {
'metadata_version': 'Metadata-Version',
'name': 'Name',
'version': 'Version',
'platform': 'Platform',
'supported_platform': 'Supported-Platform',
'summary': 'Summary',
'description': 'Description',
'keywords': 'Keywords',
'home_page': 'Home-page',
'author': 'Author',
'author_email': 'Author-email',
'maintainer': 'Maintainer',
'maintainer_email': 'Maintainer-email',
'license': 'License',
'classifier': 'Classifier',
'download_url': 'Download-URL',
'obsoletes_dist': 'Obsoletes-Dist',
'provides_dist': 'Provides-Dist',
'requires_dist': 'Requires-Dist',
'setup_requires_dist': 'Setup-Requires-Dist',
'requires_python': 'Requires-Python',
'requires_external': 'Requires-External',
'requires': 'Requires',
'provides': 'Provides',
'obsoletes': 'Obsoletes',
'project_url': 'Project-URL',
'private_version': 'Private-Version',
'obsoleted_by': 'Obsoleted-By',
'extension': 'Extension',
'provides_extra': 'Provides-Extra',
}
_PREDICATE_FIELDS = ('Requires-Dist', 'Obsoletes-Dist', 'Provides-Dist')
_VERSIONS_FIELDS = ('Requires-Python',)
_VERSION_FIELDS = ('Version',)
_LISTFIELDS = ('Platform', 'Classifier', 'Obsoletes',
'Requires', 'Provides', 'Obsoletes-Dist',
'Provides-Dist', 'Requires-Dist', 'Requires-External',
'Project-URL', 'Supported-Platform', 'Setup-Requires-Dist',
'Provides-Extra', 'Extension')
_LISTTUPLEFIELDS = ('Project-URL',)
_ELEMENTSFIELD = ('Keywords',)
_UNICODEFIELDS = ('Author', 'Maintainer', 'Summary', 'Description')
_MISSING = object()
_FILESAFE = re.compile('[^A-Za-z0-9.]+')
def _get_name_and_version(name, version, for_filename=False):
"""Return the distribution name with version.
If for_filename is true, return a filename-escaped form."""
if for_filename:
# For both name and version any runs of non-alphanumeric or '.'
# characters are replaced with a single '-'. Additionally any
# spaces in the version string become '.'
name = _FILESAFE.sub('-', name)
version = _FILESAFE.sub('-', version.replace(' ', '.'))
return '%s-%s' % (name, version)
class LegacyMetadata(object):
"""The legacy metadata of a release.
Supports versions 1.0, 1.1 and 1.2 (auto-detected). You can
instantiate the class with one of these arguments (or none):
- *path*, the path to a metadata file
- *fileobj* give a file-like object with metadata as content
- *mapping* is a dict-like object
- *scheme* is a version scheme name
"""
# TODO document the mapping API and UNKNOWN default key
def __init__(self, path=None, fileobj=None, mapping=None,
scheme='default'):
if [path, fileobj, mapping].count(None) < 2:
raise TypeError('path, fileobj and mapping are exclusive')
self._fields = {}
self.requires_files = []
self._dependencies = None
self.scheme = scheme
if path is not None:
self.read(path)
elif fileobj is not None:
self.read_file(fileobj)
elif mapping is not None:
self.update(mapping)
self.set_metadata_version()
def set_metadata_version(self):
self._fields['Metadata-Version'] = _best_version(self._fields)
def _write_field(self, fileobj, name, value):
fileobj.write('%s: %s\n' % (name, value))
def __getitem__(self, name):
return self.get(name)
def __setitem__(self, name, value):
return self.set(name, value)
def __delitem__(self, name):
field_name = self._convert_name(name)
try:
del self._fields[field_name]
except KeyError:
raise KeyError(name)
def __contains__(self, name):
return (name in self._fields or
self._convert_name(name) in self._fields)
def _convert_name(self, name):
if name in _ALL_FIELDS:
return name
name = name.replace('-', '_').lower()
return _ATTR2FIELD.get(name, name)
def _default_value(self, name):
if name in _LISTFIELDS or name in _ELEMENTSFIELD:
return []
return 'UNKNOWN'
def _remove_line_prefix(self, value):
if self.metadata_version in ('1.0', '1.1'):
return _LINE_PREFIX_PRE_1_2.sub('\n', value)
else:
return _LINE_PREFIX_1_2.sub('\n', value)
def __getattr__(self, name):
if name in _ATTR2FIELD:
return self[name]
raise AttributeError(name)
#
# Public API
#
# dependencies = property(_get_dependencies, _set_dependencies)
def get_fullname(self, filesafe=False):
"""Return the distribution name with version.
If filesafe is true, return a filename-escaped form."""
return _get_name_and_version(self['Name'], self['Version'], filesafe)
def is_field(self, name):
"""return True if name is a valid metadata key"""
name = self._convert_name(name)
return name in _ALL_FIELDS
def is_multi_field(self, name):
name = self._convert_name(name)
return name in _LISTFIELDS
def read(self, filepath):
"""Read the metadata values from a file path."""
fp = codecs.open(filepath, 'r', encoding='utf-8')
try:
self.read_file(fp)
finally:
fp.close()
def read_file(self, fileob):
"""Read the metadata values from a file object."""
msg = message_from_file(fileob)
self._fields['Metadata-Version'] = msg['metadata-version']
# When reading, get all the fields we can
for field in _ALL_FIELDS:
if field not in msg:
continue
if field in _LISTFIELDS:
# we can have multiple lines
values = msg.get_all(field)
if field in _LISTTUPLEFIELDS and values is not None:
values = [tuple(value.split(',')) for value in values]
self.set(field, values)
else:
# single line
value = msg[field]
if value is not None and value != 'UNKNOWN':
self.set(field, value)
self.set_metadata_version()
def write(self, filepath, skip_unknown=False):
"""Write the metadata fields to filepath."""
fp = codecs.open(filepath, 'w', encoding='utf-8')
try:
self.write_file(fp, skip_unknown)
finally:
fp.close()
def write_file(self, fileobject, skip_unknown=False):
"""Write the PKG-INFO format data to a file object."""
self.set_metadata_version()
for field in _version2fieldlist(self['Metadata-Version']):
values = self.get(field)
if skip_unknown and values in ('UNKNOWN', [], ['UNKNOWN']):
continue
if field in _ELEMENTSFIELD:
self._write_field(fileobject, field, ','.join(values))
continue
if field not in _LISTFIELDS:
if field == 'Description':
if self.metadata_version in ('1.0', '1.1'):
values = values.replace('\n', '\n ')
else:
values = values.replace('\n', '\n |')
values = [values]
if field in _LISTTUPLEFIELDS:
values = [','.join(value) for value in values]
for value in values:
self._write_field(fileobject, field, value)
def update(self, other=None, **kwargs):
"""Set metadata values from the given iterable `other` and kwargs.
Behavior is like `dict.update`: If `other` has a ``keys`` method,
they are looped over and ``self[key]`` is assigned ``other[key]``.
Else, ``other`` is an iterable of ``(key, value)`` iterables.
Keys that don't match a metadata field or that have an empty value are
dropped.
"""
def _set(key, value):
if key in _ATTR2FIELD and value:
self.set(self._convert_name(key), value)
if not other:
# other is None or empty container
pass
elif hasattr(other, 'keys'):
for k in other.keys():
_set(k, other[k])
else:
for k, v in other:
_set(k, v)
if kwargs:
for k, v in kwargs.items():
_set(k, v)
def set(self, name, value):
"""Control then set a metadata field."""
name = self._convert_name(name)
if ((name in _ELEMENTSFIELD or name == 'Platform') and
not isinstance(value, (list, tuple))):
if isinstance(value, string_types):
value = [v.strip() for v in value.split(',')]
else:
value = []
elif (name in _LISTFIELDS and
not isinstance(value, (list, tuple))):
if isinstance(value, string_types):
value = [value]
else:
value = []
if logger.isEnabledFor(logging.WARNING):
project_name = self['Name']
scheme = get_scheme(self.scheme)
if name in _PREDICATE_FIELDS and value is not None:
for v in value:
# check that the values are valid
if not scheme.is_valid_matcher(v.split(';')[0]):
logger.warning(
"'%s': '%s' is not valid (field '%s')",
project_name, v, name)
# FIXME this rejects UNKNOWN, is that right?
elif name in _VERSIONS_FIELDS and value is not None:
if not scheme.is_valid_constraint_list(value):
logger.warning("'%s': '%s' is not a valid version (field '%s')",
project_name, value, name)
elif name in _VERSION_FIELDS and value is not None:
if not scheme.is_valid_version(value):
logger.warning("'%s': '%s' is not a valid version (field '%s')",
project_name, value, name)
if name in _UNICODEFIELDS:
if name == 'Description':
value = self._remove_line_prefix(value)
self._fields[name] = value
def get(self, name, default=_MISSING):
"""Get a metadata field."""
name = self._convert_name(name)
if name not in self._fields:
if default is _MISSING:
default = self._default_value(name)
return default
if name in _UNICODEFIELDS:
value = self._fields[name]
return value
elif name in _LISTFIELDS:
value = self._fields[name]
if value is None:
return []
res = []
for val in value:
if name not in _LISTTUPLEFIELDS:
res.append(val)
else:
# That's for Project-URL
res.append((val[0], val[1]))
return res
elif name in _ELEMENTSFIELD:
value = self._fields[name]
if isinstance(value, string_types):
return value.split(',')
return self._fields[name]
def check(self, strict=False):
"""Check if the metadata is compliant. If strict is True then raise if
no Name or Version are provided"""
self.set_metadata_version()
# XXX should check the versions (if the file was loaded)
missing, warnings = [], []
for attr in ('Name', 'Version'): # required by PEP 345
if attr not in self:
missing.append(attr)
if strict and missing != []:
msg = 'missing required metadata: %s' % ', '.join(missing)
raise MetadataMissingError(msg)
for attr in ('Home-page', 'Author'):
if attr not in self:
missing.append(attr)
# checking metadata 1.2 (XXX needs to check 1.1, 1.0)
if self['Metadata-Version'] != '1.2':
return missing, warnings
scheme = get_scheme(self.scheme)
def are_valid_constraints(value):
for v in value:
if not scheme.is_valid_matcher(v.split(';')[0]):
return False
return True
for fields, controller in ((_PREDICATE_FIELDS, are_valid_constraints),
(_VERSIONS_FIELDS,
scheme.is_valid_constraint_list),
(_VERSION_FIELDS,
scheme.is_valid_version)):
for field in fields:
value = self.get(field, None)
if value is not None and not controller(value):
warnings.append("Wrong value for '%s': %s" % (field, value))
return missing, warnings
def todict(self, skip_missing=False):
"""Return fields as a dict.
Field names will be converted to use the underscore-lowercase style
instead of hyphen-mixed case (i.e. home_page instead of Home-page).
"""
self.set_metadata_version()
mapping_1_0 = (
('metadata_version', 'Metadata-Version'),
('name', 'Name'),
('version', 'Version'),
('summary', 'Summary'),
('home_page', 'Home-page'),
('author', 'Author'),
('author_email', 'Author-email'),
('license', 'License'),
('description', 'Description'),
('keywords', 'Keywords'),
('platform', 'Platform'),
('classifiers', 'Classifier'),
('download_url', 'Download-URL'),
)
data = {}
for key, field_name in mapping_1_0:
if not skip_missing or field_name in self._fields:
data[key] = self[field_name]
if self['Metadata-Version'] == '1.2':
mapping_1_2 = (
('requires_dist', 'Requires-Dist'),
('requires_python', 'Requires-Python'),
('requires_external', 'Requires-External'),
('provides_dist', 'Provides-Dist'),
('obsoletes_dist', 'Obsoletes-Dist'),
('project_url', 'Project-URL'),
('maintainer', 'Maintainer'),
('maintainer_email', 'Maintainer-email'),
)
for key, field_name in mapping_1_2:
if not skip_missing or field_name in self._fields:
if key != 'project_url':
data[key] = self[field_name]
else:
data[key] = [','.join(u) for u in self[field_name]]
elif self['Metadata-Version'] == '1.1':
mapping_1_1 = (
('provides', 'Provides'),
('requires', 'Requires'),
('obsoletes', 'Obsoletes'),
)
for key, field_name in mapping_1_1:
if not skip_missing or field_name in self._fields:
data[key] = self[field_name]
return data
def add_requirements(self, requirements):
if self['Metadata-Version'] == '1.1':
# we can't have 1.1 metadata *and* Setuptools requires
for field in ('Obsoletes', 'Requires', 'Provides'):
if field in self:
del self[field]
self['Requires-Dist'] += requirements
# Mapping API
# TODO could add iter* variants
def keys(self):
return list(_version2fieldlist(self['Metadata-Version']))
def __iter__(self):
for key in self.keys():
yield key
def values(self):
return [self[key] for key in self.keys()]
def items(self):
return [(key, self[key]) for key in self.keys()]
def __repr__(self):
return '<%s %s %s>' % (self.__class__.__name__, self.name,
self.version)
METADATA_FILENAME = 'pydist.json'
WHEEL_METADATA_FILENAME = 'metadata.json'
class Metadata(object):
"""
The metadata of a release. This implementation uses 2.0 (JSON)
metadata where possible. If not possible, it wraps a LegacyMetadata
instance which handles the key-value metadata format.
"""
METADATA_VERSION_MATCHER = re.compile('^\d+(\.\d+)*$')
NAME_MATCHER = re.compile('^[0-9A-Z]([0-9A-Z_.-]*[0-9A-Z])?$', re.I)
VERSION_MATCHER = PEP440_VERSION_RE
SUMMARY_MATCHER = re.compile('.{1,2047}')
METADATA_VERSION = '2.0'
GENERATOR = 'distlib (%s)' % __version__
MANDATORY_KEYS = {
'name': (),
'version': (),
'summary': ('legacy',),
}
INDEX_KEYS = ('name version license summary description author '
'author_email keywords platform home_page classifiers '
'download_url')
DEPENDENCY_KEYS = ('extras run_requires test_requires build_requires '
'dev_requires provides meta_requires obsoleted_by '
'supports_environments')
SYNTAX_VALIDATORS = {
'metadata_version': (METADATA_VERSION_MATCHER, ()),
'name': (NAME_MATCHER, ('legacy',)),
'version': (VERSION_MATCHER, ('legacy',)),
'summary': (SUMMARY_MATCHER, ('legacy',)),
}
__slots__ = ('_legacy', '_data', 'scheme')
def __init__(self, path=None, fileobj=None, mapping=None,
scheme='default'):
if [path, fileobj, mapping].count(None) < 2:
raise TypeError('path, fileobj and mapping are exclusive')
self._legacy = None
self._data = None
self.scheme = scheme
#import pdb; pdb.set_trace()
if mapping is not None:
try:
self._validate_mapping(mapping, scheme)
self._data = mapping
except MetadataUnrecognizedVersionError:
self._legacy = LegacyMetadata(mapping=mapping, scheme=scheme)
self.validate()
else:
data = None
if path:
with open(path, 'rb') as f:
data = f.read()
elif fileobj:
data = fileobj.read()
if data is None:
# Initialised with no args - to be added
self._data = {
'metadata_version': self.METADATA_VERSION,
'generator': self.GENERATOR,
}
else:
if not isinstance(data, text_type):
data = data.decode('utf-8')
try:
self._data = json.loads(data)
self._validate_mapping(self._data, scheme)
except ValueError:
# Note: MetadataUnrecognizedVersionError does not
# inherit from ValueError (it's a DistlibException,
# which should not inherit from ValueError).
# The ValueError comes from the json.load - if that
# succeeds and we get a validation error, we want
# that to propagate
self._legacy = LegacyMetadata(fileobj=StringIO(data),
scheme=scheme)
self.validate()
common_keys = set(('name', 'version', 'license', 'keywords', 'summary'))
none_list = (None, list)
none_dict = (None, dict)
mapped_keys = {
'run_requires': ('Requires-Dist', list),
'build_requires': ('Setup-Requires-Dist', list),
'dev_requires': none_list,
'test_requires': none_list,
'meta_requires': none_list,
'extras': ('Provides-Extra', list),
'modules': none_list,
'namespaces': none_list,
'exports': none_dict,
'commands': none_dict,
'classifiers': ('Classifier', list),
'source_url': ('Download-URL', None),
'metadata_version': ('Metadata-Version', None),
}
del none_list, none_dict
def __getattribute__(self, key):
common = object.__getattribute__(self, 'common_keys')
mapped = object.__getattribute__(self, 'mapped_keys')
if key in mapped:
lk, maker = mapped[key]
if self._legacy:
if lk is None:
result = None if maker is None else maker()
else:
result = self._legacy.get(lk)
else:
value = None if maker is None else maker()
if key not in ('commands', 'exports', 'modules', 'namespaces',
'classifiers'):
result = self._data.get(key, value)
else:
# special cases for PEP 459
sentinel = object()
result = sentinel
d = self._data.get('extensions')
if d:
if key == 'commands':
result = d.get('python.commands', value)
elif key == 'classifiers':
d = d.get('python.details')
if d:
result = d.get(key, value)
else:
d = d.get('python.exports')
if not d:
d = self._data.get('python.exports')
if d:
result = d.get(key, value)
if result is sentinel:
result = value
elif key not in common:
result = object.__getattribute__(self, key)
elif self._legacy:
result = self._legacy.get(key)
else:
result = self._data.get(key)
return result
def _validate_value(self, key, value, scheme=None):
if key in self.SYNTAX_VALIDATORS:
pattern, exclusions = self.SYNTAX_VALIDATORS[key]
if (scheme or self.scheme) not in exclusions:
m = pattern.match(value)
if not m:
raise MetadataInvalidError("'%s' is an invalid value for "
"the '%s' property" % (value,
key))
def __setattr__(self, key, value):
self._validate_value(key, value)
common = object.__getattribute__(self, 'common_keys')
mapped = object.__getattribute__(self, 'mapped_keys')
if key in mapped:
lk, _ = mapped[key]
if self._legacy:
if lk is None:
raise NotImplementedError
self._legacy[lk] = value
elif key not in ('commands', 'exports', 'modules', 'namespaces',
'classifiers'):
self._data[key] = value
else:
# special cases for PEP 459
d = self._data.setdefault('extensions', {})
if key == 'commands':
d['python.commands'] = value
elif key == 'classifiers':
d = d.setdefault('python.details', {})
d[key] = value
else:
d = d.setdefault('python.exports', {})
d[key] = value
elif key not in common:
object.__setattr__(self, key, value)
else:
if key == 'keywords':
if isinstance(value, string_types):
value = value.strip()
if value:
value = value.split()
else:
value = []
if self._legacy:
self._legacy[key] = value
else:
self._data[key] = value
@property
def name_and_version(self):
return _get_name_and_version(self.name, self.version, True)
@property
def provides(self):
if self._legacy:
result = self._legacy['Provides-Dist']
else:
result = self._data.setdefault('provides', [])
s = '%s (%s)' % (self.name, self.version)
if s not in result:
result.append(s)
return result
@provides.setter
def provides(self, value):
if self._legacy:
self._legacy['Provides-Dist'] = value
else:
self._data['provides'] = value
def get_requirements(self, reqts, extras=None, env=None):
"""
Base method to get dependencies, given a set of extras
to satisfy and an optional environment context.
:param reqts: A list of sometimes-wanted dependencies,
perhaps dependent on extras and environment.
:param extras: A list of optional components being requested.
:param env: An optional environment for marker evaluation.
"""
if self._legacy:
result = reqts
else:
result = []
extras = get_extras(extras or [], self.extras)
for d in reqts:
if 'extra' not in d and 'environment' not in d:
# unconditional
include = True
else:
if 'extra' not in d:
# Not extra-dependent - only environment-dependent
include = True
else:
include = d.get('extra') in extras
if include:
# Not excluded because of extras, check environment
marker = d.get('environment')
if marker:
include = interpret(marker, env)
if include:
result.extend(d['requires'])
for key in ('build', 'dev', 'test'):
e = ':%s:' % key
if e in extras:
extras.remove(e)
# A recursive call, but it should terminate since 'test'
# has been removed from the extras
reqts = self._data.get('%s_requires' % key, [])
result.extend(self.get_requirements(reqts, extras=extras,
env=env))
return result
@property
def dictionary(self):
if self._legacy:
return self._from_legacy()
return self._data
@property
def dependencies(self):
if self._legacy:
raise NotImplementedError
else:
return extract_by_key(self._data, self.DEPENDENCY_KEYS)
@dependencies.setter
def dependencies(self, value):
if self._legacy:
raise NotImplementedError
else:
self._data.update(value)
def _validate_mapping(self, mapping, scheme):
if mapping.get('metadata_version') != self.METADATA_VERSION:
raise MetadataUnrecognizedVersionError()
missing = []
for key, exclusions in self.MANDATORY_KEYS.items():
if key not in mapping:
if scheme not in exclusions:
missing.append(key)
if missing:
msg = 'Missing metadata items: %s' % ', '.join(missing)
raise MetadataMissingError(msg)
for k, v in mapping.items():
self._validate_value(k, v, scheme)
def validate(self):
if self._legacy:
missing, warnings = self._legacy.check(True)
if missing or warnings:
logger.warning('Metadata: missing: %s, warnings: %s',
missing, warnings)
else:
self._validate_mapping(self._data, self.scheme)
def todict(self):
if self._legacy:
return self._legacy.todict(True)
else:
result = extract_by_key(self._data, self.INDEX_KEYS)
return result
def _from_legacy(self):
assert self._legacy and not self._data
result = {
'metadata_version': self.METADATA_VERSION,
'generator': self.GENERATOR,
}
lmd = self._legacy.todict(True) # skip missing ones
for k in ('name', 'version', 'license', 'summary', 'description',
'classifier'):
if k in lmd:
if k == 'classifier':
nk = 'classifiers'
else:
nk = k
result[nk] = lmd[k]
kw = lmd.get('Keywords', [])
if kw == ['']:
kw = []
result['keywords'] = kw
keys = (('requires_dist', 'run_requires'),
('setup_requires_dist', 'build_requires'))
for ok, nk in keys:
if ok in lmd and lmd[ok]:
result[nk] = [{'requires': lmd[ok]}]
result['provides'] = self.provides
author = {}
maintainer = {}
return result
LEGACY_MAPPING = {
'name': 'Name',
'version': 'Version',
'license': 'License',
'summary': 'Summary',
'description': 'Description',
'classifiers': 'Classifier',
}
def _to_legacy(self):
def process_entries(entries):
reqts = set()
for e in entries:
extra = e.get('extra')
env = e.get('environment')
rlist = e['requires']
for r in rlist:
if not env and not extra:
reqts.add(r)
else:
marker = ''
if extra:
marker = 'extra == "%s"' % extra
if env:
if marker:
marker = '(%s) and %s' % (env, marker)
else:
marker = env
reqts.add(';'.join((r, marker)))
return reqts
assert self._data and not self._legacy
result = LegacyMetadata()
nmd = self._data
for nk, ok in self.LEGACY_MAPPING.items():
if nk in nmd:
result[ok] = nmd[nk]
r1 = process_entries(self.run_requires + self.meta_requires)
r2 = process_entries(self.build_requires + self.dev_requires)
if self.extras:
result['Provides-Extra'] = sorted(self.extras)
result['Requires-Dist'] = sorted(r1)
result['Setup-Requires-Dist'] = sorted(r2)
# TODO: other fields such as contacts
return result
def write(self, path=None, fileobj=None, legacy=False, skip_unknown=True):
if [path, fileobj].count(None) != 1:
raise ValueError('Exactly one of path and fileobj is needed')
self.validate()
if legacy:
if self._legacy:
legacy_md = self._legacy
else:
legacy_md = self._to_legacy()
if path:
legacy_md.write(path, skip_unknown=skip_unknown)
else:
legacy_md.write_file(fileobj, skip_unknown=skip_unknown)
else:
if self._legacy:
d = self._from_legacy()
else:
d = self._data
if fileobj:
json.dump(d, fileobj, ensure_ascii=True, indent=2,
sort_keys=True)
else:
with codecs.open(path, 'w', 'utf-8') as f:
json.dump(d, f, ensure_ascii=True, indent=2,
sort_keys=True)
def add_requirements(self, requirements):
if self._legacy:
self._legacy.add_requirements(requirements)
else:
run_requires = self._data.setdefault('run_requires', [])
always = None
for entry in run_requires:
if 'environment' not in entry and 'extra' not in entry:
always = entry
break
if always is None:
always = { 'requires': requirements }
run_requires.insert(0, always)
else:
rset = set(always['requires']) | set(requirements)
always['requires'] = sorted(rset)
def __repr__(self):
name = self.name or '(no name)'
version = self.version or 'no version'
return '<%s %s %s (%s)>' % (self.__class__.__name__,
self.metadata_version, name, version)
pip/_vendor/distlib/_backport/__init__.py 0000644 00000000422 14751155150 0014501 0 ustar 00 """Modules copied from Python 3 standard libraries, for internal use only.
Individual classes and functions are found in d2._backport.misc. Intended
usage is to always import things missing from 3.1 from that module: the
built-in/stdlib objects will be used if found.
"""
pip/_vendor/distlib/_backport/shutil.py 0000644 00000062057 14751155150 0014266 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012 The Python Software Foundation.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
"""Utility functions for copying and archiving files and directory trees.
XXX The functions here don't copy the resource fork or other metadata on Mac.
"""
import os
import sys
import stat
from os.path import abspath
import fnmatch
import collections
import errno
from . import tarfile
try:
import bz2
_BZ2_SUPPORTED = True
except ImportError:
_BZ2_SUPPORTED = False
try:
from pwd import getpwnam
except ImportError:
getpwnam = None
try:
from grp import getgrnam
except ImportError:
getgrnam = None
__all__ = ["copyfileobj", "copyfile", "copymode", "copystat", "copy", "copy2",
"copytree", "move", "rmtree", "Error", "SpecialFileError",
"ExecError", "make_archive", "get_archive_formats",
"register_archive_format", "unregister_archive_format",
"get_unpack_formats", "register_unpack_format",
"unregister_unpack_format", "unpack_archive", "ignore_patterns"]
class Error(EnvironmentError):
pass
class SpecialFileError(EnvironmentError):
"""Raised when trying to do a kind of operation (e.g. copying) which is
not supported on a special file (e.g. a named pipe)"""
class ExecError(EnvironmentError):
"""Raised when a command could not be executed"""
class ReadError(EnvironmentError):
"""Raised when an archive cannot be read"""
class RegistryError(Exception):
"""Raised when a registry operation with the archiving
and unpacking registries fails"""
try:
WindowsError
except NameError:
WindowsError = None
def copyfileobj(fsrc, fdst, length=16*1024):
"""copy data from file-like object fsrc to file-like object fdst"""
while 1:
buf = fsrc.read(length)
if not buf:
break
fdst.write(buf)
def _samefile(src, dst):
# Macintosh, Unix.
if hasattr(os.path, 'samefile'):
try:
return os.path.samefile(src, dst)
except OSError:
return False
# All other platforms: check for same pathname.
return (os.path.normcase(os.path.abspath(src)) ==
os.path.normcase(os.path.abspath(dst)))
def copyfile(src, dst):
"""Copy data from src to dst"""
if _samefile(src, dst):
raise Error("`%s` and `%s` are the same file" % (src, dst))
for fn in [src, dst]:
try:
st = os.stat(fn)
except OSError:
# File most likely does not exist
pass
else:
# XXX What about other special files? (sockets, devices...)
if stat.S_ISFIFO(st.st_mode):
raise SpecialFileError("`%s` is a named pipe" % fn)
with open(src, 'rb') as fsrc:
with open(dst, 'wb') as fdst:
copyfileobj(fsrc, fdst)
def copymode(src, dst):
"""Copy mode bits from src to dst"""
if hasattr(os, 'chmod'):
st = os.stat(src)
mode = stat.S_IMODE(st.st_mode)
os.chmod(dst, mode)
def copystat(src, dst):
"""Copy all stat info (mode bits, atime, mtime, flags) from src to dst"""
st = os.stat(src)
mode = stat.S_IMODE(st.st_mode)
if hasattr(os, 'utime'):
os.utime(dst, (st.st_atime, st.st_mtime))
if hasattr(os, 'chmod'):
os.chmod(dst, mode)
if hasattr(os, 'chflags') and hasattr(st, 'st_flags'):
try:
os.chflags(dst, st.st_flags)
except OSError as why:
if (not hasattr(errno, 'EOPNOTSUPP') or
why.errno != errno.EOPNOTSUPP):
raise
def copy(src, dst):
"""Copy data and mode bits ("cp src dst").
The destination may be a directory.
"""
if os.path.isdir(dst):
dst = os.path.join(dst, os.path.basename(src))
copyfile(src, dst)
copymode(src, dst)
def copy2(src, dst):
"""Copy data and all stat info ("cp -p src dst").
The destination may be a directory.
"""
if os.path.isdir(dst):
dst = os.path.join(dst, os.path.basename(src))
copyfile(src, dst)
copystat(src, dst)
def ignore_patterns(*patterns):
"""Function that can be used as copytree() ignore parameter.
Patterns is a sequence of glob-style patterns
that are used to exclude files"""
def _ignore_patterns(path, names):
ignored_names = []
for pattern in patterns:
ignored_names.extend(fnmatch.filter(names, pattern))
return set(ignored_names)
return _ignore_patterns
def copytree(src, dst, symlinks=False, ignore=None, copy_function=copy2,
ignore_dangling_symlinks=False):
"""Recursively copy a directory tree.
The destination directory must not already exist.
If exception(s) occur, an Error is raised with a list of reasons.
If the optional symlinks flag is true, symbolic links in the
source tree result in symbolic links in the destination tree; if
it is false, the contents of the files pointed to by symbolic
links are copied. If the file pointed by the symlink doesn't
exist, an exception will be added in the list of errors raised in
an Error exception at the end of the copy process.
You can set the optional ignore_dangling_symlinks flag to true if you
want to silence this exception. Notice that this has no effect on
platforms that don't support os.symlink.
The optional ignore argument is a callable. If given, it
is called with the `src` parameter, which is the directory
being visited by copytree(), and `names` which is the list of
`src` contents, as returned by os.listdir():
callable(src, names) -> ignored_names
Since copytree() is called recursively, the callable will be
called once for each directory that is copied. It returns a
list of names relative to the `src` directory that should
not be copied.
The optional copy_function argument is a callable that will be used
to copy each file. It will be called with the source path and the
destination path as arguments. By default, copy2() is used, but any
function that supports the same signature (like copy()) can be used.
"""
names = os.listdir(src)
if ignore is not None:
ignored_names = ignore(src, names)
else:
ignored_names = set()
os.makedirs(dst)
errors = []
for name in names:
if name in ignored_names:
continue
srcname = os.path.join(src, name)
dstname = os.path.join(dst, name)
try:
if os.path.islink(srcname):
linkto = os.readlink(srcname)
if symlinks:
os.symlink(linkto, dstname)
else:
# ignore dangling symlink if the flag is on
if not os.path.exists(linkto) and ignore_dangling_symlinks:
continue
# otherwise let the copy occurs. copy2 will raise an error
copy_function(srcname, dstname)
elif os.path.isdir(srcname):
copytree(srcname, dstname, symlinks, ignore, copy_function)
else:
# Will raise a SpecialFileError for unsupported file types
copy_function(srcname, dstname)
# catch the Error from the recursive copytree so that we can
# continue with other files
except Error as err:
errors.extend(err.args[0])
except EnvironmentError as why:
errors.append((srcname, dstname, str(why)))
try:
copystat(src, dst)
except OSError as why:
if WindowsError is not None and isinstance(why, WindowsError):
# Copying file access times may fail on Windows
pass
else:
errors.extend((src, dst, str(why)))
if errors:
raise Error(errors)
def rmtree(path, ignore_errors=False, onerror=None):
"""Recursively delete a directory tree.
If ignore_errors is set, errors are ignored; otherwise, if onerror
is set, it is called to handle the error with arguments (func,
path, exc_info) where func is os.listdir, os.remove, or os.rmdir;
path is the argument to that function that caused it to fail; and
exc_info is a tuple returned by sys.exc_info(). If ignore_errors
is false and onerror is None, an exception is raised.
"""
if ignore_errors:
def onerror(*args):
pass
elif onerror is None:
def onerror(*args):
raise
try:
if os.path.islink(path):
# symlinks to directories are forbidden, see bug #1669
raise OSError("Cannot call rmtree on a symbolic link")
except OSError:
onerror(os.path.islink, path, sys.exc_info())
# can't continue even if onerror hook returns
return
names = []
try:
names = os.listdir(path)
except os.error:
onerror(os.listdir, path, sys.exc_info())
for name in names:
fullname = os.path.join(path, name)
try:
mode = os.lstat(fullname).st_mode
except os.error:
mode = 0
if stat.S_ISDIR(mode):
rmtree(fullname, ignore_errors, onerror)
else:
try:
os.remove(fullname)
except os.error:
onerror(os.remove, fullname, sys.exc_info())
try:
os.rmdir(path)
except os.error:
onerror(os.rmdir, path, sys.exc_info())
def _basename(path):
# A basename() variant which first strips the trailing slash, if present.
# Thus we always get the last component of the path, even for directories.
return os.path.basename(path.rstrip(os.path.sep))
def move(src, dst):
"""Recursively move a file or directory to another location. This is
similar to the Unix "mv" command.
If the destination is a directory or a symlink to a directory, the source
is moved inside the directory. The destination path must not already
exist.
If the destination already exists but is not a directory, it may be
overwritten depending on os.rename() semantics.
If the destination is on our current filesystem, then rename() is used.
Otherwise, src is copied to the destination and then removed.
A lot more could be done here... A look at a mv.c shows a lot of
the issues this implementation glosses over.
"""
real_dst = dst
if os.path.isdir(dst):
if _samefile(src, dst):
# We might be on a case insensitive filesystem,
# perform the rename anyway.
os.rename(src, dst)
return
real_dst = os.path.join(dst, _basename(src))
if os.path.exists(real_dst):
raise Error("Destination path '%s' already exists" % real_dst)
try:
os.rename(src, real_dst)
except OSError:
if os.path.isdir(src):
if _destinsrc(src, dst):
raise Error("Cannot move a directory '%s' into itself '%s'." % (src, dst))
copytree(src, real_dst, symlinks=True)
rmtree(src)
else:
copy2(src, real_dst)
os.unlink(src)
def _destinsrc(src, dst):
src = abspath(src)
dst = abspath(dst)
if not src.endswith(os.path.sep):
src += os.path.sep
if not dst.endswith(os.path.sep):
dst += os.path.sep
return dst.startswith(src)
def _get_gid(name):
"""Returns a gid, given a group name."""
if getgrnam is None or name is None:
return None
try:
result = getgrnam(name)
except KeyError:
result = None
if result is not None:
return result[2]
return None
def _get_uid(name):
"""Returns an uid, given a user name."""
if getpwnam is None or name is None:
return None
try:
result = getpwnam(name)
except KeyError:
result = None
if result is not None:
return result[2]
return None
def _make_tarball(base_name, base_dir, compress="gzip", verbose=0, dry_run=0,
owner=None, group=None, logger=None):
"""Create a (possibly compressed) tar file from all the files under
'base_dir'.
'compress' must be "gzip" (the default), "bzip2", or None.
'owner' and 'group' can be used to define an owner and a group for the
archive that is being built. If not provided, the current owner and group
will be used.
The output tar file will be named 'base_name' + ".tar", possibly plus
the appropriate compression extension (".gz", or ".bz2").
Returns the output filename.
"""
tar_compression = {'gzip': 'gz', None: ''}
compress_ext = {'gzip': '.gz'}
if _BZ2_SUPPORTED:
tar_compression['bzip2'] = 'bz2'
compress_ext['bzip2'] = '.bz2'
# flags for compression program, each element of list will be an argument
if compress is not None and compress not in compress_ext:
raise ValueError("bad value for 'compress', or compression format not "
"supported : {0}".format(compress))
archive_name = base_name + '.tar' + compress_ext.get(compress, '')
archive_dir = os.path.dirname(archive_name)
if not os.path.exists(archive_dir):
if logger is not None:
logger.info("creating %s", archive_dir)
if not dry_run:
os.makedirs(archive_dir)
# creating the tarball
if logger is not None:
logger.info('Creating tar archive')
uid = _get_uid(owner)
gid = _get_gid(group)
def _set_uid_gid(tarinfo):
if gid is not None:
tarinfo.gid = gid
tarinfo.gname = group
if uid is not None:
tarinfo.uid = uid
tarinfo.uname = owner
return tarinfo
if not dry_run:
tar = tarfile.open(archive_name, 'w|%s' % tar_compression[compress])
try:
tar.add(base_dir, filter=_set_uid_gid)
finally:
tar.close()
return archive_name
def _call_external_zip(base_dir, zip_filename, verbose=False, dry_run=False):
# XXX see if we want to keep an external call here
if verbose:
zipoptions = "-r"
else:
zipoptions = "-rq"
from distutils.errors import DistutilsExecError
from distutils.spawn import spawn
try:
spawn(["zip", zipoptions, zip_filename, base_dir], dry_run=dry_run)
except DistutilsExecError:
# XXX really should distinguish between "couldn't find
# external 'zip' command" and "zip failed".
raise ExecError("unable to create zip file '%s': "
"could neither import the 'zipfile' module nor "
"find a standalone zip utility") % zip_filename
def _make_zipfile(base_name, base_dir, verbose=0, dry_run=0, logger=None):
"""Create a zip file from all the files under 'base_dir'.
The output zip file will be named 'base_name' + ".zip". Uses either the
"zipfile" Python module (if available) or the InfoZIP "zip" utility
(if installed and found on the default search path). If neither tool is
available, raises ExecError. Returns the name of the output zip
file.
"""
zip_filename = base_name + ".zip"
archive_dir = os.path.dirname(base_name)
if not os.path.exists(archive_dir):
if logger is not None:
logger.info("creating %s", archive_dir)
if not dry_run:
os.makedirs(archive_dir)
# If zipfile module is not available, try spawning an external 'zip'
# command.
try:
import zipfile
except ImportError:
zipfile = None
if zipfile is None:
_call_external_zip(base_dir, zip_filename, verbose, dry_run)
else:
if logger is not None:
logger.info("creating '%s' and adding '%s' to it",
zip_filename, base_dir)
if not dry_run:
zip = zipfile.ZipFile(zip_filename, "w",
compression=zipfile.ZIP_DEFLATED)
for dirpath, dirnames, filenames in os.walk(base_dir):
for name in filenames:
path = os.path.normpath(os.path.join(dirpath, name))
if os.path.isfile(path):
zip.write(path, path)
if logger is not None:
logger.info("adding '%s'", path)
zip.close()
return zip_filename
_ARCHIVE_FORMATS = {
'gztar': (_make_tarball, [('compress', 'gzip')], "gzip'ed tar-file"),
'bztar': (_make_tarball, [('compress', 'bzip2')], "bzip2'ed tar-file"),
'tar': (_make_tarball, [('compress', None)], "uncompressed tar file"),
'zip': (_make_zipfile, [], "ZIP file"),
}
if _BZ2_SUPPORTED:
_ARCHIVE_FORMATS['bztar'] = (_make_tarball, [('compress', 'bzip2')],
"bzip2'ed tar-file")
def get_archive_formats():
"""Returns a list of supported formats for archiving and unarchiving.
Each element of the returned sequence is a tuple (name, description)
"""
formats = [(name, registry[2]) for name, registry in
_ARCHIVE_FORMATS.items()]
formats.sort()
return formats
def register_archive_format(name, function, extra_args=None, description=''):
"""Registers an archive format.
name is the name of the format. function is the callable that will be
used to create archives. If provided, extra_args is a sequence of
(name, value) tuples that will be passed as arguments to the callable.
description can be provided to describe the format, and will be returned
by the get_archive_formats() function.
"""
if extra_args is None:
extra_args = []
if not isinstance(function, collections.Callable):
raise TypeError('The %s object is not callable' % function)
if not isinstance(extra_args, (tuple, list)):
raise TypeError('extra_args needs to be a sequence')
for element in extra_args:
if not isinstance(element, (tuple, list)) or len(element) !=2:
raise TypeError('extra_args elements are : (arg_name, value)')
_ARCHIVE_FORMATS[name] = (function, extra_args, description)
def unregister_archive_format(name):
del _ARCHIVE_FORMATS[name]
def make_archive(base_name, format, root_dir=None, base_dir=None, verbose=0,
dry_run=0, owner=None, group=None, logger=None):
"""Create an archive file (eg. zip or tar).
'base_name' is the name of the file to create, minus any format-specific
extension; 'format' is the archive format: one of "zip", "tar", "bztar"
or "gztar".
'root_dir' is a directory that will be the root directory of the
archive; ie. we typically chdir into 'root_dir' before creating the
archive. 'base_dir' is the directory where we start archiving from;
ie. 'base_dir' will be the common prefix of all files and
directories in the archive. 'root_dir' and 'base_dir' both default
to the current directory. Returns the name of the archive file.
'owner' and 'group' are used when creating a tar archive. By default,
uses the current owner and group.
"""
save_cwd = os.getcwd()
if root_dir is not None:
if logger is not None:
logger.debug("changing into '%s'", root_dir)
base_name = os.path.abspath(base_name)
if not dry_run:
os.chdir(root_dir)
if base_dir is None:
base_dir = os.curdir
kwargs = {'dry_run': dry_run, 'logger': logger}
try:
format_info = _ARCHIVE_FORMATS[format]
except KeyError:
raise ValueError("unknown archive format '%s'" % format)
func = format_info[0]
for arg, val in format_info[1]:
kwargs[arg] = val
if format != 'zip':
kwargs['owner'] = owner
kwargs['group'] = group
try:
filename = func(base_name, base_dir, **kwargs)
finally:
if root_dir is not None:
if logger is not None:
logger.debug("changing back to '%s'", save_cwd)
os.chdir(save_cwd)
return filename
def get_unpack_formats():
"""Returns a list of supported formats for unpacking.
Each element of the returned sequence is a tuple
(name, extensions, description)
"""
formats = [(name, info[0], info[3]) for name, info in
_UNPACK_FORMATS.items()]
formats.sort()
return formats
def _check_unpack_options(extensions, function, extra_args):
"""Checks what gets registered as an unpacker."""
# first make sure no other unpacker is registered for this extension
existing_extensions = {}
for name, info in _UNPACK_FORMATS.items():
for ext in info[0]:
existing_extensions[ext] = name
for extension in extensions:
if extension in existing_extensions:
msg = '%s is already registered for "%s"'
raise RegistryError(msg % (extension,
existing_extensions[extension]))
if not isinstance(function, collections.Callable):
raise TypeError('The registered function must be a callable')
def register_unpack_format(name, extensions, function, extra_args=None,
description=''):
"""Registers an unpack format.
`name` is the name of the format. `extensions` is a list of extensions
corresponding to the format.
`function` is the callable that will be
used to unpack archives. The callable will receive archives to unpack.
If it's unable to handle an archive, it needs to raise a ReadError
exception.
If provided, `extra_args` is a sequence of
(name, value) tuples that will be passed as arguments to the callable.
description can be provided to describe the format, and will be returned
by the get_unpack_formats() function.
"""
if extra_args is None:
extra_args = []
_check_unpack_options(extensions, function, extra_args)
_UNPACK_FORMATS[name] = extensions, function, extra_args, description
def unregister_unpack_format(name):
"""Removes the pack format from the registry."""
del _UNPACK_FORMATS[name]
def _ensure_directory(path):
"""Ensure that the parent directory of `path` exists"""
dirname = os.path.dirname(path)
if not os.path.isdir(dirname):
os.makedirs(dirname)
def _unpack_zipfile(filename, extract_dir):
"""Unpack zip `filename` to `extract_dir`
"""
try:
import zipfile
except ImportError:
raise ReadError('zlib not supported, cannot unpack this archive.')
if not zipfile.is_zipfile(filename):
raise ReadError("%s is not a zip file" % filename)
zip = zipfile.ZipFile(filename)
try:
for info in zip.infolist():
name = info.filename
# don't extract absolute paths or ones with .. in them
if name.startswith('/') or '..' in name:
continue
target = os.path.join(extract_dir, *name.split('/'))
if not target:
continue
_ensure_directory(target)
if not name.endswith('/'):
# file
data = zip.read(info.filename)
f = open(target, 'wb')
try:
f.write(data)
finally:
f.close()
del data
finally:
zip.close()
def _unpack_tarfile(filename, extract_dir):
"""Unpack tar/tar.gz/tar.bz2 `filename` to `extract_dir`
"""
try:
tarobj = tarfile.open(filename)
except tarfile.TarError:
raise ReadError(
"%s is not a compressed or uncompressed tar file" % filename)
try:
tarobj.extractall(extract_dir)
finally:
tarobj.close()
_UNPACK_FORMATS = {
'gztar': (['.tar.gz', '.tgz'], _unpack_tarfile, [], "gzip'ed tar-file"),
'tar': (['.tar'], _unpack_tarfile, [], "uncompressed tar file"),
'zip': (['.zip'], _unpack_zipfile, [], "ZIP file")
}
if _BZ2_SUPPORTED:
_UNPACK_FORMATS['bztar'] = (['.bz2'], _unpack_tarfile, [],
"bzip2'ed tar-file")
def _find_unpack_format(filename):
for name, info in _UNPACK_FORMATS.items():
for extension in info[0]:
if filename.endswith(extension):
return name
return None
def unpack_archive(filename, extract_dir=None, format=None):
"""Unpack an archive.
`filename` is the name of the archive.
`extract_dir` is the name of the target directory, where the archive
is unpacked. If not provided, the current working directory is used.
`format` is the archive format: one of "zip", "tar", or "gztar". Or any
other registered format. If not provided, unpack_archive will use the
filename extension and see if an unpacker was registered for that
extension.
In case none is found, a ValueError is raised.
"""
if extract_dir is None:
extract_dir = os.getcwd()
if format is not None:
try:
format_info = _UNPACK_FORMATS[format]
except KeyError:
raise ValueError("Unknown unpack format '{0}'".format(format))
func = format_info[1]
func(filename, extract_dir, **dict(format_info[2]))
else:
# we need to look at the registered unpackers supported extensions
format = _find_unpack_format(filename)
if format is None:
raise ReadError("Unknown archive format '{0}'".format(filename))
func = _UNPACK_FORMATS[format][1]
kwargs = dict(_UNPACK_FORMATS[format][2])
func(filename, extract_dir, **kwargs)
pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.opt-1.pyc 0000644 00000001740 14751155150 0021124 0 ustar 00 3
���e� � @ s� d Z ddlZddlZdddgZyddlmZ W n ek
rL d dd�ZY nX yeZW n( ek
r~ dd l m
Z
d
d� ZY nX y
ej Z W n e k
r� d d� Z Y nX dS )
z/Backports for individual classes and functions.� N�cache_from_source�callable�fsencode)r Fc C s |rdp
d}| | S )N�c�o� )Zpy_file�debugZextr r �/usr/lib/python3.6/misc.pyr s )�Callablec C s
t | t�S )N)�
isinstancer
)�objr r r r s c C s< t | t�r| S t | t�r&| jtj� �S tdt| �j ��d S )Nzexpect bytes or str, not %s) r �bytes�str�encode�sys�getfilesystemencoding� TypeError�type�__name__)�filenamer r r r " s
)F)
�__doc__�osr �__all__Zimpr � ImportErrorr � NameError� collectionsr
r �AttributeErrorr r r r �<module> s
pip/_vendor/distlib/_backport/__pycache__/shutil.cpython-36.opt-1.pyc 0000644 00000051544 14751155150 0021510 0 ustar 00 3
�Ub/d � - @ s
d Z ddlZddlZddlZddlmZ ddlZddlZddlZddl m
Z
yddl Z dZ W n e
k
rt dZ Y nX yddlmZ W n e
k
r� dZY nX ydd lmZ W n e
k
r� dZY nX d
d d d
ddddddddddddddd d d gZG d d� de�ZG d d� de�ZG d!d� de�ZG d"d#� d#e�ZG d$d%� d%e�Zye W n ek
�rj dZY nX ded(d
�Z d)d*� Z d+d � Z d,d � Z d-d
� Z d.d� Z!d/d� Z"d0d � Z#dde"dfd1d�Z$dfd2d�Z%d3d4� Z&d5d� Z'd6d7� Z(d8d9� Z)d:d;� Z*dgd=d>�Z+dhd?d@�Z,didAdB�Z-e+djgdDfe+dkgdFfe+dlgdGfe-g dHfdI�Z.e �rRe+dmgdFfe.dJ< dKd� Z/dndMd�Z0dNd� Z1dodOd�Z2dPd� Z3dQdR� Z4dpdSd�Z5dTd � Z6dUdV� Z7dWdX� Z8dYdZ� Z9d[d\ge9g dDfd]ge9g dGfd^ge8g dHfd_�Z:e �r�d`ge9g dFfe:dJ< dadb� Z;dqdcd �Z<dS )rz�Utility functions for copying and archiving files and directory trees.
XXX The functions here don't copy the resource fork or other metadata on Mac.
� N)�abspath� )�tarfileTF)�getpwnam)�getgrnam� copyfileobj�copyfile�copymode�copystat�copy�copy2�copytree�move�rmtree�Error�SpecialFileError� ExecError� make_archive�get_archive_formats�register_archive_format�unregister_archive_format�get_unpack_formats�register_unpack_format�unregister_unpack_format�unpack_archive�ignore_patternsc @ s e Zd ZdS )r N)�__name__�
__module__� __qualname__� r r � /usr/lib/python3.6/shutil.pyr , s c @ s e Zd ZdZdS )r z|Raised when trying to do a kind of operation (e.g. copying) which is
not supported on a special file (e.g. a named pipe)N)r r r �__doc__r r r r r / s c @ s e Zd ZdZdS )r z+Raised when a command could not be executedN)r r r r! r r r r r 3 s c @ s e Zd ZdZdS )� ReadErrorz%Raised when an archive cannot be readN)r r r r! r r r r r" 6 s r" c @ s e Zd ZdZdS )�
RegistryErrorzVRaised when a registry operation with the archiving
and unpacking registries failsN)r r r r! r r r r r# 9 s r# � i c C s$ x | j |�}|sP |j|� qW dS )z=copy data from file-like object fsrc to file-like object fdstN)�read�write)�fsrc�fdstZlengthZbufr r r r C s
c C sX t tjd�r0ytjj| |�S tk
r. dS X tjjtjj| ��tjjtjj|��kS )N�samefileF)�hasattr�os�pathr) �OSError�normcaser )�src�dstr r r � _samefileK s r1 c C s� t | |�rtd| |f ��xL| |gD ]@}ytj|�}W n tk
rJ Y q$X tj|j�r$td| ��q$W t| d��&}t|d��}t ||� W dQ R X W dQ R X dS )zCopy data from src to dstz `%s` and `%s` are the same filez`%s` is a named pipe�rb�wbN)
r1 r r+ �statr- �S_ISFIFO�st_moder �openr )r/ r0 �fn�str' r( r r r r W s
c C s0 t td�r,tj| �}tj|j�}tj||� dS )z Copy mode bits from src to dst�chmodN)r* r+ r4 �S_IMODEr6 r: )r/ r0 r9 �moder r r r k s
c C s� t j| �}tj|j�}tt d�r4t j||j|jf� tt d�rJt j||� tt d�r�t|d�r�yt j ||j
� W n< t k
r� } z tt d� s�|j t j
kr�� W Y dd}~X nX dS )zCCopy all stat info (mode bits, atime, mtime, flags) from src to dst�utimer: �chflags�st_flags�
EOPNOTSUPPN)r+ r4 r; r6 r* r= �st_atime�st_mtimer: r> r? r- �errnor@ )r/ r0 r9 r< �whyr r r r
r s
c C s: t jj|�r"t jj|t jj| ��}t| |� t| |� dS )zVCopy data and mode bits ("cp src dst").
The destination may be a directory.
N)r+ r, �isdir�join�basenamer r )r/ r0 r r r r � s
c C s: t jj|�r"t jj|t jj| ��}t| |� t| |� dS )z]Copy data and all stat info ("cp -p src dst").
The destination may be a directory.
N)r+ r, rE rF rG r r
)r/ r0 r r r r � s
c s � fdd�}|S )z�Function that can be used as copytree() ignore parameter.
Patterns is a sequence of glob-style patterns
that are used to exclude filesc s, g }x � D ]}|j tj||�� q
W t|�S )N)�extend�fnmatch�filter�set)r, �names�
ignored_names�pattern)�patternsr r �_ignore_patterns� s
z)ignore_patterns.<locals>._ignore_patternsr )rO rP r )rO r r � s c C s� t j| �}|dk r || |�}nt� }t j|� g }�x|D �]
} | |krJq:t jj| | �}
t jj|| �} ytt jj|
�r�t j|
�} |r�t j| | � q�t jj | � r�|r�w:||
| � n(t jj
|
�r�t |
| |||� n
||
| � W q: t k
�r }
z|j
|
jd � W Y dd}
~
X q: tk
�rD } z|j|
| t|�f� W Y dd}~X q:X q:W yt| |� W nP tk
�r� } z2tdk �r�t|t��r�n|j
| |t|�f� W Y dd}~X nX |�r�t |��dS )a� Recursively copy a directory tree.
The destination directory must not already exist.
If exception(s) occur, an Error is raised with a list of reasons.
If the optional symlinks flag is true, symbolic links in the
source tree result in symbolic links in the destination tree; if
it is false, the contents of the files pointed to by symbolic
links are copied. If the file pointed by the symlink doesn't
exist, an exception will be added in the list of errors raised in
an Error exception at the end of the copy process.
You can set the optional ignore_dangling_symlinks flag to true if you
want to silence this exception. Notice that this has no effect on
platforms that don't support os.symlink.
The optional ignore argument is a callable. If given, it
is called with the `src` parameter, which is the directory
being visited by copytree(), and `names` which is the list of
`src` contents, as returned by os.listdir():
callable(src, names) -> ignored_names
Since copytree() is called recursively, the callable will be
called once for each directory that is copied. It returns a
list of names relative to the `src` directory that should
not be copied.
The optional copy_function argument is a callable that will be used
to copy each file. It will be called with the source path and the
destination path as arguments. By default, copy2() is used, but any
function that supports the same signature (like copy()) can be used.
Nr )r+ �listdirrK �makedirsr, rF �islink�readlink�symlink�existsrE r
r rH �args�EnvironmentError�append�strr
r- � WindowsError�
isinstance)r/ r0 �symlinks�ignoreZ
copy_functionZignore_dangling_symlinksrL rM �errors�nameZsrcnameZdstnameZlinkto�errrD r r r r
� sD $
*&c $ C st |rdd� }n|dkr dd� }yt jj| �r4td��W n( tk
r^ |t jj| tj� � dS X g }yt j| �}W n( t jk
r� |t j| tj� � Y nX x�|D ]�}t jj| |�}yt j |�j
}W n t jk
r� d}Y nX t j |�r�t
|||� q�yt j|� W q� t jk
�r0 |t j|tj� � Y q�X q�W yt j| � W n* t jk
�rn |t j| tj� � Y nX dS )a� Recursively delete a directory tree.
If ignore_errors is set, errors are ignored; otherwise, if onerror
is set, it is called to handle the error with arguments (func,
path, exc_info) where func is os.listdir, os.remove, or os.rmdir;
path is the argument to that function that caused it to fail; and
exc_info is a tuple returned by sys.exc_info(). If ignore_errors
is false and onerror is None, an exception is raised.
c W s d S )Nr )rW r r r �onerror s zrmtree.<locals>.onerrorNc W s � d S )Nr )rW r r r rb s z%Cannot call rmtree on a symbolic linkr )r+ r, rS r- �sys�exc_inforQ �errorrF �lstatr6 r4 �S_ISDIRr �remove�rmdir)r, �
ignore_errorsrb rL r` �fullnamer< r r r r � s>
c C s t jj| jt jj��S )N)r+ r, rG �rstrip�sep)r, r r r � _basename' s rn c C s� |}t jj|�rTt| |�r*t j| |� dS t jj|t| ��}t jj|�rTtd| ��yt j| |� W nf t k
r� t jj| �r�t
| |�r�td| |f ��t | |dd� t | � nt
| |� t j| � Y nX dS )a� Recursively move a file or directory to another location. This is
similar to the Unix "mv" command.
If the destination is a directory or a symlink to a directory, the source
is moved inside the directory. The destination path must not already
exist.
If the destination already exists but is not a directory, it may be
overwritten depending on os.rename() semantics.
If the destination is on our current filesystem, then rename() is used.
Otherwise, src is copied to the destination and then removed.
A lot more could be done here... A look at a mv.c shows a lot of
the issues this implementation glosses over.
Nz$Destination path '%s' already existsz.Cannot move a directory '%s' into itself '%s'.T)r] )r+ r, rE r1 �renamerF rn rV r r- �
_destinsrcr
r r �unlink)r/ r0 Zreal_dstr r r r , s$
c C sN t | �} t |�}| jtjj�s*| tjj7 } |jtjj�sD|tjj7 }|j| �S )N)r �endswithr+ r, rm �
startswith)r/ r0 r r r rp T s rp c C sN t dks| dkrdS y t | �}W n tk
r8 d}Y nX |dk rJ|d S dS )z"Returns a gid, given a group name.N� )r �KeyError)r` �resultr r r �_get_gid] s
rw c C sN t dks| dkrdS y t | �}W n tk
r8 d}Y nX |dk rJ|d S dS )z"Returns an uid, given a user name.Nrt )r ru )r` rv r r r �_get_uidi s
rx �gzipc
s ddd�}ddi} t r&d|d< d| d< |d k rD|| krDtd
j|���| d | j|d� }
tjj|
�} tjj| �s�|d k r�|jd | � |s�tj | � |d k r�|jd
� t
���t ��� � ���fdd�} |� s�t j
|
d|| �}
z|
j|| d� W d |
j� X |
S )a� Create a (possibly compressed) tar file from all the files under
'base_dir'.
'compress' must be "gzip" (the default), "bzip2", or None.
'owner' and 'group' can be used to define an owner and a group for the
archive that is being built. If not provided, the current owner and group
will be used.
The output tar file will be named 'base_name' + ".tar", possibly plus
the appropriate compression extension (".gz", or ".bz2").
Returns the output filename.
Zgz� )ry Nry z.gz�bz2�bzip2z.bz2NzCbad value for 'compress', or compression format not supported : {0}z.tarz creating %szCreating tar archivec s, � d k r� | _ �| _�d k r(�| _�| _| S )N)�gidZgname�uid�uname)Ztarinfo)r} �group�ownerr~ r r � _set_uid_gid� s z#_make_tarball.<locals>._set_uid_gidzw|%s)rJ )�_BZ2_SUPPORTED�
ValueError�format�getr+ r, �dirnamerV �inforR rx rw r r7 �add�close)� base_name�base_dir�compress�verbose�dry_runr� r� �loggerZtar_compressionZ compress_extZ archive_name� archive_dirr� �tarr )r} r� r� r~ r �
_make_tarballu s4
r� c C sd |r
d}nd}ddl m} ddlm} y|d||| g|d� W n |k
r^ td�| �Y nX d S ) Nz-rz-rqr )�DistutilsExecError)�spawn�zip)r� zkunable to create zip file '%s': could neither import the 'zipfile' module nor find a standalone zip utility)Zdistutils.errorsr� Zdistutils.spawnr� r )r� � zip_filenamer� r� Z
zipoptionsr� r� r r r �_call_external_zip� s r� c C s$ | d }t jj| �}t jj|�sB|dk r4|jd|� |sBt j|� y ddl}W n tk
rf d}Y nX |dkr�t||||� n�|dk r�|jd||� |�s |j |d|j
d�}xht j |�D ]Z\} }
} xN| D ]F} t jj t jj
| | ��}
t jj|
�r�|j|
|
� |dk r�|jd|
� q�W q�W |j� |S ) am Create a zip file from all the files under 'base_dir'.
The output zip file will be named 'base_name' + ".zip". Uses either the
"zipfile" Python module (if available) or the InfoZIP "zip" utility
(if installed and found on the default search path). If neither tool is
available, raises ExecError. Returns the name of the output zip
file.
z.zipNz creating %sr z#creating '%s' and adding '%s' to it�w)Z compressionz adding '%s')r+ r, r� rV r� rR �zipfile� ImportErrorr� �ZipFileZ ZIP_DEFLATED�walk�normpathrF �isfiler& r� )r� r� r� r� r� r� r� r� r� �dirpathZdirnames� filenamesr` r, r r r �
_make_zipfile� s8
r� r� zgzip'ed tar-filer| zbzip2'ed tar-filezuncompressed tar filezZIP file)�gztar�bztarr� r� r� c C s dd� t j� D �} | j� | S )z�Returns a list of supported formats for archiving and unarchiving.
Each element of the returned sequence is a tuple (name, description)
c S s g | ]\}}||d f�qS )rt r )�.0r` �registryr r r �
<listcomp> s z'get_archive_formats.<locals>.<listcomp>)�_ARCHIVE_FORMATS�items�sort)�formatsr r r r � s rz c C s~ |dkr g }t |tj�s$td| ��t |ttf�s:td��x0|D ](}t |ttf� s`t|�dkr@td��q@W |||ft| < dS )au Registers an archive format.
name is the name of the format. function is the callable that will be
used to create archives. If provided, extra_args is a sequence of
(name, value) tuples that will be passed as arguments to the callable.
description can be provided to describe the format, and will be returned
by the get_archive_formats() function.
Nz The %s object is not callablez!extra_args needs to be a sequencert z+extra_args elements are : (arg_name, value))r\ � collections�Callable� TypeError�tuple�list�lenr� )r` �function�
extra_args� description�elementr r r r s
c C s
t | = d S )N)r� )r` r r r r s c C s t j� } |dk r>|dk r$|jd|� t jj| �} |s>t j|� |dkrLt j}||d�}
y t| } W n tk
r� t d| ��Y nX | d } x | d D ]\}
}||
|
< q�W |dkr�||
d< ||
d < z| | |f|
�}W d|dk r�|dk r�|jd
| � t j| � X |S ) a� Create an archive file (eg. zip or tar).
'base_name' is the name of the file to create, minus any format-specific
extension; 'format' is the archive format: one of "zip", "tar", "bztar"
or "gztar".
'root_dir' is a directory that will be the root directory of the
archive; ie. we typically chdir into 'root_dir' before creating the
archive. 'base_dir' is the directory where we start archiving from;
ie. 'base_dir' will be the common prefix of all files and
directories in the archive. 'root_dir' and 'base_dir' both default
to the current directory. Returns the name of the archive file.
'owner' and 'group' are used when creating a tar archive. By default,
uses the current owner and group.
Nzchanging into '%s')r� r� zunknown archive format '%s'r r r� r� r� zchanging back to '%s')
r+ �getcwd�debugr, r �chdir�curdirr� ru r� )r� r� Zroot_dirr� r� r� r� r� r� Zsave_cwd�kwargs� format_info�func�arg�val�filenamer r r r s6
c C s dd� t j� D �} | j� | S )z�Returns a list of supported formats for unpacking.
Each element of the returned sequence is a tuple
(name, extensions, description)
c S s" g | ]\}}||d |d f�qS )r � r )r� r` r� r r r r� ] s z&get_unpack_formats.<locals>.<listcomp>)�_UNPACK_FORMATSr� r� )r� r r r r W s c C sz i }x.t j� D ]"\}}x|d D ] }|||< q W qW x,| D ]$}||kr:d}t|||| f ��q:W t|tj�svtd��dS )z+Checks what gets registered as an unpacker.r z!%s is already registered for "%s"z*The registered function must be a callableN)r� r� r# r\ r� r� r� ) �
extensionsr� r� Zexisting_extensionsr` r� Zext� extension�msgr r r �_check_unpack_optionsb s
r� c C s, |dkr g }t |||� ||||ft| < dS )aM Registers an unpack format.
`name` is the name of the format. `extensions` is a list of extensions
corresponding to the format.
`function` is the callable that will be
used to unpack archives. The callable will receive archives to unpack.
If it's unable to handle an archive, it needs to raise a ReadError
exception.
If provided, `extra_args` is a sequence of
(name, value) tuples that will be passed as arguments to the callable.
description can be provided to describe the format, and will be returned
by the get_unpack_formats() function.
N)r� r� )r` r� r� r� r� r r r r t s c C s
t | = dS )z*Removes the pack format from the registry.N)r� )r` r r r r � s c C s& t jj| �}t jj|�s"t j|� dS )z1Ensure that the parent directory of `path` existsN)r+ r, r� rE rR )r, r� r r r �_ensure_directory� s r� c C s� y ddl }W n tk
r( td��Y nX |j| �s@td| ��|j| �}z�x�|j� D ]�}|j}|jd�sVd|krtqVtj j
|f|j d��� }|s�qVt |� |j
d�sV|j|j�}t|d�}z|j|� W d|j� ~X qVW W d|j� X dS )z+Unpack zip `filename` to `extract_dir`
r Nz/zlib not supported, cannot unpack this archive.z%s is not a zip file�/z..r3 )r� r� r" Z
is_zipfiler� Zinfolistr� rs r+ r, rF �splitr� rr r% r7 r& r� ) r� � extract_dirr� r� r� r` �target�data�fr r r �_unpack_zipfile� s0
r� c C sP yt j| �}W n" t jk
r0 td| ��Y nX z|j|� W d|j� X dS )z:Unpack tar/tar.gz/tar.bz2 `filename` to `extract_dir`
z/%s is not a compressed or uncompressed tar fileN)r r7 ZTarErrorr" Z
extractallr� )r� r� Ztarobjr r r �_unpack_tarfile� s r� z.tar.gzz.tgzz.tarz.zip)r� r� r� z.bz2c C s: x4t j� D ](\}}x |d D ]}| j|�r |S q W q
W d S )Nr )r� r� rr )r� r` r� r� r r r �_find_unpack_format� s
r� c
C s� |dkrt j� }|dk rhy t| }W n" tk
rF tdj|���Y nX |d }|| |ft|d �� nHt| �}|dkr�tdj| ���t| d }tt| d �}|| |f|� dS )a� Unpack an archive.
`filename` is the name of the archive.
`extract_dir` is the name of the target directory, where the archive
is unpacked. If not provided, the current working directory is used.
`format` is the archive format: one of "zip", "tar", or "gztar". Or any
other registered format. If not provided, unpack_archive will use the
filename extension and see if an unpacker was registered for that
extension.
In case none is found, a ValueError is raised.
NzUnknown unpack format '{0}'r rt z Unknown archive format '{0}') r+ r� r� ru r� r� �dictr� r" )r� r� r� r� r� r� r r r r � s � @ )r� )FN)ry r r NNN)FF)r r N)r� ry )r� r| )r� N)r� r| )Nrz )NNr r NNN)Nrz )NN)=r! r+ rc r4 Zos.pathr rI r� rC rz r r{ r� r� �pwdr Zgrpr �__all__rX r r r r" � Exceptionr# r[ � NameErrorr r1 r r r
r r r r
r rn r rp rw rx r� r� r� r� r r r r r r� r r r� r� r� r� r� r r r r r �<module>
s�
Q
1(
=
0
6
%
pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.opt-1.pyc 0000644 00000037031 14751155150 0022177 0 ustar 00 3
���eKi � @ s� d Z ddlZddlZddlZddlZddlmZmZ y ddlZW n e k
r\ ddl
ZY nX dddddd d
d d d
dg Z dd� Z ej
r�ejje ej
��Zn e ej� �Zejdkr�dedEd� j� kr�e ejjee��Zejdko�dedFd� j� k�r
e ejjeee��Zejdk�r@dedGd� j� k�r@e ejjeee��Zdd� Ze� Zdadd � Zej� Zejd �Z d d � Z ej j � d Z ej dd � Z!e d e d! Z"ejj#ej$�Z%ejj#ej&�Z'da(dZ)d"d#� Z*d$d%� Z+d&d'� Z,d(d)� Z-d*d+� Z.d,d-� Z/dHd.d/�Z0d0d� Z1d1d2� Z2d3d4� Z3dId5d�Z4d6d� Z5d7d
� Z6d8d � Z7e.� dd9fd:d
�Z8e.� dd9fd;d�Z9d<d� Z:d=d� Z;d>d � Z<d?d � Z=d@dA� Z>dBdC� Z?e@dDk�r�e?� dS )Jz-Access to Python's configuration information.� N)�pardir�realpath�get_config_h_filename�get_config_var�get_config_vars�get_makefile_filename�get_path�get_path_names� get_paths� get_platform�get_python_version�get_scheme_names�parse_config_hc C s" yt | �S tk
r | S X d S )N)r �OSError)�path� r � /usr/lib/python3.6/sysconfig.py�_safe_realpath" s r �ntZpcbuild� z\pc\v�
z\pcbuild\amd64� c C s. x(dD ] } t jjt jjtd| ��rdS qW dS )N�
Setup.dist� Setup.local�ModulesTF)r r )�osr �isfile�join�
_PROJECT_BASE)�fnr r r �is_python_build: s
r Fc C s� t s�ddlm} tjdd�d }| |�}|jd�}|j� �}tj|� W d Q R X t r~x(dD ] }tj
|d d
� tj
|d d � qZW d
a d S )N� )�finder�.� r z
sysconfig.cfg� posix_prefix�
posix_home�includez{srcdir}/Include� platincludez{projectbase}/.T)r% r& ) � _cfg_readZ resourcesr" �__name__�rsplit�findZ as_stream�_SCHEMESZreadfp�
_PYTHON_BUILD�set)r" Zbackport_packageZ_finderZ_cfgfile�s�schemer r r �_ensure_cfg_readD s
r2 z \{([^{]*?)\}c s� t � | jd�r | jd�}nt� }| j� }xD|D ]<}|dkr>q0x,|D ]$\}}| j||�rZqD| j|||� qDW q0W | jd� xX| j� D ]L}t| j|��� � fdd�}x,| j|�D ] \}}| j||t j
||�� q�W q�W d S )N�globalsc s$ | j d�}|� kr� | S | j d�S )Nr$ r )�group)�matchobj�name)� variablesr r � _replacero s
z"_expand_globals.<locals>._replacer) r2 Z has_section�items�tuple�sectionsZ
has_optionr/ Zremove_section�dict� _VAR_REPL�sub)�configr3 r; ZsectionZoption�valuer8 r )r7 r �_expand_globalsY s$
rA � r! c s � fdd�}t j|| �S )z�In the string `path`, replace tokens like {some.thing} with the
corresponding value from the map `local_vars`.
If there is no corresponding value, leave the token unchanged.
c s8 | j d�}|� kr� | S |tjkr.tj| S | j d�S )Nr$ r )r4 r �environ)r5 r6 )�
local_varsr r r8 � s
z _subst_vars.<locals>._replacer)r= r> )r rD r8 r )rD r � _subst_vars� s rE c C s4 | j � }x&|j� D ]\}}||kr$q|| |< qW d S )N)�keysr9 )� target_dict�
other_dict� target_keys�keyr@ r r r � _extend_dict� s
rK c C sd i }|d kri }t |t� � xBtj| �D ]4\}}tjdkrFtjj|�}tjjt ||��||< q(W |S )N�posixr )rL r )
rK r r- r9 r r6 r �
expanduser�normpathrE )r1 �vars�resrJ r@ r r r � _expand_vars� s
rQ c s � fdd�}t j|| �S )Nc s$ | j d�}|� kr� | S | j d�S )Nr$ r )r4 )r5 r6 )rO r r r8 � s
z format_value.<locals>._replacer)r= r> )r@ rO r8 r )rO r � format_value� s rR c C s t jdkrdS t jS )NrL r% )r r6 r r r r �_get_default_scheme� s
rS c C s� t jjdd �} dd� }t jdkrBt jjd�p.d}| r8| S ||d�S tjdkr|td �}|r|| r`| S |dd
|d tjd d � �S | r�| S |dd
�S d S )N�PYTHONUSERBASEc W s t jjt jj| � �S )N)r r rM r )�argsr r r �joinuser� s z _getuserbase.<locals>.joinuserr �APPDATA�~�Python�darwin�PYTHONFRAMEWORK�Libraryz%d.%dr! z.local)r rC �getr6 �sys�platformr � version_info)�env_baserV �base� frameworkr r r � _getuserbase� s"
rd c C s" t jd�}t jd�}t jd�}|dkr*i }i }i }tj| ddd��}|j� }W dQ R X x�|D ]�} | jd�s\| j� d krxq\|j| �}
|
r\|
jd
d �\} } | j� } | j d d �}
d
|
kr�| || < q\y t
| �} W n$ t k
r� | j d d
�|| < Y q\X | || < q\W t |j
� �}d}�x�t|�dk�r�x�t|�D �]�}|| }|j|��pJ|j|�}
|
dk �r�|
jd
�} d}| |k�r|t|| �}n�| |k�r�d}nx| tjk�r�tj| }n`| |k�r�|jd��r�|dd� |k�r�d }n$d| |k�r�d}nt|d| �}n d || < }|�r�||
j� d� }|d|
j� � | | }d
|k�rF|||< n~y t
|�}W n" t k
�rt |j� ||< Y n
X |||< |j|� |jd��r�|dd� |k�r�|dd� }||k�r�|||< n|||< |j|� �q(W �qW x.|j� D ]"\}} t| t��r�| j� ||< �q�W |j|� |S )z�Parse a Makefile-style file.
A dictionary containing name/value pairs is returned. If an
optional dictionary is passed in as the second argument, it is
used instead of a new dictionary.
z"([a-zA-Z][a-zA-Z0-9_]+)\s*=\s*(.*)z \$\(([A-Za-z][A-Za-z0-9_]*)\)z\${([A-Za-z][A-Za-z0-9_]*)}Nzutf-8�surrogateescape)�encoding�errors�#� r$ r! z$$�$�CFLAGS�LDFLAGS�CPPFLAGSr TF�PY_rB )rk rl rm )�re�compile�codecs�open� readlines�
startswith�strip�matchr4 �replace�int�
ValueError�listrF �lenr: �search�strr rC �end�start�remover9 �
isinstance�update)�filenamerO � _variable_rx� _findvar1_rx� _findvar2_rx�done�notdone�f�lines�line�m�n�v�tmpvr7 �renamed_variablesr6 r@ �found�item�after�kr r r �_parse_makefile� s�
r� c C sD t rtjjtd�S ttd�r,dttjf } nd} tjjt d�| d�S )z Return the path of the Makefile.�Makefile�abiflagsz config-%s%sr? �stdlib)
r. r r r r �hasattrr^ �_PY_VERSION_SHORTr� r )�config_dir_namer r r r M s
c C s� t � }yt|| � W nJ tk
r^ } z.d| }t|d�rF|d|j }t|��W Y dd}~X nX t� }y"t|��}t|| � W dQ R X W nJ tk
r� } z.d| }t|d�r�|d|j }t|��W Y dd}~X nX tr�| d | d< dS )z7Initialize the module as appropriate for POSIX systems.z.invalid Python installation: unable to open %s�strerrorz (%s)N� BLDSHARED�LDSHARED) r r� �IOErrorr� r� r rr r r. )rO �makefile�e�msg�config_hr� r r r � _init_posixX s&
r� c C sV t d�| d< t d�| d< t d�| d< d| d< d | d
< t| d < tjjttj��| d < d
S )z+Initialize the module as appropriate for NTr� �LIBDEST�
platstdlib�
BINLIBDESTr' � INCLUDEPYz.pyd�SOz.exe�EXE�VERSION�BINDIRN)r �_PY_VERSION_SHORT_NO_DOTr r �dirnamer r^ �
executable)rO r r r �_init_non_posixt s r� c C s� |dkr i }t jd�}t jd�}xx| j� }|s0P |j|�}|rz|jdd�\}}y t|�}W n tk
rn Y nX |||< q"|j|�}|r"d||jd�< q"W |S )z�Parse a config.h-style file.
A dictionary containing name/value pairs is returned. If an
optional dictionary is passed in as the second argument, it is
used instead of a new dictionary.
Nz"#define ([A-Z][A-Za-z0-9_]+) (.*)
z&/[*] #undef ([A-Z][A-Za-z0-9_]+) [*]/
r$ r! r )ro rp �readlinerv r4 rx ry )�fprO � define_rx�undef_rxr� r� r� r� r r r r � s(
c C s: t r$tjdkr tjjtd�} q,t} ntd�} tjj| d�S )z Return the path of pyconfig.h.r �PCr( z
pyconfig.h)r. r r6 r r r r )�inc_dirr r r r � s
c C s t ttj� ��S )z,Return a tuple containing the schemes names.)r: �sortedr- r; r r r r r
� s c C s
t jd�S )z*Return a tuple containing the paths names.r% )r- Zoptionsr r r r r � s Tc C s& t � |rt| |�S ttj| ��S dS )z�Return a mapping containing an install scheme.
``scheme`` is the install scheme name. If not provided, it will
return the default scheme for the current platform.
N)r2 rQ r< r- r9 )r1 rO �expandr r r r
� s
c C s t |||�| S )z[Return a path corresponding to the scheme.
``scheme`` is the install scheme name.
)r
)r6 r1 rO r� r r r r � s c G s� t dk�r�i a tt d< tt d< tt d< tt d< td td t d< tt d < tt d
< tt d < ytjt d < W n tk
r� d
t d < Y nX t j
d#kr�t t � t j
dkr�t t � tj
dkr�t� t d< dt kr�tt d< ntt d �t d< to�t j
dk�r\t}y t j� }W n tk
�r d}Y nX t jjt d � �r\||k�r\t jj|t d �}t jj|�t d< tjdk�r�t j� d }t|jd�d �}|dk �r�x:d$D ]2}t | }tj d d |�}tj d d |�}|t |< �q�W n�d t j k�r t j d }x8d%D ]0}t | }tj d d |�}|d | }|t |< �q�W t j dd
�} tj d | �}
|
dk �r�|
j d!�} t jj!| ��s�x,d&D ]$}t | }tj d"d |�}|t |< �q^W | �r�g } x | D ]}
| j"t j |
�� �q�W | S t S dS )'ay With no arguments, return a dictionary of all configuration
variables relevant for the current platform.
On Unix, this means every variable defined in Python's installed Makefile;
On Windows and Mac OS it's a much smaller set.
With arguments, return a list of values that result from looking up
each argument in the configuration variable dictionary.
N�prefix� exec_prefix�
py_version�py_version_shortr r! �py_version_nodotrb �platbase� projectbaser� ri r �os2rL z2.6�userbase�srcdirrZ r# r rl �
BASECFLAGSrk � PY_CFLAGSr� z
-arch\s+\w+\s� z-isysroot [^ ]*Z ARCHFLAGSz-isysroot\s+(\S+)r$ z-isysroot\s+\S+(\s|$))r r� )rl r� rk r� r� )rl r� rk r� r� )rl r� rk r� r� )#� _CONFIG_VARS�_PREFIX� _EXEC_PREFIX� _PY_VERSIONr� r r^ r� �AttributeErrorr r6 r� r� �versionrd r r. �getcwdr r �isabsr rN r_ �unamerx �splitro r> rC r] r| r4 �exists�append)rU rb �cwdr� Zkernel_versionZ
major_versionrJ �flagsZarchrk r� Zsdk�valsr6 r r r r � s�
c C s t � j| �S )z�Return the value of a single variable using the dictionary returned by
'get_config_vars()'.
Equivalent to get_config_vars().get(name)
)r r] )r6 r r r r R s c C s` t jdkrnd} tjj| �}|d:kr(tjS tjjd|�}tj|t| � |� j� }|dkr\dS |dkrhdS tjS t jd ks�tt d
� r�tjS t j � \}}}}}|j� j
d d �}|j
d
d�}|j
d d�}|dd� dkr�d||f S |dd� dk�r(|d dk�rRd}dt |d �d |dd� f }�n*|dd� d k�rFd||f S |dd� d k�rfd |||f S |dd � d k�r�d }t j
d!�} | j|�}
|
�rR|
j� }�n�|dd � d"k�rRt� } | jd#�} | }
y td$�}W n tk
�r� Y nJX zt jd%|j� �}
W d|j� X |
dk �r4d&j|
jd�jd&�dd� �}
| �s>|
} | �rR| }d'}|
d& d(k�rd)t� jd*d �j� k�rd+}t� jd*�}t jd,|�}tt t |���}t|�dk�r�|d }n^|d;k�r�d+}nN|d<k�r�d0}n>|d=k�r�d1}n.|d>k�r�d3}n |d?k�rd4}nt d5|f ��n<|d-k�r2tj d@k�rRd/}n |dAk�rRtj dBk�rNd2}nd.}d9|||f S )Ca� Return a string that identifies the current platform.
This is used mainly to distinguish platform-specific build directories and
platform-specific built distributions. Typically includes the OS name
and version and the architecture (as supplied by 'os.uname()'),
although the exact information included depends on the OS; eg. for IRIX
the architecture isn't particularly important (IRIX only runs on SGI
hardware), but for Linux the kernel version isn't particularly
important.
Examples of returned values:
linux-i586
linux-alpha (?)
solaris-2.6-sun4u
irix-5.3
irix64-6.2
Windows will return one of:
win-amd64 (64bit Windows on AMD64 (aka x86_64, Intel64, EM64T, etc)
win-ia64 (64bit Windows on Itanium)
win32 (all others - specifically, sys.platform is returned)
For other non-POSIX platforms, currently just returns 'sys.platform'.
r z bit (r$ �)�amd64z win-amd64�itaniumzwin-ia64rL r� �/ri r� �_�-N� �linuxz%s-%s�sunosr �5�solarisz%d.%srB r! � �irix�aixz%s-%s.%s� �cygwinz[\d.]+rZ �MACOSX_DEPLOYMENT_TARGETz0/System/Library/CoreServices/SystemVersion.plistz=<key>ProductUserVisibleVersion</key>\s*<string>(.*?)</string>r# Zmacosxz10.4.z-archrk Zfatz
-arch\s+(\S+)�i386�ppc�x86_64ZintelZfat3�ppc64Zfat64Z universalz%Don't know machine value for archs=%r� �PowerPC�Power_Macintoshz%s-%s-%s���)r� r� )r� r� )r� r� r� )r� r� )r� r� r� r� l )r� r� l ) r r6 r^ r� r, r_ r{ �lowerr� r� rw rx ro rp rv r4 r r] rr r� r| �read�closer r� ru �findallr: r� r/ ry �maxsize)r� �i�j�look�osname�host�releaser� �machine�rel_rer� ZcfgvarsZmacverZ
macreleaser� ZcflagsZarchsr r r r [ s�
$
c C s t S )N)r� r r r r r � s c C sJ xDt t|j� ��D ]0\}\}}|dkr2td| � td||f � qW d S )Nr z%s: z
%s = "%s")� enumerater� r9 �print)�title�data�indexrJ r@ r r r � _print_dict s r c C sR t dt� � t dt� � t dt� � t � tdt� � t � tdt� � dS )z*Display all information sysconfig detains.zPlatform: "%s"zPython version: "%s"z!Current installation scheme: "%s"�Paths� VariablesN)r� r r rS r r
r r r r r �_main s r �__main__i����i����i�)N)N)A�__doc__rq r ro r^ Zos.pathr r Z configparser� ImportErrorZ ConfigParser�__all__r r� r r� r r� r6 r� r r r. r) r2 ZRawConfigParserr- rp r= rA r� r� r� r� r� rN r� r� r� r� r� �
_USER_BASErE rK rQ rR rS rd r� r r� r� r r r
r r
r r r r r r r r* r r r r �<module> s� "
#
v
#
pip/_vendor/distlib/_backport/__pycache__/shutil.cpython-36.pyc 0000644 00000051544 14751155150 0020551 0 ustar 00 3
�Ub/d � - @ s
d Z ddlZddlZddlZddlmZ ddlZddlZddlZddl m
Z
yddl Z dZ W n e
k
rt dZ Y nX yddlmZ W n e
k
r� dZY nX ydd lmZ W n e
k
r� dZY nX d
d d d
ddddddddddddddd d d gZG d d� de�ZG d d� de�ZG d!d� de�ZG d"d#� d#e�ZG d$d%� d%e�Zye W n ek
�rj dZY nX ded(d
�Z d)d*� Z d+d � Z d,d � Z d-d
� Z d.d� Z!d/d� Z"d0d � Z#dde"dfd1d�Z$dfd2d�Z%d3d4� Z&d5d� Z'd6d7� Z(d8d9� Z)d:d;� Z*dgd=d>�Z+dhd?d@�Z,didAdB�Z-e+djgdDfe+dkgdFfe+dlgdGfe-g dHfdI�Z.e �rRe+dmgdFfe.dJ< dKd� Z/dndMd�Z0dNd� Z1dodOd�Z2dPd� Z3dQdR� Z4dpdSd�Z5dTd � Z6dUdV� Z7dWdX� Z8dYdZ� Z9d[d\ge9g dDfd]ge9g dGfd^ge8g dHfd_�Z:e �r�d`ge9g dFfe:dJ< dadb� Z;dqdcd �Z<dS )rz�Utility functions for copying and archiving files and directory trees.
XXX The functions here don't copy the resource fork or other metadata on Mac.
� N)�abspath� )�tarfileTF)�getpwnam)�getgrnam� copyfileobj�copyfile�copymode�copystat�copy�copy2�copytree�move�rmtree�Error�SpecialFileError� ExecError� make_archive�get_archive_formats�register_archive_format�unregister_archive_format�get_unpack_formats�register_unpack_format�unregister_unpack_format�unpack_archive�ignore_patternsc @ s e Zd ZdS )r N)�__name__�
__module__� __qualname__� r r � /usr/lib/python3.6/shutil.pyr , s c @ s e Zd ZdZdS )r z|Raised when trying to do a kind of operation (e.g. copying) which is
not supported on a special file (e.g. a named pipe)N)r r r �__doc__r r r r r / s c @ s e Zd ZdZdS )r z+Raised when a command could not be executedN)r r r r! r r r r r 3 s c @ s e Zd ZdZdS )� ReadErrorz%Raised when an archive cannot be readN)r r r r! r r r r r" 6 s r" c @ s e Zd ZdZdS )�
RegistryErrorzVRaised when a registry operation with the archiving
and unpacking registries failsN)r r r r! r r r r r# 9 s r# � i c C s$ x | j |�}|sP |j|� qW dS )z=copy data from file-like object fsrc to file-like object fdstN)�read�write)�fsrc�fdstZlengthZbufr r r r C s
c C sX t tjd�r0ytjj| |�S tk
r. dS X tjjtjj| ��tjjtjj|��kS )N�samefileF)�hasattr�os�pathr) �OSError�normcaser )�src�dstr r r � _samefileK s r1 c C s� t | |�rtd| |f ��xL| |gD ]@}ytj|�}W n tk
rJ Y q$X tj|j�r$td| ��q$W t| d��&}t|d��}t ||� W dQ R X W dQ R X dS )zCopy data from src to dstz `%s` and `%s` are the same filez`%s` is a named pipe�rb�wbN)
r1 r r+ �statr- �S_ISFIFO�st_moder �openr )r/ r0 �fn�str' r( r r r r W s
c C s0 t td�r,tj| �}tj|j�}tj||� dS )z Copy mode bits from src to dst�chmodN)r* r+ r4 �S_IMODEr6 r: )r/ r0 r9 �moder r r r k s
c C s� t j| �}tj|j�}tt d�r4t j||j|jf� tt d�rJt j||� tt d�r�t|d�r�yt j ||j
� W n< t k
r� } z tt d� s�|j t j
kr�� W Y dd}~X nX dS )zCCopy all stat info (mode bits, atime, mtime, flags) from src to dst�utimer: �chflags�st_flags�
EOPNOTSUPPN)r+ r4 r; r6 r* r= �st_atime�st_mtimer: r> r? r- �errnor@ )r/ r0 r9 r< �whyr r r r
r s
c C s: t jj|�r"t jj|t jj| ��}t| |� t| |� dS )zVCopy data and mode bits ("cp src dst").
The destination may be a directory.
N)r+ r, �isdir�join�basenamer r )r/ r0 r r r r � s
c C s: t jj|�r"t jj|t jj| ��}t| |� t| |� dS )z]Copy data and all stat info ("cp -p src dst").
The destination may be a directory.
N)r+ r, rE rF rG r r
)r/ r0 r r r r � s
c s � fdd�}|S )z�Function that can be used as copytree() ignore parameter.
Patterns is a sequence of glob-style patterns
that are used to exclude filesc s, g }x � D ]}|j tj||�� q
W t|�S )N)�extend�fnmatch�filter�set)r, �names�
ignored_names�pattern)�patternsr r �_ignore_patterns� s
z)ignore_patterns.<locals>._ignore_patternsr )rO rP r )rO r r � s c C s� t j| �}|dk r || |�}nt� }t j|� g }�x|D �]
} | |krJq:t jj| | �}
t jj|| �} ytt jj|
�r�t j|
�} |r�t j| | � q�t jj | � r�|r�w:||
| � n(t jj
|
�r�t |
| |||� n
||
| � W q: t k
�r }
z|j
|
jd � W Y dd}
~
X q: tk
�rD } z|j|
| t|�f� W Y dd}~X q:X q:W yt| |� W nP tk
�r� } z2tdk �r�t|t��r�n|j
| |t|�f� W Y dd}~X nX |�r�t |��dS )a� Recursively copy a directory tree.
The destination directory must not already exist.
If exception(s) occur, an Error is raised with a list of reasons.
If the optional symlinks flag is true, symbolic links in the
source tree result in symbolic links in the destination tree; if
it is false, the contents of the files pointed to by symbolic
links are copied. If the file pointed by the symlink doesn't
exist, an exception will be added in the list of errors raised in
an Error exception at the end of the copy process.
You can set the optional ignore_dangling_symlinks flag to true if you
want to silence this exception. Notice that this has no effect on
platforms that don't support os.symlink.
The optional ignore argument is a callable. If given, it
is called with the `src` parameter, which is the directory
being visited by copytree(), and `names` which is the list of
`src` contents, as returned by os.listdir():
callable(src, names) -> ignored_names
Since copytree() is called recursively, the callable will be
called once for each directory that is copied. It returns a
list of names relative to the `src` directory that should
not be copied.
The optional copy_function argument is a callable that will be used
to copy each file. It will be called with the source path and the
destination path as arguments. By default, copy2() is used, but any
function that supports the same signature (like copy()) can be used.
Nr )r+ �listdirrK �makedirsr, rF �islink�readlink�symlink�existsrE r
r rH �args�EnvironmentError�append�strr
r- � WindowsError�
isinstance)r/ r0 �symlinks�ignoreZ
copy_functionZignore_dangling_symlinksrL rM �errors�nameZsrcnameZdstnameZlinkto�errrD r r r r
� sD $
*&c $ C st |rdd� }n|dkr dd� }yt jj| �r4td��W n( tk
r^ |t jj| tj� � dS X g }yt j| �}W n( t jk
r� |t j| tj� � Y nX x�|D ]�}t jj| |�}yt j |�j
}W n t jk
r� d}Y nX t j |�r�t
|||� q�yt j|� W q� t jk
�r0 |t j|tj� � Y q�X q�W yt j| � W n* t jk
�rn |t j| tj� � Y nX dS )a� Recursively delete a directory tree.
If ignore_errors is set, errors are ignored; otherwise, if onerror
is set, it is called to handle the error with arguments (func,
path, exc_info) where func is os.listdir, os.remove, or os.rmdir;
path is the argument to that function that caused it to fail; and
exc_info is a tuple returned by sys.exc_info(). If ignore_errors
is false and onerror is None, an exception is raised.
c W s d S )Nr )rW r r r �onerror s zrmtree.<locals>.onerrorNc W s � d S )Nr )rW r r r rb s z%Cannot call rmtree on a symbolic linkr )r+ r, rS r- �sys�exc_inforQ �errorrF �lstatr6 r4 �S_ISDIRr �remove�rmdir)r, �
ignore_errorsrb rL r` �fullnamer< r r r r � s>
c C s t jj| jt jj��S )N)r+ r, rG �rstrip�sep)r, r r r � _basename' s rn c C s� |}t jj|�rTt| |�r*t j| |� dS t jj|t| ��}t jj|�rTtd| ��yt j| |� W nf t k
r� t jj| �r�t
| |�r�td| |f ��t | |dd� t | � nt
| |� t j| � Y nX dS )a� Recursively move a file or directory to another location. This is
similar to the Unix "mv" command.
If the destination is a directory or a symlink to a directory, the source
is moved inside the directory. The destination path must not already
exist.
If the destination already exists but is not a directory, it may be
overwritten depending on os.rename() semantics.
If the destination is on our current filesystem, then rename() is used.
Otherwise, src is copied to the destination and then removed.
A lot more could be done here... A look at a mv.c shows a lot of
the issues this implementation glosses over.
Nz$Destination path '%s' already existsz.Cannot move a directory '%s' into itself '%s'.T)r] )r+ r, rE r1 �renamerF rn rV r r- �
_destinsrcr
r r �unlink)r/ r0 Zreal_dstr r r r , s$
c C sN t | �} t |�}| jtjj�s*| tjj7 } |jtjj�sD|tjj7 }|j| �S )N)r �endswithr+ r, rm �
startswith)r/ r0 r r r rp T s rp c C sN t dks| dkrdS y t | �}W n tk
r8 d}Y nX |dk rJ|d S dS )z"Returns a gid, given a group name.N� )r �KeyError)r` �resultr r r �_get_gid] s
rw c C sN t dks| dkrdS y t | �}W n tk
r8 d}Y nX |dk rJ|d S dS )z"Returns an uid, given a user name.Nrt )r ru )r` rv r r r �_get_uidi s
rx �gzipc
s ddd�}ddi} t r&d|d< d| d< |d k rD|| krDtd
j|���| d | j|d� }
tjj|
�} tjj| �s�|d k r�|jd | � |s�tj | � |d k r�|jd
� t
���t ��� � ���fdd�} |� s�t j
|
d|| �}
z|
j|| d� W d |
j� X |
S )a� Create a (possibly compressed) tar file from all the files under
'base_dir'.
'compress' must be "gzip" (the default), "bzip2", or None.
'owner' and 'group' can be used to define an owner and a group for the
archive that is being built. If not provided, the current owner and group
will be used.
The output tar file will be named 'base_name' + ".tar", possibly plus
the appropriate compression extension (".gz", or ".bz2").
Returns the output filename.
Zgz� )ry Nry z.gz�bz2�bzip2z.bz2NzCbad value for 'compress', or compression format not supported : {0}z.tarz creating %szCreating tar archivec s, � d k r� | _ �| _�d k r(�| _�| _| S )N)�gidZgname�uid�uname)Ztarinfo)r} �group�ownerr~ r r � _set_uid_gid� s z#_make_tarball.<locals>._set_uid_gidzw|%s)rJ )�_BZ2_SUPPORTED�
ValueError�format�getr+ r, �dirnamerV �inforR rx rw r r7 �add�close)� base_name�base_dir�compress�verbose�dry_runr� r� �loggerZtar_compressionZ compress_extZ archive_name� archive_dirr� �tarr )r} r� r� r~ r �
_make_tarballu s4
r� c C sd |r
d}nd}ddl m} ddlm} y|d||| g|d� W n |k
r^ td�| �Y nX d S ) Nz-rz-rqr )�DistutilsExecError)�spawn�zip)r� zkunable to create zip file '%s': could neither import the 'zipfile' module nor find a standalone zip utility)Zdistutils.errorsr� Zdistutils.spawnr� r )r� � zip_filenamer� r� Z
zipoptionsr� r� r r r �_call_external_zip� s r� c C s$ | d }t jj| �}t jj|�sB|dk r4|jd|� |sBt j|� y ddl}W n tk
rf d}Y nX |dkr�t||||� n�|dk r�|jd||� |�s |j |d|j
d�}xht j |�D ]Z\} }
} xN| D ]F} t jj t jj
| | ��}
t jj|
�r�|j|
|
� |dk r�|jd|
� q�W q�W |j� |S ) am Create a zip file from all the files under 'base_dir'.
The output zip file will be named 'base_name' + ".zip". Uses either the
"zipfile" Python module (if available) or the InfoZIP "zip" utility
(if installed and found on the default search path). If neither tool is
available, raises ExecError. Returns the name of the output zip
file.
z.zipNz creating %sr z#creating '%s' and adding '%s' to it�w)Z compressionz adding '%s')r+ r, r� rV r� rR �zipfile� ImportErrorr� �ZipFileZ ZIP_DEFLATED�walk�normpathrF �isfiler& r� )r� r� r� r� r� r� r� r� r� �dirpathZdirnames� filenamesr` r, r r r �
_make_zipfile� s8
r� r� zgzip'ed tar-filer| zbzip2'ed tar-filezuncompressed tar filezZIP file)�gztar�bztarr� r� r� c C s dd� t j� D �} | j� | S )z�Returns a list of supported formats for archiving and unarchiving.
Each element of the returned sequence is a tuple (name, description)
c S s g | ]\}}||d f�qS )rt r )�.0r` �registryr r r �
<listcomp> s z'get_archive_formats.<locals>.<listcomp>)�_ARCHIVE_FORMATS�items�sort)�formatsr r r r � s rz c C s~ |dkr g }t |tj�s$td| ��t |ttf�s:td��x0|D ](}t |ttf� s`t|�dkr@td��q@W |||ft| < dS )au Registers an archive format.
name is the name of the format. function is the callable that will be
used to create archives. If provided, extra_args is a sequence of
(name, value) tuples that will be passed as arguments to the callable.
description can be provided to describe the format, and will be returned
by the get_archive_formats() function.
Nz The %s object is not callablez!extra_args needs to be a sequencert z+extra_args elements are : (arg_name, value))r\ � collections�Callable� TypeError�tuple�list�lenr� )r` �function�
extra_args� description�elementr r r r s
c C s
t | = d S )N)r� )r` r r r r s c C s t j� } |dk r>|dk r$|jd|� t jj| �} |s>t j|� |dkrLt j}||d�}
y t| } W n tk
r� t d| ��Y nX | d } x | d D ]\}
}||
|
< q�W |dkr�||
d< ||
d < z| | |f|
�}W d|dk r�|dk r�|jd
| � t j| � X |S ) a� Create an archive file (eg. zip or tar).
'base_name' is the name of the file to create, minus any format-specific
extension; 'format' is the archive format: one of "zip", "tar", "bztar"
or "gztar".
'root_dir' is a directory that will be the root directory of the
archive; ie. we typically chdir into 'root_dir' before creating the
archive. 'base_dir' is the directory where we start archiving from;
ie. 'base_dir' will be the common prefix of all files and
directories in the archive. 'root_dir' and 'base_dir' both default
to the current directory. Returns the name of the archive file.
'owner' and 'group' are used when creating a tar archive. By default,
uses the current owner and group.
Nzchanging into '%s')r� r� zunknown archive format '%s'r r r� r� r� zchanging back to '%s')
r+ �getcwd�debugr, r �chdir�curdirr� ru r� )r� r� Zroot_dirr� r� r� r� r� r� Zsave_cwd�kwargs� format_info�func�arg�val�filenamer r r r s6
c C s dd� t j� D �} | j� | S )z�Returns a list of supported formats for unpacking.
Each element of the returned sequence is a tuple
(name, extensions, description)
c S s" g | ]\}}||d |d f�qS )r � r )r� r` r� r r r r� ] s z&get_unpack_formats.<locals>.<listcomp>)�_UNPACK_FORMATSr� r� )r� r r r r W s c C sz i }x.t j� D ]"\}}x|d D ] }|||< q W qW x,| D ]$}||kr:d}t|||| f ��q:W t|tj�svtd��dS )z+Checks what gets registered as an unpacker.r z!%s is already registered for "%s"z*The registered function must be a callableN)r� r� r# r\ r� r� r� ) �
extensionsr� r� Zexisting_extensionsr` r� Zext� extension�msgr r r �_check_unpack_optionsb s
r� c C s, |dkr g }t |||� ||||ft| < dS )aM Registers an unpack format.
`name` is the name of the format. `extensions` is a list of extensions
corresponding to the format.
`function` is the callable that will be
used to unpack archives. The callable will receive archives to unpack.
If it's unable to handle an archive, it needs to raise a ReadError
exception.
If provided, `extra_args` is a sequence of
(name, value) tuples that will be passed as arguments to the callable.
description can be provided to describe the format, and will be returned
by the get_unpack_formats() function.
N)r� r� )r` r� r� r� r� r r r r t s c C s
t | = dS )z*Removes the pack format from the registry.N)r� )r` r r r r � s c C s& t jj| �}t jj|�s"t j|� dS )z1Ensure that the parent directory of `path` existsN)r+ r, r� rE rR )r, r� r r r �_ensure_directory� s r� c C s� y ddl }W n tk
r( td��Y nX |j| �s@td| ��|j| �}z�x�|j� D ]�}|j}|jd�sVd|krtqVtj j
|f|j d��� }|s�qVt |� |j
d�sV|j|j�}t|d�}z|j|� W d|j� ~X qVW W d|j� X dS )z+Unpack zip `filename` to `extract_dir`
r Nz/zlib not supported, cannot unpack this archive.z%s is not a zip file�/z..r3 )r� r� r" Z
is_zipfiler� Zinfolistr� rs r+ r, rF �splitr� rr r% r7 r& r� ) r� � extract_dirr� r� r� r` �target�data�fr r r �_unpack_zipfile� s0
r� c C sP yt j| �}W n" t jk
r0 td| ��Y nX z|j|� W d|j� X dS )z:Unpack tar/tar.gz/tar.bz2 `filename` to `extract_dir`
z/%s is not a compressed or uncompressed tar fileN)r r7 ZTarErrorr" Z
extractallr� )r� r� Ztarobjr r r �_unpack_tarfile� s r� z.tar.gzz.tgzz.tarz.zip)r� r� r� z.bz2c C s: x4t j� D ](\}}x |d D ]}| j|�r |S q W q
W d S )Nr )r� r� rr )r� r` r� r� r r r �_find_unpack_format� s
r� c
C s� |dkrt j� }|dk rhy t| }W n" tk
rF tdj|���Y nX |d }|| |ft|d �� nHt| �}|dkr�tdj| ���t| d }tt| d �}|| |f|� dS )a� Unpack an archive.
`filename` is the name of the archive.
`extract_dir` is the name of the target directory, where the archive
is unpacked. If not provided, the current working directory is used.
`format` is the archive format: one of "zip", "tar", or "gztar". Or any
other registered format. If not provided, unpack_archive will use the
filename extension and see if an unpacker was registered for that
extension.
In case none is found, a ValueError is raised.
NzUnknown unpack format '{0}'r rt z Unknown archive format '{0}') r+ r� r� ru r� r� �dictr� r" )r� r� r� r� r� r� r r r r � s � @ )r� )FN)ry r r NNN)FF)r r N)r� ry )r� r| )r� N)r� r| )Nrz )NNr r NNN)Nrz )NN)=r! r+ rc r4 Zos.pathr rI r� rC rz r r{ r� r� �pwdr Zgrpr �__all__rX r r r r" � Exceptionr# r[ � NameErrorr r1 r r r
r r r r
r rn r rp rw rx r� r� r� r� r r r r r r� r r r� r� r� r� r� r r r r r �<module>
s�
Q
1(
=
0
6
%
pip/_vendor/distlib/_backport/__pycache__/tarfile.cpython-36.opt-1.pyc 0000644 00000172757 14751155150 0021640 0 ustar 00 3
�Ub�i � @ sN d dl mZ dZdZdZdZdZdZd dlZd dl Z d dl
Z
d dl Z d dl Z d dl
Z
d dlZd dlZyd dlZd dlZW n ek
r� d ZZY nX eefZyeef7 ZW n ek
r� Y nX d d
d d gZejd d
k r�d dlZnd dlZej Z dZ dZ e d Z dZ!dZ"dZ#dZ$dZ%dZ&dZ'dZ(dZ)dZ*dZ+dZ,dZ-d Z.d Z/d Z0d Z1d Z2d!Z3d"Z4d Z5d#Z6d$Z7e6Z8e&e'e(e)e,e-e.e*e+e/e0e1f Z9e&e'e.e1fZ:e/e0e1fZ;d�Z<e=d��Z>e?e?e?e@e@e@d-�ZAd.ZBd/ZCd0ZDd1ZEd2ZFd3ZGd4ZHd5ZIdZJd6ZKd7ZLd8ZMd9ZNd:ZOd;ZPd<ZQd$ZRd#ZSe jTd�k�rd?ZUnejV� ZUd@dA� ZWdBdC� ZXdDdE� ZYd;e8fdFdG�ZZdHdI� Z[d�dJdK�Z\eBdLfeCdMfeDdNfeEdOfeFdPfeGdQffeKdRffeLdSffeMeHB dTfeHdUfeMdVffeNdRffeOdSffePeIB dTfeIdUfePdVffeQdRffeRdSffeSeJB dWfeJdXfeSdVfff
Z]dYdZ� Z^G d[d � d e_�Z`G d\d]� d]e`�ZaG d^d_� d_e`�ZbG d`da� dae`�ZcG dbdc� dce`�ZdG ddde� dee`�ZeG dfdg� dgee�ZfG dhdi� diee�ZgG djdk� dkee�ZhG dldm� dmee�ZiG dndo� doee�ZjG dpdq� dqek�ZlG drds� dsek�ZmG dtdu� duek�ZnG dvdw� dwek�ZoG dxdy� dyek�ZpG dzd{� d{ek�ZqG d|d
� d
ek�ZrG d}d � d ek�ZsG d~d� dek�Ztd�d � Zue Zvesj Z dS )�� )�print_functionz
$Revision$z0.9.0u" Lars Gustäbel (lars@gustaebel.de)z5$Date: 2011-02-25 17:42:01 +0200 (Fri, 25 Feb 2011) $z?$Id: tarfile.py 88586 2011-02-25 15:42:01Z marc-andre.lemburg $u4 Gustavo Niemeyer, Niels Gustäbel, Richard Townsend.N�TarFile�TarInfo�
is_tarfile�TarError� � i � s ustar s ustar 00�d � � 0� 1� 2� 3� 4� 5� 6� 7� L� K� S� x� g� X� � �path�linkpath�size�mtime�uid�gid�uname�gname)ZatimeZctimer r r! r i � i � i ` i @ i i i i � � �@ � � � � �nt�cezutf-8c C s( | j ||�} | d|� |t| � t S )z8Convert a string to a null-terminated bytes object.
N)�encode�len�NUL)�s�length�encoding�errors� r4 � /usr/lib/python3.6/tarfile.py�stn� s r6 c C s* | j d�}|dkr | d|� } | j||�S )z8Convert a null-terminated bytes object to a string.
r r N���)�find�decode)r0 r2 r3 �pr4 r4 r5 �nts� s
r; c C s� | d t d�krJytt| dd�p"dd�}W q� tk
rF td��Y q�X n:d}x4tt| �d �D ] }|dK }|t| |d �7 }q`W |S ) z/Convert a number field to a python number.
r r% �ascii�strict�0r) zinvalid headerr )�chr�intr; �
ValueError�InvalidHeaderError�ranger. �ord)r0 �n�ir4 r4 r5 �nti� s rG c C s� d| kod|d k n r<d|d | f j d�t }n�|tksT| d|d kr\td��| dk r|tjdtjd | ��d } t� }x,t|d �D ] }|j d| d
@ � | dL } q�W |j dd � |S ) z/Convert a python number to a number field.
r r) r z%0*or< r$ zoverflow in number field�L�l� r% )
r- r/ �
GNU_FORMATrA �struct�unpack�pack� bytearrayrC �insert)rE �digits�formatr0 rF r4 r4 r5 �itn� s rS c C sh dt tjd| dd� �tjd| dd� � � }dt tjd| dd� �tjd | dd� � � }||fS )
a� Calculate the checksum for a member's header by summing up all
characters except for the chksum field which is treated as if
it was filled with spaces. According to the GNU tar sources,
some tars (Sun and NeXT) calculate chksum with signed char,
which will be different if there are chars in the buffer with
the high bit set. So we calculate two checksums, unsigned and
signed.
r$ Z148BN� Z356B� i Z148bZ356b)�sumrL rM )�bufZunsigned_chksumZ
signed_chksumr4 r4 r5 � calc_chksums� s 00rX c C s� |dkr dS |dkr8x | j d�}|s&P |j|� qW dS d}t||�\}}x8t|�D ],}| j |�}t|�|k rvtd��|j|� qTW |dkr�| j |�}t|�|k r�td��|j|� dS )zjCopy length bytes from fileobj src to fileobj dst.
If length is None, copy the entire content.
r Nr( i zend of file reachedi @ i @ )�read�write�divmodrC r. �IOError)�src�dstr1 rW ZBUFSIZE�blocks� remainder�br4 r4 r5 � copyfileobj s,
rb rI �-ra �d�cr: �r�wr0 �S�x�t�Tc C sP g }x@t D ]8}x2|D ] \}}| |@ |kr|j|� P qW |jd� q
W dj|�S )zcConvert a file's mode to a string of the form
-rwxrwxrwx.
Used by TarFile.list()
rc � )�filemode_table�append�join)�modeZperm�table�bit�charr4 r4 r5 �filemode8 s
rt c @ s e Zd ZdZdS )r zBase exception.N)�__name__�
__module__� __qualname__�__doc__r4 r4 r4 r5 r G s c @ s e Zd ZdZdS )� ExtractErrorz%General exception for extract errors.N)ru rv rw rx r4 r4 r4 r5 ry J s ry c @ s e Zd ZdZdS )� ReadErrorz&Exception for unreadable tar archives.N)ru rv rw rx r4 r4 r4 r5 rz M s rz c @ s e Zd ZdZdS )�CompressionErrorz.Exception for unavailable compression methods.N)ru rv rw rx r4 r4 r4 r5 r{ P s r{ c @ s e Zd ZdZdS )� StreamErrorz=Exception for unsupported operations on stream-like TarFiles.N)ru rv rw rx r4 r4 r4 r5 r| S s r| c @ s e Zd ZdZdS )� HeaderErrorz!Base exception for header errors.N)ru rv rw rx r4 r4 r4 r5 r} V s r} c @ s e Zd ZdZdS )�EmptyHeaderErrorz Exception for empty headers.N)ru rv rw rx r4 r4 r4 r5 r~ Y s r~ c @ s e Zd ZdZdS )�TruncatedHeaderErrorz Exception for truncated headers.N)ru rv rw rx r4 r4 r4 r5 r \ s r c @ s e Zd ZdZdS )�EOFHeaderErrorz"Exception for end of file headers.N)ru rv rw rx r4 r4 r4 r5 r� _ s r� c @ s e Zd ZdZdS )rB z Exception for invalid headers.N)ru rv rw rx r4 r4 r4 r5 rB b s rB c @ s e Zd ZdZdS )�SubsequentHeaderErrorz3Exception for missing and invalid extended headers.N)ru rv rw rx r4 r4 r4 r5 r� e s r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �
_LowLevelFilez�Low-level file object. Supports reading and writing.
It is used instead of a regular file object for streaming
access.
c C sF t jt jt jB t jB d�| }tt d�r2|t jO }t j||d�| _d S )N)rf rg �O_BINARYi� ) �os�O_RDONLY�O_WRONLY�O_CREAT�O_TRUNC�hasattrr� �open�fd)�self�namerp r4 r4 r5 �__init__r s
z_LowLevelFile.__init__c C s t j| j� d S )N)r� �closer� )r� r4 r4 r5 r� { s z_LowLevelFile.closec C s t j| j|�S )N)r� rY r� )r� r r4 r4 r5 rY ~ s z_LowLevelFile.readc C s t j| j|� d S )N)r� rZ r� )r� r0 r4 r4 r5 rZ � s z_LowLevelFile.writeN)ru rv rw rx r� r� rY rZ r4 r4 r4 r5 r� l s
r� c @ st e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d dd�Z d dd�Z
dd� Zdd� ZdS ) �_Streama� Class that serves as an adapter between TarFile and
a stream-like object. The stream-like object only
needs to have a read() or write() method and is accessed
blockwise. Use of gzip or bzip2 compression is possible.
A stream-like object could be for example: sys.stdin,
sys.stdout, a socket, a tape device etc.
_Stream is intended to be used only internally.
c C sR d| _ |dkr t||�}d| _ |dkr6t|�}|j� }|p<d| _|| _|| _|| _|| _d| _ d| _
d| _ y�|dkr�y ddl }W n t
k
r� td ��Y nX || _ |jd�| _|d
kr�| j� n| j� |d k�r$y ddl}W n t
k
r� td ��Y nX |d
k�rd| _|j� | _n
|j� | _W n& | j �s@| jj� d| _ � Y nX dS )
z$Construct a _Stream object.
TNF�*rl � r �gzz zlib module is not availablerf �bz2zbz2 module is not available)� _extfileobjr� � _StreamProxy� getcomptyper� rp �comptype�fileobj�bufsizerW �pos�closed�zlib� ImportErrorr{ �crc32�crc�
_init_read_gz�_init_write_gzr� �dbuf�BZ2Decompressor�cmp�
BZ2Compressorr� )r� r� rp r� r� r� r� r� r4 r4 r5 r� � sP
z_Stream.__init__c C s t | d�r| j r| j� d S )Nr� )r� r� r� )r� r4 r4 r5 �__del__� s z_Stream.__del__c C s� | j jd| j j| j j | j jd�| _tjdtt j � ��}| j
d| d � | j j d�rf| j dd � | _ | j
| j j
d d
�t � dS ) z6Initialize for writing with gzip compression.
� r z<Ls �s �z.gzNr z
iso-8859-1�replace���)r� Z compressobjZDEFLATED� MAX_WBITSZ
DEF_MEM_LEVELr� rL rN r@ �time�_Stream__writer� �endswithr- r/ )r� Z timestampr4 r4 r5 r� � s z_Stream._init_write_gzc C sR | j dkr | jj|| j�| _| jt|�7 _| j dkrD| jj|�}| j|� dS )z&Write string s to the stream.
r� �tarN) r� r� r� r� r� r. r� �compressr� )r� r0 r4 r4 r5 rZ � s
z
_Stream.writec C sR | j |7 _ x>t| j �| jkrL| jj| j d| j� � | j | jd� | _ qW dS )z]Write string s to the stream if a whole new block
is ready to be written.
N)rW r. r� r� rZ )r� r0 r4 r4 r5 Z__write� s z_Stream.__writec C s� | j r
dS | jdkr2| jdkr2| j| jj� 7 _| jdkr�| jr�| jj| j� d| _| jdkr�| jjtj d| j
d@ �� | jjtj d| j d@ �� | j s�| jj
� d| _ dS ) z[Close the _Stream object. No operation should be
done on it afterwards.
Nrg r� r� r� z<Ll �� T)r� rp r� rW r� �flushr� rZ rL rN r� r� r� r� )r� r4 r4 r5 r� � s
z
_Stream.closec C s� | j j| j j �| _d| _| jd�dkr0td��| jd�dkrFtd��t| jd��}| jd� |d @ r�t| jd��d
t| jd�� }| j |� |d @ r�x | jd�}| s�|t
kr�P q�W |d @ r�x | jd�}| s�|t
kr�P q�W |d@ r�| jd� d
S )z:Initialize for reading a gzip compressed fileobj.
r� r s �znot a gzip filer � z unsupported compression method� r* r$ r) r( N) r� Z
decompressobjr� r� r� �
_Stream__readrz r{ rD rY r/ )r� �flagZxlenr0 r4 r4 r5 r� s.
z_Stream._init_read_gzc C s | j S )z3Return the stream's file pointer position.
)r� )r� r4 r4 r5 �tell# s z _Stream.tellr c C s\ || j dkrNt|| j | j�\}}x t|�D ]}| j| j� q.W | j|� ntd��| j S )zXSet the stream's file pointer to pos. Negative seeking
is forbidden.
r z seeking backwards is not allowed)r� r[ r� rC rY r| )r� r� r_ r` rF r4 r4 r5 �seek( s z _Stream.seekNc C sZ |dkr:g }x | j | j�}|s P |j|� qW dj|�}n
| j |�}| jt|�7 _|S )z�Return the next size number of bytes from the stream.
If size is not defined, return all bytes of the stream
up to EOF.
Nrl )�_readr� rn ro r� r. )r� r rj rW r4 r4 r5 rY 5 s
z _Stream.readc C s� | j dkr| j|�S t| j�}xf||k r�| j| j�}|s:P y| jj|�}W n tk
rf td��Y nX | j|7 _|t|�7 }q W | jd|� }| j|d� | _|S )z+Return size bytes from the stream.
r� zinvalid compressed dataN) r� r� r. r� r� r� �
decompressr\ rz )r� r re rW r4 r4 r5 r� G s
z
_Stream._readc C sh t | j�}x:||k rD| jj| j�}|s(P | j|7 _|t |�7 }q W | jd|� }| j|d� | _|S )zsReturn size bytes from stream. If internal buffer is empty,
read another block from the stream.
N)r. rW r� rY r� )r� r re rW r4 r4 r5 Z__read\ s
z_Stream.__read)r )N)ru rv rw rx r� r� r� rZ r� r� r� r� r� rY r� r� r4 r4 r4 r5 r� � s 4
r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) r� zsSmall proxy class that enables transparent compression
detection for the Stream interface (mode 'r|*').
c C s || _ | j jt�| _d S )N)r� rY � BLOCKSIZErW )r� r� r4 r4 r5 r� q s z_StreamProxy.__init__c C s | j j| _| jS )N)r� rY rW )r� r r4 r4 r5 rY u s
z_StreamProxy.readc C s$ | j jd�rdS | j jd�r dS dS )Ns �r� s BZh91r� r� )rW �
startswith)r� r4 r4 r5 r� y s
z_StreamProxy.getcomptypec C s | j j� d S )N)r� r� )r� r4 r4 r5 r� � s z_StreamProxy.closeN)ru rv rw rx r� rY r� r� r4 r4 r4 r5 r� l s
r� c @ sL e Zd ZdZdZdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dS )� _BZ2Proxya Small proxy class that enables external file object
support for "r:bz2" and "w:bz2" modes. This is actually
a workaround for a limitation in bz2 module's BZ2File
class which (unlike gzip.GzipFile) has no support for
a file object argument.
r( i c C s( || _ || _t| j dd �| _| j� d S )Nr� )r� rp �getattrr� �init)r� r� rp r4 r4 r5 r� � s z_BZ2Proxy.__init__c C sD dd l }d| _| jdkr6|j� | _| jjd� d| _n
|j� | _d S )Nr rf r� ) r� r� rp r� �bz2objr� r� rW r� )r� r� r4 r4 r5 r� � s
z_BZ2Proxy.initc C s� t | j�}xF||k rP| jj| j�}|s(P | jj|�}| j|7 _|t |�7 }q W | jd |� }| j|d � | _| jt |�7 _|S )N)r. rW r� rY � blocksizer� r� r� )r� r ri �raw�datarW r4 r4 r5 rY � s
z_BZ2Proxy.readc C s& || j k r| j� | j|| j � d S )N)r� r� rY )r� r� r4 r4 r5 r� � s
z_BZ2Proxy.seekc C s | j S )N)r� )r� r4 r4 r5 r� � s z_BZ2Proxy.tellc C s. | j t|�7 _ | jj|�}| jj|� d S )N)r� r. r� r� r� rZ )r� r� r� r4 r4 r5 rZ � s z_BZ2Proxy.writec C s$ | j dkr | jj� }| jj|� d S )Nrg )rp r� r� r� rZ )r� r� r4 r4 r5 r� � s
z_BZ2Proxy.closeNi @ ) ru rv rw rx r� r� r� rY r� r� rZ r� r4 r4 r4 r5 r� � s
r� c @ s< e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zdd d �ZdS )� _FileInFilezA thin wrapper around an existing file object that
provides a part of its data as an individual file
object.
Nc C s� || _ || _|| _d| _|d kr*d|fg}d| _g | _d}| j}xT|D ]L\}}||krj| jjd||d f� | jjd||| |f� ||7 }|| }qFW || jk r�| jjd|| jd f� d S )Nr FT)r� �offsetr �position� map_index�maprn )r� r� r� r Z blockinfoZlastposZrealposr4 r4 r5 r� � s$
z_FileInFile.__init__c C s t | jd�sdS | jj� S )N�seekableT)r� r� r� )r� r4 r4 r5 r� � s z_FileInFile.seekablec C s | j S )z*Return the current file position.
)r� )r� r4 r4 r5 r� � s z_FileInFile.tellc C s
|| _ dS )z(Seek to a position in the file.
N)r� )r� r� r4 r4 r5 r� � s z_FileInFile.seekc C s� |dkr| j | j }nt|| j | j �}d}x�|dkr�xZ| j| j \}}}}|| j ko`|k n rjP q8| jd7 _| jt| j�kr8d| _q8W t||| j �}|r�| jj|| j| � || jj|�7 }n |t | 7 }||8 }| j|7 _q.W |S )z!Read data from the file.
Nr� r r )
r r� �minr� r� r. r� r� rY r/ )r� r rW r� �start�stopr� r1 r4 r4 r5 rY � s(
z_FileInFile.read)N)N) ru rv rw rx r� r� r� r� rY r4 r4 r4 r5 r� � s
r� c @ sz e Zd ZdZdZdd� Zdd� Zdd� Zd d
� Zdd d
�Z e Z
d dd�Z dd� Z dd� Z
ejfdd�Zdd� Zdd� Zd S ) � ExFileObjectzaFile-like object for reading an archive member.
Is returned by TarFile.extractfile().
i c C sD t |j|j|j|j�| _|j| _d| _d| _|j| _d| _d| _ d S )Nrf Fr r� )
r� r� � offset_datar �sparser� rp r� r� �buffer)r� �tarfile�tarinfor4 r4 r5 r� s
zExFileObject.__init__c C s dS )NTr4 )r� r4 r4 r5 �readable! s zExFileObject.readablec C s dS )NFr4 )r� r4 r4 r5 �writable$ s zExFileObject.writablec C s
| j j� S )N)r� r� )r� r4 r4 r5 r� ' s zExFileObject.seekableNc C s� | j rtd��d}| jrL|dkr.| j}d| _n | jd|� }| j|d� | _|dkrd|| jj� 7 }n|| jj|t|� �7 }| jt|�7 _|S )z~Read at most size bytes from the file. If size is not
present or None, read all data until EOF is reached.
z I/O operation on closed filer� N)r� rA r� r� rY r. r� )r� r rW r4 r4 r5 rY * s zExFileObject.readr c C s� | j rtd��| jjd�d }|dkrzxR| jj| j�}| j|7 _| sRd|kr(| jjd�d }|dkrtt| j�}P q(W |dkr�t||�}| jd|� }| j|d� | _| j t|�7 _ |S )z�Read one entire line from the file. If size is present
and non-negative, return a string with at most that
size, which may be an incomplete line.
z I/O operation on closed file�
r r Nr7 )
r� rA r� r8 r� rY r� r. r� r� )r� r r� rW r4 r4 r5 �readlineE s$
zExFileObject.readlinec C s& g }x | j � }|sP |j|� qW |S )z0Return a list with all remaining lines.
)r� rn )r� �result�liner4 r4 r5 � readlinesb s zExFileObject.readlinesc C s | j rtd��| jS )z*Return the current file position.
z I/O operation on closed file)r� rA r� )r� r4 r4 r5 r� l s zExFileObject.tellc C s� | j rtd��|tjkr.tt|d�| j�| _nj|tjkrj|dk rTt| j| d�| _q�t| j| | j�| _n.|tj kr�tt| j| | j�d�| _ntd��d| _
| j j | j� dS )z(Seek to a position in the file.
z I/O operation on closed filer zInvalid argumentr� N)
r� rA r� �SEEK_SETr� �maxr r� �SEEK_CUR�SEEK_ENDr� r� r� )r� r� �whencer4 r4 r5 r� t s
zExFileObject.seekc C s
d| _ dS )z Close the file object.
TN)r� )r� r4 r4 r5 r� � s zExFileObject.closec c s x| j � }|sP |V qW dS )z/Get an iterator over the file's lines.
N)r� )r� r� r4 r4 r5 �__iter__� s
zExFileObject.__iter__)Nr7 )r7 )ru rv rw rx r� r� r� r� r� rY �read1r� r� r� r� r� r� r� r� r4 r4 r4 r5 r� s
r� c @ s� e Zd ZdZdiZdjdd�Zdd� Zdd � Zeee�Z d d � Z
d d � Z ee
e �Z d!d"� Z
d#d$� Zeed%fd&d'�Zd(d)� Zd*d+� Zd,d-� Zed.d/� �Zd0d1� Zed2d3� �Zed4d5� �Zed6d7� �Zed8d9� �Z ed:d;� �Z ed<d=� �Z d>d?� Z d@dA� Z dBdC� Z!dDdE� Z"dFdG� Z#dHdI� Z$dJdK� Z%dLdM� Z&dNdO� Z'dPdQ� Z(dRdS� Z)dTdU� Z*dVdW� Z+dXdY� Z,dZd[� Z-d\d]� Z.d^d_� Z/d`da� Z0dbdc� Z1ddde� Z2dfdg� Z3dhS )kr a Informational class which holds the details about an
archive member given by a tar header block.
TarInfo objects are returned by TarFile.getmember(),
TarFile.getmembers() and TarFile.gettarinfo() and are
usually created internally.
r� rp r r! r r �chksum�type�linknamer" r# �devmajor�devminorr� r� � pax_headersr� r� �_sparse_structs� _link_targetrl c C sj || _ d| _d| _d| _d| _d| _d| _t| _d| _ d| _
d| _ d| _ d| _
d| _d| _d| _i | _dS )zXConstruct a TarInfo object. name is the optional name
of the member.
i� r rl N)r� rp r r! r r r� �REGTYPEr� r� r" r# r� r� r� r� r� r� )r� r� r4 r4 r5 r� � s" zTarInfo.__init__c C s | j S )N)r� )r� r4 r4 r5 �_getpath� s zTarInfo._getpathc C s
|| _ d S )N)r� )r� r� r4 r4 r5 �_setpath� s zTarInfo._setpathc C s | j S )N)r� )r� r4 r4 r5 � _getlinkpath� s zTarInfo._getlinkpathc C s
|| _ d S )N)r� )r� r� r4 r4 r5 � _setlinkpath� s zTarInfo._setlinkpathc C s d| j j| jt| �f S )Nz<%s %r at %#x>)� __class__ru r� �id)r� r4 r4 r5 �__repr__� s zTarInfo.__repr__c C sn | j | jd@ | j| j| j| j| j| j| j| j | j
| j | j d�
}|d t
krj|d jd� rj|d d7 < |S )z9Return the TarInfo's attributes as a dictionary.
i� )
r� rp r r! r r r� r� r� r" r# r� r� r� r� �/)r� rp r r! r r r� r� r� r" r# r� r� �DIRTYPEr� )r� �infor4 r4 r5 �get_info� s
zTarInfo.get_info�surrogateescapec C sT | j � }|tkr | j|||�S |tkr4| j|||�S |tkrH| j||�S td��dS )z<Return a tar header as a string of 512 byte blocks.
zinvalid formatN)r� � USTAR_FORMAT�create_ustar_headerrK �create_gnu_header�
PAX_FORMAT�create_pax_headerrA )r� rR r2 r3 r� r4 r4 r5 �tobuf� s z
TarInfo.tobufc C sZ t |d< t|d �tkr td��t|d �tkrJ| j|d �\|d< |d< | j|t||�S )z3Return the object as a ustar header block.
�magicr� zlinkname is too longr� �prefix)� POSIX_MAGICr. � LENGTH_LINKrA � LENGTH_NAME�_posix_split_name�_create_headerr� )r� r� r2 r3 r4 r4 r5 r� � s zTarInfo.create_ustar_headerc C sp t |d< d}t|d �tkr4|| j|d t||�7 }t|d �tkr\|| j|d t||�7 }|| j|t||� S )z:Return the object as a GNU header block sequence.
r� r� r� r� ) � GNU_MAGICr. r� �_create_gnu_long_header�GNUTYPE_LONGLINKr� �GNUTYPE_LONGNAMEr rK )r� r� r2 r3 rW r4 r4 r5 r� s zTarInfo.create_gnu_headerc
C s4 t |d< | jj� }x�ddtfddtfddfD ]h\}}}||kr@q,y|| jd d
� W n" tk
rv || ||< w,Y nX t|| �|kr,|| ||< q,W xldD ]d\}}||kr�d||< q�|| }d| ko�d |d k n � s�t|t �r�t
|�||< d||< q�W |�r | j |t |�} nd} | | j
|td d� S ) z�Return the object as a ustar header block. If it cannot be
represented this way, prepend a pax extended header sequence
with supplement information.
r� r� r r� r r" r' r# r< r= r r) r! r � r r r r� r� )r" r" r' )r# r# r' �r r) �r! r) �r r �r r )r r r r
)r� r� �copyr� r� r- �UnicodeEncodeErrorr. �
isinstance�float�str�_create_pax_generic_header�XHDTYPEr r� )
r� r� r2 r� r� Zhnamer1 rQ �valrW r4 r4 r5 r� s4
. zTarInfo.create_pax_headerc C s | j |td�S )zAReturn the object as a pax global header block sequence.
�utf8)r �XGLTYPE)�clsr� r4 r4 r5 �create_pax_global_headerD s z TarInfo.create_pax_global_headerc C sp |dt d � }x |r0|d dkr0|dd� }qW |t|�d� }|dd� }| s`t|�tkrhtd��||fS )zUSplit a name longer than 100 chars into a prefix
and a name part.
Nr r� zname is too longr7 r7 r7 )�
LENGTH_PREFIXr. r� rA )r� r� r� r4 r4 r5 r J s zTarInfo._posix_split_namec C sV t | jdd�d||�t| jdd�d@ d|�t| jdd�d|�t| jd d�d|�t| jd
d�d |�t| jd d�d |�d
| jdt�t | jdd�d||�| jdt�t | jdd�d||�t | jdd�d||�t| jdd�d|�t| jdd�d|�t | jdd�d||�g}tjdt dj|��}t |t d� �d }|dd � d | j
d � |d d� }|S )!z�Return a header block. info is a dictionary with file
information, format must be one of the *_FORMAT constants.
r� rl r
rp r i� r) r r! r r r s r� r� r� r" r' r# r� r� r� r z%dsr� Nil z%06o r< ie i����i����) r6 �getrS r� r� rL rN r� ro rX r- )r� rR r2 r3 �partsrW r� r4 r4 r5 r Y s&
&zTarInfo._create_headerc C s. t t| �t�\}}|dkr*| t| t 7 } | S )zdReturn the string payload filled with zero bytes
up to the next 512 byte border.
r )r[ r. r� r/ )Zpayloadr_ r` r4 r4 r5 �_create_payloadu s zTarInfo._create_payloadc C sR |j ||�t }i }d|d< ||d< t|�|d< t|d< | j|t||�| j|� S )zTReturn a GNUTYPE_LONGNAME or GNUTYPE_LONGLINK sequence
for name.
z
././@LongLinkr� r� r r� )r- r/ r. r r r� r )r r� r� r2 r3 r� r4 r4 r5 r s z TarInfo._create_gnu_long_headerc C s: d}x@|j � D ]4\}}y|jdd� W q tk
r@ d}P Y qX qW d}|rV|d7 }x�|j � D ]�\}}|jd�}|r�|j|d�}n
|jd�}t|�t|� d }d } }
x"|tt|
�� } | |
kr�P | }
q�W |tt|
�d
�d | d | d
7 }q`W i } d| d< || d< t|�| d< t| d< | j| td
d�| j |� S )z�Return a POSIX.1-2008 extended or global header sequence
that contains a list of keyword, value pairs. The values
must be strings.
Fr r= Tr� s 21 hdrcharset=BINARY
r� r r r< � � =r� z././@PaxHeaderr� r� r r� r� )
�itemsr- r r. r �bytesr� r r� r ) r r� r� r2 Zbinary�keyword�valueZrecordsrI rE r: r� r4 r4 r5 r � s<
* z"TarInfo._create_pax_generic_headerc C st t |�dkrtd��t |�tkr(td��|jt�tkr>td��t|dd� �}|t|�krbt d��| � }t
|dd� ||�|_ t|dd � �|_ t|d d
� �|_
t|d
d � �|_t|d d � �|_t|d d� �|_||_|dd
� |_t
|d
d� ||�|_t
|dd� ||�|_t
|dd� ||�|_t|dd� �|_t|dd� �|_t
|dd� ||�}|jtk�r�|j jd��r�t|_|jtk�r6d}g }xrt d�D ]f} y0t|||d � �}
t||d |d � �} W n t k
�r� P Y nX |j |
| f� |d7 }�q�W t |d �} t|dd � �}
|| |
f|_ |j!� �rN|j j"d�|_ |�rp|jt#k�rp|d |j |_ |S ) zAConstruct a TarInfo object from a 512 byte bytes object.
r z empty headerztruncated headerzend of file headerrT rU z bad checksumr
�l �t �| � � i i i) iI iQ iY i� r� i� r* r � i� i� i� )$r. r~ r� r �countr/ r� rG rX rB r; r� rp r r! r r r� r� r� r" r# r� r� �AREGTYPEr� r� �GNUTYPE_SPARSErC rA rn �boolr� �isdir�rstrip� GNU_TYPES)r rW r2 r3 r� �objr� r� �structsrF r� �numbytes�
isextended�origsizer4 r4 r5 �frombuf� sZ
zTarInfo.frombufc C s8 |j jt�}| j||j|j�}|j j� t |_|j|�S )zOReturn the next TarInfo object from TarFile object
tarfile.
) r� rY r� r3 r2 r3 r� r� � _proc_member)r r� rW r. r4 r4 r5 � fromtarfile s zTarInfo.fromtarfilec C sT | j ttfkr| j|�S | j tkr,| j|�S | j tttfkrF| j |�S | j
|�S dS )zYChoose the right processing method depending on
the type and call it.
N) r� r r �
_proc_gnulongr) � _proc_sparser r �SOLARIS_XHDTYPE� _proc_pax�
_proc_builtin)r� r� r4 r4 r5 r4 s
zTarInfo._proc_memberc C sR |j j� | _| j}| j� s$| jtkr4|| j| j�7 }||_| j |j
|j |j � | S )zfProcess a builtin type or an unknown type which
will be treated as a regular file.
)
r� r� r� �isregr� �SUPPORTED_TYPES�_blockr r� �_apply_pax_infor� r2 r3 )r� r� r� r4 r4 r5 r: $ s zTarInfo._proc_builtinc C s� |j j| j| j��}y| j|�}W n tk
r> td��Y nX | j|_| jt krft
||j |j �|_
n | jtkr�t
||j |j �|_|S )zSProcess the blocks that hold a GNU longname
or longlink member.
z missing or bad subsequent header)r� rY r= r r5 r} r� r� r� r r; r2 r3 r� r r� )r� r� rW �nextr4 r4 r5 r6 5 s
zTarInfo._proc_gnulongc
C s� | j \}}}| ` x�|r�|jjt�}d}xvtd�D ]j}y0t|||d � �}t||d |d � �} W n tk
rz P Y nX |r�| r�|j|| f� |d7 }q0W t|d �}qW || _ |jj
� | _ | j | j | j
� |_|| _
| S )z8Process a GNU sparse header plus extra headers.
r � r r& i� )r� r� rY r� rC rG rA rn r* r� r� r� r= r r� )
r� r� r/ r1 r2 rW r� rF r� r0 r4 r4 r5 r7 K s( zTarInfo._proc_sparsec C s |j j| j| j��}| jtkr&|j}n
|jj� }tj d|�}|dk rX|j
d�j d�|d< |j d�}|dkrr|j
}nd}tjd�}d}x�|j||�}|s�P |j� \} }
t| �} ||jd �d |jd�| d � } | j|
dd|j�}
|
tk�r| j| ||j
|j�} n| j| dd|j�} | ||
< || 7 }q�W y| j|�} W n tk
�rT td
��Y nX d |k�rn| j| |� nHd |k�r�| j| ||� n.|j d
�dk�r�|j d�dk�r�| j | ||� | jt t fk�r | j ||j
|j� | j | _ d|k�r | j!}
| j"� �s| jt#k�r|
| j| j�7 }
|
|_ | S )zVProcess an extended or global header as described in
POSIX.1-2008.
s \d+ hdrcharset=([^\n]+)\nNr r �
hdrcharsetZBINARYs (\d+) ([^=]+)=r r z missing or bad subsequent headerzGNU.sparse.mapzGNU.sparse.sizezGNU.sparse.major�1zGNU.sparse.minorr> r )$r� rY r= r r� r r� r �re�search�groupr9 r r2 �compile�match�groupsr@ �endr� �_decode_pax_fieldr3 �PAX_NAME_FIELDSr5 r} r� �_proc_gnusparse_01�_proc_gnusparse_00�_proc_gnusparse_10r r8 r> r� r� r; r< )r� r� rW r� rG rA r2 Zregexr� r1 r r r? r� r4 r4 r5 r9 g s`
$
zTarInfo._proc_paxc C sp g }x(t jd|�D ]}|jt|jd��� qW g }x(t jd|�D ]}|jt|jd��� q@W tt||��|_dS )z?Process a GNU tar extended sparse header, version 0.0.
s \d+ GNU.sparse.offset=(\d+)\nr s \d+ GNU.sparse.numbytes=(\d+)\nN)rC �finditerrn r@ rE �list�zipr� )r� r? r� rW ZoffsetsrG r0 r4 r4 r5 rM � s zTarInfo._proc_gnusparse_00c C s@ dd� |d j d�D �}tt|ddd� |ddd� ��|_dS )z?Process a GNU tar extended sparse header, version 0.1.
c S s g | ] }t |��qS r4 )r@ )�.0ri r4 r4 r5 �
<listcomp>� s z.TarInfo._proc_gnusparse_01.<locals>.<listcomp>zGNU.sparse.map�,Nr r )�splitrP rQ r� )r� r? r� r� r4 r4 r5 rL � s zTarInfo._proc_gnusparse_01c C s� d}g }|j jt�}|jdd�\}}t|�}xJt|�|d k rvd|krV||j jt�7 }|jdd�\}}|jt|�� q.W |j j� |_t t
|ddd� |ddd� ��|_ dS )z?Process a GNU tar extended sparse header, version 1.0.
Nr� r r ) r� rY r� rU r@ r. rn r� r� rP rQ r� )r� r? r� r� Zfieldsr� rW Znumberr4 r4 r5 rN � s zTarInfo._proc_gnusparse_10c
C s� x�|j � D ]�\}}|dkr(t| d|� q
|dkrBt| dt|�� q
|dkr\t| dt|�� q
|tkr
|tkr�yt| |�}W n tk
r� d}Y nX |dkr�|jd�}t| ||� q
W |j� | _dS ) zoReplace fields with supplemental information from a previous
pax extended or global header.
zGNU.sparse.namer zGNU.sparse.sizer zGNU.sparse.realsizer r� N) r �setattrr@ �
PAX_FIELDS�PAX_NUMBER_FIELDSrA r, r r� )r� r� r2 r3 r r r4 r4 r5 r> � s"
zTarInfo._apply_pax_infoc C s. y |j |d�S tk
r( |j ||�S X dS )z1Decode a single field from a pax record.
r= N)r9 �UnicodeDecodeError)r� r r2 Zfallback_encodingZfallback_errorsr4 r4 r5 rJ s zTarInfo._decode_pax_fieldc C s" t |t�\}}|r|d7 }|t S )z_Round up a byte count by BLOCKSIZE and return it,
e.g. _block(834) => 1024.
r )r[ r� )r� r' r_ r` r4 r4 r5 r=
s zTarInfo._blockc C s
| j tkS )N)r� �
REGULAR_TYPES)r� r4 r4 r5 r; s z
TarInfo.isregc C s | j � S )N)r; )r� r4 r4 r5 �isfile s zTarInfo.isfilec C s
| j tkS )N)r� r� )r� r4 r4 r5 r+ s z
TarInfo.isdirc C s
| j tkS )N)r� �SYMTYPE)r� r4 r4 r5 �issym s z
TarInfo.issymc C s
| j tkS )N)r� �LNKTYPE)r� r4 r4 r5 �islnk s z
TarInfo.islnkc C s
| j tkS )N)r� �CHRTYPE)r� r4 r4 r5 �ischr s z
TarInfo.ischrc C s
| j tkS )N)r� �BLKTYPE)r� r4 r4 r5 �isblk" s z
TarInfo.isblkc C s
| j tkS )N)r� �FIFOTYPE)r� r4 r4 r5 �isfifo$ s zTarInfo.isfifoc C s
| j d k S )N)r� )r� r4 r4 r5 �issparse& s zTarInfo.issparsec C s | j tttfkS )N)r� r` rb rd )r� r4 r4 r5 �isdev( s z
TarInfo.isdevN)r� rp r r! r r r� r� r� r" r# r� r� r� r� r� r� r� r� r� )rl )4ru rv rw rx � __slots__r� r� r� �propertyr r� r� r r� r� �DEFAULT_FORMAT�ENCODINGr� r� r� r� � classmethodr r � staticmethodr r r r r3 r5 r4 r: r6 r7 r9 rM rL rN r> rJ r= r; r[ r+ r] r_ ra rc re rf rg r4 r4 r4 r5 r � s`
1
3 ?
f c @ s� e Zd ZdZdZdZdZdZeZ e
Z dZ e
ZeZdVdd �Zedddefd
d ��ZedWd d
��ZedXdd��ZedYdd��Zdddd�Zdd� Zdd� Zdd � Zd d � Z dZd d �Z d[d"d#�Z d\d$d%�Z d]d&d'�Z d^d)d*�Z!d_d,d-�Z"d.d/� Z#d`d0d1�Z$d2d3� Z%d4d5� Z&d6d7� Z'd8d9� Z(d:d;� Z)d<d=� Z*d>d?� Z+d@dA� Z,dBdC� Z-dDdE� Z.dadFdG�Z/dHdI� Z0dbdJdK�Z1dLdM� Z2dNdO� Z3dPdQ� Z4dRdS� Z5dTdU� Z6dS )cr z=The TarFile Class provides an interface to tar archives.
r Fr Nrf r� c
C s� t |�dks|dkr td��|| _dddd�| | _|sp| jdkr\tjj|� r\d | _d| _t|| j�}d
| _n0|d kr�t |d �r�|j
}t |d
�r�|j| _d| _|r�tjj |�nd | _
|| _ |d k r�|| _
|d k r�|| _|d k r�|| _|d k r�|| _|d k �r|| _| | _|
d k �r(| j
tk�r(|
| _ni | _| d k �r>| | _| d k �rN| | _d
| _g | _d
| _| j j� | _i | _ y�| jdk�r�d | _ | j � | _ | jdk�r$x�| j j | j� y | jj | �}| jj!|� W nT t"k
�r� | j j | j� P Y n0 t#k
�r }
zt$t%|
���W Y d d }
~
X nX �q�W | jdk�rnd| _| j�rn| jj&| jj'� �}| j j(|� | jt |�7 _W n& | j�s�| j j)� d| _� Y nX d S )a� Open an (uncompressed) tar archive `name'. `mode' is either 'r' to
read from an existing archive, 'a' to append data to an existing
file or 'w' to create a new file overwriting an existing one. `mode'
defaults to 'r'.
If `fileobj' is given, it is used for reading or writing data. If it
can be determined, `mode' is overridden by `fileobj's mode.
`fileobj' is not closed, when TarFile is closed.
r r� z mode must be 'r', 'a' or 'w'�rbzr+b�wb)rf �arg rp rg FNr� rp Trf �aw)*r. rA rp �_moder� r �exists� bltn_openr� r� r� �abspathr� rR r� � dereference� ignore_zerosr2 r3 r� r� �debug�
errorlevelr� �members�_loadedr� r� �inodes� firstmemberr? r� r5 rn r� r} rz r r r rZ r� )r� r� rp r� rR r� rv rw r2 r3 r� rx ry �erW r4 r4 r5 r� F s�
$
zTarFile.__init__c
K s� | r| rt d��|dkr�xz| jD ]p}t| | j| �}|dk rH|j� }y||d|f|�S ttfk
r� } z|dk r�|j|� w$W Y dd} ~ X q$X q$W td���nd|k�r|jdd�\}
}|
p�d}
|p�d}|| jkr�t| | j| �}n td | ��|||
|f|�S d
|k�r�|jd
d�\}
}|
�p(d}
|�p2d}|
d k�rFt d ��t||
|||�} y| ||
| f|�} W n | j � � Y nX d
| _
| S |dk�r�| j |||f|�S t d��dS )a| Open a tar archive for reading, writing or appending. Return
an appropriate TarFile class.
mode:
'r' or 'r:*' open for reading with transparent compression
'r:' open for reading exclusively uncompressed
'r:gz' open for reading with gzip compression
'r:bz2' open for reading with bzip2 compression
'a' or 'a:' open for appending, creating the file if necessary
'w' or 'w:' open for writing without compression
'w:gz' open for writing with gzip compression
'w:bz2' open for writing with bzip2 compression
'r|*' open a stream of tar blocks with transparent compression
'r|' open an uncompressed stream of tar blocks for reading
'r|gz' open a gzip compressed stream of tar blocks
'r|bz2' open a bzip2 compressed stream of tar blocks
'w|' open an uncompressed stream for writing
'w|gz' open a gzip compressed stream for writing
'w|bz2' open a bzip2 compressed stream for writing
znothing to openrf �r:*Nz%file could not be opened successfully�:r r� zunknown compression type %r�|�rwzmode must be 'r' or 'w'Frq zundiscernible mode)rf r ) rA � OPEN_METHr� r� rz r{ r� rU r� r� r� �taropen)
r r� rp r� r� �kwargsr� �funcZ saved_posr~ rt �streamrj r4 r4 r5 r� � sN
z TarFile.openc K s, t |�dks|dkr td��| |||f|�S )zCOpen uncompressed tar archive name for reading or writing.
r r� z mode must be 'r', 'a' or 'w')r. rA )r r� rp r� r� r4 r4 r5 r� � s zTarFile.taropenr� c K s� t |�dks|dkr td��yddl}|j W n ttfk
rN td��Y nX |dk }y*|j||d ||�}| j|||f|�}W n^ tk
r� | r�|dk r�|j � |dkr�� t
d��Y n$ | r�|dk r�|j � � Y nX ||_ |S ) zkOpen gzip compressed tar archive name for reading or writing.
Appending is not allowed.
r r� zmode must be 'r' or 'w'r Nz gzip module is not availablera znot a gzip file) r. rA �gzipZGzipFiler� �AttributeErrorr{ r� r\ r� rz r� ) r r� rp r� �
compresslevelr� r� Z
extfileobjrj r4 r4 r5 �gzopen s.
zTarFile.gzopenc K s� t |�dks|dkr td��y ddl}W n tk
rD td��Y nX |dk rZt||�}n|j|||d�}y| j|||f|�}W n( tt fk
r� |j
� t d��Y nX d |_ |S )
zlOpen bzip2 compressed tar archive name for reading or writing.
Appending is not allowed.
r r� zmode must be 'r' or 'w'.r Nzbz2 module is not available)r� znot a bzip2 fileF)
r. rA r� r� r{ r� ZBZ2Filer� r\ �EOFErrorr� rz r� )r r� rp r� r� r� r� rj r4 r4 r5 �bz2open$ s zTarFile.bz2openr� r� r� )r� r� r� c C s� | j r
dS | jdkrf| jjttd � | jtd 7 _t| jt�\}}|dkrf| jjtt| � | j sv| jj
� d| _ dS )zlClose the TarFile. In write-mode, two finishing zero blocks are
appended to the archive.
Nrq r r T) r� rp r� rZ r/ r� r� r[ �
RECORDSIZEr� r� )r� r_ r` r4 r4 r5 r� H s
z
TarFile.closec C s" | j |�}|dkr td| ��|S )a Return a TarInfo object for member `name'. If `name' can not be
found in the archive, KeyError is raised. If a member occurs more
than once in the archive, its last occurrence is assumed to be the
most up-to-date version.
Nzfilename %r not found)�
_getmember�KeyError)r� r� r� r4 r4 r5 � getmember\ s
zTarFile.getmemberc C s | j � | js| j� | jS )z�Return the members of the archive as a list of TarInfo objects. The
list has the same order as the members in the archive.
)�_checkr{ �_loadrz )r� r4 r4 r5 �
getmembersg s zTarFile.getmembersc C s dd� | j � D �S )z�Return the members of the archive as a list of their names. It has
the same order as the list returned by getmembers().
c S s g | ]
}|j �qS r4 )r� )rR r� r4 r4 r5 rS u s z$TarFile.getnames.<locals>.<listcomp>)r� )r� r4 r4 r5 �getnamesq s zTarFile.getnamesc C sp | j d� |dk r|j}|dkr$|}tjj|�\}}|jtjd�}|jd�}| j� }| |_ |dkr�t
td�r�| j r�tj |�}q�tj
|�}ntj|j� �}d}|j}t
j|��r|j|jf} | j r�|jdkr�| | jkr�|| j| kr�t}
| j| }nt}
| d �rx|| j| < nht
j|��r"t}
nVt
j|��r4t}
nDt
j |��rPt }
tj |�}n(t
j |��rbt }
nt
j!|��rtt"}
ndS ||_||_#|j$|_%|j&|_'|
tk�r�|j(|_)nd|_)|j*|_+|
|_,||_-t.�r�yt.j/|j%�d |_0W n t1k
�r� Y nX t2�r*yt2j3|j'�d |_4W n t1k
�r( Y nX |
t t"fk�rlt
td��rlt
td ��rltj5|j6�|_7tj8|j6�|_9|S )
aO Create a TarInfo object for either the file `name' or the file
object `fileobj' (using os.fstat on its file descriptor). You can
modify some of the TarInfo's attributes before you add it using
addfile(). If given, `arcname' specifies an alternative name for the
file in the archive.
rq Nr� �lstatrl r r �major�minor):r� r� r� r �
splitdriver� �sep�lstripr� r� r� rv r� �stat�fstat�fileno�st_mode�S_ISREG�st_ino�st_dev�st_nlinkr| r^ r� �S_ISDIRr� �S_ISFIFOrd �S_ISLNKr\ �readlink�S_ISCHRr` �S_ISBLKrb rp �st_uidr �st_gidr! �st_sizer �st_mtimer r� r� �pwd�getpwuidr" r� �grpZgetgrgidr# r� �st_rdevr� r� r� ) r� r� �arcnamer� Zdrvr� Zstatresr� Zstmd�inoder� r4 r4 r5 �
gettarinfow s~
zTarFile.gettarinfoTc C s | j � x�| D ]�}|r�tt|j�dd� td|jp6|j|jp@|jf dd� |j� s\|j � rztdd|j
|j f dd� ntd|j dd� tdt
j|j�dd � dd� t|j|j� r�d
nd dd� |r�|j� r�td |jdd� |j� r�td
|jdd� t� qW dS )z�Print a table of contents to sys.stdout. If `verbose' is False, only
the names of the members are printed. If it is True, an `ls -l'-like
output is produced.
� )rI z%s/%sz%10sz%d,%dz%10dz%d-%02d-%02d %02d:%02d:%02dNr� r� rl z->zlink to)r� �printrt rp r" r r# r! ra rc r� r� r r� Z localtimer r� r+ r] r� r_ )r� �verboser� r4 r4 r5 rP � s&
z TarFile.listc C sr | j d� |dkr|}|dk rPddl}|jdtd� ||�rP| jdd| � dS | jdk r�tjj|�| jkr�| jdd| � dS | jd|� | j ||�}|dkr�| jdd | � dS |dk r�||�}|dkr�| jdd| � dS |j
� �r
t |d
�}| j ||� |j
� nd|j� �rd| j |� |�rnxHtj|�D ].}| jtjj||�tjj||�|||d � �q0W n
| j |� dS ) a~ Add the file `name' to the archive. `name' may be any type of file
(directory, fifo, symbolic link, etc.). If given, `arcname'
specifies an alternative name for the file in the archive.
Directories are added recursively by default. This can be avoided by
setting `recursive' to False. `exclude' is a function that should
return True for each filename to be excluded. `filter' is a function
that expects a TarInfo object argument and returns the changed
TarInfo object, if it returns None the TarInfo object will be
excluded from the archive.
rq Nr z use the filter argument insteadr ztarfile: Excluded %rztarfile: Skipped %rr z tarfile: Unsupported type %rrn )�filter)r� �warnings�warn�DeprecationWarning�_dbgr� r� r ru r� r; rt �addfiler� r+ �listdir�addro ) r� r� r� � recursive�excluder� r� r� �fr4 r4 r5 r� � sD
z TarFile.addc C s� | j d� tj|�}|j| j| j| j�}| jj|� | jt |�7 _|dk r�t
|| j|j � t |j t
�\}}|dkr�| jjtt
| � |d7 }| j|t
7 _| jj|� dS )a] Add the TarInfo object `tarinfo' to the archive. If `fileobj' is
given, tarinfo.size bytes are read from it and added to the archive.
You can create TarInfo objects using gettarinfo().
On Windows platforms, `fileobj' should always be opened with mode
'rb' to avoid irritation about the file size.
rq Nr r )r� r r� rR r2 r3 r� rZ r� r. rb r r[ r� r/ rz rn )r� r� r� rW r_ r` r4 r4 r5 r� 4 s
zTarFile.addfile�.c C s� g }|dkr| }xD|D ]<}|j � r<|j|� tj|�}d|_| j|||j � d� qW |jdd� d� |j� x�|D ]~}tjj ||j
�}y(| j ||� | j ||� | j
||� W qt tk
r� } z$| jdkrЂ n| jdd| � W Y dd}~X qtX qtW dS ) aM Extract all members from the archive to the current working
directory and set owner, modification time and permissions on
directories afterwards. `path' specifies a different directory
to extract to. `members' is optional and must be a subset of the
list returned by getmembers().
Ni� )� set_attrsc S s | j S )N)r� )rp r4 r4 r5 �<lambda>d s z$TarFile.extractall.<locals>.<lambda>)�keyr z tarfile: %s)r+ rn r rp �extract�sort�reverser� r ro r� �chown�utime�chmodry ry r� )r� r rz Z directoriesr� �dirpathr~ r4 r4 r5 �
extractallN s*
zTarFile.extractallrl c C s
| j d� t|t�r | j|�}n|}|j� r>tjj||j�|_ y | j
|tjj||j �|d� W n� t k
r� } zJ| j
dkr~� n6|jdkr�| jdd|j � n| jdd|j|jf � W Y dd}~X nB tk
�r } z$| j
dkr� n| jdd| � W Y dd}~X nX dS )ax Extract a member from the archive to the current working directory,
using its full name. Its file information is extracted as accurately
as possible. `member' may be a filename or a TarInfo object. You can
specify a different directory using `path'. File attributes (owner,
mtime, mode) are set unless `set_attrs' is False.
rf )r� r Nr z tarfile: %sztarfile: %s %r)r� r
r r� r_ r� r ro r� r� �_extract_memberr� �EnvironmentErrorry �filenamer� �strerrorry )r� �memberr r� r� r~ r4 r4 r5 r� t s&
(
zTarFile.extractc C s� | j d� t|t�r | j|�}n|}|j� r8| j| |�S |jtkrN| j| |�S |j� s^|j � r�t| j
t �rtt d��q�| j
| j|��S ndS dS )a� Extract a member from the archive as a file object. `member' may be
a filename or a TarInfo object. If `member' is a regular file, a
file-like object is returned. If `member' is a link, a file-like
object is constructed from the link's target. If `member' is none of
the above, None is returned.
The file-like object is read-only and provides the following
methods: read(), readline(), readlines(), seek() and tell()
rf z'cannot extract (sym)link as file objectN)r� r
r r� r; �
fileobjectr� r< r_ r] r� r� r| � extractfile�_find_link_target)r� r� r� r4 r4 r5 r� � s
zTarFile.extractfilec C sT |j d�}|jdtj�}tjj|�}|r@tjj|� r@tj|� |j� sP|j � rj| j
dd|j |j f � n| j
d|j � |j
� r�| j||� n�|j� r�| j||� nx|j� r�| j||� nb|j� s�|j� r�| j||� nD|j� s�|j � r�| j||� n&|jtk�r| j||� n | j||� |�rP| j||� |j � �sP| j||� | j ||� dS )z\Extract the TarInfo object tarinfo to a physical
file called targetpath.
r� r z%s -> %sN) r, r� r� r� r �dirnamers �makedirsr_ r] r� r� r� r; �makefiler+ �makedirre �makefifora rc �makedev�makelinkr� r< � makeunknownr� r� r� )r� r� �
targetpathr� Z upperdirsr4 r4 r5 r� � s4
zTarFile._extract_memberc C sF yt j|d� W n0 tk
r@ } z|jtjkr0� W Y dd}~X nX dS )z,Make a directory called targetpath.
i� N)r� �mkdirr� �errnoZEEXIST)r� r� r� r~ r4 r4 r5 r� � s
zTarFile.makedirc C s� | j }|j|j� t|d�}|jdk rRx8|jD ] \}}|j|� t|||� q.W nt|||j� |j|j� |j� |j� dS )z'Make a file called targetpath.
ro N) r� r� r� rt r� rb r �truncater� )r� r� r� �source�targetr� r r4 r4 r5 r� � s
zTarFile.makefilec C s" | j ||� | jdd|j � dS )zYMake a file from a TarInfo object with an unknown type
at targetpath.
r z9tarfile: Unknown file type %r, extracted as regular file.N)r� r� r� )r� r� r� r4 r4 r5 r� s zTarFile.makeunknownc C s" t td�rtj|� ntd��dS )z'Make a fifo called targetpath.
�mkfifoz fifo not supported by systemN)r� r� r� ry )r� r� r� r4 r4 r5 r� s
zTarFile.makefifoc C sb t td� st td� r td��|j}|j� r:|tjO }n
|tjO }tj||tj |j
|j �� dS )z<Make a character or block device called targetpath.
�mknodr� z'special devices not supported by systemN) r� r� ry rp rc r� �S_IFBLK�S_IFCHRr� r� r� r� )r� r� r� rp r4 r4 r5 r� s
zTarFile.makedevc C s� yL|j � rtj|j|� n0tjj|j�r8tj|j|� n| j| j |�|� W n> t
k
r� |j � r�tjj tjj |j
�|j�}n|j}Y n6X y| j| j |�|� W n tk
r� td��Y nX dS )z�Make a (symbolic) link called targetpath. If it cannot be created
(platform limitation), we try to make a copy of the referenced file
instead of a link.
z%unable to resolve link inside archiveN)r] r� �symlinkr� r rs r� �linkr� r� �symlink_exceptionro r� r� r� ry )r� r� r� r r4 r4 r5 r� ' s"
zTarFile.makelinkc C s� t r�ttd�r�tj� dkr�ytj|j�d }W n tk
rH |j}Y nX yt j |j
�d }W n tk
rx |j }Y nX y>|j � r�ttd�r�tj
|||� ntjdkr�tj|||� W n* tk
r� } ztd��W Y dd}~X nX dS )z6Set owner of targetpath according to tarinfo.
�geteuidr r �lchownZos2emxzcould not change ownerN)r� r� r� r� r� Zgetgrnamr# r� r! �getpwnamr" r r] r� �sys�platformr� r� ry )r� r� r� �g�ur~ r4 r4 r5 r� D s
z
TarFile.chownc C sL t td�rHytj||j� W n* tk
rF } ztd��W Y dd}~X nX dS )zASet file permissions of targetpath according to tarinfo.
r� zcould not change modeN)r� r� r� rp r� ry )r� r� r� r~ r4 r4 r5 r� Z s
z
TarFile.chmodc C sV t td�sdS ytj||j|jf� W n* tk
rP } ztd��W Y dd}~X nX dS )zBSet modification time of targetpath according to tarinfo.
r� Nz"could not change modification time)r� r� r� r r� ry )r� r� r� r~ r4 r4 r5 r� c s
z
TarFile.utimec C s� | j d� | jdk r$| j}d| _|S | jj| j� d}�x\y| jj| �}W �nB tk
r� } z2| jr�| j dd| j|f � | jt
7 _w:W Y dd}~X n� t k
r� } zJ| jr�| j dd| j|f � | jt
7 _w:n| jdkr�t t
|���W Y dd}~X n� tk
�r& | jdk�r"t d��Y nj tk
�r` } z | jdk�rPt t
|���W Y dd}~X n0 tk
�r� } zt t
|���W Y dd}~X nX P q:W |dk �r�| jj|� nd| _|S )z�Return the next member of the archive as a TarInfo object, when
TarFile is opened for reading. Return None if there is no more
available.
ZraNr z0x%X: %sr z
empty fileT)r� r} r� r� r� r� r5 r� rw r� r� rB rz r r~ r r� rz rn r{ )r� �mr� r~ r4 r4 r5 r? n sF
z TarFile.nextc C sn | j � }|dk r"|d|j|�� }|r2tjj|�}x6t|�D ]*}|rTtjj|j�}n|j}||kr<|S q<W dS )z}Find an archive member by name from bottom to top.
If tarinfo is given, it is used as the starting point.
N)r� �indexr� r �normpath�reversedr� )r� r� r� � normalizerz r� � member_namer4 r4 r5 r� � s zTarFile._getmemberc C s" x| j � }|dkrP qW d| _dS )zWRead through the entire archive file and look for readable
members.
NT)r? r{ )r� r� r4 r4 r5 r� � s
z
TarFile._loadc C s: | j rtd| jj ��|dk r6| j|kr6td| j ��dS )znCheck if TarFile is still open, and if the operation's mode
corresponds to TarFile's mode.
z %s is closedNzbad operation for mode %r)r� r\ r� ru rp )r� rp r4 r4 r5 r� � s zTarFile._checkc C sX |j � r&tjj|j�d |j }d}n
|j}|}| j||dd�}|dkrTtd| ��|S )zZFind the target member of a symlink or hardlink member in the
archive.
r� NT)r� r� zlinkname %r not found)r] r� r r� r� r� r� r� )r� r� r� �limitr� r4 r4 r5 r� � s zTarFile._find_link_targetc C s | j rt| j�S t| �S dS )z$Provide an iterator object.
N)r{ �iterrz �TarIter)r� r4 r4 r5 r� � s
zTarFile.__iter__c C s || j krt|tjd� dS )z.Write debugging output to sys.stderr.
)�fileN)rx r� r� �stderr)r� �level�msgr4 r4 r5 r� � s
z TarFile._dbgc C s | j � | S )N)r� )r� r4 r4 r5 � __enter__� s zTarFile.__enter__c C s, |d kr| j � n| js"| jj � d| _d S )NT)r� r� r� r� )r� r� r � tracebackr4 r4 r5 �__exit__� s
zTarFile.__exit__) Nrf NNNNNNr� NNN)rf N)rf Nr� )rf Nr� )NNN)T)NTNN)N)r� N)rl T)T)NF)N)7ru rv rw rx rx rv rw ry rj rR rk r2 r3 r r� r� r� r� rl r� r� r� r� r� r� r� r� r� r� r� rP r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r? r� r� r� r� r� r� r r r4 r4 r4 r5 r , sl
iK
b
>
&
#&
0 1
c @ s, e Zd ZdZdd� Zdd� Zdd� ZeZdS ) r� zMIterator Class.
for tarinfo in TarFile(...):
suite...
c C s || _ d| _dS )z$Construct a TarIter object.
r N)r� r� )r� r� r4 r4 r5 r�
s zTarIter.__init__c C s | S )z Return iterator object.
r4 )r� r4 r4 r5 r�
s zTarIter.__iter__c C sb | j js$| j j� }|sPd| j _t�n,y| j j| j }W n tk
rN t�Y nX | jd7 _|S )z�Return the next item using TarFile's next() method.
When all members have been read, set TarFile as _loaded.
Tr )r� r{ r? �
StopIterationrz r� �
IndexError)r� r� r4 r4 r5 �__next__
s
zTarIter.__next__N)ru rv rw rx r� r� r r? r4 r4 r4 r5 r� � s
r� c C s. yt | �}|j� dS tk
r( dS X dS )zfReturn True if name points to a tar archive that we
are able to handle, else return False.
TFN)r� r� r )r� rj r4 r4 r5 r #
s )r r r r r r! r" r# )r r r" r# )r+ r, )N)wZ
__future__r � __version__�version�
__author__Z__date__Z __cvsid__� __credits__r� r� r� r� r� rL r rC r� r� r� r� �NotImplementedErrorr� Z WindowsError� NameError�__all__� version_infoZ __builtin__�builtinsr� Z_openr/ r� r� r r� r� r� r r� r( r^ r\ r` rb r� rd ZCONTTYPEr r r) r r r8 r� rK r� rj r< rZ r- rW �setrK r r@ rX �S_IFLNK�S_IFREGr� �S_IFDIRr� �S_IFIFOZTSUIDZTSGIDZTSVTXZTUREADZTUWRITEZTUEXECZTGREADZTGWRITEZTGEXECZTOREADZTOWRITEZTOEXECr� rk �getfilesystemencodingr6 r; rG rS rX rb rm rt � Exceptionr ry rz r{ r| r} r~ r r� rB r� �objectr� r� r� r� r� r� r r r� r rt r4 r4 r4 r5 �<module> s>
i?K T* pip/_vendor/distlib/_backport/__pycache__/tarfile.cpython-36.pyc 0000644 00000172757 14751155150 0020701 0 ustar 00 3
�Ub�i � @ sN d dl mZ dZdZdZdZdZdZd dlZd dl Z d dl
Z
d dl Z d dl Z d dl
Z
d dlZd dlZyd dlZd dlZW n ek
r� d ZZY nX eefZyeef7 ZW n ek
r� Y nX d d
d d gZejd d
k r�d dlZnd dlZej Z dZ dZ e d Z dZ!dZ"dZ#dZ$dZ%dZ&dZ'dZ(dZ)dZ*dZ+dZ,dZ-d Z.d Z/d Z0d Z1d Z2d!Z3d"Z4d Z5d#Z6d$Z7e6Z8e&e'e(e)e,e-e.e*e+e/e0e1f Z9e&e'e.e1fZ:e/e0e1fZ;d�Z<e=d��Z>e?e?e?e@e@e@d-�ZAd.ZBd/ZCd0ZDd1ZEd2ZFd3ZGd4ZHd5ZIdZJd6ZKd7ZLd8ZMd9ZNd:ZOd;ZPd<ZQd$ZRd#ZSe jTd�k�rd?ZUnejV� ZUd@dA� ZWdBdC� ZXdDdE� ZYd;e8fdFdG�ZZdHdI� Z[d�dJdK�Z\eBdLfeCdMfeDdNfeEdOfeFdPfeGdQffeKdRffeLdSffeMeHB dTfeHdUfeMdVffeNdRffeOdSffePeIB dTfeIdUfePdVffeQdRffeRdSffeSeJB dWfeJdXfeSdVfff
Z]dYdZ� Z^G d[d � d e_�Z`G d\d]� d]e`�ZaG d^d_� d_e`�ZbG d`da� dae`�ZcG dbdc� dce`�ZdG ddde� dee`�ZeG dfdg� dgee�ZfG dhdi� diee�ZgG djdk� dkee�ZhG dldm� dmee�ZiG dndo� doee�ZjG dpdq� dqek�ZlG drds� dsek�ZmG dtdu� duek�ZnG dvdw� dwek�ZoG dxdy� dyek�ZpG dzd{� d{ek�ZqG d|d
� d
ek�ZrG d}d � d ek�ZsG d~d� dek�Ztd�d � Zue Zvesj Z dS )�� )�print_functionz
$Revision$z0.9.0u" Lars Gustäbel (lars@gustaebel.de)z5$Date: 2011-02-25 17:42:01 +0200 (Fri, 25 Feb 2011) $z?$Id: tarfile.py 88586 2011-02-25 15:42:01Z marc-andre.lemburg $u4 Gustavo Niemeyer, Niels Gustäbel, Richard Townsend.N�TarFile�TarInfo�
is_tarfile�TarError� � i � s ustar s ustar 00�d � � 0� 1� 2� 3� 4� 5� 6� 7� L� K� S� x� g� X� � �path�linkpath�size�mtime�uid�gid�uname�gname)ZatimeZctimer r r! r i � i � i ` i @ i i i i � � �@ � � � � �nt�cezutf-8c C s( | j ||�} | d|� |t| � t S )z8Convert a string to a null-terminated bytes object.
N)�encode�len�NUL)�s�length�encoding�errors� r4 � /usr/lib/python3.6/tarfile.py�stn� s r6 c C s* | j d�}|dkr | d|� } | j||�S )z8Convert a null-terminated bytes object to a string.
r r N���)�find�decode)r0 r2 r3 �pr4 r4 r5 �nts� s
r; c C s� | d t d�krJytt| dd�p"dd�}W q� tk
rF td��Y q�X n:d}x4tt| �d �D ] }|dK }|t| |d �7 }q`W |S ) z/Convert a number field to a python number.
r r% �ascii�strict�0r) zinvalid headerr )�chr�intr; �
ValueError�InvalidHeaderError�ranger. �ord)r0 �n�ir4 r4 r5 �nti� s rG c C s� d| kod|d k n r<d|d | f j d�t }n�|tksT| d|d kr\td��| dk r|tjdtjd | ��d } t� }x,t|d �D ] }|j d| d
@ � | dL } q�W |j dd � |S ) z/Convert a python number to a number field.
r r) r z%0*or< r$ zoverflow in number field�L�l� r% )
r- r/ �
GNU_FORMATrA �struct�unpack�pack� bytearrayrC �insert)rE �digits�formatr0 rF r4 r4 r5 �itn� s rS c C sh dt tjd| dd� �tjd| dd� � � }dt tjd| dd� �tjd | dd� � � }||fS )
a� Calculate the checksum for a member's header by summing up all
characters except for the chksum field which is treated as if
it was filled with spaces. According to the GNU tar sources,
some tars (Sun and NeXT) calculate chksum with signed char,
which will be different if there are chars in the buffer with
the high bit set. So we calculate two checksums, unsigned and
signed.
r$ Z148BN� Z356B� i Z148bZ356b)�sumrL rM )�bufZunsigned_chksumZ
signed_chksumr4 r4 r5 � calc_chksums� s 00rX c C s� |dkr dS |dkr8x | j d�}|s&P |j|� qW dS d}t||�\}}x8t|�D ],}| j |�}t|�|k rvtd��|j|� qTW |dkr�| j |�}t|�|k r�td��|j|� dS )zjCopy length bytes from fileobj src to fileobj dst.
If length is None, copy the entire content.
r Nr( i zend of file reachedi @ i @ )�read�write�divmodrC r. �IOError)�src�dstr1 rW ZBUFSIZE�blocks� remainder�br4 r4 r5 � copyfileobj s,
rb rI �-ra �d�cr: �r�wr0 �S�x�t�Tc C sP g }x@t D ]8}x2|D ] \}}| |@ |kr|j|� P qW |jd� q
W dj|�S )zcConvert a file's mode to a string of the form
-rwxrwxrwx.
Used by TarFile.list()
rc � )�filemode_table�append�join)�modeZperm�table�bit�charr4 r4 r5 �filemode8 s
rt c @ s e Zd ZdZdS )r zBase exception.N)�__name__�
__module__� __qualname__�__doc__r4 r4 r4 r5 r G s c @ s e Zd ZdZdS )� ExtractErrorz%General exception for extract errors.N)ru rv rw rx r4 r4 r4 r5 ry J s ry c @ s e Zd ZdZdS )� ReadErrorz&Exception for unreadable tar archives.N)ru rv rw rx r4 r4 r4 r5 rz M s rz c @ s e Zd ZdZdS )�CompressionErrorz.Exception for unavailable compression methods.N)ru rv rw rx r4 r4 r4 r5 r{ P s r{ c @ s e Zd ZdZdS )� StreamErrorz=Exception for unsupported operations on stream-like TarFiles.N)ru rv rw rx r4 r4 r4 r5 r| S s r| c @ s e Zd ZdZdS )� HeaderErrorz!Base exception for header errors.N)ru rv rw rx r4 r4 r4 r5 r} V s r} c @ s e Zd ZdZdS )�EmptyHeaderErrorz Exception for empty headers.N)ru rv rw rx r4 r4 r4 r5 r~ Y s r~ c @ s e Zd ZdZdS )�TruncatedHeaderErrorz Exception for truncated headers.N)ru rv rw rx r4 r4 r4 r5 r \ s r c @ s e Zd ZdZdS )�EOFHeaderErrorz"Exception for end of file headers.N)ru rv rw rx r4 r4 r4 r5 r� _ s r� c @ s e Zd ZdZdS )rB z Exception for invalid headers.N)ru rv rw rx r4 r4 r4 r5 rB b s rB c @ s e Zd ZdZdS )�SubsequentHeaderErrorz3Exception for missing and invalid extended headers.N)ru rv rw rx r4 r4 r4 r5 r� e s r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) �
_LowLevelFilez�Low-level file object. Supports reading and writing.
It is used instead of a regular file object for streaming
access.
c C sF t jt jt jB t jB d�| }tt d�r2|t jO }t j||d�| _d S )N)rf rg �O_BINARYi� ) �os�O_RDONLY�O_WRONLY�O_CREAT�O_TRUNC�hasattrr� �open�fd)�self�namerp r4 r4 r5 �__init__r s
z_LowLevelFile.__init__c C s t j| j� d S )N)r� �closer� )r� r4 r4 r5 r� { s z_LowLevelFile.closec C s t j| j|�S )N)r� rY r� )r� r r4 r4 r5 rY ~ s z_LowLevelFile.readc C s t j| j|� d S )N)r� rZ r� )r� r0 r4 r4 r5 rZ � s z_LowLevelFile.writeN)ru rv rw rx r� r� rY rZ r4 r4 r4 r5 r� l s
r� c @ st e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d dd�Z d dd�Z
dd� Zdd� ZdS ) �_Streama� Class that serves as an adapter between TarFile and
a stream-like object. The stream-like object only
needs to have a read() or write() method and is accessed
blockwise. Use of gzip or bzip2 compression is possible.
A stream-like object could be for example: sys.stdin,
sys.stdout, a socket, a tape device etc.
_Stream is intended to be used only internally.
c C sR d| _ |dkr t||�}d| _ |dkr6t|�}|j� }|p<d| _|| _|| _|| _|| _d| _ d| _
d| _ y�|dkr�y ddl }W n t
k
r� td ��Y nX || _ |jd�| _|d
kr�| j� n| j� |d k�r$y ddl}W n t
k
r� td ��Y nX |d
k�rd| _|j� | _n
|j� | _W n& | j �s@| jj� d| _ � Y nX dS )
z$Construct a _Stream object.
TNF�*rl � r �gzz zlib module is not availablerf �bz2zbz2 module is not available)� _extfileobjr� � _StreamProxy� getcomptyper� rp �comptype�fileobj�bufsizerW �pos�closed�zlib� ImportErrorr{ �crc32�crc�
_init_read_gz�_init_write_gzr� �dbuf�BZ2Decompressor�cmp�
BZ2Compressorr� )r� r� rp r� r� r� r� r� r4 r4 r5 r� � sP
z_Stream.__init__c C s t | d�r| j r| j� d S )Nr� )r� r� r� )r� r4 r4 r5 �__del__� s z_Stream.__del__c C s� | j jd| j j| j j | j jd�| _tjdtt j � ��}| j
d| d � | j j d�rf| j dd � | _ | j
| j j
d d
�t � dS ) z6Initialize for writing with gzip compression.
� r z<Ls �s �z.gzNr z
iso-8859-1�replace���)r� Z compressobjZDEFLATED� MAX_WBITSZ
DEF_MEM_LEVELr� rL rN r@ �time�_Stream__writer� �endswithr- r/ )r� Z timestampr4 r4 r5 r� � s z_Stream._init_write_gzc C sR | j dkr | jj|| j�| _| jt|�7 _| j dkrD| jj|�}| j|� dS )z&Write string s to the stream.
r� �tarN) r� r� r� r� r� r. r� �compressr� )r� r0 r4 r4 r5 rZ � s
z
_Stream.writec C sR | j |7 _ x>t| j �| jkrL| jj| j d| j� � | j | jd� | _ qW dS )z]Write string s to the stream if a whole new block
is ready to be written.
N)rW r. r� r� rZ )r� r0 r4 r4 r5 Z__write� s z_Stream.__writec C s� | j r
dS | jdkr2| jdkr2| j| jj� 7 _| jdkr�| jr�| jj| j� d| _| jdkr�| jjtj d| j
d@ �� | jjtj d| j d@ �� | j s�| jj
� d| _ dS ) z[Close the _Stream object. No operation should be
done on it afterwards.
Nrg r� r� r� z<Ll �� T)r� rp r� rW r� �flushr� rZ rL rN r� r� r� r� )r� r4 r4 r5 r� � s
z
_Stream.closec C s� | j j| j j �| _d| _| jd�dkr0td��| jd�dkrFtd��t| jd��}| jd� |d @ r�t| jd��d
t| jd�� }| j |� |d @ r�x | jd�}| s�|t
kr�P q�W |d @ r�x | jd�}| s�|t
kr�P q�W |d@ r�| jd� d
S )z:Initialize for reading a gzip compressed fileobj.
r� r s �znot a gzip filer � z unsupported compression method� r* r$ r) r( N) r� Z
decompressobjr� r� r� �
_Stream__readrz r{ rD rY r/ )r� �flagZxlenr0 r4 r4 r5 r� s.
z_Stream._init_read_gzc C s | j S )z3Return the stream's file pointer position.
)r� )r� r4 r4 r5 �tell# s z _Stream.tellr c C s\ || j dkrNt|| j | j�\}}x t|�D ]}| j| j� q.W | j|� ntd��| j S )zXSet the stream's file pointer to pos. Negative seeking
is forbidden.
r z seeking backwards is not allowed)r� r[ r� rC rY r| )r� r� r_ r` rF r4 r4 r5 �seek( s z _Stream.seekNc C sZ |dkr:g }x | j | j�}|s P |j|� qW dj|�}n
| j |�}| jt|�7 _|S )z�Return the next size number of bytes from the stream.
If size is not defined, return all bytes of the stream
up to EOF.
Nrl )�_readr� rn ro r� r. )r� r rj rW r4 r4 r5 rY 5 s
z _Stream.readc C s� | j dkr| j|�S t| j�}xf||k r�| j| j�}|s:P y| jj|�}W n tk
rf td��Y nX | j|7 _|t|�7 }q W | jd|� }| j|d� | _|S )z+Return size bytes from the stream.
r� zinvalid compressed dataN) r� r� r. r� r� r� �
decompressr\ rz )r� r re rW r4 r4 r5 r� G s
z
_Stream._readc C sh t | j�}x:||k rD| jj| j�}|s(P | j|7 _|t |�7 }q W | jd|� }| j|d� | _|S )zsReturn size bytes from stream. If internal buffer is empty,
read another block from the stream.
N)r. rW r� rY r� )r� r re rW r4 r4 r5 Z__read\ s
z_Stream.__read)r )N)ru rv rw rx r� r� r� rZ r� r� r� r� r� rY r� r� r4 r4 r4 r5 r� � s 4
r� c @ s0 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd
S ) r� zsSmall proxy class that enables transparent compression
detection for the Stream interface (mode 'r|*').
c C s || _ | j jt�| _d S )N)r� rY � BLOCKSIZErW )r� r� r4 r4 r5 r� q s z_StreamProxy.__init__c C s | j j| _| jS )N)r� rY rW )r� r r4 r4 r5 rY u s
z_StreamProxy.readc C s$ | j jd�rdS | j jd�r dS dS )Ns �r� s BZh91r� r� )rW �
startswith)r� r4 r4 r5 r� y s
z_StreamProxy.getcomptypec C s | j j� d S )N)r� r� )r� r4 r4 r5 r� � s z_StreamProxy.closeN)ru rv rw rx r� rY r� r� r4 r4 r4 r5 r� l s
r� c @ sL e Zd ZdZdZdd� Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z dS )� _BZ2Proxya Small proxy class that enables external file object
support for "r:bz2" and "w:bz2" modes. This is actually
a workaround for a limitation in bz2 module's BZ2File
class which (unlike gzip.GzipFile) has no support for
a file object argument.
r( i c C s( || _ || _t| j dd �| _| j� d S )Nr� )r� rp �getattrr� �init)r� r� rp r4 r4 r5 r� � s z_BZ2Proxy.__init__c C sD dd l }d| _| jdkr6|j� | _| jjd� d| _n
|j� | _d S )Nr rf r� ) r� r� rp r� �bz2objr� r� rW r� )r� r� r4 r4 r5 r� � s
z_BZ2Proxy.initc C s� t | j�}xF||k rP| jj| j�}|s(P | jj|�}| j|7 _|t |�7 }q W | jd |� }| j|d � | _| jt |�7 _|S )N)r. rW r� rY � blocksizer� r� r� )r� r ri �raw�datarW r4 r4 r5 rY � s
z_BZ2Proxy.readc C s& || j k r| j� | j|| j � d S )N)r� r� rY )r� r� r4 r4 r5 r� � s
z_BZ2Proxy.seekc C s | j S )N)r� )r� r4 r4 r5 r� � s z_BZ2Proxy.tellc C s. | j t|�7 _ | jj|�}| jj|� d S )N)r� r. r� r� r� rZ )r� r� r� r4 r4 r5 rZ � s z_BZ2Proxy.writec C s$ | j dkr | jj� }| jj|� d S )Nrg )rp r� r� r� rZ )r� r� r4 r4 r5 r� � s
z_BZ2Proxy.closeNi @ ) ru rv rw rx r� r� r� rY r� r� rZ r� r4 r4 r4 r5 r� � s
r� c @ s< e Zd ZdZd
dd�Zdd� Zdd� Zd d
� Zdd d �ZdS )� _FileInFilezA thin wrapper around an existing file object that
provides a part of its data as an individual file
object.
Nc C s� || _ || _|| _d| _|d kr*d|fg}d| _g | _d}| j}xT|D ]L\}}||krj| jjd||d f� | jjd||| |f� ||7 }|| }qFW || jk r�| jjd|| jd f� d S )Nr FT)r� �offsetr �position� map_index�maprn )r� r� r� r Z blockinfoZlastposZrealposr4 r4 r5 r� � s$
z_FileInFile.__init__c C s t | jd�sdS | jj� S )N�seekableT)r� r� r� )r� r4 r4 r5 r� � s z_FileInFile.seekablec C s | j S )z*Return the current file position.
)r� )r� r4 r4 r5 r� � s z_FileInFile.tellc C s
|| _ dS )z(Seek to a position in the file.
N)r� )r� r� r4 r4 r5 r� � s z_FileInFile.seekc C s� |dkr| j | j }nt|| j | j �}d}x�|dkr�xZ| j| j \}}}}|| j ko`|k n rjP q8| jd7 _| jt| j�kr8d| _q8W t||| j �}|r�| jj|| j| � || jj|�7 }n |t | 7 }||8 }| j|7 _q.W |S )z!Read data from the file.
Nr� r r )
r r� �minr� r� r. r� r� rY r/ )r� r rW r� �start�stopr� r1 r4 r4 r5 rY � s(
z_FileInFile.read)N)N) ru rv rw rx r� r� r� r� rY r4 r4 r4 r5 r� � s
r� c @ sz e Zd ZdZdZdd� Zdd� Zdd� Zd d
� Zdd d
�Z e Z
d dd�Z dd� Z dd� Z
ejfdd�Zdd� Zdd� Zd S ) � ExFileObjectzaFile-like object for reading an archive member.
Is returned by TarFile.extractfile().
i c C sD t |j|j|j|j�| _|j| _d| _d| _|j| _d| _d| _ d S )Nrf Fr r� )
r� r� � offset_datar �sparser� rp r� r� �buffer)r� �tarfile�tarinfor4 r4 r5 r� s
zExFileObject.__init__c C s dS )NTr4 )r� r4 r4 r5 �readable! s zExFileObject.readablec C s dS )NFr4 )r� r4 r4 r5 �writable$ s zExFileObject.writablec C s
| j j� S )N)r� r� )r� r4 r4 r5 r� ' s zExFileObject.seekableNc C s� | j rtd��d}| jrL|dkr.| j}d| _n | jd|� }| j|d� | _|dkrd|| jj� 7 }n|| jj|t|� �7 }| jt|�7 _|S )z~Read at most size bytes from the file. If size is not
present or None, read all data until EOF is reached.
z I/O operation on closed filer� N)r� rA r� r� rY r. r� )r� r rW r4 r4 r5 rY * s zExFileObject.readr c C s� | j rtd��| jjd�d }|dkrzxR| jj| j�}| j|7 _| sRd|kr(| jjd�d }|dkrtt| j�}P q(W |dkr�t||�}| jd|� }| j|d� | _| j t|�7 _ |S )z�Read one entire line from the file. If size is present
and non-negative, return a string with at most that
size, which may be an incomplete line.
z I/O operation on closed file�
r r Nr7 )
r� rA r� r8 r� rY r� r. r� r� )r� r r� rW r4 r4 r5 �readlineE s$
zExFileObject.readlinec C s& g }x | j � }|sP |j|� qW |S )z0Return a list with all remaining lines.
)r� rn )r� �result�liner4 r4 r5 � readlinesb s zExFileObject.readlinesc C s | j rtd��| jS )z*Return the current file position.
z I/O operation on closed file)r� rA r� )r� r4 r4 r5 r� l s zExFileObject.tellc C s� | j rtd��|tjkr.tt|d�| j�| _nj|tjkrj|dk rTt| j| d�| _q�t| j| | j�| _n.|tj kr�tt| j| | j�d�| _ntd��d| _
| j j | j� dS )z(Seek to a position in the file.
z I/O operation on closed filer zInvalid argumentr� N)
r� rA r� �SEEK_SETr� �maxr r� �SEEK_CUR�SEEK_ENDr� r� r� )r� r� �whencer4 r4 r5 r� t s
zExFileObject.seekc C s
d| _ dS )z Close the file object.
TN)r� )r� r4 r4 r5 r� � s zExFileObject.closec c s x| j � }|sP |V qW dS )z/Get an iterator over the file's lines.
N)r� )r� r� r4 r4 r5 �__iter__� s
zExFileObject.__iter__)Nr7 )r7 )ru rv rw rx r� r� r� r� r� rY �read1r� r� r� r� r� r� r� r� r4 r4 r4 r5 r� s
r� c @ s� e Zd ZdZdiZdjdd�Zdd� Zdd � Zeee�Z d d � Z
d d � Z ee
e �Z d!d"� Z
d#d$� Zeed%fd&d'�Zd(d)� Zd*d+� Zd,d-� Zed.d/� �Zd0d1� Zed2d3� �Zed4d5� �Zed6d7� �Zed8d9� �Z ed:d;� �Z ed<d=� �Z d>d?� Z d@dA� Z dBdC� Z!dDdE� Z"dFdG� Z#dHdI� Z$dJdK� Z%dLdM� Z&dNdO� Z'dPdQ� Z(dRdS� Z)dTdU� Z*dVdW� Z+dXdY� Z,dZd[� Z-d\d]� Z.d^d_� Z/d`da� Z0dbdc� Z1ddde� Z2dfdg� Z3dhS )kr a Informational class which holds the details about an
archive member given by a tar header block.
TarInfo objects are returned by TarFile.getmember(),
TarFile.getmembers() and TarFile.gettarinfo() and are
usually created internally.
r� rp r r! r r �chksum�type�linknamer" r# �devmajor�devminorr� r� � pax_headersr� r� �_sparse_structs� _link_targetrl c C sj || _ d| _d| _d| _d| _d| _d| _t| _d| _ d| _
d| _ d| _ d| _
d| _d| _d| _i | _dS )zXConstruct a TarInfo object. name is the optional name
of the member.
i� r rl N)r� rp r r! r r r� �REGTYPEr� r� r" r# r� r� r� r� r� r� )r� r� r4 r4 r5 r� � s" zTarInfo.__init__c C s | j S )N)r� )r� r4 r4 r5 �_getpath� s zTarInfo._getpathc C s
|| _ d S )N)r� )r� r� r4 r4 r5 �_setpath� s zTarInfo._setpathc C s | j S )N)r� )r� r4 r4 r5 � _getlinkpath� s zTarInfo._getlinkpathc C s
|| _ d S )N)r� )r� r� r4 r4 r5 � _setlinkpath� s zTarInfo._setlinkpathc C s d| j j| jt| �f S )Nz<%s %r at %#x>)� __class__ru r� �id)r� r4 r4 r5 �__repr__� s zTarInfo.__repr__c C sn | j | jd@ | j| j| j| j| j| j| j| j | j
| j | j d�
}|d t
krj|d jd� rj|d d7 < |S )z9Return the TarInfo's attributes as a dictionary.
i� )
r� rp r r! r r r� r� r� r" r# r� r� r� r� �/)r� rp r r! r r r� r� r� r" r# r� r� �DIRTYPEr� )r� �infor4 r4 r5 �get_info� s
zTarInfo.get_info�surrogateescapec C sT | j � }|tkr | j|||�S |tkr4| j|||�S |tkrH| j||�S td��dS )z<Return a tar header as a string of 512 byte blocks.
zinvalid formatN)r� � USTAR_FORMAT�create_ustar_headerrK �create_gnu_header�
PAX_FORMAT�create_pax_headerrA )r� rR r2 r3 r� r4 r4 r5 �tobuf� s z
TarInfo.tobufc C sZ t |d< t|d �tkr td��t|d �tkrJ| j|d �\|d< |d< | j|t||�S )z3Return the object as a ustar header block.
�magicr� zlinkname is too longr� �prefix)� POSIX_MAGICr. � LENGTH_LINKrA � LENGTH_NAME�_posix_split_name�_create_headerr� )r� r� r2 r3 r4 r4 r5 r� � s zTarInfo.create_ustar_headerc C sp t |d< d}t|d �tkr4|| j|d t||�7 }t|d �tkr\|| j|d t||�7 }|| j|t||� S )z:Return the object as a GNU header block sequence.
r� r� r� r� ) � GNU_MAGICr. r� �_create_gnu_long_header�GNUTYPE_LONGLINKr� �GNUTYPE_LONGNAMEr rK )r� r� r2 r3 rW r4 r4 r5 r� s zTarInfo.create_gnu_headerc
C s4 t |d< | jj� }x�ddtfddtfddfD ]h\}}}||kr@q,y|| jd d
� W n" tk
rv || ||< w,Y nX t|| �|kr,|| ||< q,W xldD ]d\}}||kr�d||< q�|| }d| ko�d |d k n � s�t|t �r�t
|�||< d||< q�W |�r | j |t |�} nd} | | j
|td d� S ) z�Return the object as a ustar header block. If it cannot be
represented this way, prepend a pax extended header sequence
with supplement information.
r� r� r r� r r" r' r# r< r= r r) r! r � r r r r� r� )r" r" r' )r# r# r' �r r) �r! r) �r r �r r )r r r r
)r� r� �copyr� r� r- �UnicodeEncodeErrorr. �
isinstance�float�str�_create_pax_generic_header�XHDTYPEr r� )
r� r� r2 r� r� Zhnamer1 rQ �valrW r4 r4 r5 r� s4
. zTarInfo.create_pax_headerc C s | j |td�S )zAReturn the object as a pax global header block sequence.
�utf8)r �XGLTYPE)�clsr� r4 r4 r5 �create_pax_global_headerD s z TarInfo.create_pax_global_headerc C sp |dt d � }x |r0|d dkr0|dd� }qW |t|�d� }|dd� }| s`t|�tkrhtd��||fS )zUSplit a name longer than 100 chars into a prefix
and a name part.
Nr r� zname is too longr7 r7 r7 )�
LENGTH_PREFIXr. r� rA )r� r� r� r4 r4 r5 r J s zTarInfo._posix_split_namec C sV t | jdd�d||�t| jdd�d@ d|�t| jdd�d|�t| jd d�d|�t| jd
d�d |�t| jd d�d |�d
| jdt�t | jdd�d||�| jdt�t | jdd�d||�t | jdd�d||�t| jdd�d|�t| jdd�d|�t | jdd�d||�g}tjdt dj|��}t |t d� �d }|dd � d | j
d � |d d� }|S )!z�Return a header block. info is a dictionary with file
information, format must be one of the *_FORMAT constants.
r� rl r
rp r i� r) r r! r r r s r� r� r� r" r' r# r� r� r� r z%dsr� Nil z%06o r< ie i����i����) r6 �getrS r� r� rL rN r� ro rX r- )r� rR r2 r3 �partsrW r� r4 r4 r5 r Y s&
&zTarInfo._create_headerc C s. t t| �t�\}}|dkr*| t| t 7 } | S )zdReturn the string payload filled with zero bytes
up to the next 512 byte border.
r )r[ r. r� r/ )Zpayloadr_ r` r4 r4 r5 �_create_payloadu s zTarInfo._create_payloadc C sR |j ||�t }i }d|d< ||d< t|�|d< t|d< | j|t||�| j|� S )zTReturn a GNUTYPE_LONGNAME or GNUTYPE_LONGLINK sequence
for name.
z
././@LongLinkr� r� r r� )r- r/ r. r r r� r )r r� r� r2 r3 r� r4 r4 r5 r s z TarInfo._create_gnu_long_headerc C s: d}x@|j � D ]4\}}y|jdd� W q tk
r@ d}P Y qX qW d}|rV|d7 }x�|j � D ]�\}}|jd�}|r�|j|d�}n
|jd�}t|�t|� d }d } }
x"|tt|
�� } | |
kr�P | }
q�W |tt|
�d
�d | d | d
7 }q`W i } d| d< || d< t|�| d< t| d< | j| td
d�| j |� S )z�Return a POSIX.1-2008 extended or global header sequence
that contains a list of keyword, value pairs. The values
must be strings.
Fr r= Tr� s 21 hdrcharset=BINARY
r� r r r< � � =r� z././@PaxHeaderr� r� r r� r� )
�itemsr- r r. r �bytesr� r r� r ) r r� r� r2 Zbinary�keyword�valueZrecordsrI rE r: r� r4 r4 r5 r � s<
* z"TarInfo._create_pax_generic_headerc C st t |�dkrtd��t |�tkr(td��|jt�tkr>td��t|dd� �}|t|�krbt d��| � }t
|dd� ||�|_ t|dd � �|_ t|d d
� �|_
t|d
d � �|_t|d d � �|_t|d d� �|_||_|dd
� |_t
|d
d� ||�|_t
|dd� ||�|_t
|dd� ||�|_t|dd� �|_t|dd� �|_t
|dd� ||�}|jtk�r�|j jd��r�t|_|jtk�r6d}g }xrt d�D ]f} y0t|||d � �}
t||d |d � �} W n t k
�r� P Y nX |j |
| f� |d7 }�q�W t |d �} t|dd � �}
|| |
f|_ |j!� �rN|j j"d�|_ |�rp|jt#k�rp|d |j |_ |S ) zAConstruct a TarInfo object from a 512 byte bytes object.
r z empty headerztruncated headerzend of file headerrT rU z bad checksumr
�l �t �| � � i i i) iI iQ iY i� r� i� r* r � i� i� i� )$r. r~ r� r �countr/ r� rG rX rB r; r� rp r r! r r r� r� r� r" r# r� r� �AREGTYPEr� r� �GNUTYPE_SPARSErC rA rn �boolr� �isdir�rstrip� GNU_TYPES)r rW r2 r3 r� �objr� r� �structsrF r� �numbytes�
isextended�origsizer4 r4 r5 �frombuf� sZ
zTarInfo.frombufc C s8 |j jt�}| j||j|j�}|j j� t |_|j|�S )zOReturn the next TarInfo object from TarFile object
tarfile.
) r� rY r� r3 r2 r3 r� r� � _proc_member)r r� rW r. r4 r4 r5 � fromtarfile s zTarInfo.fromtarfilec C sT | j ttfkr| j|�S | j tkr,| j|�S | j tttfkrF| j |�S | j
|�S dS )zYChoose the right processing method depending on
the type and call it.
N) r� r r �
_proc_gnulongr) � _proc_sparser r �SOLARIS_XHDTYPE� _proc_pax�
_proc_builtin)r� r� r4 r4 r5 r4 s
zTarInfo._proc_memberc C sR |j j� | _| j}| j� s$| jtkr4|| j| j�7 }||_| j |j
|j |j � | S )zfProcess a builtin type or an unknown type which
will be treated as a regular file.
)
r� r� r� �isregr� �SUPPORTED_TYPES�_blockr r� �_apply_pax_infor� r2 r3 )r� r� r� r4 r4 r5 r: $ s zTarInfo._proc_builtinc C s� |j j| j| j��}y| j|�}W n tk
r> td��Y nX | j|_| jt krft
||j |j �|_
n | jtkr�t
||j |j �|_|S )zSProcess the blocks that hold a GNU longname
or longlink member.
z missing or bad subsequent header)r� rY r= r r5 r} r� r� r� r r; r2 r3 r� r r� )r� r� rW �nextr4 r4 r5 r6 5 s
zTarInfo._proc_gnulongc
C s� | j \}}}| ` x�|r�|jjt�}d}xvtd�D ]j}y0t|||d � �}t||d |d � �} W n tk
rz P Y nX |r�| r�|j|| f� |d7 }q0W t|d �}qW || _ |jj
� | _ | j | j | j
� |_|| _
| S )z8Process a GNU sparse header plus extra headers.
r � r r& i� )r� r� rY r� rC rG rA rn r* r� r� r� r= r r� )
r� r� r/ r1 r2 rW r� rF r� r0 r4 r4 r5 r7 K s( zTarInfo._proc_sparsec C s |j j| j| j��}| jtkr&|j}n
|jj� }tj d|�}|dk rX|j
d�j d�|d< |j d�}|dkrr|j
}nd}tjd�}d}x�|j||�}|s�P |j� \} }
t| �} ||jd �d |jd�| d � } | j|
dd|j�}
|
tk�r| j| ||j
|j�} n| j| dd|j�} | ||
< || 7 }q�W y| j|�} W n tk
�rT td
��Y nX d |k�rn| j| |� nHd |k�r�| j| ||� n.|j d
�dk�r�|j d�dk�r�| j | ||� | jt t fk�r | j ||j
|j� | j | _ d|k�r | j!}
| j"� �s| jt#k�r|
| j| j�7 }
|
|_ | S )zVProcess an extended or global header as described in
POSIX.1-2008.
s \d+ hdrcharset=([^\n]+)\nNr r �
hdrcharsetZBINARYs (\d+) ([^=]+)=r r z missing or bad subsequent headerzGNU.sparse.mapzGNU.sparse.sizezGNU.sparse.major�1zGNU.sparse.minorr> r )$r� rY r= r r� r r� r �re�search�groupr9 r r2 �compile�match�groupsr@ �endr� �_decode_pax_fieldr3 �PAX_NAME_FIELDSr5 r} r� �_proc_gnusparse_01�_proc_gnusparse_00�_proc_gnusparse_10r r8 r> r� r� r; r< )r� r� rW r� rG rA r2 Zregexr� r1 r r r? r� r4 r4 r5 r9 g s`
$
zTarInfo._proc_paxc C sp g }x(t jd|�D ]}|jt|jd��� qW g }x(t jd|�D ]}|jt|jd��� q@W tt||��|_dS )z?Process a GNU tar extended sparse header, version 0.0.
s \d+ GNU.sparse.offset=(\d+)\nr s \d+ GNU.sparse.numbytes=(\d+)\nN)rC �finditerrn r@ rE �list�zipr� )r� r? r� rW ZoffsetsrG r0 r4 r4 r5 rM � s zTarInfo._proc_gnusparse_00c C s@ dd� |d j d�D �}tt|ddd� |ddd� ��|_dS )z?Process a GNU tar extended sparse header, version 0.1.
c S s g | ] }t |��qS r4 )r@ )�.0ri r4 r4 r5 �
<listcomp>� s z.TarInfo._proc_gnusparse_01.<locals>.<listcomp>zGNU.sparse.map�,Nr r )�splitrP rQ r� )r� r? r� r� r4 r4 r5 rL � s zTarInfo._proc_gnusparse_01c C s� d}g }|j jt�}|jdd�\}}t|�}xJt|�|d k rvd|krV||j jt�7 }|jdd�\}}|jt|�� q.W |j j� |_t t
|ddd� |ddd� ��|_ dS )z?Process a GNU tar extended sparse header, version 1.0.
Nr� r r ) r� rY r� rU r@ r. rn r� r� rP rQ r� )r� r? r� r� Zfieldsr� rW Znumberr4 r4 r5 rN � s zTarInfo._proc_gnusparse_10c
C s� x�|j � D ]�\}}|dkr(t| d|� q
|dkrBt| dt|�� q
|dkr\t| dt|�� q
|tkr
|tkr�yt| |�}W n tk
r� d}Y nX |dkr�|jd�}t| ||� q
W |j� | _dS ) zoReplace fields with supplemental information from a previous
pax extended or global header.
zGNU.sparse.namer zGNU.sparse.sizer zGNU.sparse.realsizer r� N) r �setattrr@ �
PAX_FIELDS�PAX_NUMBER_FIELDSrA r, r r� )r� r� r2 r3 r r r4 r4 r5 r> � s"
zTarInfo._apply_pax_infoc C s. y |j |d�S tk
r( |j ||�S X dS )z1Decode a single field from a pax record.
r= N)r9 �UnicodeDecodeError)r� r r2 Zfallback_encodingZfallback_errorsr4 r4 r5 rJ s zTarInfo._decode_pax_fieldc C s" t |t�\}}|r|d7 }|t S )z_Round up a byte count by BLOCKSIZE and return it,
e.g. _block(834) => 1024.
r )r[ r� )r� r' r_ r` r4 r4 r5 r=
s zTarInfo._blockc C s
| j tkS )N)r� �
REGULAR_TYPES)r� r4 r4 r5 r; s z
TarInfo.isregc C s | j � S )N)r; )r� r4 r4 r5 �isfile s zTarInfo.isfilec C s
| j tkS )N)r� r� )r� r4 r4 r5 r+ s z
TarInfo.isdirc C s
| j tkS )N)r� �SYMTYPE)r� r4 r4 r5 �issym s z
TarInfo.issymc C s
| j tkS )N)r� �LNKTYPE)r� r4 r4 r5 �islnk s z
TarInfo.islnkc C s
| j tkS )N)r� �CHRTYPE)r� r4 r4 r5 �ischr s z
TarInfo.ischrc C s
| j tkS )N)r� �BLKTYPE)r� r4 r4 r5 �isblk" s z
TarInfo.isblkc C s
| j tkS )N)r� �FIFOTYPE)r� r4 r4 r5 �isfifo$ s zTarInfo.isfifoc C s
| j d k S )N)r� )r� r4 r4 r5 �issparse& s zTarInfo.issparsec C s | j tttfkS )N)r� r` rb rd )r� r4 r4 r5 �isdev( s z
TarInfo.isdevN)r� rp r r! r r r� r� r� r" r# r� r� r� r� r� r� r� r� r� )rl )4ru rv rw rx � __slots__r� r� r� �propertyr r� r� r r� r� �DEFAULT_FORMAT�ENCODINGr� r� r� r� � classmethodr r � staticmethodr r r r r3 r5 r4 r: r6 r7 r9 rM rL rN r> rJ r= r; r[ r+ r] r_ ra rc re rf rg r4 r4 r4 r5 r � s`
1
3 ?
f c @ s� e Zd ZdZdZdZdZdZeZ e
Z dZ e
ZeZdVdd �Zedddefd
d ��ZedWd d
��ZedXdd��ZedYdd��Zdddd�Zdd� Zdd� Zdd � Zd d � Z dZd d �Z d[d"d#�Z d\d$d%�Z d]d&d'�Z d^d)d*�Z!d_d,d-�Z"d.d/� Z#d`d0d1�Z$d2d3� Z%d4d5� Z&d6d7� Z'd8d9� Z(d:d;� Z)d<d=� Z*d>d?� Z+d@dA� Z,dBdC� Z-dDdE� Z.dadFdG�Z/dHdI� Z0dbdJdK�Z1dLdM� Z2dNdO� Z3dPdQ� Z4dRdS� Z5dTdU� Z6dS )cr z=The TarFile Class provides an interface to tar archives.
r Fr Nrf r� c
C s� t |�dks|dkr td��|| _dddd�| | _|sp| jdkr\tjj|� r\d | _d| _t|| j�}d
| _n0|d kr�t |d �r�|j
}t |d
�r�|j| _d| _|r�tjj |�nd | _
|| _ |d k r�|| _
|d k r�|| _|d k r�|| _|d k r�|| _|d k �r|| _| | _|
d k �r(| j
tk�r(|
| _ni | _| d k �r>| | _| d k �rN| | _d
| _g | _d
| _| j j� | _i | _ y�| jdk�r�d | _ | j � | _ | jdk�r$x�| j j | j� y | jj | �}| jj!|� W nT t"k
�r� | j j | j� P Y n0 t#k
�r }
zt$t%|
���W Y d d }
~
X nX �q�W | jdk�rnd| _| j�rn| jj&| jj'� �}| j j(|� | jt |�7 _W n& | j�s�| j j)� d| _� Y nX d S )a� Open an (uncompressed) tar archive `name'. `mode' is either 'r' to
read from an existing archive, 'a' to append data to an existing
file or 'w' to create a new file overwriting an existing one. `mode'
defaults to 'r'.
If `fileobj' is given, it is used for reading or writing data. If it
can be determined, `mode' is overridden by `fileobj's mode.
`fileobj' is not closed, when TarFile is closed.
r r� z mode must be 'r', 'a' or 'w'�rbzr+b�wb)rf �arg rp rg FNr� rp Trf �aw)*r. rA rp �_moder� r �exists� bltn_openr� r� r� �abspathr� rR r� � dereference� ignore_zerosr2 r3 r� r� �debug�
errorlevelr� �members�_loadedr� r� �inodes� firstmemberr? r� r5 rn r� r} rz r r r rZ r� )r� r� rp r� rR r� rv rw r2 r3 r� rx ry �erW r4 r4 r5 r� F s�
$
zTarFile.__init__c
K s� | r| rt d��|dkr�xz| jD ]p}t| | j| �}|dk rH|j� }y||d|f|�S ttfk
r� } z|dk r�|j|� w$W Y dd} ~ X q$X q$W td���nd|k�r|jdd�\}
}|
p�d}
|p�d}|| jkr�t| | j| �}n td | ��|||
|f|�S d
|k�r�|jd
d�\}
}|
�p(d}
|�p2d}|
d k�rFt d ��t||
|||�} y| ||
| f|�} W n | j � � Y nX d
| _
| S |dk�r�| j |||f|�S t d��dS )a| Open a tar archive for reading, writing or appending. Return
an appropriate TarFile class.
mode:
'r' or 'r:*' open for reading with transparent compression
'r:' open for reading exclusively uncompressed
'r:gz' open for reading with gzip compression
'r:bz2' open for reading with bzip2 compression
'a' or 'a:' open for appending, creating the file if necessary
'w' or 'w:' open for writing without compression
'w:gz' open for writing with gzip compression
'w:bz2' open for writing with bzip2 compression
'r|*' open a stream of tar blocks with transparent compression
'r|' open an uncompressed stream of tar blocks for reading
'r|gz' open a gzip compressed stream of tar blocks
'r|bz2' open a bzip2 compressed stream of tar blocks
'w|' open an uncompressed stream for writing
'w|gz' open a gzip compressed stream for writing
'w|bz2' open a bzip2 compressed stream for writing
znothing to openrf �r:*Nz%file could not be opened successfully�:r r� zunknown compression type %r�|�rwzmode must be 'r' or 'w'Frq zundiscernible mode)rf r ) rA � OPEN_METHr� r� rz r{ r� rU r� r� r� �taropen)
r r� rp r� r� �kwargsr� �funcZ saved_posr~ rt �streamrj r4 r4 r5 r� � sN
z TarFile.openc K s, t |�dks|dkr td��| |||f|�S )zCOpen uncompressed tar archive name for reading or writing.
r r� z mode must be 'r', 'a' or 'w')r. rA )r r� rp r� r� r4 r4 r5 r� � s zTarFile.taropenr� c K s� t |�dks|dkr td��yddl}|j W n ttfk
rN td��Y nX |dk }y*|j||d ||�}| j|||f|�}W n^ tk
r� | r�|dk r�|j � |dkr�� t
d��Y n$ | r�|dk r�|j � � Y nX ||_ |S ) zkOpen gzip compressed tar archive name for reading or writing.
Appending is not allowed.
r r� zmode must be 'r' or 'w'r Nz gzip module is not availablera znot a gzip file) r. rA �gzipZGzipFiler� �AttributeErrorr{ r� r\ r� rz r� ) r r� rp r� �
compresslevelr� r� Z
extfileobjrj r4 r4 r5 �gzopen s.
zTarFile.gzopenc K s� t |�dks|dkr td��y ddl}W n tk
rD td��Y nX |dk rZt||�}n|j|||d�}y| j|||f|�}W n( tt fk
r� |j
� t d��Y nX d |_ |S )
zlOpen bzip2 compressed tar archive name for reading or writing.
Appending is not allowed.
r r� zmode must be 'r' or 'w'.r Nzbz2 module is not available)r� znot a bzip2 fileF)
r. rA r� r� r{ r� ZBZ2Filer� r\ �EOFErrorr� rz r� )r r� rp r� r� r� r� rj r4 r4 r5 �bz2open$ s zTarFile.bz2openr� r� r� )r� r� r� c C s� | j r
dS | jdkrf| jjttd � | jtd 7 _t| jt�\}}|dkrf| jjtt| � | j sv| jj
� d| _ dS )zlClose the TarFile. In write-mode, two finishing zero blocks are
appended to the archive.
Nrq r r T) r� rp r� rZ r/ r� r� r[ �
RECORDSIZEr� r� )r� r_ r` r4 r4 r5 r� H s
z
TarFile.closec C s" | j |�}|dkr td| ��|S )a Return a TarInfo object for member `name'. If `name' can not be
found in the archive, KeyError is raised. If a member occurs more
than once in the archive, its last occurrence is assumed to be the
most up-to-date version.
Nzfilename %r not found)�
_getmember�KeyError)r� r� r� r4 r4 r5 � getmember\ s
zTarFile.getmemberc C s | j � | js| j� | jS )z�Return the members of the archive as a list of TarInfo objects. The
list has the same order as the members in the archive.
)�_checkr{ �_loadrz )r� r4 r4 r5 �
getmembersg s zTarFile.getmembersc C s dd� | j � D �S )z�Return the members of the archive as a list of their names. It has
the same order as the list returned by getmembers().
c S s g | ]
}|j �qS r4 )r� )rR r� r4 r4 r5 rS u s z$TarFile.getnames.<locals>.<listcomp>)r� )r� r4 r4 r5 �getnamesq s zTarFile.getnamesc C sp | j d� |dk r|j}|dkr$|}tjj|�\}}|jtjd�}|jd�}| j� }| |_ |dkr�t
td�r�| j r�tj |�}q�tj
|�}ntj|j� �}d}|j}t
j|��r|j|jf} | j r�|jdkr�| | jkr�|| j| kr�t}
| j| }nt}
| d �rx|| j| < nht
j|��r"t}
nVt
j|��r4t}
nDt
j |��rPt }
tj |�}n(t
j |��rbt }
nt
j!|��rtt"}
ndS ||_||_#|j$|_%|j&|_'|
tk�r�|j(|_)nd|_)|j*|_+|
|_,||_-t.�r�yt.j/|j%�d |_0W n t1k
�r� Y nX t2�r*yt2j3|j'�d |_4W n t1k
�r( Y nX |
t t"fk�rlt
td��rlt
td ��rltj5|j6�|_7tj8|j6�|_9|S )
aO Create a TarInfo object for either the file `name' or the file
object `fileobj' (using os.fstat on its file descriptor). You can
modify some of the TarInfo's attributes before you add it using
addfile(). If given, `arcname' specifies an alternative name for the
file in the archive.
rq Nr� �lstatrl r r �major�minor):r� r� r� r �
splitdriver� �sep�lstripr� r� r� rv r� �stat�fstat�fileno�st_mode�S_ISREG�st_ino�st_dev�st_nlinkr| r^ r� �S_ISDIRr� �S_ISFIFOrd �S_ISLNKr\ �readlink�S_ISCHRr` �S_ISBLKrb rp �st_uidr �st_gidr! �st_sizer �st_mtimer r� r� �pwd�getpwuidr" r� �grpZgetgrgidr# r� �st_rdevr� r� r� ) r� r� �arcnamer� Zdrvr� Zstatresr� Zstmd�inoder� r4 r4 r5 �
gettarinfow s~
zTarFile.gettarinfoTc C s | j � x�| D ]�}|r�tt|j�dd� td|jp6|j|jp@|jf dd� |j� s\|j � rztdd|j
|j f dd� ntd|j dd� tdt
j|j�dd � dd� t|j|j� r�d
nd dd� |r�|j� r�td |jdd� |j� r�td
|jdd� t� qW dS )z�Print a table of contents to sys.stdout. If `verbose' is False, only
the names of the members are printed. If it is True, an `ls -l'-like
output is produced.
� )rI z%s/%sz%10sz%d,%dz%10dz%d-%02d-%02d %02d:%02d:%02dNr� r� rl z->zlink to)r� �printrt rp r" r r# r! ra rc r� r� r r� Z localtimer r� r+ r] r� r_ )r� �verboser� r4 r4 r5 rP � s&
z TarFile.listc C sr | j d� |dkr|}|dk rPddl}|jdtd� ||�rP| jdd| � dS | jdk r�tjj|�| jkr�| jdd| � dS | jd|� | j ||�}|dkr�| jdd | � dS |dk r�||�}|dkr�| jdd| � dS |j
� �r
t |d
�}| j ||� |j
� nd|j� �rd| j |� |�rnxHtj|�D ].}| jtjj||�tjj||�|||d � �q0W n
| j |� dS ) a~ Add the file `name' to the archive. `name' may be any type of file
(directory, fifo, symbolic link, etc.). If given, `arcname'
specifies an alternative name for the file in the archive.
Directories are added recursively by default. This can be avoided by
setting `recursive' to False. `exclude' is a function that should
return True for each filename to be excluded. `filter' is a function
that expects a TarInfo object argument and returns the changed
TarInfo object, if it returns None the TarInfo object will be
excluded from the archive.
rq Nr z use the filter argument insteadr ztarfile: Excluded %rztarfile: Skipped %rr z tarfile: Unsupported type %rrn )�filter)r� �warnings�warn�DeprecationWarning�_dbgr� r� r ru r� r; rt �addfiler� r+ �listdir�addro ) r� r� r� � recursive�excluder� r� r� �fr4 r4 r5 r� � sD
z TarFile.addc C s� | j d� tj|�}|j| j| j| j�}| jj|� | jt |�7 _|dk r�t
|| j|j � t |j t
�\}}|dkr�| jjtt
| � |d7 }| j|t
7 _| jj|� dS )a] Add the TarInfo object `tarinfo' to the archive. If `fileobj' is
given, tarinfo.size bytes are read from it and added to the archive.
You can create TarInfo objects using gettarinfo().
On Windows platforms, `fileobj' should always be opened with mode
'rb' to avoid irritation about the file size.
rq Nr r )r� r r� rR r2 r3 r� rZ r� r. rb r r[ r� r/ rz rn )r� r� r� rW r_ r` r4 r4 r5 r� 4 s
zTarFile.addfile�.c C s� g }|dkr| }xD|D ]<}|j � r<|j|� tj|�}d|_| j|||j � d� qW |jdd� d� |j� x�|D ]~}tjj ||j
�}y(| j ||� | j ||� | j
||� W qt tk
r� } z$| jdkrЂ n| jdd| � W Y dd}~X qtX qtW dS ) aM Extract all members from the archive to the current working
directory and set owner, modification time and permissions on
directories afterwards. `path' specifies a different directory
to extract to. `members' is optional and must be a subset of the
list returned by getmembers().
Ni� )� set_attrsc S s | j S )N)r� )rp r4 r4 r5 �<lambda>d s z$TarFile.extractall.<locals>.<lambda>)�keyr z tarfile: %s)r+ rn r rp �extract�sort�reverser� r ro r� �chown�utime�chmodry ry r� )r� r rz Z directoriesr� �dirpathr~ r4 r4 r5 �
extractallN s*
zTarFile.extractallrl c C s
| j d� t|t�r | j|�}n|}|j� r>tjj||j�|_ y | j
|tjj||j �|d� W n� t k
r� } zJ| j
dkr~� n6|jdkr�| jdd|j � n| jdd|j|jf � W Y dd}~X nB tk
�r } z$| j
dkr� n| jdd| � W Y dd}~X nX dS )ax Extract a member from the archive to the current working directory,
using its full name. Its file information is extracted as accurately
as possible. `member' may be a filename or a TarInfo object. You can
specify a different directory using `path'. File attributes (owner,
mtime, mode) are set unless `set_attrs' is False.
rf )r� r Nr z tarfile: %sztarfile: %s %r)r� r
r r� r_ r� r ro r� r� �_extract_memberr� �EnvironmentErrorry �filenamer� �strerrorry )r� �memberr r� r� r~ r4 r4 r5 r� t s&
(
zTarFile.extractc C s� | j d� t|t�r | j|�}n|}|j� r8| j| |�S |jtkrN| j| |�S |j� s^|j � r�t| j
t �rtt d��q�| j
| j|��S ndS dS )a� Extract a member from the archive as a file object. `member' may be
a filename or a TarInfo object. If `member' is a regular file, a
file-like object is returned. If `member' is a link, a file-like
object is constructed from the link's target. If `member' is none of
the above, None is returned.
The file-like object is read-only and provides the following
methods: read(), readline(), readlines(), seek() and tell()
rf z'cannot extract (sym)link as file objectN)r� r
r r� r; �
fileobjectr� r< r_ r] r� r� r| � extractfile�_find_link_target)r� r� r� r4 r4 r5 r� � s
zTarFile.extractfilec C sT |j d�}|jdtj�}tjj|�}|r@tjj|� r@tj|� |j� sP|j � rj| j
dd|j |j f � n| j
d|j � |j
� r�| j||� n�|j� r�| j||� nx|j� r�| j||� nb|j� s�|j� r�| j||� nD|j� s�|j � r�| j||� n&|jtk�r| j||� n | j||� |�rP| j||� |j � �sP| j||� | j ||� dS )z\Extract the TarInfo object tarinfo to a physical
file called targetpath.
r� r z%s -> %sN) r, r� r� r� r �dirnamers �makedirsr_ r] r� r� r� r; �makefiler+ �makedirre �makefifora rc �makedev�makelinkr� r< � makeunknownr� r� r� )r� r� �
targetpathr� Z upperdirsr4 r4 r5 r� � s4
zTarFile._extract_memberc C sF yt j|d� W n0 tk
r@ } z|jtjkr0� W Y dd}~X nX dS )z,Make a directory called targetpath.
i� N)r� �mkdirr� �errnoZEEXIST)r� r� r� r~ r4 r4 r5 r� � s
zTarFile.makedirc C s� | j }|j|j� t|d�}|jdk rRx8|jD ] \}}|j|� t|||� q.W nt|||j� |j|j� |j� |j� dS )z'Make a file called targetpath.
ro N) r� r� r� rt r� rb r �truncater� )r� r� r� �source�targetr� r r4 r4 r5 r� � s
zTarFile.makefilec C s" | j ||� | jdd|j � dS )zYMake a file from a TarInfo object with an unknown type
at targetpath.
r z9tarfile: Unknown file type %r, extracted as regular file.N)r� r� r� )r� r� r� r4 r4 r5 r� s zTarFile.makeunknownc C s" t td�rtj|� ntd��dS )z'Make a fifo called targetpath.
�mkfifoz fifo not supported by systemN)r� r� r� ry )r� r� r� r4 r4 r5 r� s
zTarFile.makefifoc C sb t td� st td� r td��|j}|j� r:|tjO }n
|tjO }tj||tj |j
|j �� dS )z<Make a character or block device called targetpath.
�mknodr� z'special devices not supported by systemN) r� r� ry rp rc r� �S_IFBLK�S_IFCHRr� r� r� r� )r� r� r� rp r4 r4 r5 r� s
zTarFile.makedevc C s� yL|j � rtj|j|� n0tjj|j�r8tj|j|� n| j| j |�|� W n> t
k
r� |j � r�tjj tjj |j
�|j�}n|j}Y n6X y| j| j |�|� W n tk
r� td��Y nX dS )z�Make a (symbolic) link called targetpath. If it cannot be created
(platform limitation), we try to make a copy of the referenced file
instead of a link.
z%unable to resolve link inside archiveN)r] r� �symlinkr� r rs r� �linkr� r� �symlink_exceptionro r� r� r� ry )r� r� r� r r4 r4 r5 r� ' s"
zTarFile.makelinkc C s� t r�ttd�r�tj� dkr�ytj|j�d }W n tk
rH |j}Y nX yt j |j
�d }W n tk
rx |j }Y nX y>|j � r�ttd�r�tj
|||� ntjdkr�tj|||� W n* tk
r� } ztd��W Y dd}~X nX dS )z6Set owner of targetpath according to tarinfo.
�geteuidr r �lchownZos2emxzcould not change ownerN)r� r� r� r� r� Zgetgrnamr# r� r! �getpwnamr" r r] r� �sys�platformr� r� ry )r� r� r� �g�ur~ r4 r4 r5 r� D s
z
TarFile.chownc C sL t td�rHytj||j� W n* tk
rF } ztd��W Y dd}~X nX dS )zASet file permissions of targetpath according to tarinfo.
r� zcould not change modeN)r� r� r� rp r� ry )r� r� r� r~ r4 r4 r5 r� Z s
z
TarFile.chmodc C sV t td�sdS ytj||j|jf� W n* tk
rP } ztd��W Y dd}~X nX dS )zBSet modification time of targetpath according to tarinfo.
r� Nz"could not change modification time)r� r� r� r r� ry )r� r� r� r~ r4 r4 r5 r� c s
z
TarFile.utimec C s� | j d� | jdk r$| j}d| _|S | jj| j� d}�x\y| jj| �}W �nB tk
r� } z2| jr�| j dd| j|f � | jt
7 _w:W Y dd}~X n� t k
r� } zJ| jr�| j dd| j|f � | jt
7 _w:n| jdkr�t t
|���W Y dd}~X n� tk
�r& | jdk�r"t d��Y nj tk
�r` } z | jdk�rPt t
|���W Y dd}~X n0 tk
�r� } zt t
|���W Y dd}~X nX P q:W |dk �r�| jj|� nd| _|S )z�Return the next member of the archive as a TarInfo object, when
TarFile is opened for reading. Return None if there is no more
available.
ZraNr z0x%X: %sr z
empty fileT)r� r} r� r� r� r� r5 r� rw r� r� rB rz r r~ r r� rz rn r{ )r� �mr� r~ r4 r4 r5 r? n sF
z TarFile.nextc C sn | j � }|dk r"|d|j|�� }|r2tjj|�}x6t|�D ]*}|rTtjj|j�}n|j}||kr<|S q<W dS )z}Find an archive member by name from bottom to top.
If tarinfo is given, it is used as the starting point.
N)r� �indexr� r �normpath�reversedr� )r� r� r� � normalizerz r� � member_namer4 r4 r5 r� � s zTarFile._getmemberc C s" x| j � }|dkrP qW d| _dS )zWRead through the entire archive file and look for readable
members.
NT)r? r{ )r� r� r4 r4 r5 r� � s
z
TarFile._loadc C s: | j rtd| jj ��|dk r6| j|kr6td| j ��dS )znCheck if TarFile is still open, and if the operation's mode
corresponds to TarFile's mode.
z %s is closedNzbad operation for mode %r)r� r\ r� ru rp )r� rp r4 r4 r5 r� � s zTarFile._checkc C sX |j � r&tjj|j�d |j }d}n
|j}|}| j||dd�}|dkrTtd| ��|S )zZFind the target member of a symlink or hardlink member in the
archive.
r� NT)r� r� zlinkname %r not found)r] r� r r� r� r� r� r� )r� r� r� �limitr� r4 r4 r5 r� � s zTarFile._find_link_targetc C s | j rt| j�S t| �S dS )z$Provide an iterator object.
N)r{ �iterrz �TarIter)r� r4 r4 r5 r� � s
zTarFile.__iter__c C s || j krt|tjd� dS )z.Write debugging output to sys.stderr.
)�fileN)rx r� r� �stderr)r� �level�msgr4 r4 r5 r� � s
z TarFile._dbgc C s | j � | S )N)r� )r� r4 r4 r5 � __enter__� s zTarFile.__enter__c C s, |d kr| j � n| js"| jj � d| _d S )NT)r� r� r� r� )r� r� r � tracebackr4 r4 r5 �__exit__� s
zTarFile.__exit__) Nrf NNNNNNr� NNN)rf N)rf Nr� )rf Nr� )NNN)T)NTNN)N)r� N)rl T)T)NF)N)7ru rv rw rx rx rv rw ry rj rR rk r2 r3 r r� r� r� r� rl r� r� r� r� r� r� r� r� r� r� r� rP r� r� r� r� r� r� r� r� r� r� r� r� r� r� r� r? r� r� r� r� r� r� r r r4 r4 r4 r5 r , sl
iK
b
>
&
#&
0 1
c @ s, e Zd ZdZdd� Zdd� Zdd� ZeZdS ) r� zMIterator Class.
for tarinfo in TarFile(...):
suite...
c C s || _ d| _dS )z$Construct a TarIter object.
r N)r� r� )r� r� r4 r4 r5 r�
s zTarIter.__init__c C s | S )z Return iterator object.
r4 )r� r4 r4 r5 r�
s zTarIter.__iter__c C sb | j js$| j j� }|sPd| j _t�n,y| j j| j }W n tk
rN t�Y nX | jd7 _|S )z�Return the next item using TarFile's next() method.
When all members have been read, set TarFile as _loaded.
Tr )r� r{ r? �
StopIterationrz r� �
IndexError)r� r� r4 r4 r5 �__next__
s
zTarIter.__next__N)ru rv rw rx r� r� r r? r4 r4 r4 r5 r� � s
r� c C s. yt | �}|j� dS tk
r( dS X dS )zfReturn True if name points to a tar archive that we
are able to handle, else return False.
TFN)r� r� r )r� rj r4 r4 r5 r #
s )r r r r r r! r" r# )r r r" r# )r+ r, )N)wZ
__future__r � __version__�version�
__author__Z__date__Z __cvsid__� __credits__r� r� r� r� r� rL r rC r� r� r� r� �NotImplementedErrorr� Z WindowsError� NameError�__all__� version_infoZ __builtin__�builtinsr� Z_openr/ r� r� r r� r� r� r r� r( r^ r\ r` rb r� rd ZCONTTYPEr r r) r r r8 r� rK r� rj r< rZ r- rW �setrK r r@ rX �S_IFLNK�S_IFREGr� �S_IFDIRr� �S_IFIFOZTSUIDZTSGIDZTSVTXZTUREADZTUWRITEZTUEXECZTGREADZTGWRITEZTGEXECZTOREADZTOWRITEZTOEXECr� rk �getfilesystemencodingr6 r; rG rS rX rb rm rt � Exceptionr ry rz r{ r| r} r~ r r� rB r� �objectr� r� r� r� r� r� r r r� r rt r4 r4 r4 r5 �<module> s>
i?K T* pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.pyc 0000644 00000037115 14751155150 0021243 0 ustar 00 3
���eKi � @ s� d Z ddlZddlZddlZddlZddlmZmZ y ddlZW n e k
r\ ddl
ZY nX dddddd d
d d d
dg Z dd� Z ej
r�ejje ej
��Zn e ej� �Zejdkr�dedEd� j� kr�e ejjee��Zejdko�dedFd� j� k�r
e ejjeee��Zejdk�r@dedGd� j� k�r@e ejjeee��Zdd� Ze� Zdadd � Zej� Zejd �Z d d � Z ej j � d Z ej dd � Z!e d e d! Z"ejj#ej$�Z%ejj#ej&�Z'da(dZ)d"d#� Z*d$d%� Z+d&d'� Z,d(d)� Z-d*d+� Z.d,d-� Z/dHd.d/�Z0d0d� Z1d1d2� Z2d3d4� Z3dId5d�Z4d6d� Z5d7d
� Z6d8d � Z7e.� dd9fd:d
�Z8e.� dd9fd;d�Z9d<d� Z:d=d� Z;d>d � Z<d?d � Z=d@dA� Z>dBdC� Z?e@dDk�r�e?� dS )Jz-Access to Python's configuration information.� N)�pardir�realpath�get_config_h_filename�get_config_var�get_config_vars�get_makefile_filename�get_path�get_path_names� get_paths� get_platform�get_python_version�get_scheme_names�parse_config_hc C s" yt | �S tk
r | S X d S )N)r �OSError)�path� r � /usr/lib/python3.6/sysconfig.py�_safe_realpath" s r �ntZpcbuild� z\pc\v�
z\pcbuild\amd64� c C s. x(dD ] } t jjt jjtd| ��rdS qW dS )N�
Setup.dist� Setup.local�ModulesTF)r r )�osr �isfile�join�
_PROJECT_BASE)�fnr r r �is_python_build: s
r Fc C s� t s�ddlm} tjdd�d }| |�}|jd�}|s>td��|j� �}tj |� W d Q R X t
r�x(dD ] }tj |d
d � tj |d d
� qfW da d S )N� )�finder�.� r z
sysconfig.cfgzsysconfig.cfg exists� posix_prefix�
posix_home�includez{srcdir}/Include� platincludez{projectbase}/.T)r% r& ) � _cfg_readZ resourcesr" �__name__�rsplit�find�AssertionErrorZ as_stream�_SCHEMESZreadfp�
_PYTHON_BUILD�set)r" Zbackport_packageZ_finderZ_cfgfile�s�schemer r r �_ensure_cfg_readD s
r3 z \{([^{]*?)\}c s� t � | jd�r | jd�}nt� }| j� }xD|D ]<}|dkr>q0x,|D ]$\}}| j||�rZqD| j|||� qDW q0W | jd� xX| j� D ]L}t| j|��� � fdd�}x,| j|�D ] \}}| j||t j
||�� q�W q�W d S )N�globalsc s$ | j d�}|� kr� | S | j d�S )Nr$ r )�group)�matchobj�name)� variablesr r � _replacero s
z"_expand_globals.<locals>._replacer) r3 Z has_section�items�tuple�sectionsZ
has_optionr0 Zremove_section�dict� _VAR_REPL�sub)�configr4 r< ZsectionZoption�valuer9 r )r8 r �_expand_globalsY s$
rB � r! c s � fdd�}t j|| �S )z�In the string `path`, replace tokens like {some.thing} with the
corresponding value from the map `local_vars`.
If there is no corresponding value, leave the token unchanged.
c s8 | j d�}|� kr� | S |tjkr.tj| S | j d�S )Nr$ r )r5 r �environ)r6 r7 )�
local_varsr r r9 � s
z _subst_vars.<locals>._replacer)r> r? )r rE r9 r )rE r � _subst_vars� s rF c C s4 | j � }x&|j� D ]\}}||kr$q|| |< qW d S )N)�keysr: )� target_dict�
other_dict� target_keys�keyrA r r r � _extend_dict� s
rL c C sd i }|d kri }t |t� � xBtj| �D ]4\}}tjdkrFtjj|�}tjjt ||��||< q(W |S )N�posixr )rM r )
rL r r. r: r r7 r �
expanduser�normpathrF )r2 �vars�resrK rA r r r � _expand_vars� s
rR c s � fdd�}t j|| �S )Nc s$ | j d�}|� kr� | S | j d�S )Nr$ r )r5 )r6 r7 )rP r r r9 � s
z format_value.<locals>._replacer)r> r? )rA rP r9 r )rP r � format_value� s rS c C s t jdkrdS t jS )NrM r% )r r7 r r r r �_get_default_scheme� s
rT c C s� t jjdd �} dd� }t jdkrBt jjd�p.d}| r8| S ||d�S tjdkr|td �}|r|| r`| S |dd
|d tjd d � �S | r�| S |dd
�S d S )N�PYTHONUSERBASEc W s t jjt jj| � �S )N)r r rN r )�argsr r r �joinuser� s z _getuserbase.<locals>.joinuserr �APPDATA�~�Python�darwin�PYTHONFRAMEWORK�Libraryz%d.%dr! z.local)r rD �getr7 �sys�platformr � version_info)�env_baserW �base� frameworkr r r � _getuserbase� s"
re c C s" t jd�}t jd�}t jd�}|dkr*i }i }i }tj| ddd��}|j� }W dQ R X x�|D ]�} | jd�s\| j� d krxq\|j| �}
|
r\|
jd
d �\} } | j� } | j d d �}
d
|
kr�| || < q\y t
| �} W n$ t k
r� | j d d
�|| < Y q\X | || < q\W t |j
� �}d}�x�t|�dk�r�x�t|�D �]�}|| }|j|��pJ|j|�}
|
dk �r�|
jd
�} d}| |k�r|t|| �}n�| |k�r�d}nx| tjk�r�tj| }n`| |k�r�|jd��r�|dd� |k�r�d }n$d| |k�r�d}nt|d| �}n d || < }|�r�||
j� d� }|d|
j� � | | }d
|k�rF|||< n~y t
|�}W n" t k
�rt |j� ||< Y n
X |||< |j|� |jd��r�|dd� |k�r�|dd� }||k�r�|||< n|||< |j|� �q(W �qW x.|j� D ]"\}} t| t��r�| j� ||< �q�W |j|� |S )z�Parse a Makefile-style file.
A dictionary containing name/value pairs is returned. If an
optional dictionary is passed in as the second argument, it is
used instead of a new dictionary.
z"([a-zA-Z][a-zA-Z0-9_]+)\s*=\s*(.*)z \$\(([A-Za-z][A-Za-z0-9_]*)\)z\${([A-Za-z][A-Za-z0-9_]*)}Nzutf-8�surrogateescape)�encoding�errors�#� r$ r! z$$�$�CFLAGS�LDFLAGS�CPPFLAGSr TF�PY_rC )rl rm rn )�re�compile�codecs�open� readlines�
startswith�strip�matchr5 �replace�int�
ValueError�listrG �lenr; �search�strr rD �end�start�remover: �
isinstance�update)�filenamerP � _variable_rx� _findvar1_rx� _findvar2_rx�done�notdone�f�lines�line�m�n�v�tmpvr8 �renamed_variablesr7 rA �found�item�after�kr r r �_parse_makefile� s�
r� c C sD t rtjjtd�S ttd�r,dttjf } nd} tjjt d�| d�S )z Return the path of the Makefile.�Makefile�abiflagsz config-%s%sr@ �stdlib)
r/ r r r r �hasattrr_ �_PY_VERSION_SHORTr� r )�config_dir_namer r r r M s
c C s� t � }yt|| � W nJ tk
r^ } z.d| }t|d�rF|d|j }t|��W Y dd}~X nX t� }y"t|��}t|| � W dQ R X W nJ tk
r� } z.d| }t|d�r�|d|j }t|��W Y dd}~X nX tr�| d | d< dS )z7Initialize the module as appropriate for POSIX systems.z.invalid Python installation: unable to open %s�strerrorz (%s)N� BLDSHARED�LDSHARED) r r� �IOErrorr� r� r rs r r/ )rP �makefile�e�msg�config_hr� r r r � _init_posixX s&
r� c C sV t d�| d< t d�| d< t d�| d< d| d< d | d
< t| d < tjjttj��| d < d
S )z+Initialize the module as appropriate for NTr� �LIBDEST�
platstdlib�
BINLIBDESTr' � INCLUDEPYz.pyd�SOz.exe�EXE�VERSION�BINDIRN)r �_PY_VERSION_SHORT_NO_DOTr r �dirnamer r_ �
executable)rP r r r �_init_non_posixt s r� c C s� |dkr i }t jd�}t jd�}xx| j� }|s0P |j|�}|rz|jdd�\}}y t|�}W n tk
rn Y nX |||< q"|j|�}|r"d||jd�< q"W |S )z�Parse a config.h-style file.
A dictionary containing name/value pairs is returned. If an
optional dictionary is passed in as the second argument, it is
used instead of a new dictionary.
Nz"#define ([A-Z][A-Za-z0-9_]+) (.*)
z&/[*] #undef ([A-Z][A-Za-z0-9_]+) [*]/
r$ r! r )rp rq �readlinerw r5 ry rz )�fprP � define_rx�undef_rxr� r� r� r� r r r r � s(
c C s: t r$tjdkr tjjtd�} q,t} ntd�} tjj| d�S )z Return the path of pyconfig.h.r �PCr( z
pyconfig.h)r/ r r7 r r r r )�inc_dirr r r r � s
c C s t ttj� ��S )z,Return a tuple containing the schemes names.)r; �sortedr. r< r r r r r
� s c C s
t jd�S )z*Return a tuple containing the paths names.r% )r. Zoptionsr r r r r � s Tc C s& t � |rt| |�S ttj| ��S dS )z�Return a mapping containing an install scheme.
``scheme`` is the install scheme name. If not provided, it will
return the default scheme for the current platform.
N)r3 rR r= r. r: )r2 rP �expandr r r r
� s
c C s t |||�| S )z[Return a path corresponding to the scheme.
``scheme`` is the install scheme name.
)r
)r7 r2 rP r� r r r r � s c G s� t dk�r�i a tt d< tt d< tt d< tt d< td td t d< tt d < tt d
< tt d < ytjt d < W n tk
r� d
t d < Y nX t j
d#kr�t t � t j
dkr�t t � tj
dkr�t� t d< dt kr�tt d< ntt d �t d< to�t j
dk�r\t}y t j� }W n tk
�r d}Y nX t jjt d � �r\||k�r\t jj|t d �}t jj|�t d< tjdk�r�t j� d }t|jd�d �}|dk �r�x:d$D ]2}t | }tj d d |�}tj d d |�}|t |< �q�W n�d t j k�r t j d }x8d%D ]0}t | }tj d d |�}|d | }|t |< �q�W t j dd
�} tj d | �}
|
dk �r�|
j d!�} t jj!| ��s�x,d&D ]$}t | }tj d"d |�}|t |< �q^W | �r�g } x | D ]}
| j"t j |
�� �q�W | S t S dS )'ay With no arguments, return a dictionary of all configuration
variables relevant for the current platform.
On Unix, this means every variable defined in Python's installed Makefile;
On Windows and Mac OS it's a much smaller set.
With arguments, return a list of values that result from looking up
each argument in the configuration variable dictionary.
N�prefix� exec_prefix�
py_version�py_version_shortr r! �py_version_nodotrc �platbase� projectbaser� rj r �os2rM z2.6�userbase�srcdirr[ r# r rm �
BASECFLAGSrl � PY_CFLAGSr� z
-arch\s+\w+\s� z-isysroot [^ ]*Z ARCHFLAGSz-isysroot\s+(\S+)r$ z-isysroot\s+\S+(\s|$))r r� )rm r� rl r� r� )rm r� rl r� r� )rm r� rl r� r� )#� _CONFIG_VARS�_PREFIX� _EXEC_PREFIX� _PY_VERSIONr� r r_ r� �AttributeErrorr r7 r� r� �versionre r r/ �getcwdr r �isabsr rO r` �unamery �splitrp r? rD r^ r} r5 �exists�append)rV rc �cwdr� Zkernel_versionZ
major_versionrK �flagsZarchrl r� Zsdk�valsr7 r r r r � s�
c C s t � j| �S )z�Return the value of a single variable using the dictionary returned by
'get_config_vars()'.
Equivalent to get_config_vars().get(name)
)r r^ )r7 r r r r R s c C s` t jdkrnd} tjj| �}|d:kr(tjS tjjd|�}tj|t| � |� j� }|dkr\dS |dkrhdS tjS t jd ks�tt d
� r�tjS t j � \}}}}}|j� j
d d �}|j
d
d�}|j
d d�}|dd� dkr�d||f S |dd� dk�r(|d dk�rRd}dt |d �d |dd� f }�n*|dd� d k�rFd||f S |dd� d k�rfd |||f S |dd � d k�r�d }t j
d!�} | j|�}
|
�rR|
j� }�n�|dd � d"k�rRt� } | jd#�} | }
y td$�}W n tk
�r� Y nJX zt jd%|j� �}
W d|j� X |
dk �r4d&j|
jd�jd&�dd� �}
| �s>|
} | �rR| }d'}|
d& d(k�rd)t� jd*d �j� k�rd+}t� jd*�}t jd,|�}tt t |���}t|�dk�r�|d }n^|d;k�r�d+}nN|d<k�r�d0}n>|d=k�r�d1}n.|d>k�r�d3}n |d?k�rd4}nt d5|f ��n<|d-k�r2tj d@k�rRd/}n |dAk�rRtj dBk�rNd2}nd.}d9|||f S )Ca� Return a string that identifies the current platform.
This is used mainly to distinguish platform-specific build directories and
platform-specific built distributions. Typically includes the OS name
and version and the architecture (as supplied by 'os.uname()'),
although the exact information included depends on the OS; eg. for IRIX
the architecture isn't particularly important (IRIX only runs on SGI
hardware), but for Linux the kernel version isn't particularly
important.
Examples of returned values:
linux-i586
linux-alpha (?)
solaris-2.6-sun4u
irix-5.3
irix64-6.2
Windows will return one of:
win-amd64 (64bit Windows on AMD64 (aka x86_64, Intel64, EM64T, etc)
win-ia64 (64bit Windows on Itanium)
win32 (all others - specifically, sys.platform is returned)
For other non-POSIX platforms, currently just returns 'sys.platform'.
r z bit (r$ �)�amd64z win-amd64�itaniumzwin-ia64rM r� �/rj r� �_�-N� �linuxz%s-%s�sunosr �5�solarisz%d.%srC r! � �irix�aixz%s-%s.%s� �cygwinz[\d.]+r[ �MACOSX_DEPLOYMENT_TARGETz0/System/Library/CoreServices/SystemVersion.plistz=<key>ProductUserVisibleVersion</key>\s*<string>(.*?)</string>r# Zmacosxz10.4.z-archrl Zfatz
-arch\s+(\S+)�i386�ppc�x86_64ZintelZfat3�ppc64Zfat64Z universalz%Don't know machine value for archs=%r� �PowerPC�Power_Macintoshz%s-%s-%s���)r� r� )r� r� )r� r� r� )r� r� )r� r� r� r� l )r� r� l ) r r7 r_ r� r, r` r| �lowerr� r� rx ry rp rq rw r5 r r^ rs r� r} �read�closer r� rv �findallr; r� r0 rz �maxsize)r� �i�j�look�osname�host�releaser� �machine�rel_rer� ZcfgvarsZmacverZ
macreleaser� ZcflagsZarchsr r r r [ s�
$
c C s t S )N)r� r r r r r � s c C sJ xDt t|j� ��D ]0\}\}}|dkr2td| � td||f � qW d S )Nr z%s: z
%s = "%s")� enumerater� r: �print)�title�data�indexrK rA r r r � _print_dict s r c C sR t dt� � t dt� � t dt� � t � tdt� � t � tdt� � dS )z*Display all information sysconfig detains.zPlatform: "%s"zPython version: "%s"z!Current installation scheme: "%s"�Paths� VariablesN)r� r r rT r r
r r r r r �_main s r �__main__i����i����i�)N)N)A�__doc__rr r rp r_ Zos.pathr r Z configparser� ImportErrorZ ConfigParser�__all__r r� r r� r r� r7 r� r r r/ r) r3 ZRawConfigParserr. rq r> rB r� r� r� r� r� rO r� r� r� r� r� �
_USER_BASErF rL rR rS rT re r� r r� r� r r r
r r
r r r r r r r r* r r r r �<module> s� "
#
v
#
pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.opt-1.pyc 0000644 00000000613 14751155150 0021726 0 ustar 00 3
���e � @ s d Z dS )a Modules copied from Python 3 standard libraries, for internal use only.
Individual classes and functions are found in d2._backport.misc. Intended
usage is to always import things missing from 3.1 from that module: the
built-in/stdlib objects will be used if found.
N)�__doc__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.pyc 0000644 00000000613 14751155150 0020767 0 ustar 00 3
���e � @ s d Z dS )a Modules copied from Python 3 standard libraries, for internal use only.
Individual classes and functions are found in d2._backport.misc. Intended
usage is to always import things missing from 3.1 from that module: the
built-in/stdlib objects will be used if found.
N)�__doc__� r r � /usr/lib/python3.6/__init__.py�<module> s pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.pyc 0000644 00000001740 14751155150 0020165 0 ustar 00 3
���e� � @ s� d Z ddlZddlZdddgZyddlmZ W n ek
rL d dd�ZY nX yeZW n( ek
r~ dd l m
Z
d
d� ZY nX y
ej Z W n e k
r� d d� Z Y nX dS )
z/Backports for individual classes and functions.� N�cache_from_source�callable�fsencode)r Tc C s |rdp
d}| | S )N�c�o� )Zpy_file�debugZextr r �/usr/lib/python3.6/misc.pyr s )�Callablec C s
t | t�S )N)�
isinstancer
)�objr r r r s c C s< t | t�r| S t | t�r&| jtj� �S tdt| �j ��d S )Nzexpect bytes or str, not %s) r �bytes�str�encode�sys�getfilesystemencoding� TypeError�type�__name__)�filenamer r r r " s
)T)
�__doc__�osr �__all__Zimpr � ImportErrorr � NameError� collectionsr
r �AttributeErrorr r r r �<module> s
pip/_vendor/distlib/_backport/sysconfig.cfg 0000644 00000005071 14751155150 0015062 0 ustar 00 [posix_prefix]
# Configuration directories. Some of these come straight out of the
# configure script. They are for implementing the other variables, not to
# be used directly in [resource_locations].
confdir = /etc
datadir = /usr/share
libdir = /usr/lib
statedir = /var
# User resource directory
local = ~/.local/{distribution.name}
stdlib = {base}/lib/python{py_version_short}
platstdlib = {platbase}/lib/python{py_version_short}
purelib = {base}/lib/python{py_version_short}/site-packages
platlib = {platbase}/lib/python{py_version_short}/site-packages
include = {base}/include/python{py_version_short}{abiflags}
platinclude = {platbase}/include/python{py_version_short}{abiflags}
data = {base}
[posix_home]
stdlib = {base}/lib/python
platstdlib = {base}/lib/python
purelib = {base}/lib/python
platlib = {base}/lib/python
include = {base}/include/python
platinclude = {base}/include/python
scripts = {base}/bin
data = {base}
[nt]
stdlib = {base}/Lib
platstdlib = {base}/Lib
purelib = {base}/Lib/site-packages
platlib = {base}/Lib/site-packages
include = {base}/Include
platinclude = {base}/Include
scripts = {base}/Scripts
data = {base}
[os2]
stdlib = {base}/Lib
platstdlib = {base}/Lib
purelib = {base}/Lib/site-packages
platlib = {base}/Lib/site-packages
include = {base}/Include
platinclude = {base}/Include
scripts = {base}/Scripts
data = {base}
[os2_home]
stdlib = {userbase}/lib/python{py_version_short}
platstdlib = {userbase}/lib/python{py_version_short}
purelib = {userbase}/lib/python{py_version_short}/site-packages
platlib = {userbase}/lib/python{py_version_short}/site-packages
include = {userbase}/include/python{py_version_short}
scripts = {userbase}/bin
data = {userbase}
[nt_user]
stdlib = {userbase}/Python{py_version_nodot}
platstdlib = {userbase}/Python{py_version_nodot}
purelib = {userbase}/Python{py_version_nodot}/site-packages
platlib = {userbase}/Python{py_version_nodot}/site-packages
include = {userbase}/Python{py_version_nodot}/Include
scripts = {userbase}/Scripts
data = {userbase}
[posix_user]
stdlib = {userbase}/lib/python{py_version_short}
platstdlib = {userbase}/lib/python{py_version_short}
purelib = {userbase}/lib/python{py_version_short}/site-packages
platlib = {userbase}/lib/python{py_version_short}/site-packages
include = {userbase}/include/python{py_version_short}
scripts = {userbase}/bin
data = {userbase}
[osx_framework_user]
stdlib = {userbase}/lib/python
platstdlib = {userbase}/lib/python
purelib = {userbase}/lib/python/site-packages
platlib = {userbase}/lib/python/site-packages
include = {userbase}/include
scripts = {userbase}/bin
data = {userbase}
pip/_vendor/distlib/_backport/tarfile.py 0000644 00000264724 14751155150 0014411 0 ustar 00 #-------------------------------------------------------------------
# tarfile.py
#-------------------------------------------------------------------
# Copyright (C) 2002 Lars Gustaebel <lars@gustaebel.de>
# All rights reserved.
#
# Permission is hereby granted, free of charge, to any person
# obtaining a copy of this software and associated documentation
# files (the "Software"), to deal in the Software without
# restriction, including without limitation the rights to use,
# copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the
# Software is furnished to do so, subject to the following
# conditions:
#
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
# OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
# HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
# WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
# OTHER DEALINGS IN THE SOFTWARE.
#
from __future__ import print_function
"""Read from and write to tar format archives.
"""
__version__ = "$Revision$"
version = "0.9.0"
__author__ = "Lars Gust\u00e4bel (lars@gustaebel.de)"
__date__ = "$Date: 2011-02-25 17:42:01 +0200 (Fri, 25 Feb 2011) $"
__cvsid__ = "$Id: tarfile.py 88586 2011-02-25 15:42:01Z marc-andre.lemburg $"
__credits__ = "Gustavo Niemeyer, Niels Gust\u00e4bel, Richard Townsend."
#---------
# Imports
#---------
import sys
import os
import stat
import errno
import time
import struct
import copy
import re
try:
import grp, pwd
except ImportError:
grp = pwd = None
# os.symlink on Windows prior to 6.0 raises NotImplementedError
symlink_exception = (AttributeError, NotImplementedError)
try:
# WindowsError (1314) will be raised if the caller does not hold the
# SeCreateSymbolicLinkPrivilege privilege
symlink_exception += (WindowsError,)
except NameError:
pass
# from tarfile import *
__all__ = ["TarFile", "TarInfo", "is_tarfile", "TarError"]
if sys.version_info[0] < 3:
import __builtin__ as builtins
else:
import builtins
_open = builtins.open # Since 'open' is TarFile.open
#---------------------------------------------------------
# tar constants
#---------------------------------------------------------
NUL = b"\0" # the null character
BLOCKSIZE = 512 # length of processing blocks
RECORDSIZE = BLOCKSIZE * 20 # length of records
GNU_MAGIC = b"ustar \0" # magic gnu tar string
POSIX_MAGIC = b"ustar\x0000" # magic posix tar string
LENGTH_NAME = 100 # maximum length of a filename
LENGTH_LINK = 100 # maximum length of a linkname
LENGTH_PREFIX = 155 # maximum length of the prefix field
REGTYPE = b"0" # regular file
AREGTYPE = b"\0" # regular file
LNKTYPE = b"1" # link (inside tarfile)
SYMTYPE = b"2" # symbolic link
CHRTYPE = b"3" # character special device
BLKTYPE = b"4" # block special device
DIRTYPE = b"5" # directory
FIFOTYPE = b"6" # fifo special device
CONTTYPE = b"7" # contiguous file
GNUTYPE_LONGNAME = b"L" # GNU tar longname
GNUTYPE_LONGLINK = b"K" # GNU tar longlink
GNUTYPE_SPARSE = b"S" # GNU tar sparse file
XHDTYPE = b"x" # POSIX.1-2001 extended header
XGLTYPE = b"g" # POSIX.1-2001 global header
SOLARIS_XHDTYPE = b"X" # Solaris extended header
USTAR_FORMAT = 0 # POSIX.1-1988 (ustar) format
GNU_FORMAT = 1 # GNU tar format
PAX_FORMAT = 2 # POSIX.1-2001 (pax) format
DEFAULT_FORMAT = GNU_FORMAT
#---------------------------------------------------------
# tarfile constants
#---------------------------------------------------------
# File types that tarfile supports:
SUPPORTED_TYPES = (REGTYPE, AREGTYPE, LNKTYPE,
SYMTYPE, DIRTYPE, FIFOTYPE,
CONTTYPE, CHRTYPE, BLKTYPE,
GNUTYPE_LONGNAME, GNUTYPE_LONGLINK,
GNUTYPE_SPARSE)
# File types that will be treated as a regular file.
REGULAR_TYPES = (REGTYPE, AREGTYPE,
CONTTYPE, GNUTYPE_SPARSE)
# File types that are part of the GNU tar format.
GNU_TYPES = (GNUTYPE_LONGNAME, GNUTYPE_LONGLINK,
GNUTYPE_SPARSE)
# Fields from a pax header that override a TarInfo attribute.
PAX_FIELDS = ("path", "linkpath", "size", "mtime",
"uid", "gid", "uname", "gname")
# Fields from a pax header that are affected by hdrcharset.
PAX_NAME_FIELDS = set(("path", "linkpath", "uname", "gname"))
# Fields in a pax header that are numbers, all other fields
# are treated as strings.
PAX_NUMBER_FIELDS = {
"atime": float,
"ctime": float,
"mtime": float,
"uid": int,
"gid": int,
"size": int
}
#---------------------------------------------------------
# Bits used in the mode field, values in octal.
#---------------------------------------------------------
S_IFLNK = 0o120000 # symbolic link
S_IFREG = 0o100000 # regular file
S_IFBLK = 0o060000 # block device
S_IFDIR = 0o040000 # directory
S_IFCHR = 0o020000 # character device
S_IFIFO = 0o010000 # fifo
TSUID = 0o4000 # set UID on execution
TSGID = 0o2000 # set GID on execution
TSVTX = 0o1000 # reserved
TUREAD = 0o400 # read by owner
TUWRITE = 0o200 # write by owner
TUEXEC = 0o100 # execute/search by owner
TGREAD = 0o040 # read by group
TGWRITE = 0o020 # write by group
TGEXEC = 0o010 # execute/search by group
TOREAD = 0o004 # read by other
TOWRITE = 0o002 # write by other
TOEXEC = 0o001 # execute/search by other
#---------------------------------------------------------
# initialization
#---------------------------------------------------------
if os.name in ("nt", "ce"):
ENCODING = "utf-8"
else:
ENCODING = sys.getfilesystemencoding()
#---------------------------------------------------------
# Some useful functions
#---------------------------------------------------------
def stn(s, length, encoding, errors):
"""Convert a string to a null-terminated bytes object.
"""
s = s.encode(encoding, errors)
return s[:length] + (length - len(s)) * NUL
def nts(s, encoding, errors):
"""Convert a null-terminated bytes object to a string.
"""
p = s.find(b"\0")
if p != -1:
s = s[:p]
return s.decode(encoding, errors)
def nti(s):
"""Convert a number field to a python number.
"""
# There are two possible encodings for a number field, see
# itn() below.
if s[0] != chr(0o200):
try:
n = int(nts(s, "ascii", "strict") or "0", 8)
except ValueError:
raise InvalidHeaderError("invalid header")
else:
n = 0
for i in range(len(s) - 1):
n <<= 8
n += ord(s[i + 1])
return n
def itn(n, digits=8, format=DEFAULT_FORMAT):
"""Convert a python number to a number field.
"""
# POSIX 1003.1-1988 requires numbers to be encoded as a string of
# octal digits followed by a null-byte, this allows values up to
# (8**(digits-1))-1. GNU tar allows storing numbers greater than
# that if necessary. A leading 0o200 byte indicates this particular
# encoding, the following digits-1 bytes are a big-endian
# representation. This allows values up to (256**(digits-1))-1.
if 0 <= n < 8 ** (digits - 1):
s = ("%0*o" % (digits - 1, n)).encode("ascii") + NUL
else:
if format != GNU_FORMAT or n >= 256 ** (digits - 1):
raise ValueError("overflow in number field")
if n < 0:
# XXX We mimic GNU tar's behaviour with negative numbers,
# this could raise OverflowError.
n = struct.unpack("L", struct.pack("l", n))[0]
s = bytearray()
for i in range(digits - 1):
s.insert(0, n & 0o377)
n >>= 8
s.insert(0, 0o200)
return s
def calc_chksums(buf):
"""Calculate the checksum for a member's header by summing up all
characters except for the chksum field which is treated as if
it was filled with spaces. According to the GNU tar sources,
some tars (Sun and NeXT) calculate chksum with signed char,
which will be different if there are chars in the buffer with
the high bit set. So we calculate two checksums, unsigned and
signed.
"""
unsigned_chksum = 256 + sum(struct.unpack("148B", buf[:148]) + struct.unpack("356B", buf[156:512]))
signed_chksum = 256 + sum(struct.unpack("148b", buf[:148]) + struct.unpack("356b", buf[156:512]))
return unsigned_chksum, signed_chksum
def copyfileobj(src, dst, length=None):
"""Copy length bytes from fileobj src to fileobj dst.
If length is None, copy the entire content.
"""
if length == 0:
return
if length is None:
while True:
buf = src.read(16*1024)
if not buf:
break
dst.write(buf)
return
BUFSIZE = 16 * 1024
blocks, remainder = divmod(length, BUFSIZE)
for b in range(blocks):
buf = src.read(BUFSIZE)
if len(buf) < BUFSIZE:
raise IOError("end of file reached")
dst.write(buf)
if remainder != 0:
buf = src.read(remainder)
if len(buf) < remainder:
raise IOError("end of file reached")
dst.write(buf)
return
filemode_table = (
((S_IFLNK, "l"),
(S_IFREG, "-"),
(S_IFBLK, "b"),
(S_IFDIR, "d"),
(S_IFCHR, "c"),
(S_IFIFO, "p")),
((TUREAD, "r"),),
((TUWRITE, "w"),),
((TUEXEC|TSUID, "s"),
(TSUID, "S"),
(TUEXEC, "x")),
((TGREAD, "r"),),
((TGWRITE, "w"),),
((TGEXEC|TSGID, "s"),
(TSGID, "S"),
(TGEXEC, "x")),
((TOREAD, "r"),),
((TOWRITE, "w"),),
((TOEXEC|TSVTX, "t"),
(TSVTX, "T"),
(TOEXEC, "x"))
)
def filemode(mode):
"""Convert a file's mode to a string of the form
-rwxrwxrwx.
Used by TarFile.list()
"""
perm = []
for table in filemode_table:
for bit, char in table:
if mode & bit == bit:
perm.append(char)
break
else:
perm.append("-")
return "".join(perm)
class TarError(Exception):
"""Base exception."""
pass
class ExtractError(TarError):
"""General exception for extract errors."""
pass
class ReadError(TarError):
"""Exception for unreadable tar archives."""
pass
class CompressionError(TarError):
"""Exception for unavailable compression methods."""
pass
class StreamError(TarError):
"""Exception for unsupported operations on stream-like TarFiles."""
pass
class HeaderError(TarError):
"""Base exception for header errors."""
pass
class EmptyHeaderError(HeaderError):
"""Exception for empty headers."""
pass
class TruncatedHeaderError(HeaderError):
"""Exception for truncated headers."""
pass
class EOFHeaderError(HeaderError):
"""Exception for end of file headers."""
pass
class InvalidHeaderError(HeaderError):
"""Exception for invalid headers."""
pass
class SubsequentHeaderError(HeaderError):
"""Exception for missing and invalid extended headers."""
pass
#---------------------------
# internal stream interface
#---------------------------
class _LowLevelFile(object):
"""Low-level file object. Supports reading and writing.
It is used instead of a regular file object for streaming
access.
"""
def __init__(self, name, mode):
mode = {
"r": os.O_RDONLY,
"w": os.O_WRONLY | os.O_CREAT | os.O_TRUNC,
}[mode]
if hasattr(os, "O_BINARY"):
mode |= os.O_BINARY
self.fd = os.open(name, mode, 0o666)
def close(self):
os.close(self.fd)
def read(self, size):
return os.read(self.fd, size)
def write(self, s):
os.write(self.fd, s)
class _Stream(object):
"""Class that serves as an adapter between TarFile and
a stream-like object. The stream-like object only
needs to have a read() or write() method and is accessed
blockwise. Use of gzip or bzip2 compression is possible.
A stream-like object could be for example: sys.stdin,
sys.stdout, a socket, a tape device etc.
_Stream is intended to be used only internally.
"""
def __init__(self, name, mode, comptype, fileobj, bufsize):
"""Construct a _Stream object.
"""
self._extfileobj = True
if fileobj is None:
fileobj = _LowLevelFile(name, mode)
self._extfileobj = False
if comptype == '*':
# Enable transparent compression detection for the
# stream interface
fileobj = _StreamProxy(fileobj)
comptype = fileobj.getcomptype()
self.name = name or ""
self.mode = mode
self.comptype = comptype
self.fileobj = fileobj
self.bufsize = bufsize
self.buf = b""
self.pos = 0
self.closed = False
try:
if comptype == "gz":
try:
import zlib
except ImportError:
raise CompressionError("zlib module is not available")
self.zlib = zlib
self.crc = zlib.crc32(b"")
if mode == "r":
self._init_read_gz()
else:
self._init_write_gz()
if comptype == "bz2":
try:
import bz2
except ImportError:
raise CompressionError("bz2 module is not available")
if mode == "r":
self.dbuf = b""
self.cmp = bz2.BZ2Decompressor()
else:
self.cmp = bz2.BZ2Compressor()
except:
if not self._extfileobj:
self.fileobj.close()
self.closed = True
raise
def __del__(self):
if hasattr(self, "closed") and not self.closed:
self.close()
def _init_write_gz(self):
"""Initialize for writing with gzip compression.
"""
self.cmp = self.zlib.compressobj(9, self.zlib.DEFLATED,
-self.zlib.MAX_WBITS,
self.zlib.DEF_MEM_LEVEL,
0)
timestamp = struct.pack("<L", int(time.time()))
self.__write(b"\037\213\010\010" + timestamp + b"\002\377")
if self.name.endswith(".gz"):
self.name = self.name[:-3]
# RFC1952 says we must use ISO-8859-1 for the FNAME field.
self.__write(self.name.encode("iso-8859-1", "replace") + NUL)
def write(self, s):
"""Write string s to the stream.
"""
if self.comptype == "gz":
self.crc = self.zlib.crc32(s, self.crc)
self.pos += len(s)
if self.comptype != "tar":
s = self.cmp.compress(s)
self.__write(s)
def __write(self, s):
"""Write string s to the stream if a whole new block
is ready to be written.
"""
self.buf += s
while len(self.buf) > self.bufsize:
self.fileobj.write(self.buf[:self.bufsize])
self.buf = self.buf[self.bufsize:]
def close(self):
"""Close the _Stream object. No operation should be
done on it afterwards.
"""
if self.closed:
return
if self.mode == "w" and self.comptype != "tar":
self.buf += self.cmp.flush()
if self.mode == "w" and self.buf:
self.fileobj.write(self.buf)
self.buf = b""
if self.comptype == "gz":
# The native zlib crc is an unsigned 32-bit integer, but
# the Python wrapper implicitly casts that to a signed C
# long. So, on a 32-bit box self.crc may "look negative",
# while the same crc on a 64-bit box may "look positive".
# To avoid irksome warnings from the `struct` module, force
# it to look positive on all boxes.
self.fileobj.write(struct.pack("<L", self.crc & 0xffffffff))
self.fileobj.write(struct.pack("<L", self.pos & 0xffffFFFF))
if not self._extfileobj:
self.fileobj.close()
self.closed = True
def _init_read_gz(self):
"""Initialize for reading a gzip compressed fileobj.
"""
self.cmp = self.zlib.decompressobj(-self.zlib.MAX_WBITS)
self.dbuf = b""
# taken from gzip.GzipFile with some alterations
if self.__read(2) != b"\037\213":
raise ReadError("not a gzip file")
if self.__read(1) != b"\010":
raise CompressionError("unsupported compression method")
flag = ord(self.__read(1))
self.__read(6)
if flag & 4:
xlen = ord(self.__read(1)) + 256 * ord(self.__read(1))
self.read(xlen)
if flag & 8:
while True:
s = self.__read(1)
if not s or s == NUL:
break
if flag & 16:
while True:
s = self.__read(1)
if not s or s == NUL:
break
if flag & 2:
self.__read(2)
def tell(self):
"""Return the stream's file pointer position.
"""
return self.pos
def seek(self, pos=0):
"""Set the stream's file pointer to pos. Negative seeking
is forbidden.
"""
if pos - self.pos >= 0:
blocks, remainder = divmod(pos - self.pos, self.bufsize)
for i in range(blocks):
self.read(self.bufsize)
self.read(remainder)
else:
raise StreamError("seeking backwards is not allowed")
return self.pos
def read(self, size=None):
"""Return the next size number of bytes from the stream.
If size is not defined, return all bytes of the stream
up to EOF.
"""
if size is None:
t = []
while True:
buf = self._read(self.bufsize)
if not buf:
break
t.append(buf)
buf = "".join(t)
else:
buf = self._read(size)
self.pos += len(buf)
return buf
def _read(self, size):
"""Return size bytes from the stream.
"""
if self.comptype == "tar":
return self.__read(size)
c = len(self.dbuf)
while c < size:
buf = self.__read(self.bufsize)
if not buf:
break
try:
buf = self.cmp.decompress(buf)
except IOError:
raise ReadError("invalid compressed data")
self.dbuf += buf
c += len(buf)
buf = self.dbuf[:size]
self.dbuf = self.dbuf[size:]
return buf
def __read(self, size):
"""Return size bytes from stream. If internal buffer is empty,
read another block from the stream.
"""
c = len(self.buf)
while c < size:
buf = self.fileobj.read(self.bufsize)
if not buf:
break
self.buf += buf
c += len(buf)
buf = self.buf[:size]
self.buf = self.buf[size:]
return buf
# class _Stream
class _StreamProxy(object):
"""Small proxy class that enables transparent compression
detection for the Stream interface (mode 'r|*').
"""
def __init__(self, fileobj):
self.fileobj = fileobj
self.buf = self.fileobj.read(BLOCKSIZE)
def read(self, size):
self.read = self.fileobj.read
return self.buf
def getcomptype(self):
if self.buf.startswith(b"\037\213\010"):
return "gz"
if self.buf.startswith(b"BZh91"):
return "bz2"
return "tar"
def close(self):
self.fileobj.close()
# class StreamProxy
class _BZ2Proxy(object):
"""Small proxy class that enables external file object
support for "r:bz2" and "w:bz2" modes. This is actually
a workaround for a limitation in bz2 module's BZ2File
class which (unlike gzip.GzipFile) has no support for
a file object argument.
"""
blocksize = 16 * 1024
def __init__(self, fileobj, mode):
self.fileobj = fileobj
self.mode = mode
self.name = getattr(self.fileobj, "name", None)
self.init()
def init(self):
import bz2
self.pos = 0
if self.mode == "r":
self.bz2obj = bz2.BZ2Decompressor()
self.fileobj.seek(0)
self.buf = b""
else:
self.bz2obj = bz2.BZ2Compressor()
def read(self, size):
x = len(self.buf)
while x < size:
raw = self.fileobj.read(self.blocksize)
if not raw:
break
data = self.bz2obj.decompress(raw)
self.buf += data
x += len(data)
buf = self.buf[:size]
self.buf = self.buf[size:]
self.pos += len(buf)
return buf
def seek(self, pos):
if pos < self.pos:
self.init()
self.read(pos - self.pos)
def tell(self):
return self.pos
def write(self, data):
self.pos += len(data)
raw = self.bz2obj.compress(data)
self.fileobj.write(raw)
def close(self):
if self.mode == "w":
raw = self.bz2obj.flush()
self.fileobj.write(raw)
# class _BZ2Proxy
#------------------------
# Extraction file object
#------------------------
class _FileInFile(object):
"""A thin wrapper around an existing file object that
provides a part of its data as an individual file
object.
"""
def __init__(self, fileobj, offset, size, blockinfo=None):
self.fileobj = fileobj
self.offset = offset
self.size = size
self.position = 0
if blockinfo is None:
blockinfo = [(0, size)]
# Construct a map with data and zero blocks.
self.map_index = 0
self.map = []
lastpos = 0
realpos = self.offset
for offset, size in blockinfo:
if offset > lastpos:
self.map.append((False, lastpos, offset, None))
self.map.append((True, offset, offset + size, realpos))
realpos += size
lastpos = offset + size
if lastpos < self.size:
self.map.append((False, lastpos, self.size, None))
def seekable(self):
if not hasattr(self.fileobj, "seekable"):
# XXX gzip.GzipFile and bz2.BZ2File
return True
return self.fileobj.seekable()
def tell(self):
"""Return the current file position.
"""
return self.position
def seek(self, position):
"""Seek to a position in the file.
"""
self.position = position
def read(self, size=None):
"""Read data from the file.
"""
if size is None:
size = self.size - self.position
else:
size = min(size, self.size - self.position)
buf = b""
while size > 0:
while True:
data, start, stop, offset = self.map[self.map_index]
if start <= self.position < stop:
break
else:
self.map_index += 1
if self.map_index == len(self.map):
self.map_index = 0
length = min(size, stop - self.position)
if data:
self.fileobj.seek(offset + (self.position - start))
buf += self.fileobj.read(length)
else:
buf += NUL * length
size -= length
self.position += length
return buf
#class _FileInFile
class ExFileObject(object):
"""File-like object for reading an archive member.
Is returned by TarFile.extractfile().
"""
blocksize = 1024
def __init__(self, tarfile, tarinfo):
self.fileobj = _FileInFile(tarfile.fileobj,
tarinfo.offset_data,
tarinfo.size,
tarinfo.sparse)
self.name = tarinfo.name
self.mode = "r"
self.closed = False
self.size = tarinfo.size
self.position = 0
self.buffer = b""
def readable(self):
return True
def writable(self):
return False
def seekable(self):
return self.fileobj.seekable()
def read(self, size=None):
"""Read at most size bytes from the file. If size is not
present or None, read all data until EOF is reached.
"""
if self.closed:
raise ValueError("I/O operation on closed file")
buf = b""
if self.buffer:
if size is None:
buf = self.buffer
self.buffer = b""
else:
buf = self.buffer[:size]
self.buffer = self.buffer[size:]
if size is None:
buf += self.fileobj.read()
else:
buf += self.fileobj.read(size - len(buf))
self.position += len(buf)
return buf
# XXX TextIOWrapper uses the read1() method.
read1 = read
def readline(self, size=-1):
"""Read one entire line from the file. If size is present
and non-negative, return a string with at most that
size, which may be an incomplete line.
"""
if self.closed:
raise ValueError("I/O operation on closed file")
pos = self.buffer.find(b"\n") + 1
if pos == 0:
# no newline found.
while True:
buf = self.fileobj.read(self.blocksize)
self.buffer += buf
if not buf or b"\n" in buf:
pos = self.buffer.find(b"\n") + 1
if pos == 0:
# no newline found.
pos = len(self.buffer)
break
if size != -1:
pos = min(size, pos)
buf = self.buffer[:pos]
self.buffer = self.buffer[pos:]
self.position += len(buf)
return buf
def readlines(self):
"""Return a list with all remaining lines.
"""
result = []
while True:
line = self.readline()
if not line: break
result.append(line)
return result
def tell(self):
"""Return the current file position.
"""
if self.closed:
raise ValueError("I/O operation on closed file")
return self.position
def seek(self, pos, whence=os.SEEK_SET):
"""Seek to a position in the file.
"""
if self.closed:
raise ValueError("I/O operation on closed file")
if whence == os.SEEK_SET:
self.position = min(max(pos, 0), self.size)
elif whence == os.SEEK_CUR:
if pos < 0:
self.position = max(self.position + pos, 0)
else:
self.position = min(self.position + pos, self.size)
elif whence == os.SEEK_END:
self.position = max(min(self.size + pos, self.size), 0)
else:
raise ValueError("Invalid argument")
self.buffer = b""
self.fileobj.seek(self.position)
def close(self):
"""Close the file object.
"""
self.closed = True
def __iter__(self):
"""Get an iterator over the file's lines.
"""
while True:
line = self.readline()
if not line:
break
yield line
#class ExFileObject
#------------------
# Exported Classes
#------------------
class TarInfo(object):
"""Informational class which holds the details about an
archive member given by a tar header block.
TarInfo objects are returned by TarFile.getmember(),
TarFile.getmembers() and TarFile.gettarinfo() and are
usually created internally.
"""
__slots__ = ("name", "mode", "uid", "gid", "size", "mtime",
"chksum", "type", "linkname", "uname", "gname",
"devmajor", "devminor",
"offset", "offset_data", "pax_headers", "sparse",
"tarfile", "_sparse_structs", "_link_target")
def __init__(self, name=""):
"""Construct a TarInfo object. name is the optional name
of the member.
"""
self.name = name # member name
self.mode = 0o644 # file permissions
self.uid = 0 # user id
self.gid = 0 # group id
self.size = 0 # file size
self.mtime = 0 # modification time
self.chksum = 0 # header checksum
self.type = REGTYPE # member type
self.linkname = "" # link name
self.uname = "" # user name
self.gname = "" # group name
self.devmajor = 0 # device major number
self.devminor = 0 # device minor number
self.offset = 0 # the tar header starts here
self.offset_data = 0 # the file's data starts here
self.sparse = None # sparse member information
self.pax_headers = {} # pax header information
# In pax headers the "name" and "linkname" field are called
# "path" and "linkpath".
def _getpath(self):
return self.name
def _setpath(self, name):
self.name = name
path = property(_getpath, _setpath)
def _getlinkpath(self):
return self.linkname
def _setlinkpath(self, linkname):
self.linkname = linkname
linkpath = property(_getlinkpath, _setlinkpath)
def __repr__(self):
return "<%s %r at %#x>" % (self.__class__.__name__,self.name,id(self))
def get_info(self):
"""Return the TarInfo's attributes as a dictionary.
"""
info = {
"name": self.name,
"mode": self.mode & 0o7777,
"uid": self.uid,
"gid": self.gid,
"size": self.size,
"mtime": self.mtime,
"chksum": self.chksum,
"type": self.type,
"linkname": self.linkname,
"uname": self.uname,
"gname": self.gname,
"devmajor": self.devmajor,
"devminor": self.devminor
}
if info["type"] == DIRTYPE and not info["name"].endswith("/"):
info["name"] += "/"
return info
def tobuf(self, format=DEFAULT_FORMAT, encoding=ENCODING, errors="surrogateescape"):
"""Return a tar header as a string of 512 byte blocks.
"""
info = self.get_info()
if format == USTAR_FORMAT:
return self.create_ustar_header(info, encoding, errors)
elif format == GNU_FORMAT:
return self.create_gnu_header(info, encoding, errors)
elif format == PAX_FORMAT:
return self.create_pax_header(info, encoding)
else:
raise ValueError("invalid format")
def create_ustar_header(self, info, encoding, errors):
"""Return the object as a ustar header block.
"""
info["magic"] = POSIX_MAGIC
if len(info["linkname"]) > LENGTH_LINK:
raise ValueError("linkname is too long")
if len(info["name"]) > LENGTH_NAME:
info["prefix"], info["name"] = self._posix_split_name(info["name"])
return self._create_header(info, USTAR_FORMAT, encoding, errors)
def create_gnu_header(self, info, encoding, errors):
"""Return the object as a GNU header block sequence.
"""
info["magic"] = GNU_MAGIC
buf = b""
if len(info["linkname"]) > LENGTH_LINK:
buf += self._create_gnu_long_header(info["linkname"], GNUTYPE_LONGLINK, encoding, errors)
if len(info["name"]) > LENGTH_NAME:
buf += self._create_gnu_long_header(info["name"], GNUTYPE_LONGNAME, encoding, errors)
return buf + self._create_header(info, GNU_FORMAT, encoding, errors)
def create_pax_header(self, info, encoding):
"""Return the object as a ustar header block. If it cannot be
represented this way, prepend a pax extended header sequence
with supplement information.
"""
info["magic"] = POSIX_MAGIC
pax_headers = self.pax_headers.copy()
# Test string fields for values that exceed the field length or cannot
# be represented in ASCII encoding.
for name, hname, length in (
("name", "path", LENGTH_NAME), ("linkname", "linkpath", LENGTH_LINK),
("uname", "uname", 32), ("gname", "gname", 32)):
if hname in pax_headers:
# The pax header has priority.
continue
# Try to encode the string as ASCII.
try:
info[name].encode("ascii", "strict")
except UnicodeEncodeError:
pax_headers[hname] = info[name]
continue
if len(info[name]) > length:
pax_headers[hname] = info[name]
# Test number fields for values that exceed the field limit or values
# that like to be stored as float.
for name, digits in (("uid", 8), ("gid", 8), ("size", 12), ("mtime", 12)):
if name in pax_headers:
# The pax header has priority. Avoid overflow.
info[name] = 0
continue
val = info[name]
if not 0 <= val < 8 ** (digits - 1) or isinstance(val, float):
pax_headers[name] = str(val)
info[name] = 0
# Create a pax extended header if necessary.
if pax_headers:
buf = self._create_pax_generic_header(pax_headers, XHDTYPE, encoding)
else:
buf = b""
return buf + self._create_header(info, USTAR_FORMAT, "ascii", "replace")
@classmethod
def create_pax_global_header(cls, pax_headers):
"""Return the object as a pax global header block sequence.
"""
return cls._create_pax_generic_header(pax_headers, XGLTYPE, "utf8")
def _posix_split_name(self, name):
"""Split a name longer than 100 chars into a prefix
and a name part.
"""
prefix = name[:LENGTH_PREFIX + 1]
while prefix and prefix[-1] != "/":
prefix = prefix[:-1]
name = name[len(prefix):]
prefix = prefix[:-1]
if not prefix or len(name) > LENGTH_NAME:
raise ValueError("name is too long")
return prefix, name
@staticmethod
def _create_header(info, format, encoding, errors):
"""Return a header block. info is a dictionary with file
information, format must be one of the *_FORMAT constants.
"""
parts = [
stn(info.get("name", ""), 100, encoding, errors),
itn(info.get("mode", 0) & 0o7777, 8, format),
itn(info.get("uid", 0), 8, format),
itn(info.get("gid", 0), 8, format),
itn(info.get("size", 0), 12, format),
itn(info.get("mtime", 0), 12, format),
b" ", # checksum field
info.get("type", REGTYPE),
stn(info.get("linkname", ""), 100, encoding, errors),
info.get("magic", POSIX_MAGIC),
stn(info.get("uname", ""), 32, encoding, errors),
stn(info.get("gname", ""), 32, encoding, errors),
itn(info.get("devmajor", 0), 8, format),
itn(info.get("devminor", 0), 8, format),
stn(info.get("prefix", ""), 155, encoding, errors)
]
buf = struct.pack("%ds" % BLOCKSIZE, b"".join(parts))
chksum = calc_chksums(buf[-BLOCKSIZE:])[0]
buf = buf[:-364] + ("%06o\0" % chksum).encode("ascii") + buf[-357:]
return buf
@staticmethod
def _create_payload(payload):
"""Return the string payload filled with zero bytes
up to the next 512 byte border.
"""
blocks, remainder = divmod(len(payload), BLOCKSIZE)
if remainder > 0:
payload += (BLOCKSIZE - remainder) * NUL
return payload
@classmethod
def _create_gnu_long_header(cls, name, type, encoding, errors):
"""Return a GNUTYPE_LONGNAME or GNUTYPE_LONGLINK sequence
for name.
"""
name = name.encode(encoding, errors) + NUL
info = {}
info["name"] = "././@LongLink"
info["type"] = type
info["size"] = len(name)
info["magic"] = GNU_MAGIC
# create extended header + name blocks.
return cls._create_header(info, USTAR_FORMAT, encoding, errors) + \
cls._create_payload(name)
@classmethod
def _create_pax_generic_header(cls, pax_headers, type, encoding):
"""Return a POSIX.1-2008 extended or global header sequence
that contains a list of keyword, value pairs. The values
must be strings.
"""
# Check if one of the fields contains surrogate characters and thereby
# forces hdrcharset=BINARY, see _proc_pax() for more information.
binary = False
for keyword, value in pax_headers.items():
try:
value.encode("utf8", "strict")
except UnicodeEncodeError:
binary = True
break
records = b""
if binary:
# Put the hdrcharset field at the beginning of the header.
records += b"21 hdrcharset=BINARY\n"
for keyword, value in pax_headers.items():
keyword = keyword.encode("utf8")
if binary:
# Try to restore the original byte representation of `value'.
# Needless to say, that the encoding must match the string.
value = value.encode(encoding, "surrogateescape")
else:
value = value.encode("utf8")
l = len(keyword) + len(value) + 3 # ' ' + '=' + '\n'
n = p = 0
while True:
n = l + len(str(p))
if n == p:
break
p = n
records += bytes(str(p), "ascii") + b" " + keyword + b"=" + value + b"\n"
# We use a hardcoded "././@PaxHeader" name like star does
# instead of the one that POSIX recommends.
info = {}
info["name"] = "././@PaxHeader"
info["type"] = type
info["size"] = len(records)
info["magic"] = POSIX_MAGIC
# Create pax header + record blocks.
return cls._create_header(info, USTAR_FORMAT, "ascii", "replace") + \
cls._create_payload(records)
@classmethod
def frombuf(cls, buf, encoding, errors):
"""Construct a TarInfo object from a 512 byte bytes object.
"""
if len(buf) == 0:
raise EmptyHeaderError("empty header")
if len(buf) != BLOCKSIZE:
raise TruncatedHeaderError("truncated header")
if buf.count(NUL) == BLOCKSIZE:
raise EOFHeaderError("end of file header")
chksum = nti(buf[148:156])
if chksum not in calc_chksums(buf):
raise InvalidHeaderError("bad checksum")
obj = cls()
obj.name = nts(buf[0:100], encoding, errors)
obj.mode = nti(buf[100:108])
obj.uid = nti(buf[108:116])
obj.gid = nti(buf[116:124])
obj.size = nti(buf[124:136])
obj.mtime = nti(buf[136:148])
obj.chksum = chksum
obj.type = buf[156:157]
obj.linkname = nts(buf[157:257], encoding, errors)
obj.uname = nts(buf[265:297], encoding, errors)
obj.gname = nts(buf[297:329], encoding, errors)
obj.devmajor = nti(buf[329:337])
obj.devminor = nti(buf[337:345])
prefix = nts(buf[345:500], encoding, errors)
# Old V7 tar format represents a directory as a regular
# file with a trailing slash.
if obj.type == AREGTYPE and obj.name.endswith("/"):
obj.type = DIRTYPE
# The old GNU sparse format occupies some of the unused
# space in the buffer for up to 4 sparse structures.
# Save the them for later processing in _proc_sparse().
if obj.type == GNUTYPE_SPARSE:
pos = 386
structs = []
for i in range(4):
try:
offset = nti(buf[pos:pos + 12])
numbytes = nti(buf[pos + 12:pos + 24])
except ValueError:
break
structs.append((offset, numbytes))
pos += 24
isextended = bool(buf[482])
origsize = nti(buf[483:495])
obj._sparse_structs = (structs, isextended, origsize)
# Remove redundant slashes from directories.
if obj.isdir():
obj.name = obj.name.rstrip("/")
# Reconstruct a ustar longname.
if prefix and obj.type not in GNU_TYPES:
obj.name = prefix + "/" + obj.name
return obj
@classmethod
def fromtarfile(cls, tarfile):
"""Return the next TarInfo object from TarFile object
tarfile.
"""
buf = tarfile.fileobj.read(BLOCKSIZE)
obj = cls.frombuf(buf, tarfile.encoding, tarfile.errors)
obj.offset = tarfile.fileobj.tell() - BLOCKSIZE
return obj._proc_member(tarfile)
#--------------------------------------------------------------------------
# The following are methods that are called depending on the type of a
# member. The entry point is _proc_member() which can be overridden in a
# subclass to add custom _proc_*() methods. A _proc_*() method MUST
# implement the following
# operations:
# 1. Set self.offset_data to the position where the data blocks begin,
# if there is data that follows.
# 2. Set tarfile.offset to the position where the next member's header will
# begin.
# 3. Return self or another valid TarInfo object.
def _proc_member(self, tarfile):
"""Choose the right processing method depending on
the type and call it.
"""
if self.type in (GNUTYPE_LONGNAME, GNUTYPE_LONGLINK):
return self._proc_gnulong(tarfile)
elif self.type == GNUTYPE_SPARSE:
return self._proc_sparse(tarfile)
elif self.type in (XHDTYPE, XGLTYPE, SOLARIS_XHDTYPE):
return self._proc_pax(tarfile)
else:
return self._proc_builtin(tarfile)
def _proc_builtin(self, tarfile):
"""Process a builtin type or an unknown type which
will be treated as a regular file.
"""
self.offset_data = tarfile.fileobj.tell()
offset = self.offset_data
if self.isreg() or self.type not in SUPPORTED_TYPES:
# Skip the following data blocks.
offset += self._block(self.size)
tarfile.offset = offset
# Patch the TarInfo object with saved global
# header information.
self._apply_pax_info(tarfile.pax_headers, tarfile.encoding, tarfile.errors)
return self
def _proc_gnulong(self, tarfile):
"""Process the blocks that hold a GNU longname
or longlink member.
"""
buf = tarfile.fileobj.read(self._block(self.size))
# Fetch the next header and process it.
try:
next = self.fromtarfile(tarfile)
except HeaderError:
raise SubsequentHeaderError("missing or bad subsequent header")
# Patch the TarInfo object from the next header with
# the longname information.
next.offset = self.offset
if self.type == GNUTYPE_LONGNAME:
next.name = nts(buf, tarfile.encoding, tarfile.errors)
elif self.type == GNUTYPE_LONGLINK:
next.linkname = nts(buf, tarfile.encoding, tarfile.errors)
return next
def _proc_sparse(self, tarfile):
"""Process a GNU sparse header plus extra headers.
"""
# We already collected some sparse structures in frombuf().
structs, isextended, origsize = self._sparse_structs
del self._sparse_structs
# Collect sparse structures from extended header blocks.
while isextended:
buf = tarfile.fileobj.read(BLOCKSIZE)
pos = 0
for i in range(21):
try:
offset = nti(buf[pos:pos + 12])
numbytes = nti(buf[pos + 12:pos + 24])
except ValueError:
break
if offset and numbytes:
structs.append((offset, numbytes))
pos += 24
isextended = bool(buf[504])
self.sparse = structs
self.offset_data = tarfile.fileobj.tell()
tarfile.offset = self.offset_data + self._block(self.size)
self.size = origsize
return self
def _proc_pax(self, tarfile):
"""Process an extended or global header as described in
POSIX.1-2008.
"""
# Read the header information.
buf = tarfile.fileobj.read(self._block(self.size))
# A pax header stores supplemental information for either
# the following file (extended) or all following files
# (global).
if self.type == XGLTYPE:
pax_headers = tarfile.pax_headers
else:
pax_headers = tarfile.pax_headers.copy()
# Check if the pax header contains a hdrcharset field. This tells us
# the encoding of the path, linkpath, uname and gname fields. Normally,
# these fields are UTF-8 encoded but since POSIX.1-2008 tar
# implementations are allowed to store them as raw binary strings if
# the translation to UTF-8 fails.
match = re.search(br"\d+ hdrcharset=([^\n]+)\n", buf)
if match is not None:
pax_headers["hdrcharset"] = match.group(1).decode("utf8")
# For the time being, we don't care about anything other than "BINARY".
# The only other value that is currently allowed by the standard is
# "ISO-IR 10646 2000 UTF-8" in other words UTF-8.
hdrcharset = pax_headers.get("hdrcharset")
if hdrcharset == "BINARY":
encoding = tarfile.encoding
else:
encoding = "utf8"
# Parse pax header information. A record looks like that:
# "%d %s=%s\n" % (length, keyword, value). length is the size
# of the complete record including the length field itself and
# the newline. keyword and value are both UTF-8 encoded strings.
regex = re.compile(br"(\d+) ([^=]+)=")
pos = 0
while True:
match = regex.match(buf, pos)
if not match:
break
length, keyword = match.groups()
length = int(length)
value = buf[match.end(2) + 1:match.start(1) + length - 1]
# Normally, we could just use "utf8" as the encoding and "strict"
# as the error handler, but we better not take the risk. For
# example, GNU tar <= 1.23 is known to store filenames it cannot
# translate to UTF-8 as raw strings (unfortunately without a
# hdrcharset=BINARY header).
# We first try the strict standard encoding, and if that fails we
# fall back on the user's encoding and error handler.
keyword = self._decode_pax_field(keyword, "utf8", "utf8",
tarfile.errors)
if keyword in PAX_NAME_FIELDS:
value = self._decode_pax_field(value, encoding, tarfile.encoding,
tarfile.errors)
else:
value = self._decode_pax_field(value, "utf8", "utf8",
tarfile.errors)
pax_headers[keyword] = value
pos += length
# Fetch the next header.
try:
next = self.fromtarfile(tarfile)
except HeaderError:
raise SubsequentHeaderError("missing or bad subsequent header")
# Process GNU sparse information.
if "GNU.sparse.map" in pax_headers:
# GNU extended sparse format version 0.1.
self._proc_gnusparse_01(next, pax_headers)
elif "GNU.sparse.size" in pax_headers:
# GNU extended sparse format version 0.0.
self._proc_gnusparse_00(next, pax_headers, buf)
elif pax_headers.get("GNU.sparse.major") == "1" and pax_headers.get("GNU.sparse.minor") == "0":
# GNU extended sparse format version 1.0.
self._proc_gnusparse_10(next, pax_headers, tarfile)
if self.type in (XHDTYPE, SOLARIS_XHDTYPE):
# Patch the TarInfo object with the extended header info.
next._apply_pax_info(pax_headers, tarfile.encoding, tarfile.errors)
next.offset = self.offset
if "size" in pax_headers:
# If the extended header replaces the size field,
# we need to recalculate the offset where the next
# header starts.
offset = next.offset_data
if next.isreg() or next.type not in SUPPORTED_TYPES:
offset += next._block(next.size)
tarfile.offset = offset
return next
def _proc_gnusparse_00(self, next, pax_headers, buf):
"""Process a GNU tar extended sparse header, version 0.0.
"""
offsets = []
for match in re.finditer(br"\d+ GNU.sparse.offset=(\d+)\n", buf):
offsets.append(int(match.group(1)))
numbytes = []
for match in re.finditer(br"\d+ GNU.sparse.numbytes=(\d+)\n", buf):
numbytes.append(int(match.group(1)))
next.sparse = list(zip(offsets, numbytes))
def _proc_gnusparse_01(self, next, pax_headers):
"""Process a GNU tar extended sparse header, version 0.1.
"""
sparse = [int(x) for x in pax_headers["GNU.sparse.map"].split(",")]
next.sparse = list(zip(sparse[::2], sparse[1::2]))
def _proc_gnusparse_10(self, next, pax_headers, tarfile):
"""Process a GNU tar extended sparse header, version 1.0.
"""
fields = None
sparse = []
buf = tarfile.fileobj.read(BLOCKSIZE)
fields, buf = buf.split(b"\n", 1)
fields = int(fields)
while len(sparse) < fields * 2:
if b"\n" not in buf:
buf += tarfile.fileobj.read(BLOCKSIZE)
number, buf = buf.split(b"\n", 1)
sparse.append(int(number))
next.offset_data = tarfile.fileobj.tell()
next.sparse = list(zip(sparse[::2], sparse[1::2]))
def _apply_pax_info(self, pax_headers, encoding, errors):
"""Replace fields with supplemental information from a previous
pax extended or global header.
"""
for keyword, value in pax_headers.items():
if keyword == "GNU.sparse.name":
setattr(self, "path", value)
elif keyword == "GNU.sparse.size":
setattr(self, "size", int(value))
elif keyword == "GNU.sparse.realsize":
setattr(self, "size", int(value))
elif keyword in PAX_FIELDS:
if keyword in PAX_NUMBER_FIELDS:
try:
value = PAX_NUMBER_FIELDS[keyword](value)
except ValueError:
value = 0
if keyword == "path":
value = value.rstrip("/")
setattr(self, keyword, value)
self.pax_headers = pax_headers.copy()
def _decode_pax_field(self, value, encoding, fallback_encoding, fallback_errors):
"""Decode a single field from a pax record.
"""
try:
return value.decode(encoding, "strict")
except UnicodeDecodeError:
return value.decode(fallback_encoding, fallback_errors)
def _block(self, count):
"""Round up a byte count by BLOCKSIZE and return it,
e.g. _block(834) => 1024.
"""
blocks, remainder = divmod(count, BLOCKSIZE)
if remainder:
blocks += 1
return blocks * BLOCKSIZE
def isreg(self):
return self.type in REGULAR_TYPES
def isfile(self):
return self.isreg()
def isdir(self):
return self.type == DIRTYPE
def issym(self):
return self.type == SYMTYPE
def islnk(self):
return self.type == LNKTYPE
def ischr(self):
return self.type == CHRTYPE
def isblk(self):
return self.type == BLKTYPE
def isfifo(self):
return self.type == FIFOTYPE
def issparse(self):
return self.sparse is not None
def isdev(self):
return self.type in (CHRTYPE, BLKTYPE, FIFOTYPE)
# class TarInfo
class TarFile(object):
"""The TarFile Class provides an interface to tar archives.
"""
debug = 0 # May be set from 0 (no msgs) to 3 (all msgs)
dereference = False # If true, add content of linked file to the
# tar file, else the link.
ignore_zeros = False # If true, skips empty or invalid blocks and
# continues processing.
errorlevel = 1 # If 0, fatal errors only appear in debug
# messages (if debug >= 0). If > 0, errors
# are passed to the caller as exceptions.
format = DEFAULT_FORMAT # The format to use when creating an archive.
encoding = ENCODING # Encoding for 8-bit character strings.
errors = None # Error handler for unicode conversion.
tarinfo = TarInfo # The default TarInfo class to use.
fileobject = ExFileObject # The default ExFileObject class to use.
def __init__(self, name=None, mode="r", fileobj=None, format=None,
tarinfo=None, dereference=None, ignore_zeros=None, encoding=None,
errors="surrogateescape", pax_headers=None, debug=None, errorlevel=None):
"""Open an (uncompressed) tar archive `name'. `mode' is either 'r' to
read from an existing archive, 'a' to append data to an existing
file or 'w' to create a new file overwriting an existing one. `mode'
defaults to 'r'.
If `fileobj' is given, it is used for reading or writing data. If it
can be determined, `mode' is overridden by `fileobj's mode.
`fileobj' is not closed, when TarFile is closed.
"""
if len(mode) > 1 or mode not in "raw":
raise ValueError("mode must be 'r', 'a' or 'w'")
self.mode = mode
self._mode = {"r": "rb", "a": "r+b", "w": "wb"}[mode]
if not fileobj:
if self.mode == "a" and not os.path.exists(name):
# Create nonexistent files in append mode.
self.mode = "w"
self._mode = "wb"
fileobj = bltn_open(name, self._mode)
self._extfileobj = False
else:
if name is None and hasattr(fileobj, "name"):
name = fileobj.name
if hasattr(fileobj, "mode"):
self._mode = fileobj.mode
self._extfileobj = True
self.name = os.path.abspath(name) if name else None
self.fileobj = fileobj
# Init attributes.
if format is not None:
self.format = format
if tarinfo is not None:
self.tarinfo = tarinfo
if dereference is not None:
self.dereference = dereference
if ignore_zeros is not None:
self.ignore_zeros = ignore_zeros
if encoding is not None:
self.encoding = encoding
self.errors = errors
if pax_headers is not None and self.format == PAX_FORMAT:
self.pax_headers = pax_headers
else:
self.pax_headers = {}
if debug is not None:
self.debug = debug
if errorlevel is not None:
self.errorlevel = errorlevel
# Init datastructures.
self.closed = False
self.members = [] # list of members as TarInfo objects
self._loaded = False # flag if all members have been read
self.offset = self.fileobj.tell()
# current position in the archive file
self.inodes = {} # dictionary caching the inodes of
# archive members already added
try:
if self.mode == "r":
self.firstmember = None
self.firstmember = self.next()
if self.mode == "a":
# Move to the end of the archive,
# before the first empty block.
while True:
self.fileobj.seek(self.offset)
try:
tarinfo = self.tarinfo.fromtarfile(self)
self.members.append(tarinfo)
except EOFHeaderError:
self.fileobj.seek(self.offset)
break
except HeaderError as e:
raise ReadError(str(e))
if self.mode in "aw":
self._loaded = True
if self.pax_headers:
buf = self.tarinfo.create_pax_global_header(self.pax_headers.copy())
self.fileobj.write(buf)
self.offset += len(buf)
except:
if not self._extfileobj:
self.fileobj.close()
self.closed = True
raise
#--------------------------------------------------------------------------
# Below are the classmethods which act as alternate constructors to the
# TarFile class. The open() method is the only one that is needed for
# public use; it is the "super"-constructor and is able to select an
# adequate "sub"-constructor for a particular compression using the mapping
# from OPEN_METH.
#
# This concept allows one to subclass TarFile without losing the comfort of
# the super-constructor. A sub-constructor is registered and made available
# by adding it to the mapping in OPEN_METH.
@classmethod
def open(cls, name=None, mode="r", fileobj=None, bufsize=RECORDSIZE, **kwargs):
"""Open a tar archive for reading, writing or appending. Return
an appropriate TarFile class.
mode:
'r' or 'r:*' open for reading with transparent compression
'r:' open for reading exclusively uncompressed
'r:gz' open for reading with gzip compression
'r:bz2' open for reading with bzip2 compression
'a' or 'a:' open for appending, creating the file if necessary
'w' or 'w:' open for writing without compression
'w:gz' open for writing with gzip compression
'w:bz2' open for writing with bzip2 compression
'r|*' open a stream of tar blocks with transparent compression
'r|' open an uncompressed stream of tar blocks for reading
'r|gz' open a gzip compressed stream of tar blocks
'r|bz2' open a bzip2 compressed stream of tar blocks
'w|' open an uncompressed stream for writing
'w|gz' open a gzip compressed stream for writing
'w|bz2' open a bzip2 compressed stream for writing
"""
if not name and not fileobj:
raise ValueError("nothing to open")
if mode in ("r", "r:*"):
# Find out which *open() is appropriate for opening the file.
for comptype in cls.OPEN_METH:
func = getattr(cls, cls.OPEN_METH[comptype])
if fileobj is not None:
saved_pos = fileobj.tell()
try:
return func(name, "r", fileobj, **kwargs)
except (ReadError, CompressionError) as e:
if fileobj is not None:
fileobj.seek(saved_pos)
continue
raise ReadError("file could not be opened successfully")
elif ":" in mode:
filemode, comptype = mode.split(":", 1)
filemode = filemode or "r"
comptype = comptype or "tar"
# Select the *open() function according to
# given compression.
if comptype in cls.OPEN_METH:
func = getattr(cls, cls.OPEN_METH[comptype])
else:
raise CompressionError("unknown compression type %r" % comptype)
return func(name, filemode, fileobj, **kwargs)
elif "|" in mode:
filemode, comptype = mode.split("|", 1)
filemode = filemode or "r"
comptype = comptype or "tar"
if filemode not in "rw":
raise ValueError("mode must be 'r' or 'w'")
stream = _Stream(name, filemode, comptype, fileobj, bufsize)
try:
t = cls(name, filemode, stream, **kwargs)
except:
stream.close()
raise
t._extfileobj = False
return t
elif mode in "aw":
return cls.taropen(name, mode, fileobj, **kwargs)
raise ValueError("undiscernible mode")
@classmethod
def taropen(cls, name, mode="r", fileobj=None, **kwargs):
"""Open uncompressed tar archive name for reading or writing.
"""
if len(mode) > 1 or mode not in "raw":
raise ValueError("mode must be 'r', 'a' or 'w'")
return cls(name, mode, fileobj, **kwargs)
@classmethod
def gzopen(cls, name, mode="r", fileobj=None, compresslevel=9, **kwargs):
"""Open gzip compressed tar archive name for reading or writing.
Appending is not allowed.
"""
if len(mode) > 1 or mode not in "rw":
raise ValueError("mode must be 'r' or 'w'")
try:
import gzip
gzip.GzipFile
except (ImportError, AttributeError):
raise CompressionError("gzip module is not available")
extfileobj = fileobj is not None
try:
fileobj = gzip.GzipFile(name, mode + "b", compresslevel, fileobj)
t = cls.taropen(name, mode, fileobj, **kwargs)
except IOError:
if not extfileobj and fileobj is not None:
fileobj.close()
if fileobj is None:
raise
raise ReadError("not a gzip file")
except:
if not extfileobj and fileobj is not None:
fileobj.close()
raise
t._extfileobj = extfileobj
return t
@classmethod
def bz2open(cls, name, mode="r", fileobj=None, compresslevel=9, **kwargs):
"""Open bzip2 compressed tar archive name for reading or writing.
Appending is not allowed.
"""
if len(mode) > 1 or mode not in "rw":
raise ValueError("mode must be 'r' or 'w'.")
try:
import bz2
except ImportError:
raise CompressionError("bz2 module is not available")
if fileobj is not None:
fileobj = _BZ2Proxy(fileobj, mode)
else:
fileobj = bz2.BZ2File(name, mode, compresslevel=compresslevel)
try:
t = cls.taropen(name, mode, fileobj, **kwargs)
except (IOError, EOFError):
fileobj.close()
raise ReadError("not a bzip2 file")
t._extfileobj = False
return t
# All *open() methods are registered here.
OPEN_METH = {
"tar": "taropen", # uncompressed tar
"gz": "gzopen", # gzip compressed tar
"bz2": "bz2open" # bzip2 compressed tar
}
#--------------------------------------------------------------------------
# The public methods which TarFile provides:
def close(self):
"""Close the TarFile. In write-mode, two finishing zero blocks are
appended to the archive.
"""
if self.closed:
return
if self.mode in "aw":
self.fileobj.write(NUL * (BLOCKSIZE * 2))
self.offset += (BLOCKSIZE * 2)
# fill up the end with zero-blocks
# (like option -b20 for tar does)
blocks, remainder = divmod(self.offset, RECORDSIZE)
if remainder > 0:
self.fileobj.write(NUL * (RECORDSIZE - remainder))
if not self._extfileobj:
self.fileobj.close()
self.closed = True
def getmember(self, name):
"""Return a TarInfo object for member `name'. If `name' can not be
found in the archive, KeyError is raised. If a member occurs more
than once in the archive, its last occurrence is assumed to be the
most up-to-date version.
"""
tarinfo = self._getmember(name)
if tarinfo is None:
raise KeyError("filename %r not found" % name)
return tarinfo
def getmembers(self):
"""Return the members of the archive as a list of TarInfo objects. The
list has the same order as the members in the archive.
"""
self._check()
if not self._loaded: # if we want to obtain a list of
self._load() # all members, we first have to
# scan the whole archive.
return self.members
def getnames(self):
"""Return the members of the archive as a list of their names. It has
the same order as the list returned by getmembers().
"""
return [tarinfo.name for tarinfo in self.getmembers()]
def gettarinfo(self, name=None, arcname=None, fileobj=None):
"""Create a TarInfo object for either the file `name' or the file
object `fileobj' (using os.fstat on its file descriptor). You can
modify some of the TarInfo's attributes before you add it using
addfile(). If given, `arcname' specifies an alternative name for the
file in the archive.
"""
self._check("aw")
# When fileobj is given, replace name by
# fileobj's real name.
if fileobj is not None:
name = fileobj.name
# Building the name of the member in the archive.
# Backward slashes are converted to forward slashes,
# Absolute paths are turned to relative paths.
if arcname is None:
arcname = name
drv, arcname = os.path.splitdrive(arcname)
arcname = arcname.replace(os.sep, "/")
arcname = arcname.lstrip("/")
# Now, fill the TarInfo object with
# information specific for the file.
tarinfo = self.tarinfo()
tarinfo.tarfile = self
# Use os.stat or os.lstat, depending on platform
# and if symlinks shall be resolved.
if fileobj is None:
if hasattr(os, "lstat") and not self.dereference:
statres = os.lstat(name)
else:
statres = os.stat(name)
else:
statres = os.fstat(fileobj.fileno())
linkname = ""
stmd = statres.st_mode
if stat.S_ISREG(stmd):
inode = (statres.st_ino, statres.st_dev)
if not self.dereference and statres.st_nlink > 1 and \
inode in self.inodes and arcname != self.inodes[inode]:
# Is it a hardlink to an already
# archived file?
type = LNKTYPE
linkname = self.inodes[inode]
else:
# The inode is added only if its valid.
# For win32 it is always 0.
type = REGTYPE
if inode[0]:
self.inodes[inode] = arcname
elif stat.S_ISDIR(stmd):
type = DIRTYPE
elif stat.S_ISFIFO(stmd):
type = FIFOTYPE
elif stat.S_ISLNK(stmd):
type = SYMTYPE
linkname = os.readlink(name)
elif stat.S_ISCHR(stmd):
type = CHRTYPE
elif stat.S_ISBLK(stmd):
type = BLKTYPE
else:
return None
# Fill the TarInfo object with all
# information we can get.
tarinfo.name = arcname
tarinfo.mode = stmd
tarinfo.uid = statres.st_uid
tarinfo.gid = statres.st_gid
if type == REGTYPE:
tarinfo.size = statres.st_size
else:
tarinfo.size = 0
tarinfo.mtime = statres.st_mtime
tarinfo.type = type
tarinfo.linkname = linkname
if pwd:
try:
tarinfo.uname = pwd.getpwuid(tarinfo.uid)[0]
except KeyError:
pass
if grp:
try:
tarinfo.gname = grp.getgrgid(tarinfo.gid)[0]
except KeyError:
pass
if type in (CHRTYPE, BLKTYPE):
if hasattr(os, "major") and hasattr(os, "minor"):
tarinfo.devmajor = os.major(statres.st_rdev)
tarinfo.devminor = os.minor(statres.st_rdev)
return tarinfo
def list(self, verbose=True):
"""Print a table of contents to sys.stdout. If `verbose' is False, only
the names of the members are printed. If it is True, an `ls -l'-like
output is produced.
"""
self._check()
for tarinfo in self:
if verbose:
print(filemode(tarinfo.mode), end=' ')
print("%s/%s" % (tarinfo.uname or tarinfo.uid,
tarinfo.gname or tarinfo.gid), end=' ')
if tarinfo.ischr() or tarinfo.isblk():
print("%10s" % ("%d,%d" \
% (tarinfo.devmajor, tarinfo.devminor)), end=' ')
else:
print("%10d" % tarinfo.size, end=' ')
print("%d-%02d-%02d %02d:%02d:%02d" \
% time.localtime(tarinfo.mtime)[:6], end=' ')
print(tarinfo.name + ("/" if tarinfo.isdir() else ""), end=' ')
if verbose:
if tarinfo.issym():
print("->", tarinfo.linkname, end=' ')
if tarinfo.islnk():
print("link to", tarinfo.linkname, end=' ')
print()
def add(self, name, arcname=None, recursive=True, exclude=None, filter=None):
"""Add the file `name' to the archive. `name' may be any type of file
(directory, fifo, symbolic link, etc.). If given, `arcname'
specifies an alternative name for the file in the archive.
Directories are added recursively by default. This can be avoided by
setting `recursive' to False. `exclude' is a function that should
return True for each filename to be excluded. `filter' is a function
that expects a TarInfo object argument and returns the changed
TarInfo object, if it returns None the TarInfo object will be
excluded from the archive.
"""
self._check("aw")
if arcname is None:
arcname = name
# Exclude pathnames.
if exclude is not None:
import warnings
warnings.warn("use the filter argument instead",
DeprecationWarning, 2)
if exclude(name):
self._dbg(2, "tarfile: Excluded %r" % name)
return
# Skip if somebody tries to archive the archive...
if self.name is not None and os.path.abspath(name) == self.name:
self._dbg(2, "tarfile: Skipped %r" % name)
return
self._dbg(1, name)
# Create a TarInfo object from the file.
tarinfo = self.gettarinfo(name, arcname)
if tarinfo is None:
self._dbg(1, "tarfile: Unsupported type %r" % name)
return
# Change or exclude the TarInfo object.
if filter is not None:
tarinfo = filter(tarinfo)
if tarinfo is None:
self._dbg(2, "tarfile: Excluded %r" % name)
return
# Append the tar header and data to the archive.
if tarinfo.isreg():
f = bltn_open(name, "rb")
self.addfile(tarinfo, f)
f.close()
elif tarinfo.isdir():
self.addfile(tarinfo)
if recursive:
for f in os.listdir(name):
self.add(os.path.join(name, f), os.path.join(arcname, f),
recursive, exclude, filter=filter)
else:
self.addfile(tarinfo)
def addfile(self, tarinfo, fileobj=None):
"""Add the TarInfo object `tarinfo' to the archive. If `fileobj' is
given, tarinfo.size bytes are read from it and added to the archive.
You can create TarInfo objects using gettarinfo().
On Windows platforms, `fileobj' should always be opened with mode
'rb' to avoid irritation about the file size.
"""
self._check("aw")
tarinfo = copy.copy(tarinfo)
buf = tarinfo.tobuf(self.format, self.encoding, self.errors)
self.fileobj.write(buf)
self.offset += len(buf)
# If there's data to follow, append it.
if fileobj is not None:
copyfileobj(fileobj, self.fileobj, tarinfo.size)
blocks, remainder = divmod(tarinfo.size, BLOCKSIZE)
if remainder > 0:
self.fileobj.write(NUL * (BLOCKSIZE - remainder))
blocks += 1
self.offset += blocks * BLOCKSIZE
self.members.append(tarinfo)
def extractall(self, path=".", members=None):
"""Extract all members from the archive to the current working
directory and set owner, modification time and permissions on
directories afterwards. `path' specifies a different directory
to extract to. `members' is optional and must be a subset of the
list returned by getmembers().
"""
directories = []
if members is None:
members = self
for tarinfo in members:
if tarinfo.isdir():
# Extract directories with a safe mode.
directories.append(tarinfo)
tarinfo = copy.copy(tarinfo)
tarinfo.mode = 0o700
# Do not set_attrs directories, as we will do that further down
self.extract(tarinfo, path, set_attrs=not tarinfo.isdir())
# Reverse sort directories.
directories.sort(key=lambda a: a.name)
directories.reverse()
# Set correct owner, mtime and filemode on directories.
for tarinfo in directories:
dirpath = os.path.join(path, tarinfo.name)
try:
self.chown(tarinfo, dirpath)
self.utime(tarinfo, dirpath)
self.chmod(tarinfo, dirpath)
except ExtractError as e:
if self.errorlevel > 1:
raise
else:
self._dbg(1, "tarfile: %s" % e)
def extract(self, member, path="", set_attrs=True):
"""Extract a member from the archive to the current working directory,
using its full name. Its file information is extracted as accurately
as possible. `member' may be a filename or a TarInfo object. You can
specify a different directory using `path'. File attributes (owner,
mtime, mode) are set unless `set_attrs' is False.
"""
self._check("r")
if isinstance(member, str):
tarinfo = self.getmember(member)
else:
tarinfo = member
# Prepare the link target for makelink().
if tarinfo.islnk():
tarinfo._link_target = os.path.join(path, tarinfo.linkname)
try:
self._extract_member(tarinfo, os.path.join(path, tarinfo.name),
set_attrs=set_attrs)
except EnvironmentError as e:
if self.errorlevel > 0:
raise
else:
if e.filename is None:
self._dbg(1, "tarfile: %s" % e.strerror)
else:
self._dbg(1, "tarfile: %s %r" % (e.strerror, e.filename))
except ExtractError as e:
if self.errorlevel > 1:
raise
else:
self._dbg(1, "tarfile: %s" % e)
def extractfile(self, member):
"""Extract a member from the archive as a file object. `member' may be
a filename or a TarInfo object. If `member' is a regular file, a
file-like object is returned. If `member' is a link, a file-like
object is constructed from the link's target. If `member' is none of
the above, None is returned.
The file-like object is read-only and provides the following
methods: read(), readline(), readlines(), seek() and tell()
"""
self._check("r")
if isinstance(member, str):
tarinfo = self.getmember(member)
else:
tarinfo = member
if tarinfo.isreg():
return self.fileobject(self, tarinfo)
elif tarinfo.type not in SUPPORTED_TYPES:
# If a member's type is unknown, it is treated as a
# regular file.
return self.fileobject(self, tarinfo)
elif tarinfo.islnk() or tarinfo.issym():
if isinstance(self.fileobj, _Stream):
# A small but ugly workaround for the case that someone tries
# to extract a (sym)link as a file-object from a non-seekable
# stream of tar blocks.
raise StreamError("cannot extract (sym)link as file object")
else:
# A (sym)link's file object is its target's file object.
return self.extractfile(self._find_link_target(tarinfo))
else:
# If there's no data associated with the member (directory, chrdev,
# blkdev, etc.), return None instead of a file object.
return None
def _extract_member(self, tarinfo, targetpath, set_attrs=True):
"""Extract the TarInfo object tarinfo to a physical
file called targetpath.
"""
# Fetch the TarInfo object for the given name
# and build the destination pathname, replacing
# forward slashes to platform specific separators.
targetpath = targetpath.rstrip("/")
targetpath = targetpath.replace("/", os.sep)
# Create all upper directories.
upperdirs = os.path.dirname(targetpath)
if upperdirs and not os.path.exists(upperdirs):
# Create directories that are not part of the archive with
# default permissions.
os.makedirs(upperdirs)
if tarinfo.islnk() or tarinfo.issym():
self._dbg(1, "%s -> %s" % (tarinfo.name, tarinfo.linkname))
else:
self._dbg(1, tarinfo.name)
if tarinfo.isreg():
self.makefile(tarinfo, targetpath)
elif tarinfo.isdir():
self.makedir(tarinfo, targetpath)
elif tarinfo.isfifo():
self.makefifo(tarinfo, targetpath)
elif tarinfo.ischr() or tarinfo.isblk():
self.makedev(tarinfo, targetpath)
elif tarinfo.islnk() or tarinfo.issym():
self.makelink(tarinfo, targetpath)
elif tarinfo.type not in SUPPORTED_TYPES:
self.makeunknown(tarinfo, targetpath)
else:
self.makefile(tarinfo, targetpath)
if set_attrs:
self.chown(tarinfo, targetpath)
if not tarinfo.issym():
self.chmod(tarinfo, targetpath)
self.utime(tarinfo, targetpath)
#--------------------------------------------------------------------------
# Below are the different file methods. They are called via
# _extract_member() when extract() is called. They can be replaced in a
# subclass to implement other functionality.
def makedir(self, tarinfo, targetpath):
"""Make a directory called targetpath.
"""
try:
# Use a safe mode for the directory, the real mode is set
# later in _extract_member().
os.mkdir(targetpath, 0o700)
except EnvironmentError as e:
if e.errno != errno.EEXIST:
raise
def makefile(self, tarinfo, targetpath):
"""Make a file called targetpath.
"""
source = self.fileobj
source.seek(tarinfo.offset_data)
target = bltn_open(targetpath, "wb")
if tarinfo.sparse is not None:
for offset, size in tarinfo.sparse:
target.seek(offset)
copyfileobj(source, target, size)
else:
copyfileobj(source, target, tarinfo.size)
target.seek(tarinfo.size)
target.truncate()
target.close()
def makeunknown(self, tarinfo, targetpath):
"""Make a file from a TarInfo object with an unknown type
at targetpath.
"""
self.makefile(tarinfo, targetpath)
self._dbg(1, "tarfile: Unknown file type %r, " \
"extracted as regular file." % tarinfo.type)
def makefifo(self, tarinfo, targetpath):
"""Make a fifo called targetpath.
"""
if hasattr(os, "mkfifo"):
os.mkfifo(targetpath)
else:
raise ExtractError("fifo not supported by system")
def makedev(self, tarinfo, targetpath):
"""Make a character or block device called targetpath.
"""
if not hasattr(os, "mknod") or not hasattr(os, "makedev"):
raise ExtractError("special devices not supported by system")
mode = tarinfo.mode
if tarinfo.isblk():
mode |= stat.S_IFBLK
else:
mode |= stat.S_IFCHR
os.mknod(targetpath, mode,
os.makedev(tarinfo.devmajor, tarinfo.devminor))
def makelink(self, tarinfo, targetpath):
"""Make a (symbolic) link called targetpath. If it cannot be created
(platform limitation), we try to make a copy of the referenced file
instead of a link.
"""
try:
# For systems that support symbolic and hard links.
if tarinfo.issym():
os.symlink(tarinfo.linkname, targetpath)
else:
# See extract().
if os.path.exists(tarinfo._link_target):
os.link(tarinfo._link_target, targetpath)
else:
self._extract_member(self._find_link_target(tarinfo),
targetpath)
except symlink_exception:
if tarinfo.issym():
linkpath = os.path.join(os.path.dirname(tarinfo.name),
tarinfo.linkname)
else:
linkpath = tarinfo.linkname
else:
try:
self._extract_member(self._find_link_target(tarinfo),
targetpath)
except KeyError:
raise ExtractError("unable to resolve link inside archive")
def chown(self, tarinfo, targetpath):
"""Set owner of targetpath according to tarinfo.
"""
if pwd and hasattr(os, "geteuid") and os.geteuid() == 0:
# We have to be root to do so.
try:
g = grp.getgrnam(tarinfo.gname)[2]
except KeyError:
g = tarinfo.gid
try:
u = pwd.getpwnam(tarinfo.uname)[2]
except KeyError:
u = tarinfo.uid
try:
if tarinfo.issym() and hasattr(os, "lchown"):
os.lchown(targetpath, u, g)
else:
if sys.platform != "os2emx":
os.chown(targetpath, u, g)
except EnvironmentError as e:
raise ExtractError("could not change owner")
def chmod(self, tarinfo, targetpath):
"""Set file permissions of targetpath according to tarinfo.
"""
if hasattr(os, 'chmod'):
try:
os.chmod(targetpath, tarinfo.mode)
except EnvironmentError as e:
raise ExtractError("could not change mode")
def utime(self, tarinfo, targetpath):
"""Set modification time of targetpath according to tarinfo.
"""
if not hasattr(os, 'utime'):
return
try:
os.utime(targetpath, (tarinfo.mtime, tarinfo.mtime))
except EnvironmentError as e:
raise ExtractError("could not change modification time")
#--------------------------------------------------------------------------
def next(self):
"""Return the next member of the archive as a TarInfo object, when
TarFile is opened for reading. Return None if there is no more
available.
"""
self._check("ra")
if self.firstmember is not None:
m = self.firstmember
self.firstmember = None
return m
# Read the next block.
self.fileobj.seek(self.offset)
tarinfo = None
while True:
try:
tarinfo = self.tarinfo.fromtarfile(self)
except EOFHeaderError as e:
if self.ignore_zeros:
self._dbg(2, "0x%X: %s" % (self.offset, e))
self.offset += BLOCKSIZE
continue
except InvalidHeaderError as e:
if self.ignore_zeros:
self._dbg(2, "0x%X: %s" % (self.offset, e))
self.offset += BLOCKSIZE
continue
elif self.offset == 0:
raise ReadError(str(e))
except EmptyHeaderError:
if self.offset == 0:
raise ReadError("empty file")
except TruncatedHeaderError as e:
if self.offset == 0:
raise ReadError(str(e))
except SubsequentHeaderError as e:
raise ReadError(str(e))
break
if tarinfo is not None:
self.members.append(tarinfo)
else:
self._loaded = True
return tarinfo
#--------------------------------------------------------------------------
# Little helper methods:
def _getmember(self, name, tarinfo=None, normalize=False):
"""Find an archive member by name from bottom to top.
If tarinfo is given, it is used as the starting point.
"""
# Ensure that all members have been loaded.
members = self.getmembers()
# Limit the member search list up to tarinfo.
if tarinfo is not None:
members = members[:members.index(tarinfo)]
if normalize:
name = os.path.normpath(name)
for member in reversed(members):
if normalize:
member_name = os.path.normpath(member.name)
else:
member_name = member.name
if name == member_name:
return member
def _load(self):
"""Read through the entire archive file and look for readable
members.
"""
while True:
tarinfo = self.next()
if tarinfo is None:
break
self._loaded = True
def _check(self, mode=None):
"""Check if TarFile is still open, and if the operation's mode
corresponds to TarFile's mode.
"""
if self.closed:
raise IOError("%s is closed" % self.__class__.__name__)
if mode is not None and self.mode not in mode:
raise IOError("bad operation for mode %r" % self.mode)
def _find_link_target(self, tarinfo):
"""Find the target member of a symlink or hardlink member in the
archive.
"""
if tarinfo.issym():
# Always search the entire archive.
linkname = os.path.dirname(tarinfo.name) + "/" + tarinfo.linkname
limit = None
else:
# Search the archive before the link, because a hard link is
# just a reference to an already archived file.
linkname = tarinfo.linkname
limit = tarinfo
member = self._getmember(linkname, tarinfo=limit, normalize=True)
if member is None:
raise KeyError("linkname %r not found" % linkname)
return member
def __iter__(self):
"""Provide an iterator object.
"""
if self._loaded:
return iter(self.members)
else:
return TarIter(self)
def _dbg(self, level, msg):
"""Write debugging output to sys.stderr.
"""
if level <= self.debug:
print(msg, file=sys.stderr)
def __enter__(self):
self._check()
return self
def __exit__(self, type, value, traceback):
if type is None:
self.close()
else:
# An exception occurred. We must not call close() because
# it would try to write end-of-archive blocks and padding.
if not self._extfileobj:
self.fileobj.close()
self.closed = True
# class TarFile
class TarIter(object):
"""Iterator Class.
for tarinfo in TarFile(...):
suite...
"""
def __init__(self, tarfile):
"""Construct a TarIter object.
"""
self.tarfile = tarfile
self.index = 0
def __iter__(self):
"""Return iterator object.
"""
return self
def __next__(self):
"""Return the next item using TarFile's next() method.
When all members have been read, set TarFile as _loaded.
"""
# Fix for SF #1100429: Under rare circumstances it can
# happen that getmembers() is called during iteration,
# which will cause TarIter to stop prematurely.
if not self.tarfile._loaded:
tarinfo = self.tarfile.next()
if not tarinfo:
self.tarfile._loaded = True
raise StopIteration
else:
try:
tarinfo = self.tarfile.members[self.index]
except IndexError:
raise StopIteration
self.index += 1
return tarinfo
next = __next__ # for Python 2.x
#--------------------
# exported functions
#--------------------
def is_tarfile(name):
"""Return True if name points to a tar archive that we
are able to handle, else return False.
"""
try:
t = open(name)
t.close()
return True
except TarError:
return False
bltn_open = open
open = TarFile.open
pip/_vendor/distlib/_backport/sysconfig.py 0000644 00000064513 14751155150 0014761 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012 The Python Software Foundation.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
"""Access to Python's configuration information."""
import codecs
import os
import re
import sys
from os.path import pardir, realpath
try:
import configparser
except ImportError:
import ConfigParser as configparser
__all__ = [
'get_config_h_filename',
'get_config_var',
'get_config_vars',
'get_makefile_filename',
'get_path',
'get_path_names',
'get_paths',
'get_platform',
'get_python_version',
'get_scheme_names',
'parse_config_h',
]
def _safe_realpath(path):
try:
return realpath(path)
except OSError:
return path
if sys.executable:
_PROJECT_BASE = os.path.dirname(_safe_realpath(sys.executable))
else:
# sys.executable can be empty if argv[0] has been changed and Python is
# unable to retrieve the real program name
_PROJECT_BASE = _safe_realpath(os.getcwd())
if os.name == "nt" and "pcbuild" in _PROJECT_BASE[-8:].lower():
_PROJECT_BASE = _safe_realpath(os.path.join(_PROJECT_BASE, pardir))
# PC/VS7.1
if os.name == "nt" and "\\pc\\v" in _PROJECT_BASE[-10:].lower():
_PROJECT_BASE = _safe_realpath(os.path.join(_PROJECT_BASE, pardir, pardir))
# PC/AMD64
if os.name == "nt" and "\\pcbuild\\amd64" in _PROJECT_BASE[-14:].lower():
_PROJECT_BASE = _safe_realpath(os.path.join(_PROJECT_BASE, pardir, pardir))
def is_python_build():
for fn in ("Setup.dist", "Setup.local"):
if os.path.isfile(os.path.join(_PROJECT_BASE, "Modules", fn)):
return True
return False
_PYTHON_BUILD = is_python_build()
_cfg_read = False
def _ensure_cfg_read():
global _cfg_read
if not _cfg_read:
from ..resources import finder
backport_package = __name__.rsplit('.', 1)[0]
_finder = finder(backport_package)
_cfgfile = _finder.find('sysconfig.cfg')
assert _cfgfile, 'sysconfig.cfg exists'
with _cfgfile.as_stream() as s:
_SCHEMES.readfp(s)
if _PYTHON_BUILD:
for scheme in ('posix_prefix', 'posix_home'):
_SCHEMES.set(scheme, 'include', '{srcdir}/Include')
_SCHEMES.set(scheme, 'platinclude', '{projectbase}/.')
_cfg_read = True
_SCHEMES = configparser.RawConfigParser()
_VAR_REPL = re.compile(r'\{([^{]*?)\}')
def _expand_globals(config):
_ensure_cfg_read()
if config.has_section('globals'):
globals = config.items('globals')
else:
globals = tuple()
sections = config.sections()
for section in sections:
if section == 'globals':
continue
for option, value in globals:
if config.has_option(section, option):
continue
config.set(section, option, value)
config.remove_section('globals')
# now expanding local variables defined in the cfg file
#
for section in config.sections():
variables = dict(config.items(section))
def _replacer(matchobj):
name = matchobj.group(1)
if name in variables:
return variables[name]
return matchobj.group(0)
for option, value in config.items(section):
config.set(section, option, _VAR_REPL.sub(_replacer, value))
#_expand_globals(_SCHEMES)
# FIXME don't rely on sys.version here, its format is an implementation detail
# of CPython, use sys.version_info or sys.hexversion
_PY_VERSION = sys.version.split()[0]
_PY_VERSION_SHORT = sys.version[:3]
_PY_VERSION_SHORT_NO_DOT = _PY_VERSION[0] + _PY_VERSION[2]
_PREFIX = os.path.normpath(sys.prefix)
_EXEC_PREFIX = os.path.normpath(sys.exec_prefix)
_CONFIG_VARS = None
_USER_BASE = None
def _subst_vars(path, local_vars):
"""In the string `path`, replace tokens like {some.thing} with the
corresponding value from the map `local_vars`.
If there is no corresponding value, leave the token unchanged.
"""
def _replacer(matchobj):
name = matchobj.group(1)
if name in local_vars:
return local_vars[name]
elif name in os.environ:
return os.environ[name]
return matchobj.group(0)
return _VAR_REPL.sub(_replacer, path)
def _extend_dict(target_dict, other_dict):
target_keys = target_dict.keys()
for key, value in other_dict.items():
if key in target_keys:
continue
target_dict[key] = value
def _expand_vars(scheme, vars):
res = {}
if vars is None:
vars = {}
_extend_dict(vars, get_config_vars())
for key, value in _SCHEMES.items(scheme):
if os.name in ('posix', 'nt'):
value = os.path.expanduser(value)
res[key] = os.path.normpath(_subst_vars(value, vars))
return res
def format_value(value, vars):
def _replacer(matchobj):
name = matchobj.group(1)
if name in vars:
return vars[name]
return matchobj.group(0)
return _VAR_REPL.sub(_replacer, value)
def _get_default_scheme():
if os.name == 'posix':
# the default scheme for posix is posix_prefix
return 'posix_prefix'
return os.name
def _getuserbase():
env_base = os.environ.get("PYTHONUSERBASE", None)
def joinuser(*args):
return os.path.expanduser(os.path.join(*args))
# what about 'os2emx', 'riscos' ?
if os.name == "nt":
base = os.environ.get("APPDATA") or "~"
if env_base:
return env_base
else:
return joinuser(base, "Python")
if sys.platform == "darwin":
framework = get_config_var("PYTHONFRAMEWORK")
if framework:
if env_base:
return env_base
else:
return joinuser("~", "Library", framework, "%d.%d" %
sys.version_info[:2])
if env_base:
return env_base
else:
return joinuser("~", ".local")
def _parse_makefile(filename, vars=None):
"""Parse a Makefile-style file.
A dictionary containing name/value pairs is returned. If an
optional dictionary is passed in as the second argument, it is
used instead of a new dictionary.
"""
# Regexes needed for parsing Makefile (and similar syntaxes,
# like old-style Setup files).
_variable_rx = re.compile("([a-zA-Z][a-zA-Z0-9_]+)\s*=\s*(.*)")
_findvar1_rx = re.compile(r"\$\(([A-Za-z][A-Za-z0-9_]*)\)")
_findvar2_rx = re.compile(r"\${([A-Za-z][A-Za-z0-9_]*)}")
if vars is None:
vars = {}
done = {}
notdone = {}
with codecs.open(filename, encoding='utf-8', errors="surrogateescape") as f:
lines = f.readlines()
for line in lines:
if line.startswith('#') or line.strip() == '':
continue
m = _variable_rx.match(line)
if m:
n, v = m.group(1, 2)
v = v.strip()
# `$$' is a literal `$' in make
tmpv = v.replace('$$', '')
if "$" in tmpv:
notdone[n] = v
else:
try:
v = int(v)
except ValueError:
# insert literal `$'
done[n] = v.replace('$$', '$')
else:
done[n] = v
# do variable interpolation here
variables = list(notdone.keys())
# Variables with a 'PY_' prefix in the makefile. These need to
# be made available without that prefix through sysconfig.
# Special care is needed to ensure that variable expansion works, even
# if the expansion uses the name without a prefix.
renamed_variables = ('CFLAGS', 'LDFLAGS', 'CPPFLAGS')
while len(variables) > 0:
for name in tuple(variables):
value = notdone[name]
m = _findvar1_rx.search(value) or _findvar2_rx.search(value)
if m is not None:
n = m.group(1)
found = True
if n in done:
item = str(done[n])
elif n in notdone:
# get it on a subsequent round
found = False
elif n in os.environ:
# do it like make: fall back to environment
item = os.environ[n]
elif n in renamed_variables:
if (name.startswith('PY_') and
name[3:] in renamed_variables):
item = ""
elif 'PY_' + n in notdone:
found = False
else:
item = str(done['PY_' + n])
else:
done[n] = item = ""
if found:
after = value[m.end():]
value = value[:m.start()] + item + after
if "$" in after:
notdone[name] = value
else:
try:
value = int(value)
except ValueError:
done[name] = value.strip()
else:
done[name] = value
variables.remove(name)
if (name.startswith('PY_') and
name[3:] in renamed_variables):
name = name[3:]
if name not in done:
done[name] = value
else:
# bogus variable reference (e.g. "prefix=$/opt/python");
# just drop it since we can't deal
done[name] = value
variables.remove(name)
# strip spurious spaces
for k, v in done.items():
if isinstance(v, str):
done[k] = v.strip()
# save the results in the global dictionary
vars.update(done)
return vars
def get_makefile_filename():
"""Return the path of the Makefile."""
if _PYTHON_BUILD:
return os.path.join(_PROJECT_BASE, "Makefile")
if hasattr(sys, 'abiflags'):
config_dir_name = 'config-%s%s' % (_PY_VERSION_SHORT, sys.abiflags)
else:
config_dir_name = 'config'
return os.path.join(get_path('stdlib'), config_dir_name, 'Makefile')
def _init_posix(vars):
"""Initialize the module as appropriate for POSIX systems."""
# load the installed Makefile:
makefile = get_makefile_filename()
try:
_parse_makefile(makefile, vars)
except IOError as e:
msg = "invalid Python installation: unable to open %s" % makefile
if hasattr(e, "strerror"):
msg = msg + " (%s)" % e.strerror
raise IOError(msg)
# load the installed pyconfig.h:
config_h = get_config_h_filename()
try:
with open(config_h) as f:
parse_config_h(f, vars)
except IOError as e:
msg = "invalid Python installation: unable to open %s" % config_h
if hasattr(e, "strerror"):
msg = msg + " (%s)" % e.strerror
raise IOError(msg)
# On AIX, there are wrong paths to the linker scripts in the Makefile
# -- these paths are relative to the Python source, but when installed
# the scripts are in another directory.
if _PYTHON_BUILD:
vars['LDSHARED'] = vars['BLDSHARED']
def _init_non_posix(vars):
"""Initialize the module as appropriate for NT"""
# set basic install directories
vars['LIBDEST'] = get_path('stdlib')
vars['BINLIBDEST'] = get_path('platstdlib')
vars['INCLUDEPY'] = get_path('include')
vars['SO'] = '.pyd'
vars['EXE'] = '.exe'
vars['VERSION'] = _PY_VERSION_SHORT_NO_DOT
vars['BINDIR'] = os.path.dirname(_safe_realpath(sys.executable))
#
# public APIs
#
def parse_config_h(fp, vars=None):
"""Parse a config.h-style file.
A dictionary containing name/value pairs is returned. If an
optional dictionary is passed in as the second argument, it is
used instead of a new dictionary.
"""
if vars is None:
vars = {}
define_rx = re.compile("#define ([A-Z][A-Za-z0-9_]+) (.*)\n")
undef_rx = re.compile("/[*] #undef ([A-Z][A-Za-z0-9_]+) [*]/\n")
while True:
line = fp.readline()
if not line:
break
m = define_rx.match(line)
if m:
n, v = m.group(1, 2)
try:
v = int(v)
except ValueError:
pass
vars[n] = v
else:
m = undef_rx.match(line)
if m:
vars[m.group(1)] = 0
return vars
def get_config_h_filename():
"""Return the path of pyconfig.h."""
if _PYTHON_BUILD:
if os.name == "nt":
inc_dir = os.path.join(_PROJECT_BASE, "PC")
else:
inc_dir = _PROJECT_BASE
else:
inc_dir = get_path('platinclude')
return os.path.join(inc_dir, 'pyconfig.h')
def get_scheme_names():
"""Return a tuple containing the schemes names."""
return tuple(sorted(_SCHEMES.sections()))
def get_path_names():
"""Return a tuple containing the paths names."""
# xxx see if we want a static list
return _SCHEMES.options('posix_prefix')
def get_paths(scheme=_get_default_scheme(), vars=None, expand=True):
"""Return a mapping containing an install scheme.
``scheme`` is the install scheme name. If not provided, it will
return the default scheme for the current platform.
"""
_ensure_cfg_read()
if expand:
return _expand_vars(scheme, vars)
else:
return dict(_SCHEMES.items(scheme))
def get_path(name, scheme=_get_default_scheme(), vars=None, expand=True):
"""Return a path corresponding to the scheme.
``scheme`` is the install scheme name.
"""
return get_paths(scheme, vars, expand)[name]
def get_config_vars(*args):
"""With no arguments, return a dictionary of all configuration
variables relevant for the current platform.
On Unix, this means every variable defined in Python's installed Makefile;
On Windows and Mac OS it's a much smaller set.
With arguments, return a list of values that result from looking up
each argument in the configuration variable dictionary.
"""
global _CONFIG_VARS
if _CONFIG_VARS is None:
_CONFIG_VARS = {}
# Normalized versions of prefix and exec_prefix are handy to have;
# in fact, these are the standard versions used most places in the
# distutils2 module.
_CONFIG_VARS['prefix'] = _PREFIX
_CONFIG_VARS['exec_prefix'] = _EXEC_PREFIX
_CONFIG_VARS['py_version'] = _PY_VERSION
_CONFIG_VARS['py_version_short'] = _PY_VERSION_SHORT
_CONFIG_VARS['py_version_nodot'] = _PY_VERSION[0] + _PY_VERSION[2]
_CONFIG_VARS['base'] = _PREFIX
_CONFIG_VARS['platbase'] = _EXEC_PREFIX
_CONFIG_VARS['projectbase'] = _PROJECT_BASE
try:
_CONFIG_VARS['abiflags'] = sys.abiflags
except AttributeError:
# sys.abiflags may not be defined on all platforms.
_CONFIG_VARS['abiflags'] = ''
if os.name in ('nt', 'os2'):
_init_non_posix(_CONFIG_VARS)
if os.name == 'posix':
_init_posix(_CONFIG_VARS)
# Setting 'userbase' is done below the call to the
# init function to enable using 'get_config_var' in
# the init-function.
if sys.version >= '2.6':
_CONFIG_VARS['userbase'] = _getuserbase()
if 'srcdir' not in _CONFIG_VARS:
_CONFIG_VARS['srcdir'] = _PROJECT_BASE
else:
_CONFIG_VARS['srcdir'] = _safe_realpath(_CONFIG_VARS['srcdir'])
# Convert srcdir into an absolute path if it appears necessary.
# Normally it is relative to the build directory. However, during
# testing, for example, we might be running a non-installed python
# from a different directory.
if _PYTHON_BUILD and os.name == "posix":
base = _PROJECT_BASE
try:
cwd = os.getcwd()
except OSError:
cwd = None
if (not os.path.isabs(_CONFIG_VARS['srcdir']) and
base != cwd):
# srcdir is relative and we are not in the same directory
# as the executable. Assume executable is in the build
# directory and make srcdir absolute.
srcdir = os.path.join(base, _CONFIG_VARS['srcdir'])
_CONFIG_VARS['srcdir'] = os.path.normpath(srcdir)
if sys.platform == 'darwin':
kernel_version = os.uname()[2] # Kernel version (8.4.3)
major_version = int(kernel_version.split('.')[0])
if major_version < 8:
# On macOS before 10.4, check if -arch and -isysroot
# are in CFLAGS or LDFLAGS and remove them if they are.
# This is needed when building extensions on a 10.3 system
# using a universal build of python.
for key in ('LDFLAGS', 'BASECFLAGS',
# a number of derived variables. These need to be
# patched up as well.
'CFLAGS', 'PY_CFLAGS', 'BLDSHARED'):
flags = _CONFIG_VARS[key]
flags = re.sub('-arch\s+\w+\s', ' ', flags)
flags = re.sub('-isysroot [^ \t]*', ' ', flags)
_CONFIG_VARS[key] = flags
else:
# Allow the user to override the architecture flags using
# an environment variable.
# NOTE: This name was introduced by Apple in OSX 10.5 and
# is used by several scripting languages distributed with
# that OS release.
if 'ARCHFLAGS' in os.environ:
arch = os.environ['ARCHFLAGS']
for key in ('LDFLAGS', 'BASECFLAGS',
# a number of derived variables. These need to be
# patched up as well.
'CFLAGS', 'PY_CFLAGS', 'BLDSHARED'):
flags = _CONFIG_VARS[key]
flags = re.sub('-arch\s+\w+\s', ' ', flags)
flags = flags + ' ' + arch
_CONFIG_VARS[key] = flags
# If we're on OSX 10.5 or later and the user tries to
# compiles an extension using an SDK that is not present
# on the current machine it is better to not use an SDK
# than to fail.
#
# The major usecase for this is users using a Python.org
# binary installer on OSX 10.6: that installer uses
# the 10.4u SDK, but that SDK is not installed by default
# when you install Xcode.
#
CFLAGS = _CONFIG_VARS.get('CFLAGS', '')
m = re.search('-isysroot\s+(\S+)', CFLAGS)
if m is not None:
sdk = m.group(1)
if not os.path.exists(sdk):
for key in ('LDFLAGS', 'BASECFLAGS',
# a number of derived variables. These need to be
# patched up as well.
'CFLAGS', 'PY_CFLAGS', 'BLDSHARED'):
flags = _CONFIG_VARS[key]
flags = re.sub('-isysroot\s+\S+(\s|$)', ' ', flags)
_CONFIG_VARS[key] = flags
if args:
vals = []
for name in args:
vals.append(_CONFIG_VARS.get(name))
return vals
else:
return _CONFIG_VARS
def get_config_var(name):
"""Return the value of a single variable using the dictionary returned by
'get_config_vars()'.
Equivalent to get_config_vars().get(name)
"""
return get_config_vars().get(name)
def get_platform():
"""Return a string that identifies the current platform.
This is used mainly to distinguish platform-specific build directories and
platform-specific built distributions. Typically includes the OS name
and version and the architecture (as supplied by 'os.uname()'),
although the exact information included depends on the OS; eg. for IRIX
the architecture isn't particularly important (IRIX only runs on SGI
hardware), but for Linux the kernel version isn't particularly
important.
Examples of returned values:
linux-i586
linux-alpha (?)
solaris-2.6-sun4u
irix-5.3
irix64-6.2
Windows will return one of:
win-amd64 (64bit Windows on AMD64 (aka x86_64, Intel64, EM64T, etc)
win-ia64 (64bit Windows on Itanium)
win32 (all others - specifically, sys.platform is returned)
For other non-POSIX platforms, currently just returns 'sys.platform'.
"""
if os.name == 'nt':
# sniff sys.version for architecture.
prefix = " bit ("
i = sys.version.find(prefix)
if i == -1:
return sys.platform
j = sys.version.find(")", i)
look = sys.version[i+len(prefix):j].lower()
if look == 'amd64':
return 'win-amd64'
if look == 'itanium':
return 'win-ia64'
return sys.platform
if os.name != "posix" or not hasattr(os, 'uname'):
# XXX what about the architecture? NT is Intel or Alpha,
# Mac OS is M68k or PPC, etc.
return sys.platform
# Try to distinguish various flavours of Unix
osname, host, release, version, machine = os.uname()
# Convert the OS name to lowercase, remove '/' characters
# (to accommodate BSD/OS), and translate spaces (for "Power Macintosh")
osname = osname.lower().replace('/', '')
machine = machine.replace(' ', '_')
machine = machine.replace('/', '-')
if osname[:5] == "linux":
# At least on Linux/Intel, 'machine' is the processor --
# i386, etc.
# XXX what about Alpha, SPARC, etc?
return "%s-%s" % (osname, machine)
elif osname[:5] == "sunos":
if release[0] >= "5": # SunOS 5 == Solaris 2
osname = "solaris"
release = "%d.%s" % (int(release[0]) - 3, release[2:])
# fall through to standard osname-release-machine representation
elif osname[:4] == "irix": # could be "irix64"!
return "%s-%s" % (osname, release)
elif osname[:3] == "aix":
return "%s-%s.%s" % (osname, version, release)
elif osname[:6] == "cygwin":
osname = "cygwin"
rel_re = re.compile(r'[\d.]+')
m = rel_re.match(release)
if m:
release = m.group()
elif osname[:6] == "darwin":
#
# For our purposes, we'll assume that the system version from
# distutils' perspective is what MACOSX_DEPLOYMENT_TARGET is set
# to. This makes the compatibility story a bit more sane because the
# machine is going to compile and link as if it were
# MACOSX_DEPLOYMENT_TARGET.
cfgvars = get_config_vars()
macver = cfgvars.get('MACOSX_DEPLOYMENT_TARGET')
if True:
# Always calculate the release of the running machine,
# needed to determine if we can build fat binaries or not.
macrelease = macver
# Get the system version. Reading this plist is a documented
# way to get the system version (see the documentation for
# the Gestalt Manager)
try:
f = open('/System/Library/CoreServices/SystemVersion.plist')
except IOError:
# We're on a plain darwin box, fall back to the default
# behaviour.
pass
else:
try:
m = re.search(r'<key>ProductUserVisibleVersion</key>\s*'
r'<string>(.*?)</string>', f.read())
finally:
f.close()
if m is not None:
macrelease = '.'.join(m.group(1).split('.')[:2])
# else: fall back to the default behaviour
if not macver:
macver = macrelease
if macver:
release = macver
osname = "macosx"
if ((macrelease + '.') >= '10.4.' and
'-arch' in get_config_vars().get('CFLAGS', '').strip()):
# The universal build will build fat binaries, but not on
# systems before 10.4
#
# Try to detect 4-way universal builds, those have machine-type
# 'universal' instead of 'fat'.
machine = 'fat'
cflags = get_config_vars().get('CFLAGS')
archs = re.findall('-arch\s+(\S+)', cflags)
archs = tuple(sorted(set(archs)))
if len(archs) == 1:
machine = archs[0]
elif archs == ('i386', 'ppc'):
machine = 'fat'
elif archs == ('i386', 'x86_64'):
machine = 'intel'
elif archs == ('i386', 'ppc', 'x86_64'):
machine = 'fat3'
elif archs == ('ppc64', 'x86_64'):
machine = 'fat64'
elif archs == ('i386', 'ppc', 'ppc64', 'x86_64'):
machine = 'universal'
else:
raise ValueError(
"Don't know machine value for archs=%r" % (archs,))
elif machine == 'i386':
# On OSX the machine type returned by uname is always the
# 32-bit variant, even if the executable architecture is
# the 64-bit variant
if sys.maxsize >= 2**32:
machine = 'x86_64'
elif machine in ('PowerPC', 'Power_Macintosh'):
# Pick a sane name for the PPC architecture.
# See 'i386' case
if sys.maxsize >= 2**32:
machine = 'ppc64'
else:
machine = 'ppc'
return "%s-%s-%s" % (osname, release, machine)
def get_python_version():
return _PY_VERSION_SHORT
def _print_dict(title, data):
for index, (key, value) in enumerate(sorted(data.items())):
if index == 0:
print('%s: ' % (title))
print('\t%s = "%s"' % (key, value))
def _main():
"""Display all information sysconfig detains."""
print('Platform: "%s"' % get_platform())
print('Python version: "%s"' % get_python_version())
print('Current installation scheme: "%s"' % _get_default_scheme())
print()
_print_dict('Paths', get_paths())
print()
_print_dict('Variables', get_config_vars())
if __name__ == '__main__':
_main()
pip/_vendor/distlib/_backport/misc.py 0000644 00000001713 14751155150 0013701 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012 The Python Software Foundation.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
"""Backports for individual classes and functions."""
import os
import sys
__all__ = ['cache_from_source', 'callable', 'fsencode']
try:
from imp import cache_from_source
except ImportError:
def cache_from_source(py_file, debug=__debug__):
ext = debug and 'c' or 'o'
return py_file + ext
try:
callable = callable
except NameError:
from collections import Callable
def callable(obj):
return isinstance(obj, Callable)
try:
fsencode = os.fsencode
except AttributeError:
def fsencode(filename):
if isinstance(filename, bytes):
return filename
elif isinstance(filename, str):
return filename.encode(sys.getfilesystemencoding())
else:
raise TypeError("expect bytes or str, not %s" %
type(filename).__name__)
pip/_vendor/distlib/index.py 0000644 00000051135 14751155150 0012114 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2013 Vinay Sajip.
# Licensed to the Python Software Foundation under a contributor agreement.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
import hashlib
import logging
import os
import shutil
import subprocess
import tempfile
try:
from threading import Thread
except ImportError:
from dummy_threading import Thread
from . import DistlibException
from .compat import (HTTPBasicAuthHandler, Request, HTTPPasswordMgr,
urlparse, build_opener, string_types)
from .util import cached_property, zip_dir, ServerProxy
logger = logging.getLogger(__name__)
DEFAULT_INDEX = 'https://pypi.python.org/pypi'
DEFAULT_REALM = 'pypi'
class PackageIndex(object):
"""
This class represents a package index compatible with PyPI, the Python
Package Index.
"""
boundary = b'----------ThIs_Is_tHe_distlib_index_bouNdaRY_$'
def __init__(self, url=None):
"""
Initialise an instance.
:param url: The URL of the index. If not specified, the URL for PyPI is
used.
"""
self.url = url or DEFAULT_INDEX
self.read_configuration()
scheme, netloc, path, params, query, frag = urlparse(self.url)
if params or query or frag or scheme not in ('http', 'https'):
raise DistlibException('invalid repository: %s' % self.url)
self.password_handler = None
self.ssl_verifier = None
self.gpg = None
self.gpg_home = None
self.rpc_proxy = None
with open(os.devnull, 'w') as sink:
# Use gpg by default rather than gpg2, as gpg2 insists on
# prompting for passwords
for s in ('gpg', 'gpg2'):
try:
rc = subprocess.check_call([s, '--version'], stdout=sink,
stderr=sink)
if rc == 0:
self.gpg = s
break
except OSError:
pass
def _get_pypirc_command(self):
"""
Get the distutils command for interacting with PyPI configurations.
:return: the command.
"""
from distutils.core import Distribution
from distutils.config import PyPIRCCommand
d = Distribution()
return PyPIRCCommand(d)
def read_configuration(self):
"""
Read the PyPI access configuration as supported by distutils, getting
PyPI to do the actual work. This populates ``username``, ``password``,
``realm`` and ``url`` attributes from the configuration.
"""
# get distutils to do the work
c = self._get_pypirc_command()
c.repository = self.url
cfg = c._read_pypirc()
self.username = cfg.get('username')
self.password = cfg.get('password')
self.realm = cfg.get('realm', 'pypi')
self.url = cfg.get('repository', self.url)
def save_configuration(self):
"""
Save the PyPI access configuration. You must have set ``username`` and
``password`` attributes before calling this method.
Again, distutils is used to do the actual work.
"""
self.check_credentials()
# get distutils to do the work
c = self._get_pypirc_command()
c._store_pypirc(self.username, self.password)
def check_credentials(self):
"""
Check that ``username`` and ``password`` have been set, and raise an
exception if not.
"""
if self.username is None or self.password is None:
raise DistlibException('username and password must be set')
pm = HTTPPasswordMgr()
_, netloc, _, _, _, _ = urlparse(self.url)
pm.add_password(self.realm, netloc, self.username, self.password)
self.password_handler = HTTPBasicAuthHandler(pm)
def register(self, metadata):
"""
Register a distribution on PyPI, using the provided metadata.
:param metadata: A :class:`Metadata` instance defining at least a name
and version number for the distribution to be
registered.
:return: The HTTP response received from PyPI upon submission of the
request.
"""
self.check_credentials()
metadata.validate()
d = metadata.todict()
d[':action'] = 'verify'
request = self.encode_request(d.items(), [])
response = self.send_request(request)
d[':action'] = 'submit'
request = self.encode_request(d.items(), [])
return self.send_request(request)
def _reader(self, name, stream, outbuf):
"""
Thread runner for reading lines of from a subprocess into a buffer.
:param name: The logical name of the stream (used for logging only).
:param stream: The stream to read from. This will typically a pipe
connected to the output stream of a subprocess.
:param outbuf: The list to append the read lines to.
"""
while True:
s = stream.readline()
if not s:
break
s = s.decode('utf-8').rstrip()
outbuf.append(s)
logger.debug('%s: %s' % (name, s))
stream.close()
def get_sign_command(self, filename, signer, sign_password,
keystore=None):
"""
Return a suitable command for signing a file.
:param filename: The pathname to the file to be signed.
:param signer: The identifier of the signer of the file.
:param sign_password: The passphrase for the signer's
private key used for signing.
:param keystore: The path to a directory which contains the keys
used in verification. If not specified, the
instance's ``gpg_home`` attribute is used instead.
:return: The signing command as a list suitable to be
passed to :class:`subprocess.Popen`.
"""
cmd = [self.gpg, '--status-fd', '2', '--no-tty']
if keystore is None:
keystore = self.gpg_home
if keystore:
cmd.extend(['--homedir', keystore])
if sign_password is not None:
cmd.extend(['--batch', '--passphrase-fd', '0'])
td = tempfile.mkdtemp()
sf = os.path.join(td, os.path.basename(filename) + '.asc')
cmd.extend(['--detach-sign', '--armor', '--local-user',
signer, '--output', sf, filename])
logger.debug('invoking: %s', ' '.join(cmd))
return cmd, sf
def run_command(self, cmd, input_data=None):
"""
Run a command in a child process , passing it any input data specified.
:param cmd: The command to run.
:param input_data: If specified, this must be a byte string containing
data to be sent to the child process.
:return: A tuple consisting of the subprocess' exit code, a list of
lines read from the subprocess' ``stdout``, and a list of
lines read from the subprocess' ``stderr``.
"""
kwargs = {
'stdout': subprocess.PIPE,
'stderr': subprocess.PIPE,
}
if input_data is not None:
kwargs['stdin'] = subprocess.PIPE
stdout = []
stderr = []
p = subprocess.Popen(cmd, **kwargs)
# We don't use communicate() here because we may need to
# get clever with interacting with the command
t1 = Thread(target=self._reader, args=('stdout', p.stdout, stdout))
t1.start()
t2 = Thread(target=self._reader, args=('stderr', p.stderr, stderr))
t2.start()
if input_data is not None:
p.stdin.write(input_data)
p.stdin.close()
p.wait()
t1.join()
t2.join()
return p.returncode, stdout, stderr
def sign_file(self, filename, signer, sign_password, keystore=None):
"""
Sign a file.
:param filename: The pathname to the file to be signed.
:param signer: The identifier of the signer of the file.
:param sign_password: The passphrase for the signer's
private key used for signing.
:param keystore: The path to a directory which contains the keys
used in signing. If not specified, the instance's
``gpg_home`` attribute is used instead.
:return: The absolute pathname of the file where the signature is
stored.
"""
cmd, sig_file = self.get_sign_command(filename, signer, sign_password,
keystore)
rc, stdout, stderr = self.run_command(cmd,
sign_password.encode('utf-8'))
if rc != 0:
raise DistlibException('sign command failed with error '
'code %s' % rc)
return sig_file
def upload_file(self, metadata, filename, signer=None, sign_password=None,
filetype='sdist', pyversion='source', keystore=None):
"""
Upload a release file to the index.
:param metadata: A :class:`Metadata` instance defining at least a name
and version number for the file to be uploaded.
:param filename: The pathname of the file to be uploaded.
:param signer: The identifier of the signer of the file.
:param sign_password: The passphrase for the signer's
private key used for signing.
:param filetype: The type of the file being uploaded. This is the
distutils command which produced that file, e.g.
``sdist`` or ``bdist_wheel``.
:param pyversion: The version of Python which the release relates
to. For code compatible with any Python, this would
be ``source``, otherwise it would be e.g. ``3.2``.
:param keystore: The path to a directory which contains the keys
used in signing. If not specified, the instance's
``gpg_home`` attribute is used instead.
:return: The HTTP response received from PyPI upon submission of the
request.
"""
self.check_credentials()
if not os.path.exists(filename):
raise DistlibException('not found: %s' % filename)
metadata.validate()
d = metadata.todict()
sig_file = None
if signer:
if not self.gpg:
logger.warning('no signing program available - not signed')
else:
sig_file = self.sign_file(filename, signer, sign_password,
keystore)
with open(filename, 'rb') as f:
file_data = f.read()
md5_digest = hashlib.md5(file_data).hexdigest()
sha256_digest = hashlib.sha256(file_data).hexdigest()
d.update({
':action': 'file_upload',
'protocol_version': '1',
'filetype': filetype,
'pyversion': pyversion,
'md5_digest': md5_digest,
'sha256_digest': sha256_digest,
})
files = [('content', os.path.basename(filename), file_data)]
if sig_file:
with open(sig_file, 'rb') as f:
sig_data = f.read()
files.append(('gpg_signature', os.path.basename(sig_file),
sig_data))
shutil.rmtree(os.path.dirname(sig_file))
request = self.encode_request(d.items(), files)
return self.send_request(request)
def upload_documentation(self, metadata, doc_dir):
"""
Upload documentation to the index.
:param metadata: A :class:`Metadata` instance defining at least a name
and version number for the documentation to be
uploaded.
:param doc_dir: The pathname of the directory which contains the
documentation. This should be the directory that
contains the ``index.html`` for the documentation.
:return: The HTTP response received from PyPI upon submission of the
request.
"""
self.check_credentials()
if not os.path.isdir(doc_dir):
raise DistlibException('not a directory: %r' % doc_dir)
fn = os.path.join(doc_dir, 'index.html')
if not os.path.exists(fn):
raise DistlibException('not found: %r' % fn)
metadata.validate()
name, version = metadata.name, metadata.version
zip_data = zip_dir(doc_dir).getvalue()
fields = [(':action', 'doc_upload'),
('name', name), ('version', version)]
files = [('content', name, zip_data)]
request = self.encode_request(fields, files)
return self.send_request(request)
def get_verify_command(self, signature_filename, data_filename,
keystore=None):
"""
Return a suitable command for verifying a file.
:param signature_filename: The pathname to the file containing the
signature.
:param data_filename: The pathname to the file containing the
signed data.
:param keystore: The path to a directory which contains the keys
used in verification. If not specified, the
instance's ``gpg_home`` attribute is used instead.
:return: The verifying command as a list suitable to be
passed to :class:`subprocess.Popen`.
"""
cmd = [self.gpg, '--status-fd', '2', '--no-tty']
if keystore is None:
keystore = self.gpg_home
if keystore:
cmd.extend(['--homedir', keystore])
cmd.extend(['--verify', signature_filename, data_filename])
logger.debug('invoking: %s', ' '.join(cmd))
return cmd
def verify_signature(self, signature_filename, data_filename,
keystore=None):
"""
Verify a signature for a file.
:param signature_filename: The pathname to the file containing the
signature.
:param data_filename: The pathname to the file containing the
signed data.
:param keystore: The path to a directory which contains the keys
used in verification. If not specified, the
instance's ``gpg_home`` attribute is used instead.
:return: True if the signature was verified, else False.
"""
if not self.gpg:
raise DistlibException('verification unavailable because gpg '
'unavailable')
cmd = self.get_verify_command(signature_filename, data_filename,
keystore)
rc, stdout, stderr = self.run_command(cmd)
if rc not in (0, 1):
raise DistlibException('verify command failed with error '
'code %s' % rc)
return rc == 0
def download_file(self, url, destfile, digest=None, reporthook=None):
"""
This is a convenience method for downloading a file from an URL.
Normally, this will be a file from the index, though currently
no check is made for this (i.e. a file can be downloaded from
anywhere).
The method is just like the :func:`urlretrieve` function in the
standard library, except that it allows digest computation to be
done during download and checking that the downloaded data
matched any expected value.
:param url: The URL of the file to be downloaded (assumed to be
available via an HTTP GET request).
:param destfile: The pathname where the downloaded file is to be
saved.
:param digest: If specified, this must be a (hasher, value)
tuple, where hasher is the algorithm used (e.g.
``'md5'``) and ``value`` is the expected value.
:param reporthook: The same as for :func:`urlretrieve` in the
standard library.
"""
if digest is None:
digester = None
logger.debug('No digest specified')
else:
if isinstance(digest, (list, tuple)):
hasher, digest = digest
else:
hasher = 'md5'
digester = getattr(hashlib, hasher)()
logger.debug('Digest specified: %s' % digest)
# The following code is equivalent to urlretrieve.
# We need to do it this way so that we can compute the
# digest of the file as we go.
with open(destfile, 'wb') as dfp:
# addinfourl is not a context manager on 2.x
# so we have to use try/finally
sfp = self.send_request(Request(url))
try:
headers = sfp.info()
blocksize = 8192
size = -1
read = 0
blocknum = 0
if "content-length" in headers:
size = int(headers["Content-Length"])
if reporthook:
reporthook(blocknum, blocksize, size)
while True:
block = sfp.read(blocksize)
if not block:
break
read += len(block)
dfp.write(block)
if digester:
digester.update(block)
blocknum += 1
if reporthook:
reporthook(blocknum, blocksize, size)
finally:
sfp.close()
# check that we got the whole file, if we can
if size >= 0 and read < size:
raise DistlibException(
'retrieval incomplete: got only %d out of %d bytes'
% (read, size))
# if we have a digest, it must match.
if digester:
actual = digester.hexdigest()
if digest != actual:
raise DistlibException('%s digest mismatch for %s: expected '
'%s, got %s' % (hasher, destfile,
digest, actual))
logger.debug('Digest verified: %s', digest)
def send_request(self, req):
"""
Send a standard library :class:`Request` to PyPI and return its
response.
:param req: The request to send.
:return: The HTTP response from PyPI (a standard library HTTPResponse).
"""
handlers = []
if self.password_handler:
handlers.append(self.password_handler)
if self.ssl_verifier:
handlers.append(self.ssl_verifier)
opener = build_opener(*handlers)
return opener.open(req)
def encode_request(self, fields, files):
"""
Encode fields and files for posting to an HTTP server.
:param fields: The fields to send as a list of (fieldname, value)
tuples.
:param files: The files to send as a list of (fieldname, filename,
file_bytes) tuple.
"""
# Adapted from packaging, which in turn was adapted from
# http://code.activestate.com/recipes/146306
parts = []
boundary = self.boundary
for k, values in fields:
if not isinstance(values, (list, tuple)):
values = [values]
for v in values:
parts.extend((
b'--' + boundary,
('Content-Disposition: form-data; name="%s"' %
k).encode('utf-8'),
b'',
v.encode('utf-8')))
for key, filename, value in files:
parts.extend((
b'--' + boundary,
('Content-Disposition: form-data; name="%s"; filename="%s"' %
(key, filename)).encode('utf-8'),
b'',
value))
parts.extend((b'--' + boundary + b'--', b''))
body = b'\r\n'.join(parts)
ct = b'multipart/form-data; boundary=' + boundary
headers = {
'Content-type': ct,
'Content-length': str(len(body))
}
return Request(self.url, body, headers)
def search(self, terms, operator=None):
if isinstance(terms, string_types):
terms = {'name': terms}
if self.rpc_proxy is None:
self.rpc_proxy = ServerProxy(self.url, timeout=3.0)
return self.rpc_proxy.search(terms, operator or 'and')
pip/_vendor/distlib/locators.py 0000644 00000143505 14751155150 0012636 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2012-2015 Vinay Sajip.
# Licensed to the Python Software Foundation under a contributor agreement.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
import gzip
from io import BytesIO
import json
import logging
import os
import posixpath
import re
try:
import threading
except ImportError: # pragma: no cover
import dummy_threading as threading
import zlib
from . import DistlibException
from .compat import (urljoin, urlparse, urlunparse, url2pathname, pathname2url,
queue, quote, unescape, string_types, build_opener,
HTTPRedirectHandler as BaseRedirectHandler, text_type,
Request, HTTPError, URLError)
from .database import Distribution, DistributionPath, make_dist
from .metadata import Metadata
from .util import (cached_property, parse_credentials, ensure_slash,
split_filename, get_project_data, parse_requirement,
parse_name_and_version, ServerProxy, normalize_name)
from .version import get_scheme, UnsupportedVersionError
from .wheel import Wheel, is_compatible
logger = logging.getLogger(__name__)
HASHER_HASH = re.compile('^(\w+)=([a-f0-9]+)')
CHARSET = re.compile(r';\s*charset\s*=\s*(.*)\s*$', re.I)
HTML_CONTENT_TYPE = re.compile('text/html|application/x(ht)?ml')
DEFAULT_INDEX = 'https://pypi.python.org/pypi'
def get_all_distribution_names(url=None):
"""
Return all distribution names known by an index.
:param url: The URL of the index.
:return: A list of all known distribution names.
"""
if url is None:
url = DEFAULT_INDEX
client = ServerProxy(url, timeout=3.0)
return client.list_packages()
class RedirectHandler(BaseRedirectHandler):
"""
A class to work around a bug in some Python 3.2.x releases.
"""
# There's a bug in the base version for some 3.2.x
# (e.g. 3.2.2 on Ubuntu Oneiric). If a Location header
# returns e.g. /abc, it bails because it says the scheme ''
# is bogus, when actually it should use the request's
# URL for the scheme. See Python issue #13696.
def http_error_302(self, req, fp, code, msg, headers):
# Some servers (incorrectly) return multiple Location headers
# (so probably same goes for URI). Use first header.
newurl = None
for key in ('location', 'uri'):
if key in headers:
newurl = headers[key]
break
if newurl is None:
return
urlparts = urlparse(newurl)
if urlparts.scheme == '':
newurl = urljoin(req.get_full_url(), newurl)
if hasattr(headers, 'replace_header'):
headers.replace_header(key, newurl)
else:
headers[key] = newurl
return BaseRedirectHandler.http_error_302(self, req, fp, code, msg,
headers)
http_error_301 = http_error_303 = http_error_307 = http_error_302
class Locator(object):
"""
A base class for locators - things that locate distributions.
"""
source_extensions = ('.tar.gz', '.tar.bz2', '.tar', '.zip', '.tgz', '.tbz')
binary_extensions = ('.egg', '.exe', '.whl')
excluded_extensions = ('.pdf',)
# A list of tags indicating which wheels you want to match. The default
# value of None matches against the tags compatible with the running
# Python. If you want to match other values, set wheel_tags on a locator
# instance to a list of tuples (pyver, abi, arch) which you want to match.
wheel_tags = None
downloadable_extensions = source_extensions + ('.whl',)
def __init__(self, scheme='default'):
"""
Initialise an instance.
:param scheme: Because locators look for most recent versions, they
need to know the version scheme to use. This specifies
the current PEP-recommended scheme - use ``'legacy'``
if you need to support existing distributions on PyPI.
"""
self._cache = {}
self.scheme = scheme
# Because of bugs in some of the handlers on some of the platforms,
# we use our own opener rather than just using urlopen.
self.opener = build_opener(RedirectHandler())
# If get_project() is called from locate(), the matcher instance
# is set from the requirement passed to locate(). See issue #18 for
# why this can be useful to know.
self.matcher = None
self.errors = queue.Queue()
def get_errors(self):
"""
Return any errors which have occurred.
"""
result = []
while not self.errors.empty(): # pragma: no cover
try:
e = self.errors.get(False)
result.append(e)
except self.errors.Empty:
continue
self.errors.task_done()
return result
def clear_errors(self):
"""
Clear any errors which may have been logged.
"""
# Just get the errors and throw them away
self.get_errors()
def clear_cache(self):
self._cache.clear()
def _get_scheme(self):
return self._scheme
def _set_scheme(self, value):
self._scheme = value
scheme = property(_get_scheme, _set_scheme)
def _get_project(self, name):
"""
For a given project, get a dictionary mapping available versions to Distribution
instances.
This should be implemented in subclasses.
If called from a locate() request, self.matcher will be set to a
matcher for the requirement to satisfy, otherwise it will be None.
"""
raise NotImplementedError('Please implement in the subclass')
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
raise NotImplementedError('Please implement in the subclass')
def get_project(self, name):
"""
For a given project, get a dictionary mapping available versions to Distribution
instances.
This calls _get_project to do all the work, and just implements a caching layer on top.
"""
if self._cache is None:
result = self._get_project(name)
elif name in self._cache:
result = self._cache[name]
else:
self.clear_errors()
result = self._get_project(name)
self._cache[name] = result
return result
def score_url(self, url):
"""
Give an url a score which can be used to choose preferred URLs
for a given project release.
"""
t = urlparse(url)
basename = posixpath.basename(t.path)
compatible = True
is_wheel = basename.endswith('.whl')
if is_wheel:
compatible = is_compatible(Wheel(basename), self.wheel_tags)
return (t.scheme != 'https', 'pypi.python.org' in t.netloc,
is_wheel, compatible, basename)
def prefer_url(self, url1, url2):
"""
Choose one of two URLs where both are candidates for distribution
archives for the same version of a distribution (for example,
.tar.gz vs. zip).
The current implementation favours https:// URLs over http://, archives
from PyPI over those from other locations, wheel compatibility (if a
wheel) and then the archive name.
"""
result = url2
if url1:
s1 = self.score_url(url1)
s2 = self.score_url(url2)
if s1 > s2:
result = url1
if result != url2:
logger.debug('Not replacing %r with %r', url1, url2)
else:
logger.debug('Replacing %r with %r', url1, url2)
return result
def split_filename(self, filename, project_name):
"""
Attempt to split a filename in project name, version and Python version.
"""
return split_filename(filename, project_name)
def convert_url_to_download_info(self, url, project_name):
"""
See if a URL is a candidate for a download URL for a project (the URL
has typically been scraped from an HTML page).
If it is, a dictionary is returned with keys "name", "version",
"filename" and "url"; otherwise, None is returned.
"""
def same_project(name1, name2):
return normalize_name(name1) == normalize_name(name2)
result = None
scheme, netloc, path, params, query, frag = urlparse(url)
if frag.lower().startswith('egg='):
logger.debug('%s: version hint in fragment: %r',
project_name, frag)
m = HASHER_HASH.match(frag)
if m:
algo, digest = m.groups()
else:
algo, digest = None, None
origpath = path
if path and path[-1] == '/':
path = path[:-1]
if path.endswith('.whl'):
try:
wheel = Wheel(path)
if is_compatible(wheel, self.wheel_tags):
if project_name is None:
include = True
else:
include = same_project(wheel.name, project_name)
if include:
result = {
'name': wheel.name,
'version': wheel.version,
'filename': wheel.filename,
'url': urlunparse((scheme, netloc, origpath,
params, query, '')),
'python-version': ', '.join(
['.'.join(list(v[2:])) for v in wheel.pyver]),
}
except Exception as e: # pragma: no cover
logger.warning('invalid path for wheel: %s', path)
elif path.endswith(self.downloadable_extensions):
path = filename = posixpath.basename(path)
for ext in self.downloadable_extensions:
if path.endswith(ext):
path = path[:-len(ext)]
t = self.split_filename(path, project_name)
if not t:
logger.debug('No match for project/version: %s', path)
else:
name, version, pyver = t
if not project_name or same_project(project_name, name):
result = {
'name': name,
'version': version,
'filename': filename,
'url': urlunparse((scheme, netloc, origpath,
params, query, '')),
#'packagetype': 'sdist',
}
if pyver:
result['python-version'] = pyver
break
if result and algo:
result['%s_digest' % algo] = digest
return result
def _get_digest(self, info):
"""
Get a digest from a dictionary by looking at keys of the form
'algo_digest'.
Returns a 2-tuple (algo, digest) if found, else None. Currently
looks only for SHA256, then MD5.
"""
result = None
for algo in ('sha256', 'md5'):
key = '%s_digest' % algo
if key in info:
result = (algo, info[key])
break
return result
def _update_version_data(self, result, info):
"""
Update a result dictionary (the final result from _get_project) with a
dictionary for a specific version, which typically holds information
gleaned from a filename or URL for an archive for the distribution.
"""
name = info.pop('name')
version = info.pop('version')
if version in result:
dist = result[version]
md = dist.metadata
else:
dist = make_dist(name, version, scheme=self.scheme)
md = dist.metadata
dist.digest = digest = self._get_digest(info)
url = info['url']
result['digests'][url] = digest
if md.source_url != info['url']:
md.source_url = self.prefer_url(md.source_url, url)
result['urls'].setdefault(version, set()).add(url)
dist.locator = self
result[version] = dist
def locate(self, requirement, prereleases=False):
"""
Find the most recent distribution which matches the given
requirement.
:param requirement: A requirement of the form 'foo (1.0)' or perhaps
'foo (>= 1.0, < 2.0, != 1.3)'
:param prereleases: If ``True``, allow pre-release versions
to be located. Otherwise, pre-release versions
are not returned.
:return: A :class:`Distribution` instance, or ``None`` if no such
distribution could be located.
"""
result = None
r = parse_requirement(requirement)
if r is None:
raise DistlibException('Not a valid requirement: %r' % requirement)
scheme = get_scheme(self.scheme)
self.matcher = matcher = scheme.matcher(r.requirement)
logger.debug('matcher: %s (%s)', matcher, type(matcher).__name__)
versions = self.get_project(r.name)
if len(versions) > 2: # urls and digests keys are present
# sometimes, versions are invalid
slist = []
vcls = matcher.version_class
for k in versions:
if k in ('urls', 'digests'):
continue
try:
if not matcher.match(k):
logger.debug('%s did not match %r', matcher, k)
else:
if prereleases or not vcls(k).is_prerelease:
slist.append(k)
else:
logger.debug('skipping pre-release '
'version %s of %s', k, matcher.name)
except Exception: # pragma: no cover
logger.warning('error matching %s with %r', matcher, k)
pass # slist.append(k)
if len(slist) > 1:
slist = sorted(slist, key=scheme.key)
if slist:
logger.debug('sorted list: %s', slist)
version = slist[-1]
result = versions[version]
if result:
if r.extras:
result.extras = r.extras
result.download_urls = versions.get('urls', {}).get(version, set())
d = {}
sd = versions.get('digests', {})
for url in result.download_urls:
if url in sd:
d[url] = sd[url]
result.digests = d
self.matcher = None
return result
class PyPIRPCLocator(Locator):
"""
This locator uses XML-RPC to locate distributions. It therefore
cannot be used with simple mirrors (that only mirror file content).
"""
def __init__(self, url, **kwargs):
"""
Initialise an instance.
:param url: The URL to use for XML-RPC.
:param kwargs: Passed to the superclass constructor.
"""
super(PyPIRPCLocator, self).__init__(**kwargs)
self.base_url = url
self.client = ServerProxy(url, timeout=3.0)
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
return set(self.client.list_packages())
def _get_project(self, name):
result = {'urls': {}, 'digests': {}}
versions = self.client.package_releases(name, True)
for v in versions:
urls = self.client.release_urls(name, v)
data = self.client.release_data(name, v)
metadata = Metadata(scheme=self.scheme)
metadata.name = data['name']
metadata.version = data['version']
metadata.license = data.get('license')
metadata.keywords = data.get('keywords', [])
metadata.summary = data.get('summary')
dist = Distribution(metadata)
if urls:
info = urls[0]
metadata.source_url = info['url']
dist.digest = self._get_digest(info)
dist.locator = self
result[v] = dist
for info in urls:
url = info['url']
digest = self._get_digest(info)
result['urls'].setdefault(v, set()).add(url)
result['digests'][url] = digest
return result
class PyPIJSONLocator(Locator):
"""
This locator uses PyPI's JSON interface. It's very limited in functionality
and probably not worth using.
"""
def __init__(self, url, **kwargs):
super(PyPIJSONLocator, self).__init__(**kwargs)
self.base_url = ensure_slash(url)
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
raise NotImplementedError('Not available from this locator')
def _get_project(self, name):
result = {'urls': {}, 'digests': {}}
url = urljoin(self.base_url, '%s/json' % quote(name))
try:
resp = self.opener.open(url)
data = resp.read().decode() # for now
d = json.loads(data)
md = Metadata(scheme=self.scheme)
data = d['info']
md.name = data['name']
md.version = data['version']
md.license = data.get('license')
md.keywords = data.get('keywords', [])
md.summary = data.get('summary')
dist = Distribution(md)
dist.locator = self
urls = d['urls']
result[md.version] = dist
for info in d['urls']:
url = info['url']
dist.download_urls.add(url)
dist.digests[url] = self._get_digest(info)
result['urls'].setdefault(md.version, set()).add(url)
result['digests'][url] = self._get_digest(info)
# Now get other releases
for version, infos in d['releases'].items():
if version == md.version:
continue # already done
omd = Metadata(scheme=self.scheme)
omd.name = md.name
omd.version = version
odist = Distribution(omd)
odist.locator = self
result[version] = odist
for info in infos:
url = info['url']
odist.download_urls.add(url)
odist.digests[url] = self._get_digest(info)
result['urls'].setdefault(version, set()).add(url)
result['digests'][url] = self._get_digest(info)
# for info in urls:
# md.source_url = info['url']
# dist.digest = self._get_digest(info)
# dist.locator = self
# for info in urls:
# url = info['url']
# result['urls'].setdefault(md.version, set()).add(url)
# result['digests'][url] = self._get_digest(info)
except Exception as e:
self.errors.put(text_type(e))
logger.exception('JSON fetch failed: %s', e)
return result
class Page(object):
"""
This class represents a scraped HTML page.
"""
# The following slightly hairy-looking regex just looks for the contents of
# an anchor link, which has an attribute "href" either immediately preceded
# or immediately followed by a "rel" attribute. The attribute values can be
# declared with double quotes, single quotes or no quotes - which leads to
# the length of the expression.
_href = re.compile("""
(rel\s*=\s*(?:"(?P<rel1>[^"]*)"|'(?P<rel2>[^']*)'|(?P<rel3>[^>\s\n]*))\s+)?
href\s*=\s*(?:"(?P<url1>[^"]*)"|'(?P<url2>[^']*)'|(?P<url3>[^>\s\n]*))
(\s+rel\s*=\s*(?:"(?P<rel4>[^"]*)"|'(?P<rel5>[^']*)'|(?P<rel6>[^>\s\n]*)))?
""", re.I | re.S | re.X)
_base = re.compile(r"""<base\s+href\s*=\s*['"]?([^'">]+)""", re.I | re.S)
def __init__(self, data, url):
"""
Initialise an instance with the Unicode page contents and the URL they
came from.
"""
self.data = data
self.base_url = self.url = url
m = self._base.search(self.data)
if m:
self.base_url = m.group(1)
_clean_re = re.compile(r'[^a-z0-9$&+,/:;=?@.#%_\\|-]', re.I)
@cached_property
def links(self):
"""
Return the URLs of all the links on a page together with information
about their "rel" attribute, for determining which ones to treat as
downloads and which ones to queue for further scraping.
"""
def clean(url):
"Tidy up an URL."
scheme, netloc, path, params, query, frag = urlparse(url)
return urlunparse((scheme, netloc, quote(path),
params, query, frag))
result = set()
for match in self._href.finditer(self.data):
d = match.groupdict('')
rel = (d['rel1'] or d['rel2'] or d['rel3'] or
d['rel4'] or d['rel5'] or d['rel6'])
url = d['url1'] or d['url2'] or d['url3']
url = urljoin(self.base_url, url)
url = unescape(url)
url = self._clean_re.sub(lambda m: '%%%2x' % ord(m.group(0)), url)
result.add((url, rel))
# We sort the result, hoping to bring the most recent versions
# to the front
result = sorted(result, key=lambda t: t[0], reverse=True)
return result
class SimpleScrapingLocator(Locator):
"""
A locator which scrapes HTML pages to locate downloads for a distribution.
This runs multiple threads to do the I/O; performance is at least as good
as pip's PackageFinder, which works in an analogous fashion.
"""
# These are used to deal with various Content-Encoding schemes.
decoders = {
'deflate': zlib.decompress,
'gzip': lambda b: gzip.GzipFile(fileobj=BytesIO(d)).read(),
'none': lambda b: b,
}
def __init__(self, url, timeout=None, num_workers=10, **kwargs):
"""
Initialise an instance.
:param url: The root URL to use for scraping.
:param timeout: The timeout, in seconds, to be applied to requests.
This defaults to ``None`` (no timeout specified).
:param num_workers: The number of worker threads you want to do I/O,
This defaults to 10.
:param kwargs: Passed to the superclass.
"""
super(SimpleScrapingLocator, self).__init__(**kwargs)
self.base_url = ensure_slash(url)
self.timeout = timeout
self._page_cache = {}
self._seen = set()
self._to_fetch = queue.Queue()
self._bad_hosts = set()
self.skip_externals = False
self.num_workers = num_workers
self._lock = threading.RLock()
# See issue #45: we need to be resilient when the locator is used
# in a thread, e.g. with concurrent.futures. We can't use self._lock
# as it is for coordinating our internal threads - the ones created
# in _prepare_threads.
self._gplock = threading.RLock()
def _prepare_threads(self):
"""
Threads are created only when get_project is called, and terminate
before it returns. They are there primarily to parallelise I/O (i.e.
fetching web pages).
"""
self._threads = []
for i in range(self.num_workers):
t = threading.Thread(target=self._fetch)
t.setDaemon(True)
t.start()
self._threads.append(t)
def _wait_threads(self):
"""
Tell all the threads to terminate (by sending a sentinel value) and
wait for them to do so.
"""
# Note that you need two loops, since you can't say which
# thread will get each sentinel
for t in self._threads:
self._to_fetch.put(None) # sentinel
for t in self._threads:
t.join()
self._threads = []
def _get_project(self, name):
result = {'urls': {}, 'digests': {}}
with self._gplock:
self.result = result
self.project_name = name
url = urljoin(self.base_url, '%s/' % quote(name))
self._seen.clear()
self._page_cache.clear()
self._prepare_threads()
try:
logger.debug('Queueing %s', url)
self._to_fetch.put(url)
self._to_fetch.join()
finally:
self._wait_threads()
del self.result
return result
platform_dependent = re.compile(r'\b(linux-(i\d86|x86_64|arm\w+)|'
r'win(32|-amd64)|macosx-?\d+)\b', re.I)
def _is_platform_dependent(self, url):
"""
Does an URL refer to a platform-specific download?
"""
return self.platform_dependent.search(url)
def _process_download(self, url):
"""
See if an URL is a suitable download for a project.
If it is, register information in the result dictionary (for
_get_project) about the specific version it's for.
Note that the return value isn't actually used other than as a boolean
value.
"""
if self._is_platform_dependent(url):
info = None
else:
info = self.convert_url_to_download_info(url, self.project_name)
logger.debug('process_download: %s -> %s', url, info)
if info:
with self._lock: # needed because self.result is shared
self._update_version_data(self.result, info)
return info
def _should_queue(self, link, referrer, rel):
"""
Determine whether a link URL from a referring page and with a
particular "rel" attribute should be queued for scraping.
"""
scheme, netloc, path, _, _, _ = urlparse(link)
if path.endswith(self.source_extensions + self.binary_extensions +
self.excluded_extensions):
result = False
elif self.skip_externals and not link.startswith(self.base_url):
result = False
elif not referrer.startswith(self.base_url):
result = False
elif rel not in ('homepage', 'download'):
result = False
elif scheme not in ('http', 'https', 'ftp'):
result = False
elif self._is_platform_dependent(link):
result = False
else:
host = netloc.split(':', 1)[0]
if host.lower() == 'localhost':
result = False
else:
result = True
logger.debug('should_queue: %s (%s) from %s -> %s', link, rel,
referrer, result)
return result
def _fetch(self):
"""
Get a URL to fetch from the work queue, get the HTML page, examine its
links for download candidates and candidates for further scraping.
This is a handy method to run in a thread.
"""
while True:
url = self._to_fetch.get()
try:
if url:
page = self.get_page(url)
if page is None: # e.g. after an error
continue
for link, rel in page.links:
if link not in self._seen:
self._seen.add(link)
if (not self._process_download(link) and
self._should_queue(link, url, rel)):
logger.debug('Queueing %s from %s', link, url)
self._to_fetch.put(link)
except Exception as e: # pragma: no cover
self.errors.put(text_type(e))
finally:
# always do this, to avoid hangs :-)
self._to_fetch.task_done()
if not url:
#logger.debug('Sentinel seen, quitting.')
break
def get_page(self, url):
"""
Get the HTML for an URL, possibly from an in-memory cache.
XXX TODO Note: this cache is never actually cleared. It's assumed that
the data won't get stale over the lifetime of a locator instance (not
necessarily true for the default_locator).
"""
# http://peak.telecommunity.com/DevCenter/EasyInstall#package-index-api
scheme, netloc, path, _, _, _ = urlparse(url)
if scheme == 'file' and os.path.isdir(url2pathname(path)):
url = urljoin(ensure_slash(url), 'index.html')
if url in self._page_cache:
result = self._page_cache[url]
logger.debug('Returning %s from cache: %s', url, result)
else:
host = netloc.split(':', 1)[0]
result = None
if host in self._bad_hosts:
logger.debug('Skipping %s due to bad host %s', url, host)
else:
req = Request(url, headers={'Accept-encoding': 'identity'})
try:
logger.debug('Fetching %s', url)
resp = self.opener.open(req, timeout=self.timeout)
logger.debug('Fetched %s', url)
headers = resp.info()
content_type = headers.get('Content-Type', '')
if HTML_CONTENT_TYPE.match(content_type):
final_url = resp.geturl()
data = resp.read()
encoding = headers.get('Content-Encoding')
if encoding:
decoder = self.decoders[encoding] # fail if not found
data = decoder(data)
encoding = 'utf-8'
m = CHARSET.search(content_type)
if m:
encoding = m.group(1)
try:
data = data.decode(encoding)
except UnicodeError: # pragma: no cover
data = data.decode('latin-1') # fallback
result = Page(data, final_url)
self._page_cache[final_url] = result
except HTTPError as e:
if e.code != 404:
logger.exception('Fetch failed: %s: %s', url, e)
except URLError as e: # pragma: no cover
logger.exception('Fetch failed: %s: %s', url, e)
with self._lock:
self._bad_hosts.add(host)
except Exception as e: # pragma: no cover
logger.exception('Fetch failed: %s: %s', url, e)
finally:
self._page_cache[url] = result # even if None (failure)
return result
_distname_re = re.compile('<a href=[^>]*>([^<]+)<')
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
result = set()
page = self.get_page(self.base_url)
if not page:
raise DistlibException('Unable to get %s' % self.base_url)
for match in self._distname_re.finditer(page.data):
result.add(match.group(1))
return result
class DirectoryLocator(Locator):
"""
This class locates distributions in a directory tree.
"""
def __init__(self, path, **kwargs):
"""
Initialise an instance.
:param path: The root of the directory tree to search.
:param kwargs: Passed to the superclass constructor,
except for:
* recursive - if True (the default), subdirectories are
recursed into. If False, only the top-level directory
is searched,
"""
self.recursive = kwargs.pop('recursive', True)
super(DirectoryLocator, self).__init__(**kwargs)
path = os.path.abspath(path)
if not os.path.isdir(path): # pragma: no cover
raise DistlibException('Not a directory: %r' % path)
self.base_dir = path
def should_include(self, filename, parent):
"""
Should a filename be considered as a candidate for a distribution
archive? As well as the filename, the directory which contains it
is provided, though not used by the current implementation.
"""
return filename.endswith(self.downloadable_extensions)
def _get_project(self, name):
result = {'urls': {}, 'digests': {}}
for root, dirs, files in os.walk(self.base_dir):
for fn in files:
if self.should_include(fn, root):
fn = os.path.join(root, fn)
url = urlunparse(('file', '',
pathname2url(os.path.abspath(fn)),
'', '', ''))
info = self.convert_url_to_download_info(url, name)
if info:
self._update_version_data(result, info)
if not self.recursive:
break
return result
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
result = set()
for root, dirs, files in os.walk(self.base_dir):
for fn in files:
if self.should_include(fn, root):
fn = os.path.join(root, fn)
url = urlunparse(('file', '',
pathname2url(os.path.abspath(fn)),
'', '', ''))
info = self.convert_url_to_download_info(url, None)
if info:
result.add(info['name'])
if not self.recursive:
break
return result
class JSONLocator(Locator):
"""
This locator uses special extended metadata (not available on PyPI) and is
the basis of performant dependency resolution in distlib. Other locators
require archive downloads before dependencies can be determined! As you
might imagine, that can be slow.
"""
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
raise NotImplementedError('Not available from this locator')
def _get_project(self, name):
result = {'urls': {}, 'digests': {}}
data = get_project_data(name)
if data:
for info in data.get('files', []):
if info['ptype'] != 'sdist' or info['pyversion'] != 'source':
continue
# We don't store summary in project metadata as it makes
# the data bigger for no benefit during dependency
# resolution
dist = make_dist(data['name'], info['version'],
summary=data.get('summary',
'Placeholder for summary'),
scheme=self.scheme)
md = dist.metadata
md.source_url = info['url']
# TODO SHA256 digest
if 'digest' in info and info['digest']:
dist.digest = ('md5', info['digest'])
md.dependencies = info.get('requirements', {})
dist.exports = info.get('exports', {})
result[dist.version] = dist
result['urls'].setdefault(dist.version, set()).add(info['url'])
return result
class DistPathLocator(Locator):
"""
This locator finds installed distributions in a path. It can be useful for
adding to an :class:`AggregatingLocator`.
"""
def __init__(self, distpath, **kwargs):
"""
Initialise an instance.
:param distpath: A :class:`DistributionPath` instance to search.
"""
super(DistPathLocator, self).__init__(**kwargs)
assert isinstance(distpath, DistributionPath)
self.distpath = distpath
def _get_project(self, name):
dist = self.distpath.get_distribution(name)
if dist is None:
result = {'urls': {}, 'digests': {}}
else:
result = {
dist.version: dist,
'urls': {dist.version: set([dist.source_url])},
'digests': {dist.version: set([None])}
}
return result
class AggregatingLocator(Locator):
"""
This class allows you to chain and/or merge a list of locators.
"""
def __init__(self, *locators, **kwargs):
"""
Initialise an instance.
:param locators: The list of locators to search.
:param kwargs: Passed to the superclass constructor,
except for:
* merge - if False (the default), the first successful
search from any of the locators is returned. If True,
the results from all locators are merged (this can be
slow).
"""
self.merge = kwargs.pop('merge', False)
self.locators = locators
super(AggregatingLocator, self).__init__(**kwargs)
def clear_cache(self):
super(AggregatingLocator, self).clear_cache()
for locator in self.locators:
locator.clear_cache()
def _set_scheme(self, value):
self._scheme = value
for locator in self.locators:
locator.scheme = value
scheme = property(Locator.scheme.fget, _set_scheme)
def _get_project(self, name):
result = {}
for locator in self.locators:
d = locator.get_project(name)
if d:
if self.merge:
files = result.get('urls', {})
digests = result.get('digests', {})
# next line could overwrite result['urls'], result['digests']
result.update(d)
df = result.get('urls')
if files and df:
for k, v in files.items():
if k in df:
df[k] |= v
else:
df[k] = v
dd = result.get('digests')
if digests and dd:
dd.update(digests)
else:
# See issue #18. If any dists are found and we're looking
# for specific constraints, we only return something if
# a match is found. For example, if a DirectoryLocator
# returns just foo (1.0) while we're looking for
# foo (>= 2.0), we'll pretend there was nothing there so
# that subsequent locators can be queried. Otherwise we
# would just return foo (1.0) which would then lead to a
# failure to find foo (>= 2.0), because other locators
# weren't searched. Note that this only matters when
# merge=False.
if self.matcher is None:
found = True
else:
found = False
for k in d:
if self.matcher.match(k):
found = True
break
if found:
result = d
break
return result
def get_distribution_names(self):
"""
Return all the distribution names known to this locator.
"""
result = set()
for locator in self.locators:
try:
result |= locator.get_distribution_names()
except NotImplementedError:
pass
return result
# We use a legacy scheme simply because most of the dists on PyPI use legacy
# versions which don't conform to PEP 426 / PEP 440.
default_locator = AggregatingLocator(
JSONLocator(),
SimpleScrapingLocator('https://pypi.python.org/simple/',
timeout=3.0),
scheme='legacy')
locate = default_locator.locate
NAME_VERSION_RE = re.compile(r'(?P<name>[\w-]+)\s*'
r'\(\s*(==\s*)?(?P<ver>[^)]+)\)$')
class DependencyFinder(object):
"""
Locate dependencies for distributions.
"""
def __init__(self, locator=None):
"""
Initialise an instance, using the specified locator
to locate distributions.
"""
self.locator = locator or default_locator
self.scheme = get_scheme(self.locator.scheme)
def add_distribution(self, dist):
"""
Add a distribution to the finder. This will update internal information
about who provides what.
:param dist: The distribution to add.
"""
logger.debug('adding distribution %s', dist)
name = dist.key
self.dists_by_name[name] = dist
self.dists[(name, dist.version)] = dist
for p in dist.provides:
name, version = parse_name_and_version(p)
logger.debug('Add to provided: %s, %s, %s', name, version, dist)
self.provided.setdefault(name, set()).add((version, dist))
def remove_distribution(self, dist):
"""
Remove a distribution from the finder. This will update internal
information about who provides what.
:param dist: The distribution to remove.
"""
logger.debug('removing distribution %s', dist)
name = dist.key
del self.dists_by_name[name]
del self.dists[(name, dist.version)]
for p in dist.provides:
name, version = parse_name_and_version(p)
logger.debug('Remove from provided: %s, %s, %s', name, version, dist)
s = self.provided[name]
s.remove((version, dist))
if not s:
del self.provided[name]
def get_matcher(self, reqt):
"""
Get a version matcher for a requirement.
:param reqt: The requirement
:type reqt: str
:return: A version matcher (an instance of
:class:`distlib.version.Matcher`).
"""
try:
matcher = self.scheme.matcher(reqt)
except UnsupportedVersionError: # pragma: no cover
# XXX compat-mode if cannot read the version
name = reqt.split()[0]
matcher = self.scheme.matcher(name)
return matcher
def find_providers(self, reqt):
"""
Find the distributions which can fulfill a requirement.
:param reqt: The requirement.
:type reqt: str
:return: A set of distribution which can fulfill the requirement.
"""
matcher = self.get_matcher(reqt)
name = matcher.key # case-insensitive
result = set()
provided = self.provided
if name in provided:
for version, provider in provided[name]:
try:
match = matcher.match(version)
except UnsupportedVersionError:
match = False
if match:
result.add(provider)
break
return result
def try_to_replace(self, provider, other, problems):
"""
Attempt to replace one provider with another. This is typically used
when resolving dependencies from multiple sources, e.g. A requires
(B >= 1.0) while C requires (B >= 1.1).
For successful replacement, ``provider`` must meet all the requirements
which ``other`` fulfills.
:param provider: The provider we are trying to replace with.
:param other: The provider we're trying to replace.
:param problems: If False is returned, this will contain what
problems prevented replacement. This is currently
a tuple of the literal string 'cantreplace',
``provider``, ``other`` and the set of requirements
that ``provider`` couldn't fulfill.
:return: True if we can replace ``other`` with ``provider``, else
False.
"""
rlist = self.reqts[other]
unmatched = set()
for s in rlist:
matcher = self.get_matcher(s)
if not matcher.match(provider.version):
unmatched.add(s)
if unmatched:
# can't replace other with provider
problems.add(('cantreplace', provider, other,
frozenset(unmatched)))
result = False
else:
# can replace other with provider
self.remove_distribution(other)
del self.reqts[other]
for s in rlist:
self.reqts.setdefault(provider, set()).add(s)
self.add_distribution(provider)
result = True
return result
def find(self, requirement, meta_extras=None, prereleases=False):
"""
Find a distribution and all distributions it depends on.
:param requirement: The requirement specifying the distribution to
find, or a Distribution instance.
:param meta_extras: A list of meta extras such as :test:, :build: and
so on.
:param prereleases: If ``True``, allow pre-release versions to be
returned - otherwise, don't return prereleases
unless they're all that's available.
Return a set of :class:`Distribution` instances and a set of
problems.
The distributions returned should be such that they have the
:attr:`required` attribute set to ``True`` if they were
from the ``requirement`` passed to ``find()``, and they have the
:attr:`build_time_dependency` attribute set to ``True`` unless they
are post-installation dependencies of the ``requirement``.
The problems should be a tuple consisting of the string
``'unsatisfied'`` and the requirement which couldn't be satisfied
by any distribution known to the locator.
"""
self.provided = {}
self.dists = {}
self.dists_by_name = {}
self.reqts = {}
meta_extras = set(meta_extras or [])
if ':*:' in meta_extras:
meta_extras.remove(':*:')
# :meta: and :run: are implicitly included
meta_extras |= set([':test:', ':build:', ':dev:'])
if isinstance(requirement, Distribution):
dist = odist = requirement
logger.debug('passed %s as requirement', odist)
else:
dist = odist = self.locator.locate(requirement,
prereleases=prereleases)
if dist is None:
raise DistlibException('Unable to locate %r' % requirement)
logger.debug('located %s', odist)
dist.requested = True
problems = set()
todo = set([dist])
install_dists = set([odist])
while todo:
dist = todo.pop()
name = dist.key # case-insensitive
if name not in self.dists_by_name:
self.add_distribution(dist)
else:
#import pdb; pdb.set_trace()
other = self.dists_by_name[name]
if other != dist:
self.try_to_replace(dist, other, problems)
ireqts = dist.run_requires | dist.meta_requires
sreqts = dist.build_requires
ereqts = set()
if dist in install_dists:
for key in ('test', 'build', 'dev'):
e = ':%s:' % key
if e in meta_extras:
ereqts |= getattr(dist, '%s_requires' % key)
all_reqts = ireqts | sreqts | ereqts
for r in all_reqts:
providers = self.find_providers(r)
if not providers:
logger.debug('No providers found for %r', r)
provider = self.locator.locate(r, prereleases=prereleases)
# If no provider is found and we didn't consider
# prereleases, consider them now.
if provider is None and not prereleases:
provider = self.locator.locate(r, prereleases=True)
if provider is None:
logger.debug('Cannot satisfy %r', r)
problems.add(('unsatisfied', r))
else:
n, v = provider.key, provider.version
if (n, v) not in self.dists:
todo.add(provider)
providers.add(provider)
if r in ireqts and dist in install_dists:
install_dists.add(provider)
logger.debug('Adding %s to install_dists',
provider.name_and_version)
for p in providers:
name = p.key
if name not in self.dists_by_name:
self.reqts.setdefault(p, set()).add(r)
else:
other = self.dists_by_name[name]
if other != p:
# see if other can be replaced by p
self.try_to_replace(p, other, problems)
dists = set(self.dists.values())
for dist in dists:
dist.build_time_dependency = dist not in install_dists
if dist.build_time_dependency:
logger.debug('%s is a build-time dependency only.',
dist.name_and_version)
logger.debug('find done for %s', odist)
return dists, problems
pip/_vendor/distlib/wheel.py 0000644 00000114313 14751155150 0012107 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2013-2016 Vinay Sajip.
# Licensed to the Python Software Foundation under a contributor agreement.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
from __future__ import unicode_literals
import base64
import codecs
import datetime
import distutils.util
from email import message_from_file
import hashlib
import imp
import json
import logging
import os
import posixpath
import re
import shutil
import sys
import tempfile
import zipfile
from . import __version__, DistlibException
from .compat import sysconfig, ZipFile, fsdecode, text_type, filter
from .database import InstalledDistribution
from .metadata import Metadata, METADATA_FILENAME
from .util import (FileOperator, convert_path, CSVReader, CSVWriter, Cache,
cached_property, get_cache_base, read_exports, tempdir)
from .version import NormalizedVersion, UnsupportedVersionError
logger = logging.getLogger(__name__)
cache = None # created when needed
if hasattr(sys, 'pypy_version_info'):
IMP_PREFIX = 'pp'
elif sys.platform.startswith('java'):
IMP_PREFIX = 'jy'
elif sys.platform == 'cli':
IMP_PREFIX = 'ip'
else:
IMP_PREFIX = 'cp'
VER_SUFFIX = sysconfig.get_config_var('py_version_nodot')
if not VER_SUFFIX: # pragma: no cover
VER_SUFFIX = '%s%s' % sys.version_info[:2]
PYVER = 'py' + VER_SUFFIX
IMPVER = IMP_PREFIX + VER_SUFFIX
ARCH = distutils.util.get_platform().replace('-', '_').replace('.', '_')
ABI = sysconfig.get_config_var('SOABI')
if ABI and ABI.startswith('cpython-'):
ABI = ABI.replace('cpython-', 'cp')
else:
def _derive_abi():
parts = ['cp', VER_SUFFIX]
if sysconfig.get_config_var('Py_DEBUG'):
parts.append('d')
if sysconfig.get_config_var('WITH_PYMALLOC'):
parts.append('m')
if sysconfig.get_config_var('Py_UNICODE_SIZE') == 4:
parts.append('u')
return ''.join(parts)
ABI = _derive_abi()
del _derive_abi
FILENAME_RE = re.compile(r'''
(?P<nm>[^-]+)
-(?P<vn>\d+[^-]*)
(-(?P<bn>\d+[^-]*))?
-(?P<py>\w+\d+(\.\w+\d+)*)
-(?P<bi>\w+)
-(?P<ar>\w+(\.\w+)*)
\.whl$
''', re.IGNORECASE | re.VERBOSE)
NAME_VERSION_RE = re.compile(r'''
(?P<nm>[^-]+)
-(?P<vn>\d+[^-]*)
(-(?P<bn>\d+[^-]*))?$
''', re.IGNORECASE | re.VERBOSE)
SHEBANG_RE = re.compile(br'\s*#![^\r\n]*')
SHEBANG_DETAIL_RE = re.compile(br'^(\s*#!("[^"]+"|\S+))\s+(.*)$')
SHEBANG_PYTHON = b'#!python'
SHEBANG_PYTHONW = b'#!pythonw'
if os.sep == '/':
to_posix = lambda o: o
else:
to_posix = lambda o: o.replace(os.sep, '/')
class Mounter(object):
def __init__(self):
self.impure_wheels = {}
self.libs = {}
def add(self, pathname, extensions):
self.impure_wheels[pathname] = extensions
self.libs.update(extensions)
def remove(self, pathname):
extensions = self.impure_wheels.pop(pathname)
for k, v in extensions:
if k in self.libs:
del self.libs[k]
def find_module(self, fullname, path=None):
if fullname in self.libs:
result = self
else:
result = None
return result
def load_module(self, fullname):
if fullname in sys.modules:
result = sys.modules[fullname]
else:
if fullname not in self.libs:
raise ImportError('unable to find extension for %s' % fullname)
result = imp.load_dynamic(fullname, self.libs[fullname])
result.__loader__ = self
parts = fullname.rsplit('.', 1)
if len(parts) > 1:
result.__package__ = parts[0]
return result
_hook = Mounter()
class Wheel(object):
"""
Class to build and install from Wheel files (PEP 427).
"""
wheel_version = (1, 1)
hash_kind = 'sha256'
def __init__(self, filename=None, sign=False, verify=False):
"""
Initialise an instance using a (valid) filename.
"""
self.sign = sign
self.should_verify = verify
self.buildver = ''
self.pyver = [PYVER]
self.abi = ['none']
self.arch = ['any']
self.dirname = os.getcwd()
if filename is None:
self.name = 'dummy'
self.version = '0.1'
self._filename = self.filename
else:
m = NAME_VERSION_RE.match(filename)
if m:
info = m.groupdict('')
self.name = info['nm']
# Reinstate the local version separator
self.version = info['vn'].replace('_', '-')
self.buildver = info['bn']
self._filename = self.filename
else:
dirname, filename = os.path.split(filename)
m = FILENAME_RE.match(filename)
if not m:
raise DistlibException('Invalid name or '
'filename: %r' % filename)
if dirname:
self.dirname = os.path.abspath(dirname)
self._filename = filename
info = m.groupdict('')
self.name = info['nm']
self.version = info['vn']
self.buildver = info['bn']
self.pyver = info['py'].split('.')
self.abi = info['bi'].split('.')
self.arch = info['ar'].split('.')
@property
def filename(self):
"""
Build and return a filename from the various components.
"""
if self.buildver:
buildver = '-' + self.buildver
else:
buildver = ''
pyver = '.'.join(self.pyver)
abi = '.'.join(self.abi)
arch = '.'.join(self.arch)
# replace - with _ as a local version separator
version = self.version.replace('-', '_')
return '%s-%s%s-%s-%s-%s.whl' % (self.name, version, buildver,
pyver, abi, arch)
@property
def exists(self):
path = os.path.join(self.dirname, self.filename)
return os.path.isfile(path)
@property
def tags(self):
for pyver in self.pyver:
for abi in self.abi:
for arch in self.arch:
yield pyver, abi, arch
@cached_property
def metadata(self):
pathname = os.path.join(self.dirname, self.filename)
name_ver = '%s-%s' % (self.name, self.version)
info_dir = '%s.dist-info' % name_ver
wrapper = codecs.getreader('utf-8')
with ZipFile(pathname, 'r') as zf:
wheel_metadata = self.get_wheel_metadata(zf)
wv = wheel_metadata['Wheel-Version'].split('.', 1)
file_version = tuple([int(i) for i in wv])
if file_version < (1, 1):
fn = 'METADATA'
else:
fn = METADATA_FILENAME
try:
metadata_filename = posixpath.join(info_dir, fn)
with zf.open(metadata_filename) as bf:
wf = wrapper(bf)
result = Metadata(fileobj=wf)
except KeyError:
raise ValueError('Invalid wheel, because %s is '
'missing' % fn)
return result
def get_wheel_metadata(self, zf):
name_ver = '%s-%s' % (self.name, self.version)
info_dir = '%s.dist-info' % name_ver
metadata_filename = posixpath.join(info_dir, 'WHEEL')
with zf.open(metadata_filename) as bf:
wf = codecs.getreader('utf-8')(bf)
message = message_from_file(wf)
return dict(message)
@cached_property
def info(self):
pathname = os.path.join(self.dirname, self.filename)
with ZipFile(pathname, 'r') as zf:
result = self.get_wheel_metadata(zf)
return result
def process_shebang(self, data):
m = SHEBANG_RE.match(data)
if m:
end = m.end()
shebang, data_after_shebang = data[:end], data[end:]
# Preserve any arguments after the interpreter
if b'pythonw' in shebang.lower():
shebang_python = SHEBANG_PYTHONW
else:
shebang_python = SHEBANG_PYTHON
m = SHEBANG_DETAIL_RE.match(shebang)
if m:
args = b' ' + m.groups()[-1]
else:
args = b''
shebang = shebang_python + args
data = shebang + data_after_shebang
else:
cr = data.find(b'\r')
lf = data.find(b'\n')
if cr < 0 or cr > lf:
term = b'\n'
else:
if data[cr:cr + 2] == b'\r\n':
term = b'\r\n'
else:
term = b'\r'
data = SHEBANG_PYTHON + term + data
return data
def get_hash(self, data, hash_kind=None):
if hash_kind is None:
hash_kind = self.hash_kind
try:
hasher = getattr(hashlib, hash_kind)
except AttributeError:
raise DistlibException('Unsupported hash algorithm: %r' % hash_kind)
result = hasher(data).digest()
result = base64.urlsafe_b64encode(result).rstrip(b'=').decode('ascii')
return hash_kind, result
def write_record(self, records, record_path, base):
records = list(records) # make a copy for sorting
p = to_posix(os.path.relpath(record_path, base))
records.append((p, '', ''))
records.sort()
with CSVWriter(record_path) as writer:
for row in records:
writer.writerow(row)
def write_records(self, info, libdir, archive_paths):
records = []
distinfo, info_dir = info
hasher = getattr(hashlib, self.hash_kind)
for ap, p in archive_paths:
with open(p, 'rb') as f:
data = f.read()
digest = '%s=%s' % self.get_hash(data)
size = os.path.getsize(p)
records.append((ap, digest, size))
p = os.path.join(distinfo, 'RECORD')
self.write_record(records, p, libdir)
ap = to_posix(os.path.join(info_dir, 'RECORD'))
archive_paths.append((ap, p))
def build_zip(self, pathname, archive_paths):
with ZipFile(pathname, 'w', zipfile.ZIP_DEFLATED) as zf:
for ap, p in archive_paths:
logger.debug('Wrote %s to %s in wheel', p, ap)
zf.write(p, ap)
def build(self, paths, tags=None, wheel_version=None):
"""
Build a wheel from files in specified paths, and use any specified tags
when determining the name of the wheel.
"""
if tags is None:
tags = {}
libkey = list(filter(lambda o: o in paths, ('purelib', 'platlib')))[0]
if libkey == 'platlib':
is_pure = 'false'
default_pyver = [IMPVER]
default_abi = [ABI]
default_arch = [ARCH]
else:
is_pure = 'true'
default_pyver = [PYVER]
default_abi = ['none']
default_arch = ['any']
self.pyver = tags.get('pyver', default_pyver)
self.abi = tags.get('abi', default_abi)
self.arch = tags.get('arch', default_arch)
libdir = paths[libkey]
name_ver = '%s-%s' % (self.name, self.version)
data_dir = '%s.data' % name_ver
info_dir = '%s.dist-info' % name_ver
archive_paths = []
# First, stuff which is not in site-packages
for key in ('data', 'headers', 'scripts'):
if key not in paths:
continue
path = paths[key]
if os.path.isdir(path):
for root, dirs, files in os.walk(path):
for fn in files:
p = fsdecode(os.path.join(root, fn))
rp = os.path.relpath(p, path)
ap = to_posix(os.path.join(data_dir, key, rp))
archive_paths.append((ap, p))
if key == 'scripts' and not p.endswith('.exe'):
with open(p, 'rb') as f:
data = f.read()
data = self.process_shebang(data)
with open(p, 'wb') as f:
f.write(data)
# Now, stuff which is in site-packages, other than the
# distinfo stuff.
path = libdir
distinfo = None
for root, dirs, files in os.walk(path):
if root == path:
# At the top level only, save distinfo for later
# and skip it for now
for i, dn in enumerate(dirs):
dn = fsdecode(dn)
if dn.endswith('.dist-info'):
distinfo = os.path.join(root, dn)
del dirs[i]
break
assert distinfo, '.dist-info directory expected, not found'
for fn in files:
# comment out next suite to leave .pyc files in
if fsdecode(fn).endswith(('.pyc', '.pyo')):
continue
p = os.path.join(root, fn)
rp = to_posix(os.path.relpath(p, path))
archive_paths.append((rp, p))
# Now distinfo. Assumed to be flat, i.e. os.listdir is enough.
files = os.listdir(distinfo)
for fn in files:
if fn not in ('RECORD', 'INSTALLER', 'SHARED', 'WHEEL'):
p = fsdecode(os.path.join(distinfo, fn))
ap = to_posix(os.path.join(info_dir, fn))
archive_paths.append((ap, p))
wheel_metadata = [
'Wheel-Version: %d.%d' % (wheel_version or self.wheel_version),
'Generator: distlib %s' % __version__,
'Root-Is-Purelib: %s' % is_pure,
]
for pyver, abi, arch in self.tags:
wheel_metadata.append('Tag: %s-%s-%s' % (pyver, abi, arch))
p = os.path.join(distinfo, 'WHEEL')
with open(p, 'w') as f:
f.write('\n'.join(wheel_metadata))
ap = to_posix(os.path.join(info_dir, 'WHEEL'))
archive_paths.append((ap, p))
# Now, at last, RECORD.
# Paths in here are archive paths - nothing else makes sense.
self.write_records((distinfo, info_dir), libdir, archive_paths)
# Now, ready to build the zip file
pathname = os.path.join(self.dirname, self.filename)
self.build_zip(pathname, archive_paths)
return pathname
def install(self, paths, maker, **kwargs):
"""
Install a wheel to the specified paths. If kwarg ``warner`` is
specified, it should be a callable, which will be called with two
tuples indicating the wheel version of this software and the wheel
version in the file, if there is a discrepancy in the versions.
This can be used to issue any warnings to raise any exceptions.
If kwarg ``lib_only`` is True, only the purelib/platlib files are
installed, and the headers, scripts, data and dist-info metadata are
not written.
The return value is a :class:`InstalledDistribution` instance unless
``options.lib_only`` is True, in which case the return value is ``None``.
"""
dry_run = maker.dry_run
warner = kwargs.get('warner')
lib_only = kwargs.get('lib_only', False)
pathname = os.path.join(self.dirname, self.filename)
name_ver = '%s-%s' % (self.name, self.version)
data_dir = '%s.data' % name_ver
info_dir = '%s.dist-info' % name_ver
metadata_name = posixpath.join(info_dir, METADATA_FILENAME)
wheel_metadata_name = posixpath.join(info_dir, 'WHEEL')
record_name = posixpath.join(info_dir, 'RECORD')
wrapper = codecs.getreader('utf-8')
with ZipFile(pathname, 'r') as zf:
with zf.open(wheel_metadata_name) as bwf:
wf = wrapper(bwf)
message = message_from_file(wf)
wv = message['Wheel-Version'].split('.', 1)
file_version = tuple([int(i) for i in wv])
if (file_version != self.wheel_version) and warner:
warner(self.wheel_version, file_version)
if message['Root-Is-Purelib'] == 'true':
libdir = paths['purelib']
else:
libdir = paths['platlib']
records = {}
with zf.open(record_name) as bf:
with CSVReader(stream=bf) as reader:
for row in reader:
p = row[0]
records[p] = row
data_pfx = posixpath.join(data_dir, '')
info_pfx = posixpath.join(info_dir, '')
script_pfx = posixpath.join(data_dir, 'scripts', '')
# make a new instance rather than a copy of maker's,
# as we mutate it
fileop = FileOperator(dry_run=dry_run)
fileop.record = True # so we can rollback if needed
bc = not sys.dont_write_bytecode # Double negatives. Lovely!
outfiles = [] # for RECORD writing
# for script copying/shebang processing
workdir = tempfile.mkdtemp()
# set target dir later
# we default add_launchers to False, as the
# Python Launcher should be used instead
maker.source_dir = workdir
maker.target_dir = None
try:
for zinfo in zf.infolist():
arcname = zinfo.filename
if isinstance(arcname, text_type):
u_arcname = arcname
else:
u_arcname = arcname.decode('utf-8')
# The signature file won't be in RECORD,
# and we don't currently don't do anything with it
if u_arcname.endswith('/RECORD.jws'):
continue
row = records[u_arcname]
if row[2] and str(zinfo.file_size) != row[2]:
raise DistlibException('size mismatch for '
'%s' % u_arcname)
if row[1]:
kind, value = row[1].split('=', 1)
with zf.open(arcname) as bf:
data = bf.read()
_, digest = self.get_hash(data, kind)
if digest != value:
raise DistlibException('digest mismatch for '
'%s' % arcname)
if lib_only and u_arcname.startswith((info_pfx, data_pfx)):
logger.debug('lib_only: skipping %s', u_arcname)
continue
is_script = (u_arcname.startswith(script_pfx)
and not u_arcname.endswith('.exe'))
if u_arcname.startswith(data_pfx):
_, where, rp = u_arcname.split('/', 2)
outfile = os.path.join(paths[where], convert_path(rp))
else:
# meant for site-packages.
if u_arcname in (wheel_metadata_name, record_name):
continue
outfile = os.path.join(libdir, convert_path(u_arcname))
if not is_script:
with zf.open(arcname) as bf:
fileop.copy_stream(bf, outfile)
outfiles.append(outfile)
# Double check the digest of the written file
if not dry_run and row[1]:
with open(outfile, 'rb') as bf:
data = bf.read()
_, newdigest = self.get_hash(data, kind)
if newdigest != digest:
raise DistlibException('digest mismatch '
'on write for '
'%s' % outfile)
if bc and outfile.endswith('.py'):
try:
pyc = fileop.byte_compile(outfile)
outfiles.append(pyc)
except Exception:
# Don't give up if byte-compilation fails,
# but log it and perhaps warn the user
logger.warning('Byte-compilation failed',
exc_info=True)
else:
fn = os.path.basename(convert_path(arcname))
workname = os.path.join(workdir, fn)
with zf.open(arcname) as bf:
fileop.copy_stream(bf, workname)
dn, fn = os.path.split(outfile)
maker.target_dir = dn
filenames = maker.make(fn)
fileop.set_executable_mode(filenames)
outfiles.extend(filenames)
if lib_only:
logger.debug('lib_only: returning None')
dist = None
else:
# Generate scripts
# Try to get pydist.json so we can see if there are
# any commands to generate. If this fails (e.g. because
# of a legacy wheel), log a warning but don't give up.
commands = None
file_version = self.info['Wheel-Version']
if file_version == '1.0':
# Use legacy info
ep = posixpath.join(info_dir, 'entry_points.txt')
try:
with zf.open(ep) as bwf:
epdata = read_exports(bwf)
commands = {}
for key in ('console', 'gui'):
k = '%s_scripts' % key
if k in epdata:
commands['wrap_%s' % key] = d = {}
for v in epdata[k].values():
s = '%s:%s' % (v.prefix, v.suffix)
if v.flags:
s += ' %s' % v.flags
d[v.name] = s
except Exception:
logger.warning('Unable to read legacy script '
'metadata, so cannot generate '
'scripts')
else:
try:
with zf.open(metadata_name) as bwf:
wf = wrapper(bwf)
commands = json.load(wf).get('extensions')
if commands:
commands = commands.get('python.commands')
except Exception:
logger.warning('Unable to read JSON metadata, so '
'cannot generate scripts')
if commands:
console_scripts = commands.get('wrap_console', {})
gui_scripts = commands.get('wrap_gui', {})
if console_scripts or gui_scripts:
script_dir = paths.get('scripts', '')
if not os.path.isdir(script_dir):
raise ValueError('Valid script path not '
'specified')
maker.target_dir = script_dir
for k, v in console_scripts.items():
script = '%s = %s' % (k, v)
filenames = maker.make(script)
fileop.set_executable_mode(filenames)
if gui_scripts:
options = {'gui': True }
for k, v in gui_scripts.items():
script = '%s = %s' % (k, v)
filenames = maker.make(script, options)
fileop.set_executable_mode(filenames)
p = os.path.join(libdir, info_dir)
dist = InstalledDistribution(p)
# Write SHARED
paths = dict(paths) # don't change passed in dict
del paths['purelib']
del paths['platlib']
paths['lib'] = libdir
p = dist.write_shared_locations(paths, dry_run)
if p:
outfiles.append(p)
# Write RECORD
dist.write_installed_files(outfiles, paths['prefix'],
dry_run)
return dist
except Exception: # pragma: no cover
logger.exception('installation failed.')
fileop.rollback()
raise
finally:
shutil.rmtree(workdir)
def _get_dylib_cache(self):
global cache
if cache is None:
# Use native string to avoid issues on 2.x: see Python #20140.
base = os.path.join(get_cache_base(), str('dylib-cache'),
sys.version[:3])
cache = Cache(base)
return cache
def _get_extensions(self):
pathname = os.path.join(self.dirname, self.filename)
name_ver = '%s-%s' % (self.name, self.version)
info_dir = '%s.dist-info' % name_ver
arcname = posixpath.join(info_dir, 'EXTENSIONS')
wrapper = codecs.getreader('utf-8')
result = []
with ZipFile(pathname, 'r') as zf:
try:
with zf.open(arcname) as bf:
wf = wrapper(bf)
extensions = json.load(wf)
cache = self._get_dylib_cache()
prefix = cache.prefix_to_dir(pathname)
cache_base = os.path.join(cache.base, prefix)
if not os.path.isdir(cache_base):
os.makedirs(cache_base)
for name, relpath in extensions.items():
dest = os.path.join(cache_base, convert_path(relpath))
if not os.path.exists(dest):
extract = True
else:
file_time = os.stat(dest).st_mtime
file_time = datetime.datetime.fromtimestamp(file_time)
info = zf.getinfo(relpath)
wheel_time = datetime.datetime(*info.date_time)
extract = wheel_time > file_time
if extract:
zf.extract(relpath, cache_base)
result.append((name, dest))
except KeyError:
pass
return result
def is_compatible(self):
"""
Determine if a wheel is compatible with the running system.
"""
return is_compatible(self)
def is_mountable(self):
"""
Determine if a wheel is asserted as mountable by its metadata.
"""
return True # for now - metadata details TBD
def mount(self, append=False):
pathname = os.path.abspath(os.path.join(self.dirname, self.filename))
if not self.is_compatible():
msg = 'Wheel %s not compatible with this Python.' % pathname
raise DistlibException(msg)
if not self.is_mountable():
msg = 'Wheel %s is marked as not mountable.' % pathname
raise DistlibException(msg)
if pathname in sys.path:
logger.debug('%s already in path', pathname)
else:
if append:
sys.path.append(pathname)
else:
sys.path.insert(0, pathname)
extensions = self._get_extensions()
if extensions:
if _hook not in sys.meta_path:
sys.meta_path.append(_hook)
_hook.add(pathname, extensions)
def unmount(self):
pathname = os.path.abspath(os.path.join(self.dirname, self.filename))
if pathname not in sys.path:
logger.debug('%s not in path', pathname)
else:
sys.path.remove(pathname)
if pathname in _hook.impure_wheels:
_hook.remove(pathname)
if not _hook.impure_wheels:
if _hook in sys.meta_path:
sys.meta_path.remove(_hook)
def verify(self):
pathname = os.path.join(self.dirname, self.filename)
name_ver = '%s-%s' % (self.name, self.version)
data_dir = '%s.data' % name_ver
info_dir = '%s.dist-info' % name_ver
metadata_name = posixpath.join(info_dir, METADATA_FILENAME)
wheel_metadata_name = posixpath.join(info_dir, 'WHEEL')
record_name = posixpath.join(info_dir, 'RECORD')
wrapper = codecs.getreader('utf-8')
with ZipFile(pathname, 'r') as zf:
with zf.open(wheel_metadata_name) as bwf:
wf = wrapper(bwf)
message = message_from_file(wf)
wv = message['Wheel-Version'].split('.', 1)
file_version = tuple([int(i) for i in wv])
# TODO version verification
records = {}
with zf.open(record_name) as bf:
with CSVReader(stream=bf) as reader:
for row in reader:
p = row[0]
records[p] = row
for zinfo in zf.infolist():
arcname = zinfo.filename
if isinstance(arcname, text_type):
u_arcname = arcname
else:
u_arcname = arcname.decode('utf-8')
if '..' in u_arcname:
raise DistlibException('invalid entry in '
'wheel: %r' % u_arcname)
# The signature file won't be in RECORD,
# and we don't currently don't do anything with it
if u_arcname.endswith('/RECORD.jws'):
continue
row = records[u_arcname]
if row[2] and str(zinfo.file_size) != row[2]:
raise DistlibException('size mismatch for '
'%s' % u_arcname)
if row[1]:
kind, value = row[1].split('=', 1)
with zf.open(arcname) as bf:
data = bf.read()
_, digest = self.get_hash(data, kind)
if digest != value:
raise DistlibException('digest mismatch for '
'%s' % arcname)
def update(self, modifier, dest_dir=None, **kwargs):
"""
Update the contents of a wheel in a generic way. The modifier should
be a callable which expects a dictionary argument: its keys are
archive-entry paths, and its values are absolute filesystem paths
where the contents the corresponding archive entries can be found. The
modifier is free to change the contents of the files pointed to, add
new entries and remove entries, before returning. This method will
extract the entire contents of the wheel to a temporary location, call
the modifier, and then use the passed (and possibly updated)
dictionary to write a new wheel. If ``dest_dir`` is specified, the new
wheel is written there -- otherwise, the original wheel is overwritten.
The modifier should return True if it updated the wheel, else False.
This method returns the same value the modifier returns.
"""
def get_version(path_map, info_dir):
version = path = None
key = '%s/%s' % (info_dir, METADATA_FILENAME)
if key not in path_map:
key = '%s/PKG-INFO' % info_dir
if key in path_map:
path = path_map[key]
version = Metadata(path=path).version
return version, path
def update_version(version, path):
updated = None
try:
v = NormalizedVersion(version)
i = version.find('-')
if i < 0:
updated = '%s+1' % version
else:
parts = [int(s) for s in version[i + 1:].split('.')]
parts[-1] += 1
updated = '%s+%s' % (version[:i],
'.'.join(str(i) for i in parts))
except UnsupportedVersionError:
logger.debug('Cannot update non-compliant (PEP-440) '
'version %r', version)
if updated:
md = Metadata(path=path)
md.version = updated
legacy = not path.endswith(METADATA_FILENAME)
md.write(path=path, legacy=legacy)
logger.debug('Version updated from %r to %r', version,
updated)
pathname = os.path.join(self.dirname, self.filename)
name_ver = '%s-%s' % (self.name, self.version)
info_dir = '%s.dist-info' % name_ver
record_name = posixpath.join(info_dir, 'RECORD')
with tempdir() as workdir:
with ZipFile(pathname, 'r') as zf:
path_map = {}
for zinfo in zf.infolist():
arcname = zinfo.filename
if isinstance(arcname, text_type):
u_arcname = arcname
else:
u_arcname = arcname.decode('utf-8')
if u_arcname == record_name:
continue
if '..' in u_arcname:
raise DistlibException('invalid entry in '
'wheel: %r' % u_arcname)
zf.extract(zinfo, workdir)
path = os.path.join(workdir, convert_path(u_arcname))
path_map[u_arcname] = path
# Remember the version.
original_version, _ = get_version(path_map, info_dir)
# Files extracted. Call the modifier.
modified = modifier(path_map, **kwargs)
if modified:
# Something changed - need to build a new wheel.
current_version, path = get_version(path_map, info_dir)
if current_version and (current_version == original_version):
# Add or update local version to signify changes.
update_version(current_version, path)
# Decide where the new wheel goes.
if dest_dir is None:
fd, newpath = tempfile.mkstemp(suffix='.whl',
prefix='wheel-update-',
dir=workdir)
os.close(fd)
else:
if not os.path.isdir(dest_dir):
raise DistlibException('Not a directory: %r' % dest_dir)
newpath = os.path.join(dest_dir, self.filename)
archive_paths = list(path_map.items())
distinfo = os.path.join(workdir, info_dir)
info = distinfo, info_dir
self.write_records(info, workdir, archive_paths)
self.build_zip(newpath, archive_paths)
if dest_dir is None:
shutil.copyfile(newpath, pathname)
return modified
def compatible_tags():
"""
Return (pyver, abi, arch) tuples compatible with this Python.
"""
versions = [VER_SUFFIX]
major = VER_SUFFIX[0]
for minor in range(sys.version_info[1] - 1, - 1, -1):
versions.append(''.join([major, str(minor)]))
abis = []
for suffix, _, _ in imp.get_suffixes():
if suffix.startswith('.abi'):
abis.append(suffix.split('.', 2)[1])
abis.sort()
if ABI != 'none':
abis.insert(0, ABI)
abis.append('none')
result = []
arches = [ARCH]
if sys.platform == 'darwin':
m = re.match('(\w+)_(\d+)_(\d+)_(\w+)$', ARCH)
if m:
name, major, minor, arch = m.groups()
minor = int(minor)
matches = [arch]
if arch in ('i386', 'ppc'):
matches.append('fat')
if arch in ('i386', 'ppc', 'x86_64'):
matches.append('fat3')
if arch in ('ppc64', 'x86_64'):
matches.append('fat64')
if arch in ('i386', 'x86_64'):
matches.append('intel')
if arch in ('i386', 'x86_64', 'intel', 'ppc', 'ppc64'):
matches.append('universal')
while minor >= 0:
for match in matches:
s = '%s_%s_%s_%s' % (name, major, minor, match)
if s != ARCH: # already there
arches.append(s)
minor -= 1
# Most specific - our Python version, ABI and arch
for abi in abis:
for arch in arches:
result.append((''.join((IMP_PREFIX, versions[0])), abi, arch))
# where no ABI / arch dependency, but IMP_PREFIX dependency
for i, version in enumerate(versions):
result.append((''.join((IMP_PREFIX, version)), 'none', 'any'))
if i == 0:
result.append((''.join((IMP_PREFIX, version[0])), 'none', 'any'))
# no IMP_PREFIX, ABI or arch dependency
for i, version in enumerate(versions):
result.append((''.join(('py', version)), 'none', 'any'))
if i == 0:
result.append((''.join(('py', version[0])), 'none', 'any'))
return set(result)
COMPATIBLE_TAGS = compatible_tags()
del compatible_tags
def is_compatible(wheel, tags=None):
if not isinstance(wheel, Wheel):
wheel = Wheel(wheel) # assume it's a filename
result = False
if tags is None:
tags = COMPATIBLE_TAGS
for ver, abi, arch in tags:
if ver in wheel.pyver and abi in wheel.abi and arch in wheel.arch:
result = True
break
return result
pip/_vendor/distlib/compat.py 0000644 00000117541 14751155150 0012274 0 ustar 00 # -*- coding: utf-8 -*-
#
# Copyright (C) 2013-2016 Vinay Sajip.
# Licensed to the Python Software Foundation under a contributor agreement.
# See LICENSE.txt and CONTRIBUTORS.txt.
#
from __future__ import absolute_import
import os
import re
import sys
try:
import ssl
except ImportError:
ssl = None
if sys.version_info[0] < 3: # pragma: no cover
from StringIO import StringIO
string_types = basestring,
text_type = unicode
from types import FileType as file_type
import __builtin__ as builtins
import ConfigParser as configparser
from ._backport import shutil
from urlparse import urlparse, urlunparse, urljoin, urlsplit, urlunsplit
from urllib import (urlretrieve, quote as _quote, unquote, url2pathname,
pathname2url, ContentTooShortError, splittype)
def quote(s):
if isinstance(s, unicode):
s = s.encode('utf-8')
return _quote(s)
import urllib2
from urllib2 import (Request, urlopen, URLError, HTTPError,
HTTPBasicAuthHandler, HTTPPasswordMgr,
HTTPHandler, HTTPRedirectHandler,
build_opener)
if ssl:
from urllib2 import HTTPSHandler
import httplib
import xmlrpclib
import Queue as queue
from HTMLParser import HTMLParser
import htmlentitydefs
raw_input = raw_input
from itertools import ifilter as filter
from itertools import ifilterfalse as filterfalse
_userprog = None
def splituser(host):
"""splituser('user[:passwd]@host[:port]') --> 'user[:passwd]', 'host[:port]'."""
global _userprog
if _userprog is None:
import re
_userprog = re.compile('^(.*)@(.*)$')
match = _userprog.match(host)
if match: return match.group(1, 2)
return None, host
else: # pragma: no cover
from io import StringIO
string_types = str,
text_type = str
from io import TextIOWrapper as file_type
import builtins
import configparser
import shutil
from urllib.parse import (urlparse, urlunparse, urljoin, splituser, quote,
unquote, urlsplit, urlunsplit, splittype)
from urllib.request import (urlopen, urlretrieve, Request, url2pathname,
pathname2url,
HTTPBasicAuthHandler, HTTPPasswordMgr,
HTTPHandler, HTTPRedirectHandler,
build_opener)
if ssl:
from urllib.request import HTTPSHandler
from urllib.error import HTTPError, URLError, ContentTooShortError
import http.client as httplib
import urllib.request as urllib2
import xmlrpc.client as xmlrpclib
import queue
from html.parser import HTMLParser
import html.entities as htmlentitydefs
raw_input = input
from itertools import filterfalse
filter = filter
try:
from ssl import match_hostname, CertificateError
except ImportError: # pragma: no cover
class CertificateError(ValueError):
pass
def _dnsname_match(dn, hostname, max_wildcards=1):
"""Matching according to RFC 6125, section 6.4.3
http://tools.ietf.org/html/rfc6125#section-6.4.3
"""
pats = []
if not dn:
return False
parts = dn.split('.')
leftmost, remainder = parts[0], parts[1:]
wildcards = leftmost.count('*')
if wildcards > max_wildcards:
# Issue #17980: avoid denials of service by refusing more
# than one wildcard per fragment. A survey of established
# policy among SSL implementations showed it to be a
# reasonable choice.
raise CertificateError(
"too many wildcards in certificate DNS name: " + repr(dn))
# speed up common case w/o wildcards
if not wildcards:
return dn.lower() == hostname.lower()
# RFC 6125, section 6.4.3, subitem 1.
# The client SHOULD NOT attempt to match a presented identifier in which
# the wildcard character comprises a label other than the left-most label.
if leftmost == '*':
# When '*' is a fragment by itself, it matches a non-empty dotless
# fragment.
pats.append('[^.]+')
elif leftmost.startswith('xn--') or hostname.startswith('xn--'):
# RFC 6125, section 6.4.3, subitem 3.
# The client SHOULD NOT attempt to match a presented identifier
# where the wildcard character is embedded within an A-label or
# U-label of an internationalized domain name.
pats.append(re.escape(leftmost))
else:
# Otherwise, '*' matches any dotless string, e.g. www*
pats.append(re.escape(leftmost).replace(r'\*', '[^.]*'))
# add the remaining fragments, ignore any wildcards
for frag in remainder:
pats.append(re.escape(frag))
pat = re.compile(r'\A' + r'\.'.join(pats) + r'\Z', re.IGNORECASE)
return pat.match(hostname)
def match_hostname(cert, hostname):
"""Verify that *cert* (in decoded format as returned by
SSLSocket.getpeercert()) matches the *hostname*. RFC 2818 and RFC 6125
rules are followed, but IP addresses are not accepted for *hostname*.
CertificateError is raised on failure. On success, the function
returns nothing.
"""
if not cert:
raise ValueError("empty or no certificate, match_hostname needs a "
"SSL socket or SSL context with either "
"CERT_OPTIONAL or CERT_REQUIRED")
dnsnames = []
san = cert.get('subjectAltName', ())
for key, value in san:
if key == 'DNS':
if _dnsname_match(value, hostname):
return
dnsnames.append(value)
if not dnsnames:
# The subject is only checked when there is no dNSName entry
# in subjectAltName
for sub in cert.get('subject', ()):
for key, value in sub:
# XXX according to RFC 2818, the most specific Common Name
# must be used.
if key == 'commonName':
if _dnsname_match(value, hostname):
return
dnsnames.append(value)
if len(dnsnames) > 1:
raise CertificateError("hostname %r "
"doesn't match either of %s"
% (hostname, ', '.join(map(repr, dnsnames))))
elif len(dnsnames) == 1:
raise CertificateError("hostname %r "
"doesn't match %r"
% (hostname, dnsnames[0]))
else:
raise CertificateError("no appropriate commonName or "
"subjectAltName fields were found")
try:
from types import SimpleNamespace as Container
except ImportError: # pragma: no cover
class Container(object):
"""
A generic container for when multiple values need to be returned
"""
def __init__(self, **kwargs):
self.__dict__.update(kwargs)
try:
from shutil import which
except ImportError: # pragma: no cover
# Implementation from Python 3.3
def which(cmd, mode=os.F_OK | os.X_OK, path=None):
"""Given a command, mode, and a PATH string, return the path which
conforms to the given mode on the PATH, or None if there is no such
file.
`mode` defaults to os.F_OK | os.X_OK. `path` defaults to the result
of os.environ.get("PATH"), or can be overridden with a custom search
path.
"""
# Check that a given file can be accessed with the correct mode.
# Additionally check that `file` is not a directory, as on Windows
# directories pass the os.access check.
def _access_check(fn, mode):
return (os.path.exists(fn) and os.access(fn, mode)
and not os.path.isdir(fn))
# If we're given a path with a directory part, look it up directly rather
# than referring to PATH directories. This includes checking relative to the
# current directory, e.g. ./script
if os.path.dirname(cmd):
if _access_check(cmd, mode):
return cmd
return None
if path is None:
path = os.environ.get("PATH", os.defpath)
if not path:
return None
path = path.split(os.pathsep)
if sys.platform == "win32":
# The current directory takes precedence on Windows.
if not os.curdir in path:
path.insert(0, os.curdir)
# PATHEXT is necessary to check on Windows.
pathext = os.environ.get("PATHEXT", "").split(os.pathsep)
# See if the given file matches any of the expected path extensions.
# This will allow us to short circuit when given "python.exe".
# If it does match, only test that one, otherwise we have to try
# others.
if any(cmd.lower().endswith(ext.lower()) for ext in pathext):
files = [cmd]
else:
files = [cmd + ext for ext in pathext]
else:
# On other platforms you don't have things like PATHEXT to tell you
# what file suffixes are executable, so just pass on cmd as-is.
files = [cmd]
seen = set()
for dir in path:
normdir = os.path.normcase(dir)
if not normdir in seen:
seen.add(normdir)
for thefile in files:
name = os.path.join(dir, thefile)
if _access_check(name, mode):
return name
return None
# ZipFile is a context manager in 2.7, but not in 2.6
from zipfile import ZipFile as BaseZipFile
if hasattr(BaseZipFile, '__enter__'): # pragma: no cover
ZipFile = BaseZipFile
else:
from zipfile import ZipExtFile as BaseZipExtFile
class ZipExtFile(BaseZipExtFile):
def __init__(self, base):
self.__dict__.update(base.__dict__)
def __enter__(self):
return self
def __exit__(self, *exc_info):
self.close()
# return None, so if an exception occurred, it will propagate
class ZipFile(BaseZipFile):
def __enter__(self):
return self
def __exit__(self, *exc_info):
self.close()
# return None, so if an exception occurred, it will propagate
def open(self, *args, **kwargs):
base = BaseZipFile.open(self, *args, **kwargs)
return ZipExtFile(base)
try:
from platform import python_implementation
except ImportError: # pragma: no cover
def python_implementation():
"""Return a string identifying the Python implementation."""
if 'PyPy' in sys.version:
return 'PyPy'
if os.name == 'java':
return 'Jython'
if sys.version.startswith('IronPython'):
return 'IronPython'
return 'CPython'
try:
import sysconfig
except ImportError: # pragma: no cover
from ._backport import sysconfig
try:
callable = callable
except NameError: # pragma: no cover
from collections import Callable
def callable(obj):
return isinstance(obj, Callable)
try:
fsencode = os.fsencode
fsdecode = os.fsdecode
except AttributeError: # pragma: no cover
_fsencoding = sys.getfilesystemencoding()
if _fsencoding == 'mbcs':
_fserrors = 'strict'
else:
_fserrors = 'surrogateescape'
def fsencode(filename):
if isinstance(filename, bytes):
return filename
elif isinstance(filename, text_type):
return filename.encode(_fsencoding, _fserrors)
else:
raise TypeError("expect bytes or str, not %s" %
type(filename).__name__)
def fsdecode(filename):
if isinstance(filename, text_type):
return filename
elif isinstance(filename, bytes):
return filename.decode(_fsencoding, _fserrors)
else:
raise TypeError("expect bytes or str, not %s" %
type(filename).__name__)
try:
from tokenize import detect_encoding
except ImportError: # pragma: no cover
from codecs import BOM_UTF8, lookup
import re
cookie_re = re.compile("coding[:=]\s*([-\w.]+)")
def _get_normal_name(orig_enc):
"""Imitates get_normal_name in tokenizer.c."""
# Only care about the first 12 characters.
enc = orig_enc[:12].lower().replace("_", "-")
if enc == "utf-8" or enc.startswith("utf-8-"):
return "utf-8"
if enc in ("latin-1", "iso-8859-1", "iso-latin-1") or \
enc.startswith(("latin-1-", "iso-8859-1-", "iso-latin-1-")):
return "iso-8859-1"
return orig_enc
def detect_encoding(readline):
"""
The detect_encoding() function is used to detect the encoding that should
be used to decode a Python source file. It requires one argument, readline,
in the same way as the tokenize() generator.
It will call readline a maximum of twice, and return the encoding used
(as a string) and a list of any lines (left as bytes) it has read in.
It detects the encoding from the presence of a utf-8 bom or an encoding
cookie as specified in pep-0263. If both a bom and a cookie are present,
but disagree, a SyntaxError will be raised. If the encoding cookie is an
invalid charset, raise a SyntaxError. Note that if a utf-8 bom is found,
'utf-8-sig' is returned.
If no encoding is specified, then the default of 'utf-8' will be returned.
"""
try:
filename = readline.__self__.name
except AttributeError:
filename = None
bom_found = False
encoding = None
default = 'utf-8'
def read_or_stop():
try:
return readline()
except StopIteration:
return b''
def find_cookie(line):
try:
# Decode as UTF-8. Either the line is an encoding declaration,
# in which case it should be pure ASCII, or it must be UTF-8
# per default encoding.
line_string = line.decode('utf-8')
except UnicodeDecodeError:
msg = "invalid or missing encoding declaration"
if filename is not None:
msg = '{} for {!r}'.format(msg, filename)
raise SyntaxError(msg)
matches = cookie_re.findall(line_string)
if not matches:
return None
encoding = _get_normal_name(matches[0])
try:
codec = lookup(encoding)
except LookupError:
# This behaviour mimics the Python interpreter
if filename is None:
msg = "unknown encoding: " + encoding
else:
msg = "unknown encoding for {!r}: {}".format(filename,
encoding)
raise SyntaxError(msg)
if bom_found:
if codec.name != 'utf-8':
# This behaviour mimics the Python interpreter
if filename is None:
msg = 'encoding problem: utf-8'
else:
msg = 'encoding problem for {!r}: utf-8'.format(filename)
raise SyntaxError(msg)
encoding += '-sig'
return encoding
first = read_or_stop()
if first.startswith(BOM_UTF8):
bom_found = True
first = first[3:]
default = 'utf-8-sig'
if not first:
return default, []
encoding = find_cookie(first)
if encoding:
return encoding, [first]
second = read_or_stop()
if not second:
return default, [first]
encoding = find_cookie(second)
if encoding:
return encoding, [first, second]
return default, [first, second]
# For converting & <-> & etc.
try:
from html import escape
except ImportError:
from cgi import escape
if sys.version_info[:2] < (3, 4):
unescape = HTMLParser().unescape
else:
from html import unescape
try:
from collections import ChainMap
except ImportError: # pragma: no cover
from collections import MutableMapping
try:
from reprlib import recursive_repr as _recursive_repr
except ImportError:
def _recursive_repr(fillvalue='...'):
'''
Decorator to make a repr function return fillvalue for a recursive
call
'''
def decorating_function(user_function):
repr_running = set()
def wrapper(self):
key = id(self), get_ident()
if key in repr_running:
return fillvalue
repr_running.add(key)
try:
result = user_function(self)
finally:
repr_running.discard(key)
return result
# Can't use functools.wraps() here because of bootstrap issues
wrapper.__module__ = getattr(user_function, '__module__')
wrapper.__doc__ = getattr(user_function, '__doc__')
wrapper.__name__ = getattr(user_function, '__name__')
wrapper.__annotations__ = getattr(user_function, '__annotations__', {})
return wrapper
return decorating_function
class ChainMap(MutableMapping):
''' A ChainMap groups multiple dicts (or other mappings) together
to create a single, updateable view.
The underlying mappings are stored in a list. That list is public and can
accessed or updated using the *maps* attribute. There is no other state.
Lookups search the underlying mappings successively until a key is found.
In contrast, writes, updates, and deletions only operate on the first
mapping.
'''
def __init__(self, *maps):
'''Initialize a ChainMap by setting *maps* to the given mappings.
If no mappings are provided, a single empty dictionary is used.
'''
self.maps = list(maps) or [{}] # always at least one map
def __missing__(self, key):
raise KeyError(key)
def __getitem__(self, key):
for mapping in self.maps:
try:
return mapping[key] # can't use 'key in mapping' with defaultdict
except KeyError:
pass
return self.__missing__(key) # support subclasses that define __missing__
def get(self, key, default=None):
return self[key] if key in self else default
def __len__(self):
return len(set().union(*self.maps)) # reuses stored hash values if possible
def __iter__(self):
return iter(set().union(*self.maps))
def __contains__(self, key):
return any(key in m for m in self.maps)
def __bool__(self):
return any(self.maps)
@_recursive_repr()
def __repr__(self):
return '{0.__class__.__name__}({1})'.format(
self, ', '.join(map(repr, self.maps)))
@classmethod
def fromkeys(cls, iterable, *args):
'Create a ChainMap with a single dict created from the iterable.'
return cls(dict.fromkeys(iterable, *args))
def copy(self):
'New ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]'
return self.__class__(self.maps[0].copy(), *self.maps[1:])
__copy__ = copy
def new_child(self): # like Django's Context.push()
'New ChainMap with a new dict followed by all previous maps.'
return self.__class__({}, *self.maps)
@property
def parents(self): # like Django's Context.pop()
'New ChainMap from maps[1:].'
return self.__class__(*self.maps[1:])
def __setitem__(self, key, value):
self.maps[0][key] = value
def __delitem__(self, key):
try:
del self.maps[0][key]
except KeyError:
raise KeyError('Key not found in the first mapping: {!r}'.format(key))
def popitem(self):
'Remove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.'
try:
return self.maps[0].popitem()
except KeyError:
raise KeyError('No keys found in the first mapping.')
def pop(self, key, *args):
'Remove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].'
try:
return self.maps[0].pop(key, *args)
except KeyError:
raise KeyError('Key not found in the first mapping: {!r}'.format(key))
def clear(self):
'Clear maps[0], leaving maps[1:] intact.'
self.maps[0].clear()
try:
from imp import cache_from_source
except ImportError: # pragma: no cover
def cache_from_source(path, debug_override=None):
assert path.endswith('.py')
if debug_override is None:
debug_override = __debug__
if debug_override:
suffix = 'c'
else:
suffix = 'o'
return path + suffix
try:
from collections import OrderedDict
except ImportError: # pragma: no cover
## {{{ http://code.activestate.com/recipes/576693/ (r9)
# Backport of OrderedDict() class that runs on Python 2.4, 2.5, 2.6, 2.7 and pypy.
# Passes Python2.7's test suite and incorporates all the latest updates.
try:
from thread import get_ident as _get_ident
except ImportError:
from dummy_thread import get_ident as _get_ident
try:
from _abcoll import KeysView, ValuesView, ItemsView
except ImportError:
pass
class OrderedDict(dict):
'Dictionary that remembers insertion order'
# An inherited dict maps keys to values.
# The inherited dict provides __getitem__, __len__, __contains__, and get.
# The remaining methods are order-aware.
# Big-O running times for all methods are the same as for regular dictionaries.
# The internal self.__map dictionary maps keys to links in a doubly linked list.
# The circular doubly linked list starts and ends with a sentinel element.
# The sentinel element never gets deleted (this simplifies the algorithm).
# Each link is stored as a list of length three: [PREV, NEXT, KEY].
def __init__(self, *args, **kwds):
'''Initialize an ordered dictionary. Signature is the same as for
regular dictionaries, but keyword arguments are not recommended
because their insertion order is arbitrary.
'''
if len(args) > 1:
raise TypeError('expected at most 1 arguments, got %d' % len(args))
try:
self.__root
except AttributeError:
self.__root = root = [] # sentinel node
root[:] = [root, root, None]
self.__map = {}
self.__update(*args, **kwds)
def __setitem__(self, key, value, dict_setitem=dict.__setitem__):
'od.__setitem__(i, y) <==> od[i]=y'
# Setting a new item creates a new link which goes at the end of the linked
# list, and the inherited dictionary is updated with the new key/value pair.
if key not in self:
root = self.__root
last = root[0]
last[1] = root[0] = self.__map[key] = [last, root, key]
dict_setitem(self, key, value)
def __delitem__(self, key, dict_delitem=dict.__delitem__):
'od.__delitem__(y) <==> del od[y]'
# Deleting an existing item uses self.__map to find the link which is
# then removed by updating the links in the predecessor and successor nodes.
dict_delitem(self, key)
link_prev, link_next, key = self.__map.pop(key)
link_prev[1] = link_next
link_next[0] = link_prev
def __iter__(self):
'od.__iter__() <==> iter(od)'
root = self.__root
curr = root[1]
while curr is not root:
yield curr[2]
curr = curr[1]
def __reversed__(self):
'od.__reversed__() <==> reversed(od)'
root = self.__root
curr = root[0]
while curr is not root:
yield curr[2]
curr = curr[0]
def clear(self):
'od.clear() -> None. Remove all items from od.'
try:
for node in self.__map.itervalues():
del node[:]
root = self.__root
root[:] = [root, root, None]
self.__map.clear()
except AttributeError:
pass
dict.clear(self)
def popitem(self, last=True):
'''od.popitem() -> (k, v), return and remove a (key, value) pair.
Pairs are returned in LIFO order if last is true or FIFO order if false.
'''
if not self:
raise KeyError('dictionary is empty')
root = self.__root
if last:
link = root[0]
link_prev = link[0]
link_prev[1] = root
root[0] = link_prev
else:
link = root[1]
link_next = link[1]
root[1] = link_next
link_next[0] = root
key = link[2]
del self.__map[key]
value = dict.pop(self, key)
return key, value
# -- the following methods do not depend on the internal structure --
def keys(self):
'od.keys() -> list of keys in od'
return list(self)
def values(self):
'od.values() -> list of values in od'
return [self[key] for key in self]
def items(self):
'od.items() -> list of (key, value) pairs in od'
return [(key, self[key]) for key in self]
def iterkeys(self):
'od.iterkeys() -> an iterator over the keys in od'
return iter(self)
def itervalues(self):
'od.itervalues -> an iterator over the values in od'
for k in self:
yield self[k]
def iteritems(self):
'od.iteritems -> an iterator over the (key, value) items in od'
for k in self:
yield (k, self[k])
def update(*args, **kwds):
'''od.update(E, **F) -> None. Update od from dict/iterable E and F.
If E is a dict instance, does: for k in E: od[k] = E[k]
If E has a .keys() method, does: for k in E.keys(): od[k] = E[k]
Or if E is an iterable of items, does: for k, v in E: od[k] = v
In either case, this is followed by: for k, v in F.items(): od[k] = v
'''
if len(args) > 2:
raise TypeError('update() takes at most 2 positional '
'arguments (%d given)' % (len(args),))
elif not args:
raise TypeError('update() takes at least 1 argument (0 given)')
self = args[0]
# Make progressively weaker assumptions about "other"
other = ()
if len(args) == 2:
other = args[1]
if isinstance(other, dict):
for key in other:
self[key] = other[key]
elif hasattr(other, 'keys'):
for key in other.keys():
self[key] = other[key]
else:
for key, value in other:
self[key] = value
for key, value in kwds.items():
self[key] = value
__update = update # let subclasses override update without breaking __init__
__marker = object()
def pop(self, key, default=__marker):
'''od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
If key is not found, d is returned if given, otherwise KeyError is raised.
'''
if key in self:
result = self[key]
del self[key]
return result
if default is self.__marker:
raise KeyError(key)
return default
def setdefault(self, key, default=None):
'od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od'
if key in self:
return self[key]
self[key] = default
return default
def __repr__(self, _repr_running=None):
'od.__repr__() <==> repr(od)'
if not _repr_running: _repr_running = {}
call_key = id(self), _get_ident()
if call_key in _repr_running:
return '...'
_repr_running[call_key] = 1
try:
if not self:
return '%s()' % (self.__class__.__name__,)
return '%s(%r)' % (self.__class__.__name__, self.items())
finally:
del _repr_running[call_key]
def __reduce__(self):
'Return state information for pickling'
items = [[k, self[k]] for k in self]
inst_dict = vars(self).copy()
for k in vars(OrderedDict()):
inst_dict.pop(k, None)
if inst_dict:
return (self.__class__, (items,), inst_dict)
return self.__class__, (items,)
def copy(self):
'od.copy() -> a shallow copy of od'
return self.__class__(self)
@classmethod
def fromkeys(cls, iterable, value=None):
'''OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
and values equal to v (which defaults to None).
'''
d = cls()
for key in iterable:
d[key] = value
return d
def __eq__(self, other):
'''od.__eq__(y) <==> od==y. Comparison to another OD is order-sensitive
while comparison to a regular mapping is order-insensitive.
'''
if isinstance(other, OrderedDict):
return len(self)==len(other) and self.items() == other.items()
return dict.__eq__(self, other)
def __ne__(self, other):
return not self == other
# -- the following methods are only used in Python 2.7 --
def viewkeys(self):
"od.viewkeys() -> a set-like object providing a view on od's keys"
return KeysView(self)
def viewvalues(self):
"od.viewvalues() -> an object providing a view on od's values"
return ValuesView(self)
def viewitems(self):
"od.viewitems() -> a set-like object providing a view on od's items"
return ItemsView(self)
try:
from logging.config import BaseConfigurator, valid_ident
except ImportError: # pragma: no cover
IDENTIFIER = re.compile('^[a-z_][a-z0-9_]*$', re.I)
def valid_ident(s):
m = IDENTIFIER.match(s)
if not m:
raise ValueError('Not a valid Python identifier: %r' % s)
return True
# The ConvertingXXX classes are wrappers around standard Python containers,
# and they serve to convert any suitable values in the container. The
# conversion converts base dicts, lists and tuples to their wrapped
# equivalents, whereas strings which match a conversion format are converted
# appropriately.
#
# Each wrapper should have a configurator attribute holding the actual
# configurator to use for conversion.
class ConvertingDict(dict):
"""A converting dictionary wrapper."""
def __getitem__(self, key):
value = dict.__getitem__(self, key)
result = self.configurator.convert(value)
#If the converted value is different, save for next time
if value is not result:
self[key] = result
if type(result) in (ConvertingDict, ConvertingList,
ConvertingTuple):
result.parent = self
result.key = key
return result
def get(self, key, default=None):
value = dict.get(self, key, default)
result = self.configurator.convert(value)
#If the converted value is different, save for next time
if value is not result:
self[key] = result
if type(result) in (ConvertingDict, ConvertingList,
ConvertingTuple):
result.parent = self
result.key = key
return result
def pop(self, key, default=None):
value = dict.pop(self, key, default)
result = self.configurator.convert(value)
if value is not result:
if type(result) in (ConvertingDict, ConvertingList,
ConvertingTuple):
result.parent = self
result.key = key
return result
class ConvertingList(list):
"""A converting list wrapper."""
def __getitem__(self, key):
value = list.__getitem__(self, key)
result = self.configurator.convert(value)
#If the converted value is different, save for next time
if value is not result:
self[key] = result
if type(result) in (ConvertingDict, ConvertingList,
ConvertingTuple):
result.parent = self
result.key = key
return result
def pop(self, idx=-1):
value = list.pop(self, idx)
result = self.configurator.convert(value)
if value is not result:
if type(result) in (ConvertingDict, ConvertingList,
ConvertingTuple):
result.parent = self
return result
class ConvertingTuple(tuple):
"""A converting tuple wrapper."""
def __getitem__(self, key):
value = tuple.__getitem__(self, key)
result = self.configurator.convert(value)
if value is not result:
if type(result) in (ConvertingDict, ConvertingList,
ConvertingTuple):
result.parent = self
result.key = key
return result
class BaseConfigurator(object):
"""
The configurator base class which defines some useful defaults.
"""
CONVERT_PATTERN = re.compile(r'^(?P<prefix>[a-z]+)://(?P<suffix>.*)$')
WORD_PATTERN = re.compile(r'^\s*(\w+)\s*')
DOT_PATTERN = re.compile(r'^\.\s*(\w+)\s*')
INDEX_PATTERN = re.compile(r'^\[\s*(\w+)\s*\]\s*')
DIGIT_PATTERN = re.compile(r'^\d+$')
value_converters = {
'ext' : 'ext_convert',
'cfg' : 'cfg_convert',
}
# We might want to use a different one, e.g. importlib
importer = staticmethod(__import__)
def __init__(self, config):
self.config = ConvertingDict(config)
self.config.configurator = self
def resolve(self, s):
"""
Resolve strings to objects using standard import and attribute
syntax.
"""
name = s.split('.')
used = name.pop(0)
try:
found = self.importer(used)
for frag in name:
used += '.' + frag
try:
found = getattr(found, frag)
except AttributeError:
self.importer(used)
found = getattr(found, frag)
return found
except ImportError:
e, tb = sys.exc_info()[1:]
v = ValueError('Cannot resolve %r: %s' % (s, e))
v.__cause__, v.__traceback__ = e, tb
raise v
def ext_convert(self, value):
"""Default converter for the ext:// protocol."""
return self.resolve(value)
def cfg_convert(self, value):
"""Default converter for the cfg:// protocol."""
rest = value
m = self.WORD_PATTERN.match(rest)
if m is None:
raise ValueError("Unable to convert %r" % value)
else:
rest = rest[m.end():]
d = self.config[m.groups()[0]]
#print d, rest
while rest:
m = self.DOT_PATTERN.match(rest)
if m:
d = d[m.groups()[0]]
else:
m = self.INDEX_PATTERN.match(rest)
if m:
idx = m.groups()[0]
if not self.DIGIT_PATTERN.match(idx):
d = d[idx]
else:
try:
n = int(idx) # try as number first (most likely)
d = d[n]
except TypeError:
d = d[idx]
if m:
rest = rest[m.end():]
else:
raise ValueError('Unable to convert '
'%r at %r' % (value, rest))
#rest should be empty
return d
def convert(self, value):
"""
Convert values to an appropriate type. dicts, lists and tuples are
replaced by their converting alternatives. Strings are checked to
see if they have a conversion format and are converted if they do.
"""
if not isinstance(value, ConvertingDict) and isinstance(value, dict):
value = ConvertingDict(value)
value.configurator = self
elif not isinstance(value, ConvertingList) and isinstance(value, list):
value = ConvertingList(value)
value.configurator = self
elif not isinstance(value, ConvertingTuple) and\
isinstance(value, tuple):
value = ConvertingTuple(value)
value.configurator = self
elif isinstance(value, string_types):
m = self.CONVERT_PATTERN.match(value)
if m:
d = m.groupdict()
prefix = d['prefix']
converter = self.value_converters.get(prefix, None)
if converter:
suffix = d['suffix']
converter = getattr(self, converter)
value = converter(suffix)
return value
def configure_custom(self, config):
"""Configure an object with a user-supplied factory."""
c = config.pop('()')
if not callable(c):
c = self.resolve(c)
props = config.pop('.', None)
# Check for valid identifiers
kwargs = dict([(k, config[k]) for k in config if valid_ident(k)])
result = c(**kwargs)
if props:
for name, value in props.items():
setattr(result, name, value)
return result
def as_tuple(self, value):
"""Utility function which converts lists to tuples."""
if isinstance(value, list):
value = tuple(value)
return value
pip/_vendor/distlib/__pycache__/wheel.cpython-36.opt-1.pyc 0000644 00000060467 14751155150 0017344 0 ustar 00 3
���e˘ � @ s� d dl mZ d dlZd dlZd dlZd dlZd dlmZ d dl Z d dl
Z
d dl Z d dl Z d dl
Z
d dlZd dlZd dlZd dlZd dlZd dlZddlmZmZ ddlmZmZmZmZm Z ddl m Z ddl m Z m!Z! dd l"m#Z#m$Z$m%Z%m&Z&m'Z'm(Z(m)Z)m*Z*m+Z+ dd
l,m-Z-m.Z. e j/e0�Z1da2e3ed ��r4d Z4n*ej5j6d
��rHdZ4nej5dk�rZdZ4ndZ4ej7d�Z8e8�s�dej9dd� Z8de8 Z:e4e8 Z;ej"j<� j=dd�j=dd�Z>ej7d�Z?e?�r�e?j6d��r�e?j=dd�Z?ndd � Z@e@� Z?[@ejAd ejBejCB �ZDejAd ejBejCB �ZEejAd �ZFejAd �ZGd!ZHd"ZIe
jJd#k�r>d$d%� ZKnd&d%� ZKG d'd(� d(eL�ZMeM� ZNG d)d*� d*eL�ZOd+d,� ZPeP� ZQ[Pd/d-d.�ZRdS )0� )�unicode_literalsN)�message_from_file� )� __version__�DistlibException)� sysconfig�ZipFile�fsdecode� text_type�filter)�InstalledDistribution)�Metadata�METADATA_FILENAME) � FileOperator� convert_path� CSVReader� CSVWriter�Cache�cached_property�get_cache_base� read_exports�tempdir)�NormalizedVersion�UnsupportedVersionErrorZpypy_version_infoZpp�javaZjyZcliZip�cp�py_version_nodotz%s%s� �py�-�_�.�SOABIzcpython-c C sR dt g} tjd�r | jd� tjd�r0| jd� tjd�dkrH| jd� d j| �S )
Nr �Py_DEBUG�d�
WITH_PYMALLOC�mZPy_UNICODE_SIZE� �u� )�
VER_SUFFIXr �get_config_var�append�join)�parts� r/ �/usr/lib/python3.6/wheel.py� _derive_abi; s
r1 zz
(?P<nm>[^-]+)
-(?P<vn>\d+[^-]*)
(-(?P<bn>\d+[^-]*))?
-(?P<py>\w+\d+(\.\w+\d+)*)
-(?P<bi>\w+)
-(?P<ar>\w+(\.\w+)*)
\.whl$
z7
(?P<nm>[^-]+)
-(?P<vn>\d+[^-]*)
(-(?P<bn>\d+[^-]*))?$
s
\s*#![^\r\n]*s ^(\s*#!("[^"]+"|\S+))\s+(.*)$s #!pythons #!pythonw�/c C s | S )Nr/ )�or/ r/ r0 �<lambda>] s r4 c C s | j tjd�S )Nr2 )�replace�os�sep)r3 r/ r/ r0 r4 _ s c @ s6 e Zd Zdd� Zdd� Zdd� Zd dd �Zd
d � ZdS )
�Mounterc C s i | _ i | _d S )N)�
impure_wheels�libs)�selfr/ r/ r0 �__init__c s zMounter.__init__c C s || j |< | jj|� d S )N)r9 r: �update)r; �pathname�
extensionsr/ r/ r0 �addg s
z Mounter.addc C s4 | j j|�}x"|D ]\}}|| jkr| j|= qW d S )N)r9 �popr: )r; r> r? �k�vr/ r/ r0 �removek s
zMounter.removeNc C s || j kr| }nd }|S )N)r: )r; �fullname�path�resultr/ r/ r0 � find_moduleq s
zMounter.find_modulec C sj |t jkrt j| }nP|| jkr,td| ��tj|| j| �}| |_|jdd�}t|�dkrf|d |_ |S )Nz unable to find extension for %sr! r r )
�sys�modulesr: � ImportError�impZ load_dynamic�
__loader__�rsplit�len� __package__)r; rE rG r. r/ r/ r0 � load_modulex s
zMounter.load_module)N)�__name__�
__module__� __qualname__r< r@ rD rH rQ r/ r/ r/ r0 r8 b s
r8 c @ s� e Zd ZdZd2ZdZd3dd�Zedd � �Zed
d � �Z ed d
� �Z
e dd� �Z dd� Z
e dd� �Zdd� Zd4dd�Zdd� Zdd� Zd d � Zd5d d �Zd d!� Zd"d#� Zd$d%� Zd&d'� Zd(d)� Zd6d*d+�Zd,d-� Zd.d/� Z d7d0d1�Z dS )8�Wheelz@
Class to build and install from Wheel files (PEP 427).
r Zsha256NFc C s8 || _ || _d| _tg| _dg| _dg| _tj� | _ |dkrRd| _
d| _ | j | _
n�tj|�}|r�|jd�}|d | _
|d jd d
�| _ |d | _| j | _
n�tjj|�\}}tj|�}|s�td | ��|r�tjj|�| _ || _
|jd�}|d | _
|d | _ |d | _|d
jd�| _|d jd�| _|d jd�| _dS )zB
Initialise an instance using a (valid) filename.
r) �none�anyNZdummyz0.1ZnmZvnr r Zbnz Invalid name or filename: %rr r! Zbi�ar)�signZ
should_verify�buildver�PYVER�pyver�abi�archr6 �getcwd�dirname�name�version�filenameZ _filename�NAME_VERSION_RE�match� groupdictr5 rF �split� FILENAME_REr �abspath)r; rc rY �verifyr& �infor` r/ r/ r0 r< � sB
zWheel.__init__c C s^ | j rd| j }nd}dj| j�}dj| j�}dj| j�}| jjdd�}d| j|||||f S )zJ
Build and return a filename from the various components.
r r) r! r z%s-%s%s-%s-%s-%s.whl)rZ r- r\ r] r^ rb r5 ra )r; rZ r\ r] r^ rb r/ r/ r0 rc � s
zWheel.filenamec C s t jj| j| j�}t jj|�S )N)r6 rF r- r` rc �isfile)r; rF r/ r/ r0 �exists� s z Wheel.existsc c s@ x:| j D ]0}x*| jD ] }x| jD ]}|||fV q W qW qW d S )N)r\ r] r^ )r; r\ r] r^ r/ r/ r0 �tags� s z
Wheel.tagsc C s� t jj| j| j�}d| j| jf }d| }tjd�}t |d���}| j
|�}|d j dd�}t dd � |D ��}|d
k rzd
} nt
} y8tj|| �}
|j|
��} || �} t| d �}
W d Q R X W n tk
r� td | ��Y nX W d Q R X |
S )Nz%s-%sz %s.dist-infozutf-8�rz
Wheel-Versionr! r c S s g | ] }t |��qS r/ )�int)�.0�ir/ r/ r0 �
<listcomp>� s z"Wheel.metadata.<locals>.<listcomp>ZMETADATA)Zfileobjz$Invalid wheel, because %s is missing)r r )r6 rF r- r` rc ra rb �codecs� getreaderr �get_wheel_metadatarg �tupler � posixpath�openr
�KeyError�
ValueError)r; r> �name_ver�info_dir�wrapper�zf�wheel_metadata�wv� file_version�fn�metadata_filename�bf�wfrG r/ r/ r0 �metadata� s(
zWheel.metadatac C sX d| j | jf }d| }tj|d�}|j|�� }tjd�|�}t|�}W d Q R X t|�S )Nz%s-%sz %s.dist-info�WHEELzutf-8) ra rb rx r- ry rt ru r �dict)r; r r| r} r� r� r� �messager/ r/ r0 rv � s zWheel.get_wheel_metadatac C s6 t jj| j| j�}t|d��}| j|�}W d Q R X |S )Nro )r6 rF r- r` rc r rv )r; r> r rG r/ r/ r0 rk � s z
Wheel.infoc C s� t j|�}|r||j� }|d |� ||d � }}d|j� krBt}nt}tj|�}|rfd|j� d
}nd}|| }|| }nT|jd�}|jd�} |dk s�|| kr�d}
n |||d � d kr�d }
nd}
t|
| }|S ) Ns pythonw� r � �
�
r r s
���) �
SHEBANG_REre �end�lower�SHEBANG_PYTHONW�SHEBANG_PYTHON�SHEBANG_DETAIL_RE�groups�find) r; �datar& r� ZshebangZdata_after_shebangZshebang_python�argsZcrZlfZtermr/ r/ r0 �process_shebang� s,
zWheel.process_shebangc C sh |d kr| j }ytt|�}W n tk
r< td| ��Y nX ||�j� }tj|�jd�j d�}||fS )Nz Unsupported hash algorithm: %r� =�ascii)
� hash_kind�getattr�hashlib�AttributeErrorr �digest�base64Zurlsafe_b64encode�rstrip�decode)r; r� r� �hasherrG r/ r/ r0 �get_hash s zWheel.get_hashc
C sb t |�}ttjj||��}|j|ddf� |j� t|�� }x|D ]}|j|� qBW W d Q R X d S )Nr) ) �list�to_posixr6 rF �relpathr, �sortr Zwriterow)r; �recordsZ record_path�base�p�writer�rowr/ r/ r0 � write_record' s
zWheel.write_recordc C s� g }|\}}t t| j�}xX|D ]P\}} t| d��}
|
j� } W d Q R X d| j| � } tjj| �}
|j || |
f� q W tjj
|d�} | j || |� t tjj
|d��}|j || f� d S )N�rbz%s=%s�RECORD)
r� r� r� ry �readr� r6 rF �getsizer, r- r� r� )r; rk �libdir�
archive_pathsr� �distinfor} r� �apr� �fr� r� �sizer/ r/ r0 �
write_records0 s zWheel.write_recordsc C sJ t |dtj��2}x*|D ]"\}}tjd||� |j||� qW W d Q R X d S )N�wzWrote %s to %s in wheel)r �zipfileZ ZIP_DEFLATED�logger�debug�write)r; r> r� r r� r� r/ r/ r0 � build_zip@ s zWheel.build_zipc ! s� |dkr i }t t� fdd�d$��d }|dkrFd}tg}tg}tg}nd}tg}d g}d
g}|jd |�| _|jd |�| _|jd
|�| _ � | } d| j
| j f }
d|
} d|
} g }
x�d%D ]�}|� kr�q�� | }t j
j|�r�x�t j|�D ]�\}}}x�|D ]�}tt j
j||��}t j
j||�}tt j
j| ||��}|
j||f� |dk� r�|jd� � r�t|d��}|j� }W dQ R X | j|�}t|d��}|j|� W dQ R X � q�W q�W q�W | }d}x�t j|�D ]�\}}}||k�rx@t|�D ]4\}}t|�}|jd��r�t j
j||�}||= P �q�W xP|D ]H}t|�jd&��r2�qt j
j||�}tt j
j||��}|
j||f� �qW �q�W t j|�}xJ|D ]B}|d'k�r|tt j
j||��}tt j
j| |��}|
j||f� �q|W d |�p�| j d t d | g} x*| j D ] \} } } | jd!| | | f � �q�W t j
j|d �}t|d"��}|jd#j| �� W dQ R X tt j
j| d ��}|
j||f� | j || f| |
� t j
j| j | j!�} | j"| |
� | S )(z�
Build a wheel from files in specified paths, and use any specified tags
when determining the name of the wheel.
Nc s | � kS )Nr/ )r3 )�pathsr/ r0 r4 N s z Wheel.build.<locals>.<lambda>�purelib�platlibr Zfalse�truerV rW r\ r] r^ z%s-%sz%s.dataz %s.dist-infor� �headers�scriptsz.exer� �wbz
.dist-info�.pyc�.pyor� � INSTALLER�SHAREDr� zWheel-Version: %d.%dzGenerator: distlib %szRoot-Is-Purelib: %sz
Tag: %s-%s-%sr� �
)r� r� )r� r� r� )r� r� )r� r� r� r� )#r� r �IMPVER�ABI�ARCHr[ �getr\ r] r^ ra rb r6 rF �isdir�walkr r- r� r� r, �endswithry r� r� r� � enumerate�listdir�
wheel_versionr rn r� r` rc r� )!r; r� rn r� ZlibkeyZis_pureZ
default_pyverZ default_abiZ default_archr� r| �data_dirr} r� �keyrF �root�dirs�filesr� r� �rpr� r� r� r� rr �dnr� r\ r] r^ r> r/ )r� r0 �buildF s�
"
z Wheel.buildc B I K s` |j }|jd�}|jdd�}tjj| j| j�}d| j| jf }d| } d| }
t j|
t
�} t j|
d�} t j|
d�}
t j d �}t
|d
����}|j| ��}||�}t|�}W d Q R X |d jd
d�}tdd� |D ��}|| jkr�|r�|| j|� |d dk�r|d }n|d }i }|j|
��<}t|d��&}x |D ]}|d }|||< �q.W W d Q R X W d Q R X t j| d�}t j|
d�} t j| dd�} t|d�} d| _tj } g } tj� }!|!|_d |_�z��y^�x�|j � D �]�}"|"j}#t |#t ��r�|#}$n
|#j d �}$|$j d��r��q�||$ }|d �r0t!|"j"�|d k�r0t#d |$ ��|d �r�|d jd d�\}%}&|j|#��}|j$� }'W d Q R X | j%|'|%�\}(})|)|&k�r�t#d |# ��|�r�|$j&| |f��r�t'j(d |$� �q�|$j&| ��o�|$j d!� }*|$j&|��r|$jd"d �\}(}+},tjj||+ t)|,��}-n$|$| |
fk�r�q�tjj|t)|$��}-|*�s|j|#��}| j*||-� W d Q R X | j+|-� | �r�|d �r�t|-d#��4}|j$� }'| j%|'|%�\}(}.|.|)k�r�t#d$|- ��W d Q R X | �rx|-j d%��rxy| j,|-�}/| j+|/� W n$ t-k
�r t'j.d&dd'� Y nX nttjj/t)|#��}0tjj|!|0�}1|j|#��}| j*||1� W d Q R X tjj|-�\}2}0|2|_|j0|0�}3| j1|3� | j2|3� �q�W |�r�t'j(d(� d }4�n~d }5| j3d }|d)k�r~t j|
d*�}6y�|j|6��}t4|�}7W d Q R X i }5xxd<D ]p}8d-|8 }9|9|7k�r�i |5d.|8 < }:xF|7|9 j5� D ]6};d/|;j6|;j7f }<|;j8�rB|<d0|;j8 7 }<|<|:|;j< �qW �q�W W n t-k
�rz t'j.d1� Y nX ndyB|j| ��.}||�}t9j:|�jd2�}5|5�r�|5jd3�}5W d Q R X W n t-k
�r� t'j.d4� Y nX |5�r�|5jd5i �}=|5jd6i �}>|=�s |>�r�|jdd�}?tjj;|?��s.t<d7��|?|_x6|=j=� D ]*\}9};d8|9|;f }@|j0|@�}3| j1|3� �q>W |>�r�d,di}Ax8|>j=� D ],\}9};d8|9|;f }@|j0|@|A�}3| j1|3� �q�W tjj||
�}t>|�}4t?|�}|d= |d= ||d9< |4j@||�}|�r| j+|� |4jA| |d: |� |4S t-k
�r@ t'jBd;� | jC� � Y nX W d tDjE|!� X W d Q R X d S )=a�
Install a wheel to the specified paths. If kwarg ``warner`` is
specified, it should be a callable, which will be called with two
tuples indicating the wheel version of this software and the wheel
version in the file, if there is a discrepancy in the versions.
This can be used to issue any warnings to raise any exceptions.
If kwarg ``lib_only`` is True, only the purelib/platlib files are
installed, and the headers, scripts, data and dist-info metadata are
not written.
The return value is a :class:`InstalledDistribution` instance unless
``options.lib_only`` is True, in which case the return value is ``None``.
�warner�lib_onlyFz%s-%sz%s.dataz %s.dist-infor� r� zutf-8ro Nz
Wheel-Versionr! r c S s g | ] }t |��qS r/ )rp )rq rr r/ r/ r0 rs � s z!Wheel.install.<locals>.<listcomp>zRoot-Is-Purelibr� r� r� )�streamr r) r� )�dry_runTz /RECORD.jwsr zsize mismatch for %s�=zdigest mismatch for %szlib_only: skipping %sz.exer2 r� z digest mismatch on write for %sz.pyzByte-compilation failed)�exc_infozlib_only: returning Nonez1.0zentry_points.txt�console�guiz
%s_scriptszwrap_%sz%s:%sz %szAUnable to read legacy script metadata, so cannot generate scriptsr? zpython.commandsz8Unable to read JSON metadata, so cannot generate scriptsZ wrap_consoleZwrap_guiz Valid script path not specifiedz%s = %s�lib�prefixzinstallation failed.)r� r� )Fr� r� r6 rF r- r` rc ra rb rx r rt ru r ry r rg rw r� r r �recordrI �dont_write_bytecode�tempfileZmkdtempZ
source_dirZ
target_dir�infolist�
isinstancer
r� r� �str� file_sizer r� r� �
startswithr� r� r Z copy_streamr, Z byte_compile� ExceptionZwarning�basenameZmakeZset_executable_mode�extendrk r �valuesr� �suffix�flags�json�loadr� r{ �itemsr r� Zwrite_shared_locationsZwrite_installed_filesZ exceptionZrollback�shutilZrmtree)Br; r� Zmaker�kwargsr� r� r� r> r| r� r} �
metadata_name�wheel_metadata_name� record_namer~ r �bwfr� r� r� r� r� r� r� �readerr� r� Zdata_pfxZinfo_pfxZ
script_pfxZfileopZbcZoutfiles�workdir�zinfo�arcname� u_arcname�kind�valuer� r r� Z is_script�wherer� ZoutfileZ newdigestZpycr� Zworknamer� � filenamesZdistZcommandsZepZepdatar� rB r$ rC �sZconsole_scriptsZ gui_scriptsZ
script_dirZscriptZoptionsr/ r/ r0 �install� sB
"
z
Wheel.installc C s4 t d kr0tjjt� td�tjd d� �}t|�a t S )Nz dylib-cache� ) �cacher6 rF r- r r� rI rb r )r; r� r/ r/ r0 �_get_dylib_cache� s
zWheel._get_dylib_cachec C sl t jj| j| j�}d| j| jf }d| }tj|d�}tj d�}g }t
|d���}y�|j |���}||�} t j
| �}
| j� } | j|�} t jj| j| �}
t jj|
�s�t j|
� x�|
j� D ]�\}}t jj|
t|��}t jj|�s�d}n6t j|�j}tjj|�}|j|�}tj|j� }||k}|�r(|j ||
� |j ||f� q�W W d Q R X W n t k
�r\ Y nX W d Q R X |S )Nz%s-%sz %s.dist-infoZ
EXTENSIONSzutf-8ro T) r6 rF r- r` rc ra rb rx rt ru r ry r� r� r Z
prefix_to_dirr� r� �makedirsr� r rm �stat�st_mtime�datetimeZ
fromtimestampZgetinfoZ date_time�extractr, rz )r; r> r| r} r r~ rG r r� r� r? r
r� Z
cache_basera r� �destr Z file_timerk Z
wheel_timer/ r/ r0 �_get_extensions� s>
zWheel._get_extensionsc C s t | �S )zM
Determine if a wheel is compatible with the running system.
)�
is_compatible)r; r/ r/ r0 r � s zWheel.is_compatiblec C s dS )zP
Determine if a wheel is asserted as mountable by its metadata.
Tr/ )r; r/ r/ r0 � is_mountable� s zWheel.is_mountablec C s� t jjt jj| j| j��}| j� s2d| }t|��| j� sJd| }t|��|t jkrbt
j d|� nN|rtt jj |� nt jj
d|� | j� }|r�tt jkr�t jj t� tj||� d S )Nz)Wheel %s not compatible with this Python.z$Wheel %s is marked as not mountable.z%s already in pathr )r6 rF ri r- r` rc r r r rI r� r� r, �insertr �_hook� meta_pathr@ )r; r, r> �msgr? r/ r/ r0 �mount� s"
z Wheel.mountc C sr t jjt jj| j| j��}|tjkr2tjd|� n<tjj |� |t
j krRt
j |� t
j snt
tj krntj j t
� d S )Nz%s not in path)
r6 rF ri r- r` rc rI r� r� rD r r9 r )r; r> r/ r/ r0 �unmount� s
z
Wheel.unmountc ' C s t jj| j| j�}d| j| jf }d| }d| }tj|t�}tj|d�}tj|d�}t j
d�}t |d����} | j |��}
||
�} t
| �} W d Q R X | d jd d
�}
td d � |
D ��}i }| j |��:}t|d
��$}x |D ]}|d }|||< q�W W d Q R X W d Q R X x�| j� D ]�}|j}t|t��r*|}n
|jd�}d|k�rJtd| ��|jd��rZ�q|| }|d �r�t|j�|d k�r�td| ��|d
�r|d
jdd
�\}}| j |��}|j� }W d Q R X | j||�\}}||k�rtd| ���qW W d Q R X d S )Nz%s-%sz%s.dataz %s.dist-infor� r� zutf-8ro z
Wheel-Versionr! r c S s g | ] }t |��qS r/ )rp )rq rr r/ r/ r0 rs � s z Wheel.verify.<locals>.<listcomp>)r� r z..zinvalid entry in wheel: %rz /RECORD.jwsr zsize mismatch for %sr� zdigest mismatch for %s)r6 rF r- r` rc ra rb rx r rt ru r ry r rg rw r r� r� r
r� r r� r� r� r� r� ) r; r> r| r� r} r� r� r� r~ r r r� r� r� r� r� r� r r� r� r r r r r r� r r� r/ r/ r0 rj � sT
z Wheel.verifyc K s� dd� }dd� }t jj| j| j�}d| j| jf }d| }tj|d�} t� ���}
t |d���} i } xt| j
� D ]h}
|
j}t |t �r�|}n
|j
d �}|| kr�qjd
|kr�td | ��| j|
|
� t jj|
t|��}|| |< qjW W d Q R X || |�\}}|| f|�}|�r�|| |�\}}|�r(||k�r(|||� |d k�rRtjd
d|
d�\}}t j|� n*t jj|��sltd| ��t jj|| j�}t| j� �}t jj|
|�}||f}| j||
|� | j||� |d k�r�tj||� W d Q R X |S )a�
Update the contents of a wheel in a generic way. The modifier should
be a callable which expects a dictionary argument: its keys are
archive-entry paths, and its values are absolute filesystem paths
where the contents the corresponding archive entries can be found. The
modifier is free to change the contents of the files pointed to, add
new entries and remove entries, before returning. This method will
extract the entire contents of the wheel to a temporary location, call
the modifier, and then use the passed (and possibly updated)
dictionary to write a new wheel. If ``dest_dir`` is specified, the new
wheel is written there -- otherwise, the original wheel is overwritten.
The modifier should return True if it updated the wheel, else False.
This method returns the same value the modifier returns.
c S sH d }}d|t f }|| kr$d| }|| kr@| | }t|d�j}||fS )Nz%s/%sz %s/PKG-INFO)rF )r r
rb )�path_mapr} rb rF r� r/ r/ r0 � get_version1 s z!Wheel.update.<locals>.get_versionc S s� d }y|t | �}| jd�}|dk r*d| }nTdd� | |d d � jd�D �}|d d7 < d| d |� djd d
� |D ��f }W n tk
r� tjd | � Y nX |r�t|d �}||_|j t
� }|j ||d
� tjd| |� d S )Nr r z%s+1c S s g | ] }t |��qS r/ )rp )rq r
r/ r/ r0 rs C s z8Wheel.update.<locals>.update_version.<locals>.<listcomp>r r! z%s+%sc s s | ]}t |�V qd S )N)r� )rq rr r/ r/ r0 � <genexpr>F s z7Wheel.update.<locals>.update_version.<locals>.<genexpr>z0Cannot update non-compliant (PEP-440) version %r)rF )rF �legacyz Version updated from %r to %rr� ) r r� rg r- r r� r� r
rb r� r r� )rb rF �updatedrC rr r. Zmdr! r/ r/ r0 �update_version; s(
z$Wheel.update.<locals>.update_versionz%s-%sz %s.dist-infor� ro zutf-8z..zinvalid entry in wheel: %rNz.whlz
wheel-update-)r� r� �dirzNot a directory: %r)r6 rF r- r` rc ra rb rx r r r� r� r
r� r r r r� Zmkstemp�closer� r� r� r� r� r� Zcopyfile)r; ZmodifierZdest_dirr� r r# r> r| r} r� r r r r r r rF Zoriginal_versionr ZmodifiedZcurrent_version�fd�newpathr� r� rk r/ r/ r0 r= sX
z Wheel.update)r r )NFF)N)NN)F)N) rR rS rT �__doc__r� r� r< �propertyrc rm rn r r� rv rk r� r� r� r� r� r� r r r r r r r rj r= r/ r/ r/ r0 rU � s4
)
h e "
6rU c C s� t g} t d }x6ttjd d dd�D ] }| jdj|t|�g�� q&W g }x6tj� D ]*\}}}|j d�rT|j|j
dd�d � qTW |j � t dkr�|j
dt � |jd� g }tg}tjdk�r�tjd t�}|�r�|j� \} }}}
t|�}|
g} |
dk�r| jd � |
dk�r| jd� |
dk�r*| jd� |
dk�r>| jd� |
d k�rR| jd� xL|dk�r�x2| D ]*} d| ||| f }
|
tk�rd|j|
� �qdW |d8 }�qTW x<|D ]4}x,|D ]$}
|jdjt| d f�||
f� �q�W �q�W xXt| �D ]L\}}|jdjt|f�ddf� |dk�r�|jdjt|d f�ddf� �q�W xXt| �D ]L\}}|jdjd|f�ddf� |dk�rB|jdjd|d f�ddf� �qBW t|�S ) zG
Return (pyver, abi, arch) tuples compatible with this Python.
r r r) z.abir! r rV �darwinz(\w+)_(\d+)_(\d+)_(\w+)$�i386�ppcZfat�x86_64Zfat3�ppc64Zfat64�intelZ universalz %s_%s_%s_%srW r r� r� )r+ r, )r+ r, r- )r. r- )r+ r- )r+ r- r/ r, r. )r* �rangerI � version_infor, r- r� rL Z get_suffixesr� rg r� r� r r� �platform�rere r� rp �
IMP_PREFIXr� �set)Zversions�major�minorZabisr� r rG Zarchesr& ra r^ Zmatchesre r
r] rr rb r/ r/ r0 �compatible_tags� s`
*
$
$r8 c C s^ t | t�st| �} d}|d kr"t}x6|D ].\}}}|| jkr(|| jkr(|| jkr(d}P q(W |S )NFT)r� rU �COMPATIBLE_TAGSr\ r] r^ )Zwheelrn rG Zverr] r^ r/ r/ r0 r � s
r )N)SZ
__future__r r� rt r Zdistutils.utilZ distutilsZemailr r� rL r� Zloggingr6 rx r3 r� rI r� r� r) r r �compatr r r r
r Zdatabaser r� r
r �utilr r r r r r r r r rb r r Z getLoggerrR r� r
�hasattrr4 r2 r� r+ r* r1 r[ r� � get_platformr5 r� r� r1 �compile�
IGNORECASE�VERBOSErh rd r� r� r� r� r7 r� �objectr8 r rU r8 r9 r r/ r/ r/ r0 �<module> s� ,
# > pip/_vendor/distlib/__pycache__/index.cpython-36.pyc 0000644 00000041620 14751155150 0016376 0 ustar 00 3
���e]R � @ s� d dl Z d dlZd dlZd dlZd dlZd dlZyd dlmZ W n ek
r` d dl mZ Y nX ddl
m Z ddl m
Z
mZmZmZmZmZ ddlmZmZmZ eje�ZdZdZG d d
� d
e �Z dS ) � N)�Thread� )�DistlibException)�HTTPBasicAuthHandler�Request�HTTPPasswordMgr�urlparse� build_opener� string_types)�cached_property�zip_dir� ServerProxyz https://pypi.python.org/pypi�pypic @ s� e Zd ZdZdZd*dd�Zdd� Zdd � Zd
d � Zd d
� Z dd� Z
dd� Z d+dd�Z d,dd�Z
d-dd�Zd.dd�Zd d � Zd/d d �Zd0d d!�Zd1d"d#�Zd$d%� Zd&d'� Zd2d(d)�ZdS )3� PackageIndexzc
This class represents a package index compatible with PyPI, the Python
Package Index.
s. ----------ThIs_Is_tHe_distlib_index_bouNdaRY_$Nc C s� |pt | _| j� t| j�\}}}}}}|s<|s<|s<|d krJtd| j ��d| _d| _d| _d| _d| _ t
t j d��R}xJd D ]B} y(t
j| dg||d �}
|
d
kr�| | _P W q| tk
r� Y q|X q|W W dQ R X dS )
z�
Initialise an instance.
:param url: The URL of the index. If not specified, the URL for PyPI is
used.
�http�httpszinvalid repository: %sN�w�gpg�gpg2z --version)�stdout�stderrr )r r )r r )�
DEFAULT_INDEX�url�read_configurationr r �password_handler� ssl_verifierr �gpg_home� rpc_proxy�open�os�devnull�
subprocessZ
check_call�OSError) �selfr �scheme�netloc�pathZparamsZqueryZfragZsink�s�rc� r) �/usr/lib/python3.6/index.py�__init__$ s(
zPackageIndex.__init__c C s& ddl m} ddlm} |� }||�S )zs
Get the distutils command for interacting with PyPI configurations.
:return: the command.
r )� Distribution)�
PyPIRCCommand)Zdistutils.corer, Zdistutils.configr- )r# r, r- �dr) r) r* �_get_pypirc_commandB s z PackageIndex._get_pypirc_commandc C sR | j � }| j|_|j� }|jd�| _|jd�| _|jdd�| _|jd| j�| _dS )z�
Read the PyPI access configuration as supported by distutils, getting
PyPI to do the actual work. This populates ``username``, ``password``,
``realm`` and ``url`` attributes from the configuration.
�username�password�realmr �
repositoryN)r/ r r3 Z _read_pypirc�getr0 r1 r2 )r# �cZcfgr) r) r* r L s z PackageIndex.read_configurationc C s$ | j � | j� }|j| j| j� dS )z�
Save the PyPI access configuration. You must have set ``username`` and
``password`` attributes before calling this method.
Again, distutils is used to do the actual work.
N)�check_credentialsr/ Z
_store_pypircr0 r1 )r# r5 r) r) r* �save_configuration[ s z PackageIndex.save_configurationc C s\ | j dks| jdkr td��t� }t| j�\}}}}}}|j| j|| j | j� t|�| _ dS )zp
Check that ``username`` and ``password`` have been set, and raise an
exception if not.
Nz!username and password must be set)
r0 r1 r r r r Z add_passwordr2 r r )r# Zpm�_r% r) r) r* r6 g s z PackageIndex.check_credentialsc C s\ | j � |j� |j� }d|d< | j|j� g �}| j|�}d|d< | j|j� g �}| j|�S )aq
Register a distribution on PyPI, using the provided metadata.
:param metadata: A :class:`Metadata` instance defining at least a name
and version number for the distribution to be
registered.
:return: The HTTP response received from PyPI upon submission of the
request.
Zverifyz:actionZsubmit)r6 �validate�todict�encode_request�items� send_request)r# �metadatar. �requestZresponser) r) r* �registers s
zPackageIndex.registerc C sJ x<|j � }|sP |jd�j� }|j|� tjd||f � qW |j� dS )ar
Thread runner for reading lines of from a subprocess into a buffer.
:param name: The logical name of the stream (used for logging only).
:param stream: The stream to read from. This will typically a pipe
connected to the output stream of a subprocess.
:param outbuf: The list to append the read lines to.
zutf-8z%s: %sN)�readline�decode�rstrip�append�logger�debug�close)r# �name�streamZoutbufr' r) r) r* �_reader� s
zPackageIndex._readerc C s� | j dddg}|dkr | j}|r.|jd|g� |dk rF|jdddg� tj� }tjj|tjj|�d �}|jd
d d |d
||g� t j
ddj|�� ||fS )a�
Return a suitable command for signing a file.
:param filename: The pathname to the file to be signed.
:param signer: The identifier of the signer of the file.
:param sign_password: The passphrase for the signer's
private key used for signing.
:param keystore: The path to a directory which contains the keys
used in verification. If not specified, the
instance's ``gpg_home`` attribute is used instead.
:return: The signing command as a list suitable to be
passed to :class:`subprocess.Popen`.
z --status-fd�2z--no-ttyNz --homedirz--batchz--passphrase-fd�0z.ascz
--detach-signz--armorz --local-userz--outputz invoking: %s� ) r r �extend�tempfileZmkdtempr r& �join�basenamerE rF )r# �filename�signer�
sign_password�keystore�cmdZtdZsfr) r) r* �get_sign_command� s
z PackageIndex.get_sign_commandc C s� t jt jd�}|dk r t j|d< g }g }t j|f|�}t| jd|j|fd�}|j� t| jd|j|fd�}|j� |dk r�|jj |� |jj
� |j � |j � |j � |j
||fS )a�
Run a command in a child process , passing it any input data specified.
:param cmd: The command to run.
:param input_data: If specified, this must be a byte string containing
data to be sent to the child process.
:return: A tuple consisting of the subprocess' exit code, a list of
lines read from the subprocess' ``stdout``, and a list of
lines read from the subprocess' ``stderr``.
)r r N�stdinr )�target�argsr )r! �PIPE�Popenr rJ r �startr rX �writerG �waitrP �
returncode) r# rV Z
input_data�kwargsr r �pZt1Zt2r) r) r* � run_command� s$
zPackageIndex.run_commandc
C sD | j ||||�\}}| j||jd��\}}} |dkr@td| ��|S )aR
Sign a file.
:param filename: The pathname to the file to be signed.
:param signer: The identifier of the signer of the file.
:param sign_password: The passphrase for the signer's
private key used for signing.
:param keystore: The path to a directory which contains the keys
used in signing. If not specified, the instance's
``gpg_home`` attribute is used instead.
:return: The absolute pathname of the file where the signature is
stored.
zutf-8r z&sign command failed with error code %s)rW rc �encoder )
r# rR rS rT rU rV �sig_filer( r r r) r) r* � sign_file� s
zPackageIndex.sign_file�sdist�sourcec C s( | j � tjj|�s td| ��|j� |j� }d} |rZ| jsJtj d� n| j
||||�} t |d��}
|
j � } W dQ R X t
j| �j� } t
j| �j� }
|jdd||| |
d�� dtjj|�| fg}| �rt | d��}
|
j � }W dQ R X |jd tjj| �|f� tjtjj| �� | j|j� |�}| j|�S )
a�
Upload a release file to the index.
:param metadata: A :class:`Metadata` instance defining at least a name
and version number for the file to be uploaded.
:param filename: The pathname of the file to be uploaded.
:param signer: The identifier of the signer of the file.
:param sign_password: The passphrase for the signer's
private key used for signing.
:param filetype: The type of the file being uploaded. This is the
distutils command which produced that file, e.g.
``sdist`` or ``bdist_wheel``.
:param pyversion: The version of Python which the release relates
to. For code compatible with any Python, this would
be ``source``, otherwise it would be e.g. ``3.2``.
:param keystore: The path to a directory which contains the keys
used in signing. If not specified, the instance's
``gpg_home`` attribute is used instead.
:return: The HTTP response received from PyPI upon submission of the
request.
z
not found: %sNz)no signing program available - not signed�rbZ file_upload�1)z:actionZprotocol_version�filetype� pyversion�
md5_digest�
sha256_digest�contentZ
gpg_signature)r6 r r& �existsr r9 r: r rE Zwarningrf r �read�hashlib�md5� hexdigestZsha256�updaterQ rD �shutilZrmtree�dirnamer; r< r= )r# r> rR rS rT rk rl rU r. re �fZ file_datarm rn �filesZsig_datar? r) r) r* � upload_file� s>
zPackageIndex.upload_filec
C s� | j � tjj|�s td| ��tjj|d�}tjj|�sFtd| ��|j� |j|j }}t
|�j � }d d|fd|fg}d||fg}| j ||�} | j
| �S )
a2
Upload documentation to the index.
:param metadata: A :class:`Metadata` instance defining at least a name
and version number for the documentation to be
uploaded.
:param doc_dir: The pathname of the directory which contains the
documentation. This should be the directory that
contains the ``index.html`` for the documentation.
:return: The HTTP response received from PyPI upon submission of the
request.
znot a directory: %rz
index.htmlz
not found: %r�:action�
doc_uploadrH �versionro )r{ r| )r6 r r& �isdirr rP rp r9 rH r} r �getvaluer; r= )
r# r> Zdoc_dir�fnrH r} Zzip_data�fieldsry r? r) r) r* �upload_documentation) s
z!PackageIndex.upload_documentationc C sT | j dddg}|dkr | j}|r.|jd|g� |jd||g� tjddj|�� |S ) a|
Return a suitable command for verifying a file.
:param signature_filename: The pathname to the file containing the
signature.
:param data_filename: The pathname to the file containing the
signed data.
:param keystore: The path to a directory which contains the keys
used in verification. If not specified, the
instance's ``gpg_home`` attribute is used instead.
:return: The verifying command as a list suitable to be
passed to :class:`subprocess.Popen`.
z --status-fdrK z--no-ttyNz --homedirz--verifyz invoking: %srM )r r rN rE rF rP )r# �signature_filename�
data_filenamerU rV r) r) r* �get_verify_commandE s z PackageIndex.get_verify_commandc C sH | j std��| j|||�}| j|�\}}}|dkr@td| ��|dkS )a6
Verify a signature for a file.
:param signature_filename: The pathname to the file containing the
signature.
:param data_filename: The pathname to the file containing the
signed data.
:param keystore: The path to a directory which contains the keys
used in verification. If not specified, the
instance's ``gpg_home`` attribute is used instead.
:return: True if the signature was verified, else False.
z0verification unavailable because gpg unavailabler r z(verify command failed with error code %s)r r )r r r� rc )r# r� r� rU rV r( r r r) r) r* �verify_signature] s z PackageIndex.verify_signaturec C sp |dkrd}t jd� n6t|ttf�r0|\}}nd}tt|�� }t jd| � t|d���}| jt |��}z�|j
� } d}
d} d} d}
d | kr�t | d
�} |r�||
|
| � xP|j |
�}|s�P | t
|�7 } |j|� |r�|j|� |
d7 }
|r�||
|
| � q�W W d|j� X W dQ R X | dk�r4| | k �r4td | | f ��|�rl|j� }||k�r`td ||||f ��t jd
|� dS )a
This is a convenience method for downloading a file from an URL.
Normally, this will be a file from the index, though currently
no check is made for this (i.e. a file can be downloaded from
anywhere).
The method is just like the :func:`urlretrieve` function in the
standard library, except that it allows digest computation to be
done during download and checking that the downloaded data
matched any expected value.
:param url: The URL of the file to be downloaded (assumed to be
available via an HTTP GET request).
:param destfile: The pathname where the downloaded file is to be
saved.
:param digest: If specified, this must be a (hasher, value)
tuple, where hasher is the algorithm used (e.g.
``'md5'``) and ``value`` is the expected value.
:param reporthook: The same as for :func:`urlretrieve` in the
standard library.
NzNo digest specifiedrs zDigest specified: %s�wbi r r zcontent-lengthzContent-Lengthz1retrieval incomplete: got only %d out of %d bytesz.%s digest mismatch for %s: expected %s, got %szDigest verified: %s���)rE rF �
isinstance�list�tuple�getattrrr r r= r �info�intrq �lenr^ ru rG r rt )r# r �destfileZdigestZ
reporthookZdigesterZhasherZdfpZsfp�headersZ blocksize�sizerq Zblocknum�block�actualr) r) r* �
download_filev sV
zPackageIndex.download_filec C s: g }| j r|j| j � | jr(|j| j� t|� }|j|�S )z�
Send a standard library :class:`Request` to PyPI and return its
response.
:param req: The request to send.
:return: The HTTP response from PyPI (a standard library HTTPResponse).
)r rD r r r )r# ZreqZhandlers�openerr) r) r* r= � s zPackageIndex.send_requestc C s� g }| j }xX|D ]P\}}t|ttf�s,|g}x2|D ]*}|jd| d| jd�d|jd�f� q2W qW x6|D ].\}} }
|jd| d|| f jd�d|
f� qjW |jd| d df� dj|�} d| } | tt| ��d�}
t | j
| |
�S ) a&
Encode fields and files for posting to an HTTP server.
:param fields: The fields to send as a list of (fieldname, value)
tuples.
:param files: The files to send as a list of (fieldname, filename,
file_bytes) tuple.
s --z)Content-Disposition: form-data; name="%s"zutf-8� z8Content-Disposition: form-data; name="%s"; filename="%s"s
s multipart/form-data; boundary=)z Content-typezContent-length) �boundaryr� r� r� rN rd rP �strr� r r )r# r� ry �partsr� �k�values�v�keyrR �valueZbodyZctr� r) r) r* r; � s2
zPackageIndex.encode_requestc C s> t |t�rd|i}| jd kr,t| jdd�| _| jj||p:d�S )NrH g @)Ztimeout�and)r� r
r r
r �search)r# Zterms�operatorr) r) r* r� � s
zPackageIndex.search)N)N)N)N)NNrg rh N)N)N)NN)N)�__name__�
__module__� __qualname__�__doc__r� r+ r/ r r7 r6 r@ rJ rW rc rf rz r� r� r� r� r= r; r� r) r) r) r* r s*
#
8
M+r ) rr Zloggingr rv r! rO Z threadingr � ImportErrorZdummy_threading� r �compatr r r r r r
�utilr r r
Z getLoggerr� rE r Z
DEFAULT_REALM�objectr r) r) r) r* �<module> s
pip/_vendor/distlib/__pycache__/version.cpython-36.opt-1.pyc 0000644 00000050610 14751155150 0017712 0 ustar 00 3
���e�\ � @ sZ d Z ddlZddlZddlmZ ddddd d
d d gZeje�ZG d
d � d e �Z
G dd� de �Z G dd� de �Z
ejd�Zdd� ZeZG dd� de �Zdd� ZG dd� de
�Zejd�dfejd�d fejd �dfejd �d fejd �d!fejd"�d!fejd#�d$fejd%�d&fejd'�d(fejd)�d*ff
Zejd+�dfejd,�dfejd-�d$fejd#�d$fejd.�dffZejd/�Zd0d1� Zd2d3� Zejd4ej�Zd5d5d6d5d7ddd8�Z d9d:� Z G d;d� de �Z G d<d� de
�Z ejd=ej�Z d>d?� Z!d@dA� Z"G dBd � d e �Z#G dCd
� d
e
�Z$G dDdE� dEe �Z%e%eee�e%e e dFdG� �e%e"e$e�dH�Z&e&dI e&dJ< dKd � Z'dS )Lz~
Implementation of a flexible versioning scheme providing support for PEP-440,
setuptools-compatible and semantic versioning.
� N� )� string_types�NormalizedVersion�NormalizedMatcher�
LegacyVersion�
LegacyMatcher�SemanticVersion�SemanticMatcher�UnsupportedVersionError�
get_schemec @ s e Zd ZdZdS )r
z This is an unsupported version.N)�__name__�
__module__� __qualname__�__doc__� r r � /usr/lib/python3.6/version.pyr
s c @ sx e Zd Zdd� Zdd� Zdd� Zdd� Zd d
� Zd d � Zd
d� Z dd� Z
dd� Z dd� Z dd� Z
dd� Zedd� �ZdS ) �Versionc C s" |j � | _}| j|� | _}d S )N)�strip�_string�parse�_parts)�self�s�partsr r r �__init__ s zVersion.__init__c C s t d��d S )Nz please implement in a subclass)�NotImplementedError)r r r r r r $ s z
Version.parsec C s$ t | �t |�kr td| |f ��d S )Nzcannot compare %r and %r)�type� TypeError)r �otherr r r �_check_compatible' s zVersion._check_compatiblec C s | j |� | j|jkS )N)r r )r r r r r �__eq__+ s
zVersion.__eq__c C s | j |� S )N)r )r r r r r �__ne__/ s zVersion.__ne__c C s | j |� | j|jk S )N)r r )r r r r r �__lt__2 s
zVersion.__lt__c C s | j |�p| j|� S )N)r" r )r r r r r �__gt__6 s zVersion.__gt__c C s | j |�p| j|�S )N)r" r )r r r r r �__le__9 s zVersion.__le__c C s | j |�p| j|�S )N)r# r )r r r r r �__ge__< s zVersion.__ge__c C s
t | j�S )N)�hashr )r r r r �__hash__@ s zVersion.__hash__c C s d| j j| jf S )Nz%s('%s'))� __class__r r )r r r r �__repr__C s zVersion.__repr__c C s | j S )N)r )r r r r �__str__F s zVersion.__str__c C s t d��d S )Nz Please implement in subclasses.)r )r r r r �
is_prereleaseI s zVersion.is_prereleaseN)r r
r r r r r r! r" r# r$ r% r' r) r* �propertyr+ r r r r r s r c @ s� e Zd ZdZejd�Zejd�Zejd�Zdd� dd� dd� d d� d
d� d d� d d� d
d� d�Z dd� Z
dd� Z e dd� �Z
dd� Zdd� Zdd� Zdd � Zd d � Zd d � ZdS )!�MatcherNz^(\w[\s\w'.-]*)(\((.*)\))?z'^(<=|>=|<|>|!=|={2,3}|~=)?\s*([^\s,]+)$z
^\d+(\.\d+)*$c C s | |k S )Nr )�v�c�pr r r �<lambda>W s zMatcher.<lambda>