diff options
Diffstat (limited to 'akregator/src/mk4storage/metakit/tests/tmapped.cpp')
| -rw-r--r-- | akregator/src/mk4storage/metakit/tests/tmapped.cpp | 244 |
1 files changed, 244 insertions, 0 deletions
diff --git a/akregator/src/mk4storage/metakit/tests/tmapped.cpp b/akregator/src/mk4storage/metakit/tests/tmapped.cpp new file mode 100644 index 000000000..20f8de5f2 --- /dev/null +++ b/akregator/src/mk4storage/metakit/tests/tmapped.cpp @@ -0,0 +1,244 @@ +// tmapped.cpp -- Regression test program, mapped view tests +// $Id$ +// This is part of Metakit, see http://www.equi4.com/metakit/ + +#include "regress.h" + +void TestBlockDel(int pos_, int len_) +{ + printf("blockdel pos %d len %d\n", pos_, len_); + + c4_ViewProp p1 ("_B"); + c4_IntProp p2 ("p2"); + + c4_Storage s1; + c4_View v1 = s1.GetAs("v1[_B[p2:I]]"); + + int n = 0; + static int sizes[] = {999, 999, 999, 2, 0}; + + for (int i = 0; sizes[i]; ++i) { + c4_View v; + v.SetSize(sizes[i]); + for (int j = 0; j < sizes[i]; ++j) + p2 (v[j]) = ++n; + v1.Add(p1 [v]); + } + + c4_View v2 = v1.Blocked(); + A(v2.GetSize() == 2999); + + v2.RemoveAt(pos_, len_); + A(v2.GetSize() == 2999 - len_); +} + +void TestMapped() +{ + B(m01, Hash mapping, 0); + { + c4_StringProp p1 ("p1"); + + c4_Storage s1; + c4_View v1 = s1.GetAs("v1[p1:S]"); + c4_View v2 = s1.GetAs("v2[_H:I,_R:I]"); + c4_View v3 = v1.Hash(v2, 1); + + v3.Add(p1 ["b93655249726e5ef4c68e45033c2e0850570e1e07"]); + v3.Add(p1 ["2ab03fba463d214f854a71ab5c951cea096887adf"]); + v3.Add(p1 ["2e196eecb91b02c16c23360d8e1b205f0b3e3fa3d"]); + A(v3.GetSize() == 3); + + // infinite loop in 2.4.0, reported by Nathan Rogers, July 2001 + // happens when looking for missing key after a hash collision + int f = v3.Find(p1 ["7c0734c9187133f34588517fb5b39294076f22ba3"]); + A(f == -1); + } E; + + // example from Steve Baxter, Nov 2001, after block perf bugfix + // assertion failure on row 1001, due to commit data mismatch + B(m02, Blocked view bug, 0) W(m02a); + { + c4_BytesProp p1 ("p1"); + c4_Bytes h; + + c4_Storage s1 ("m02a", true); + c4_View v1 = s1.GetAs("v1[_B[p1:B]]"); + c4_View v2 = v1.Blocked(); + + for (int i = 0; i < 1005; ++i) { + h.SetBuffer(2500 + i); + v2.Add(p1 [h]); + + if (i >= 999) // will crash a few rounds later, at row 1001 + s1.Commit(); + } + + // reduce size to shorten the dump output + v2.RemoveAt(0, 990); + s1.Commit(); + + } D(m02a); R(m02a); E; + + B(m03, Hash adds, 0) W(m03a); + { + c4_StringProp p1 ("p1"); + + c4_Storage s1 ("m03a", true); + + c4_View d1 = s1.GetAs("d1[p1:S]"); + c4_View m1 = s1.GetAs("m1[_H:I,_R:I]"); + c4_View h1 = d1.Hash(m1); + + h1.Add(p1 ["one"]); + s1.Commit(); + + c4_View d2 = s1.GetAs("d2[p1:S]"); + c4_View m2 = s1.GetAs("m2[_H:I,_R:I]"); + c4_View h2 = d2.Hash(m2); + + h1.Add(p1 ["two"]); + h2.Add(p1 ["two"]); + s1.Commit(); + + c4_View d3 = s1.GetAs("d3[p1:S]"); + c4_View m3 = s1.GetAs("m3[_H:I,_R:I]"); + c4_View h3 = d3.Hash(m3); + + h1.Add(p1 ["three"]); + h2.Add(p1 ["three"]); + h3.Add(p1 ["three"]); + s1.Commit(); + + c4_View d4 = s1.GetAs("d4[p1:S]"); + c4_View m4 = s1.GetAs("m4[_H:I,_R:I]"); + c4_View h4 = d4.Hash(m4); + + h1.Add(p1 ["four"]); + h2.Add(p1 ["four"]); + h3.Add(p1 ["four"]); + h4.Add(p1 ["four"]); + s1.Commit(); + + } D(m03a); R(m03a); E; + + B(m04, Locate bug, 0) W(m04a); + { + c4_IntProp p1 ("p1"); + c4_StringProp p2 ("p2"); + + c4_Storage s1 ("m04a", true); + s1.AutoCommit(); + + c4_View v1 = s1.GetAs("v1[p1:I,p2:S]"); + + v1.Add(p1 [1] + p2 ["one"]); + v1.Add(p1 [2] + p2 ["two"]); + v1.Add(p1 [3] + p2 ["three"]); + s1.Commit(); + + c4_View v2 = v1.Ordered(); + A(v2.GetSize() == 3); + v2.Add(p1 [6] + p2 ["six"]); + v2.Add(p1 [5] + p2 ["five"]); + v2.Add(p1 [4] + p2 ["four"]); + A(v2.GetSize() == 6); + A(v1.GetSize() == 6); + + A(p1 (v1[0]) == 1); + A(p1 (v1[1]) == 2); + A(p1 (v1[2]) == 3); + A(p1 (v1[3]) == 4); + A(p1 (v1[4]) == 5); + A(p1 (v1[5]) == 6); + + A(v2.Find(p1 [4]) == 3); + A(v2.Search(p1 [4]) == 3); + + int i1 = -1; + A(v1.Locate(p1 [4], &i1) == 1); + A(i1 == 3); + + int i2 = -1; + A(v2.Locate(p1 [4], &i2) == 1); + A(i2 == 3); + + } D(m04a); R(m04a); E; + + // subviews are not relocated properly with blocked views in 2.4.7 + B(m05, Blocked view with subviews, 0) W(m05a); + { + char buf[10]; + c4_StringProp p1 ("p1"); + c4_IntProp p2 ("p2"); + c4_ViewProp pSv ("sv"); + + c4_Storage s1 ("m05a", true); + c4_View v1 = s1.GetAs("v1[_B[p1:S,sv[p2:I]]]"); + c4_View v2 = v1.Blocked(); + + for (int i = 0; i < 1000; ++i) { + sprintf(buf, "id-%d", i); + v2.Add(p1 [buf]); + + c4_View v3 = pSv (v2[i]); + v3.Add(p2 [i]); + } + + for (int j = 0; j < 1; ++j) { + sprintf(buf, "insert-%d", j); + v2.InsertAt(500, p1 [buf]); + } + + s1.Commit(); + + } D(m05a); R(m05a); E; + + // 2003/02/14 - assert fails for 2.4.8 in c4_Column::RemoveData + B(m06, Blocked view multi-row deletion, 0) W(m06a); + { + c4_IntProp p1 ("p1"); + + c4_Storage s1 ("m06a", true); + c4_View v1 = s1.GetAs("v1[p1:I]"); + c4_View v2 = s1.GetAs("v2[_B[_H:I,_R:I]]"); + c4_View v3 = v2.Blocked(); + c4_View v4 = v1.Hash(v3, 1); + + v4.Add(p1 [1]); + v4.Add(p1 [2]); + v4.RemoveAt(1); + + for (int i = 100; i < 1000; ++i) { + v4.Add(p1 [i]); + } + + s1.Commit(); + + } D(m06a); R(m06a); E; + + // 2003/03/07 - still not correct on blocked veiw deletions + B(m07, All blocked view multi-deletion cases, 0); + { + int i, j; + for (i = 0; i < 2; ++i) { + for (j = 1; j < 4; ++j) + TestBlockDel(i, j); + for (j = 998; j < 1002; ++j) + TestBlockDel(i, j); + for (j = 1998; j < 2002; ++j) + TestBlockDel(i, j); + } + for (i = 998; i < 1002; ++i) { + for (j = 1; j < 4; ++j) + TestBlockDel(i, j); + for (j = 998; j < 1002; ++j) + TestBlockDel(i, j); + } + for (i = 1; i < 4; ++i) + TestBlockDel(2999 - i, i); + for (i = 998; i < 1002; ++i) + TestBlockDel(2999 - i, i); + for (i = 1998; i < 2002; ++i) + TestBlockDel(2999 - i, i); + } E; +} |