test.chk
来自「开放源码的编译器open watcom 1.6.0版的源代码」· CHK 代码 · 共 902 行 · 第 1/5 页
CHK
902 行
Test 012: b0.tree_depth() --> PASSED
Test 013: b0.put(6) --> PASSED
Test 014: b0.count() --> PASSED
Test 015: b0.tree_depth() --> PASSED
Test 016: b0.put(5) --> PASSED
Test 017: b0.count() --> PASSED
Test 018: b0.tree_depth() --> PASSED
Test 019: b0.get_root()->get() --> PASSED
Test 020: b0.find(4) --> PASSED
Test 021: (b0.node() == b0.get_root()->get_ltree()) --> PASSED
Test 022: b0.find(8) --> PASSED
Test 023: (b0.node() == b0.get_root()->get_rtree()) --> PASSED
Test 024: b0.find(5) --> PASSED
Test 025: (n0 == (b0.find(4),b0.node()->get_rtree())) --> PASSED
Test 026: b0.put(9) --> PASSED
Test 027: b0.count() --> PASSED
Test 028: b0.tree_depth() --> PASSED
Test 029: b0.find(9) --> PASSED
Test 030: (b0.node() == b0.get_root()->get_rtree()) --> PASSED
Test 031: (b0.find(8),b0.node()->is_leaf()) --> PASSED
Test 032: (b0.find(10),b0.node()->is_leaf()) --> PASSED
Test 033: b0.put(1) --> PASSED
Test 034: b0.count() --> PASSED
Test 035: b0.tree_depth() --> PASSED
Test 036: b0.put(0) --> PASSED
Test 037: b0.count() --> PASSED
Test 038: b0.tree_depth() --> PASSED
Test 039: b0.find(1) --> PASSED
Test 040: (n0 == (b0.find(4),b0.node()->get_ltree())) --> PASSED
Test 041: (b0.find(0),b0.node()->is_leaf()) --> PASSED
Test 042: (b0.find(2),b0.node()->is_leaf()) --> PASSED
Test 043: b0.put(11) --> PASSED
Test 044: b0.count() --> PASSED
Test 045: b0.tree_depth() --> PASSED
Test 046: b0.put(12) --> PASSED
Test 047: b0.count() --> PASSED
Test 048: b0.tree_depth() --> PASSED
Test 049: b0.find(11) --> PASSED
Test 050: (n0 == (b0.find(9),b0.node()->get_rtree())) --> PASSED
Test 051: (b0.find(8),b0.node()->is_leaf()) --> PASSED
Test 052: (b0.find(10),b0.node()->is_leaf()) --> PASSED
Test 053: b0.remove(12) --> PASSED
Test 054: b0.count() --> PASSED
Test 055: b0.tree_depth() --> PASSED
Test 056: b0.remove(8) --> PASSED
Test 057: b0.count() --> PASSED
Test 058: b0.tree_depth() --> PASSED
Test 059: b0.find(10) --> PASSED
Test 060: (n0 == (b0.get_root()->get_rtree())) --> PASSED
Test 061: (b0.find(9),b0.node()->is_leaf()) --> PASSED
Test 062: (b0.find(11),b0.node()->is_leaf()) --> PASSED
Test 063: b0.remove(1) --> PASSED
Test 064: b0.count() --> PASSED
Test 065: b0.tree_depth() --> PASSED
Test 066: b0.find(0) --> PASSED
Test 067: (n0 == (b0.find(4),b0.node()->get_ltree())) --> PASSED
Test 068: b0.find(2) --> PASSED
Test 069: (n0 == (b0.find(0),b0.node()->get_rtree())) --> PASSED
Test 070: b0.remove(5) --> PASSED
Test 071: b0.count() --> PASSED
Test 072: b0.tree_depth() --> PASSED
Test 073: b0.find(2) --> PASSED
Test 074: (n0 == (b0.find(6),b0.node()->get_ltree())) --> PASSED
Test 075: b0.find(4) --> PASSED
Test 076: (n0 == (b0.find(2),b0.node()->get_rtree())) --> PASSED
Test 077: b0.remove(9) --> PASSED
Test 078: b0.count() --> PASSED
Test 079: b0.tree_depth() --> PASSED
Test 080: b0.remove(6) --> PASSED
Test 081: b0.count() --> PASSED
Test 082: b0.tree_depth() --> PASSED
Test 083: b0.get_root()->get() --> PASSED
Test 084: b0.find(2) --> PASSED
Test 085: (n0 == (b0.find(4),b0.node()->get_ltree())) --> PASSED
Test 086: b0.find(10) --> PASSED
Test 087: (n0 == (b0.find(4),b0.node()->get_rtree())) --> PASSED
Test 088: b0.remove(4) --> PASSED
Test 089: b0.count() --> PASSED
Test 090: b0.tree_depth() --> PASSED
Test 091: b0.get_root()->get() --> PASSED
Test 092: b0.find(0) --> PASSED
Test 093: (n0 == (b0.find(2),b0.node()->get_ltree())) --> PASSED
Test 094: b0.remove(11) --> PASSED
Test 095: b0.count() --> PASSED
Test 096: b0.tree_depth() --> PASSED
Test 097: b0.remove(2) --> PASSED
Test 098: b0.count() --> PASSED
Test 099: b0.tree_depth() --> PASSED
Test 100: b0.get_root()->get() --> PASSED
Test 101: b0.find(10) --> PASSED
Test 102: (n0 == (b0.find(0),b0.node()->get_rtree())) --> PASSED
Test 103: b0.remove(0) --> PASSED
Test 104: b0.count() 1 --> PASSED
Test 105: b0.tree_depth() 0 --> PASSED
Test 106: b0.get_root()->get() --> PASSED
Test 107: b0.remove(10) --> PASSED
Test 108: b0.count() 1 --> PASSED
Test 109: b0.tree_depth() 0 --> PASSED
Test 110: bt0.count() --> PASSED
Test 111: bt0.tree_depth() --> PASSED
Test 112: avl0.count() --> PASSED
Test 113: avl0.tree_depth() --> PASSED
Test 114: avl0.put(9),avl0.put(8) --> PASSED
Test 115: avl0.tree_depth() --> PASSED
Test 116: avl0=bt0,avl.count() --> PASSED
Test 117: avl0.tree_depth() --> PASSED
Test 118: avl0.put(9),avl0.put(8) --> PASSED
Test 119: avl0.tree_depth() --> PASSED
Test 120: avl0.clear(),bo.count() --> PASSED
Test 121: CoolAVL_Tree<int> b0 --> PASSED
Test 122: b0.put(1) --> PASSED
Test 123: b0.count() --> PASSED
Test 124: b0.find(1) --> PASSED
Test 125: b0.value() --> PASSED
Test 126: b0.remove() --> PASSED
Test 127: b0.count() --> PASSED
Test 128: b0.put(4) --> PASSED
Test 129: b0.count() --> PASSED
Test 130: b0.tree_depth() --> PASSED
Test 131: b0.put(8) --> PASSED
Test 132: b0.count() --> PASSED
Test 133: b0.tree_depth() --> PASSED
Test 134: b0.put(3) --> PASSED
Test 135: b0.count() --> PASSED
Test 136: b0.tree_depth() --> PASSED
Test 137: b0.put(1) --> PASSED
Test 138: b0.count() --> PASSED
Test 139: b0.tree_depth() --> PASSED
Test 140: b0.put(2) --> PASSED
Test 141: b0.count() --> PASSED
Test 142: b0.tree_depth() --> PASSED
Test 143: b0.put(6) --> PASSED
Test 144: b0.count() --> PASSED
Test 145: b0.find(2) --> PASSED
Test 146: b0.value() --> PASSED
Test 147: b0.reset() --> PASSED
Test 148: b0.next() --> PASSED
Test 149: b0.value() --> PASSED
Test 150: b0.next() --> PASSED
Test 151: b0.value() --> PASSED
Test 152: b0.next() --> PASSED
Test 153: b0.value() --> PASSED
Test 154: b0.next() --> PASSED
Test 155: b0.value() --> PASSED
Test 156: b0.prev() --> PASSED
Test 157: b0.value() --> PASSED
Test 158: b0.prev() --> PASSED
Test 159: b0.value() --> PASSED
Test 160: b0.next() --> PASSED
Test 161: b0.value() --> PASSED
Test 162: b0.next() --> PASSED
Test 163: b0.value() --> PASSED
Test 164: b0.next() --> PASSED
Test 165: b0.value() --> PASSED
Test 166: b0.next() --> PASSED
Test 167: b0.value() --> PASSED
Test 168: b0.count() --> PASSED
Test 169: b0.find(99) --> PASSED
Test 170: CoolAVL_Tree<int> b1(b0) --> PASSED
Test 171: b1.remove(3) --> PASSED
Test 172: b1.count() --> PASSED
Test 173: b1.find(3) --> PASSED
Test 174: b0.remove(3) --> PASSED
Test 175: b0.count() --> PASSED
Test 176: b0.find(3) --> PASSED
Test 177: b0.put(-3) --> PASSED
Test 178: b0.tree_depth() --> PASSED
Test 179: b0.count() --> PASSED
Test 180: b0.put(18) --> PASSED
Test 181: b0.tree_depth() --> PASSED
Test 182: b0.count() --> PASSED
Test 183: b0.put(13) --> PASSED
Test 184: b0.tree_depth() --> PASSED
Test 185: b0.count() --> PASSED
Test 186: b0.put(1) --> PASSED
Test 187: b0.tree_depth() --> PASSED
Test 188: b0.count() --> PASSED
Test 189: b0.put(5) --> PASSED
Test 190: b0.tree_depth() --> PASSED
Test 191: b0.count() --> PASSED
Test 192: b0.put(17) --> PASSED
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?