amxmodx/plugins/testsuite/trietest.sma

542 lines
12 KiB
SourcePawn
Raw Normal View History

// vim: set ts=4 sw=4 tw=99 noet:
//
// AMX Mod X, based on AMX Mod by Aleksander Naszko ("OLO").
// Copyright (C) The AMX Mod X Development Team.
//
// This software is licensed under the GNU General Public License, version 3 or higher.
// Additional exceptions apply. For full license details, see LICENSE.txt or visit:
// https://alliedmods.net/amxmodx-license
2008-04-14 23:52:11 +04:00
#include <amxmodx>
new failcount = 0;
new passcount = 0;
public plugin_init()
{
register_plugin("Trie Test", AMXX_VERSION_STR, "AMXX Dev Team");
register_srvcmd("trietest", "trietest");
}
stock fail(const testname[])
{
server_print("[FAIL] %s", testname);
failcount++;
}
stock pass(const testname[])
{
server_print("[PASS] %s", testname);
passcount++;
}
stock done()
{
server_print("Finished. %d tests, %d failed", failcount + passcount, failcount);
}
public trietest()
{
failcount = 0;
passcount = 0;
new bool:ok = true;
new Trie:t = TrieCreate();
new Trie:oldhandle = t; // Makes sure that the trie handle system recycles old handles
new key[32];
for (new i = 0; i < 100; i++)
{
formatex(key, charsmax(key), "K%dK", i);
2014-05-03 18:09:31 +04:00
if (!TrieSetCell(t, key, i))
{
server_print("TrieGetCell(%d, '%s', %d) failed", t, key, i);
ok = false;
}
2008-04-14 23:52:11 +04:00
}
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
for (new i = 0; i < 100; i++)
{
formatex(key, charsmax(key), "K%dK", i);
new val;
if (!TrieGetCell(t, key, val))
{
server_print("TrieGetCell(%d, '%s', %d) failed", t, key, val);
ok = false;
}
else if (val != i)
{
server_print("val mismatch, expected: %d got: %d", i, val);
ok = false;
}
}
2014-05-04 01:21:56 +04:00
// Setting K42K without replace should fail.
new value;
if (TrieSetCell(t, "K42K", 999, false)) { ok = false; server_print("set trie K42K should fail"); }
if (!TrieGetCell(t, "K42K", value) || value != 42) { ok = false; server_print("value at K42K not correct"); }
if (!TrieSetCell(t, "K42K", 999)) { ok = false; server_print("set trie K42K = 999 should succeed"); }
if (!TrieGetCell(t, "K42K", value) || value != 999) { ok = false; server_print("value at K42K not correct"); }
2014-05-03 18:09:31 +04:00
// Check size is 100.
if (TrieGetSize(t) != 100)
{
server_print("Map size mismatch (1), expected: %d got: %d", 100, TrieGetSize(t)); ok = false;
}
2014-05-04 01:21:56 +04:00
if (TrieGetCell(t, "cat", value))
{
server_print("trie should not have a cat."); ok = false;
}
2014-05-04 01:21:56 +04:00
// Check that "K42K" is not a string or array.
new array[32];
new string[32];
if (TrieGetArray(t, "K42K", array, sizeof(array)) ||
TrieGetString(t, "K42K", string, charsmax(string)))
{
server_print("entry K42K should not be an array or string"); ok = false;
}
2014-05-04 01:21:56 +04:00
TrieClear(t);
2014-05-04 01:21:56 +04:00
if (TrieGetSize(t) != 0)
{
server_print("Map size mismatch (2), expected: %d got: %d", 0, TrieGetSize(t)); ok = false;
2014-05-03 18:09:31 +04:00
}
2014-05-04 01:21:56 +04:00
TrieDestroy(t);
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
if (ok)
pass("Cell tests");
else
fail("Cell tests");
t = TrieCreate();
if (t == oldhandle)
pass("Recycle handles");
else
fail("Recycle handles");
ok = true;
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
for (new i = 0; i < 100; i++)
{
static val[32];
formatex(key, charsmax(key), "K%dK", i);
formatex(val, charsmax(val), "V%dV", i);
TrieSetString(t, key, val);
}
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
for (new i = 0; i < 100; i++)
{
formatex(key, charsmax(key), "K%dK", i);
static val[32];
static exp[32];
formatex(exp, charsmax(exp), "V%dV", i);
new size;
2014-05-04 01:21:56 +04:00
if (!TrieGetString(t, key, val, charsmax(val), size))
2008-04-14 23:52:11 +04:00
{
server_print("TrieGetString(%d, '%s', %s) failed", t, key, val);
ok = false;
}
else if (!equal(val, exp))
{
server_print("val mismatch, key: '%s' expected: '%s' got: '%s'", key, exp, val);
ok = false;
}
if (size != strlen(exp))
{
server_print("returned size mismatch, key: '%s' expected: '%s' got: '%s'", key, strlen(exp), size);
ok = false;
}
}
2014-05-04 01:21:56 +04:00
if (TrieGetCell(t, "K42K", value) ||
TrieGetArray(t, "K42K", array, sizeof(array)))
{
server_print("entry K42K should not be an array or string"); ok = false;
2008-04-14 23:52:11 +04:00
}
2014-05-04 01:21:56 +04:00
if (TrieGetString(t, "cat", string, charsmax(string)))
{
server_print("trie should not have a cat."); ok = false;
}
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
if (ok)
pass("String tests");
else
fail("String tests");
2014-05-04 01:21:56 +04:00
ok = true;
2008-04-14 23:52:11 +04:00
new data[5] = { 93, 1, 2, 3, 4 };
2014-05-04 01:21:56 +04:00
if (!TrieSetArray(t, "K42K", data, sizeof data))
{
server_print("K42K should be a string."); ok = false;
}
if (!TrieGetArray(t, "K42K", array, sizeof(array)))
{
server_print("K42K should be V42V."); ok = false;
}
2014-05-04 01:21:56 +04:00
for (new i = 0; i < sizeof data; i++)
{
if (data[i] != array[i])
{
server_print("K42K slot %d should be %d, got %d", i, data[i], array[i]); ok = false;
}
}
if (TrieGetCell(t, "K42K", value) ||
TrieGetString(t, "K42K", string, charsmax(string)))
{
server_print("entry K42K should not be an array or string"); ok = false;
2014-05-04 01:21:56 +04:00
}
if (!TrieSetArray(t, "K42K", data, 1))
{
server_print("couldn't set K42K to 1-entry array"); ok = false;
}
if (!TrieGetArray(t, "K42K", array, sizeof(array), value))
{
server_print("couldn't fetch 1-entry array"); ok = false;
}
if (value != 1)
{
server_print("array size mismatch (%d, expected %d)", value, 1); ok = false;
}
2014-05-04 01:21:56 +04:00
if (ok)
pass("Array tests");
else
fail("Array tests");
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
ok = true;
2014-05-04 01:21:56 +04:00
// Remove "K42K".
if (!TrieDeleteKey(t, "K42K"))
{
server_print("K42K should have been removed"); ok = false;
}
if (TrieDeleteKey(t, "K42K"))
{
server_print("K42K should not exist"); ok =false;
}
if (TrieGetCell(t, "K42K", value) ||
TrieGetArray(t, "K42K", array, sizeof(array)) ||
TrieGetString(t, "K42K", string, charsmax(string)))
{
server_print("map should not have a K42K"); ok = false;
}
2014-05-04 01:21:56 +04:00
TrieDestroy(t);
2014-05-04 01:21:56 +04:00
t = TrieCreate();
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
for (new i = 0; i < 1000; i++)
{
formatex(key, charsmax(key), "!%d!", i);
TrieSetString(t, key, key);
}
for (new i = 0; i < 1000; i++)
{
formatex(key, charsmax(key), "!%d!", i);
if (!TrieKeyExists(t, key))
{
server_print("Key '%s' does not exist", key); ok = false;
2008-04-14 23:52:11 +04:00
}
else if (!TrieDeleteKey(t, key))
2008-04-14 23:52:11 +04:00
{
server_print("Key '%s' could not be deleted", key); ok = false;
2008-04-14 23:52:11 +04:00
}
}
2014-05-04 01:21:56 +04:00
2008-04-14 23:52:11 +04:00
if (ok)
pass("Exists/Delete");
else
fail("Exists/Delete");
2014-05-04 01:21:56 +04:00
ok = true;
2008-04-14 23:52:11 +04:00
TrieClear(t);
2014-05-04 01:21:56 +04:00
if (TrieGetSize(t))
{
server_print("size should be 0"); ok = false
}
TrieSetString(t, "adventure", "time!");
TrieSetString(t, "butterflies", "bees");
TrieSetString(t, "egg", "egg");
new Snapshot:keys = TrieSnapshotCreate(t);
{
if (TrieSnapshotLength(keys) != 3)
{
server_print("trie snapshot length should be 3"); ok = false;
}
new bool:found[3], len = TrieSnapshotLength(keys);
new buffer[32];
for (new i = 0; i < len; i++)
{
new size = TrieSnapshotKeyBufferSize(keys, i); // Just to use it, otherwise you should use charsmax(buffer).
TrieSnapshotGetKey(keys, i, buffer, size);
if (strcmp(buffer, "adventure") == 0) found[0] = true;
else if (strcmp(buffer, "butterflies") == 0) found[1] = true;
else if (strcmp(buffer, "egg") == 0) found[2] = true;
else { server_print("unexpected key: %s", buffer); ok = false; }
}
2014-05-04 01:21:56 +04:00
if (!found[0] || !found[1] || !found[2])
{
server_print("did not find all keys"); ok = false;
}
}
TrieSnapshotDestroy(keys);
2008-04-14 23:52:11 +04:00
TrieDestroy(t);
2014-05-04 01:21:56 +04:00
if (ok)
pass("Snapshot");
else
fail("Snapshot");
2014-05-03 18:09:31 +04:00
ok = true;
t = TrieCreate();
TrieSetString(t, "full", "throttle");
TrieSetString(t, "brutal", "legend");
TrieSetString(t, "broken", "age");
new TrieIter:iter = TrieIterCreate(t);
{
if (TrieIterGetSize(iter) != 3)
{
server_print("Trie iterator size should be 3, is %d", TrieIterGetSize(iter));
ok = false;
}
if (TrieIterEnded(iter))
{
server_print("Trie iterator should have a next key/value pair at this point");
ok = false;
}
new key[32], value[32], bool:valid[4], klen, vlen;
if (!TrieIterGetKey(iter, key, charsmax(key)))
{
server_print("Trie iterator should not be empty at this point (no key retrieval)");
ok = false;
}
else
{
while (!TrieIterEnded(iter))
{
klen = TrieIterGetKey(iter, key, charsmax(key));
TrieIterGetString(iter, value, charsmax(value), vlen);
if (strcmp(key, "full") == 0 && strcmp(value, "throttle") == 0)
valid[0] = true;
else if (strcmp(key, "brutal") == 0 && strcmp(value, "legend") == 0)
valid[1] = true;
else if (strcmp(key, "broken") == 0 && strcmp(value, "age") == 0)
valid[2] = true;
if (strlen(key) != klen)
{
server_print("Key string length does not match. %d != %d", strlen(key), klen);
ok = false;
}
if (strlen(value) != vlen)
{
server_print("Value string length does not match. %d != %d", strlen(key), vlen);
ok = false;
}
// Should thrown an error
// TrieSetString(t, "monkey", "island");
// TrieDeleteKey(t, "full");
// TrieClear(t);
TrieIterNext(iter);
}
if (!valid[0] || !valid[1] || !valid[2])
{
server_print("Did not find all value pairs (1)");
ok = false;
}
}
TrieIterDestroy(iter);
if (iter)
{
server_print("Iterator handle should be null after being destroyed: %d", iter);
ok = false;
}
iter = TrieIterCreate(t);
{
TrieSetString(t, "full", "speed");
TrieSetString(t, "brutal", "uppercut");
TrieSetString(t, "broken", "sword");
arrayset(valid, false, sizeof(valid));
for (; !TrieIterEnded(iter); TrieIterNext(iter))
{
if (TrieIterGetCell(iter, value[0]) || TrieIterGetArray(iter, array, sizeof(array)))
{
server_print("Entries should not be an array or string");
ok = false;
}
else
{
TrieIterGetKey(iter, key, charsmax(key));
TrieIterGetString(iter, value, charsmax(value));
if (strcmp(key, "full") == 0)
TrieSetString(t, "full", "speed");
else if (strcmp(key, "brutal") == 0)
TrieSetString(t, "brutal", "uppercut");
else if (strcmp(key, "broken") == 0)
TrieSetString(t, "broken", "sword");
}
}
if (TrieGetString(t, "full", value, charsmax(value)) && strcmp(value, "speed") == 0)
valid[0] = true;
if (TrieGetString(t, "brutal", value, charsmax(value)) && strcmp(value, "uppercut") == 0)
valid[1] = true;
if (TrieGetString(t, "broken", value, charsmax(value)) && strcmp(value, "sword") == 0)
valid[2] = true;
if (!valid[0] || !valid[1] || !valid[2])
{
server_print("Did not set the new values (overwriting value is allowed)");
ok = false;
}
}
TrieIterDestroy(iter);
if (TrieIterDestroy(iter))
{
server_print("Iter should be null");
ok = false;
}
iter = TrieIterCreate(t);
{
TrieDestroy(t);
// Should throw an error
// TrieIterNext(iter)
}
if (!TrieIterDestroy(iter))
{
server_print("Iter should be valid");
ok = false;
}
t = TrieCreate();
TrieSetCell(t, "key_1", cellmin);
TrieSetArray(t, "key_2", data, sizeof data);
iter = TrieIterCreate(t);
if (TrieIterEnded(iter))
{
server_print("Iter should not be ended: %d", iter);
ok = false;
}
for (; !TrieIterEnded(iter); TrieIterNext(iter))
{
TrieIterGetKey(iter, key, charsmax(key));
if (strcmp(key, "key_1") == 0)
{
new val;
if (!TrieIterGetCell(iter, val) || val != cellmin)
{
server_print("Failed to retrieve value (%d)", val)
ok = false;
}
}
else if (strcmp(key, "key_2") == 0)
{
if (!TrieIterGetArray(iter, array, sizeof(array)))
{
server_print("Failed to retrieve array")
ok = false;
}
else
{
for (new i = 0; i < sizeof data; i++)
{
if (data[i] != array[i])
{
server_print("slot %d should be %d, got %d", i, data[i], array[i]);
ok = false;
}
}
}
}
}
TrieClear(t);
TrieSetCell(t, "1", 1);
TrieSetCell(t, "2", 2);
TrieSetCell(t, "3", 3);
new totalSum = 0;
new element1, element2;
new TrieIter:iter1, TrieIter:iter2;
iter1 = TrieIterCreate(t)
for (; !TrieIterEnded(iter1); TrieIterNext(iter1))
{
iter2 = TrieIterCreate(t);
for(; !TrieIterEnded(iter2); TrieIterNext(iter2))
{
TrieIterGetCell(iter1, element1);
TrieIterGetCell(iter2, element2);
totalSum += element1 * element2;
}
TrieIterDestroy(iter2);
}
TrieIterDestroy(iter1);
if (totalSum != 36)
{
server_print("Sum should be 36, got %d", totalSum);
ok = false;
}
TrieIterDestroy(iter);
TrieDestroy(t);
}
if (ok)
pass("Iterator");
else
fail("Iterator");
2008-04-14 23:52:11 +04:00
done();
}