Gustavo Picon is sharing code with you
Bitbucket is a code hosting site. Unlimited public and private repositories. Free for small teams.
Don't show this againdjango-treebeard / treebeard / tests.py
- Branch
- 1.6.X
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 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 | "Unit/Functional tests"
import functools
import os
from django.contrib.admin.options import ModelAdmin
from django.contrib.admin.sites import AdminSite
from django.test import TestCase
from django.db import models, transaction
from django.contrib.auth.models import User
from django.db.models import Q
from django.conf import settings
from django import VERSION as DJANGO_VERSION
from treebeard import numconv
from treebeard.exceptions import InvalidPosition, InvalidMoveToDescendant, \
PathOverflow, MissingNodeOrderBy
from treebeard.mp_tree import MP_Node
from treebeard.al_tree import AL_Node
from treebeard.ns_tree import NS_Node
from treebeard.forms import MoveNodeForm
# ghetto app detection, there is probably some introspection method,
# but meh, this works
HAS_DJANGO_AUTH = 'django.contrib.auth' in settings.INSTALLED_APPS
BASE_DATA = [
{'data':{'desc':'1'}},
{'data':{'desc':'2'}, 'children':[
{'data':{'desc':'21'}},
{'data':{'desc':'22'}},
{'data':{'desc':'23'}, 'children':[
{'data':{'desc':'231'}},
]},
{'data':{'desc':'24'}},
]},
{'data':{'desc':'3'}},
{'data':{'desc':'4'}, 'children':[
{'data':{'desc':'41'}},
]},
]
class MP_TestNode(MP_Node):
steplen = 3
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class MP_TestNodeSomeDep(models.Model):
node = models.ForeignKey(MP_TestNode)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class NS_TestNode(NS_Node):
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class NS_TestNodeSomeDep(models.Model):
node = models.ForeignKey(NS_TestNode)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class AL_TestNode(AL_Node):
parent = models.ForeignKey('self',
related_name='children_set',
null=True,
db_index=True)
sib_order = models.PositiveIntegerField()
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class AL_TestNodeSomeDep(models.Model):
node = models.ForeignKey(AL_TestNode)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class MP_TestNodeSorted(MP_Node):
steplen = 1
node_order_by = ['val1', 'val2', 'desc']
val1 = models.IntegerField()
val2 = models.IntegerField()
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class NS_TestNodeSorted(NS_Node):
node_order_by = ['val1', 'val2', 'desc']
val1 = models.IntegerField()
val2 = models.IntegerField()
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class AL_TestNodeSorted(AL_Node):
parent = models.ForeignKey('self',
related_name='children_set',
null=True,
db_index=True)
node_order_by = ['val1', 'val2', 'desc']
val1 = models.IntegerField()
val2 = models.IntegerField()
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class MP_TestNodeAlphabet(MP_Node):
steplen = 2
numval = models.IntegerField()
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class MP_TestNodeSmallStep(MP_Node):
steplen = 1
alphabet = '0123456789'
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class MP_TestNodeSortedAutoNow(MP_Node):
desc = models.CharField(max_length=255)
created = models.DateTimeField(auto_now_add=True)
node_order_by = ['created']
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
class MP_TestNodeShortPath(MP_Node):
steplen = 1
alphabet = '01234'
desc = models.CharField(max_length=255)
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
# This is how you change the default fields defined in a Django abstract class
# (in this case, MP_Node), since Django doesn't allow overriding fields, only
# mehods and attributes
MP_TestNodeShortPath._meta.get_field('path').max_length = 4
if DJANGO_VERSION >= (1, 1): # pragma: no cover
class MP_TestNode_Proxy(MP_TestNode):
class Meta:
proxy = True
class NS_TestNode_Proxy(NS_TestNode):
class Meta:
proxy = True
class AL_TestNode_Proxy(AL_TestNode):
class Meta:
proxy = True
class MP_TestSortedNodeShortPath(MP_Node):
steplen = 1
alphabet = '01234'
desc = models.CharField(max_length=255)
node_order_by = ['desc']
def __unicode__(self): # pragma: no cover
return 'Node %d' % self.id
MP_TestSortedNodeShortPath._meta.get_field('path').max_length = 4
if HAS_DJANGO_AUTH:
class MP_TestIssue14(MP_Node):
name = models.CharField(max_length=255)
users = models.ManyToManyField(User)
def testtype(treetype, proxy):
def decorator(f):
@functools.wraps(f)
def _testtype(self):
{'MP': self.set_MP,
'AL': self.set_AL,
'NS': self.set_NS}[treetype](proxy)
try:
f(self)
finally:
transaction.rollback()
self.model = None
self.sorted_model = None
self.dep_model = None
return _testtype
return decorator
def _load_test_methods(cls, proxy=True):
if proxy and DJANGO_VERSION >= (1, 1):
proxyopts = (False, True)
else:
proxyopts = (False,)
for m in dir(cls):
if not m.startswith('_multi_'):
continue
for t in ('MP', 'AL', 'NS'):
for p in proxyopts:
deco = testtype(t, p)
name = 'test_%s%s_%s' % (t.lower(),
'_proxy' if p else '',
m.split('_', 2)[2])
setattr(cls, name, deco(getattr(cls, m)))
class TestTreeBase(TestCase):
def setUp(self):
self.set_MP()
self.unchanged = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
def set_MP(self, proxy=False):
if proxy and DJANGO_VERSION >= (1, 1):
self.model = MP_TestNode_Proxy
else:
self.model = MP_TestNode
self.sorted_model = MP_TestNodeSorted
self.dep_model = MP_TestNodeSomeDep
def set_NS(self, proxy=False):
if proxy and DJANGO_VERSION >= (1, 1):
self.model = NS_TestNode_Proxy
else:
self.model = NS_TestNode
self.sorted_model = NS_TestNodeSorted
self.dep_model = NS_TestNodeSomeDep
def set_AL(self, proxy=False):
if proxy and DJANGO_VERSION >= (1, 1):
self.model = AL_TestNode_Proxy
else:
self.model = AL_TestNode
self.sorted_model = AL_TestNodeSorted
self.dep_model = AL_TestNodeSomeDep
def got(self):
nsmodels = [NS_TestNode]
if DJANGO_VERSION >= (1, 1):
nsmodels.append(NS_TestNode_Proxy)
if self.model in nsmodels:
# this slows down nested sets tests quite a bit, but it has the
# advantage that we'll check the node edges are correct
d = {}
for tree_id, lft, rgt in self.model.objects.values_list('tree_id',
'lft',
'rgt'):
d.setdefault(tree_id, []).extend([lft, rgt])
for tree_id, got_edges in d.items():
self.assertEqual(len(got_edges), max(got_edges))
good_edges = range(1, len(got_edges) + 1)
self.assertEqual(sorted(got_edges), good_edges)
return [(o.desc, o.get_depth(), o.get_children_count())
for o in self.model.get_tree()]
def _assert_get_annotated_list(self, expected, parent=None):
got = [
(obj[0].desc, obj[1]['open'], obj[1]['close'], obj[1]['level'])
for obj in self.model.get_annotated_list(parent)]
self.assertEqual(expected, got)
class TestEmptyTree(TestTreeBase):
def _multi_load_bulk_empty(self):
ids = self.model.load_bulk(BASE_DATA)
got_descs = [obj.desc
for obj in self.model.objects.filter(id__in=ids)]
expected_descs = [x[0] for x in self.unchanged]
self.assertEqual(sorted(got_descs), sorted(expected_descs))
self.assertEqual(self.got(), self.unchanged)
def _multi_dump_bulk_empty(self):
self.assertEqual(self.model.dump_bulk(), [])
def _multi_add_root_empty(self):
self.model.add_root(desc='1')
expected = [(u'1', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_get_root_nodes_empty(self):
got = self.model.get_root_nodes()
expected = []
self.assertEqual([node.desc for node in got], expected)
def _multi_get_first_root_node_empty(self):
got = self.model.get_first_root_node()
self.assertEqual(got, None)
def _multi_get_last_root_node_empty(self):
got = self.model.get_last_root_node()
self.assertEqual(got, None)
def _multi_get_tree(self):
got = list(self.model.get_tree())
self.assertEqual(got, [])
def _multi_get_annotated_list(self):
expected = []
self._assert_get_annotated_list(expected)
class TestNonEmptyTree(TestTreeBase):
def setUp(self):
super(TestNonEmptyTree, self).setUp()
MP_TestNode.load_bulk(BASE_DATA)
AL_TestNode.load_bulk(BASE_DATA)
NS_TestNode.load_bulk(BASE_DATA)
class TestClassMethods(TestNonEmptyTree):
def setUp(self):
super(TestClassMethods, self).setUp()
def _multi_load_bulk_existing(self):
# inserting on an existing node
node = self.model.objects.get(desc=u'231')
ids = self.model.load_bulk(BASE_DATA, node)
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 4),
(u'1', 4, 0),
(u'2', 4, 4),
(u'21', 5, 0),
(u'22', 5, 0),
(u'23', 5, 1),
(u'231', 6, 0),
(u'24', 5, 0),
(u'3', 4, 0),
(u'4', 4, 1),
(u'41', 5, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
expected_descs = [u'1', u'2', u'21', u'22', u'23', u'231', u'24',
u'3', u'4', u'41']
got_descs = [obj.desc
for obj in self.model.objects.filter(id__in=ids)]
self.assertEqual(sorted(got_descs), sorted(expected_descs))
self.assertEqual(self.got(), expected)
def _multi_get_tree_all(self):
got = [(o.desc, o.get_depth(), o.get_children_count())
for o in self.model.get_tree()]
self.assertEqual(got, self.unchanged)
def _multi_dump_bulk_all(self):
self.assertEqual(self.model.dump_bulk(keep_ids=False), BASE_DATA)
def _multi_get_tree_node(self):
node = self.model.objects.get(desc=u'231')
self.model.load_bulk(BASE_DATA, node)
# the tree was modified by load_bulk, so we reload our node object
node = self.model.objects.get(pk=node.id)
got = [(o.desc, o.get_depth(), o.get_children_count())
for o in self.model.get_tree(node)]
expected = [(u'231', 3, 4),
(u'1', 4, 0),
(u'2', 4, 4),
(u'21', 5, 0),
(u'22', 5, 0),
(u'23', 5, 1),
(u'231', 6, 0),
(u'24', 5, 0),
(u'3', 4, 0),
(u'4', 4, 1),
(u'41', 5, 0)]
self.assertEqual(got, expected)
def _multi_get_tree_leaf(self):
node = self.model.objects.get(desc=u'1')
self.assertEqual(0, node.get_children_count())
got = [(o.desc, o.get_depth(), o.get_children_count())
for o in self.model.get_tree(node)]
expected = [(u'1', 1, 0)]
self.assertEqual(got, expected)
def _multi_get_annotated_list_all(self):
expected = [(u'1', True, [], 0), (u'2', False, [], 0),
(u'21', True, [], 1), (u'22', False, [], 1),
(u'23', False, [], 1), (u'231', True, [0], 2),
(u'24', False, [0], 1), (u'3', False, [], 0),
(u'4', False, [], 0), (u'41', True, [0, 1], 1)]
self._assert_get_annotated_list(expected)
def _multi_get_annotated_list_node(self):
node = self.model.objects.get(desc=u'2')
expected = [(u'2', True, [], 0), (u'21', True, [], 1),
(u'22', False, [], 1), (u'23', False, [], 1),
(u'231', True, [0], 2), (u'24', False, [0, 1], 1)]
self._assert_get_annotated_list(expected, node)
def _multi_get_annotated_list_leaf(self):
node = self.model.objects.get(desc=u'1')
expected = [(u'1', True, [0], 0)]
self._assert_get_annotated_list(expected, node)
def _multi_dump_bulk_node(self):
node = self.model.objects.get(desc=u'231')
self.model.load_bulk(BASE_DATA, node)
# the tree was modified by load_bulk, so we reload our node object
node = self.model.objects.get(pk=node.id)
got = self.model.dump_bulk(node, False)
expected = [{'data':{'desc':u'231'}, 'children':BASE_DATA}]
self.assertEqual(got, expected)
def _multi_load_and_dump_bulk_keeping_ids(self):
exp = self.model.dump_bulk(keep_ids=True)
self.model.objects.all().delete()
self.model.load_bulk(exp, None, True)
got = self.model.dump_bulk(keep_ids=True)
self.assertEqual(got, exp)
# do we really have an unchaged tree after the dump/delete/load?
got = [(o.desc, o.get_depth(), o.get_children_count())
for o in self.model.get_tree()]
self.assertEqual(got, self.unchanged)
def _multi_get_root_nodes(self):
got = self.model.get_root_nodes()
expected = ['1', '2', '3', '4']
self.assertEqual([node.desc for node in got], expected)
def _multi_get_first_root_node(self):
got = self.model.get_first_root_node()
self.assertEqual(got.desc, '1')
def _multi_get_last_root_node(self):
got = self.model.get_last_root_node()
self.assertEqual(got.desc, '4')
def _multi_add_root(self):
obj = self.model.add_root(desc='5')
self.assertEqual(obj.get_depth(), 1)
self.assertEqual(self.model.get_last_root_node().desc, '5')
class TestSimpleNodeMethods(TestNonEmptyTree):
def _multi_is_root(self):
data = [
('2', True),
('1', True),
('4', True),
('21', False),
('24', False),
('22', False),
('231', False),
]
for desc, expected in data:
got = self.model.objects.get(desc=desc).is_root()
self.assertEqual(got, expected)
def _multi_is_leaf(self):
data = [
('2', False),
('23', False),
('231', True),
]
for desc, expected in data:
got = self.model.objects.get(desc=desc).is_leaf()
self.assertEqual(got, expected)
def _multi_get_root(self):
data = [
('2', '2'),
('1', '1'),
('4', '4'),
('21', '2'),
('24', '2'),
('22', '2'),
('231', '2'),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_root()
self.assertEqual(node.desc, expected)
def _multi_get_parent(self):
data = [
('2', None),
('1', None),
('4', None),
('21', '2'),
('24', '2'),
('22', '2'),
('231', '23'),
]
data = dict(data)
objs = {}
for desc, expected in data.items():
node = self.model.objects.get(desc=desc)
parent = node.get_parent()
if expected:
self.assertEqual(parent.desc, expected)
else:
self.assertEqual(parent, None)
objs[desc] = node
# corrupt the objects' parent cache
node._parent_obj = 'CORRUPTED!!!'
for desc, expected in data.items():
node = objs[desc]
# asking get_parent to not use the parent cache (since we
# corrupted it in the previous loop)
parent = node.get_parent(True)
if expected:
self.assertEqual(parent.desc, expected)
else:
self.assertEqual(parent, None)
def _multi_get_children(self):
data = [
('2', ['21', '22', '23', '24']),
('23', ['231']),
('231', []),
]
for desc, expected in data:
children = self.model.objects.get(desc=desc).get_children()
self.assertEqual([node.desc for node in children], expected)
def _multi_get_children_count(self):
data = [
('2', 4),
('23', 1),
('231', 0),
]
for desc, expected in data:
got = self.model.objects.get(desc=desc).get_children_count()
self.assertEqual(got, expected)
def _multi_get_siblings(self):
data = [
('2', ['1', '2', '3', '4']),
('21', ['21', '22', '23', '24']),
('231', ['231']),
]
for desc, expected in data:
siblings = self.model.objects.get(desc=desc).get_siblings()
self.assertEqual([node.desc for node in siblings], expected)
def _multi_get_first_sibling(self):
data = [
('2', '1'),
('1', '1'),
('4', '1'),
('21', '21'),
('24', '21'),
('22', '21'),
('231', '231'),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_first_sibling()
self.assertEqual(node.desc, expected)
def _multi_get_prev_sibling(self):
data = [
('2', '1'),
('1', None),
('4', '3'),
('21', None),
('24', '23'),
('22', '21'),
('231', None),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_prev_sibling()
if expected is None:
self.assertEqual(node, None)
else:
self.assertEqual(node.desc, expected)
def _multi_get_next_sibling(self):
data = [
('2', '3'),
('1', '2'),
('4', None),
('21', '22'),
('24', None),
('22', '23'),
('231', None),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_next_sibling()
if expected is None:
self.assertEqual(node, None)
else:
self.assertEqual(node.desc, expected)
def _multi_get_last_sibling(self):
data = [
('2', '4'),
('1', '4'),
('4', '4'),
('21', '24'),
('24', '24'),
('22', '24'),
('231', '231'),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_last_sibling()
self.assertEqual(node.desc, expected)
def _multi_get_first_child(self):
data = [
('2', '21'),
('21', None),
('23', '231'),
('231', None),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_first_child()
if expected is None:
self.assertEqual(node, None)
else:
self.assertEqual(node.desc, expected)
def _multi_get_last_child(self):
data = [
('2', '24'),
('21', None),
('23', '231'),
('231', None),
]
for desc, expected in data:
node = self.model.objects.get(desc=desc).get_last_child()
if expected is None:
self.assertEqual(node, None)
else:
self.assertEqual(node.desc, expected)
def _multi_get_ancestors(self):
data = [
('2', []),
('21', ['2']),
('231', ['2', '23']),
]
for desc, expected in data:
nodes = self.model.objects.get(desc=desc).get_ancestors()
self.assertEqual([node.desc for node in nodes], expected)
def _multi_get_descendants(self):
data = [
('2', ['21', '22', '23', '231', '24']),
('23', ['231']),
('231', []),
('1', []),
('4', ['41']),
]
for desc, expected in data:
nodes = self.model.objects.get(desc=desc).get_descendants()
self.assertEqual([node.desc for node in nodes], expected)
def _multi_get_descendant_count(self):
data = [
('2', 5),
('23', 1),
('231', 0),
('1', 0),
('4', 1),
]
for desc, expected in data:
got = self.model.objects.get(desc=desc).get_descendant_count()
self.assertEqual(got, expected)
def _multi_is_sibling_of(self):
data = [
('2', '2', True),
('2', '1', True),
('21', '2', False),
('231', '2', False),
('22', '23', True),
('231', '23', False),
('231', '231', True),
]
for desc1, desc2, expected in data:
node1 = self.model.objects.get(desc=desc1)
node2 = self.model.objects.get(desc=desc2)
self.assertEqual(node1.is_sibling_of(node2), expected)
def _multi_is_child_of(self):
data = [
('2', '2', False),
('2', '1', False),
('21', '2', True),
('231', '2', False),
('231', '23', True),
('231', '231', False),
]
for desc1, desc2, expected in data:
node1 = self.model.objects.get(desc=desc1)
node2 = self.model.objects.get(desc=desc2)
self.assertEqual(node1.is_child_of(node2), expected)
def _multi_is_descendant_of(self):
data = [
('2', '2', False),
('2', '1', False),
('21', '2', True),
('231', '2', True),
('231', '23', True),
('231', '231', False),
]
for desc1, desc2, expected in data:
node1 = self.model.objects.get(desc=desc1)
node2 = self.model.objects.get(desc=desc2)
self.assertEqual(node1.is_descendant_of(node2), expected)
class TestAddChild(TestNonEmptyTree):
def _multi_add_child_to_leaf(self):
self.model.objects.get(desc=u'231').add_child(desc='2311')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 1),
(u'2311', 4, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_child_to_node(self):
self.model.objects.get(desc=u'2').add_child(desc='25')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'25', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
class TestAddSibling(TestNonEmptyTree):
def _multi_add_sibling_invalid_pos(self):
method = self.model.objects.get(desc=u'231').add_sibling
self.assertRaises(InvalidPosition, method, 'invalid_pos')
def _multi_add_sibling_missing_nodeorderby(self):
node_wchildren = self.model.objects.get(desc=u'2')
method = node_wchildren.add_sibling
self.assertRaises(MissingNodeOrderBy, method, 'sorted-sibling',
desc='aaa')
def _multi_add_sibling_last_root(self):
node_wchildren = self.model.objects.get(desc=u'2')
obj = node_wchildren.add_sibling('last-sibling', desc='5')
self.assertEqual(obj.get_depth(), 1)
self.assertEqual(node_wchildren.get_last_sibling().desc, u'5')
def _multi_add_sibling_last(self):
node = self.model.objects.get(desc=u'231')
obj = node.add_sibling('last-sibling', desc='232')
self.assertEqual(obj.get_depth(), 3)
self.assertEqual(node.get_last_sibling().desc, u'232')
def _multi_add_sibling_first_root(self):
node_wchildren = self.model.objects.get(desc=u'2')
obj = node_wchildren.add_sibling('first-sibling', desc='new')
self.assertEqual(obj.get_depth(), 1)
expected = [(u'new', 1, 0),
(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_first(self):
node_wchildren = self.model.objects.get(desc=u'23')
obj = node_wchildren.add_sibling('first-sibling', desc='new')
self.assertEqual(obj.get_depth(), 2)
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'new', 2, 0),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_left_root(self):
node_wchildren = self.model.objects.get(desc=u'2')
obj = node_wchildren.add_sibling('left', desc='new')
self.assertEqual(obj.get_depth(), 1)
expected = [(u'1', 1, 0),
(u'new', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_left(self):
node_wchildren = self.model.objects.get(desc=u'23')
obj = node_wchildren.add_sibling('left', desc='new')
self.assertEqual(obj.get_depth(), 2)
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'new', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_left_noleft_root(self):
node = self.model.objects.get(desc=u'1')
obj = node.add_sibling('left', desc='new')
self.assertEqual(obj.get_depth(), 1)
expected = [(u'new', 1, 0),
(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_left_noleft(self):
node = self.model.objects.get(desc=u'231')
obj = node.add_sibling('left', desc='new')
self.assertEqual(obj.get_depth(), 3)
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 2),
(u'new', 3, 0),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_right_root(self):
node_wchildren = self.model.objects.get(desc=u'2')
obj = node_wchildren.add_sibling('right', desc='new')
self.assertEqual(obj.get_depth(), 1)
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'new', 1, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_right(self):
node_wchildren = self.model.objects.get(desc=u'23')
obj = node_wchildren.add_sibling('right', desc='new')
self.assertEqual(obj.get_depth(), 2)
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'new', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_right_noright_root(self):
node = self.model.objects.get(desc=u'4')
obj = node.add_sibling('right', desc='new')
self.assertEqual(obj.get_depth(), 1)
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0),
(u'new', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_sibling_right_noright(self):
node = self.model.objects.get(desc=u'231')
obj = node.add_sibling('right', desc='new')
self.assertEqual(obj.get_depth(), 3)
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 2),
(u'231', 3, 0),
(u'new', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
class TestDelete(TestNonEmptyTree):
def setUp(self):
super(TestDelete, self).setUp()
for node in self.model.objects.all():
self.dep_model(node=node).save()
def _multi_delete_leaf(self):
self.model.objects.get(desc=u'231').delete()
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_delete_node(self):
self.model.objects.get(desc=u'23').delete()
expected = [(u'1', 1, 0),
(u'2', 1, 3),
(u'21', 2, 0),
(u'22', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_delete_root(self):
self.model.objects.get(desc=u'2').delete()
expected = [(u'1', 1, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_delete_filter_root_nodes(self):
self.model.objects.filter(desc__in=('2', '3')).delete()
expected = [(u'1', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_delete_filter_children(self):
self.model.objects.filter(
desc__in=('2', '23', '231')).delete()
expected = [(u'1', 1, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_delete_nonexistant_nodes(self):
self.model.objects.filter(desc__in=('ZZZ', 'XXX')).delete()
self.assertEqual(self.got(), self.unchanged)
def _multi_delete_same_node_twice(self):
self.model.objects.filter(
desc__in=('2', '2')).delete()
expected = [(u'1', 1, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_delete_all_root_nodes(self):
self.model.get_root_nodes().delete()
count = self.model.objects.count()
self.assertEqual(count, 0)
def _multi_delete_all_nodes(self):
self.model.objects.all().delete()
count = self.model.objects.count()
self.assertEqual(count, 0)
class TestMoveErrors(TestNonEmptyTree):
def _multi_move_invalid_pos(self):
node = self.model.objects.get(desc=u'231')
self.assertRaises(InvalidPosition, node.move, node, 'invalid_pos')
def _multi_move_to_descendant(self):
node = self.model.objects.get(desc=u'2')
target = self.model.objects.get(desc=u'231')
self.assertRaises(InvalidMoveToDescendant, node.move, target,
'first-sibling')
def _multi_move_missing_nodeorderby(self):
node = self.model.objects.get(desc=u'231')
self.assertRaises(MissingNodeOrderBy, node.move, node,
'sorted-child')
self.assertRaises(MissingNodeOrderBy, node.move, node,
'sorted-sibling')
class TestMoveSortedErrors(TestNonEmptyTree):
def _multi_nonsorted_move_in_sorted(self):
node = self.sorted_model.add_root(val1=3, val2=3, desc='zxy')
self.assertRaises(InvalidPosition, node.move, node, 'left')
class TestMoveLeafRoot(TestNonEmptyTree):
def _multi_move_leaf_last_sibling_root(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'2'), 'last-sibling')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0),
(u'231', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_first_sibling_root(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'2'), 'first-sibling')
expected = [(u'231', 1, 0),
(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_left_sibling_root(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'2'), 'left')
expected = [(u'1', 1, 0),
(u'231', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_right_sibling_root(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'2'), 'right')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'231', 1, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_last_child_root(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'2'), 'last-child')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'231', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_first_child_root(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'2'), 'first-child')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'231', 2, 0),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
class TestMoveLeaf(TestNonEmptyTree):
def _multi_move_leaf_last_sibling(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'22'), 'last-sibling')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'231', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_first_sibling(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'22'), 'first-sibling')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'231', 2, 0),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_left_sibling(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'22'), 'left')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'231', 2, 0),
(u'22', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_right_sibling(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'22'), 'right')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'231', 2, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_left_sibling_itself(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'231'), 'left')
self.assertEqual(self.got(), self.unchanged)
def _multi_move_leaf_last_child(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'22'), 'last-child')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 1),
(u'231', 3, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_leaf_first_child(self):
self.model.objects.get(desc=u'231').move(
self.model.objects.get(desc=u'22'), 'first-child')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 1),
(u'231', 3, 0),
(u'23', 2, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
class TestMoveBranchRoot(TestNonEmptyTree):
def _multi_move_branch_first_sibling_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2'), 'first-sibling')
expected = [(u'4', 1, 1),
(u'41', 2, 0),
(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_last_sibling_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2'), 'last-sibling')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_left_sibling_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2'), 'left')
expected = [(u'1', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_right_sibling_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2'), 'right')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'4', 1, 1),
(u'41', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_left_noleft_sibling_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2').get_first_sibling(), 'left')
expected = [(u'4', 1, 1),
(u'41', 2, 0),
(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_right_noright_sibling_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2').get_last_sibling(), 'right')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0),
(u'4', 1, 1),
(u'41', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_first_child_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2'), 'first-child')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'4', 2, 1),
(u'41', 3, 0),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_last_child_root(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='2'), 'last-child')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'4', 2, 1),
(u'41', 3, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
class TestMoveBranch(TestNonEmptyTree):
def _multi_move_branch_first_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23'), 'first-sibling')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'4', 2, 1),
(u'41', 3, 0),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_last_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23'), 'last-sibling')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'4', 2, 1),
(u'41', 3, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_left_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23'), 'left')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'4', 2, 1),
(u'41', 3, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_right_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23'), 'right')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'4', 2, 1),
(u'41', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_left_noleft_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23').get_first_sibling(), 'left')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'4', 2, 1),
(u'41', 3, 0),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_right_noright_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23').get_last_sibling(), 'right')
expected = [(u'1', 1, 0),
(u'2', 1, 5),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 1),
(u'231', 3, 0),
(u'24', 2, 0),
(u'4', 2, 1),
(u'41', 3, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_left_itself_sibling(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='4'), 'left')
self.assertEqual(self.got(), self.unchanged)
def _multi_move_branch_first_child(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23'), 'first-child')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 2),
(u'4', 3, 1),
(u'41', 4, 0),
(u'231', 3, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_branch_last_child(self):
self.model.objects.get(desc='4').move(
self.model.objects.get(desc='23'), 'last-child')
expected = [(u'1', 1, 0),
(u'2', 1, 4),
(u'21', 2, 0),
(u'22', 2, 0),
(u'23', 2, 2),
(u'231', 3, 0),
(u'4', 3, 1),
(u'41', 4, 0),
(u'24', 2, 0),
(u'3', 1, 0)]
self.assertEqual(self.got(), expected)
class TestTreeSorted(TestTreeBase):
def got(self):
return [(o.val1, o.val2, o.desc, o.get_depth(), o.get_children_count())
for o in self.sorted_model.get_tree()]
def _multi_add_root_sorted(self):
self.sorted_model.add_root(val1=3, val2=3, desc='zxy')
self.sorted_model.add_root(val1=1, val2=4, desc='bcd')
self.sorted_model.add_root(val1=2, val2=5, desc='zxy')
self.sorted_model.add_root(val1=3, val2=3, desc='abc')
self.sorted_model.add_root(val1=4, val2=1, desc='fgh')
self.sorted_model.add_root(val1=3, val2=3, desc='abc')
self.sorted_model.add_root(val1=2, val2=2, desc='qwe')
self.sorted_model.add_root(val1=3, val2=2, desc='vcx')
expected = [(1, 4, u'bcd', 1, 0),
(2, 2, u'qwe', 1, 0),
(2, 5, u'zxy', 1, 0),
(3, 2, u'vcx', 1, 0),
(3, 3, u'abc', 1, 0),
(3, 3, u'abc', 1, 0),
(3, 3, u'zxy', 1, 0),
(4, 1, u'fgh', 1, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_child_root_sorted(self):
root = self.sorted_model.add_root(val1=0, val2=0, desc='aaa')
root.add_child(val1=3, val2=3, desc='zxy')
root.add_child(val1=1, val2=4, desc='bcd')
root.add_child(val1=2, val2=5, desc='zxy')
root.add_child(val1=3, val2=3, desc='abc')
root.add_child(val1=4, val2=1, desc='fgh')
root.add_child(val1=3, val2=3, desc='abc')
root.add_child(val1=2, val2=2, desc='qwe')
root.add_child(val1=3, val2=2, desc='vcx')
expected = [(0, 0, u'aaa', 1, 8),
(1, 4, u'bcd', 2, 0),
(2, 2, u'qwe', 2, 0),
(2, 5, u'zxy', 2, 0),
(3, 2, u'vcx', 2, 0),
(3, 3, u'abc', 2, 0),
(3, 3, u'abc', 2, 0),
(3, 3, u'zxy', 2, 0),
(4, 1, u'fgh', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_add_child_nonroot_sorted(self):
get_node = lambda node_id: self.sorted_model.objects.get(pk=node_id)
root_id = self.sorted_model.add_root(val1=0, val2=0, desc='a').id
node_id = get_node(root_id).add_child(val1=0, val2=0, desc='ac').id
get_node(root_id).add_child(val1=0, val2=0, desc='aa')
get_node(root_id).add_child(val1=0, val2=0, desc='av')
get_node(node_id).add_child(val1=0, val2=0, desc='aca')
get_node(node_id).add_child(val1=0, val2=0, desc='acc')
get_node(node_id).add_child(val1=0, val2=0, desc='acb')
expected = [(0, 0, u'a', 1, 3),
(0, 0, u'aa', 2, 0),
(0, 0, u'ac', 2, 3),
(0, 0, u'aca', 3, 0),
(0, 0, u'acb', 3, 0),
(0, 0, u'acc', 3, 0),
(0, 0, u'av', 2, 0)]
self.assertEqual(self.got(), expected)
def _multi_move_sorted(self):
self.sorted_model.add_root(val1=3, val2=3, desc='zxy')
self.sorted_model.add_root(val1=1, val2=4, desc='bcd')
self.sorted_model.add_root(val1=2, val2=5, desc='zxy')
self.sorted_model.add_root(val1=3, val2=3, desc='abc')
self.sorted_model.add_root(val1=4, val2=1, desc='fgh')
self.sorted_model.add_root(val1=3, val2=3, desc='abc')
self.sorted_model.add_root(val1=2, val2=2, desc='qwe')
self.sorted_model.add_root(val1=3, val2=2, desc='vcx')
root_nodes = self.sorted_model.get_root_nodes()
target = root_nodes[0]
for node in root_nodes[1:]:
# because raw queries don't update django objects
node = self.sorted_model.objects.get(pk=node.id)
target = self.sorted_model.objects.get(pk=target.id)
node.move(target, 'sorted-child')
expected = [(1, 4, u'bcd', 1, 7),
(2, 2, u'qwe', 2, 0),
(2, 5, u'zxy', 2, 0),
(3, 2, u'vcx', 2, 0),
(3, 3, u'abc', 2, 0),
(3, 3, u'abc', 2, 0),
(3, 3, u'zxy', 2, 0),
(4, 1, u'fgh', 2, 0)]
self.assertEqual(self.got(), expected)
class TestMP_TreeAlphabet(TestCase):
def test_alphabet(self):
if not os.getenv('TREEBEARD_TEST_ALPHABET', False):
# run this test only if the enviroment variable is set
return
basealpha = numconv.BASE85
got_err = False
last_good = None
for alphabetlen in range(35, len(basealpha) + 1):
alphabet = basealpha[0:alphabetlen]
expected = [alphabet[0] + char for char in alphabet[1:]]
expected.extend([alphabet[1] + char for char in alphabet])
expected.append(alphabet[2] + alphabet[0])
# remove all nodes
MP_TestNodeAlphabet.objects.all().delete()
# change the model's alphabet
MP_TestNodeAlphabet.alphabet = alphabet
# insert root nodes
for pos in range(len(alphabet) * 2):
try:
MP_TestNodeAlphabet.add_root(numval=pos)
except:
got_err = True
break
if got_err:
break
got = [obj.path for obj in MP_TestNodeAlphabet.objects.all()]
if got != expected:
got_err = True
last_good = alphabet
print '\nThe best BASE85 based alphabet for your setup is: %s' \
% (last_good, )
class TestHelpers(TestTreeBase):
def setUp(self):
for model in (MP_TestNode, AL_TestNode, NS_TestNode):
model.load_bulk(BASE_DATA)
for node in model.get_root_nodes():
model.load_bulk(BASE_DATA, node)
model.add_root(desc='5')
def _multi_descendants_group_count_root(self):
expected = [(o.desc, o.get_descendant_count())
for o in self.model.get_root_nodes()]
got = [(o.desc, o.descendants_count)
for o in self.model.get_descendants_group_count()]
self.assertEqual(got, expected)
def _multi_descendants_group_count_node(self):
parent = self.model.get_root_nodes().get(desc='2')
expected = [(o.desc, o.get_descendant_count())
for o in parent.get_children()]
got = [(o.desc, o.descendants_count)
for o in self.model.get_descendants_group_count(parent)]
self.assertEqual(got, expected)
class TestMP_TreeSortedAutoNow(TestCase):
"""
The sorting mechanism used by treebeard when adding a node can fail if the
ordering is using an "auto_now" field
"""
def test_sorted_by_autonow_workaround(self):
"""
workaround
"""
import datetime
for i in range(1, 5):
MP_TestNodeSortedAutoNow.add_root(desc='node%d' % (i, ),
created=datetime.datetime.now())
def test_sorted_by_autonow_FAIL(self):
"""
This test asserts that we have a problem.
fix this, somehow
"""
MP_TestNodeSortedAutoNow.add_root(desc='node1')
self.assertRaises(ValueError, MP_TestNodeSortedAutoNow.add_root,
desc='node2')
class TestMP_TreeStepOverflow(TestCase):
def test_add_root(self):
method = MP_TestNodeSmallStep.add_root
for i in range(1, 10):
method()
self.assertRaises(PathOverflow, method)
def test_add_child(self):
root = MP_TestNodeSmallStep.add_root()
method = root.add_child
for i in range(1, 10):
method()
self.assertRaises(PathOverflow, method)
def test_add_sibling(self):
root = MP_TestNodeSmallStep.add_root()
for i in range(1, 10):
root.add_child()
method = root.get_last_child().add_sibling
positions = ('first-sibling', 'left', 'right', 'last-sibling')
for pos in positions:
self.assertRaises(PathOverflow, method, pos)
def test_move(self):
root = MP_TestNodeSmallStep.add_root()
for i in range(1, 10):
root.add_child()
newroot = MP_TestNodeSmallStep.add_root()
targets = [(root, ['first-child', 'last-child']),
(root.get_first_child(), ['first-sibling',
'left',
'right',
'last-sibling'])]
for target, positions in targets:
for pos in positions:
self.assertRaises(PathOverflow, newroot.move, target, pos)
class TestMP_TreeShortPath(TestCase):
"""
Here we test a tree with a very small path field (max_length=4) and a
steplen of 1
"""
def test_short_path(self):
obj = MP_TestNodeShortPath.add_root()
obj = obj.add_child().add_child().add_child()
self.assertRaises(PathOverflow, obj.add_child)
class TestMP_TreeFindProblems(TestTreeBase):
def test_find_problems(self):
model = MP_TestNodeAlphabet
model.alphabet = '01234'
model(path='01', depth=1, numchild=0, numval=0).save()
model(path='1', depth=1, numchild=0, numval=0).save()
model(path='111', depth=1, numchild=0, numval=0).save()
model(path='abcd', depth=1, numchild=0, numval=0).save()
model(path='qa#$%!', depth=1, numchild=0, numval=0).save()
model(path='0201', depth=2, numchild=0, numval=0).save()
model(path='020201', depth=3, numchild=0, numval=0).save()
model(path='03', depth=1, numchild=2, numval=0).save()
model(path='0301', depth=2, numchild=0, numval=0).save()
model(path='030102', depth=3, numchild=10, numval=0).save()
model(path='04', depth=10, numchild=1, numval=0).save()
model(path='0401', depth=20, numchild=0, numval=0).save()
evil_chars, bad_steplen, orphans, wrong_depth, wrong_numchild = \
model.find_problems()
self.assertEqual(['abcd', 'qa#$%!'],
[o.path for o in model.objects.filter(id__in=evil_chars)])
self.assertEqual(['1', '111'],
[o.path for o in model.objects.filter(id__in=bad_steplen)])
self.assertEqual(['0201', '020201'],
[o.path for o in model.objects.filter(id__in=orphans)])
self.assertEqual(['03', '0301', '030102'],
[o.path for o in model.objects.filter(id__in=wrong_numchild)])
self.assertEqual(['04', '0401'],
[o.path for o in model.objects.filter(id__in=wrong_depth)])
class TestMP_TreeFix(TestTreeBase):
def setUp(self):
super(TestMP_TreeFix, self).setUp()
self.expected_no_holes = {
MP_TestNodeShortPath: [
(u'1', u'b', 1, 2),
(u'11', u'u', 2, 1),
(u'111', u'i', 3, 1),
(u'1111', u'e', 4, 0),
(u'12', u'o', 2, 0),
(u'2', u'd', 1, 0),
(u'3', u'g', 1, 0),
(u'4', u'a', 1, 4),
(u'41', u'a', 2, 0),
(u'42', u'a', 2, 0),
(u'43', u'u', 2, 1),
(u'431', u'i', 3, 1),
(u'4311', u'e', 4, 0),
(u'44', u'o', 2, 0)],
MP_TestSortedNodeShortPath: [
(u'1', u'a', 1, 4),
(u'11', u'a', 2, 0),
(u'12', u'a', 2, 0),
(u'13', u'o', 2, 0),
(u'14', u'u', 2, 1),
(u'141', u'i', 3, 1),
(u'1411', u'e', 4, 0),
(u'2', u'b', 1, 2),
(u'21', u'o', 2, 0),
(u'22', u'u', 2, 1),
(u'221', u'i', 3, 1),
(u'2211', u'e', 4, 0),
(u'3', u'd', 1, 0),
(u'4', u'g', 1, 0)]}
self.expected_with_holes = {
MP_TestNodeShortPath: [
(u'1', u'b', 1L, 2L),
(u'13', u'u', 2L, 1L),
(u'134', u'i', 3L, 1L),
(u'1343', u'e', 4L, 0L),
(u'14', u'o', 2L, 0L),
(u'2', u'd', 1L, 0L),
(u'3', u'g', 1L, 0L),
(u'4', u'a', 1L, 4L),
(u'41', u'a', 2L, 0L),
(u'42', u'a', 2L, 0L),
(u'43', u'u', 2L, 1L),
(u'434', u'i', 3L, 1L),
(u'4343', u'e', 4L, 0L),
(u'44', u'o', 2L, 0L)],
MP_TestSortedNodeShortPath: [
(u'1', u'b', 1L, 2L),
(u'13', u'u', 2L, 1L),
(u'134', u'i', 3L, 1L),
(u'1343', u'e', 4L, 0L),
(u'14', u'o', 2L, 0L),
(u'2', u'd', 1L, 0L),
(u'3', u'g', 1L, 0L),
(u'4', u'a', 1L, 4L),
(u'41', u'a', 2L, 0L),
(u'42', u'a', 2L, 0L),
(u'43', u'u', 2L, 1L),
(u'434', u'i', 3L, 1L),
(u'4343', u'e', 4L, 0L),
(u'44', u'o', 2L, 0L)]}
def got(self, model):
return [(o.path, o.desc, o.get_depth(), o.get_children_count())
for o in model.get_tree()]
def add_broken_test_data(self, model):
model(path='4', depth=2, numchild=2, desc='a').save()
model(path='13', depth=1000, numchild=0, desc='u').save()
model(path='14', depth=4, numchild=500, desc='o').save()
model(path='134', depth=321, numchild=543, desc='i').save()
model(path='1343', depth=321, numchild=543, desc='e').save()
model(path='42', depth=1, numchild=1, desc='a').save()
model(path='43', depth=1000, numchild=0, desc='u').save()
model(path='44', depth=4, numchild=500, desc='o').save()
model(path='434', depth=321, numchild=543, desc='i').save()
model(path='4343', depth=321, numchild=543, desc='e').save()
model(path='41', depth=1, numchild=1, desc='a').save()
model(path='3', depth=221, numchild=322, desc='g').save()
model(path='1', depth=10, numchild=3, desc='b').save()
model(path='2', depth=10, numchild=3, desc='d').save()
def test_fix_tree_non_destructive(self):
for model in (MP_TestNodeShortPath, MP_TestSortedNodeShortPath):
self.add_broken_test_data(model)
model.fix_tree(destructive=False)
self.assertEqual(self.got(model), self.expected_with_holes[model])
model.find_problems()
def test_fix_tree_destructive(self):
for model in (MP_TestNodeShortPath, MP_TestSortedNodeShortPath):
self.add_broken_test_data(model)
model.fix_tree(destructive=True)
self.assertEqual(self.got(model), self.expected_no_holes[model])
model.find_problems()
class TestIssues(TestCase):
"test for http://code.google.com/p/django-treebeard/issues/detail?id=14"
def test_many_to_many_django_user_anonymous(self):
if not HAS_DJANGO_AUTH: # pragma: no cover
self.fail('this test needs django.contrib.auth in INSTALLED_APPS')
# Using AnonymousUser() in the querysets will expose non-treebeard
# related problems in Django 1.0
#
# Postgres:
# ProgrammingError: can't adapt
# SQLite:
# InterfaceError: Error binding parameter 4 - probably unsupported
# type.
# MySQL compared a string to an integer field:
# `treebeard_mp_testissue14_users`.`user_id` = 'AnonymousUser'
#
# Using a None field instead works (will be translated to IS NULL).
#
# anonuserobj = AnonymousUser()
anonuserobj = None
def qs_check(qs, expected):
self.assertEqual(
[o.name for o in qs],
expected)
user = User.objects.create_user('test_user', 'test@example.com',
'testpasswd')
user.save()
root = MP_TestIssue14.add_root(name="the root node")
root.add_child(name="first")
second = root.add_child(name="second")
qs_check(root.get_children(), ['first', 'second'])
qs_check(root.get_children().filter(Q(name="first")), ['first'])
qs_check(root.get_children().filter(Q(users=user)), [])
qs_check(
root.get_children().filter(Q(name="first") | Q(users=user)),
['first'])
user = anonuserobj
qs_check(
root.get_children().filter(Q(name="first") | Q(users=user)),
['first', 'second'])
user = User.objects.get(username="test_user")
second.users.add(user)
qs_check(
root.get_children().filter(Q(name="first") | Q(users=user)),
['first', 'second'])
user = anonuserobj
qs_check(
root.get_children().filter(Q(name="first") | Q(users=user)),
['first'])
class TestModelAdmin(ModelAdmin):
form = MoveNodeForm
class TestMoveNodeForm(TestTreeBase):
tpl = (u'<tr><th><label for="id__position">Position:</label></th>'
'<td><select name="_position" id="id__position">\n'
'<option value="first-child">First child of</option>\n'
'<option value="left">Before</option>\n'
'<option value="right">After</option>\n'
'</select></td></tr>\n'
'<tr><th><label for="id__ref_node_id">Relative to:</label>'
'</th><td><select name="_ref_node_id" id="id__ref_node_id">\n'
'<option value="0">-- root --</option>\n')
def _multi_form_html_root_node(self):
self.model.load_bulk(BASE_DATA)
node = self.model.get_tree()[0]
form = MoveNodeForm(instance=node)
rtpl = self.tpl
self.assertEqual(['_position', '_ref_node_id'],
form.base_fields.keys())
for obj in self.model.get_tree():
if node != obj or obj.is_descendant_of(node):
rtpl += '<option value="%d">%sNode %d</option>\n' % (
obj.id, '. . ' * (obj.get_depth() - 1), obj.id)
rtpl += '</select></td></tr>'
formstr = unicode(form).replace(u' selected="selected"', u'')
self.assertEqual(rtpl, formstr)
def _multi_form_html_leaf_node(self):
self.model.load_bulk(BASE_DATA)
nodes = list(self.model.get_tree())
node = nodes[-1]
form = MoveNodeForm(instance=node)
rtpl = self.tpl
self.assertEqual(['_position', '_ref_node_id'],
form.base_fields.keys())
for obj in self.model.get_tree():
if node != obj or obj.is_descendant_of(node):
rtpl += '<option value="%d">%sNode %d</option>\n' % (
obj.id, '. . ' * (obj.get_depth() - 1), obj.id)
rtpl += '</select></td></tr>'
formstr = unicode(form).replace(u' selected="selected"', u'')
self.assertEqual(rtpl, formstr)
def _multi_admin_html(self):
tpl = ('<tr><th><label for="id_desc">Desc:</label>'
'</th><td><input id="id_desc" type="text" class="vTextField" '
'name="desc" maxlength="255" /></td></tr>\n'
'<tr><th><label for="id__position">Position:</label></th>'
'<td><select name="_position" id="id__position">\n'
'<option value="first-child">First child of</option>\n'
'<option value="left">Before</option>\n'
'<option value="right">After</option>\n'
'</select></td></tr>\n'
'<tr><th><label for="id__ref_node_id">Relative to:</label>'
'</th><td><select name="_ref_node_id" id="id__ref_node_id">\n'
'<option value="0">-- root --</option>\n'
'<option value="%d">Node %d</option>\n'
'<option value="%d">Node %d</option>\n'
'<option value="%d">. . Node %d</option>\n'
'<option value="%d">. . Node %d</option>\n'
'<option value="%d">. . Node %d</option>\n'
'<option value="%d">. . . . Node %d</option>\n'
'<option value="%d">. . Node %d</option>\n'
'<option value="%d">Node %d</option>\n'
'<option value="%d">Node %d</option>\n'
'<option value="%d">. . Node %d</option>\n'
'</select></td></tr>')
request = None
self.model.load_bulk(BASE_DATA)
for node in self.model.objects.all():
site = AdminSite()
ma = TestModelAdmin(self.model, site)
self.assertEqual(
['desc', '_position', '_ref_node_id'],
ma.get_form(request).base_fields.keys())
self.assertEqual(
[(None, {'fields': ['desc', '_position', '_ref_node_id']})],
ma.get_fieldsets(request))
self.assertEqual(
[(None, {'fields': ['desc', '_position', '_ref_node_id']})],
ma.get_fieldsets(request, node))
form = ma.get_form(request)()
ids = []
for obj in self.model.get_tree():
ids.extend([obj.id] * 2)
self.assertEqual(tpl % tuple(ids), unicode(form))
_load_test_methods(TestMoveNodeForm)
_load_test_methods(TestEmptyTree)
_load_test_methods(TestClassMethods)
_load_test_methods(TestSimpleNodeMethods)
_load_test_methods(TestAddChild)
_load_test_methods(TestAddSibling)
_load_test_methods(TestDelete)
_load_test_methods(TestMoveErrors)
_load_test_methods(TestMoveLeafRoot)
_load_test_methods(TestMoveLeaf)
_load_test_methods(TestMoveBranchRoot)
_load_test_methods(TestMoveBranch)
_load_test_methods(TestHelpers)
# we didn't create extra sorted-proxy models
_load_test_methods(TestMoveSortedErrors, proxy=False)
_load_test_methods(TestTreeSorted, proxy=False)
|