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 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806
|
#!/usr/bin/env python
from __future__ import print_function
import sys
import re
if sys.hexversion < 0x03000000:
from future_builtins import zip
################################################################################
#
# ruffus_utility.py
#
#
# Copyright (c) 10/9/2009 Leo Goodstadt
#
# 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.
#################################################################################
"""
********************************************
:mod:`ruffus_utility` -- Overview
********************************************
.. moduleauthor:: Leo Goodstadt <ruffus@llew.org.uk>
Common utility functions
"""
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# imports
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
import os,copy
import re
import types
import glob
from functools import reduce
if __name__ == '__main__':
import sys
sys.path.insert(0,".")
from .ruffus_exceptions import *
#import task
import collections
from collections import defaultdict
import multiprocessing.managers
import hashlib
import marshal
try:
import cPickle as pickle
except:
import pickle as pickle
import operator
from . import dbdict
from itertools import chain
if sys.hexversion >= 0x03000000:
# everything is unicode in python3
path_str_type = str
else:
path_str_type = basestring
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# Constants
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
#
# file to store history out to
#
RUFFUS_HISTORY_FILE = '.ruffus_history.sqlite'
# If DEFAULT_RUFFUS_HISTORY_FILE is specified in the environment variables, use that instead
if "DEFAULT_RUFFUS_HISTORY_FILE" in os.environ:
RUFFUS_HISTORY_FILE = os.environ["DEFAULT_RUFFUS_HISTORY_FILE"]
CHECKSUM_FILE_TIMESTAMPS = 0 # only rerun when the file timestamps are out of date (classic mode)
CHECKSUM_HISTORY_TIMESTAMPS = 1 # also rerun when the history shows a job as being out of date
CHECKSUM_FUNCTIONS = 2 # also rerun when function body has changed
CHECKSUM_FUNCTIONS_AND_PARAMS = 3 # also rerun when function parameters or function body change
CHECKSUM_REGENERATE = 2 # regenerate checksums
#_________________________________________________________________________________________
# t_extra_inputs
# namespaced enum
#_________________________________________________________________________________________
class t_extra_inputs:
(ADD_TO_INPUTS, REPLACE_INPUTS, KEEP_INPUTS, KEEP_OUTPUTS) = list(range(4))
#_________________________________________________________________________________________
# inputs
#_________________________________________________________________________________________
class inputs(object):
def __init__ (self, *args):
self.args = args
def __repr__ (self, *args):
return 'inputs%r' % (self.args,)
#_________________________________________________________________________________________
# add_inputs
#_________________________________________________________________________________________
class add_inputs(object):
def __init__ (self, *args):
self.args = args
def __repr__ (self, *args):
return 'add_inputs%r' % (self.args,)
#_________________________________________________________________________________________
#
# get_default_checksum_level
#
#_________________________________________________________________________________________
def get_default_checksum_level ():
"""
Use the checksum level from the environmental variable DEFAULT_RUFFUS_CHECKSUM_LEVEL
Otherwise default to CHECKSUM_HISTORY_TIMESTAMPS
"""
#
# environmental variable not set
#
if "DEFAULT_RUFFUS_CHECKSUM_LEVEL" not in os.environ:
return CHECKSUM_HISTORY_TIMESTAMPS
#
# lookup value from list of CHECKSUM_XXX constants
#
checksum_level = None
env_checksum_level = os.environ["DEFAULT_RUFFUS_CHECKSUM_LEVEL"]
if len(env_checksum_level) == 1 and env_checksum_level in "0123":
checksum_level = int(env_checksum_level)
else:
global_var = globals()
for key in global_var:
if key.startswith('CHECKSUM') and global_var[key] == env_checksum_level:
checksum_level = value
#
# check environmental variable is valid string
#
if checksum_level is None:
raise error_checksum_level(("The environmental value "
"DEFAULT_RUFFUS_CHECKSUM_LEVEL should be: [0-3 | "
"CHECKSUM_FILE_TIMESTAMPS | "
"CHECKSUM_HISTORY_TIMESTAMPS | "
"CHECKSUM_FUNCTIONS | "
"CHECKSUM_FUNCTIONS_AND_PARAMS] (rather than '%s') ")
% (env_checksum_level,))
return checksum_level
#_________________________________________________________________________________________
# open_job_history
#_________________________________________________________________________________________
def get_default_history_file_name ():
history_file = RUFFUS_HISTORY_FILE
#
# try path expansion using the main script name
#
try:
import __main__ as main
path_parts = path_decomposition (os.path.abspath(main.__file__))
history_file = history_file.format(**path_parts)
except Exception:
pass
return history_file
def open_job_history (history_file):
"""
Given a history file name, opens the correspond sqllite db file and returns the handle
"""
if not history_file:
history_file = get_default_history_file_name ()
return dbdict.open(history_file, picklevalues=True)
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# Functions
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
class JobHistoryChecksum:
"""Class to remember exactly how an output file was created and when."""
def __str__(self):
from time import strftime, gmtime
if hasattr(self, "params"):
return str([self.outfile,
strftime("%d %b %Y %H:%M:%S", gmtime(self.mtime)),
self.params,
self.task_name
])
else:
return strftime("%d %b %Y %H:%M:%S", gmtime(self.mtime))
def __init__(self, outfile, mtime, params, task):
# filename and modification time
self.outfile = outfile
self.mtime = mtime
# Uncomment next two lines to debug:
#self.params = params
#self.task_name = task._name
# checksum exact params used to generate this output file
self.chksum_params = hashlib.md5(pickle.dumps(params)).hexdigest()
# checksum the function bytecode as well as the function context
# Don't use func_code alone-- changing the line number of the function,
# what global variables are available, etc would all change the checksum
if sys.hexversion >= 0x03000000:
code = task.user_defined_work_func.__code__
func_defaults = task.user_defined_work_func.__defaults__
else:
code = task.user_defined_work_func.func_code
func_defaults = task.user_defined_work_func.func_defaults
func_code = marshal.dumps(code.co_code)
#
# pickle code very defensively, but hopefully without breaking Jake Biesinger's pipelines!
#
attributes_to_pickle = [func_defaults,
code.co_argcount,
code.co_consts,
code.co_names,
code.co_nlocals,
code.co_varnames]
pickle_results = []
for aa in attributes_to_pickle:
# Can't cpickle nested functions: typically blows up with func_code.co_consts
try:
pickle_results.append(pickle.dumps(aa))
continue
except:
pass
# Marshal seems to be less sensitive: try that
try:
pickle_results.append(marshal.dumps(aa))
continue
except:
pass
# Just make a string out of the attribute
try:
pickle_results.append(str(aa))
continue
except:
pass
# OK give up, do nothing: On your head it is
func_extras = reduce(operator.add, pickle_results)
self.chksum_func = hashlib.md5(func_code + func_extras).hexdigest()
#_________________________________________________________________________________________
#
# parameter_list_as_string
#
#_________________________________________________________________________________________
def parameter_list_as_string (parameters):
"""
Input list of parameters
Turn this into a string for display
E.g.
"""
if parameters is None:
return ""
elif not isinstance(parameters, list):
raise Exception("Unexpected parameter list %s" % (parameters,))
else:
return str(parameters)[1:-1]
#_________________________________________________________________________________________
#
# path_decomposition
#
#_________________________________________________________________________________________
def path_decomposition (orig_path):
"""
returns a dictionary identifying the components of a file path:
This has the following keys
basename: (any) base (file) name of the path not including the extension. No slash included
ext: (any) extension of the path including the "."
path: a list of subpaths created by removing subdirectory names
subdir: a list of subdirectory names from the most nested to the root
For example
apath = "/a/b/c/d/filename.txt"
{ 'basename': 'filename',
'ext': '.txt'
'path': ['/a/b/c/d', '/a/b/c', '/a/b', '/a', '/'], ,
'subdir': ['d', 'c', 'b', 'a', '/']
}
"{path[2]}/changed/{subdir[0]}".format(**res) = '/a/b/changed/d'
"{path[3]}/changed/{subdir[1]}".format(**res) = '/a/changed/c'
"""
def recursive_split (a_path):
"""
split the path into its subdirectories recursively
"""
if not len(a_path):
return [[],[]]
if a_path == "/" or a_path == "//":
return [ [a_path] , [a_path]]
sub_path_part, sub_dir_part = os.path.split(a_path)
if sub_dir_part:
sub_path_parts, sub_dir_parts = recursive_split (sub_path_part)
return [ [a_path] + sub_path_parts,
[sub_dir_part] + sub_dir_parts]
else:
return [ [] , ["/"]]
#
if not len(orig_path):
return {'path': [], 'basename': '', 'ext': '', 'subdir': []}
# stop normpath from being too clever and removing initial ./ and terminal slash, turning paths into filenames
if orig_path in [ "./", "/."]:
a_path = orig_path
else:
a_path = os.path.normpath(orig_path)
if orig_path[0:2] == "./" and a_path[0:2] != "./":
a_path = "./" + a_path
if orig_path[-1] == "/" and a_path[-1:] != "/":
a_path += "/"
path_part, file_part = os.path.split(a_path)
file_part, ext_part = os.path.splitext(file_part)
subpaths, subdirs = recursive_split (path_part)
return {'basename': file_part,
'ext': ext_part,
'subpath': subpaths,
'subdir': subdirs,
'path': path_part}
#_________________________________________________________________________________________
#
# get_nth_nested_level_of_path
#
#_________________________________________________________________________________________
def get_nth_nested_level_of_path (orig_path, n_levels):
"""
Return path with up to N levels of subdirectories
0 = full path
N = 1 : basename
N = 2 : basename + one subdirectory
For example
0 /test/this/now/or/not.txt
1 not.txt
2 or/not.txt
3 now/or/not.txt
4 this/now/or/not.txt
5 test/this/now/or/not.txt
6 /test/this/now/or/not.txt
7 /test/this/now/or/not.txt
"""
if not n_levels or n_levels < 0:
return orig_path
res = path_decomposition(orig_path)
basename = res["basename"] + res["ext"]
shortened_path = os.path.join(*(list(reversed(res["subdir"][0:(n_levels - 1)]))+[basename]))
if len(shortened_path) < len(orig_path):
return ".../" + shortened_path
#_________________________________________________________________________________________
#
# swap_nesting_order
#
#_________________________________________________________________________________________
def swap_nesting_order (orig_coll):
"""
Reverse nested order so that coll[3]['a'] becomes coll['a'][3]
"""
new_dict = defaultdict(dict)
new_list = []
for ii, ii_item in enumerate(orig_coll):
for jj, value in ii_item.items():
if isinstance(jj, int):
# resize
new_list += [{}]*(jj + 1 - len(new_list))
new_list[jj][ii] = value
else:
new_dict[jj][ii] = value
return new_list, dict(new_dict)
#_________________________________________________________________________________________
#
# swap_doubly_nested_order
#
#_________________________________________________________________________________________
def swap_doubly_nested_order (orig_coll):
"""
Reverse nested order so that coll[3]['a'] becomes coll['a'][3]
"""
new_dict = dict()
new_list = []
for ii, ii_item in enumerate(orig_coll):
for jj, jj_item in enumerate(ii_item):
for kk, value in jj_item.items():
if isinstance(kk, int):
# resize
new_list += [{}]*(kk + 1 - len(new_list))
if ii not in new_list[kk]:
new_list[kk][ii] = dict()
new_list[kk][ii][jj] = value
else:
if kk not in new_dict:
new_dict[kk] = dict()
if ii not in new_dict[kk]:
new_dict[kk][ii] = dict()
new_dict[kk][ii][jj] = value
return new_list, new_dict
#_________________________________________________________________________________________
#
# regex_match_str
#
#_________________________________________________________________________________________
def regex_match_str(test_str, compiled_regex):
"""
Returns result of regular expression match in a dictionary
combining both named and unnamed captures
"""
if compiled_regex:
if isinstance(compiled_regex, path_str_type):
compiled_regex = re.compile(compiled_regex)
mm = compiled_regex.search(test_str)
# Match failed
if mm is None:
return False
else:
# No capture
if mm.lastindex is None:
return {0: mm.group(0)}
# Combined named and unnamed captures
else:
# no dictionary comprehensions in python 2.6 :-(
#matchdicts.append({i : mm.group(i) for i in (range(mm.lastindex) + mm.groupdict().keys())})
return dict((i, mm.group(i)) for i in (chain( iter(range(mm.lastindex + 1)),
iter(mm.groupdict().keys()))))
else:
return None
#_________________________________________________________________________________________
#
# path_decomposition_regex_match
#
#_________________________________________________________________________________________
def path_decomposition_regex_match (test_str, compiled_regex):
"""
Returns a dictionary identifying the components of a file path.
This includes both the components of a path:
basename: (any) base (file) name of the path not including the extension. No slash included
ext: (any) extension of the path including the "."
path: a list of subpaths created by removing subdirectory names
subdir: a list of subdirectory names from the most nested to the root
and regular expression matches
The keys are the index or name of the capturing group.
If compiled_regexes is not specified, return path decomposition only
If compiled_regexes is specified, and the corresponding regular expression does not match,
the entire match fails
For example
path_decomposition_regex_match("/a/b/c/sample1.bam", r"(.*)(?P<id>\d+)\..+")
{
0: '/a/b/c/sample1.bam', // captured by index
1: '/a/b/c/sample', // captured by index
'id': '1' // captured by name
'ext': '.bam',
'subdir': ['c', 'b', 'a', '/'],
'subpath': ['/a/b/c', '/a/b', '/a', '/'],
'path': '/a/b/c',
'basename': 'sample1',
},
path_decomposition_regex_match("dbsnp15.vcf", r"(.*)(?P<id>\d+)\..+")
{
0: 'dbsnp15.vcf', // captured by index
1: 'dbsnp1', // captured by index
'id': '5' // captured by name
'ext': '.vcf',
'subdir': [],
'path': [],
'basename': 'dbsnp15',
},
// fail
path_decomposition_regex_match("/test.txt", r"(.*)(?P<id>\d+)\..+")
{}
// path components only
path_decomposition_regex_match("/test.txt", None)
{
'ext': '.txt',
'subdir': ['/']
'subpath': ['/'],
'path': '/',
'basename': 'test',
}
"""
pp = path_decomposition(test_str)
# regular expression not specified
# just path
if compiled_regex is None:
return pp
rr = regex_match_str(test_str, compiled_regex)
# regular expression match failed
# nothing
if rr == False:
return {}
#
# regular expression matches override file decomposition values in
# case of clashes between predefined keys such as "basename" and
# regular expression named capture groups
#
pp.update(rr)
return pp
#_________________________________________________________________________________________
#
# check_compiled_regexes
#
#_________________________________________________________________________________________
def check_compiled_regexes (compiled_regexes, expected_num):
"""
check compiled_regexes are of the right type and number
"""
if compiled_regexes is None:
return [None] * expected_num
if not isinstance(compiled_regexes, list):
raise Exception("Expecting list of None and strings")
# pad compiled_regexes with None
if len(compiled_regexes) < expected_num:
compiled_regexes.extend([None] * (expected_num - len(compiled_regexes)))
# Turn strings to regular expression just in case
# We don't want to do this here because the error messages are not very nice:
# There is not much context left
compiled_regexes = [re.compile(rr) if isinstance(rr, path_str_type) else rr for rr in compiled_regexes]
# check types
regex_types = type(re.compile("")), type(None)
for rr in compiled_regexes:
if not isinstance(rr, regex_types):
raise Exception("Unexpected type %s ('%s') specified in regular expression list. Expecting string or compiled regular expression" % (type(rr), rr))
return compiled_regexes
#_________________________________________________________________________________________
#
# get_all_paths_components
#
#_________________________________________________________________________________________
def get_all_paths_components(paths, compiled_regexes):
"""
For each path in a list,
"""
#
# merge regular expression matches and path decomposition
#
compiled_regexes = check_compiled_regexes (compiled_regexes, len(paths))
return [path_decomposition_regex_match (pp, rr) for (pp, rr) in zip(paths, compiled_regexes)]
#_________________________________________________________________________________________
#
# apply_func_to_sequence
#
#_________________________________________________________________________________________
def apply_func_to_sequence(seq, func, tuple_of_conforming_types = (path_str_type,), tuple_of_sequences_types = (list, tuple, set)):
"""
Recurses into list/tuple/set sequences to apply func to conforming types
Non-conforming types are left alone
"""
if isinstance(seq, tuple_of_conforming_types):
return func(seq)
elif isinstance(seq, tuple_of_sequences_types):
return type(seq)(apply_func_to_sequence(pp, func, tuple_of_conforming_types, tuple_of_sequences_types) for pp in seq)
else:
return seq
#_________________________________________________________________________________________
#
# t_regex_replace
#
#_________________________________________________________________________________________
class t_regex_replace(object):
def __init__ (self, filename, regex_str, compiled_regex, regex_or_suffix):
self.regex_or_suffix = regex_or_suffix
self.compiled_regex = compiled_regex
self.regex_str = regex_str
self.filename = filename
def __call__(self, p):
#
# check if substitution pattern is mis-specified
#
if "\1"in p or "\2" in p :
raise error_unescaped_regular_expression_forms("['%s'] " % (p.replace("\1", r"\1").replace("\2", r"\2")) +
"The special regular expression characters "
r"\1 and \2 need to be 'escaped' in python. "
r"The easiest option is to use python 'raw' strings "
r"e.g. r'\1_in_a string\2'. See http://docs.python.org/library/re.html.")
#
# For suffix(), replaces the suffix part by adding leading r"\1" to the substitution pattern
#
# If r"\1" is specified, then we presume you know what you are doing...
#
if self.regex_or_suffix == SUFFIX_SUBSTITUTE:
if r"\1" not in p and r"\g<1>" not in p:
match_p = r"\g<1>" + p
else:
match_p = p
# throw exception if doesn't match regular expression at all
(res_str, cnt_replacements) = self.compiled_regex.subn(match_p, self.filename)
if cnt_replacements == 0:
raise error_input_file_does_not_match("File '%s' does not match suffix('%s') and pattern '%s'" % (self.filename, self.regex_str, p))
return res_str
#
# Normal substitution
#
# For suffix(), complete replacement by the specified pattern text
# only substitute if r"\1" or r"\g<1>" is specified
#
#
err_str = ""
try:
(res_str, cnt_replacements) = self.compiled_regex.subn(p, self.filename)
if cnt_replacements > 0:
return res_str
except re.error:
exceptionType, exceptionValue, exceptionTraceback = sys.exc_info()
err_str = str(exceptionValue)
raise fatal_error_input_file_does_not_match("File '%s' does not match regex('%s') and pattern '%s':\n\t%s\n" % (self.filename, self.regex_str, p, err_str))
except IndexError:
exceptionType, exceptionValue, exceptionTraceback = sys.exc_info()
err_str = str(exceptionValue)
raise fatal_error_input_file_does_not_match("File '%s' does not match regex('%s') and pattern '%s':\n\t%s\n" % (self.filename, self.regex_str, p, err_str))
#except (re.error, IndexError):
#err_str = str(sys.exc_info()[1]),
raise error_input_file_does_not_match("File '%s' does not match regex('%s') and pattern '%s'\n%s\n" % (self.filename, self.regex_str, p, err_str))
#_________________________________________________________________________________________
#
# t_formatter_replace
#
#_________________________________________________________________________________________
class t_formatter_replace(object):
def __init__ (self, filenames, regex_strings, compiled_regexes = None):
self.filenames = filenames
# get the full absolute, normalised paths
filenames = [os.path.abspath(f) for f in filenames]
self.path_regex_components = get_all_paths_components(filenames, compiled_regexes)
self.display_regex_strings = parameter_list_as_string(regex_strings)
def __call__(self, p):
# swapped nesting order makes the syntax easier to explain:
# The first level of indirection is always the path component
# So basename[0] is the file name for the first file
# This looks better than the normal 0[basename]
# some contortions because format decodes {0} as an offset into a list and not not a lookup into a dict...
dl, dd = swap_nesting_order(self.path_regex_components)
try:
return p.format(*dl, **dd)
except (KeyError, IndexError):
raise error_input_file_does_not_match("Missing key = {%s} in '%s'.\n input = %r,\n filter = formatter(%s)."
"."
% ( str(sys.exc_info()[1])[1:-1],
p,
self.display_regex_strings,
self.filenames))
#_________________________________________________________________________________________
#
# t_nested_formatter_replace
#
#_________________________________________________________________________________________
class t_nested_formatter_replace(object):
"""
Like t_formatter_replace but with one additional level of nesting
I.e. everything is a list comprehension!
For combinatorics @decorators
"""
def __init__ (self, filenames, regex_strings, compiled_regexes):
# make sure that we have the same level of nestedness for regular expressions and file names etc.
if len(filenames) != len(regex_strings) or len(filenames) != len(compiled_regexes):
raise Exception("Logic Error.")
self.filenames = filenames
# get the full absolute, normalised paths
filenames = [[os.path.abspath(f) for f in filegroups] for filegroups in filenames]
self.path_regex_components = [get_all_paths_components(f, r) for (f,r) in zip(filenames, compiled_regexes)]
self.display_regex_strs = [parameter_list_as_string(ss) for ss in regex_strings]
def __call__(self, p):
# swapped nesting order makes the syntax easier to explain:
# The first level of indirection is always the path component
# So basename[0] is the file name for the first file
# This looks better than the normal 0[basename]
# some contortions because format decodes {0} as an offset into a list and not not a lookup into a dict...
dl, dd = swap_doubly_nested_order(self.path_regex_components)
try:
return p.format(*dl, **dd)
except (KeyError, IndexError):
formatter_str = ", ".join("formatter(%s)" % ss for ss in self.display_regex_strs)
raise error_input_file_does_not_match("Unmatched field %s in ('%s') using %s fails to match Files '%s'"
"."
% ( str(sys.exc_info()[1]),
p,
formatter_str,
self.filenames))
#_________________________________________________________________________________________
#
# t_nested_string_replace
#
#_________________________________________________________________________________________
class t_nested_string_replace(object):
"""
Replaces path with directory
"""
def __init__(self, prev_str, new_str):
self.prev_str = prev_str
self.new_str = new_str
def __call__(self, p):
return p.replace(prev_str, new_str)
#_________________________________________________________________________________________
#
# regex_replace
#
#_________________________________________________________________________________________
#
# Perform normal regular expression substitution
#
REGEX_SUBSTITUTE = 0
#
# An extra peculiar mode to help suffix along:
# Suffix regular expression have an implicit capture for everything up to the specified
# suffix text
#
# By default, replaces the suffix part by adding leading r"\1" to the substitution pattern
# If r"\1" is already specified in the pattern, then we presume you know what
# you are doing, and will let you get along with it
#
SUFFIX_SUBSTITUTE = 1
#
# REGEX_SUBSTITUTE is used for suffix() matches in 'extra' arguments (additional to output)
# which are strings
#
# Complete replacement happens. If you wish to retain the prefix text
# before the suffix, you can do so by adding r"\1"
#
def regex_replace(filename, regex_str, compiled_regex, substitution_patterns, regex_or_suffix = REGEX_SUBSTITUTE):
return apply_func_to_sequence(substitution_patterns, t_regex_replace(filename, regex_str, compiled_regex, regex_or_suffix))
def formatter_replace (filenames, regex_str, compiled_regex, substitution_patterns):
return apply_func_to_sequence(substitution_patterns, t_formatter_replace(filenames, regex_str, compiled_regex))
def nested_formatter_replace (filenames, regex_strings, compiled_regexes, substitution_patterns):
return apply_func_to_sequence(substitution_patterns, t_nested_formatter_replace(filenames, regex_strings, compiled_regexes))
def nested_string_replace (prev_str, new_str, substitution_patterns):
return apply_func_to_sequence(substitution_patterns, t_nested_string_replace(prev_str, new_str))
#_________________________________________________________________________________________
# non_str_sequence
#_________________________________________________________________________________________
def non_str_sequence (arg):
"""
Whether arg is a sequence.
We treat strings / dicts however as a singleton not as a sequence
"""
#will only dive into list and set, everything else is not regarded as a sequence
#loss of flexibility but more conservative
#if (isinstance(arg, (basestring, dict, multiprocessing.managers.DictProxy))):
if (not isinstance(arg, (list, tuple, set))):
return False
try:
test = iter(arg)
return True
except TypeError:
return False
#_________________________________________________________________________________________
# get_strings_in_flattened_sequence_aux
# helper function for next function
#_________________________________________________________________________________________
def get_strings_in_flattened_sequence_aux(p, l = None):
"""
Unravels arbitrarily nested sequence and returns lists of strings
"""
if l is None:
l = []
if isinstance(p, path_str_type):
l.append(p)
elif non_str_sequence (p):
for pp in p:
get_strings_in_flattened_sequence_aux(pp, l)
return l
#_________________________________________________________________________________________
# non_str_sequence
#_________________________________________________________________________________________
def get_strings_in_flattened_sequence (p):
"""
Traverses nested sequence and for each element, returns first string encountered
"""
if p is None:
return []
#
# string is returned as list of single string
#
if isinstance(p, path_str_type):
return [p]
#
# Get all strings flattened into list
#
return get_strings_in_flattened_sequence_aux(p)
#_________________________________________________________________________________________
# get_first_string_in_nested_sequence
#_________________________________________________________________________________________
def get_first_string_in_nested_sequence (p):
strings = get_strings_in_flattened_sequence (p)
if len(strings):
return strings[0]
return None
#
# TODOOO third object could be a dict or a list
#
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# Encoders: turn objects and filenames into a more presentable format
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
def ignore_unknown_encoder(obj):
if non_str_sequence (obj):
return "[%s]" % ", ".join(map(ignore_unknown_encoder, obj))
try:
s= str(obj)
if " object" in s and s[0] == '<' and s[-1] == '>':
pos = s.find(" object")
s = "<" + s[1:pos].replace("__main__.", "") + ">"
return s.replace('"', "'")
except:
return "<%s>" % str(obj.__class__).replace('"', "'")
#_________________________________________________________________________________________
#
# shorten_filenames_encoder
#________________________________________________________________________________________
def shorten_filenames_encoder (obj, n_levels = 2):
"""
Convert a set of parameters into a string
Paths with > N levels of nested-ness are truncated
"""
#
# if < 0, nest by 2
#
if n_levels < 0:
desired_len = - n_levels
prev_encoded_len = 0
#
# try more and more nestedness up to 9 if that fits inside desired length
# stop when increasing nestedness makes no difference
#
for nestedness in range(1, 20):
res = shorten_filenames_encoder (obj, nestedness)
if len(res) > desired_len or "..." not in res:
break
prev_encoded_len = len(res)
desired_len = max(4, desired_len - 5)
offset = len(res) - desired_len
if offset < 0:
return res
return "<???> " + res[offset:]
#
# Recurse into lists and tuples
#
if non_str_sequence (obj):
return "[%s]" % ", ".join(map(shorten_filenames_encoder, obj, [n_levels] * len(obj)))
#
# Only shorten strings
#
if not isinstance(obj, path_str_type):
return ignore_unknown_encoder(obj)
#
# level = 0 means return full absolute path
#
if not n_levels:
return ignore_unknown_encoder(os.path.abspath(obj))
#
# Shorten both relative and absolute (full) paths
#
# if within bounds, return that
if obj[1:].count('/') < n_levels:
return ignore_unknown_encoder(obj)
# use relative path if that has <= nested level
rel_path = os.path.relpath(obj)
if rel_path.count('/') <= n_levels:
#print >>sys.stderr, "relative path only one nested level"
return ignore_unknown_encoder(rel_path)
# get last N nested levels
#print >>sys.stderr, "full path last N nested level"
return ignore_unknown_encoder(get_nth_nested_level_of_path (obj, n_levels))
#_________________________________________________________________________________________
#
# get_tasks_filename_globs_in_nested_sequence
#
#________________________________________________________________________________________
glob_letters = set('*[]?')
def is_glob(s):
"""Check whether 's' contains ANY of glob chars"""
return len(glob_letters.intersection(s)) > 0
#_________________________________________________________________________________________
#
# get_nested_tasks_or_globs
#
#________________________________________________________________________________________
def get_nested_tasks_or_globs(p, treat_strings_as_tasks = False, runtime_data_names=None, tasks=None, globs = None):
"""
Get any tasks or globs which are within parameter
tasks are returned as functions or function names
"""
#
# create storage if this is not a recursive call
#
if globs is None:
runtime_data_names, tasks, globs = set(), list(), set()
#
# task function
#
if (isinstance(p, collections.Callable)):
tasks.append(p)
elif p.__class__.__name__ == 'Task' or p.__class__.__name__ == 'Pipeline':
tasks.append(p)
elif isinstance(p, runtime_parameter):
runtime_data_names.add(p)
#
# output_from treats all arguments as tasks or task names
#
elif isinstance(p, output_from):
for pp in p.args:
get_nested_tasks_or_globs(pp, True, runtime_data_names, tasks, globs)
elif isinstance(p, path_str_type):
if treat_strings_as_tasks:
tasks.append(p)
elif is_glob(p):
globs.add(p)
elif non_str_sequence (p):
for pp in p:
get_nested_tasks_or_globs(pp, treat_strings_as_tasks, runtime_data_names, tasks, globs)
return tasks, globs, runtime_data_names
#_________________________________________________________________________________________
#
# replace_placeholders_with_tasks_in_input_params
#
#________________________________________________________________________________________
def replace_placeholders_with_tasks_in_input_params(p, func_or_name_to_task, treat_strings_as_tasks = False):
"""
Replaces task functions or task name (strings) with the tasks they represent
Also replaces Tasks and Pipelines with the correct Tasks
func_or_name_to_task are a dictionary of function and task names to tasks
"""
if p.__class__.__name__ == 'Pipeline':
return func_or_name_to_task["PIPELINE=%s=PIPELINE" % p.name]
if p.__class__.__name__ == 'Task' and p in func_or_name_to_task:
return func_or_name_to_task[p]
#
# Expand globs or tasks as a list only if they are top level
#
if isinstance(p, collections.Callable):
#if type(p) == types.FunctionType:
return func_or_name_to_task[p]
#
# output_from treats all arguments as tasks or task names
#
if isinstance(p, output_from):
if len(p.args) == 1:
return replace_placeholders_with_tasks_in_input_params(p.args[0], func_or_name_to_task, True)
else:
return [replace_placeholders_with_tasks_in_input_params(pp, func_or_name_to_task, True) for pp in p.args]
#
# strings become tasks if treat_strings_as_tasks
#
if isinstance(p, path_str_type):
if treat_strings_as_tasks:
return func_or_name_to_task[p]
return p
#
# No conversions within dictionaries
#
if isinstance(p, dict):
return p
#
# Other sequences are recursed down
#
elif non_str_sequence(p):
l = list()
for pp in p:
#
# To be intuitive:
# arguments wrapped by output_from are always treated "in-line"
# e.g. 1, output_from("a") => 1, task_a
# e.g. 1, output_from("a", 2) => 1, task_a, 2
#
if isinstance(pp, output_from):
if len(pp.args) > 1:
l.extend(tuple(replace_placeholders_with_tasks_in_input_params(pp, func_or_name_to_task, True)))
elif len(pp.args) == 1:
l.append(replace_placeholders_with_tasks_in_input_params(pp.args[0], func_or_name_to_task, True))
# else len(pp.args) == 0 !! do nothing
else:
l.append(replace_placeholders_with_tasks_in_input_params(pp, func_or_name_to_task, treat_strings_as_tasks))
return type(p)(l)
#
# No expansions of non-string/non-sequences
#
else:
return p
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# compiling regular expressions
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
#_________________________________________________________________________________________
# suffix
#_________________________________________________________________________________________
class suffix(object):
def __init__ (self, *args):
self.args = args
def __repr__ (self, *args):
return 'suffix%r' % (self.args,)
#_________________________________________________________________________________________
# regex
#_________________________________________________________________________________________
class regex(object):
def __init__ (self, *args):
self.args = args
def __repr__ (self, *args):
return 'regex%r' % (self.args,)
#_________________________________________________________________________________________
# regex
#_________________________________________________________________________________________
class formatter(object):
def __init__ (self, *args):
self.args = args
def __repr__ (self, *args):
return 'formatter%r' % (self.args,)
#_________________________________________________________________________________________
# wrap_exception_as_string
#_________________________________________________________________________________________
def wrap_exception_as_string ():
"""
return exception as string to be rethrown
"""
exceptionType, exceptionValue, exceptionTraceback = sys.exc_info()
msg = "%s.%s" % (exceptionType.__module__, exceptionType.__name__)
exception_value = str(exceptionValue)
if len(exception_value):
return msg + ": (%s)" % exception_value
return msg
#_________________________________________________________________________________________
# compile_formatter
#_________________________________________________________________________________________
def compile_formatter(enclosing_task, formatter_obj, error_object, descriptor_string):
"""
Given list of [string|None]
Return compiled regular expressions.
"""
compiled_regexes = []
for ss in formatter_obj.args:
# ignore None
if ss is None:
compiled_regexes.append(None)
continue
formatter_args = str(formatter_obj.args)[1:-1]
# regular expression should be strings
if not isinstance(ss, path_str_type):
raise error_object(enclosing_task, ("{descriptor_string}: "
"formatter({formatter_args}) is malformed\n"
"formatter(...) should only be used to wrap "
'regular expression strings or None (not "{ss}")')
.format(descriptor_string = descriptor_string,
formatter_args = formatter_args,
ss = ss)
)
try:
compiled_regexes.append(re.compile(ss))
except:
raise error_object(enclosing_task, ("{descriptor_string}: "
"in formatter({formatter_args}) \n"
'regular expression "{ss}" is malformed\n'
"[{except_str}]")
.format(descriptor_string = descriptor_string,
formatter_args = formatter_args,
ss = ss,
except_str = wrap_exception_as_string())
)
return compiled_regexes
#_________________________________________________________________________________________
# compile_regex
#_________________________________________________________________________________________
def compile_regex(enclosing_task, regex, error_object, descriptor_string, regex_object_name = "regex"):
"""
throw error unless regular expression compiles
"""
if not len(regex.args) or len(regex.args) > 1 or not isinstance(regex.args[0], path_str_type):
regex_str = str(regex.args)
if len(regex.args) > 1:
regex_str = regex_str[1:-1]
elif len(regex.args) == 0:
regex_str = ''
else:
regex_str = regex_str
raise error_object(enclosing_task, ("{descriptor_string}: "
"{regex_object_name}({regex_str}) is malformed\n"
"{regex_object_name}(...) should only be used to wrap a single regular expression string")
.format(descriptor_string = descriptor_string,
regex_str = regex_str,
regex_object_name = regex_object_name)
)
try:
matching_regex = re.compile(regex.args[0])
return matching_regex
except:
raise error_object(enclosing_task, ("{descriptor_string}: "
"regular expression {regex_object_name}('{regex_str}') is malformed\n"
"[{except_str}]")
.format(descriptor_string = descriptor_string,
regex_object_name = regex_object_name,
regex_str = regex.args[0],
except_str = wrap_exception_as_string())
)
#_________________________________________________________________________________________
# compile_suffix
#_________________________________________________________________________________________
def compile_suffix(enclosing_task, regex, error_object, descriptor_string):
"""
throw error unless regular expression compiles
"""
if not len(regex.args):
raise error_object(enclosing_task, "%s: " % descriptor_string +
"suffix() is malformed.\n" +
"suffix(...) should be used to wrap a string matching the suffices of file names")
if len(regex.args) > 1 or not isinstance(regex.args[0], path_str_type):
raise error_object(enclosing_task, "%s: " % descriptor_string +
"suffix('%s') is malformed.\n" % (regex.args,) +
"suffix(...) should only be used to wrap a single string matching the suffices of file names")
try:
matching_regex = re.compile("(.*)" + re.escape(regex.args[0]) + "$")
return matching_regex
except:
raise error_object(enclosing_task, "%s: " % descriptor_string +
"suffix('%s') is somehow malformed\n" % regex.args[0] +
"[%s]" % wrap_exception_as_string())
#_________________________________________________________________________________________
# check_parallel_parameters
#_________________________________________________________________________________________
def check_parallel_parameters (enclosing_task, params, error_object):
"""
Helper function for @files
Checks format of parameters and
whether there are input and output files specified for each job
"""
if not len(params):
raise Exception("@parallel parameters is empty.")
for job_param in params:
if isinstance(job_param, path_str_type):
message = ("Wrong syntax for @parallel.\n"
"@parallel(%s)\n" % ignore_unknown_encoder(params) +
"If you are supplying parameters for a task "
"running as a single job, "
"either don't put enclosing brackets at all (with each parameter "
"separated by commas) or enclose all parameters as a nested list of "
"lists, e.g. [['input', 'output' ...]]. "
)
raise error_object(enclosing_task, message)
#_________________________________________________________________________________________
# check_files_io_parameters
#_________________________________________________________________________________________
def check_files_io_parameters (enclosing_task, params, error_object):
"""
Helper function for @files
Checks format of parameters and
whether there are input and output files specified for each job
"""
#if not len(params):
# raise Exception("@files I/O parameters is empty.")
try:
for job_param in params:
if isinstance(job_param, path_str_type):
raise TypeError
if len(job_param) < 1:
raise error_object(enclosing_task, "Missing input files for job " +
ignore_unknown_encoder(job_param))
if len(job_param) < 2:
raise error_object(enclosing_task, "Missing output files for job " +
ignore_unknown_encoder(job_param))
#if len(get_strings_in_flattened_sequence(job_param[0:2])) == 0:
# raise error_object(enclosing_task, "Input or output file parameters should "
# "contain at least one or more file names strings. "
# "Consider using @parallel if you are not using files. " +
# ignore_unknown_encoder(job_param))
except TypeError:
#
# job_param was not a list
#
message = ("Wrong syntax for @files.\n@files(%s)\n" % ignore_unknown_encoder(params) +
"If you are supplying parameters for a task "
"running as a single job, "
"either don't put enclosing brackets at all (with each parameter "
"separated by commas) or enclose all parameters as a nested list of "
"lists, e.g. [['input', 'output' ...]]. "
)
raise error_object(enclosing_task, message)
#_________________________________________________________________________________________
#
# expand_nested_tasks_or_globs
#
#________________________________________________________________________________________
def expand_nested_tasks_or_globs(p, tasksglobs_to_filenames):
"""
Expand globs and tasks "in-line", unless they are the top level, in which case turn
it into a list
N.B. Globs are only expanded if they are in tasksglobs_to_filenames
This function is called for @split descriptors which leave output globs untouched
for clarity. Thanks to Noah Spies for spotting this!
"""
#
# Expand globs or tasks as a list only if they are top level
#
if ( (isinstance(p, path_str_type) and is_glob(p) and p in tasksglobs_to_filenames) or
p.__class__.__name__ == 'Task' or
isinstance(p, runtime_parameter) ):
return tasksglobs_to_filenames[p]
#
# No expansions of strings and dictionaries
#
if isinstance(p, (path_str_type, dict)):
return p
#
# Other sequences are recursed down
#
elif non_str_sequence(p):
l = list()
for pp in p:
if (isinstance(pp, path_str_type) and pp in tasksglobs_to_filenames):
l.extend(tasksglobs_to_filenames[pp])
elif pp.__class__.__name__ == 'Task' or isinstance(pp, runtime_parameter):
files = tasksglobs_to_filenames[pp]
# task may have produced a single output: in which case append
if non_str_sequence(files):
l.extend(files)
else:
l.append(files)
else:
l.append(expand_nested_tasks_or_globs(pp, tasksglobs_to_filenames))
return type(p)(l)
#
# No expansions of non-string/non-sequences
#
else:
return p
#_________________________________________________________________________________________
# get_parsed_arguments_str_for_errors
# helper funciton for parse_task_arguments()
#_________________________________________________________________________________________
def get_parsed_arguments_str_for_errors (task_description, bad_arg_str, unnamed_result_strs, named_result_strs):
"""
Helper function for parse_task_arguments
Prints out offending argument (bad_arg_str) in the context of already parsed
arguments so that we can quickly figure out where the error is coming from
"""
indent = task_description.find("(") + 1
parsed_arg_str = ", ".join(unnamed_result_strs + named_result_strs)
# make function names clearer in arg list
parsed_arg_str = re.sub(r"<function (\w+) at 0x[0-9a-f]+>", r"\1", parsed_arg_str)
return "\n" + task_description % (parsed_arg_str + ", ...\n" +
# mark out problem
(" " * (indent-5 if indent - 5 > 0 else 0)) + "===> " +
bad_arg_str)
#_________________________________________________________________________________________
# parse_task_arguments
#_________________________________________________________________________________________
def parse_task_arguments ( orig_unnamed_arguments, orig_named_arguments, expected_arguments, task_description):
"""
Parse arguments parsed into decorators or Pipeline.transform etc.
Special handling for optional arguments in the middle of argument list
1) @product
can have (input, filter, input1, filter1, input2, filter2....)
2) @transform, @subdivide, @collate, @product, @combinatorics which have
(..., [add_inputs(...)|inputs(...)],...)
or ([add_inputs=...|replace_inputs=...])
or ([add_inputs=add_inputs(...)|replace_inputs=inputs(...)])
Special handling for variable number of arguments at the end of the argument list
which all become "extras"
#!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
#
# N.B. Missing non-mandatory arguments are returned as an empty list
#
#!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
"""
results = {}
unnamed_arguments = list(orig_unnamed_arguments)
named_arguments = dict(orig_named_arguments)
# parsed results in string form for error messages
unnamed_result_strs = []
named_result_strs = []
#________________________________________________________________________________________
#
# parse_add_inputs()
#
#________________________________________________________________________________________
def parse_add_inputs_args(parsed_arg, input_type, arg_name, modify_inputs_mode, result_strs):
"""
Parse arguments for add_inputs and replace_inputs, i.e. 'inputs()' and 'add_inputs()'
input_type =inputs|add_inputs
arg_name = replace_inputs | add_inputs
modify_inputs_mode = t_extra_inputs.REPLACE_INPUTS| t_extra_inputs.ADD_TO_INPUTS
"""
results["modify_inputs_mode"] = modify_inputs_mode
if input_type == inputs:
# inputs() only takes a single argument. Throw error otherwise
if len(parsed_arg.args) != 1:
err_msg = "inputs() expects a single argument:\n%s" % (
get_parsed_arguments_str_for_errors(task_description, # bad arg in context of parsed
"%s%r" % (input_type.__name__, tuple(parsed_arg.args)),
unnamed_result_strs,
named_result_strs))
#print (err_msg, file=sys.stderr)
raise error_inputs_multiple_args(err_msg)
# unpack add_inputs / inputs and save results
results["modify_inputs"] = parsed_arg.args[0]
else:
results["modify_inputs"] = parsed_arg.args
result_strs.append("%s=%r" % (arg_name, parsed_arg.args))
#________________________________________________________________________________________
#
# check_argument_type
#
#________________________________________________________________________________________
def check_argument_type (arg_name, parsed_arg, argument_types):
"""
check if parsed_arg is right type
"""
if argument_types and not isinstance(parsed_arg, argument_types):
err_msg = ("The '%s' argument should be %s:\n%s" %
(arg_name, # argument name
" or ".join("%s" % tt.__name__ for tt in argument_types), # type names
get_parsed_arguments_str_for_errors(task_description, # bad arg in context of parsed
"%s = %r" % (arg_name, parsed_arg),
unnamed_result_strs, named_result_strs)))
#print (err_msg, file=sys.stderr)
raise TypeError(err_msg)
return parsed_arg
#________________________________________________________________________________________
#
# parse_argument
# helper function for parsing a single arguement
#________________________________________________________________________________________
def parse_argument (arg_name, expected_arguments, unnamed_arguments, named_arguments, results, task_description, mandatory, argument_types = None):
"""
All missing, non-mandatory are empty list
"""
# ignore if not on list
if not arg_name in expected_arguments:
return
#
# look among unnamed arguments first
#
if len(unnamed_arguments):
#
# check correct type
#
parsed_arg = check_argument_type (arg_name, unnamed_arguments[0], argument_types)
#
# Save parsed results
#
results[arg_name] = parsed_arg
unnamed_result_strs.append("%s=%r" % (arg_name, parsed_arg))
del unnamed_arguments[0]
#
# then named
#
elif arg_name in named_arguments:
#
# check correct type
#
parsed_arg = check_argument_type (arg_name, named_arguments[arg_name], argument_types)
#
# Save parsed results
#
results[arg_name] = parsed_arg
named_result_strs.append("%s=%r" % (arg_name, parsed_arg))
del named_arguments[arg_name]
#
# complain or ignore missing?
#
else:
if mandatory:
err_msg = "Missing '%s' argument:\n%s" % (
arg_name, # argument name
get_parsed_arguments_str_for_errors(task_description, # bad arg in
arg_name + " = ???",# context of parsed
unnamed_result_strs,
named_result_strs))
#print (err_msg, file=sys.stderr)
raise error_missing_args(err_msg)
#!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
#
# N.B. Missing non-mandatory arguments are returned as an empty list
#
#!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
else:
results[arg_name] = []
#
# Missing input is empty list
#
parse_argument ('input', expected_arguments, unnamed_arguments, named_arguments, results, task_description, mandatory = False)
#
# filter is mandatory if expected
#
parse_argument ('filter', expected_arguments, unnamed_arguments, named_arguments, results, task_description, mandatory = True, argument_types = (formatter, regex, suffix))
if "filter" in results:
if isinstance(results["filter"], suffix):
parse_argument ("output_dir", expected_arguments, [], named_arguments, results, task_description, mandatory = False)
#
# inputN
#
if 'inputN' in expected_arguments:
#
# put already parsed input and filter into the list
#
results["input"] = [results["input"]]
results["filter"] = [results["filter"]]
cnt_inputN = 1
#
# parse argument pairs at a time, so long as the second argument is a formatter
#
while len(unnamed_arguments) >= 2 and isinstance(unnamed_arguments[1], formatter):
filter_name = "filter%d" % (cnt_inputN + 1)
input_name = "input%d" % (cnt_inputN + 1)
unnamed_result_strs.append("%s=%r" % (input_name, unnamed_arguments[0]))
unnamed_result_strs.append("%s=%r" % (filter_name, unnamed_arguments[1]))
results["input"].append(unnamed_arguments[0])
results["filter"].append(unnamed_arguments[1])
cnt_inputN += 1
del unnamed_arguments[0:2]
#
# parse named arguments while there is a filter2, filter3 etc.
#
filter_name = "filter%d" % (cnt_inputN + 1)
input_name = "input%d" % (cnt_inputN + 1)
while filter_name in named_arguments:
results["filter"].append(named_arguments[filter_name])
named_result_strs.append("%s=%r" % (filter_name, named_arguments[filter_name]))
del named_arguments[filter_name]
# parse input2, input3 or leave blank as empty list
if input_name in named_arguments:
results["input"].append(named_arguments[input_name])
named_result_strs.append("%s=%r" % (input_name, named_arguments[input_name]))
del named_arguments[input_name]
else:
results["input"].append([])
cnt_inputN += 1
filter_name = "filter%d" % (cnt_inputN + 1)
input_name = "input%d" % (cnt_inputN + 1)
#
# tuple size is int and mandatory if exists
#
parse_argument ('tuple_size', expected_arguments, unnamed_arguments, named_arguments, results, task_description, mandatory = True, argument_types = (int,))
#
# add_inputs / inputs are optional
#
if 'modify_inputs' in expected_arguments:
results["modify_inputs_mode"] = t_extra_inputs.KEEP_INPUTS
results["modify_inputs"] = None
parse_add_inputs = ((inputs, "inputs", "replace_inputs", t_extra_inputs.REPLACE_INPUTS), (add_inputs, "add_inputs", "add_inputs", t_extra_inputs.ADD_TO_INPUTS))
if len(unnamed_arguments):
#
# Is add_inputs or inputs in unnamed arguments?
# Parse out contents and save in results["replace_inputs"] or results["add_inputs"]
#
for input_type, input_type_name, arg_name, modify_inputs_mode in parse_add_inputs:
parsed_arg = unnamed_arguments[0]
if isinstance(parsed_arg, input_type):
parse_add_inputs_args(parsed_arg, input_type, arg_name, modify_inputs_mode, unnamed_result_strs)
del unnamed_arguments[0]
break
#
# Otherwise is add_inputs or inputs in named arguments?
# Parse out contents only if necessary and save in results["replace_inputs"] or results["add_inputs"]
#
if results["modify_inputs_mode"] == t_extra_inputs.KEEP_INPUTS:
for input_type, input_type_name, arg_name, modify_inputs_mode in parse_add_inputs:
if arg_name in named_arguments:
parsed_arg = named_arguments[arg_name]
if isinstance(parsed_arg, input_type):
parse_add_inputs_args(parsed_arg, input_type, arg_name, modify_inputs_mode, named_result_strs)
else:
results["modify_inputs"] = parsed_arg
results["modify_inputs_mode"] = modify_inputs_mode
del named_arguments[arg_name]
break
#
# output is mandatory if exists
#
parse_argument ('output', expected_arguments, unnamed_arguments, named_arguments, results, task_description, mandatory = True)
#
# extras is mandatory if exists
#
if 'extras' in expected_arguments:
results['extras' ] = []
results['named_extras'] = {}
if len(unnamed_arguments):
# move list to results: remember python does shallow copies of lists
results['extras'] = unnamed_arguments
unnamed_result_strs.append("%s=%r" % ("extras", unnamed_arguments))
unnamed_arguments = []
#del unnamed_arguments[:]
elif 'extras' in named_arguments:
# Named extras only
if isinstance(named_arguments['extras'], dict):
results["named_extras"] = named_arguments['extras']
# Unnamed extras only
elif isinstance(named_arguments['extras'], list):
results["extras"] = named_arguments['extras']
# Wrong type: blow up
else:
err_msg = ("The extras paramter must be either a list of values\nor a dictionary of named parameter values:\n%s" %
get_parsed_arguments_str_for_errors(task_description,
"extras=%r" % (named_arguments['extras'],),
unnamed_result_strs,
named_result_strs))
raise error_extras_wrong_type(err_msg)
named_result_strs.append("%s=%r" % ("extras", named_arguments['extras']))
del named_arguments['extras']
if len(unnamed_arguments):
err_msg = ("Too many unnamed arguments leftover:\n%s" %
get_parsed_arguments_str_for_errors(task_description, # bad arg in context of parsed
(", ".join(("%r" % a) for a in unnamed_arguments)),
unnamed_result_strs, named_result_strs))
#print (err_msg, file=sys.stderr)
raise error_too_many_args(err_msg)
if len(named_arguments):
err_msg = ("Duplicate, conflicting or unrecognised arguments:\n%s" %
get_parsed_arguments_str_for_errors(task_description, # bad arg in context of parsed
", ".join("%s=%r" %(k, v) for k,v in named_arguments.items()),
unnamed_result_strs, named_result_strs))
#print (err_msg, file=sys.stderr)
raise error_too_many_args(err_msg)
return results
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# special markers used by @files_re
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
class combine(object):
def __init__ (self, *args):
self.args = args
class output_from(object):
def __init__ (self, *args):
self.args = args
def __repr__ (self, *args):
return 'output_from%r' % (self.args,)
class runtime_parameter(object):
def __init__ (self, *args):
if len(args) != 1 or not isinstance(args[0], path_str_type):
raise Exception("runtime_parameter takes the name of the run time parameter as a single string")
self.args = args
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
# Unit Testing code in test/test_ruffus_utility.py
#88888888888888888888888888888888888888888888888888888888888888888888888888888888888888888
|