| … | … | @@ -139,9 +139,7 @@ void SimpleBasicDeleteUTest::test_duplicates(void) |
| 139 | 139 | TS_ASSERT_EQUALS(as->get_size(), 3); |
| 140 | 140 | store->open(); |
| 141 | 141 | store->load_atomspace(); |
| 142 | Handle tvk(as->get_node(PREDICATE_NODE, "*-TruthValueKey-*")); | |
| 143 | if (tvk) as->extract_atom(tvk); | |
| 144 | TS_ASSERT_EQUALS(as->get_size(), 3); | |
| 142 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 145 | 143 | |
| 146 | 144 | store->erase(); |
| 147 | 145 | store->close(); |
| … | … | @@ -198,9 +196,8 @@ void SimpleBasicDeleteUTest::test_recursive(void) |
| 198 | 196 | as->extract_atom(ha, true); |
| 199 | 197 | store->open(); |
| 200 | 198 | store->load_atomspace(); |
| 201 | Handle tvk(as->get_node(PREDICATE_NODE, "*-TruthValueKey-*")); | |
| 202 | if (tvk) as->extract_atom(tvk); | |
| 203 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 199 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 200 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 204 | 201 | |
| 205 | 202 | // -------------------------------------- |
| 206 | 203 | // Do it again, but with a different order. |
| … | … | @@ -213,18 +210,16 @@ void SimpleBasicDeleteUTest::test_recursive(void) |
| 213 | 210 | store->close(); |
| 214 | 211 | store->open(); |
| 215 | 212 | store->load_atomspace(); |
| 216 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 217 | if (tvk) as->extract_atom(tvk); | |
| 218 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 213 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 214 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 219 | 215 | |
| 220 | 216 | store->remove_atom(as, ha, true); |
| 221 | 217 | store->close(); |
| 222 | 218 | as->extract_atom(ha, true); |
| 223 | 219 | store->open(); |
| 224 | 220 | store->load_atomspace(); |
| 225 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 226 | if (tvk) as->extract_atom(tvk); | |
| 227 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 221 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 222 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 228 | 223 | |
| 229 | 224 | // -------------------------------------- |
| 230 | 225 | // Do it again, but with a complex order. |
| … | … | @@ -237,18 +232,16 @@ void SimpleBasicDeleteUTest::test_recursive(void) |
| 237 | 232 | store->close(); |
| 238 | 233 | store->open(); |
| 239 | 234 | store->load_atomspace(); |
| 240 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 241 | if (tvk) as->extract_atom(tvk); | |
| 242 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 235 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 236 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 243 | 237 | |
| 244 | 238 | store->remove_atom(as, ha, true); |
| 245 | 239 | store->close(); |
| 246 | 240 | as->extract_atom(ha, true); |
| 247 | 241 | store->open(); |
| 248 | 242 | store->load_atomspace(); |
| 249 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 250 | if (tvk) as->extract_atom(tvk); | |
| 251 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 243 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 244 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 252 | 245 | |
| 253 | 246 | // -------------------------------------- |
| 254 | 247 | // Do it again, but more deeply. |
| … | … | @@ -262,18 +255,16 @@ void SimpleBasicDeleteUTest::test_recursive(void) |
| 262 | 255 | store->close(); |
| 263 | 256 | store->open(); |
| 264 | 257 | store->load_atomspace(); |
| 265 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 266 | if (tvk) as->extract_atom(tvk); | |
| 267 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 258 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 259 | TS_ASSERT_EQUALS(as->get_size(), 8); | |
| 268 | 260 | |
| 269 | 261 | store->remove_atom(as, ha, true); |
| 270 | 262 | store->close(); |
| 271 | 263 | as->extract_atom(ha, true); |
| 272 | 264 | store->open(); |
| 273 | 265 | store->load_atomspace(); |
| 274 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 275 | if (tvk) as->extract_atom(tvk); | |
| 276 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 266 | // +2 for *-TruthValueKey-* and *-IsKeyFlag-* | |
| 267 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 277 | 268 | |
| 278 | 269 | // -------------------------------------- |
| 279 | 270 | store->erase(); |
| … | … | @@ -313,8 +304,8 @@ void SimpleBasicDeleteUTest::test_key_deletion(void) |
| 313 | 304 | store->store_atom(ha); |
| 314 | 305 | store->barrier(); |
| 315 | 306 | |
| 316 | // Verify the atomspace size | |
| 317 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 307 | // Verify the atomspace size (+1 for *-IsKeyFlag-*) | |
| 308 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 318 | 309 | |
| 319 | 310 | // Verify that there are three keys |
| 320 | 311 | HandleSet hs = ha->getKeys(); |
| … | … | @@ -325,7 +316,8 @@ void SimpleBasicDeleteUTest::test_key_deletion(void) |
| 325 | 316 | // Remove one of the keys |
| 326 | 317 | store->remove_atom(as, kb); |
| 327 | 318 | as->extract_atom(kb); |
| 328 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 319 | // +1 for *-IsKeyFlag-* | |
| 320 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 329 | 321 | |
| 330 | 322 | // Verify the key was deleted by loading only PredicateNodes. |
| 331 | 323 | as = createAtomSpace(); |
| … | … | @@ -356,10 +348,10 @@ void SimpleBasicDeleteUTest::test_key_deletion(void) |
| 356 | 348 | store->open(); |
| 357 | 349 | TS_ASSERT(store->connected()) |
| 358 | 350 | |
| 359 | // We expect 5 keys, including the truth-value key. | |
| 351 | // We expect 6 atoms (+1 for *-IsKeyFlag-*) | |
| 360 | 352 | printf("Loading the atomspace ...\n"); |
| 361 | 353 | store->load_atomspace(); |
| 362 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 354 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 363 | 355 | |
| 364 | 356 | // Verify that there are only two keys .. haha no, three. |
| 365 | 357 | // That is because the deleted key gets restored when the |
| … | … | @@ -414,13 +406,14 @@ void SimpleBasicDeleteUTest::test_key_corruption(void) |
| 414 | 406 | store->store_atom(hb); |
| 415 | 407 | store->barrier(); |
| 416 | 408 | |
| 417 | // Verify the atomspace size | |
| 418 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 409 | // Verify the atomspace size (+1 for *-IsKeyFlag-*) | |
| 410 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 419 | 411 | |
| 420 | 412 | // Remove the value |
| 421 | 413 | store->remove_atom(as, hx); |
| 422 | 414 | as->extract_atom(hx); |
| 423 | TS_ASSERT_EQUALS(as->get_size(), 3); | |
| 415 | // +1 for *-IsKeyFlag-* | |
| 416 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 424 | 417 | |
| 425 | 418 | // FYI, we should call store->close() at this point, but we |
| 426 | 419 | // don't, because ... most users forget to do this too. |
| … | … | @@ -439,7 +432,7 @@ void SimpleBasicDeleteUTest::test_key_corruption(void) |
| 439 | 432 | store->open(); |
| 440 | 433 | TS_ASSERT(store->connected()) |
| 441 | 434 | |
| 442 | // We expect 4 keys (the truth-value key doesn't show up.) | |
| 435 | // We expect 5 atoms: b, x, key-x, *-IsKeyFlag-*, StorageNode | |
| 443 | 436 | // That's because the (Concept "x") sitting in the Value |
| 444 | 437 | // was never actually deleted; thus it is restored. |
| 445 | 438 | printf("Loading the atomspace ...\n"); |
| … | … | @@ -450,10 +443,9 @@ void SimpleBasicDeleteUTest::test_key_corruption(void) |
| 450 | 443 | for (const Handle& h: hset) |
| 451 | 444 | printf("Atomspace contains h=%s\n", h->to_short_string().c_str()); |
| 452 | 445 | |
| 453 | Handle tvk(as->get_node(PREDICATE_NODE, "*-TruthValueKey-*")); | |
| 454 | if (tvk) as->extract_atom(tvk); | |
| 455 | // Size stays at 4 because (Concept "x") cannot be deleted. | |
| 456 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 446 | // Size is 5 because (Concept "x") cannot be deleted. | |
| 447 | // +1 for *-IsKeyFlag-* | |
| 448 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 457 | 449 | |
| 458 | 450 | hb = as->add_node(CONCEPT_NODE, "b"); |
| 459 | 451 | hx = as->add_node(CONCEPT_NODE, "x"); |
| … | … | @@ -466,19 +458,20 @@ void SimpleBasicDeleteUTest::test_key_corruption(void) |
| 466 | 458 | store->store_atom(hb); |
| 467 | 459 | store->barrier(); |
| 468 | 460 | |
| 469 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 461 | // +1 for *-IsKeyFlag-* | |
| 462 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 470 | 463 | |
| 471 | 464 | // Remove the value .. again |
| 472 | 465 | store->remove_atom(as, hx); |
| 473 | 466 | as->extract_atom(hx); |
| 474 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 467 | // +1 for *-IsKeyFlag-* | |
| 468 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 475 | 469 | store->close(); |
| 476 | 470 | store->open(); |
| 477 | 471 | store->load_atomspace(); |
| 478 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 479 | if (tvk) as->extract_atom(tvk); | |
| 480 | // Size stays at 6 because (Concept "x") cannot be deleted. | |
| 481 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 472 | // Size is 7 because (Concept "x") cannot be deleted. | |
| 473 | // +1 for *-IsKeyFlag-* | |
| 474 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 482 | 475 | |
| 483 | 476 | // We are done. |
| 484 | 477 | store->close(); |
| … | … | @@ -495,10 +488,10 @@ void SimpleBasicDeleteUTest::test_key_corruption(void) |
| 495 | 488 | store->open(); |
| 496 | 489 | TS_ASSERT(store->connected()) |
| 497 | 490 | |
| 498 | // We expect 6 keys, (the truth-value key does not show.) | |
| 491 | // We expect 7 atoms (+1 for *-IsKeyFlag-*) | |
| 499 | 492 | printf("Loading the atomspace ...\n"); |
| 500 | 493 | store->load_atomspace(); |
| 501 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 494 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 502 | 495 | |
| 503 | 496 | // Verify that there are two keys |
| 504 | 497 | hb = as->add_node(CONCEPT_NODE, "b"); |
| … | … | @@ -417,8 +417,8 @@ void BasicSaveUTest::test_table() |
| 417 | 417 | size_t num_fetched = table2->get_size(); |
| 418 | 418 | printf("test_table: Done loading table; fetched %lu, expected %lu\n", |
| 419 | 419 | num_fetched, num_stored); |
| 420 | // One extra, for the (PredicateNode "*-TruthValueKey-*") | |
| 421 | TSM_ASSERT("Wrong number of atoms fetched", num_fetched == num_stored+1); | |
| 420 | // Two extra: (PredicateNode "*-TruthValueKey-*") and (PredicateNode "*-IsKeyFlag-*") | |
| 421 | TSM_ASSERT("Wrong number of atoms fetched", num_fetched == num_stored+2); | |
| 422 | 422 | |
| 423 | 423 | idx = 0; |
| 424 | 424 | check_table(idx++, as2, "aaa "); |
| … | … | @@ -449,6 +449,7 @@ void DeleteUTest::test_remove(void) |
| 449 | 449 | /* Push all atoms out to storage */ |
| 450 | 450 | store->store_atomspace(); |
| 451 | 451 | |
| 452 | // +1 for (Predicate "*-IsKeyFlag-*") | |
| 452 | 453 | printf("Initial Atomspace size=%lu expect=%d\n", _as->get_size(), 7*idx+1); |
| 453 | 454 | TSM_ASSERT("Initial unexpected atomspace size", |
| 454 | 455 | ((unsigned)(7*idx+1)) == _as->get_size()); |
| … | … | @@ -461,6 +462,7 @@ void DeleteUTest::test_remove(void) |
| 461 | 462 | for (i=0; i<idx; i++) |
| 462 | 463 | extract_links(i, _as); |
| 463 | 464 | |
| 465 | // +1 for (Predicate "*-IsKeyFlag-*") | |
| 464 | 466 | printf("Atomspace size=%lu expect=%d\n", _as->get_size(), 4*idx+1); |
| 465 | 467 | TSM_ASSERT("Post-extract unexpected atomspace size", ((unsigned)(4*idx+1)) == _as->get_size()); |
| 466 | 468 | |
| … | … | @@ -474,8 +476,8 @@ void DeleteUTest::test_remove(void) |
| 474 | 476 | for (i=0; i<idx; i++) |
| 475 | 477 | delete_links(i, store); |
| 476 | 478 | |
| 477 | printf("Post-remove size=%lu expect=%d\n", _as->get_size(), 4*idx+2); | |
| 478 | TSM_ASSERT("Post-remove unexpected atomspace size", ((unsigned)(4*idx+2)) == _as->get_size()); | |
| 479 | printf("Post-remove size=%lu expect=%d\n", _as->get_size(), 4*idx+3); | |
| 480 | TSM_ASSERT("Post-remove unexpected atomspace size", ((unsigned)(4*idx+3)) == _as->get_size()); | |
| 479 | 481 | |
| 480 | 482 | /* Verify that the atoms are really gone from storage. */ |
| 481 | 483 | for (i=0; i<idx; i++) { |
| … | … | @@ -483,8 +485,8 @@ void DeleteUTest::test_remove(void) |
| 483 | 485 | check_remove(i, _as, "verify-gone"); |
| 484 | 486 | } |
| 485 | 487 | |
| 486 | printf("Post-referesh size=%lu expect=%d\n", _as->get_size(), 7*idx+2); | |
| 487 | TSM_ASSERT("Post-refetch unexpected atomspace size", ((unsigned)(7*idx+2)) == _as->get_size()); | |
| 488 | printf("Post-referesh size=%lu expect=%d\n", _as->get_size(), 7*idx+3); | |
| 489 | TSM_ASSERT("Post-refetch unexpected atomspace size", ((unsigned)(7*idx+3)) == _as->get_size()); | |
| 488 | 490 | |
| 489 | 491 | /* Kill data for good */ |
| 490 | 492 | _as->clear(); |
| … | … | @@ -538,6 +540,7 @@ void DeleteUTest::test_recurse(void) |
| 538 | 540 | for (i=0; i<zap; i++) |
| 539 | 541 | extract_nodes(i, _as); |
| 540 | 542 | |
| 543 | // +1 for the *-IsKeyFlag-* predicate | |
| 541 | 544 | size_t expsz = 7*(idx-zap) + 3*zap + 1; |
| 542 | 545 | printf("Atomspace size=%lu expect=%lu\n", |
| 543 | 546 | _as->get_size(), expsz); |
| … | … | @@ -554,8 +557,8 @@ void DeleteUTest::test_recurse(void) |
| 554 | 557 | delete_nodes(i, store); |
| 555 | 558 | |
| 556 | 559 | printf("Post-remove size=%lu expect=%lu\n", |
| 557 | _as->get_size(), expsz+1); | |
| 558 | TSM_ASSERT("Unexpected atomspace size", expsz+1 == _as->get_size()); | |
| 560 | _as->get_size(), expsz+2); | |
| 561 | TSM_ASSERT("Unexpected atomspace size", expsz+2 == _as->get_size()); | |
| 559 | 562 | |
| 560 | 563 | store->barrier(); |
| 561 | 564 | |
| … | … | @@ -565,9 +568,9 @@ void DeleteUTest::test_recurse(void) |
| 565 | 568 | } |
| 566 | 569 | |
| 567 | 570 | printf("Post-refetch size=%lu expect=%d\n", |
| 568 | _as->get_size(), 7*idx+2); | |
| 571 | _as->get_size(), 7*idx+3); | |
| 569 | 572 | TSM_ASSERT("Unexpected atomspace size", |
| 570 | ((unsigned) 7*idx+2) == _as->get_size()); | |
| 573 | ((unsigned) 7*idx+3) == _as->get_size()); | |
| 571 | 574 | |
| 572 | 575 | /* Check that the removed atoms really got zapped. */ |
| 573 | 576 | for (i=0; i<zap; i++) { |
| … | … | @@ -209,9 +209,9 @@ void SimpleMultiDeleteUTest::test_add_delete(void) |
| 209 | 209 | store->load_atomspace(); |
| 210 | 210 | printf("Final AtomSpace size=%lu\n", as->get_size()); |
| 211 | 211 | |
| 212 | // Size should be 19: the 18 from before plus that annoying | |
| 213 | // (Predicate "*-TruthValueKey-*") | |
| 214 | size_t expected_size = 3 + 6 + n_threads; | |
| 212 | // Size should be 20: the 18 from before plus | |
| 213 | // (Predicate "*-TruthValueKey-*") and (Predicate "*-IsKeyFlag-*") | |
| 214 | size_t expected_size = 4 + 6 + n_threads; | |
| 215 | 215 | if (as->get_size() != expected_size) |
| 216 | 216 | printf("Error: Bad size! AtomSpace contents =\n%s\n", |
| 217 | 217 | as->to_string().c_str()); |
| … | … | @@ -353,10 +353,10 @@ void SimpleValueSaveUTest::test_load_by_type() |
| 353 | 353 | store->fetch_all_atoms_of_type(CONCEPT_NODE); |
| 354 | 354 | store->barrier(); |
| 355 | 355 | |
| 356 | // Six: 4 ConceptNodes, the PredicateNode "*-TruthValueKey-*" | |
| 357 | // and PredicateNode "some pred key" -- the two preds show up | |
| 358 | // when the attached values are fetched. | |
| 359 | TSM_ASSERT_EQUALS("Wrong number of Atoms fetched!", as->get_size(), 7); | |
| 356 | // Seven: 4 ConceptNodes, the PredicateNode "*-TruthValueKey-*", | |
| 357 | // PredicateNode "some pred key", and PredicateNode "*-IsKeyFlag-*" | |
| 358 | // -- the preds show up when the attached values are fetched. | |
| 359 | TSM_ASSERT_EQUALS("Wrong number of Atoms fetched!", as->get_size(), 8); | |
| 360 | 360 | |
| 361 | 361 | printf("Got %lu Atoms\n", as->get_size()); |
| 362 | 362 | HandleSeq hset; |
| … | … | @@ -520,9 +520,10 @@ void SimpleValueSaveUTest::test_link_by_type() |
| 520 | 520 | // The B-nodes are added after the fetch. In either case, |
| 521 | 521 | // there should not be any values fetched for either A or B; |
| 522 | 522 | // only the values on the C-links should be fetched. |
| 523 | // +1 for (PredicateNode "*-IsKeyFlag-*") | |
| 523 | 524 | store->fetch_all_atoms_of_type(LIST_LINK); |
| 524 | 525 | store->barrier(); |
| 525 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 15); | |
| 526 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 16); | |
| 526 | 527 | |
| 527 | 528 | printf("Got %lu Atoms\n", as->get_size()); |
| 528 | 529 | HandleSeq hset; |
| … | … | @@ -743,9 +744,10 @@ void SimpleValueSaveUTest::test_link_by_type_quoted() |
| 743 | 744 | store->fetch_all_atoms_of_type(LIST_LINK); |
| 744 | 745 | store->barrier(); |
| 745 | 746 | |
| 746 | // We created 9 new atoms above, so expect 15 from before plus 9 | |
| 747 | printf ("fetched %lu atoms, expecting 24\n", as->get_size()); | |
| 748 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 24); | |
| 747 | // We created 9 new atoms above, so expect 16 from before plus 9 | |
| 748 | // (+1 for *-IsKeyFlag-*) | |
| 749 | printf ("fetched %lu atoms, expecting 25\n", as->get_size()); | |
| 750 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 25); | |
| 749 | 751 | |
| 750 | 752 | Handle gbf = as->add_node(CONCEPT_NODE, "b float node"); |
| 751 | 753 | Handle gbt = as->add_node(CONCEPT_NODE, "b string node"); |
| … | … | @@ -961,8 +963,9 @@ void SimpleValueSaveUTest::test_incoming() |
| 961 | 963 | store->fetch_incoming_set(gat, false); |
| 962 | 964 | store->fetch_incoming_set(gal, false); |
| 963 | 965 | store->fetch_incoming_set(gav, false); |
| 964 | printf ("AtomSpace now contains %lu atoms, expecting 15\n", as->get_size()); | |
| 965 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 15); | |
| 966 | // +1 for *-IsKeyFlag-* | |
| 967 | printf ("AtomSpace now contains %lu atoms, expecting 16\n", as->get_size()); | |
| 968 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 16); | |
| 966 | 969 | |
| 967 | 970 | Handle gbf = as->add_node(CONCEPT_NODE, "b float node"); |
| 968 | 971 | Handle gbt = as->add_node(CONCEPT_NODE, "b string node"); |
| … | … | @@ -139,9 +139,8 @@ void BasicDeleteUTest::test_duplicates(void) |
| 139 | 139 | TS_ASSERT_EQUALS(as->get_size(), 3); |
| 140 | 140 | store->open(); |
| 141 | 141 | store->load_atomspace(); |
| 142 | Handle tvk(as->get_node(PREDICATE_NODE, "*-TruthValueKey-*")); | |
| 143 | if (tvk) as->extract_atom(tvk); | |
| 144 | TS_ASSERT_EQUALS(as->get_size(), 3); | |
| 142 | // +1 for *-IsKeyFlag-* | |
| 143 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 145 | 144 | |
| 146 | 145 | store->erase(); |
| 147 | 146 | store->close(); |
| … | … | @@ -198,9 +197,8 @@ void BasicDeleteUTest::test_recursive(void) |
| 198 | 197 | as->extract_atom(ha, true); |
| 199 | 198 | store->open(); |
| 200 | 199 | store->load_atomspace(); |
| 201 | Handle tvk(as->get_node(PREDICATE_NODE, "*-TruthValueKey-*")); | |
| 202 | if (tvk) as->extract_atom(tvk); | |
| 203 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 200 | // +1 for *-IsKeyFlag-* | |
| 201 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 204 | 202 | |
| 205 | 203 | // -------------------------------------- |
| 206 | 204 | // Do it again, but with a different order. |
| … | … | @@ -213,18 +211,16 @@ void BasicDeleteUTest::test_recursive(void) |
| 213 | 211 | store->close(); |
| 214 | 212 | store->open(); |
| 215 | 213 | store->load_atomspace(); |
| 216 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 217 | if (tvk) as->extract_atom(tvk); | |
| 218 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 214 | // +1 for *-IsKeyFlag-* | |
| 215 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 219 | 216 | |
| 220 | 217 | store->remove_atom(as, ha, true); |
| 221 | 218 | store->close(); |
| 222 | 219 | as->extract_atom(ha, true); |
| 223 | 220 | store->open(); |
| 224 | 221 | store->load_atomspace(); |
| 225 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 226 | if (tvk) as->extract_atom(tvk); | |
| 227 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 222 | // +1 for *-IsKeyFlag-* | |
| 223 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 228 | 224 | |
| 229 | 225 | // -------------------------------------- |
| 230 | 226 | // Do it again, but with a complex order. |
| … | … | @@ -237,18 +233,16 @@ void BasicDeleteUTest::test_recursive(void) |
| 237 | 233 | store->close(); |
| 238 | 234 | store->open(); |
| 239 | 235 | store->load_atomspace(); |
| 240 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 241 | if (tvk) as->extract_atom(tvk); | |
| 242 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 236 | // +1 for *-IsKeyFlag-* | |
| 237 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 243 | 238 | |
| 244 | 239 | store->remove_atom(as, ha, true); |
| 245 | 240 | store->close(); |
| 246 | 241 | as->extract_atom(ha, true); |
| 247 | 242 | store->open(); |
| 248 | 243 | store->load_atomspace(); |
| 249 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 250 | if (tvk) as->extract_atom(tvk); | |
| 251 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 244 | // +1 for *-IsKeyFlag-* | |
| 245 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 252 | 246 | |
| 253 | 247 | // -------------------------------------- |
| 254 | 248 | // Do it again, but more deeply. |
| … | … | @@ -262,18 +256,16 @@ void BasicDeleteUTest::test_recursive(void) |
| 262 | 256 | store->close(); |
| 263 | 257 | store->open(); |
| 264 | 258 | store->load_atomspace(); |
| 265 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 266 | if (tvk) as->extract_atom(tvk); | |
| 267 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 259 | // +1 for *-IsKeyFlag-* | |
| 260 | TS_ASSERT_EQUALS(as->get_size(), 8); | |
| 268 | 261 | |
| 269 | 262 | store->remove_atom(as, ha, true); |
| 270 | 263 | store->close(); |
| 271 | 264 | as->extract_atom(ha, true); |
| 272 | 265 | store->open(); |
| 273 | 266 | store->load_atomspace(); |
| 274 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 275 | if (tvk) as->extract_atom(tvk); | |
| 276 | TS_ASSERT_EQUALS(as->get_size(), 2); | |
| 267 | // +1 for *-IsKeyFlag-* | |
| 268 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 277 | 269 | |
| 278 | 270 | // -------------------------------------- |
| 279 | 271 | store->erase(); |
| … | … | @@ -313,8 +305,8 @@ void BasicDeleteUTest::test_key_deletion(void) |
| 313 | 305 | store->store_atom(ha); |
| 314 | 306 | store->barrier(); |
| 315 | 307 | |
| 316 | // Verify the atomspace size | |
| 317 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 308 | // Verify the atomspace size (+1 for *-IsKeyFlag-*) | |
| 309 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 318 | 310 | |
| 319 | 311 | // Verify that there are three keys |
| 320 | 312 | HandleSet hs = ha->getKeys(); |
| … | … | @@ -325,7 +317,8 @@ void BasicDeleteUTest::test_key_deletion(void) |
| 325 | 317 | // Remove one of the keys |
| 326 | 318 | store->remove_atom(as, kb); |
| 327 | 319 | as->extract_atom(kb); |
| 328 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 320 | // +1 for *-IsKeyFlag-* | |
| 321 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 329 | 322 | |
| 330 | 323 | // Verify the key was deleted by loading only PredicateNodes. |
| 331 | 324 | as = createAtomSpace(); |
| … | … | @@ -357,10 +350,10 @@ void BasicDeleteUTest::test_key_deletion(void) |
| 357 | 350 | store->open(); |
| 358 | 351 | TS_ASSERT(store->connected()) |
| 359 | 352 | |
| 360 | // We expect 5 keys, including the truth-value key. | |
| 353 | // We expect 6 keys (includes *-TruthValueKey-* and *-IsKeyFlag-*) | |
| 361 | 354 | printf("Loading the atomspace ...\n"); |
| 362 | 355 | store->load_atomspace(); |
| 363 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 356 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 364 | 357 | |
| 365 | 358 | // Verify that there are only two keys .. haha no, three. |
| 366 | 359 | // That is because the deleted key gets restored when the |
| … | … | @@ -415,13 +408,14 @@ void BasicDeleteUTest::test_key_corruption(void) |
| 415 | 408 | store->store_atom(hb); |
| 416 | 409 | store->barrier(); |
| 417 | 410 | |
| 418 | // Verify the atomspace size | |
| 419 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 411 | // Verify the atomspace size (+1 for *-IsKeyFlag-*) | |
| 412 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 420 | 413 | |
| 421 | 414 | // Remove the value |
| 422 | 415 | store->remove_atom(as, hx); |
| 423 | 416 | as->extract_atom(hx); |
| 424 | TS_ASSERT_EQUALS(as->get_size(), 3); | |
| 417 | // +1 for *-IsKeyFlag-* | |
| 418 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 425 | 419 | |
| 426 | 420 | // FYI, we should call store->close() at this point, but we |
| 427 | 421 | // don't, because ... most users forget to do this too. |
| … | … | @@ -440,7 +434,7 @@ void BasicDeleteUTest::test_key_corruption(void) |
| 440 | 434 | store->open(); |
| 441 | 435 | TS_ASSERT(store->connected()) |
| 442 | 436 | |
| 443 | // We expect 4 keys (the truth-value key doesn't show up.) | |
| 437 | // We expect 5 atoms: b, x, key-x, *-IsKeyFlag-*, StorageNode | |
| 444 | 438 | // That's because the (Concept "x") sitting in the Value |
| 445 | 439 | // was never actually deleted; thus it is restored. |
| 446 | 440 | printf("Loading the atomspace ...\n"); |
| … | … | @@ -451,10 +445,9 @@ void BasicDeleteUTest::test_key_corruption(void) |
| 451 | 445 | for (const Handle& h: hset) |
| 452 | 446 | printf("Atomspace contains h=%s\n", h->to_short_string().c_str()); |
| 453 | 447 | |
| 454 | Handle tvk(as->get_node(PREDICATE_NODE, "*-TruthValueKey-*")); | |
| 455 | if (tvk) as->extract_atom(tvk); | |
| 456 | // Size stays at 4 because (Concept "x") cannot be deleted. | |
| 457 | TS_ASSERT_EQUALS(as->get_size(), 4); | |
| 448 | // Size is 5 because (Concept "x") cannot be deleted. | |
| 449 | // +1 for *-IsKeyFlag-* | |
| 450 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 458 | 451 | |
| 459 | 452 | hb = as->add_node(CONCEPT_NODE, "b"); |
| 460 | 453 | hx = as->add_node(CONCEPT_NODE, "x"); |
| … | … | @@ -467,19 +460,20 @@ void BasicDeleteUTest::test_key_corruption(void) |
| 467 | 460 | store->store_atom(hb); |
| 468 | 461 | store->barrier(); |
| 469 | 462 | |
| 470 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 463 | // +1 for *-IsKeyFlag-* | |
| 464 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 471 | 465 | |
| 472 | 466 | // Remove the value .. again |
| 473 | 467 | store->remove_atom(as, hx); |
| 474 | 468 | as->extract_atom(hx); |
| 475 | TS_ASSERT_EQUALS(as->get_size(), 5); | |
| 469 | // +1 for *-IsKeyFlag-* | |
| 470 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 476 | 471 | store->close(); |
| 477 | 472 | store->open(); |
| 478 | 473 | store->load_atomspace(); |
| 479 | tvk = as->get_node(PREDICATE_NODE, "*-TruthValueKey-*"); | |
| 480 | if (tvk) as->extract_atom(tvk); | |
| 481 | // Size stays at 6 because (Concept "x") cannot be deleted. | |
| 482 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 474 | // Size is 7 because (Concept "x") cannot be deleted. | |
| 475 | // +1 for *-IsKeyFlag-* | |
| 476 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 483 | 477 | |
| 484 | 478 | // We are done. |
| 485 | 479 | store->close(); |
| … | … | @@ -496,10 +490,10 @@ void BasicDeleteUTest::test_key_corruption(void) |
| 496 | 490 | store->open(); |
| 497 | 491 | TS_ASSERT(store->connected()) |
| 498 | 492 | |
| 499 | // We expect 6 keys, (the truth-value key does not show.) | |
| 493 | // We expect 7 atoms (+1 for *-IsKeyFlag-*) | |
| 500 | 494 | printf("Loading the atomspace ...\n"); |
| 501 | 495 | store->load_atomspace(); |
| 502 | TS_ASSERT_EQUALS(as->get_size(), 6); | |
| 496 | TS_ASSERT_EQUALS(as->get_size(), 7); | |
| 503 | 497 | |
| 504 | 498 | // Verify that there are two keys |
| 505 | 499 | hb = as->add_node(CONCEPT_NODE, "b"); |
| … | … | @@ -426,8 +426,8 @@ void BasicSaveUTest::test_table() |
| 426 | 426 | size_t num_fetched = table2->get_size(); |
| 427 | 427 | printf("test_table: Done loading table; fetched %lu, expected %lu\n", |
| 428 | 428 | num_fetched, num_stored); |
| 429 | // One extra, for the (PredicateNode "*-TruthValueKey-*") | |
| 430 | TSM_ASSERT("Wrong number of atoms fetched", num_fetched == num_stored+1); | |
| 429 | // Two extra: (PredicateNode "*-TruthValueKey-*") and (PredicateNode "*-IsKeyFlag-*") | |
| 430 | TSM_ASSERT("Wrong number of atoms fetched", num_fetched == num_stored+2); | |
| 431 | 431 | |
| 432 | 432 | idx = 0; |
| 433 | 433 | check_table(idx++, table2, "aaa "); |
| … | … | @@ -453,6 +453,7 @@ void DeleteUTest::test_remove(void) |
| 453 | 453 | /* Push all atoms out to storage */ |
| 454 | 454 | store->store_atomspace(); |
| 455 | 455 | |
| 456 | // +1 for (Predicate "*-IsKeyFlag-*") | |
| 456 | 457 | printf("Initial Atomspace size=%lu expect=%d\n", _as->get_size(), 7*idx+1); |
| 457 | 458 | TSM_ASSERT("Initial unexpected atomspace size", |
| 458 | 459 | ((unsigned)(7*idx+1)) == _as->get_size()); |
| … | … | @@ -465,6 +466,7 @@ void DeleteUTest::test_remove(void) |
| 465 | 466 | for (i=0; i<idx; i++) |
| 466 | 467 | extract_links(i, _as); |
| 467 | 468 | |
| 469 | // +1 for (Predicate "*-IsKeyFlag-*") | |
| 468 | 470 | printf("Atomspace size=%lu expect=%d\n", _as->get_size(), 4*idx+1); |
| 469 | 471 | TSM_ASSERT("Post-extract unexpected atomspace size", ((unsigned)(4*idx+1)) == _as->get_size()); |
| 470 | 472 | |
| … | … | @@ -478,9 +480,9 @@ void DeleteUTest::test_remove(void) |
| 478 | 480 | for (i=0; i<idx; i++) |
| 479 | 481 | delete_links(i, store); |
| 480 | 482 | |
| 481 | printf("Post-remove size=%lu expect=%d\n", _as->get_size(), 4*idx+2); | |
| 483 | printf("Post-remove size=%lu expect=%d\n", _as->get_size(), 4*idx+3); | |
| 482 | 484 | TSM_ASSERT("Post-remove unexpected atomspace size", |
| 483 | ((unsigned)(4*idx+2)) == _as->get_size()); | |
| 485 | ((unsigned)(4*idx+3)) == _as->get_size()); | |
| 484 | 486 | |
| 485 | 487 | /* Verify that the atoms are really gone from storage. */ |
| 486 | 488 | for (i=0; i<idx; i++) { |
| … | … | @@ -488,9 +490,9 @@ void DeleteUTest::test_remove(void) |
| 488 | 490 | check_remove(i, _as, "verify-gone"); |
| 489 | 491 | } |
| 490 | 492 | |
| 491 | printf("Post-referesh size=%lu expect=%d\n", _as->get_size(), 7*idx+2); | |
| 493 | printf("Post-referesh size=%lu expect=%d\n", _as->get_size(), 7*idx+3); | |
| 492 | 494 | TSM_ASSERT("Post-refetch unexpected atomspace size", |
| 493 | ((unsigned)(7*idx+2)) == _as->get_size()); | |
| 495 | ((unsigned)(7*idx+3)) == _as->get_size()); | |
| 494 | 496 | |
| 495 | 497 | /* Kill data for good */ |
| 496 | 498 | _as->clear(); |
| … | … | @@ -544,6 +546,7 @@ void DeleteUTest::test_recurse(void) |
| 544 | 546 | for (i=0; i<zap; i++) |
| 545 | 547 | extract_nodes(i, _as); |
| 546 | 548 | |
| 549 | // +1 for the *-IsKeyFlag-* predicate | |
| 547 | 550 | size_t expsz = 7*(idx-zap) + 3*zap + 1; |
| 548 | 551 | printf("Atomspace size=%lu expect=%lu\n", |
| 549 | 552 | _as->get_size(), expsz); |
| … | … | @@ -560,8 +563,8 @@ void DeleteUTest::test_recurse(void) |
| 560 | 563 | delete_nodes(i, store); |
| 561 | 564 | |
| 562 | 565 | printf("Post-remove size=%lu expect=%lu\n", |
| 563 | _as->get_size(), expsz+1); | |
| 564 | TSM_ASSERT("Unexpected atomspace size", expsz+1 == _as->get_size()); | |
| 566 | _as->get_size(), expsz+2); | |
| 567 | TSM_ASSERT("Unexpected atomspace size", expsz+2 == _as->get_size()); | |
| 565 | 568 | |
| 566 | 569 | store->barrier(); |
| 567 | 570 | |
| … | … | @@ -571,9 +574,9 @@ void DeleteUTest::test_recurse(void) |
| 571 | 574 | } |
| 572 | 575 | |
| 573 | 576 | printf("Post-refetch size=%lu expect=%d\n", |
| 574 | _as->get_size(), 7*idx+2); | |
| 577 | _as->get_size(), 7*idx+3); | |
| 575 | 578 | TSM_ASSERT("Unexpected atomspace size", |
| 576 | ((unsigned) 7*idx+2) == _as->get_size()); | |
| 579 | ((unsigned) 7*idx+3) == _as->get_size()); | |
| 577 | 580 | |
| 578 | 581 | /* Check that the removed atoms really got zapped. */ |
| 579 | 582 | for (i=0; i<zap; i++) { |
| … | … | @@ -357,12 +357,12 @@ void ValueSaveUTest::test_load_by_type() |
| 357 | 357 | store->fetch_all_atoms_of_type(CONCEPT_NODE); |
| 358 | 358 | store->barrier(); |
| 359 | 359 | |
| 360 | // Six: 4 ConceptNodes, the PredicateNode "*-TruthValueKey-*" | |
| 361 | // and PredicateNode "some pred key" -- the two preds show up | |
| 362 | // when the attached values are fetched. | |
| 363 | printf ("fetched %lu atoms, expecting 7\n", as->get_size()); | |
| 360 | // Seven: 4 ConceptNodes, the PredicateNode "*-TruthValueKey-*", | |
| 361 | // PredicateNode "some pred key", and PredicateNode "*-IsKeyFlag-*" | |
| 362 | // -- the preds show up when the attached values are fetched. | |
| 363 | printf ("fetched %lu atoms, expecting 8\n", as->get_size()); | |
| 364 | 364 | // printf("contents=%s\n", as->to_string().c_str()); |
| 365 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 7); | |
| 365 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 8); | |
| 366 | 366 | |
| 367 | 367 | Handle gkey = as->add_node(PREDICATE_NODE, "some pred key"); |
| 368 | 368 | Handle gaf = as->add_node(CONCEPT_NODE, "float node"); |
| … | … | @@ -520,11 +520,12 @@ void ValueSaveUTest::test_link_by_type() |
| 520 | 520 | // The B-nodes are added after the fetch. In either case, |
| 521 | 521 | // there should not be any values fetched for either A or B; |
| 522 | 522 | // only the values on the C-links should be fetched. |
| 523 | // +1 for (PredicateNode "*-IsKeyFlag-*") | |
| 523 | 524 | store->fetch_all_atoms_of_type(LIST_LINK); |
| 524 | 525 | store->barrier(); |
| 525 | printf ("fetched %lu atoms, expecting 15\n", as->get_size()); | |
| 526 | printf ("fetched %lu atoms, expecting 16\n", as->get_size()); | |
| 526 | 527 | // printf("contents=%s\n", as->to_string().c_str()); |
| 527 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 15); | |
| 528 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 16); | |
| 528 | 529 | |
| 529 | 530 | Handle gbf = as->add_node(CONCEPT_NODE, "b float node"); |
| 530 | 531 | Handle gbt = as->add_node(CONCEPT_NODE, "b string node"); |
| … | … | @@ -731,9 +732,10 @@ void ValueSaveUTest::test_link_by_type_quoted() |
| 731 | 732 | store->fetch_all_atoms_of_type(LIST_LINK); |
| 732 | 733 | store->barrier(); |
| 733 | 734 | |
| 734 | // We created 9 new atoms above, so expect 15 from before plus 9 | |
| 735 | printf ("fetched %lu atoms, expecting 24\n", as->get_size()); | |
| 736 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 24); | |
| 735 | // We created 9 new atoms above, so expect 16 from before plus 9 | |
| 736 | // (+1 for *-IsKeyFlag-*) | |
| 737 | printf ("fetched %lu atoms, expecting 25\n", as->get_size()); | |
| 738 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 25); | |
| 737 | 739 | |
| 738 | 740 | Handle gbf = as->add_node(CONCEPT_NODE, "b float node"); |
| 739 | 741 | Handle gbt = as->add_node(CONCEPT_NODE, "b string node"); |
| … | … | @@ -945,7 +947,8 @@ void ValueSaveUTest::test_incoming() |
| 945 | 947 | store->fetch_incoming_set(gal, false); |
| 946 | 948 | store->fetch_incoming_set(gav, false); |
| 947 | 949 | store->barrier(); |
| 948 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 15); | |
| 950 | // +1 for *-IsKeyFlag-* | |
| 951 | TSM_ASSERT("Wrong number of Atoms fetched!", as->get_size() == 16); | |
| 949 | 952 | |
| 950 | 953 | Handle gbf = as->add_node(CONCEPT_NODE, "b float node"); |
| 951 | 954 | Handle gbt = as->add_node(CONCEPT_NODE, "b string node"); |