1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 | #include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <assert.h>
// THIS IS AN ILLUSTRATION. THE CODE HAS NOT BEEN TESTED.
int _test_size3() {
mu_start();
//────────────────────
Frequencies freqs = { ['a'] = 4, ['b'] = 3, ['c'] = 3, ['\n'] = 2 };
Node* head = make_huffman_pq(freqs);
mu_check(((BSTNode*)(head -> value)) -> character == '\n');
mu_check(((BSTNode*)(head -> value)) -> frequency == 2);
mu_check(((BSTNode*)(head -> next -> value)) -> character == 'b');
mu_check(((BSTNode*)(head -> next -> value)) -> frequency == 3);
mu_check(((BSTNode*)(head -> next -> next -> value)) -> character == 'c');
mu_check(((BSTNode*)(head -> next -> next -> value)) -> frequency == 3);
mu_check(((BSTNode*)(head -> next -> next -> next -> value)) -> character == 'a');
mu_check(((BSTNode*)(head -> next -> next -> next -> value)) -> frequency == 4);
//────────────────────
mu_end();
}
int main(int argc, char* argv[]) {
return EXIT_SUCCESS;
}
/* vim: set tabstop=4 shiftwidth=4 fileencoding=utf-8 noexpandtab: */
|
© Copyright 2020 Alexander J. Quinn This content is protected and may not be shared, uploaded, or distributed.