66 return "allprimitives";
70 public void createInstances(
int numberOfInstances) {
71 for (
int i = 0;
i < numberOfInstances; ++
i) {
72 createAllPrimitiveInstance(
i);
76 public void testDeleteEqualByPrimaryKey() {
77 deleteEqualQuery(
"id",
"PRIMARY", 8, 1);
78 deleteEqualQuery(
"id",
"PRIMARY", 8, 0);
79 equalQuery(
"id",
"PRIMARY", 8);
83 public void testDeleteEqualByUniqueKey() {
84 deleteEqualQuery(
"int_not_null_hash",
"idx_int_not_null_hash", 8, 1);
85 deleteEqualQuery(
"int_not_null_hash",
"idx_int_not_null_hash", 8, 0);
86 equalQuery(
"int_not_null_hash",
"idx_int_not_null_hash", 8);
90 public void testDeleteEqualByBtreeIndex() {
91 deleteEqualQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 8, 1);
92 deleteEqualQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 8, 0);
93 equalQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 8);
97 public void testDeleteEqualByTableScan() {
98 deleteEqualQuery(
"int_not_null_none",
"none", 8, 1);
99 deleteEqualQuery(
"int_not_null_none",
"none", 8, 0);
100 equalQuery(
"int_not_null_none",
"none", 8);
104 public void testDeleteRangeByBtreeIndex() {
105 deleteGreaterThanAndLessThanQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 4, 7, 2);
106 deleteGreaterThanAndLessThanQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 4, 7, 0);
107 betweenQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 3, 8, 3, 4, 7, 8);
111 public void testDeleteRangeByTableScan() {
112 deleteGreaterThanAndLessThanQuery(
"int_not_null_none",
"none", 4, 7, 2);
113 deleteGreaterThanAndLessThanQuery(
"int_not_null_none",
"none", 4, 7, 0);
114 betweenQuery(
"int_not_null_btree",
"idx_int_not_null_btree", 3, 8, 3, 4, 7, 8);