Root/
| 1 | #!/bin/sh |
| 2 | . ./Common |
| 3 | |
| 4 | ############################################################################### |
| 5 | |
| 6 | tst "hierarchical sort with one hole" <<EOF |
| 7 | struct p2d *pl, *p; |
| 8 | |
| 9 | pl = p = p2d_new(); |
| 10 | p2d_append(p, v2d_new(0, 0)); |
| 11 | p2d_append(p, v2d_new(20, 0)); |
| 12 | p2d_append(p, v2d_new(20, 10)); |
| 13 | p2d_append(p, v2d_new(0, 10)); |
| 14 | p2d_close(p); |
| 15 | |
| 16 | p = p->next = p2d_new(); |
| 17 | p2d_append(p, v2d_new(2, 2)); |
| 18 | p2d_append(p, v2d_new(2, 8)); |
| 19 | p2d_append(p, v2d_new(18, 8)); |
| 20 | p2d_append(p, v2d_new(18, 2)); |
| 21 | p2d_close(p); |
| 22 | |
| 23 | print_hier(p2d_hsort(pl)); |
| 24 | EOF |
| 25 | |
| 26 | expect <<EOF |
| 27 | 0 0 20 0 20 10 0 10 |
| 28 | 2 2 2 8 18 8 18 2 |
| 29 | EOF |
| 30 | |
| 31 | #------------------------------------------------------------------------------ |
| 32 | |
| 33 | tst "hierarchical sort with two holes" <<EOF |
| 34 | struct p2d *pl, *p; |
| 35 | |
| 36 | pl = p = p2d_new(); |
| 37 | p2d_append(p, v2d_new(0, 0)); |
| 38 | p2d_append(p, v2d_new(10, 0)); |
| 39 | p2d_append(p, v2d_new(10, 10)); |
| 40 | p2d_close(p); |
| 41 | |
| 42 | p = p->next = p2d_new(); |
| 43 | p2d_append(p, v2d_new(2, 2)); |
| 44 | p2d_append(p, v2d_new(4, 2)); |
| 45 | p2d_append(p, v2d_new(4, 4)); |
| 46 | p2d_close(p); |
| 47 | |
| 48 | p = p->next = p2d_new(); |
| 49 | p2d_append(p, v2d_new(6, 2)); |
| 50 | p2d_append(p, v2d_new(8, 2)); |
| 51 | p2d_append(p, v2d_new(8, 8)); |
| 52 | p2d_close(p); |
| 53 | |
| 54 | print_hier(p2d_hsort(pl)); |
| 55 | EOF |
| 56 | |
| 57 | expect <<EOF |
| 58 | 0 0 10 0 10 10 |
| 59 | 2 2 4 2 4 4 |
| 60 | 6 2 8 2 8 8 |
| 61 | EOF |
| 62 | |
| 63 | #------------------------------------------------------------------------------ |
| 64 | |
| 65 | tst "hierarchical sort with nested holes" <<EOF |
| 66 | struct p2d *pl, *p; |
| 67 | |
| 68 | pl = p = p2d_new(); |
| 69 | p2d_append(p, v2d_new(0, 0)); |
| 70 | p2d_append(p, v2d_new(10, 0)); |
| 71 | p2d_append(p, v2d_new(10, 10)); |
| 72 | p2d_close(p); |
| 73 | |
| 74 | p = p->next = p2d_new(); |
| 75 | p2d_append(p, v2d_new(2, 2)); |
| 76 | p2d_append(p, v2d_new(8, 2)); |
| 77 | p2d_append(p, v2d_new(8, 8)); |
| 78 | p2d_close(p); |
| 79 | |
| 80 | p = p->next = p2d_new(); |
| 81 | p2d_append(p, v2d_new(3, 3)); |
| 82 | p2d_append(p, v2d_new(7, 3)); |
| 83 | p2d_append(p, v2d_new(7, 7)); |
| 84 | p2d_close(p); |
| 85 | |
| 86 | print_hier(p2d_hsort(pl)); |
| 87 | EOF |
| 88 | |
| 89 | expect <<EOF |
| 90 | 0 0 10 0 10 10 |
| 91 | 2 2 8 2 8 8 |
| 92 | 3 3 7 3 7 7 |
| 93 | EOF |
| 94 | |
| 95 | |
| 96 | ############################################################################### |
| 97 |
Branches:
master
