mirror of
https://github.com/Citadel-Station-13/Citadel-Station-13-RP.git
synced 2025-12-11 20:01:23 +00:00
5823fb93e7
* move phoronlock define * t * force rename * nuke unneeded things * don't do that * tgui sync? * changes * unit testing module * backend * tools update * aaah * go and stay go * path replace * move everything * toss out more stuff * remove * fine those can stay * dependencies.sh * ruin datum move + rename * level assets why did you guys put the turfs in my atmosphers folder grr * more moving * basemap, force stuff * fix that desync meme * move more stuff * move those too * repath * get rid of useless initializers * hacky patchy * reservations * alright * tgui * changelog example * checksum * md5 * errors * more * turf empty * stop * fix * bad kwarg * let's get those in again * alright * rid of that * huh * newlines * newlines * folder * mood * woops * readme * might as well trim now * let's go * fuck it tether isn't being used anyways lol * ok * empty files go * tether is demoted * sorry but this goes too * okay * make that work too * ok * wow. * whew * Fix * fixes * ok * sigh * fix * fix * aah. * rust_g logging * update rust g file * fix * funny * Fix * map issues * fix * initialize hints * solves some problems * those too * ok * pills * let's do that. * hit that too * runtime * add that too * alright * fix * fix * fix * Fix * add * fix * wildwest, what have they done to you... * do that too' git push * fixes * fixes * fixes * pack this tightly * let's not have empty files * sigh * fix * FUCK OFF * fix icon * rip old mapmerge * zz * woo yeah woo yeah * logging * fix * better logs * GRRRRRR * last commit?? * awful
27 lines
1.2 KiB
Plaintext
27 lines
1.2 KiB
Plaintext
/// A test to ensure the sanity of BINARY_INSERT
|
|
/datum/unit_test/binary_insert/Run()
|
|
var/list/datum/binary_insert_node/nodes = list()
|
|
|
|
var/datum/binary_insert_node/node_a = new /datum/binary_insert_node(10)
|
|
BINARY_INSERT(node_a, nodes, /datum/binary_insert_node, node_a, x, COMPARE_KEY)
|
|
TEST_ASSERT_EQUAL(nodes.len, 1, "List should have one node")
|
|
|
|
var/datum/binary_insert_node/node_b = new /datum/binary_insert_node(5)
|
|
BINARY_INSERT(node_b, nodes, /datum/binary_insert_node, node_b, x, COMPARE_KEY)
|
|
TEST_ASSERT_EQUAL(nodes.len, 2, "List should have two nodes")
|
|
TEST_ASSERT_EQUAL(nodes[1].x, 5, "The first node should be the one with 5")
|
|
TEST_ASSERT_EQUAL(nodes[2].x, 10, "The second node should be the one with 10")
|
|
|
|
var/datum/binary_insert_node/node_c = new /datum/binary_insert_node(15)
|
|
BINARY_INSERT(node_c, nodes, /datum/binary_insert_node, node_c, x, COMPARE_KEY)
|
|
TEST_ASSERT_EQUAL(nodes.len, 3, "List should have three nodes")
|
|
TEST_ASSERT_EQUAL(nodes[1].x, 5, "The first node should be the one with 5")
|
|
TEST_ASSERT_EQUAL(nodes[2].x, 10, "The second node should be the one with 10")
|
|
TEST_ASSERT_EQUAL(nodes[3].x, 15, "The third node should be the one with 15")
|
|
|
|
/datum/binary_insert_node
|
|
var/x
|
|
|
|
/datum/binary_insert_node/New(_x)
|
|
x = _x
|