/usr/lib/python2.7/dist-packages/mididings/arguments.py is in python-mididings 0~20120419~ds0-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 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 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 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 | # -*- coding: utf-8 -*-
#
# mididings
#
# Copyright (C) 2008-2012 Dominic Sacré <dominic.sacre@gmx.de>
#
# 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; either version 2 of the License, or
# (at your option) any later version.
#
from mididings import misc
import inspect
import sys
import collections
import types
import functools
if sys.version_info < (2, 6):
functools.reduce = reduce
import decorator
class accept(object):
"""
A decorator that applies type checks and other constraints to the arguments
of the decorated function.
Constraints must be given in the order of the function's positional
arguments, one constraint per argument. If the function accepts variable
arguments, one additional constraint must be specified, and will be applied
to each of those arguments.
If the optional keyword argument with_rest is True, all variable arguments
are instead combined with the last regular positional argument into a
single list. This list is then passed to the original function as a single
argument.
Keyword arguments are accepted if their name is in the kwargs_constraints
dictionary, and the value from that dictionnary is used as the constraint
to be applied.
"""
def __init__(self, *constraints, **kwargs):
self.with_rest = kwargs['with_rest'] if 'with_rest' in kwargs else False
kwargs_constraints = kwargs['kwargs'] if 'kwargs' in kwargs else {}
# build all constraints
self.constraints = [_make_constraint(c) for c in constraints]
self.kwargs_constraints = dict((k, _make_constraint(v)) for k, v in kwargs_constraints.items())
def __call__(self, f):
argspec = misc.getargspec(f)
self.arg_names = argspec[0]
self.have_varargs = (argspec[1] is not None) and not self.with_rest
assert ((len(self.constraints) == len(self.arg_names) and not self.have_varargs)
or (len(self.constraints) == len(self.arg_names) + 1 and self.have_varargs))
return decorator.decorator(self.wrapper, f)
def wrapper(self, f, *args, **kwargs):
mod_args = []
mod_kwargs = {}
for constraint, arg_name, arg in zip(self.constraints, self.arg_names, args):
if self.with_rest and arg_name == self.arg_names[-1]:
# with_rest is True and this is the last argument: combine with varargs
index = len(self.arg_names)
arg = (arg,) + args[index:]
a = _try_apply_constraint(constraint, arg, f.__name__, arg_name)
mod_args.append(a)
if self.have_varargs:
index = len(self.arg_names)
constraint = self.constraints[index]
for arg in args[index:]:
a = _try_apply_constraint(constraint, arg, f.__name__, None)
mod_args.append(a)
for k, v in kwargs.items():
if k not in self.kwargs_constraints:
message = "%s() got an unexpected keyword argument '%s'" % (f.__name__, k)
raise TypeError(message)
a = _try_apply_constraint(self.kwargs_constraints[k], v, f.__name__, k)
mod_kwargs[k] = a
return f(*mod_args, **mod_kwargs)
def _try_apply_constraint(constraint, arg, func_name, arg_name):
try:
return constraint(arg)
except (TypeError, ValueError):
ex = sys.exc_info()[1]
typestr = "type" if isinstance(ex, TypeError) else "value"
argstr = ("for parameter '%s'" % arg_name) if arg_name else "in varargs"
message = "invalid %s %s of %s():\n%s" % (typestr, argstr, func_name, str(ex))
raise type(ex)(message)
def _make_constraint(c):
if c is None:
return _any()
elif isinstance(c, list):
if len(c) == 1:
# single-item list: sequenceof() constraint
return sequenceof(c[0])
else:
# list: tupleof() constraint
return tupleof(*c)
elif isinstance(c, dict):
assert len(c) == 1
# single-item dict: mappingof() constraint
return mappingof(list(c.keys())[0], list(c.values())[0])
elif isinstance(c, tuple):
if all(inspect.isclass(cc) for cc in c):
# multiple types: type constraint
return _type_constraint(c, True)
else:
# any other tuple: value constraint
return _value_constraint(c)
elif inspect.isclass(c):
# single type: type constraint
return _type_constraint(c)
elif isinstance(c, _constraint):
# constraint object
return c
elif ((sys.version_info >= (2, 6) and isinstance(c, collections.Callable))
or (sys.version_info < (2, 6) and callable(c))):
# function or other callable object
return transform(c)
else:
assert False
class _constraint(object):
pass
class _any(_constraint):
def __call__(self, arg):
return arg
class _type_constraint(_constraint):
def __init__(self, types, multiple=False):
self.types = types
self.multiple = multiple
def __call__(self, arg):
if not self.multiple:
# single type, check if instance
if not isinstance(arg, self.types):
message = "expected %s, got %s" % (self.types.__name__, type(arg).__name__)
raise TypeError(message)
return arg
else:
# multiple types, check if instance
if not isinstance(arg, self.types):
argtypes = ", ".join(c.__name__ for c in self.types)
message = "expected one of (%s), got %s" % (argtypes, type(arg).__name__)
raise TypeError(message)
return arg
def __repr__(self):
if not self.multiple:
return self.types.__name__
else:
return repr(tuple(map(_type_constraint, self.types)))
class _value_constraint(_constraint):
def __init__(self, values):
self.values = values
def __call__(self, arg):
if arg not in self.values:
args = ", ".join(repr(c) for c in self.values)
message = "expected one of (%s), got %r" % (args, arg)
raise ValueError(message)
return arg
def __repr__(self):
return repr(tuple(self.values))
class nullable(_constraint):
"""
Allows the argument to be None, instead of matching any other constraint.
"""
def __init__(self, what):
self.what = _make_constraint(what)
def __call__(self, arg):
if arg is None:
return None
return self.what(arg)
def __repr__(self):
return 'nullable(%r)' % self.what
class sequenceof(_constraint):
"""
Checks that the argument is a sequence, and applies the same constraint to
each element in that sequence.
"""
def __init__(self, what):
self.what = _make_constraint(what)
def __call__(self, arg):
if not misc.issequence(arg):
raise TypeError("not a sequence")
try:
t = type(arg) if not isinstance(arg, types.GeneratorType) else list
return t(self.what(value) for value in arg)
except (TypeError, ValueError):
ex = sys.exc_info()[1]
message = "illegal item in sequence: %s" % str(ex)
raise type(ex)(message)
def __repr__(self):
return repr([self.what])
class tupleof(_constraint):
"""
Checks that the argument is a sequence of a fixed length, and applies
different constraints to each element in that sequence.
"""
def __init__(self, *what):
self.what = [_make_constraint(c) for c in what]
def __call__(self, arg):
if not misc.issequence(arg):
raise TypeError("not a sequence")
if len(arg) != len(self.what):
message = "expected sequence of %d items, got %d" % (len(self.what), len(arg))
raise ValueError(message)
try:
t = type(arg) if not isinstance(arg, types.GeneratorType) else list
return t(what(value) for what, value in zip(self.what, arg))
except (TypeError, ValueError):
ex = sys.exc_info()[1]
message = "illegal item in sequence: %s" % str(ex)
raise type(ex)(message)
def __repr__(self):
return repr(self.what)
class mappingof(_constraint):
"""
Checks that the argument is a dictionary, and applies constraints to each
key and each value.
"""
def __init__(self, fromwhat, towhat):
self.fromwhat = _make_constraint(fromwhat)
self.towhat = _make_constraint(towhat)
def __call__(self, arg):
if not isinstance(arg, dict):
raise TypeError("not a dictionary")
try:
keys = (self.fromwhat(key) for key in arg.keys())
except (TypeError, ValueError):
ex = sys.exc_info()[1]
message = "illegal key in dictionary: %s" % str(ex)
raise type(ex)(message)
try:
values = (self.towhat(value) for value in arg.values())
except (TypeError, ValueError):
ex = sys.exc_info()[1]
message = "illegal value in dictionary: %s" % str(ex)
raise type(ex)(message)
return dict(zip(keys, values))
def __repr__(self):
return repr({self.fromwhat: self.towhat})
class flatten(_constraint):
"""
Flattens all arguments into a single list, and applies a constraint to
each element in that list.
"""
def __init__(self, what, return_type=None):
self.what = _make_constraint(what)
self.return_type = return_type
def __call__(self, arg):
try:
r = [self.what(value) for value in misc.flatten(arg)]
return r if self.return_type is None else self.return_type(r)
except (TypeError, ValueError):
ex = sys.exc_info()[1]
message = "illegal item in sequence: %s" % str(ex)
raise type(ex)(message)
def __repr__(self):
return 'flatten(%r)' % self.what
class each(_constraint):
"""
Applies each of the given constraints.
"""
def __init__(self, *requirements):
self.requirements = [_make_constraint(c) for c in requirements]
def __call__(self, arg):
for what in self.requirements:
arg = what(arg)
return arg
def __repr__(self):
return 'each(%s)' % (', '.join(repr(c) for c in self.requirements))
class either(_constraint):
"""
Accepts the argument if any of the given constraints can be applied.
"""
def __init__(self, *alternatives):
self.alternatives = [_make_constraint(c) for c in alternatives]
def __call__(self, arg):
errors = []
for n, what in enumerate(self.alternatives):
try:
return what(arg)
except (TypeError, ValueError):
ex = sys.exc_info()[1]
exstr = str(ex).replace('\n', '\n ')
errors.append(" #%d %s: %s: %s" % (n + 1, what, type(ex).__name__, exstr))
message = "none of the alternatives matched:\n" + '\n'.join(errors)
raise TypeError(message)
def __repr__(self):
return 'either(%s)' % (', '.join(repr(c) for c in self.alternatives))
class transform(_constraint):
"""
Applies a function to its argument.
"""
def __init__(self, function):
self.function = function
def __call__(self, arg):
return self.function(arg)
def __repr__(self):
return _function_repr(self.function)
class condition(_constraint):
"""
Accepts the argument if the given function returns True.
"""
def __init__(self, function):
self.function = function
def __call__(self, arg):
if not self.function(arg):
message = "condition not met: %s" % _function_repr(self.function)
raise ValueError(message)
return arg
def __repr__(self):
return 'condition(%s)' % _function_repr(self.function)
class reduce_bitmask(_constraint):
"""
Flattens all arguments and reduces them to a single bitmask.
"""
def __init__(self, what):
self.what = _make_constraint(what)
def __call__(self, arg):
seq = self.what(misc.flatten(arg))
return functools.reduce(lambda x, y: x | y, seq)
def _function_repr(f):
if misc.islambda(f):
s = inspect.getsource(f).strip()
# inspect.getsource() returns the entire line of code.
# try to extract only the actual definition of the lambda function.
# this will fail if more than one lambda function is defined on
# the same line (and possibly for several other reasons...)
start = s.index('lambda')
end = len(s)
parens = 0
for n, c in enumerate(s[start:]):
if parens == 0 and c in ',)]}':
end = start + n
break
elif c in '([{':
parens += 1
elif c in ')]}':
parens -= 1
return s[start:end]
else:
return f.__name__
|